code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<i_i, int> p_i;
typedef vector<int> vi;
typedef vector<... | #include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
const int maxn = 303, mod = 1e9 + 7;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<ll> a(n), cur;
for(auto &i : a) cin >> i;
for(int i = 0; i < n; i++)
for(ll ... | 0 | 20,017,736 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include<bits/stdc++.h>
using namespace std;
#define MAX 100
int main(void){
int i;
int n, G_list[MAX];
int G[MAX+1][MAX+1]={0};
scanf("%d", &n);
for(i=0; i<n; i++){
int cnt, num, m;
scanf("%d %d", &num, &cnt);
G_list[i]=num;
for(int j=0; j<cnt; j++){
scanf("%d", &m);
G[G_list[i]][... | 0 | 29,119,830 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
typedef long long ll;
int main()
{
int N, M;
cin >> N >> M;
vector<int> v[100001];
rep(i, N) {
int a, b;
cin >> a >> b;
v[a].push_back(b);
}
int... | 0 | 96,175,704 |
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y){
return y ? GCD(y, x%y) : x;
}
int main() {
string s; cin >> s;
if(s[2]==s[3] && s[4]==s[5]){
cout << "Yes" << endl... | 0 | 11,187,888 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int n;
cin >> n;
vector<vector<int>> s_chars(n, vector<int>(26, 0));
for ( int i = 0; i < n; i++ ) {
string s;
cin >> s;
for ( auto itr : s )
s_chars.at(i).at(itr - 'a')++;
}
vector<int> ans(26, I... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k,s;
cin>>n>>k>>s;
for(int i=0;i<k;i++){
cout<<s<<" ";
}
for(int i=0;i<n-k;i++){
if(s==1000000000)
cout<<s-1<<" ";
else{
cout<<s+1<<endl;
}
}
cout<<en... | 0 | 30,224,535 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
cout << A * A << endl;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <vector>
using namespace std;
double sin60 = sqrt(3.) / 2.;
struct Pt {
double x;
double y;
Pt operator+(const Pt& other) { return {x + other.x, y + other.y}; }
Pt operator... | 0 | 67,213,723 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <cstdlib>
#include <cctype>
#include <ctime>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <numeric>
#include <utility>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 64,123,725 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a>>b;
int flag=0;
if(a%3==0)flag=1;
else if(b%3==0)flag=1;
else if((a+b)%3==0)flag=1;
if(flag==1) cout <<"Possible"<<endl;
else if(flag==0)cout <<"Impossible"<<endl;
} | #include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define rep(i,n) for(ll i=1; i<=n; i++)
#define rep1(i,a,b) for(ll i=a; i<=b; i++)
#define repVect(i,n) for(l... | 0 | 93,237,921 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
char tbl[100][100];
int main(){
long a,b;
cin >> a >> b;
for(int i=0; i<50; i++){
for(int j=0; j<100; j++){
tbl[i][j] = '.';
tbl[50+i][j] = '#';
}
}
int count=1;
for(int i=0; i<50... | #include<iostream>
using namespace std;
static const int N=100;
int M[N+1][N+1];
int main(){
int n,u,k,v;
cin>>n;
for(int i=1;i<=n;i++){
cin>>u>>k;
for(int j=1;j<=k;j++){
cin>>v;
M[u][v]=1;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
... | 0 | 14,176,361 |
#include <bits/stdc++.h>
using namespace std;
long long n, sum = 0;
vector<int> a;
bool res = 1;
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
if (sum % (n * (n + 1) / 2) != 0)
res = 0;
else {
long long cnt = 0, k = sum / (n * (n + 1) / 2);
... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 49,260,852 |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | 0 | 10,857,761 |
#include<iostream>
#include<math.h>
#include<iomanip>
#include<string>
#include<fstream>
using namespace std;
int main(){
int m,nmin,nmax;
while(1){
cin >> m>>nmin>>nmax;
if(m==0 && nmin==0 && nmax==0){
return 0;
}
int pi,pib,sa,ans;
int samax=0;
for(int i=0;i<m;i++){
if(i>0)pib=... | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
long long r = 0, ... | 0 | 31,109,159 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
vector<vector<int> > G;
vector<int> INDEG;
vector<int> COLOR;
void topo() {
for (int i = 0; i < G.size(); i++) {
for (int j = 0; j < G[i].size(); j++) {
INDEG[G[i][j]]++;
}
}
int u;
queue<int> Q;
while (true) {
u = -... | #include <bits/stdc++.h>
#define ll long long
#define ii pair<int,int>
#define fr first
#define sc second
#define mp make_pair
#define All(v) v.begin(),v.end()
using namespace std;
ll f[1000001];
ll bigmod(ll b,ll p ,ll m)
{
if(p==0)
return 1;
if(p%2 == 0)
{
ll temp = bigmod(b,p/2,m);
... | 0 | 70,774,750 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long s, flag = 0, ans = 0;
cin >> s;
long tmp = s;
vector<int> item(1000000);
item.at(0) = tmp;
for (int i = 1; i < 1000000; i++) {
if (tmp%2 == 0) tmp = tmp / 2;
else tmp = 3 * tmp + 1;
item.at(i) = tmp;
for (int j = 0; j < i; j++) ... | #include <iostream>
using namespace std;
void countingSort(int A[], int B[], int n, int k) {
int C[k];
for (int i = 0; i <= k; ++i) {
C[i] = 0;
}
for (int j = 1; j <= n; ++j) {
++C[A[j]];
}
for (int i = 1; i <= k; ++i) {
C[i] += C[i - 1];
}
for (int j = n; j >= 1;... | 0 | 30,251,928 |
#include <iostream>
using namespace std;
int main()
{
long long int n,a,b;
cin>>n>>a>>b;
long long int rem;
long long int count;
count=n/(a+b);
count=count*a;
rem=n%(a+b);
if(rem<a)
count=count+rem;
else
count=count+a;
cout<<count;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct Node {
int key;
Node *prev, *next;
};
Node *nil;
void init() {
nil = (Node *)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void printList() {
Node *cur = nil->next;
int cnt = 0;
while (cur != nil) {
if (cnt != 0) {
... | 0 | 96,914,345 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int mod = 1e9+7;
int main() {
ll n;
cin >> n;
if (n % 2 == 1) {
cout... | 0 | 21,267,470 |
#include<iostream>
#include<cstdio>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{
int a,b,asum=0,bsum=0;
for(int i=0;i<4;i++)
{
cin>>a;
asum+=a;
}
for(int i=0;i<4;i++)
{
cin>>b;
bsum+=b;
}
if(asum>=bsum)
cout<<asum<<endl;
else
cout<<bsum<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define endl "\n"
#define nl cout<<endl
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define txti freopen("input.txt", "r", stdin);
#de... | 0 | 30,623,059 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP... | 0 | 1,920,890 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 1000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmn... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007
#define INF (1<<30)
#define LINF (lint)(1LL<<56... | 0 | 33,769,144 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | #include <bits/stdc++.h>
using namespace std;
#define print cout <<
class StrProc{
public :
string removeTargetStr(string rowStr, string target){
int start_idx = rowStr.find(target);
while(start_idx!=string::npos){
rowStr.replace(start_idx,target.size(),"");
start_idx = rowStr.find(tar... | 0 | 77,096,095 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<double, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(l... | 0 | 3,961,051 |
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<queue>
#include<stack>
#include<algorithm>
#include<string>
#include<math.h>
#include <iomanip>
#include <numeric>
#define _USE_MATH_DEFINES
using namespace std;
int main()
{
int n,m;cin>>n>>m;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | 0 | 40,434,707 |
#include<bits/stdc++.h>
using namespace std;
int s[200005];
int main(){
int n,k;
cin >> n >> k;
int a;
int ans=0;
int tmp=0;
for(int i=0;i<n;i++){
cin >> a;
if(s[a]==0)tmp++;
s[a]++;
}
if(tmp<=k){
cout << 0 << endl;
return 0;
}
sort(s,s+n+1... | #include <iostream>
using namespace std;
int main() {
int n = 0;
while (cin>>n && n != 0) {
int a[5001] = {};
cin>>a[0];
int max = a[0];
for (int i = 1; i < n; i++) {
cin>>a[i];
if (a[i] >= 0) {
int temp = 0;
for (int s = i;... | 0 | 75,139,003 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
const ll mod = 1e9+7;
const int N = 2e5+205;
vector<int>v[N];
bool vis[N];
int sz;
int ans;
void dfs(int x){
vis[x] = true;
sz++;
ans = max(ans,sz);
for(int y:v[x]){
... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<vector<int>> graph(n,vector<int>());
for(int i=1;i<n;i++) {
int x,y;
cin>>x>>y;
--x;
--y;
graph[x].push_back(y);
graph[y].push_back(x);
}
const... | 0 | 77,660,122 |
#include<bits/stdc++.h>
using namespace std;
#define M 1000000
#define L 13
char Hash[M][L];
int h1(int key){
return key % M;
}
int h2(int key){
return 1 + (key % (M-1));
}
int getChar(char str){
if(str == 'A') return 1;
else if(str == 'C') return 2;
else if(str == 'G') return 3;
else if(str == 'T') return 4;
}... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 4,626,312 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main() {
char a, b;
cin >> a >> b;
if (a == 'H')
if (b == 'H')
cout << "H" << "\n";
else
cout << "D" << "\n";
else
if (b == 'H')
cout << "D" << "\n";
else
cout << "H" << "\n";
} | #include <iostream>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#define endl "\n"
using namespace std;
int main()
{
string s;
cin >> s;
int i;
for(i = 0; i < s.length() - 1; i ++)
{
if(s[i] == s[i + 1])
{
cout << i + 1 << " " << i + 2;
break;
}
... | 0 | 64,462,890 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(10);
}
signed ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
... | 0 | 76,197,287 |
#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 vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | #define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
ty... | 0 | 67,579,466 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m; i<n; i++)
#define co(n) cout << n << endl
using namespace std;
int main(){
int n, a, b;
cin >> a >> b;
co(a+b/2);
return 0;
} | const int N = 400005;
const int LG = 21;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#inclu... | 0 | 8,964,835 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include <pprint.hpp>
#endif
#define endl "\n";
#define pb push_back
#define md 1000000007
#define ll long long int
#define all(v) v.begin(),v.end()
ll power(ll a,ll b){ll z=1;while(b){if(b&1){z*=a;z%=md;}a*=a;a%=md;b/=2;}return z%md;}
using namespace std;
mt19937 rng(chrono::stead... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
vector<pair<ll,int>> v;
vector<int> fa,siz;
vector<vector<int>> G;
ll tot;
void dfs(int u,int par,ll d){
tot += d;
for(int v : G[u]){
if(v == par) continue;
dfs(v,u,d + 1);
}
}
int main(){
ios::sync_with_stdio(fal... | 0 | 93,656,917 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(N) for (int i = 0; i < N; i++)
int main(){
int N;
cin >> N;
int arrival_time;
int leave_time;
vector<int> C(N-1);
vector<int> S(N-1);
vector<int> F(N-1);
for (int i = 0; i < N - 1; i++){
cin >> C[i] ... | #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 ... | 0 | 65,637,082 |
#include <iostream>
using namespace std;
const int mxN = 1e5 + 5;
bool done[mxN];
int WA[mxN];
int main() {
int n, m;
cin >> n >> m;
int ac = 0, wa = 0;
for(int i = 1; i <= m; ++i) {
int p;
cin >> p;
string s;
cin >> s;
if(done[p])
continue;
if(s == "AC") {
wa += WA[p];
++ac;
done[p] = true;... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <random>
#include <cstdio>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int) n; i++)
#define all(v) v.begin(),v.end()
int main() {
int n,k;
... | 0 | 34,586,631 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int a, b;
cin >> a >> b;
if (a >= b) {
rep(i, a) { cout << b; }
cout << endl;
} else if (a < b) {
rep(i, b) { cout << a; }
cout << endl;
}
... | 0 | 8,416,547 |
#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 <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | 0 | 49,398,873 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, sum = 0;
cin >> n;
vector<ll> a(n, 0LL);
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
if (2 * sum % (n * (n + 1)) != 0) {
cout << "NO" << endl;
return ... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
using namespace std;
const int INF = 1001001001;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define re0 return 0
#incl... | 0 | 23,112,742 |
#include<stdio.h>
int main(){
int K,X,yen;
scanf ("%d",&K);
getchar();
scanf ("%d",&X);
getchar();
yen=500;
if (K*yen>=X){
printf ("Yes\n");
}else {
printf ("No\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N,X,Z=0;
cin>>N>>X;
vector<vector<int64_t>> p(N+1,vector<int64_t>(3));
p.at(0).at(0)=1,p.at(0).at(1)=1;
for(int64_t i=1;i<=N;i++){
p.at(i).at(1)=p.at(i-1).at(1)*2+1;
p.at(i).at(2)=p.at(i-1).at(2)*2+2;
p.at(i).at(0)=p.at(i-1).at(0)*... | 0 | 89,795,954 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define repr(i,x,n) for(int i=x; i<(n); i++)
#define ALL(x) (x).begin(),(x).end()
#define INF 1e9
typedef long long ll;
using VI = vector<int>;
using VS = vector<string>;
using graph = vector<vector<int>>;
int main()
{
string a,b,c;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 35,047,628 |
#include <iostream>
#include <vector>
#include <string>
#include <deque>
using namespace std;
int main(){
long long K;
cin >> K;
deque<long long> d;
for(int i=1; i<=9; ++i){
d.emplace_back(i);
}
long long cnt = 0;
while(true){
cnt++;
if(cnt == K) break;
long l... | #include <iostream>
#include <cstdio>
#include <list>
using namespace std;
int main()
{
int n, num;
list<int> l;
char s[20];
scanf("%d", &n);
for(int i = 0; i < n; ++ i)
{
scanf("%s", s);
if(s[0] == 'i')
{
scanf("%d", &num);
l.push_front(num);
}
else if(s[6] == 'F')
{
l.pop_front();
}
els... | 0 | 7,071,588 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
vector<string> s(N);
vector<int> t(N);
for (int i=0; i<N; i++){
cin>>s[i];
cin >> t[i];
}
string X;
cin >> X;
auto it = find(s.begin(), s.end(), X);
int idx = it - s.begin();
int sum = accumulate(t.begin()+... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
int S = 0;
rep(i, N) {
cin >> A[i];
S += A[i];
}
int ans = 0;
for(int x : A) {
if (x >= floa... | 0 | 79,111,964 |
#include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
if (b - a > 2 && k - a + 1 >= 0) {
cout << a + (b - a) * ((k - a + 1) / 2) + ((k - a + 1) % 2 == 1 ? 1 : 0) << endl;
} else {
cout << k + 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
void main_sub(void);
int main(int argc, char* argv[]) {
cout << std::fixed << std::setprecision(10);
main_sub();
return 0;
}
using i64 = int64_t;
#ifndef USE_STRICT_INT
#define int i64
#endif
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x... | 0 | 4,117,773 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
string L;
ll dpC[100010] = { 0 };
ll dpUC[100010] = { 0 };
int main(){
cin >> L;
int len = L.size();
dpUC[0] = 1;
for(int i = 0; i < len; i++){
if(L[i] == '0'){
dpC[i+1] = (3 * dpC[i]) % MOD;
dpUC[... | #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)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | 0 | 87,496,881 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
int l = 0;
int r = 0;
int Min = 99999;
cin >> num;
vector<int> vec(num);
for (int i = 0; i < num; i++) {
cin >> vec.at(i);
r += vec.at(i);
}
Min = r;
for (int i = 0; i < num; i++) {
l += v... | 0 | 3,588,381 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int N, Z, W; cin >> N >> Z >> W;
int A[N]; for (int i=0; i<N; i++) cin >> A[i];
int result;
if ( N != 1 ) result = max( abs(A[N-1]-W), abs(A[N-1]-A[N-2]) );
else result = abs(A[N... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i,n) fo... | 0 | 55,595,016 |
#include <algorithm>
#include <cmath>
#include <climits>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
template<typename T> void print(T t) {cout << t << endl;}
int main() {
int H, W;
cin >> H >> W;
vector<... | #include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
int n; cin >> n;
map<char,int> mp;
string s; cin >> s;
for(char c : s) mp[c]++;
for(int i = 1; i < n; ++i){
string t; cin >> t;
map<char,int> tmp;
for(int j = 0; j < t.size(); ++j){
... | 0 | 79,301,147 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int n;cin >> n;
vector<int> p(n),q(n),base(n);
rep(i,n) cin >> p[i];
rep(i,n) cin >> q[i]... | #include <bits/stdc++.h>
using namespace std;
int W, H;
char room[20][20];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int sx, sy;
int dfs(int x, int y)
{
room[y][x] = '#';
int cnt = 1;
for(int i = 0; i < 4; i++){
int nx = x + dx[i], ny = y + dy[i];
if(0 <= nx && nx < W && 0 <= ny && ny < H && roo... | 0 | 73,453,942 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long int in = 1000000001;
long long int ax = 0;
long long int now;
for (int i = 0; i < n; i++){
cin >> now;
in = min(in, now);
ax = max(ax, now);
}
cout << ax - in << endl;
return ... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | 0 | 82,119,382 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int ketasuu(int n){
int... | 0 | 32,269,671 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<long long, int>mp;
for (int i = 0; i < N; ++i) {
int n;
cin >> n;
mp[n]++;
}
vector<long long>A;
vector<long long>B;
long long ans = 0;
for (auto p : mp) {
if (p.second>=2) {
A.push_back(p.first);
}
if (p.second >=... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
template <class String>
size_t levenshtein(const String &s0, const String &s1) {
size_t n0 = s0.size();
size_t n1 = s1.size();
const size_t INF = std::max(n0, n1);
std::vector<std::vector<size_t>> dp(n0 + 1, std::vector<size_... | 0 | 82,607,903 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for(ll i = 0 ; i < n; i++)
#ifdef DEBUG
#define DBG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
#else
#define DBG(fmt, ...)
#endif
int main(){
std::cout<<st... | 0 | 21,527,486 |
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + 7,... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<typename T> using rev_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template<class S, class T> void map_init(map<S, T> &m, S k, T v){if(!m.count(... | 0 | 12,360,681 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#include <cassert>
using namespace std;
#define TEST
#ifdef TEST
#define dout... | #include <iostream>
#include <iomanip>
using namespace std;
void Main() {
u_int32_t H, N;
cin >> H >> N;
u_int32_t sum = 0;
for (u_int32_t i = 0; i < N; i++) {
u_int32_t A;
cin >> A;
sum += A;
}
if (sum >= H) {
cout << "Yes" << endl;
} else {
cout << "... | 0 | 97,967,190 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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, const T &b) { if (b<a) { a=b; return 1; } return 0; }
lli n, x;
int main(void){
cin >> n... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <fstream>
#include <set>
#include <stack>
#include <queue>
#include <list>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
#define db(x) cout << "> " << #x << ": " << x... | 0 | 21,172,233 |
#include <iostream>
using namespace std;
int main(void)
{
int N;
int M;
int ans = 0;
cin >> N >> M;
if(N >= 2)
{
ans = ans + N*(N-1)/2;
}
if(M >= 2)
{
ans = ans + M*(M-1)/2;
}
printf("%d\n",ans);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
const int INF = 1000000007;
int main(){
int N, K, R, S, P;
cin >> N >> K >> R >> S >> P;
string T;
cin >> T;
ve... | 0 | 37,075,643 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
int main(){
ll n; cin>>n;
ll ans=0;
rep(i,n){
ans+=i+1;
}
cout<<ans<... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007
#define INF (1<<30)
#define LINF (lint)(1LL<<56... | 0 | 97,966,998 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main() {
int size1, size2;
cin >> size1 >> size2;
vector <int> vect(size1);
for (int i = 0; i < size1; i++) {
cin >> vect[i];
}
sort(vect.begin(), vect.end());
int sum = 0;
for (int i = 0; i < size2; i++) {
sum... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
int dx4[4] = {1,0,-1,0}, dy4[4] = {0,1,0,-1};
int main()
{
int a... | 0 | 95,371,060 |
#include<iostream>
using namespace std;
int main(){
int N,M;
while(cin>>N>>M,N||M){
int Expected[11]={0};
int sum=0;
int p,d;
for(int i=0;i<N;i++){
cin>>d>>p;
Expected[p]+=d;
}
for(int i=10;i>=0 && M>=0;i--){
if(Expected[i]<=M){
M-=Expected[i];
Expected[i]=0;
}
else{
Expected[i]... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 70,416,770 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
int main(int argc, char*... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 40,227,129 |
#include <string.h>
#include <algorithm>
#include <iostream>
#include <vector>
#define rep1(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define fill(x, y) memset(x, y, sizeof(x))
#define MOD 1000000007
#define NUM 100
using namespace std;
using ll = long long;
s... | #define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(_... | 0 | 75,719,882 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
return (a ? gcd(b%a, a) : b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int main() {
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int dx[4]... | 0 | 99,487,946 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 | 13,947,994 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main() {
SPEED;
string str;
cin >> str;
int flag = 0;
if (str[2] == str[3] && str[4] == str[5]) {
flag = 1;
}
flag == ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { ce... | 0 | 79,407,221 |
#include <iostream>
using namespace std;
class Myclass
{
int a, b, c;
public:
void Get_Num();
void Compare();
};
void Myclass::Get_Num()
{
cin >> a;
cin >> b;
cin >> c;
Compare();
}
void Myclass::Compare()
{
if( ( 0 <= a && a <= 100 ) &&
( 0 <= b && b <= 100 ) &&
( 0 <= c && c <= 100 ) )
{
if( ( a < b )... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 10,322,422 |
#include<iostream>
#include<stdio.h>
#include<string>
using namespace std;
int main(){
string number;
int i,sum = 0;
while(1){
cin >> number;
if(number == "0") break;
for(i = 0; i < number.size(); i++){
sum += number[i] - '0';
}
cout << sum << endl;
sum = 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
const int N = 102;
int dp[N][N][N+N];
int n, m;
char s[N][N];
int f(int i, int j, int k) {
int& ret = dp[i][j][k];
if(ret != -1) return ret;
if(i == n && j == m) {... | 0 | 52,189,136 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(fa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll mod = 1e9+7;
int main(){
int a, b; cin ... | 0 | 31,758,888 |
#include <bits/stdc++.h>
#define ln "\n"
#define SORT(X) sort(X.begin(), X.end())
#define SORTi(X) sort(X.begin(), X.end(), greater<ll>())
#define REP(x, a, b) for (auto x = a; x <= b; x++)
#define REPi(x, b, a) for (auto x = b; x >= a; x--)
#define REPit(x, A) for (auto x = A.begin(); x != A.end(); x++)
#define REPr(x... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
int n;
cin >> n;
ll a[n];
REP(i... | 0 | 177,274 |
#include<bits/stdc++.h>
using namespace std;
int power(int x,int y){
if(y==0){
return 1;
}
if(y%2==0){
return power(x,y/2)*power(x,y/2);
}
else{
return x*power(x,y/2)*power(x,y/2);
}
}
int main(){
int r;
cin>>r;
cout<<power(r,2)<<endl;
} | #include <bits/stdc++.h>
#define ll long long
const int N = 5000001;
using namespace std;
int n,m;
int solve(int row,int column,vector<vector<char> > &v,vector<vector<int> > &dp)
{
int count=0;
if((row>=n)||(column>=m))
return 0;
if((row==n-1)&&(column==m-1))
return 1;
if(v[row][column]=='#'... | 0 | 28,287,943 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for(int i = 0; i <= n; i++){
int price = n - 7 * i;
if(price >= 0 && price % 4 == 0){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
const int mod =1'000'000'007;
int main(){
int n;
cin >> n;
int cnt = 0;
int min = n+1;
rep(i,n){
... | 0 | 29,806,412 |
#include<iostream>
#include<numeric>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
int main(){
int a[4],b[4];
REP(i,4)cin>>a[i];
REP(i,4)cin>>b[i];
cout<<max(accumulate(a,a+4,0), accumulate(b,b+4,0))<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fo(i,s,t) for(int i = s; i <= t; ++ i)
int ans[11], cur, pos;
char ch[2];
int query(long long x)
{
printf("? %lld\n",x);
fflush(stdout);
scanf("%s",ch);
if(ch[0]=='Y') return 1;
return 0;
}
int main()
{
int len = 1;
long long now = 1, res;
for(;len<=11;len++... | 0 | 24,765,002 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | #include <bits/stdc++.h>
using namespace std;
int used[23][23];
int answer;
int h,w;
string s[23];
void dfs(int y,int x){
answer++;
used[y][x] = 1;
if( y-1 >= 0 && used[y-1][x]==0 && s[y-1][x]!='#') dfs( y-1,x );
if( y+1 < h && used[y+1][x]==0 && s[y+1][x]!='#') dfs( y+1,x );
if( x-1 >= 0 && used[y][x-1]==0 ... | 0 | 48,901,719 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
string S; cin >> S;
string k = "keyence"... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define ssort(a) sort(a.begin(), a.end())
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace s... | 0 | 5,357,284 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n;
char S[300][300],T[300][300];
cin>>n;
rep(i,n)rep(j,n) cin>>S[i][j];
int ans=0;
rep(i,n){
int z=1;
rep(j,n)rep(k,n) T[j][k]=S[(j+i)... | 0 | 19,912,860 |
#include<bits/stdc++.h>
using namespace std;
int n;
int dist[505];
int start[505];
int cycle[505];
long long solve(int station){
long long curr = 0;
for(int i=station; i<n; i++){
if(curr<=start[i]){
curr = start[i];
}
else{
long long left = curr-start[i];
left%=cycle[i];
if(left) curr+=cycle[i]-left... | #include <cstdio>
#include <string>
using namespace std;
struct Dice {
int face[6];
const int dir[5][6]={
{1, 5, 2, 3, 0, 4},
{3, 1, 0, 5, 4, 2},
{4, 0, 2, 3, 5, 1},
{2, 1, 5, 0, 4, 3},
{0, 2, 4, 1, 3, 5}
};
const char dchars[6]="NESWY";
int encode[256]={};
... | 0 | 41,382,806 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s;
cin >> s;
cout << s.substr(0, 4) + ' ' << s.substr(4) << endl;
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long int ll;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define MOD 1000000007
#define f firs... | 0 | 92,963,666 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N ;
cin >> N;
map<int,int>A;
map<int,int>B;
for (int n = 0;n<N;++n) {
int num;
cin >> num;
if (0 == n%2) {
A[num]++;
}
else {
B[num]++;
}
}
int A0 = 0;
int a0 = 0;
int A1 = 0;
int a1 = 0;
for (auto itr = A.begin(); itr != A.end... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vector>
#define fix(n... | 0 | 806,051 |
#include<iostream>
#include <vector>
using namespace std;
#define MAX 100
int main()
{
vector<int> data(MAX);
int a, max, i;
max = 0;
while (cin>>a)
if (++data[a-1] > max) max = data[a-1];
for (i = 0; i < MAX; i++)
if (data[i] == max) cout<<(i+1)<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define r... | 0 | 22,140,167 |
#include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << fixed << T * 1.0 / X << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int A, B, C;
cin >> A... | 0 | 22,099,018 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c, k; cin >> a >> b >> c >> k;
int ans;
if (k <= a) ans = k;
else if (k <= a + b) ans = a;
else ans = a - (k - a - b);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
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) f... | 0 | 67,405,384 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD = 1000000007;
ll cnt =0,ans=0;
const int MAX = 510000;
int main (){
int n,x,t;
cin >> n >> x >> t;
if(n%x == 0) cout << (n/x)*t << endl;
else cout << ((n/x)+1)*... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 23,460,897 |
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
int n;
cin >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 51,999,243 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
int n,k,d,c,ans;
cin>>n>>k;
vector<int> v(n,-1);
ans=n;
rep(i,k){
cin>>d;
rep(j,d){
cin>>c;
c--;
if(v[c]==-1){
... | #include <iostream>
using namespace std;
int main()
{
string A, B;
cin >> A >> B;
string result;
if(A.size() > B.size())
{
result = "GREATER";
cout << result << endl;
return 0;
}
else if (A.size() < B.size())
{
result = "LESS";
cout << result << en... | 0 | 19,224,857 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typede... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 59,071,953 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int d;
cin >> d;
string res = "Christmas";
if(d == 22)
{
cout << res + " Eve Eve Eve" << "\n";
}
if(d == 23)
{
cout << res + " Eve Eve" << "\n";
}
if(d == 24)
{
cout << res + " Eve" << "\n";
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int M, K; cin >> M >> K;
int N = (1 << M);
if (M == 0) {
if (K == 0) {
cout << "0 0" << endl;
} else {
cout << -1 << endl;
}
} else if (M == 1) {
if (K == 0) {
cout << "0 0 1 1" << endl;
} else {
cout << -... | 0 | 32,113,269 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i >= n; --i)
typedef long long ll;
#define mod 1000000007
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, cons... | #include <bits/stdc++.h>
const int N = 100;
int n, count[N];
bool solve() {
int d = n - 1;
while (!count[d]) {
d--;
}
for (int i = 0; i <= d; ++i) {
int x = std::max(i, d - i);
if (!count[x]) {
return false;
}
count[x]--;
}
for (int i = 1; i < d; ++i) {
int x = std::max(i, d - ... | 0 | 42,271,563 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int R;
cin >> R;
if(R < 1200) cout << "ABC";
else if (R < 2800) cout << "ARC";
else cout << "AGC";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (V)) cout <<x <<" " <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4... | 0 | 20,012,279 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<cstring>
#include<utility>
#include<set>
#include<stack>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector... | #include <bits/stdc++.h>
using namespace std;
long long INF = 10000000;
int main(){
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int> l(N);
for (int i = 0; i < N; i++){
cin >> l[i];
}
int ans = INF;
for (int i = 0; i < (1 << (N * 2)); i++){
int a = 0;
int b = 0;
int c = 0;
int tmp =... | 0 | 86,174,601 |
#include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
using n... | #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;... | 0 | 34,832,202 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define pb(x) push_back(x)
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define vs vector... | #include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n;
string s;
cin >> n >> s;
ll r = 0, g = 0, b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') r++;
else if (s[i] == 'G') g++;
else i... | 0 | 60,779,277 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n,k; cin>>n>>k;
int a[n]; for(int i=0;i<n;i++)cin>>a[i];
int dp[n];
dp[0]=0;
int cnt;
dp[1]=abs(a[1]-a[0]);
for(int i=2;i<n;i++)
{
int temp=INT_MAX;
cnt=1;
while(cnt<=k&&(i-cnt)>=0)
{
temp=min(temp... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | 0 | 91,492,125 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
long long int N,H,W,i,j,k,ans,count;
string S;
bool flag;
count=0;
ans=0;
flag=false;
cin >> H>>W;
if (H==1 || W==1){
ans=1;
}
else if (H%2==1 && W%2 ==1){
ans=H*W/2+1;
}
else{
... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char** argv) {
string name,num;
cin>>name;
for(int i=0;i<name.length();i++)
{
if(name[i]=='0')
num.push_back('0');
else if(name[i]=='1')
num.push_back('1');
else if(name[i]='B'&& num.empty()!=true)
num.pop_back();
}
cout<... | 0 | 56,785,700 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
int ans = min(A, K... | #include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int h,i;
int ln;
char c[256];
string s;
for(;;){
fgets(c,256,stdin);
s=c;
ln=s.length();
if(ln==2)
... | 0 | 75,985,453 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>
bool ask(T x)
{
static int tot = 0;
++tot;
cerr << "ASK " << tot << endl;
cout << "? " << x << endl;
char c;
cin >> c;
return c == 'Y';
}
void ans(ll x)
{
cout << "! " << x << endl;
exit(0);
}
int ma... | 0 | 96,905,884 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | #include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespac... | 0 | 67,056,329 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n,k; cin>>n>>k;
vector<pair<ll,ll>> sushi(n);
vector<ll> replace;
set<ll> toppings;
for (ll i=0; i<n; i++)
cin>>sushi[i].second>>sushi[i].first;
sort(sushi.begin(),sushi.end());
reverse(sushi.begin(),sushi.end());
ll ans=0;
fo... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
#define READ(X) cin>>X;
#define READV(X) long long X; cin>>X;
#define READAR(A,N) long long A[N]; fo... | 0 | 80,209,461 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int g = 1;
while (true) {
int tmp = k + (g - 1) * (k - 1);
if (tmp < n) {
}
else {
break;
}
g++;
}
cout << g << endl;
return... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 70,313,888 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <set>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
std::vector<int64_t> cnt(n);
for (int i = 0; i < n; ++i) std::cin >> a[i];
long long sum = std::accumulate(a.begin(), a.end(), 0LL);
std::vector<int> od(n)... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmd... | 0 | 77,094,561 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) (cerr << #x << " = " << x << endl;)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF ... | #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>;
using PLL = pair<ll,ll>;
const int INF = 1000000001;
const int MOD = 1000000007;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() ... | 0 | 26,562,337 |
#include<iostream>
using namespace std;
int main(){
char c;
cin >> c;
switch(c){
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
cout << "vowel\n";
break;
default:
cout << "consonant\n";
break;
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<
pair<int, int>,
null_type,
less_equal<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update>
order... | 0 | 97,672,199 |
#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(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a, p;
cin >> a >> p;
p += a * ... | #include <iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
int n, cnt;
while(cin >> n) {
cnt = 0;
for(int i=0; i<=9; i++)
for(int j=0; j<=9; j++)
for(int k=0; k<=9; k++)
for(int l=0; l<=9; l++)
... | 0 | 1,183,066 |
#include <iostream>
using namespace std;
int oneDigit(int num)
{
return (num >= 0 && num < 10);
}
bool isPalUtil(int num, int* dupNum)
{
if (oneDigit(num))
return (num == (*dupNum) % 10);
if (!isPalUtil(num/10, dupNum))
return false;
*dupNum /= 10;
return (num % 10 == ... | #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--)
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
int main(int argc, const char * argv[]){
... | 0 | 62,863,905 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int n;
cin>>n;
if(n>=2800)cout<<"AGC";
else if(n>=1200)cout<<"ARC";
else cout<<"ABC";
} | #include <bits/stdc++.h>
#define IO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define endl '\n'
#define f first
#define s second
#define ll long long
#define ld long double
#define mod 1000000007
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
const int M=2e5+5;
int main() {
IO
int k,n... | 0 | 82,431,034 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.