code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define spdio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define pp pop_back()
#define pf push_front
#define ppf pop_front()
#define ff first
#define ss second
#define mp make_pair
#define fr(i,j,n) for(ll i=j; i<n; i++)
#define rfr(... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int n,a[100007],dp[1000007];
int32_t main()
{
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i],dp[i]=0;
dp[0]=0;
dp[1]=abs(a[1]-a[0]);
for(int i=2;i<n;i++)
dp[i]=min(dp[i-1]+abs(a[i]-a[i-1]),dp[i-2]+abs(a[i]-a[i-2]));
cout<<dp[n-1]<<endl;
return 0;
} | 1 | 10,483,917 |
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<bitset>
#include<string>
#include<cstdio>
#include<cctype>
#include<cassert>
#include<cstdlib>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>
#define For(i,x,y) for (int i=x;i<y;i++)
#define pb push_back
#define mp make_pai... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main()
{
string str;
int h, w;
cin >> h >> w;
for (int i = 1; i <= h; i++) {
for (int j = 0; j < w; j++) {
cin >> str;
if (str == "snuke") {
printf("%c%d\n", 'A' + j, i);
... | 1 | 93,242,412 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long ul;
int main()
{
int n;
cin >> n;
vector<int> a(n);
double sum = 0, avg;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
avg = sum / n;
int avg2 = avg, s = 0;
avg2 += (avg - avg2 >= avg2 + 1 - avg) ? 1 : 0;... | #include<bits/stdc++.h>
using namespace std;
int ze(int a) {
if (a < 0) return -a;
return a;
}
int main () {
int N;
cin >> N;
vector<int>A(N);
for (int i = 0; i < N; i ++) cin >> A[i];
int sum = 0;
for (int i = 0; i < N; i ++) sum += A[i];
int ko = sum / N;
int ko_ = ko + 1;
if (sum < 0) ko_ = ko ... | 1 | 14,542,531 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll cum_sum[200001];
ll cum_xor[200001];
ll A[200000];
bool is_ok(ll i, ll j) {
return (cum_sum[j+1] - cum_sum[i]) == (cum_xor[j+1] ^ cum_xor[i]);
}
ll find_max_ok(ll lower, ll upper) {
ll ok = lower;
ll ng = upper;
while(ng - ok > 1) {
ll trying ... | #include<cstdio>
using namespace std;
int n;
long long a[200005];
int main()
{
scanf("%d",&n);
long long v=0,sum=0,e=1;
int left=1,right=1;
for(;right<=n;right++)
{
scanf("%d",&a[right]);
while((v^a[right])!=v+a[right])
{
sum+=right-left;
v^=a[left++];... | 1 | 28,401,752 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
string s;
... | #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() {
string s;
cin >> s;
int c_0 = 0, c_1 = 0;
int ans = 0;
rep(i, s.size()){
if (s[i] == '0') c_0++;
if (s[i] == '1') c_1++;
}
ans = min(c_0, c_1);
ans *= 2;
... | 1 | 35,872,775 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
int x,y,T,ans,tmp,tmp2;
scanf("%d",&T);
while(T--)
{
ans=0;
scanf("%d%d",&x,&y);
if(x>y)
{
swap(x,y);
}
if(y==1)
ans=0;
else
{
ans+=x-1;
tmp=sqrt((... | #include <cstdio>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
int main()
{
int Q;
long long int a, b1, b, s, ans;
scanf("%d", &Q);
for(int i=0; i<Q; i++){
scanf("%lld %lld", &a, &b);
if(a<b){
b1=b;
b=a;
a... | 1 | 30,751,461 |
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if (b > a) {
int tmp = a;
a = b;
b = tmp;
}
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int n, a, cgcd;
cin >> n >> cgcd;
for (int i = 1; i < n; i++) {
cin >> a;
cgcd = gcd(cgcd, a);
}
c... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
int amari = a[0];
while(1){
bool isconst = true;
for(int i = 0; i < n; i++){
... | 1 | 65,665,378 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(){
string s;
string p;
cin>>s>>p;
char tmp[300];
for(int i=1;i<=2;i++){
for(int j=0;j<s.size();j++){
if(i==2){
tmp[j+s.size()]=s[j];
}
else{
... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
char s[100],p[100];
int c = 0;
int d = 0;
while(1){
char a;
scanf("%c",&a);
if(a=='\n') break;
s[c] = a;
c++;
}
while(1){
char a;
scanf("%c",&a);
if(a=='\n') break;
p[d] = a;
d++;
}
if(c<d){ cout << "No" << endl; return 0... | 1 | 26,697,297 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
cout << S[0];
for (int i = 2; i < S.size(); i++) {
if (i % 2 == 0) {
cout << S[i];
}
}
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
string s;
cin >> s;
rep(i, s.size()) if (i % 2 == 0) cout << s[i];
cout << endl;
return 0;
} | 1 | 36,580,231 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int main(){
int a,b;
cin>>a>>b;
char c='0'+a ,d='0'+b;
string x(a,d),y(b,c);
if(x<y)cout<<x<<endl;
else cout<<y<<endl;
} | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 1 | 93,750,626 |
#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 dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const ll INF=1e18;
int main() {
ll n,m,k;
cin >>n>>m;
rep(i,n){
rep(j,n-i){
k=n-i-j;
if(m==i*10000+j*5000+k*1000){
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const ll MAX = 10000;
static const ll INFTY = 1e12;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return... | 1 | 31,682,446 |
#include<iostream>
using namespace std;
int main(){
int m,f,r;
char c;
while(1){
cin>>m>>f>>r;
if(m==-1&&f==-1&&r==-1)break;
if(m==-1||f==-1) c='F';
else if(m+f>=80) c='A';
else if(m+f>=65) c='B';
else if(m+f>=50||m+f>=30&&r>=50) c='C';
else if(m+f>=30) c='D';
else c='F';
... | #include<iostream>
using namespace std;
int main(){
int m,f,r,x;
while(1){
cin>>m>>f>>r;
if(m==-1 && f==-1 && r==-1){
break;
}
x=m+f;
if( x<30 || m==-1 || f==-1){
cout<<"F"<<endl;
}
else if(x>=30 && x<50 && m!=-1 && f!=-1 && r<50){
cout<<"D"<<endl;
}
else if(x>=50 && x<65 && m!=-1 && f!=-1 || x>=30 && ... | 1 | 21,983,410 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;
vector<LL> v;
int... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define fir first
#define sec second
#define mod 998244353
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
int ans=0; while(is... | 1 | 50,474,492 |
#include <iostream>
using namespace std;
int main() {
int W,H,x,y,r;
cin >> W >> H >> x >> y >> r;
cout << ((x-r < 0 || W < x+r || y-r < 0 || H < y+r) ? "No" : "Yes") << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int W;
int H;
int x;
int y;
int r;
cin>>W>>H>>x>>y>>r;
if(x-r>=0&&y-r>=0&&x+r<=W&&y+r<=H){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | 1 | 59,233,128 |
#include <stdio.h>
int main()
{
int a, b;
scanf("%d %d", &a, &b);
if (a==1 && b==2)
{
printf("3");
}
else if(a==2 && b==1)
{
printf("3");
}
else if(a==2 && b==3)
{
printf("1");
}
else if(a==3 && b==2)
{
printf("1");
}
else if (a==1 && b==3)
{
printf("2");
}
else if(a==3 && b==1)
{
printf("2");
}
retur... | #include<bits/stdc++.h>
using namespace std ;
int main() {
int A ,B ;
cin >> A >> B ;
if( A == 1){
if (B == 2){
cout << 3 << endl ;
}
else {
cout << 2 << endl ;
}
}
else if (A == 2){
if (B==1){
cout << 3 << endl ;
}
else {
cout << 1 << endl ;
}
}
els... | 1 | 26,701,183 |
#include <iostream>
using namespace std;
int main() {
int ch[3]={0};
string str;
cin >> str;
bool flag = true;
for(int i=0; i<3; i++) {
if(ch[(int)(str[i]-'a')]==0) {
ch[(int)(str[i]-'a')]++;
} else {
flag = false;
break;
}
}
if(flag) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
string s;
cin >> s;
vector<int> a(3);
rep(i,3){
if(s.at(i)=='a') a.at(0) ++;
else if(s.at(i)... | 1 | 24,406,244 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
const int N=100001;
vector<int>g[N];
ll dp[N][2];
ll solve(ll src,ll par,ll tight)
{
if(dp[src][tight]!=-1)
{
return(dp[src][tight]);
}
if(tight==1)
{
ll ans=1;
ll f=0;
for(auto x:g[src])
{
if(x!=par)
{
f=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int n;
vector<vector<int>> adj;
vector<vector<ll>> dp;
ll solve(int cur, int prev, int col) {
if (dp[cur][col] != -1)
return dp[cur][col];
ll tot = 0, w = 1;
if (col == 0) {
for (auto it : adj[cur]) {
if (it != prev) {... | 1 | 37,159,115 |
#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;
ll f(ll x){
if(x%2==1)return 3*x+1;
return x/2;
}
int main(){
ll s;cin >>s;
map<ll,int>m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll s;
cin >> s;
set<ll> appear;
int ans = 1;
while (1) {
if (appear.count(s)) break;
appear.emplace(s);
if (s & 1) s = 3 * s + 1;
else s /= 2;
++ans;
}
cout ... | 1 | 94,451,939 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
priority_queue<int> pq;
while (1) {
string s;
cin >> s;
if (s == "insert") {
int k;
scanf("%d", &k);
pq.push(k);
} else if (s == "extract")... | #include <cstdlib>
#include <cstdio>
#include <string>
#include <iostream>
using namespace std;
template <typename T> class Heap{
struct node_t{
T val;
int dep;
node_t *l;
node_t *r;
node_t(T _val) : val(_val), dep(0), l(NULL), r(NULL){}
~node_t(){
if(l != NULL) delete l;
if(r != N... | 1 | 83,950,530 |
#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... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<int> x(4), y(4);
cin >> x[0] >> y[0] >> x[1] >> y[1];
x[2] = x[1] - (y[1] - y[0]);
y[2] = y[1] - (x[0] - x[1]);
x[3] = x[0] - (y[1] - y[0]);
y[3] = y[0] + (x[1] - x[0]);
cout << x[2] << " " << y[2] << " " << x[3] << " ... | 1 | 62,407,570 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 101234567;
int main() {
ll N;
ll ans = 0;
vector<ll>v;
cin >> N;
for (int k = 1; k < (double)sqrt(N); k++) {
if (N % k == 0) {
ll m = N/k - 1;
if (m > k) {
ans += m;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
long long N;
cin >> N;
long long res = 0;
for(long long i=1;i*i<=N;i++){
if(N % i == 0){
long long j = i-1;
long long k = N / i - 1;
if(j && N/j == N%j) re... | 1 | 30,114,299 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w
#define in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define debug(var) do{std::cout << #var << " : "; view(var);}while(0)
using namespace std;
typedef long long ll;
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
tem... | 1 | 79,213,625 |
#include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if ((a * b) % 2) {
std::cout << "Odd" << std::endl;
} else {
std::cout << "Even" << std::endl;
}
} | #include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
a=a*b;
if(a%2==0)
cout<<"Even";
if(a%2==1)
cout<<"Odd";
return 0;
} | 1 | 79,373,203 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int n;cin >> n;
string s;cin >> s;
int ans = 0;
rep(num,1000){
string temp = "";
... | #include <iostream>
#include <map>
using namespace std;
int main() {
long N;
string S;
cin >> N >> S ;
string a1 = "";
string a2 = "";
string a3 = "";
int cnt = 0;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
... | 1 | 71,175,181 |
#include<iostream>
#include<stdio.h>
#include<string>
using namespace std;
int main(){
int a, b;
std::string sep;
cin >> a >> b;
if(a == b) {
sep = "==";
} else if(a > b) {
sep = ">";
} else {
sep = "<";
}
cout << "a " << sep << " b" << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#define REP(i,n) for(int i=0;i<n;i++)
#define OUTPUT(a,b,s) cout << s << '\n'
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b)
OUTPUT(a,b,"a < b");
else if (a > b)
OUTPUT(a,b,"a > b");
else
OUTPUT(a,b,"a == b");
} | 1 | 59,767,852 |
#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 ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int ll
#define endl "\n"
#define all( x ) x.begin(), x.... | 1 | 96,107,133 |
#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 push_back
#define eb emplace_back
#define all(x) x.begin()... | #include<bits/stdc++.h>
using namespace std;
const int N=2e5+11;
int a[N],n;
int chk(int m){
int i;
if(m==1){
for(i=1;i<n;++i)if(a[i]>=a[i+1])return 0;
return 1;
}
map<int,int> f;
for(i=2;i<=n;++i)if(a[i]<=a[i-1]){
f.erase(f.upper_bound(a[i]),f.end());
int k=a[i];
++f[k];
while(k>0&&f[k]==m)f.erase(k),... | 1 | 8,403,808 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
#define ALL(v) (v).begin(), (v).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
templ... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<cctype>
#include <fstream>
#inc... | 1 | 40,474,002 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int cost[12][12];
int n,a,b,c;
int s,min_cost;
int main(){
while(scanf("%d",&n),n!=0){
memset(cost,255,sizeof(cost));
for(int i=0;i<n;i++){
scanf("%d %d %d",&a,&b,&c);
cost[a][b]= (cost[a][b]==-1) ? c : min(cost[a][b]... | #include <iostream>
using namespace std;
const int INF = 1000000000;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
int T[10][10];
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
if(i==j){
T[i][j] = 0;
}
else{
T[i][j] = INF;
}
}
}
int m = 0;
for(int i=0;... | 1 | 76,424,834 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
#define v vector
const int INF = 1000000007;
typedef long long ll... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 998244353;
int main() {
ll N, x, m{}, ans{1};
cin >> N;
vector<int> D(N);
for (int i = 0; i != N; ++i) {
cin >> x;
if ((!i && x) || (i && !x)) {
cout << 0 << endl;
return 0;
... | 1 | 66,151,605 |
#include <bits/stdc++.h>
using namespace std;
vector<int64_t> memo(100, -1);
int64_t Luca(int N) {
if (memo.at(N) !=-1) return memo.at(N);
if (N==1) return 1;
return memo.at(N) = Luca (N-1) + Luca (N-2);
}
int main(){
int N;
cin >> N;
memo.at(0) = 2;
memo.at(1) = 1;
cout << Luca (N) << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | 1 | 17,708,910 |
#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;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<ll> cum(n+1);
cum[0] = 0;
rep(i, n) cum[i+1] = cum[i] + a[i];
sort(cum.begin(), cum.en... | #include <iostream>
#include <map>
using namespace std;
int main() {
int n; cin >> n;
long long A[n];
for (int i = 0; i < n; i++) cin >> A[i];
long long S[n+1] = {};
for (int i = 0; i < n; i++) S[i+1] = S[i] + A[i];
map<long long, long long> nums;
for (int i = 0; i < n + 1; i++) nums[S[i]]++... | 1 | 78,402,477 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> AB(2);
for (int i=0;i<2;++i) cin >> AB[i];
int K; cin >> K;
for (int i=0;i<K;++i){
if (AB[i&1]&1) --AB[i&1];
AB[(i&1)^1]+=AB[i&1]/2;
AB[i&1... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int abs(int a,int b){
int c=max(a,b)-min(a,b);
return c;
}
priority_queue<int, vector<int>, greater<int> > qu;
signed main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a,b,c;
int d=0,e=0;
cin>>a>>b>>c;
for(int i=0;i<c;... | 1 | 75,458,198 |
#include <iostream>
#include <string>
const int MAX_X = 1100;
const int MAX_Y = 1100;
int main() {
std::string X;
std::string Y;
int q;
int answers[160];
std::cin >> q;
int dp[MAX_X][MAX_Y];
for(int p=0; p<q; ++p) {
std::cin >> X;
std::cin >> Y;
for(int i=0; i<MAX_X; ++i) {
for(int j=0; ... | #include <iostream>
using namespace std;
int max(int a, int b) { return a < b ? b : a; }
int lcs(string x, string y) {
int c[1001][1001] = {0};
int m = x.size();
int n = y.size();
int maxl = 0;
x = ' ' + x;
y = ' ' + y;
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
... | 1 | 97,563,718 |
#include<iostream>
#include<vector>
#include<numeric>
using namespace std;
int main()
{
constexpr int kinf=100001;
int N,K;
cin>>N;
vector<int>B;
for (int i = 0; i < N-1; i++)
{
int b;
cin>>b;
B.push_back(b);
}
B.push_back(kinf);
vector<int>A(N);
A[0]=B[0... | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long n,ans=0;
cin>>n;
long long b[n-1],a[n];
f(i,0,n-1){
cin>>b[i];
}
a[0]=b[0];
a[n-1]=b[n-2];
f(i,1,n-1){
if(b[i-1]<b[i]){
a[i]=b[i-1];
}
els... | 1 | 42,502,699 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int h1,m1,h2,m2,k; cin>>h1>>m1>>h2>>m2>>k;
int ans=(h2-h1)*60;
if(m1<=m2) ans+=m2-m1;
else ans-=m1-m2;
cout<<ans-k<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int h1,m1,h2,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int hun = ((h2+24)*60 + m2 - ((h1*60)+m1))%(... | 1 | 83,947,012 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)p... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n;
ll x;
cin>>n>>x;
vector<ll> psum(n+1),... | 1 | 89,202,760 |
#include <bits/stdc++.h>
using namespace std;
int main (){
string A,op,B;
cin >> A >> op >> B;
std::istringstream ss1,ss2;
ss1 =std::istringstream(A);
ss2 =std::istringstream(B);
int a,b;
ss1 >> a;
ss2 >> b;
if (op == "+"){
cout << a + b << endl;
}else{
cout << a ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A = 0, B = 0;
char op = 0;
cin >> A >> op >> B;
int ans = 0;
if (op == '+') {
ans = A+B;
} else {
ans = A-B;
}
cout << ans << endl;
} | 1 | 28,895,655 |
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void a_candy_easy(void) {
int n;
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) sum += i;
cout << sum << endl;
}
int main()
{
a_candy_easy();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n; cin >> n;
cout << n * (n+1) / 2 << endl;
} | 1 | 22,865,828 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using pll = pair<ll, ll>;
... | #include <stdio.h>
#include <string.h>
int input[1001];
int q_sort(int start, int end){
if(end == start) return 0; else{
int p = start;
for(int i = (start + 1); i < end + 1; i++){
if(input[i] < input[p]){
int temp = input[i];
memmove(input + start + 1, input + start, (i - start)*sizeof(int));
i... | 1 | 64,218,235 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll N=1e9;
int n,m;
ll sum;
int main()
{
scanf("%d%d%lld",&n,&m,&sum);
int f=0,flag=0;
while(f<n)
{
if(f<m)
{
printf("%lld ",sum);
}
else
{
if(sum!=N)
print... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k, s;
cin >> n >> k >> s;
for (int i = 0; i < k; i++) {
if (i == 0)cout << s;
else cout << " " << s;
}
for (int i = 0; i < n - k; i++) {
if (s == 1000000000)cout << " " << 99999999;
else cout << " " << 1000000000;
}
} | 1 | 1,255,084 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int>... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int l,r,MOD=2019,min=50000000000,i,j;
cin >> l >> r;
for(i=l;i<r;i++)
{
for(j=i+1;j<=r;j++)
{
if(min>(i%MOD)*(j%MOD)%MOD)
{
min=(i%MOD)*(j%MOD)%MOD;
}
i... | 1 | 25,501,118 |
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define int long long
#define double long double
using namespace std;
const int N = 500777;
int n, t, x, k;
int a[N];
int suf[N];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int A[101010];
ll L[101010], R[1010101];
int main() {
int n;
cin >> n;
rep(i,n+1) cin >> A[i];
L[n] = R[n] = A[n];
... | 1 | 3,272,283 |
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define endl "\n"
#define mod 1000000007
#define mod2 998244353
#define double long double
#define pb push_back
#define swap(x,y) (x^=y^=x^=y)
#define TC int TESTCASE;cin>>TESTCASE;while(TESTCASE--)
#defi... | #include <iostream>
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
int main() {
long long A, B;
cin >> A >> B;
cout << A / GCD(A, B) * B << endl;
} | 1 | 24,678,183 |
#include <cstdio>
#include <cstring>
int main()
{
unsigned int n;
std::scanf("%u", &n);
int g[n][n];
std::memset(g, 0, sizeof(g));
unsigned int u, k, v;
for (auto i = 0u; i < n; ++i) {
std::scanf("%u %u", &u, &k);
for (auto j = 0u; j < k; ++j) {
std::scanf("%u", &v);
g[u-1][v-1] = 1;
... | #include <iostream>
#include <vector>
namespace
{
void OutputRow(int Length, std::vector<int>::const_iterator Begin, std::vector<int>::const_iterator End)
{
std::vector<int>::const_iterator It = Begin;
for(int i = 1; i < Length; ++i){
if(It == End || i < *It){
std::cout << 0;
}else{
std::cout << 1;
++It;... | 1 | 35,059,404 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define deb(name,value) cout <<"->> "<<name<< "= " <<value<<" "
#define frepi(a,b,k) for(int i=a;i<=b;i+=k)
#define frepj(a,b,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> SE... | 1 | 89,378,625 |
#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 vector<int> vec;
typedef vector<vec> mat;
typedef pair<int,int> P;
int main() {
int H, W, N;
cin >> H >> W >> N;
vector<string> fd(H);
for (auto& i : fd) cin >> i;
vec objx(N+1), objy(N+1);
for (int i = 0; i < H; i++) {
for (int j = 0... | 1 | 11,531,331 |
#include<iostream>
#include<algorithm>
#define N 5
using namespace std;
void output_array_int(int*,int,char);
void input_array_int(int*,int);
int main(){
int W,H,x,y,r;
cin>>W>>H>>x>>y>>r;
if(W>=x+r&&x-r>=0&&H>=y+r&&y-r>=0){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
}
void output_array... | #include<stdio.h>
int main(void)
{
int W,H,x,y,r,f;
scanf("%d %d %d %d %d",&W,&H,&x,&y,&r);
f=0;
if(x+r>W)f=1;
if(y+r>H)f=1;
if(r>x)f=1;
if(r>y)f=1;
if(f==0) {
printf("Yes\n");
}
else {
printf("No\n");
}
return 0;
} | 1 | 52,952,164 |
#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()
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> n(4), x{1, 4, 7, 9};
rep(i, 4) cin >> n.at(i);
sort(all(n));
cout << (n == x ? "YES" : "NO") ... | #include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <s... | 1 | 9,686,595 |
#include<bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using ll=long long;
#define inf 1e16
#define MAX 100005
#define mod 998244353
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%lld %lld %lld"... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
int main()
{
int N, K;
cin >> N >> K;
if (K > (N - 1) * (N - 2) / 2)
{
cout << -1 << endl;
return... | 1 | 38,300,387 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<cmath>
using namespace std;
void koch_curve(const int n, const pair<double, double>& begin, const pair<double, double>& end){
if(n == 0){
return;
}
pair<double, double> p1, p2, p3;
p1.first = (2.0 * begin.first + end.first) / 3;
... | #include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;
const double PI = 3.1415926535;
const double th = 60 * PI / 180;
class p
{
public:
double x;
double y;
void print();
};
void p::print()
{
printf("%.8f %.8f\n", x, y);
}
void koch(int d, p p1, p p2)
{
if (d == 0)return;
p s, u, t;
s.x = (2... | 1 | 4,343,112 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
struct union_find{
vector<int> par;
vector<int> rank;
vector<int> siz;
union_find(int N) : par(N), ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n, m;
vector <int> v, adj[N];
set <int> p[N];
bool mark[N];
void dfs(int u, int k) {
mark[u] = true;
p[k].insert(u);
for (auto x: adj[u])
if (!mark[x])
dfs(x, k);
}
int main() {
ios_base :: sync_with_stdio(false), ... | 1 | 16,086,571 |
#include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespac... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
string s, t;
cin >> s >> t;
t.pop_back();
cout << (s == t? "Yes" : "No") << endl;
return 0;
} | 1 | 35,832,833 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int x, n;
cin >> x >> n;
vector<int> a(n);
map<int,int> m;
for (int& y: a) {
cin >> y;
++m[y-x];
}
for (int i = 0; i < n; ++i) {
if (m.find(-i) == m.end()) {
cout << -i + x << endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int X, N;
cin >> X >> N;
vector<int> p(N);
rep(i, N) cin >> p[i];
if (N == 0) {
cout << X << endl;
return 0;
}
for (int i = 0; i <= N; i++) {
auto it2 = find(p.... | 1 | 61,438,311 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
long long d[N];
vector<pair<int,int>> adj[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for(int i = 0; i < n-1; i++) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
adj[a].push_back(make_pair(b, c));
adj[b... | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | 1 | 21,220,393 |
#include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n)... | #include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#define FOR(i, a, b) for(decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long long l... | 1 | 94,376,898 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int p,q,r;
vector<int> a(3);
rep(i,3){
cin >> a.at(i);
}
sort(a.begin(),a.end());
cout << a.at(0) + a.at(1) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
vector <int> vec(3);
scanf("%d %d %d", &vec[0], &vec[1], &vec[2]);
sort(vec.begin(), vec.end());
printf("%d\n", vec[0] + vec[1]);
return 0;
} | 1 | 98,797,293 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | 1 | 85,941,861 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll A[N],B[N];
ll num = 0;
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
for (int i = N-1; i >= 0; i--) {
num += (B[i] - ((num + A[i]) % B[i])) % B... | #include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
rep(i,n) cin >> a.at(i) >> b.at(i);
ll ans=0;
rep(i,n){
int j = n-1-i;
int r = (a.at(j)+ans)%b.at(j);
... | 1 | 39,619,723 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define pb push_back
#define f first
#define se second
using namespace std;
const int N = 5e5 + 123;
ll m, k, pw[30];
bool is[N];
vector <ll> a, b;
int main() {
cin >> m >> k;
ll t = 1;
... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef l... | 1 | 51,436,169 |
#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;
set<ll> s;
ll a;
rep(i,n) {
cin >> a;
if (s.find(a) != s.end()) {
cout << "NO" << endl;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n;
cin >> n;
set<int> st;
rep(i,n){
int a;
cin >> a;
st.insert(a);
}
if(st.size()!=n){
cout << "NO" << endl;
}
else cout << "YES" <<... | 1 | 71,334,492 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#define all(x) x.begin(), x.end()
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
int n, k; cin >>... | #include <iostream>
#include <vector>
#include <list>
using namespace std;
const int N = 105;
int main() {
int n, t;
cin >> n >> t;
list<int> L;
list<int>::iterator it, min;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
L.push_back(x);
}
vector<int>v;
while (v.size() != t)
{
min = L.begin();
for... | 1 | 5,911,253 |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string>
using namespace std;
int main(){
int n;
int i,j,k;
int era;
while(cin >> n){
int count = 0;
int S[n+1];
for(i=2 ; i<n+1 ; i++){
S[i] = i;
}
for(i=2 ; i<(
(int)sqrt(n)+1) ; i++){
if(S[i] !=... | #include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int eratos(int n){
bool isprime[n + 1];
for(int i = 0; i <= n; i++)isprime[i] = true;
isprime[0] = isprime[1] = false;
for(int i = 2; i * i <= n; i++){
if(isprime[i]){
int j = i + i;
while(j <= n){
isprime[j... | 1 | 71,104,782 |
#include <bits/stdc++.h>
using namespace std;
#define long long long
#define INF ((long) 2e18)
#define MOD ((long) (1e9 + 7))
#define umap unordered_map
int main()
{
ios::sync_with_stdio(true); cin.tie(0); cout.tie(0);
long t = 1;
while (t--) {
long n, a, b;
cin >> n >> a >> b;
long ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
long long t = n / (a + b);
long long last = n % (a + b);
long long exb = last;
if (exb > a) exb = a;
cout << t * a + exb << endl;
} | 1 | 16,880,257 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
ll gcd(ll a,ll b)
{
if(a%b==0)
{
return(b);
}
else
{
return(gcd(b,a%b));
}
}
ll lcm(ll a,ll b)
{
return a/gcd(a,b)*b;
}
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
using P = pair<ll, ll>;
ll gcd(ll m, ll n)
{
if (m < n)
{
ll tmp = m;
m = n;
n = tmp;
}
while (1)
{
ll mod = ... | 1 | 60,588,899 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for... | #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... | 1 | 31,742,443 |
#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++)
#define fi first
#define se second
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>... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( co... | 1 | 10,114,120 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long N;
cin >> N;
long ans = 100000000;
double d = sqrt(N) + 1;
for (long i = 1; i < d ; i++) {
long a = i;
if (N % a != 0){
continue;
}
long b = N / a;
string s_a = to_string(... | #include <bits/stdc++.h>
using namespace std;
int digitcnt(long long a){
int cnt=0;
while(a>0){
a/=10;
cnt++;
}
return cnt;
}
int main(){
long long n, i, b, ans=10000000;
cin >> n;
for(i=1;i<=sqrt(n);i++){
long long f, digcnta, digcntb;
if(n%i==0){
... | 1 | 65,212,697 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
static const int N = 1000;
int main()
{
int n, p[N + 1];
vector<vector<int>> m(N + 1, vector<int>(N + 1));
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> p[i - 1] >> p[i];
}
for (int i = 1; i <= n; i++)
... | #include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define INFTY (1<<30)
int m[101][101];
int p[101];
int n;
void multiplyMatrix(){
int i, l, j, k;
for(i = 1;i <= n;i++)
m[i][i] = 0;
for(l = 2;l <= n;l++){
for(i = 1;i <= n - l + 1;i++){
j = i + l - 1;
m[i][j] = INFTY;
for(k = i;... | 1 | 14,098,386 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
int main(){
int n;
std::cin >> n;
std::vector<int> a(n), orderd(n);
for(int i = 0; i < n; i++){
std::cin >> a[i];
orderd[i] = a[i];
}
std::sort(orderd.begin(), orderd.end());
if(orderd[n - 1] == orderd[n... | #include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a[n], b[n];... | 1 | 32,640,233 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int r, g;
cin >> r >> g;
cout << r * r - g << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int masu;
int shiromasu,kuromasu=0;
cin >> masu ;
cin >> shiromasu ;
kuromasu = (masu*masu)-shiromasu;
cout << kuromasu << endl;
} | 1 | 27,428,259 |
#include <iostream>
#include <vector>
#define MAX_N 100000
#define pb push_back
using namespace std;
int par[MAX_N];
void init(int n){
for(int i=0;i<n;i++){
par[i]=i;
}
}
int root(int x){
if(par[x]==x){
return x;
}
else{
return par[x]=root(par[x]);
}
}
bool same(int x,int y){
return root(x)==root(y);
}
voi... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define PB push_back
#define MP make_pair
#define F first
#defin... | 1 | 65,814,879 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a%b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main(){
int a, b;
cin >> a >> b;
if(a + b == 15){
cout << '+... | 1 | 50,866,749 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | 1 | 99,982,971 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
string T;
cin >> S >> T;
sort(S.begin(), S.end());
sort(T.begin(), T.end());
reverse(T.begin(), T.end());
if(S < T) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <=... | 1 | 63,521,313 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,X;
cin >> A >> B >> X;
if(A+B<X){
cout << "NO" << endl;
return 0;
}
if(A>X){
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int a,b,x;
cin>>a>>b>>x;
if (a<=x&&x<=a+b) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | 1 | 69,084,187 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x,y;cin >> x >> y;
if(abs(x-y)<=1) cout << "Brown" << end... | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> E;
const LL MOD = 1000000007LL;
int main() {
LL X, Y;
cin >> X >> Y;
if (abs(X - Y) <= 1) {
cout << "Brown" << endl;
}
else {
cout << "Alice" << endl;
}
} | 1 | 13,426,246 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>>p(n);
for(int i=0;i<n;i++){
cin >> p.at(i).first >> p.at(i).second;
}
sort(p.begin(),p.end());
ll ans = 0;
for(int i=0;i<n;i... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<pair<ll, ll> > drink(n);
REP(i, n) {
ll a, b;
cin >> a >> b;
drink[i] =... | 1 | 24,436,033 |
#include <iostream>
using namespace std;
int main() {
int sum , m;
cin >> sum >> m;
int cs = 0;
for(int i = 0 ; i < m ; i++){
int y;
cin >> y;
cs+= y;
}
cout << max(sum - cs , -1) << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N;
cin >> M;
vector<int> A(M);
int sum = 0;
for (int i=0; i<M; i++) {
cin >> A[i];
sum += A[i];
}
if (N < sum) {
cout << -1 << endl;
} else {
cout << N - sum << endl;
}
} | 1 | 68,606,165 |
#include <iostream>
#include <vector>
int main(){
std::vector<int> in_train;
std::vector<int> out_train;
int a;
while(std::cin >> a){
if(a == -1){
break;
}else if(a > 0){
in_train.push_back(a);
}else if(a == 0){
int e = in_train.back();
out_train.push_back(e);
in_trai... | #include<stdio.h>
int i = 0, result;
int train[100];
int outtrain[100];
void push(int k){
train[i] = k;
i++;
}
void pop(int train[]){
int a, check = 0;
for(a = i - 1; a >= 0; a--){
if(train[a] != 0){
result = train[a];
train[a] = 0;
check += 1;
}
if(check != 0)break;
}
}
int main(){
int k, cnt = 0;... | 1 | 74,813,090 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
while(getline(cin,s),s!="."){
stack<char> a;
bool flag=false;
for(int i=0;i<s.size();++i){
if(s[i]=='(' || s[i]=='[') a.push(s[i]);
else if(s[i]==')')
if(a.empty() || a.top()!='(') flag=true;
else a.pop();
... | #include<iostream>
#include<string>
#include<stack>
using namespace std;
string s;
void solve(){
stack<char> T;
for(int i=0;i<s.size();i++){
if(s[i]=='(' || s[i]=='[')
T.push(s[i]);
if(s[i]==')'){
if(T.empty()){cout<<"no"<<endl;return;}
if(T.top()=='(') T.pop();
else{cout<<"no"<<endl;return;}
}
if... | 1 | 3,628,816 |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
int n,k,a;
cin>>n>>k;
a=n%k;
cout<<a<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
if (K == 1){
cout << 0 << endl;
}
else if(K == N){
cout << 0 << endl;
}
else {
cout << N - K << endl;
}
} | 1 | 95,844,022 |
#include <cstdio>
#include <cstdint>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
bool f(std::vector<intmax_t>& a) {
std::sort(a.rbegin(), a.rend());
intmax_t n = a.size();
a[0] -= n;
for (size_t i = 1; i < a.size(); ++i) ++a[i];
std::sort(a.begin(), a.end());
return !std::al... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int N; std::cin >> N;
std::vector<int64_t> a(N);
for(int i = 0; i < N; ++... | 1 | 99,682,860 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
bool isSameDigits(int x) {
int left = x % 10;
bool isSame = true;
while (x > 0) {
if (left != x % 10) isSame = false;
x /=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_boun... | 1 | 34,258,941 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#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;
#define forn(i, n) for (int (i) = 0; (i) != ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,i,c;
scanf("%d",&a);
if(a==4||a==6||a==9||a==14||a==21||a==22||a==25||a==26)
{
printf("2\n");
}
else if(a==8||a==12||a==18||a==20||a==27)
{
printf("5\n");
}
else if(a==28||a==30)
{
printf("4... | 1 | 23,193,336 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int kaunto = 0;
cin >> a >> b;
for (int i = 0; i < 10000000; i++) {
if (a < b) {
cout << a;
kaunto++;
if (kaunto >= b) {
break;
}
}
if (a > b) {
cout << b;
kaunto++;
if (kaunto >= a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int N = 0;
for (int i = 0; i < max(a, b); i++) {
N *= 10;
N += min(a, b);
}
cout << N << endl;
} | 1 | 77,546,909 |
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm>
#include <math.h>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll mod = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace... | #include "bits/stdc++.h"
using namespace std;
int main() {
double n, m, d;
cin >> n >> m >> d;
double ans = (m - 1.0)*(n - d);
if (d != 0) {
ans *= 2.0;
}
ans /= n;
ans /= n;
printf("%.10f\n", ans);
} | 1 | 529,119 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,count_1,count_2,count_3,count_4;
bool A = true;
count_1=0;
count_2=0;
count_3=0;
count_4=0;
for(int i =0; i<6;i++){
cin >>a;
if(a==1){
count_1++;
}
else if(a==2){
count_2++;
}
else if(a==3){
count_3++;
}
else if(a==4){
coun... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int a,memo[4]={};
for (int i = 0; i < 6; ++i)
{
cin>>a;--a;
++memo[a];
}
int cnt=0;
for (int i = 0; i < 4; ++i)
{
if (memo[i]%2==1)
{
++cnt;
}
}
if (cnt==0||cnt==2)
{
cout<<"YES\n";
}
else
{
cout<<"NO\n"... | 1 | 16,694,906 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
char op;
cin >> A >> op >> B;
if(op == '+') A += B;
if(op == '-') A -= B;
cout << A << endl;
} | #include <cstdio>
int main()
{
int a,b;
char op;
scanf("%d %c %d",&a, &op, &b);
if(op == '-')
{
printf("%d",a-b);
}
else
{
printf("%d",a+b);
}
} | 1 | 16,337,845 |
#include<iostream>
using namespace std;
int main()
{
int n, a, b, c;
cin >> n;
a = n / 100;
b = (n / 10) % 10;
c = n % 10;
if(a == 1)
a = 9;
else a = 1;
if(b == 1)
b = 9;
else b = 1;
if(c == 1)
c = 9;
else c = 1;
cout << 100 * a + 10 * b + c;
return 0;
} | #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... | 1 | 47,770,124 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vector<int> p(a),q(b),r(c);
rep(i,a) cin>>p[i];
rep(i,b) ... | #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>;
ll x = 1e9 + 7;
const int INF = 1001001001;
int main() {
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<ll> p(a), q(b), r(c);
rep(i,a) cin >> p[i];
rep(i,b) cin... | 1 | 40,879,452 |
#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()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
int main() {
ll a,b,c,k;
cin>>a>>b>>c>>k;
if(k%2==0) cout<<a-b<<endl;
else cout<<b-a<<endl;
return 0;
} | 1 | 41,166,566 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, M;
vector<ll> A;
vector<ll> sum;
int main() {
cin >> N >> M;
A.resize(N);
rep(i, N) cin >> A[i];
sum.r... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 1 | 37,578,730 |
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
string s1,s2;
cin >> s1 >> s2;
reverse(s2.begin(), s2.end());
if(s1 == s2) cout << "YES" << endl;
else cout << "NO" << en... | 1 | 42,452,129 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int a;
for(int i=0; i<m; i++){
cin>>a;
n -= a;
}
if(n < 0){
cout<<"-1"<<endl;
}else{
cout<<n<<endl;
}
} | #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 ALL(n) begin(n),end(n)
using ll = long long;
int main()
{
int n,m;
cin >> n >> m;
int sum = 0;
rep(i,m) {
int a;
cin >>a;
sum += a;
}
... | 1 | 85,401,879 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int A,B,K;
cin >> A >> B >> K;
rep(i,K)
if(i%2) {
if(B%2)
--B;
B /= 2;
A += B;
} else {
if(A%2)
--A;
... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pi... | 1 | 81,592,776 |
#include <stdio.h>
int main() {
char str[19];
scanf("%[^\n]", str);
for (int i=0; str[i] != '\0'; i++){
if (str[i] >= 'a' && str[i] <= 'z'){
printf("%c", str[i]);
}
else printf(" ");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = 1000000007 ;
bool prime(ll n)
{
bool cnt = 0;
for(ll i=2; i*i<=n; i++)
{
if(n%i==0)
{
return 0;
}
}
return 1 ;
}
int main()
{
string s;
getline(cin,s);
for(int i=0; i<s.size(); i++)
{
... | 1 | 98,533,736 |
#include <iostream>
#include <algorithm>
#include <string>
#define INF 100000
using namespace std;
int dp[1000][1000];
string X, Y;
int lcs(int i,int j){
if(i < 0 || j < 0) return 0;
if(dp[i][j] != INF) return dp[i][j];
if(X[i] == Y[j]){
dp[i][j] = lcs(i-1, j-1) + 1;
return dp[i][j];
} else {
dp[i][... | #include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define ... | 1 | 79,809,152 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
class... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
signed main(void)
{
int n, m, K;
cin >> n >> m >> K;
rep(k, n)
{
rep(l, m)
{
if (k * (m - l) + (n - k) * l == K)
{
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | 1 | 71,595,686 |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<double, double> pdd;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<vi> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a == b && b == c && c == a) {
puts("Yes");
} else {
puts("No");
}
return 0;
} | 1 | 84,885,819 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.