code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#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 a,b;
cin >> a >> b;
if(a==1) a=14;
if(b==1) b=14;
if(a>b) cout << "Alice" << endl;
else if(a==b) cout << "Draw" << endl;
else cout << "Bob" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(X) debug_func(X, #X)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout<<"=================\n"
#else
#define DEBUG(X) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_LINE 0
#endif
#define ALL(V) (V).begin(), (... | 0 | 12,573,415 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
vector<vector<char>> vec(H,vector<char> (W));
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cin >> vec.at(i).at(j);
}
}
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cout << vec.at(i).at(j);
}
cout... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
long long H, W;
cin >> H >> W;
if (H % 3 == 0 || W % 3 == 0) {
cout << 0 << endl;
ret... | 0 | 89,662,348 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1), p(n + 1);
for (int i = 1; i <= n; i++) {
a[i] = 30000 * i;
int x;
cin >> x;
p[x] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | 0 | 20,728,803 |
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <numeric>
using namespace std;
int main()
{
char ch[1200];
memset(ch, 0, sizeof(ch));
string st;
getline(cin, ... | #include <bits/stdc++.h>
#define SIZE 10
#define PI 3.141592653589793
using namespace std;
typedef long long ll;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int i,j;
int tmp;
int counter=0;
double N;
double answer=0;
vector<int> given;
cin >> N;
answer=(N/3)*(N/3)*(N/3);
cout << std::fixed << st... | 0 | 69,279,691 |
#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(){
ll n;cin >>n;
ll ans=0;
for (int i = 0; i < n; ++i) {
ll l,r;cin >>l>>... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 | 78,744,820 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 10001;
vector<int> G[maxn], ans;
int indegree[maxn], vis[maxn];
int n, e;
void BFS(int s)
{
queue<int> Q;
Q.push(s);
vis[s] = 1;
while(!Q.empty())
{
int top = Q.front();
ans.... | #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, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
l... | 0 | 45,450,335 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int k, n;
cin >> k >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
int maxLength = k - a.at(n - 1) + a.at(0);
f... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll p = 2; p * p <= n; p++) {
if (n % p != 0) co... | 0 | 40,620,110 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n >> s;
if (s.size() % 2 == 0 && s.substr(0, n / 2) == s.substr(n / 2, n / 2)) {
cout << "Yes" << endl;
} else {
cout ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll H, W;
cin >> H >> W;
vector<string> ... | 0 | 16,110,812 |
#include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
char c;
cin >> c;
if(c == 'A') cout << 'T' << endl;
else if(c == 'T') cout << 'A' << endl;
... | #include<iostream>
using namespace std;
int main(){
int n,m,p;
while(cin>>n>>m>>p){
if(n==0)break;
double G=0;
int num[n];
for(int i=0;i<n;i++){
cin>>num[i];
G+=num[i];
}
G*=(100.0-p);
if(num[m-1]!=0){
cout << (int)(G/num[m-1]) << endl;
}else{
cout << 0 << end... | 0 | 8,195,003 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
cin >> s;
long long a, b, k, l;
a = ceil(sqrt(s));
b = ceil(sqrt(s));
long long xy = (a * b) - s;
l = b - 1;
k = xy;
cout << 0 <<" "<< b <<" "<< k <<" "<< 0 << " " << a << " " << l;
} | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | 0 | 59,995,543 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <map>
#define ll long long
using namespace std;
int main(void){
ll n, a, b;
cin >> n >> a >> b;
ll check = b-a-1;
if(check%2==0)
cout << "Borys" << endl;
else
cout ... | #include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | 0 | 45,690,987 |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 8;
int n , a[N] , l = -1 , r , mid , v , q;
pair<int, int> k , z;
set<pair<int , int> > s;
bool is_val(int x)
{
s.clear();
s.insert({0 , 0});
for(int i = 1 ; i < n ; i++)
{
k = *s.rbegin();
if(a[i] > a[i - 1])
{
if(k.second != 0)
s.insert... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector <string> vs;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef pair<int,int> pi;
#define int ll
#define fo... | 0 | 47,794,661 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int gcd(int p, int q) {
if (p % q == 0) return q;
return gcd(q, p % q... | #include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<utility>
#include<cstdio>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include <bitset>
using namespace std;
const int mod=1e9+7;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,x,n) for (int i= x;i<n;... | 0 | 88,133,760 |
#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(long long n, long long root) {
for (long long i = 2; i <= root; i++) {
if (n % i == 0)
return false;
}
return true;
}
int nDigits(long long n) {
int digits = 0;
while (n > 0) {
digits++;
n /= 10;
}
return digits;
}
in... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int w, h, n;
cin >> w >> h >> n;
int t = h, b = 0, l = 0, r = w;
for (int i = 0; i < n; ++i) {
int x, y, a;
cin >> x >> y >> a;
switch (a) {
case 1:
l = max(l, x);
break;
case 2:
... | 0 | 78,806,401 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i ... | #include <iostream>
#include<vector>
#include<algorithm>
#define ll long long
#define rep(n) for(int i=0;i<n;++i)
using namespace std;
int main(void){
int n, max1=-1,max2=-1;
cin>>n;
vector<int> vec(n+1), vec2(n);
rep(n){
cin>>vec[i];
if(vec[i]>max1){
max2= max1;
max1=vec[i];
}else{
... | 0 | 45,942,283 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define print(x) cout << (x) << endl;
typedef long long ll;
const ll INF = 99999999999999;
const ll MOD = 1000000007;
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << (a - 1) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define endl "\n"
const int mod = 1e9+7;
inline int add(int a, int b) { int res = a + b; if(res >= mod) res -= mod; return res; }
inline int sub(int a, int b) { int res = a - b; if(res < 0) res += mod; re... | 0 | 59,016,337 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n), b(n);
ll sum = 0, keep = 1e9;
for (int i = 0; i < n; i++) {
cin >> a.at(i) >> b.at(i);
sum += a.at(i);
if (a.at(i) > b.at(i)) keep = min(k... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 86,574,363 |
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int main(void) {
priority_queue<int> que;
for(int r = 0; r < 10; r++) {
int input; cin >> input;
que.push(input);
}
for(int r = 0; r < 3; r++) {
cout << que.top() << endl; que.pop();
}
return(0);
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n,a,b;
ci... | 0 | 99,839,740 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using PI = pair<int, int>;
int main() {
int n, a, b;
a = b = 0;
cin >> n;
for (int i = 0; i < n; i++) {
string s, t;
cin >> s >> t;
int ss, ts;
ss = s.size(); ts = t.size();
if (s == t) {
a++; b++;
continue;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int mod=1000000007;
const double PI = 3.14159265359;
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define INF 1000000000000
#define pb push_back
#define pf push_front
#define... | 0 | 36,874,867 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr ll MOD = 1000000007;
constexpr ll... | #include<bits/stdc++.h>
using namespace std;
#define Pi acos(-1)
#define _terminated return 0
#define endl "\n"
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define booster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef vecto... | 0 | 78,138,951 |
#include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<ll,ll> P;
const ll MOD=1234567;
const ll INF=1000000010;
const ll LINF=1000000000000000010LL;
const int MAX=10000010;
const double EPS=1e-3;
int dx[4]={0,1,0,1};
int dy[4]={0,0,1,1};
ll fact(int n)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<long long> ret;
void divisor(long long n) {
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i... | 0 | 75,671,664 |
#include <bits/stdc++.h>
using namespace std;
vector<long> V;
void dfs(long n) {
if (n > 3234566667) return;
V.push_back(n);
int mi = max(0L, n % 10 - 1);
int mx = min(9L, n % 10 + 1);
for (long i = mi; i <= mx; i++) dfs(n * 10 + i);
}
int main() {
int K;
cin >> K;
for (int i = 1; i <= 9; i++) dfs(i);
... | #include <iostream>
#include <algorithm>
#include <vector>
int main()
{
int n;
while(true){
std::cin >> n;
if ( n == 0 ) break;
std::vector<int> v(n,0);
for ( int i = 0; i < n; ++i ) {
std::cin >> v[i];
}
std::sort(v.begin(), v.end());
int sum = 0;
for ( int i = 1; i < n-1; ++i ) {
sum += v[i];
... | 0 | 18,078,771 |
#include<cstdio>
#define ri register int
#define rc register char
#define ll long long int
#define rl register long long int
#define in inline
#define gc getchar
in int read()
{
ri x=0,p=1;
rc ch=gc();
while(ch<'0' || ch>'9')
{
if(ch=='-')
{
p=-1;
}
ch=gc();
}
while(ch>='0' && ch<='9')
{
x=x*10+ch-'... | #include <bits/stdc++.h>
#include <math.h>
#include <float.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | 0 | 80,995,195 |
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
constexpr int MOD = 1000000007;
constexpr int INF = 2000000000;
using nam... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair < ll, ll > PLL;
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll MOD = 1e9+7;
int main() {
int n;
cin >> n;
vector<ll> a(n);
vector<ll> cnt(2, 0);
rep(i, n) cin >> a[i];
rep(i, n) {
... | 0 | 5,706,741 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
int n;
cin>>n... | #include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#define Emax 9900
#define Vmax 100
#define Dmax (10000000)
#define INF (100000000000L)
using namespace std;
typedef unsigned int uint;
typedef long long int llint_t;
struct Edge {
int from, to, cost;
};
Edge edges[Emax];
static llint_t d[Vmax][... | 0 | 32,856,046 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#include <numeric>
#include <math.h>
using namespace std;
int main(void){
long H,N;
c... | #include <iostream>
using namespace std;
int main() {
int K, S;
cin >> K >> S;
int pattern = 0;
for (int x=0; x<=K; ++x) {
for (int y=0; y<=K; ++y) {
int z = S - (x + y);
if ((z >= 0) && (z <= K)) {
++pattern;
}
}
}
cout << patt... | 0 | 55,143,494 |
#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 <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#d... | 0 | 59,579,526 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int dp[100010];
int rec(int x){
if (x == 0) return 0;
if (dp[x] != -1) return dp[x];
int res = x;
for (int pow... | #include <cstdio>
typedef long long LL;
int main() {
int Q, H, S, D; LL N;
scanf("%d%d%d%d%lld", &Q, &H, &S, &D, &N);
if (H > 2 * Q) H = 2 * Q;
if (S > 2 * H) S = 2 * H;
if (D > 2 * S) D = 2 * S;
printf("%lld\n", N / 2 * D + N % 2 * S);
return 0;
} | 0 | 42,120,926 |
#include <bits/stdc++.h>
#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;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
using namespace std;
bool kei(vector<int> &moji,vector<bool> &op,int n,int x,bool b){
if(n==3){
if(b){
x+=moji.at(n);
}else{
x-=moji.at(n);
}
if(x==7){
op.at(n)=b;
return true;
}else{
return false;
}
}
if(b){
if(kei(moji,op,n+1,x+m... | 0 | 64,600,728 |
#include <bits/stdc++.h>
#include <bits/stdint-intn.h>
#include <cstdint>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int n, p;
std::cin >> n >> p;
std::vector<int> x(n);
re... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll mod = 1e9+7;
const ll INF = 1e18;
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
int main() {
cin.tie(0);
ios_base::sync_with_st... | 0 | 59,647,414 |
#include<bits/stdc++.h>
using namespace std;
#define INF (1<<20)
typedef pair<int,int> P;
vector<P> edge[10];
int dijkstre(int pos){
int min_cost[10];
fill_n(min_cost,10,INF);
priority_queue<P,vector<P>,greater<P> > que;
que.push(P(0,pos));
while(!que.empty()){
P p = que.top(); que.pop();
int cost = p... | #include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <c... | 0 | 5,631,204 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<long long>A(N);
for(int i=0;i<N;i++){
cin>>A.at(i);
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
vector<long long>Ans;
long long mark=-1;
long long cnt=0;
for(int i=0;i<N;i++){
if(mark==A.at(i)){
... | #include<bits/stdc++.h>
using namespace std;
int getMaxPoint(vector<int> v,int &p){
int point=INT_MIN,act=-1;
for(int i=0;i<3;i++){
if(i==p)
continue;
if(v[i]>point){
point=v[i];
act=i;
}
}
p=act;
return point;
}
int main(){
int n;
cin>>n;
vector<vector<int> >... | 0 | 99,268,695 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
using namespace std;
int main()
{
int n,k; cin>>n>>k;
int a[n],sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
if(a[i]>=k) sum++;
}
cout<<sum;
} | #include<bits/stdc++.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 ans=0;
for(int i=0;i<N;i++){
for(int j=i;j<N;j++){
int d=0;
for(int k=0;k<D;k++)... | 0 | 47,599,753 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
using ll = long long;
int main(void){
int N, M;
cin >> N >> M;
vector<vector<pair<int, int>>> vv(N);
for (int i=0; i<M; i++){
int p, y;
cin >> p >> y;
p--;
vv[p].emplace_back(y, i);
}
vector<pa... | 0 | 10,668,132 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using Pint = pair<int, int>;
const ll mod = 1e9+7;
int main()
{
int n;
string s... | #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 repa(i,a,n) for(int i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
#define COUT(x) cout<<(x)<<endl
#define YES(x) cout<<(x?"YES":"NO")<<e... | 0 | 59,543,556 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <iostream>
#include <vector>
#include <string.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <assert.h>
#include <sstream>
#define REP(i,n) for(ll i=0;i<(n);i++)
#define MOD 1000000007
#define int long long
#ifdef int
const l... | 0 | 23,137,110 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000006;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
set<int> s;
cin>>n;
for(int i=0;i<n;i++){
int x;
cin>>x;
s.insert(x);
}
if((int)s.size() == n){
cout<<"YES";
}
else{
cout<<"NO";
}
retu... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long h,w;
cin >> h >> w;
if(h%3==0 || w%3==0){
cout << 0 << endl;
return 0;
}
long long dx[2]={h/3,h/3+1};
long long dy[2]={w/3,w/3+1};
long long m=10000000000;
for(long long i=1;i<w;i++){
long long s1,s2,s3;
long long p,q;
... | 0 | 21,299,710 |
#include <iostream>
using namespace std;
long long solve(long long x, long long n){
if (x == 0)
return 0;
if (x <= n / 2)
return n + solve(n - 2 * x, n - x);
else{
long long cnt = x / (n - x);
return 2 * cnt * (n - x) + solve(x - cnt * (n - x), n - cnt * (n - x));
}
}
int... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 40,624,892 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
int k,n;
cin>>k>>n;
int dis=-1;
int a[200010];
rep(i, n){
cin>>a[i];
if(i!=0){
int tmp=a[i]-a[i-1];
dis=max(dis,tmp);
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((in... | 0 | 16,164,657 |
#include <iostream>
#include <algorithm>
#include <string>
int main(void){
std::string seq;
std::cin >> seq;
std::reverse(seq.begin(), seq.end());
std::cout << seq << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define _SAD() ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
#define SZ(s) s.size()
#define SRT(x,y) sort(x,x+y)
#define REV(a,b) reverse(a,a+b)
#define VSR... | 0 | 60,621,844 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
while (true) {
... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 0 | 52,225,575 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long int> H(N);
rep(i, N) cin >> H.at(i);
vector<long int> max_hights(N);
rep(i, N) max_hights.at(i) = 0;
vector<int> A(M);
vector<int> B(M);
... | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 110;
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector < int > a(n);
long long inf = 1e18;
vector < long long > d(n + 1, - inf);
vector < long long > f(... | 0 | 67,413,201 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin >> n;
while(n--){
int a[3];
cin >> a[0] >> a[1] >> a[2];
bool tf=false;
for(int b=0; b<3; b++){
for(int c=0; c<3; c++){
if(b==c) continue;
for(int d=0; d<3; d+... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD=1000000007;
int main() {
int n; cin>>n;
vector<int> ans(26,51);
for(int i=0;i<n;i++){
string S; cin>>S;
vector<int> A(26,0);
for(int j=0;j<S.size();j++){
A[S[j]-'a']++;
}
for(in... | 0 | 84,787,102 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int MAX = 1000000;
const int INF = 1e9;
const double pi=acos(-1);
using namespace std;
int main(){
int n;
cin >> n;
ll cnt=0;
vector<ll>a(n),b(n);
rep(i,n) cin >> a[i];
... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 | 75,335,330 |
#include<bits/stdc++.h>
using namespace std;
#define oo (long long)1e18
#define ll long long
#define setdp memset(dp,-1,sizeof(dp))
const ll mod = 1e9+7;
void _IOS(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);}
#define PI 3.14159265359
int sx,sy,tx,ty;
struct threeElements{
int _1st,_2nd,_3rd... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int>ans;
ll N, A, B;
void ind(){
for (int i = 0; i < A; ++i) {
ans.push_back(N - A + 1 + i);
}
N -= A; B--;
}
void solve(){
for (int i = B; i <= N; ++i) {
ans.push_back(i);
}
for (int i = B - 1; i > 0; --i... | 0 | 85,378,054 |
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
using ll = long long;
int MOD = 1e9 + 7;
using namespace std;
ll GCD(ll x, ll y)
{
if (y == 0)
{
return x;... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,k,r,s,p;
scanf("%d %d", &n, &k);
scanf("%d %d %d", &r, &s, &p);
char t[n];
scanf("%s", t);
int nPoint = 0;
for(int i = 0; i < k; i++){
bool b... | 0 | 18,834,831 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vd=vector<double>;
using vvd=vector<vd>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using vs=vector<string>;
#define rep(i,n) range(i,0,n)
#define range(i,a,n) for(int i=a;i<n;i++... | 0 | 18,997,888 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> plan(n,vector<int>(3));
for (int i = 0; i < n; i++){
for (int j = 0; j < 3; j++){
cin >> plan.at(i).at(j);
}
}
bool ans=true;
int nx=0;
int ny=0;
int nt=0;
for (vector<int> v: plan){
int... | #define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b... | 0 | 25,165,331 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
int N,H,W,cnt = 0,x0,x1,y0,y1,a,xi,yi,ans;
cin >> W >> H >> N;
x0 = 0;
y0 = 0;
x1 = W;
y1 = H;
rep(i, N){
cin >> xi >> yi >> a;
switch (a)
... | 0 | 53,495,726 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int n;
vector<int> a;
void update(int i, int x);
int query... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
long long M=0;
long long AA=0;
long long BB=0;
long long SS=0;
cin>>N;
vector<string>vec(N);
for(int X=0;X<N;X++){
cin>>vec.at(X);
string S=vec.at(X);
for(int Y=0;Y<S.size()-1;Y++){
if(S.at(Y)=='A'&&S.at(Y+1)=='B'){
... | 0 | 62,140,730 |
#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--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typ... | 0 | 19,159,362 |
#include <stdio.h>
int main(void){
int a, b, c;
int n = 0;
scanf("%d %d %d", &a, &b, &c);
for (int i = a; i <= b; i++) {
if (!(c % i)) n++;
}
printf("%d\n", n);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define loop(i,s,e) for(ll i=s;i<e;i++)
#define test ll x;cin>>x;while(x--)
#define pb push_back
#define vec vector<ll>
#define sortvec(x) sort(x.begin(),x.end())
#define sz(x) x.size()
int main () {
ios_base::sync_with_stdio(false);
cin.tie(NU... | 0 | 23,965,527 |
#include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <time.h>
#include <list>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
... | 0 | 83,592,948 |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define x first
#define y second
#define ll long long
#define lll __int128
#define ull unsigned long long
#define ulll unsigned __int128
#define pii pair<int,int>
#define pb push_back
#define eb emplace_bac... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | 0 | 15,066,337 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<long long int, long long int>> vec(N);
for(int i=0; i<N; i++){
cin >> vec[i].first >> vec[i].second;
}
sort(vec.begin(),vec.end());
long long int cost=0;
long lo... | #include <iostream>
#include <iomanip>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main()
{
char a, b;
cin >> a >> b;
if (a == 'H')
{
cout << b << endl;
}
else if (b == 'H')
{
cout << 'D... | 0 | 44,263,960 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for(ll i = l; i < (r); i++)
#define rep(i, N) FOR(i, 0, N)
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll MOD = round(1e9+7);
int main() {
int N; cin >> N;
int ans = 0;
rep(i,N){
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
map<ll, ll> m;
for (ll i = 0;i < 6;++i) {
ll a;
cin >> a;
m[a]++;
}
for (auto p : m) {
if (p.second > 2) {
cout << "NO" << endl;
return 0;
}
}
cout << "... | 0 | 98,932,377 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | 0 | 581,363 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(void) {
int a, b; cin >> a >> b;
int k; cin >> k;
rep(i, k) {
if(i%2 == 0) {
if(a&1) a--;
b += a/2;
a = a/2;
} else {
if(b&1) b... | 0 | 68,335,487 |
#include<bits/stdc++.h>
#define ll long long
#define F(i,a,b) for(ll i=a;i<b;i++)
#define RF(i,a,b) for(ll i=a;i>b;i--)
#define pii pair<ll,ll>
#define ff first
#define ss second
#define pb(x) push_back(x)
#define pob pop_back
#define mp(x,y) make_pair(x,y)
#define mod 1000000007
#define w(t) int t; cin>>t;while(t--)
u... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int m=1e9+7;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fastio
int n,m,x,y;
cin>... | 0 | 80,516,297 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,m;
cin>>a>>b>>m;
vector<int>aprice(a);
vector<int>bprice(b);
vector<vector<int>> data(m, vector<int>(3));
for(int i=0;i<a;i++){
cin>>aprice[i];
}
for(int i=0;i<b;i++){
cin>>bprice[i];
}
for (int j = 0; j < m ; j++) {
fo... | 0 | 81,994,696 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ii> P;
typedef unsigned long long i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,K;
ll x[55];
ll y[55];
int main(){
cin >> n >> K;
vector<ll> dx;
vector<ll> dy;
for(ll i=0;i<n;i++){
cin >> x[i] >> y[i];
dx.push_back(x[i]);
dy.push_back(y[i]);
}
sort(dx.begin(),dx.end());
sort... | 0 | 82,051,613 |
#include <iostream>
using namespace std;
int main() {
int n, a[100];
int count = 0;
int mini;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
mini = i;
for (int j = i; j < n; j++) {
if (a[j] < a[mini]) {
mini = j;
}
}
if (a[i] !=... | #pragma region header
#include <bits/stdc++.h>
#define int long long
using namespace std;
#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 = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 55,328,191 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
int main(){
string S, T;
cin >> S >> T;
int ns = S.size();
int nt = T.size();
vector<string> V;
bool flg;
string ss;
for(int i=0; i<ns-nt+1; i++) {
flg = true;... | 0 | 64,098,672 |
#include <iostream>
using namespace std;
int main(){
int n;
long long int fib1,fib2,fib3;
cin>>n;
fib1=1;
fib2=1;
if(n==0){
cout<<0<<endl;
}else if(n==1){
cout<<1<<endl;
}else if(n>=2){
for(int i=0;i<n-1;i++){
fib3=fib1+fib2;
fib1=fib2;
fib2=fib3;
}
cout<<fib3<<endl... | #include <bits/stdc++.h>
using namespace std;
string s, s1;
int k;
int ans[3];
int main()
{
while (cin >> s >> k)
{
s1 = s + s + s;
for (int i = 1; i < s1.size(); i++)
{
if (s1[i] == s1[i - 1])
{
s1[i] = '.';
ans[(i / s.size())]++;
... | 0 | 91,431,414 |
#include<cstdio>
#include<cstring>
int main()
{
char str[1001];
while (1) {
scanf("%s", str);
if (str[0] == '0')break;
int sum = 0;
for (int i = 0; i < strlen(str); i++) {
sum += (str[i] - '0');
}
printf("%d\n", sum);
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> C(N - 1), S(N - 1), F(N - 1);
for(int i = 0; i < N - 1; i++) cin >> C[i] >> S[i] >> F[i];
vector<int> dp(N, 0);
for(int i = 0; i < N - 1; i++) dp[i] = S[i];
for(int i = 0; i < N; i++){
... | 0 | 76,367,984 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1L... | 0 | 4,367,978 |
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | 0 | 79,981,878 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,i,j,bl,x,y;
int main(){
scanf("%d%d%d",&n,&m,&bl);
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
x=(i+j+m)/bl%2;
y=(i-j+m)/bl%2;
printf("%c","YBGR"[x*2+y]);
}
puts("");
}
} | #pragma region header
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#inc... | 0 | 52,804,434 |
#include <iostream>
using namespace std;
int main() {
const int size = 26;
int count[size]{};
char chara;
while(cin >> chara) {
if ('a' <= chara && chara <= 'z') {
int id = chara - 'a';
++count[id];
} else if ('A' <= chara && chara <= 'Z') {
int id = chara - 'A';
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#... | 0 | 39,460,289 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define mod (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#def... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n);i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(x... | 0 | 10,021,340 |
#include <iostream>
using std::cin;
using std::cout;
int main() {
int a, b, c;
cin >> a >> b >> c;
if(a < b && b < c) cout << "Yes\n";
else cout <<"No\n";
return 0;
} | #include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i-... | 0 | 62,270,185 |
#include <stdio.h>
#include <algorithm>
using namespace std;
void print(char str[],int a,int b){
for(int i = a; i <= b; i++) printf("%c",str[i]);
printf("\n");
}
void replace(char str[],char p[],int a,int b){
int p_length = b-a+1;
for(int i = 0; i < p_length;i++) str[a+i] = p[i];
}
void reverse(char str[],int a,int... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
#include<deque>
using namespace std;
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>... | 0 | 78,274,254 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
char a, b;
cin >> a >> b;
if(a == 'D') {
if(b == 'H') cout << 'D' << endl;
else cout << 'H' << endl;
}
else {
if(b == 'H') co... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ll long long
#define pii pair<int,int>
void test_case()
{
ll k;
cin>>k;
queue<ll> q;
for(ll i=1;i<=9;i++)
q.push(i);
ll v;
while(k--) {
... | 0 | 55,364,132 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
for(int i = 1;;i+2){
s = s.substr(0, s.size() - i * 2);
string a = s.substr(0, s.size() / 2);
string b = s.substr(s.size() / 2, s.size() / 2);
if(a == b){
cout << s.size() << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 81,648,422 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
auto f = [](int x) {
cout << x << '\n';
cout << flush;
string s;
cin >> s;
if (s == "Vacant") {
exit(0);
} else if (s == "Male") {
return 0;
} else {
... | #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 _rrep(i,n) rrepi(i,n,0)
#define rrepi(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS... | 0 | 56,538,650 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
string divide[4] = {"dream","dreamer","erase","eraser"};
int main(){
string s;
cin>>s;
reverse(s.begin(),s.end());
rep(i,4) reverse(divide[i].begin(),divide[i].end());
int f... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define int long long int
#define double long double
#define inf (int)(1e15)
#define all(x) (x).begin(), (x).end()
#define pair pair<int, int>
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vect... | 0 | 2,896,829 |
#include <iostream>
using namespace std;
int main() {
int x, y;
while (cin >> x >> y) {
if (x == y && x == 0)
break;
if (max(x, y) != y)
swap(x, y);
cout << x << " " << y << endl;
}
} | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,K,ans=0;
cin>>N>>K;
vector<int> A(N);
for(int &i:A)cin>>i;
for(int i=0;i<=K && i<=N;i++){
for(int j=0;j+i<=K && i+j<=N;j++){
priority_queue<int,vector<int>,greater<int>> Q;
int sum=0;
for(int k=0;k<i;... | 0 | 92,424,673 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))... | 0 | 11,530,854 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s,t;
map<int,int> mps;
map<int,int> mpt;
cin >> s >> t;
for(int i=0;i<s.size();i++) {
mps[s[i]-'a']++;
}
for(int i=0;i<t.size();i++) {
mpt[t[i]-'a']++;
}
vector<int> sv;
vector<int> tv;
for(... | 0 | 42,145,251 |
#include<bits/stdc++.h>
#define n0_nnE int main(){
using namespace std;
typedef long long ll;
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
long long ans = 0;
int MaxNum = 0;
for (int i = 0; i < N; i++)
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#def... | 0 | 43,721,534 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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 int NIL = -1;
const int INF = (1<<21);
const lo... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits.h>
#include <climits>
#include <map>
#include <unordered_map>
#define _USE_MATH_DEFINES
#include <cmath>
#include <set>
#include <unordered_set>
#include <iterator>
#include <deque>
#include <assert.h>
#include... | 0 | 76,223,973 |
#include <bits/stdc++.h>
using namespace std;
int keta(int x){
int sum=0;
while(x>0){
x/=10;
sum++;
}
return sum;
}
int main() {
int n,ans=0;
cin >> n;
for(int i=1;i<=n;i++){
if(i%2==0) continue;
int count=0;
for(int j=1;j<=i;j++){
if(i%j==0) count++;
}
if(count==8) ans++... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 73,462,452 |
#include <iostream>
using namespace std;
int main() {
long long sol=0;
int a9=1;
while(1) {
int digmin=0;
int digmax=9;
if(sol==0) digmin=1;
string res;
while(digmin<digmax) {
int hf=(digmin+digmax)/2;
if(sol==0) {
cout << "? " << sol*10+hf << "999999999" << endl;
} else {
cout << "? " <<... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORD(i, m, n) for (int i = m; i >= n; --i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REP1(i, n) for (int i = 0; i <= n; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define EPS (1e-7)
#define INF (... | 0 | 185,123 |
#include <iostream>
#include <cstring>
using namespace std;
int main() {
int a[101];
int n, max;
memset(a, 0, sizeof(int)*101);
while (cin >> n) a[n]++;
for (int i=0; i<=100; i++) {
if (a[i] > max) max = a[i];
}
for (int i=0; i<=100; i++) {
if (a[i] == max) cout << i << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 14,404,383 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
bool result = false;
cin >> N;
for ( int i=0; i<= N/4; i++){
for ( int j=0; j<= (N-i*4)/7; j++){
if( N-i*4-j*7 == 0){
result = true;
}
}
}
if(result){
cout << "Yes" << endl;
}
else{
... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<ty... | 0 | 71,550,262 |
#include<iostream>
using namespace std;
int main() {
int data_lim;
cin >> data_lim;
for(int cnt=0;cnt<data_lim;cnt++) {
int a,b,c;
cin >> a >> b >> c;
bool flg = false;
if(a*a == b*b+c*c)
flg = true;
else if(b*b == a*a+c*c)
flg = true;
else if(c*c == a*a+b*b)
flg = true;
if(flg == true)
cou... | #include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template... | 0 | 19,685,679 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<ll> A(N), B(N);
rep(i, N) cin >> A[i] >> B[i];
reverse(A.begin(), A.end());
reverse(B.begin(), B.end());
ll ans =... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 12,052,301 |
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
ll mod(ll a, ll b){
ll ret=a%b;
if(ret<0) ret+=b;
return ret;
}
ll modpow(ll a,ll b,ll c){
ll res=1;
while(b>0){
if(b&1) res=mod(res*a,c);
a=mod(a*a,c);
b>>=1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, p;
cin >> n >> p;
ll ans = 1;
int odd = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
odd += a%2;
ans *= 2;
}
if (odd == 0) {
if (p == 0) {
cout << ... | 0 | 13,540,643 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
bool ok = true;
if (s[0] != 'A')
ok = false;
int cnt = 0;
for (int i = 2; i <= s.size() - 2; i++)
{
i... | 0 | 67,353,415 |
#include<iostream>
using namespace std;
int main() {
int x, y, z;
cin >> x;
cin >> y;
cin >> z;
int alpha;
if (x < y) {
if (y < z) {
cout << x << " " << y << " " << z << endl;
}
else if (z < x) {
cout << z << " " << x << " " << y << endl;
}
else {
cout << x << " " << z << " " << y << endl;
}
... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 9,945,930 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A, X = 0;
cin >> N;
vector<string> blue(N);
for (int i = 0; i < N; i++){
cin >> blue.at(i);
}
cin >> M;
vector<string> red(M);
for (int i = 0; i < M; i++){
cin >> red.at(i);
}
for (int i = 0; i < N; i++){
A = 1;
for... | 0 | 19,238,414 |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostre... | #include <bits/stdc++.h>
using namespace std;
const long MOD = 1e9+7;
template <typename T>
T modPow(T base, T e, T mod) {
if(e==0) return 1;
if(e==1) return base%mod;
if(e%(T)2==1) return (base * modPow(base, e-(T)1, mod)) %mod;
T tmp = modPow(base, e/(T)2, mod);
return (tmp * tmp) % mod;
}
template <typenam... | 0 | 77,742,758 |
#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i... | #include <iostream>
#include <array>
#include <vector>
using namespace std;
int main()
{
vector< int > vec;
int n, tmp;
cin >> n;
array< int, 10001 > arr;
for ( int i = 0 ; i < 10001 ; i++ )
{
arr[i] = 0;
}
for ( int i = 0 ; i < n ; i++ )
... | 0 | 21,531,410 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string N;
int K;
cin>>N>>K;
long long dp[100][1000];
dp[1][1]=9;
dp[2][1]=0;
dp[3][1]=0;
for(int i=2;i<=(int)N.size();i++){
dp[1][i]=9*i;
dp[2][i]=9*dp[1][i-1]+dp[2][i-1];
dp[3][i]=9*dp[2][i-1]+dp[3][i-1];
}
if(K==1){cout<<dp[1][(... | #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 c... | 0 | 69,287,433 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include<iostream>
using namespace std;
int main(void) {
string firstInput;
string secondInput;
int firstScore = 0;
int secondScore = 0;
int num;
cin >> num;
for(int i = 0; i < num; i++) {
cin >> firstInput;
cin >> secondInput;
int cond = firstInput.compare(secondInput);
if(cond == 0) {
... | 0 | 92,029,418 |
#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>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
static const int INF = INT_... | 0 | 62,868,891 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int N ;
string S , T;
cin >> N >> S >> T ;
for(long long int i = 0; i < N; i++) cout << S[i] << T[i];
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define X 1001100011100001111ll
#define mod 1000000007
#define ll long long
#define all(a) a.begin(),a.end()
#define sortall(a) sort(all(a))
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b)... | 0 | 17,047,199 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n = 0;
cin >> n;
double res = 0;
for(int i = 0;i < n;i++){
double in;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll a[n + 2], sum = 0, cur = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += abs(cur - a[i]);
cur = a[i];
if (i == n) sum += abs(cur - 0);
}
a[0] = a[n + 1] = 0;... | 0 | 41,858,451 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
int n,a,b; cin>>n>>a>>b;
int k;
int ans=0;
for(int i=1;i<=n;i++){
k=0;
int m=i;
while(m>0){
k+=m%10;
m=m/10;
}
if(a<=k&&k<=b){
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef ... | 0 | 93,224,739 |
#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 ALL(v) begin(v),end(v)
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B>... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b... | 0 | 4,760,102 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.