code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespac... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
int n;
int a_cnt[1000000 + 5];
int ft[1000000 + 5];
int t;
int main() {
cin >> n;
vector<int> a;
memset(a_cnt, 0, sizeof(a_cnt));
memset(ft, 0, sizeof(ft));
for (int ... | 0 | 17,477,473 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int n;
string s, t;
cin >> n >> s >> t;
for (int i=0 ; i<n ; i++)
cout << s.at(i) << t.at(i);
} | /*http:
#include <iostream>
#include <cmath>
#define MAX 1000000
#define hash(key,p) ((key)%(p))
#define hash_a(key) hash(key,MAX)
#define hash_b(key) (hash(key,MAX-1)+1)
#define myhash(key, n) hash_a(hash_a(key)+(n)*hash_b(key))
using namespace std;
string s[MAX];
int getKey(string value){
int key = 0;
f... | 0 | 26,881,628 |
#include<iostream>
using namespace std;
int main()
{
int i,j,s=0,t=0,a[4],b[4];
for(j=0;j<2;j++)
{
for(i=0;i<4;i++)
{
if(j==0)
{
cin>>a[i];
s=a[i]+s;
}
else
{
cin>>b[i];
t=b[i]+t;
}
}
}
if(t<s)
{
cout<<s<<endl;
}
else
{
cout<<t<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define empb emplace_back
#define mp make_pair
#define F first
#define S second
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define vpii vector<pii>
#defin... | 0 | 48,378,704 |
#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(){
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
vector<ll> sum(n+1,0);
rep(i,n){
... | #include <iostream>
#include <cstdio>
#include <climits>
using namespace std;
int main(void) {
int num;
while(cin >> num, num != 0) {
int ary[num + 1];
ary[0] = 0;
for(int r = 1; r <= num; r++) {
int input; cin >> input;
ary[r] = ary[r - 1] + input;
}
... | 0 | 64,480,589 |
#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 = 100000000;
typedef pair<int, int> P;
const int MAX_N = 1000000;
int N, M;
vector<int> vec(MAX_N);
int main() {
cin >> N >> M;
int L = 1; in... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define ... | 0 | 4,795,210 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long int ll;
#define INF 1 << 29
#define REP(i,n) for(ll i=0; i<(int)(n); i++)
#define FOR(i,k,n) for(ll i=(k);i<(int)(n);i++)
vector<bool> gen_sosuu(vector<bool> sosuu){
int size = sosuu.size();
REP(i,size){
sosuu[i] = true;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int arr[200001];
int main()
{
fast_in_out;
int n, cnt = 1;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> arr[i];
if(i > 0)
{
... | 0 | 2,694,614 |
#include <iostream>
#include <unordered_set>
#include <cstdint>
#include <vector>
#include <string>
#include <climits>
#include <set>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <numeric>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
for (int i = 1; i <= 3; i++)
{
if (a != i &&... | #include <bits/stdc++.h>
using namespace std;
int main(void){
vector<int>X(26,0);
string S;cin>>S;
for(long long i=0;i<S.size();i++){
X[(int)S[i]-97]++;
}
for(long long i=0;i<26;i++){
if(X[i]==0){
int ans=i+97;
cout<<(char)ans<<endl;
return 0;
... | 0 | 45,972,048 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n; cin >> n;
cout << 360 / gcd(360, n) << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, l, r) for (int i = l; i <= (int)(r); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define all(v) v.begin(), v.end()
#define MOD (... | 0 | 72,088,743 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long num,fin=0;
string str;
char a=str[0];
cin >> num >> str;
for (int i=0; i<num; i++) {
char b=str[i];
if (a!=b){
fin++;}
a=b;}
cout << fin;} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
struct Point {
ll x, y;
Point() : x(0), y(0) {}
Point(ll x, ll y) : x(x), y(y) {}
int quadrant() const {
if(x == 0 && y == 0){
return 0;
}
... | 0 | 45,052,380 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unsigned long long i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
ll ans = 9000000000000000000;
vector<ll> vx;
vector<ll> vy;
vector<pair<ll, ll>> vxy;
rep(i,n){
ll x, y;
cin >> x >> ... | 0 | 35,603,085 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include <bits/stdc++.h>
using namespace std;
int main(){
long N,M,L =1; cin >> N >> M;
long a[N];
for (int i =0; i<N; i++) {
cin >> a[i]; a[i] /=2; L = lcm(L,a[i]);
}
for (int i =0; i<N; i++) {
if (L / a[i] % 2 ==0) {
cout << 0 << endl;
return 0;
}
}
long ans;
if (M % (2*L) >=L... | 0 | 9,762,059 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int x;
cin >> x;
cout << (x < 1200 ? "ABC" : "ARC") << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 1e9 + 7;
const int maxn = 2000005;
void solve() {
ll n;
... | 0 | 99,810,690 |
#include<iostream>
using namespace std;
int main()
{
int m, f, r;
for(int i=0; ; i++){
cin >> m >> f >> r;
if(m==-1 && f==-1 && r==-1) break;
int a = m+f;
if(a>=80) cout << 'A' << endl;
else if(a>=65 && a<80) cout << 'B' << endl;
else if(a>=50 && a<65) cout << 'C... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << (#x) << "]: " << x << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
for (int i=0; i<1e6; i++) {
if ((int)(i*0.08) == a && (int)(i*0.1) ... | 0 | 55,396,827 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include <iostream>
#include <list>
#include <string>
using namespace std;
int main(){
int n,x,i;
list <int> a;
list<int>::iterator it;
string com;
cin>>n;
for(i=0;i<n;i++){
cin>>com;
if(com=="deleteFirst") a.pop_front();
else if(com=="deleteLast") a.pop_back();
else{
cin>>x;
if(... | 0 | 38,464,042 |
#include<bits/stdc++.h>
#define lli long long int
#define endl "\n"
using namespace std;
typedef long long int LLI;
typedef double DB;
void fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
}
bool comparator(pair<lli,lli> a,pair<lli,lli> b)
{
if(a.first>b.first)
return true;
... | #include<stdio.h>
int main () {
int matrix[3][3];
char x;
for (int i = 0 ; i < 3 ; i++) {
for (int j = 0 ; j < 3 ; j++) {
scanf("%d", &matrix[i][j]);
}
}
int n;
scanf("%d", &n);
int angka[n];
for (int i = 0 ; i < n ; i++) {
scanf("%d", &angka[i]);
for (int j = 0 ; j < 3 ; j++) {
for (int k = 0 ; k... | 0 | 87,821,085 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
string T;
cin>>S>>T;
int a[26];
for(int i=0;i<26;i++){
a[i]=-1;
}
for(int i=0;i<S.length();i++){
if(a[S.at(i)-'a']==-1){
a[S.at(i)-'a']=T.at(i)-'a';
}
if(a[S.at(i)-'a']>=0){
if(T.at(i)-'a'==a[S.at(i)-'a']){
... | 0 | 25,485,670 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,S,H,J,I;
cin >> N;
S = N / 1000;
N = N % 1000;
H = N / 100;
N = N % 100;
J = N / 10;
I = N % 10;
if (S == H && H == J ) {
cout << "Yes" << endl;
}
else if (H ==J && J == I) {
cout << "Yes" << endl;
}
else {
... | #include<bits/stdc++.h>
using namespace std;
#define DEBUG
typedef long long int ll;
typedef long double ld;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define MOD (ll)(1e9 + 7)
#define vi vector<int>
#define vii vector<vector<int> >
#define vl vector<ll>
#define vll vector<vector<ll> >
#def... | 0 | 89,176,263 |
#include <iostream>
using namespace std;
int main() {
long long n, m, k;
cin >> n >> m >> k;
cout << max(n-k, 0LL) << ' ' << max(0LL, m + min(0LL, n - k));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
const int N = 1e5 + 5;
int n, m;
vector <int> adj[N];
int col[N];
ll cnt[3];
bool val;
void dfs(int v) {
for (auto u : adj[v]) {
if(!col[u]) {
col[u] = 3 - col[v];
dfs(u);
}
else if(col[u] == col[v])
val = 0... | 0 | 57,786,612 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll a,b,x;
inline int read() {
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
inline void smax(ll &x,... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LLU long long unsigned
#define rarr(arr, n) for(int aab = 0; aab < n; aab++){cin >> arr[aab];}
#define parr(arr, n) for(int aab = 0; aab < n; aab++){cout << arr[aab] << " ";}
#define pb push_back
#define f first
#define s second
#define all(x) ... | 0 | 53,800,417 |
#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>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
ll n;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
ll ans=0;
for(ll i=1;i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int ... | 0 | 63,004,157 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int len = s.size();
bool ok = true;
if(s.at(0) != 'A') ok = false;
int cntc = 0;
for(int i = 1; i < len; i++){
if(isupper(s.at(i))){
if(i == 1 || i == len - 1 || s.at(i) != 'C') ok = false;
if(s.at(i) == 'C') cntc+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define ppp pop_back
#define fi first
#define se second
#define pii pair<int,int>
const int N = 1e5 + 5;
int a[N];
int b[500][N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r",... | 0 | 7,785,739 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
string s = " ";
string t;
cin >> t;
s += t;
int N = (int)t.size();
bool is = true;
int a = N/2;
rep(i, a){
if(s[1+i] != s[N-i]) is = false;
}
int b... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b;
int main()
{
int q;scanf("%d",&q);
while(q--)
{
scanf("%lld%lld",&a,&b);
ll s=a*b,ans;
ll t=sqrt(s);
if(t*(t+1)<s) ans=2*(t-1)+1;
else ans=2*(t-1);
if(t*t==s&&a!=b) ans--;
if(a*... | 0 | 2,120,449 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define endl '\n'
#define lli long long int
#define rep(i, s, e) for (int i = s; i < e; i++)
int main()
{
int N;
cin >> N;
string S;
cin >> S;
vector<int> R, G, B;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> v1(n);
vector<bool> ok(n,true);
int mx = 0;
REP(i,n){... | 0 | 36,958,417 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
string s;
cin >> s;
int... | #include<iostream>
#include<string>
using namespace std;
int main() {
int n;
cin >> n;
int taro = 0, hanako = 0;
for (size_t i = 0; i < n; i++){
string s, t;
cin >> s >> t;
if (s > t)taro += 3;
else if (s < t)hanako += 3;
else{
++taro;
++hanako;
}
}
cout << taro << ' ' << hanako << endl;
char c... | 0 | 58,630,948 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n);i>=(j);i--)
using ll=long long;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retu... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 9223372036854775807;
struct LL... | 0 | 78,229,737 |
#include <iostream>
using namespace std;
int main()
{
while (true)
{
int m, f, r;
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
return 0;
if (m == -1 || f == -1)
cout << "F" << endl;
else if (m + f >= 80)
cout << "A" << endl;
else if (m + f >= 65)
cout << "B"... | #include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <assert.h>
using namespace std;
typedef long long LL;
const int N=100000+10;
int n,sz[N];
pair<LL,LL> d[N];
vector<LL> g[N];
bool cmp(pair<LL,LL> p1,pair<LL,LL> p2){
return p1.second>p2.second;
}
map<LL,LL> mp;
ve... | 0 | 68,067,761 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int hig=0, ans=0;
for(int i=0; i<n; ++i){
int x;
cin >> x;
if(x>hig) ans += x-hig;
hig = x;
}
cout << ans << endl;
} | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
bool dbg = 0;
clock_t start_time = clock();
#define current_time fixed<<setprecision(6)<<(ld)(clock()-start_time)/CLOCKS_PER_SEC
#define f first
#define s second
#define mp make_pair
#define mt make_tuple
#d... | 0 | 12,113,860 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
int N;cin>>N;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x, y) min<ll>(x, y)
#define tmax(x, y, z) lmax((x... | 0 | 37,681,624 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
string s;
cin>>s;
ll ans=15-s.size();
for(ll i=0;i<s.size();i++){
if(s[i]=='o'){
ans++;
}
}
cout << (ans>=8?"YES":"NO");
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) f... | 0 | 3,070,681 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define rep(i,n) for(int i = 0 ; i < n ;i++)
int main(){
string s ;
cin >> s ;
rep(i,s.size()){
if( s[i] == ',' )cout << ' ';
else cout << s[i] ;
}
} | #include<bits/stdc++.h>
#define lli long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lli n;
cin>>n;
int a[n],i;
for(i=0;i<n;i++)
cin>>a[i];
int l=a[0]; int r=a[0];
for(i=0;i<n;i++)
{
l=min(l,a[i]);
... | 0 | 63,599,852 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, X, T;
cin >> N >> X >> T;
int a = N / X;
if(N % X != 0) T *= a + 1;
if(N % X == 0) T *= a;
cout << T << endl;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define... | 0 | 68,833,522 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
using namespace std;
using ll = long long;
using ld = long double;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);... | #include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
#include<numeric>
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
vector<ll> x(n), y(n), z(n);
... | 0 | 19,352,194 |
#include <bits/stdc++.h>
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end();
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.ti... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN 40005
#define eps 1e-12
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<... | 0 | 8,624,053 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
long long int i,s=0,j;
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j=j+i)
{ s=s+j;
}
}
cout<<s<<endl;
} | #include <iostream>
#include <string>
using namespace std;
struct Trump{
string suit;
string num;
};
void print(Trump trump[], long N){
for (long i = 0; i < N; i++){
cout << trump[i].suit << trump[i].num;
if (i < N - 1) cout << " ";
}
cout << endl;
}
void BubbleSort(Trump trump[], long N){... | 0 | 10,767,716 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int D, X;
cin >> D >> X;
int choco[110];
for(int i = 0; i < N; i++){
cin >> choco[i];
}
for(int i = 0; i < N; i++){
int niti = 1;
while(D >= niti){
niti += choco[i];
X++;
}
}
cout << X << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
struct primegroup{
vector<int> r;
primegroup(int n){
r = vector<int>(1000001, 0);
r[1] = n;
}
void unite(int x){
for(int i=2; i*i<=x; i++){
if(x%i != 0) continue;
... | 0 | 98,616,251 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll N, i; cin >> N >> i;
cout << N - i + 1 << endl;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | 0 | 37,586,508 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) sort(v.begin(), v.end())
typedef long long ll;
using Graph = vector<vector<int>>;
int main()
{
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i < n; i++)
{
for (int j = 1; j <= (n / i); j++)
{
... | #include<bits/stdc++.h>
using namespace std;
long long mod=1000000007;
long long bigmod(long long n,long long p)
{
if(p==0)return 1;
if(p%2==0)
{
long long ret=bigmod(n,p/2);
return ((ret%mod)*(ret%mod))%mod;
}
else
return ((n%mod)*(bigmod(n,p-1)%mod))%mod;
}
long long... | 0 | 12,539,987 |
#include <iostream>
#include <queue>
using namespace std;
struct pos{
int x,y;
pos(int _x,int _y){x=_x;y=_y;}
};
int a[1000][1000],m[1000][1000],sh,sw;
int ans(int p,int q,int h,int w,int count);
void map(int H,int W){
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cout << m[i][j] << " ";
}
cout<<"\n";
}
c... | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define size 5005
const long MOD = 1e9+7;
bool dp[size];
int A[size];
pair<int,int>pos[size];
signed main()
{
long test;
test=1;
while(test--){
long i,j,b,n,x,k,ans,most,index,c,maxi=0,temp,aw,bw,w,count,sum;
cin>>n>>k;
for(i=0... | 0 | 14,375,220 |
#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 ... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 37,327,873 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_e... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (int)c.size()
#define fr first
#define ... | 0 | 71,787,523 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD=1000000007;
const long double PI=3.14159265358979;
const ll MAX=200020;
int main() {
ll N;
cin>>N;
ll a[N];
ll b[N];
for(int i=0;i<N;i++){
cin>>a[i];
}
for(int i=0;i<N;i++){
cin>>b[i];
}
ll cnt=0;
for(int i=0;i<N... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc106_c.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 0 | 51,600,700 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S; int64_t K; cin >> S >> K;
int64_t sumF = 0, sumS = 0, sumT = 0;
string tmpF = S, tmpS = S + S, tmpT = S + S + S;
for (int i = 0; i < tmpF.size() - 1; i++) {
if (tmpF.at(i) == tmpF.at(i + 1)) {
sumF++;
tmpF.at(i + 1) = '0';
... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_e... | 0 | 18,230,764 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctim... | 0 | 51,514,115 |
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
set<int> chair;
for(int i=0;i<n;i++){
int l,r;
cin>>l>>r;
for(int i=l;i<=r;i++){
chair.insert(i);
}
}
cout<<chair.size()<<endl;
return 0;
} | 0 | 54,745,171 |
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 0 | 52,485,966 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>
#include<set>
#include<array>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
int main()
{
fio;
string s;
cin>>s;
ll ans = 0;
for(ll i=0;i<s.length(... | 0 | 74,288,420 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define l... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed io... | 0 | 70,507,608 |
#include "bits/stdc++.h"
using namespace std;
const int mx = 200000 + 9;
bitset <mx> mark;
int d[mx];
vector <int> adj[mx];
int main() {
int n, m; cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b; cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
mark[1] = 1;
qu... | #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int main (int argc, char *argv[]) {
int m, n_min, n_max, p;
vector<int> v;
while (cin>>m>>n_min>>n_max, m||n_min||n_max) {
for (int i =... | 0 | 72,850,169 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a) cin >>x;
long long ans = 0;
int mx = 0;
for (int i = 0 ; i < n; i++) {
if (a[i] < mx) ans += mx - a[i];
mx = max(a[i], mx);
}
cout ... | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include <queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define A... | 0 | 98,945,882 |
#include <iostream>
using namespace std;
int main() {
int i, x, y, z, ans = 0;
cin >> x >> y >> z;
for (i = x; i <= y; i++) {
if(z % i == 0)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
int main()
{
int n, ans=0;
cin >> n;
for(int i=105;i<=n;i+=2){
int count=0;
for(int j=1;j<=i;j++){
if(i%j==0)count++;
if(count >= 9)break;
}
if(count==8){
ans++;
}
... | 0 | 31,088,725 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep1(i,n) for(int i = 1; i < n; i++)
#define repv(i,n) for(int i = n-1; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
using namespace std;
typedef long long ll;
char BUF[3500000];
inline void I(int&a){scanf("%d",&a);}
in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#de... | 0 | 4,382,977 |
#include<bits/stdc++.h>
#include<unordered_map>
#include<tr1/unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int,int>>
#define vs vector<string>
#define lin1(x) ll int ... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | 0 | 15,192,386 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(void){
int n;
cin >> n;
long long ans=1, a;
bool zero = false, over = false;
rep(i, n){
cin >> a;
if(a == 0){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000006;
int a[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s,t;
cin>>s>>t;
int n = (int)s.size();
for(int i=0;i<n;i++){
if(s == t){
cout<<"Yes";
return 0;
}
t = t[n-1]+t;
t.pop_back();
... | 0 | 53,231,901 |
#include<bits/stdc++.h>
int main() {
long long num; std::cin >> num;
std::vector<long long>v(num + 1, 0);
for (long long x = 1; x <= num; x++) {
v[x]++;
for (long long z = x * 2; z <= num; z += x) {
v[z]++;
}
}
long long ans = 0;
for (long long x = 1; x <= num; x++) {
ans += (1LL * x * v[x]);
}
std::... | #include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
#define NIL -1
int main() {
LL h;
LL w;
cin >> h >> w;
LL min_num1=h*w;
LL min_num2=h*w;
LL min_num3=h*w;
LL min_num4=h*w;
LL tmp1;
LL tmp2;
LL tmp3;
LL tmp_diff;
LL ans;... | 0 | 81,547,920 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
ll ans = pow(N/K, 3);
if (K % 2 == 0) {
ans += pow((2*N/K+1)/2, 3);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n ,di = 0;
scanf("%d",&n);
vector <int> cnt(n);
for(int a,i=0; i<n; i++)
scanf("%d",&a) ,cnt[a]++ ,di = max(di ,a);
cnt[(di+1)/2] -=(di&1 ? 2 : 1);
bool poss = !cnt[(di+1)/2];
for(int i=(di+1)/2+1; i<=di; i++)
pos... | 0 | 52,507,451 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<b;i++)
int main(){
ll n,k;
cin>>n>>k;
vector<ll> a(n),b(n);
rep(i,0,n){
cin>>a[i]>>b[i];
}
vector<ll> ks(1);
ks[0]=k;
bool f=0;
rep(i,0,30){
if(k&(1<<i)){
if(f){
ks.push_back(k^(1<<i)|... | #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... | 0 | 87,253,072 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
map<int, int> mp;
for(int i = 0; i < n; i++){
int temp;
cin >> temp;
mp[temp]++;
}
int cnt = 0;
for(auto x : mp){
if(x.first < x.second){
cnt += x.seco... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int> > a(n + 1, vector<int>(n + 1, 0));
for (int i = 1; i <= n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int v;
cin >> v;
a... | 0 | 86,930,875 |
#include <iostream>
#include <stack>
#include <queue>
#include <fstream>
using namespace std;
int main(){
int ans[1024] = {0};
int dataCounter = 0;
int i = 0;
while(1){
int visited[20][20] = {0};
int data[20][20];
int x,y;
int w = 0;
int h = 0;
queue<int> xst;
queue<int> yst;
cin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = (int)1e5, MOD = (int)1e9 + 7, INF = (int)3e18;
int pref[N][5];
main() {
ios :: sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
pref[0][0] = (s[0] == 'R');
pref[0][1] = (s[0] == 'B');
... | 0 | 85,244,198 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define printYes() printf("Yes\n")
#define printNo() printf("No\n")
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
void solve()
{
int mx=0;
string s,t;cin>>s>>t;
REP(i,s.size()-t.size()+1){
int cnt=0;
REP(j,t.size()){
if(s[i+j]==t[j])cnt++;
... | 0 | 4,949,027 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int A, B;
cin >> A >> B;
int ans = -1;
for (int i = 1; i <= 1000; ++i) {
double a = i * 0.08;
double b = i * 0.1;
if ((int)a == A && (int)b == B) {
ans = i;
break;
}
}
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scan... | 0 | 29,774,102 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s, result = ""; cin >> s;
for (int i = 0; i < s.length(); i += 2) result += s[i];
cout << result << "\n";
} | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 76,913,238 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
int x,y,a,b,c;
cin >> x >> y >> a >> b >> c;
long long p[a],q[b],r[c];
for(int i=0;i<a;i++){
cin >> p[i];
}
for(int i=0;i<b;i++){
cin >> q[i];
}
for(int i=0;i<c;i++){
cin >> r[i];
}
LL ans = 0;
sort(p,p+a,greater<LL>());
sor... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int X, A, B;
cin >> X >> A >> B;
string ans;
if (B <= A) ans = "delicious";
else if (B <= A + X) ans = "safe";
else ans = "dangerous";
cout << ans << endl;
return 0;
} | 0 | 49,621,428 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin >> a >> b >> c;
char ac = a[0] -0x20;
char bc = b[0] -0x20;
char cc = c[0] -0x20;
cout << ac << bc << cc << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename TYPE>
void print_vec(const vector<TYPE>& v){
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
for... | 0 | 55,717,822 |
#include <iostream>
using namespace std;
int main() {
int house[4][3][10], n, building, floor, address, number;
for (int h = 0; h < 4; h++) {
for (int i = 0; i < 3; i++) {
for (int s = 0; s < 10; s++) {
house[h][i][s] = 0;
}
}
}
cin >> n;
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll ... | 0 | 43,324,874 |
#include <bits/stdc++.h>
int n,i=1;
main(){
std::cin>>n;
for(;(i*i+i)/2<n;i++);
for(;i>0;i--){
if(n-i>=0){
std::cout<<i<<'\n';
n-=i;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 0 | 43,949,748 |
#include <iostream>
int main() {
int n,b,f,r,v,a[4][3][10] = {};
scanf("%d", &n);
while (n--) {
scanf("%d%d%d%d", &b, &f, &r, &v);
a[b-1][f-1][r-1] += v;
}
for (int i=0; i<4; i++) {
for (int j=0; j<3; j++) {
for (int k=0; k<10; k++) {
printf(" %d",... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17;
void warshall_floyd(vector<vector<long long>> &dist, vector<vector<long long>> &prev) {
int V = dist.size();
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if ... | 0 | 10,821,786 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n ) FOR( i, 0, n )
#define REPR( i, m ) for( int (i) = (m); (i) >= 0; (i)-- )
#define REPONE( i, n ) FOR( i, 1, n + 1 )
#define ALL( a ) (a).begin... | #include <iostream>
#include <map>
#include <vector>
#include <array>
#include <string>
#include <cstdint>
using namespace std;
int main() {
int n; cin >> n;
vector<string> sv(n);
for (auto &e : sv) cin >> e;
constexpr size_t alphabet = 'z' - 'a' + 1;
auto count = [](const string &s) {
array... | 0 | 5,636,267 |
#include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
int main(void) {
int n, m, i, j, s[2003], t[2003], dp[2... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(... | 0 | 58,685,005 |
#include<iostream>
#include<string>
#include<algorithm>
#include<functional>
#include<cstring>
#include<set>
#include<map>
#include<vector>
#include<cmath>
#include<queue>
#include<cstdio>
#include<cstdlib>
#define reep(n1,n2,n3) for(int n1=n3;n1<n2;n1++)
#define rep(n1,n2) reep(n1,n2,0)
#define pb push_back
#define mp... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 0 | 20,109,737 |
#include <iostream>
using namespace std;
string shuffle(string str, int n)
{
string leftString = str.substr(0, n);
string rightString = str.substr(n, str.size());
return rightString + leftString;
}
int main()
{
string str;
int m, n;
while (true) {
cin >> str;
if (!str.compare("-"... | #include<bits/stdc++.h>
#define int long long int
#define ull unsigned long long int
#define getFaster ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define rep(i,init,n) for(int i=init;i<n;i++)
#define rev(i,n,init) for(int i=n;i>=init;i--)
#define MAXN 1200005
#define MOD 1000000007
#define f first
#d... | 0 | 15,216,549 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rrep(i,n) for (int i = 1; i <= (n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
int enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(... | 0 | 73,579,802 |
#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);
using namespace std;
int main(){
int x,t;
cin... | #include<iostream>
#include<vector>
using namespace std;
typedef long long li;
#define MOD 1000000007
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, con... | 0 | 84,870,998 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n,m;
vector<int> c;
int dp[50001][20];
void sortt(){
sort(c.begin(),c.end());
reverse(c.begin(),c.end());
}
void ume(){
for(int i=0;i<20;++i){
dp[0][i]=0;
for(int j=1;j<50001;++j){
dp[j][i]=100000;
}
}
}
void toku(){
for(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
string s, t;
cin >> s >> t;
vector<set<char>> temp1(26);
vector<set<char>> temp2(26);
rep(i, s.size()) {
temp1[s[i] - 'a'].insert(t[i]);
temp2[t[i] - 'a'].insert(s[i]);
}... | 0 | 24,726,448 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main()
{
int N,H,W,A,B,ans=0;
cin>>N>>H>>W;
for(int i=1;i<=N;i++){
cin>>A>>B;
if(A>=H&&B>=W)ans++;
}
cout<<ans<<endl;
ret... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int a, b;
cin >> a >> b;
if (a == b) cout << "Draw";
else if (a == 1) cout << "Alice";
else if (b == 1) cout << "Bob";
else if (a > b) cout << "Alic... | 0 | 53,554,329 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
using ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef... | 0 | 2,437,538 |
#include <iostream>
using namespace std;
#define MAXN 100005
#define NIL -1
struct Node{
int p, l, r;
};
Node T[MAXN];
int n, D[MAXN];
void print(int u){
int i, c;
cout << "node " << u << ": ";
cout << "parent = " << T[u].p << ", ";
cout << "depth = " << D[u] << ", ";
if (T[u].p == NIL) {
cout << "root, ";
}el... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define sum(v) accumulate(v.begin(), v.e... | 0 | 52,634,317 |
#include <bits/stdc++.h>
using namespace std;
#define FileIO freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); ios_base::sync_with_stdio(0);
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define endl "\n"
#define mod 1000000007
int main()
{
IO;
... | #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)
const int INF = 1e9;
co... | 0 | 43,656,756 |
#include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
ll cn... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
void debug(int k){
cout << k << endl;
}
int A[2000001],B[2000001];
int C[10002];
int main(){
int n;
int max = 0;
cin >> n;
for (int i = 0; i < 10002; i++) {
C[i] = 0;
}
for (int i = 0; i < n; i++) {
... | 0 | 87,114,850 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int k,s,ans=0;
cin>>k>>s;
for (int i = 0; i <= k; ++i)
{
for (int j = 0; j <= k; ++j)
{
int z = s - i - j;
if(z>=0 && z<=k){
ans++;
}
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; ... | 0 | 58,899,614 |
#include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | 0 | 19,869,578 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N ;
cin >> N ;
vector<int> B(N+1) ;
int cnt = 0 ;
for(int i = 1 ; i <= N-1 ; i++){
cin >> B.at(i) ;
}
B.at(0) = 10e6 ;
B.at(N) = 10e6 ;
for(int i = 0 ; i < N ; i++){
if(B.at(i) <= B.at(i+1)){
cnt += B.at(i) ;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,i,len1,h,t,cnt=0,cnt1=0,x,m,flag=0,k,h1=0,h2=0,od=0,ev=0,y,l;
double w;
cin>>n>>l;
ll a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=1;i<n;i++)
{
if(a[i]+a[i-1]>=l)
{
len1... | 0 | 55,156,732 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
for (int i = 0; i < 1000; i++) {
S = S.at(S.size() - 1) + S;
S.pop_back();
if (S == T) return cout << "Yes" << "\n", 0;
}
cout << "No" << "\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N;cin>>N;
set<int>s;
int a;
bool flag=true;
... | 0 | 60,453,591 |
#include <stdio.h>
#include <string.h>
int main() {
char a[100], b[100], c[100];
scanf("%s %s %s", a, b, c);
if(a[strlen(a) - 1] == b[0] && b[strlen(b) - 1] == c[0]) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
using namespace std;
#define NIL -1
#define MAX 100005
struct Node {
int parent;
int left;
int right;
};
struct Node T[MAX];
int Depth[MAX];
int n;
void rec(int... | 0 | 46,494,880 |
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(string S, string T) {
cout << T << S << endl;
}
int main() {
string S;
cin >> S;
string T;
cin >> T;
solve(S... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<l... | 0 | 52,626,149 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int a,b,c,d,e,f,g,h;
cin >> a >> b >> c >> d;
e = c - (d - b);
f = d + c - a;
g = e - (f -... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define all(x) (x).begin(),(x).end()
int main(){
int M, K; cin >> M >> K;
if (K == 0) {
REP(i,1<<M) {
cout << i << ' ' << i;
if (i != (1<<M)-1) cout << ' ';
}
cout << endl;
}... | 0 | 48,427,162 |
#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... | #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 | 33,594,371 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int n;
cin>>n;
cout<<... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#inc... | 0 | 61,210,154 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(){... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=1010010010010010000;
template<class T> inline bool chmin(T& a, T b) {
... | 0 | 33,480,362 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll mod= 1e9 + 7;
... | #include <stdio.h>
int main (){
int n,m,a,b;
scanf("%d %d",&n,&m);
if(n==1 && m==1){
puts("0");
}else{
n--;
m--;
a=(n*(n+1))/2;
b=(m*(m+1))/2;
printf("%d\n",a+b);
}
return 0;
} | 0 | 54,191,184 |
#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a>b)
printf("a > b\n");
else if(a<b)
printf("a < b\n");
else
printf("a == b\n");
return 0;
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A){rep(i,A.size()){cout << A[i] << " ";}cout << "\n";}
int f(int x){
int cnt = 0;
while (x > 0){
x /= 10;
cnt++;
}
return cnt... | 0 | 72,936,128 |
#include<cstdio>
#include<cmath>
struct Point{
double x;
double y;
void print(){
std::printf("%f %f\n",x,y);
}
};
void koch(int n,Point p1,Point p2){
Point s,t,u;
if(n == 0) return;
s.x = (2 * p1.x + p2.x) / 3.0;
s.y = (2 * p1.y + p2.y) / 3.0;
t.x = (p1.x + 2 * p2.x) / 3.0;
t.y = (p1.y + 2 * p2.... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
template<typename T =ll> using v = vector<T>;
template<typename T =ll> using vv = v<v<ll>>;
template<typename T=ll,typename U=ll> using p = pair<T,U>;
template<typename T>... | 0 | 54,642,915 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int h,i;
scanf("%d",&h);
int a[h+1];
for(i=1;i<=h;i++)
scanf("%d",&a[i]);
for(i=1;i<=h;i++){
printf("node %d: key = %d, ",i,a[i]);
if(i>1) printf("parent key = %d, ",a[i/2]);
if(2*i<=h) printf("left key = %d, ",a[2*i]);
if(2*i+1<=h... | #include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define eb emplace_back
#define endl '\n'
#define INF INT_MAX
#define nl cout << endl;
#define sz(a) (a).size()
#define len(a) (a).length()
#define all(v) v.begin(),v.end()
#define set(v) memset(v, ... | 0 | 95,786,252 |
#include <bits/stdc++.h>
#include <gmpxx.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout <... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<b;++i)
int main(){
int n,y,m,d; cin>>n;
REP(i,n){
cin>>y>>m>>d;
int ds=0;
FOR(j,y+1,1000){
if(j%3) ds+=(20+19)*5;
else ds+=20*10;
}
if(y%3){
if(m%2) ds+=21-d;
... | 0 | 40,121,521 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
constexpr auto INF = I... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define ALL(v) (s).... | 0 | 7,588,837 |
#include<bits/stdc++.h>
using namespace std;
void depth(vector<vector<vector<int>>> &g,vector<int64_t> &d,vector<bool> &c,int v,int64_t vd){
d.at(v)=vd;
c.at(v)=1;
for(auto x:g.at(v)){
int va=x.at(0);
int vc=x.at(1);
if(c.at(va))
continue;
depth(g,d,c,va,vd+vc);
}
return;
}
int main(){
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
int A[9];
int match_map[10] = {0, 2, 5,... | 0 | 69,240,213 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,d,a;
cin>>n>>d>>a;
vector<pair<ll,ll> >v;
for(int i=0;i<n;i++){
ll x,h;
cin>>x>>h;
v.pb({x,(h+a-1)/a});
}
... | #include <bits/stdc++.h>
using namespace std;
int p(int x,int y) {
int yy=y;
long long X=x,count=1;
while(yy!=0) {
if (yy%2==1) {
count*=X;
count%=1000000007;
}
yy/=2;
X*=X;
X%=1000000007;
}
return count;
}
int main() {
int X,Y;
cin >> X >> Y;
if ((X+Y)%3... | 0 | 10,719,719 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include<cstring>
#include <stack>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include <string>
const int MAXN = 2000 * 100 + 6;
typedef long long LL;
int t, n, m;
using namespace std;
struct node {
int parent = -1;
int depth = 0;
vector<in... | #include <fstream>
#include <cstring>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <climits>
using namespace std;
const int BUFFSIZE = 1 << 17;
char buffer[BUFFSIZE];
int pointer = BUFFSIZE;
char Ad... | 0 | 69,138,690 |
#include <cstdio>
int main(){
int n;
scanf("%d", &n);
short a[n+1];
int c[10001];
for(int i = 0; i < 10001; i++){
c[i] = 0;
}
for(int i = 1; i <= n; i++){
scanf("%hd", &a[i]);
}
for(int i = 1; i <= n; i++){
c[a[i]]++;
}
for(int i = 1; i < 10001; i++){
c[i] = c[i] + c[i-1];
}
short b[n+1];
for(int ... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <al... | 0 | 86,986,706 |
#include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define ALL(x) x.begin(), x.end()
#define INF 0x3f3f3f3f
#define debug(x) cout << "##### " << x << endl;
typedef long long ll;
const int N = 2e5 + 105;
int main(){
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ans = a * c;
ans = max... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 71,270,794 |
#include<bits/stdc++.h>
#define FastRead \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define endl "\n"
#define f for
using namespace std;
int main()
{
FastRead
ll int n,m,i;
cin>>n>>m;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | 0 | 94,328,062 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.