code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
using P = pair<ll, ll>;
ll gcd(ll m, ll n)
{
if (m < n)
{
ll tmp = m;
m = n;
n = tmp;
}
while (1)
{
ll mod = ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t A, B, C, D, c, d, cd;
cin >> A >> B >> C >> D;
c = (B / C) - (A - 1) / C;
d = (B / D) - (A - 1) / D;
cd = (B / lcm(C, D)) - (A - 1) / lcm(C, D);
cout << (B - (A - 1)) - c - d + cd << endl;
} | 1 | 34,667,572 |
#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define forn(i, n) for(int i = 0; i < int(n); ++i)
typedef pair<int, int> pii;
const int MAX = 100+10;
char grid[MAX][MAX];
int path[MAX][MAX];
void solve(){
int H,W;
cin>>H>>W;
forn(i,H){
cin>>grid[i];
}
if(grid[0][0] =='.'){
path... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 1 | 61,351,803 |
using namespace std;
#include<iostream>
int main(){
int n,b=0,a=1;
cin>>n;
for(int i=0;i<n;i++){
b+=a;
a++;
}
std::cout << b << std::endl;
} | #include <iostream>
using namespace std;
int main(void){
int N, s;
s = 0;
cin >> N;
for (int i = 1; i <= N; i++){
s = s + i;
}
cout << s << endl;
return 0;
} | 1 | 399,805 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>a(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
sort(a.begin(),a.end());
int64_t ans=0;
for(int i=0;i<(n-k);i++){
ans+=a.at(i);
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define all(X) (X).begin(),(X).end()
#define P 1000000007
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
void solve() {
ll n, k;
cin >> n >> k;
vect... | 1 | 50,164,864 |
#include <iostream>
#include <algorithm>
#include <string>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::string str;
int q;
std::cin >> str >> q;
for(int i=0; i<q; ++i){
std::string command;
std::cin >> command;
if(command=="print"){
int ... | #include<iostream>
#include<string>
using namespace std;
int main(){
string str;
string order;
string p;
char temp;
int n=0;
int a,b;
cin>>str;
cin>>n;
for(int i=0;i<n;i++){
cin >> order >> a >> b;
if(order == "print"){
cout << str.substr(a, b-a+1) << endl;
}
else if(order == "reverse") {
... | 1 | 8,944,678 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i,a,b) for(ll 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)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<double, P> event;
... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main()
{
int N, M;
cin >> N >> M;
vector<int> S(N), T(M);
for (int i = 0; i < N; i++) {
cin >> S[i];
}
for (int i = 0; i < M; i++) {
cin >> T[i];
}
vector<unordered_map<int, int>> mp(M + 1);
for (int i = M - 1; i >= 0; i--) {
mp[i... | 1 | 56,641,544 |
#include <iostream>
using namespace std;
int main(){
string str;
cin >> str;
int type = 1;
char c = str[0];
for(int i=0; i<str.length(); i++){
if(str[i] != c){
type++;
c = str[i];
}
}
cout << type-1 << endl;
return 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 unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | 1 | 54,862,650 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define int long long
int INF = 1e9+7;
signed main() {
int N;
string S;
cin >> N >> S;
int r = 0;
int g = 0;
int b = 0;
for(int i = 0; i < N; i++) {
if(S[i] == 'R') {
r++;
}
else if(S[i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono c... | 1 | 92,409,154 |
#include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
int a,b,c,d,e;
cin >> a >> b >> c >> ... | #include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | 1 | 51,146,023 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 998244353
int main(){
stri... | #pragma GCC optimize("Ofast")
#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_... | 1 | 62,505,126 |
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int>a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int sum = 0;
for(int i=0; i<n-1; i++){
sum += abs(a[i+1]-a[i]);
}
sum += abs(a[0])+abs(a[n-1]);
int sum... | #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... | 1 | 47,580,558 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
int d[n];
rep(i, n){
cin >> d[i];
}
sort(d,d+n);
if(d[n/2-1]==d[n/2]){
cout << "0" << endl;
} else {
cout << d[n/2]-d[n/2-1]... | #include <iostream>
#include <cmath>
#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>
#inclu... | 1 | 81,738,337 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+233;
int t,n,r;
int main(){
cin>>n>>r;
if(n<10)cout<<(10-n)*100+r<<endl;
else cout<<r<<endl;
return 0;
} | #include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | 1 | 32,219,164 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
int a[N], b[N];
int n, k;
int main()
{
cin >> n >> k;
for (int i = 0; i < n; ++i) cin >> a[i] >> b[i];
long long ans = 0;
int res = 0;
++k;
for (int x = 30; x >= 0; --x) {
res ^= (1 << x);
if (k & (1 << x)) {
long long cur = 0;
f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
templ... | 1 | 55,226,887 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <cstdio>
#include <complex>
#include <numeric>
#include <string.h>
#include <random>
#define rep(i,n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typede... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n... | 1 | 38,692,944 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
if(360%x==0) cout << (360/x);
else cout << ((x*360)/__gcd(x,360))/x;
return 0;
} | #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;
typedef long long ll;
typedef double ld;
typedef pair<ll,ll> pii;
typedef tree<ll, null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#defin... | 1 | 29,616,407 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200005;
string n;
int k;
ll dp[111][4][2];
ll f(int i, int j, int less) {
if(j > k) return 0;
if(i == (int)n.size()) return j == k;
ll &ans = dp[i][j][less];
if(~ans) return ans;
ans = 0;
if(less) {
return ans = f(i + 1, j, less) ... | 1 | 34,520,619 |
#include<bits/stdc++.h>
using namespace std;
int a[100010];
int b[100010];
int main(){
int n;
while(~scanf("%d",&n)){
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++){
b[a[i]-1]++;
b[a[i]+1]++;
b[a[i]]++;
}
int max=0,h=0;
for(int i=0;i<=100001;i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
map<int,int> mp;
int ans=0;
for(int i=0;i<n;i++){
cin >> a[i];
mp[a[i]]++;
mp[a[i]-1]++;
mp[a[i]+1]++;
ans=max(ans,max(mp[a[i]],max(mp[a[i]-1],mp[a[i]+1])));
}
cout... | 1 | 81,349,620 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for(int i = 1;i <= 10;++i) {
c = (a * c) - b;
cout << c << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 1 | 22,684,261 |
#include <iostream>
#include <cmath>
#include <string.h>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
#define INF 100000000;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
int main(){
ll A,B;
cin >> A >> B;
ll ans =... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<iterator>
#include<list>
#include<utility>
#include<cstdlib>
#include<queue>
#include<stack>
#include<bitset>
#define PI 2*acos(0.0)
#define pb push_back
us... | 1 | 2,489,865 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
#define pb push_back
#define mod 1000000007
#define pll pair<long long,long long>
using namespace std;
templa... | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s, c;
cin >> s >> c;
int ans = 2000;... | 1 | 95,326,218 |
#include <cmath>
#include <cstdio>
#include <vector>
#include <list>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <stack>
#include <fstream>
#include <queue>
#include <iomanip>
#include <iterator>
#include <map>
#include <unordered_map>
#include <set>
#define fast ios_base::sync_with_stdio(false... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<long long int>
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vb vector<bool>
#define vvl vector<vector<ll> >
#define vvi vector<vector<int> >
#d... | 1 | 10,814,185 |
#include<iostream>
using namespace std;
void hoge(){
int i,j;
for(i=1;i<=9;i++){
for(j=1;j<=9;j++){
cout<<i<<"x"<<j<<"="<<i*j<<endl;
}
}
}
int main(){
hoge();
return 0;
} | #include<iostream>
using namespace std;
int main(void){
int i;
int j;
for(i = 1;i < 10;i++){
for(j = 1;j < 10;j++){
cout << i << "x" << j << "=" << i*j << endl;
}
}
} | 1 | 65,883,881 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N; cin >> N;
string S; cin >> S;
map<char,ll> m;
for(auto c: S){
m[c]++;
}
ll ans = m['R'] * m['G'] * m['B'];
for(int j = 1; j < N-... | #include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
typedef uint16_t u16;
typedef int16_t i16;
typedef uint8_t u8;
typedef int8_t i8;
using namespace std;
#define rep(idx, N) for (u64 idx = 0; idx < N; idx++)
i32 toBit(char c) {
if (c == 'R') {
return 1;
... | 1 | 60,109,278 |
#include <iostream>
#define MAX 2000000
#define INFTY 2000000000
using namespace std;
int A[MAX+1], h;
void heapIncreaseKey(int i, int key){
if(key < A[i]) cerr << "new key is smaller than current key" << endl;
A[i] = key;
while(i > 1 && A[i/2] < A[i]){
int tmp = A[i/2];
A[i/2] = A[i];
... | #include <iostream>
#include <queue>
#include <string>
using namespace std;
int main()
{
string s;
int k;
priority_queue<int> que;
while(cin >> s, s != "end"){
if(s == "insert"){
cin >> k;
que.push(k);
} else {
cout << que.top() << endl;
qu... | 1 | 65,368,394 |
#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);
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 1 | 81,889,653 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
void ABC90(void);
void ABC91(void);
void ABC92(void);
void ABC93(void);
void ABC94(void);
void ABC95(void);
void ABC96(void);
void ABC97(void);
void ABC98(void);
void ABC99(void);
int main(void){
ABC92();
}
void ABC92(){
int n,d,x,i,j,ans=0;
ci... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 1 | 61,611,243 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
using namespace std;
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true); }
template<typename A, typename B> bool chmax(A &a, const B &b){ return a < b && (a = b, true); }
int main(){
int ... | #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 n,k;
cin >> n >> k;
if(n%k==0) cout << "0" << "\n";
else cout << "1" << "\n";
return 0;
} | 1 | 86,201,801 |
#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;
ll calc(ll n){
for(ll i = 2; ;i++)
if(i*(i+1)/2 > n)
return i-1;
}
void solve(){
ll n;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
class Sieve{
public:
vector<pair<ll,int>> pf(ll n){
vector<pair<ll,int>> res;
for(ll i=2; i*i<=n; i++){
int x=0;
while(n%i==0){
n/=i;
++... | 1 | 14,730,984 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int n,m,x,y;cin>>n>>m>>x>>y;
int z;
rep(i,n){
cin>>z;
x=max(x,z);
}
rep(i,m){
cin>>z;
y=min(y,z);
}
y-x>0?cout<<"No War":cout<<"War";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int>xs(n);
for (int i = 0; i < n; i++)cin >> xs.at(i);
xs.push_back(x);
vector<int>ys(m);
for (int i = 0; i < m; i++)cin >> ys.at(i);
ys.push_back(y);
sort(xs.begin(), xs.end());
so... | 1 | 64,288,000 |
#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... | #include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) x.begin(),x.end()
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string s,t;
cin >> s >> t;
int ans=0;
rep (i, 3) if (s[i]==t[i]) ans++;
cout << ... | 1 | 82,279,421 |
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
char head_char(string s) {
return s[0];
}
char tail_char(string s) {
return s[s.size() - 1];
}
int main() {
string a, b, c;
cin >> a >> b >> c;
cout << (tail_char(a) == head_char(b) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin>>a>>b>>c;
int x=a.size();
int y=b.size();
string ans="YES";
if(a[x-1]!=b[0] || b[y-1]!=c[0]) ans="NO";
cout<<ans<<endl;
} | 1 | 35,653,797 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,p;
cin>>n>>p;
int min_index;int k = INT_MAX;
for(int i=0;i<n;i++){
int temp;
cin>>temp;
if(temp<k){
k=temp;
min_index=i;
}
}
int left =min_index;
int right = n-min_index;
cout<<(n-... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define eps 1e-9
#define maxp 1000400
#define mod 1000000007
#define pi 3.141592653589793238
#define sin(s) scanf("%lld",&s);
#define sout(s) printf("%lld\n",s);
#define in(s) cin>>s
#define in2(a,b) cin>>a>>b
#define in3(a,b,c) ci... | 1 | 26,225,228 |
#include <bits/stdc++.h>
using namespace std;
template<class C>constexpr int sz(const C&c){return int(c.size());}
using ll=long long;constexpr const char nl='\n',sp=' ';
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int N;
cin >> N;
ll ans = 0, last = 0;
for (int i = 0; i < N; i++) {
ll a... | #include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0;i<ll(n); i++)
int main(){
ll N;
ll i;
vector<long long int> A;
cin >> N;
for(i=0;i<N;i++){
ll ai;
cin >> ai;
A.push... | 1 | 39,445,204 |
#include<stdio.h>
int main(void)
{
unsigned long long int kai=1;
int n,i,x=0;
scanf("%d",&n);
for(i=1;i<n+1;i++)
{
kai=kai*i;
while(kai % 10 ==0)
{
kai = kai / 10;
x+=1;
}
}
if(x==0){
printf("%llu\n",kai);
}
else
{
printf("%llu",kai);
for(i=0;i<x;i++)
{
printf("%d",0);
}
prin... | #include<cstdio>
typedef long long int ll;
ll f(ll n){return n==0?1:n*f(n-1);}
int main(){
int n;scanf("%d",&n);printf("%lld\n",f(n));
} | 1 | 91,848,454 |
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
using namespace std;
typedef long long int lld;
typedef unsigned long long int llu;
#define TESTCASES() cin >> (T3X0); T353 = T3X0; while(T3X0--)
#define _input(V3C) for(auto &V3C_I7 : (V3C)) cin >> (V3C_I7)
#define mems(A77AY, V4LU) memset((A77AY), (... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int A=S.size();
for(int i=0;i<A;i+=2){
cout << S.at(i);
}
cout << endl;
} | 1 | 13,469,188 |
#include <iostream>
int main(){
int n;
std::cin >> n;
std::cout << (n - 2) * 180 << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main(){
int N;
cin >> N;
cout << 180*(N-2) << endl;
} | 1 | 40,585,525 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(20);}} fast;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define C... | 1 | 2,215,184 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <al... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1006;
int X,Y,Z,K;
ll A[MAX_N],B[MAX_N],C[MAX_N];
void solve()
{
sort(A,A+X,greater<ll>());
sort(B,B+Y,greater<ll>());
sort(C,C+Z,greater<ll>());
vector<ll> v;
for(int i=0;i<X;++i)for(int j=0;j<Y;++j){
v.push_back(A[i]+B[j]);
... | 1 | 74,985,048 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
string s;
cin >> s;
long long n = s.size(), ans = 0;
long long pcnt = 0, mcnt = 0, p = 0;
for(long long i=0;i<n;i++){
if(i<n-1&&s[i] == '<'){
if(mcnt == 0){
pcnt++;
}else{
ans += mcnt*(mcnt+1)/2;
... | 1 | 61,247,492 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; ++i)
int main() {
int n, m, p;
string s;
cin >> n >> m;
vector<bool> ac(n + 1);
vector<int> wa(n + 1);
int a = 0, b = 0;
REP(i, m) {
cin >> p >> s;
if (s == "AC") {
if (!ac[p]) {
++a... | #include <iostream>
#include <string>
using namespace std;
int main(){
int N, M, p[100002], box[100002] = {0},
cntAC = 0, cntWA[100002] = {0};
string S[100002];
cin >> N >> M;
for(int i = 0; i < M; i ++){
cin >> p[i] >> S[i];
if(box[p[i]] == 0 && S[i] == "WA"){
cntWA[p[i... | 1 | 31,512,987 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <algorithm>
#include <map>
using namespace std;
int main(void){
int n, m; cin >> n >> m;
int i = 0;
int max = 0;
int min = 100000000;
while (i < m) {
int a, b;
cin >> a >> b;
if (a > max) ma... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int sho = -1000000, dai = 1000000, tmpsho, tmpdai;
for (int i = 0; i < M; i++){
cin >> tmpsho >> tmpdai;
sho = max(sho, tmpsho);
dai = min(dai, tmpdai);
}
int c = 0;
for (int i = 1; i <= N; i++){
if(sho <= i... | 1 | 21,080,021 |
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
... | 1 | 45,179,313 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x,y;
cin>>x>>y;
if(x<y){cout<<"0"<<endl;}
else{cout<<x-y<<endl;}
} | 1 | 68,705,374 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int n;
cin>>n;
int time[n];
for(int i=0;i<n;i++)
cin>>time[i];
int lcm=time[0];
for(int i=1;i<n;i++)
lcm=(lcm/__gcd(lcm,time[i]))*time[i];
cout<<lcm<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin>>N;
int64_t k=1;
for(int64_t i=0;i<N;i++){
int64_t j;
cin>>j;
k=k/__gcd(k,j)*j;
}
cout<<k<<endl;
} | 1 | 69,970,866 |
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
int a,b;
string s;
cin >> a >> b >> s;
for(int i = 0; i < s.size(); i++) {
if(i == a) {
if(s[i] != '-') {
cout << "No" << endl;
return 0;
}
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A, B;
string S;
cin >> A >> B >> S;
int co = 0;
rep(i, A + B + 1) {
if(i == A) {
... | 1 | 3,102,563 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin>>N;
int64_t l=pow(N,0.5);
int64_t ans=0;
for(int64_t i=1;i<=l;i++)
if(N%i==0){
if(2<=N/i-i)
ans+=(N/i-1);
}cout<<ans<<endl;
return 0;
} | 1 | 96,247,513 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;int flag=0;
cin>>s;
int a[26]={0};
for(int i=0;i<s.length();i++){
int k=(int)s[i];
a[k-97]++;
}
for(int i=0;i<26;i++){
if(a[i]==0){
cout<<(char)(i+97);
flag = 1;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> st;
for (int i = 0; i < s.size(); i++) {
st.insert(s.at(i));
}
for (int i = 0; i < 26; i++) {
if (!st.count(i + 'a')) {
char c = i + 'a';
cout << c << endl;
return 0;
}
}
cout << "None"... | 1 | 12,227,413 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#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++)
template<class T> inline bool ... | #include <bits/stdc++.h>
#define ll long long
#define ar array
#define AC ios_base::sync_with_stdio(0); cin.tie(NULL);
using namespace std;
const int M = 1e9+7;
const int N = 2*1e5;
string a, b;
int main(){
AC
cin>>a;
cin>>b;
int ans=0;
for(int i=0; i<a.size(); i++){
if(a[i]!=b[i])
... | 1 | 88,535,189 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 1 | 16,166,524 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 1 | 47,234,688 |
#include <time.h>
#include <stdlib.h>
#include <cstdint>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <cstdint>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <vector>
#include <map>
#include <s... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int m... | 1 | 56,474,103 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,ans=0;
scanf("%d%d%d%d",&a,&b,&c,&d);
if(a>=b)
ans+=b;
else
ans+=a;
if(c>=d)
ans+=d;
else
ans+=c;
printf("%d",ans);
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int ma... | 1 | 72,367,306 |
#include <iostream>
using namespace std;
int main()
{
int R;
cin >> R;
if (R < 1200)
{
printf("ABC");
}
else if (R >= 1200 && R < 2800)
{
printf("ARC");
}
else
{
printf("AGC");
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
int main(){
int r; cin>>r;
if(r<1200) cout << "ABC" << endl;
else if(r>=1200&r<2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
} | 1 | 24,172,707 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main()
{
ll n, m;
cin >> n >> m;
vector<ll> xs(n);
for (auto &v : xs) cin >> v;
vector<ll> ys(m);
for (auto &v : ys) cin >> v;
ll ansX = 0;
... | #include <iostream>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
typedef long long ll;
const int INF = 100000000, mo... | 1 | 69,203,722 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int t; cin>>t; while(t--)
#define fl(i,a,b) for(int i = a ; i <b ;... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll H,W;
cin>>H>>W;
vector<string> vec(H);
for(ll i=0;i<H;i++) {
cin>>vec[i];
}
vector<vector<ll>> a(H,vector<ll>(0));
vector<vector<ll>> b(W,vector<ll>(0));
vector<vector<ll>> A(H,vector<ll> (W... | 1 | 39,961,531 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll a) {
if (a % 2 == 0) return a / 2 * (a + 1);
return (a + 1) / 2 * a;
}
int main() {
ll a; cin >> a;
ll ans = 0;
for (int i = 1; i <= a; i ++) {
ans += f(a / i) * i;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int arr[10000001];
int main()
{
ll n;
cin>>n;
for(ll i=1;i<=n;i++){
for(ll j=i;j<=n;j+=i) arr[j]++;
}
ll sum=0;
for(ll i=1;i<=n;i++) sum+=i*arr[i];
cout<<sum<<endl;
return 0;
} | 1 | 461,118 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
int main() {
int n;
cin >> n;
vector<pair<int,int>> a(n);
vector<pair<int,int>> b(n);
rep(i,n)
cin >> a[i].second >> a[i].first;
... | #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 = (int)(n)-1; i >=0; i--)
using ll = long long;
int main(){
int n;
cin>>n;
vector<pair<int,int>> a(n),c(n);
rep(i,n)cin>>a.at(i).second>>a.at(i).first;
rep(i,n)cin>>c.at(i).first>>c.... | 1 | 46,627,372 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
const double pi = acos(-1);
typedef long long ll;
int main()
{
ll n,ans;
cin>>n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typ... | 1 | 87,088,961 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,k;
string s;
cin>>n>>s>>k;
for (int i=0;i<n;i++) {
if (s[i]!=s[k-1]) {
cout<<"*";
} else {
cout<<s[i];
}
}
cout<<endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll min(ll a,ll b){
if(a<b)return a;
else return b;
}
ll max(ll a,ll b){
if(a>b)return a;
else return b;
}
int main() {
ll n,k;
string s;
cin>>n>>s>>k;
for(ll i=0;i<s.size();i++){
if(s[i]!=s[k-1]){
s[i... | 1 | 60,519,122 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define INT(str) stoi((str), 0)
#define INTB(str) stoi((str), 0, 2)
int main() {
int N, K;
cin >> N >> K;
vi H(N);
REP(i, N) cin >> H[i];
sort(H.begi... | #include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep... | 1 | 49,262,334 |
#include <iostream>
#include <string>
int main(void)
{
std::string cards, cardsShuffled;
while (std::cin >> cards, cards != "-")
{
int shuffleNum;
std::cin >> shuffleNum;
int h = 0;
for (int i = 0; i < shuffleNum; i++)
{
int temp;
std::cin >> t... | #include<cstdio>
#include<iostream>
#include<cctype>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define MD 1000000007
char sep[3] = " \n";
int i, j, k, n, m, l;
void shuffle(string s) {
char buf[20010];
l = s.size()... | 1 | 76,686,443 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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; }
ll mod= 1e9 + 7;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int n,k;
cin>>n>>k;
if(n==k)cout<<0;
else if(n%k==0)cout<<0;
else cout<<1;
} | 1 | 49,217,363 |
#include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll MOD = round(1e9+7);
int main() {
ll N,A,B; cin >>N>>A>>B;
ll ans=B*(N-1)+A-A*(N-1)-B+... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define endl "\n"
#define mp(a,b) make_pair(a,b)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
typedef long long ll;
typedef unsigned long long ull;
bool sortbysecc(const pair<int,int> &a, const pair<int,int> &b){
retu... | 1 | 26,051,960 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll a[n], b[n];
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
ll k = 0, two = 0;
rep(i, n) {
ll d = b[i] - a[i];
k += d;
if (... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) co... | 1 | 27,087,833 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=1'000'000'007;
const int NN=100002;
ll add(ll x, ll y) { return ((x + y) % MOD + MOD) % MOD;}
ll sub(ll x, ll y) { return ((x - y) % MOD + MOD) % MOD; }
ll mul(ll x, ll y) { return x * y % MOD; }
bitset<NN> is; int mu[NN];
void mobiusSieve... | #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);
int po... | 1 | 34,939,900 |
#include <iostream>
#include <cmath>
#include <string>
#include <cstdlib>
#include <iomanip>
#include <stdio.h>
using namespace std;
int main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a<b && b<c)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | 1 | 3,345,990 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b;
char sign[4];
cin >> a >> b ;
if(a < b){
strcpy(sign, "<");
}else if(a == b) {
strcpy(sign, "==");
}else {
strcpy(sign, ">");
}
printf("a %s b\n", sign);
retur... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
printf("a %s b\n", a == b ? "==" : a > b ? ">" : "<");
return 0;
} | 1 | 63,242,166 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
int mx[] = {-1, 1, 0, 0}, my[] = {0, 0, -1, 1};
int n;
int z, w;
int a[3000];
int main()
{
cin >> n;
cin >> z >> w;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
if (n == 1)
{
cout << abs(a[0] - w);
}
else
{
c... | #include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bi... | 1 | 68,552,346 |
#include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#else
#define TEST(n) ((void)0)
#endif
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("output.txt", "w", stdout));
TEST(freopen("debug.txt", "w", s... | #include <bits/stdc++.h>
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(),YES,NO))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b) for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(a);i>=(LL)(b);i--)
#define REP(... | 1 | 95,056,682 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
void dfs(ve<ve<int>> &G, ve<int> &ans,int i, int j,int a){
ans[i] += a;
for(int x:G[i]){
if(x==j) continue;
dfs(G,ans,x,i,ans[i]);
... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 1 | 66,693,980 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
vector<int> a(3);
rep(i,3) cin >> a[i];
sort(all(a));
int ans = a[2]*2 - a[0] - a[1];
if(ans%2){
ans+=3;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int g[5];
rep(i, 3) cin>>g[i];
sort(g, g+3);
int ma=g[2], md=g[1], mi=g[0];
int cnt = 0;
cnt += (ma-md) / 2;
cnt += (ma-mi) / 2;
boo... | 1 | 5,192,809 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main(){
int N,H;
cin >> N >> H;
vector< pair<int, int> > ab;
REP(i, N) {
int a,b;
cin >> a >> b;
ab.emplace_back( a, 0 );
ab.emplace_back( b, 1 );
}
sort( ab.begin(), ab.end(),grea... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n, h;
cin >> n >> h;
vector<int> a(n), b(n);
rep(i,n) cin >> a[i] >> b[i];
sort(all(a));
sort(all(b));
int mx... | 1 | 80,334,168 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin >> N;
int64_t sum = 0;
vector<int64_t> vec(N);
for(int i=0; i<N; i++){
cin >> vec[i];
sum += vec[i];
}
int64_t ans = sum - N*(N-1);
int64_t cnt = 0;
if(ans > 0){
for(int i=0; i<N; i++){
... | #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int N;
vector<ll> a;
void input(void){
cin >> N;
a.resize(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
}
bool _judge(ll k){
vector<ll> a_copy = a;
for (auto& ai : a_copy)
... | 1 | 9,475,899 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int * CBTree = new int[n+1];
for (int i =1; i <= n; i++)
{
cin >> CBTree[i];
}
for (int i =1; i <= n; i++)
{
cout << "node " << i << ": ";
cout << "key = " << CBTree[i] << ", ";
if (i != 1)
cout << "parent key = " << CBTree[i/2] <... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
const int s = 251;
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 argc, char** argv)
{
int heap[s];
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> heap... | 1 | 93,432,881 |
#include <iostream>
using namespace std;
int main() {
for (int l = 1; l < 10; l++) {
for (int r = 1; r < 10; r++) {
cout << l << 'x' << r << '=' << l * r << endl;
}
}
return 0;
} | #include <stdio.h>
int main(){
int i, j, a;
for(i = 1; i < 10; i++){
for(j = 1; j < 10; j++){
a = i * j;
printf("%dx%d=%d\n", i, j, a);
}
}
return 0;
} | 1 | 77,022,501 |
#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>
#include <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
bool binary_search(vector<int> list, int v) {
int l = 0, r = list.size();
while (abs(r - l) >= 1) {
int m = (l + r) / 2;
if (list[m] == v) {
return true;
} else if (list[m] < v) {
l = m + 1;
} else {
r = m;
}
}
return false;
}
i... | 1 | 21,684,954 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int s , n , k;
int main()
{
_FastIO;
cin >> n >> k;
int x , y;
for(int i = 1; i <= n; i++){
cin >> x;
}
... | 1 | 18,449,527 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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; }
ll mod= 1e9 + 7;
... | #define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | 1 | 2,197,711 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int keta(long long b){
int ans = 0;
while (b > 0){
b /= 10;
ans++;
}
return ans;
}
int main(void){
long long n;
cin >> n;
int ans = 16;
for (long long i = 1; i * i <= n; i++){
if (n % i != 0) continue;
... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_RE... | 1 | 48,562,621 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
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 P=pair<long long,long long>;
#define rep(i,n) ... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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>;
int main(void) {
int n;
cin >> n;
ll k;
cin >> k;
vector<P> v(n);
rep(i, n) {
int a, ... | 1 | 93,514,175 |
#include <iostream>
using namespace std;
int main() {
while (true) {
int M;
cin >> M;
if (M == 0) {
break;
}
int m = 1000 - M;
int ans = 0;
while (m > 0) {
if (m >= 500) {
m -= 500;
} else if (m >= 100) {
m -= 100;
} else if (m >= 50) {
m -= ... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main()
{
int price;
int change;
int num;
while (1)
{
cin >> price;
if (price == 0) break;
change = 1000 - price;
num = 0;
num += change / 500;
change %= 500;
num += change / 100;
change %= 100;
num += change / 50;
... | 1 | 96,759,175 |
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod2=1000000007;
ll mod=998244353;
ll inf=1000000000000000000;
double pi=2*acos(0);
#de... | 1 | 72,069,790 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
const int lim = 1000000007;
const int INF = 1000000000;
int main(){
int N;
cin >> N;
vector<int> a(N);
int val = 0;
rep(i, N){
cin >> a[i];
val += a[i];
}
vector<i... | 1 | 17,463,524 |
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
template <typename T>
using V = vector<T>;
template <typename T, type... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef int_fast64_t ll;
constexpr int buff_size = 1 << 21;
char buff[buff_size], *ci, ct;
int A;
inline int readint() {
A = 0;
while ((ct = *ci++) >= '0') A ... | 1 | 72,830,563 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;cin>>s>>t;
if(s.size()+1==t.size() && t.substr(0,s.size())==s){
cout << "Yes"<<endl;
}else{
cout << "No"<<endl;
}
} | 1 | 52,005,106 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long ans;
if (K & 1) {
long long a = N / K;
ans = a * a * a;
} else {
long long a = N / (K / 2);
long long a1 = a / 2;
long long a2 = a - a1;
ans = a1 * a1 * a1 + a2 * a2 * a2;
}
cout << ans <<... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | 1 | 65,635,673 |
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
vector<ll> memo(100);
ll fib(ll n){
if(memo[n] == -1) {
memo[n] = fib(n - 1) + fib(n - 2);
}
return memo[n];
}
int main(){
for(int i=0;i<100;i++){
memo[i] = -1;
}
memo[0] = 2;
memo[1] = 1;
ll... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 1 | 63,413,196 |
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ll h, n;
cin >> h >> n;
ll m = 0;
for (int i = 0; i < n;i++) {
int a;
cin >> a;
m += a;
}
if (h<=m) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
int main(){
int H, N; cin >> H >> N;
vi A(N);
for(auto &x : A) cin >> ... | 1 | 26,338,357 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int r, g;
cin >> r >> g;
int b = 2*g-r;
cout << b << endl;
return 0;
} | #include<iostream>
int main(){
int R,G;
std::cin >> R >> G;
std::cout << G + G - R;
} | 1 | 64,950,738 |
#include<bits/stdc++.h>
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 RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int N;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a==b&&b==c){
cout<<"Y... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll,ll> > Q;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main()
{
int a,b,c;
cin>>a... | 1 | 94,295,409 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
int ans=0;
for(int i=1; i<=n; i+=2){
int count=0;
for(int j=1; j<=n; j++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
int ans = 0;
rep(i,N + 1) {
if (i%2 == 1) {
int count = 0;
for (int j = 1; j < i + 1; j++) {
... | 1 | 34,195,134 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, ... | #include "bits/stdc++.h"
#pragma warning(disable : 4996)
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#define min3(x, y, z) min(x, min(y, z))
#ifdef _MSC_FULL_VER
#define dout cout
#define debug() if (true)
#de... | 1 | 16,362,407 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-9;
int ii() { int x; if (scan... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=100000,mod=998244353;
int add(int a,int b,int p=mod){return a+b>=p?a+b-p:a+b;}
int sub(int a,int b,int p=mod){return a-b<0?a-b+p:a-b;}
int mul(int a,int b,int p=mod){return (LL)a*b%p;}
void sadd(int &a,int b,int p=mod){a=add(a,b,p);}
void ss... | 1 | 94,451,472 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | #include<bits/stdc++.h>
using namespace std;
#define p pair<int,int>
int N, M;
char A[10];
int num[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string dp[10010];
int main(){
cin >> N >> M;
for(int i = 0; i < M; i++){
cin >> A[i];
if(dp[num[A[i] - '0']] == ""){
dp[num[A[i] - '0']] = A[i];
... | 1 | 79,729,524 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
float a,b;
cin>>a>>b;
cout<<b*2-a;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int i, j, ans;
cin>>i>>j;
ans=(2*j)-i;
cout<<ans<<endl;
return 0;
} | 1 | 8,430,306 |
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
string s;
int m, sum=0;
cin>>s;
if(s=="-")break;
cin>>m;
for(int i=0;i<m;i++){
int x;
cin>>x;
sum+=x;
}
int n=s.size();
for(int i=0;i<n;i++){
cout<< s[ (i+sum)%n ];
}
cout<<endl;
}
... | #include "iostream"
#include "string"
using namespace std;
int main(int argc, char const *argv[])
{
string x;
int m=0;
int h=0;
while(cin >> x)
{
m=0;
h=0;
if (x == "-")
{
break;
}
cin >> m;
for(int i=0; i<m; i++)
{
cin >> h;
x += x.substr(0,h);
x.erase(0,h);
}
cout << x << endl;
}... | 1 | 64,596,931 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
using namespace std;
int main()
{
ios_base :: sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, d;
cin >> n >> d;
int arr[n][d];
int i, j, count = 0;
for(i=0; i<n; i++){
for(j=0; j<d; j++){
cin >> arr[i][j];
}
}... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | 1 | 3,035,767 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin>>s;
int n=0;
for(char c:s.substr(2,s.size()-3)) if(c=='C') n++;
if(s[0]!='A'||s[1]<'Z'+1||n!=1){cout<<"WA"; return 0;}
else for(char c:s.substr(2)) if(c<'Z'+1&&c!='C'){cout<<"WA"; return 0;}
cout<<"AC";
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
string s; cin >> s;
bool flag = true;
if(s[0]!='A') flag = false;
int cnt = 0;
for(int i = 2;i<s.size()-1;i++){
... | 1 | 94,149,980 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
ll ans = k;
n--;
while(n--){
ans*=(k-1);
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FLSH fflush(stdout)
#define fileIO(name) \
freopen(name".in", "r", stdin); \
freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x);
#de... | 1 | 21,936,024 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.