code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long
#define inf 999999999999
#define mx 200005
#define gcd __gcd
#define pb push_back
#define mk make_pair
#define bs binary_search
#define ub upper_bound
#define lb lower_bound
#define endl "\n"
#define vl vector<ll>
#define vs vector<string>
#define non ... | #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, K;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
cout << N - K << endl;
return 0;
} | 1 | 15,929,637 |
#include <iostream>
using namespace std;
int main() {
int n;
while(1) {
cin >> n;
if (!n) break;
int maxsum = -1000000;
int sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
if (sum > maxsum) maxsum = sum;
if (sum < 0) sum = 0;
}
cout << maxsum << endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int nn[5001] = { 0 }, temp, n, max = -110000;
while (cin >> n && (n != 0)){
for (int i = 0; i < n; i++){
cin >> nn[i];
}
temp = nn[0];
for (int i = 1; i < n; i++){
temp += nn[i];
if (temp < nn[i]) temp = nn[i];
if (max < temp)... | 1 | 45,754,485 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size())cout << a[i] << " ";cout << "\n"
#define vecvec(a) vector<vector<(... | #include <bits/stdc++.h>
using namespace std;
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using mii = map<int, int>;
using ... | 1 | 86,436,638 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i; i<n; i++)
typedef long long ll;
using namespace std;
int main(){
int n,a,ans;
cin >> n >> a;
ans = n*n -a;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
ll n,a;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>a;
cout<<(n*n-a);
return 0;
} | 1 | 93,586,459 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; ++i)
#define rep(i, n) repl(i, 0, n)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define chmax(x,y) x = max(x, y)
#define chmin(x,y) x = min(x, y)
using namespace std;
usin... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include<debug.h>
#else
#define db(...) 21
#endif
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++... | 1 | 1,271,023 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
using namespace std;
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int i = (m); (i) < (n); (... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
const l... | 1 | 73,601,792 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<vector>
#define LL long long
#define maxn 1000009
using namespace std;
const LL MOD = 1e9+7;
int aa[maxn];
int id[maxn];
LL fact[maxn+5];
LL a[maxn+10];
LL pow(LL x)
{
LL n = MOD-2;
LL res=1;
while(n>0... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
const ll MAX = 100010;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
... | 1 | 86,061,332 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; i++) cin >> x.at(i);
int s = 0, t = 0;
for(int X : x) {
s += X;
t += X * X;
}
int p = s / n;
int m1 = (n * p * p) - (2 * p * s);
p++;
int m2 = (n * p * p) - (2 * p * s);
in... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, c) for(int i = 0; i < (int)c; i++)
const int inf = 1000000000;
int main() {
int N;
cin >> N;
vector<int> X(N);
rep(i, N) cin >> X[i];
int ans = inf;
for(int i = 1; i <= 100; i++) {
int cost = 0;
rep(j, N) cost += (X[j] - i) * (X[j] - i);
ans... | 1 | 23,891,060 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)(n); i++)
const ll MOD = 1000000007;
const int INFI = 1000000000;
const ll INFL = (1LL << 60);
int main() {
ll N;
cin >> N;
vector<int> A(N);
map<int, int> car... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define rep(i,N) for(ll i=0;i<(N);i++... | 1 | 76,810,292 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
vector<int> check(n, 0);
int tmp = 1, count = 0;
while(tmp != 2){
if(check[tmp - 1] == 1){
count = -1;
... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)cin >> A[i];
int Q = 1;
for (int i = 0; i < N; i++) {
if (A[Q - 1] == 2) {
cout << i + 1 << endl;
return 0;
}
else Q = A[Q - 1];
if (i == N - 1) {
cout << -1 << endl... | 1 | 82,173,536 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
REP(i,s.size()) {
if (i % 2 == 0) cout << s[i];
}
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string s,sout="";
cin >> s;
for(auto itr=s.begin();itr<s.end();itr+=2)
sout+=(*itr);
cout << sout << endl;
} | 1 | 96,511,397 |
#include <cstdio>
#include <iostream>
using namespace std;
int cnt;
struct Card{char suit,v;};
void selection_sort(Card *C,int N){
for(int i=0;i<N;i++){
int minj=i;
for(int j=i;j<N;j++){
if(C[j].v<C[minj].v)minj=j;
}
Card t;
t=C[i];
C[i]=C[minj];
C[minj]=t;
}
}
void bubble_sort(Car... | #include <iostream>
class Card
{
public:
char mark;
int num;
};
void bubble_sort(Card R[],int n);
void selection_sort(Card R[],int n);
void print(Card R[],int n);
bool check_stable(Card R1[],Card R2[],int n);
int main(int argc, char const *argv[])
{
Card C1[40],C2[40];
int n;
std::cin >> n;
... | 1 | 100,715,019 |
#include <stdio.h>
#include <stdlib.h>
#define N 1000000
typedef struct node{
int p;
int right;
int left;
}Node;
int main(){
int n,i,j,l,c,k,id,P,depth,r;
Node a[N],tmp;
scanf("%d",&n);
for(i=0;i<n;i++){
a[i].p = -1;
a[i].right = -1;
a[i].left = -1;
}
for(i=0;i<n;i++){
scanf("%d%d",&id... | #include <stdio.h>
#define N 100000
#define NIL -1
typedef struct tree {
int p,l,r;
}tax;
tax T[N];
int main()
{
int n,i,j,k,id,center,temp1,temp2;
scanf("%d",&n);
for(i=0;i<n;i++){
T[i].p=T[i].l=T[i].r=NIL;
}
for(i=0;i<n;i++){
scanf("%d %d",&id,&k);
for(j=0;j<k;j++){
scanf("%d",¢er);
... | 1 | 34,982,441 |
#include<iostream>
using namespace std;
int main(){
int m,n;
for(m=1;m<10;m++){
for(n=1;n<10;n++){
cout << m << "x" << n << "=" << m*n << endl;
}
}
return 0;
} | #include<cstdio>
main(){
FILE *fp = fopen("test","r");
int tmp=0;
if (fp != NULL)fscanf(fp,"%d",&tmp);
if (tmp == 1124)return 1;
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
printf("%dx%d=%d\n",i,j,i*j);
}
}
return 0;
} | 1 | 26,024,500 |
#include <iostream>
#include <cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
typedef pair<double,double>P_D;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprev(i, n) for (int i = n - 1; i >= 0; i--)
#define M... | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <queue>
#include <math.h>
#include <bitset>
#define INF 100000000000
#define N 100001
#define ll long long
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
ll sum=0;
if (k%2==1){
ll count=0;
for (ll i=1; i<=n; i+... | 1 | 57,032,048 |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define x first
#define y second
#define ll long long
#define lll __int128
#define ull unsigned long long
#define ulll unsigned __int128
#define pii pair<int,int>
#define pb push_back
#define eb emplace_bac... | #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>
#include<assert.h>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int ind... | 1 | 7,849,334 |
#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 ... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main(){
int n;
scanf("%d", &n);
vector<vector<int>> vviNum(n,vector<int>(n, 0));
for(int i = 0; i < n; i++){
string str;
cin >> str;
... | 1 | 23,925,919 |
#include <iostream>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a%b);
}
int main() {
int N, K; cin >> N >> K;
ll *A = new ll[N];
ll M = 0;
for (ll i = 0; i < N; i++) {
cin >> A[i];
M = max(M, A[i]);
... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | 1 | 87,819,416 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
const long long INF = 1LL<<60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<clas... | #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>;
const int MOD=1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c-a+b,0) << endl;
} | 1 | 28,814,094 |
#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... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int n;
cin>>n;
vector<int>arr(n);
for(int i=0; i<n; i++){
cin>>arr[i];
}
ll ans=1000;
for(int i=0; i<n-1; i++){
if(arr[i]<arr[i+1]){
ll num=ans/arr[i];
ans=ans%arr[i];
ans+=num*arr[i+1];
}
}
cout<<ans;
return 0;
} | 1 | 62,490,244 |
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void)
{
ll n, m, ans = 0;
cin >> n >> m;
vector<ll> p(0), a(m), b(m);
for(ll i = 0; i < m; i++) {
cin >> a.at(i) >> b.at(i);
}
for(ll i = 1; i <= n; i++) {
p.push_back(i);
}
do {
if(p.at(... | 1 | 76,889,244 |
#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 N, M;
vector<vector<bool>> Graph(10, vector<bool>(10, false));
int main() {
cin >> N >> M;
rep(i, M) {
int a, b;
cin >> a >> b;
--a, --b;
... | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
typedef long long int ll;
typedef unsigned long long ull;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template... | 1 | 27,413,385 |
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <algorithm>
#include <typeinfo>
#define _USE_MATH_DEFINES
#include <cmath>
using namespace std;
int main(){
int n, t_score, h_score;
t_score = 0;
h_score = 0;
cin >> n;
... | #include<iostream>
#include<string>
using namespace std;
int main () {
int i, n, taro=0, hanako=0;
string t, h;
cin >> n;
for(i=0;i<n;i++) {
cin >> t >> h;
if(t.compare(h) > 0) taro+=3;
else if(t.compare(h) < 0) hanako+=3;
else {taro++; hanako++;}
}
cout << taro <... | 1 | 28,114,337 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int N, A, B, C, X;
while(cin >> N >> A >> B >> C >> X){
if(!N && !A && !B && !C && !X) break;
vector<int> Y(N);
for(int i = 0 ; i < N ; i++) cin >> Y[i];
int cnt = 0, pos ... | 1 | 63,970,630 |
#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 ... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 1 | 21,425,123 |
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#include <queue>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC o... | #include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
int N,M;
string s[110],t[110];
cin>>N;
for(int i=0;i<N;i++){
cin>>s[i];
}
cin>>M;
for(int i=0;i<M;i++){
cin>>t[i];
}
map<string,int> d;
for(int i=0;i<N;i++){
d[s[i]] += 1... | 1 | 64,649,394 |
#include <iostream>
using namespace std;
int main() {
int w, h, x, y, r;
cin >> w >> h >> x >> y >> r;
if ( w >= x + r && h >= y + r && 0 <= x + r && 0 <= y + r && x >= 0 && y >= 0 ) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int w, h;
cin >> w >> h;
int center_x, center_y, r;
cin >> center_x >> center_y >> r;
if (center_x - r<0 || center_x + r>w || center_y - r<0 || center_y + r>h)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | 1 | 90,764,617 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<deque>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef pair<int,int> P;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int main(){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll x, y, z, k; cin >> x >> y >> z ... | 1 | 394,721 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (V)) cout <<x <<" " <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) str... | 1 | 36,655,510 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char a[15];
for(int i=1;i<=12;i++)
{
cin>>a[i];
}
for(int i=1;i<=4;i++)
{
cout<<a[i];
}
cout<<" ";
for(int i=5;i<=12;i++)
{
cout<<a[i];
}
cout<<endl;
return 0;
} | using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define int long long
const int INF=1e18;
const int MOD=1e9+7;
#define infile "../test/sample-1.in"
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
#define fi first
#define se second
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n... | 1 | 84,708,120 |
#include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int,i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,sum=0;
cin>>n>>k;
vector<int> v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
for(int i=0;i<k;i++)
{
sum+=v[i];
}
cout<<sum<<"\n";
return 0;
} | 1 | 21,217,029 |
#include <iostream>
#include <string>
#include <vector>
#include <cassert>
#include <algorithm>
#include <math.h>
#include <set>
#include <map>
using namespace std;
#define ll long long int
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repp(i, n) for(int i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (v).... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 1 | 85,621,745 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a);... | 1 | 65,078,925 |
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
if ( C > A - B ) {
cout << C - A + B << endl;
}
if ( C <= A - B ) {
cout << 0 << endl;
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... | 1 | 76,285,527 |
#include <iostream>
#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;
int N;
long long h[1000... | #include <bits/stdc++.h>
using namespace std;
int dp[100000]={0};
int main(){
int N;
cin >> N;
vector<int> h(N);
for(int i=0;i<N;i++) cin >> h.at(i);
dp[0]=0;
dp[1]=abs(h.at(1)-h.at(0));
for(int i=2;i<N;i++){
dp[i] = min(dp[i-1]+abs(h.at(i)-h.at(i-1)), dp[i-2]+abs(h.at(i)-h.at(i-2)))... | 1 | 26,689,637 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #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(... | 1 | 31,234,462 |
#include <iostream>
using namespace std;
int main(){
int n, a, b;
std::cin >> n >> a >> b;
if((b - a - 1) % 2 == 1){
std::cout << "Alice" << '\n';
}else{
std::cout << "Borys" << '\n';
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ff(i,n) for(i=0;i<n;i++)
ll bg = 1000000007;
ll power(ll x,ll y)
{
if(y==0)
return 1;
ll h=power(x,y/2)%bg;
h=(h*h)%bg;
if(y%2==1)
return (x*h)%bg;
else
... | 1 | 63,660,368 |
#include <iostream>
#include <string>
using namespace std;
#define rep(i,n) for((i)=0;(i)<(n);(i)++)
#define max(a,b) ((a)>(b) ? (a) : (b))
#define min(a,b) ((a)<(b) ? (a) : (b))
typedef long long ll;
typedef long double ld;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main(){
ll n,m,k,i,j,result=0,x;
int dp[20001... | #define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 1000000007LL
#define LLINF 100000000000000005LL
#define INF (int)1e9+1
template <typename A, typename B>
s... | 1 | 92,896,859 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const long long INF = 1000000000000;
const long long N = 10000;
long long n,m;
struct edge{
long long from,to,cost;
}w[N];
long long d[N];
void path(long long s){
for(long long i=0;i<n;i++) d[i]=INF;
d[s] = 0;
while... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
using namespace std;
typedef pair<int, int> P;
const int INF = 1e13;
int n, m;
int d[110][110];
void init(int ... | 1 | 65,401,369 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, k;
cin >> n >> k;
if(k > (n - 1) * (n - 2) / 2){
cout << -1 << endl;
}
else{
int m = (n * (n - 1) / 2) - k;
cout << m << endl;
for(int i = 1; i <= n-1; i... | 1 | 10,763,250 |
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
int main() {
int n, m; cin >> n >> m;
vector<int> arr(m);
for (int i = 0; i < m; ++i) {
cin >> arr[i];
}
map<int, int> match;
vector<int> match_nums = {2,5,5,4,5,6,3,7,6};
fo... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; ++i)
typedef long long ll;
int num(int a){
switch(a){
case 1:
return 2;
case 2:
return 5;
case 3:
return 5;
case 4:
return 4;
case 5:
... | 1 | 5,144,823 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string S, T;
cin >> S >>T;
int ans=0;
for (int i=0; i<3; i++) {
if (S.at(i)==T.at(i)) {
ans=ans+1;
}
}
cout << ans << endl;
} | #include<stdio.h>
#include<math.h>
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
string S;
cin >> S;
string T;
cin >> T;
int a;
a = 0;
int b;
b = 0;
while(a<3)
{
if (S[a] == T[a])
{
b++;
}
a++;
}
cout << b << endl;
} | 1 | 95,007,164 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (ll i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (ll i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,x) for (ll i = 0; i < x.size(); i++)
#define RREPALL(i,x) for (ll i = x.size()-1; i >= 0; i--)
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, k; cin >> n >> k;
int r = (n - 1) * (n - 2) / 2 - k;
if (r < 0) {
cout << -1 << endl;
... | 1 | 45,189,689 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B, C, K;
string result;
cin >> A >> B >> C >> K;
while(K > 0){
if(B <= A || C <= B){
if(B <= A){
B *= 2;
}
else{
C *= 2;
}
K--;
}
else{
break;
}
}
result = (A < B && B < C) ? "Yes" : "No";
cout << result;
return 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a,b,c,k;
cin >> a >> b >> c >> k;
string ans = "No";
rep(i,k) {
if(b >= c) c *= 2;
else if(a >= b) b *= 2;
if(a < b && b < c) {
ans = "Yes";
break;
... | 1 | 100,065,752 |
#include <iostream>
using namespace std;
int main() {
bool judge = true;
int x;
int n = 0;
while (judge) {
cin >> x;
n++;
if (x != 0) {
cout << "Case " << n << ": " << x << endl;
} else {
judge = false;
}
}
return 0;
} | #include<iostream>
using namespace std;
int main() {
int x,i;
x = 1;
for (i = 1; ; i = i+1) {
cin >> x;
if (x < 1) {
return 0;
}
cout << "Case " <<i<<": "<<x<< endl;
}
return 0;
} | 1 | 68,356,957 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
int n, m; cin>>n>>m;
vector<int> h(n);
forin(h, n);
vector<boo... | #include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m;
int height[N];
int maxHeight[N];
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &height[i]);
for (int i = 1; i <= m; ++i) {
int u, v;
scanf("%d %d", &u, &v);
maxHeight[u] = ma... | 1 | 99,881,651 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
ll sum(int l, int r) {
return ll(l+r)*(r-l+1)/2;
}
int main() {
int n,k;
cin >> n >> k;
ll ans = 0;
for (int i = k; i <= n+1; i++) {
ll min_sum = sum(0, i-1);
ll max_s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for(ll i=0;i<(n);i++)
#define FOR(i, a, b) for(ll i=(a);i<(b);i++)
#include <iostream>
#include <vector>
using namespace std;
vector<ll> buf;
void permutation(ll i, const ll size, const ll range_start, const ll range_end)
{
if (i... | 1 | 44,804,219 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, t, c;
cin >> N;
t = N; c = 0;
while(t > 0) {
c += t % 10;
t /= 10;
}
if(N % c == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x=0;
int y=N;
string z="No";
while(y>10){
x+=y%10;
y/=10;
}
x+=y;
if (N%x==0)
z = "Yes";
cout <<z<<endl;
} | 1 | 92,829,517 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
set<int> prime;
prime.insert(2);
prime.insert(3);
prime.insert(5);
prime.insert(7);
prime.insert(11);
prime.insert(13);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | 1 | 9,633,989 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int r,g,b;
int k;
cin>>r>>g>>b>>k;
while(g<=r){
k--;
g*=2;
}
while(b<=g){
k--;
b*=2;
}
if(k>=0)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
REP(... | 1 | 32,742,949 |
#include <iostream>
using namespace std;
int w, h;
char tile[21][21];
int dx[] = {-1, 0, 0, 1};
int dy[] = { 0,-1, 1, 0};
int dfs(int x, int y){
if(x<0 || w<=x || y<0 || h<=y) return 0;
if(tile[y][x] == '#') return 0;
tile[y][x] = '#';
int count = 1;
for(int i=0; i<4; i++){
count += dfs(x+dx[i], y+dy[i]);
}
re... | #include <iostream>
#include <string>
using namespace std;
int W, H, ans;
int tile[20][20];
void DPS(int x, int y);
int main() {
int sx = 0, sy = 0;
string str;
while (cin >> W >> H, W, H) {
for (int i = 0; i < H; i++) {
cin >> str;
for (int j = 0; j < W; j++) {
tile[i][j] = (str[j] == '#') ? 0 : 1;
... | 1 | 94,020,515 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define INF 1e9
int MOD = 1e9+7;
ll a[103];
ll n,K;
ll dp[103][(ll)(1e5+1)];
int main(){
cin>>n>>K;
memset(dp,0,sizeof dp);
for(ll i=0;i<n;i++) cin>>a[i];
dp[0][0]=1;
for(int i=0;i<n;i++){
vector<ll> to_add(K+1);
for(ll used=0;used<=K;used+... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
const ll mod = 1e9+7;
main(){
int n,k;cin>>n>>k;
int a[n+1];
for(int i=1;i<=n;i++) cin>>a[i];
ll dp[n+1][k+1];
dp[0][0]=1;
for(int i=1;i<=k;i++){
dp[... | 1 | 90,123,692 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | #include <iostream>
using namespace std;
int main(void){
int n,k;
cin >> n >> k;
cout << (n+1-k) << endl;
return 0;
} | 1 | 57,984,149 |
#include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n... | 1 | 70,800,447 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<set>
#include<tuple>
using namespace std;
typedef long long ll;
const ll MAX = 1000+1;
struct point
{
ll p, i, j, k;
point(ll p,ll i,ll j, ll k):p(p),i(i),j(j),k(k){}
bool operator< (const point &rhs)const
{
return ... | 1 | 8,876,107 |
#include <bits/stdc++.h>
#define newl "\n"
using namespace std;
using lli = long long int;
using vvint = vector <vector <int>>;
const int mod = 1e9 + 7;
const int N = 2e5 + 1;
void solve(){
string s;
cin >> s;
int n = s.length();
int ans = 1e9;
for(int i = 0;i < n - 2;++i){
int num = stoi(s.substr(i,3));
ans =... | #include<bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
int size = s.size();
int64_t sint = stoll(s);
int64_t tenpros = 10;
for(int i = 0; i < size - 4; i++) {
tenpros *= 10;
}
vector<int> spartint(size - 2);
for(int i = 0; i < size-2; i++) {
spartint.at(i) = sint / tenpros... | 1 | 48,038,878 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n;
cin>>n;
map<char,int> S;
string s1;
cin>>s1;
rep(i,s1.length()){
S[s1[i]]++;
}
for(int i=1;i<n;i++){
str... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<string> a(n);
for (string &i : a) cin >> i;
vector<vector<int>> f(n, vector<int>(26, 0));
for (int i = 0; i < n; i++) {
for (char c : a[i]) {
f[i][c - 'a'] += 1;
}
... | 1 | 60,094,933 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
vector<int> found_char(26,0);
for(int i=0;i<s.size();i++){
char wk=s.at(i);
found_char.at(wk-'a')++;
}
bool flg=false;
char not_found='?';
for(int i=0;i<26;i++){
if(found_char.at(i)==0){
not_found=(char)(i+'a'... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
string S;
cin >> S;
bool alphabet[26];
rep(i, 26) alphabet[i] = false;
for (int i = 0; S[i] != '\0'; ++i) {
alphabet[S[i]-'a'] = true;
... | 1 | 82,509,486 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <iostream>
int main() {
int n, m; std::cin >> n >> m;
int sum = 0;
sum += (n*(n-1))/2;
sum += (m*(m-1))/2;
std::cout << sum << std::endl;
return 0;
} | 1 | 35,534,800 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<string>sub;
for(int i = 0; i<s.size(); i++) {
string subst = "";
for(int j = i; j<s.size(); j++){
subst+=s[j];
sub.push_back(subst);
}
}
int ans = 10000000... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int ans = T.length();
for(int i = 0; i <= S.length() - T.length(); i++) {
int d = 0;
for(int j = 0; j < T.length(); j++) {
if(T[j] != S[i + j]) {
d++;
}
... | 1 | 97,984,067 |
#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>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int main() ... | 1 | 44,482,229 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
static const int N = 1000;
int lcs(string X, string Y) {
int c[N + 1][N + 1];
int m = X.size();
int n = Y.size();
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (X[i] == Y[j]) {
if (i == 0 || j == 0)
... | 1 | 52,044,750 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
... | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | 1 | 86,753,134 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 1000000007;
const ll MOD2 ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N;
cin >> N;
vector<int> slime(N);
for( int i = 0; i < N; i++ ) cin >> slime.at(i);
int ans = 0;
int count = 1;
for( int i = 1; i < N; i++ ){
if( slime.at(i-1) == slime.at(i) ){
count++;
}else{
ans ... | 1 | 17,143,387 |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
const int INF = 100000000;
int main(){
int dp[1000];
fill(dp,dp+1000,INF);
dp[0] = 0;
int serve[] = {1,5,10,50,100,500};
for(int i = 1; i < 1000; i++){
for(int j = 0; j < 6; j++){
if(i - serve[j] >= 0){
dp[i] = min(dp[i],dp[i-se... | #include <iostream>
#include <algorithm>
using namespace std;
int main ( void )
{
const int m[] = { 1, 5, 10, 50, 100, 500 };
int n;
while ( cin >> n, n )
{
n = 1000 - n;
int count = 0;
for (int i = 5; i >= 0; --i)
{
count += n / m[i];
n %= m[i];
}
cout << count << endl;
}
return 0;
} | 1 | 49,749,844 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
int m_c(0), c_index(-1);
cin >> S;
if (S.at(0) == 'A')
{
for (int i = 2; i < S.size() - 1; ++i)
{
if (S[i] == 'C')
{
m_c++;
c_index = i;
}
... | #pragma region header
#define _GLIBCXX_DEBUG
#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>... | 1 | 19,300,432 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cstring>
#include<queue>
#define INT_MAX 1<<30
using namespace std;
const int INF=100000;
char s[1111];
int maze[1111][1111];
int N,H,W;
int sx,sy,ans,aim;
int d[1111][1111];
int dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};
typedef pair<int,int> P;
void bfs(int x,... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1100;
int h,w,n,dis[maxn][maxn],sx,sy,ans=0;
char maze[maxn][maxn];
int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int>P;
int bfs(int x,int y,int c){
char order=c+'0';
for(int i=1;i<=... | 1 | 76,459,288 |
#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 a, b, c, k;
cin >> a >> b >> c >> k;
int ans = 0;
if (k > 0) {
ans += min(k, a);
k-=a;
}
if (k > 0) {
k-=b;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | 1 | 2,661,462 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s, t;
cin >> s >> t;
if(s[0] == t[2] && s[1] == t[1] && s[2] == t[0]) cout << "YES" << "\n";
else cout << "NO" << "\n";
} | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | 1 | 786,180 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,d;
cin>>n>>d;
int x[n][d];
for(int i=0;i<n;i++){
for(int j=0;j<d;j++){
cin>>x[i][j];
}
}
int num=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
int su=0;
for(int k=0;k<d;k++){
su+... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
void b_good_distance(void) {
int n, d;
int x[20][20] = { 0 };
cin >> n >> d;
for (int j = 1; j <= n; j++) {
for (int i = 1; i <= d; i++) {
cin >> x[j][i];
}
}
int cnt = 0;
for (int j = 1; j < n; j++) {
for ... | 1 | 45,646,472 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
bool is_parindrome(int tested){
int tot = 0;
for (int i=0;i<=26;i++) {
if (((tested >> i) & 1) == 1)
tot++;
}
if (tot > 1)
return(false);
else
return(true);
}
int n, bit[200001] = {};
int split[(1<<26)] = {};
int m... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 2e5 + 100, maxm = 1 << 26, INF = 0x3f3f3f3f;
int dp[maxm + 5];
char s[maxn];
inline int idx(char c){return c - 'a';}
int main()
{
scanf("%s", &s);
int len = strlen(s);
memset(dp, INF, sizeof dp); dp[0] = 0;
int tmp = 0;
... | 1 | 48,319,615 |
#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define of(i,l,r) for(int i=l;i>=r;i--)
#define fe(i,u) for(int i=head[u];i;i=e[i].next)
#define el putchar('\n')
#define ta putchar(' ')
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
inline void open(const char *s)
{
#ifndef ONLIN... | #include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define pb push_back
#define F first
#define S second
using namespace std;
const int N = 1e5+10;
int a[N];
vector<int> vec[N];
bool mark[N];
int dfs(int v,int p){
mark[v]=1;
int tot=0,ch=0,maxx=0;
for(int u:vec[v]){
if(mark[u])
... | 1 | 98,786,863 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
vector<string> G(x);
vector<vector<int>> flip(x,vector<int>(y));
for (auto &s : G) cin >> s;
if (G[0][0] == '.') flip[0][0] = 0;
else flip[0][0] = 1;
for (int i = 1; i < y; i++) {
flip[0][i] = flip[0][i-1];
if (G... | #include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int ... | 1 | 93,379,081 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
void add_self(int& a, int b) {
a += b;
if(a >= mod) {
a -= mod;
}
}
int main(){
float d,t,s;
cin>>d>>t>>s;
if ((d/s)>t){
cout<<"No";
}
else{
cout<<"Yes";
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
int d, t, s;
cin >> d >> t >> s;
cout << ((d + s - 1) / s <= t ? "Yes" : "No") << '\n';
return 0;
} | 1 | 40,037,608 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <numeric>
#include <queue>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <map>
#include <functional>
#include <limits>
#include <set>
#include <stack>
#define r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100010;
int n;
ll a[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
sort(a + 1, a + n + 1);
int l = 1, r = n, ans;
auto chk = [&](int x) {
ll s = a[x];... | 1 | 61,047,715 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long f... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 1 | 57,247,336 |
#include<bits/stdc++.h>
#include<string>
using namespace std;
int N = 0, A = 0 ;
void solve(){
int sum = 0;
sum = N % 500;
if (sum <= A){
cout << "Yes";
}
else {
cout << "No";
}
}
int main() {
cin >> N;
cin >> A;
solve();
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
if ((N - A) <= N / 500 * 500) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 1 | 51,399,348 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
usin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | 1 | 22,023,740 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s, t, m;
cin >> n >> s >> t;
for(int i = 0; i<s.size() * 2; i++){
if(i%2 == 0)
m += s.at(i/2);
else
m += t.at(i/2);
}
cout << m << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
cout << fixed << setprecision(6);
int n; cin >> n;
string s,t; cin >> s >> t;
string out ="";
for (int i = 0; i < n; i++)
{
... | 1 | 28,951,397 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int cmpChar(char *pchar){
if(strlen(pchar) == 0) return 0;
int rc = 0;
if(memcmp(pchar, "dreamer", 7) == 0){
rc = cmpChar(pchar + 7);
if(rc == 0) return rc;
}
if(memcmp(pchar, "dream", 5) == 0){
rc = cmpChar(pchar + 5);... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
vector<string> strs = {"dream", "dreamer", "erase", "eraser"};
for (auto& str : strs) {
reverse(str.begin(), str.end());
}
reverse(s.begin(), s.end());
bool result = true;
while (s.size() != 0) {
b... | 1 | 95,565,834 |
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
typedef long long ll;
const int N = 1010;
int main()
{
char a[5];
scanf("%s", a);
int r = 0, ans = -1;
for(int i = 0; i < 3; i++)
{
if(a[i] == 'R') r++;
else r = 0;
ans = max(ans, r);
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
bool is_integer(double x) {
return std::floor(x)==x;
}
int main(){
int ans(0);
char c[3];
rep(i,3){
cin >> c[i];
if(c[i]=='R')
an... | 1 | 92,900,638 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin>>a>>b>>c>>d;
string ans;
if(a+b>c+d){
ans="Left";
}
else if(a+b<c+d){
ans="Right";
}
else{
ans="Balanced";
}
cout<<ans<<endl;
} | #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() {
int A,B,C,D;
cin >> A >> B >> C >> D;
int left = A+B;
int right = C+D;
string ans = "";
... | 1 | 83,910,876 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string s , t;
cin>>s>>t;
sort ( s.begin() , s.end() );
sort( t.begin() , t.end() );
reverse( t.begin() , t.end() );
if( s < t)
{
cout<<"Yes";
}
else cout<<"No";
} | 1 | 93,886,304 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_NM = 2005;
const ll MOD = 1e9+7;
ll S[MAX_NM],T[MAX_NM];
ll dp[MAX_NM][MAX_NM],sum[MAX_NM][MAX_NM];
int main()
{
ll N,M;
cin >> N >> M;
rep(i,N)
{
cin >> S[i];
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MAXN = 2005;
const ll Mod = 1e9+7;
ll dp[MAXN][MAXN];
int N, M;
int S[MAXN], T[MAXN];
void solve() {
for (int i = N-1; i >= 0; --i) {
for (int j = M-1; j >= 0; --j) {
dp[i][j] += dp... | 1 | 57,592,637 |
#include "bits/stdc++.h"
using namespace std;
int two(int x,int y)
{
int r=0;
while(x<y)
{
x*=2;
r++;
}
return r;
}
double rui(int x)
{
double r=1;
for(int i=0;i<x;i++)
{
r/=2;
}
return r;
}
int main()
{
int n,k;
double ans=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
ans+=rui(two... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | 1 | 4,805,032 |
#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... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#d... | 1 | 81,990,105 |
#include<iostream>
#define INF 1e9
using namespace std;
int main(){
int N;
cin >>N;
int A[N];
int dp[N+1];
for(int i=0 ; i < N ; i++)cin >>A[i];
for(int i=0 ; i < N+1 ; i++)dp[i]=INF;
for(int i=0 ; i < N ; i++){
*lower_bound(dp,dp+N+1,A[i])=A[i];
}
cout <<lower_bound(dp,dp+N+1,INF)-dp<<endl;
ret... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define MAX_P 100000
int a[MAX_P];
int P;
int getLIS(){
int dp[MAX_P];
fill(dp, dp + P, INT_MAX);
rep(i,P) *lower_bound(dp, dp+P, a[i]) = a[i];
return lower_bound(dp, dp+P, INT_MAX) - dp;
}
int main(void){
cin >> P;
rep(i,P)... | 1 | 97,438,658 |
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<cstring>
#include<cstdlib>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
char button1[5]={'.',',','!','?',' '};
char button2[3]={'a','b','c'};
char button3[3]={'d','e','f'};
char button4[3]={'g','h... | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
typedef... | 1 | 46,122,877 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t-... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int N,M;
cin>>N>>M;
vector<int> wa(N,0);
vector<bool> ac(N,false);
rep(i,M)
{
int p;
cin>>p;
string s;
cin>>s;
p--;
if(s=="AC")
{... | 1 | 84,908,232 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
string s,t;
cin >> s >> t;
cout << t+s <<... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
string s,s1;
cin>>s>>s1;
string z=s1+s;
cout<<z<<endl;
return 0;
} | 1 | 71,200,440 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
main()
{
ll a,b;
cin>>a>>b;
if((a*b)%2==0)
cout<<"Even"<<endl;
else
cout<<"Odd"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int C = A * B;
if ( C % 2 == 0 ) {
cout << "Even"; }
else {
cout << "Odd"; }
} | 1 | 80,711,645 |
#include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
#define DEBUG 0
#if DEBUG
#define DLOG(...) fprintf(stderr, __VA_ARGS__)
#else
#define DLOG(...)
#endif
void debug(auto f) {
#if DEBUG
f();
#endif
}
int main() {
ll a, b, c;
cin >> a >> b >> c;
string ans = a == b && ... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 1 | 12,742,721 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int gcd(ll a, ll b) {
return a % b ? gcd(b, a%b) : b;
}
int main() {
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; i++) cin >> A[i];
ll ans = A[0];
for (int i = 0; i < N-1; i++) {
ans = gcd(ans, A[i+1]);
}
cout << ans << endl;
... | 1 | 81,423,286 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n,m;
cin >> n >> m;
vector<bool> ok(n+1, false);
vector<int> pena(n+1);
int ans=0;
rep(i,m){
int p;
string s;
c... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int a,int b){return (int64_t)a*b/gcd(a, b);}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int a){if(a<=1)return false;for(int i=2;(int64_t)i*i<=a;i++){if(a%i==0)return false;}return ... | 1 | 44,082,747 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
#define rep2(i,m,n) for(int i=int(m);i<int(n);i++)
#define drep2(i,m,n) for(int i=int(m-1);i>=int(n);i--)
#define rep(i,n) rep2(i,0,n)
#define drep (i,n) drep2(i,n,0)
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main (){
int N, M, K;
cin >> N >> M >> K;
for (int i = 0; i <= N; i++)
{
for (int j = 0; j <= M; j++)
{
int sum = N * j + M * i - 2 * i * j;
if (sum == K)
{
cout <<... | 1 | 54,994,820 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n);i>=(j);i--)
using ll=long long;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retu... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int h[n];
for(int i = 0; i < n; i++) cin >> h[i];
int res = 0;
while (true)
{
if(*max_element(h, h + n) == 0) break;
int i = 0;
while (i < n)
{
if(h[i] == 0) i++;
else {
res++;
while (i < n && h[i] != 0)
{
h[... | 1 | 67,316,445 |
#include<iostream>
#include<string>
#include<vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
sum += a[i];
}
bool f = false;
int cnt = 0;
for (int i = 0; i < n; i++)
{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, sum, cond, count;
sum = 0;
count = 0;
cin >> N >> M;
vector<int> A(N);
for(int i = 0; i < N; i++){
cin >> A[i];
sum += A[i];
}
cond = sum /(4*M) ;
for(int i = 0; i < N; i++){
if(A[i]*4*M >= sum ){
count++;
}
}... | 1 | 50,922,703 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD = 1000000007;
int main(){
int n,z,w; cin >> n >> z>> w;
vector<int> a(n);
for(int i = 0; i < n; ++i){
cin >>a[i];
}
if(n>1){
int ans =max(abs(... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
signed main(){
int n,z,w;cin>>n>>z>>w;
vector<int> a(n);
rep(i,n)cin>>a[i];
int score=max(a[0]-w,w-a[0... | 1 | 18,315,135 |
#include<stdio.h>
#include<stdio.h>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<set>
#include<deque>
#include<queue>
#include<vector>
#include<map>
#include<stack>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#d... | #include<bits/stdc++.h>
using namespace std;
void check(bool p)
{
if(!p)
{
puts("-1");
exit(0);
}
}
const int B = 35;
int N;
long long X[1010];
long long Y[1010];
long long XpY[1010];
long long XmY[1010];
int main()
{
scanf("%d", &N);
for(int i=0; i<N; ++i)
{
scanf("%lld%lld", X+i, Y+i);
XpY... | 1 | 74,131,913 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010, M = 2 * N;
int n, h[N];
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i ++ )
{
int x;
scanf("%d", &x);
h[x] ++ ;
}
int cnt = 0, res = 0;
for (int i =... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0)->sync_with_stdio(false);
int N;
cin >> N;
map<int, int> a;
REP(i, N) {
int tmp;
cin >> tmp;
a[tmp]++;
}
vector<int> diff((int)a.size());
int i = 0;
for (auto x : a) {
diff[i] = x.seco... | 1 | 50,041,470 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.