code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a==b && b==c) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
using namespace std;
int decode(string s)
{
int sum = 0, num = 1;
for(int i=0; i<s.length(); i++){
char c = s[i];
switch(c){
case 'm':
sum += 1000 * num;
num = 1;
break;
case 'c':
sum += 100 * num;
num = 1;
break;
case 'x':
sum += 10 ... | 0 | 15,923,689 |
#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... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(... | 0 | 76,693,037 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n,L;
cin >> n >> L;
vector<int> v(n);
rep(i,n)cin >> v[i];
int k ... | #include <iostream>
using namespace std;
int main(void)
{
int N;
cin >> N;
if (N < 105)
{
cout << 0 << endl;
}
else
{
int valNum = 0;
for (int i = 105; i <= N; i += 2)
{
int num = 0;
for (int j = 1; j <= N; j++)
{
... | 0 | 5,576,481 |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define endl '\n'
#define pii pair<long long int,long long int>
#define vi vector<ll>
#define all(a) (a).begin(),(a).end()
#define F first
#define S s... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int d;
cin>>d;
if(d == 25){ cout<<"Christmas"<<endl; }
else if(d == 22){ cout<<"Christmas Eve Eve Eve"<<endl; }
else if(d == 23){ cout<<"Christmas Eve Eve"<<endl; }
else{ cout<<"Christmas Eve"<<endl; }
return 0;
} | 0 | 13,742,571 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int ans = INT_MAX;
rep(i, S.size() - 2) { ans = min(ans, abs(stoi(S.substr(i, 3)) - 753)); }
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#de... | 0 | 43,403,370 |
#include <iostream>
int main(int argc, char const* argv[])
{
int num;
long max = -10000000, min = 10000000, sum = 0;
int input;
std::cin >> num;
for (size_t i = 0; i < num; i++)
{
std::cin >> input;
if( max < input)
max = input;
if (min > input)
min = input;
sum += input;
}
std::cout << min << " "... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | 0 | 97,629,177 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define PI 3.14159265358979323846
#define lp(i,n) for(int i = 0; i <n;i++)
#define rlp(i,n) for(int i = int(n);i >= 0;i--)
#define range1(i,a,b,c) for(int i = int(a);i... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 93,377,903 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
if(x>=400&&x<600)
cout << "8" << endl;
if(x>=600 && x<800)
cout << "7" << endl;
if(x>=800 && x<1000)
cout << "6" << endl;
if(x>=1000 && x<1200)
cout << "5" << endl;
if(x>=1200 && x<1400)
cout << "4" << endl;
if... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
ll dx[4]={0,1,-1,0};
ll dy[4]={1,0,0,-1};
signed main(){
ios::sync... | 0 | 8,120,297 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
void llchmin(ll &a, ll b){
if(a > b)
a = b;
}
... | 0 | 69,485,316 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
string s; cin>>s;
int ans=0;
while(s.size()>1){
char f=s.front(),b=s.back();
if(f==b... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.en... | 0 | 41,006,217 |
#include <iostream>
using namespace std;
int main() {
int n;
while ( cin >> n, n ) {
int m = 10000, M = 0, sum = 0;
for (int i = 0; i < n; ++i) {
int v; cin >> v;
sum += v;
m = min(m, v);
M = max(M, v);
}
cout << (sum - m - M) / (n-2) << endl;
}
} | #include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long ll;
#define INF ((ll)10000000000)
#define MAX_N (110)
typedef struct {
ll r;
ll c;
} Mat;
int n;
Mat M[MAX_N];
ll dp[MAX_N][MAX_N];
ll dfs(int i, int j)
{
if ( j - i == 1 ) return 0;
else if ( dp[i][j] ) return dp[i][j];
... | 0 | 22,604,165 |
#include <bits/stdc++.h>
using namespace std;
#define ii pair<int,int>
int n,l,t;
int pos[100005];
int dir[100005];
ii fin[100005];
int norm(long long i,int j){
i%=j;
if (i<0) i+=j;
return i;
}
main(){
scanf("%d%d%d",&n,&l,&t);
for (int x=0;x<n;x++){
scanf("%d%d",&pos[x],&dir[x]);
}
for (int x=0;x<n;x++){
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
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-... | 0 | 77,972,280 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n'... | 0 | 22,422,425 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<ll>vec... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i... | 0 | 50,752,654 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#def... | 0 | 13,677,454 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
#define rep(i,n) for (i... | #include<bits/stdc++.h>
#define int long long
using namespace std;
struct S{int a,b,c,d;};
bool operator<(S a,S b){
if(a.a!=b.a)return a.a<b.a;
if(a.b!=b.b)return a.b<b.b;
if(a.c!=b.c)return a.c<b.c;
return a.d<b.d;
}
bool operator==(S a,S b){
return a.a==b.a && a.b==b.b && a.c==b.c && a.d==b.d;
}
signed main... | 0 | 70,616,453 |
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<string> a(n), b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
bool match;
string ans... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
c... | 0 | 19,218,795 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 100010
using namespace std;
int n,l,q;
int a[maxn],tp[maxn][25];
void init(){
int to=1;
for(int t=1;t<=n;++t){
while(to<n&&a[t]+l>=a[to+1])to++;
tp[t][0]=to;
}
for(int t=n;t>=1;--t){
for(int i=1;i<=20;++i){
tp[t][i]=... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define SAY... | 0 | 57,953,961 |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define F first
#define S second
#define C continue
#define G goto done
#define pb push_back
#define pf push_front
#define p... | #include<bits/stdc++.h>
#include<vector>
using namespace std;
#define lli long long int
#define test lli t;cin>>t;while(t-->0)
#define ainput int n;cin>>n;int a[n];for(int i=0;i<n;i++){cin>>a[i];}
#define vec vector<lli>v;
vec
#define avinput int n;cin>>n;int a[n];for(int i=0;i<n;i++){cin>>a[i];v.push_... | 0 | 73,972,680 |
#include<iostream>
#include<vector>
#include<string>
#include<bitset>
#include<algorithm>
#include<map>
#include<queue>
#include<cmath>
#include<set>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
int h, w,m;
cin >> h >> w >> m;
vector<int> H(h),W(w);
set<pair<int, int>> data;
int temp0, t... | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
int main()
{
ll n;cin >> n;
ll x;cin >> x;
vector<ll> b(n+1);
vector<ll> p(n+1);
b[0] = 1;
p[0] = 1;
rep(i,n) {
b[i+1] = b... | 0 | 34,068,250 |
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int m, n_mi, n_ma;
while (cin >> m >> n_mi >> n_ma, m || n_mi || n_ma) {
vector<int> p(m);
for (int i = 0; i < m; ++i) {
cin >> p[i];
}
int ma = -1;
int res;
for (int i = n_mi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
int main() {
ios::sync_with_stdio(0);cin.tie(0);
ll n,l,t;
cin >> n >> l >> t;
vl wa,wb;
for(int i=0;i<n;i++) {
ll x, dir;
cin >> x >> dir;
if(dir == 1) {
wa.push_back(x);
} else {
wb.push_back(x);
}
}
ll o... | 0 | 40,881,123 |
#include <fstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
long long f = 1;
while (n > 0) {
f *= n--;
}
cout << f << endl;
} | #include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--... | 0 | 91,997,026 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll MOD = (ll)1e9 + 7;
const int MAX = 2020;
vector<int> fact,invf;
ll pwr(ll a, ll n){
if(n==0) return 1;
ll q = pwr(a,n/2);
q = q * q % MOD;
if(n&1) q = q * a % MOD;
return q;
}
ll inv(ll a){
return pwr(a,MOD-2);
}
ll add(ll a, ll b){... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | 0 | 2,821,587 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int w, h;
cin >> w >> h;
vector<ll> p(w), q(h), s(h + 2);
ll ans = 0;
rep(i, 0, w) {
cin >> p[i];
ans... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
int main()
{
IOS;
int k;cin>>k;
string s;cin>>s;
if(s.size()<=k)
{
cout<<s<<endl;
return 0;
}
else
{
... | 0 | 38,172,476 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
while (scanf("%d %d", &n, &m) && n){
pair<int, int> P[100000];
int ans = 0;
for (int i = 0; i < n; i++){
int a, b;
scanf("%d %d", &a, &b);
ans += a * b;
P[i] = make_pair(-... | #include <iostream>
#include <climits>
using namespace std;
int main(){
int n;
int res[20];
int numres = 0;
while(1){
cin >> n;
if(n==0){
break;
}
int max = INT_MIN;
int min = INT_MAX;
int total = 0;
int read;
for(int i=0; i<n; ... | 0 | 45,881,092 |
#include<iostream>
#include<vector>
using namespace std;
typedef long long li;
#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, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts.... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans;
string s;
bool l,r,c;
while(1){
cin>>n;
if(n==0) break;
l=r=false;
c=true;
ans=0;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu") l=true;
else if(s=="ld") l=false;
else if(s=="ru") r=true;
else if... | 0 | 74,858,458 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
vector<int> x = {1,-1,0,0};
vector<int> y = {0,0,-1,1};
int main(){
map<ll,ll> data;
ll n;
c... | 0 | 15,676,753 |
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = to - 1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#d... | 0 | 40,842,241 |
#include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
int ans = (a + b) / 2;
cout << ans + ((a + b) % 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
void st()
{
cout<<"setwise coprime";
}
void pr()
{
cout<<"pairwise coprime";
}
void no()
{
cout<<"not coprime";
}
bool primechk[1000007];
map<long long,long long> mp;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
long long n,i,x,cnt,j,bb=... | 0 | 68,237,582 |
#include <cstdio>
using namespace std;
int main(){
double x1, y1, x2, y2, x3, y3, xp, yp;
double X1, Y1, X2, Y2, X, Y, s, t;
while((scanf("%lf%lf%lf%lf%lf%lf%lf%lf", &x1, &y1, &x2, &y2, &x3, &y3, &xp, &yp)) != EOF){
X1 = x2 - x1; Y1 = y2 - y1;
X2 = x3 - x1; Y2 = y3 - y1;
X = xp - x1; Y = yp - y1;
s = (X * Y2... | #include <iostream>
#include <stdio.h>
int main(){
char a[21];
int i;
scanf("%s",a);
for(i=0;a[i]!='\0';i++);
if(i>0) i--;
for(;i>=0;i--) std::cout << a[i];
std::cout<<std::endl;
return 0;
} | 0 | 2,219,802 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define pb(x) push_back(x)
#define vll vector<long long>
#define pll pair<long long, long long>
#define mll map<long long, long long>
#define sz(v)... | #include<iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include<map>
#include<cstring>
#include<iomanip>
#include <string>
#include <vector>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long unsigned llu;
typedef long double ld;
#define ll long long
#define PI 3.1... | 0 | 68,818,475 |
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
using namespace std;
bool isPalindrome(string s){
string t = s;
reverse(t.begin(), t.end());
return t == s;
}
void Main() {
string S;
cin >> S;
int N = S.size();
if (!isPalindrome(S)) {
cout << "No" << endl... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
using Graph = vector<vector<ll>>;
int main(){
int n; cin>>n;
int k; cin>>k;
if (k > (n-2)*(n-1)/2)
{
cout << -1 << endl;
return 0;
}
vector<pair<int,int>> e;
for (size_t i = 2; i <= n; i++)
{
pair<int,int> tmp;
tmp = mak... | 0 | 84,889,722 |
#include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(auto i=0;i<n;i++)
#define s(c) static_cast<int>((c).size())
struct Node{
int key;
Node *l;
Node *r;
Node *p;
};
Node *nil = new Node{INT_MAX};
Node* get(Node *node, int i){
stack<bool> s;
do{
s.push(i%2 ? true : false);
}while((i/=2) != 0);
s.po... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end()))
#define POSL(x,v) (lower_bound(x.begin(),x.... | 0 | 9,323,474 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000... | #include <bits/stdc++.h>
#define fst first
#define snd second
#define ll long long
#define ld long double
#define pb push_back
#define emp emplace_back
#define pii pair<int, int>
#define usg unsigned
#define sg signed
#define mp make_pair
using namespace std;
void setIO(){
ios::sync_with_stdio(0);
cin.tie(0); cout.ti... | 0 | 48,164,070 |
#include <cstring>
#include <string>
#include <memory>
#include <iostream>
constexpr int max_size()
{
return 1000003;
}
constexpr int null_val()
{
return -1;
}
class dictionary {
public:
dictionary()
: _data()
{
for (int i = 0; i < max_size(); ++i) {
_data[i] = null_val();
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vpii;
typedef vector<pair<ll,ll> > vpll;
const int MOD=1e9+7;
const int MAX=1e5+5;
const double PI= acos(-1.0);
const long double EPS=1e-10;
const int64_t INF=1e18+10;
#define fasti... | 0 | 75,577,909 |
#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (in... | #include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int n,ans=0;
scanf("%d",&n);
int a[n];
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++){
int minj=i;
int flag=0;
for(int j=i... | 0 | 15,135,498 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int s;
cin >> s;
vector<int> v = { s };
int ans = 0;
while (1) {
int n, p;
p = v.at(v.size() - 1);
if (p % 2) n = 3 * p + 1;
else n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<ll, ll> P;
int main(){
ll n;
cin >> n;
vector<ll> c(n);
vector<ll> s(n);
vector<ll> f(n);
rep(i,n-1){
cin >> c[i] >> s[i] >> f[i];
}
rep(i,n-1){
... | 0 | 54,858,085 |
#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++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 31,462,334 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
template <class T = int>T in(){
T x;
cin >> x;
return (x);
}
signed main(){
cin.... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 70,147,440 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define N 100
LL n,a[N],ans;
int main(){
scanf("%lld",&n);
for (LL i=1;i<=n;++i) scanf("%lld",a+i);
while (1){
bool fl=0;
for (LL i=1;i<=n;++i)
if (a[i]+ans>=n){
fl=1;
LL t=(a[i]+ans)/n;
ans+=t;
a[i]-=t*(n+1);
}
if (!fl) b... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | 0 | 71,648,688 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 24,821,936 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[])
{
int a = 0;
string s, t;
cin >> s >> t;
for(int i = 0; i < s.length(); i++)
{
a += (s[i] != t[i]);
}
cout << a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int r,g,b,n;
cin >> r >> g >> b >> n;
int ans = 0;
for(int i = 0; i <= 3000; i++){
for(int j = 0; j <= 3000; j++){
int l = 0; int R = 3001;
while(R-l > 1){
int mid = (l+R)/2;
if... | 0 | 68,303,816 |
#include <bits/stdc++.h>
#define mx 300005
using namespace std;
int a[mx], n;
vector<vector<bool> > vis(mx, vector<bool> (20, false));
vector<vector<pair<int,int> > > memo(mx, vector<pair<int, int> > (20, {0, 0}));
void dp(int num, int pos) {
if(pos == 0) {
memo[num][0].first = a[num];
vis[num][0] = true;... | #include <memory.h>
#include <ctime>
#include <random>
#include <iomanip>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector... | 0 | 96,601,037 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | #include <bits/stdc++.h>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ld long double
#define ull unsigned long long
#define pi std::pair<int, int>
#define mp std::make_pair
#define stdabs std::abs
... | 0 | 98,634,463 |
#include<iostream>
using namespace std;
int main() {
int n,x;
int num = 0;
while (1) {
num = 0;
cin >> n >> x;
if ( n == 0 && x == 0 ) break;
for ( int i = 1; i <= n - 2; i++ )
for ( int j = i + 1; j <= n - 1; j++ )
for ( int k = j + 1; k <= n; k++ ) {
... | #include<iostream>
#include<string>
int room[4][3][10];
template<typename T>
T input(){
T t;
std::cin>>t;
return t;
}
int main(){
for(int i=0;i<4;++i){
for(int j=0;j<3;++j){
for(int k=0;k<10;++k){
room[i][j][k]=0;
}
}
}
const int n=input<int>();
for(int i=0;i<n;++i){
const int b=input<int>();
c... | 0 | 8,393,496 |
#include<cstdio>
const int N=1e5+3;
int n,m,deg[N];
signed main(){
int u,v;
scanf("%d%d",&n,&m);
for(;m--;)
scanf("%d%d",&u,&v),deg[u]++,deg[v]++;
for(u=1;u<=n;u++)if(deg[u]&1)return 0*puts("NO");
return 0*puts("YES");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int A,B;
cin >> A >> B;A --;B --;
bool b[50][100],w[50][100];
fill(b[0],b[50],false);
fill(w[0],w[50],false);
for(int j = 0;j < 50;j += 2){
for(int i = 0;i < 100;i += 2){
if(A==0&&B==0) break;
... | 0 | 38,144,516 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i,n) for(int i=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=5e18;
int main() {
ll k;
cin >> k;
vec a(k);
for(ll i=0;i<k;i++) {
cin >> a[i];
}
ll mx=3;
ll mn=2;
if(a[k-1]!=2) {
cout <... | 0 | 7,026,195 |
#include<iostream>
#include<algorithm>
using namespace std;
int n;
main()
{
while(cin>>n,n)
{
int a[1111];
for(int i=0;i<n;i++)cin>>a[i];
int ans=1e9;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
int A=abs(a[i]-a[j]);
ans=ans<A?ans:A;
}
}
cout<<ans<<endl;
}
} | #include <iostream>
#include <queue>
int d[110];
int main() {
int n;
std::cin >> n;
int G[110][110];
for(int i=0; i<n; ++i) {
for(int j=0; j<n; ++j) G[i][j] = 0;
}
for(int i=0; i<n; ++i) {
d[i] = -1;
}
for(int i=0; i<n; ++i) {
int u, k;
std::cin >> u >> k;
u--;
for(int j=0; j<k; ... | 0 | 94,452,164 |
#include<bits/stdc++.h>
#define F first
#define S second
#define REP(i, a, b, c) for(int i = a; i <= b; i+=c)
#define pb push_back
#define int long long int
#define MOD 1000000007
using namespace std;
int a[105];
int solve(int n, int k) {
int dp[n + 5][k + 5];
for (int j = 0; j <= k; j++)
{
dp[1][j] = (j > a[... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
const int INF = 1e18;
int n;
vector<int> a(N);
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int ans = 1;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (a[i] == 0)
{
cout << 0;
retu... | 0 | 21,000,344 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
void so... | #include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector... | 0 | 99,155,575 |
#include <bits/stdc++.h>
using namespace std;
#define inf -10000000000
long long calc(long long K, vector<int> G, vector<long long> C){
long long ans = inf;
long long L = (long long)G.size();
long long SUM[2 * L + 1];
SUM[0] = 0;
for(int i=1;i<=L;i++){
SUM[i] = SUM[i-1] + C[G[i-1]];
}
for(int i=1;i<=L;i++){
... | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(){
int N;
cin >> N;
int pos[3][N+1];
for (int i=1;i<=N;i++){
cin >> pos[0][i] >> pos[1][i] >> pos[2][i];
}
pos[0][0]=0;
pos[1][0]=0;
pos[2][0]=0;
int n,flag=0;
for (int i=1 ;i<=N;i++){
n= (pos[0][i]-pos[0]... | 0 | 96,864,242 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ll long long
int main() {
string s;
ll k;
int ans;
cin >> s >> k;
int x = s.size();
int n = 0;
rep(i, s.size()) {
if (s[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int result = 0;
for(int i = 0; i < N; i++) {
int currentNum = (i + 1);
int currentSum = 0;
while(true) {
currentSum += currentNum % 10;
currentNum = currentNum / 10... | 0 | 78,324,579 |
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define LLIandI pair<long ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
string s;
cin >> s;
string t;
vector<int> counts;
int cnt = 0;
for (int i=0; i<s.size(); i++){
if(s[i] != 'x'){
t += s[i];
counts.push_back(cnt);
cnt = 0;
}else... | 0 | 80,639,421 |
#include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define iter(it,a) for(auto it=a.begin();it!=a.end();it++)
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define endl '\n'
#define preturn(X) cout<<X<<endl; return 0
typedef long long ll;
typedef long doub... | 0 | 24,829,527 |
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
... | #pragma GCC optimize(2)
#pragma commet(linker,"STACK:102400000,102400000")
#include<bits/stdc++.h>
using namespace std;
const int man = 1e5+10;
int x[man];
int l[man],r[man];
int pos[man];
int main(){
int n;
scanf("%d",&n);
for(int i = 1;i<= n;i++){
scanf("%d",&x[i]);
pos[x[i]] = i;
... | 0 | 21,366,300 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(void){
int N; cin >> N;
bool OK = false;
for(int i = 0; i <= N / 4; i++){
for(int j = 0; j <= N / 7; j++){
if(4 * i + 7 * j == N) OK = true;
}
}
if(OK != true)... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
int ma = max({a, b, c});
int sum = a + b + c;
int ans;
if ((ma * 3 - sum) % 2 == 0)
{
ans = (ma * 3 - sum) / ... | 0 | 95,547,337 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int sum = 0;
rep(i, n) sum += w[i];
int ans = 1001001001;
for (int k = 1; k < n; ++k) {
int l = 0;
rep(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N,T;
cin >> N >> T;
vector<ll> vec(N);
rep(i,N){
cin >> vec[i];
}
ll... | 0 | 13,893,824 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
long long n, a, b, c, s;
int main() {
cin >> n;
while(n--) {
cin >> a >> b;
if(a > b) swap(a, b);
c = sqrt(a*b);
if(c*c < a*b) {
s = 2*c - 1;
if(a<=c) s--;
if(c*(c+1) < a*b) s++;
} else {
s = 2*c - 2;
if(a<c) s--;
}... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int MOD = 100... | 0 | 16,688,447 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<tuple<int, int, int>> years(M);
int Pi, Yi;
for (int i = 0; i < M; i++)
{
cin >> Pi >> Yi;
years.at(i) = make_tuple(Yi, Pi, i);
}
sort(years.begin(), years.end());
vector<pair<i... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | 0 | 61,205,068 |
#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using namespace std;
int main(){
int k;
cin >> k;
vector<int> v(33);
v[1]=1;
v[2]=1;
v[3]=1;
v[4]=2;
v[5]=1;
v[6]=2;
v[7]=1;
v[8]=5;
v[9]=2;
v[10]=2;
v[11]=1;
v[12]=5;
... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 | 88,646,671 |
#include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int extgcd(int a, int b, int& x, int& y) {
int d = a;
if (b != 0)... | 0 | 27,041,267 |
#include <bits/stdc++.h>
#define X first
#define Y second
#define MP make_pair
using namespace std;
typedef long long ll;
const int N = 1e5 + 12;
const ll mod = 1e9 + 7;
int n, m;
string s[N];
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i = 1;i <= n;i++)
cin >> s[i];
s... | #include <iostream>
#include <vector>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
vector<char> conv(128);
for(int i=0; i<128; i++) conv[i]=i;
for(int i=0; i<n; i++){
char a,b;
cin >> a >> b;
conv[a] = b;
}
int m;
cin >> m;
for(int i=0; i<m; i++){
char a;
... | 0 | 42,819,314 |
#include <iostream>
using namespace std;
int main(){
int x,t;
cin>>x>>t;
cout<<max(0,x-t)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#def... | 0 | 40,294,668 |
#include <bits/stdc++.h>
#define vi vector<int>
#define ii pair<int,int>
#define x first
#define y second
#define all(x) (x).begin(),(x).end()
using namespace std;
int logn = 1;
ii query(int cur, int dest, vector<vector<ii>> &stick){
int sum = 0;
for(int i = logn-1;i>=0;--i){
if(dest - cur >= (1<... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define INF (1ll<<55)
#define mod 1000000007
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;} return false;}
template<class T> inline bool ... | 0 | 58,858,809 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
int i;
getline(cin,s);
if(s[i]>=97&&s[i]<=122)
cout<<"a";
else
cout<<"A";
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ii> P;
typedef unsigned long long i... | 0 | 10,917,679 |
#include <iostream>
#include <vector>
#include <algorithm>
#define INF 1e9
#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;
int main() {
int N, M, R;
cin >> N >> M >> R;
vector<int> r(R);
rep(i, R) cin >> r[i];
vector<vector... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using P=pair<ll ,ll>;
int main(){
int n,m;
std::cin >> n>>m;
std::vector<P> s;
std::vector<P> c;
rep(i,n){
int t1,t2;
std::cin >> t1>>t2;
s.push_back(P(t1,t2));
}
rep(i,m){
i... | 0 | 10,165,776 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int w = 0;
for (const char &c : s)
w += (c == 'o');
w += (15 - s.size());
if (w > 7) {
... | 0 | 33,440,183 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n, i;
cin >> n >> i;
cout << n - i + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> b(n-1);
rep(i,n-1) cin >> b[i];
vector<int> a(n);
rep(i,n-1) {
if (i == 0 || a[i] > b[i]) {
a[i] = b[i];
}
... | 0 | 2,502,675 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define INF 2e9
#define IMAX 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long llong;
int main()
{
int N;
string S;
c... | 0 | 22,634,349 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string>
using namespace std;
int main(){
int n,min,max,tmp;
int i = 1;
long sum;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> tmp;
sum += (long)tmp;
if(i == 1){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long l... | 0 | 86,711,839 |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<stack>
#include<iostream>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define vec(a) vector<int>a
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("output.txt",... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#define R... | 0 | 96,407,397 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;
int n, m;
int color[100010];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
vector<vector<int>> V0(H, vector<int>(W, 0));
char D;
char B = '#';
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> D;
if (D == B) {
V0.at(i).at(j) = 1;
}
else {... | 0 | 43,850,353 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, count = 0;
cin >> N >> K;
for (int i=0; i<N-K+1; i++)
count++;
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX/3
#define LLINF LLONG_MAX/3
#define MOD (1000000007LL)
#define MODA(a, b) a=((a)+(b))%MOD
#define MODP(a, b) a=((a)*(b))%MOD
#define inc(i, l, r) for(int i=(l);i<(r);i++)
#define dec(i, l, r) for(int i=(r)-1;i>=(l);i--)
#defin... | 0 | 1,108,035 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define int int64_t
#define ld long double
const int MOD = 1e9+7;
const int N = 1e6+5;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin>>n>>k;
int arr[n];
for(int i=0;i<n;i++) {
cin>>arr[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll l,r;
cin>>l>>r;
if(l%r==0){
cout << -1;
return 0;
}
cout << l;
return 0;
} | 0 | 53,022,607 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, n) for(int i = 1; i <= n; i++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
ll ... | 0 | 43,557,383 |
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int a, b, c;
double ans, ra, rb;
string dolphinManJotaro;
cin >> dolphinManJotaro;
for(int i = 0;i < dolphinManJotaro.size();i++){
if(dolphinManJotaro[i] == ','){
cout << " ";
}else{
cout << dolphinManJotaro[i];
}... | #include <iostream>
#include <algorithm>
#include <vector>
int main ( ) {
int n, k;
std::cin >> n >> k;
std::vector<int> h(n);
int ans = 0;
for (int i = 0; i < n; i++) {
std::cin >> h[i];
if(h[i] >= k) {
ans++;
}
}
std::cout << ans << "\n";
} | 0 | 839,642 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b, x;
cin >> a >> b >> x;
if (x >= a && x <= a + b) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
int n; cin >> n;
string s; cin >> s;
int fi=0,fj=0,fk=0;
int count=0;
for (int i = 0; i < 10; i++)
{
for (int j = 0; ... | 0 | 8,334,549 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
char x;
cin >> x ;
if((int)x >90)
cout << "a" << endl;
else cout << "A" << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <string>
#include <map>
#include <functional>
#include <cmath>
#include <cstdio>
using namespace std;
const int INF = 100000000;
typedef pair<int, int> P;
int sx, sy;
char _map[1000][1001];
int H, W;
char N;
char n = '... | 0 | 94,876,456 |
#include<bits/stdc++.h>
#define int long long
#define re(i,n) for(i=0;i<n;i++)
#define bre(i,n) for(i=n;i>0;i--)
#define rep(i,l,r) for(i=l;i<r;i++)
#define brep(i,l,r) for(i=r;i>l;i--)
const int inf=1145141919810893;
const int mod=998244353;
using namespace std;
template<class T>bool chmin(T &a,const T &b){
if(a>b){
... | #include<bits/stdc++.h>
#define FRU freopen("out.txt","w",stdout)
#define FRO freopen("in.txt","r",stdin)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mem(ara,n) memset(ara,n,sizeof ara)
#define loop(i,j,n) for(i=j;i<n;i++)
#define rloop(i,j,n) for(i=n;i>=j;i--)
#define INF 21474... | 0 | 74,641,178 |
#include <bits/stdc++.h>
using namespace std;
int w, h, cnt;
int vx[] = {0, 1, 0, -1};
int vy[] = {1, 0, -1, 0};
char field[20][20];
void solve(int x, int y){
++cnt;
field[y][x] = '#';
for(int i = 0; i < 4; ++i){
int nx = x + vx[i];
int ny = y + vy[i];
if(nx >= 0 && nx < w && ny >= 0... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX =2000007;
const int MOD = 998244353;
int modpow(int a, int n, int mod) {
int res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
signed... | 0 | 73,944,164 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a >... | #include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
int main() {
int n; cin >> n;
int tmp;
string s;
string ans = "";
vector<vector<int>> v(n,vector<int>(26,0));
... | 0 | 42,042,004 |
#include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define rapgame ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define eb emplace_back
#define vi vector <int>
#define vlli vector <lli>
#define vulli vector <ulli>
#define vchar v... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 93,809,603 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long n,k;
cin >> n >> k;
long long sum =0;
long long flag = 0;
vector<int> h(n);
rep(i,n){
cin >> h.at(i);
}
sort(h.begin(),h.end(),greater());\
if(k >= h.size()){
cout << 0;
... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | 0 | 94,903,485 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>; using vpii = vector<pii>... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define mx INT_MAX
#define mn INT_MIN
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define itr set<int> :: iterator
const int mod = 1e9+7;
vector<ll> a;
ll dp[101][100001];
int main(){
int n,k;... | 0 | 98,295,025 |
#include<bits/stdc++.h>
using namespace std;
int a,b;
int main()
{
cin>>a>>b;
if((a*b)&1)
cout<<"Odd";
else
cout<<"Even";
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 84,938,800 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long int lli;
string charset[10][5] = {
{},
{".", ",", "!", "?", " "},
{"a", "b", "c"},
{"d", "e", "f"},
{"g", "h", "i"},
{"j", "k", "l"},
{"m", "n", "o"},
{"p", "q", "r",... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M);
vector<int> p(M);
for (int i = 0; i < M; i++)
{
cin >> k[i];
for (int j = 0; j < k[i]; j++)
{
int val;... | 0 | 79,617,036 |
#include <algorithm>
#include <utility>
#include <cstdio>
#include <map>
using ll = long long;
int fa[100005], sz[100005];
ll arr[100005], val[100005];
std::pair<ll, int> app[100005];
std::map<ll, int> idx;
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%lld", arr + i);
idx[arr[i]] = ... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int Max=1000007;
bool visit[Max];
int prime[Max];
int num=0;
void init_prim()
{
memset(visit, true, sizeof(visit));
for (int i = 2; i <Max; ++i)
{
if (visit[i] == true)
{
num++;
prime[... | 0 | 18,675,531 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int K;
cin>>K;
vector<long long> H(N);
for(int i=0;i<N;i++){
cin>>H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
long long a=0;
for(int i=K;i<N;i++){
a+=H[i];
}
cout<<a<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
template<typename T>
struct CumulativeSum {
vector<T> s;
CumulativeSum(const vector<T> &nums) {
int n = nums.size();
s.resize(n + 1, 0);
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + nums[i];
}
}
T sum(int l, int ... | 0 | 36,857,113 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #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;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
template<class T> inli... | 0 | 32,798,924 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | #include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end(... | 0 | 97,145,968 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | #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... | 0 | 28,528,809 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N = 2e5 + 5, mod = 1e9 + 7;
ll x[N], y[N], sumY;
int main()
{
ll n, m;
scanf("%lld%lld", &n, &m);
ll ans = 0, temp;
for(ll i = 0 ; i < n ; i++) scanf("%lld", x + i);
for(ll i = 0 ; i < m ; i++) scanf("%lld", y + i);
for(... | #include <iostream>
int main()
{
while(1) {
int judgeNum = 0;
int pointSum = 0;
int maximumPoint = 0;
int minimumPoint = 1000;
std::cin >> judgeNum;
if (judgeNum == 0) {
break;
}
for(int i = 0; i < judgeNum; i++) {
int point;
... | 0 | 92,850,333 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
using lim = numeric_limits<T>;
typedef long long ll;
typedef long double ld;
struct Coord{
ll x;
ll y;
Coord(){
x = y = 0;
}
Coord(ll _x, ll _y){
x = _x;
y = _y;
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin ... | #include <string.h>
#include <stdio.h>
int main(){
int i,j,q,x,y;
char str[1000],str2[10],w[1000],r;
scanf("%s %d",str,&q);
for(i=0;i<q;i++){
scanf(" %s",str2);
if(strcmp(str2,"replace")==0){
scanf(" %d %d %s",&x,&y,w);
for(j=x;j<=y;j++){
str[j]=w[j-x];
}
}
else if(strc... | 0 | 39,763,281 |
#include <iostream>
#include <utility>
using namespace std;
int a,b,n;
pair<int,int> p[40];
int f(int x,int y){
if(x==a&&y==b) return 1;
else if(x>a||y>b) return 0;
for(int i=0;i<n;++i) if(x==p[i].first&&y==p[i].second) return 0;
return f(x+1,y)+f(x,y+1);
}
int main(){
int x,y,A;
while(cin>>a>>b,a||b){
... | #include <iostream>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
#de... | 0 | 65,500,496 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int n,m;
cin>>n>>m;
cout<<abs((n-2)*(m-2))<<endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for(int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for(int i = ((int)(n)... | 0 | 12,809,615 |
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N, H;
ll count = 0;
vector<ll> A, B;
cin >> N >> H;
A.resize(N);
B.resize(N);
for(ll i = 0;i < N;i++) cin >> A[i] >> B[i];
sort(A.begin(), A.end(... | 0 | 80,647,102 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
if(a+b == 15) {
printf("+\n");
} else if(a*b == 15) {
printf("*\n");
} else {
printf("x\n");
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 100,530,722 |
#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()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 74,622,251 |
#include<cstdio>
#include<list>
#include<algorithm>
using namespace std;
list<int> myList;
int main()
{
int n, num;
char command[15];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", command);
if ('i' == command[0]) {
scanf("%d", &num);
myList.push_front... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 1... | 0 | 50,859,243 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int n, a, b, m, ans = 0;
cin >> n >> m;
vector<ll> s(n);
rep(i, m) {
cin >> a >> b;
a--, b--;
s[a]++, s[b]++;
}
bool ok = true;
for (ll t : s)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++)... | 0 | 83,869,343 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.