code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n);
for (auto& x : a) cin >> x;
sort(a.begin(), a.end());
long seki = 1;
for (long x : a) {
if (x > 0 && seki > long(1e18) / x) {
return cout << -1 << endl, 0;
}
seki... | #include<iostream>
#include<fstream>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<vector>
#include<array>
#include<deque>
#include<list>
#include<forward_list>
#include<stack>
#include<queue>
#include<algorithm>
#include<numeric>
#include<iterator>
#include<functional>
#include<map>
#... | 1 | 14,408,642 |
#include <iostream>
#include <cstring>
using namespace std;
namespace sorting_five_numbers
{
class SortingFiveNumbers
{
private:
static const int Size = 5;
int dataList[Size];
public:
SortingFiveNumbers(int target[]) {
memset(dataList, 0, Size);
for (int i... | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | 1 | 11,464,285 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
int n,a[2000001],b[2000001],c[10001];
void sort() {
for(int i=0;i<=10000;i++)c[i]=0;
for(int j=1;j<=n;j++)c[a[j]]++;
for(int i=1;i<=10000;i++)c[i]+=c[i-1];
for(int j=n;j>0;j--){b[c[a[j]]]=a[j];c[a[j]]--;}
}
int main(void) {
cin>>n;for(in... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | 1 | 23,071,154 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
int main() {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
int main()
{
char x, y, ans = '=';
cin >> x >> y;
if ((int)x < (int)y)
ans = '<';
if ((int)x >(int) y)
ans = '>';
cout << ans << "\n";
return 0;
... | 1 | 84,247,046 |
#include <iostream>
#include <cstdio>
using namespace std;
#define OVER_SIX_DIGITS 1000000
int prime[OVER_SIX_DIGITS];
void make_prime(void) {
for(int r = 0; r < OVER_SIX_DIGITS; r++) prime[r] = 1;
prime[0] = prime[1] = 0;
for(int r = 2; r < OVER_SIX_DIGITS; r++) {
if(prime[r]) {
for(int... | #include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main(){
bool prime[1000000];
int n;
for(long int i=2;i<1000000;i++){
bool isprime=true;
for(long int j=2;j<=sqrt(i);j++){
if(i%j==0){
isprime=false;
break;
... | 1 | 96,807,729 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main()
{
string s;
cin >> s;
int w = 0;
ll ans = 0;
rep(i, s.size()) {
if(s[i] =... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s;cin >>s;
ll ans=0;
ll cnt=0;
for (int i = 0; i < s.size(); ++i) {
... | 1 | 69,584,275 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
vector <vector<int> > dp;
string x,y;
int n;
cin >> n;
for(int times=0;times<n;times++){
int ans =0;
cin >> x >> y;
dp.resize(y.size()+1);
for(int i=0;i<=y.size();i++){
dp[i].resize(... | #include<stdio.h>
#include<string.h>
int LCS(char *X, char *Y){
int i,j,m,n,c[1001][1001];
m = strlen(X);
n = strlen(Y);
for(i=0; i<m; i++){
c[i][0] = 0;
}
for(j=0; j<n; j++){
c[0][j] = 0;
}
for(i=1;i<m+1;i++){
for(j=1;j<n+1;j++){
if (X[i-1]==Y[j-1]) c[i][j]=c[i-1][j-1]+1;
else i... | 1 | 5,156,670 |
#include<iostream>
#include<queue>
using namespace std;
long powerful_discount_tickets(int n, int m, int a[]){
priority_queue<int> que;
for(int i=0;i<n;i++) {
que.push(a[i]);
}
while(m!=0) {
int price = que.top();
que.pop();
int discounted_price = price / 2;
que.push(discounted_price);
m... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
#define fi first
#define se second
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define pb push_back
#define mk make_pair
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);... | 1 | 34,712,216 |
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 1 | 14,295,398 |
#include <bits/stdc++.h>
#define __Imperial_Lord__ ONLINE_JUDGE
#define _cps CLOCKS_PER_SEC
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define rep(i, l, r) for (long long i = (l); i < (long long)(r); i++)
#define repb(i, r, l) for (long long i = (r); i > (l... | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | 1 | 44,769,127 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x[5],y[5];
cin >> x[1] >> y[1] >> x[2] >> y[2];
x[3]=x[2]+y[1]-y[2];
y[3]=y[2]+x[2]-x[1];
x[4]=x[3]+x[1]-x[2];
y[4]=y[3]+y[1]-y[2];
cout << x[3] << ' ' << y[3] << ' ' << x[4] << ' ' << y[4] << endl;
} | 1 | 82,504,649 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,D;
cin >> N >> D;
vector<vector<int>> matrix(N, vector<int>(D));
for (int i=0; i<N; i++){
for (int j=0; j<D; j++){
cin >> matrix.at(i).at(j);
}
}
int ans = 0;
int distance_squared = 0;
for (int i=0; i<N-1; i++){
for (int j... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
for (int i=0 ; i<n ; i++){
for (int j=0 ; j<d ; j++)
cin >> x.at(i).at(j);
}
int d2, ans = 0;
double d1;
for (int i=0 ; i<n-1 ; i++){
for (int j=i+... | 1 | 89,275,592 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N; cin >> N;
ll a[N];
map<ll,ll> count;
for (ll i = 0; i < N; i++) {
cin >> a[i];
count[a[i]]++;
}
vector<ll> v;
for (ll i = 0; i < N; i++) {
if (count[a[i]] >= 2) v.push_back(a[i]);
}
sort(v.begin(), v.end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
map<ll,int> m;
vector<ll> v;
rep(i,0,n){
ll a;
cin>>a;
if(m[a]==0) m[a]++;
else{
v.push_back(a);
m[a]=0;
... | 1 | 78,693,817 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b)
{
if (b == 0)
{
return a;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
int main()
{
ll N, X;
cin >> N;
vector<ll> x(N + 1);
for (ll i = 0; i < N + 1; i++)
{
cin >> x[i];
}
... | 1 | 58,601,808 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,m;
cin>>n>>m;
int ans=100*(n-m)+1900*m;
rep(i,0,m){
ans*=2;
}
cout<<ans<<endl;
} | 1 | 44,628,406 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
#define reverse(s) reverse(s.begin(),s.end())
int main(){
int n; cin >> n;
vector<int> A(n),a(n);
rep(i,n){
cin >> A[i];
a[i] = A[i];
}
... | #include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define in insert
#define ff first
#define ss second
#define int long long
#define rep(i,x,m) for(int i=x;i<m;i++)
#define MOD 1000000007
#define endl "\n"
#define all(v) ... | 1 | 71,200,296 |
#include <string>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x,y) CPP_CAT_I(x,y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x,y) x ## y
#define FOR(i, start, end) for(ll i = (start), CPP_CAT(i,xxxx_end)=(end); i < CPP_CAT(i,xx... | #include <iostream>
using namespace std;
int GCD(int a, int b) {
while (a) {
int tmp = a;
a = b % a;
b = tmp;
}
return b;
}
int main() {
int a, b, k;
cin >> a >> b >> k;
int gcd = GCD(a, b);
int cnt = 0;
for (int i = 1; i <= gcd; ++i) {
if (gcd % i) continue;
cnt++;
if (cnt == k)... | 1 | 52,897,078 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
const int maxn = 10000001;
int main(){
ios_bas... | #include <bits/stdc++.h>
#define debug(x) cerr<<#x<<'='<<x<<endl
#define set0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pii;
template<typename T> void read(T &x){
x = 0;char ch = getchar();ll f = 1;
while(!isdigit(ch)){if(ch == '-')f*=-1;ch... | 1 | 89,800,644 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int big = max(a, max(b, c));
int small = min(a, min(b, c));
int mid = a+b+c-big-small;
int b_m = big-mid;
int m_s = mid - small;
int co =0;
if(m_s%2 == 0){
co += m_s/2;
co += b_m;
}else{
co += (m_s+1)/2;
co += (b... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
int main(void){
vector<int> a(3);
rep(i, 3) cin >> a[i];
sort(a.begin(), a.end());
int ans = 0;
if(a[0] % 2 != a[1] % 2){
ans++;
a[0]++;
a[2]++;
}
ans += a[2]-a[1] + (a[1]-a[0])/2;
cout << ans << endl... | 1 | 87,704,997 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
using Graph = vector<vector<int>>;
int main(){
string S;
cin >> S;
if(S[0] == S[1] && S[0] == S[2]) cout << "Yes" << endl;
else if(S... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if(N%1111 == 0){
cout << "Yes" << endl;
}
else if((N/10)%111==0){
cout << "Yes" << endl;
}
else if((N%1000)%111==0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 1 | 83,328,651 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int count(string t,char c){
int num=0;
rep(i,t.size())
if(t[i]==c) num++;
return num;
}
int main(void){
string s; cin >> s;
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templa... | 1 | 39,795,006 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n; cin >> n;
vector<int> vec(n);
rep(i,n) {
cin >> vec.at(i);
}
vector<int> vec_2 = vec;
sort(vec_2.begin(), vec_2.end(), std::greater<int>());
rep(i, n){... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | 1 | 68,123,600 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
#include <set>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(long int i=a;i<=b;i++)
#define MOD 1e9+7
long long int n,arr[200];
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
rep(i,1,n)
cin>>arr[i];
sort(arr+1,arr+n+1);
cout<<arr[n]-arr[1];
} | 1 | 49,377,603 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
template <class T = int>T in(){
T x;
cin >> x;
return (x);
}
signed main(){
cin.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int k;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> k;
vector<ll> a(k);
for (auto& i : a) cin >> i;
reverse(a.begin(), a.end());
if (a[0] != 2) {
cout << -1;
return 0;
}
ll lb = 2, rb = 3;
... | 1 | 45,667,573 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N; i >= 0; i--)
#define PI 3.1415926535
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true;} return false;}
template<class ... | 1 | 52,958,667 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int n, a[5000], s, r;
int main() {
while (true) {
scanf("%d",&n);
if (n==0) break;
r = -1001001001;
rep(i,n) scanf("%d",&a[i]);
rep(i,n) {
s = 0;
for (int j = i; j < n; ++j) {
s += a[j];
r = max(r, s);
... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n;
while(1){
cin >> n;
if(n==0) break;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
int max = -1000000;
for(int i=0;i<n;i++){
int b = 0;
for(int j=i;j<n;j++){
b += a[j];
if(max<b) max = b;
}
}
cout << max << end... | 1 | 57,430,722 |
#include<bits/stdc++.h>
#define ll long long
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL)
using namespace std;
int main()
{
fast;
int a,b;
cin>>a>>b;
if(b==1)
cout<<"0"<<endl;
else
printf("%d\n",a-b);
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 1 | 41,350,769 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MAX = 100005;
int main() {
int n, m;
cin >> n >> m;
vector<pii> p(n), c(n);
rep(i, n) cin >> p[i].first >> p[i].second;
rep(i, m) cin >> c[i].first >> c[i].second... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<map>
using namespace std;
#define int long long
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
#define FOR(i,n) for((i)=(0);(i)<(n);(i)++)
#define RFOR(i,n) f... | 1 | 82,797,216 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll H, W;
vector<string> maze;
ll w_dist[2010][2010];
ll h_dist[2010][2010];
int main() {
cin >> H >> W;
maze.resize(... | #include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <queue>
using namespace std;
#define ll long long
#define pb push_back
#define print(x) cout<<(x)<<endl
#define prints(x, y) cout<<(x)<<" "<<(y)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
int cnt, h, w, xy... | 1 | 79,722,531 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int>vec(N);
for(int X=0;X<N;X++){
cin>>vec.at(X);
}
sort(vec.begin(), vec.end());
double M=(vec.at(0));
for(int X=1;X<N;X++){
M=(M+vec.at(X))/2;
}
cout<<M<<endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<double> v(n);
for(int i = 0; i < n; ++i) cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
for(int i = 1; i < n; ++i)
{
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
} | 1 | 33,059,979 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
vector<long long>v;
int main()
{
fastio;
long long a=0,b=0,c,d,e,f=0,l,g,m,n,k,i,j,t,p,q;
string s;
cin>>s;
n=s.size();
p=0;
for(i=n-1;i>=0;i--){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long counter;
counter=0;
long long counter2=0;
string S; cin>>S;
for(long long i=0; i<S.size();i++){
if(S.at(i)=='B'){
counter2++;}
else
counter+=counter2;}
cout<<counter<<endl;} | 1 | 51,558,937 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef long long ll;
typedef ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N,K;cin>>N>>K;
vector<int64_t>A(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
int64_t sum=0;
vector<int64_t>B(N);
for(int i=0;i<N;i++){
sum=(sum+A.at(i))%K;
B.at(i)=sum-i;
}int64_t ans=0;
for(int i=0;i<N;i++)
if(B.at(i)==1)ans++;
ma... | 1 | 64,185,954 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int X;
cin>>X;
if(X>=1200){
cout<<"ARC";
}
else{
cout<<"ABC";
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int x;
cin >> x;
cout << (x < 1200 ? "ABC" : "ARC") << endl;
} | 1 | 18,881,407 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | #include<bits/stdc++.h>
using namespace std;
#define DEBUG
#pragma GCC optimize ("Ofast")
#define sint(a) int a; qread(a);
#define sint2(a,b) int a,b; qread(a),qread(b);
#define sint3(a,b,c) int a,b,c; qread(a),qread(b),qread(c);
#define int1(a) qread(a);
#define int2(a,b) qread(a),qread(b);
#define int3(a,b,c) qread(a... | 1 | 99,218,308 |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf(... | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for(int i=a; i<b; i++)
#define mem(arr, val) memset(arr, val, sizeof(arr))
#define MOD 1000000007
#define INF 1000000001
#define epsilon 1e-15
typedef long long int ll;
typedef unsigned long long int ull;
int gcd(int a, int b){
if(b==0) return a;
... | 1 | 17,259,969 |
#include <iostream>
using namespace std;
void rotate(int*, int, int, int, int);
class Dice {
public:
int face[6];
Dice (int* f) {
for (int i=0; i<6; i++) face[i] = f[i];
}
void roll_x(bool d) {
if (d) rotate(0, 4, 5, 1);
else rotate(1, 5, 4, 0);
}
void roll_y(bool d) {
if (d) rotate(0, 2, 5, 3);
else r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9+7,MAX = 1e5;
class dice
{
int ue,mae,migi,hidari,sita,usiro;
public:
dice(int a,int b,int c,int d,int e,int f)
{
ue = a;
mae = b;
migi = c;
hidari = d;
sita = f;
usiro = e;
}
void N()
{
swap(ue,mae);
swap(mae,... | 1 | 24,467,341 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<int(n); i++)
using namespace std;
int main(){
int H, W, d; cin >> H >> W >> d;
string c = "RYGB";
if(d%2==0){
rep(i, H){
rep(j, W) cout << c[2*(((i+j)/d)%2) + ((i-j+2000*d)/d)%2];
cout << "\n";
}
}else{
rep(i, H){
rep(j, W) cout << c[(i+j)%2];
... | 1 | 9,592,745 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main(void){
int N;
cin >> N;
while(N != 0){
if(N % 10 == 7){
cout << "Yes" << endl;
return 0;
}
N /= 10;
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | 1 | 5,841,455 |
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define int long long
#define swap(x,y) (x^=y^=x^=y)
#define debug1(a) cerr<<#a<<" = "<<(a)<<endl;
#define debug2(a,b) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<endl;
#define debug3(a,b,c) cerr<<#a<<" = ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | 1 | 81,272,731 |
#include <iostream>
#define INF 1e+9
using namespace std;
int main(){
int a,b,c;
while(1){
cin >> a >> b;
if(!a) break;
int dp[17][17] = {};
for(int i = 1;i < 17;i++) for(int j = 1;j < 17;j++) dp[i][j] = INF;
cin >> c;
for(int i = 0;i < c;i++){
int d,e;
cin >> d >> e;
dp[d][e] = 0;
}
for(int ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, n;
while (cin >> a >> b, a || b){
cin >> n;
int Map[17][17] = {0}, x, y;
bool No[16][16] = {false};
for (int i = 0; i < n; i++){
cin >> x >> y;
No[y - 1][x - 1] = true;
}
Map[0][0] = 1;
for (int i = 0; i < a... | 1 | 32,925,325 |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
class BSnakeToy {
public:
void solve(std::istream& cin, std::ostream& cout) {
int N,K,L[100009];
int ans = 0;
cin >> N >> K;
... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> a(n);
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
}
std::sort(a.begin(), a.end(), std::greater<int>());
int ans = 0;
for (int i = 0; i < k;... | 1 | 69,750,756 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
int main() {
string s;
cin >> s;
if(s[0]!='A'){
cout << "WA" <<endl;
return 0;
}
int cnt = 0;
... | #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
string S;
cin >> S;
int N = S.size();
bool ok = true;
bool cflag = false;
rep(i, N) {
if (i == 0) {
if (S[i] != 'A') ok = false;
} else if (!cflag && 2 <= i && i <= N - 2 && S[i] == 'C') {... | 1 | 51,133,391 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n; cin>>n;
vector<int> dp(n + 1, n);
dp[0] = 0;
for(int i = 0; i < n; i++){
dp[i + 1] ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int I... | 1 | 91,661,252 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long l... | 1 | 90,918,627 |
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
void debug() { cerr << "\n"; }
t... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | 1 | 66,800,802 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
using lint = long int;
using llint = long long int;
using namespace std;
int main() {
fastIO;
int n;
cin >> n;
vector... | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(... | 1 | 86,870,713 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL<<60;
const double eps = 1e-9;
int main()
{
ll x, y;
cin >> x >> y;
if (x%y == 0) cout << -1 << endl;
e... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll x,y;
cin>>x>... | 1 | 21,318,106 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fi first
#define se second
#define pb push_back
#define mk make_pair
using namespace std;
typedef long long ll;
ll mod = 998244353;
int main() {
fastio;
ll n;
cin>>n;
vector<ll> a(n,0);
ll m = 0;
for(ll i=0;i<n;i++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pa... | 1 | 91,810,974 |
#include <iostream>
using namespace std;
void countingSort(int *a, int *b, int k, int n){
int *c = new int[k+1];
for(int i=0;i<k+1;++i)c[i] = 0;
for(int j=0;j<n;++j)c[a[j]]++;
for(int i=1;i<k+1;++i)c[i] += c[i-1];
for(int j=n-1;j>=0;--j){
b[c[a[j]]-1] = a[j];
c[a[j]]--;
}
}
int max(int *a, int n){
int m = 0;... | #include <iostream>
using namespace std;
int main()
{
const int MAX_VALUE = 10000;
int n;
cin >> n;
int A[n + 1], B[n + 1], C[MAX_VALUE + 1];
for (int i = 0; i <= MAX_VALUE; i++) {
C[i] = 0;
}
for (int i = 1; i <= n; i++) {
cin >> A[i];
C[A[i]]++;
}
for (int i... | 1 | 18,898,350 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#defi... | #include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x = x2-x1, y = y2-y1;
cout << x2-y << " " << y2+x << " " << x1-y << " " << y1+x <<... | 1 | 60,985,926 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ll M, K;
cin >> M >> K;
if (M == 1) {
if (K == 0) {
puts("0 0 1 1");
}
else {
puts("-1");
}
return 0;
}
if (K < (1 << M)) {
for (int i = 0; i < (1... | 1 | 99,975,566 |
#include <iostream>
int main()
{
int a, b;
std::cin >> a >> b;
int ans = a * b;
std::cout << ((ans % 2) ? "Odd" : "Even");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int amount = A * B;
if (amount % 2 == 0) {
cout << "Even" << endl;
} else {
cout << "Odd" << endl;
}
} | 1 | 67,471,714 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
using namespace std;
int main() {
int i, j, k, n, n2;
int m[100][100] = { 0 };
int list[400][400] = { 0 };
cin >> n;
for (i = 0; i<n; i++) {
cin >> n2;
cin >> ... | #include <iostream>
using namespace std;
int main() {
int num, num1, numb2, list1;
cin >> num;
int matrix[num][num] = {};
for(int i = 0; i < num; i++) {
cin >> num1 >> numb2;
for(int i = 0 ; i < numb2; i++) {
cin >> list1;
matrix[num1 - 1][list1 - 1] = 1;
... | 1 | 32,394,537 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n, m;
cin >> n >> m;
vector< vector< long long int > > rates;
long long int i;
for(i=0; i<n; i++){
long long int rate, can;
cin >> rate >> can ;
vector<long long int> shop;
shop.push_back(rate);
... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int N;
int M;
cin >> N >> M;
vector<P> ab(N);
rep(i, N) {
cin >>... | 1 | 15,724,717 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin >> n;
vector<pair<ll,int>> a(n);
rep(i,n){
cin ... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
long long a[100000];
pair <long long, i... | 1 | 33,494,487 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a, T b) {if (a < b){a = b;return true;}... | 1 | 80,588,965 |
#include <bits/stdc++.h>
#define LL long long
using namespace std;
LL ans,a,b;
int main(){
cin >> a >> b,ans = a,a -= b;
while (a && b){
if (a > b) swap(a,b);
if (b % a == 0) ans += ((b/a)*2-1) * a,b %= a;
else ans += (b/a) * a * 2,b %= a;
}
cout << ans << '\n';
return 0;
} | #ifndef KHALIL
#include <bits/stdc++.h>
#else
#include "header.h"
#endif
#define endl '\n'
#define mp make_pair
#define tostr(x) static_cast<ostringstream&>((ostringstream()<<dec<<x)).str()
#define rep(i,begin,end) for(auto i = begin;i < end;i++)
#define repr(i,begin,end) for(auto i = begin-1;i >= end;i--)
#define pb p... | 1 | 45,174,254 |
#include <iostream>
#include <iomanip>
#include <cmath>
using std::string;
using std::cin;
using std::cout;
using std::endl;
using std::setprecision;
using std::sin;
using std::cos;
using std::fixed;
#define PI 3.141592653589793
int main(void){
double a,b,c;
cin >> a >> b >> c;
double k;
double S,L,h;
double ... | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main()
{
double a, b, c;
cin >> a >> b >> c;
double h = b *sin((c * M_PI )/ 180);
cout << fixed << (a * h) / 2 << endl;
cout << a + b + sqrt(a * a + b * b - 2 * a * b * cos((c * M_PI)/180)) << endl;
cout << h << endl;
... | 1 | 64,393,553 |
#include <bits/stdc++.h>
using namespace std ;
int main(){
long long int N;
cin >> N;
if(N%2==1){
cout << 0 << endl;
return 0;
}
long long int i=1;
long long int count=0;
while(1){
long long int a=2*(pow(5,i));
if(a<=N){
count += N/a;
}else... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
templat... | 1 | 80,821,864 |
#include<bits/stdc++.h>
using namespace std;
bool isodd8(int n){
if(n%2==0)return 0;
int sum=0;
for(int i=1;i*i<=n;i++)
if(n%i==0){
if(i*i==n)sum++;
else sum+=2;
}
return sum==8;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
if(n<105)cout<<0;
else{
int ans=1;
for(int i=106... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int ans = 0;
int... | 1 | 30,643,430 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
int main() {
long long n, k, ret = 0;
std::cin >> n >> k;
std::vector<long long> a(n);
std::multiset<long long, std::greater<>> ms;
std::map<long long, bool> m;
for (auto i = 0ll; i < n; i... | 1 | 39,709,283 |
#include<bits/stdc++.h>
#define REP(i,n) for(long long i=0;i<n;++i)
#define FOR(i,a,b) for(long long i=a;i<b;++i)
using namespace std;
const int INF=1<<30;
int n,graph[101][101],v[101];
void bfs(int s){
queue< int > q;
fill(v,v+101,INF);
q.push(s);
v[s]=0;
while(!q.empty()){
int p=q.front();... | #include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
vector<int> G[101];
bool visit[101];
int n, u, k, m;
int dist[101];
void bfs()
{
int root = 1;
queue<int> que;
que.push(root);
dist[root] = 0;
visit[root] = true;
while (!que.empty())
{
int node = que.front();
que.pop();
for (int i ... | 1 | 9,876,436 |
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf emplace_front
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pii pair<int,int>
#define psi pair<string,int>
#define vi vector<int>
#define vpii vector<pii>
#de... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,c,d;
cin>>a>>b>>c>>d;
long long int maxi;
long long int maxi1,maxi2;
maxi1=max(a*c,a*d);
maxi2=max(b*c,b*d);
maxi=max(maxi1,maxi2);
cout<<maxi;
} | 1 | 18,746,387 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int n,i,j,k,l=0;
string s1,s2;
cin>>s1;
cin>>s2;
if(s1[0]==s2[0]) l++;
if(s1[1]==s2[1]) l++;
if(s1[2]==s2[2]) l++;
cout<<l;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,s1;
cin>>s>>s1;
int count=0;
for(int i=0;i<3;i++){
if(s[i]==s1[i])
count++;
}
cout<<count;
return 0;
} | 1 | 92,996,013 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(), a.end());
cout << a[n/2] - a[n/2-1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> d(N);
for(int i=0;i<N;i++){
cin>>d[i];
}
sort(d.begin(),d.end());
if(d[N/2]==d[N/2-1]){
cout<<0<<endl;
}
else{
cout<<d[N/2]-d[N/2-1]<<endl;
}
} | 1 | 56,404,418 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
char c[1200];
fgets(c,1200,stdin);
for (int i = 0;i<1200;i++){
if (c[i] == '\n') break;
if (islower(c[i])) c[i] = toupper(c[i]);
else if (isupper(c[i])) c[i] = tolower(c[i]);
printf("%c",c[i]);
}
printf("\n");
return 0;
} | 1 | 59,389,957 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
constexpr auto INF =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
vector<string> s(N);
vector<int> t(N);
for (int i=0; i<N; i++){
cin>>s[i];
cin >> t[i];
}
string X;
cin >> X;
bool flag = false;
int sum = 0;
for (int i=0; i<N; i++){
if (flag) sum += t[i];
if (s[i] == ... | 1 | 12,506,794 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, h, w;
cin >> n >> h >> w;
vector<int> a(n), b(n);
for(int i = 0; i < n; i++) cin >> a[i] >> b[i];
int ans = 0;
for(int i = 0; i < n; i++){
if(a[i] >= h && b[i] >= w) ans++;
}
cout << ans << endl;
re... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " \n"[i == n-1]... | 1 | 82,229,958 |
#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=a;i<=b;++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tii tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#def... | #include <bits/stdc++.h>
#define MAXN 100100
#define pii pair<int, int>
#define pb push_back
typedef long long ll;
using namespace std;
int n ,X, Y;
string s;
vector<int> x, y;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s >> X >> Y;
n = s.size();
bool b = true;
int c = 0;
... | 1 | 36,602,916 |
#include <iostream>
#include <string>
using namespace std;
int main(void)
{
int m,h,i;
string str;
cin >> str;
while(str != "-") {
cin >> m;
for(i=0;i<m;i++) {
cin >> h;
string left = str.substr(0,h);
str.erase(0,h);
str+=left;
}
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string s;
while (cin >> s){
if (s == "-") break;
long n;
n = s.size();
string t(n, '-');
long m;
cin >> m;
long cnt = 0;
long hm = 0;
for (long i = 0; i < m; i++){
cin >> hm;
cnt += hm;
}
cnt = cnt % n... | 1 | 70,341,960 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) r... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 1 | 836,567 |
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
char x, y;
cin >> x >> y;
cout << (x == y ? '=' : x < y ? '<' : '>') << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
char x,y;
cin>>x>>y;
if((int)(x)==(int)(y)) cout<<"=";
else if((int)(x)>(int)(y)) cout<<">";
else cout<<"<";
return 0;
} | 1 | 52,058,948 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int _a = 0, b_ = 0, b_a = 0;
int ans = 0;
for(int i=0; i<n; i++){
string s; cin >> s;
for(int j=1; j<s.size(); j++)
if(s[j-1]=='A' && s[j]=='B') ans++;
if(s[0]=='B' && s[s.size()-1]=='A') b_a++;
else if(s[0]=='B... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
const int MOD=1e9+7;
const int INF=1e15;
signed main(){
int N;cin>>N;
... | 1 | 52,759,485 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
string S;
string T;
cin >> S >> T;
vector<string> ress = {};
bool flg = false;
for (int i = 0; i < S.size(); i++) {
if (i + T.size() > S.size()) break;
... | 1 | 33,317,944 |
#include <bits/stdc++.h>
using namespace std;
#define el '\n'
#define pb push_back
#define sp ' '
#define all(x) (x).begin(), (x).end()
#define mset(x, y) memset(x, y, sizeof(x))
#define ff first
#define ss second
#ifndef ONLINE_JUDGE
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typen... | #include<bits/stdc++.h>
using namespace std;
int main(){
int t,n;
cin>>n>>t;
if(n==t){
for(int i=0;i<n;i++){
cout<<n;
}
}
else if(n>t){
for(int i=0;i<n;i++){
cout<<t;
}
}
else{
for(int i=0;i<t;i++){
cout... | 1 | 38,013,837 |
#include <iostream>
using namespace std;
int main(void){
int x,y;
for(int i=1;i<3000; i++){
cin >> x >> y;
if(x > y){
swap(x,y);
}
if(x==0&&y==0){break;}
cout<<x<<" "<<y<<endl;
}
return 0;
} | #include<stdio.h>
using namespace std;
int x,y,z = 0;
int main() {
scanf("%d %d", &x, &y);
while (1) {
if (x == 0 && y == 0) {
break;
}
if (x > y) {
z = x;
x = y;
y = z;
}
printf("%d %d\n", x, y);
scanf("%d %d", &x, &y);
}
} | 1 | 32,466,402 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll N, K;
cin >> N >> K;
vector<ll> num(100001, 0);
for (int i = 0; i < N; i++){
ll a, b;
cin >> a >> b;
num.at(a) += b;
}
ll pos = 0, ans = 0;
while (pos < K){
pos += num.at(ans);
ans++;
}
cout << a... | #include<bits/stdc++.h>
#define int long long
#define vi vector<int>
#define pb push_back
#define log(x,b) (log(b)/log(x))
#define rep(i,x,y) for(int i=(x);i<(y);i++)
using namespace std;
const int mod=1e9+7;
int32_t main()
{
int n,k;
cin>>n>>k;
map<int,int>mp;
rep(i,0,n){
int a,b;
cin>>... | 1 | 70,425,917 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
ll sol(ll n) {
if (n == 1) return 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,n;
cin>>h>>n;
vector<int> a(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
int sum=0;
for(int i=0;i<n;i++){
sum=sum+a.at(i);
}
if(sum>=h){
cout<<"Yes";
}else{
cout<<"No";
}
} | 1 | 98,411,121 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> PII;
#define int long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rrep(i, n) for (int i = (n); i >= 0... | 1 | 42,246,362 |
#include <iostream>
using namespace std;
int sum_of_2_integers(int n) {
int a,b;
int count = 0;
for (a=0; a < 10; a++) {
b = n - a;
if (b < 0) break;
if (b <= 9) count++;
}
return count;
}
int sum_of_4_integers(int n) {
int ... | #include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
int x;
int i;
int a, b, c, d;
while (scanf("%d", &x) != EOF) {
i = 0;
a = 9;
b = 9;
c = 9;
d = 9;
for (a = 9; a >= 0;a--) {
for (b = 9;b >= 0; b--) {
for (c =... | 1 | 13,656,156 |
#include <bits/stdc++.h>
#include <algorithm>
#include <unordered_set>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<ll> d(N + 1);
ll m = 1;
ll numberOfLeafNodes = 0;
for (int i = 0; i <= N; i++) {
cin >> d[i];
numberOfLeafN... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
long long longpow(long long n, long long a, long long mod) {
if (a == 0) return 1;
if (a == 1) return n % mod;
if (a % ... | 1 | 35,414,681 |
#include <stdio.h>
#include <string.h>
int n, r[128], t[13]; bool used[22370000]; char com[8], s[14];
int main() {
scanf("%d", &n); r[65] = 1, r[67] = 2, r[71] = 3;
for(int i = 2; i < 12; i++) t[i] = t[i - 1] + (1 << (2 * i - 2));
for(int i = 0; i < n; i++) {
scanf("%s %s", com, s);
int h = 0, l = strlen(s);
f... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#include<list>
#include<set>
#define REP(i,n) for(int (i) = 0;(i) < (n);(i)++)
using namespace std;
int main(){
string str;
set<string> st;
int n;
cin >> n;
REP(i,n){
cin >> str;
if(str == "insert") {
ci... | 1 | 7,663,697 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | 1 | 76,030,960 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
ll int Dis(ll int n,ll int *dp)
{
if(n==0)
return 1;
if(n==1||n==2)
return 0;
ll int sum=0;
if(dp[n]!=-1)
return dp[n]%mod;
for(ll int i=3;i<=n;i++)
sum = (sum%mod + Dis(n-i,dp)%mod + mod)%mod;
return... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define repab(i,a,b) for(int i=a;i<=b;i++)
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define printarr(v) for(auto x:v){cout<<x<<... | 1 | 76,583,764 |
#include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 1 | 86,165,251 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,i,j,k,l,a,b,c,d;
cin>>a>>b;
c=0;
k=a;
while(k<=b)
{
c++;
k*=2;
}
cout<<c<<endl;
} | #include<iostream>
using namespace std;
int main(void){
long long x,y;
cin>>x>>y;
int cnt(1);
while(x*2<=y){
x *= 2;
cnt++;
}
cout<<cnt<<endl;
return 0;
} | 1 | 77,010,174 |
#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(ll int i=a;i<=b;++i)
#define rep(i,n) for(ll int i=0;i<n;i++)
#define rep3(i,a,b) for(int i=a;i>=b;i--)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
ll int MOD=1e9+7;
int INF=1e6;
ll int MAX_N=1e18;
using namespace std;
string alphabet("a... | #include <bits/stdc++.h>
#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair
using namespace std;
typedef long long ll;
const ll mod = (ll)1e9 + 7;
const ll N = (ll)1e5 + 7;
ll n;
ll d;
ll a[N],u[N];
ll fac[N];
ll bp (ll b,ll l) {
ll res = 1;
while (l) {
... | 1 | 58,151,917 |
#include <iostream>
using namespace std;
int main(){
int H, W;
while (cin >> H >> W) {
if(H == 0 && W == 0){
break;
}
else{
for(int i = 0; i < W; i++){
cout << "#";
}
cout << endl;
for(int j = 0; j < H-2; j++){
cout << "#";
for(int i=0... | #include <iostream>
using namespace std;
int main(void) {
int H, W;
while(cin >> H >> W && H && W) {
for(int i = 0; i < H; i++) {
for(int j = 0; j < W && (i == 0 || i == H - 1); j++) {
cout << "#";
}
for(int k = 0; k < 1 && (i && i != H - 1); k++) {
cout << "#";
}
f... | 1 | 12,232,835 |
#include <bits/stdc++.h>
#include <string.h>
#define ll long long
using namespace std;
struct value
{
ll x;
ll y;
};
bool compare(value a, value b)
{
if (a.y < b.y)
return 1;
else
return 0;
}
ll sum(ll n)
{
ll c;
ll sum1=0;
while(n>0)
{
c=n%10;
sum1=sum1+c;
n=n/10;
} return sum1;
}
ll minm(ll arr[],l... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,K;
cin >> A >> B >> C >> K;
if(A>K){
cout << K <<endl;
return 0;
}
else if(K>=A && B>K-A){
cout << A <<endl;
return 0;
}
else if(K>=A+B && C>K-A-B){
cout << A-(K-A-B) << endl;
return 0;
}
else{
cout << A-C << endl;
}
} | 1 | 30,442,706 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
float s,t,v;
cin>>s>>t>>v;
if((s/v)<=t)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
} | #include <iostream>
using namespace std;
int main() {
int d, t, s;
cin >> d >> t >> s;
double time = (double)d / s;
if (t >= time) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 1 | 56,586,172 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fa... | 1 | 30,342,202 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define itn int
#define rep(i,n) for(int i = 0;i < n;i++)
const int INF = 1 << 29;
int main(void){
int n;
cin >> n;
vector<ll> v;
v.push_back(1);
for(int i = 9;i <= n;i *= 9)v.push_back(i);
for(int i = 6;i <= n;i *= 6)v.push_back... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
ll pow(int x, int n){
if(n==0)return 1;
else return x * pow(x, n-1);
}
int main(){
int N;
cin >> N;
vector<ll> dp(N+1, INF);
dp.at(0) = 0;
for(int i=0; i<N; i++){
dp.at(i+1) = min(dp.at(i+1), dp.a... | 1 | 55,509,714 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll a, ll b){
if(a>b)swap(a,b);
if(b%a==0)return b+b-a;
ll trt = b/a;
return 2*a*trt+f(b%a,a);
}
int main(){
ll n,x;
cin>>n>>x;
cout<<n+f(n-x,x)<<endl;
return 0;
} | #include <iostream>
#define llint long long
using namespace std;
llint n, x;
llint ans;
llint calc(llint a, llint b)
{
if(a < b){
return calc(b, a);
}
if(b == 0) return a;
ans += a/b*b*2;
return calc(b, a%b);
}
int main(void)
{
cin >> n >> x;
ans += n;
ans -= calc(x, n-x);
cout << ans << endl;
return 0;
} | 1 | 36,516,809 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_bas... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | 1 | 91,031,297 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; cin >> N >> K; double ans = 0.0;
for (int i = 1; i < N + 1; i++) {
int tmp = i; int count = 0;
while (true) {
if (K <= tmp) break;
tmp *= 2; count++;
}
int denominator = N * int(pow(2, count));
ans += 1.0 / double(d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
constexpr ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#... | 1 | 63,601,020 |
#include<bits/stdc++.h>
using namespace std;
int arr[1000001];
vector<int> vis(1000001,0);
int main(){
int n;
cin>>n;
int mx=0;
for(int i=0;i<n;i++){
cin>>arr[i];
mx=max(mx,arr[i]);
}
bool flag=false;
for(int i=0;i<n;i++){
int m=arr[i];
for(int j=1;j<=sqrt(m);j++){
if(m%j... | #include <iostream>
#include <vector>
using namespace std;
const int A = 1000005;
int gcd(int x, int y){
int r;
if(x<y) swap(x,y);
while(y>0){
r = x % y;
x = y;
y = r;
}
return x;
}
int main(void){
int n;
cin >> n;
vector<int> a(n);
vector<int> c(A);
for(i... | 1 | 7,710,510 |
#include<bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define READ freopen("in.txt","r",stdin)
#define WRITE freopen("out.txt","w",stdout);
#define pb push_back
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define sf(x) scanf("%d",&x)
#define sf2(x,y) scanf(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll dp[100100][2];
int main()
{
string L;
cin >> L;
int N=L.size();
dp[0][0]=1;
for(int i=0;i<N;i++){
if(L[i]=='1'){
dp[i+1][0]+=dp[i][0]*2;
... | 1 | 85,092,011 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include<bits/stdc++.h>
#define ll long long int
#define FOR(i,N) for(i=0;i<(N);i++)
#define FORe(i,N) for(i=1;i<=(N);i++)
#define FORr(i,a,b) for(i=(a);i<(b);i++)
#define ii pair<ll,ll>
#define vi vector<ll>
#define vii vector<ii>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define ... | 1 | 3,095,678 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N;int M;cin>>N>>M;
int sum=0;
rep(i,M){
in... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
vector<int> a(m);
int sum = 0;
for(int i = 0; i < m; i++){
cin >> a[i];
sum += a[i];
}
if(sum <= n) cout << n - sum << endl;
else cout << -1 << endl;
} | 1 | 76,379,902 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<int(n); i++)
using namespace std;
const int N=1e5+5;
int A[N],B[N];
bool used[N];
int main() {
int n;
cin >> n;
REP(i,n) cin >> A[i] >> B[i];
vector<array<int,2>> a,b;
REP(i,n) {
a.push_back({A[i]+B[i],i});
b.push_back({B[i]+A[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<P> A(n);
ll aoki_sum = 0;
ll takahashi_sum ... | 1 | 16,429,559 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.