code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main(){
int n, t = 100000;
cin >> n;
for( int i = 0; i < n; ++i){
t = 1.05 * t;
t = (t/1000)*1000 + ((t % 1000 != 0) ? 1000 : 0);
}
cout << t << "\n";
return 0;
} | #include<stdio.h>
#include<string.h>
int main()
{
char a[51], b[51];
scanf("%s %s", a,b);
int i,l=strlen(b);
for(i=0; i<l; i++)
printf("%c%c", a[i], b[i]);
if(strlen(a)==l+1)
printf("%c", a[i]);
return 0;
} | 0 | 24,644,441 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define mp make_pair
#define endl '\n'
#define PI acos(-1)
typedef tree<int... | #include<iostream>
#include <climits>
#include<vector>
#include<cstring>
#define mod 1000000007
using namespace std;
long long int Paths(char arr[][1001], int r, int c){
long long int dp[r+1][c+1];
for(int i = 0; i <= r; i++){
for(int j = 0; j <= c; j++){
if(i == 0 || j == 0 || arr[i][j] == '#'){
dp[i][j] = ... | 0 | 74,601,902 |
#pragma warning(disable:4996)
#include <stdio.h>
int main()
{
double d, t, s;
scanf("%lf %lf %lf", &d, &t, &s);
if (d / s > t) printf("No");
else printf("Yes");
} | #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<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include<iomanip>
#include<utility>
usi... | 0 | 25,212,705 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long long ll;
double T,X;
int main(){
cin>>T>>X;
cout<<setprecision(10)<<T/... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<list>
#include<string>
#include<algorithm>
#define ll long long
using namespace std;
struct edge {
int to;
ll cost;
};
vector<edge> tree[100010];
ll cost_k[100010];
void dfs(int v,int par,ll dist){
cost_k[v] = dist;
for(int i=0;i<(int)... | 0 | 72,729,103 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include<stdio.h>
int main(){
int m,f,r,ten;
while(1){
scanf("%d %d %d",&m,&f,&r);
if(m==-1 && f==-1 && r==-1){
break;
}
ten = m+f;
if(m == -1 || f == -1){
printf("F\n");
}else if(ten >= 80){
printf("A\n");
}else if(ten>=65 && ten<80){
printf("B\n");
}else if(ten>=50 && ten<65){
printf("C\n");
}els... | 0 | 34,031,658 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
cout << ((N-N%(A+B))/(A+B))*A+min((N%(A+B)),A) << endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 1,464,990 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n=10;
vector<int> v(n);
for(int i=0;i<n;i++)cin >> v[i];
sort(v.begin(),v.end(),greater<int>());
cout << v[0] << endl << v[1] << endl << v[2] << endl;
} | #include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int i;
int counter = 0;
for (i = a; i <= b; i++) {
if (c % i == 0) counter++;
}
cout << counter << "\n";
return 0;
} | 0 | 85,972,165 |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
int main () {
int N;
cin >> N;
vector<LL>A(N);
for (int i = 0; i < N; i ++) cin >> A[i];
sort(A.begin(), A.end());
vector<LL>sum(N + 1);
sum[0] = A[0];
for (int i = 1; i < N; i ++) sum[i] = sum[i - 1] + A[i];
sum[N] = 1e16;
int mi = 0... | #include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
int main() {
vector<int> nPrimes;
vector<bool> isPrime;
vector<int> inputs;
int maxN, sqrtMax, n;
maxN = 0;
while(scanf("%d", &n) != EOF) {
if(n > maxN) maxN = n;
inputs.push_back(n);
}
sqrtMax = sqrt(maxN-1) + 1;
isPrime.resize(maxN, t... | 0 | 26,268,166 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long s = 100000;
for (int i = 0; i<n; i++) {
s = s * 1.05;
int s1 = s % 1000;
if (s1 != 0) {
s = s - s1 + 1000;
}
}
cout << s << "\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define rep(X,N) for(ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define divceil(A, B) ((A + (B - 1)) / B)
#define MODN 1000000007
#define ALL(V) (V).begin(),(V).end()
#define CERR if(false) cerr
using namespace std;
int m... | 0 | 50,349,001 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define sint int32_t
#define int long long int
#define all(v) v.begin() , v.end()
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define f... | #include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.fi... | 0 | 88,016,946 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<bits/stdc++.h>
#define fi first
#define se second
using namespace std; typedef long long ll;
const int MAXN = 10 + 1e5;
const ll oo = 1 + 1e18, mod = 7 + 1e9;
int n, a[MAXN][5], f[MAXN][5];
int main(){
#define TASK "ABC"
#ifndef ONLINE_JUDGE
freopen(TASK".inp","r",stdin),freopen(TASK".out","w",stdout);
... | 0 | 18,294,649 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
int main() {
int n; cin >> n;
vector<int> T(n), X(n), Y(n);
loop(i,0,n) cin >> T[i] >> X[i] >> Y[i];
int prev_t = 0, prev_x = 0, prev_y = 0;
loop(i,0,n) {
int t =... | #include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n; cin >> n;
vector<int> v(n), l(n/2), r(n/2);
map<int, int> m_l, m_r;
rep(i, n) {
cin >> v[i];
if (i%2 == 0) {
m_l[v[i]]++;
}
... | 0 | 98,635,415 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans=0,m=0,b;
for(int i=0;i<n;i++){
cin >> b;
if(b>=m)
ans++;
m=max(m,b);
}
cout << ans << 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;
int main(void){
int n;
cin>>n;
vector<ll> v(n+1);
rep(i, n+1){
cin>>v[i];
}
vector<pair<ll, ll> > minmax(n+1);
minmax[n] = make_pair(v[n], v[n]);
for(int i = n-1;i>=0;i--)... | 0 | 46,744,938 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = 1e9+7;
string s[600];
bool sym[600][600];
vector<P> v[2];
int main()
{
int n;
ll ans=0;
cin>>n;
for(i... | 0 | 90,269,926 |
#include<stdio.h>
int main()
{
int a,b,s;
scanf("%d%d",&a,&b);
s=a*b;
printf("%d\n",(s-(1*a+1*b)+1));
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep... | 0 | 49,154,870 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int s;
cin>>s;
int cnt=1;
int n=s;
while(!(n==4||n==2||n==1))
{
if(n%2)n=3*n+1;
else n/=2;
cnt++;
}
cnt+=3;
cout<<cnt<<"\n";
return 0;
} | 0 | 86,936,686 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<(double)a/b;
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>d(n),k(n);
map<int,int>values;
for(int i=0;i<n;i++){
cin>>d[i];
k[i]=d[i];
values[d[i]]++;
}
sort(d.begi... | 0 | 85,896,784 |
#include <bits/stdc++.h>
using namespace std;
int main(){
while (1){
int n;
cin >> n;
if (n == 0){
break;
}
vector<string> f(n);
for (int i = 0; i < n; i++){
cin >> f[i];
}
int ans = 0;
for (int i = 0; i < n - 1; i++){
if (f[i][0] != f[i + 1][0] && f[i][1] == f[i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll MOD = 1e9+7;
ll LLINF = 1LL << 60;
int INF = INT_MAX;
int main(){
ll a,b; cin>>a>>b; b++;
ll waru=2;
ll bit=0LL;
while(b/(waru/2)>... | 0 | 2,844,089 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long LL;
LL n,l,id = -1;
LL a[200005];
int main(){
ios::sync_with_stdio(false);
cin >> n >> l;
for(LL i = 1;i <= n;i ++) cin >> a[i];
for(LL i = 1;i < n;i ++) if(a[i] + a[i + 1] >= l) id = i;
if(id == -1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll rec(ll n,ll x){
if (n == 0){
return 1;
}
ll sou = pow(2,n+1) -3;
ll pat = pow(2,n) -1;
if (x == 1){
return 0;
}
else if (x <= sou +1){
return rec(n-1,x-1);
}
else if (x == sou +2){
... | 0 | 80,351,787 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 34,625,844 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,y;cin>>n>>y;
y /= 1000;
for(int i=0;i<=n;i++) {
for(int j=0;j<=n-i;j++) {
int x = (i*10) + (j*5) + (n-i-j);
if(x == y) {
cout<<i<<" "<<j<<" "<<n-i-j<<"\n";
r... | #include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
using namespace std;
int main()
{
int h, n;
cin >> h >> n;
vector<int>a(n);
vector<int>b(n);
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
vector<vector<int>> dp(n + 1, vector<int>(h + 100100));
for (int i = 0; i... | 0 | 79,333,279 |
#include <bits/stdc++.h>
using namespace std;
int M;
int main() {
cin >> M;
long long total_n=0LL;
long long total_q=0LL;
for (int i=0;i<M;i++) {
long long d,c;cin >> d >> c;
total_n+=c;
total_q+=c*d;
}
cout << total_n-1L+(total_q-1L)/9L << endl;
} | #include <stdio.h>
int main(void)
{
int i,j;
int m,f,r,sum;
int a[100][3] ={0};
for(i=0;;i++){
scanf("%d %d %d",&m,&f,&r);
if(m == -1 && f == -1 && r == -1)
{
break;
}
else
{
a[i][0] = m;
a[i][1] = f;
a[i][2]... | 0 | 23,142,092 |
#include <bits/stdc++.h>
using namespace std;
#define intt long long
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N = 100005;
int n;
int a[N];
int main() {
FAST;
int n, m;
cin >> n >> m;
if (n > m) swap(n, m);
if (n == 1 && m == 1) {
cout << 1 << '\n';
}
else if (n == 1 && m !=... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define allrev(x) (x).rbegin(), (x).rend()
#define pb push_back
#define pf push_front
#define fori(i, a, n) for(int i = a; i < n; ++i)
#define MAX(x) (*max_element(all(x)))
#define M... | 0 | 42,469,845 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e5+5;
const int INF=0x3f3f3f3f;
int flag[N];
LL Cnt[N];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
LL n,x,mod;
cin>>n>>x>>mod;
for(int i=1; i<=n; ++i) {
int tmp=x%m... | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 1000000007
#define LINF 6000000000000000007LL
#define ll long long
using namespace std;
signed main(){
int n,k;
cin>>n>>k;
vector< pair<int,int> > a;
for(int i=0;i<n;i++){
int x,y;
cin>>x>>y;
a.pb(mp(x,y));
}... | 0 | 83,843,250 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <queue>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main(){
long long x,y;
... | #include<iostream>
using namespace std;
int main(){
string s;
cin>>s;
int count1=0,count0=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='1'){
count1++;
}
else
{
count0++;
}
}
cout<<2*min(count1,count0);
} | 0 | 50,382,215 |
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,tune=native")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vec... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s, t;
cin >> s >> t;
vector<int> count(26);
for (auto c : s)
{
count.at(c - 'a')++;
}
string sp = "";
for (char c = 'a'; c <= 'z'; c++)
{
for (int i = 0; i < count.at(c - 'a'); i++)
{
... | 0 | 29,995,497 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, n , m =0;
cin>>n>>m;
int mi= n;
int ma=-1;
for(int i=0; i<m ; i++){
cin>>l>>r;
if(ma < l)ma= l;
if(mi > r)mi=r;
}
cout<<max(mi-ma+1,0);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using namespace std;
int main(){
int k;
cin >> k;
vector<int> v(33);
v[1]=1;
v[2]=1;
v[3]=1;
v[4]=2;
v[5]=1;
v[6]=2;
v[7]=1;
v[8]=5;
v[9]=2;
v[10]=2;
v[11]=1;
v[12]=5;
... | 0 | 71,242,129 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
int keta(ll n){int ans=0;while(n>0){n /= 10; ans++;}return ans;}
ll _pow(ll a,ll b){ll ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int cnt1 = 0, cnt2 = 0, cnt3 = 0;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
if (a <= A) {
cnt1++;
} else if (a <= B) {
cnt2++;
} else {
... | 0 | 76,059,305 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using ... | 0 | 59,599,957 |
#include <iostream>
#include <string>
using namespace std;
bool used_H[100];
bool used_W[100];
int main(void){
int H,W;
cin >> H >> W;
string a[H];
for(int i=0;i<H;i++){
cin >> a[i];
}
int count = 0;
for(int i=0;i<H;i++){
count = 0;
for(int j=0;j<W;j++){
i... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#incl... | 0 | 10,233,657 |
#include <bits/stdc++.h>
#define PI acos(-1.0)
#define eps 1e-9
#define ll long long
#define ull unsigned long long
#define nl printf("\n")
#define sf scanf
#define pf printf
#define INF (ll)1e15
#define mod 1000000007
using namespace std;
const int S=223456;
int main()
{
#ifndef ONLINE_JUDGE
#endif
int n,k... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
bool compPair(const pair<int, int>& arg1, const pair<int, int>& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a =... | 0 | 93,542,325 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, m, v, p;
bool check(int *a, int i) {
if (a[i] + m < a[n-p]) return false;
else if (v <= i+p) return true;
long long amt = (long long)m * (v - (i + p));
for (int j = i+1; j <= n-p; j++) {
if (a[i] + m < a[j]) return false;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,d,r;
cin>>n>>d;
int a[n][d];
for(int i=0;i<n;i++)
{
for(int j=0;j<d;j++)
{
cin>>a[i][j];
}
}
int ans=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
int ... | 0 | 4,141,590 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int A, B, C;
int ans;
cin >> A >> B >> C;
if(A == B)
ans = C;
if(A == C)
ans = B;
if(B == C)
ans = A;
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main()
{
string s;
ll k;
cin >> s >> k;
int n = s.size();
int oneLen = 0;
rep (i, n)
if (s[i] == '1')
oneLen++;
else
break;
cout << ... | 0 | 16,858,325 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int>a(n);
vector<int>p(n);
vector<int>q(n);
rep(i, n) cin >> p[i];
... | #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <memory.h>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include ... | 0 | 32,050,310 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#include <regex>
#include <initializer_list>
#include <deque>
#define DBL_MIN 0.000000000000... | 0 | 85,012,393 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int>X(N);
vector<int>Y(N);
for (int i = 0; i < N; ++i) {
cin >> X[i] >> Y[i];
}
vector<int>copyX = X;
vector<int>copyY = Y;
sort(copyX.begin(),copyX.end());
sort(copyY.begin(),copyY.end());
long long ans = (long lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t sum=0;
int64_t line=0;
int64_t amount;
int64_t Ans=0;
int flag=0;
cin>>N;
vector<int64_t> A(N+1);
for(int i=0;i<N+1;i++){
cin>>A.at(i);
sum+=A.at(i);
}
vector<vector<int64_t>> value(N+1,vector<int64_t>(3,0));
if(... | 0 | 2,467,121 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
#pragma warning(disable: 4996)
#define _sort(v,type,order) do { sort(v.begin(),v.end(),order<type>()); } while(0)
#define _sum(v,default_value) ac... | #include <bits/stdc++.h>
using namespace std;
struct Unionfind {
vector<int> par;
Unionfind(int n = 1) : par(n, -1) {}
int root(int x) {
if (par[x] < 0) return x;
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool uni(int x, int y) {
x = root(x);
y ... | 0 | 74,853,404 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define BIT(X, i) ((X>>i)&1)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#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, T b) { if (a < b) { ... | 0 | 64,578,537 |
#include <bits/stdc++.h>
using namespace std;
int main(){int n,a,b,c,x,y,z,p,q,r; cin>>n>>a>>b>>c; p=a,q=b,r=c,n--; while(n--){cin>>x>>y>>z; a=x+max(q,r),b=y+max(r,p),c=z+max(p,q),p=a,q=b,r=c;}; cout<<max({a,b,c});} | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
int main()
{
static long i,j,k,l;
long n;
long cnt = 0;
long left,right,mid;
long ans = 0;
int a,b;
static int H[10000];
static int W[10000];
for(i = 0;; i++) {
scanf("%d %d",&H[i],&W[i]);
if(H[i] == 0)
... | 0 | 45,175,081 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main() {
int x, n;
cin >> x >> n;
if (n == 0) {
cout << x << endl;
} else {
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int closest,... | #include <bits/stdc++.h>
#define fin ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ii pair<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fore(i,a,b) for(int i = a;i < b; i+= 1)
#de... | 0 | 14,063,492 |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define se second
#define fi first
#define ll long long
#define INF INT_MAX
#define mod 1000000007
#define chutiyaap ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
ll pw(ll a, ll b) {
if (b == 0) return 1;
ll t... | #include<iostream>
#include<vector>
using namespace std;
class Dice{
vector<int> x;
void advance_vertical(){
advance(0, 1, 5, 4);
}
void advance_horizontal(){
advance(0, 3, 5, 2);
}
void advance_rotation(){
advance(1, 2, 4, 3);
}
void advance(int i, int j, int... | 0 | 27,237,031 |
#define _GLIBCXX_DEBUG
#define MIN_MAX 1200001
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main(void){
int n, m, x;
cin >> n >> m >> x;
vi C(n);
vvi A(n, vi(m));
for(int i=0; i<n; i++){
cin >> C[i];
for(int &a : A[i])... | #include<queue>
#include<string>
#include<iostream>
using namespace std;
int main(){
string cmd;
priority_queue<int> Q;
while(cin>>cmd&&cmd!="end"){
if(cmd=="insert"){
int m;
cin>>m;
Q.push(m);
}
else if (cmd=="extract"){
int n=Q.top();... | 0 | 35,165,261 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,M;
cin >> N >>M;
vector<ll> X(N);
for(int i=0;i<M;i++){
ll a,b;
cin >> a >>b;
--a;--b;
if(a!=0){
X[a]++;
}
if(b!=0){
X[b]++;
}
}
for... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n)
cin >> a[i];
ll ans = 1e18;
for(int bit... | 0 | 44,861,489 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
vector<int> v;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long a=0,b,c,d=0,e=0,f=0,g=0,i;
string s;
for(int n=0;n<4;n++){
cin >>s[n];
if(s[n]=='1') d++;
if(s[n]=='9') e++;
if(s[n]=='7')... | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), cout << fixed << setprecision(20);
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) rep... | 0 | 93,476,889 |
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <ctime>
#define ll long long
#define vecvec(h, w, name) vector<vector<ll>> name(h, vector<ll>(w));
#define rep(init, i, n) for (ll i = init; i < (n); i++)
#define rev(s) reverse(s.begin(), s.end())
#define sor(v) sort... | #include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
#define int long long
int n, a[100005], res, p, x;
main() {
DAU
cin >> n;
++n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
for (int i = 1; i < n; ++i) {
... | 0 | 81,377,113 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
if (str[0] != 'A') {
cout << "WA" << endl;
return 0;
}
int index;
int flag = 0;
for (int i = 2; i < str.size() - 1; i++) {
if (str[i] == 'C') {
flag = 1;
index =... | #include <stdio.h>
#include <math.h>
struct dot{
double x;
double y;
};
void koch(struct dot d1, struct dot d2, int n){
if(n == 0){
return;
}
struct dot s;
s.x = d1.x * 2 / 3 + d2.x * 1 / 3;
s.y = d1.y * 2 / 3 + d2.y * 1 / 3;
struct dot t;
t.x = d1.x * 1 / 3 + d2.x * 2 / 3;
... | 0 | 4,016,920 |
#include <bits/stdc++.h>
using namespace std;
#define N 100005
int d[N], n, cnt[N], mx;
const int mod = 998244353;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i ++) {
scanf("%d", &d[i]);
cnt[d[i]] ++;
mx = max(mx, d[i]);
}
if (d[1] != 0) return puts("0"), 0;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define int ll
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define REVALL(vec) (vec).rbegin(), (vec).rend()
#define deb... | 0 | 93,003,451 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n, m;
cin >> n >> m;
priority_... | 0 | 40,767,121 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main()
{
int i,j;
for (i=0 ,j=1;i<10000 ; i++)
{cin>>j;
if(j==0) break;
cout <<"Case "<<i+1<<": "<<j<<endl;}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int main(){
... | 0 | 47,156,955 |
#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 ... | #include<bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define N 101
int main(void){
int n,m[N][N],tmp[N];
cin >> n;
for(int i = 1 ; i <= n ; i++){
cin >> tmp[i-1] >> tmp[i];
}
for(int i = 1 ; i <= n ; i++){
m[i][i] = 0;
}
for(int j = 2; j<= n ; j++){
for(int i = 1; i <= n- j + 1; i++){
int k ... | 0 | 97,232,710 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int A[2000001];
int B[2000001];
long C[10001];
long n;
void CountingSort(int k){
memset(C, 0, sizeof(C));
for (long j = 0; j < n; ++j) ++C[A[j]];
for (long i = 1; i <= k; ++i) C[i] += C[... | #include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
int n;
int d[50][50];
void floryd()
{
for(int k=0;k<=n;k++)
{
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
{
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}
}
... | 0 | 14,305,040 |
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mod 1000000009
using namespace std;
bool isprime(ll n)
{
if(n==1)
return true;
if(n==2 || n==3)
return t... | #include<iostream>
#include<vector>
#include<string>
#include<bitset>
#include<algorithm>
#include<map>
#include<queue>
#include<cmath>
#include<set>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
int h, w,m;
cin >> h >> w >> m;
vector<int> H(h),W(w);
set<pair<int, int>> data;
int temp0, t... | 0 | 23,574,876 |
#include<bits/stdc++.h>
#define ll long long
#define ljc 998244353
using namespace std;
#define gc getchar
inline ll read(){
register ll x=0,f=1;char ch=gc();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=gc();}
while (isdigit(ch)){x=(x<<3)+(x<<1)+ch-'0';ch=gc();}
return (f==1)?x:-x;
}
vector<int> e[1010101... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
ll k, a, b;
cin >> k >> a >> b;
if... | 0 | 33,338,434 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i--)
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
int countBits(int in){
int res=0;
for(... | #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 | 39,265,187 |
#include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll n,k,i;
string s,t;
cin>>s>>t;
cout<<t+s<<endl;
return 0;
} | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
ll N, M;
cin >> N >> M;
ll ans;
if (N == 1 && M == 1)
{
ans = 1;
}
else if (N >=... | 0 | 76,745,328 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if((a*500)>=b){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | #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() {
ll N, M;
cin >> N >> M;
vector<int> k(M), s(M, 0);
rep(i, M) {
cin >> k[i];
rep(j, k[i]) {
int tmp;
cin >> tm... | 0 | 22,549,786 |
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define ENDL '\n'
#define all(a) begin(a),end(a)
#define sz(a) (int)(a.size())
#define deb(a) cout << #a << ": " << a << ENDL
#define fore(i, a, b) for(int i(a), ThkMk(b); i < ThkMk; ++i)
#define _ ios_base::sync_with_stdio(false);cin.tie(0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | 0 | 35,455,915 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
if(n < 105){
cout << 0 << endl;
return 0;
}
int r = 0;
for(int i = 105;i <= n;i += 2){
int cnt = 0;
for(int j = 1;j * j < i;j++){
if(i % j == 0){
cnt++;
... | #include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <fstream>
#include <iterat... | 0 | 89,566,027 |
#include <algorithm>
#include <cmath>
#include <climits>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
template<typename T> void print(T t) {cout << t << endl;}
int main() {
int H, W;
cin >> H >> W;
vector<... | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define mod 1000000007
#define pi 3.1415926535
typedef long long ll;
int main(){
int H,W;
cin>>H>>W;
vector<vector<char>>C(H,vector<char>(W))... | 0 | 65,033,824 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
int ans = n*800 - (n/15)*200;
cout << ans << endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#pragma comment (linker, "/STACK:526000000")
using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144*2LL
#define pb push_back
#define mp ... | 0 | 30,315,840 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
string S;
cin >> S;
if (S.size() < 4) {
cout << "No" << endl;
return 0;
}
if (S[0] == '... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
string T;
cin >> S >> T;
if(S.size() < T.size()) {
cout << "UNRESTORABLE" << endl;
return 0;
}
vector<string>ans;
bool flag = false;
for(int i = 0; i <= S.size()-T.size(); i++) {
bool ok = true;
... | 0 | 99,278,080 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using Grid= vector<vector<char>>;
using vin= vector<int>;
using ll=long long;
using vll= vector<ll>;
using vbl=vector<bool>;
using vch=vector<char>;
using pinin=pair<int ,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n,a[105],sum,ans;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
if(sum%n>=(n+1)/2){
sum=sum/n+1;
}else{
sum=sum/n;
}
for(int i=0;i<n;i++){
... | 0 | 34,464,151 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a, b;
int sum;
while(1){
int pattern=0;
cin>>a>>b;
if(a==0&&b==0) break;
for(int i=0;i<a;i++){
for(int j=i+1;j<a;j++){
for(int k=j+1;k<a;k++){
if((i+j+k+3)==b){
pattern++;
}
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define li long
#define pb push_back
#define mem(arr,x) memset(arr,x,sizeof(arr))
ll a[101],n;
ll dp[101][100001];
ll totalWays(ll start,ll k)
{
if(k==0) return 1;
if(start<0) return 0;
if(dp[start][k]!=0) return dp[start][k];
... | 0 | 64,892,421 |
#include <iostream>
using namespace std;
struct Card{char suit,value;};
void show_array(struct Card a[],int n){
for(int i=0;i<n;i++){
if(i>0) cout << " ";
cout << a[i].suit << a[i].value;
}
cout << endl;
}
void BubbleSort(struct Card a[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if... | #include <cstdio>
#define MAX_N (10010)
using namespace std;
int par[MAX_N];
int rank[MAX_N];
int root( int x ) {
if ( par[x] == x ) return par[x];
else return par[x] = root( par[x] );
}
void unite( int x, int y ) {
int r_x = root(x);
int r_y = root(y);
par[r_y] = par[r_x];
}
bool isSame( int x,... | 0 | 7,040,798 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define per(i,j,n) for(int i=(int)(j);(int)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#de... | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
for(int i = 1;i<=n ;i++){
double x[5];
double y[5];
for(int j= 1;j<=4;j++) {
cin >> x[j];
cin >> y[j];
}
if ((y[2]-y[1])*(x[4]-x[3])==(y[4]-y[3])*(x[2]-x[1])) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
} | 0 | 83,192,190 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define repA(i,n) for(int i=n; i>=0; i--)
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(a) (ll)(a.size())
typedef long long ll;
typedef long double ld;
const ... | #include <iostream>
#include <vector>
#include <set>
using i64 = long long;
int main() {
int h, w, m;
std::cin >> h >> w >> m;
std::vector<int> rows(h);
std::vector<std::vector<int>> bs(w);
for (int i = 0; i < m; i++) {
int p, q;
std::cin >> p >> q;
--p; --q;
rows[p]+... | 0 | 3,682,897 |
#include<iostream>
#include<cmath>
using namespace std;
#define EPS 1e-10
double x[4],y[4];
double det(){
double x1,x2,y1,y2;
x1 = x[0] - x[1];
y1 = y[0] - y[1];
x2 = x[2] - x[3];
y2 = y[2] - y[3];
return x1 * y2 - y1 * x2;
}
int main(void){
int n;
cin >> n;
while(n--){
for(int i = 0 ; i < 4 ; i +... | #include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
class Heap{
public:
Heap(){
array = new int[2000000];
n = 0;
}
void insert(int data){
array[n] = data;
int tmp = n;
while(tmp != 0 && array[tmp] > array[(tmp-1)/2]){
std::swap... | 0 | 48,861,696 |
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
long long int a,b,k,c,d;
cin>>a>>b>>k;
if(a>=k)
{
c=a-k;
d=b;
}
else
{
c=0;
if(a+b>=k)
d=a+b-k;
else
d=0;
}
cout<<c<<" "<<d<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(auto i=0;i<n;i++)
#define s(c) static_cast<int>((c).size())
int main(){
int n;
cin >> n;
int i, t, A[n+1];
cin >> A[0] >> A[1];
for(i = 2; i <= n; i++){
cin >> t >> A[i];
}
int dp[n][n+1]{}, dplr, l, r;
for(int i = 1; i <= n; i++){
for(int j =... | 0 | 54,380,112 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int M = N;
int sum = 0;
while (N) sum += N % 10, N /= 10;
cout << ((M % sum) ? "No" : "Yes") << "\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define repn(i,n) for(ll i=0;i<=(ll)(n);i++)
typedef pair<int,int> ... | 0 | 44,627,640 |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
#define DIV 1000000007
#define ll long long
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<ll> A(N);
loop(0, N, i) cin >> A[i];
ll leastcost = -1;
for (int bit=0; bit<(1<<N); bit... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
#define PI 3.14159265358979323846264338327950L
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const ... | 0 | 21,818,072 |
#include<bits/stdc++.h>
using namespace std;
#define int unsigned long long int
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
typedef vector<int> vi;
const int mod = 1000000007;
int32_t main() {
ios_base::sync_with... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll mod=1000000007 ;
ll dp[2010];
ll suu(ll s)
{
if(s==0)
return 1;
if(s<3)
return 0;
if(s<6)
return 1;
if(dp[s]!=-1)
return dp[s];
ll res=0;
for(ll i=3;i<=s;i++)
... | 0 | 16,979,558 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = ... | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int total = 0;
for(int i = 0; i <= a; i++) {
int syarat = 0, counter = i;
while(counter > 0) {
syarat += counter % 10;
counter /= 10;
}
if(syarat >= b && syarat <= c){
total += i;
}
}
printf("%d\n", total);
return 0;
} | 0 | 98,945,235 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(){
string a,b;
cin>>a>>b;
sort(a.begin(),a.end());
sort(b.begin(),b.end(),greater<>());
if(a<b) cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | 0 | 89,464,674 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) {
cin >> a[i];
a[i]--;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] == cnt) {
cnt++;
}
}
if (cnt ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint ... | 0 | 98,892,480 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 1007;... | 0 | 53,025,717 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int S;
cin>>S;
set<int>st;
int x=S;
while(st.count(x)==0){
st.insert(x);
if(x%2==0){
x/=2;
}
else{
x=x*3+1;
}
}
cout<<(st.size()+1)<<endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define each(it,v) for(auto &it : v)
#define mod 1000000007
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vl vector<long>
#define P pair<int,int>
using namespace std;
char score[15];
main()... | 0 | 57,571,782 |
#include <bits/stdc++.h>
# define M_PI 3.14159265358979323846
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int k = 0;
int j = 0;
int result = 0;
for (int i = 1; i <= N; i++) {
k = i;
while (true) {
if (k < 10) {
j += k % 10;
break;
}
j += k % 10;
k = k / 1... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
using namespace std;
int main() {
... | 0 | 72,677,395 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#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> H(N);
rep(i,N) cin >> H[i];
in... | #include<bits/stdc++.h>
using namespace std;
#define MAX 100000
const long long INF=1145141919,MOD=1e9+7;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const double EPS = 1e-9;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
int m,nmin,nmax;
cin>>m>>nmin>>nmax;
wh... | 0 | 68,505,106 |
#include <iostream>
#include <utility>
#include <tuple>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <functional>
#include <climits>
#include <numeric>
#include <queue>
#include <cmath>
#include <iomanip>
#include <arra... | #include <iostream>
#include <vector>
using namespace std;
void failure () {
cout << "Impossible" << endl;
exit(0);
}
const int MAX_N = 105;
int atds [MAX_N];
int main () {
ios::sync_with_stdio(false);
int n;
cin >> n;
int diam = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
atds[x]++;
... | 0 | 37,977,662 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
string s;
cin >> s;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2])
{
cou... | #include<stdio.h>
#include<stack>
#include<iostream>
#include<string>
using namespace std;
int n = 0;
int u = 0;
int k[101];
int v[101][101];
int Short[101] = { 0 };
int p = 0;
int fptr = 0;
int lptr = 0;
int x1[10000];
int y1[10000];
void Enqueue(int y, int x)
{
x1[lptr] = x;
y1[lptr] = y;
lptr = (lptr + 1) % 10000... | 0 | 27,712,627 |
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
inline void normal(ll &a) { a %= mod; (a < 0) && (a += mod); }
inline ll modMul(ll a, ll b) { a %= mod, b %= mod; normal(a),... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 85,116,294 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main()
{
int n, l;
cin >> n >> l;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
int pos = 0;
for(int i = 0; i < n-1; i++)
{
if(a[i] + a[i+1] >= l) pos = i+1;
}
if(pos =... | 0 | 44,673,099 |
using namespace std;
int p[7];
int main(){
for(int i=0;i<8;i++)cin>>p[i],p[i]+=(i>1&&i%4?p[i-1]:0);
cout<<(p[3]>p[7]?p[3]:p[7])<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long N, P;
string S;
long long memo[200005];
map<long long, long long>pcount;
long long kaidan[10000000];
long long modpow(long long ori, long long po){
long long res = 1;
while(po > 0){
if(po&1){
res *= ori;
res %= P;
}
ori *= ori;
ori %= P;
po >>= 1;... | 0 | 19,036,478 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
if (N / 500 == 0) {
cout << "Yes";
}
else {
if ((N % 500) > A) {
cout << "No";
} else {
cout << "Yes";
}
}
} | #include <cstdio>
#include <map>
#include <queue>
#include <string>
using namespace std;
const int INF = -1;
const int MAX_H = 1010;
const int MAX_W = 1010;
const int MAX_N = 10;
int H, W, N;
char field[MAX_H][MAX_W];
int d[MAX_H][MAX_W];
int sx, sy, gx, gy;
int power = 1;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -... | 0 | 44,334,951 |
#include<bits/stdc++.h>
using namespace std;
int INF = 100000000;
int book[15][15];
int cost[15];
int main(){
int n,m,x;
cin>>n>>m>>x;
for(int i=0; i<n; i++){
cin>>cost[i];
for(int j=0; j<m; j++) cin>>book[i][j];
}
int mincost = INF;
for(int state = 1; state<(1<<n); state++){
int skill[m]={0};
int price ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
ll gcd(ll x,ll y){
if(y==0) return 0;
ret... | 0 | 42,483,432 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
int main(){
ll n,m;
cin>>n... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const ll p = 1e9+7;
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
vector<ll> d(61);
rep(i,n){
for(int j=0;j<=60;j++){
if(((ll)1<<j)... | 0 | 94,288,177 |
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
int dx[4]={ 0, 1, 0, -1};
int dy[4]={ 1, 0, -1, 0};
using P = pair<int,int>;
int h, w, n;
int sx, sy, gx, gy;
int ans=0;
char c[1000][1000];
queue<P> que;
int main(){
cin >> h >> w;
queue<P> que;
vector<vector<int>> d(w, vector(h, -1));
... | #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 | 65,721,776 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
string s;
cin >> s;
rep(i,s.length()){
rep(j,s.length()-i-1){
if(s[i]==s[s.length()-j-1]){
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
} | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retur... | 0 | 20,420,379 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
string S;
long long K;
cin >> S >> K;
bool found = false;
for ( int i=0; i<K; i++ ) {
if ( S.at(i) != '1' ) {
cout << S.at(i) << endl;
found = true;
break;
}
}
if ( !found )
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 110;
char s[N][N];
int n, m;
int dp[N][N];
int main() {
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; ++i)
scanf("%s", s[i] + 1);
dp[1][1] = s[1][1] == '#';
for(int i = 1; i <= n; ++i) {
f... | 0 | 82,990,815 |
#include <iostream>
using namespace std;
int main(){
int array[9][9];
for(int num1=1;num1<=9;num1++){
for(int num2=1;num2<=9;num2++){
cout << num1 << 'x' << num2 << '=' << num1*num2 << endl;
}
}
return 0;
} | #include <cstdint>
#include <iostream>
#include <string>
constexpr int32_t kMaxNumberOfVertices = 100;
constexpr int32_t kInvalidVertexIndex = -1;
void CallWarshallFloyd(std::istream &input_stream);
class WarshallFloyd {
public:
WarshallFloyd() noexcept;
~WarshallFloyd() noexcept;
void SetNumberOfVertices(const ... | 0 | 50,462,006 |
#include <iostream>
using namespace std;
void solve(long long X, long long Y){
cout << X + Y / 2 << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long X;
scanf("%lld",&X);
long long Y;
scanf("%lld",&Y);
solve(X, Y);
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | 0 | 18,943,399 |
#include <iostream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#include <numeric>
using namespace std;
int main()
{
while(1)
{
int n,score=10000000;
vector<int> a;
cin >> n;
if(n == 0) exit(0);
for(int i = 0 ; i < n; i++)
{
int tpn;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod ll(1e9+7)
ll exp(ll a,ll b)
{
if(b==0)
return 1;
if(b%2==0)
return exp(a*a%mod,b/2);
return a*exp(a*a%mod,(b-1)/2)%mod;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout... | 0 | 56,476,393 |
#include <bits/stdc++.h>
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
typedef long int li;
typedef long long ll;
typedef long double ld;
int main()
{
int n, k = 1;
cin >> n;
if (n >= 1800 && n <= 1999)
k = 1;
else if (n >= 1600 && n <= 1799)
k = 2;
else if (n >... | #include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n,k;
cin>>n>>k;
vector<int>a(n);
rep(i,n)cin>>a[i];
int cnt=0;
int ans=0;
vector<int>counter(n,0);
rep(i,n){
counter[a[i]-1]+=1;
}
int c=0;
rep... | 0 | 18,239,478 |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F fi... | #include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int uniquePathsWithObstacles(vector<vector<int>>& hi) {
int m=hi.size();
int n=hi[0].size();
if(hi[0][0] || hi[m-1][n-1])
return 0;
int dp[m][n];
for(int i=0;i<n;i++)
{
if(hi[0][i]... | 0 | 9,697,521 |
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
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;
d... | 0 | 81,708,983 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
int main(void){
string s,t;
cin>>s>>t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
if(s<t)cout<<"Yes";
else cout<<"No";
} | #include <iostream>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <math.h>
using namespace std;
int main(){
long long a = -1000000, b = 1000000, c = 0, tmp = 0, tmp2 = 0;
cin >> tmp2;
for (int i = 0; i < tmp2; i++){
cin>>tmp;
c += tmp;
a = max(a, tmp);
b = min(b, tmp);
}
cout << b << "... | 0 | 89,365,432 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define sz(a) (ll)(a).size()
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define endl "\n"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef ... | #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 | 32,839,201 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <complex>
#include <ctime>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long do... | #include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int n, s;
int table[50010];
int main() {
cin >> s>>n;
vector<int>v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
table[0] = 0;
for (int i = 1; i <= s; i++)
table[i] = INT_MAX;
for (i... | 0 | 30,545,685 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;... | #include <iostream>
#include <cmath>
using namespace std;
int comb(int a,int num){
if(num == 1){
return 1;
}
else{
int count = 0;
for(int i = 0; i <= min(a,9); i++){
if(a - i <= 9*(num-1)) count = count + comb(a-i, num-1);
}
return count;
}
}
int main(... | 0 | 27,069,729 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
int x,y,ok=0; cin>> x >> y;
for(int i=0; i<x; ++i){
if(2*i + 4*(x-i) == y){++ok; break;}
}
for(int i=0; i<x; ++i){
if(4*i + 2*(x-i) == y){++ok; break;}
}
if(ok>0){
cout<< "Yes";
}else{
cout<< "No";
}
} | #include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
using namespace std;
int main(void){
string a[10];
a[0]="";
a[1]=" .,!?";
a[2]="cab";
a[3]="fde";
a[4]="igh";
a[5]="ljk";
a[6]="omn";
a[7]="spqr";
a[8]="vtu";
a[9]="zwxy";
int n;
cin >> n;
cin.ignore();
... | 0 | 18,841,878 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.