code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<long long> R;
int digit(long long A) {
int c = 0;
while (A != 0) {
c++;
A /= 10;
}
return c;
}
long long divisor(long long N) {
long long F;
long long mincost = 1 << 24;
for (long long a = 1; a*a <= N; a++){
if (N%a != 0... | #include<iostream>
#include<algorithm>
using namespace std;
int count(long long n){
int tmp=0;
while(n>0){
tmp++;
n/=10;
}
return tmp;
}
int main(){
long long n;
cin>>n;
int ans=2e9,tmp;
for(long long i=1;i*i<=n;i++){
if(n%i==0){
long long b;
b=n/i;
tmp=max(count(i),count(... | 1 | 89,654,411 |
#include <cstdio>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <cmath>
#include <iomanip>
#include <deque>
#include <queue>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <sstream>
typedef ... | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int main()
{
int A, B, C;
cin >> A >> B >> C;
cout << max(max(A * 10 + B + C, A + B * 10 + C), A + B + C * 10);
} | 1 | 22,798,894 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<pair<ll, ll>> x(n);
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
x[i] = make_pair(a, b);
}
ll ans = 0;
for (int i = n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
#de... | 1 | 58,923,633 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K,N;
cin >> K >> N;
vector<int>vec(N),aida(N);
for(int i=0; i<N; i++){
cin >> vec[i];
}
for(int i=0; i<N-1; i++){
aida[i] = vec[i+1]-vec[i];
}
aida[N-1] = vec[0]+K-vec[N-1];
sort(aida.begin(),aida.end());
cout << K-aida[N-1] << e... | #include<iostream>
#include<math.h>
#include<string>
#include<vector>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
int main(){
int i;
int max=0;
int k,n;
cin>>k>>n;
vector <int> a;
rep(i,n){
int t;
cin>>t;
a.push_back(t);
}
rep(i,n-1){
int temp=a... | 1 | 13,037,305 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
float a,b;cin>>a>>b;
cout<<float(a)/float(b)<<endl;
return 0;} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
double T, X;
cin >> T >> X;
cout << setprecision(10) << T / X << endl;
return 0;
} | 1 | 32,251,489 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000009
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
string s;
cin>> s;
stack<char> c;
for(char k : s)
... | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
string res = "";
int i = s.size() - 1;
while (i >= 0) {
while (i >= 0 && s[i] != 'B') {
res += s[i--];
}
int cnt = 0;
while (i >= 0 && s[i] == 'B') {
--i;
++cnt;
... | 1 | 59,872,141 |
#include <stdio.h>
int main(void) {
int m, f, r, i, j;
while( 1 ) {
scanf("%d%d%d", &m, &f, &r);
if(m == -1 && f == -1 & r == -1) break;
if(m == -1 || f == -1 || m + f < 30) {
printf("F\n");
continue;
}
int s = m + f;
if(s >= 80) printf("A\n");
else if(s >= 65) printf("B\n");... | #include <iostream>
using namespace std;
int main(){
int m,f,r;
while(1){
cin >> m >> f >>r;
if( m==-1 && f==-1 && r==-1) break;
if( m== -1 || f== -1 ){
cout << 'F' << "\n";
}else if( m+f>=80 ){
cout << 'A' << "\n";
}else if( m+f<80 && m+f>= 65){
cout << 'B' << "\n";
}else if( m+f<65 && m+f>= 50... | 1 | 90,778,166 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
using Graph = vector<vector<int>>;
int main(){
llong A, B;
char op;
cin >> A >> op >> B;
if(op == '+') cout << A+B << endl;
else c... | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | 1 | 60,505,239 |
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1 << 28;
const int MAX_N = 50010;
const int MAX_M = 21;
int c[MAX_M];
int dp[MAX_N];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
fill(dp, dp + MAX_N, INF);
int n, m;
cin >> n >> m;
dp[n] = 0;
for(int i = 0; i < m; ++i){
cin ... | #include <bits/stdc++.h>
using namespace std;
void print_Qbey(){cout<<
" H M#5J~d " <<endl<<
" Hm.?WMM MMB^ .Z d " <<endl<<
" MZS.` ?7WMM M#=`` (!`` d ... | 1 | 5,112,648 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,ssub;
cin >> s;
int i=0,count=0;
for(i=0;i<8;i++){
ssub=s;
ssub=ssub.erase(i,s.size()-7);
if(ssub=="keyence")count++;
}
if(count!=0)cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S, K = "keyence";
cin >> S;
string revS = S;
reverse(revS.begin(), revS.end());
for (int i = 0; i <= S.size(); i++)
{
string front = S.substr(0, i);
for (int j = 0; j <= S.size() - i; j++)
{
string back = revS.substr(0, j);
... | 1 | 47,117,425 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll n;cin >> n;
double ans=0.000000;
rep(i, n) {
ll a; cin>>a;
ans+=1.0/a;
}
ans=1.0/ans;
cout << fixed << setprecision(7);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.... | 1 | 72,110,905 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int h, w;
cin >> h >> w;
string S[h];
string s;
bool isBrankLine[h] = {false};
bool isBrankCol[w];
for(int i = 0; i < w; i++)
isBrankCol[i] = true;
for(int i = 0; i < h; i++)
{
cin >> s;
S[i] = s;
if(s.find('#') ==... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h, w; cin >> h >> w;
vector<string> s(h);
vector<bool> gh(h), gw(w);
for(int i=0; i<h; ++i){cin >> s[i];}
for(int i=0; i<h; ++i){
for(int j=0; j<w; ++j){
if(s[i][j]=='#'){
gh[i] = true;
... | 1 | 23,507,854 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
return v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int n, a, b;
cin >> n >> a... | 1 | 90,115,769 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
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> v... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
int main(){
int N;
cin >> N;
vector<int> h(N);
REP(i,N)cin>>h[i];
int count ... | 1 | 60,940,426 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <time.h>
#define ll ... | #include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using vi = vector<ll>;
const int maxn = 1<<20, mod = 924844033;
ll c[maxn], r[maxn], n, m;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
ll s = 0;
for(int i = 1; i <= n; i++) cin >... | 1 | 19,964,172 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
long long n;
cin>>n;
cout<<n*(n+1)/2<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | 1 | 38,686,504 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string A, B, C;
int n, w;
while( cin >> A) {
if( A == "-")
break;
cin >> n;
for(int i=0;i<n;i++) {
cin >> w;
for(int j=w;j<A.length();j++)
C.push_back(A[j]);
for(int j=0;j<w;j++)
C.push_back(A[j]);
A = C;
B = C;
C.... | #include<stdio.h>
#include<string.h>
int main(){
int h,m,n,i,j,k,len;
char work;
char s[200];
while(1){
scanf("%s",s);
len=strlen(s);
if(s[0]=='-')break;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&h);
for(j=0;j<h;j++){
work=s[0];
for(k=0;k<len-1;k++){
... | 1 | 3,136,773 |
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int n,a;
cin>>n>>a;
if((n%500)==0)
{
cout<<"Yes"<<endl;
}
else if((n%500)<=a)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
} | #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;... | 1 | 41,721,267 |
#pragma region noncode
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll INF = 1'010'000'000'000'000'017LL;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SORT(v) sort(all(v))
#define TROS(v) sort(all(v), std::greater<Type>());
#pragma endreg... | #include <bits/stdc++.h>
using namespace std;
int r, d, x;
int dp[11];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> r >> d >> x;
dp[1] = r * x - d;
cout << dp[1] << "\n";
for(int i = 2; i <= 10; i++)
{
dp[i] = r * dp[i - 1] - d;
cout << d... | 1 | 52,178,716 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 1 | 21,416,779 |
#include <cstdio>
#include <queue>
using namespace std;
priority_queue<int> PQ;
int main() {
char cmd[8];
while (1) {
scanf("%s", cmd);
if (cmd[0] == 'i') {
int val;
scanf("%d", &val);
PQ.push(val);
} else if (cmd[1] == 'x') {
printf("%d\n"... | #include <iostream>
#include <queue>
#include <string>
using namespace std;
int main() {
priority_queue<int> que;
string com;
int v;
while (1) {
cin >> com;
if (com == "insert") {
cin >> v;
que.push(v);
}
else if (com == "extract") {
cout << que.top() << endl;
que.pop();
}
else {
break;
... | 1 | 67,526,971 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n;i++)
int main()
{
int A, B;
cin >> A >> B;
cout << ((A * B * (A + B)) % 3 == 0 ? "Possible" : "Impossible") << endl;
} | #include<iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (((a + b) % 3) == 0)
{
cout << "Possible" << endl;
}
else if ((a % 3) == 0)
{
cout << "Possible" << endl;
}
else if ((b % 3) == 0)
{
cout << "Possible" << endl;
}
else
{
cout << "Impossible" << endl;
}
return 0;
} | 1 | 4,858,318 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int a,b,c;
cin >> a >> b >> c;
if(c>=a && c<=b)cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << (a <= c && c <= b ? "Yes" : "No") << endl;
return 0;
} | 1 | 682,537 |
#include <iostream>
#include <string>
#define inf 1000000000
using namespace std;
string s;
int N;
int Hash[200005];
int table[1<<26];
int dp[200005];
int main(void)
{
cin >> s;
N = s.size();
s = " " + s;
for(int i = 1; i <= N; i++){
Hash[i] = Hash[i-1] ^ (1 << (s[i]-'a'));
}
for(int i = 1; i <= N; i++) dp[i] ... | #include <iostream>
#include <fstream>
#include <map>
using namespace std;
map<int,int> m;
string s;
int msk,bst,x,j,i,t;
int main()
{
cin>>s;
for(i=0;i<s.size();i++)
{
x=s[i]-'a';
msk^=(1<<x);bst=(1<<30);
for(j=0;j<26;j++)
{
t=(msk^(1<<j));
if(m[t]||t... | 1 | 45,323,488 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string k = "keyence";
int n = s.size();
for(int i=0; i<n; i++) {
for(int j=0; j<n-i; j++) {
string t = s;
if(t.erase(i,j) == k) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 1 | 63,177,468 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v... | #define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
vector<pair<ll, int>> factorize(ll n) {
vec... | 1 | 70,992,177 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int k;
cin >> k;
vector<int> a(k);
rep(i, k) cin >> a[i];
reverse(a.begin(), a.end());
ll l = 2, r = 2;
for (int i = 0; i < k; i++) {
l = (l - 1) / a[i] * ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
vector<ll> v;
int N;
ll f(ll X, ll A){
ll ret = X / A;
return ret * A;
}
ll g(ll X){
for(int i = 0; i < v.size(); i++){
X = f(X, v[i]);
}
return X;
}
int main(){
cout << setprec... | 1 | 96,703,377 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define PI 3.1415926535897932
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
long long LCM(long long A,long long B){
long long g=GCD(A,B);
return A/g*B;
}
long lon... | 1 | 11,828,697 |
#include<bits/stdc++.h>
using namespace std;
queue<unsigned long long>q;
unsigned long long k;
void BFS() {
while ( ! q.empty() ) {
int u=q.front()%10;
if (u-1>=0) {
k--;
q.push(q.front()*10+u-1);
}
if (k==0) {
cout<<q.back();
return;
}
k--;
q.push(q.front()*10+u);
if (k==0) {
cout<<q.ba... | #include<bits/stdc++.h>
using namespace std;
queue<long long>q;
int k;
int tot=0;
int main()
{
cin>>k;
q.push(1);
q.push(2);
q.push(3);
q.push(4);
q.push(5);
q.push(6);
q.push(7);
q.push(8);
q.push(9);
while(!q.empty())
{
long long x=q.front();
q.pop();
tot++;
if(tot==k)
{
cout<<x<<endl;
... | 1 | 74,963,536 |
#include <cstdio>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main() {
int r, D, x;
scanf("%d %d %d", &r, &D, &x);
for (int i=0; i < 10; i++) {
int x1;
x1 = r * x -D;
printf("%d\n", x1);
x = x1;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
const ll MAX=1e5+5;
ll lcm(ll x,ll y)
{
return ((x*y)/ __gcd(x,y));
}
void test_cases()
{
ll r,d,x;
cin>>r>>d>>x;
for(ll i=1;i<=10;i++)
{
x=r*x-d;
cout<<x<<"\n... | 1 | 68,340,711 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=2e9+7;
const ll longinf=1LL<<62;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=100010;
const ll mod... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | 1 | 67,589,102 |
#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 INF=1001001001;
const int mod=1e9+7;
int6... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll g(ll k) {
if (k == 0) {
return 0;
} else if (k % 2 == 0) {
return 1 ^ (((k - 2) / 2) % 2) ^ k;
} else {
return 1 ^ (((k - 1) / 2) % 2);
}
}
ll f(ll A, ll B) {
return g(B) ^ g(max(0LL, A-1));
}
int main() {
ll A, B;
cin >> A >> B;
ll an... | 1 | 71,467,230 |
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n;
cin >> n;
int x = 0, y = 0, z = 0;
int t[n], a[n], b[n];
r... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF = (ll)5e15;
int main() {
int n;
cin >> n;
P now = P(0,0);
int time = 0;
rep(i,n) {
int t,x,y;
cin >> t >> x >> y;
int dist = abs(x-now.first) + a... | 1 | 47,348,854 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | 1 | 80,968,787 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>
#include<cassert>
#include<numeric>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef std::pair<int, int> P;
typedef vector<int... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int dx[4]={1, -1, 0, 0};
int dy[4]={0, 0, 1, -1};
int dfs(int x, int y, vector<vector<bool> >& map){
map[y][x] = false;
int num=1;
for(int i=0; i<4; i++){
if(map[y+dy[i]][x+dx[i]]){
num+= dfs(x+dx[i], y+dy[i]... | 1 | 69,411,608 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
using PAIR = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;
#define int int64
#define INIT ios::sync_with_stdio(false);cin.tie(0);
#define VAR(type, ...) typ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 4e5 + 5, mod = 1e9 + 7;
ll add(ll a, ll b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return (a + b) % mod;
}
ll mul(ll a, ll b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return 1ll * a * b % mod;
}
ll x[N], y[N];
... | 1 | 72,342,472 |
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<l... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
#define int long
#def... | 1 | 40,645,054 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long;
int main() {
int n,ans=0;
cin>>n;
string s[50];
string X;
int t[50];
for(int i=0;i<n;i++){
cin>>s[i]>>t[i];
}
cin>>X;
for(int i=n-1;i>=0;i--){
if(s[i]==X)
break;
ans+=t[i];
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
pair<string,int> sleep[n];
for(int i=0;i<n;i++){
string s;
int a;
cin >> s >> a;
sleep[i].first = s;
sleep[i].second = a;
}
string time;
cin >> time;
bool flag = false;
... | 1 | 77,091,228 |
#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
int main(void) {
ll Q;
cin >> Q;
vector<ll> A(Q), B(Q);
REP(i, 0, Q) cin >> A[i] >> B[i];
REP(i, 0, Q) {
ll a = A[i], b = B[i];
if(a > b) swap(a, b);
if(a == b || a + 1 ... | #include<bits/stdc++.h>
using namespace std;
int read(){int x;scanf("%d",&x);return x;}
int main(){
int n=read();
while(n--){
long long a=read(),b=read();
long long fxxk=sqrt(a*b-1);
if(fxxk*fxxk>a*b-1)fxxk--;
printf("%lld\n",fxxk*2-(fxxk>=a)-(fxxk>=b)-(fxxk*(fxxk+1)>=a*b));
}
} | 1 | 53,344,231 |
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <sstream>
struct Coodinate {
double x;
double y;
};
void printCoodinate(const Coodinate &xy) {
std::ostringstream oss;
oss << std::fixed << std::setprecision(8);
oss << xy.x << " " << xy.y;
std::cout << oss.str() << std::en... | #include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int n;
void compute(int depth,double x1,double y1,double x2,double y2){
double si60 = sqrt(3.0)/2.0;
double co60 = 0.5;
double sx = (x1+x1+x2)/3.0;
double sy = (y1+y1+y2)/3.0;
double tx = (x1+x2+x2)/3.0;
double ty = (y1+y2+y2)/3.0;
d... | 1 | 62,364,487 |
#include <iostream>
#include <map>
using namespace std;
int main() {
int n; cin >> n;
long long A[n];
for (int i = 0; i < n; i++) cin >> A[i];
long long S[n+1] = {};
for (int i = 0; i < n; i++) S[i+1] = S[i] + A[i];
map<long long, long long> nums;
for (int i = 0; i < n + 1; i++) nums[S[i]]++... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
#define F first
#define S second
typedef long long ll;
const int dx[4] = {1,0,-1,0};
con... | 1 | 98,248,999 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <cstdio>
#define INF 1LL<<60
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
... | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
int main()
{
ll K;
ll a[50];
cin >> K;
ll t = (ll)(K/50);
cout << 50 << endl;
rep(i,50)
{
a[i] = i-K%50;
if(a[i]<0)
a[i]+=51;
cout << a[i]+t << " ";
... | 1 | 52,593,198 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
struct LOC{
int x,y;
};
int N,M;
LOC from[55],to[55];
int main(){
scanf("%d %d",&N,&M);
for(int i =... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 1 | 96,029,435 |
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | #include <iostream>
#include <cstring>
using namespace std;
const int INF = 1e9;
int m, n;
int c[21];
int dp[21][100005];
int dfs(int i, int sum) {
if (i == m) return n == sum ? 0 : INF;
if (dp[i][sum] != -1) return dp[i][sum];
int ret = dfs(i + 1, sum);
if (sum + c[i] <= n) ret = min(ret, dfs(i, sum + c[i]) +... | 1 | 81,499,975 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include<iostream>
using namespace std;
int main()
{
int a,b,s;
cin>>a>>b>>s;
(a+b<s || a>s)? cout<<"NO" : cout<<"YES";
} | 1 | 64,880,812 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<string, long long> mp;
long long ans = 0;
for(int i = 0; i < n; i++) {
string foo;
cin >> foo;
sort(foo.begin(), foo.end());
ans += mp[foo];
mp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for(int i = 0;i<n;i++)
{
string a;
cin >> a;
sort(a.begin(),a.end());
s.at(i)=a;
}
sort(s.begin(),s.end());
long long cnt = 0,b=0;
for(int i=0;i<n-1;i++)
{
if(s.at(i)==s.at(i+1))
{
b++;
}
else
... | 1 | 41,002,665 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstdint>
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>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
vector<ll> divisor(ll N)
{
vector<ll> ret;
for(ll i=1;i<=(ll)sqrt(N);i++)
{
if(N%i==0)
{
if(N/i!=i) ret.push_back(i);
}
}
return ret;
}
int main()
{... | 1 | 79,909,529 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n,t;
cin>>n>>t;
ll a[n];
for(ll i=0;i<n;i++)cin>>a[i];
ll ans=0;
for(ll i=0;i<n-1;i++){
if((a[i+1]-a[i])<t)ans+=a[i+1]-a[i];
else ans+=t;
}
ans+=t;
cout<<ans;
} | 1 | 83,273,025 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
ll dp[110][2];
int main() {
ll n, p; cin >> n >> p;
vector<ll> a(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i];
}
dp[0][0] = 1;
for (ll i = 0; i < n; ++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 1 | 33,269,003 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vs... | #include <iostream>
using namespace std;
const int N = 101;
int adj[N][N] = {0};
int d[N] = {0};
void bfs(int n, int dd) {
int s[N] = {0};
int k = adj[n][0];
int kk = 0;
for (int j=1;j<=k;j++) {
int nn = adj[n][j];
if (d[nn] != -1 && d[nn] <= dd) continue;
d[nn]=dd;
s[kk++]=nn;
}
for (int j=0;j<kk;j++)
... | 1 | 30,436,715 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
vector<vector<int>> s(m);
rep(i,m){
int k;cin>>k;
rep(j,k){
int a;cin>>a;
a--;
s[i].push_back(a);
}
}
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i <(int)(n); i++)
using namespace std;
int main(){
int N,M;
cin >> N >> M;
vector<vector<int>>S(12,vector<int>(12));
vector<int>P(M);
vector<int>K(M);
int k;
rep(i,M){
cin >> K[i];
int a = K[i];
rep(j,a){
cin >> S[i][j];
}
}
... | 1 | 37,888,057 |
#include<iostream>
int main(){
int na,nb;
std::cin>>na>>nb;
if(na < nb)
std::cout<<"a < b"<<std::endl;
else if(na > nb)
std::cout<<"a > b"<<std::endl;
else
std::cout<<"a == b"<<std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if(a < b) cout << "a < b" << "\n";
else if(a > b) cout << "a > b" << "\n";
else cout << "a == b" << "\n";
return 0;
} | 1 | 5,560,026 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | #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 = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
vector<int> vec(4);
rep(i, 4) cin >> vec[i];
sort(vec.begin(), vec.end());
if (vec[0] == 1 && vec[1] == 4 && vec[2] == ... | 1 | 43,985,729 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void MAIN() {
int a, b;
cin >> a >> b;
cout << a / __gcd(a, b) * b << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
w... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define... | 1 | 37,261,902 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, char const* argv[]) {
int N;
scanf("%d", &N);
printf("%d\n", N / 3);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 1 | 64,345,189 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | #include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se secon... | 1 | 58,679,703 |
#include <iostream>
using namespace std;
int main() {
int N, M, P;
while (cin >> N >> M >> P) {
if (N == 0 && M == 0 && P == 0) break;
int nocards = 0;
int player[N];
for (int i = 0; i < N; i++) {
cin >> player[i];
nocards += player[i];
}
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p, n || m || p) {
vector<int> x(n);
int sum = 0;
for (auto& i : x) cin >> i, sum+=i;
if (x[m-1] > 0) cout << sum * (100 - p) / x[m-1] << endl;
else cout << 0 << endl;
}
... | 1 | 52,889,093 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
int main(){
string C[2];
cin >> C[0] >> C[1];
reverse(C[0].begin(),C[0].end());
if(C[0]==C[1]) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string moji;
cin>>moji;
string mojimoji;
cin>>mojimoji;
if(moji.at(0)==mojimoji.at(2) && moji.at(1)==mojimoji.at(1) && moji.at(2)==mojimoji.at(0)){
cout<<"YES";
}
else{
cout<<"NO";
}
} | 1 | 55,106,201 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
const int MAXN = 2000;
int n;
ll x[MAXN];
ll y[MAXN];
ll dx[] = {0, 0, 1, -1};
ll dy[] = {1, -1, 0, 0};
char ch[] = {'U', 'D', 'R', 'L'};
const ll INF = 1e18;
int main() {
cin >> n;
for (int i =... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<set>
#include<map>
using namespace std;
typedef long long LL;
const int N = 1010;
#define int long long
inline int read()
{
register int x = 0 , f = 0; ... | 1 | 13,786,497 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <li... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
ll k;
cin>>k;
ll n=50;
ll a[n+1]={};
cout<<n<<endl;
if(k<=n){
for(int i=1;i<=k;i+... | 1 | 34,520,187 |
#include <iostream>
#include <set>
#include <deque>
#include <vector>
using namespace std;
typedef long long i64;
i64 k;
i64 dist[100010];
struct edge
{
int to;
int cost;
};
vector<edge> edges[100010];
int main()
{
cin >> k;
for(int i = 0;i < k;i++)
{
{
int n = i + 1;
n = n % k;
edges[i].push_back({n,1}... | #include <bits/stdc++.h>
using namespace std;
struct Dijkstra {
Dijkstra(int V) : V(V), G(V) {}
struct edge {
edge(int to, long long cost) : to(to), cost(cost) {}
int to;
long long cost;
};
using P = pair<long long, int>;
const long long inf = 1001001001001001001ll;
int V;
vector<vector<edge>>... | 1 | 34,012,197 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,d;
cin>>a>>b>>c>>d;
cout<<max(max(a*c,a*d),max(b*c,b*d))<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long a,b,c,d;
cin>>a>>b>>c>>d;
long p= max(b*d,a*d);
long q=max(a*c,b*c);
cout<< max(p,q);
return 0;
} | 1 | 25,784,901 |
#include <bits/stdc++.h>
typedef unsigned long long int ull;
typedef long double ldb;
typedef long long int ll;
#define MOD1 1000000007
#define MOD2 998244353
#define PI 3.1415926535897932384626433832795
#define FILL(a, value) memset(a, value, sizeof(a))
#define BOOST ios_base::sync_with_st... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
double ans=0.0;
cin >> n;
double v[n];
for(int i=0;i<n;i++)cin >> v[i];
sort(v,v+n);
for(int i=0;i<n;i++){
if(i==n-1)ans=v[n-1];
else v[i+1]=(v[i]+v[i+1])/2;
}
cout << ans << endl;
} | 1 | 2,801,223 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
string s, t, u;
cin >> s >> t >> u;
string ans = "";
ans += toupper(s[0]);
ans += toupper(t[0]);
ans += toupper(u[0]);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin >> a >> b >> c;
string x = a.substr(0,1) + b.substr(0,1) + c.substr(0,1);
transform(x.begin(),x.end(),x.begin(),::toupper);
cout << x << endl;
} | 1 | 3,233,187 |
#include <bits/stdc++.h>
using namespace std;
int N;
const int M=1000001;
vector<int>a[M];
bool vis[M];
int gcd(int a,int b){
return a==0?b:gcd(b%a,a);
}
main()
{
cin>>N;
for(int i=2;i<M;++i)for(int j=i;j<M;j+=i)a[j].push_back(i);
int g=0;
bool flag=true;
for(int i=0;i<N;++i){
int A;cin>... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n + 1];
for(long long i = 1; i <= n; i++) {
cin >> a[i];
}
long long gcd = a[1];
for(long long i = 2; i <= n; i++) {
gcd = __gcd(gcd, a[i]);
}
if(gcd != 1) {
cout << ... | 1 | 23,134,691 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,a[1000]={},cnt=0;
while(cin >> n){
if(n==0){
cout << a[cnt-1] << endl;
cnt--;
}else{
a[cnt]=n;
cnt++;
}
}
return 0;
} | #include <stdio.h>
#include <stack>
using namespace std;
int cn;
stack<int> st;
bool input() {
if (scanf("%d", &cn) == EOF)
return false;
return true;
}
int main() {
while (input()) {
if (cn) st.push(cn);
else {
printf("%d\n", st.top());
st.pop();
}
}
return 0;
} | 1 | 97,745,203 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
#define ll int
int dp[1<<26]={0};
int main(){
string s;
cin>>s;
vector<ll> hs;
ll now_h=0;
ll n=s.length();
for(int i=0;i<n;i++){
ll c=(ll)(s[i]-'a');
now_h^=((ll)1<<c);
hs.push_back(now_h);
}
for(i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <utility>
#include <vector>
using... | 1 | 39,403,373 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;cin>>s;
int cnt=0;for(int i=0;i<s.size();i++)cnt+=(s[i]=='x');
cout<<(cnt>=8?"NO\n":"YES\n");
return 0;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <stdlib.h>
#include <set>
typedef long long ll;
using namespace std;
int main() {
int cnt=0;... | 1 | 79,222,443 |
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define sz(a) int((a).size())
#define endl '\n'
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef long long ll;
const int mod = 1e9+7;
ll poww(ll a,ll b){
ll res=1;
while... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pi... | 1 | 24,527,942 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll N,L;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | 1 | 14,357,753 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, i... | #include <bits/stdc++.h>
using namespace std;
int k[20];
int s[20][20];
int p[20];
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
s[i][j]--;
}
}
for (int i = 0; i < M; i... | 1 | 17,249,869 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define... | #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<<" ";n... | 1 | 86,418,849 |
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#def... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long int
int dp[100100][3];
vector<vector<int>> g;
int solve(int u,int col,int parent)
{ if(dp[u][col]!=-1)
{return dp[u][col];}
int var=1;
for(int i=1;i<g[u].size();i++)
{ int v=g[u][i];
if(v!=parent)
{ ... | 1 | 56,743,413 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<=n;++i)
int main(){
int n;cin>>n;
string str="null";
int s=0;
string sl,sr;
int t=n-1;
cout<<0<<endl;
cin>>sl;
cout<<n-1... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 1 | 58,043,215 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n),b(n);
for(int i=0;i<n;++i){
cin >> a[i];
}
for(int i=0;i<n;++i){
cin >> b[i];
}
bool ok = true;
for(int i=0;i<n;++i){
if(a[i]<b[i]) ok=false;
}
if(ok){
cout << '0' << endl;
return 0;
}
... | 1 | 67,690,217 |
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N=19;
int n,a[1<<N],ans[1<<N];
pair<int,int>dp[1<<18];
unordered_map<int,int>vis;
int main()
{
scanf("%d",&n);
int up=1<<n;
for(int i=0;i<up;i++)
scanf("%d",&a[i]);
memset(dp,-1,sizeof(dp));
for(int i=0... | #include <cstdio>
#include <algorithm>
#include <cstring>
#include <set>
#include <iostream>
#include <stack>
#include <vector>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <random>
#include <chrono>
using namespace std;
const int maxn = (1 << 18) + 5;
int f[maxn], s[maxn];
int a[maxn];
i... | 1 | 20,844,729 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<int> count(4);
for (int i = 0; i < 6; i++) {
int tmp;
cin >> tmp;
count.at(tmp - 1)++;
}
sort(count.begin(), count.end());
vector<int> cor = {1, 1, 2, 2};
if (count == cor) cout << "YES" << endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod=1e9+7;
int main(){
int a, num[4]={};
for(int i = 0; i < 6; ++i){
cin>>a;
num[a-1]++;
}
int cnt=0;
for(int i=0; i<4; i++){
if(num[i]%2==1){
cnt++;
}
}
if(cnt==0||cnt==2){
cout<<"YES";
}else{
cout<<"NO";
}
} | 1 | 53,862,007 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t; cin >> s >> t;
cout << (s == t.substr(0, ~-t.length()) ? "Yes" : "No") << endl;
} | #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... | 1 | 56,375,414 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 1 | 86,660,330 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <ios>
#include <iomanip>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int P[100000], Y[100000];
vector<int > ids[100001];
for (int i = 0; i < M; i++){
cin >> P[i] >> Y[i];
ids[P[i]].push_back(Y[i]);
}
for (int i = 0; ... | 1 | 21,014,131 |
#include<iostream>
#include<algorithm>
using namespace std;
int a[4],b[4],c,d;
int main(){
c=0;d=0;
for(int i=0;i<4;i++){cin>>a[i];c+=a[i];}
for(int i=0;i<4;i++){cin>>b[i];d+=b[i];}
cout<<max(c,d)<<endl;
return 0;
} | #include <stdio.h>
#include <algorithm>
using namespace std;
int main() {
int A=0, B=0, t;
for (int i = 0; i < 4; i++) {
scanf("%d", &t);
A += t;
}
for (int i = 0; i < 4; i++) {
scanf("%d", &t);
B += t;
}
printf("%d\n", max(A, B));
return 0;
} | 1 | 27,225,843 |
#include<iostream>
#define rep(i, n) for (int i = 0; i < (n); i ++)
using namespace std;
int main()
{
int n;
cin >> n;
int max = 0, min = 1000000001;
int tmp;
rep(i, n)
{
cin >> tmp;
if (tmp > max) max = tmp;
if (tmp < min) min = tmp;
}
cout << max - min;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
int n;
ll min = pow(10, 9), max = 0;
cin >> n;
rep(i, n){
int a;
cin >> a;
if(min > a){
min = a;
}
if(max < a){
max = a;
}
}
cout << max - m... | 1 | 75,148,092 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
#define all(a) a.begin(), a.end()
const int MOD = 1e9+7;
const int INF = 1001001001;
int edge[8][8] {0};
int main(){
int N, M;
cin >> N >> M;
... | #include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | 1 | 67,203,925 |
#include <bits/stdc++.h>
#include <atcoder/dsu>
#include <boost/range/adaptors.hpp>
#include <boost/range/combine.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, q;
cin >> n >> q;
atcoder::dsu d(n);
for (auto _ :... | #include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma intrinsic(_umul128)
using namespace std; using namespace atcoder;
void _main(); int main() { cin.tie(0); ios::sync... | 1 | 84,026,960 |
#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;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const long long MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
long long GCD(long long a, long long b) {
... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | 1 | 45,364,248 |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int h,w,d;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int col[4001][4001];
int ng[501][501];
int ans[501][501];
int main(void){
scanf("%d%d%d",&h,&w,&d);
memset(col,-1,sizeof(col));
for(int i=0;i<20... | #include<bits/stdc++.h>
using namespace std;
int h,w,d;
const string color = "RBGY";
int main(){
cin>>h>>w>>d;
for( int i = 0; i < h; i++ ){
for( int j = 0; j < w; j++ ){
int a = i + j;
int b = w + i - j;
putchar(color[a/d%2+b/d%2*2]);
}
puts("");
}
return 0;
} | 1 | 30,376,819 |
#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 MK make_pair
#define REP(i, a, b) for (int i=a; i < b; i++)
bool sort_by(pi c, pi d){
return c.S < d.S;
}
int main() {
int R, G, B, N, ans... | #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>;
const int INF = 2e9;
int main(){
int r,g,b,n;
cin >> r >> g >> b >> n;
int x,y,z;
int ans = 0;
x = n/r + 1;
y = n/g + 1;
rep(i,x){
rep(j,y){
... | 1 | 76,213,644 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
long long a[n+1], sum = 0, res = 1;
for(int i = 0; i < n+1; i++) {
cin >> a[i];
sum += a[i];
}
if(n == 0) {
if(a[0] == 1) {
cout << "1" << endl;
return 0;
}
else {
cout << "-1" << endl;
return 0;
}
}
else {
if(a[... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 1 | 6,735,866 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main()
{
string s, t;
cin >> s >> t;
vector<int> sChar(26, -1), tChar(26, -1);
int n = s.size();
bool ok = true;
rep (i, n)
{
if (sChar[t[i] - 'a'] == -1)
sChar[t[i] - 'a'] =... | #include "bits/stdc++.h"
using namespace std;
int main() {
string S, T;
cin >> S >> T;
bool ans = true;
map<char, char> ma, ima;
for (int i = 0; i < S.size(); ++i) {
char s = S[i], t = T[i];
if (ma.count(s)) if (ma[s] != t) ans = false;
if (ima.count(t)) if (ima[t] != s) ans ... | 1 | 41,426,848 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | #include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) <<... | 1 | 78,215,362 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fastIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define rep1(i,n) for(ll i = 1;i <= (n); ++i)
#define pb push_back
#define M 1000000007
unordered_map<ll,ll>mp;
int main()
{
fastIO
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string N;
cin >> N;
long long sum = 0;
for (char n : N) {
sum += static_cast<long long>(n - '0');
}
if (sum % 9 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | 1 | 52,853,961 |
#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() {
string s;
cin >> s;
vector<ll>arr(s.size() ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int n=s.size()+1;
vector<int>num(n);
int left=0;
for(int i=1;i<n;i++){
if('<'==s[i-1]){
left++;
num[i]=left;
}
else{
left=0;
num[i]=left;
}
}
int right=0;
for(int i=1;i<n;i++){
if('... | 1 | 62,532,509 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a,b,c) for(int a=b;a<=(int)c;++a)
#define fd(a,b,c) for(int a=b;a>=(int)c;--a)
#define cu(a,b,c) for(int a=b;a<(int)c;++a)
#define cd(a,b,c) for(int a=(b)-1;a>=(int)c;--a)
#define gcd(... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 1 | 1,221,679 |
#include <bits/stdc++.h>
#include <vector>
#include <cstdlib>
using namespace std;
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 long long INF = 1LL << 60;
const int MAX = 10... | #include<bits/stdc++.h>
using namespace std;
long long dp[100005][5];
int main()
{
int n,x,y,z,p,q,i;
cin>>n;
cin>>dp[1][1]>>dp[1][2]>>dp[1][3];
for(i=2; i<=n; i++)
{
cin>>x>>y>>z;
dp[i][1]=x+max(dp[i-1][2],dp[i-1][3]);
dp[i][2]=y+max(dp[i-1][1],dp[i-1][3]);
... | 1 | 58,484,673 |
#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");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
ll n , a , b;
cin >> n >> a >> b;
ll c = n/(a+b);
ll d = n%(a+b);
ll sum;
if (d >= a){
sum = c*a + a;
}
else{
sum = c*a + d;
}
cout << sum << ... | 1 | 21,957,378 |
#include <iostream>
using namespace std;
const int Max = 10000000;
bool prime[Max];
int main()
{
int in;
for(int i=0; i<Max; i++){
prime[i] = true;
}
prime[1] = false;
for(int i=2; i<Max; i++){
if(prime[i]){
for(int s=i*2; s<=Max; s+=i){
prime[s] = false;
}
}
}
while(cin>>in){
... | #include<iostream>
#include<string.h>
using namespace std;
int n,ans;
bool a[1000000];
int main(){
while(cin>>n){
memset(a,true,sizeof(a));
a[0]=false;
a[1]=false;
ans=0;
for(int i=2;i<=n;i++){
if(a[i])
for(int j=2*i;j<=n;j+=i)
a[j]=false;
}
for(int i=1;i<=n;i++)
if(a[i]) ans++;
cout<<a... | 1 | 60,391,232 |
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using piii = pair<int, pair<int, int>>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 ... | 1 | 40,015,935 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long n;
scanf("%ld", &n);
long iMin = 2000000000;
long iSum = 0;
bool bSame = true;
for(long i = 0; i < n; i++){
long a,b;
scanf("%ld %ld", &a, &... | 1 | 72,033,073 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,a;
cin>>n>>a;
cout<<n*n-a<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n=0,a=0;
cin >> n >> a;
int grid = n*n;
cout << grid-a << endl;
} | 1 | 63,789,598 |
#include<iostream>
using namespace std;
int main(){
int n,b,f,r,v,a[4][3][14]={0};
cin>>n;
for(int i=0;i<n;i++){
cin>>b>>f>>r>>v;
a[b-1][f-1][r-1]=a[b-1][f-1][r-1]+v;
}
for(int k=0;k<4;k++){
for(int j=0;j<3;j++){
for(int s=0;s<10;s++){
cout<<" "<<a[k][j][s];
}
cout<<endl;
}
if(k==0||k==1||k==... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
int main() {
int n;
cin >> n;
vector<vector<vector<int> > > vvv;
REP(i,4) {
vecto... | 1 | 12,019,801 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.