code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,k,a;
cin>>n>>m>>k;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
a=i*m;
a+=j*n;
a-=j*i*2;
if(k==a){
cout<<"Yes"<<endl;
return(0);
}
}
... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, a[2 * 100000];
long long sum1 = 0, sum2 = 0, ans = 1e+17;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> a[i];
sum2 += a[i];
}
sum1 += a[0], sum2 -= a[0];
for(int i = 1; i < n; i++) {
ans... | 0 | 89,563,024 |
#include <bits/stdc++.h>
#include<stdlib.h>
#include<iostream>
#include<math.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define ll long long
#define INF 2000000000
#define Min(a,b) (a<b?a:b)
#define Max(a,b) (a>b?a:b)
#define PI 3.1415926535897932
using namespace std;
int main()
{
IOS;
int N... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#define ALL(v) (v).begi... | 0 | 68,032,415 |
#include <cstdio>
#include <iostream>
#include <queue>
#include <map>
#include <string>
using namespace std;
typedef struct P{
int x;
int y;
}P;
int h,w,n;
const int INF = 100000000;
char feld[1010][1010];
P ch[15];
int d[1010][1010];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int sx,sy;
int gx,gy;
int ans=0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a,... | 0 | 31,107,071 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) {
if (x == 0) return y;
return gcd(y%x, x);
}
ll lcm(ll x, ll y) { return x *... | #include <iostream>
using namespace std;
int main()
{
int x;
unsigned long long int ret=1;
cin >> x;
for(int i=1;i<=x;i++)
ret*=i;
if(!x)ret=0;
cout << ret << endl;
} | 0 | 66,290,134 |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#define toggle(X) ((X) ? 0 : 1)
using namespace std;
using ll = long long;
string s;
ll x, y;
bool dp[2][8005][2 * 8005];
vector<ll> cmp;
int main() {
cin >> s;
cin >> x >> y;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ... | #include <iostream>
using namespace std;
int main(){
const int inf = 1000000;
int N, M;
cin >> N >> M;
int a[1000], b[1000], c[1000], dist[100][100];
for(int i = 0; i < M; i++){
cin >> a[i] >> b[i] >> c[i];
a[i]--, b[i]--;
}
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(i==j... | 0 | 83,534,057 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n, a, b;
cin >> n >> a >> b;
ll sum = a+b;
if(n%sum == 0){
cout << n/sum * a;
return 0;
}
else{
ll ans=0;
ans = n/sum * a;
n = n%sum;
ans += min(a, n);
cout <... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 45,050,295 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 1000000007
#define din(t) long long t;cin>>t;
#define in(t) cin>>t;
ll mul(ll a, ll b)
{
return(((a%mod)*(b%mod))%mod);
}
ll modexp(ll b, ll e){
ll res = 1;
for(; e; b = b * b % mod, e >>= 1) if(e & 1) re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pie 3.1415926536
#define pb push_back
#define N 1000000007
#define M 998244353
#define ff first
#define ss second
#define INF 1ll<<63 - 1
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nrep(i,a,b) for(int i=a;i>=b;i--)... | 0 | 43,964,208 |
#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... | #include<bits/stdc++.h>
#define sc(x) scanf("%d",&x)
#define sc2(x,y) scanf("%d%d",&x,&y)
#define scs(x) scanf("%s",x)
#define pr(x) printf("%d",x)
#define prn(x) printf("%d\n",x)
#define memc(x,y) memcpy(&x,&y,sizeof(x))
#define mems(x,y) memset(x,y,sizeof(x))
#define fli() freopen("in.txt","r",stdin)
#define flo() fr... | 0 | 17,138,828 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
const int INF=1001001001;
int main() {
string S;
int64_t K;
cin>>S>>K;
int N=S.size();
auto ans= [&](string T){
int64_t cnt=1,ans=0;
int n=T.size();
for(int i=0;i<n;i++){
if(T[i]==T[i+1]){cnt++;}
if(i==n... | 0 | 52,890,234 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int N, M, A, B;
scanf("%d %d %d %d", &N, &M, &A, &B);
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= M; j++)
if((i <= B && j <= A) || (i > B && j > A)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
priority_queue<int> hp;
for(int i=0;i<n;i++){
int h;
cin>>h;
hp.push(h);
}
for(int i=0;i<k&&!hp.empty();i++){
hp.pop();
}
long long ans=0;
while(!hp.empty()){
ans+=hp.... | 0 | 92,554,707 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 7;
int n, a[maxn], ans[maxn], curval;
vector<pair<int, int>> vt;
set<int> st;
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen("test.inp", "r")) freopen("test.inp", "r", stdin);
cin >> n;
f... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) pu... | 0 | 85,639,872 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl
#define YORN(f) cout<<((f)?"YES":"NO")<<endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define println(x) cout << x << endl
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if (a == b)... | #include <assert.h>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include... | 0 | 100,204,757 |
#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()
typedef long long ll;
const int INF = 100000000;
const int MOD = 1000000007;
int main(){
int n;
std::cin >> n;
std::cout << (n-2)*180 << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
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> ve... | 0 | 81,571,217 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pi pair<int,int>
#define pll pair<ll, ll>
#define vpi vector<pi>
#d... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
const int MAX_V = 100;
const ll INF = (1LL << 32);
int v, e;
long long D[MAX_V][MAX_V];
void warshallFloyd(void) {
for (int k = 0; k < v; k++) {
for (int i = 0; i < v; i++) {
if (D[i][k] == INF)... | 0 | 98,433,098 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main () {
int num_cards = 0;
cin >> num_cards;
string str_taro, str_hanako;
int points_taro = 0;
int points_hanako = 0;
for (int i=0; i<num_cards; i++) {
cin >> str_taro >> str_hanako;
if (str_tar... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<bool> done(10000000, false);
int cnt = 0;
while (true) {
cnt++;
if (done.at(s)) {
cout << cnt << endl;
break;
}
else {
done.at(s) = true;
if (s % 2 == 0) {
s /= 2;
}
e... | 0 | 16,905,478 |
#include "bits/stdc++.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef bhupixb
#define var(...)
#define stl(...)
#endif
#define single_test
const int maxn = 1e6 + 4;
int32_t d[maxn];
void solve() {
for (int i = 1; i < maxn; ++i) {
for (int j = i; j < maxn; j += i) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int n = -1;
for(int i = 0; i < 1000000; i++){
if(N == i * (i - 1) / 2){
n = i;
break;
}
}
if(N == 1){
cout << "Yes" << endl;
cout << 2 << endl;
cout << 1 << " " <... | 0 | 25,203,551 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,K,X,Y;
cin>>N>>K>>X>>Y;
if(K>=N){
cout<<N*X<<endl;
}
else if(K<N){
cout<<K*X+Y*(N-K)<<endl;
}
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll x,ll y){
if(x<y) swap(x,y);
ll r;
while(y>0){
r=x%y;
x=y;
... | 0 | 84,285,658 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S second
const in... | #include "bits/stdc++.h"
#define rep(i,n) for (ll i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
ll sisu(ll x,ll n){
ll mod=1e9+7;
ll nv=n;
vector <ll> bi(40,0);
vector <ll> cal(40,0);
ll k=0;
ll ans=1;
while(nv!=0){
bi[k]=nv%2;
nv/=2;
... | 0 | 2,419,230 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
bool query(long long num) {
cout << "? " << num << endl;
string s; cin >> s;
return s[0] == 'Y';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
if (!query(1000000000000000000LL)) {
for (long... | 0 | 14,171,672 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | #include<bits/stdc++.h>
using namespace std;
vector<int> a;
int dp[100010];
int moves(int index,int n){
if(index >= n-1 )
{
return 0;
}
if(dp[index]!=-1){
return dp[index];
}
int a1 = 1e9;
int b = 1e9;
if(index+1 < n){
a1 = abs(a[index]-a[index+1]) + moves(index +... | 0 | 16,328,758 |
#include<iostream>
#include<string>
using namespace std;
#define LEFT 1
#define RIGHT 0
int main(){
string data = ("qwertasdfgzxcvb");
int cnt;
string inp;
int f;
while (1){
cin >> inp;
if (inp == "#") break;
cnt = 0;
if (data.find(inp[0]) != -1) f = LEFT;
else f = RIGHT;
for (int i = 1; i < inp.size()... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int a[n],cnt=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
if(a[i]>=k)
{
cnt++;
}
}
if(cnt==0)
{
cout<<0<<endl;
}
else
{
cout<<cnt<<endl;
}
... | 0 | 98,316,161 |
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(void) {
int a, b, c, d, k;
cin >> a >> b >> c >> d >> k;
int m = a * 60 + b;
int n = c * 60 + d;
cout << n - m - k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s, t;
cin >> s >> t;
queue<char> sq, tq;
for (int i = 0; i < (int)s.size(); i++) {
sq.push(s.at(i));
tq.push(t.at(i));
}
for (int i = 0; i < (int)s.size(); i++) {
sq.push(sq.front());
sq.pop();
... | 0 | 63,756,864 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
using namespac... | #include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vec... | 0 | 19,334,083 |
#include<bits/stdc++.h>
#define ll long long
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const long long mod = 1000000007;
long long dp[100005];
long long power(long long a, long long b)
{
if (b == 0)
{
return 1LL;
}
if (b == 1)
{
return 1LL... | #include<iostream>
#include<vector>
#include<utility>
using namespace std;
void bubble_sort(vector<pair<char, int> >& c){
bool flag = true;
for (int i = c.size() - 1; flag; i--) {
flag = false;
for (int j = 0; j < i; j++) {
if (c[j].second > c[j+1].second) {
swap(c[j]... | 0 | 32,305,250 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vector<int>> vvi;
ll rec(ll SS, vi& dp)
{
ll ans = 0;
if(SS == 0)
return 1;
if(SS < 0)
return 0;
if(dp[SS] != -1)
return dp[SS];
for(ll i = 3 ; i <= SS ; i++)
ans += rec(SS-i,dp) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 0 | 54,798,002 |
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << int(n % k != 0) << endl;
} | #include <iostream>
using namespace std;
int main() {
long long a, b, k;
cin>>a>>b>>k;
long d= a+b;
if (a > k)
{
cout<<a-k<<" "<<b;
}
else if (d>=k)
{
cout<<0<<" "<<d-k;
}
else
{
cout<<0<<" "<<0;
}
return 0;
} | 0 | 64,764,121 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int x, y, z; cin >> x >> y >> z;
cout << ((z <= y && z >= x) ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | 0 | 31,441,633 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int n,a[100100],b[100100];
int main()
{
scanf ("%d",&n);
for (int i=0;i<=n;i++) scanf ("%d",&a[i]);
for (int i=0;i<n;i++) scanf ("%d",&b[i]);
long long ans = 0;
for (int i=0;i<n;i++){
int v = min(a[i],b[i]);
ans += v;
a[i] -= v;
b[i] -=... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int d;
while (cin >> d) {
int area = 0;
for (int i=0; i+d<=600; i+=d) {
area += d * i * i;
}
cout << area << endl;
}
return 0;
} | 0 | 3,742,469 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> works(m+1);
rep(i, n) {
int a, b;
cin >> a >> b;
if (a > m) continue;
works[a].push_back(b);
}... | #include<stdio.h>
#include<cstdio>
#include<algorithm>
using namespace std;
#define MAX_N 50005
#define MAX_C 10005
#define MAX_M 21
int dp[MAX_M][MAX_N];
int n,m;
int v[MAX_M];
int solve(int n,int m){
for(int i=0;i<=n;i++){
dp[0][i]=0;
dp[1][i]=i;
}
for(int i=0;i<=m;i++){
dp[i][0]=0;
}
for(int i=... | 0 | 57,090,283 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n;cin>>n;
string s[n];
for(int i = 0;i<n;i++) cin>>s[i];
char matu = s[0][s[0].length()-1];
for(int i = 1;i<n;i++){
if(matu ==s[i][0]){
matu = s[i][s[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, L;
cin >> N >> L;
vector<string> a(N);
rep(i,N) {
string S;
cin >> S;
a.at(i) = S;
}
string lib;
rep (i, N) {
sort(a.begin(), a.end());
lib... | 0 | 27,521,257 |
#include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
ty... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <bitset>... | 0 | 30,658,214 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
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-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; el... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 88,091,635 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
#define REP(i, n) for(int i = -1; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
int main()
{
long long N, X, M;
cin >> N >> X >> M;
vector<long long> b, l;
vector<bool> i... | #include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
int main()
{
string n, t;
int cnt;
while (cin >> t)
{
if (t[0] == '-')
break;
if (isdigit(t[0]))
{
cnt = atoi(t.c_str());
for (int i = 0; i < cnt; i++)
{
cin >> t;
int h = atoi(t.c_str());
n = n.substr(h) + n... | 0 | 40,649,561 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 0 | 54,653,975 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll... | #include <iomanip>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int kaijou(int n){
int kaijou_sum = 1;
if(n!=0){
for(int i=1;i<=n;i++){
kaijou_sum *= i;
}
return kaijou_sum;
}
else return 1;
}
int main() {
ll n;
ci... | 0 | 68,519,477 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,y,x1;
int j=0;
int N;
cin >> x >> y;
N=x;
x=4*x;
for(int i=0;i<N+1;i++){
x1=x-2*i;
if(x1==y){
cout << "Yes" << endl;
j=1;
}
}
if(j!=1)cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<int,int>
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#def... | 0 | 11,751,329 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int i,j;
int h,w;
cin >> h >> w;
vector<vector<char>> v(h+2,vector<char>(w+2,'.'));
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
cin >> v[i][j];
}
}
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
if(v[i][j]=='#'){
if(v[... | #include <stdio.h>
#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>
#incl... | 0 | 10,746,973 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, m, r;
cin >> n >> m >> r;
vector<vector<int>> c(n, vector<int>(n));
rep(i, n) rep(j, n) c.at(i).at(j) = 1000000000;
rep(i, n) c.at(i).at(i) = 0;
vector<int... | #include <bits/stdc++.h>
#define fi first
#define se second
#define REP(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for(int i = (a); i > (b); --i)
#define REPD(i, a, b) for(int i = (a); i >=(b); --i)
#define TR(it, a) for(__typeof(a.begin()) it = ... | 0 | 4,944,800 |
#include "stdio.h"
#include "math.h"
int main()
{
int d, x;
while(scanf("%d", &d) != EOF){
x = 0;
for(int i = 0; i < 600; i += d) x += (d * pow(i, 2.0));
printf("%d\n", x);
}
return 0;
} | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
using namespace std;
#define A_MAX 250
#define INVALID -2000000000
int main() {
int m;
int key;
cin >> m;
int* keys = new int[m];
for (int i = 0; i < m; i++) {
cin >> keys[i];
}
for (int i = 1; i < m+1; i++) {... | 0 | 36,156,166 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,m,a[200005],b[200005],c[200005]={};
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>a[i]>>b[i];
if(b[i]==n){
c[a[i]]=1;
}
}
for(int i=0;i<m;i++){
if(a[i]==1){
if(c[b[i]]==1){
cout<<"P... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
scanf("%d", &n);
vector<long> a(n+1);
rep(i, n+1) {
cin >> a[i];
}
vector<long> b(n);
rep(i, n) {
cin >> b[i];
}
long cnt = 0;
rep(i, n) {
if (a... | 0 | 6,103,299 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(...) debug_func_mult(split_names(#__VA_ARGS__), __VA_ARGS__)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout<<"=================\n"
#else
#define DEBUG(...) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_L... | #include<stdio.h>
#define INF 1000001
#define maxi(a,b) ((a>b)?a:b)
#define mini(a,b) ((a<b)?a:b)
int main(void){
int max=-INF,min=INF,a,i,n;
long long int sum=0LL;
scanf("%d",&n);
for(i=0; i<n; i++){
scanf("%d",&a);
max = maxi(a,max);
min = mini(a,min);
sum+=a;
}
... | 0 | 55,243,631 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i,n) cin >> v[i];
ll ans=0;
rep(i,n){
int x=v[i];
ans+=x;
for(int j=i;j<n;j++){
if(v[j]>=x) v[j]-=x;
else{
... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 36,521,906 |
#include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
s... | #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... | 0 | 62,777,984 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<tuple>
#include<map>
#include<bitset>
#include<queue>
#define rep(i,n) for (int i=0; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
int n, k;
cin >> n >> k;
vi vec(n)... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 88,044,676 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H1, M1, H2, M2, K;
cin >> H1 >> M1 >> H2 >> M2 >> K;
int X1, X2, Xa;
X1 = 60 * H1 + M1;
X2 = 60 * H2 + M2;
Xa = X2 - X1 - K;
cout << Xa << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 49,826,143 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
int x; cin >> x;
int y = x / 100;
if(y * 100 <= x && x <= y * 105){
cout << 1 <<... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define si size()
#define bk back()
#define popb pop_back()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(N... | 0 | 22,814,078 |
#include <iostream>
#include <string>
#include <queue>
#include <algorithm>
using namespace std;
using ll = long long int;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<P> v(n);
for(int i=0;i<n;i++){
int a;
cin >> a;
v[i] = P(a,i);
}
sort(v.begin(),v.end()... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<iomanip>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#define debug(x) cout<<(#x)<<"="<<(x)<<", ";
#defin... | 0 | 70,725,254 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
long long gcd(long long a, long long b) {
if (a%b == 0) return b;
else return gcd(b, a%b);
}
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if... | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 100010;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0... | 0 | 55,506,526 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
int N, A, B, C;
int l[10] = {0};
int getDigit4... | #include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> a(N), b(N), c(... | 0 | 33,973,909 |
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
int mai... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
ll H, W;
cin >>... | 0 | 22,424,783 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<... | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s, t;
ci... | 0 | 92,898,097 |
#include<stdio.h>
char str[1024],input[2048];
void print(void){
int i,a,b;
sscanf(input,"print %d %d",&a,&b);
for(i=a;i<=b;i++){
printf("%c",str[i]);
}
printf("\n");
}
void reverse(void){
int i,a,b;
char tmp;
sscanf(input,"reverse %d %d",&a,&b);
for(i=0;i<(b-a+1)/2;i++){
tmp=str[a+i];
str[a+i]=str[b-i];
... | #include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define bged(v) (v).begin(),(v).end()
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
typedef long long ll;
const int Imx=2147483647;
const ll Lbig=2e18;
const int... | 0 | 28,031,488 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef pair<int, int> pii;
typedef vector<int> vi;... | #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;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | 0 | 86,674,109 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+10;
ll a[maxn];
ll f[maxn][35];
int main(){
int n,step,q,i,j,p;
scanf("%d",&n);
for (i=0;i<n;i++) scanf("%lld",&a[i]);
scanf("%d%d",&step,&q);
for (i=0;i<n;i++) {
p=upper_bound(a,a+n,a[i]+step)-a;
... | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
#define let auto const&
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) \
for (default_counter_t i = 0, end_i = default_counter_t(... | 0 | 449,694 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(... | #include <bits/stdc++.h>
#include <math.h>
#include <float.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<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | 0 | 87,860,159 |
#include <iostream>
#include<stdio.h>
#include<stack>
#define MAX 100
#define WHITE 1
#define GRAY 2
#define BLACK 3
using namespace std;
int color[MAX], d[MAX], f[MAX];
int n, A[MAX][MAX];
int tt;
void dfs_visit_1(int u) {
color[u] = GRAY;
d[u] = ++tt;
for(int v = 0; v < n; v++) {
if(A[u][v] == 0)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N; i >= 0; i--)
const ll INF = 1000000007;
#define PI 3.1415926535
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b) { if... | 0 | 91,413,815 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LC... | #include <stdio.h>
void draw_line(void);
int main(void)
{
int n, b, f, r, v;
int i, j;
int room1[3][10], room2[3][10], room3[3][10], room4[3][10];
for (i = 0; i < 3; ++i) {
for (j = 0; j < 10; ++j) {
room1[i][j] = 0;
room2[i][j] = 0;
room3[i][j] = 0;
... | 0 | 92,365,939 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 998244353
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int H, W, D; cin >> H >> W >> D;
vec... | 0 | 51,513,902 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<"\n";
#define fi(v) get<0>(v)
#def... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
vector<ll> fact(1000000);
void init_fact(int n){
fact[0]=1;
for (int i = 1; i < n+1; i++){
fact[i]=fact[i-1]*i;
fact[i]%=MOD;
}
}
ll mod_pow(ll x, ll p){
ll res=1;
ll n=x;
while(p>0){
if(p&1==1)re... | 0 | 34,221,595 |
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
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,... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cer... | 0 | 42,475,375 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
string s;
string right="yuiophjklnm";
cin >> s;
while(s.at(0)!='#'){
vector<int> Right(s.size(),0);
for(int i=0;i<s.size();i++){
if(find(right.begin(),right.end(),s.at(i))==right.end()... | #include <bits/stdc++.h>
using namespace std;
const int mod = (int) 1e9 + 7;
int mul(int a, int b) {
return (long long) a * b % mod;
}
int main() {
int n;
string s;
cin >> n >> s;
vector<int> color;
for (auto c : s) {
color.push_back(c == 'B');
}
int res = 1, choices = 0;
for (auto c : color) {
... | 0 | 77,080,676 |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
using namespace std;
#define al... | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define mod 1000000007
#define inf 1000000000000000001;
using namespace std;
ll x, y, z, k, a[1009], b[1009], c[1009];
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cin>>x>>y>>z>>k;
vector<ll>... | 0 | 48,393,640 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
const int mx = 200005;
int n, a[mx], l, r = mx;
int main(){
scanf("%d", &n);
rep(i,n) scanf("%d", a+i);
while(l+1 < r){
int mid = (l+r) / 2, hight = 0;
bool ok = true;
map<int, int> mp;
r... | #include <iostream>
using namespace std;
int n,s,spn;
void sp(int ne,int ns,bool* flag)
{
if (ne > n) return;
if (ne == n && ns == s) spn++;
for(int i=0;i<10;++i){
if(!flag[i]){
flag[i]=true;
sp(ne+1,ns+i,flag);
flag[i] = false;
}
}
}
int perm(int n)
{
return (n ? n * per... | 0 | 66,766,600 |
#include <bits/stdc++.h>
using namespace std;
bool flags[21][21];
char maps[21][21];
int W, H;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dfs(int x, int y)
{
if(x < 0 || y < 0 || x >= H || y >= W || flags[x][y] || maps[x][y] == '#')return 0;
flags[x][y] = true;
int sum = 0;
for(int i = 0; i < 4; i+... | #define ONLINE_JUDGE
#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 _ov... | 0 | 73,959,878 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { ... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 84,555,091 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | #include <iostream>
#include <cmath>
#include <stdio.h>
#include <map>
#include <vector>
#include <string>
#include <algorithm>
#define rep(i,n) for(int i=0;i!=n;++i)
using namespace std;
typedef long long ll;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
... | 0 | 13,036,978 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
vector<int> N(4);
rep(i,4)
cin >> N.at(i);
sort(N.begin(), N.end());
if(N.at(0)==1 && N.at(1)==4 && N.at(2)==7 && N.at(3)==9)
cout << "YES";
else
cout << "NO";
cout << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%lld",&x);
int main(){
ll n, t;
sc(n) sc(t)
ll T[n], ans = 0;
for (int i = 0; i < n; i++) sc(T[i])
int now = T[0];
for (int i = 1... | 0 | 26,860,535 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i,l,r) for(i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
signed main(){
ll N,i,j;cin>>N;ll C[N-1],S[N-1],F[N-1];
REP(i,N-1)cin>>C[i]>>S[i]>>F[i];
R... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <climits>
#define CLR(mat) memset(mat, 0, sizeof(mat))
using namespace std;
static const int DAT_SIZE = 1<<18;
typedef long long ll;
ll data[DAT_SIZE], datb[DAT_SIZE];
void add(ll a, ll b, ll x, ll k, ll l, ll r... | 0 | 97,994,028 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
template <typename T, typename U> std::istream&operator>>(st... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string S;
cin >> S;
vector<vector<vector<bool>>> dp(N+1, vector<vector<bool>>(4, vector<bool>(1000, false)));
dp[0][0][0] = true;
for(int i=0; i<... | 0 | 75,727,178 |
#include<iostream>
using namespace std;
bool l,r,b;
int n,ans;
string s;
int main(){
while(1){
cin>>n;
if(n==0)break;
ans=l=r=b=0;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu")l=true;
else if(s=="ru")r=true;
else if(s=="ld")l=false;
else if(s=="rd")r=false;
if(l==r&&l!=... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include... | 0 | 98,331,619 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll x,y;
scanf("%lld%lld",&x,&y);
if(abs(x-y)<=1)
cout<<"Brown"<<endl;
else cout<<"Alice"<<endl;
} | #include <iostream>
#include <vector>
#include <math.h>
#include <map>
#include <stdio.h>
#include <queue>
#include <algorithm>
#include <functional>
#include <string>
using namespace std;
#define MP make_pair
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,a) for(int i=0;i<(a);++i)
typedef pair<int, int> P;
... | 0 | 97,377,101 |
#include <bits/stdc++.h>
#define rep(i, z, n) for(int i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main(){
int N, K, X, Y;
cin >> N >> K >> X >> Y;
int ans = 0;
if (N > K) ans += Y * (N - K);
ans += X * min(N, K);
cout << ans << endl;
} | #include<map>
#include<iostream>
#include<string>
using namespace std;
int main(){
int num;
cin >> num;
map<string,int> dic;
for(int i=0;i<num;i++){
string process,key;
cin >> process >> key;
if(process[0]=='i'){
dic[key]=1;
}else{
if(dic[key]==0){... | 0 | 95,106,471 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 0 | 76,421,195 |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < (ll) b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(a) ... | # include <bits/stdc++.h>
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define rep2(x,y,w,h) rep (x, w) rep (y, h)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define reps2(x,y,w,h) reps (x, w) reps (y, h)
# define rrep(i,n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i,n) for(i... | 0 | 88,981,120 |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1e5+5;
int n,L,T,i,a[N];long long cnt;
int read(){
char c=getchar();int k=0;for (;c<48||c>57;c=getchar());
for (;c>47&&c<58;c=getchar()) k=(k<<3)+(k<<1)+c-48;return k;
}
void write(int x){if (x>9) write(x/10);putchar(x%10+48);}
int main(){
n=read(... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | 0 | 48,303,745 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | 0 | 26,311,365 |
using namespace std;
#include <iostream>
#include <vector>
#include <set>
#include <string>
#include <algorithm>
#include <utility>
#include <functional>
#include <queue>
#include <cmath>
using namespace std;
int main(void){
long long int N;
cin >> N;
auto a = sqrt(N*2);
auto ai = (int)floor(a);
if (ai * (ai + 1) ... | #include<bits/stdc++.h>
using namespace std;
int i;
string a;
int main(){
cin>>a;
a.erase(5,1);
a.erase(12,1);
for(i=0;i<=a.length()-1;i++){
cout<<a[i];
if(i==4){
cout<<" ";
}
else if(i==11){
cout<<" ";
}
}
} | 0 | 52,293,040 |
#include<bits/stdc++.h>
#define mod 1000000007
#define endl '\n'
typedef long long int ll ;
using namespace std;
ll n=0;
vector<ll> v;
ll pre[500007];
ll answer_max_operations(ll k)
{
ll left=0; ll right=n/k;
while(true)
{
ll mid= (left+right)/2;
int idx=lower_bound(v.begin(),v.end(),mid)-v.... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 55,119,499 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
vector<long> sam(b);
for(int i=0; i<b; i++){
sam.at(i)=((i+1)*a)%b;
}
bool judge=false;
for(int i=0; i<b; i++){
if(sam.at(i)==c){
judge=true;
break;
}
}
if(judge) cout << "YES" << endl;
else cout << "NO" << ... | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
#define endl "\n"
#define pi 3.1415926535897932384626433832795
#define ll long long
#define pb push_back
#define pii pair < int , int >
#define vecsort(v) sort(v.begin(),v.end())
#def... | 0 | 73,331,752 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define el(a) (a).end()-(a).begin()
#define mod... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
rep(i, n + 1) rep(j, n + 1) {
if ((n - (r * i + g * j)) % b == 0) {
int k = (n - (r * i + g * j)) / b... | 0 | 98,287,926 |
#include <iostream>
using namespace std;
int main() {
char x, y;
cin >> x >> y;
char ans;
if (x - y == 0) {
ans = '=';
} else if (x - y > 0) {
ans = '>';
} else {
ans ='<';
}
cout << ans << endl;
return 0;
} | #include "stdio.h"
int main() {
int n;
scanf("%d", &n);
int a[n];
for(int i=0; i<n; i++) scanf("%d", &a[i]);
int count = 0;
for(int i=0; i<n; i++){
int minj = i;
for(int j=i; j<n; j++){
if(a[j]<a[minj]) minj = j;
}
if(a[i] != a[minj]){
int tmp = a[i];
a[i] = a[minj];
... | 0 | 16,445,923 |
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
#define MAX(x,y) (x>y?x:y)
#define MIN(x,y) (x<y?x:y)
#define ABS(x) (x>0?x:-(x))
#define INF 2147483647
#define LLINF ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
using namespace std;
int main()
{
int n;
vector<int> vi;
while (cin >> n, n) {
vi.clear();
for (int i = 0; i < n; i++) {
int s;
cin >> s;
vi.push_back(s);
}
sort(... | 0 | 66,215,241 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(... | #include <iostream>
#include <string>
#include <math.h>
using namespace std;
int main(){
char str[1001],p[1001];
string command;
int q,i,a,b,j,c,k;
cin >> str;
cin >> q;
for(i=0;i<q;i++){
cin >> command;
if( command != "replace" ) cin >> a >> b;
else{
cin >> a >> b >> p;
}
if( comm... | 0 | 18,687,649 |
#include <iostream>
#include <math.h>
#include <climits>
#include <string>
#include <utility>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
const int INF = 1000000;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll INF = 1'010'000'000'000'000'017LL;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
string s;
cin >> s;
bool ans = false;
string k = "keyence";
rep(i, 8) {
if((s... | 0 | 6,347,942 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int m... | #include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
#define NIL (-1)
char ans[1046527][14];
int o=1046527;
int getChar(char i)
{
switch(i)
{
case 'A':return 1;
case 'C':return 2;
case 'G':return 3;
case 'T':return 4;
}
}
long long getKey(char a[])
{
... | 0 | 64,256,649 |
#include <cstdio>
typedef long long LL;
int main() {
int Q, H, S, D; LL N;
scanf("%d%d%d%d%lld", &Q, &H, &S, &D, &N);
if (H > 2 * Q) H = 2 * Q;
if (S > 2 * H) S = 2 * H;
if (D > 2 * S) D = 2 * S;
printf("%lld\n", N / 2 * D + N % 2 * S);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) fo... | 0 | 59,487,439 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string o,e;cin >>o>>e;
for (int i = 0; i < e.size(); ++i) {
cout <<o[i]<<e[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i,1000) {
string t;
int x = i;
rep(j,3) {
t += '0'+x%10;
x /= 10;
}
int ti = ... | 0 | 942,466 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
a[0] += 'A'-'a';
b[0] += 'A'-'a';
c[0] += 'A'-'a';
cout << a[0] << b[0] << c[0];
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long N,L,T; cin >> N >> L >> T;
vector<pair<long long,int>> X(N);
vector<long long> ans(N),ans1(N);
long long x,w,z;
pair<long long,int> ant;
for (int i=0;i<N;i++)
{
cin >> x >> w;
ant=make_pair(x,w);
X[i]... | 0 | 69,713,532 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int WHITE = 0, GREY = 1, BLACK = 2;
const int INF = 1000000;
struct BFS {
int n;
vector<vector<int>> g;
vector<int> parent;
vector<int> distance;
vector<int> color;
BFS (int n) : n(n) {
g.... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S,T,U;
int A,B;
cin>>S>>T;
cin>>A>>B;
cin>>U;
if(S.length()>=1&&S.length()<=10&&T.length()>=1&&T.length()<=10&&S!=T&&(U==T||U==S)&&A<=10&&A>=1&&B<=10&&B>=1){
if(U==S){
A--;
}
if(U==T){
B--;
}
cout... | 0 | 71,034,544 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#def... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
using namespace std;
using ll = long long;
usin... | 0 | 2,699,486 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rnd(chrono::steady_clock().now().time_since_epoch().count());
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 0 | 56,961,068 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i,a,b) for (ll i=(a);i<(ll)b; i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define INF 1LL << 60
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll,ll> p;
const long long MOD=1000000007;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a[200010];
int b[200010];
ll nCr(ll n, ll r)
{
if(n<r)return 0;
ll b=1;
ll a=1;
for(ll i=0;i<r;i++)
{
b*=(n-i);
a*=(r-i);
}
ll ret=b/a;
return ret;
}
int main()
{
cin.tie(0);
ios::sync_with_st... | 0 | 93,493,849 |
#include <cstdio>
using namespace std;
int main()
{
int a, b, c, k;
scanf("%d%d%d%d", &a, &b, &c, &k);
if (k <= a) printf("%d\n", k);
else if (k <= a + b) printf("%d\n", a);
else printf("%d\n", 2 * a - k + b);
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
while(true){
int a[100000] = {0};
int n, k;
cin >> n >> k;
if(!n)
break;
for(int i = 0; i < n; i++){
cin >> a[i];
}
int ans = 0;
for(int j = 0; j < k; j++){
ans +... | 0 | 60,537,739 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double n,m,d;
cin >> n >> m >> d;
double ans;
if(d==0){
ans=n/(n*n)*(m-1);
}
else{
ans=(2*(n-d))/(n*n)*(m-1);
}
cout << fixed << setprecision(10);
cout << ans << endl;
} | #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;
vector<ll> a;
rep(i, n) {
ll x;
cin >> x;
if (i % 2 == 0)
a.push_back(x);
else
a.insert(a.begin(), x);
... | 0 | 68,978,215 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define vi vector<int>
#define vv vector<vi>
#define pb push_back
#define pi pair<int,int>
#define vp vector<pair<... | 0 | 52,961,299 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
string s[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++) cin >> s[i][j];
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
... | 0 | 60,361,553 |
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
int manhattan(pair<int, int> x, pair<int, int> y) {
return abs(x.first - y.first) + abs(x.second - y.second);
}
si... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 6;
const int inf = 0x3f3f3f3f;
const ll mod=1e9+7;
ll prime[maxn],v[maxn],phi[maxn];
ll sphi[maxn];
ll m=0;
void euler(ll n){
memset(v,0,sizeof(v));
m=0;
for(ll i=2;i<=n;i++){
if(v[i]==0){
v[i]=i;
prime[++m]=... | 0 | 49,454,476 |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <map>
#include <iterator>
#include <functional>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <fstream>
#include <iomanip>
#include <numeric>
#include <cma... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B, C, D ;
cin >>A >>B >>C >>D;
if(A + B > C + D){
cout << "Left" << endl;
}
if(A + B == C + D){
cout << "Balanced" << endl;
}
if(A + B < C + D){
cout << "Right" << endl;
}
} | 0 | 50,024,603 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #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 | 42,340,075 |
#include <iostream>
using namespace std;
int main()
{
for (int x = 1; x < 10; x++)
for (int y = 1; y < 10; y++)
cout << x << "x" << y << "=" << x * y << endl;
} | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 43,687,629 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.