code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef vector<int> vi;
typedef long long ll;
int main(){
string s;cin>>s;
if(s=="zyxwvutsrqponmlkjihgfedcba"){
cout<<-1<<endl;
return 0;
}
int N=s.size();
if(N!=26... | 0 | 51,930,151 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n + 1);
for(int i = 1; i <= n; i++)
cin >> a[i];
int ans = 0;
for(int i = 1; i <= n; i++)
if (a[a[i]] == i)
ans++;
ans /= 2;
cout << ans << '\n';
return 0;
} | 0 | 18,262,100 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
const int INT_INF = 1001001001;
int main(){
int n,k;
cin >> n >> k;
vector<int> L(n);
for(int i=0;i<n;i++){
cin >> L[i];
}
sort(L.begin(),L.end(),greater<int>())... | #include <bits/stdc++.h>
#define ll long long
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) printf("%d\n",(int)n)
#define lprin(n) printf("%lld\n",n)
#define rep(i,ini,n) for(int i=ini;i<(int)n;i++)
#define pb push_ba... | 0 | 62,166,473 |
#include <iostream>
using namespace std;
int main () {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i += 2) {
int k = 0;
for (int j = 1; j <= N; ++j) {
if (i % j == 0) { k++; }
}
if (k == 8) {
ans++;
}
}
cout << ans << "\n"... | #include <iostream>
#include <algorithm>
using namespace std;
struct Card
{
char value;
char suit;
};
void trace(Card A[], int n)
{
cout << A[0].suit << A[0].value;
for(int i=1; i < n; i++)
{
cout << " " << A[i].suit << A[i].value;
}
cout << endl;
return;
}
bool isStable(Card C1[... | 0 | 95,343,391 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
bool routecheck(vector<int>& perm, vector<vector<int>>& G,int n){
for (int i = 0; i < n-1; i++)
{
int& j = perm[i];
if(fin... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) ... | 0 | 48,465,970 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int a;
int b;
int c;
void input() {
cin >> a;
cin >> b;
cin >> c;
}
int main() {
input();
if(a < b && b < c){
cout << "Yes" << endl;
} else{
cout << "No" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=100005;
int n,p[N],sz[N],U[N],V[N];ll tot,d[N];
map<ll,int>mp;vector<int>G[N];
inline bool cmp(int x,int y){return d[x]>d[y];}
void dfs(int x,int d){tot+=d;for(int i=0;i<G[x].size();i++)dfs(G[x][i],d+1);}
int main()
{
scanf("%d",&n);
for(in... | 0 | 10,289,101 |
#ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <qu... | #include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
string win = "Alice";
string lose = "Brown";
long long X, Y;
int issente[210][210];
int naive(int a, int b) {
if (a <= 1 && b <= 1) return issente[a][b] = 0;
if (issente[a][b] != -1) return issent... | 0 | 80,770,519 |
#include<bits/stdc++.h>
typedef long long int lli;
typedef long double lld;
typedef long long ll;
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define vvlli vector<vector<long long int>>
#define ppi pair<int, int>
#define rppi pair<int, pair<int, int>>
#define lppi pair<pair... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<... | 0 | 24,760,681 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
string s1,s2,s3;
cin>>s1>>s2>>s3;
char s=toupper(s1[0]);
char t=toupper(s2[0]);
char u=toupper(s3[0]);
cout<<s<<t<<u<<endl;
return 0;
} | #include <cstdio>
int main () {
int m, f, r;
while(true) {
scanf("%d %d %d", &m, &f, &r);
char rank = 'F';
if (m == -1 && f == -1 && r == -1) break;
int sum = m + f;
if (m == -1 || f == -1) {
rank = 'F';
} else if (80 <= sum) {
rank = 'A';
... | 0 | 62,475,498 |
#include <bits/stdc++.h>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define fi first
#define se second
#define all(arr) arr.begin(), arr.end()
#define rep... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | 0 | 75,664,994 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#define int long long
#define mod 1000000007
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define all(x) x.begin(),x.end()
using namespace std;
int n, sum;
int... | #include<bits/stdc++.h>
#include<string>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(... | 0 | 732,039 |
#include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
struct UnionFind{
vector<int> data;
UnionFind(int size) : data(size,-1){}
bool unite(int x,int y){
x=root(x),y=root(y);
if(x!=y){
if(data[y]<data[x]){
... | #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <map>
#include <set>
#include <stack>
#include <queue>
using namespace std;
#define pb(n) push_back(n)
#de... | 0 | 61,470,723 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n;
cin >> n;
... | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N-1; i >= 0; i--)
#define repr1(i, N) for (ll i = N; i > 0; i--)
#define INF 1000000007
using ll = long long;
using namespace std;
typedef pair<int,int> P;
typedef vector<i... | 0 | 33,126,000 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MAXN 1000001
ll spf[MAXN];
void sieve()
{
}
int main(){
ll n;
cin>>n;
ll ar[n];
ll *count = new ll[MAXN]();
for(int i=0;i<n;i++){
cin>>ar[i];
count[ar[i]]++;
}
int ans=0;
bool *visited = new bool[MAXN]();
for(int i=1;i<MAXN... | #include<bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define MOD_1_000_000_007 (1000000007)
#define IINF (1<<28)
#define LINF (1LL<<60)
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n)... | 0 | 78,663,285 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 23,033,351 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
using namespace std;
using ll = long long;
using d = double;
int main(){
int n,k;
cin >> n >> k;
int a[n] = {0};
rep(i,k){
int d;
cin >> d;
rep(j,d){
int s;
cin >> s;
if(a[s-1]==0)++a[s-1];
}
... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int c[20], dp[50001];
int main() {
scanf("%d%d",&n,&m);
for (int i=0; i<m; i++) scanf("%d", &c[i]);
sort(c, c+m);
for (int i=1; i<=n; i++) {
dp[i] = dp[i-c[0]]+1;
for (int j=1; j<m; j++) {
if (i < c[j]) break;
... | 0 | 45,424,803 |
#include <bits/stdc++.h>
#define MODNum 1000000007
#define REP(type, i, a, b) for( type i = a; i < b; i++ )
typedef long long ll;
using namespace std;
int main (void) {
int N, R, ans;
cin >> N >> R;
if ( N < 10 ) cout << R + 100 * ( 10 - N ) << endl;
else cout << R << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int MAXN=2e4;
const int bias=1e4;
bool dp[2][MAXN];
char s[10000];
vector<int> h,v;
int main()
{
while(scanf("%s",s+1)!=EOF)
{
int x,y;
scanf("%d%d",&x,&y);
memset(dp,false,sizeof(dp));
int len=strlen(s+1);
h.clear();v.cl... | 0 | 75,519,620 |
#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()
const long long INF = 1LL << 60;
const int MOD = 1000000007;
#define F first
#define S second
signed ... | #include <iostream>
#include <stdio.h>
#define MAX 100005
#define NIL -1
struct Node {
int parent, left, right;
};
Node T[MAX];
int n, D[MAX];
void rec(int u, int p) {
D[u] = p;
if (T[u].right != NIL) rec(T[u].right, p);
if (T[u].left != NIL) rec(T[u].left, p+1);
}
void printChildren (int id) {
pri... | 0 | 25,869,762 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int x, y, z;
x = y = z = 0;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p <= A) {
x++;
} else if (p <= B) {
y++;
} else {
z++;
}
}
int ans;
ans = min(x, min(... | #include <iostream>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <stack>
#include <cstdio>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <iterator>
#include <sstream>
#define popcount(x) __builtin_popcount(x)
... | 0 | 81,191,671 |
#include<bits/stdc++.h>
using namespace std;
int k,a[100001],a1,b[2000001],b1=1,b2=9;
int main()
{
memset(a,0x3f,sizeof(a));
scanf("%d",&k);
for(int i=1;i<10;i++)b[i]=a[i]=i;
while(b1<=b2)
{
for(int i=0;i<10;i++)if(a[(b[b1]*10+i)%k]>a[b[b1]]+i)a[b[++b2]=(b[b1]*10+i)%k]=a[b[b1]]+i;
++b1;
}
printf("%d",a[0]);
... | #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; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
vector<double> t;
vector<double> v;
vector<double> t... | 0 | 79,227,327 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo... | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
char A[60][60];
char B[60][60];
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
cin >> A[i][j];
}
... | 0 | 27,173,735 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, h, w, a, b, ans;
int main() {
cin >> n >> h >> w;
while(n--) {
cin >> a >> b;
ans += (a>=h && b>=w);
}
cout << ans;
return 0;
} | # include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn(1e5 + 5);
int n, a[maxn];
ll sum, cur, x, v[maxn];
int main() {
int i;
scanf("%d", &n);
if (n == 1) return puts("YES"), 0;
for (i = 1; i <= n; ++i) scanf("%d", &a[i]), sum += a[i];
cur = (ll)n * (n + 1) / 2;
if (sum % cur) return ... | 0 | 45,206,944 |
#include<iostream>
#include<string.h>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=0;i<n;i++)
u... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | 0 | 97,256,916 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
using namespace std;
void show(vector< pair<char, int> > &a) {
int n = a.size();
for (int i = 0; i < n; i++) {
printf("%c%d%c", a[i].first, a[i].second, i == n - 1 ? '\n' : ' ');
}
}
void selection_sor... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 79,088,106 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
long long n;
long long max_a = 0;
long long tot = 0;
cin >> n;
for (int i=0;i<n;i++) {
long long a;
cin >> a;
if (max_a > a) {
tot += max_a - a;
} else {
max_a = a;
}
}
cout << tot <<... | #include<bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define umap unordered_map<ll, ll>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, a, ans = 0;
cin >> n;
umap x;
for(ll i=0; i<n; i++){
cin >> a;
x[a]++;
}
a = 0;
... | 0 | 64,658,072 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(10);
double a,b,x;cin>>a>>b>>x;
double pi=3.14159265359;
double ans;
if(x/a<=a*b/2) ans=a*b*b/(2*x);
else ans=2*b/a-2*x/(a*a*a);
cout<<atan(ans)*180/pi<<endl;
} | #include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define V vector
template <typename T> bool chmin(T &a, const T &b) {if(a > b){a = b... | 0 | 23,058,566 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1e9+7;
const int INF=1001001001;
int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a) for(int i=0; i<a;i++)
#define loop2(i,a,b) for(int i=(a... | 0 | 93,579,253 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
string S; cin >> S;
int s = S.size();
int cnt0 = 0;
int cnt1 = 0;
rep(i, s){
if(S[i] == '0'){
cnt0++;
} else {
... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int>>adj(n, vector<int>(n));
for (int i = 0;i < n;i++) {
int u, k;
cin >> u >> k;
for (int j = 0;j < k;j++) {
int v;
cin >> v;
adj[u - 1][v - 1] = 1;
}
}
for (int i = 0;i <n;i++) {
for (int j = 0... | 0 | 34,445,771 |
#include <bits/stdc++.h>
#define int long long
using ll = long long;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(ll i = ll(a); i < ll(b+a); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(a) (a).begin(), (a).end()
using n... | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main(){
string s;
cin >> s;
vector<int> num(26);
vector<int> coun... | 0 | 44,670,795 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int Maxn=2010;
const int inf=2147483647;
const int mod=1000000007;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
return x*f;
}
int f[Maxn];
in... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int cnt1=0;
int cnt2=0;
stack<char> st;
for(int i=0;i<n;++i){
if(!st.empty()){
if(st.top()=='(' && s[i]==')')st.pop();
else st.push(s[i]);
}
else st.pus... | 0 | 71,738,240 |
#include<bits/stdc++.h>
using namespace std;
typedef struct{
double x,y;
}vec_t;
int main(){
double x1,y1,x2,y2,x3,y3,xp,yp;
vec_t AB,BC,CA,AP,BP,CP;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp){
AB.x=x2-x1 , AB.y=y2-y1;
BC.x=x3-x2 , BC.y=y3-y2;
CA.x=x1-x3 , CA.y=y1-y3;
AP.x=xp-x1 , AP.y=yp-y1;
... | #include <vector>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long int ll;
ll MOD = pow(10,9) + 7;
ll solve(vector<ll>& kids,ll K)
{
ll n = kids.size();
vector<vector<ll>> dp(n+1,vector<ll>(K+1));
vector<ll> rs(K+1,1);
vector<ll> nex_rs(K+1);
nex_rs[0] = 1;
for (int i... | 0 | 72,143,020 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using vvi=vector<vi>;
int main() {
ll X,Y; cin >>X >>Y;
cout <<(X%Y!=0 ? X:-1) <<endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
const int A = 1000005;
int gcd(int x, int y){
int r;
if(x<y) swap(x,y);
while(y>0){
r = x % y;
x = y;
y = r;
}
return x;
}
int main(void){
int n;
cin >> n;
vector<int> a(n);
vector<int> c(A);
for(i... | 0 | 15,376,306 |
#include <iostream>
using namespace std;
int main() {
char a, b;
cin >> a >> b;
if((a == 'H' && b == 'H') || (a == 'D' && b == 'D')) cout << "H\n";
else cout << "D\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define INF 2100000000
#define MOD 1000000007
int main(){
ll N;
cin>>N;
vector<pair<ll,ll>> P(N);
for(ll i=0;i<N;i++){
cin>>P.at(i).first;
P.at(i).second=i;
}
sort(P.begin(),P.end());
reverse(P.begin(),P.end());
multiset<ll> S;
... | 0 | 10,623,074 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <bitset>
#include <math.h>
typedef long long ll;
typedef unsigned long long ull;
#define vi std::vector<int>
#define vl std::vector<ll>
#define floop(n) for(int i = 0; i < n; ++i)... | 0 | 46,097,329 |
#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int long long
using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
int parent[N], siz[N];
void make_set(int v){
parent[v] = v;
}
int find_set(int v){
while(v!=parent[v])
v = parent[v];
return v;
}
void ... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#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>
#include <tuple>
#in... | 0 | 26,386,390 |
#include <cstdio>
#include <map>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define ITR(c,it) for(it = c.begin(); it != c.end(); it++)
const int N_MAX = 100000;
typedef long long ll;
int H, W, N;
int a[N_MAX];
int b[N_MAX];
map<pair<int, in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
int main(){
int n, a, b;
cin >> n >> a >> b;
int ans=0;
for(int i=0; i<=n; i++){
int count=0,temp=i;
while(temp != 0){
... | 0 | 68,046,588 |
#include <iostream>
using namespace std;
int dp[111111],a[111111];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= n; i++) {
if (dp[i - 1]+abs(a[i] - a[i - 1]) > dp[i - 2]+abs(a[i] - a[i - 2])) {
dp[i] = dp[i - 2] + abs(a[i] - a[i -... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
constexpr int N_max = 2'000;
constexpr int M_max = 2'000;
constexpr int mod = 1'000'000'007;
#ifdef _MSC_VER
constexpr int debug = 1;
#else
constexpr int debug = 0;
#endif
static int dp0[2'005][2'005];
static int dp1[2'005][2'005];
int main() {
... | 0 | 21,708,732 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
... | #include <iostream>
#include<vector>
using namespace std;
int main() {
int k;cin>>k;
vector<int> list,next;
int ans=1;
int flag=0;
int used[k];
for(int i=0;i<k;i++){
used[i]=0;
}
list.push_back(1);
while(1){
while(list.size()){
int num=list.back();
if(num==0){
flag=1;
break;
}
list.po... | 0 | 56,474,353 |
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(ALL(a),k)
#define SMALLER(a,k) lower_bound(ALL(a),k)-a.begin()
#define Vi vector<int>
#define VVi vector<Vi>
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
using Graph = vector<vector<int>>;
ll calc(ll a, ll b, ll p){
if(b == 0) return 1;
else if(b%2 == 0){
ll d = calc(a,b/2,p);... | 0 | 63,798,716 |
#include<bits/stdc++.h>
using namespace std;
typedef vector<int>V;
void func(int node,int par,int rang);
bool flg[100000]={0};
int n,u,k,c;
V v[100000];
struct Node{
int parent,depth;
};
Node T[100000];
int main(void){
int i,j;
cin>>n;
for(i=0;i<n;i++){
cin>>u>>k;
T[i].parent=0;
T[i].depth=0;
for(j=0;j<k;j+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
vector<char> a(s.size());
for(int i = 0; i < s.size(); i++) {
a[i]=s[i];
}
int b=0;
for(int i = 0; i < s.size(); i++) {
if(s[s.size()-1-i]=='B'){
b++;
}
... | 0 | 33,866,904 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(),(a).end()
#define ALL(a,n) (a),(a)+n
#define vi vector<long long>
#define vd vector<long double>
#define vs vector<string>
#define dcml(n) fixed<<setprecision(n)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6 + 10;
signed main() {
ll a, c;
double b;
cin >> a >> b;
c = b * 100 + 0.1;
cout << (ll)(a * c / 100) << '\n';
return 0;
} | 0 | 21,812,184 |
#include <iostream>
#include <cstdio>
using namespace std;
void print_array(int *x, int n)
{
for (int k = 0; k < n; ++k)
{
if (k == n- 1)
{
printf("%d\n", x[k]);
}
else
{
printf("%d ", x[k]);
}
}
}
int main(int argc, char const *argv[])
{
int input_size, min, count = 0;
cin >> input_size;
int ar... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
ty... | 0 | 86,398,230 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n,k;
cin >> n >> k;
int r = 0;
vector<int> cnt(n+1);
rep(i,n){
int a;
cin >> a;
cnt[a]++;
if(cnt[a] == 1)r++;
... | 0 | 62,324,366 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 100005
using namespace std;
inline int read(){
int sum = 0, t = 1; char ch = getchar();
while(ch < '0' || ch > '9'){ if(ch == '-') t = -1; ch = getchar(); }
while(ch >= '0' && ch <= '9'){ sum = sum * 10 + ch - '0'; ch = getchar(); }
return sum * t;
}
... | #include<iostream>
using namespace std;
int n,i,k,val,V[2005][2005],j;
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(i=1; i*(i-1)<=2*n; i++)
k=i;
if(k*(k-1)!=2*n)
{
cout<<"No\n";
return 0;
}
cout<<"Yes\n";
cout<<k<<"\n";
val=1;
for(i=1; i<=k; i++)
... | 0 | 26,411,027 |
#include <iostream>
#include <algorithm>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void){
int N;
cin >> N;
int A=4,B=7,C=28;
string ans;
bool memo[101] = {false};
for(int i=0;i<=100;i+=A){
for(int j=i;j<=100;j+=B){
memo[j] = true;
... | #include <bits/stdc++.h>
using namespace std;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>
#define standardVar ll n,m,i,j,k,num,num1,num2,flag=0
#define nn <<"\n"
#define __ <<" "<<
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#defin... | 0 | 30,178,973 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
priority_queue<int> q;
int a;
for(int i=1;i<=n;i++){
cin>>a;
q.push(a);
}
int temp;
for(int i=1;i<=m;i++){
temp=q.top();
temp/=2;
q.pop();
q.push(temp);
}
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef LOCAL
#include "/home/shahraaz/bin/debug.h"
#else
#define db(...)
#define pc(...)
#endif
#define f first
#define s second
#define pb push_back
#define all(v) v.b... | 0 | 92,140,820 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t S;
cin>>S;
int64_t A=sqrt(S);
if(A*A>S){
A--;
}
if(A*A==S){
cout<<"0"<<" "<<"0"<<" "<<A<<" "<<"0"<<" "<<"0"<<" "<<A<<endl;
}
else if(A*(A+1)>=S){
cout<<"0"<<" "<<"0"<<" "<<A<<" "<<A*(A+1)-S<<" "<<"1"<<" "<<A+1<<endl;
}
el... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 | 63,253,764 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
int A,B,C,D;
cin >> A >> B >> C >> D;
int left = A+B;
int right = C+D;
string ans = "";
... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define aint(a) a.begin(),a.end()
#define UB upper_bound
#define LB lower_bound
const int NUM = 2e5 + 5;
int32_t m... | 0 | 54,164,699 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
double t[200], v[200];
for (int i = 0;i < N;i++){
cin >> t[i];
}
for (int i = 0;i < N;i++){
cin >> v[i];
}
double sum[200];
sum[0] = 0;
for (... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 97,942,816 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | #include <bits/stdc++.h>
#define itn int
#define gI gi
using namespace std;
typedef long long ll;
inline int gi()
{
int f = 1, x = 0; char c = getchar();
while (c < '0' || c > '9') {if (c == '-') f = -1; c = getchar();}
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return f * x;
}
inline ll gl()... | 0 | 18,461,805 |
#include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
#include <cctype>
#include <cstdio>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll> ;
using vs = vector<string>;
using vb = vector<bool>;
using vll = vector<long long>;
using vvll = vector<v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
... | 0 | 49,213,975 |
#include<iostream>
#include<algorithm>
#define INF 1000000009
using namespace std;
int main() {
int dp[100000];
int n;
int a[100000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
fill(dp, dp + n, INF);
for (int i = 0; i<n; i++) {
*lower_bound(dp, dp + n, a[i]) = a[i];
}
cout << lower_bound(dp, d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... | 0 | 9,489,497 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
#include <utility>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
llong dfs... | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); i++)
#define ll long long
using namespace std;
const int CountStop=245959;
int main() {
while (1) {
int n; cin>>n;
if (n==0) break;
vector<int> x(CountStop+1, 0);
rep(i, n) {
string S,G; cin>>S>>G;
int start=0;
start+=(in... | 0 | 16,032,149 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char s[13];
cin >> s;
for(int i=0;i<12;i++){
cout << s[i];
if(i==3){
cout << " ";
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se second
#define in insert
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x... | 0 | 44,717,476 |
#include<bits/stdc++.h>
using namespace std;
#define hackcyborg shresth_walia
#define ll long long
#define ld double
#define pb push_back
#define mod 998244353
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using na... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
template<int64_t Prime>
struct mod_int {
int64_t v_;
mod_int(int64_t x=0) : v_(x) { normalize(); }
void normalize() { ((v_... | 0 | 55,410,805 |
#include <stdio.h>
main(){
int a,b;
scanf("%d%d",&a,&b);
if(-1000<=a&&b<=1000){
if(a<b){
printf("a < b\n");
}
else if(a>b){
printf("a > b\n");
}
else if(a==b){
printf("a == b\n");
}
}
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int n,x,ans=0;
while (1) {
cin >> n >> x;
if (n==0 && x==0) {
break;
}
for (int i=1; i<n+1; i++) {
for (int j=i+1; j<n+1; j++) {
for (int k=j+1; k<n+1; k... | 0 | 4,744,375 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (std::abs(a-c) <= d) {
cout << "Yes" << endl;... | #include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
const int INF=1e9;
const long long LINF=1e18;
#define int long long
template <typename T>
void fin(T a){
cout<<a<<endl;
exit(0);
}
signed main(){
int N;cin>>N;
string s,t;
cout<<0<<endl;cin>>s;if(s=="Vacant")return 0;
cout<<N-1<<endl;cin>>t;... | 0 | 73,254,895 |
#include <bits/stdc++.h>
using namespace std;
bool IsPrime(long long num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (long long i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
vector<long long> calc... | 0 | 65,558,560 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define per(i, n, s) for (int i = (n-1); i >= (int)(s); i--)
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const ll LINF = LLONG_MAX;
const ... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <climits>
#include <cmath>
#include <string>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep01(i, n) for(int i = 0; i < (n) + 1; i++)
#define rep10(i, n) for(int i = 1; i < (n);... | 0 | 3,394,401 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n && n){
int judge[4] = {0}, cnt = 1, step = 0;
string str;
for(int i = 0; i < n; i++){
cin >> str;
if(str == "lu"){
if(judge[0] == 0){
judge[0] = 1;
judge[2] = 0;
}
else{
judge[0] = 0;
judge[2] = 1... | #include <bits/stdc++.h>
using namespace std;
struct Node {
int index = -1;
int depth = -1;
int parent = -1;
int *child;
int ccnt = 0;
int type = 0;
};
void depth(Node *node, int x, int d) {
node[x].depth = d;
for (int i = 0; i < node[x].ccnt; ++i) {
depth(node, node[x].child[i],... | 0 | 51,851,084 |
#include<bits/stdc++.h>
using namespace std;
bool mysort(const pair<int, int> &s, const pair<int, int> &t){
if(s.second!=t.second)return s.second > t.second;
return s.first > t.first;
}
int main(){
while(true){
int N, M;
cin>>N>>M;
if(N==0&&M==0)break;
vector<pair<int, int> > v;
for(int i=0; i... | #include <iostream>
using namespace std;
int main(void){
int a[5],m=1000,i,j;
for(i=0;i<5;i++) cin >> a[i];
for(i=0;i<5;i++){
int tmp=a[i];
for(j=0;j<5;j++){
if(i!=j){
if(a[j]%10==0) tmp+=a[j];
else tmp+=(a[j]+10-a[j]%10);
}
}
... | 0 | 69,645,238 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 38,269,220 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\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 ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define arep(x,n) for (int x: n)
using namespace std;
int main()
{
int n; cin >> n;
vector<int> x(n); rep(i,n) cin >> x[i];
int ans = 1000000;
for(int i = 1; i <= 100; i++) {
int tmp = 0;
rep(j,n) {
tmp += (x[j... | 0 | 54,532,948 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<string> s(n);
for(int i=0; i<n; i++){
cin >> s[i];
}
int ans = 0;
for(int k=0; k<n; k++){
bool flag = true;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 1,111,171 |
#include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | #include <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 req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 58,652,819 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
typedef long long ll;
const int INF = 1e+9;
const int H_MAX=300;
const int W_MAX=300;
int H,W,D;
vector<pair<int,int>> V(H_MAX*W_MAX+1);
int solve(int s,int e,vector<vector<in... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#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 all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespac... | 0 | 19,349,294 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int extgcd(int a, int b, int& x, int& y) {
int d = a;
if (b != 0)... | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <limits>
#include <queue>
#include <unordered_map>
#include <list>
#include <set>
#include <numeric>
using namespace std;
using ll = long long;
#define rep_init... | 0 | 5,053,288 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int64_t out=1;
for(int i=0;i<n;i++){
int64_t t;
cin>>t;
out=lcm(out,t);
}
cout<<out<<endl;
return 0;
} | #include<cstdlib>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cstring>
using namespace std;
const int MAXN = (int) 105;
const int INF = (int) 0x3f3f3f3f;
typedef long long LL;
int m,n;
vector<pair<int,int> > g;
void work(){
while(~scanf("%d%d",&n,&... | 0 | 77,309,852 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << x << '\n'
typedef long long int ll;
typedef pair<int, int> P;
const long long INF = 3... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(LL i... | 0 | 25,499,218 |
#include <iostream>
#include <cctype>
#include <string>
#include <string.h>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
a = a + a ;
if(a.find(b) != std::string::npos){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string A;
cin>>A;
if(A=="RRR"){
cout<<3;
}
else if(A=="SSS"){
cout<<0;
}
else if(A=="SRR"||A=="RRS"){
cout<<2;
}
else if(A=="SRS"||A=="RSS"||A=="SSR"||A=="RSR"){
cout<<1;
}
return 0;
} | 0 | 15,748,811 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vecto... | #include <iostream>
#include <bitset>
using namespace std;
int main() {
int a[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int n, s, sum, cnt;
while (cin >> n >> s) {
if (!n && !s) { break; }
cnt = 0;
for (int i = 0; i < (1 << 10); i++) {
sum = 0;
for (int j = 0; j <... | 0 | 25,986,514 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int m, h, i;
while (cin >> str, str != "-") {
cin >> m;
for (i = 0; i<m; i++) {
cin >> h;
str = str.substr(h, str.size() - h) + str.substr(0,h);
}
cout << str << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned ui;
typedef unsigned long long ul;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
#define pb push_back
#define fi first
#define se second
#define do(i, j,... | 0 | 45,376,438 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9+7;
const long long INF = 9e15;
const double PI = 3.14159265358979323846;
using ll = long long;
using P = pair<long long, long long>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vP = vector<pair<long long, long long>>;
#defi... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#d... | 0 | 40,189,860 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long int> a(n);
vector<long long int> num(200001,0);
for(int i=0; i<n; i++){
cin >> a.at(i);
num.at(a.at(i))++;
}
long long int count=0;
for(int i=1; i<200001; i++){
count+=num.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=2001,INF=1<<30;
int main(){
int N;cin>>N;
vector<int> A(N),S(100,0);
for(int i=0;i<N;i++){
cin>>A[i];
S[A[i]]++;
}
sort(all(A));
bool flag=true;
... | 0 | 6,498,243 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dp[1145][1145];
int main(){
string s1,s2;
cin>>s1>>s2;
int n=s1.size(),m=s2.size();
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
dp[i][j]=1e9;
... | 0 | 91,653,328 |
#include <bits/stdc++.h>
using namespace std;
#include <string.h>
#include <map>
#define MEM(var, val) memset(var, (val), sizeof(var))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define nitro \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(void){
int n;
cin>>n;
vector<string> v(n);
int ans=0;
rep(i, n){
cin>>v[i];
rep(j, v[i].size()-1){
if(v[i][j] =='A' && v[i][j+1] =='B') ans++;
}
... | 0 | 70,851,842 |
#include <bits/stdc++.h>
typedef long long ll;
typedef std::pair<int,int> pii;
typedef std::pair<ll,ll> pll;
typedef std::pair<std::string,ll> psl;
#define INF INT_MAX
#define INF_L LONG_MAX
#define INF_LL LLONG_MAX
#define MOD 1000000007
#define REP(ii,jj,nn) for (ll ii=jj;ii<(nn);ii++)
#define RREP(ii,nn,jj) for (ll ... | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | 0 | 27,507,617 |
#include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#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()
constexpr static int MOD =... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | 0 | 74,792,585 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
con... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = a ; i > b ; i--)
#define hahashad ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
typedef long long ll;
#define VL vector<ll>
#define IN(inp) ll inp;cin>>inp;
#define pb push_back
#d... | 0 | 19,999,213 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
long long i;
for(i=0;i<12;i++){
if(i==4)
cout<<" "<<s[i];
else
cout<<s[i];
}cout<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int k[500];
int n;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> k[i];
}
for(int i = 1; i <= n; i++){
cout << "node " << i;
cout << ": key = " << k[i];
if(i > 1){
cout << ", parent key = " << k[i/2];
}
i... | 0 | 43,258,444 |
#include <bits/stdc++.h>
#define INF (1000000000000000000)
#define LL long long
using namespace std;
int main()
{
int n = 0 ;
int r = 0;
cin >> n >> r;
if(n < 10)
{
cout<<r+(100*(10-n));
}else
{
cout<<r;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 54,034,995 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char a[5];
cin>>a;
if((a[0]==a[1])&&(a[1]==a[2]))
cout<<"Yes"<<endl;
else if((a[1]==a[2])&&(a[2]==a[3]))
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
#define loop(i,n) for(int i=0;i<n;i++)
#define read(a) int a; cin >>a;
#define readarr(a,n) int a[n] ; for(int i=0;i<n;i++) cin >> a[i];
#define readmat(a,n,m) int a[n][m]; for(int i=0;i<n;i++) for(int j=0;j<m;j++) cin >> a[i][j]... | 0 | 14,421,106 |
#include <iostream>
#include <string>
#include <vector>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
using lint = long int;
using llint = long long int;
using namespace std;
int main() {
fastIO;
int n;
cin >> n;
int cnt = 0;
fo... | #include<cstdio>
#include<cstring>
using namespace std;
const int INF=1e9;
const int maxn=200100;
char str[maxn];
int dp[1<<26];
int zt[1<<26];
int n;
int main(){
scanf("%s",str+1);
n=strlen(str+1);
zt[0]=0;
for(int i=1;i<=n;i++)
zt[i]=zt[i-1]^(1<<(str[i]-'a'));
for(int i=0;i<(1<<26);i++)
dp[i]=INF;
for(int i... | 0 | 43,644,567 |
#include <bits/stdc++.h>
#define PB emplace_back
using namespace std;
const int N = 1e5+100;
int n;
vector<int> v[N];
bool ok = 1, dp[N][3];
void dfs(int x, int px = -1) {
for(int u: v[x]) {
if(u != px) dfs(u, x);
}
int zero=0, one=0;
for(int u: v[x]) {
if(u != px) {
if(dp[u]... | #include <iostream>
#include <utility>
#include <cstdio>
using namespace std;
int main(void) {
int nums[3];
cin >> nums[0] >> nums[1] >> nums[2];
if (nums[2] < nums[1])
swap(nums[2], nums[1]);
if (nums[2] < nums[0])
swap(nums[2], nums[0]);
if (nums[1] < nums[0])
swap(nums[1],... | 0 | 57,347,264 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double l;
cin >> l;
printf("%.12f\n", pow(l/3, 3));
return 0;
} | #include <iostream>
#include <stack>
#include <string>
using std::cout;
using std::cin;
using std::endl;
using std::string;
using std::stack;
int main(void) {
string s;
stack<char> st;
char comp;
bool check;
while (getline(cin, s)) {
if (s[0] == '.') {
break;
}
... | 0 | 71,333,865 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define dl double long
const int INF=0x3fffffff;
const ll MOD=1000000007;
const ll MODD=998244353;
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
int main(){
int n, ans = 0;
cin >> n;
vector<int> x(n), y(n);
for(int i = 0; i < n; i++){
cin >> x[i] >> y[i];
}
bool f = true;
int o = (abs(x[0]) + abs(y[0])) % 2;
for(int i = 1; i < n; i++){
if((a... | 0 | 4,755,659 |
#include <iostream>
using namespace std;
int main(){
int N, A;
cin >> N >> A;
while(N >= 500){
N = N - 500;
}
if(N <= A){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cctype>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
using namespace std;
bool debug=false;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
... | 0 | 93,492,059 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
int main(){
stack<int> densha;
for(int a; cin >> a; ){
if(a == 0){
cout << densha.top() << endl;
... | #include <bits/stdc++.h>
using namespace std;
int dp[(int)1e5+1];
int solve(int *h, int n)
{
if(n == 0)
return 0;
if(dp[n] != -1)
return dp[n];
int op1, op2;
op1 = op2 = 1e9;
if(n >= 2)
op1 = solve(h, n-2) + abs(h[n]-h[n-2]);
if(n >= 1)
op2 = solve(h, n-1) + abs(h... | 0 | 38,708,279 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ii=pair<ll,ll>;
using vi=vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(),(x).end()
#define print(a); for(auto x:a)cout<<x<<" "; cout<<"\n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define loop(i, n) for(int i = 0 ; i < n ; ++i)
#define rloop(i, n) for(int i = int(n)-1 ; i >= 0 ; --i)
#define loopOne(i, n) for(int i = 1 ; i <= n; ++i)
#define range(i, a, b) for(int i = int(a) ;... | 0 | 72,819,472 |
#pragma GCC optimze("Ofast")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 1000000007
#define md 998244353
#define trace(...)
#define ll long long int
#define ld long double
#define fi first
#define se ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
vector<int>n(5);
int ans=644;
int num=0;
int a;
... | 0 | 49,844,613 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 1000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
int main() {
int A, B; cin >> ... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace s... | 0 | 66,301,477 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
template<class T> inline T... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++... | 0 | 50,348,654 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct UnionFind
{
vector<int> r;
UnionFind(int N)
{
r = vector<int>(N, -1);
}
int root(int x)
{
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y)
{
x = root(x);
y = roo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
string s; cin >> s;
if(s.size()%2!=0){
cout << "No";
return 0;
}
string t=s.substr(0,n/2);
if(t==s.substr(n/2,n/2)) cout << "Yes";
else cout << "No";
} | 0 | 46,638,125 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
typedef long long ll;
using namespace std;
int main(){
int x,a;cin>>x>>a;
if(x<a) cout<<0;
else cout<<10;
} | #include<iostream>
#include<string>
#include<vector>
using namespace std;
int main() {
vector<int>x;
string s;
while (cin >> s){
if (s == "0")break;
int sum = 0;
for (int i = 0; i != s.size(); i++){
sum += s[i] - '0';
}
x.push_back(sum);
}
for (int i = 0; i != x.size(); i++)
{
cout << x[i] << endl;... | 0 | 93,847,731 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | #include<bits/stdc++.h>
using namespace std;
int n,m;
void dfs(int i, vector<bool> &checked, bool c[10][10], int &ans){
int t = 0;
for (int j = 0; j < n; j++)
{
if(checked[j]) t++;
}
if(t == n) ans ++;
else{
for (int j; j < n; j++)
{
if(c[i][j] == true && !che... | 0 | 8,643,805 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
#define vi vector<int>
#define vii vector<vector<int>>
void testcase()
{
string s1, s2;
cin >> s1 >> s2;
int change = INT_MAX,x = 0;
for (int i = 0; i + s2.length() - 1 < s1.length(); i++)... | #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#define MAX_N (100000)
#define NUM_MOD (1000000007)
using namespace std;
int main(int argc, char *argv[]) {
int N, ts[MAX_N], as[MAX_N];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &ts[i]);
}
for (int i = 0; i < N; i++) {
scanf... | 0 | 98,317,063 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
int main() {
ll a;
cin >> a;
if(a<1200) cout << "ABC" << endl;
else if(a<2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,K;
cin >> N >> K;
vector<ll> a;
for(int i=0; i<N; i++){int tt; cin >> tt; a.push_back(tt); }
ll ans = 1e18;
for(int bit=0; bit<(1<<N); bit++){
vector<int> cp(N);
copy(a.begin(),a.end(),cp.begin());
int t = cp[0]; ll diff=0... | 0 | 26,689,031 |
#include <bits/stdc++.h>
#define ADAY 86400
using namespace std;
typedef long long ll;
int main(void){
ll n;
while(cin >> n, n){
vector < pair < ll, ll > > t;
for(ll i=0; i < n; i++){
pair<ll, ll> tmp;
int h, m, s;
scanf("%d:%d:%d", &h, &m, &s);
tmp.first = (ll)(h * 3600 + m * 60 + s... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll... | 0 | 35,857,549 |
#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...... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const do... | 0 | 95,158,781 |
#include <iostream>
using namespace std;
int SelectionSort(int A[], int N){
int minj, tmp, cnt=0;
for(int i = 0; i < N-1; i++){
minj = i;
for(int j = i; j < N; j++){
if(A[j] < A[minj]){
minj = j;
}
}
tmp = A[i];
A[i] = A[minj];
A[minj] = tmp;
if(i != minj) cnt++;
}
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
long double a, b, x;
void input() {
cin >> a >> b >> x;
}
long double f(long double a, long double b, long double theta) ... | 0 | 45,628,818 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.