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;
int main(){
int a,b,c;
cin>>a>>b>>c;
bool ans=false;
for(int i=1;i<1000;i++){
if((i*a%b)==(c%b)){
ans = true;
break;
}
}
if(ans) cout << "YES" <<endl;
else cout << "NO" << endl;
} | #include<iostream>
using namespace std;
int main(){
int A,B,C,K;
bool flag=false;
cin>>A>>B>>C>>K;
for(int i=0;i<=K;++i){
for(int j=0;j<=K;++j){
for(int l=0;l<=K;++l){
int x=A*(1<<i),y=B*(1<<j),z=C*(1<<l);
if(x<y&&y<z&&i+j+l<=K)... | 0 | 82,105,539 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <set>
typedef long long ll;
using namespace std;
int arr[107];
const ll inf = 1000000001;
int main() {
int x, n; cin >> x >> n;
set<int>s;
for (int i = 0; i < n; ++i) {
int a; cin >> a;
s.insert(a);
}
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;
char fi[100][100];
int main(){
int a,b; cin >> a >> b;
cout << 100 << " " << 100 << endl;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
if(i<50)fi[i][j]='#';
else fi[i]... | 0 | 27,324,073 |
#include <iostream>
using namespace std;
int main (){
int a,b,c,k,n=0;
cin >> a >> b >> c >> k;
while (!(a<b)){
b*=2;
n++;
}
while (!(b<c)){
c*=2;
n++;
}
if (k>=n) cout << "Yes";
else cout << "No";
} | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll... | 0 | 85,808,645 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#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--)
#define VSORT(v) sort(v.begin(), v.end())
#d... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int W, H, N;
cin >> W >> H >> N;
int xl=0, yl=0;
int xh=W, yh=H;
for(int i = 0; i < N; ++i)
{
int x, y, a;
cin >> x >> y >> a;
if(a == 1) xl = max(x, xl);
if(a == 2) xh = min(x, xh);
if(a == 3)... | 0 | 91,368,577 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a,b,c) for(int a=b;a<=(int)c;++a)
#define fd(a,b,c) for(int a=b;a>=(int)c;--a)
#define cu(a,b,c) for(int a=b;a<(int)c;++a)
#define cd(a,b,c) for(int a=(b)-1;a>=(int)c;--a)
#define gcd(... | #include<cstdio>
#include<cstring>
#include<queue>
#define maxn 1002
#define maxc 10
using namespace std;
struct point{
int r,c;
};
char graph[maxn][maxn];
int len[maxn][maxn];
bool mark[maxn][maxn];
point node[maxc];
int dir[4][2]={1,0,-1,0,0,1,0,-1};
int main(void){
int h,w,cheese,tr,tc,answer=0;
scanf("%... | 0 | 56,260,694 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int n;
cin>>n>>s;
for(int i=0;i<2;i++)
for(int j=0;j<2;j++)
{
string t;
t+=(i+'0');
t+=(j+'0');
for(int k=1;k<n-1;k++)
{
if(t[k]=='0')
{
if(s[k]=='o')
t+=t[k-1];
else
t+=(t[k-1]=='0'?'1':'0');
}
else
{
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define IN... | 0 | 84,013,601 |
#include <iostream>
#include <cstring>
using namespace std;
int prime[1000000];
int main()
{
int n;
for (int i = 0; i < 1e6; i++) prime[i] = 1;
prime[0] = prime[1] = 0;
for (int i = 2; i < 1000000; i++){
if (prime[i] == 1){
for (int j = 2 * i; j < 1000000; j += i){
prime[j] = 0;
}
}
... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 93,442,945 |
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#define mp make_pair
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9+7;
struct edge{ll x,y;};
struct huga{ll honest; bool done;};
using namespace std;
vector<int>binary(ll temp){
vector<int>s;
while(temp){
temp--;
s.push_back(temp%2);
temp = temp / 2;
... | 0 | 42,043,871 |
#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... | #include <iostream>
#include <string>
int max(int a, int b, int c){
int m = a;
if(b > m){
m = b;
}
if(c > m){
m = c;
}
return m;
}
int main(){
int q;
std::cin >> q;
std::string str1, str2;
for(int z=0; z<q; z++){
std::cin >> str1 >> str2;
int l1 = str1.size();
int l2 = str2.size(... | 0 | 90,950,586 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define SZ(x) ((int)(x).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define fore(i,a) for(auto &i:a)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define Yes cout << "Yes" << endl;
#define No cou... | 0 | 50,715,632 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main() {
int W,H,N,x,y,a; cin>>W>>H>>N;
int ans[W][H]={0};
for(int i=0; i<N; i++){
cin>>x>>y>>a;
if(a==1){
for(int j=0; j<x; j++){
for(int k=0; k<H; k++) ans[j][k]=1;
}
}
else if... | #include<cstdio>
#include<iostream>
#include<cctype>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define MD 1000000007
char sep[3] = " \n";
int i, j, k, l, m, n;
int main() {
string s, p, q;
int a, b;
char t;
cin... | 0 | 66,541,126 |
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <utility>
#include <vector>
#ifndef UTIL_HPP
#define UTIL_HPP
using i64 = ::std::int_fast64_t;
using u64 = ::std::uint_fast64_t;
using i32 = ::std::int_fast32_t;
using u32 = ::std::uint_fast32_t;
namespace ... | #include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const ll MAX = 1e2;
void solve(){
string a, b; cin>>a>>b;
char str[MAX];
for (int i=0, j=0; i<max(a.size(), b.size()); i++, j+=2){
str[j] = (i<a.size() ? a[i] : ' ');
str[j+1] = (i<b.size()) ? b[i] : ' ';
... | 0 | 66,114,914 |
#include<iostream>
using namespace std;
int main(void) {
int A, B, C, D;
scanf("%d%d%d%d", &A, &B, &C, &D);
printf("%d\n", min(A, B) + min(C, D));
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); ++i)
#define repr(i, a, b) for (int i=a; i<(b); ++i)
#define reprev(i, n) for (int i=n-1; i>=0; --i)
#define reprrev(i, a, b) for (int i=b-1; i>=(a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cout << fixed <... | 0 | 7,014,786 |
#include <cstdio>
#include <algorithm>
int main()
{
long long a, b, k;
scanf("%lld%lld%lld", &a, &b, &k);
long long *p = &a, *q = &b;
while (k-- > 0)
{
*p /= 2;
*q += *p;
std::swap(p, q);
}
printf("%lld %lld\n", a, b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
int main() {
int N;
cin >> N;
map<int, int> M;
for(int i=0; i<N; i++) {
int x;
cin >> x;
M[x]++;
}
ll ans = 0;
ll count = 0;
for(auto m:M) {
... | 0 | 30,326,732 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
int N;
cin>>N;
double x[N];
string S[N];
double count=0;
rep(i,N){
cin>>x[i]>>S[i];
if(S[i][0]=='J')
count+=x[i];
else
count+=x[i]*380000.0;
}
cout<<count<<endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define sz(s) (int)s.size()
int main() {
int n;
cin >> n;
unordered_map<int, int> f;
rep(i, 0, n) {
int x;
cin >> x;
++f[x];
}
vector<int> cnt(10, 0);
for (auto &it : f)... | 0 | 7,856,947 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t,c,m;
cin>>n;
vl<string> s(n);
for(i=0;i<n;i++) cin>>s[i];
for(i=0;i<n;i++) sort(s[i].begin(),s[i].end());
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | 0 | 59,573,153 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
vector<int> v;
for(int i=1;i<=3;i++) v.push_back(i);
int a,b;
cin>>a>>b;
for(int i=0;i<v.size();i++)
{
if(v[i]==a || v[i]==b)
{
v[i]=0;
}
}
cout<<*max_element(v.begin(),v.end())<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
typedef tuple<ll, int, int, int> t;
int main() {
auto compare = [](t a,t b) {
return get<0>(a)<get<0>(b);
};
priority_queue<t, vector<t>, decltype(compare)> q(compare);
int x, y, z, K, e, ... | 0 | 80,633,406 |
#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>
using namespace std;
int a[7];
void move(char i){
int b[7];
for(int n=1;n<7;n++){b[n]=a[n];}
if(i=='W'){
a[6]=b[4];
a[4]=b[1];
a[1]=b[3];
a[3]=b[6];
}
if(i=='N'){
a[6]=b[5];
a[5]=b[1];
a[1]=b[2];
a[2]=b[6];
}
if(i=='E'){
a[6]=b[3];
a[3]=b[1];
a[1]=b[4];
a[4]=b[6];
}
if(i=='S'){
a[6]=b[2];
a[2]=b... | 0 | 21,841,264 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
int a, b;
cin >> a >> b;
if (a + b == 15) cout << "+";
else if (a * b == 15) cout << "*";
else cout << "x";
cout << endl;
} | #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 | 72,376,618 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define int long long
#define mpr make_pair
typedef long long ll;
#pragma GCC optimize("Ofast")
const int maxn = 1e6+10;
const int N = 1e6+5;
const int mod = 998244353;
const int inf = 1e9+10;
int n, m, q;
int a[maxn], ps[maxn];
signed main(... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, g, I;
cin >> n;
long long S[n], M=5000000000, p, k, L=0, R=200002, t;
for (int i = 0; i < n; i++)
{
cin >> S[i];
}
while (R - L > 1)
{
t = (L + R) / 2;
g = 1;
set <long long> Se;
set... | 0 | 57,911,437 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sz(a) (int)a.size()
#define int long long
#define pb push_back
#define vi vector<int>
#define f first
#define s second
#define ii pair<int,int>
#define lb lower_bound
#define up upper_bound
#define rep(i,x,y) for(int i=(x);i<=(y);i++)
#define ld ... | #include<bits/stdc++.h>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
int a[100],b[100],n,f[100],c[100];
int lowbit(int x)
{
return x&(-x);
}
void add(int x)
{
while(x<=n)
{
c[x]+=1;
x+=lowbit(x);
}
}
int pre(int x)
{
int sum=0;
while(x)
{
sum+=c[x];
x-=lowbit(x);
}... | 0 | 51,294,939 |
#include <bits/stdc++.h>
#define repl(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
temp... | #include<bits/stdc++.h>
using namespace std;
#define INFTY 1<<20
typedef long long int ll;
const int MOD=1000000007;
using Graph = vector<vector<int>>;
using ipair = pair<ll,ll>;
bool operator< (const ipair a, const ipair b){return a.first < b.first;};
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll gcd(ll a, ll b) {... | 0 | 49,785,718 |
#include <bits/stdc++.h>
using namespace std;
char c[6];
int main() {
scanf("%s", c);
if (c[2] == c[3] && c[4] == c[5])
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
deque<int> b;
if(n % 2 == 0) {
rep(i, n) {
int a;
... | 0 | 86,593,629 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == 1) a+= 100;
if(b == 1) b+= 100;
if(a > b) cout << "Alice" << endl;
else if(a < b) cout << "Bob" << endl;
else cout << "Draw" << en... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
inline void reverse(char* buf, int a, int b) {
int mid = (a + b) / 2;
int j = b;
int t;
for (int i = a; i <= mid; ++i) {
if (i == j) {
break;
}
t = buf[i];
buf[i] = buf[j];
buf[j] = t;
--j;
}
}
int main(... | 0 | 68,924,193 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<climits>
#include<string>
#include<bitset>
#include<cfloat>
#include<iomanip>
#include<numeric>
#define repi(i,start,end) for(int (i)=(start),Tem... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | 0 | 37,325,364 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >>n;
vector<int>v(n);
map<int,int>a;
map<int,int>b;
for(int i=0;i<n;i++)cin>>v[i];
for(int i=0;i<n;i++){
if(i%2==0){
if(a.count(v[i]))a.at(v[i])++;
else a[v[i]]=1;
}else{
if(b.count(v[i]))b.at(v[i])++;
else... | #include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
const int MAX_N=50000;
const int MAX_M=20;
int d[MAX_M];
int dp[MAX_M+1][MAX_N+1];
int n,m;
void solve(){
for(int i=0;i<=m;i++){
for(int j=0;j<=n;j++){
if(j==0){
dp[i][j]=0;
... | 0 | 93,583,944 |
#include<stdio.h>
int main()
{
char S[150];
char T[150];
scanf("%s", &S);
scanf("%s", &T);
printf("%s", T);
printf("%s", S);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (n); i++)
#define MOD 1000000007
using ll = long long;
typedef pair<int, int> P;
int main(){
int n,k,m;
cin>>n>>k;k--;
rep(i,n){
if(m==1) continue;
int a;
cin>>a;
if(a==1){
m=i;
... | 0 | 97,145,708 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 0 | 43,881,833 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<ll, P> E;
#define MOD (1000000007ll)
#define l_ength size
#define PI 3.14159265358979
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
b += M... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <limits>
#include <functional>
using namespace std;
int f(long long A, long long B)
{
int a = 1, b = 1;
while (A >= 10)
{
a++;
A = A / 10;
}
while (B >= 10)
{
b++;
... | 0 | 22,691,598 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e19;
int main(){
int N;
cin >> N;
vector<ll> a(N+2);
a[0] = 0;
REP(i,N)cin >> a[i+... | #define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | 0 | 52,700,876 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int H, W; cin >> W >> H;
ll res = 0;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> q;
for (int i = 0; i < W; i++) {
ll x; cin >> x; q.emplace(x, 0);
}
for (int i = 0; i < H; i++) {
ll x; cin >> x; q.emplace(x, 1... | 0 | 11,993,398 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | #include<iostream>
#include<array>
int main()
{
while (true)
{
int num, sum;
std::cin >> num >> sum;
if (num == 0 && sum == 0)
{
break;
}
std::array<int, 9>nums{ 0,0,0,0,0,0,0,0,0 };
auto calc_sum = [&nums]()
{
int s = 0;
for (auto i : nums)
{
s += i;
}
return s;
};
int cnt =... | 0 | 94,316,241 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <stack>
#include <deque>
#include <set>
#include <unordered_set>
#include <list>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <climits>
#include <ctime>... | #include<bits/stdc++.h>
#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 all(x) (x).begin(),(x).end()
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MA... | 0 | 40,365,476 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout << #x << " = " << (x) << endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using M = map<int,int>;
using PQ = priority_queue<int>;
using ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
static const int INF = 2000000000;
ll maxs (ll x, ll y){
if (x > y) return x;
else return y;
}
l... | 0 | 75,652,328 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, n) for(int i = 0;i < (n);++i)
#define endl '\n'
#define pb emplace_back
#define mkp make_pair
#define p_q priority_queue
#define INF 2000000000
#define PI 3.1415926
const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};
const i... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
int main() {
string s; cin >> s;
ll ans = 0, w = 0;
bool ok = false;
for(int i = 0; i < (int)s.size(); i++){
if(s[i... | 0 | 30,844,974 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <list>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
void LoopUntilZeroInpput() {
int hogegegege = 0;
while (cin >> hogegegege && hogegegege != 0) {
}
}
int N;
ll a[50];
ll Cal(ll ... | #include <string>
#include <memory>
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>
#include <array>
using namespace std;
vector<vector<int>> graph;
vector<int> colors;
vector<bool> used;
bool Dfs(int v, int col, int* sz) {
used[v] = true;
colors[v] = col;
(*sz)++;
bool ans = false;
... | 0 | 80,968,127 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
using ll=long long;
#... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#define RG register
using namespace std;
const int N=103;
int n,a[N],maxx,num[N];
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
while(ch>='0' && ch<='9'... | 0 | 82,409,838 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using P = pair<int, int>;
int main(){
int n,m,x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n,vector<int>(m));
rep(i,n){
cin >> c[i];
rep(j,m) cin >> a[i... | 0 | 76,344,301 |
#include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
if (c >= 'A' && c <= 'Z') cout << 'A' << endl;
else cout << 'a' << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<62)
#define DEBUG 1
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | 0 | 26,523,549 |
#include <iostream>
using namespace std;
int N,S;
int set = 0;
int main(){
while(set <= 20){
cin >> N;
if (N == 0) break;
int largest = 0;
int smallest = 1000;
int sum = 0;
for (int i = 0; i <N;++i) {
cin >> S;
if(largest < S) largest = S;
if(smallest >S) smallest = S;
... | #include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr << #v << "="; for (auto _x : v) c... | 0 | 46,745,857 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n){
vector<pair<string,bool> >v;
string a,b;
for(int i=0;i<n;i++){
cin>>a>>b;
v.push_back(make_pair(a,1));
v.push_back(make_pair(b,0));
}
sort(v.begin(),v.end());
int ans=0,k=0;
string ts;
... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<set>
using namespace std;
typedef pair<int, int> pii;
typedef double lf;
typedef long long ll;
const int i... | 0 | 27,898,983 |
#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>
#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+5;
const int mod... | 0 | 58,451,627 |
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P std::pair<int,int>
#define PiP std::pair<int,std::pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp std::make_pair
#define priqu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N,D,A;
cin>>N>>D>>A;
vector<pair<int64_t,int64_t>> p(N);
vector<int64_t> q(N+1);
for(int i=0;i<N;i++){
int64_t a,b;
cin>>a>>b;
p[i]=make_pair(a,b);
q[i]=a;
}
q[N]=167167167167;
sort(p.begin(),p.end());
sort(q.begin(),q.... | 0 | 91,101,787 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
using Graph ... | #include<bits/stdc++.h>
using namespace std;
#define INFTY 200000000000
int main(){
int v,e;cin>>v>>e;
long long dis[v][v];
for (int i = 0; i < v; i++)
{
for (int j = 0; j < v; j++)
{
if(i==j)dis[i][j] = 0;
else dis[i][j] = INFTY;
}
}
f... | 0 | 8,097,517 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=100001;
int n;
long long ans[N];
struct Node
{
int id;
long long val;
}a[N];
bool cmp(Node x,Node y)
{
if(x.val!=y.val) return x.val>y.val;
else return x.id<y.id;
}
int main()
{
scanf("%d",&n);
for(int i=1;i... | #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()... | 0 | 5,470,809 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n;i++)
#define vi vector<int>
int INF=1e8;
int main(){
int a,b;
while(cin>>a>>b,a+b){
vector<vector<int> >dp(1001,vi(1001,0));
int n; cin>>n;
rep(i,n){
pair<int,int> hoge; cin>>hoge.first>>hoge.secon... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 44,657,305 |
#include<bits/stdc++.h>
#define to edge[i].v
#define mp make_pair
#define rint register int
#define debug(x) cerr<<#x<<"="<<x<<endl
#define fgx cerr<<"-------------"<<endl
#define in(x,y) 1<=x&&x<=n&&1<=y&&y<=m
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
char c[]={'R','Y','G','B'};
map<pair<in... | #include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
using namespace std;
const int MAXN = 1e5;
struct ... | 0 | 21,806,157 |
#include "bits/stdc++.h"
#include <unordered_set>
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vec... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
... | 0 | 96,725,840 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define all(a) (a).begin(), (a).end()
int main(){
int s, w;
cin >> s >> w;
if(w >= s) puts("unsafe");
else puts("safe");
} | #include <bits/stdc++.h>
using namespace std;
bool solve() {
int N;
cin >> N;
if(!N) return false;
int ans = 0;
bool l = false, r = false;
bool nxt = true;
for(int i = 0; i < N; i++) {
string s;
cin >> s;
bool &b = (s[0] == 'l' ? l : r);
b = (s[1] == 'u' ? tru... | 0 | 63,314,782 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
string s;
int w;
cin >> s >> w;
for(int i = 0;i < s.size();i++)
{
if(i % w == 0)
{
cout << s[i];
}
}
cout << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
in... | 0 | 33,540,625 |
#include <iostream>
#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) cerr << #x << "=" << static_cast<bitset<16> >(x) << endl;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
const int INF = 10000000;
int dx[4]={1, 0, -1, 0}, dy[4]={0, 1, 0, -1};
using na... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod=1e9+7;
int main(){
int N;
cin >> N;
int A, B;
cin >> A >> B;
queue<int> P;
for(int i=0; i<N; i++){
int tmp;
cin >> tmp;
P.push(tmp);
}
int x=0, y=0, z=0;
while(!P.empty()){
... | 0 | 51,553,790 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
if (c>=a && c<=b) cout<<"Yes\n"; else cout<<"No\n";
return 0;
} | #include <iostream>
using namespace std;
const int MOD = 1000000007;
long long modPow(long long a, long long n) {
if (n == 1) return a;
if (n % 2) {
return a * modPow(a, n - 1) % MOD;
} else {
return modPow(a * a % MOD, n / 2);
}
}
long long nCr(long long n, long long r) {
long long ... | 0 | 36,161,901 |
#include "bits/stdc++.h"
#include <unordered_set>
#include <numeric>
#define rep(i,n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define vll vector<vector<long long>>
#define vl vector<long long>
#define vi vector<int>
#define vii vector<vector<int>>
#define pb... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<ty... | 0 | 10,706,199 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
long long k;
cin >> s >> k;
for(int i=0;i<(int)s.size();i++) {
if(s[i]=='1') {
k--;
}else {
k=0;
}
if(k<=0) {
cout << s[i];
return 0;
}
}
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
using namespace std;
const int INF = (1<<30) - 1;
int main(){
int N, A, B, C, X;
while(ci... | 0 | 50,238,605 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int y, m , d;
char s, t;
cin >> y >> s>> m >> t>> d;
if(m >= 5) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
templat... | 0 | 39,810,998 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string>
#include <iomanip>
#include <vector>
#include <chrono>
#include <cstdlib>
#include <bitset>
using namespace std;
int main(){
int h, n;
cin >> h >> n;
int a[100100];
int total = 0;
for(int i = 0; i < n; i++){
cin >>... | #include<iostream>
#include<list>
#include<cstring>
#include<algorithm>
#include <utility>
#include<stdio.h>
#include<climits>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
int main(){
int n,x,y;
int i,j,k,l;
string str;
cin >> n;
for(i = 0;i < n;i++){
cin >> str;
... | 0 | 54,142,751 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define mp ... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<string> s;... | 0 | 68,432,485 |
#include <stdio.h>
#include <string.h>
using namespace std;
#define L 14
#define M 1046527
char H[M][L];
int getChar(char ch){
if(ch=='A') return 1;
else if(ch=='C') return 2;
else if(ch=='G') return 3;
else if(ch=='T') return 4;
else return 0;
}
long long getKey(char str[]){
long long sum=0,p=1;
for(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
if (j == W - 1){
for (int k = 0; k < W; k++) {
if (k != W - 1){... | 0 | 74,031,664 |
#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];
}
int m = *max_element(a.begin(), a.end());
vector<int> b(n);
copy(a.begin(), a.end(), b.begin());
sort(b.begin(), b.end());
int l = b[n - 2];
for(int i = 0; i <... | #include <stdio.h>
#include <memory.h>
int y[24*3600];
int main(void){
int n,h,m,s,i,max;
while(scanf("%d",&n),n){
max=0;
memset(y,0,sizeof(y));
for(i=0;i<2*n;i++){
scanf("%d:%d:%d",&h,&m,&s);
if(!(i%2))y[h*3600+m*60+s]++;
else y[h*3600+m*60+s]--;
}
for(i=0;i<24*3600;i++){
if(i>0)y[i]+=y[i-1];
... | 0 | 20,054,194 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int x,int y){
if(x%y==0)return y;
else return gcd(y,x%y);
}
int main(){
int n;
cin >> n;
string s;
cin >> s;
string check="RGB";
vector<long long> rgb(3,0);
for(int i=0;i<n;i++)for(int j=0;j<3;j++)if(check.at(j)==s.at(i))rgb[j]++;... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
template<class T... | 0 | 94,195,294 |
#include <iostream>
#include <vector>
#include <unordered_set>
#include <algorithm>
#include <numeric>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
vector<int> primes_under(int hi) {
vector<int> primes;
primes.push_back(2);
for (int i = 3; i <= hi; i += 2) {
bool ok = tr... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
ll GCD(ll a, ll b) { return ... | 0 | 20,296,709 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
string s, t;
cin >> N >> s >> t;
int k;
int Ans=-1;
for(int i=0; i<=N; i++){
k=1;
for(int j=0; j<N-i; j++){
if(s.at(j+i)!=t.at(j)){
k=0;
break;
}
}
if(k==1){
Ans=i;
break;
}
}
cout... | #include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | 0 | 53,556,048 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if(a + b >= c){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdint>
#include <bitset>
#include <vector>
#include <thread>
#include <stack>
#include <map>
using namespace std;
int main()
{
int n, l;
cin >> n >> l;
vector<string> vs(n);
for (int i = 0; i < n; i++)
{
cin >> vs[i];
}
sort(vs.begin(), vs.... | 0 | 90,458,262 |
#include<bits/stdc++.h>
#include <ext/rope>
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define count_one(a) __builtin_popcount(a)
#define parity(i) __builtin_parity(i)
#define blz(a) _... | #include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <cstdlib>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
unordered_map<ll, vector<ll>> x;
for (ll i = 1; i <= n; i++) {
x[i] = vector<ll>();
}
ll a, b;
for (ll i = 0; i < m; i+... | 0 | 763,571 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n,k;
cin >> n >> k;
vector<ll>a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
vector<ll>front(n),back(n);
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(i<j && a[i]>a[j]) back[i]++;
else if(i>j && a[i]>a[... | #include <iostream>
#include <algorithm>
using namespace std;
struct card{
char suit;
int value;
};
void bubbleSort(card c[], int n);
void selectionSort(card c[], int n);
bool isSame(card A[], card B[], int n);
int main() {
int n;
cin >> n;
card A[n], B[n];
for(int i=0;i<n;i++){
cin >> A... | 0 | 83,230,707 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,a,b;
cin >> n >> a >> b;
if(a>b ){
cout << 0 << endl;
return 0;
}
else if(n == 1){
if(a == b){
cout << 1 << endl;
r... | 0 | 50,416,442 |
#include <bits/stdc++.h>
using namespace std;
int len = 0;
string n;
void solve();
int main() {
solve();
cout << "! " << n << endl;
return 0;
}
void solve() {
auto send = [](string s) {
cout << "? " << s << endl;
string res;
cin >> res;
return res == "Y";
};
while (++len < 10)
if (!send(... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
int i,j,k;
main()
{
int n,k;cin>>n>>k;int a[n];
int b[n],c[n]={0};
for(i=1;i<=n;i++)
{
cin>>a[i];
b[i]=a[i];
c[i]=i;
}
sort(b+1,b+n+1);
vector<int> ans;
for(i=1;i<n;i++)
{
... | 0 | 23,161,180 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (int)c.size()
#define fr first
#define ... | #include <string>
#include <iostream>
using namespace std;
int compare(string s, string t){
int result = 0;
for(int i = 0; i < s.size(); i++){
if(s[i] != t[i]) result++;
}
return result;
}
int main(){
string s,t;
cin >> s >> t;
int n = s.size();
int m = t.size();
int ans = 20... | 0 | 60,235,817 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n; scanf("%d", &n);
vector<ll> a(n);
for(int i = 0; i < n; i++){
scanf("%lld", &a[i]);
}
ll ans = 0, num = a[0];
for(int i = 1; i < n; i++){
if(a[i] >= num) num = a[i];
else ans += (num - a[i]);
}
printf("%lld\n", ans);
} | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii ... | 0 | 10,611,786 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
char x;
cin >> x;
if(x == 'A') cout << "T" << endl;
if(x == 'C') cout << "G" << endl;
if(x == 'G') cout << "C" << endl;
... | #include<bits/stdc++.h>
#define ll long long int
#define vll vector<ll>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k, a;
cin >> k >> n;
vll x;
for(ll i=0; i<n; i++){
cin >> a;
x.push_back(a);
}
ll ans = 0;
for(ll i=0; i<n; ... | 0 | 82,164,686 |
#include <cstdio>
const int MAX = 2000000;
const int VMAX = 10000;
int A[MAX+2], C[VMAX+2];
int
main(int argc, const char *argv[])
{
int n;
scanf("%d", &n);
int *B = new int[n];
for (int i = 0; i < n; ++i) {
scanf("%d", &A[i+1]);
C[A[i+1]]++;
}
for (int i = 1; i <= VMAX; ++i) C[i... | #define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <functional>
#include <iomanip>
using namespace std;
void function()
{
}
int main()
{
int H, W;
while (cin >> H >> W)
{
if (H==0 ... | 0 | 1,115,578 |
#include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
int n,k;
cin >> n >> k;
int cc=0;
vector <int> a(n+1,0),b(n+1,0),c(n+1,0),a2(n+1,0);
rep(i,n){
cin >> a[i];
}
rep(i,k){
cc=0;
... | #include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
const ll root = 6... | 0 | 2,895,087 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
string s, t;
cin >> s >> t;
for(int i = 0; i < n; i++) {
cout << s[i] << t[i];
}
re... | #pragma region Macros
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
#define IN(x, a, b) x >= a and x < b
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, con... | 0 | 46,268,286 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n,m,k;
cin>>n>>m>>k;
bool ok=false;
for(int i=0; i<=n; ++i){
for(int j=0; j<=m; ++j){
if(i*j+(n-i)*(m-j)==k)ok=true;
}
}... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | 0 | 4,215,292 |
#include "bits/stdc++.h"
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define len(x) ((int)(x).size())
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = ... | #include<iostream>
#include<map>
int main(void){
int n;
std::cin >> n;
std::map<int, int> mp;
int a;
for(int i = 0; i < n; i++){
std::cin >> a;
mp[a] = i;
}
for(auto i = mp.begin(); i != mp.end(); i++){
if(i != mp.begin()) std::cout << " ";
std::cout << ++i->s... | 0 | 9,267,255 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, W;
cin >> N >> W;
while(N < 1 || N > 100 || W < 0 || W > N*N){
cin >> N >> W;
}
cout << N*N - W <<endl;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x(100000);
for(int i = 0;i < n;i++) cin >> x[i];
return x;
}
int main(){
string n;
cin >> n;
int cnt = 0;
for(int i = 0;i < 3;i++){
if(n[i] == '7'){
cnt++;
}
}
if(cnt != 0){
cout << "Yes" << endl;
}else{
cout... | 0 | 91,123,303 |
#include<iostream>
#include<algorithm>
using namespace std;
#define df 0
int lg(int n){
int cnt=1;
while(n){
cnt++;
n/=2;
}
return cnt;
}
int main(){
if(df) printf("*debug mode*\n");
int n; cin >> n;
int x[n];
for(auto& a:x){
cin >> a;
}
int l,q; cin >> l >> q;
int lmax=lg(n);
int d... | #include <atcoder/all>
#pragma region template 3.0
#define G3(_1, _2, _3, F, ...) F
#define G4(_1, _2, _3, _4, F, ...) F
#define G5(_1, _2, _3, _4, _5, F, ...) F
#define G6(_1, _2, _3, _4, _5, _6, F, ...) F
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
using vec = vector<T>;
... | 0 | 71,321,748 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <time.h>
#include <cstdlib>
#include <cmath>
#include <fstream>
int main(void) {
std::string str;
std::string temp;
while (std::cin >> temp) {
str += temp;
}
std::vector<int> ans(26);
char a = 'a';
for (int i = 0; i < 26; i++... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int C[10001] = {0};
int main(){
int n;
short num;
scanf("%d",&n);
for (int i = 0; i < n; i++) {
scanf("%hd",&num);
C[num]++;
}
short count = 0;
int s = 1;
while (s <= n-1) {
if (C[count])... | 0 | 98,392,993 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#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 PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int ma... | #include<iostream>
#include<string>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
int dp[S.length()+1][T.length()+1];
int i,j;
for(i=0; i<=S.length(); i++){
dp[i][0]=i;
}
for(j=0; j<=T.length(); j++){
dp[0][j]=j;
}
for(i=1; i<=S.length(); i++){
f... | 0 | 37,591,053 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <... | #include <iostream>
#include <string>
using namespace std;
string a, b;
int ans = -1;
int main() {
cin >> a >> b;
for(int start = 0; start+b.length() <= a.length(); start++) {
int changes = 0;
for(int i = 0; i < b.length(); i++)
if(b[i] != a[start+i])
changes++;
... | 0 | 41,006,395 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int a, b, c = 0;
cin >> a>> b;
rep(i, 0, b){
int d;
cin >> d;
... | #include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | 0 | 59,498,950 |
#include<iostream>
using namespace std;
int main(){
char a,b,c;cin >> a >> b;
if(a < b)c = '<';
else if(a > b) c = '>';
else c = '=';
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.... | 0 | 93,436,838 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, std::vector<long long> A){
map<ll, ll> mp;
for (ll i = 0; i < N; i++) mp[A[i]]++;
vector<ll> useful;
for(auto itr = mp.begin(); itr != mp.end(); ++itr){
if(itr->second >= 2) useful.push_back(itr->first);
... | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 101010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
templ... | 0 | 86,914,247 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n; cin >> n;
int ans = 0;
for(int i = 1; i <= n; i++){
if(i % 2 == 0) continue;
int cnt = 0;
for(int j = 1; j <= i; j++){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 0 | 79,911,311 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define x first
#define y second
#define pi pair <int, int>
#define vi vector <int>
#define L nod<<1
#define R ((nod<<1)|1)
#define int ... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 0 | 79,912,686 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
typedef pair<int, int> P;
int N, M;
map<string, int> score;
int main() {
cin >> N;
rep(i, N) {
string tmp;
cin >> tmp;
score[tmp] ++;
}
cin >> M;
... | #include<cstdio>
int main(void){
while(true){
int n, x;
int i, j, k;
int ans = 0;
scanf("%d %d", &n, &x);
if(n == 0 && x == 0) break;
for(i = 1; i <= n; i++){
for(j = i + 1; j <= n; j++){
for(k = j + 1; k <= n; k++){
... | 0 | 64,576,468 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
double k=0;
for(int i=0;i<n;i++){
double x; string y;
cin >> x >> y;
if(y=="BTC")
x*=380000;
k+=x;
}
printf("%.10f",k);
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using edge = pair<int, ll>;
using graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD = 1000000007;
int n;
vecto... | 0 | 72,958,546 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define dump(a) cerr << #a << " = " << (a) << "(L:" << __LINE__ << ")" << endl
void solve(long long A, long long B, long long C, long long K) {
if (K <= A + B) {
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
string t;
for (i... | 0 | 73,235,885 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main()
{
int a[3];
rep(i, 3) scanf("%d", &a[i]);
sort(a, a + 3);
printf("%d\n", a[1] - a[0] + a[2] - a[1]);
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
using namespace std;
typedef long long lng;
typedef unsigned long long ulng;
#define pb push_back
#define SZ(a) int((a).size())
#define ALL(a) (a).begin(), (a).end
#define FOR(i,a,b) for(int i=(a);... | 0 | 26,471,633 |
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
string zero(ll a){
string t=to_string(a)... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#define rep(i, n) for (int i = 0;... | 0 | 98,643,424 |
#include <bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
bool ok = true;
int size = S.size();
for (int i = 0; i < size; i++) {
if (S.at(i) != S.at(size - i - 1)) {
ok = false;
}
}
for (int i = 0; i < (size - 1) / 2; i++) {
if (S.at(i) != S.at((size - 1) / 2 - i -... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(i) begin(i), end(i)
const int INF = 0x3fffffff;
const ll MINF = 0x7fffffffffff;
const ld DINF = numeric_l... | 0 | 3,320,285 |
#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("../data.txt");
int k, s, x, y, z, ways;
int main() {
cin >> k >> s;
for (x = 0; x <= k; x++) {
for (y = 0; y <= k; y++) {
if (s - x - y >= 0 && s - x - y <= k) ways++;
}... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) ... | 0 | 49,728,532 |
#include <bits/stdc++.h>
#define trace1(a) cout<<#a<<": "<<a<<endl
#define trace2(a,b) cout<<#a<<": "<<a<<" | ", trace1(b)
#define trace3(a,b,c) cout<<#a<<": "<<a<<" | ", trace2(b,c)
#define trace4(a,b,c,d) cout<<#a<<": "<<a<<" | ", trace3(b,c,d)
#define t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vll vector<long long>
#define inf 1000000100
#define infll 1LL << 50
int main()
{
string s;
cin >> s;
int ans = 0;
for(int i = 1; i < s.size()/2; ++i)
... | 0 | 89,464,981 |
#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 = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define double ld
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef... | 0 | 22,107,645 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int,int>;
typedef long long ll;
int main()
{
int n,k; cin >> n >> k;
vector<int> a(n);
int mini = 100001;
int ite;
rep(i, n)
{
cin >> a[i];
... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 0 | 67,472,603 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n... | 0 | 10,835,086 |
#include <iostream>
#include <utility>
#include <string>
struct Dice
{
int numbers[6];
Dice (int n1, int n2, int n3, int n4, int n5, int n6) {
numbers[0] = n1;
numbers[1] = n2;
numbers[2] = n3;
numbers[3] = n4;
numbers[4] = n5;
numbers[5] = n6;
}
void move(char dir){
if (dir == 'N') ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 98,114,694 |
#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>
#inclu... | #include <bits/stdc++.h>
using namespace std;
using llong = long long int;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int MOD = 1000000007;
const static int IN... | 0 | 64,846,015 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define fn for(int i =0 ;i <n;i++)
#define fn1 for( int i =1;i<=n; i++)
#define fm for(int j =0 ;j <m;j++)
#define... | #include <bits/stdc++.h>
#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 bigger (char)toupper
#define smaller (char)tolower
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef v... | 0 | 91,268,222 |
#include <bits/stdc++.h>
using namespace std;
#define pi 2*asin(1.0)
long Comb(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
for(long i=M;i>0;i--){
ans=ans/i;
}
return ans;
}
long Perm(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
return ans;
}
int main() {
long N;
ci... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater... | 0 | 33,526,946 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.