code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<iostream>
using namespace std;
const long long p = 1000000007;
int n;
long long inverse[100100];
long long a[100100];
long long comb[100010][2];
long long beki(long long i, long long k)
{
if(k == 0){
return 1;
}
if(k % 2 == 0){
long long c = beki(i, k / 2);
c = c % p;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
const ll MAX = 100010;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
... | 1 | 25,090,366 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<long long> a(n);
for(int i=0;i<n;++i) cin>>a[i];
long long cur=1;
long long ans=0;
for(int i=0;i<n;++i){
if(a[i]!=cur){
++ans;
continue;
}
++cur;
}
... | #include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.... | 1 | 10,844,677 |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define max 251
#define nil 2000000001
int h[max];
void print(int n){
for(int i=0;i<n;i++){
cout<<"node "<<i+1
<<": key = "<<h[i]<<", ";
if(i!=0)cout<<"pa... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < n; i++)
typedef long long ll;
int parent(int i) { return i/2; }
int left(int i) { return 2*i; }
int right(int i) { return 2*i+1; }
int main() {
int H;
cin >> H;
int A[H+1];
for (int i = 1; i <= H; i++) cin >> A[i];
fo... | 1 | 15,071,190 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <cctype>
#include <cstdlib>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <list>
#include <map>
#include <set>
using namespace std;
int main() {
long long n, l;
cin >> n;
map<long long,long long> m;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd(a,b) __gcd(a,b)
#define ff first
#define ss second
#define p pair<int,int>
#define pb push_back
#define endl '\n'
#define w(t) ll test;cin>>test;while(test--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define pi... | 1 | 15,043,247 |
#include<bits/stdc++.h>
typedef long long ll;
#define endl "\n"
using namespace std;
int main()
{
int N, one, two, three;
cin >> N;
one = N % 10;
N /= 10;
two = N % 10;
N /= 10;
three = N % 10;
N /= 10;
if(one == 7 || two == 7 || three == 7)
{
cout << "Yes";
}
els... | #include <bits/stdc++.h>
using namespace std;
int main(){
string N;
cin>>N;
bool ans=true;
for(int i=0;i<3;i++){
if(N.at(i)=='7'){
cout<<"Yes"<<endl;
ans=false;
break;
}
}
if(ans){
cout<<"No"<<endl;
}
} | 1 | 91,878,547 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
#define all(a) (a).begin(), (a).end()
int N, X, Y;
vector<int> a;
int main () {
cin >> N >> X >> Y;
a.resize(N);
rep(i,N) cin >> a[i];
int ans = abs(a[N-1] - Y);
if(N > 1) ans = max(ans, abs(... | #include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#define rep(i, a, b) for ( int i = (a); i < (b); i++ )
#define per(i, a, b) for ( int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#defin... | 1 | 5,026,549 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, a;
cin >> n >> a;
if (n % 500 <= a) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
string ans = ( a >= (n%500) ) ? "Yes" : "No";
cout << ans << endl;
return 0;
} | 1 | 64,447,996 |
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
if(n % 2 || n == 0)
return cout << 0, 0;
long long answer = 0;
answer += n / 10;
n /= 10;
while(n >= 5) {
answer += n / 5;
n /= 5;
}
cout << answer;
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
ll N; cin >> N;
if (N % 2 == 1) {
cout << 0 << endl;
return 0;
}
ll M = 10;
ll res = 0;
while (N / M > 0) {
res += N ... | 1 | 65,772,920 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count;
for (int i = 0; i < 30; i++){
for (int j = 0; j < 30; j++){
if (4 * i + 7 * j == N){
count++;
}
}
}
if(count) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int up_c = N/4;
int up_d = N/7;
bool can = false;
for(int i=0; i< (up_c + 1); i++){
for(int j=0; j<(up_d+ 1);j++){
int amount = 4*i + 7*j;
if(amount == N){
can = true;
break;
}
}
if(can) ... | 1 | 66,567,168 |
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | 1 | 1,578,358 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
vector<string> grid(n);
rep(i, n) cin >> grid[i];
int ans = 0;
for (int a = 0; a < n; a++) {
bool can = true;
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
bool check(vector<string> &V){
for(int i=0;i<V.size();i++){
for(int j=0;j<V.size();j++){
if(V[i][j]!=V[j][i])return false;
}
}
return true;
}
int main(){
int ... | 1 | 68,854,338 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <climits>
#include <map>
#include <set>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<in... | 1 | 78,119,151 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, m, i, ans=0, money=0;
map<string, long long> mpr, mpb;
cin >> n;
for(i=0;i<n;i++){
string s;
cin >> s;
mpb[s]++;
}
cin >> m;
for(i=0;i<m;i++){
string s;
cin >> s;
mpr[s]++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define SQ(a) (a)*(a)
template <class T, class ... | 1 | 21,225,576 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> ... | #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 | 22,579,432 |
/*https:
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long n, m;
cin >> n >> m;
if (n == 1 || m == 1)
{
cout << "1";
}
else if (n * m % 2 != 0)... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 | 94,313,374 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
double a, b, c;
cin >> a >> b >> c;
a = a / c;
if(a > b){
cout << "... | #include <bits/stdc++.h>
#define ll long long
#define pb(x) push_back((x))
#define line() cerr << "DEBUG @" << __LINE__ << endl;
#define debug(x) \
cerr << "DEBUG @" << __LINE__ << " -> " << #x << " = " << x << endl;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll d, t, s;
cin >>... | 1 | 24,987,168 |
#include <bits/stdc++.h>
using namespace std;
#define alphanso \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main()
{
int n, a, b;
cin >> n >> a >> b;
if ((abs(a - b) + 1) % 2 == 0)
cout << "Borys";
else
cou... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef priority_queue<P,vector<P>,greater<P>> P_queue;
typedef priority_queue<... | 1 | 95,647,385 |
#include <bits/stdc++.h>
int main()
{
int N;
scanf("%d", &N);
int sum{};
for (int i{1}; i <= N; i++)
{
sum += i;
if (sum >= N)
{
for (int j{1}; j <= i; j++)
if (j != sum - N)
printf("%d\n", j);
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, i, j;
int s = 0;
cin >> n;
for( i = 1 ; s < n ; i = i + 1 ){
s += i;
}
for( j = 1 ; j < i ; j = j + 1 ){
if( j != s - n ) cout << j << endl;
}
return 0;
} | 1 | 31,812,575 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,d,A,B;
cin>>a>>b>>c>>d;
A=a+b+c+d;
cin>>a>>b>>c>>d;
B=a+b+c+d;
if(A<B){A=B;}
cout<<A<<endl;} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int v[2]={};
for(int i=0; i<2; i++){
for(int j=0; j<4; j++){
int n;
cin >> n;
v[i] += n;
}
}
cout << max(v[0], v[1]) << endl;
} | 1 | 97,414,253 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,x;
cin >> a >> b >> x;
if(a+b>=x && x>=a) cout << "YES" << "\n";
else cout << "NO" << "\n";
return 0;
} | 1 | 49,591,391 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,LL> PL;
const int MOD=1000000007;
int INF=100100100;
int x[100010],y[100010],t[100010];
int main(){
int n;cin>>n;
for(int i=1;i<=n;i++)cin>>t[i]>>x[i]>>y[i];
for(int i=1;i<=n;i++){
int T=t[i]-t[i-1... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N; cin >> N;
vector... | 1 | 17,103,284 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
char a, b;
cin >> a >> b;
int cmp = (a - 'A') - (b - 'A');
if (cmp > 0) cout << '>' << "\n";
else if (cmp < 0) cout << '<' << "\n";
else cout << '=' << "\n";
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>hex>>x>>y;
if(x>y)cout<<'>';
else if(x==y)cout<<'=';
else cout<<'<';
} | 1 | 95,704,070 |
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n,l;
std::cin >> n>>l;
std::vector<ll> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
ll start = -1;
for (int i = 0; i < n-1; i++) {
if(a[i]+a[i+1]>=l){
start = i;
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 1 | 43,415,843 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
int k; cin>>k;
int a,b; cin>>a>>b;
int dd= 0;
for(int i=a;i<=b;i++)
{
if(i%k==0)
{
dd=1;
break;
}
}
if(dd==0)
cout<<"NG\n";
else cout<<"OK\n";
return 0;
} | #include<iostream>
#include<math.h>
#define pi 2*acos(0)
int main()
{
int a,b,c;
int x=0;
std::cin>>a>>b>>c;
x = c/a;
if(a*x>= b){
std::cout<<"OK"<<std::endl;
}
else{
std::cout<<"NG"<<std::endl;
}
return 0;
} | 1 | 58,451,816 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,Y,x,y,z;
cin >> N >> Y;
int check = 0;
for(x=0;x<=N;x++){
for(y = 0;y <=N;y++){
z = N-x-y;
if(z >= 0 && Y == 10000*x+5000*y+1000*z){
check = 1;
break;
}
}
if(check)break;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,y;
cin >> n >> y;
y /= 1000;
for(int i=0; i<=y/10; i++){
for(int j=0; j<=(y-10*i)/5;j++){
if(i+j+(y-10*i-5*j) == n){
cout << i<< " "<< j <<" "<< y-10*i-5*j << endl;
... | 1 | 4,969,018 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void){
ll n, m;
cin >> n >> m;
vector<int> c(n);
for (int i = 0; i < m; i++){
ll a, b;
cin >> a >> b;
a--; b--;
c[a] = (c[a] + 1) % 2;
c[b] = (c... | #include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end(... | 1 | 68,834,664 |
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
#define MOD (ll)1000000007
#define PI 3.14159265359
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "... | #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<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define _GLIBCXX_DEBUG
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_el... | 1 | 16,867,834 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 10000000000000009
typedef long long ll;
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define ORREP(i,n) for(int i=(n);i>=1;--i)
#define ZREP(i,n) for(int i=1;i<(n);++i)
#define RREP(i,n) for(int i=(n)-1... | #include <iostream>
#include <vector>
using namespace std;
vector< vector<int> > construct(int k) {
vector< vector<int> > ret(k);
int num = 1;
for(int i=0;i<k-1;++i) {
for(int j=i+1;j<k;++j) {
ret[i].push_back(num);
ret[j].push_back(num);
++num;
}
}
... | 1 | 70,660,000 |
#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;
int main(){
int64_t N,M;
cin>>N>>M;
cout<<min((N*2+M)/4,M/2)<<endl;
} | 1 | 98,206,857 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <iomanip>
#include <map>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alength=200000;
int main(... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#include <unordered_map>
#inc... | 1 | 65,458,866 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b){return (a%b==0?b:gcd(b, a%b));}
int lcm(int a,int b){return a*b/gcd(a, b);}
int main()
{
string s;
int64_t k;
cin >> s >> k;
for (int i = 0; i < min((int64_t)s.size(), k); i++)
{
if (s[i] != '1')
{
cout << s[i] << endl;
ret... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | 1 | 95,695,725 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define tcase int _; cin >> _; while(_--)
const int MAX = 1e6;
const int MOD = 1e9+7;
int ans;
int n;
ll v[MAX], sum[MAX];
void solve() {
cin >> n;
for(int i=0; i<n; i++) cin >> v[i];
ans = 0;
for(int i=0; i<61; i++) {
ll c1 = 0;
for(int j=0; j<... | #include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define valid(nx,ny) nx>=0 && nx<n ... | 1 | 89,576,987 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main()
{
ll h,w;
cin>>h>>w;
if(h==1||w==... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 1 | 20,661,156 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int l;
cin >> l;
double hen;
hen = double(l/3);
double hen2 = hen*hen*hen;
cout << fixed << setprecision(10) << (double)(l*l*l)/27;
} | #include <stdio.h>
#include <math.h>
int main()
{
double l;
scanf("%lf",&l);
l/=3.0;
l=l*l*l;
printf("%lf",l);
return 0;
} | 1 | 25,920,545 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | #include <bits/stdc++.h>
using namespace std;
struct edge{
int to,cost;
};
const int INF = 10000000;
int k;
vector<edge> g[100001];
int d[100001];
void dijkstra(int s){
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>> > que;
fill(d,d+k,INF);
d[s] = 0;
que.push(make_pair(0,s... | 1 | 33,441,806 |
#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
int na, nb, m;
std::cin >> na >> nb >> m;
std::vector<int> a(na), b(nb), x(m), y(m), c(m);
for (auto &e : a) std::cin >> e;
for (auto &e : b) std::cin >> e;
for (int i = 0; i < m; i++) {
std::cin >> x[i] >> y[i] >> c[i];
x[i]--;
y[i]--;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> SE... | 1 | 26,940,555 |
#include<bits/stdc++.h>
using namespace std;
const double PI = 3.14159;
const int modi = 1e9+7;
int main(){
int n,k;
cin >> n >> k;
long long pref[n+1],suff[n+1];
pref[0] = 0;
suff[n]=n;
long long ans = 0;
for(long long i =1;i<=n;i++){
pref[i]=pref[i-1]+i;
suff[n-i] = suff[n-i+1] + (n-i);
}
for(int i =k;i<... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const ll MOD=1000000007;
int N,K;
void input()
{
cin>>N>>K;
}
void solve()
{
ll ans=0;
vi A(N+1); for(int i=0;i<=N;++i) A[i]=i;
ll MIN=0,MAX=0;
for(int i=0;i... | 1 | 3,112,178 |
#include <iostream>
#include <algorithm>
int main() {
int data[3];
std::cin >> data[0] >> data[1] >> data[2];
std::sort(data,data+3);
std::cout << data[0] << " " << data[1] << " " << data[2] << std::endl;
} | #include <stdio.h>
int main(void)
{
int a, b, c, min, mid, max;
scanf("%d %d %d", &a, &b, &c);
if(a < b){
if(b < c){
min = a;
mid = b;
max = c;
}else{
max = b;
if(a < c){
min = a;
mid = c;
}else{
min = c;
mid = a;
}
}
}else{
if(c < b){
min = c;
mid = b;
max = a;... | 1 | 3,565,747 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t a,b,k,eat;
cin>> a >> b >> k;
eat=min(a,k);
a-=eat; k-=eat;
eat=min(b,k);
b-=eat; k-=eat;
cout<< a <<" "<< b <<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t a,b,x;
cin >> a >> b >> x;
if(x<a){
cout << a-x << " " << b << endl;
}else if(x<=a+b){
cout << 0 << " " << a+b-x << endl;
}else{
cout << 0 << " " << 0 << endl;
}
} | 1 | 88,556,656 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
const ll INF = 1LL << 55;
ll d[101][101];
bool can[101];
int main(){
int V,E;
cin >> V >> E;
rep(i,V){
rep(j,V){... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
const int MAX_N = 105;
const ll INF = pow(10,15);
ll A[MAX_N][MAX_N]; int n;
void init()... | 1 | 34,849,547 |
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <list>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
struct point{ double x; double y; };
void Koch(point a, point b, int n)... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloa... | 1 | 79,827,966 |
#include <iostream>
using namespace std;
int main()
{
long long int a {},b {},c {},d {};
cin >>a>>b>>c>>d;
cout << max(max(a*c,a*d),max(b*c,b*d));
return 0;
} | #include <bits/stdc++.h>
#define INF 1e7
#define mod 1000000007
using namespace std;
typedef long long int ll;
typedef tuple<int,int,int> tii;
typedef tuple<long long int,long long int,long long int> tll;
typedef tuple<double,double,double> tdd;
int main()
{
ll a,b,c,d; cin >> a >> b >> c >> d;
ll ans = a*c;
... | 1 | 52,306,414 |
#include<bits/stdc++.h>
#define lln long long int
#define llu unsigned lln
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define scd(n) scanf("%lf",&n);
#define pf(res) printf("%d\n",res);
#define pfl(res) printf("%lld\n",res);
#define pfd(res) printf("%lf\n",res);
#define maxii 100005
using namespace ... | #include <iostream>
using namespace std;
void ABC50(void);
void ABC52(void);
void ABC53(void);
void ABC54(void);
void ABC55(void);
void ABC56(void);
void ABC57(void);
void ABC58(void);
void ABC59(void);
int main(void){
ABC54();
return 0;
}
void ABC54(void){
int a,b;
cin>>a>>b;
if(a==1)a=14;
if(b... | 1 | 86,410,584 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int32_... | #include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll N, ll K) {
auto ans {N-K+1};
cout << ans << endl;
}
int main() {
ll N;
cin >> N;
ll K;
cin >> K;
solve(... | 1 | 76,705,589 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main( void )
{
int year, month, day;
scanf( "%d/%d/%d", &year, &month, &day );
if ( ( year <= 2019 ) && ( month <= 4 ) && ( day <= 30 ) )
{
cout << "Heisei" << endl;
}
else
{
cout << "TBD" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
int n = stoi(s.substr(0, 4) + s.substr(5, 2) + s.substr(8, 2));
if (n > 20190430) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
} | 1 | 22,530,979 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#def... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a.begin(),a.end());
int ans1 = a[n - 1];
int ans2 = 0;
int k = (ans1 + 1) / 2;
for(int i = 0; i < n; i++){
... | 1 | 34,939,567 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int main(... | #include <iostream>
#include <stack>
using namespace std;
int main(){
string str;
while(true){
getline(cin,str);
if(str==".") return 0;
bool ok = true;
stack<char> s;
for(auto c:str){
if(c=='('||c=='['){
s.push(c);
}else if(c==']'){... | 1 | 32,653,591 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const int MAX_N = 200005;
vector<ll> X,H;
ll bomb[MAX_N];
vector<P> XH;
queue<P> Q;
int main()
{
ll N,D,A;
cin >> N >> D >> A;
rep(i,N)
{
ll x,h;
cin >> x >> h;
X.push_back(x)... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, D, A;
cin >> N >> D >> A;
vector<pair<int, int>> M(N);
for (int i = 0; i < N; i++){
int X, H;
cin >> X >> H;
M[i] = make_pair(X, (H + A - 1) / A);
}
sort(M.begin(), M.end());
vector<int> imos(N + 1, 0);
long long ans = 0;
for... | 1 | 82,185,729 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define x first
#define y second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ins insert
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define up_b upper_bound
#define low_b low... | 1 | 50,150,083 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M; cin >> N >>M;
for(int i = 0; i < M; i++){
int a; cin >> a;
N -= a;
if(N < 0){
cout << -1 <<endl;
return 0;
}
}
cout << N << endl;
} | #include<bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int N,M; cin >> N >> M;
int sum = 0;
for (int i = 1; i <= M; ++i) {
int x; cin >> x;
sum += x;
}
cout << (sum <= N ? N-sum : -1) << "\n";
} | 1 | 7,421,873 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000001;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
int main() {
int N,M;
cin >> N >> M;
vector<int> vec(N);
for(int i = 0;i < M;i++) {
... | #include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve(){
UL N, M; cin >> N >> M;
vector<pair<UL, UL>> Q(M); rep(i, M) cin >> Q[i].first >> Q[i].second;
vec... | 1 | 70,346,358 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
int k, a, b; cin >> k >> a >> b;
int temp = k * (a/k + (a%k != 0));
if (temp >= a && temp <= b) cout << "OK" << '\n';
else cout << "NG" << '\n';
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 1 | 63,156,445 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
template <typename T>
ll GCD(T a, T b) {
if (b == 0) {
return a;
}
ll d = GCD(b, a % b);
return d;
}
int main() {... | #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... | 1 | 44,746,292 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int ans;
for(int i=1;i<4;i++){
if(i!=a&&i!=b){ans=i;break;}
}
cout<<ans<<endl;
} | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a;
cout<<"\n";
cin>>b;
if(a!=1 &&b!=1)
cout<<"1";
else if(a!=2 &&b!=2)
cout<<"2";
else
cout<<"3";
} | 1 | 82,467,820 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> c[100005];
rep(i,m) {
int a, b;
cin >> a >> b;
a--; b--;
c[a].push_back(b);
c[b].push_back(a);
}
queue<int> q;
vector<int> p(n,-1);
q.push(0);... | #include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
vector <int> to[100100];
int main(void){
int N, M;
cin >> N >> M;
rep(i,M){
int a, b;
cin >> a >> b;
... | 1 | 54,908,879 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int a[N],b[N];
int main(){
int A,B,m,ans,Amin=1e5,Bmin=1e5;
cin>>A>>B>>m;
for(int i=1;i<=A;++i)
cin>>a[i],Amin=min(Amin,a[i]);
for(int i=1;i<=B;++i)
cin>>b[i],Bmin=min(Bmin,b[i]);
int x,y,c;
ans=Amin+Bmin;
for(int i=1;i<=m;++i){
cin>>x>>y>>c;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 1 | 5,332,663 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | #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 | 23,177,052 |
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int main(void) {
priority_queue<int> que;
for(int r = 0; r < 10; r++) {
int input; cin >> input;
que.push(input);
}
for(int r = 0; r < 3; r++) {
cout << que.top() << endl; que.pop();
}
return(0);
... | #include <iostream>
#include <string>
using namespace std;
int main(){
int a[10];
int n;
for (int i = 0; i < 10; i++){
cin >> a[i];
}
for (int i = 0; i < 3; i++){
for (int j = 0; j < 10; j++){
if (i < j){
if (a[i] < a[j]){
n = a[i];
a[i] = a[j];
a[j] = n;
}
}
}
}
for (int i = 0... | 1 | 80,576,355 |
#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 1e6 + 9;
vector<ll>adj[mx];
bitset<mx>mark;
ll dist[mx];
int main() {
ll n, m; cin >> n >> m;
for(ll i = 0; i < m; i++) {
ll u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
bool nafi... | 1 | 19,487,436 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, int> P;
typedef pair<ll, pair<ll, ll> > P3;
const ll MOD = ll(1e9 + 7);
const ll LLINF = LLONG_MAX;
const int IINF = INT_MAX;
const int MAX_N = int(1e5) + 5;
const double EPS = 1e-8;
int dx[] = {1, 0, -1... | #include<iostream>
using namespace std;
#define INF 1000000
int main(){
int n,m,c[21];
int dp[50001];
cin >> n >> m;
for(int i=0;i<m;i++){
cin >> c[i];
}
for(int i=0;i<=n;i++){
dp[i] = INF;
}
dp[0] = 0;
for(int i=0;i<m;i++){
for(int j=0;j<=n;j++){
if(j+c[i] > n) break;
if(dp[j]==INF) continue;
d... | 1 | 70,201,503 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,p,x,d,a;
while(cin>>n>>m>>p,n){
int sum=0;
for(int i=0;i<n;i++){
cin>>x;
if(i+1==m)d=x;
sum+=x;
}
a=sum*100*(100-p)/100;
if(d!=0)cout<<a/d<<endl;
else cout<<0<<endl;
}
} | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <stdlib.h>
using namespace std;
int main(void){
while(1) {
int N, M, P, div, num = 0, ans;
cin >> N >> M >> P;
if( N == 0 && M == 0 && P == 0) break;
for(int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
num += tmp;
if(... | 1 | 31,317,412 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int N, nmin, nmax, pcurr, pprev, maxi, maxv;
for (;;) {
scanf("%d %d %d", &N, &nmin, &nmax);
if (N == 0 && nmin == 0 && nmax == 0) break;
maxi = -1, maxv = 0;
scanf("%d", &pprev);
for (int i = 2; i <... | #include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<string.h>
#include<string>
#include<functional>
#include<iomanip>
using namespace std;
#define INF 1<<21
#define DIV 1000000007
int main() {
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax, (m || nmin || nmax)) {
int p[10005];
int ... | 1 | 56,921,224 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
string ans = "";
for (int i = 0; i < 1; ++i) {
ans += toupper(s1[0]);
}
for (int i = 0; i <... | #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;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 un... | 1 | 32,505,945 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int ans = 0;
for (int A = 1; A <= N; A++)
{
ans += (N-1)/A ;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin>>n;
ll c=0;
ll i;
for(i=1;i*i<n;i++)
{
if(n%i==0)
c+=(n/i-i);
else
c+=(n/i-i+1);
}
i--;
c*=2;
cout<<c-i;
} | 1 | 72,563,585 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s,t,u;
cin >> s >> t >> u;
if(s[s.size()-1]==t[0] && t[t.size()-1]==u[0]) cout << "YES" << endl;
else cout << "NO" << endl;
} | 1 | 62,932,970 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<pair<int, int>> p(n);
for(int i=0; i<n; i++){
int a;
cin >> a;
p[i] = make_pair(a,i+1);
}
sort(p.begin(),p.end());
reverse(p.begin(),p.end());
multiset<int> pos;
pos.insert(0);
... | #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 pair<ll, ll> P;
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&... | 1 | 166,491 |
#include <bits/stdc++.h>
using namespace std;
int selectionSort(vector<int>& A, int N)
{
int sum = 0;
for(int i = 0; i < N; i++){
int minj = i;
for(int j = i; j < N; j++){
if(A.at(j) < A.at(minj)){
minj = j;
}
}
if(i != minj) sum++;
swap(A.at(i), A.at(minj));
}
return sum;
}
int main()... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
int count_sw = 0;
void ss(int A[],int N){
for (int i = 0; i < N-1; i++) {
int min = A[i];
int k = i;
for (int j = i+1; j < N; j++) {
if (min > A[j]) {
min = A[j];
... | 1 | 1,221,856 |
#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 rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX=1001001;
const ll MOD=1000000007;
int main()
{
ll h, w, a, b;
cin >> h>>w>>a >> b;
vector<vecto... | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | 1 | 54,992,528 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(n);
int sum = 0;
for(int i=0; i<n; i++) {
cin >> a[i];
sum += a[i];
}
bool ans = false;
double check = double(sum) / (4*double(m));
sort(a.begin(), a.end());
reverse(a... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
double condition = 0.0;
void func()
{
int M, N;
cin >> N >> M;
int sum = 0;
vector<int> A(N);
for (int i = 0; i < N; ++i)
{
cin >> A[i];
sum += A[i];
}
int ok... | 1 | 93,216,055 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int cnt;
int sum;
string ans="War";
vector<int> a(n);
rep(i,n){
cin>>a[i];
}
vector<int> b(m);
rep(i,m){
cin>>b[i];
}
for(int i=x+1;i<y;i++){
cnt=0;
for(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector<int> a(N);
vector<int> b(M);
for(int i = 0; i < N; i++) cin >> a[i];
for(int i = 0; i < M; i++) ci... | 1 | 45,901,964 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SZ(X) ((int)(X).size())
#define endl "\n";
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,k,j;
vector<int> a;
cin>>n>>k;
for (int i = 0; i < n; ++i)
{
cin>>j;
a.push_back(j);
}
int cnt=0;
for (int i = 0; i... | #include<stdio.h>
#include <iomanip>
#include <iostream>
#include<string>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
#include <random>
#include <chrono>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int tmp,cnt=0;
rep(i, n) {
cin >> tmp;
... | 1 | 24,923,020 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int h,w,d;
cin >> h >> w >> d;
int x[90001];
int y[90001];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
int a;
cin >> a;
x[a]=i;
y[a]=j;
}
}
int dis[90... | #include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRC... | 1 | 8,288,457 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
using namespace std;
#define pi 3.14159265358... | #include <iostream>
#include <vector>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
using namespace std;
const double cos60 = cos(M_PI / 3);
const double sin60 = sin(M_PI / 3);
struct StPnt
{
double m_nx;
double m_ny;
StPnt() :
m_nx(0), m_ny(0)
{ }
StPnt(double nx, double ny) :
m_nx(n... | 1 | 63,082,942 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> x(a);
for(int i = 0;i < a;i++){
cin >> x.at(i);}
long long v=0;
vector<int> one(a);
int mmm=0;
for(int i = 0;i < a;i++){
if(mmm < x.at(i)){mmm = x.at(i);
one.at(i) = 1;}
}
vector<int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 1 | 59,467,196 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | 1 | 10,558,234 |
#include<iostream>
#include<stdio.h>
using namespace std;
using ll=long long;
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<(n);i++)
using P=pair<int,int>;
int main(){
int n;
string s,t;
cin>>n>>s;
t=s.substr(0,n/2);
t=t+t;
if(t==s)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
string s;
cin... | 1 | 39,721,700 |
#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"
#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 | 45,595,113 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
if (A == B)
cout << "Draw" << endl;
else
cout << (A > B ? "Alice" : "Bob") << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
#define reverse(s) reverse(s.begin(),s.end())
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
... | 1 | 86,096,950 |
#include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 1000000007
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
signed main(){
int n;
cin>>n;
vector<int> a;
for(int i=0;i<n;i++){
int x;
cin>>x;
a.pb(x);
}
int cur = 1;
int ans = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n,i,a[100005],curr_price,ans=0,curr_max=1;
cin>>n;
for(i=0;i<n;i++) {
cin>>a[i];
}
if(a[0]>=2) {
ans+=(a[0]-1);
}
for(i=1;i<n;i++) {
curr_price = curr_max+1;
if(curr_price<a[i]) {
if(curr_max==1) {
if(a[i]%2==0) {
ans+=(... | 1 | 21,664,053 |
#include <bits/stdc++.h>
#define ll long long
const ll inf=(1LL<<62);
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
template <class A> inline A abs(A &a) { return (a < 0 ? -a : a); }
using namespace std;
signed main() {
ll n;
cin >> n;
ll ans = n;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, MAX = 1e6;
cin >> N;
vector<int> V;
V.push_back(1);
for (int i = 6; i <= MAX; i *= 6) {
V.push_back(i);
}
for (int i = 9; i <= MAX; i *= 9) {
V.push_back(i);
}
sort(V.begin(), V.end());
vector<int> DP(MAX + 1, 2e9);
DP.at(0)... | 1 | 16,075,715 |
#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()
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < b; i++) {
if ((a... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <math.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
int a, b, c;
cin >> a >> b >> c;
string ans = "NO";
vector<int> state(b, 0);
int i =... | 1 | 26,942,565 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char a[4];
cin>>a[0]>>a[1]>>a[2];
if(a[0]==a[1]&&a[0]==a[2]&&a[1]==a[2])cout<<"No";
else cout<<"Yes";
} | #include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back... | 1 | 8,210,865 |
#include <iostream>
using namespace std;
int main() {
while( true ) {
long long int n;
cin >> n;
if ( n == 0 ) break;
char d[256];
for ( long long int i = 0; i < 256; i++ ) {
d[i] = i;
}
for ( long long int i = 0; i < n; i++ ) {
char in, out;
cin >> in >> out;
d[in]... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <sstream>
#include <queue>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iterator>
#include <stack>
#include <list>
using namespace std;
typedef long long int lli;
typedef pair<int,int> P;
#define F... | 1 | 64,496,851 |
#include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <numeric>
#include <vector>
#include <iterator>
#include <set>
#include <map>
using namespace std;
const double PI=acos(-1);
int main(){
long q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int q,h,s,d,n;
cin>>q>>h>>s>>d>>n;
int minv=min(min(q*4,h*2),s);
if(minv*2<=d){
cout<<minv*n;
}
else{
cout<<(n%2)*minv+n/2*d;
}
return 0;
} | 1 | 70,492,157 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pi 2*acos(0.0)
#define scan(i) scanf("%d",&i)
#define loop(i,n) for(int i = 0 ; i <n ; i++)
#define vect vector<int>
#define vec_it vector<... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vec vector<int>
#define map map<int,int>
#define scn(t) scanf("%d",&t);
#define lscn(t) scanf("%lld",&t);
#define mod 1000000007
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl "\n... | 1 | 27,526,557 |
#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()
{
int n,d,x;
cin >> n >> d >> x;
rep(i,n)
{
int a;
cin >> a;
x += (d-1) / a + 1;
}
cout << x << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n, d, x, k, sum=0;
cin>>n;
cin>>d>>x;
while(n--)
{
cin>>k;
sum+=(d-1)/k+1;
}
sum+=x;
cout<<sum<<endl;
} | 1 | 2,035,979 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int64_t N,M;
int64_t testnum;
cin >> N >> M;
testnum = 1 << M;
cout << (M*1900*testnum) + ((N-M)*100*testnum) << "\n";
return 0;
} | 1 | 88,762,519 |
#include <bits/stdc++.h>
using namespace std;
#define MAXD 300001
using pii = pair<int,int>;
unordered_set<int> rows[MAXD],cols[MAXD];
int h,w,m;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>h>>w>>m;
for (int i = 0,hi,wi; i < m; ++i) {
cin>>hi>>wi;
rows[hi].insert(wi);
... | #define _CRT_SECURE_NO_WARNINGS 1
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define pii p... | 1 | 48,371,805 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll n,k;
cin>>n>>k;
vector<ll> cnt(1e5+1);
for(i... | #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>;
const int INF = 100010001;
const ll LINF ... | 1 | 89,898,839 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h1,m1,h2,m2;
int k;
cin>>h1>>m1>>h2>>m2;
cin>>k;
h1=h1*60+m1;
h2=h2*60+m2;
int ans=abs(h1-h2);
ans = ans-k;
cout<<ans;
} | #include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
#define pb push_back
#define pll pair<long long,long long>
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int h1,m1,h2,m2;
cin>>h1>>m1>>h2... | 1 | 36,120,022 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define emplace_back push_back
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ... | #include <bits/stdc++.h>
#define REP(i, a, b) for(int i = (int)a; i < (int)b; i++)
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define vi vector<int>
#define ii pair<int, int>
#define ll long long int
#define MAX 20001... | 1 | 34,496,156 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> vec(N);
int minimum=100,maximum=-100;
int input;
for(int i=0;i<N;i++){
cin >> input;
vec.at(i) = input;
minimum = min(minimum,input);
maximum = max(maximum,input);
}
int res = 2000000;
int sum;
for... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
const long long mod = 1e9 + 7;
typedef long long ll;
typedef priority_queue<int> PQ;
typ... | 1 | 87,255,150 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespa... | #define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,a,b,c,x;
int y[10000];
while(cin>>n>>a>>b>>c>>x,n){
rep(i,n)cin>>y[i];
int f,r=0;
for(f=0;f<=10000;f++){
if(x==y[r]){
r++;
if(r==n)break;
}
x=(a*x+b)%c;
}
cout<<(f<=10000?f:-1)<<endl;
}
return 0;
} | 1 | 49,822,713 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | #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 | 3,594,295 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int> > adj(110);
int D[110];
for(int i = 0; i < n; i++){
int u, k;
cin >> u >> k;
D[u] = -1;
for(int j = 0; j < k; j++){
int v;
... | #include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
queue<int> Q;
int n,u,k,vv,cur,dst;
cin >> n;
vector<int> D(n,-1),check(n,0);
vector< vector<int> > v(n);
for(int i = 0;i < n;++i){
cin >> u >> k;
for(int j = 0;j < k;++j){
cin >> vv;
... | 1 | 34,093,323 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define PI 3.14159265
#define EPS 1e-9
#define Pi acos(-1.0)
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) for(int i=(a); i<(b); i++)
#define clean(arr,val) memset(arr,val,sizeof(... | #include<cstdio>
#include<algorithm>
const static int MAX_N = 50;
const static int MAX_M = 50;
bool A[MAX_N][MAX_N];
bool B[MAX_M][MAX_M];
int main(){
int N, M;
scanf("%d %d", &N, &M);
char a;
for (int i = 0; i < N; ++i){
scanf("\n");
for (int j = 0; j < N; ++j){
scanf("%c", &a);
A[i][j] = a == '.';
}
... | 1 | 33,485,368 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for (int i = 0; i < (n); ++i)
const ll MAX = 1e18;
void solve(long long N, std::vector<long long> A){
ll ans = 1;
rep(i,N){
if(A[i] == 0){
cout << 0 << endl;
return;
... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
ll n;
cin>>n;
vector<ll> vec(n);
ll ans = 1;
for(int i = 0; i < n; i++){
cin>... | 1 | 55,028,522 |
#include <stdio.h>
int main(){
char sebelum;
scanf("%c", &sebelum);
sebelum++;
printf("%c", sebelum);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 | 65,927,974 |
/*http:
#include <iostream>
using namespace std;
int main(){
string str;
cin>>str;
string::reverse_iterator rt=str.rbegin();
while(rt!=str.rend()){
cout<<*rt++;
}
cout<<endl;
return 0;
} | #include <iostream>
#include <cstring>
using namespace std;
int main(){
char a[20];
size_t n;
cin>>a;
n=strlen(a);
for(int i=n-1 ; i>=0 ; i--){
cout << a[i] ;
}
cout << endl;
return 0;
} | 1 | 30,712,264 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
cin>>n;
string x;
string y;
int a=0;
int b=0;
while(cin>>x){
cin >>y;
if(y==x) {
a+=1;
b+=1;}
else if(y>x)
{b+=3;}
else if(y<x)
{a+=3;}
}
cout<<a<<" "<<b<<endl;
return ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int t = 0,h = 0,n = 0;
string taro,hanako;
cin >> n;
for(int i = 0;i < n;i++){
cin >> taro >> hanako;
if (taro == hanako){t++;h++;}
else if(taro < hanako)h = h+3;
else if(taro > hanako)t = t+3;
}
cout << t << " " << h << endl;
return 0;
} | 1 | 81,306,531 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.