code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
... | #include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#defi... | 0 | 90,601,212 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void to_adjacent_matrix(vector<vector<int> >& adjacent_list, vector<vector<int> >& adjacent_matrix);
int main()
{
int n;
cin >> n;
vector<vector<int> > vertex(n, vector<int>(n, -1));
for (int i = 0; i < n; ++i) {
int u,... | #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... | 0 | 81,840,346 |
#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
int main() {
#ifdef FASTIO
ios_base::sync_with_stdio(false), cin.tie(... | #include <bits/stdc++.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++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<v... | 0 | 60,467,221 |
#include <bits/stdc++.h>
#define MAX 1000000
#define MOD 1e9
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define endl '\n'
using namespace std;
#define FastInput ios_base::sy... | #include <iostream>
using namespace std;
int w,h;
int count;
int dx[4]={1,0,-1,0};int dy[4]={0,1,0,-1};
char board[100][100];
void dfs(int x,int y){
count++;
board[y][x]='#';
for(int i=0;i<4;i++){
int nx=x+dx[i];int ny=y+dy[i];
if(nx>=0&&nx<w&&ny>=0&&ny<h&&board[ny][nx]=='.'){
d... | 0 | 30,205,182 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i <= n; i++) {
string u = s + t.substr(n-i, i);
... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
LL Z[51], Y[51];
LL part(int N, LL X) {
if (N == 0) { if (X == 0) return 0; else return 1; }
LL ans = 0;
if (X <= 1) return ans;
X--;
if (X <= Z[N - 1]) return... | 0 | 97,837,240 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vii vector<int>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define take(a,n) for(ll i=0;i<n;i++)cin>>a[i]
#define takes(a,n,st) for(ll i=st;i<n+st;i++)cin>>a[i]
ll ... | #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 | 69,427,249 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll mx = 0;
rep(i, n) mx = max(mx, a[i]);
int l = 0;
while (mx > 0) {
mx /= 2;
++l;
}
... | 0 | 91,926,008 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r, d, x, a;
cin >> r >> d >> x;
a = r*x - d;
for (int i = 0; i < 10; i++)
{
cout << a << endl;
a = r*a - d;
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
ll K,A,B;
cin>>K>>A>>B;
if(A>=B-1||K<A+1) cout<<K+1<<endl;
else
{
K-=A-1;
cout<<B+(K/2-1)*(B-A)+K%2<<endl;
}
return 0;
} | 0 | 13,978,208 |
#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 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 push_back
#define all(v) (v).begin(), (v).end... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long N, M; cin >> N >> M;
vector<long long>A(N), B(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
sort(A.begin(), A.end(), greater<long long>());
sort(B.begin(), B.end(... | 0 | 24,998,704 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int sll;
typedef double ld;
#define A 1000000007ll
#define D 100000000000000ll
#define B 998244353ll
#define C 1000000000000000000ll
#define FAST ios::... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
while(true){
cin>>n>>k;
if(n==0)break;
vector<int> a(n+1,0);
for (int i = 1; i <= n; ++i) {
cin>>a[i];
a[i]+=a[i-1];
}
int ans=0;
for (int i = 0; i+k < n; ++i) {
... | 0 | 51,978,089 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int x,y,n,m;
cin>>x>>y>>n>>m;
int has = x-y;
if(has <=0 ) {
cout<<n*x<<endl;
} else {
cout<<y*n + has*m<<endl;
}
} | #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 n, k;
cin>>n>>k;
set<pair<int, int> > st;
for(int i = 1;i<=n-1;i++){
for(int j=i+1;j<=n;j++){
st.insert(make_pair(i, j));
}
}
if(k > (n-2)*... | 0 | 42,917,508 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int A[3];
for(int i = 0; i < 3; i++){
scanf("%d",&A[i]);
}
sort(A,A+3);
printf("%d\... | #include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
const int mod = 1e9 + 7;
typedef long long ll;
int n;
ll gt[maxN], igt[maxN];
int a[maxN], vis[maxN];
ll Pow(ll a, ll b) {
if (b == 0) return 1;
ll t = Pow(a, b / 2);
t = (t * t) % mod;
if (b % 2) return (t * a) % mod;
return t;
}
void i... | 0 | 79,561,573 |
#include<iostream>
using namespace std;
int rec(int n, int sum, int max) {
if(sum<0) return 0;
if(!n&&!sum) return 1;
int ans=0;
for(int i = max+1; i<=9; ++i)
ans += rec(n-1, sum-i, i);
return ans;
}
int main() {
int n,s;
while(cin>>n>>s, n||s) {
cout<<rec(n,s,-1)<<endl;
}
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
ll lcm(ll a,ll b){
ll x... | 0 | 1,049,080 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int r;
cin >> r;
if (r >= 2800) {
cout << "AGC" << endl... | #include <bits/stdc++.h>
using namespace std;
bool solve() {
int n; cin >> n;
int cnt[110] = {};
int maxi = 0;
for(int i = 0; i < n; ++i) {
int a; cin >> a;
cnt[a]++;
maxi = max(maxi, a);
}
if(cnt[maxi] < 2) {
return false;
}
cnt[maxi] -= 2;
if(maxi % 2 == 0) {
if(cnt[maxi / 2] < 0) {
return false... | 0 | 733,773 |
#include <iostream>
#include <vector>
using namespace std;
const int END = -1;
struct StNod
{
int m_nDept;
int m_nParnt;
int m_nLChd;
int m_nRSib;
StNod() :
m_nDept(END), m_nParnt(END), m_nLChd(END), m_nRSib(END)
{ }
};
void fnInput(vector<StNod> &rvoNod)
{
StNod oNod;
int nMaxSiz;
cin >> nMaxSiz... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 42,144,652 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+5,M=1e6+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a) memset(a,0,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
int main(){
int n,k,x,y;
cin>>n>>k>>x>>y;
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 | 89,207,165 |
#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;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | 0 | 24,058,938 |
#include <stdio.h>
int main()
{
int A, B;
scanf("%d %d", &A, &B);
if (A==2 && B==1 || A==1 && B==2) {
printf("3");
}
else if (A==3 && B==1 || A==1 && B==3) {
printf("2");
}
else if (A==3 && B==2 || A==2 && B==3) {
printf("1");
}
return 0;
} | #include <iostream>
using namespace std;
bool a[101] = {0};
int main(){
int n, k;
cin >> n >> k;
while(k--){
int d; cin >> d;
for(int i=0; i<d; i++){
int ai; cin >> ai;
a[ai] = 1;
}
}
int res = 0;
for(int i=1; i<=n; i++)
if (a[i] == 0) res... | 0 | 82,699,187 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#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
#d... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <numeric>
#include <set>
#include <map>
#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
using namespace std;
int main()
{
int num = 0;
while (cin... | 0 | 33,967,949 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i, k , n) for(int i = k; i <= n; i++)
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{... | 0 | 41,265,044 |
#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define of(i,l,r) for(int i=l;i>=r;i--)
#define fe(i,u) for(int i=head[u];i;i=e[i].next)
#define el putchar('\n')
#define ta putchar(' ')
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
inline void open(const char *s)
{
#ifndef ONLIN... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> arr(n, 0);
int m;
cin >> m;
while(m--){
int x, y;
cin >> x >> y;
x--, y--;
arr[x]++, arr[y]++;
}
int f = 0;
for(int i = 0; i < n; i++){
if(arr[i] ... | 0 | 35,568,196 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int a[n];
for(int i=0; i<n; i++) cin>>a[i];
int64_t kabu = 0;
int64_t money = 1000;
for(int i=0; i<n-1; i++) {
int64_t add = money/a[i];
kabu += add;
money -= add*a[i];
if(a[i]>a[i+1]) {
money += a[i]*kabu;
... | #include<bits/stdc++.h>
using namespace std;
long long x[100009],y[100009];
long long use[1000];
char mp[4] = {'R','D','L','U'};
int main()
{
long long N,M,i,j,k = 0,now = 1;
vector<long long> temp;
cin >> N;
for(i = 0;i < N;i++)
{
cin >>x[i] >> y[i];
if((x[i] + y[i]) % 2 == 0)
{
k++;
}
... | 0 | 13,007,487 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>> a>>b;
if(a==1&&b!=1)
{
cout<<"Alice"<<"\n";
}
else if(b==1 && a!=1)
{
cout <<"Bob"<<"\n";
}
else if(a==b)
{
cout<<"Draw"<<"\n";
}
else if (a>b)
{
cout<<"Alice"<<"\n";
}
else
{
cout <<"Bob"<<"\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(n);
int sum = 0;
for(int i=0; i<n; i++) {
cin >> a[i];
sum += a[i];
}
bool ans = false;
double check = double(sum) / (4*double(m));
sort(a.begin(), a.end());
reverse(a... | 0 | 76,626,664 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string s;
cin>>s;
bool flag=false;
int len=s.size();
for(int i=1;i<s.size();i++){
if((len-i)%2!=0)continue;
else{
string str1=s.substr(0,(len-i)/2);
strin... | #include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<cstdlib>
#include<iomanip>
#include<queue>
#include<set>
#include <valarray>
#include<stack>
#include<sstream>
#include<math.h>
using namespace std;
void Solution()
{
int H, W;
while(... | 0 | 62,508,258 |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
int main()
{
ll K;
ll a[50];
cin >> K;
ll t = (ll)(K/50);
cout << 50 << endl;
rep(i,50)
{
a[i] = i-K%50;
if(a[i]<0)
a[i]+=51;
cout << a[i]+t << " ";
... | #include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <assert.h>
#include <cmath>
#include <deque>
#include <set>
#include <unordered_map>
#include <complex>
#include <fstream>
using namespace std;
using ll = long long;
using ld = long double;
const ... | 0 | 75,950,487 |
#include <bits/stdc++.h>
#define show(x) std::cerr << #x << " = " << x << std::endl
using ll = long long;
using ld = long double;
constexpr ll MOD = 1000000007LL;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 10;
std::mt19937 mt{std::random_device{}()};
int main()
{
int N;
std::cin >> ... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
vector<int> i;
vector<int> u;
int o[11000000];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long a=0,b,c,d=0,e=0,f=0,g;
string s;
cin >>a;
for(int n=1;n<=a;n++){
d+=n;
o[n]=1;
if(d>a){... | 0 | 15,924,929 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descsort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main(void)
{
int n;
cin>>n;
int ans=0;
re... | #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> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int m... | 0 | 79,716,865 |
#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<int> a(n);
rep(i, n) cin >> a[i];
bool ans = true;
sort(a.begin(), a.end());
rep(i, n){
if(a[i] == a[i+1]){
ans = f... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_b... | 0 | 33,916,441 |
#include<stdio.h>
#include<algorithm>
using namespace std;
#define NIL -2000000001
#define MAX 250
int A[MAX];
void printHeap(int n) {
for ( int i = 0; i < n; i++ ) {
printf("node %d: key = %d, ", i+1, A[i]);
if (i+1 != 1) {
printf("parent key = %d, ", A[(i+1)/2-1]);
}
if (A[2*(i+1)-1] != NIL &&... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,s=0;
string str;
cin>>str;
for(int i=0;i<str.size();i++){
int j=str[i]-48;
s+=j;
}
if(s%9==0)
cout<<"Yes";
else cout<<"No";
} | 0 | 23,829,151 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
intt N, K, R, S, P; std::cin >> N >> K >> R >> S >> P;
std::string T; s... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int inf = 1e9;
const ll linf = 1e18;
template<typename T = int>
class WeightedUnionFind
{
public:
WeightedUnionFind(int n = 0, T unity = 0) : m_data(n, -1), m_weight(n, unity), m_count(n) {}
int find(int x)
{
if (m_data[x] < 0... | 0 | 35,547,339 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, Y, k;
cin >> N >> Y;
string a = "no";
if(Y%1000==0){
for(int i=Y/10000;i>=0;i--){
for(int j=(Y-10000*i)/5000;j>=0;j--){
k= (Y-10000*i-5000*j)/1000;
if(i+j+k==N){
cout << i <<" " <<j <<" " << k <<endl;
a="Yes... | #include <iostream>
#define endl '\n'
#define pb push_back
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
void solve()
{
int a, b;
cin >> a >> b;
int pal = 0;
for(int i = a; i <= b; i++)
{
string s;
int temp = i, sz = 0;
... | 0 | 11,341,994 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
map<string,int>m;
map<string,int>:: iterator itr;
int n,chk1=0,chk2=0;
cin>>n;
cin>>s;
char last=s[s.length()-1];
m[s]=1;
for(int i=1; i<n; i++)
{
cin>>s;
m[s]++;
if(chk1==0)
{
... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD =1000000007;
ll modPow(ll a, ll n) {
if (n == 0) return 1;
if (n == 1) return a % MOD;
if (n % 2 == 1) return (a * modPow(a, n - 1)) % MOD;
ll t = modPow(... | 0 | 93,039,896 |
#include <bits/stdc++.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++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
VI a(n+2,0);
rep(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,x,m;
cin >> n >> x >> m;
vector<ll> spare(m, -1);
ll now = x;
rep(i,m){
if(spare[now] != -1) break;
else{
... | 0 | 29,901,266 |
#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()
const ll INF = 1LL << 60;
int main(){
int a, b, c;
cin >> a >> b >> c;
int ans= c - a + b;
if(ans<0) ans=0;
cout << ans << endl;
} | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
int N,A,B,C;
int l[8];
int dfs(int k,int a,int b,int c){
while(k<=N){
if(k==N){
if(min(a,min(b,c))>0){
return abs(a-A)+abs(b-B)+abs(c-C)-30;
}
else{
return 9999999;
}
}
else{
int w... | 0 | 38,578,620 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | #include <bits/stdc++.h>
using namespace std;
int a[100000];
int main() {
const int INF = 1e9;
int n, k;
while(~scanf("%d%d", &n, &k) && n) {
for(int i = 0; i < n; ++i) scanf("%d", a + i);
int sum = 0, ans = -INF;
for(int i = 0; i < n; ++i) {
sum += a[i];
if(i... | 0 | 96,919,413 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int arr[n],pre[n]={0},suf[n]={0},w=0,min=INT_MAX;
for(int i=0;i<n;i++)
{
cin>>arr[i];
w+=arr[i];
pre[i]=w;
}
w=0;
for(int i=n-1;i>=0;i--)
{
w+=arr[i];
suf[i]=w;
}
for(int i=0;i<n-1;i++)
{
if(min>abs(pre[i]-suf[i+1]))
min=abs(p... | #include <stdio.h>
int ng[16][16];
int rec(int x, int y){
if(ng[x][y]) return 0;
if(x == 0 && y == 0) return 1;
if(x == 0) return rec(0, y-1);
if(y == 0) return rec(x-1, 0);
return rec(x-1, y) + rec(x, y-1);
}
int main(void){
int h, w, n, x, y, a, b;
while(scanf("%d%d", &h, &w) && (h||w)){... | 0 | 76,656,958 |
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v,d) memset( v, d ,sizeof(v))
#define PI acos(-1)
typedef l... | #include "bits/stdc++.h"
using namespace std;
const long long int MOD_JOHAN {1000000007};
const long long int MOD_LIGHT {998244353};
const long long int MAXN_EYEPATCH = 1e6 + 1LL;
const long long int MAXN_FULLMETAL = 501LL;
typedef long long int lld;
typedef unsigned long long int llu;
typedef vector<int> v_int;
typede... | 0 | 12,736,214 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, yard;
cin >> x >> y;
yard = (x * y) - (x + y) + 1;
cout << yard << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int w, h;
cin >> w >> h;
vector<pair<ll, bool>> v;
for (int i = 0; i < w; i++) {
int p;
cin >> p;
v.emplace_back(p, true);
}
for (int i = 0; i < h; i++) {
... | 0 | 91,804,045 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 87,900,465 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n... | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define pb(x) push_back(x)
#define MP(x,y) make_pair(x,y)
using namespace std;
ll gcd(ll a,ll b)
{
if(a%b==0)
return b;
else
return gcd(b,a%b);
}
int hashe[5];
void solve()
{
int a,b;
cin>>a>>b;
hashe[a]++,hashe[b]++;
cin>>a>... | 0 | 92,141,855 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using pii = pair<int,int>;
#define FOR(i,a,b) for(ll i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(obj) (obj).begin(), (obj... | #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(... | 0 | 59,215,076 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | #include<bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = S.at(0)-'0';
int b = S.at(1)-'0';
int c = S.at(2)-'0';
int d = S.at(3)-'0';
if (a+b+c+d==7) printf("%d%c%d%c%d%c%d=7", a,'+',b,'+',c,'+',d);
else if (a+b+c-d==7) printf("%d%c%d%c%d%c%d=7", a,'+',b,'+',c... | 0 | 20,679,799 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
map<string, int> a;
for(int i=0; i<n; i++) {
cin >> s;
sort(s.begin(), s.end());
a[s]++;
}
int64_t ans = 0;
vector<int64_t> memo(100001, -1);
for(pair<string, int64_t> p : a) {
if(p.second>1) ans += p... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int N;
int A[100000];
int ch[100000] = {};
bool used[100000] = {};
vector<int> G[100000];
int dfs(int v) {
used[v] = true;
if (G[v].size()... | 0 | 91,049,150 |
#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... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll n, a, b;
cin >> n >> a >> b;
if(b == 1){
if(a != n){
... | 0 | 44,397,148 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
bool comp(P p1,P p2){
return (p1.first == p2.first && p1.second > p2.second) || p1.first < p2.first;
}
bool comp1(P p1,P p2){
return p1.second > p2.second;
}
int main(){
ll n,h;
cin >> n >> h;
ll i;
vector<P> p(n);
f... | #include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 34,715,053 |
#include <cstdio>
int ns[5001];
int max(int a,int b){return a>b?a:b;}
int main(){
int n;
while(scanf("%d",&n),n){
for(int i=1; i<=n; i++)
scanf("%d",&ns[i]);
for(int i=2; i<=n; i++)
ns[i]+=ns[i-1];
int ans=-100001;
for(int i=0; i<=n; i++)
for(int j=0; j<i; j++)
ans=max(ans,ns[i]-n... | #include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
static vector<int64_t> vec;
static inline int32_t parent(uint32_t index)
{
if (index < 1) return -1;
return (index - 1) / 2;
}
static inline uint32_t left(uint32_t index)
{
return 2 * index + 1;
}
static inline uint32_t right(uint32_t i... | 0 | 75,902,223 |
#include<iostream>
using namespace std;
#define MAX 256
int miku(int x){
if(x > 36)return 0;
if(x < 10)return (x + 3)*(x + 2)*(x + 1) / 6;
if(x > 18)return miku(36 - x);
if(x > 9 && x < 19)return (x + 3)*(x + 2)*(x + 1) / 6 - (miku(x - 10) * 4);
}
int main(void){
int n,i = 0;
int ans[MAX];
while(cin >> n){
ans... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<long long> a(n+1);
vector<long long> b(n);
long long sum=0;
for (int i=0; i<n+1; i++) cin>>a[i];
for (int i=0; i<n; i++) cin>>b[i];
for (int i=0; i<n; i++){
if (a[i]<b[i]){
... | 0 | 68,350,071 |
#include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N;
cin >> N;
vector<int> vec(N);
rep(i,N){
cin >> vec[i];
}
int ans... | 0 | 39,528,598 |
#include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define ALL(r) (r).begin(),(r).end()
typedef long long int ll;
#define FOR(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; ++i )
#define FORN(i,m,n) for(ll i=(ll)(m-1) ; i >= (ll) (n) ; --i )
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
v... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
string a... | 0 | 98,221,378 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
int main() {
int64_t N,ans=0; cin>>N;
vector<int64_t> S(N);
rep(i,N) cin>>S.at(i);
rep(i,N){
ans+=S.at(i)/2;
S.at(i)%=2;
if(i<N-1&&S.at(i)==1&&S.a... | #include<bits/stdc++.h>
#include <stdlib.h>
#include <stdio.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a,n) vector<int> (a)((n));
#define Vec(a,n) vector<string> (a)((n));
#define twovec(a,n,m) vector<vector<int>> a(n,vector<... | 0 | 87,854,880 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
const ll dx[8] = {1, 1, 0... | 0 | 10,987,762 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
string s;
cin >> s;
bool A = false;
bool B = false;
for (char c : s){
if (c == 'A'){
A = true;
}
else if (c == 'B')
{
B =... | #include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int n_player, winner;
double P;
while (scanf(" %d %d %lf", &n_player, &winner, &P) == 3) {
if (n_player == 0 && winner == 0 && P == 0) break;
winner--;
int table[n_player];
double money = 0;
for (int i = 0; i < n_player; i... | 0 | 64,169,090 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
bool comp(const std::string& lh, const std::string& rh) {
return lh.length() < rh.length();
}
int main(){
int n;
cin >> ... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <string>
using namespace std;
int main() {
int64_t N, K, R, S, P;
string T;
cin >> N >> K >> R >> S >> P >> T;
reverse(T.begin(), T.end());
int64_t point = 0;
for (int64_t k = 0; k < K; ++k) {
int64_t idx = k;
char pre = '-';
w... | 0 | 80,574,853 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf INT_MAX
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps... | #include<cstdio>
using namespace std;
typedef long long ll;
const int MAX=2e5+10;
char str[MAX];
int main(){
while(~scanf("%s",str)){
ll ans=0,b=0;
for(int i=0;str[i];i++){
if(str[i]=='B') b++;
else ans+=b;
}
printf("%lld\n",ans);
}
return 0;
} | 0 | 68,152,235 |
#include <bits/stdc++.h>
#define LL long long
#define P pair<int, int>
#define Fengexian cout<<"WZY%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%"<<endl
const LL N = 1e5 + 10;
const LL mod = 998244353;
const LL inf = 0x3f3f3f3f;
const double eps = 1e-9;
using namespace std;
template <typename tp>
inline void read(tp &x)
{
x = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll Ten(int x){
ll ret=1;
while( x-- )ret*=10ll;
return ret;
}
int ask(ll n){
cout<<"? "<<n<<endl;
cout.flush();
char c;
cin>>c;
return c=='Y';
}
int main(){
if( ask( Ten(9) ) ){
for(int i=0;i<=10;i++){
if( ask( 2ll*Ten(i) ) ){
cout<<"! "<<T... | 0 | 36,348,701 |
#include <stdio.h>
#include <cstring>
main(){
while(1){
int w,h;
scanf("%d%d", &w,&h);
if(w==0&&h==0) break;
int dp[w][h];
memset(dp, -1, sizeof(dp));
int n;
scanf("%d", &n);
int x,y;
for(int i=0;i<n;i++){
scanf("%d%d",&x,&y);
dp[x-1][y-1] = 0;
}
int k=1;
fo... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include... | 0 | 75,484,261 |
#include <iostream>
#include <cmath>
#include <utility>
void koch(int d, std::pair<double, double> p1, std::pair<double, double> p2){
if(d == 0) return;
std::pair<double, double> s;
s.first = (2*p1.first+1*p2.first)/3.0;
s.second = (2*p1.second+1*p2.second)/3.0;
std::pair<double, double> t;
t.first = (1*p1.first+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i,n) for(ll i=0;i<n;i++)
using Graph = vector<vector<int>>;
using pint = pair<int,int>;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int m... | 0 | 74,423,019 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
int main(){
int a;
cin >> a;
cout << "Christmas";
rep(i, 25-a) cout << " Eve";
cout <<en... | #include<bits/stdc++.h>
#define ll long long
#define P pair<ll ,ll>
using namespace std;
int main(){
vector<int>vec(3);
cin >> vec[0] >> vec[1] >> vec[2];
sort(vec.begin() ,vec.end());
int ans = 0;
while(!(vec[0] == vec[1] && vec[1] == vec[2])){
if(vec[1]!=vec[2]){
vec[0]++;
... | 0 | 4,257,044 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | 0 | 8,977,208 |
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
int main(){
fast;
ll a, b;
cin >> a >> b;
if(abs(a - b) <= 1) cout << "Yay!";
else cout << ":(";
retu... | #include <bits/stdc++.h>
#define rep(i,m,n) for(int i = (m); i < (n); i++)
#define rrep(i,m,n) for(int i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]) << " \n"[i == n-1];}
#define printp(x... | 0 | 89,701,192 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>
us... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) FOR(i,0,b)
#define INF mugen
#define dump(x) cerr<<#x<<"="<<x<<endl
#define ALL(a) (a).begin(),(a).end()
#define EACH(e,v) for(auto& e:v)
#define SORT(v) sort(ALL(v))
#define PERM(v) SORT(v);for(bool c##p=1;c##p;c##p=... | 0 | 61,766,322 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #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>... | 0 | 12,296,502 |
#include <bits/stdc++.h>
#define rep(begin, end) for (i=begin;i<end;i++)
#define init(arr, end, val) for (i=0;i<end;i++) arr[i] = val;
#define printint(i0, i1) printf("%d %d\n", i0, i1)
using namespace std;
const int inf = pow(10,9);
const int nil = -1;
const long long MOD = 998244353;
long long i, n, m, k, ans;
long l... | #include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long
signed main(signed argc, char** argv){
int N;
cin >> N;
vector<int> X(N), Y(N);
for(int i = 0; i < N; ++i) {
cin >> X[i] >> Y[i];
}
bool g = true;
i... | 0 | 64,515,427 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begi... | #include<bits/stdc++.h>
#include<cstring>
using namespace std;
#define ll long long
int main()
{
ll h,w,x=1000000,a,b,c,y,z;
cin>>h>>w;
for(int i=1;i<h;i++){
a=i*w;
b=floor((h-i)/2.0)*w;
c=ceil((h-i)/2.0)*w;
y=max({a,b,c});
z=min({a,b,c});
x=min(x,y-z);
... | 0 | 89,080,868 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, t; cin >> s >> t;
bool flg = true;
for(int i = 0; i < t.size(); i++) s.push_back(s[i]);
for(int i = 0; i < t.size(); i++) {
if(s[i] != t[0]) continue;
for(int j = 0; j < t.size(); j++) {
if(s[i + j] != t[j]) {
... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <... | 0 | 91,173,800 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
#define INF (1e9)
int main() {
ld H, W;
ll ans;
cin >> H >> W;
if (H == 1 || W == 1) ans = 1;
else ans = ceil(H * W / 2);
cout << ans << endl;
} | #include <iostream>
int main() {
long long int h;
int n;
std::cin >> h >> n;
int a[100010];
long long int sum = 0;
for (int i = 0; i < n; ++i)
std::cin >> a[i], sum += a[i];
if (sum >= h)
std::cout << "Yes";
else
std::cout << "No";
} | 0 | 15,924,425 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
... | #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define XinAi ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
using namespace std;
typedef pair<int,int> pii;
const int N = 1e4+10;
string dp[N], val[15];
string num = "123456789";
int c[] = {2,5,5,4,5,6... | 0 | 38,916,884 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
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 long long INF = 1LL << 60;
bool ... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main() {
int N = 0;
cin >> N;
string in[N];
string out[N];
for(int i = 0; i < N; ++i){
cin >> in[i];
out[i] = in[i];
}
for(int i = 0; i < N; ++i){
for(int j = N - 1; j > i; --j){
if(out[j].at(1) < out[j - 1].at(1)){
str... | 0 | 21,490,419 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,b,cu,out;
cin >> n;
cu = 0;
out = 0;
vector<int> vec(0);
for (int i = 0 ; i < n ; i++ ) {
cin >> a;
vec.push_back(a);
}
b = 1;
for (int i = 0;i < n ; i++){
cu++;
if (cu == n){
out = 1;
break;
}
if (v... | #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 rep(i, n) for... | 0 | 38,394,239 |
#include <cstdio>
#include <algorithm>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define reps(i,f,n) for(int i=(f); i<=(n); ++i)
using namespace std;
main()
{
int N, a[2000001], maxv = 0;
scanf("%d", &N);
rep(i, N)
scanf("%d", a+i),
maxv = max( maxv, a[i] );
int cnt[maxv + 1] = {-1};
int ret[... | #include <iostream>
using namespace std;
int main(){
int m;
while(cin >> m,m){
int c=0;
m=1000-m;
while(m-500>=0){
m=m-500;
c++;
}
while(m-100>=0){
m=m-100;
c++;
}
while(m-50>=0){
m=m-50;
c++;
}
while(m-10>=0){
m=m-10;
c++;
}
while(m-5>=0){
m=m-5;
c++;
}
while(m-1>=0... | 0 | 74,172,819 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
int a, b;
cin >> a >> b;
... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <bitset>
#include <map>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
string result = "";
bool loopdfs(vector<int> & nums, int N, i... | 0 | 17,190,042 |
#include <bits/stdc++.h>
using namespace std;
long long X,Y;
int val=0;
int main (){
cin>>X>>Y;
while(Y>=X){
val++;
X*=2;
}
cout<<val;
} | #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 < (n); ++i)
struct UnionFindTree {
vector<int> par;
UnionFindTree(int n) : par(n) {
rep(i, n) par[i] = i;
}
int root(int x) {
if ( par[x] == x ) return x;
... | 0 | 49,929,158 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, c, k;
cin >> n >> c >> k;
int T[n];
for(int i=0; i<n; ++i) cin >> T[i];
sort(T, T+n);
int ans = 0;
for(int i=0; i<n;){
++ans;
int st = i;
while(i < n && T[i]-T[st] <= k && i-st < c) ++i;
}
cout << ans << endl;
} | #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... | 0 | 9,409,116 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = '\n'... | #include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int cmp(int a,int b)
{
return a>b;
}
int main()
{
int a,b,k;
int c[200];
scanf("%d%d%d",&a,&b,&k);
int j=0;
int d=min(a,b);
for(int i=1;i<=d;i++)
{
if(a%i==0&&b%i==0)
{
c[j]=i;
... | 0 | 62,063,316 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main()
{
vector<string> ans;
string E = "-";
while ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 27,576,313 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | #include<bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li,li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i,l,r) for(li i=l;i<=r;++i)
#define fr(i,l,r) for(li i=l;i>... | 0 | 53,548,768 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <functional>
#include <queue>
#include <unordered_set>
#include <climits>
#include <set>
#include <list>
#include <cmath>
using namespace std;
typedef long l... | #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;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(ki,... | 0 | 53,537,333 |
#include <iostream>
#include <cstdlib>
#include <cmath>
using namespace std;
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0) break;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int mindif = 10000000;
for (int i = 0; i < ... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
using namespace std ;
const int N = 1e5+5 ;
int n ,l ,q ,x[N] ,nxt[N] ,lst[N] ;
int main(){
scanf("%d",&n);
int sq = sqrt(n) ;
for(... | 0 | 29,417,899 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
int main(){
string s;
int n, flag =0;
cin >> s;
n = s.size()-1;
for(int i=0; i<=n/4; i++){
if(s[i]==s[n-i] && s[i]==s[((n-2)/2)-i] && s[n-i]==s[((n+2)/2)+i]) flag =1;
else{
fla... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
vector<ll> adj[200005];
ll cnt=0;
bool status[200005];
void dfs(int s)
{
cnt++;
status[s]=true;
for(auto it:adj[s])
{
if(!status[it])
{
dfs(it);
}
}
}
void solve()
{
ll n,m;
cin>>n>>m;
... | 0 | 84,400,449 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b;
c=a*b;
if(c%2==1)
{cout<<"Odd"<<endl;}
else cout<<"Even"<<endl;
} | #include<iostream>
#include<queue>
#include<cstring>
using namespace std;
int h,w,n;
char m[1001][1001];
int dx[4]={0,0,-1,1};
int dy[4]={-1,1,0,0};
bool bj[1001][1001];
int start_x;
int start_y;
int total;
int cnt;
struct Node{
int x,y;
int time;
};
bool pd(int a,int b)
{
if(a>=0&&a<h&&b>=0&&b<w)
... | 0 | 55,088,616 |
#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... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
... | 0 | 59,165,140 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
typedef int64_t ll;
template<class T> inline bool chmax(T & a, T b) { if ... | 0 | 95,510,349 |
#include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
Int p... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
type... | 0 | 53,268,165 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | 0 | 62,209,049 |
#include <iostream>
#include <cmath>
void makeKochCurve(double x1, double y1, double x2, double y2, int depth)
{
if (depth == 0) return;
double length = sqrt((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1));
double angle = atan2(y2-y1, x2-x1);
double xa = (2.0 * x1 + x2) / 3;
double ya = (2.0 * y1 + y2) / 3;
double xb = (x1 +... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
string X;
string Y;
int calc(int x, int y, vector<vector<int> >& Memo){
if (X[x] == '\0' || Y[y] == '\0') return 0;
if (Memo[x][y] != -1) return Memo[x][y];
int unuse = calc(x + 1, y, Memo);
int use = 0;
in... | 0 | 21,414,203 |
#include <string>
#include <iostream>
using namespace std;
int n;
string x, y;
bool mat[1000][1000];
int a[1000][1000];
int max(int i, int j) {
int r = (!mat[i - 1][j] ? a[i - 1][j] : 0);
r = ((!mat[i][j - 1] && a[i][j - 1] > r) ? a[i][j - 1] : r);
return r > a[i - 1][j - 1] ? r : a[i - 1][j - 1];
}
int main(){
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i,n) for(ll i=0;i<n;i++)
int main(){
int n;cin>>n;
int d[n];
map<int,ll> mp;
rep(i,n){
cin>>d[i];
mp[d[i]]++;
}
if(d[0]!=0... | 0 | 36,025,812 |
#include <iostream>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
long double x1,y1,x2,y2,ans;
cin >> x1 >> y1 >> x2 >> y2;
ans = (x2 - x1)*(x2 - x1)+(y2 - y1)*(y2 - y1);
ans = sqrtl(ans);
cout << setprecision(18) << ans << "\n";
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " <... | 0 | 45,600,205 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | #include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define ALLR(X) (X).rbegin(), (X).rend()
#define MP make_pair
#define PB push_back
#define EB e... | 0 | 73,268,099 |
#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... | #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 = (... | 0 | 57,964,457 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll INF = 1e12;
const ll MOD = 1000000000 + 7;
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>... | 0 | 30,277,032 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 1005;
ll x[N][3], a[N];
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n, m;
cin>>n>>m;
for(int i = 0; i < n; i++){
for(... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct UnionFind{
int par[10005];
int rank[10005];
UnionFind(int n){ init(n);}
void init(int n){
for(int i=0;i<n;i++){
par[i] = i;
rank[i] = 0;
}
}
int find(int x){
if(x == par[x]) return x;
return par... | 0 | 17,709,817 |
#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... | #include<bits/stdc++.h>
using namespace std;
int N, A, B;
int main() {
scanf("%d %d %d", &N, &A, &B);
if(A + B - 1 > N) {
printf("-1");
return 0;
}
if(N > 1LL * A * B) {
printf("-1");
return 0;
}
int pos = N;
for(int i = 0; i < B; i++) {
int nxt = max(... | 0 | 81,782,851 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c, k;
cin >> a >> b >> c >> k;
int op = 0;
while (b <= a) {
b *= 2;
op++;
}
while (c <= b) {
c *= 2;
op++;
}
cout << (op <= k ? "Yes" : "No");
} | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main(){
ll w,h,n;
cin >> w >> h >> n;
std::vector<int> x(n... | 0 | 54,418,489 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int n;
int cnt[86401];
int toSec(string s) {
int h = (s[0] - '0') * 10 + (s[1] - '0');
int m = (s[3] - '0') * 10 + (s[4] - '0');
int sec = (s[6] - '0') * 10 + (s[7] - '0');
return h * 3600 + m * 60 + sec;
}
int main() {
while (cin >> n... | #include <iostream>
using namespace std;
int fiboArray[44] = {0};
int fibonacci(int anySection) {
if (anySection == 0 || anySection == 1)
return (fiboArray[anySection] = 1);
if (fiboArray[anySection] == 0) {
fiboArray[anySection] = fibonacci(anySection - 1) + fibonacci(anySection - 2);
return fiboArray[anySect... | 0 | 68,329,314 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll dp[2003][2003];
int main()
{
int n, m;
cin >> n >> m;
int s[2003], t[2003];
for(int i = 0; i < n; i++) cin >> s[i];
for(int i = 0; i < m; i++) cin >> t[i];
dp[0][0] = 1;
for(int i = 0; i <= n; i++){
... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define endl "\n"
const i64 MOD = 998244353;
int main()
{
i64 N;
cin >> N;
vector<pair<i64, i64>> xy(N);
for (i64 i = 0; i < N; i++)
cin >> xy[i].first >> xy[i].second;
sort(xy.begin(), xy.end(), [](const pair<i64, i64> &l, const pair<i6... | 0 | 27,535,468 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6;
int A[N+1];
int GCD(int a,int b){
return b==0?a:GCD(b,a%b);
}
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
int n,tmp,gcd=0;
cin>>n;
for(int i=0;i<n;++i){
cin>>tmp;
++A[tmp];
gcd=GCD(tmp,gcd);
}
for(int i=2;i<=N;++i){
i... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int N;
cin>>N;
int is_reverse=0;
deque<int> deq;
rep(i,N)
{
int a;
cin>>a;
if(is_reverse)
{
deq.push_front(a);
}
else
{
deq... | 0 | 65,170,743 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
int main() {
int N;
cin >> N;
bool Prime[101];
rep(i, 101) Prime[i] = true;
Prime[0] = Prime[1] = false;
for (int i=2... | #include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
int ans=0;
while(!(a[0]==... | 0 | 90,409,596 |
#include<iostream>
using namespace std;
int main(void){
for(int i = 1;i < 10;i++){
for(int j = 1;j < 10;j++){
cout << i << 'x' << j << '=' <<i * j << "\n";
}
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#define int long long
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define rea... | 0 | 50,010,587 |
#include <cstdlib>
#include <string>
#include <iostream>
std::string get_performace(int a, int b, int c) {
std::string res;
if (a < 0 || b < 0) {
res = "F";
} else if (a + b >= 80) {
res = "A";
} else if (a + b >= 65) {
res = "B";
} else if (a + b >= 50) {
res = "C";
... | #include <iostream>
#include <algorithm>
using namespace std;
struct card{
char suit;
int value;
};
void bubbleSort(card C[], int n);
void selectionSort(card C[], int n);
bool isSame(card A[], card B[], int n);
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
card A[36], B[36];
c... | 0 | 8,862,379 |
#include <stdio.h>
int main(void) {
int i, j, x[100000], y[100000];
i = 0;
do {
scanf("%d %d", &x[i], &y[i]);
i++;
} while (!(x[i - 1] == 0 && y[i - 1] == 0));
for (j = 0; j < i- 1; j++) {
if (x[j] < y[j]) {
printf("%d %d\n", x[j], y[j]);
} else {
printf("%d %d\n", y[j], x[j]);
... | #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... | 0 | 9,429,128 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.