code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> num(3);
REP(i, 3) cin>> num[i];
sort(num.begin(), num.end());
int ans = 0;
if (abs(num[0] - num[1]) % 2 == 0) {
ans += abs(nu... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 1 | 345,162 |
#include<cstdio>
using namespace std;
int gcd(int a, int b) {
return b ? gcd(b, a % b) : a;
}
int x;
int main() {
scanf("%d", &x);
printf("%lld", 1ll * x * 360 / gcd(x, 360) / x);
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define f(i,x,n) for(int i=x;i<(int)n;++i)
#define vpii vector<pair<int,int>>
#define vi vector<int>
#define all(x) x.begin(),x.end()
ld pie=3.141592653589793238462643383279... | 1 | 64,794,420 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int mod... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
using namespace std;
#define int long long
#define fr(i,n) for (int i = 0; i < n; i++)
#define fro(i,m,n) for (int i = m; i < n; i++)
#define pb push_back
#define iter ::iterator
#define fi first
#define se second
void io(){
#ifndef ONLINE_JUDGE
... | 1 | 2,746,801 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using vvs = vector<vs>;
int main() {
int a, b;
cin >> a >> b;
cout << (a + b + 1) / 2 << endl;
} | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int ans = (a + b);
if(ans % 2 == 0){
cout << ans / 2 << endl;
}
else{
cout << (ans + 1) / 2 << endl;
}
} | 1 | 95,221,108 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000001;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
int main() {
int N;
cin >> N;
vector<P> vec(N);
for(int i = 0;i < N;i++) {
int A;
... | #include<bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> A(N);
set<int64_t> st;
for (int64_t& a : A) {
cin >> a;
st.insert(a);
}
int64_t counter = 0;
map<int64_t, int64_t> mp;
for (int64_t e : st) {
mp[e] = counter++;
... | 1 | 81,808,868 |
#include <map>
#include <string>
#include <iostream>
using namespace std;
int main() {
map<string,int>t;
int n;
cin>>n;
string a,b;
while(n--){
cin>>a>>b;
if(a=="insert"){
t[b]=1;
}else{
if(t[b]==0){
cout<<"no"<<endl;
}else{... | #include<iostream>
#define M 1000003
#define f first
#define s second
using namespace std;
int n,c[256];
int f[M];
int stoi(string s){
int res=0;
for(int i=0;i<s.size();i++)res*=5,res+=c[s[i]];
return res;
}
int func1(int a){
return a%M;
}
int func2(int a){
return 1+a%(M-1);
}
int main(){
string mei,str;
... | 1 | 48,958,811 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int m,n;
cin >> n>>m;
int h = n/2;
if(n%2==1)h++;
int x = h/2;
int y = ((h +1)+n)/2 -1;
int j =0;
rep(i,m){
cout << x << " " << x+i*2+1<<... | 1 | 32,288,157 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, a;
double z = 0;
cin >> n;
while (n--) cin >> a, z += 1.0 ... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 1 | 40,171,846 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string left = "qwertasdfgzxcvb";
string right = "yuiophjklnm";
string s;
while(cin >> s, s != "#"){
int cnt = 0;
for(int i = 0; i < s.size()-1; i++){
if(left.find(s[i]) != string::npos && right.find(s[i+1]) != string::npos ||
left.find(s... | #include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;
typedef long long ll;
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int... | 1 | 29,760,527 |
#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;
const long long MOD = 1000000007;
#define SET(x) memset(x, 0, sizeof(x))
#define SET2d(x,m,n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define SETBOOL(x) memset(x,false,siz... | #include <bits/stdc++.h>
using namespace std;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
... | 1 | 18,911,905 |
#include <iostream>
using namespace std;
#include<bits/stdc++.h>
int main() {
string s,t,n;
int i,j;
cin>>s>>t;
i=s.length(); j=t.length();
n=t.substr(0,j-1);
if(s==n)
std::cout << "Yes" << std::endl;
else
cout<<"No"<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int i,l=s.size(),c=0;
for(i=0;i<l;i++)
{
if(s[i]==t[i])
c++;
}
if(c==l)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 1 | 98,980,818 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll ret = k + 1;
ll c = k - (a - 1);
if (b - a > 0 && c > 0) {
ll x = a + (b - a) * (c / 2);
if (c % 2 == 1)x++;
ret = max(ret, x)... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | 1 | 80,302,180 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int M;
cin >> M;
ll d, c;
ll q = 0;
ll r = -1;
ll D = 0;
for (int i=0; i<M; i++) {
cin >> d >> c;
q += (d * c + r) / 9;
r = (d * c + r) % 9;
D += c;
}
ll ans = (D - 1) + q;
cout << ans << endl;
return 0;
} | #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>;
const ll MOD = 1000000007;
int main() {
int m;
cin >> m;
ll digit = 0, sum = 0;
rep(i, m) {
ll d, c;
cin >> d >> c;
digit += c;
sum += d * c;
}
ll ans =... | 1 | 88,636,329 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
using namespace std;
struct Card {
char mark;
int value;
};
Card c[110];
Card c1[110];
Card c2[110];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for(int i = 0; i < n; ++i){
cin... | #include <iostream>
using namespace std;
struct Card{char suit,value;};
void show_array(struct Card a[],int n){
for(int i=0;i<n;i++){
if(i>0) cout << " ";
cout << a[i].suit << a[i].value;
}
cout << endl;
}
void BubbleSort(struct Card a[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if... | 1 | 23,219,914 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, b; cin >> n >> m >> a >> b;
string line = string(a, '0') + string(m - a, '1');
string other = string(a, '1') + string(m - a, '0');
for(int i = 0; i < b; i += 1)
cout << line << "\n";
for(int i = b; i < n; i += 1)
... | 1 | 42,616,863 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
map<ll,int> mp;
vector<ll> a(n);
rep(i,n)cin >> a[i];
ll x = -1,y = 0;
sort(a.rbegin(),a.rend());
rep(i,n-1){
if... | #include<bits/stdc++.h>
#define ld long double
#define ll long long
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ppb pop_back
#define ull unsigned long long
#define over retu... | 1 | 32,260,542 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <numeric>
#include <map>
#include <iomanip>
#include <limits.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const bool DEBAG = f... | 1 | 51,797,171 |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::cin, s);
if ((s[0] == s[1] &&
s[1] == s[2] &&
s[0] == s[2]) ||
(s[1] == s[2] &&
s[2] == s[3] &&
s[1] == s[3]))
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a1,a2,a3,a4;
a1=N/1000;
a2=(N%1000)/100;
a3=((N%1000)%100)/10;
a4=((N%1000)%100)%10;
if (a1 == a2 && a2 == a3) {
cout << "Yes" << endl;
}
else if(a2 == a3 && a3 == ... | 1 | 73,281,566 |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int n;
setprecision(5);
long double x[4], y[4],d1,d2,d3,d4;
int ans[100];
cin >> n;
for (int a = 0; a < n; a++) {
cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3];
if (x[0] > x[1]) {
d1 = x[0] - x[1];
d3 = y[0] -... | #include <iostream>
#include <complex>
#include <cmath>
using namespace std;
typedef complex<double> xy_t;
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); }
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); }
xy_t projection(xy_t p, xy_t b) { return b * dot_product(p, b) / norm(b); }... | 1 | 23,515,048 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n;
cin>>n;
ll arr[n+5]={0};
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
ll cnt=0;
ll ans=INT_MIN;
for(int i=0;i<n-1;i++)
{
if(arr[i]>=arr[i+1])
{
cnt++;
ans=max(ans,cnt);
}
e... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | 1 | 38,771,920 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 1 | 75,058,243 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int a,b;
string op;
cin>>a>>op>>b;
if(op == "+"){
cout<< a +b<<endl;
} else {
cout << a - b << endl;
}
return 0;
} | #include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
int a,b;
char ch;
scanf("%d %c %d",&a,&ch,&b);
if(ch=='+') printf("%d\n",a+b);
else printf("%d\n",a-b);
} | 1 | 40,585,531 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y... | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define IPT(t, x) t ipt; cin >> ipt; x.push_back(ipt);
#define YN(x) x ? cout << "YES" << endl : ... | 1 | 64,169,521 |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n;
int a[N];
int b[N];
int main() {
ios::sync_with_stdio(0);
cin>>n;
for(int i=1;i<=n;i++) {
int x; cin>>x;
a[i]=a[i-1]+x;
b[i]=b[i-1]^x;
}
int l=1;
long long sum=0;
for(int i=1;i<=n;i++) {
while(a[i]-a[l-1]!=(b[i]^b[l-... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 1 | 65,219,789 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
string s;
cin >> s;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[3])
cout << "Yes" << endl;
else if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1])
cout <... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | 1 | 41,570,618 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S,left,right;
cin>>N>>S;
stack<char> brackets;
for (int i = 0; i < N; i++) {
if (S[i] == '(') {
brackets.push('(');
} else if (brackets.empty()) {
brackets.push(')');
} else {
if (brackets.top() == '(') {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 1 | 65,750,662 |
#include <utility>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
int N, M;
while(cin >> N >> M && N >0)
{
pair<int, int> PD[10000];
for(int i=0;i<N;i++)
cin >> PD[i].second >> PD[i].first;
sort(PD, PD+N);
int Mcur = M;
int sum = 0;
for(int i=0;i<... | #include<stdio.h>
#include<algorithm>
using namespace std;
pair<int,int> v[10000];
int main(){
int a,b;
while(scanf("%d%d",&a,&b),a){
int ret=0;
for(int i=0;i<a;i++){
int c,d;
scanf("%d%d",&c,&d);
ret+=c*d;
v[i]=make_pair(-d,c);
}
std::sort(v,v+a);
for(int i=0;i<a;i++){
if(b>=v[i].second){
... | 1 | 58,023,225 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int N;
cin >> N;
vector<int> v(N);
rep(i, N) c... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | 1 | 57,574,887 |
#include <iostream>
using namespace std;
int main() {
int W;
int H;
int x;
int y;
int r;
int f1;
int f2;
int f3;
int f4;
cin>>W>>H>>x>>y>>r;
bool t = false;
if (x-r>=0){
if(t) cout<<"1Yes"<<endl;
f1=1;
}else if (x-r<0){
if(t) cout<<"1No"<<endl;
f1=0;
}
if (y+r<=H){
if(t) cout<<"2Yes"<<endl;
f... | #include <iostream>
using namespace std;
int main(){
int w,h,x,y,r;
cin >> w >> h >> x >> y >> r;
if(w >= x && h >= y){
if(x+r <= w && x-r >= 0 && y+r <= h && y-r >= 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}else{
cout << "No" << endl;
}
return 0;
} | 1 | 46,279,962 |
#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
char mcxi[]={'m','c','x','i'};
int v[]={1000,100,10,1};
int toint(string x){
int d=1;
int sum=0;
for(int i=0;i<x.size();i++){
if(x[i]>='0' &&x[i]<='9'){
d=x[i]-'0';
}else{
for(int j=0;j<4;j++){
if(x[i]!=mcxi[j])continue;
sum+... | #include <iostream>
#include <vector>
#include <map>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;
bool check_alp(char c){
if(c>='a' && c<='z')return true;
else return false;
}
int main(void){
int n;
cin >> n;
string p="ixcm";
while(n--){
string s,t;
cin >> s >> t;
... | 1 | 52,592,095 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <s... | #include <iostream>
#include <vector>
#include <map>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef vector<int> vi;
typedef map<ll, pii> mlp;
pli dfs1(vi e[], int x) {
pli ret = pli(0, 1);
for (int i : e[x]) {
pli t = dfs1(e, ... | 1 | 6,651,623 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
using plll=pair<ll,pll>;
using graph=vector<vector<int>>;
using wgraph=vector<vector<pll>>;
const ll MOD=1000000007;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll abs1(ll a){
if(a>=0)return a;
... | 1 | 78,037,305 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a[n];
int ans = 0;
rep(i, n) {
int b;
cin >> b;
b--;
for (auto e : a[i]) {
if (e == b) {
... | #include "bits/stdc++.h"
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#define min3(x, y, z) min(x, min(y, z))
#ifdef _MSC_FULL_VER
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" <... | 1 | 3,505,903 |
#include<iostream>
#include<vector>
using namespace std;
int main(void){
int n;
cin>>n;
for(int i=0;i<n;i++){
int y,m,d;
cin>>y>>m>>d;
int ans;
if(m%2==0&&y%3!=0){
d=19-d;
}else{
d=20-d;
}
if(y%3==0){
m=(10-m)*20;
}else{
m=((11-m)/2)*19+((10-m)/2)*20;
}
y=999-y;
ans=((y+2)/3)*5+y*19... | #include <iostream>
using namespace std;
int main() {
int n,y,m,d;
cin >> n;
while(cin >> y >> m >> d){
int sum=0;
if(y%3==1){
if(m%2==1){sum =(y/3)*590 + (m/2)*39 + d;}
else{sum = (y/3)*590 + (m/2-1)*39+20 + d;}
}
if(y%3==2){
if(m%2==1){su... | 1 | 41,793,080 |
#include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define IPT(t, x) t ipt; cin >> ipt; x.push_back(ipt);
#define YN(x) x ? cout << "YES" << endl : ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
vector<string> c(2);
rep(i,6){cin >> c[i];}
reverse(c[1].begin(), c[1].end());
if(c.at(0) == c.at(1)){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
} | 1 | 76,761,591 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin>>k>>s;
if(s.length()<=k) cout<<s<<endl;
else{
for(int i=0;i<k;i++) cout<<s[i];
cout<<"."<<"."<<"."<<endl;
}
} | #include <stdio.h>
#include <string.h>
int main(){
int n;
char str[102];
scanf("%d", &n);
scanf("%s", str);
if (strlen(str) <= n){
printf("%s", str);
}
else{
for (int i=0; i<n; i++){
printf("%c", str[i]);
}
printf("...");
}
return 0;
} | 1 | 29,984,537 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
int n;
cin>>n;
int b[100];
int ans=0;
rep(i,n-1) {
cin>>b[i];
}
vector<int> c(n,-1);
rep(i,n-1){
if(i!=n-2){
if(b[i]<=b[i+1]){
... | #include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define int long long
#define pb push_back
#define ff first
#define INF INT_MAX
#define ss second
#define fr(i, j, a) for (int i = j; i < a; i++)
#define cnt_ones(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define sz size()... | 1 | 7,804,154 |
#include<stdio.h>
int main(void){
int n;
scanf("%d",&n);
long long ans = 1;
for(int i=0; i<n; i++){
ans = ans * (i+1);
}
printf("%lld\n",ans);
} | #include <iostream>
unsigned long long Factorial(int n)
{
unsigned long long ans=n;
while(--n>0)
{
ans *= n;
}
return ans;
}
int main()
{
int n;
std::cin >> n;
std::cout << Factorial(n) << '\n';
} | 1 | 16,197,365 |
#include<iostream>
using namespace std;
int main(){
int a=0,b=0, n[150], nos, sum[150]={0};
char str[150][100][3];
while(1){
cin >> n[a];
if (n[a]==0) break;
for(b=0;b<n[a];b++){
cin >> str[a][b];
}
a++;
}
nos = a;
for(a=0;a<nos;a++)
{
for(b=0;b+1<n[a];b+=2)
{
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#d... | 1 | 98,303,200 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
int c=0;
for(int i=0; i<b.size()-1; i++)
{
if(a[i]!=b[i])
c++;
}
if(c==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define int long long
#define dip(type,var) type var; cin>>var;
#define dipi(x) int x; cin>>x;
#define w(x) int x; cin>>x; while(x--)
#define mka(... | 1 | 18,874,966 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> p(N);
for (int i=0; i<N; i++) {
cin >> p[i];
}
sort(p.begin(),p.end());
int ans = 0;
for (int i=0; i<K; i++) {
ans += p[i];
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
vector<int> p(N);
for (int i=0; i<N; i++) {
cin >> p.at(i);
}
sort(p.begin(),p.end());
int yen = 0;
for(int i=0; i<K; i++) {
yen += p.at(i);
}
cout << yen <... | 1 | 58,906,258 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int N;
int main(){
int N,K;
cin>>N>>K;
cout<<N-K+1<<endl;
} | #include<bits/stdc++.h>
using namespace std;
namespace FAST_IO
{
template<typename T> void read(T &a)
{
a=0;
int f=1;
char c=getchar();
while(!isdigit(c))
{
if(c=='-')
{
f=-1;
}
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
a=a*f;
}
template <typename T> v... | 1 | 37,368,667 |
#include <cstdio>
#include<iostream>
using namespace std;
int used[100001];
void dfs(int a, int b, const int k, int &ans) {
if(used[a] <= b) return;
else used[a] = b;
if(a == 0) {
ans = min(ans,b);
return;
}
if (b + 1 < ans) dfs((a + 1) % k, b + 1, k, ans);
dfs((a * 10) % k, b, k, ans);
}
int main() {
... | #include<bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL K; cin >> K;
vector<UL> V(max(10u, K), -1);
priority_queue<pair<UL, UL>, vector<pair<UL, UL>>, ... | 1 | 5,177,369 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int r, s, p;
cin >> r >> s >> p;
string t;
cin >> t;
int ans = 0;
vector<char> hand;
for(int i=0; i<k; i++) {
if(t[i] == 'r') {hand.push_back('p'); ans += p;}
... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,k,r,s,p;
scanf("%d %d", &n, &k);
scanf("%d %d %d", &r, &s, &p);
char t[n];
scanf("%s", t);
int nPoint = 0;
for(int i = 0; i < k; i++){
bool b... | 1 | 7,820,076 |
#include <iostream>
using namespace std;
int main() {
int n;
while(cin >> n, n) {
int count = 0;
for(int i = 0; i < n / 2; ++i) {
string op1, op2;
cin >> op1 >> op2;
if((op1 == "lu" && op2 == "ru") || (op1 == "ru" && op2 == "lu") || (op1 == "ld" && op2 == "rd") || (op1 == "rd" && op2 == "l... | #include<iostream>
using namespace std;
int main(){
while(1){
int n,c=0;
cin>>n;
if(n==0)break;
string s,b;
for(int i=0;i<n;i++){
cin>>s;
if(s[0]!=b[0]&&s[1]==b[1])c++;
b=s;
}
cout<<c<<endl;
}
return 0;
} | 1 | 92,545,168 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# 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)-1)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int t = k;
for (int i=1; i < n; i++) {
t = t * (k-1);
}
cout << t << "\n";
} | 1 | 63,485,119 |
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int i,j,k;
int a[9]={5,3,3,3,3,3,4,3,4},n;
int ln;
char c[9][6]={".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
string s;
string *t;
ci... | #include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
vector<char> key[10];
void Init(){
int index=0;
key[1].push_back('.');key[1].push_back(',');key[1].push_back('!');key[1].push_back('?');key[1].push_back(' ');
for(int i=2;i<=9;i++){
if(i == 7 || i == 9){
for(int j=0;j<4;j++){
key... | 1 | 53,039,961 |
#include <stdio.h>
int main(void){
char buf[100];
int a;
int b;
fgets(buf,sizeof(buf),stdin);
sscanf(buf, "%d %d",&a,&b);
if ((a<=8) && (b<=8)) {
printf("Yay!");
} else {
printf(":(");
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
scanf("%d %d",&a,&b);
if(b+1 == a)
printf("Yay!");
else if(a+1 == b)
printf("Yay!");
else if(a==b)
printf("Yay!");
else
printf(":(");
return 0;
} | 1 | 18,782,351 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v={0,13,1,2,3,4,5,6,7,8,9,10,11,12};
int A,B;
cin >> A >> B;
if(v.at(A)>v.at(B)){
cout << "Alice" <<endl;
}else if(v.at(A)==v.at(B)){
cout << "Draw" << endl;
}else{
cout << "Bob" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int a,b; cin >> a >> b;
if(a==1){
if(b==1) cout << "Draw" << endl;
else cout << "Alice" << endl;
}
else{
... | 1 | 73,459,952 |
#include <stdio.h>
int
main(void)
{
char line[80];
int n;
while (fgets(line, sizeof line, stdin)) {
if (sscanf(line, "%d", &n) == 1) {
int r = 0;
for (int a = 0; a <= 9; a++) {
for (int b = 0; b <= 9; b++) {
for (int c = 0; c <= 9; c++) {
for (int d = 0; d <= 9; d++) {
if (a + b + c + d... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int a,b,c,n;
int ans = 0;
while(cin>>n){
ans = 0;
for(a=0;a<=9;a++){
for(b=0;b<=9;b++){
for(c=0;c<=9;c++){
if(n-(a+b+c) <= 9 && n-(a+b+c)>=0)
ans++;
... | 1 | 45,145,406 |
#include<bits/stdc++.h>
#define pi acos(-1)
#define ll long long
#define pii pair<ll,ll>
#define debug(a) cout<<a<<'\n'
#define maxn 100009
#define MOD 1000000007
#define F first
#define S second
#define rep(i, a, b) for(ll i = a; i < (b); ++i)
#define per(i, b, a) for(ll i = b-1; i>=a ; i--)
#define trav(a, x) for(au... | #include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <functional>
#include <map>
#include <math.h>
#include <list>
#define ll long long int
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int rgb[3][4... | 1 | 39,402,116 |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
#define bitcnt(v) __builtin_popcount(v)
#define all(v) v.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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) ... | 1 | 33,509,183 |
#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... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll A;
string B;
cin >> A >> B;
int C = (B[0]-'0')*100+(B[2]-'0')*10+(B[3]-'0');
cout << ll(A*C/100) << endl;
} | 1 | 71,064,827 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, ... | #include <bits/stdc++.h>
#define mod 1000000007
#define mod998 998244353
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define mkp make_pair
typedef long long ll;
using namespace std;
int N, A[100000], a, b;
vector<int>v[100000];
bool vis[100000], f;
ll dfs(int x) {
vis[x] = true;
if (x) ... | 1 | 43,018,248 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using namespace std;
int main() {
int n;
cin >>n;
vector<int> a(n);
rep(i,n) {
cin>>a.at(i);
}
vector<int> b(n);
vector<int> c(n);
rep(i,n) {
b.at(i) = a.at(i)+1;
c.at(i) = a.at(i)-1;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T> inli... | 1 | 84,445,305 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
int sum_0, sum_1;
sum_0 = sum_1 = 0;
rep(i, 0, s.size()){
if(s[i] == '0') sum_0++;
else sum_1++;
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int counto=0,countz=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='1')
counto++;
else
countz++;
}
if(countz>counto)
{
cout<<2*counto;
}
else
cout<<2*countz;
} | 1 | 2,515,384 |
#include <bits/stdc++.h>
using namespace std;
int n,q;
int p[10005];
int find(int x) {
return p[x]<0?x:p[x]=find(p[x]);
}
void uni(int x,int y) {
if ((x=find(x))==(y=find(y))) return;
if (p[y]<p[x]) swap(x,y);
if (p[x]==p[y]) --p[x];
p[y]=x;
}
int main() {
ios_base::sync_with_stdio(0),cin.tie(0)... | #include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include <vector>
using namespace std;
int P[10011];
void init(int N){
for(int i=0;i<N;i++)P[i]=i;
}
int root(int a){
if(P[a]==a)return a;
else return (P[a]=root(P[a]));
}
bool check(int a,int b){
return root(a)==root(b);
}
void unite(int a,i... | 1 | 99,017,554 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <climits>
using namespace std;
vector<vector<int>> adj;
vector<int> dp[2];
const int mod = 1e9 + 7;
enum Color {
Black, White
};
int calc(int c, int u, int p) {
if (dp[c][u] != -1) return dp[c][u];
dp[c][u] = 1;
for (auto to: a... | #include <iostream>
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
using namespace std;
using ll = long long int;
const int p = 1e9 + 7;
void solve(){
int n;
cin>>n;
vector<vector<int>> adj(n);
for(int i=0;i<n-1;i++){
int u,v;
cin>>u>>v;
--u;--v;
adj[u... | 1 | 73,534,299 |
#include<bits/stdc++.h>
using namespace std;
int s;
const int N = 1000000;
int main(void){
vector<int> a(N, 0);
cin >> s;
int i = 1;
int ans;
while(true){
if(a[s] != 0){
ans = i;
break;
}
a[s] = i++;
if(s%2 == 0) s/=2;
else s = 3*s+1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int s = 0;
std::cin >> s;
std::unordered_map<int, bool> dict;
dict[s] = true;
int count = 1;
while (1) {
if (s & 1)
s = (3 * s) + 1;
else
... | 1 | 21,381,521 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> v(n, 0);
for (int 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 rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | 1 | 16,056,491 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main(){
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n;++i){
if(i<10)
ans++;
if(i>99 && i<1000)
ans++;
if(i>9999 && i!=100000... | #include <bits/stdc++.h>
#define __STDC_FORMAT_MACROS
#define p64 PRId64
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define ALL(f, x, ...) \
([&] (decltype ((x)) ALL) { \
... | 1 | 28,544,574 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | #include <iostream>
#include <vector>
int main() {
int n, k; std::cin >> n >> k;
int c = 0;
std::vector<std::pair<int, int>> a;
for (int i = 0; i < n; i++) {
int h; std::cin >> h;
if (h >= k) {
c++;
}
}
std::cout << c << std::endl;
return 0;
} | 1 | 22,146,277 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
#define INF 1000000000
const int maxn = 1e5 + 5;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264... | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
/*
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
int X, Y;
cin >> X >> Y;
for(int i = 0; i < 100; i++){
if(i * 2 >= 0 && (X-i)*4 >= 0 && i * ... | 1 | 92,883,786 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n,k;
cin>>n>>k;
if (k==1)
{
cout<<"0\n";
}
else
{
cout<<n-k<<endl;
}
return 0;
} | #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;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>pbds;
#pragma comment(linker, "/stack:200000000")
#define mod 100000007
#define ll lon... | 1 | 65,009,821 |
#include <bits/stdc++.h>
#define fi first
#define se second
#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 srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> A(N);
vector<int> ans(N);
for(int i=0;i<N;i++){
cin>>A[i];
}
for(int i=0;i<N;i++){
ans[A[i]-1]=i+1;
}
for(int i=0;i<N-1;i++){
cout<<ans[i]<<" ";
}
cout<<ans[N-1]<<endl;
} | 1 | 22,475,555 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<iterator>
#include<list>
#include<utility>
#include<cstdlib>
#include<queue>
#include<stack>
#include<bitset>
#define PI 2*acos(0.0)
#define pb push_back
us... | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | 1 | 91,573,725 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
vector<vector<char>>hyo(h,vector<char>(w));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> hyo.at(i).at(j);
}
}
for(int i=0;i<w;i++){
bool c = true;
for(int j=0;j<h;j++){
if (hyo.at(j).at(i) ==... | #include "bits/stdc++.h"
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> brd(h);
for (int i = 0; i < h; i++)
{
cin >> brd.at(i);
}
vector<vector<int>> cnt(2, vector<int>(max(w,h)));
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
if (brd.at(i).at(j) == '.') {
... | 1 | 83,309,262 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
ll count = 0;
ll pre = -1;
rep(i, n){
if... | #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int n, a[100000] = {0}, x, sum;
int i;
cin >> n;
for(i = 0; i < n; i++){
cin >> x;
a[x - 1]++;
}
sort(a, a + 100000, greater<int>());
for(i = 0; i < n;){
if(a[i] > 2){
a[i] = a[i] - 2;
}else if(a[i] > 1 && ... | 1 | 97,801,491 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fals... | #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ar array
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,... | 1 | 73,936,732 |
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
int main() {
string s, p;
cin >> s >> p;
s += s;
if (strstr(s.c_str(), p.c_str())) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main (void) { ... | 1 | 49,989,154 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#def... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); i--)
#define ITER(it, a) for(typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))
#define SZ(a) (int) a.size()
#define A... | 1 | 18,819,714 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | 1 | 94,115,302 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M, D;
cin >> N >> M >> D;
double ans;
if (D == 0) ans = 1.0 * (M - 1) / N;
else ans = 2.0 * (N - D) * (M - 1) / (N * N);
cout << fixed << setprecision(20) << ans << endl;
} | 1 | 4,363,979 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 10e10
#define rep(i,n) for(int i=0; i<n; i++)
#define repr(i,n,m) for(int i=m; i<n; i++)
#define MOD 1000000007
#define pb push_back
#define debug(x) cout << x << endl;
#define END cout << endl;
#define sorti(x) sort(x.begin(), x.end())
cons... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <stack>
#include <deque>
#include <queue>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
#define pi acos(-1)
const int maxn = 1000000 + 5;
int father[maxn];
int dis[maxn];
int Find(int x)
{
if(father[x... | 1 | 63,778,857 |
#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 rall(v)(v).rbegin(), (v).rend()
#define INF 1 LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair < ll, ll >
#define F first
#define S second
const int MOD ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,L;
cin >> N >> L;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
ll l=-1,r=-1;
for(int i=1;i<N;i++){
if(A[i-1]+A[i]>=L){
l = i-1;
r=i;
break;
... | 1 | 40,195,359 |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int H, W;
cin >> H >> W;
vector<vector<int>> a(H, vector<int>(W, -1));
queue<tuple<int, int, int>> q;
for (int i = 0; i < H; ++i) {
string ai; cin >> ai;
for (int j = 0; j < W; ++j) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 1 | 47,646,627 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int V[N];
for (int i = 0; i < N; i++){
cin >> V[i];
}
int max_1 = 0, max_2 = 0, cnt = 0;
for (int i = 0; i < N; i++){
if (V[i] > max_1){
max_1 = V[i];
cnt = 0;
}
if (V[i] == max_1){
cnt++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
b = a;
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (a[n-1] == a[n-2]) {
cout << a[n-1] << endl;
}
else {
... | 1 | 97,474,055 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin>>s;
for(int i=0; i+1<s.size(); i++)
{
if(s[i]==s[i+1])
{
cout<<i+1<<" "<<i+2<< endl;
return 0;
}
}
for(int i=0 ; i+2<s.size(); i++)
{
... | #include <bits/stdc++.h>
#define MAXN 100010
#define pii pair<int,int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x<n and y >=0 and y<n)
using namespace std;
const int mod = 1e9 + 7;
int main (){
string s;
cin >> s;
int n = s.size();
for (int i=0; i<n-2... | 1 | 87,561,211 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,X,T;
int ans,tmp;
cin >> N >> X >> T;
ans = N / X;
tmp = N % X;
if (tmp != 0){
ans++;
}
cout << ans * T << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define length size()
#define endl "\n"
signed main(void){
float a,b,c;
cin >> a >> b >> c;
cout << (int)(c*(ceil(a/b)))+0 << endl;
} | 1 | 33,829,244 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double n,m,d;
cin>>n>>m>>d;
int a=1;
if(d>0){
a++;
}
cout<<fixed<<setprecision(15);
cout<<(m-1)*(a*(n-d))/(n*n)<<endl;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | 1 | 58,614,171 |
#include <iostream>
#include <string>
using namespace std;
template <typename T>
class Dllist{
struct Node{
T value;
Node *prev, *next;
};
Node first,end;
public:
Dllist(){
first.next = &end;
end.prev = &first;
}
void insert(T v){
Node *n = new Node;
n->value = v;
n->next = fir... | #include <iostream>
#include <string>
#include <list>
using namespace std;
void fnLinkedListSet(list<int> &rltnNum)
{
list<int>::iterator itltn;
list<int>::iterator itltEND = rltnNum.end();
string sCmd;
int nMaxCmd, nNum;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> nMaxCmd;
for (int i = 0; i < nMax... | 1 | 60,799,945 |
#include<bits/stdc++.h>
using namespace std;
#define xxx ios::sync_with_stdio(),cin.tie(0),cout.tie(0)
#define rep(i,n) for(int i=0;i<n;i++)
#define int long long
int bp(int a, int b, int m) {
a %= m;
int res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a... | #include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<map>
#include<iomanip>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define printfloat(x) cout << setprecision(7) << (x) << endl;
long double pi = 3.... | 1 | 60,496,722 |
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<cstdlib>
#include<iomanip>
#include<queue>
#include<set>
#include <valarray>
#include<stack>
#include<sstream>
#include<math.h>
using namespace std;
void Solution()
{
char n;
int coun... | #include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main()
{
unsigned int n[27];
for (unsigned int i = 0; i < 26; ++i)
n[i] = 0;
char ch;
while (cin >> ch) {
if (islower(ch))
n[ch-'a']++;
else if (isupper(ch))
n[ch-'A']++;
}
for (unsigned int i = 0; i < 26; ++i) {
c... | 1 | 79,072,386 |
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
cout << n / 2 - (n % 2 == 0) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define SaveTime ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define mx *max_element
#define mi *min_element
#define fn for(int i =0 ;i <n;i++)
#define fn1 for( int i =1;i<=n;i++)
#define fm for(int j =0... | 1 | 78,775,205 |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,X[1005],Y[1005];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d%d",&X[i],&Y[i]);
int fg=abs(X[1]+Y[1])&1;
for(int i=2;i<=n;++i)
if(fg!=(abs(X[i]+Y[i])&1))
return puts("-1"),0;
printf("%d\n",32-fg);
for(int i=30;~i;--i)printf("%d ",1<... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=1010,TOP=30;
int rec[N][2],d[N];
int n,m;
int Abs(int x){return x<0?-x:x;}
bool firstcheck(){
for (int i=2;i<=n;++i)
if ((Abs(rec[i][0]+rec[i][1])%2)^(Abs(rec[1][0]+rec[1][1])%2))
return false;
return true;
}
void solve(int x,... | 1 | 81,580,825 |
#include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i,n) for(int i=0;i<n;i++ )
#define rep2(i,f,n) for(int i=f;i<n;i++ )
#define MAX(A) *max_element(A.begin(),A.end())
#define MIN(A) *min_element(A.begin(),A.end())
#define SORT(A) sort(A.begin(),A.end())
#define REV(A) reverse(A.begin(),A.end(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
int main() {
int N,K;
cin >> N ... | 1 | 64,415,552 |
#include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main() {
string A;
cin >> A;
vector<ll> alfa(26, 0);
for (ll i = 0; i < A.size(); ++i) {
alfa.at(A[i] - 'a') += 1;
}
ll ans = (A.size() * (A.size() - 1)) / 2;
for (ll i = 0; ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ULL;
int main(){
string A, chars="abcdefghijklmnopqrstuvwxyz"; cin >> A;
ULL l=A.size(), ans=l*(l-1)/2+1; map<char, ULL> freq;
for(ULL i=0; i<l; i++){ freq[A[i]]++; }
for(ULL i=0, q=0; i<26; i++){ q=freq[chars[i]]; ans-=q*(q-1)/2; }
cout << ans <<... | 1 | 44,167,981 |
#include<stdio.h>
int main()
{
int x,y;
scanf("%d%d", &x,&y);
y=y/2;
x=x+y;
printf("%d\n",x);
return 0;
} | #include <iostream>
using namespace std;
void ABC110(void);
void ABC111(void);
void ABC112(void);
void ABC113(void);
void ABC114(void);
void ABC115(void);
void ABC116(void);
void ABC117(void);
void ABC118(void);
void ABC119(void);
int main(void){
ABC113();
}
void ABC113(){
int x,y;
cin>>x>>y;
cout<<x+y/... | 1 | 72,351,814 |
#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(... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;cin>>s>>t;
if(s.size()+1==t.size() && t.substr(0,s.size())==s){
cout << "Yes"<<endl;
}else{
cout << "No"<<endl;
}
} | 1 | 60,180,298 |
#include<bits/stdc++.h>
using namespace std;
const int mxN=2e5+10;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
cout<<n*n;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int r;
int k;
cin >> r;
k = r*r;
cout << k << endl;
} | 1 | 56,197,854 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,k,cnt=1,sum=0;
cin>>n;
if(n%2==1){
cout<<0;
return 0;
}
n/=10;
while(n>0){
k=n%5;
sum+=k*cnt... | 1 | 18,787,673 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
double n,d;
int cnt=0;
cin >> n >> d;
vector<vector<double>> x(n , vector<double>(d));
for(int i=0; i<n; i++){
for(int j=0; j<d; j++){
cin >> x.at(i).at(j);
}
}
double sum;
for(int i=0; i<n; i++){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,D;
cin >> N >> D;
int result = 0;
double count = 0;
vector<vector<double>> A(N,vector<double>(D));
for(int a = 0;a < N;a++){
for(int b = 0;b < D;b++){
cin >> A[a][b];
}
}
for(int a = 0;a < N;a++){
for(int b = a + 1;b < N;b++){... | 1 | 14,771,283 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> s(n);
rep(i,n){
char c;
cin >> c;
s[i] = c - '0';
}
int ans =... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0;
cin >> n;
string s;
cin >> s;
for(int i=0;i<1000;i++){
int x=i;
string key="";
for(int j=0;j<3;j++){
key+='0'+x%10;
x/=10;
}
int point=0;
for(int j=0;j<n;j++){
if(s.at(j)==key.at(point)){
p... | 1 | 6,698,750 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n;
... | #include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <cstring>
#include <math.h>
#include <bitset>
#include <time.h>
#include <set>
#include <algorithm>
#define MODD 1000000007
#define ll long long
using namespace std;
int main() {
int N;
cin>>N;
ll x;
for(x=1;;x++) {
... | 1 | 19,914,265 |
#include<bits/stdc++.h>
using namespace std;
#define inf 1e12+1
typedef long long int ll;
typedef pair<ll,ll> mypair;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
ll v,e;
cin>>v>>e;
vector<vector<mypair> > g(v);
vector<vector<ll> > dp(v,vector<ll>(v,inf) );
ll s,t,d;
rep(i,e){
cin>>s>>t>>d,g[s].push... | #include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); ++i)
using P = pair<long long, int>;
long long V, E;
long long d[... | 1 | 61,783,391 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
ty... | 1 | 98,069,429 |
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
using ll = long long int;
unordered_map<ll, ll> m;
ll lucas(ll n)
{
if(n == 0)
return 2;
if(n == 1)
return 1;
ll l, r;
if(m[n-1])
l = m[n-1];
else
{
l = lucas(n - 1);
m[n-1] = l;
}
... | #include<bits/stdc++.h>
using namespace std;
#define int unsigned long long int
int lucas[100];
void cal()
{
lucas[0]=2;
lucas[1]=1;
for(int i=2;i<=100;i++)
lucas[i]=lucas[i-1]+lucas[i-2];
}
int32_t main()
{
cal();
int n;
cin>>n;
cout<<lucas[n]<<endl;
} | 1 | 62,234,324 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[5],ans;
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
ans=0+abs(a[0]-a[1])+abs(a[1]-a[2]);
cout<<ans;
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_MA... | 1 | 57,142,417 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define oo 1000000000000000000
#define forr(i,n) for(ll i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0) ; cout.tie(0);
#define all(x) x.begin(),x.end()
#define eb emp... | #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)... | 1 | 40,210,838 |
#include <bits/stdc++.h>
using namespace std;
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n ) FOR( i, 0, n )
#define ALL( a ) (a).begin(), (a).end()
int main( void ) {
int n; cin >> n;
deque<int> a;
int key, size = 0;
string com;
REP( i, n ) {
cin >> com... | #include<bits/stdc++.h>
#include<list>
using namespace std;
int main(){
int n;
list<int> L;
char str[15];
scanf("%d",&n);
for(int i=0,num;i<n;i++){
scanf("%s",str);
if(str[0]=='i'){
scanf("%d",&num);
L.push_front(num);
}
else if(str[6]=='F'){
L.pop_front();
}
else if(... | 1 | 5,355,128 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.