code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N;
vector<ll> a;
unordered_map<ll,ll> um;
int main(){
cin >> N;
for(int i=0;i<N;i++){
ll c;
cin >> c;
a.push_back(c);
um[c] = i%2;
}
sort(a.begin(),a.end());
ll ans = 0;
... | 0 | 52,232,148 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
long int n, a, b;
cin >> n >> a >> b;
long int ans = n / (a+b) * a;
n %= a + b;
if(n < a)
cout << ans + n << endl;
else
cout << ans + a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll s[50],p[50];
ll f(ll n,ll x) {
if (n==0)
return 1;
if (x==1)
return 0;
if (x<=1+s[n-1])
return f(n-1,x-1);
if (x==1+s[n-1]+1)
return p[n-1]+1;
if (x<=1+s[n-1]+1+s[n-1])
return p[n-1]+1+f(n-... | 0 | 22,153,401 |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
int ansi = a / b;
double ansd = 1.000000 * a / b;
double remainder = a % b;
cout << ansi << " "
<< remainder << " "
<< fixed << setprecision(10) << ansd << endl;
return 0;
} | #include <stdio.h>
int main(){
char X[3];
scanf("%s",&X);
if(X[0]=='7'){
printf("Yes\n");
}
else if(X[1]=='7'){
printf("Yes\n");
}
else if(X[2]=='7'){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | 0 | 10,554,882 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int ftravel = 0;
if (a >= b) {
ftravel = b;
} else {
ftravel = a;
}
if (c >= d) {
ftravel = ftravel + d;
} else {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> a(M);
vector<int> b(M);
vector<int> c(M);
for(int i = 0; i < M; i++) {
cin... | 0 | 33,500,972 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 48,053,493 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 1e5 * 2 + 10;
typedef long long ll;
ll st[N];
int vis[N];
int main()
{
ll n,a,p;
cin >> n >> a >> p;
memset(vis,-1,sizeof vis);
int i = 0;
ll j = a;
for(i = 0, j = a; vis[j] == -1; i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N, A, B;
cin >> N >> A >> B;
int ans = 0;
for (int i = 1; i <= N; ++i) {
int div = i;
int sum = 0;
while (div != 0) {
int mod = div % 10;
sum += mod;
div = div / 10;
}
if (A <= sum &&... | 0 | 34,994,281 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<ll> A(N);
for(ll i=0;i<N;i++) {
cin>>A[i];
}
sort(all(A));
vector<ll> note(A.back());
for(ll i=0;i<N;i++) {
ll count=1;
while(A[i]*count<=A.back()) {
note[A[i]*count-... | #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 K,N;
cin >> K >> N;
vector<int>A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int diff = K-A[N-1]+A[0];
for (int i = 1; ... | 0 | 66,752,810 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define mod2 998244353
#define pii pair<ll,ll>
#define pb push_back
#define debug(a) { cout << #a << " = " << a << endl;}
void sep() {
cout << "-------------BLOCK-----------------\n";
}
template<typename T>
void debugv(vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
ll a, b;
cin >> a >> b;
ll anum, bnum;
if(a==0){
switch(b%4){
case 0:
bnum = b;
break;
case 1:
bnum = 1;
... | 0 | 8,941,808 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
using P = pair<int,int>;
using ivec = vector<int>;
using Graph = vector<vector<int>>;
template<class T> inlin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
ll ans = 0;
vector<ll> v(51);
vector<ll> p(51);
void dfs(ll n, ll x){
if(v[n] - 1 <= x){
ans += p[n];
}else if(v[n-1] + 2 < x)... | 0 | 98,621,235 |
#include<iostream>
using namespace std;
int main(){
int K,A,B;
cin >> K >> A >> B;
if(B-A>=K-1){
cout << "OK" << endl;
}else{
for(int i=A;i<=B;i++){
if(i%K==0){
cout << "OK" << endl;
return 0;
}
}
cout << "NG" << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N,M,X;
cin >>N>>M>>X;
long long min=-1;
vector<vector<long long>> sina(20,vector<long long>(20));
for(int i=0;i<N;i++){
for(int a=0;a<M+1;a++){
cin >> sina.at(i).at(a);
}
}
for(long long ma=0;ma<(1 << N);ma++){
bitset<2... | 0 | 24,365,454 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> k;
vector<ll> a(k);
for(i = 0; i < k; i++) {
cin >> a[i];
}
ll down = 2, up = 2;
reverse(a.begin(), a.end());
for(ll x : a) {
... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 11,278,179 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()... | 0 | 61,158,811 |
#include <iostream>
#include <vector>
using namespace std;
int Count(const vector<int>& divs, int n) {
int res = 0;
for (int cnt : divs) {
if (cnt >= n-1) ++ res;
}
return res;
}
int main() {
int N;
cin >> N;
vector<int> divs(N+1);
for (int i = 2; i <= N; ++i) {
int n = i;
for (int j = 2; j ... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 2, 0);
for (int ... | 0 | 6,412,888 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
if(n == 1) {
cout << 1 << endl;
}
else {
int doubles = 2;
while(doubles <= n) {
doubles *=2;
}
doubles /= 2;
cout << doubles << endl;
}
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | 0 | 70,221,965 |
#include <bits/stdc++.h>
using namespace std;
int a,b;
int main() {
while (1) {
cin>>a>>b;
if (!a && !b) return 0;
if (a>b) swap(a,b);
cout<<a<<' '<<b<<'\n';
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
int main()
{
int n;
std::cin >> n;
std::vector<int> min_count(26, 999);
for (int i = 0; i < n; ++i)
{
std::string s;
std::cin >> s;
std::vector<int> count(26);
for (const char c : s)
... | 0 | 57,888,901 |
#include<iostream>
using namespace std;
int N;
int main()
{
while(cin >> N)
{
int Sum = 0;
for(int a=0; a<=9; a++)
{
for(int b=0; b<=9; b++)
{
for(int c=0; c<=9; c++)
{
for(int d=0; d<=9; d++)
{
if(a+b+c+d ==... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <string>
#include <math.h>
using namespace std;
int main(void){
string in;
string left="qwertasdfgzxcvb";
string right="yuiophjklnm";
while(true){
cin>>in;
if(in=="#")break;
... | 0 | 94,375,185 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T>
class LCA_weight {
private:
int n;
int D = 30;
vector<int> depth;
vector<vector<pair<int,T>>> hen;
vector<vector<int>> par;
vector<T> dista; ... | #include<bits/stdc++.h>
using namespace std;
#define INF 5000000000
#define INF2 2000000000
using ll=long long;
int main()
{
ll V,E;cin >> V >>E;
vector<vector<ll>> dis(V,vector<ll> (V,INF));
ll u,v,d;
for (ll i=0;i<E;i++)
{
cin >> u >> v >> d;
dis[u][v]=d;
}
bool can=true;
... | 0 | 56,970,146 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >... | #define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dpr(x) cerr<<#x<<": "<<x<<endl;
#define dprc(c) do{cerr<<#c<<":";for(auto&_i:(c)){cerr<<" "<<_i;}cerr<<endl;}while(0)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int INF = 1e9+7;
#define al... | 0 | 59,532,974 |
#include <bits/stdc++.h>
using namespace std;
bool isValid(int value){
bool ret = true;
vector <int> digit;
while(value>0){
digit.push_back(value%10);
value/=10;
}
if(digit.size()<=1){
ret = true;
}else{
for(int i = 0; i < digit.size()/2; i++){
if(digi... | #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... | 0 | 53,051,571 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> wa(n), al(n);
int ac = 0, pe = 0;
while (m--) {
int p;
string s;
cin >> p >> s;
p--... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | 0 | 56,418,687 |
#include <iostream>
using namespace std;
bool doUseLeft(char ch) {
return (('a' <= ch && ch <= 'g') || ('q' <= ch && ch <= 't') || ('v' <= ch && ch <= 'x') || ch == 'z');
}
int main() {
while (true) {
char word[33];
cin >> word;
if (word[0] == '#') {
break;
}
... | #include<bits/stdc++.h>
#define swap(type,a,b) {type t; t=a; a=b; b=t;}
#define forN(i,n) for(int i=0;i<n;i++)
#define forS(i,start,n) for(int i=start;i<n;i++)
#define ll long long
#define pb(t,d,n) {t p;int i;forN(i,n){cin>>p;d.push_back(p);}}
#define DOUBLE fixed << setprecision(15)
using namespace std;
typedef vecto... | 0 | 939,319 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for (int i = (int)(n - 1... | 0 | 94,292,790 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "a" || S == "e" || S == "i" || S == "u" || S == "o")
cout << "vowel" << endl;
else
cout << "consonant" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
int main()
{
string L; cin >> L;
int len = L.size();
vector<int> x3(len);
x3[0] = 1;
for (int i = 1; i < x3.size(); i++) {
x3[i] = (ll)x3[i-1] * 3 % MOD;
}
ll ans_eq = 1, ans_lt = 0;
for (i... | 0 | 56,555,645 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#define N 200005
using namespace std;
int n,top;
int s[N],st1[N],st2[N];
bool check(int a){
top=0;
for(int i=1;i<=n;i++){
if(s[i]<=s[i-1]){
if(a==1) return 0;
while(top>0&&st1[top]>s[i]... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define vii vector<int>
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pdd pair<double,double>
#define pldld pair<long long double, long long double>
#define ff first
#define ss second
#define pb pu... | 0 | 35,429,516 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int x1, x2, x4, x5, tmp, count = 0;
for (int i=A; i<=B; i++) {
tmp = i;
x5 = tmp % 10; tmp /= 10;
x4 = tmp % 10; tmp /= 100;
x2 = tmp % 10; tmp /= 10;
x1 = tmp % 10;
if ((x1 == x5) && (x2 == x4)) {
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll A,B; cin >> A >> B;
if(A%2==... | 0 | 28,980,111 |
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
int d=100000;
for(int i=0; i<n; i++) {
d+=d/20;
d+=999;
d-=d%1000;
}
cout<<d<<'\n';
return 0;
} | #include <iostream>
using namespace std;
int main()
{ int a,b,c;
cin>>a>>b>>c;
if(c==a && c==b)
{cout<<"Yes";}
else if(c>a && c<b)
{cout<<"Yes";}
else
{cout<<"No";}
} | 0 | 80,668,629 |
#pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
const ll mod=1e9+7;
int main(void){
ll n,k;
cin>>n>>k;
vector<ll>v(n);
rep(0,i,n){
cin>>v[i];
}
ll ans=0;
rep(0,i,n){
ll r=0,a=0;
rep(i+1,j,n)if(v[i]>v[j])++r;
... | 0 | 46,201,606 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | #include<stdio.h>
bool field[16][16];
int solve(int row,int col){
int ret=0;
if(row+col==0)return 1;
if(row>0&&field[row-1][col])ret+=solve(row-1,col);
if(col>0&&field[row][col-1])ret+=solve(row,col-1);
return ret;
}
int main(){
while(1){
int a,b;
scanf("%d%d",&a,&b);
if(a+b==0)return a+b;
for(int i=0;i<a... | 0 | 16,379,807 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (a == 1)
a += 13;
if (b == 1)
b += 13;
if (a > b)
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
int n10k, nk, nc, nd, n1, counter = 0;
cin >> a >> b;
for (int n = a; n< b + 1; n++)
{
n10k = n / 10000;
nk = (n - n10k * 10000) / 1000;
nc = (n - n10k * 10000 - nk * 1000) / 100;
nd = (n - n10k * 10... | 0 | 82,731,816 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
ll x,a,b;
cin>>x>>a>>b;
if (b-a<=0)
cout<<"delicious\n";
else ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
#define _CRT_SECURE_NO_DEPRECATE
const int N = 105;
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
const... | 0 | 23,661,959 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
#define vecout(V) for(int i=0;i<V.size();i++) {cout<<V[i]<<endl;}
typedef long long ll;
int main(void){
ll n, k;
cin>>n>>k;
vector<ll> v;
vector<ll> a;
ll k2=k/2;
for(ll i=1;i<=n;i++){
if(i%k==0) v.pus... | 0 | 86,520,998 |
#include <bits/stdc++.h>
using namespace std;
#define INF (100100100)
int dx[8] = {0, 1, 0, -1, -1, 1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int main()
{
int n;
while (scanf("%d", &n), n){
vector<string> step(n);
for (int i = 0; i < n; i++){
cin >> step[i];
}
int ans = 0;
for (int i = 1; i < n... | #include<bits/stdc++.h>
using namespace std;
#define ms(a,v) memset(a,v,sizeof a)
#define lll long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Read freopen("READ.txt", "r", stdin)
#define Write ... | 0 | 24,479,963 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
string s1,s2,s3;
cin>>s1>>s2>>s3;
cout<<char(toupper(s1[0]))<<char(toupper(s2[0]))<<char(toupper(s3[0]))<<endl;
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
while ( cin >> n, n ) {
int pre = 0;
int asi = 0;
int cnt = 0;
for ( int i = 0; i < n; i++ ) {
string f;
cin >> f;
if ( f == "lu" ) asi |= 1;
if ( f == "ru" ) asi |= 2;
if ( f == "ld" ) asi ^= 1;
... | 0 | 96,510,790 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<int> d(k);
int b;
for(int i = 0; i < k; i++){
cin >> d[i];
do{
cin ... | #include <cstdio>
#define SIZE 33554432
char Key[128];
int Hash;
char* c;
#define HASH(A) c = A; Hash = 1; while(*c){ Hash <<= 2; Hash += Key[*c]; ++c;}
int main()
{
Key['A'] = 0;
Key['C'] = 1;
Key['G'] = 2;
Key['T'] = 3;
bool* dic = new bool[SIZE];
int n;
std::scanf("%d\n", &n);
char st... | 0 | 22,121,126 |
#include <stdio.h>
#include <math.h>
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
int main() {
int n;
int s=0;
vector<int>vec;
cin>>n;
for(int i=1;i<=n;i++){
s+=i;
vec.push_back(i);
if(s==n){
break;
}
if(s>n){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v)... | 0 | 1,019,275 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#include <cstdint>
#include <complex>
#define rep(i,n) for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
class mint {
int value;
public:
static const int MOD = 1000 * 1000 * 1000 + 7;
mint(long long x)
: value(x % MOD) {}
mint operator+(mint y) const {
return mint(value + y.value);
}
mint operator+=(mint a) {
return *this = *this + a;
}
mint opera... | 0 | 79,074,500 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin>>a>>b;
if(a==b)
cout<<"Draw"<<endl;
else if(b==1)
cout<<"Bob"<<endl;
else if(a==1)
cout<<"Alice"<<endl;
e... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long lon... | 0 | 22,548,503 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<numeric>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true);... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
int N;
ll K;
cin >> N >> K;
vector<pii> v(N);
for(int i = 0; i < N; i++){
ll tmp1,tmp2;
cin >> tmp1 >> tmp2;
v.at(i) = make_pair(tmp1,... | 0 | 87,889,527 |
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
using namespace std;
int main(){
cout << "56\n788\n620404\n" ;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <array>
#include <l... | 0 | 92,814,647 |
#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() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll x, y;... | #include <bits/stdc++.h>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <string>
using namespace std;
typedef double dbl;
typedef long long int lld;
#define PI 3.14159265358979323
#define foi(i,n) for(i = 0; i < n; i+=1)
#define fod(i,n) for(i=n-1; i >=0; i-=1)
#define MAX s... | 0 | 57,704,987 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int n;
int v[100][100]={};
int u,k,a;
cin >> n;
rep(i,n){
cin >> u >> k;
u--;
rep(j,k){
cin >> a;
a--;
v[u][a]=1;
}
}
rep(i,n){
rep(j,n){
if(j>0) cout << " " << v[i]... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#define MAX_N 50
using namespace std;
int C[MAX_N][26];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
for (int j = 0; j < s.size(); ++j) {
++C[i][s[j] - 'a'];
}
}
string res = ... | 0 | 19,136,608 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int t = 1;
while(t--){
int n;
cin >> n;
int temp;
vector<int> arr;
for(int i = 0; i < 2*n; i++){
cin >> temp;
arr.push_back(temp);
}
sort(arr.begin(), ar... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<string> vec{"dream", "dreamer", "erase", "eraser"};
string T;
reverse(S.begin(), S.end());
for (string& element : vec) {
reverse(element.begin(), element.end());
}
while(true) {
bool fla... | 0 | 35,167,404 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
string S;
cin>>S;
int k=0,j=0;
for(int i=0;i<S.size();i++){
if(S[i]=='W'){
k+=i-j;
j++;
}
}
cout<<k<<endl;
} | #include "bits/stdc++.h"
using namespace std;
void Main() {
int A, B;
cin >> A >> B;
if (A == 1 && B == 1) {
cout << "Draw" << endl;
}
else if (A == 1) {
cout << "Alice" << endl;
}
else if (B == 1) {
cout << "Bob" << endl;
}
else {
cout << (A > B ? "Al... | 0 | 7,295,758 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | 0 | 2,889,872 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for(ll i = 0 ; i < n; i++)
#ifdef DEBUG
#define DBG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
#else
#define DBG(fmt, ...)
#endif
int main(){
std::cout<<st... | #include<iostream>
#include<string>
using namespace std;
int alignment(string s,string t){
int a[1001][1001]={};
int n=s.size();
int m=t.size();
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(s[i]==t[j]){
a[i+1][j+1]=max(a[i][j]+1,max(a[i+1][j],a[i][j+1]));
}else{
a[i+1][j+1]=max(a[i][j],max(a... | 0 | 1,022,084 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
using pii = pair<int,int>;
int H, W;
cin >> H >> W;
char A[H][W];
queue<pii> que;
int d[H][W];
rep(i, H) {
rep(j, W) {
cin >> A[i][j];
if(A[i][j]=='#') que.push(pii(i,j));
... | 0 | 34,115,009 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve(void)
{
int w, h, n;
cin >> w >> h >> n;
vector<int> x(n), y(n), a(n);
rep(i, n) ci... | #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 rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 0 | 83,531,076 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string key[10]={"0",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int n;
cin>>n;
for (int nn=0;nn<n;nn++){
string in;
vector<int> input;
string ans;
cin>>in;
for (int i=0;i<in.length();i++)... | 0 | 25,371,310 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n)-1;i>=(j);i--)
using ll=long long;
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; re... | #include <stdio.h>
int main(void){
int i, j, before, count;
char c, r[12] = {"yuiophjklnm"}, l[16] = {"qwertasdfgzxcvb"};
while(1){
c = getchar();
if(c != '#'){
for(i = 0;i < 11;i++)
if(c == r[i]) break;
for(j = 0;j < 15;j++)
if(c == l[j]) break;
if(i == 11)
before = 0;
else if(j == 15)
... | 0 | 3,741,086 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long int x,i,n;
cin>>n;
for(i=1;x<=n;i++)
{
x=pow(2,i);
}
cout<<x/2<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 29,348,408 |
#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 N;
cin >> N;
cout << N / 3 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll K; cin>>K;
vector<ll> A(K,0),DP1(K,-1),DP2(K,-1);
for(ll i=0; i<K; i++) cin>>A[i];
if(A[K-1]>2){
cout<<-1<<endl;
return 0;
}
DP1[K-1]=2;
DP2[K-1]=3;
for(ll i=K-2; i>=0; i--){
ll n=DP1[i+1]/A[i];
if(DP1[i+1... | 0 | 28,996,348 |
#pragma GCC optimize ("-O2")
#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define mii ... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mi map<int,int>
#define all(a) (a).begin(),(a).end()
#define F ... | 0 | 13,074,397 |
#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <random>
#include <fun... | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(),... | 0 | 3,715,918 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
int plu(ll n){
if(n<0)return (-1)*n;
else return n;
}
int main(){
long long a,b,c;
unsigned long long k;
cin>>a>>b>>c>>k;
if(a==b){
cout<<0<<endl;
return 0;
}
rep(i,k){
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;
int main(){
int N,P;
cin>>N>>P;
string s;
cin>>s;
ll ans(0);
if(P == 2 || P == 5) {
for(int i(0);i<N;i++){
if((s[i]-'0') % P == 0){
ans += i+1;
}
... | 0 | 42,330,704 |
#include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), cout << fixed << setprecision(20);
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) rep... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define endl "\n"
#define oo 0x3f3f3f3f3f3f3f3fLL
#define pb push_back
#define loop(i,n) for(int i = 0;i < int(n);i++)
#define range(i,a,b) for(int i = int(a);i <= int(b);i++)
#define sz(s) (int)(s.size... | 0 | 80,677,408 |
#include <bits/stdc++.h>
using namespace std;
char a,b;
int main(){
cin>>a>>b;
if(a<b)cout<<"<";
if(a>b)cout<<">";
if(a==b)cout<<"=";
cout<<endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
... | 0 | 87,890,399 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
#define int long long
#pragma GCC optimize("Ofast")
const int maxn = 1e5+10;
const int mod = 1e9+7;
const ll inf = 1e18+10;
int n, k;
int a[maxn];
int ok(int n)
{
for(int i = 1; i <= k; i++)
n = n - n % a[i];... | #include <bits/stdc++.h>
using namespace std;
#define __FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define D cout << "ok" << endl;
#define _(x) cout << #x << "->" << x;
#define _n cout<<endl;
#defi... | 0 | 18,479,472 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
const int INF = 1e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, r;
cin >> n >> m >> r;
vector<int> a(r);
for (int i = 0; i < r; i++) {
cin >> a[i];
a[i]--;
}
vector<ve... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | 0 | 4,206,500 |
#include<iostream>
using namespace std;
#include<string>
class list
{
int L[1000001];
int head, tail, MAX;
public:
list();
void initialize();
void ins(int);
void del(int);
void del_first();
void del_last();
void show();
};
list::list() : MAX(1000001){}
void list::initialize(){ head =... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define N 100005
#define ll long long
#define ull unsigned long long
#define loop1(i, j, k, step) for (int i=j; i<k; i+=step)
#define loop(i, j, k) for (int i=j; i<k; i++)
#define rloop1(i, j, k, step) for (int i=j; i>=k; i-=step)
#define rloop(i, j,... | 0 | 7,638,393 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int INF = 2000000001;
int n;
scanf("%d", &n);
int H[n + 1];
for (int i = 1; i <= n; ++i)
H[i] = INF;
for (int i = 1; i <= n; ++i) {
int key;
scanf("%d", &key);
H[i] = key;
}
for (int i = 1; i <= n; ++i) {
cout << "node " << i << "... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for... | 0 | 100,829,998 |
#include<bits/stdc++.h>
using namespace std;
namespace fdata
{
inline char nextchar()
{
static const int BS = 1 << 21;
static char buf[BS], *st, *ed;
if (st == ed)
ed = buf + fread(st = buf, 1, BS, stdin);
return st == ed ? -1 : *st++;
}
#ifdef lky233
#define nextchar getchar
#endif
template <ty... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 0 | 87,641,905 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a... | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<in... | 0 | 76,448,709 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#... | 0 | 4,888,277 |
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define db(x) cout << (x) << '\n';
#define all(x) x.begin(),x.end()
#define UNIQUE(x) sort(all(x)),x.resi... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | 0 | 25,565,690 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<pair<int, int>> graph[100001];
int ans[100001];
signed main() {
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
--a, --b;
graph[a].push_back({b, c});
graph[b].push_back({a, c});
}
int Q, K;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9) + 1;
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rrep1(i,n) for(ll (i) = (n);... | 0 | 51,454,832 |
#include<iostream>
using namespace std;
int main() {
int N, R;
cin >> N >> R;
int R_2;
if (N >= 10) {
cout << R;
}
else {
R_2 = R + 100 * (10 - N);
cout << R_2;
}
} | #include <stdio.h>
int main(){
int a[4],b[4],i,A,B;
A=0;
B=0;
for (i=0;i<4;i++) {
scanf("%d",&a[i]);
A+=a[i];
}
for (i=0;i<4;i++) {
scanf("%d",&b[i]);
B+=b[i];
}
if (A>=B) {printf("%d\n",A);}
else {printf("%d\n",B);}
return 0;
} | 0 | 77,396,090 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,t;
cin>>x>>t;
if(x>=t){
cout<<x-t<<endl;}
else{cout<<"0"<<endl;}
} | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | 0 | 36,343,187 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2100000;
const int MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void init(){
fac[0]=fac[1]=1;
finv[0]=finv[1]=1;
inv[1]=1;
for(int i=2... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, t, u;
cin >> s;
t = s.substr(0, 4);
u = s.substr(4, 8);
cout << t << " " << u << endl;
return 0;
} | 0 | 29,358,694 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
double l;
cin >> l;
double ans = (l/3) * (l/3) * (l/3);
cout << fixed << setprecision(7) << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;cin >> s;
string dream = "dream";
string dreamer = "dreamer";
string erase = "erase";
string eraser = "eraser";
reverse(s.begin(), s.end());
reverse(dream.begin(), dream.end());
reverse(dreamer.begin(), dreamer.end());
re... | 0 | 32,057,500 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(X) debug_func(X, #X)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout<<"=================\n"
#else
#define DEBUG(X) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_LINE 0
#endif
#define ALL(V) (V).begin(), (... | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <map>
using namespace std;
uint64_t K, N;
struct sushi
{
uint64_t kind;
uint64_t value;
bool use_flag;
sushi(uint64_t k, uint64_t v)
{
kind = k;
value = v;
use_flag = false;
}
bool operator<(const sushi &another) const
{
... | 0 | 4,698,748 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int W,H,N; cin >> W >> H >> N;
vector<vector<bool>> black(100,vector<bool>(100,false));
int ans =0;
for (int i =0; i<N; i++) {
int x,y,a; cin >> x >> y >> a;
for (int j =0; j<H; j++) {
for (int k =0; k<W; k++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | 0 | 9,648,015 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<int> va(n);
map<int, int> cnt1, cnt2;
for (int i = 0; i < n; ++i) {
cin >> va[i];
if (i % 2 == 0) {
cnt1[va[i]]++;
} else {
cnt2[va[i]]++;
}
}
int ma... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
LL n,m, minx=1e9, maxx=0, miny=1e9, maxy=0;
int a,b;
bool valid=false;
bool connect1[300001];
bool connectn[300001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
for(int i=1;i<=m;i++){
ci... | 0 | 15,926,729 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <bitset>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main()
{
int n, m; cin >> n >> m;
vector<int> bi(m), pi(m);
int k, s, ans = 0;
rep(i, m){
cin >> k;
bi[i] ... | #include<iostream>
using namespace std;
#include<string>
class list
{
int L[1000001];
int head, tail, MAX;
public:
list();
void initialize();
void ins(int);
void del(int);
void del_first();
void del_last();
void show();
};
list::list() : MAX(1000001){}
void list::initialize(){ head =... | 0 | 100,497,489 |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
struct edge{int to;ll cost;};
typedef pair<ll,int> P;
const ll INF=1000000000000LL;
const ll MOD=1000000007LL;
const ll MAX=100010;
int main(){
priority_queue<ll> q;
string s;
while(cin>>s){
if(s=="end"){
return 0;
}
int... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | 0 | 58,318,691 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x)... | #include <bits/stdc++.h>
using namespace std;
struct union_find{
vector<int> r;
union_find(int n){
r=vector<int>(n,-1);
}
int root(int x){
if(r[x]<0){
return x;
}else{
return root(r[x]);
}
}
bool unite(int a,int b){
a=root(a);
b=root(b);
if(a==b){
return false;
... | 0 | 35,790,256 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
ll mod(ll a)
{
if(a<inf)return a;
else
return a%inf;
}
void test_cases()
{
ll n1;
cin>>n1;
if(n1<1200)cout<<"ABC";
else cout<<"ARC";
}
int ... | #include <bits/stdc++.h>
#include <utility>
#include <vector>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for ... | 0 | 10,571,415 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
templat... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
string s;
cin >> s;
if(s=="zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
}else if(s.size()==26){
int i=24,j;
while(s.at(i)>s.at(i+1)){
i--;
}
char m='z';
for(j=i+1;j<26;j++){
if(s.at(j)>s.at(i))... | 0 | 81,815,981 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unordered_set<int> b;
for(int i=0; i<n; i++) {
int a;
cin >> a;
b.insert(a);
}
if(n==b.size()) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include <assert.h>
#include <ctype.h>
#include <float.h>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <algorithm>
#include <complex>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
... | 0 | 62,419,557 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n);
for(int i = 0; i < n; i++) cin >> a[i] >> b[i];
long long int ans = 0;
for(int i = n-1; i >= 0; i--){
if((a[i]+ans)%b[i] != 0){
ans += b[i] - (a[i]+ans)%b[i];
... | #include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int m,h,l;
char s[200];
string ans,tmp1,tmp2;
for(;;){
scanf("%s",&s);
tmp1=s;
if(tmp1=="-"){
break;
}
scanf("%d",&m);
... | 0 | 77,498,566 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int max = 0;
int ans = 1;
for (int i = 1; i <= N; i++)
{
int a = i;
int count = 0;
while (a % 2 == 0)
{
a /= 2;
count++;
}
if(max < count) {
... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define D double
#define fs first
#define sc second
#define int long long
#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(i,0,(n))
#defi... | 0 | 1,732,910 |
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
constexpr ll MOD = 1e9+7;
ll x[100001], y[100001];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> x[i];
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mii make_pair<int, int>
#define mll make_pair<ll, ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
... | 0 | 38,731,742 |
#include <iostream>
using namespace std;
const long long INF = 9223372036854775807;
struct datum {
long long min, max;
datum &update(long long x) {
if (x < min) min = x;
if (x > max) max = x;
return *this;
}
long long diff() const { return max - min; }
};
datum operator^(const datum &a, const datum ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ull << (b))
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = ... | 0 | 58,556,372 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define F... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int in() {int x; cin>>x; return x;}
ll lin() {ll x; cin>>x; return x;}
string sin() {string x;cin>>x;return x;}
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
int ma... | 0 | 41,393,466 |
#include <bits/stdc++.h>
using namespace std;
void print_Qbey(){cout<<
" H M#5J~d " <<endl<<
" Hm.?WMM MMB^ .Z d " <<endl<<
" MZS.` ?7WMM M#=`` (!`` d ... | #include <iostream>
using namespace std;
int main(){
int n,num,max,min;
long long int sum;
cin >> n;
cin >> num;
max = min = sum = num;
for (int i = 0; i < n-1; i++){
cin >> num;
sum = sum+num;
if (num >= max){
max = num;
}
if (num <= min){
min = num;
}
}
cout << min << " " << max << " " << su... | 0 | 8,280,872 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1L... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
string s;
int k;
cin >> s >> k;
int n = s.size();
vector<ll> cnts;
ll cur = 1;
for (int i = 1; i < n; ++i) {
if (s[i] != s[i - 1]) {
cnts.push_back(cur);
cur = 1;
} else {
c... | 0 | 87,478,449 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define rep(i, n) for (int i = 0; i < n; i++)
#defin... | #include <iostream>
using namespace std;
int main(){
int m, n, q;
for(m=1; m<10; m++){
for(n=1; n<10; n++){
q = m*n;
cout << m << "x" << n << "=" << q << endl;
}
}
} | 0 | 66,547,839 |
#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 <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
const int INF = 1e6;
using namespace std;
using ll = long long;
using ld = lon... | 0 | 7,059,019 |
#include<iostream>
#include<set>
using namespace std;
int main(){
string s; cin >> s;
set<char>a;
for(int i = 0; i < 4; i++){
a.insert(s.at(i));
}
if(a.size() == 2)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | 0 | 70,637,434 |
#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... | #include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> v... | 0 | 80,408,945 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define int long long
#define fre(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
using namespace std;
const int BufferSize=1<<16;
char buffer[BufferSize],*head,*tail;
inline char Getchar() {
if(head==tail) {
... | #include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename ... | 0 | 75,390,807 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 10000... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | 0 | 70,407,234 |
#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++)
int main() {
ll h,w,k; cin >> h >> w >> k;
vector<string> grid(h);
rep(i, h)
cin >> grid[i];
ll cnt = 0;
rep(i, 1<<h){ rep(j, 1<<w){
ll sum = 0;
rep(m, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
vector<vector<int>> a(3,vector<int>(3));
vector<vector<int>> cnt(3,vector<int>(3));
rep(i,3)rep(j,3)cin >> cnt[i][j];
int n;
cin >> n;
vector<int> b(n);
rep(i,n){
cin >> b[i];
rep(j,3){
rep(k,3){
... | 0 | 95,467,861 |
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <set>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
int main() {
string s;
cin >> s... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[]) {
long long N, K, S;
cin >> N >> K >> S;
vector<long long> t(N);
for (int i = 0; i < N; ++i) {
if (K > 0) {
t[i] = S;
--K;
} else
if (S == 1000000000)
t[i] = S - 1;
... | 0 | 9,589,267 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
ll gcd(ll x,ll y){
if(y==0) return 0;
ret... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#d... | 0 | 8,881,535 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
string s;
cin>>s;
int n=s.length();
if(n<26){
for(char c='a';c<='z';c++){
if(find(s.begin(),s.end(),c)==s.end()){
cout<<s+c<<endl;
return 0;
}
}
}else{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
vector<int>A(N);
vector<int>cnt(200000);
for(int i = 0; i < N; i++) {
cin >> A[i];
cnt[A[i]-1]++;
}
sort(cnt.begin(),cnt.end());
reverse(cnt.begin(),cnt.end());
int cnt2 = 0;
for(in... | 0 | 94,304,453 |
#define _GLIBCXX_DEBUG
#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<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll LINF = 1LL << 50;
int main(){
int N, M;
cin >> N >> M;
vector<vector<ll> > v(N, vector<ll>(3));
for (int i = 0; i < N; i++) for (int j = 0; j < 3; j++) cin >> v[i][j];
ll ans = -LINF;
for (in... | 0 | 30,929,176 |
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define prints(x, y) cout<<(x)<<" "<<(y)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#def... | #include "bits/stdc++.h"
using namespace std;
vector<int> g[101010];
int dfs(int v, int prev) {
int res = 0;
for (int u : g[v]) if (u != prev) res ^= dfs(u, v) + 1;
return res;
}
int main() {
int n, a, b;
cin >> n;
for (int i = 0; i < n - 1; i ++) {
cin >>... | 0 | 48,871,880 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
typedef long long ll;
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
using namespace std;
using vi = vector<int>;
using vll = vector<ll>;
ll... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int64_t> A(X), B(Y), C(Z), D(X*Y), E(3000*Z);
for(int i=0; i<X; i++) {
cin >> A[i];
}
for(int i=0; i<Y; i++) {
cin >> B[i];
}
f... | 0 | 17,989,689 |
#include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | 0 | 85,190,441 |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | #include <iostream>
#include <vector>
#include <set>
#include <deque>
#include <map>
#include <iomanip>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <utility>
using namespace std;
int ky[8] = {-1,1,-2,2,-2,2,-1,1};
int kx[8] = {-2,-2,-1,-1,1,1,2,2};
int dy[4] = {-... | 0 | 56,745,109 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.