code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include<iostream>
#include<queue>
using namespace std;
static const int N = 100;
int n,d[N],M[N][N];
void dfs(int r) {
queue<int> q;
q.push(r);
for (int i = 0; i < n; i++) d[i] = -1;
d[r] = 0;
int u;
while (!q.empty()) {
u = q.front();
q.pop();
for (int v = 0; v < n; v++) {
if (M[u][v] == 0) continue;
... | #include <bits/stdc++.h>
using namespace std;
const int INF=1145141919;
#define debug cout<<"debug"<<endl;
int main(){
int n;
cin>>n;
vector <int> g[n];
for(int i=0;i<n;i++){
int u,k;
cin>>u>>k; u--;
for(int j=0;j<k;j++){
int v;
cin>>v; v--;
g[u].push_back(v);
}
}
int dis[n... | 1 | 51,315,011 |
#include <iostream>
#include <complex>
#include <cmath>
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
using namespace std;
typedef complex<double> P;
double cross(P a, P b) {
return (a.real() * b.imag() - a.imag() * b.real());
}
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <fstream>
#include <complex>
using namespace std;
typedef complex<double> P;
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)
double cross(P a, P b) {
return (a.real() * b.imag() - a.imag() * b.real());
}
i... | 1 | 37,084,912 |
#include<bits/stdc++.h>
using namespace std;
#define ll long
#define ld double
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define setpr(pp) fixed<<setprecision(pp)
#define FOR(I,N) for(I=0;I<N;++I)
#define MS0(x) memset(x,0,sizeof(x))
#define MS1(x) memset(x,-1,sizeof(x))
#define IOS ios... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
vector<ll> v[100010];
ll dp[100010][2]={};
ll dfs(ll i,ll par,ll color){
if(dp[i][color]!=0) return dp[i][color];
dp[i][color]=1;
for(auto x:v[i... | 1 | 36,515,722 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long ;
int main(){
int n;
cin >> n;
vector<int> h(n);
rep(i,n) cin >> h[i];
int dekai=0;
int cnt=0;
rep(i,n){
if(h[i]>dekai){
cnt++;
dekai = h[i]... | #include <bits/stdc++.h>
using namespace std;
int main (){
int n;
int cont=0;
cin >> n;
int a[n];
bool mayor = true;
for (int i=0; i<n; i++){
cin >> a[i];
for(int j=0;j<=i && mayor; j++){
if (a[j] > a[i]){
mayor = false;
}
}
if (mayor) cont++;
mayor = true;
}
cout << cont;
return 0;
} | 1 | 90,383,316 |
#include<stdio.h>
int main()
{
int x, y;
int num = 1;
while (1)
{
scanf("%d%d", &x, &y);
if (x==0 && y==0)
{
break;
}
if (x <= y)
{
printf("%d %d\n", x, y);
}
else if (x > y)
{
printf("%d %d\n", y, x);
}
}
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
for (;;)
{
int x,y;
cin >> x >> y;
if (x==0 &&y==0)break;
cout<< min(x,y) << " " << max (x,y)<<endl;
}
} | 1 | 50,351,702 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll a,b,c,d;
cin>>a>>b;
c=max(a,b);
d=min(a,b);
for(ll i=1;i<=c;i++)
{
cout<<d;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
char a, b; cin >> a >> b;
if (a <= b)
for (int i = 0; i < b - 48; ++i)
cout << a;
else
for (int i = 0; i < a - 48; ++i)
cout << b;
cout << endl;
} | 1 | 33,806,458 |
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | #include <iostream>
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
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... | 1 | 10,800,353 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, l;
vector<string> S;
string ans;
cin >> n >> l;
for (int i = 0; i < n; i++)
{
string buf;
cin >> buf;
S.push_back(buf);
}
for (int i = 0; i < n; i++)
{
ans += *min_element(S.begin(), S.end());
int bufIndex = min_elem... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test int t; cin>>t; while(t--)
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
ll n,l,i,j,k;
string a[1000];
cin>>n>>l;
for(i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
for(i=0;i<n;i++)
{
... | 1 | 12,412,653 |
#include <cstdio>
#include <cstring>
using namespace std;
int H, W;
int N;
int X[50], Y[50];
int vis[100][100];
void solve(int x, int y){
if (x > W || y > H) return;
for (int i = 1; i <= N; i++){
if (x == X[i] && y == Y[i]) return;
}
vis[y][x]++;
solve(x + 1, y);
solve(x, y + 1);
}
int main(){
while (1){
mem... | #include <cstdio>
#define max(a,b) (a > b ? a : b)
int a,b,n,dp[17][17];
int main(){
while(scanf("%d%d",&a,&b), a != 0){
scanf("%d",&n);
for(int i = 0; i < 17; i++){
for(int j = 0; j < 17; j++){
dp[i][j] = 0;
}
}
for(int i = 0; i < n; i++){
int x,y;
scanf("%d%d",&x,&y);
dp[x][y] = -1;
}
... | 1 | 71,406,676 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef complex <double> cp;
#define debug(a) cout<<#a<<":"<<a<<endl;
#define fr freopen("in.txt","r",stdin);
#define Fill(x,a) memset(x,a,sizeof(x))
#define cpy(a,b) memcpy(a,b,sizeof(a))
const double PI = acos(-1);
const int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200010;
int n,m;
int par[N],rk[N];
unordered_map<int,int> h;
void init(int n){
for(int i = 1;i<=n;i++){
par[i] = i;
rk[i] = 0;
}
}
int find(int x){
if(par[x] == x) return x;
else{
return par[x] = f... | 1 | 61,301,069 |
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using pdd = pair<double, double>;
using uint = unsigned int;
template <typename T>
using... | 1 | 25,113,245 |
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
#define MAX 2000000
using namespace std;
cons... | #include<bits/stdc++.h>
using namespace std;
int main()
{
priority_queue<int> pq;
while(true)
{
char s[10];
scanf("%s",s);
if(s[2]=='s')
{
int t;
scanf("%d",&t);
pq.push(t);
}
else if(s[2]=='t')
{
printf("%d\n",pq.top());
pq.pop();
}
else break;
}
return 0;
} | 1 | 63,684,991 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
#define ll long long int
int main(){
int l;
cin>>l;
double a=(double)l/3;
double ans=a*a*a;
cout<< std::fixed << std::setprecision(15)<<ans<<endl;
re... | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 1 | 9,413,708 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
if(x==y) cout<<"Draw"<<endl;
else if(min(x,y)!=1){
if(x>y) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
else if(min(x,y)==1){
if(x>y) cout<<"Bob"<<endl;
else cout<<"Alice"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a,b;
cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a > b) {
std::cout << "Alice" << '\n';
} else if (a < b) {
std::cout << "Bob" << '\n';
} else {
std::cout << "Draw" << '\n';
... | 1 | 15,704,605 |
#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++)
using ll= long long int;
using namespace std;
ll mod= 1e9 + 7;
int main() {
int n;
cin >>n;
vector<int> g={},h={};
rep(i,n){
int q;
cin >>q;
if(i%2==0){h.push_back(q);}else{g.push_back(q);}
}
if(n%2==1){
for(int i=h.size(... | 1 | 37,907,571 |
#include<stdio.h>
int main(){
int a;
int b;
int c;
scanf("%d %d %d",&a,&b,&c);
if (a>=b){
printf("No\n");
}
else if (b>=c){
printf("No\n");
}
else{
printf("Yes\n");
}
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int x,y,z;
cin>>x>>y>>z;
if(x<y && y<z ) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 | 16,038,756 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int H, W;
vector<string> fi;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
cin >> H >> W;
fi.resize(H);
for (int i = 0; i < H; ++i) cin >> fi[i];
vector<vector<int> > dist(H, vector<int>(W, -1));
using p... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for (... | 1 | 70,948,509 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long int i,j,n,k,x=0;
cin>>n>>k;
double s,z=0,t=0.5,y;
if(n>=k)
{
y=k;
}
else
{
y=n+1;
}
for(i=1;i<y;i++)
{
x=0;
for(j=i;j<k;)
{
j=j*2;
x++;
}
s=pow(t,x);
s=s/n;
z=z+s;
}
if(n>=k)
{
s=(n-k+1)/(n*1.0);
cout<<fixed<<setpr... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long ;
int main()
{
int n,k;
cin>>n>>k;
double ans=0;
for(int i=1;i<=n;i++){
ll point=i;
double pro=1;
while(point<k){
point*=2;
pro*=0.5;
}
... | 1 | 32,512,729 |
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
using namespace std;
using... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
int n,num[100005],i,j,ai=0,aj=0;
cin>>n;
for(i=1;i<=n;i++){scanf("%d",&num[i]);ai=max(ai,num[i]);}
for(i=1;i<=n;i++){
if(fabs((double)aj-(double)ai/2)>fabs((double)num[i]-(double)ai/2))
... | 1 | 58,396,300 |
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int n, a[1000];
double s = 0, p = 1;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> a[i];
p = p * a[i];
}
for(int i = 0; i < n; i++)
{
s = s + p/a[i];
}
cout << setprecision(16) << p / s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n);
double total = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
a.at(i) = 1 / a.at(i);
total += a.at(i);
}
cout << 1 / total << endl;
} | 1 | 72,008,231 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int a,b,c,k,i=0;
cin>>a>>b>>c>>k;
while(a>=b&&k){
b*=2;
k--;
}... | 1 | 16,967,260 |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define int long long
using namespace std;
typedef pair<int, int> Pii;
template<typename T>
void readvec(vector<T> &a);
void readindex(vector<int> &a);
void fillvec(ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void out(deque<int> v) {
int sz = v.size();
for (int i = 0; i < sz; i++) {
cout << v.front() << " \n"[i == sz - 1];
v.pop_front();
}
}
int main() {
ll n,a,b;
cin >> n >> a >> b;
if (a * b < n) {
cout << -... | 1 | 38,966,240 |
#include <stdio.h>
#include <string.h>
#define ll long long int
int main(){
int n, m, even = 0;
scanf("%d %d", &n, &m);
even = n * (n -1) /2 + m * (m - 1) /2;
printf("%d\n", even);
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 1 | 88,715,235 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#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>
#includ... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 5010;
int N, K;
int A[MAXN];
bool dppref[MAXN][MAXN], dpsuff[MAXN][MAXN];
int sum[MAXN];
int main() {
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
dppref[0][0] = true;
for (int i = 0; i < N; i++) {
copy(dppref[i], dpp... | 1 | 77,885,163 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int minimum = 2000000000, maximum = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
minimum = min(minimum, tmp);
maximum = max(maximum, tmp);
}
cout << maximum - minimum << endl;
... | 1 | 43,046,453 |
#include <iostream>
#include <algorithm>
int main()
{
int a, b, c;
std::cin >> a >> b >> c;
if(a > b) {
std::swap(a, b);
}
if(b > c) {
std::swap(b, c);
}
if(a > b) {
std::swap(a, b);
}
std::cout << a << ' ' << b << ' ' << c << std::endl;
return 0;
} | #include<iostream>
using namespace std;
int main(void){
int a , b , c;
cin >> a >> b >> c;
int d;
if(a > b){
d = a;
a = b;
b = d;
}
else{
if(b > c){
d = b;
b = c;
c = d;
}
}
if(b > c){
d = b;
b = ... | 1 | 4,008,718 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1000000010
#define N 100010
char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<'0'||c>'9')) c=getchar();return c;}
int gcd(int n,int m){return m==0?n:gcd(m,n%m);}
int read()
{
int x=0,f=1;char c=getchar();
while (c<'0'||... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 1 | 71,678,333 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+1000;
int s[maxn];
int main() {
int n;
long long sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
sum+=s[i];
}
long long ans=999999999999;
long long su=s[0];
for(int i=1;i<n-1;i++){
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >=0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
typedef long long ll;
#define INF 1e9
int main(){
int N;
ll mini = 1e16;
cin >> N;
vector<ll> a(N), sum(N+1);
sum[0] = 0;
... | 1 | 6,887,489 |
#include <iostream>
#include <string>
using namespace std;
int size=0;
long long int heap[2000000];
int parent(int i){
int return_num;
if(i%2==0){
return_num = (i-2)/2;
}else{
return_num = (i-1)/2;
}
return return_num;
}
int left_child(int i){
return 2*i+1;
}
int right_child(int i){
return 2*i+2;
... | #include<iostream>
#include<string>
#include<cstdio>
using namespace std;
int n;
struct Node{
int key;
Node *p, *l, *r;
};
Node *NIL, *root;
void preorder(Node *u){
if(u == NIL) return;
cout << ' ' << u->key;
preorder(u->l);
preorder(u->r);
}
void inorder(Node *u){
if(u == NIL) return;
inorder(u->l);
... | 1 | 18,419,899 |
#include<stdio.h>
#define MAX 100
int main(void){
int array[MAX] = {0};
int i;
int count = 0;
while(scanf("%d",&i) != EOF){
array[i]++;
if(array[i] > count)
count = array[i];
}
for(i=0;i<MAX;i++){
if(array[i] == count)
printf("%d\n",i);
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int a[101]={0},b,i,saihin[100]={0},c=0,saidai=0;
while(cin>>b){
a[b]=a[b]+1;
}
for(i=1;i<=100;i++){
if(saidai<a[i]){
saidai=a[i];
}
}
for(i=1;i<=100;i++){
if(a[i]==saidai){
... | 1 | 21,748,118 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define FOR(i, r, n) for (int i=(int)(r); i<=(int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF 2147483647
#define INF64 9223372036854775807
#define MOD 1000000007
struct BFS{
vector<vector<int>> data;
vecto... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | 1 | 30,652,464 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> s(H + 2, vector<char>(W + 2, '.'));
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
cin >> s.at(i).at(j);
}
}
bool ok = true;
for (int i = 1; i <= H; i++) {
for (int j =... | 1 | 33,325,435 |
#include<bits/stdc++.h>
using namespace std;
vector<int> dice(7);
vector<int> tmp(7);
void change_dice(char c){
for(int i=1; i<=6; i++){
tmp[i]=dice[i];
}
if(c=='E'){
dice[1]=tmp[4];
dice[3]=tmp[1];
dice[4]=tmp[6];
dice[6]=tmp[3];
}
else if(c=='N'){
di... | #include<iostream>
#include<string>
#include<time.h>
#include<random>
using namespace std;
struct Dice{
int s[6];
void move(char c){
int tmp;
if(c=='N'){
tmp=s[0];
s[0]=s[1];
s[1]=s[5];
s[5]=s[4];
s[4]=tmp;
}
else if(c==... | 1 | 93,036,484 |
#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=(int)(s);i<(int)(n);i++)
typedef long long ll;
const int INF = 1e+9;
const int H_MAX=300;
const int W_MAX=300;
int H,W,D;
vector<pair<int,int>> V(H_MAX*W_MAX+1);
int solve(int s,int e,vector<vector<in... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
pll A[100005];
int main() {
cin.tie(0);
ios::s... | 1 | 49,672,478 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int n, a, b;
cin >> n >> a >> b;
if(a > b) cout << 0 << endl;
else if(n == 1){
if(a == b) cout << 1 << endl;
else cout << 0 << endl;
}
else {
long long int ans = (n - 2) * b - (n - 2) * a + 1;
cout << ans << endl;
}
retu... | 1 | 89,877,478 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
int A=S.size();
T=T.substr(0,A);
if(S==T){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s,t;
cin >> s >> t;
t.pop_back();
if (s==t)cout << "Yes" << endl;
else cout << "No" <<endl;
return 0;
} | 1 | 64,547,485 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b;
cin >> a >> b;
cout << (a - 1) * (b - 1) << ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typede... | 1 | 56,692,784 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv)
{
int a, b;
cin >> a >> b;
if(a < b){
cout << "a < b" << endl;
}else if(a > b){
cout << "a > b" << endl;
}else{
cout << "a == b" << endl;
}
} | #include<stdio.h>
int main(void)
{
int a,b;
scanf("%d%d",&a,&b);
if(a<b) printf("a < b\n");
else if(a==b) printf("a == b\n");
else printf("a > b\n");
} | 1 | 7,051,627 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <valarray>
#include <cassert>
#include <cmath>
#include <functional>
#in... | 1 | 71,812,415 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<in... | #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... | 1 | 86,436,575 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
string s; cin >> s;
ll ans = 0;
ll countB = 0;
for(ll i = s.length()-1; i >=0; i --){
if(s[i] == 'B'){
ans += (s.length() -1 - i -countB);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Vec = vector<int>;
bool IsPrime(int num)
{
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i +=... | 1 | 24,690,182 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m; cin >> n >> m;
int min = 0;
int max = n;
for(int i = 0; i < m; i++) {
int l,r; cin >> l >> r;
if(min < l) min = l;
if(max > r) max = r;
}
int ans = max - min + 1;
if(max < min) ans = 0;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int n, m, l, r;
cin >> n >> m;
int imos[100005];
fill(imos, imos + 1... | 1 | 22,067,536 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<ll> A(N);
for(ll i=0;i<N;i++) {
cin>>A[i];
}
set<ll> S;
ll B=1;
ll count=0;
for(ll i=0;i<N;i++) {
if(B==2) {
cout<<count<<endl;
return 0;
}
B=A[B-1];
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool canstop=false;
vector<int> a(N);
for(int i=0;i<N;i++) cin >> a.at(i);
int now=0,cnt=0;
for(int i=0;i<N;i++){
if(now!=1){
now = a.at(now)-1;
cnt++;
}
else{
... | 1 | 89,506,032 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
ll n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(i,n) a[i]--;
vector<int> ans(n);
rep(i,n) ans[a[i]] +... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
int main(){
int N;
cin >> N;
int A[N+1],B[N+1];
for(int i=1;i<=N;i++)cin>>A[i];
for(int i=1;i<=N;i++){
B[A[i]] = i;
}
for(int i=1;i<=N;i++){
cout... | 1 | 12,496,276 |
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
#define INF 1e9
#define PI 3.141592653589793238
typedef long long ll;
int main() {
int n,m; cin>>n>>m;
if(n>m) for(int i=0; i<n; i++) cout<<m;
else for(int i=0; i<m; i++) cout<<n;
cout<<endl;
r... | #include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
int c,d;
c = stoi(a);
d = stoi(b);
string e,f;
rep(i,d) e += a;
rep(i,c) f += b;
if(... | 1 | 29,997,603 |
#pragma GCC optimization ("O3")
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define pb push_back
const int M=10000000000;
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
signed main()
{
fastio;
int t=1;
while(t--)
{
int a,b;
char op... | #include <bits/stdc++.h>
using namespace std;
int a, c;
char b;
int main () {
cin >> a >> b >> c;
if ((int)b == 43){
cout << a + c;
} else if ((int)b == 45){
cout << a - c;
}
} | 1 | 93,246,989 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
const int MOD = 1e9 + 7;
#define pow abcdef
int pow(int a, int b) {
if (b == 0) re... | #include<cstdio>
using namespace std;
char s[100002];
int z[26];
int main(){
int n;
scanf("%d%s",&n,s+1);
for(int i=1;i<=n;i++)
z[s[i]-'a']++;
int ans=1;
for(int i=0;i<26;i++)
ans=1ll*ans*(z[i]+1)%1000000007;
printf("%d\n",(ans-1+1000000007)%1000000007);
} | 1 | 89,121,139 |
#include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
int ans = N - K + 1;
cout << ans << '\n';
return 0;
} | #include<bits/stdc++.h>
#define fo0n for(int i=0;i<n;i++)
const int M =1e9+7;
const int N=1e5+3;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
using namespace std;
struct node{
int x,y;
};
void solve (){
int n,m;
cin>>n>>m;
cout<<n-m+1;
}
int main(){
int t=1;
while(t--){
solve();
}
} | 1 | 33,798,451 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
int n,m;
ll x[100001];
ll y[100001];
ll sumx[100001];
ll sumy[100001];
int main() {
cin >> n >> m;
for(int i = 0; i < n; i++) cin >> x[i];
for(int j = 0; j < m; j++) cin >> y[j];
sumx[0] = x[0];
sumy[0] = y[0];
for(int... | #include <bits/stdc++.h>
using namespace std;
#define mk make_pair
const int MAXN = 112345;
const double PI = atan(1) * 4;
const int MOD = 1e9 + 7;
long long x[MAXN], y[MAXN];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++)
scanf("%lld", &x[i]);
for(int i = 0; i < m; i++)
scanf("%lld",... | 1 | 36,999,205 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int n;
int p1 = 0;
int p2 = 0;
cin >> n;
string a, b;
for(int i = 0 ; i < n ; i ++) {
cin >> a >> b;
if( a > b) {
p1 += 3;
} else if ( a == b) {
p1 += 1;
p2 += 1;
} else {
p2 += 3;
}
}
cout ... | #include <iostream>
#include <string>
using std::cout;
using std::endl;
using std::cin;
using std::string;
string battle_check(string taro, string hanako) {
if (taro > hanako)
{
return "taro";
}
else if (taro < hanako) {
return "hanako";
}
else {
return "draw";
}
}
int main() {
int battle_num;
string ta... | 1 | 17,528,632 |
#include "bits/stdc++.h"
using namespace std;
int main(){
double T,X;
cin >> T >> X;
cout << T/X << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
int main(void){
double a,b;
cin>>a>>b;
cout<<a/b<<endl;
} | 1 | 37,817,131 |
#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) f... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
while(cin >> N){
int e = 0;
while(e*(e+1)/2 < N) ++e;
vector<int> r;
for(int i=e;i>=1;i--){
if(N >= i){
r.push_back(i);
N -= i;
}
}
for(auto it=r.rbegin();it!=r.rend();++it) cout << *it << endl;
}
} | 1 | 22,992,145 |
#include<iostream>
int main(){
int a[5],i,j,n;
for(i=0;i<5;i++){
std::cin>>a[i];
}
for(i=0;i<4;i++){
for(j=i+1;j<5;j++){
if(a[i]<a[j]){
n=a[i];
a[i]=a[j];
a[j]=n;
}
}
}
std::cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<" "<<a[3]<<" "<<a[4]<<std::endl;
return 0;
} | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <cmath>
# include <iomanip>
# include <functional>
using namespace std;
int main() {
int a;
vector<int> v;
for (int i = 0; i < 5; i++) {
cin >> a;
v.emplace_back(a);
}
sort(v.begin(), v.end(), std::greate... | 1 | 32,449,586 |
#include <iostream>
using namespace std;
int main()
{
int n;
int side[3];
cin >> n;
for (int i = 1; i <= n; i++){
for (int j = 0; j <= 2; j++){
cin >> side[j];
}
for (int j = 0; j < 2; j++){
if (side[j] >= side[j + 1]){
int s = side[j + 1];
side[j + 1] = side[j];
... | #include <iostream>
#include <algorithm>
using namespace std;
bool isRTri(int a, int b, int c)
{
return a * a + b * b == c * c;
}
int main()
{
int n;
cin >> n;
for (int k = 1; k <= n; k++)
{
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
bool r = isRTri(a[0], ... | 1 | 31,674,467 |
#include <iostream>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) cout << "Yes" << "\n";
else cout << "No" << "\n";
return 0;
} | #include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <cfenv>
using ll = unsigned long long;
using namespace std;
int gcd(int x,int y){
if(y==0){
return x;
}else{
return gcd(y,x%y);
}
}
int lcm(int x,int y){
return x... | 1 | 35,082,089 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #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;
const int MOD = 1000000007;
ll match[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
string dp[11000];
const string MINUSINF = "-";
void chmax_str(strin... | 1 | 94,112,306 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
std::cin >> n >> a;
int temp;
temp = n % 500;
if (temp <= a){
std::cout << "Yes" << std::endl;
}
else{
std::cout << "No" << std::endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<vector<int>> vv;
typedef pair<int, int> P;
int N, A;
void input() {
cin >> N >> A;
}
int main() {
input();
string ans;
if (N % 500 <= A) ans = "Yes";
else ans = "No... | 1 | 96,660,469 |
#include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()... | #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,511,505 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
using namespace std;
#define FOR(i,k,n) ... | #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 all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using... | 1 | 57,632,805 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char c;
cin>>c;
char a = ++c;
cout<<a<<"\n";
return 0;
} | #include <stdio.h>
int main(){
char C;
int z;
scanf("%c", &C);
z= C+1;
printf("%c\n", z);
return 0;
} | 1 | 52,647,999 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h,w;cin>>h>>w;
vector<vector<char>> in(h,vector<char>(w));
vector<vector<char>> out(h,vector<char>(w));
for(int i=0;i<h;++i)for(int j=0;j<w;++j)cin>>in[i][j];
for(int i=0;i<h;++i)for(int j=0;j<w;++j)out[i][j]='.';
for(int i=0;i<h;++i){
for(in... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> s(H);
for (int i = 0; i < H; i++) {
cin >> s[i];
}
for (int i = 0; i != H; ++i) {
for (int j = 0; j != W; ++j) {
if (s[i][j] == '.') continue;
if ((!i || s[i - 1][j] == '.') &&... | 1 | 28,974,681 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n,c,k;
cin>>n>>c>>k;
vector<int> t(n);
rep(i,n) cin>>t[i];
sort(all(t));
int ans=0;
... | 1 | 42,492,154 |
#include "bits/stdc++.h"
using namespace std;
using i64 = int_fast64_t;
using seika = string;
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
template <class kotonoha>
using akane = prior... | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
int a[100005];
bool able[100005];
int main() {
for (int i = 0; i < 100005; i++) {
able[i] = true;
}
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int p ... | 1 | 41,864,231 |
#include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll MOD = round(1e9+7);
int main() {
ll N,A,B; cin >>N>>A>>B;
ll ans=B*(N-1)+A-A*(N-1)-B+... | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll N,A,B;
ci... | 1 | 72,930,729 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace std;
#define Rep(i,a,b) for(ll i = a; i < b; ++i)
... | #include <cstdio>
#include <algorithm>
#define ll long long
using namespace std;
inline int read(){
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') {x=(x<<1)+(x<<3)+(c^48);c=getchar();}
return x*f;
}
const int maxn(1e5+5);
ll n,l,q;
ll s[maxn],f[maxn][35];
v... | 1 | 90,945,373 |
#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... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,int>
#define T tuple<int,int,int>
using namespace std;
int main(){
int n,m; c... | 1 | 20,937,203 |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).su... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mo 1000000007
#define MAX 100004
#define fast_io ios::sync_with_stdio(false)
long long fact[MAX];
long long pow(int a, int b, int MOD)
{
long long x=1,y=a;
while(b > 0)
{
if(b%2 == 1)... | 1 | 80,655,146 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
float ans = 0.0, A;
cin >> N;
for(int i=1;i<=N;i++) {
cin >> A;
ans += 1.0/A;
}
ans = 1.0/ans;
cout << setprecision(16) << ans << endl;
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
long double res = 0;
for (int i=0; i < n; i++) {
long double x; cin >> x;
x = 1/x;
res += x;
}
long double nres = 1/res;
cout << nres;
return 0;
} | 1 | 33,499,377 |
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main(){
char ch;
while(1) {
scanf("%c", &ch);
if(ch == '0'){
break;
}
int sum = ch - '0';
while(1){
scanf("%c", &ch);
if(ch == '\n') break;
sum += int(ch) - '0';
}
cout << sum <<endl;
}
return 0;
} | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#include<stdio.h>
#include<math.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
using namespace std;
int main(){
string x;
int total=0;
int i=0;
while(1){
cin >> x;
if(x=="0") break;
else{
total=0;
... | 1 | 87,704,285 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define nl cout<<"\n";
#define chk(x) cout<<#x<<" : "<<x, nl
#define ll long long int
#define u unsig... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | 1 | 5,755,145 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> r(n,0);
for (int i=0; i<n; i++) {
cin >>r[i];
r[i] --;
}
int ans = 0;
for (int i=0; i<n; i++){
if(r[r[i]]==i){
ans ++;
r[r[i]]=-1;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n, i, a[100100], ans=0;
cin >> n;
for(i=0;i<n;i++){
cin >> a[i];
a[i]--;
}
for(i=0;i<n;i++){
if(a[i]!=-1){
if(a[a[i]]==i){
ans++;
a[a[i]]=-1;
}
}... | 1 | 18,259,539 |
#include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
usi... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <bitset>
#include <cmath>
#include <stack>
#include <iomanip>
#include <map>
#include <math.h>
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
ll GCD(ll a, ll b) { return b ? GCD(b, a%b) : ... | 1 | 64,932,714 |
#include <bits/stdc++.h>
using namespace std;
string s, t;
int cnt;
int main() {
ios_base::sync_with_stdio(false);
cin >> s >> t;
cnt = 0;
for(int i = 0; i < s.size(); i++) {
if(s[i] != t[i]) cnt++;
}
cout << cnt;
} | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define boost ios::sync_with_stdio(0); cin.tie(0);
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
boost;
int count = 0;
string s, t;
cin >> s >> t;
int len = s.len... | 1 | 97,001,951 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, d;
cin >> n >> d;
vector<vector<double>> x(n, vector<double>(d));
rep(i,n)rep(j,d) cin >> x[i][j];
int ans = 0;
for (int i = 0; i < n; i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n,d;
cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d));
rep(i,n){
rep(j,d){
cin >> x[i][j];
}
}
int ans = 0;
for(int i=0; i<n; i++){
... | 1 | 30,817,120 |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | #include <stdio.h>
#include <string.h>
int main()
{
char S[255], T[255];
scanf("%s%s", S, T);
int A,B;
scanf("%d%d", &A, &B);
char U[20];
scanf("%s", U);
int result1 = strcmp(S,U);
int result2 = strcmp(T,U);
if (result1 == 0)
{
A = A - 1;
}
if (result2 == 0)
{... | 1 | 5,432,141 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
bool a = 0;
int n = s.length();
if (n == 2 && s[0] == s[1]) {
cout << 1 << " " << 2;
a = 1;
}
if (a == 0)
for (int i = 0; i < n - 2; i++) {
if (s[i] == s[i + 1] || s[i] == s[i + 2]) {
c... | #include<iostream>
#include<iomanip>
#include<cassert>
#include<math.h>
#include<complex>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
using namespace std;
typedef long long ll;
typedef... | 1 | 68,330,157 |
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | #include <iostream>
#include <string>
#include <queue>
#define llint long long
using namespace std;
llint n;
llint a[100005];
void GaussianElimination(llint a[], int n)
{
llint r = 0;
for(int i = 59; i >= 0 && r < n; i--){
if((a[r]&(1LL<<i)) == 0){
int p = -1;
for(int j = r+1; j < n; j++){
if(a[j] & (1LL<... | 1 | 9,515,224 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
using namespace std;
#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)
#define EPS 1e-10
#define EQUAL(a, b) (fabs((a)-(b))<EPS)
typedef vector<i... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N;
cin>>N;
for(int i=0;i<N;i++){
double x1,y1,x2,y2,x3,y3,x4,y4;
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
if((x1==x2&&y1==y2)||(x3==x4&&y3==y4))cout<<"NO"<<endl;
else if(fabs(x2-x1)<0.00000000001&&fabs(x4... | 1 | 70,799,899 |
#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... | #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)-1;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; re... | 1 | 58,312,771 |
#include<stdio.h>
int main()
{
int a,b,c;
scanf("%d %d %d", &a,&b,&c);
if (a < b)
if (b < c)
printf("Yes\n");
else
printf("No\n");
else
printf("No\n");
return 0;
} | #include <cstdlib>
#include <string>
#include <iostream>
std::string get_range(int a, int b, int c) {
std::string ans;
if (a < b && b < c) {
ans = std::string {"Yes"};
} else {
ans = std::string {"No"};
}
return ans;
}
int main() {
int a;
int b;
int c;
std::cin >> a;
... | 1 | 67,371,117 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N,H; cin>>N>>H;
vector<int> a(N), b(N);
for(int i=0; i<N; i++)
cin>>a[i]>>b[i];
sort(a.rbegin(),a.rend());
sort(b.rbegin(),b.rend());
int mx=a[0], ret=0;
for(int i=0; i<N; i++)
if(b[i]>mx&&H>0) H-=b[i], ret++;
if(H>0) ret+=(H+mx-1)/mx;
cout<<re... | #include<bits/stdc++.h>
using namespace std;
#define INFTY 10000000000
typedef long long int ll;
const int MOD=1000000007;
using Graph = vector<vector<int>>;
using ipair = pair<ll,ll>;
bool operator< (const ipair a, const ipair b){return a.first < b.first;};
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll gcd(ll a, l... | 1 | 22,073,196 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<cstdlib>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
ll a[maxn],r[maxn],l[maxn];
inline ll Pow2(int i){
if(i<63) return 1ll<<i;
else return 1e18;
}
int main()
{
int n;
cin>>n;
for(int... | #include <bits/stdc++.h>
using namespace std;
#define nin(n) int n; cin >> n;
#define kin(k) int k; cin >> k;
int main() {
int n; cin>> n;
vector<long long> a(101010);
vector<long long> mi(101010);
vector<long long> max(101010);
for(int i=0;i<=n;i++){
cin >> a[i];
}
if(n==0){
if(a[0]==1){
co... | 1 | 40,402,625 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef vector<int> pi;
typedef pair<int,int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i=a; i < b; i++)
bool sort_by(vi c, vi d){
return c.S < d.S;
}
int main() {
ll T, N, H... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,k;
cin >> a >> b >> c >> k;
if(abs(a-b)>=1000000000000000000){cout << "Ubfair" << endl;}
else{
if(k%2==0)cout << a-b << endl;
else cout << b-a << endl;
}
return 0;
} | 1 | 69,714,878 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a... | 1 | 36,518,852 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
int N;
cin >> N;
int K = 0,cnt = 1;
for(;K < N;cnt++)K += cnt;
if(K != N){
cout << "No" << endl;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin>>n;
long x=1;
for(; x*(x+1)<2*n; ++x);
if (x*(x+1)!=2*n) {
cout<<"No"<<endl;
return 0;
}
auto y=x+1;
vector<vector<int>> a(y, vector<int>(x));
for(int r1=0, c1=0, r2=1, c2=0, i=1; i<=n; ++i) {
a... | 1 | 57,603,938 |
#include <algorithm>
#include <iostream>
#include <climits>
using namespace std;
const int N = 5000;
int ii[N], cc[N], qu[N];
bool visited[N];
int main() {
int n, k; cin >> n >> k;
for (int i = 0; i < n; i++) {
int p; cin >> p, p--;
ii[i] = p;
}
for (int i = 0; i < n; i++)
cin >> cc[i];
long long ans = LLONG... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> P(N), C(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
P.at(i)--;
}
for (int i = 0; i < N; i++) cin >> C.at(i);
long long int ans = -1000000000000000000;
for (int i = 0; i < N; i++) {
int v = i... | 1 | 81,729,119 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
int ans0 = 0;
for (int n = 0;n<S.size();++n) {
if (1 == n%2) {
if ('0' != S[n]) {
ans0++;
}
}
else {
if ('1' != S[n]) {
ans0++;
}
}
}
int ans1 = 0;
for (int n = 0; n < S.size(); ++n) {
if (1 == n % 2) {
... | #include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
string s;
cin >> s;
int n = s.size();
int cnt = 0;
if(s[0]=='0'){
for(int i=0; i<n; ++i){
if(i%2==0){
if(s[i]!='0')... | 1 | 69,753,226 |
#include<bits/stdc++.h>
using namespace std;
int n,m,i,j,d,x,y;
int main()
{
cin>>x;n=x/100;y=100*n+10*n+n;
if(x<=y)return cout<<y,0;
else return n++,cout<<100*n+10*n+n,0;
} | #include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
void solve() {
int n;
cin >> n;
int ans;
string is;
rep(n, 1000) {
is = to_string(i);
if (is[0] == is[1] && is[1] == is[2]) {
ans = i;
break;
... | 1 | 85,234,443 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int S = 0, T = 0;
for (int i = 0; i < 4; ++i) {
int temp;
cin >> temp;
S += temp;
}
for (int i = 0; i < 4; ++i) {
int temp;
cin >> temp;
T += temp;
}
cout << max(S, T) << endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include ... | 1 | 12,945,367 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
ll dp[1002][100... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; }... | 1 | 73,244,366 |
#include<iostream>
using namespace std;
int main(){
double a,b,c,d,e,f,g,h;
int n;
int x,y;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a>>b>>c>>d>>e>>f>>g>>h;
x=(d-b)/(c-a);
y=(h-f)/(g-e);
if((d-b)/(c-a)==(h-f)/(g-e)){cout<<"YES"<<endl;}
else {cout<<"NO"<<endl;}
}
} | #include <iostream>
using namespace std;
class Vector2{
public:
Vector2() : x( 0.0 ), y( 0.0 ){}
Vector2( double aX, double aY ) : x( aX ), y( aY ){}
double cross( Vector2& v ){
return ( x * v.y ) - ( y * v.x );
}
void operator-=( Vector2& v ){
x -= v.x;
y -= v.y;
}
double x, y;
};
int main(){
int n;
cin... | 1 | 93,684,466 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long ll;
typedef pair<ll,ll> P;
int n;
bool use[1010101] = {0};
int main(){
cin >> n;
int cnt = 0, i;
for(i = 1; cnt < n; i++){
cnt += i;
}
if(cnt == n){
for(int j = 1; j < i; j++){
cout << j <<... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int N;
int i;
int sum = 0;
vector<int> ans;
cin >> N;
for (i = 1; i <= N; i++)
{
if (sum > N)
break;
sum += i;
}
for (int j = 1; j < i; j++)
{
if (sum - j != N)
{
cout << j << endl;
}
}
return 0;
} | 1 | 67,410,052 |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
const int MX = 1e3 + 5;
int main() {
int a, b, c;
cin >> a >> b >> c;
(c >= a && c <= b) ? cout << "Yes\n" : cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) printf("%d\n",(int)n)
#define lprin(n) printf("%lld\n",n)
#define rep(i,ini,n) for(int i=ini;i<(int)n;i++)
#define pb push_ba... | 1 | 86,759,145 |
#include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define... | #include <iostream>
#include <stdio.h>
using namespace std;
typedef long long LL;
const int M=305;
const LL INF=(LL)M*(1000000000);
LL dp[M];
LL h[M];
int main()
{
int n,k;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%lld",&h[i]);
for(int i=1;i<=n;i++)
dp[i]=INF;
for(int i=1;i<=n-k;i++)
{
for(int j=n... | 1 | 79,654,968 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fo(i,s,e) for( i=s;i<e;i++)
#define rfo(i,s,e) for(i=s;i>e;i--)
#define LL long long int
const LL MOD=1e9+7;
#define pb push_back
#define pob pop_back()
#define sp " "
#define ff first
#define ss second
int main(){
ios_base::sync_with_stdio(fa... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
u... | 1 | 52,995,429 |
#include <bits/stdc++.h>
#define FOR(i, k, n) for(int i = (k); i < (n); i++)
#define FORe(i, k, n) for(int i = (k); i <= (n); i++)
#define FORr(i, k, n) for(int i = (k); i > (n); i--)
#define FORre(i, k, n) for(int i = (k); i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ALL(x) (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define ve vector
const int mod = 1000000007;
int main(){
int n,m;
cin >> n >> m;
ve<int> s(n), t(m);
rep(i,n) cin >> s[i];
rep(i,m) cin >> t[i];
ve<ve<... | 1 | 98,588,643 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>
#include... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <sstream>
#include <queue>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iterator>
#include <stack>
#include <list>
using namespace std;
typedef long long int lli;
typedef pair<int,int> P;
#define F... | 1 | 22,106,875 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
string S;
cin>>S;
int len=S.size();
int num;
int ans=1000;
rep(i,len-2){
num=(S[i]-'0')*100+(S[i+1]-'0')*10+S[i+2]-'0';
ans=min(ans,abs(753-num));
}
cout<<ans... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int main() {
string S; cin >> S;
int ans = 10000;
rep(s, S.size() - 2) {
string T = S.substr(s, 3);
int x = 0;
rep(i, 3) x = x * 10 + (T[i] - '0');
ans = min(ans, abs(753 - x));
}
c... | 1 | 13,331,475 |
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <tuple>
#include <complex>
#include <cassert>
#include <exce... | #include<stdio.h>
int main(){
int C=0;
for(int i=1;i<1000;i++)
{if(i%3==0)C+=200;else C+=195;}
int n,y,m,d;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d%d%d",&y,&m,&d);
if(y==0&&m==0&&d==0)break;
int c=0;
for(int i=1;i<y;i++)
{if(i%3==0)c+=200;else c+=195;}
for(int i=1;i<m;i++){
if(y%3==0)c+=20;
else if(i%2==0)c+=1... | 1 | 8,963,053 |
#include <iostream>
using namespace std;
int main()
{
for (int n, count; cin >> n; cout << count << endl) {
count=0;
if (n<=36) {
for (int a=0; a<10; a++) {
for (int b=0; b<10; b++) {
for (int c=0; c<10; c++) {
for (int d=0; d<1... | #include <iostream>
using namespace std;
int main() {
int n, i, j, k, l, ans;
while (cin >> n) {
ans = 0;
for (i = 0; i <= 9; i++) {
if (i > n) continue;
for (j = 0; j <= 9; j++) {
if (i + j > n) continue;
for (k = 0; k <= 9; k++) {
if (i + j + k > n) continue;
for (l = 0; l <= 9; l++)
... | 1 | 53,333,452 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.