code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int w,h;cin>>w>>h;
vector<long long> p(w),q(h);
for(int i=0;i<w;i++)cin>>p[i];
for(int i=0;i<h;i++)cin>>q[i];
sort(p.begin(),p.end());
sort(q.begin(),q.end());
int pi=0;
int qi=0;
long long ans=0;
while(1){
if(pi==w){... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using v... | 0 | 30,487,564 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, k, fpb, maxim;
int a[N];
int gcd(int a, int b) {
if(b == 0) return a;
return gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> k;
maxim = INT_MIN;
for(int i = 1; i <... | #pragma GCC optimize("O3")
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <deque>
#include <set>
#include <stdlib.h... | 0 | 73,348,602 |
#include <stdio.h>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <sstream>
#define rep(i, a, b) for(... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N;
cin >> N;
f... | 0 | 54,831,522 |
#include<iostream>
using namespace std;
int main(){
int n,i,j;
cin >> n;
while(n!=0) {
long long sum[5001]={};
int b;
long long o=1<<20;
o*=-1;
cin >> sum[1];
for(i=2;i<=n;i++){
cin >> b;
sum[i]=sum[i-1]+b;
}
for(i=0;i<=n;i++){
for(j=i+1;j<=n;j++){
o=max(o,sum[j]... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int l=0;
int r=s.size()-1;
int ans=0;
while(true){
if(l>r){
break;
}
if(s.at(l)==s.at(r)){
l++;
r--;
}else if(s.at(l)=='x'){
ans++;
l++;
}else if(s.at(r)=='x'){
ans++;
... | 0 | 57,304,722 |
#include<iostream>
using namespace std;
#define rep(i,j) for(i=0;i<j;i++)
int main()
{
int n;
while(cin>>n)
{
int a,b,c,d;
int cnt=0;
rep(a,10)rep(b,10)rep(c,10)rep(d,10)
{
if(a+b+c+d==n)cnt++;
}
cout << cnt<<endl;
}
return 0;
} | #include <stdio.h>
int main(){
int total,n,Y,M,D,y,yy,I,ii,i;
total=0;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d %d %d",&Y,&M,&D);
y=Y/3;
yy=Y%3;
if(Y==1){
for(I=1;I<M;I++){
if(I%2==0){
total+=19;
}
else {
total+=20;
}
}
total+=D;
}
if(Y==2){
total=19... | 0 | 7,062,190 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 0 | 86,238,980 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=0,sum=0;
cin>>n;
int i=1;
while(true)
{
su... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <s... | 0 | 16,292,401 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C;
cin>>A>>B>>C;
if((A%2+B%2+C%2)%3==0)
cout<<(max({A,B,C})*3-(A+B+C))/2<<endl;
else if(A%2+B%2+C%2==1)
cout<<((max({A,B,C})/2*2+1)*3-(A+B+C))/2<<endl;
else if(A%2+B%2+C%2==2)
cout<<(((max({A,B,C})+1)/2*2)*3-(A+B+C))/2<<endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
#define press_F_to_pay_respect ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn for(int i=0;i<n;i++)
#define fore(i,a,b) for(int i = a; i < (b); ... | 0 | 51,452,529 |
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
int N, M, C[1 << 18];
int main() {
cin >> N >> M;
for (int i = 1; i <= M; i++) {
int num; cin >> num;
for (int j ... | #include <stdio.h>
const int MAX_V = 1000000;
int p[MAX_V+1];
int data[MAX_V];
int main() {
int i,k,a;
for(i = 2;i<=MAX_V;i++) {
p[i] = 1;
}
for(i = 2;i*i<=MAX_V;i++) {
if(p[i]) {
for(k = 2*i;k<=MAX_V;k+=i) {
p[k] = 0;
}
}
}
for(i =... | 0 | 78,047,043 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <cctype>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#de... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
long long getDigit(long long n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),... | 0 | 85,940,894 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int r,g,b,n;cin>>r>>g>>b>>n;
long long num_ways=0;
for(int i=0 ; i*r<=n;i++)
for(int j=0;j*g<=n;j++){
if(n<(i*r+j*g))continue;
else{
if((n-i*r-j*g)%b==0)num_ways++;
}
}
cout<<num_ways;
} | #include<iostream>
using namespace std;
int main(){
int n,k;
while(1){
int a[100000];
cin>>n>>k;
if(n==0&&k==0)break;
int max=0,sum;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
sum=0;
if(i+k-1<n){
for(int j=0;j<k;j++){
sum+=a[i+j];
}
if(max<sum){
max=sum;
... | 0 | 58,988,585 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,x,ans=12345678;
cin >> n >> m >> x;
vector<vector<int>> A(n,vector<int>(m));
vector<int> c(n);
for(int i=0;i<n;i++){
cin >> c[i];
for(int j=0;j<m;j++){
cin >> A[i][j];
}
}
for(int mask=0;mask<(1<<n);mask++){
vector<int>... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | 0 | 36,070,250 |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#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)
#d... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
const int32_t inf = 1001001001;
const int64_t infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}, ... | 0 | 22,380,682 |
#include<bits/stdc++.h>
using namespace std;
const int maxn = 10000000;
int eratoes[maxn+1];
long long number_of_factors(long long a){
if(a==1) return 1;
long long ret = 1;
long long temp = a;
vector<int>primes;
while(a!=1){
primes.push_back(eratoes[a]);
a/=eratoes[a];
}
sort(primes.begin(),primes.end());
i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+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
char s[N... | 0 | 89,266,786 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const ll mod = 1e9+7;
const int N=1e5+9;
int main()
{
FASTINOUT;
int x,k;
cin>>x>>k;
cout<<x-k+1;
return 0;
} | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#de... | 0 | 20,462,872 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using ld ... | #include<stdio.h>
int main()
{
int x,y;
while(scanf("%d%d",&x,&y)!=EOF)
{
if(x==0 && y==0)
return 0;
else
{
if(x>y)
printf("%d %d\n",y,x);
else
printf("%d %d\n",x,y);
}
}
} | 0 | 40,817,557 |
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define print(ele) cout << ele << endl
#define print... | #include<bits/stdc++.h>
using namespace std;
int H=1,A[2000001];
void mh(int i){
int l=i*2,r=i*2+1,lar=i;
if(A[l]>A[i]&&l<=H)lar=l;
if(A[r]>A[lar]&&r<=H)lar=r;
if(lar!=i){
swap(A[lar],A[i]);
mh(lar);
}
}
void insert(int k){
int i=H++;
A[i]=k;
while(i>0&&A[i/2]<A[i]){
swap(A[i/2],A[i]);
i... | 0 | 18,447,375 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
const long long inf = 1000000001;
const double PI = 3.14159265358979323846;
int main(void){
int x,y;
cin >> x >> y;
int ans = x + y/2;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod... | 0 | 24,318,427 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using ld = long double;
int main(){
ll h,w,x,y;
cin... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 0 | 72,966,392 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w,d;
cin >> h >> w >> d;
int a[h*w];
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
int tmp;
... | 0 | 24,943,432 |
#include<bits/stdc++.h>
using namespace std;
typedef vector< vector<int> > vvi;
typedef vector< vector<bool> > vvb;
typedef vector< vector<char> > vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef long long ll;
int main(){
int n;
cin >> n;
map<long long,long long> mp;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int main(){
string s;
cin >> s;
int ans=0,memo=0;
int now = 0;
int n = s.size();
rep(i,n){
if(s[i]-'0' != now) ans++;
n... | 0 | 29,414,696 |
#include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int a,b,c,d,e,f,g,h;
int main(){
cin>>a>>b>>c>>d>>e>>f>>g>>h;
if(a+b+c+d>e+f+g+h)cout<<a+b+c+d<<endl;
else cout<<e... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 0 | 85,169,013 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int a, b;
cin >> a >> b;
int c = (a + b) / 2;
int d = a - b;
if(d % 2... | #include <bits/stdc++.h>
using namespace std;
int a, b;
char mp[110][110];
int main() {
cin >> a >> b;
a--, b--;
for (int i = 0; i < 50; i++) {
for (int j = 0; j < 100; j++) {
mp[i][j] = '.';
}
}
for (int i = 50; i < 100; i++) {
for (int j = 0; j < 100; j++) {
mp[i][j] = '#';
}
}... | 0 | 72,501,790 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
void min_self(int& a, int b) {
a = min(a, b);
}
int main() {
int H;
int W;
cin >> H >> W;
vector<string> grid(H);
for (int row = 0; row < H; row++) {
cin >> grid[row];
}
vector<vector<int>> dp(H, vector<int>(W, INF));
dp[0][0] = grid[0][0... | 0 | 100,185,099 |
#include <iostream>
#include <climits>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.141592653589;
const int mod = 100000... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (... | 0 | 75,781,515 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 51;
const int N = 50;
ll ans[MAXN];
int main()
{
ll k; scanf("%lld", &k);
int cnt = 0; while (k % N) k--, cnt++;
for (int i = 1; i <= N; i++) ans[i] = k / N + N - 1;
for (int i = 1; i <= cnt; i++)
{
ans[i] += ... | #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 rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define tmax(a,b,c) max(a,max(b,c))
#define tmin(a,b,c) min(a,min(b,c))
#define pb pu... | 0 | 4,809,785 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=(1e5+10);
int n,r[maxn];
string s;
bool check(int a,int b,int c,char t)
{
if(t=='o'&&!b)
{
if(a==c)
return true;
return false;
}
if(t=='o')
{
if(a==c)
return false;
return true;
}
if(!b)
{
if(a==c)
return false;
return true;
}
if... | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii... | 0 | 100,075,884 |
#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 ppll pair<ll,pll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lowe... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = (int)(1 << 18);
int a[N];
bool vis[N];
vector<pii> T[N];
int ma... | 0 | 69,783,986 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int ar[3];
ar[0]=a;
ar[1]=b;
ar[2]=c;
sort(ar,ar+3);
cout << ar[0] << " " << ar[1] << " " << ar[2] << endl;
} | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 23,912,537 |
#include<bits/stdc++.h>
#define ll long long
#define inf 1000000005
#define put putchar('\n')
#define F(i,a,b) for (int i=(a);i<=(b);i++)
#define D(i,a,b) for (int i=(a);i>=(b);i--)
#define go(i,t) for (int i=head[t];i;i=Next[i])
#define sqr(x) ((x)*(x))
#define re register
#define mp make_pair
#define fi first
#define... | #include <stdio.h>
#include <stdlib.h>
int main()
{ int a,b,c;
while(~scanf("%d %d %d",&a,&b,&c))
{
if(c>=a&&c<=b)
printf("Yes\n");
else
printf("No\n");
}
return 0;
} | 0 | 83,797,026 |
#include <iostream>
int main()
{
int N, A, B, count = 0;
std::cin >> N >> A >> B;
for(int i = 1; i <= N; i++)
{
int sum = 0;
for(int k = i; k > 0; k = k / 10)
{
sum += k % 10;
}
if(sum >= A && sum <= B)
{
count += i;
}
}
std::cout << count;
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 0 | 3,657,916 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#def... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | 0 | 64,251,722 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... ... | #include<bits/stdc++.h>
using namespace std;
const int N=105;
int a[N],n,ans;
int main(){
scanf("%d",&n);
for (int i=1;i<=n;i++)scanf("%d",&a[i]);
for (int i=1,j=1;i<=n;i=j){
while (j<=n&&a[i]==a[j])j++;
ans+=(j-i)/2;
}
printf("%d\n",ans);
} | 0 | 56,400,963 |
#include<stdio.h>
#include<iostream>
#include<utility>
#include<string.h>
#include<queue>
using namespace std;
typedef long long ll;
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define FORR(i... | #include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
#define rrep(i,n,m) for(int i = (n) - 1; i >=(m); i--)
#define pvec(vec) {for (auto v: vec) cout << v << ' '; cout << endl;}
#define pivec(vec) {rep(i, 0, vec.size()) cout << i << ':' << vec[i] << ' '; cout << endl;}
using namespace std;
using ll ... | 0 | 82,561,452 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int n,a,b,i;
cin>>n;
cin>>a>>b;
int p,mark[3]={0};
for (i=0;i<n;i+... | 0 | 30,911,925 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template<typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template<typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using Pll = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>;
using vb = vector<bool>;
using boolGraph = vector<... | 0 | 13,820,291 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#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++)
const int MOD = 1e9+7;
const ll LINF = 1e18;
con... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
t... | 0 | 22,203,547 |
#include<set>
#include<iostream>
#include<map>
#include<vector>
#include<queue>
#include <utility>
#include<algorithm>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
fast;
long long a,b,c,d,e,f,target,i,j;
long long sum=0;
cin >> a >> target... | #include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) reverse((a).begin(),(a).end())
#define REP(i, n) for(int i = 0; i < n; i++)
const int MOD = 1e9+7;
typedef long long ll;
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
template<class T> inline... | 0 | 98,287,530 |
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
int main()
{
constexpr int BLDG_NUM = 4;
constexpr int FLOOR_NUM = 3;
constexpr int ROOM_NUM = 10;
int people_cnt[BLDG_NUM][FLOOR_NUM][ROOM_NUM] = {{{0}}};
int data_num;
cin >> data_num;
for (int i = 1; i <= data_num; i++)... | #include<cstdio>
int main(){
int as=0,bs=0,ins;
for(int i=0;i<4;i++){
scanf("%d",&ins);
as+=ins;
}
for(int i=0;i<4;i++){
scanf("%d",&ins);
bs+=ins;
}
printf("%d\n",as>bs?as:bs);
} | 0 | 28,911,059 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using ll = unsigned long long int;
using namespace std;
int main() {
fastIO;
int n, a, b;
cin >> n >> a >> b;
int sum... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
#include <set>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define REP(i, n) f... | 0 | 37,585,953 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
const int inf=1e9+7;
const ll INF=1LL<<61;
const ll mo... | #include "bits/stdc++.h"
using namespace std;
#define all(x) x.begin(),x.end()
#define pb push_back
#define ff first
#define ss second
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ar array
#define int long long
#define F(i,a,b) for(i=a;i<b;++i)
#define RF(i,b,a) for(i=b;i>=a;--i)
#define NL cout<... | 0 | 70,443,559 |
#include <cstdio>
const int N=100005;
int fst[N],f[N],tot=0;
struct Edge{
int to,nxt;
}e[N*4];
void addedge(int x,int y){
e[++tot].to=y;e[tot].nxt=fst[x];fst[x]=tot;
}
bool dfs(int x,int v){
f[x]=v;v^=1;
bool flag=1;
for (int i=fst[x];i;i=e[i].nxt){
int y=e[i].to;
if (f[y]==-1) flag&=dfs(y,v);
else if (f[y]... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 0 | 30,085,682 |
#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>
#include <map>
#include <numeric>
#include <functional>
using namespace s... | #include <iostream>
#include <vector>
#include <queue>
#include<map>
#include<algorithm>
#include<set>
#include<iomanip>
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1; i<=n;i++)
#define ALL(a) a.begin(),a.end()
#define PI acos(-1)
using namespace std;
template<typename A, size_t N, typename ... | 0 | 57,130,703 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
bool dp[8005][32005];
bool func(vector<ll> &v,ll p){
memset(dp,0,sizeof(dp));
dp[0][16000]=1;
for(ll i=0,n=v.size();i<n;i++){
for(ll j=0;j<=32000;j++){
if(dp[i][j]==false)continue;
dp[i+1][j+v[i]]=dp[i+1][j-v... | #include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#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 RRE... | 0 | 9,942,408 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
ll ans=0;
bool end=false;
while(!end){
end=true;
ll cnt=0;
for(int i=0... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define arr array
using namespace std;
const int e = 2e6 + 69;
const ll mod = 1e9 + 7;
ll v[e];
int n, k;
ll ans = -1e18;
void solve(int l, int r)
{
vector<ll>cur;
for(int i=1; i<=l; i++){
cur.pb(v[i]);
}
for(int i=r; i<=n; i++){... | 0 | 85,898,115 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
int N;
cin >> N;
vi A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
int prev = A[0];
rep(i, N - 1) {
if (A... | #include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <float.h>
#include <iomanip>
#include <iostream>
using namespace std;
int gcd(int x,int y){
if(y==0)return x;
return gcd(y,x%y);
}
int lcm(int x,int y){
return x*y/gcd(x,y);
}
in... | 0 | 20,318,024 |
#include "bits/stdc++.h"
using namespace std;
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin()... | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n,a,cnt=0;
map<int, int>mp;
cin >> n;
rep(i, n) {
ci... | 0 | 63,921,739 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
if (A >= 499) {
cout << "Yes" << endl;
}
else if ( (N % 500) <= A) {
cout << "Yes" << endl;
}
else {cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
using ll = long long;
int main() {
ll n, a, b;
cin >> n >> a >> b;
if(a == b){
cout << "1" << endl;
return 0;... | 0 | 21,068,406 |
#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() {
ll h,n;
... | #include <algorithm>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
vector<int> cnt(26, 0), masks;
for (char c : s) {
++cnt[c - 'a'];
i... | 0 | 23,492,065 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define pb emplace_back
#define ll long long
#define ld long double
const int INF = 2e9 + 1;
const ll INFLL = 1e18 + 1;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M);
for (int i = 0; i < M; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
vector<int> p = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> dp(N+10, -1);
dp[0] = 0;
for (int i = 0; i < N; i++) {
for ... | 0 | 12,417,662 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
int answer = 0;
string op;
cin >> A >> op >> B;
if (op == "+") {
answer = A + B;
}
if (op == "-") {
answer = A - B;
}
cout << answer << endl;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 | 15,352,683 |
#include <cstdio>
using namespace std;
#define MAX_N (105)
bool G[MAX_N][MAX_N];
int main()
{
int n;
scanf("%d", &n);
for ( int i = 0; i < n; i++ ) {
int u, k;
scanf("%d %d", &u, &k);
for ( int j = 0; j < k; j++ ) {
int v;
scanf("%d", &v);
G[u-1][v-1] = true;
}
}
for ( int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin... | 0 | 31,001,784 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n){
cin >> a[i];
}
sort(a.begin(),a.end());
int tairyoku = 0;
ll minimum = 1e18;
int place;
rep(i,100){
rep(j,n){
tair... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 9223372036854775807;
ll N, K;
vector<ll > X;
vector<ll > Y;
ll check(ll x1, ll x2, ll y1, ll y2){
ll c... | 0 | 34,133,637 |
#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) (v).begin(),(v).end()
#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, typen... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll a[100005];
ll p[100005];
ll S[100005];
ll ans= 0;
int main(){
scanf("%d",&n);
for (int i = 0; i <= n; i++){
scanf("%lld",&a[i]);
}
for (int i = n; i >= 0; i--){
p[i] = p[i+1]+a[i];
}
for (int i = 0; i ... | 0 | 100,321,457 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n,r; cin >> n >> r;
int ans=r;
if(n<10) ans = r+100*(10-n);
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1e18;
typedef pair<char,ll> pcl;
typedef vector<pcl> vpcl;
vpcl rle(string s) {
vector<pair<char,ll>> res;
char temp=s[0];
ll count=0;
for... | 0 | 96,765,751 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
cout << n / 3;
return 0;
} | #include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cl... | 0 | 93,389,189 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int n;
struct xydata {
int x, y;
};
bool cmp1 (const xydata &left, con... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define pi 3.14159265359
#define mk(arr,n,type) type *arr=n... | 0 | 84,575,320 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
using P=pair<long long,long long>;
typedef unsigned long long ull;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> light(m,vector<int>(0));
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int s;
cin >> s;
light[i].pu... | 0 | 44,950,666 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
struct Heap{
vector<int> Array;
int pai(int input){
return (input - 1)/2;
}
int filhoEsquerdo(int input){
return (2*input + 1);
}
int filhoDireito(int input){
return (2*input + 2);
}
void HeapifyRemover(int arrumar){
int esque... | 0 | 52,217,318 |
#include <stdio.h>
int main(){
char inp[20];
scanf("%s", &inp);
inp[5]=' ';
inp[13]=' ';
printf("%s", inp);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int l = s.size();
string ans = "AC";
if (s[0] != 'A')
{
ans = "WA";
}
int cnt = 0;
for (int i = 1; i < l; i++)
{
if (isupper(s[i]))
{
if (i == 1 || i == l - 1 || s[i... | 0 | 24,765,782 |
#include<cstdio>
long long x,y;
int main() {
scanf("%lld %lld",&x,&y);
if(x-y>1||y-x>1)
printf("Alice\n");
else printf("Brown\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
template <typename T, typename U> std::istream&operator>>(st... | 0 | 42,088,755 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int mod = 1e9+7;
int main() {
ll n;
cin >> n;
if (n % 2 == 1) {
cout... | 0 | 98,140,781 |
#include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
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... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include <cmath>
#include <limits>
#include <utility>
#include <map>
#include <iomanip>
#include <queue>
#include <cctype>
#include <stack>
#include <random>
#include <list>
#include <numeric>
#define rep(i,p,q) for(ll i = p;i < q;i++)
#define ll ... | 0 | 75,978,017 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | 0 | 40,316,607 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define INF (1<<30)-1
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<int> r(N + 1), g(N + 1), b(N + 1);
for (int i = 1; i < N + 1; i++) {
r[i] += r[i - 1] + (S[i - 1] == 'R');
g[i] += g[i - 1] + (... | 0 | 10,742,314 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string lis;
cin>>lis;
bool ans=true;
ll i;
for(i=0;i<3;i++)
{
if(lis[i]=='7')
{
ans=true;
break;
}
else
{
ans=false;
}
}
if(ans==true)
{
cout<<"Yes"<<"\n";
}
... | #include<iostream>
#include<fstream>
#include<vector>
#include<map>
#include<algorithm>
#include<set>
#include <cmath>
#include<string.h>
#include <stdio.h>
#include <unordered_map>
#include <queue>
#include<climits>
#include <iomanip>
#include<iostream>
#include<fstream>
#include<vector>
#include<map>
#include<algorit... | 0 | 10,388,657 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n , m;
cin >> n >> m;
int s = 0;
while (m--) {
int d;
cin >> d;
s += d;
}
if (s > n) {
cout << -1 << endl;
} else {
cout << (n - s) << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
int a[2020];
int b[2020];
int dp[2020][2020];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=0,m=0;
cin>>n>>m... | 0 | 20,756,871 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long int;
using namespace std;
ll mod=1e9+7;
int main() {
string s,t;
int ans=0;
cin >> s >> t;
int a=s.size();
rep(i,a){if(s[i]==t[i])ans++;}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T>
class LazySegmentTree{
public:
enum Operation {
SUM,
MAX,
MIN
};
LazySegmentTree(const vector<T>& v, string operation){
if (operation == "sum") m_oper... | 0 | 68,263,555 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[1]-a[0]+a[2]-a[1];
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int H,W,M;
cin>>H>>W>>M;
vector<pair<int,int>>items(M);
vector<int>Hcount(H),Wcount(W);
int Hmax=-1,Wmax=-1;
for(int i=0;i<M;i++)
{
cin>>items[i].first>>items[i].second;
}
for(int i=0;i<M;i++)
{
items[... | 0 | 26,463,501 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
int solve(int K) {
deque<ii> dq;
vector<int> vis(K, 0);
dq.push_front(ii(1, 1));
while (!dq.empty()) {
ii p = dq.front(); dq.pop_front();
int curr = p.first, cnt = p.second;
if (curr == 0) return cnt;
vis[curr] = 1;
int next = (curr... | #include <iostream>
void countingSort(int *A, int *B, int k, int n){
int i;
int *C;
C = new int[k+1];
for(i=0;i<k+1;i++){
C[i] = 0;
}
for(i=0;i<n;i++){
C[A[i]]++;
}
for(i=1;i<k+1;i++){
C[i] = C[i] + C[i-1];
}
for(i=n-1;i>=0;i--){
B[C[A[i]]-1] = A[i... | 0 | 43,834,738 |
#include<bits/stdc++.h>
#define pii pair<int,int>
#define int long long
#define cl(x,y) memset(x,y,sizeof(x))
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define lson x<<1,l,mid
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int main() {
int N;
cin>>N;
vector<string>S(N);
vector<int>ans(26);
rep(i,N){
vector<int>cnt(26);
rep(j,... | 0 | 14,051,482 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
... | #include <iostream>
#include <vector>
#include <algorithm>
#define In_Heap(n,i) ((-1)<(i))&&((i)<(n))
#define lt(i,j) ((i)>(j))
#define Parent(i) ((i-1)>>1)
#define Last_Internal(n) Parent(n-1)
#define LChild(i) (((i)<<1)+1)
#define RChild(i) ((1+(i))<<1)
#define Parent_Valid(i) (0<i)
#define LChildValid(n,i)... | 0 | 33,022,959 |
#include <algorithm>
#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>
#incl... | #include <bits/stdc++.h>
#define mem(i,a) memset(i,a,sizeof(i))
#define PI acos(-1.0)
#define DMAX 100000+5
#define MOD 998244353
#define eps 1e-8
#define mp make_pair
#define pb push_back
#define INF 1000000000+9
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
inline void ... | 0 | 68,615,209 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if(a % 3 == 0){
cout << "Possible" << endl;
}else if(b % 3 == 0){
cout << "Possible" << endl;
}else if((a + b) % 3 == 0)... | #include <bits/stdc++.h>
#define mp make_pair
#define f1 first
#define f2 second
#define pb push_back
#define pii pair<int ,int>
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int mox=1e5+9;
vector<int> v[mox];
bool ok[mox];
bool ans;
voi... | 0 | 75,574,974 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fa... | #include <algorithm>
#include <vector>
#include <string>
#include <ctype.h>
#include <set>
#include <map>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<time.h>
#include<string>
#include<stack>
#include<cmath>
#include<iostream>
#include<cstring>
#include<complex>
#include<bitset>
#include <climits>
#inclu... | 0 | 92,270,969 |
#include <iostream>
#include <vector>
#include <map>
#include <cmath>
#include <math.h>
#include <algorithm>
using namespace std;
int n = 0;
int main() {
unsigned long long A, B, K;
cin >> A >> B >> K;
for (unsigned long long i = 0; i < K; i++) {
n = 0;
if (i % 2 == 0) {
if (A % 2 != 0) A--;
n = A... | #include <iostream>
#include <vector>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <unordered_map>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll sz;
ll power(ll x, ll y){
ll ret = 1;
x %= MOD;
while(y > 0){
... | 0 | 5,478,491 |
#include <iostream>
using namespace std;
int main(void){
string c, s;
cin >> c >> s;
int ans = 0;
if(c[0] == s[0]) ans++;
if(c[1] == s[1]) ans++;
if(c[2] == s[2]) ans++;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | 0 | 14,295,525 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii;... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
constexpr int ms = 1001;
constexpr ll mod = 1e9+7;
void solve() {
int h, w;
cin >> h >> w;
ll dp[ms][ms];
memset(dp, -1, sizeof(dp));
vector<string> vs(h);
for (int i = 0; i < h; ++i) {
cin >> vs[i];
}
function<ll... | 0 | 13,389,270 |
#include <bits/stdc++.h>
#define lowbit(i) ((i)&(-i))
#define ls (p << 1)
#define rs (p << 1 | 1)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int MAXN = + 15;
int main(... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
#include <algorithm>
#include <vector>
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 INF=... | 0 | 32,481,547 |
#include <vector>
#include <iostream>
#include <functional>
using namespace std;
void topological_sort(vector<vector<int>> G, vector<int>& ans) {
vector<bool> seen(G.size());
function<void(int)> visit;
visit = [&](auto key) {
if (seen[key])
return;
seen[key] = true;
for (... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv)
{
int A, B, X, flag = 0;
cin >> A >> B >> X;
for (int i = 0; i <= B; i++)
{
if (A + i == X)
{
flag = 1;
break;
}
}
if (flag)
cout << "YES" << endl;
else
... | 0 | 10,458,637 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<list>
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
int main(){
int n;
ll k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++) ... | #include <bits/stdc++.h>
#include <vector>
#include <math.h>
using namespace std;
int main(){
string s; cin>>s;
int n = s.length(),flag = 0;
if(s[0] != 'A'){
flag = 1;
cout<<"WA"<<endl;
return 0; }
int cnt=0,pos=-1;
for(int i=2;i<n-1;i++){
if(s[i] == 'C'){
cnt++;
... | 0 | 44,486,457 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define rep(n) for( int i = 0 ; i < n ; i++ )
#define REP(n) for( int i = 1 ; i <= n ; i++ )
#define repll(n) fo... | #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... | 0 | 73,174,801 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
int a, b;
long long c[100001] = {0};
for(int i = 0; i < n; i++) {
cin >> a >> b;
c[a] += b;
}
for(in... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int C[510], S[510], F[510];
for (int i = 0; i < N-1; i++){
cin >> C[i] >> S[i] >> F[i];
}
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = i; j < N-1; j++) {
if (sum < S[j]) {
... | 0 | 80,370,460 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
long long int mod_pow(long long int x, long long int n, long long int p) {
long long int res = 1;
... | 0 | 42,465,458 |
#include <bits/stdc++.h>
#include <iostream>
#include <ctime>
#include <atcoder/all>
using namespace std;
#define _LL long long
#define rep(i, n) for (_LL i = 0; i < (_LL)(n); i++)
#define vecrep(itr, v) for (auto itr = (v).begin(); itr != (v).end(); itr++)
using namespace atcoder;
int main()
{
int n, q; cin >> n >... | #include <bits/stdc++.h>
using namespace std;
bool Check(char s){
if(48 <= (int)s && (int)s <= 57) return true;
else return false;
}
int main(void){
int A,B;
string S;
cin >> A >> B >> S;
if(S[A] != '-'){
cout << "No" << endl;
}
else
{
int len = S.size();
for(int i=0;i<len;i++){
... | 0 | 64,004,840 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int orig[]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
vector<int> a(orig,orig+32);
int input;
cin>>input;
cout<<a.at(input-1)<<endl;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 0 | 50,567,628 |
#include <bits/stdc++.h>
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define set_zero(a) memset(a,0,sizeof(a));
#define ll long long int
#define PI 2 * acos(0.0)
#define MAX 10000000000000000
#define in(a) scanf("%d",&a);
#define out(a) printf("%d",a);
#define INF 1000000
#define M 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N,L,T;
cin >> N >> L >> T;
vec<ll> X(N),W(N);
map<ll,ll> mp;
vvec<ll> list(2);... | 0 | 17,552,756 |
#include <stdio.h>
#include <cstring>
using namespace std;
int get_index(int value, int dice[]){
for(int i = 0; i < 6; i++){
if(dice[i] == value){
return i + 1;
}
}
}
bool match_pattern(int upper_key, int front_key, int pattern[]){
for(int i = 0; i < 5; i++){
if(pattern[i... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <functional>
#include <casse... | 0 | 75,244,031 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> C(N + 1);
for (int i = 0; i < N; i++) {
int A;
cin >> A;
C[A]++;
}
vector<int> D(N + 1);
for (int i = 1; i <= N; i++) {
D[C[i]]++;
}
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#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 MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b;... | 0 | 51,433,613 |
#include <iostream>
#include <string>
#include <ios>
using namespace std;
struct LinkedList
{
struct Node
{
Node(int k): v(k), prev(0), next(0){}
int v;
Node* prev;
Node* next;
};
LinkedList(): front(0), last(0){}
~LinkedList(){
Node* p = 0;
Node* n = front;
while(n){
p = n;
n = n->next;
del... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "";
for (char c : s) {
switch (c) {
case '0':
ans += "0";
break;
case '1':
ans += "1";
break;
case 'B':
... | 0 | 20,500,315 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[5];
for (int i = 0; i < 5; i++){
cin >> a[i];
}
sort(a, a + 5);
for (int i = 4; i > 0; i--){
cout << a[i] << " ";
}
cout << a[0]<<endl;
} | #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 int long long
#define db double
#define mod 1000000007
#define pb push_back
#define pp pair<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repe(i,a,b)... | 0 | 98,789,824 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll op(ll n) {
ll k = n/2;
if(n%2) {
return k*(k+1);
} else {
return k*k;
}
}
ll get(ll val) {
ll s = 0, e = 3e9;
ll ls = 0;
while(s <= e) {
ll m = (s+e)/2;
if(op(m) >= val) {
e = m-1;
} else {
ls = m;
s = m+1;
}
}
return l... | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
vector<long long int> c;
vector<vector<long long int>> hoge;
vector<long long int> ans;
void saiki(long lon... | 0 | 80,766,931 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int targetAmount, yen1;
cin >> targetAmount >> yen1;
int surplus = targetAmount % 500;
if (yen1 >= surplus) { cout << "Yes" << endl; }
else { cout << "No" << endl; }
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 91,939,572 |
#include <iostream>
#include <stack>
int main(){
std::stack<int> trains;
int in;
while(std::cin >> in){
if(in == 0){
std::cout << trains.top() << std::endl;
trains.pop();
}
else
trains.push(in);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
while(n > 0){
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int ans = 101010101;
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
ans = min(an... | 0 | 16,726,289 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18 + 5;
int n, k;
ll ans = INF;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
vector<pair<ll, ll>> a(n);
vector<ll> x(n), y(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].secon... | 0 | 74,810,639 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
string S;
cin >> S;
ll K;
cin >> K;
char ans;
for (int i = 0; i < K; i++)
{
if (... | #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()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, H;
cin >> N >> H;
vector<ll> a(N), b(N);
REP(i, N) cin >> a[i] >> b[i];... | 0 | 3,096,954 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n,m;
cin>>n>>m;
ll vec[n];
ll ans=0;
for(int i=0;i<n;i++){
cin>>vec[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<=n-i;j++){
if(i+j>m){
continue;
}
ll vecb[i+j]={};
for(int k=0;k<i;k++){
... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 0 | 37,249,871 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d %d", &a, &b)
#define scan3Int(a, b, c) scanf("%d %d %d", &a, &b, &c)
using namespace std;
int main() {
char n[4];
scanf("%s", n);
... | 0 | 2,584,940 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,ans=0;
string s;
cin >> n >> s;
for(int i=0;i<1000;i++){
string pass = to_string(i);
if(int(pass.size()) == 1) pass = "00" +pass;
else if(int(pass.size()) == 2) pass = "0" +pass;
auto pos1 = s.find(pass... | #include <bits/stdc++.h>
#define fast_io ios :: sync_with_stdio(false);
using namespace std;
int main() {
cout << fixed << setprecision(3);
fast_io;
string s; cin >> s;
int n = 0;
for (int i = 0 ; i<4 ; i++){
for (int j = 0 ; j<4 ; j++){
if (s[i] == s[j])
n++;
}
}
if (n == 8)
cout << "Yes\... | 0 | 59,895,777 |
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
ll gcd(ll a , ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll lcm(ll... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | 0 | 46,611,562 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.