code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<deque>
#include<queue>
#include<numeric>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LLINF = 1001001001001001001;
const int MOD = 1000000007;... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
using namespace std;
#define REP(i,... | 0 | 10,566,577 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main(){
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for(int i = 0; i < N + 1; i++){
for(int j = 0; j < N + 1; j++){
if(((... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <complex>
#include <iterator>
using namespace std;
typedef pa... | 0 | 5,202,507 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb ... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
int main(){
string S;
cin>>S;
string ans=S;
int t=0,tt=0;
for(int i=0;i<S.length();++i){
if(S[i]=='B'){
if(i+t<=0){
t-=1;
}else{
t-=2;
}
... | 0 | 92,694,715 |
#include <iostream>
#include <cstdio>
#define MAX 100005
#define NIL -1
using namespace std;
struct Node {
int parent;
int left;
int right;
};
Node Tree[MAX];
int D[MAX];
void print(int u) {
printf("node %d: ",u);
printf("parent = %d, ",Tree[u].parent);
printf("depth = %d, ",D[u]);
if (Tree[... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 0 | 42,989,832 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
typedef pair< long long, long long > P;
typedef pair< long long, P > PP;
typedef pair< P, P > PPP;
const double DINF = 5e14, eps = 1e-10;
const long long MOD = 1e9 + 7, INF = 5e18;
const int di[4] = { 1,0,-1,0 }, dj[4] =... | 0 | 36,696,266 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int w, h;
cin >> h >> w;
long long int tot = w*h;
long long int ans = tot/2;
if(tot%2) ans++;
if(h == 1 || w == 1) ans = 1;
cout << ans << "\n";
return 0;
} | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | 0 | 76,395,997 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | #include<bits/stdc++.h>
using namespace std;
long long Max = LONG_MAX;
int n, ar[100050] = {};
long long dp[100005] = {};
void findSolution(int pos, int pre)
{
if(dp[pos] != Max)
{
long long d = abs(ar[pre]-ar[pos]);
d += dp[pos];
dp[pre] = min(dp[pre], d);
return;
}
if(p... | 0 | 34,956,598 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int K;
cin>>S>>K;
int N=S.size();
int x=1;
for(int i=0;i<K;i++){
if(S[i]!='1'){
cout<<S[i];
x*=0;
break;
}
}
if(x==1) cout<<1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string X, Y;
int x, y;
cin >> X >> Y;
if(X == "A") {
x = 10;
}
if(X == "B") {
x = 11;
}
if(X == "C") {
x = 12;
}
else if(X == "D") {
x = 13;
}
else if(X == "E") {
x = 14;
}
else if(X == "F") {
x = 15;
}
if... | 0 | 98,741,331 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep1(i, n) for(ll i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
int main(){
int k;
cin >> k;
ll ans = 0;
rep1(j,k){
ll a = j;
ll d = j;
ll n = k/j;
ll sum = n*(2*a+(n-1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int cal(string x, string y)
{
int n1 = x.size(), n2 = y.size();
vector<vector<int> > dp(n1 + 5, vector<int>(n2 + 5, 0));
for (int i = 0; i < n1; ++i) {
for (int j = 0; j < n2; ++j) {
if (x[i] == y[j]) {
dp[i... | 0 | 68,400,438 |
#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 <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = 100100100;
int main() {
int N;
cin >> N;
vector<P> R(N);
vector<P> B(N);
rep(i, N) ... | 0 | 34,482,114 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s,left,right;
int a, b;
while (cin >> s, s != "-") {
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
left = s.substr(0, b);
right = s.substr(b);
s = right + left;
... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 21,964,062 |
#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 = (1<<30);
int main() {
int a,b;
cin >> a >> b;
for(int i = b * 1... | #include <stdio.h>
#include <string.h>
#include <deque>
#include <iostream>
using namespace std;
int main()
{
deque<int> d;
int n;
int a;
int flag = 0;
cin >> n;
while (cin >> a)
{
if (n % 2 == 0)
{
if (flag % 2 == 0) d.push_back(a);
else d.push_front(a);
}
else
{
if (flag % 2 == 0) d.push_fro... | 0 | 65,288,603 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h1,m1,h2,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int st=h1*60+m1;
int fi=h2*60+m2;
int t=fi-st;
cout << t-k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define int long long int
#define double long double
#define inf (int)(1e15)
#define all(x) (x).begin(), (x).end()
#define pair pair<int, int>
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vect... | 0 | 66,076,658 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
double a, b, x; cin >> a >> b >> x;
x /= a;
double theta;
if (a * b < 2 * x) {
theta = atan2(2 * (a * b - x), a * a);
} else {
th... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 90,642,783 |
#include<bits/stdc++.h>
using namespace std;
int d[100009];
int main()
{
long long n,k,an=0;
cin>>n>>k;
pair<long long ,long long>a[n];
for(int i=0;i<n;i++)cin>>a[i].first>>a[i].second;
sort(a,a+n);
for(auto i: a)
{
an+=i.first*max(0ll,min(k,i.second));
k
-=i.second;
}
cout<<an<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mo=1e9+7;
const int maxn=1e5+10;
int h[maxn];
LL f[maxn];
long long gcd(long long a,long long b,long long &x,long long &y){
if (b==0){
x=1;y=0;
return a;
} else {
long long r=gcd(b,a%b,y,x);
y-=x*(a/b);
return r;
}
}... | 0 | 89,866,327 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
using namespace std;
int main(){
int n, x0, y0, x1, y1, t0, t1;
int kyori, jikan;
x1=0; y1=0; t1=0;
cin >> n;
int ans=0;
rep(i,n){
cin >> t0 >> x0 >> y0;
kyori = abs(x0 - x1) + abs(y0 - y1);
jikan = t0 - t1;
x1=x0; y1=y0; t1=... | #pragma region header
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v... | 0 | 1,881,316 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool to_I[200000];
bool to_N[200000];
int main() {
int N, M;
cin >> N >> M;
int a, b;
for (int i=0; i<M; i++) {
cin >> a >> b;
if (a == 1) to_I[b] = true;
if (b == 1) to_I[a] = true;
if (a == N) to_N[b] = true;
if (b == N) to_N[a] = true;... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h=0,w=0;string s;
cin>>h>>w;
for(int i=0;i<h;++i)
{
... | 0 | 10,714,184 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7; ll LLINF = 1LL << 60; int INF = INT_MAX;
int main(){
string s1,s2; cin>>s1>>s2;
if(s1[0]==s2[2] && s1[2]==s2[0] && s1[1]==s2[1]) c... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
template<class T> inli... | 0 | 96,367,561 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i < (n) ; i ++ )
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using vin=vector<int>;
const int inf=1e9+7;
const ll INF=1e18;
vector<vin> g;
vector<int> seen;
int n,m;
bool go(int x){
if(x==0){
for(au... | #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... | 0 | 50,537,809 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
int main() {
ll n,k;
cin >> n >> k;
ll ans = k;
ans *= pow(k-1,n-1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
typedef pair<int, int> pint;
struct cww{... | 0 | 87,486,141 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cstdio>
#include <cstdint>
#define READINT(X) if(ci-cn+16>cm){while((ct=readchar())>='0')(X)=(X)*10+ct-'0';}else{while((ct=*ci++)>='0')(X)=(X)*10+ct-'0';}
using namespace std;
typedef int_fast64_t ll;
u... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | 0 | 55,097,941 |
#include <bits/stdc++.h>
using namespace std;
int main(){
float N, K;
cin >> N >> K;
cout << ceil((N - K)/(K - 1)) + 1 << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll MAXN = 205;
vector < vector < ll > > d(MAXN, vector < ll > (MAXN, 1e16));
vector < ll > v, r;
vector < bool > used(MAXN, false);
ll ans = LLONG_MAX;
void dfs(){
bool ok = true;
for(auto i : r){
if(!used[i]) ok = false;
}
if(ok){... | 0 | 42,203,371 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include<iostream>
#include<string>
#include<vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >>N;
vector<int> numbers(N) ;
for(int i=0;i<N;i++){
numbers.at(i)=(i+1);
}
int trial_num=0;
for(int i=0;i>=0;i++){
bool finished = false;
for(int j=... | 0 | 33,821,703 |
#include<bits/stdc++.h>
using namespace std;
static const int INF=1e9;
static const int MOD=1000000007;
typedef long long ll;
typedef pair<int,int> P;
int main(){
double n,m,d; cin >> n >> m >> d;
double ans;
if(d==0){
ans=(m-1)/n;
cout << setprecision(10) << ans << endl;
}else{
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 75,279,657 |
#include <stdio.h>
#include <iostream>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string.h>
#include <limits.h>
#include <map>
#include <string>
#include <bitset>
#include <vector>
using namespace std;
int main() {
int n,m,sum=0;
cin>>n... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int>a(n);
vector<int>b(n);
rep(i, 0, n){
cin >> a[i] >> b[i];
}
l... | 0 | 31,634,322 |
#include <iostream>
using namespace std;
int main()
{
int a[101] = {};
int n;
while (cin >> n) {
a[n-1] += 1;
}
int ma = 0;
for (int i = 0; i < 100; ++i) if (ma < a[i]) ma = a[i];
for (int i = 0; i < 100; ++i) if (a[i] == ma) cout << i + 1 << endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <math.h>
#include <complex>
using namespace std;
typedef long long int ll;
typedef complex<long double> Point;
typedef vector<Point> Polygon;
const long double eps=1e-9;
namespace std{
bool operator<(const Point &p,const Point &... | 0 | 54,560,269 |
#include <algorithm>
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
char s[10];
ll p10[20];
bool check(ll x) {
cout << "? " << x << endl;
scanf("%s", s);
return (*s == 'Y');
}
inline ll get1(int x) {
return p10[x - 1];
}
inline ll get9(int x) {
return p10[x] - 1;
}
... | #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<ll, ll>;
const ll INF = ll(1e18) + 5;
int main() {
ll N, K;
cin >> N >> K;
vector<P> td(N);
rep(i, N) {
cin >> td[i].second >> td[i].first;
}
sort(td.rbegin(... | 0 | 56,633,206 |
using namespace std;
typedef long long ll;
#include <string>
#include <vector>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <map>
int main(){
int N;
cin >> N;
vector<ll> ans;
while (N!=0)
{
vector<ll> a;
a.resize(N);
for (int i = 0; i < N; i++) cin >> a[i];
ll thismin = 1e10;
for (i... | #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<ll, ll>;
template <typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n = 0) : n(n), d(n + 1) {}
void add(int i, T x = 1) {
for (i++; i <= n; i += i & -i) d[i] += x;
}
T s... | 0 | 81,905,380 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
int t = 0;
vector<int> vec(N);
for(int i = 0;i < N;++i) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
for(int i = 0;i < M;++i) {
t = t + vec.at(i);
}
cout << t << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second... | 0 | 14,465,904 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
struct Edge {
const int from, to;
Edge(int from, int to) : from(from), to(to) {}
};
vector<vector<Edge>> ReadUndirectedGraph(
int n, int m, bool is_one_indexed=false) {
vector<vector<Edge>> graph(n);
for (int i =... | #include <iostream>
long long mod_pow(long long x, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
long long mod_inverse(long long x, long long mod) {
return mod_pow(x, mod - 2, mod);
}
long lo... | 0 | 30,950,817 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long llu;
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define ep emplace_back
#define sz(a) (int) a.size()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 90,848,538 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
... | #include<iostream>
#include<string>
using namespace std;
class D{
public:
int f[6];
D(){}
void rollx(){
roll(0,2,5,3);
}
void rolly(){
roll(0,1,5,4);
}
void rollz(){
roll(1,2,4,3);
}
void roll(int a,int b,int c,int d){
int t=f[a];
f[a]=f[b]... | 0 | 62,903,513 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
string s,t;cin>>s>>t;
char x[4],y[4];
int count1 = 0;
strcpy(x,s.c_str());strcpy(y,t.c_str());
for(int i=0;i<3;i++){
if(x[i]==y[i])
count1+=1;
}
cout<<count1<<endl;
return 0;} | #include <bits/stdc++.h>
#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)
#define pb push_back
#define sz(x... | 0 | 37,489,400 |
#include <iostream>
using namespace std;
int main()
{
string S;
cin >> S;
if (S[0] == 'Y' && S[1] == 'A' && S[2] == 'K' && S[3] == 'I' && S.length() >= 4) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#define _USE_MATH_DEFINES
using namespace std;
vector<double> x;
vector<double> y;
void solve(int N){
if(N > 0){
vector<double> xx;
vector<double> yy;
xx.push_back(x[0]);
yy.push_back(y[0]);
double px = x[0];
double p... | 0 | 78,885,963 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
long dx[] = {1, 0, -1, 0};
long dy[] = {0, 1, 0, -1};
using pll = pair<long, long>;
constexpr long MOD = 1000000007;
int main() {
double d, t, s; cin >> d >> t >> s;
if (d / t <= s) cout << "Yes" << endl;
else cout << "No" << endl;
return 0... | #include<iostream>
#include<math.h>
using namespace std;
int main(){
int n;
bool p[1000000];
while(cin>>n){
int n_sq = (int)sqrt(n);
for(int i=0; i<n; i++){
p[i] = true;
}
p[0] = false;
for(int i=1; i<n_sq; i++){
if(p[i]){
for(i... | 0 | 36,975,709 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define forn(ii,a,b) for(int64 ii = (int64)a ; ii < (int64)b ; ii++ )
#define scan(any) for(auto &i:any) cin>>i;
#define debug(x) cerr << #x << " " << x << " -- \n"
#define I__O ... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | 0 | 37,763,698 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
using namespace std;
#define fors(i,a,b) for(int i=(a);i<=(b);++i)
#define ford(i,a,b) for(int i=(a);i>=(b);--i)
#define min(x,y) ((x) < (y) ? (x) : (y))
#define max(x,y) ((x)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
priority_queue<int, vector<int>, greater<int> > q;
rep(i, n) {
int a;
cin >> a;
q.push(a);
}
while (q.size() > 1) {
int m = q.top();
q... | 0 | 37,052,334 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>
#define PI 3.141592653589793
const int INF = 1001001001;
const ll MX = 1e18;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end())... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n, k, a[201010];
cin >> n >> k;
rep(i, n) cin >> a[i];
map<int, int> cnt;
rep(i, n) cnt[a[i]]++;
vector<int> v;
for (auto p : cnt) v.push_back(p.second);
sort(v.begin(), v.en... | 0 | 7,760,938 |
#include <bits/stdc++.h>
using namespace std;
#define ld double
#define ll long long
#define pb emplace_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) x.begin(),x.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define tr(a, x) for (auto &a : x)
#define all(c) c.begin(), c.end()
#define lld long long
#define pb push_back
#define mp make_pair
#define ... | 0 | 81,446,800 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int N;
cin >> N;
int h[N];
rep(i, N) cin >> h[i];
int cnt = 0;
while(1)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
string o, s;
cin >> o;
s = o;
reverse(o.begin(), o.end());
if (s != o) {
cout << "No" << en... | 0 | 15,145,011 |
#include "bits/stdc++.h"
#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++)
using namespace std;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int N; cin >> N;
vecto... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | 0 | 64,659,605 |
#include <bits/stdc++.h>
#define rep(i , n) for (int i = 0; i < (int)(n); i++)
const int INF = 1<<29;
using namespace std;
using ll = long long;
int main() {
int h , w , n;
cin >> h >> w >> n;
vector<int> a(h), b(w);
set<pair<int , int>> s;
rep(i,n) {
int c , d;
cin >> c >> d;
... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( co... | 0 | 58,483,834 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
ll cy(ll X, ll M) {
vector<int> check(M, 0);
ll ans = 0;
while(check.at(X) == 0) {
check.at(X)++;
X = (X*X)%M;
}
while(check.at(X) == 1) {
check.at(X)++;
X = (X*X)%M;
a... | 0 | 67,003,571 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, d, x;
cin >> n >> d >> x;
int sum = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
sum += 1 + (d - 1) / a;
}
cout << sum + x << '\n';
return 0;
} | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cer... | 0 | 30,426,253 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.size();
int cnt = 0;
for(int i = 0; i < n; i++){
if(s[i] == 'o'){
cnt++;
}
}
if(cnt + 15 - n >= 8){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
... | 0 | 71,624,749 |
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
int n,m,i,pos;
string s1,s2;
cin>>s1>>s2;
n=s1.size();
m=s2.size... | #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++)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = ... | 0 | 77,197,539 |
#include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
for(;;){
int m,f,r;
scanf("%d %d %d",&m,&f,&r);
if(m+f+r==-3){
break;
}else{
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
using namespace std;
int n,m,a[30][50001];
vector<int> c;
int solve(int i,int sum){
if(sum>n){
return 50001;
}
if(a[i][sum]!=0)return a[i][sum];
if(i==... | 0 | 94,515,307 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define foreach(i,n) for(auto &&i:n)
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define GSORT(... | 0 | 10,025,986 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n, m, x, y; cin >> n >> m >> x >> y;
V<int> vx(n);
for... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
int r[10];
int a[30000];
int b[30000];
int c[30000];
int n;
vector<pair<int,int>> ad[210];
int lis[210][210];
int dij(int i, int j){
... | 0 | 19,461,768 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,A,B;
cin >> N >> A >> B;
long long Q,mod,r;
Q=N/(A+B);
mod=N%(A+B);
if (mod>=A) {
r=A;
}
else{
r=mod;
}
long long ans=Q*A+r;
cout << ans << endl;
} | #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) ... | 0 | 58,662,579 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int ans;
int main()
{
ll n; cin >> n;
for(ll i = 2; i * i <= n; ++i)
if(n % i == 0)
{
int cnt = 0;
while(n % i == 0)
n /= i, ++cnt;
for(int j = 1; cnt >= j; ++j)
{
cnt -= j;
++ans;
}
}
if(n > 1)
++ans;
cout << ans... | #include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7,INF=1e18;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t=1;
whil... | 0 | 25,788,849 |
#include<iostream>
using namespace std;
int c[1000];
int main()
{
for(int i=0;i<3;i++){
scanf("%d",&c[i]);
}
if(c[0]==c[1])printf("%d",c[2]);
else if(c[1]==c[2])printf("%d",c[0]);
else printf("%d",c[1]);
return 0;
} | #include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n,k;
for(;;){
scanf("%d%d",&n,&k);
if(n==0&&k==0)break;
int ma=0,now=0;
vector<int> ins(n);
for(int i=0;i<n;i++)scanf("%d",&ins[i]);
for(int i=0;i<k;i++)now+=ins[i];
... | 0 | 85,722,483 |
#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++)
typedef long long ll;
int main() {
string N; cin >> N;
int K; cin >> K;
int L = N.size();
vector<vector<int>> dp0(L, vector<int>(K+1)), dp1(L, vec... | #include<iostream>
using namespace std;
void SelectionSort(int N, int A[], int C){
for(int i=0; i<N; i++){
int mini=i;
for(int j=i; j<N; j++){
if(A[j]<A[mini]) mini = j;
}
if(mini != i){
int t=A[i]; A[i]=A[mini]; A[mini]=t;
C++;
}
}
for(int i=0; i<N-1; i++){
cout << A[i] << " ";
}
cout << A[N-1... | 0 | 40,432,225 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string _... | #include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
string str;
int n, digit_sum;
n = 0;
char c;
while(std::cin >> str){
n = str.length();
if(str[0] == '0'){
break;
}
digit_sum = 0;
for (int i=0; i<n; ++i){
... | 0 | 98,852,012 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n,taro=0,hanako=0;
bool flag;
string str1,str2;
cin >> n;
while(n--){
flag=true;
cin >> str1 >> str2;
if(str1 > str2)taro+=3;
else if(str1 < str2) hanako+=3;
else{
taro++;
hanako++;
}
}
cout << taro << " " << hanak... | #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
s... | 0 | 72,127,845 |
#include <iostream>
#include <cctype>
#include <string>
int main()
{
std::string moji;
std::getline(std::cin, moji);
for(int i=0; i<moji.size(); i++)
{
if(islower(moji[i]))
{
moji[i] = toupper(moji[i]);
std::cout << moji[i];
}
else if (isupper(moji[i]))
{
moji[i] = tolower(moji[i]);
std::cout ... | #include <iostream>
#include <stdio.h>
using namespace std;
void bsort(int m[]){
for(int i=9;i>0;i--){
for(int j=0;j<i;j++){
if(m[j] < m[j+1]){
int tmp = m[j];
m[j] = m[j+1];
m[j+1] = tmp;
}
}
}
}
int main(){
int i,mou[10];
for(i=0;i<10;i++) cin >> mou[i];
bsort(mou);
cout << mou[0] ... | 0 | 37,678,327 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define fs first
#define sc second
#define pb push_back
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#defi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> cnt(N + 1);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
cnt[a]++; cnt[b]++;
}
for (int i = 1; i <= N; i++) {
if (cnt[i] % 2) {
cout << "NO" << en... | 0 | 2,813,913 |
#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 n, k, R, S, P;
cin>>n>>k;
cin>>R>>S>>P;
string x;
cin>>x;
char y,z;
ll ans = 0;
rep(i, n) {
y = x.at(i);
if(i<k){
if(y=='r') ans+=P;
else if(y=='s... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_bas... | 0 | 75,196,144 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
#ifdef DEBUG
#define debug(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes \
cout << "Yes" << endl; \
return 0;
#define No \
cout << "No" << endl; \
return 0;
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
t... | 0 | 37,389,230 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | #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... | 0 | 59,393,537 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int m;
cin >> m;
ll digsum = 0;
ll csum = 0;
rep(i, m){
ll d, c;
cin >> d >> c;
digsum += d * c;
csum += c;
}
cout << (digsum-1) / 9 + csum... | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
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... | 0 | 77,022,991 |
#include <bits/stdc++.h>
#define endl '\n'
#define PB push_back
#define PF push_front
#define MP make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll>... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define get(a, n) for(ll it = 0; it < n; it++) cin>>a[it];
#define mod 1000000007LL
int main(){
ll n, k; cin>>n>>k;
ll a[n]; get(a, n);
ll dp[2][k+1]; dp[0][0] = 1;
for(ll i = 1; i <= k; i++) dp[0][i] = 0;
for(ll i = 1; i <= n; i++){
dp[i&1... | 0 | 96,643,830 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
#define Nfor(N) for(int i=0;i<N;i++)
int main(){
int N, K;
cin >> N >> K;
vector<int> bA(N, 0);
Nfor(N){
int A_tmp;
cin >> A_tmp;
bA[A_tmp - 1]++;
}
sort(bA.rbegin(), bA.rend());
... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main()
{
int v, e;
cin >> v >> e;
vector<vector<int>> adj(v, vector<int>());
vector<int> indeg(v, 0);
for (int i = 0; i < e; i++) {
int s, t;
cin >> s >> t;
adj[s].push_back(t);
indeg[t]++;
... | 0 | 11,761,895 |
#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>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 33,913,686 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 | 71,633,613 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
string s;
cin>>s;
int x=-1,y=-1;
if (s.size()==2){
if (s[0]==s[1]){
cout<<1<<' '<<2<<endl;
}else cout<<-1<<' '<<-1<<endl;
return 0;
}
for (int i=0;i<s.size()-2... | 0 | 79,808,314 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
vector<int> pref(n);
vector<int> suff(n);
pref[0] = v[0];
suff[n - 1] = v[n - 1];
for (int i = 1; i < n; ++i) {
pref[i] = max(v[i],pref[i - 1]);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
int n;
int a[1 << 17];
ll tot[1 << 17];
void prt(__int128 x) {
if (x >= 10) prt(x / 10);
putchar(x % 10 +... | 0 | 20,164,281 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend();
#define isS... | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
string s;
cin >> s;
constexpr int64_t M = 'z' - 'a' + 1;
unordered_map<int64_t, int64_t> m;
m[0] = 0;
bitset<M>... | 0 | 41,995,820 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <stack>
#include <deque>
#include <set>
#include <unordered_set>
#include <list>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <climits>
#include <ctime>... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
long long add(long long a, long long b){
... | 0 | 48,329,541 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
typedef unsigned long long ull;
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define f(i,a,b) for(ll i=a;i<=b;i++)
#define testcases ll t;cin>>t;while(t--)
#define dec(x) greater<x>()
#define mx 200005
#define mod 1000000007
#define PI ... | #include <iostream>
#include <sstream>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <set>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <limits>
#include <bitset>
#include <stack>
#include <queue>
#include <ctype.h>
typedef long long int lli... | 0 | 85,808,936 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
for (int i = n - 2; i > 0; i -= 2) {
if (s.substr(0, i / 2) == s.substr(i / 2, i / 2)) {
cout << i << "\n";
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define show(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define show(x)
#endif
typedef long long int ll;
typedef pair<int,int> pii... | 0 | 35,641,765 |
#include <bits/stdc++.h>
#define FOR(i, num) for (i = 0; i < num; i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
array<array<bool, 100>, 100> status;
array<array<int, 100>, 100> res;
void dfs(int cur_x, int cur_y, int prev_count, bool is_reverse_pr... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 17,022,340 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll mod = 1e9 + 7;
int main(){
int h, w;
cin >> h >> w;
char A[h][w];
ll B[h][w];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> A[i][j];
B[i][j] = 0;
}
}
if(A[0][0] == '... | #include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int;
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) \
for (default_counter_t i = 0, end_i = default_counter_t(n); i < end_i; ++i)
#de... | 0 | 34,749,412 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) std::cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) std::cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d... | 0 | 34,005,227 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ld pi = 3.141592653589793;
int w[4];
int main() {
for (int i = 0; i < 4; i++) {
cin >> w[i];
}
i... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return (b);
}
else
{
return (gcd(b, a % b));
}
}
ll lc... | 0 | 67,810,466 |
#include <bits/stdc++.h>
using namespace std;
int main() {
float a, b;
cin >> a >> b;
cout << ceil((a + b) / 2) << endl;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<deque>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define reps(i,f,n) for(int i = f; i <= n; ++i)
#define eb emplace_back
#define all(x) x.begin(), x.end()
using namespace std;
using PII=pair<int,int>;
using PPI=pair<int,PII>;
using ll=long long;
const l... | 0 | 37,714,128 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<lint, lint> pi;
const int MAXN = 100005;
int n, a[100005];
int main(){
lint ans = 0;
cin >> n;
int cnt = 1;
for(int i=1; i<=n; i++){
int x;
cin >> x;
ans += (x - 1) / cnt;
if(x == cnt || cnt == 1) cnt... | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
#include <utility>
using namespace std;
typedef long long ll;
int c[100005];
int solve( int n ) {
int a = 101 , num[12] = { 1 , 6 , 36 , 216 , 1296... | 0 | 75,354,296 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,a,b) for (int i = (a); i < (b); ++i)
int main() {
int d;
cin>>d;
string ans;
if(d == 25) ans = "Christmas";
else if(d == 24) ans = "Christmas Eve";
else if(d == 23) a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 0 | 21,820,663 |
#include <bits/stdc++.h>
#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
typedef long double ld;
const... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d... | 0 | 73,625,325 |
#include <stdio.h>
int main(void)
{
int num;
int ans;
int price;
while (1){
scanf("%d", &price);
if (price == 0)break;
price = 1000 - price;
ans = 0;
while (price){
if (price - 500 >= 0){
price -= 500;
ans++;
}
else if (price - 100 >= 0){
price -= 100;
ans++;
}
else if (pric... | #include<iostream>
#include<string>
using namespace std;
int main(){
string str;
cin >> str;
long long n;
n = str.size();
long long cnt=0;
long long bcnt=0;
for(long long i=0; i<n; i++){
if(str[i]=='W'){
cnt = cnt + bcnt;
}else{
bcnt++;
}
}... | 0 | 24,717,340 |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define max 251
#define nil 2000000001
int h[max];
void print(int n){
for(int i=0;i<n;i++){
cout<<"node "<<i+1
<<": key = "<<h[i]<<", ";
if(i!=0)cout<<"pa... | #include <iostream>
#include <string>
using namespace std;
int main() {
string base;
string s;
bool ok;
cin >> base;
cin >> s;
for(int i = 0;i < base.size();i++) {
ok = true;
for(int j = 0;j < s.size();j++) {
if(s.at(j) != base.at((i + j) % base.size())) {
ok = false;
break;
}
}
if(ok)
b... | 0 | 50,165,416 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; ++i) {
cin >> vec[i];
}
int ans1 = 0, ans2 = 0, ans = 1000;
for (int i = 0; i < vec.size(); ++i) {
ans1 += vec[i];
for (int j = i + 1; j < vec.size()... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)
#define repp(a,b,c) for(i... | 0 | 78,764,960 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
s.insert(4," ");
cout<<s<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-... | 0 | 100,668,124 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const long long INF = 1LL << 60;
const ll C = 1000000000+7;
int main() {
int N;
cin >> N;
vector<int> odd(100005), even(100005);
for(int i=1; i<=N; i++) {... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
#define all(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,k,n) for(int i=(k);i<(n);++i)
int main() {
int N; cin >> N;
map<string,int> mp;
int sum = 0;
REP(i,N) {
string s; ... | 0 | 100,536,565 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | 0 | 51,136,765 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 28,120,294 |
#include<bits/stdc++.h>
using namespace std;
char s[200100];
int main(){
scanf("%s",s);
int sum = 0;
for(int i = 0; i < strlen(s); i++)
sum += s[i] - '0';
if(sum%9)
printf("No\n");
else
printf("Yes\n");
return 0;
} | #include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
for(;;){
int m,f,r;
scanf("%d %d %d",&m,&f,&r);
if(m+f+r==-3){
break;
}else{
... | 0 | 48,257,475 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,i,j;
while(1){
cin >> h >> w;
if(h==0 && w==0) break;
for(j=1;j<=h;j++){
for(i=1;i<=w;i++){
if(j==1 || j==h){
cout << '#';
}else{
if(i==1 || i==w) cout << '#';
else cout << '.';
}
}
cout << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<string> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
int NfootA= 0;
int NheadB= 0;
int Nchimera= 0;
int cnt_intra= 0;
for(auto word:data){
if(word.back()=='A' && word.at(0)=='B'){
Nchimera++;
... | 0 | 80,882,900 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rad_to_deg(rad) (((rad)/2/M_PI)*360)
using ll = long long;
using namespace std;
ll pow2(ll a,ll n){
ll res=1;
while(n>0){
if(n&1){
res=res*a;
}
a=a*a;
n>>=1;
}
return res;
}
int m... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
const int INF=(4e7);
const int maxn=(2e5)+10;
int n,k,a[maxn],b[ma... | 0 | 64,278,479 |
#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_set>
#include<util... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod*3LL;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
in... | 0 | 2,157,819 |
#include <iostream>
using namespace std;
int main() {
int N,K;
cin>>N>>K;
if(N%K!=0)
cout<<"1"<<endl;
else
cout<<"0"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
if(S.at(0)!='k'){
if(S.substr(S.size()-7,7)=="keyence") cout << "YES" << endl;
else cout << "NO" << endl;
}
else if(S.at(S.size()-1)!='e'){
if(S.substr(0,7)=="keyence... | 0 | 76,763,238 |
#include <iostream>
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define REP(i,n) FOR(i,0,n)
using namespace std;
int S[10000];
int root(int i){
if(S[i] == i) return i;
else return S[i] = root(S[i]);
}
int main(){
int n,q,com,x,y;
cin >> n >> q;
REP(i,n){
S[i] = i;
}
REP(i,q)... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 666666
int arr[N],sum1[N],sum2[N];
signed main(){
int n,k;
cin>>n>>k;
int ans=0;
for(int i=1;i<=n;i++){
scanf("%lld",&arr[i]);
sum1[i]=sum1[i-1]+arr[i];
if(arr[i]>0)
sum2[i]=sum2[i-1]+arr[i];
else
sum2[i]=sum2[i-1];
}
ans=... | 0 | 71,143,335 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
ll a[N], cum[N];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= n; i++) cum[i] = cum[i - 1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B; cin >> A >> B;
if (A.size() != B.size()) {
if (A.size() < B.size()) cout << "LESS" << endl;
else cout << "GREATER" << endl;
} else {
if (A == B) {
cout << "EQUAL" << endl;
} else {
... | 0 | 47,597,259 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
ll a;
double b;
cin >> a >> b;
ll c = b*100+0.5;
ll ans = a*c/100;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
ll N, K;
cin >> N >> K;
vector<ll> a(N), b(N);
for (int i = 0; i < N; i++)
{
cin >> a[i] >> b[i];
}
vector<ll> hist(1e5+1, 0);
for (int i = 0; i < N; i++)
{
hist[a[i]] += b[i];
}
... | 0 | 98,358,530 |
#include <iostream>
#include <string>
using namespace std;
int main(){
while(true){
int m, h;
string cards;
cin >> cards;
if(cards == "-") break;
cin >> m;
while(m){
cin >> h;
string substr = cards.substr(0, h);
cards.erase(0, h);
cards += substr;
m--;
}
cout << cards << endl;
}
return... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 73,600,330 |
#include<bits/stdc++.h>
using namespace std;
int K;
void DFS(string ANS,int P,int& NOW){
if(P==0){
NOW++;
if(NOW==K) cout <<ANS <<endl;
return;
}
int X=ANS[ANS.size()-1]-'0';
for(int i=X-1;i<=X+1;i++){
if(i<0||9<i) continue;
DFS(ANS+(char)(i+'0'),P-1,NOW);
}
}
int main(){
cin >>K;
int NOW=0;
for(int i... | /*https:
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, m;
cin >> n >> m;
int l[m], r[m], lmax = 0, rmin = 0;
for (int i = 0; i < m; i++)
cin >> ... | 0 | 33,817,215 |
#include <iostream>
using namespace std;
void func(int &points_A, int &points_B, string str1, string str2) {
int n;
int isLonger = 0;
if (str1.length() > str2.length()) {
n = str2.length();
isLonger = 1;
} else if (str1.length() < str2.length()) {
n = str1.length();
isLon... | #include <iostream>
#include <utility>
using namespace std;
typedef pair<int, int> PA;
int main(int argc, char **argv)
{
int n, m, s;
PA pa[10001], tmp;
while(1){
cin >> n >> m;
if(n == 0 && m == 0){
break;
}
for(int i = 0; i < n; i++){
cin >> pa[i].first >> pa[i].second;
}
for... | 0 | 54,274,562 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int s , n , k;
int main()
{
_FastIO;
cin >> n >> k;
int x , y;
for(int i = 1; i <= n; i++){
cin >> x;
}
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) (int)((x).size())
#define debug(x) cout << #x << ":" << x << ' ';
#define debugg(x) cout << #x << ":" << x << ' ' << "\n";
#define endl "\n"
#define L(X) ((X)<<1)
#define R(X) (((X)<<1)|1)
#define M(X,Y)... | 0 | 4,177,428 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
int main(){
ll X=0,t=0;
cin>>X>>t;
if (X-t>0){
cout<<X-t<<endl;
}
else{
cout<<0<<endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#define MOD 1000000007
#define PI 3.14159265358979... | 0 | 3,878,380 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i,a[3],b;
for(i=0;i<3;i++)
{
cin >> a[i];
}
sort(a,a+3);
b=abs(a[2]-a[1])+abs(a[1]-a[0]);
cout<<b<<endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MA... | 0 | 78,267,915 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.