code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
#include <list>
#include <iomanip>
#include <string>
#include <cctype>
#include <cstdio>
#include <cmath>
using namespace std;
int main(){
using ll=long long;
ll A,B,K;
cin>>A>>B>>K;
if(A>=K)
cout<<A-K<<" "<<B<<endl;
else if(B-K+A<0)
cout<<"0"... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i... | 0 | 45,261,328 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(a) a.begin(), a.end()
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; }
using namespace std;
typedef... | #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;
int x[n];
int max_x=0;
rep(i, n){
cin >> x[i];
max_x=max(max_x, x[i]);
}
ll ans=1e9;
rep(i, max_x){
l... | 0 | 97,124,630 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
ll a;
string b;
cin >> a >> b;
ll b_sub = (b[0] - '0') * 100 + (b[2] - '0') * 10 + (b[3] - '0');
cout << a * b_sub / 100 << endl;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end(), greater<char>());
bool ans = false;
if (s < t)
ans = true;
if (ans)
c... | 0 | 25,983,924 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
Int x, y;
cin >> x >> y;
cout << x + y /... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
if(n%2==1){
cout << "0" << "\n";
return 0;
}
ll cnt=0;
ll div=10;
while(div<=n) {
ll tmp=n... | 0 | 23,738,227 |
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
}
void ran() {
srand(chrono::steady_clock::now().time_since_epoch().count());
}
long long get_rand() {
long long a = rand();
long long b = rand();
return a * (RAND_MAX + 1ll) + b;
}
void usaco() {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> lis;
vector<int> v;
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
v.push_back(a);
}
for (auto a: v) {
auto it = lower_bound(lis.begin(), lis.end(), a);
if (it != l... | 0 | 60,058,368 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long N, X, M;
cin >> N >> X >> M;
long long ans = 0;
if( X == 0 ) {
cout << ans << endl;
return 0;
}
if( X == 1 ) {
ans = N;
cout << ans << endl;
return 0;
}
long long A = X;
long long a = -1;
long long b = -1;
long long sta;
long lon... | #include <iostream>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
for(int i=1;i<=3;i++){
if(i!=a && i!=b){
cout<<i;
return 0;
}
}
return 0;
} | 0 | 47,223,106 |
#include <iostream>
#include <vector>
#include <deque>
#include <cmath>
#include <map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include "iomanip"
using namespace std;
#include <cstdio>
#include <cstring>
int main() {
int n, m, count = 0, res = 0;
cin >> n >> m;
for (int i = 1; i <= n ; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, j, k, in) for (int i=j ; i<k ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i>=... | 0 | 52,251,682 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
using namespace std;... | #include <bits/stdc++.h>
using namespace std;
const long inf = 1e18;
int n, r;
long a[300];
long b[300];
long dp[300][300][300];
long dq[300][300][300];
long dr[300][300][300];
void modify(int i) {
for (int j = 0; j < n; ++j) {
long q = inf;
for (int k = n - 1; k >= 0; --k) {
q = min(q, dp[i][j][k]);
... | 0 | 39,072,632 |
#include <iostream>
#include <map>
#include <vector>
#define int long long
typedef long long ll;
using namespace std;
ll N, A, B, C, Len[8], minmp=10000000000;
void dfs(ll id, ll v[8]){
if(id==N-1) {
ll abc[4]={0}, abclen[4]={0};
for(int i=0;i<=id;i++) {
abc[v[i]]++;
abclen[v... | #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,int> P;
const LL mod=1000000007;
const LL LINF=1LL<<62;
const LL IN... | 0 | 45,897,150 |
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int n;
while(cin >> n,n!=0){
int max;
int min=1005;
int sum = 0;
max = 0;
int x;
for(int i = 0;i < n;i = i+1){
cin >> x;
sum = sum + x;
if(x > max){
max = x;}
if... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 83,834,824 |
#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 <set>
#include <utility>
#include <cmath>
#inc... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll m = 0;
cin >> m;
vector<ll> v(1e6 + 5, 0);
ll n ... | 0 | 80,743,352 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, z, x, y;
cin >> n;
z = n/15;
x = n*800;
y = z*200;
cout << x - y << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | 0 | 84,241,055 |
#include<iostream>
using namespace std;
#define loop(i,a,b) for(int i = a ; i< b ; i ++)
int main(void){
int d;
while(cin>>d){
long long int sum =0;
loop(i,1,600/d)
sum+=i*i*d*d*d;
cout<<sum<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 49,730,754 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a, ans;
cin >> a;
ans = (1 + a) * a / 2;
cout << ans << endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <list>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repR(i, n) for(int i = (n) - 1; i > -1; i--)
#define rep1(i, n) for(int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) for(int i = (n); i > 0; i--)
#define ll long l... | 0 | 31,077,465 |
#include <iostream>
#include <stack>
using namespace std;
int main() {
char c;
stack<char> S;
int ans{};
while(cin >> c) {
if (S.empty() || S.top() == c) S.push(c);
else {
ans += 2;
S.pop();
}
}
cout << ans << endl;
} | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<iomanip>
#include<set>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;ind... | 0 | 2,718,415 |
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
const int N = 300000, M = 300000, K = 300000;
int xx[K], yy[K];
int kkx[1 + N], kky[1 + M];
map<pair<int, int>, bool> mp;
int qux[N], quy[N];
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n, m, k; cin >> n >> m >> k;
for... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
int main (){
int k,n;
cin >> k >> n;
vector<int> a(n);
rep(i,n){
cin >> a[i];
}
int ans =a[n-1]-a[0];
for(int i =0;i+1<n;i++){
ans = min(ans,k-(a[i+1]-a[i]));
}... | 0 | 45,887,708 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int d, t, s;
cin >> d >> t >> s;
if (s * t >= d) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> A(3, vector<int>(3));
bool c = false;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> A.at(i).at(j);
}
}
int N;
cin >> N;
for (int h = 0; h < N; h++) {
int b;
cin >> b;
for (int i = ... | 0 | 49,360,586 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <vector>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define ll long long
#define ld long double
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define... | 0 | 19,483,845 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;int flag=0;
cin>>s;
int a[26]={0};
for(int i=0;i<s.length();i++){
int k=(int)s[i];
a[k-97]++;
}
for(int i=0;i<26;i++){
if(a[i]==0){
cout<<(char)(i+97);
flag = 1;
break;
... | 0 | 47,070,281 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deq... | #include<iostream>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long int
#define ull unsigned long long int
#define inp(n) ll n; cin >> n
#d... | 0 | 36,698,899 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int, int>
const int mod = 1e9+7;
const int MAXN = 1e5+5;
const int N = 1e5+5;
int fac[N];
int spf[MAXN];
void pre(int p) {
fac[0] = 1;
for(int i=1; i<N; i++) {
fac[i] = (fac[i-1... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 48,976,255 |
#include<iostream>
using namespace std;
int main() {
int n;
int y, m, d;
cin >> n;
for (; n>0; n--) {
int day = 0;
cin >> y >> m >> d;
if (y%3 == 0 || m%2 != 0) {
day += 20-d;
}
else {
day += 19-d;
}
day++;
for (m++;... | #include<cstdio>
#include<cmath>
double Area(int a,int b,int C){
return a*b*sin(C*M_PI/180)/2.0;
}
double ThCos(int a,int b,int C){
return sqrt(a*a+b*b-2*a*b*cos(C*M_PI/180));
}
double Height(int b,int C){
return b*sin(C*M_PI/180);
}
int main(){
int a,b,C;
scanf("%d%d%d",&a,&b,&C... | 0 | 54,108,830 |
#include<bits/stdc++.h>
#define REP(i, n) for(int i=0; i<n; i++)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return tru... | #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>;
int main() {
int n;
scanf("%d", &n);
int l = 0, r = n - 1, m;
string sl, sr, sm;
printf("%d\n", l);
fflush(stdout);
cin >> sl;
printf("%d\n", r);
fflush(st... | 0 | 81,118,988 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n+1); ++i)
using namespace std;
using ll = long long;
const int INF = +100100100;
typedef pair<int,int> P;
int main(){
int n,d,a;
cin >> n >> d >> a;
d= d*2;
vector<P> ... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 41,739,329 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int main() {
ll n, k; cin >> n >> k;
ll res = 0;
for (ll i = k; i <= n + 1; i++) {
ll mini = (i - 1) * i / 2;
ll maxi = (2 * n - i + 1) * i / 2;
res += (maxi - mini + 1);
res %= MOD;
}
cout << res << '\n';
return 0... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 94,661,303 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define For(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
typedef vector<long long> vlint;
typedef vector<string> vstr;
typedef vector<char> vchar;
typedef vector<vector<lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N; cin >> N;
vector<vector<pair<ll,ll>>> G(N+1);
rep(i, 0, N-1){
ll v, u, w;
cin >> v >> u >> w;
G[u].push_back({v, w});
... | 0 | 91,803,899 |
#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 NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define test(x) cout << #x << " ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main() {
int h,w,a,b;
cin>>h>>w>>a>>b;
vector<vector<int>> ans(h,vector<int>(w,0));
rep(i,b){
rep(j,a)... | 0 | 81,995,786 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long modpow(long long a, long long b){
long long ans = 1;
while (b > 0){
if (b % 2 == 1){
ans *= a;
ans %= MOD;
}
a *= a;
a %= MOD;
b /= 2;
}
return ans;
}
long long modinv(long long a){
return modpo... | 0 | 87,543,671 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((in... | 0 | 36,573,921 |
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
int main() {
int K;
cin >> K;
vector<int> vec(K);
for(int i = 0;i < K;i++) {
cin >> vec.at(i);
}
re... | 0 | 68,745,238 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, c, k;
cin >> n >> c >> k;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a, a + n);
int i = 0, bus = 0;
while (i < n)
{
int ptr = i + 1;
while (ptr < (i + c) && ptr < n)
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N,P;cin>>N>>P;
string s;cin>>s;
if(P==2){
int64_t ans=0;
for(int64_t i=N-1;0<=i;i--){
int64_t b=s.at(i)-'0';
if(b%2==0)ans+=i+1;
}
cout<<ans<<endl;
}else if(P==5){
int64_t ans=0;
for(int64_t i=N-1;0<=i;i--){
int64... | 0 | 93,887,767 |
#include <iostream>
using namespace std;
int main() {
int n,b,f,r,v,college[4][3][10]={0};
cin>>n;
for(int m=0;m<n;m++){
cin>>b>>f>>r>>v;
college[b-1][f-1][r-1]+=v;
if(college[b-1][f-1][r-1]>9)college[b-1][f-1][r-1]=9;
if(college[b-1][f-1][r-1]<0)college[b-1][f-1][r-1]=0;
}
for(int i=0;i<4;i++){
if(i!... | #include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <math.h>
#include <tuple>
#include <map>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
if ((n - 1) / b <= a - 1 && a - 1 <= n - b) {
if (a == 1) {
... | 0 | 59,623,641 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<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 all(... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<int>v(n);
for(int i=0;i<n;i++) cin >> v[i];
int ans = 0;
int suma = 0;
vector<int>veca;
for(int a=0;a<=min(n ,k);a++){
vector<int>vecb;
if(a > 0){
veca.push_back(v[a-1]);
... | 0 | 71,681,964 |
#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 VVI = vector<vector<int>>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n, k;
cin >> ... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unorde... | 0 | 53,397,230 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
const int INF = 0x3f3f3f3f;
int A[2000005], B[2000005], C[10005];
int main(){
int n, temp = 0;
cin >> n;
for(int i = 1; i <= n; i++) scanf("%d", A + i);
for(int i = 1; i <= n; i++) ... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
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; }
const int INF=1001001001;
vector<pair<int64_t,int64_t... | 0 | 13,083,110 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string card;
int m,h;
while(1){
cin>>card;
if(card=="-")break;
cin>>m;
for(int i=0;i<m;i++){
cin>>h;
for(int j=0;j<h;j++){
card += card[0];
card.erase(... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#define ll long long
#define rep(i, a, b) for(int i = a; i < b; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
int mx = 0;
vector<vector<int>> v(h+2, vector<int>(w+2, -2));
queue<pair<int,int>> q;
rep(i, 1, h+1) {
... | 0 | 55,274,661 |
#include <cstdio>
int N, E, head[100001], next[199999], to[199999], f[100001], fa[100001], q[100001];
int main()
{
scanf("%d", &N);
for (int i = 1, u, v; i < N; i++)
{
scanf("%d%d", &u, &v);
next[++E] = head[u], to[E] = v, head[u] = E;
next[++E] = head[v], to[E] = u, head[v] = E;
}
int H = 0, T = 1, u;
q[1]... | #include <bits/stdc++.h>
using namespace std;
template<class e, class t, int N>
std::basic_istream<e,t>& operator>>(std::basic_istream<e,t>& in, const e(&literal)[N]) {
std::array<e, N-1> buffer;
in >> buffer[0];
if (N>2)
in.read(&buffer[1], N-2);
if (strncmp(&buffer[0... | 0 | 70,474,888 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
string s,t;
ll ans=0;
cin >> s >> t;
for(ll i=0;i<s.length();i++){
if(s[i]!=t[i]){
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
struct SegTree {
vector<int> vseg;
int n;
#define CL(v) ((v) << 1)
#define CR(v) ((v) << 1 | 1)
SegTree(vector<int> a){
this->n = a.size();
vseg.resize(n << 2);
build(a, 1, 0, n - 1);
}
void buil... | 0 | 85,005,883 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
for ( int i = 0; i < n; i++ ) {
int a,b,c; cin >> a >> b >> c;
bool flag = 0;
if ( a + b > c && b + c > a && c + a > b ) {
if ( a * a == b * b + c * c ||
b * b == c * c + a * a ||
c * c == a * a + b * b ) fla... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[40005][205]={0};
ll max_v[40005]={0};
ll ts[205]={0};
const ll inf=174417441744;
int main(){
ll n;
cin>>n;
ll all_time=0;
for(int i=0;i<n;i++) cin>>ts[i];
for(int i=0;i<n;i++){
ll v,t=ts[i];
cin>>v;
v*=2;
for(int j=all_ti... | 0 | 40,959,056 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define pb push_back
#define mk make_pair
const int n = 2 * 1e3 + 7;
const int m = 2 * 1e3 + 7;
int down[n][m], up[n][m], lef[n][m], righ[n][m];
char a[n][m];
int main() {... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX_N = 1005;
int c[MAX_N][MAX_N];
int main()
{
string X,Y;
cin >> X;
cin >> Y;
for(int i=0;i<=X.length();i++){
c[i][0] = i;
}
for(int j=0;j<=Y.length();j++){
c[0][j] = j;
}
for(int i=1;i<=X.length();i++){
for(int j=1;j... | 0 | 35,141,540 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int arr[100001],n;
cin>>n;
for(int i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
cout<<arr[n/2]-arr[n/2-1]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
int n;
cin >> n;
deque<ll> a(n + 1), b(n);
rep(i, n + 1)
{
cin >> a[i];
}
rep(i, n)
{
cin >> b[i];
}
ll ans = 0;
rep(i, n)
{
... | 0 | 55,218,209 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void chmax(int& a, int b) {
if (a == -1) a = b;
if (a > b) a = b;
}
int main () {
int nin[10];
int six[10];
nin[0] = 0;
nin[1] = 9;
six[0] = 0;
six[1] = 6;
for (int i = 2; i < 8; i ++) {
nin[i] = nin[i - 1] * 9;
}
for (int i = ... | #include<stdio.h>
#include<string.h>
typedef long long ll;
typedef unsigned long long ull;
int main(){
char a[15];
char b[15];
char c[15];
scanf("%s %s %s",a,b,c);
int ada = 0;
if(a[strlen(a)-1]==b[0]&&b[strlen(b)-1]==c[0])
ada=1;
if(ada==1)
printf("YES\n");
else
printf("NO\n");
} | 0 | 11,595,677 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define INF (int)1e9
typedef long long int int64;
void print() {
cout << endl;
}
void print(const char* s, bool endline = true) {
cout << s;
if (endline) print();
}
void print(char s, bool endli... | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <array>
#include <l... | 0 | 34,772,804 |
#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 H,W;
cin >> H >> W;
char board[52][52];
for(int i = 1; i <= H; i++){
for(int j = 1; j <= W; j++)cin >> board[i][j];
}
for(int i = 1; i<= H; i++){
f... | #include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename ... | 0 | 83,044,239 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include<iostream>
#include <cstddef>
#include<set>
#include<stack>
#include <deque>
#include<queue>
#include<utility>
#include<vector>
#include<map>
#include<cmath>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<iomanip>
#include<algorithm>
#define ll long long
#define ull unsigned long long
#define s... | 0 | 5,207,805 |
#include <iostream>
#include <string>
#include<algorithm>
using namespace std;
int main() {
string a, b;
string c="No";
cin >> a >> b ;
sort(a.begin(),a.end());
sort(b.begin(),b.end());
reverse(b.begin(),b.end());
if(a<b)
c="Yes";
cout << c << endl;
} | #include<bits/stdc++.h>
using namespace std;
long long n,ans = 0;
long long a[200005],b[200005];
int main(){
cin >> n;
for(int i = 1;i <= n;i ++)
cin >> a[i], b[i] = a[i];
sort(b + 1,b + 1 + n);
for(int i = 1; i <= n; ++i)
a[i] = lower_bound(b + 1,b + 1 + n,a[i]) - b;
for(int i = 1; i <= n; ++i)
if((a[i] &... | 0 | 2,809,028 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
map<int, int> mp;
for(int i = 0; i < n; i++){
int a; cin >> a;
mp[a]++;
}
int ans = 0;
for(auto p: mp){
int k = p.first;
int tmp = p.second;
if(k < tmp) ans += tmp-k;
else if(k > tmp) ans += tmp;
}
cout <<... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lld long double
#define w(x) ll x;cin>>x;while(x--)
#define mod 1000000007
#define speed ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main(){
speed;
ll h,w,k; cin>>h>>w>>k;
vector<vector<char>> a(h,... | 0 | 81,646,328 |
#include <iostream>
#include <string>
#include <sstream>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <bitset>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int N,M,num1,num2;
bool da... | #include <iostream>
#include <map>
#include <string>
using namespace std;
map<string, int> cnt;
string ans[2];
int num_max;
int main() {
string str;
while (cin >> str) {
cnt[str]++;
}
for (auto e : cnt) {
if (num_max < e.second) {
ans[0] = e.first;
num_max = e.sec... | 0 | 33,725,583 |
#include <bits/stdc++.h>
#define f(i, a, b) for(int i = a; i < (b); ++i)
#define rep(i,n) f(i, 0, n)
using namespace std;
using ll = long long;
int main(void){
int n;
string s, t;
cin >> n >> s >> t;
string ans;
rep(i,n){
ans+=s[i];
ans+=t[i];
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <stack>
#include <algorithm>
using namespace std;
int main()
{
string s;
while( getline( cin, s ) ) {
if ( s == "." )
break;
bool b = true;
stack<char> t;
t.push( '\0' );
for( auto c : string( s.cbegin(), s.cbegin... | 0 | 36,898,284 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a; cin >> a;
vector<int64_t> c(26, 0); for (char i : a) c[i - 'a']++;
int64_t ans = (int64_t)a.size() * ((int64_t)a.size() - 1) / 2 + 1;
for (auto i = 0; i < 26; i++) ans -= c[i] * (c[i] - 1) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
ll N, K;
cin >> N >> K;
vec<ll> P(N);
rep(i, N) cin >> P[i], --P[i];
vec<ll> C(N);
... | 0 | 24,699,459 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,w=0,n,i,c=0;
cin>>a>>b;
if(b==1 && a!=1) std::cout << "Bob" << '\n';
else if(a==1 && b!=1) std::cout << "Alice" << '\n';
else if(a>b) std::cout << "Alice" << '\n';
else if(a<b) std::cout << "Bob" << '\n';
else if(a==b) std::co... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
int X, Y, A, B, C;
priority_queue<int, vector<int>, greater<int>> pq;
vector<int> a, b, c;
int ans;
int max_ans = 0;
void update(int x)
{
if(pq.size() != Y)
{
ans += x;
pq.push(x);
}
... | 0 | 21,221,470 |
#include <iostream>
int main(){
int A, B, C;
std::cin >> A >> B >> C;
int i=1;
while(1){
if (A*i % B == C){
std::cout << "YES" << std::endl;
break;
}
if (A*i % B == 0){
std::cout << "NO" << std::endl;
break;
}
i++;
}
} | #include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) <<... | 0 | 21,497,981 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool lamp_check(bitset<10> s,int n,int m,vector<vector<int>> &array,vector<int> &p){
for(int i=0;i<m;i++){
int count = 0;
for(int j=0;j<(int)array.at(i).size();j++){
int num = array.at(i).at(j);
if(s.test(num... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
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;}
int ... | 0 | 39,910,535 |
#include <iostream>
int main () {
int w,h,n,x,y,a;
int finalX1, finalX2, finalY1, finalY2;
int finalX, finalY;
std::cin >> w >> h >> n;
finalX1 = finalX2 = finalY1 = finalY2 = 0;
for(int i=0; i < n; i++) {
std::cin >> x >> y >> a;
if(a == 1) {
if(x > finalX1) {
finalX1 = x;
}
} ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const int INF = 1e9;
const int MAX = 1e6;
int m... | 0 | 18,281,157 |
#include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if((a*b)%2)
cout<<"Odd"<<endl;
else
cout<<"Even"<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#define pb push_b... | 0 | 3,356,156 |
#include <iostream>
#include <cmath>
#define EPS 1.0e-5
using namespace std;
int main() {
double x1,y1,x2,y2,x3,y3,xp,yp;
double a[2],b[2];
double A,B;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp) {
a[0] = x2 - x1;
a[1] = y2- y1;
b[0] = x3 - x1;
b[1] = y3 - y1;
if(fabs(a[0]*b[0... | #include <bits/stdc++.h>
using namespace std;
#include<algorithm>
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
vector<ll>ch;
for(ll i=0;i<n;i++){
ch.push_back(i+1);
}
ll a,b;
vector<ll>A,B;
for(ll i=0;i<n;i++){
ll x;
cin>>x;
A.push_back(x);
}
for(ll i=0;i... | 0 | 15,828,847 |
#include<iostream>
using namespace std;
int main()
{
while (1)
{
int n, s;
int ans = 0;
cin >> n >> s;
if (n == 0 && s == 0)break;
int comb = (1 << n) - 1;
while (comb < (1 << 10))
{
int sum = 0;
for (int i = 0; i < 10; i++)
{
if ((comb >> i) & 1)sum += i;
}
if (sum == s)ans++;
int... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 37,573,811 |
#include <iostream>
using namespace std;
int main(void)
{
int k, a, b; cin >> k >> a >> b;
bool flag = 0;
int tmp = k;
while (tmp <= b)
{
if (tmp >= a && tmp <= b)
{
flag = true;
break;
}
tmp += k;
}
if (flag) cout << "OK" << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin() , v.end()
#define REP(i, x, n) for(int i = x; i < n; i++)
int main(){
int h,w; cin >> h >> w;
string s;
... | 0 | 61,936,130 |
#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;
int main() {
int n;
cin >> n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b.at(i);
vector<int> a(n);
a.at(0) = b.at(0);
rep... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 10,536,451 |
#include "iostream"
#include "string"
#include "algorithm"
using namespace std;
int main(int argc, char const *argv[])
{
string str;
int q=0;
string sub1,sub4,rev;
int sub2,sub3;
cin >> str;
cin >> q;
for (int i = 0; i < q; ++i)
{
cin >> sub1;
if (sub1 == "print")
{
cin >> sub2 >> sub3;
cout << str... | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int IN... | 0 | 83,725,358 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(void){
int n;
while(cin >> n, n){
vector<string> a(n);
int cnt=0;
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i+1<n;i++)
cnt += a[i][1]==a[i+1][1];
cout << cnt << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n;string s;
cin >> n >> s;
int x=0;
int d=0,a;
for(int i = 0; i < n; i++) {
if(s[i]=='(') d++;
else d--;
x=min(x,d);
}
for(int i = 0; i... | 0 | 72,878,387 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | #include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; ... | 0 | 54,450,810 |
#include <iostream>
using namespace std;
int main()
{
int n;
int *a;
long int total_a = 0;
long int e = 1;
long int ans = 0;
cin >> n;
a = (int*)malloc(( n + 1 ) * sizeof( int ));
if ( NULL == a ) { return -1; }
for ( int i = 0 ; i <= n ; ++i ) { cin >> a[i]; total_a += a[i]; }
for ( int i = 0 ; i <... | #include<iostream>
using namespace std;
int main() {
int a;
int b;
while (1) {
cin >> a >> b;
if (a == 0) {
if (b == 0) break;
}
if (a<=b) {
cout << a << " " << b << endl;
} else {
cout << b << " " << a << endl;
}
}
... | 0 | 45,619,011 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
vector<int>vec(N);
vector<int>vec2(N);
for(int i=0;i<N;i++){
cin >> vec.at(i);
vec2.at(i)=vec.at(i);
}
sort(vec2.begin(),vec2.end());
reverse(vec2.begin(),vec2.end());
for(int i=0;i<N;i++){
... | #include <bits/stdc++.h>
using namespace std;
int N; string s, a, b, A, B;
void change(int i){
int j=(N+i-1)%N, k=(i+1)%N;
A[i]=(A[i]=='S')?'W':'S'; a[i]=(a[i]=='o')?'x':'o';
a[j]=(a[j]=='o')?'x':'o'; a[k]=(a[k]=='o')?'x':'o';
B[i]=(B[i]=='S')?'W':'S'; b[i]=(b[i]=='o')?'x':'o';
b[j]=(b[j]=='o')?'x':'o'; b[k]=... | 0 | 13,018,524 |
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
int n;
string cmd, dna;
set<long long int> dictionary;
cin>>n;
for(int i=0;i<n;i++){
cin>>cmd>>dna;
long long int x = 0;
if(cmd... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>
#include<iomanip>
#include<map>
#include<cstring>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;
int main(... | 0 | 33,570,204 |
#include <bits/stdc++.h>
#define N 100005
using namespace std ;
inline int read ()
{
char c = getchar () ; int x = 0 , f = 1 ;
while (c < '0' || c > '9') { if (c == '-') f = -1 ; c = getchar () ; }
while (c >= '0' && c <= '9'){ x = x * 10 + c - '0' ; c = getchar () ; }
return x * f ;
}
int n , a[N] , l ... | #include <iostream>
#include <vector>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <numeric>
#include <iterator>
using namespace std;
namespace {
}
int main()
{
set<int> paint;
for (int i = 0; i < 3;... | 0 | 3,902,147 |
#include<bits/stdc++.h>
#define ll long long
#define db double
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define A first
#define B second
#define lowbit(p) (p&(-p))
using namespace std;
void read(int &x){
x=0; char c=getchar(); int p=1;
for (;c<48;c=getchar())if (c=='-')p=-1;
for (;c>47;c=g... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
map<char, bool> M;
for (auto o : s)
{
if(M[o])
{
cout << "no" << endl;
return 0;
}
M[o] = 1;
}
cout << "yes" << endl;
return 0;
} | 0 | 66,433,052 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll x,a;
cin>>x>>a;
if(x<a){
cout << 0;
}
else{
cout << 10;
}
return 0;
} | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 0 | 69,635,175 |
#include <iostream>
using namespace std;
int main()
{
int value = 0;
int count = 0;
do
{
if (count > 0)
cout << "Case " << count << ": " << value << endl;
++count;
cin >> value;
} while(value != 0);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 29,095,745 |
#include <iostream>
#define rep(i,a) for(i = 0; i < a; i++)
using namespace std;
class Card {
public:
string suit;
int value;
void InputCard(string T);
};
void Card::InputCard(string T) {
suit = T[0];
value = T[1] - '0';
}
void print(Card card[],int n) {
int i;
rep(i,n){
if(i > 0){
cout << " ";
... | #include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std;
char a[1001][1001];
int v[1001][1001],n,h,w,sx,sy,ans;
int dir[4][2]={-1,0,1,0,0,1,0,-1};
char b[1001];
int s[1001][1001];
struct st
{
int x,y;
}st1,st2,fl,pp;
int check(st kk)
{
if(kk.x>=0&&kk.x<h&&kk.y>=0&&kk.y<w)
... | 0 | 23,963,596 |
#include<stdio.h>
main(){float n,m,d;scanf("%f%f%f",&n,&m,&d);printf("%f",(d?2:1)*(n-d)*(m-1)/n/n);} | #include <bits/stdc++.h>
#include <vector>
#include <cstdlib>
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; }
const long long INF = 1LL << 60;
const int MAX = 10... | 0 | 81,384,932 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
static const int MAX = 100;
int N;
int ADJ[MAX][MAX];
int depth[MAX];
enum STATUS { ACTIVE = 0, MARKED, VISITED, };
int status[MAX] = {ACTIVE};
void visit(int id) {
status[id] = VISITED;
}
void mark(int id) {
status[id]... | #include<iostream>
#include<string>
#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.at(i) ;
}
int diff ;
int max_diff=0;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if((... | 0 | 15,515,359 |
#include <bits/stdc++.h>
using namespace std;
long aps(long a, long d, long n) {
return n * (2 * a + (n - 1) * d) / 2;
}
int main() {
long N, K, MOD = 1e9+7;
cin >> N >> K;
long ans = 0;
for (long k = K; k <= N + 1; k++) {
long mi = aps(0, 1, k);
long mx = aps(N - k + 1, 1, k);
ans += mx - mi + 1;... | #include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
string s;
cin >> s;
ll ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
if ((s[i] == 'B' && s[i + 1] == 'W'... | 0 | 25,274,728 |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hel... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll N, K; cin >> N >> K;
ll ans = 1;
for (int i = 0; i < N; ++i) {
ll tmp1 = ans * 2;
ll tmp2 = ans + K;
if (tmp1 < tmp2) ans = tmp1;
... | 0 | 85,686,761 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
ll ans = -1e12;
vector<ll> x(N);
vector<ll> y(N);
vector<ll> z(N);
rep(i, N) cin >> x[i] >> y[i] >> ... | 0 | 98,513,676 |
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#de... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
char str[256];
char f[4]={'m','c','x','i'};
int n;
for(scanf("%d\n",&n);n--;){
int c;
int ans[2]={0,0};
for(int i=0;i<2;i++){
int tmp=0;
while((c=getchar())!=' '&&c!='\n'){
if(isdigit(c)){
tmp*=10;
tmp+=c-'0';
}... | 0 | 24,716,571 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
int n;
cin>>n;
vector<int> vec(n);
rep(i,n){
cin>>vec[i];
}
sort(all(vec));
cout<<... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define put(a) cout<<a<<... | 0 | 14,401,573 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | 0 | 73,042,399 |
#include <bits/stdc++.h>
#include <cstring>
#include <ctype.h>
#include<stdlib.h>
#define flin freopen("input.txt", "r", stdin);
#define flout freopen("output.txt", "w", stdout);
#define ll long long
#define ull unsigned long long
#define fastio ios_base::sync_wit... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 76,859,696 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | 0 | 31,055,918 |
#include <bits
#define rep(i,n) for(int i = 0;i < n;i++)
using namespace std;
typedef long long ll;
int main(){
int h,w;
cin>>h>>w;
string s[h];
for(int i=0;i<h;i++){
cin>>s[i];
}
for(int i=0;i<h;i++){
cout<<s[i]<<endl;
cout<<s[i]<<endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char* argv[]) {
string s;
cin >> s;
long long K;
cin >> K;
s += s + s;
long long base = 0;
bool changed[s.size()];
changed[0] = false;
for (int i = 1; i < s.size() / 3; ++i) {
if (s[i] == s[i - 1] && !changed[i - 1]) {
... | 0 | 38,666,653 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define reps(i,n) for(int i=1;i<=(int)n;i++)
#define all(v) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin>>n;
string s,t;
cin >> s>>t;
int co=0;
int ans=0;
rep(i,n){
int co=0;
rep(j,n-i){
if(t.at(j)==s.at(j+i)){
... | 0 | 80,660,665 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int r, g, b, n;
cin >> r >> g >> b >> n;
int result = 0;
for (int i = 0; i <= n / r; i++) {
for (int j = 0; j <= (n - r * i) / g; j++) {
if ((n - r * i - g * j) % b == 0) result++;
}
}
std::cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
signed main()
{
SPEED;
int n;
cin>>n;
int a[n],b[n],c[n],dp1[n]={0},dp2[n]={0},dp3[n]={0};
for(int i=0;i<n;i++)
{
cin>>a[i]>>... | 0 | 66,717,079 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
const int N=1e5+5;
vector<int>ve[N];
priority_queue<int>qe;
int main()
{
int n,m;
cin>>n>>m;
int a,b;
for(int i=0;i<n;i++)
{
cin>>a>>b;
if(m-a+1<1)continue;
ve[m-a+1].push_back(b);
}
int anx=0;
for(int i=m;i>=1;i--){
for(int j=0;j<... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a ... | 0 | 35,185,131 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,x,y,a,b;
cin >> n >> m >> x >> y;
int MXx = -101,MNy = 101;
for ( int i = 0; i < n; i++){
cin >> a;
MXx = max(MXx,a);
}
for ( int i = 0; i < m; i++){
cin >> b;
MNy = min(MNy,b);
}
for ( int i = x + 1; i <= y; i++){
if... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 0 | 55,122,748 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rev(x) greater<x>()
#define MOD 1000000007
#define INF 1000000000
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a, pair<int, int> b)
{
if (a.second != b.second) {
return a.second < b.s... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int num;
int len;
cin >> num >> len;
string words[num];
for (int i = 0; i < num; i++)
{
cin >> words[i];
}
for (int i = 0; i < num - 1; i++)
{
for (int j = num - 1; j > i; j--)
{
string tem... | 0 | 86,961,936 |
#include <iostream>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
int ans = -1;
for(int i = 1 ; i <= 1000 ; i++){
if(int(i * 0.08) == a && int(i * 0.1) == b){
ans = i;
break;
}
}
cout << ans;
} | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 79,931,757 |
#include<iostream>
int main(){
int K,X;
std::cin >> K >> X;
if (K*500 >= X) std::cout << "Yes\n";
else std::cout << "No\n";
} | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 63,222,038 |
#include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vecto... | #include <cstdio>
#include <cstdlib>
#include <cstring>
struct Node {
int key;
Node* prev;
Node* next;
};
Node* nil;
void Init() {
nil = (Node*)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void PrintList() {
Node* cur = nil->next;
int isf = 0;
while (1) {
if (cur == nil) break;
if... | 0 | 51,552,541 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 10001;
vector<int> par(N);
vector<int> ran(N);
int find(int a){
if(par[a] == a)
return a;
else{
par[a] = find(par[a]);
return par[a];
}
}
void merge(int a, int b){
if(ran[find(a)] < ran[... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 38,957,114 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000001;
constexpr ll INF= 9 * 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
struct edge{
ll to,cost;
};
typedef pair<int,int> P;
int V;
vector<edge> G[100010];
ll d[100010];
... | #include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
int kyu[] = {2000, 1800, 1600, 1400, 1200, 1000, 800, 600, 400};
for (int i = 0; i < 9; i++) {
if (X >= kyu[i]) {
cout << i << endl;
break;
}
}
return 0;
} | 0 | 96,025,453 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a, b... | #include<iostream>
#include<algorithm>
#define MOD 1000000007
using namespace std;
typedef long long ll;
signed main(){
ll n,m,xsum=0,ysum=0,ans=0;
cin >> n >> m;
ll tx[n],ty[m],x[n],y[m];
for(ll i=0;i<n;i++){
cin >> tx[i];
}
for(ll i=0;i<m;i++){
cin >> ty[i];
}
sort(tx,tx+n);
sort(ty,ty+m);
... | 0 | 97,213,130 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(ll N, vector<ll> A, vector<ll> B)
{
ll ans = 0;
ll need = 0;
vector<ll> beyond;
for(int i=0;i<A.size();++i)
{
if(A[i] < B[i])
{
ans++;
need += B[i] - A[i];
}else
{
... | #include<iostream>
#include<stdio.h>
using namespace std;
int parent(int i) {
return i / 2;
}
int left(int i) {
return 2 * i;
}
int right(int i) {
return 2 * i + 1;
}
int main() {
int n, A[100001];;
cin >> n;
for (int j = 1; j <= n; j++) scanf("%d", &A[j]);
for (int j = 1; j <= n; j++) {
... | 0 | 81,092,949 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S,C;
cin >> S >> C;
if(S[2] != C[0]){
cout << "NO" << '\n';
}else if(S[1] != C[1]){
cout << "NO" << '\n';
}else if(S[0] != C[2]){
cout << "NO" << '\n';
}else{
cout << "YES" << '\n';
}
return 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; ... | 0 | 96,093,250 |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<stack>
#include<iostream>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define vec(a) vector<int>a
using namespace std;
bool isPrime(ll n)
{
if(n==1||n==2||n==3||n==5||n==7)
... | #include<cstdio>
#include<cstring>
using namespace std;
char s[102];
int a[101];
int main(){
scanf("%s",s+1);
int n=strlen(s+1),k;
scanf("%d",&k);
for(int i=1,o=1;i<=n;i++){
if(s[i]!=s[i+1]){
a[++a[0]]=i-o+1;
o=i+1;
}
}
long long ans=0;
if(s[1]==s[n]){
if(a[0]==1)ans=1ll*n*k/2;
else{
for(int i=2... | 0 | 89,780,339 |
#pragma region header
#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>
#inc... | #include <bits/stdc++.h>
using namespace std;
pair<int64_t,int> p[100005];
map<int,int> c;
map<int,int> w;
int main(){
int n,k;
cin >> n >> k;
int t;
int64_t d;
int64_t whole=0;
for(int i=0;i<n;i++){
cin >> t >> d;
p[i]=make_pair(d,t);
if(w[t]==0)whole++;
w[t]++; ... | 0 | 31,791,802 |
#include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) x.begin(),x.end()
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int x,a;
cin >> x >> a;
if (x < a) cout << 0 << endl;
else cout << 10 << endl;
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 0x3f3f3f3f3f3f3f3f;
#define rep(i, a, b) for(int i = int(a); i <= int(b); i++)
#define N 5005
int P[N], C[N];
int main() {
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> P[i];
for(int i = 1; i <= n; i++) cin >> C[i];
ll... | 0 | 81,462,562 |
#include <bits/stdc++.h>
#warning !!!check the size of arrayss!!!
#define INF 100000000000000005
#define inf 1000000000
#define MOD 1000000007
#define newMOD 998244353
#define MAX 300006
#define pi 3.1415926535897932384626433832795
#define ld long double
#define ll long long
#define int long... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int inf=0x3f3f3f3f;
int map[15][15];
void floyd(int n)
{
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
{
for(int k=0;k<n;++k)
{
map[j][k]=min(map[j][k],map[j][i]+map[i][k]);
}
}
}
}
void init(int n)
... | 0 | 76,646,487 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(2);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";new... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
int n;
vector<lint> a;
bool isValid(lint m) {
lint count = 0;
for (int i = 0; i < n; i++) {
lint b = max(0LL, a[i] + m - (n - 1));
count += (b + n) / (n + 1);
}
return count <= m;
}
bool isValid2(lint m) {
lint cou... | 0 | 25,708,578 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll m, k;
int main()
{
cin>>m>>k;
if((1 << m) <= k || m == 1 && k == 1)
{
printf("-1\n");
return 0;
}
if(m == 1 && k == 0)
{
printf("0 0 1 1\n");
return 0;
}
for(ll i = 0; i < ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | 0 | 2,855,933 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.