code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int N=s.size();
int zero=0,one=0;
for(int i=0;i<N;i++){
if(s.at(i)=='0')
zero++;
else
one++;
}
int ans=N-abs(zero-one);
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define tc(t) int t; cin>>t; while(t--)
#define f(n) for(int i=0;i<n;i++)
#define endl "\n"
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin>>n>>m;
vector<pair<int,string>>v(m);
vector<pai... | 0 | 11,799,638 |
#include <bits/stdc++.h>
#include<iomanip>
#define ll long long
#define pb push_back
#define mp make_pair
#define MOD 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b;
cin >> a >> b;
if(a%b) cout << a;
else cout << -1;
cout << "\n";
ret... | #include <iostream>
#include <string>
using namespace std;
int main(){
string s,l,ss="#";
int a,now,nnow,cou;
l="qwertasdfgzxcvb";
while(1){
cin>>s;
if(s==ss)break;
a=s.size();
if(l.find(s[0])==-1)now=0;
else now=1;
cou=0;
for(int i=1;i<a;i++){
if(l.find(s[i])==-1)nnow=0;
... | 0 | 74,058,059 |
#include <iostream>
#include <vector>
using namespace std;
const int N_MAX = 100;
bool P[N_MAX+1] = {false, false};
void sieve(int n) {
fill(P+2, P+n+1, true);
for (int i = 2; (long long)i*i <= n; ++i) {
if (P[i]){
for (int j = i*i; j <= n; j += i) {
P[j] = false;
}
}
}
}
vector<pair<int,int>> prime_fa... | #include "bits/stdc++.h"
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl '\n'
#define F first
#define S second
#define IO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define cf ll testcases;cin>>testcases;while(testcases--)
#define prn(x) if(x) cout<<"YES"<<endl; else cout<<"NO"<<endl;
#... | 0 | 71,581,589 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, n) for(int i = 1; i <= n; i++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) rbegin(x), rend(x)
#define pb push_back... | 0 | 43,904,004 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m,s,g,p[200];
while(cin>>m>>s>>g,m){
int ans=-1,an;
for(int i=0;i<m;i++)cin>>p[i];
sort(p,p+m,greater<int>());
for(int i=g;i>=s;i--)if(ans<p[i-1]-p[i])ans=p[i-1]-p[i],an=i;
cout<<an<<endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int mcxitoi(string s) {
int res = 0;
int t = 1;
for (char c : s) {
if (isdigit(c)) {
t = c - '0';
} else {
if (c == 'm') t *= 1000;
else if (c == 'c') t *= 100;
else if (c == 'x') t *= 10;
res += t;
t = 1;
}
}
return res;
}
string s... | 0 | 9,429,182 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >>n;
vector<long long>a(n),b(n),c(n,0),d(n,0);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
for(int i=0;i<n;i++){
if(a[i]-b[i]<0)c[i]=a[i]-b[i];
else if(a[i]-b[i]>0)d[i]=a[i]-b[i];
}
sort(c.begin(),c.end());
s... | 0 | 5,896,118 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
int N, result = 0;
cin >> N;
REP(i, ... | #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 gcd(int a , int b){
while(a > 0 && b > 0){
if(a > b) a %= b;
else b %= a;
}
return a + b;
}
int a ,... | 0 | 12,530,373 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
using namespace std;
int main(void)
{
string s;
int h = 0;
cin>>s;
vector<int> dp(1<<26,1e9);
dp[0] = 0;
for(int i = 0;i < s.size();i++) {
int bit = s[i] - 'a';
h = h ^ (1<<bit);
for(int j = 0;j < 26;j++) ... | #include<iostream>
using namespace std;
int main(){
int n , a[10000] ;
long min =0 , max = 0 , sum = 0 ;
cin >> n ;
cin >>a[1] ;
min = a[1] ; max = a[1] ; sum = a[1] ;
for (int i = 2 ; i <= n ; i = i + 1 )
{
cin >>a[i] ;
if ( min > a[i] ){
min = a[i] ;
... | 0 | 28,207,689 |
#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;
int main() {
ll N, K; cin >> N >> K;
vector<P> p;
rep(i, N){
int a, b; cin >> a >> b;
p.push_back(make_pair(a, b));
}
sort(p.begin(), p.end());... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 1... | 0 | 53,243,601 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
s[5] = ' ';
s[13] = ' ';
cout << s << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define INF 1<<30
#define LINF (ll)1<<62
#define MAX 510000
#define rep(i,n) for(ll i=0; i<(n); i+... | 0 | 87,460,081 |
#include <cstdio>
#include <cstdint>
#include <vector>
#include <algorithm>
using namespace std;
uint32_t n;
vector<uint32_t> v;
void solve() {
sort(v.begin(), v.end());
double ave = (v[0]+v[1])/2.0;
for (int i=2;i<n;i++) {
ave = (ave + v[i])/2.0;
}
printf("%lf\n", ave);
}
int main() {
s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll N,C,K;
cin >> N >> C >> K;
vector<ll> T(N);
rep(i,N){
cin >> T.at(i);
}
ll bus = 0;
sort(T.begin(),T.end());
for( ll p = 0;p<N;p++){
ll q = p;
while(T.at(q... | 0 | 59,765,526 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll a,b,c;
cin>>a>>b>>c;
string s="";
s+=(a+'0');
s+=(b+'0');
s+=(c+'0');
sort(s.rbegin(),s.rend());
ll ans=((s[0]-'0')*10)+(s[1]-'0');
ll k=s[2]-'0';
cout<<ans+k<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const int INF = 1 << 30;
const ll LINF = 1ll << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
double T;
int main(){
ll N, K;
cin >> N >> K;
vector<pll>... | 0 | 64,614,299 |
#include<bits/stdc++.h>
#include<string>
#include<vector>
using namespace std;
typedef pair<int, int>P;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#de... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const ll INFS=1e18;
const int MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
cons... | 0 | 56,879,646 |
#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;
int main() {
string S;
cin >> S;
... | #include <bits/stdc++.h>
using namespace std ;
int main(){
int a ;
cin >> a ;
long long int n[a] ;
long long int sum = 0 ;
for(int i=0;i < a;i++){
cin >> n[i] ;
if(i > 0 && n[i] < n[i-1]){
sum += n[i-1] - n[i] ;
n[i] = n[i-1] ;
}
}
cout << sum << e... | 0 | 21,248,920 |
#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i,n) for ((i)=(n);... | #include<iostream>
#include<map>
#include<vector>
#include<array>
const int DiceSizeFace = 6;
using namespace std;
using DiceSides = map<int, array<int, 4>>;
using Labels = map<int, int>;
int main() {
DiceSides sides = {
{1, {5, 3, 2, 4}},
{2, {1, 3, 6, 4}},
{3, {1, 5, 6, 2}},
{4, {1, 2, 6, 5}},
{... | 0 | 47,100,006 |
#include<cstdio>
int main(){
int a,b;
while(1){
scanf("%d %d",&a,&b);
if((a == 0)&&(b == 0)) break;
if(a<b){
printf("%d %d\n",a,b);
}else{
printf("%d %d\n",b,a);
}
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 16,176,708 |
#include <bits/stdc++.h>
using namespace std;
int main () {
long long n, m, d;
cin >> n >> m >> d;
long long k;
if (n-1 < d+d || d == 0) {
k = 0;
}
else {
k = n-d-d;
}
long double a = (n+k)*(m-1);
a /= n*n;
printf("%.10Lf\n", a);
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld=long double;
using vin=vector<int>;
using v... | 0 | 32,560,790 |
#include<stdio.h>
void swap(int *a,int *b,int *c){
int temp=*a;
*a=*b;
*b=temp;
(*c)++;
}
int main(){
int i,n,j,k,count=0,flag;
int a[101];
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=0;i<n-1;i++){
int min=a[i];
for(j=i+1;j<n;j++){
if(min>a[j]){
min=a[j];
flag=j;
}
}
if(min<... | #include<bits/stdc++.h>
using namespace std;
int a[101][101],num[101],dis[101];
bool vis[101];
int n,u,k,x,t=1;
queue<int> q;
int main(){
memset(a,0,sizeof(a));
memset(vis,false,sizeof(vis));
memset(dis,0x1f1f1f1f,sizeof(dis));
cin>>n;
for (int i=0; i<n; i++){
cin>>u>>k;
num[u]=k;
int j=0;
while (k--){
... | 0 | 70,143,224 |
#include<bits/stdc++.h>
using namespace std;
int lower_case(char x[],int n,bool b){
for(int i=0;i<n;i++)
if(x[i]>=65&&x[i]<=90)
{b=1;break;}
return b;}
int main(){
string s,t,u;
int a,p;
bool b = 0;
cin>>s>>t;
int n = s.length(),m=t.length();
int x1,x2;
char x[n+1],y[m+1];
strcpy(x,s.c_str());st... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
ll n;
cin >> n;
ll mid = sqrt(n);
... | 0 | 25,625,768 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
int main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0);
int a, b, m;
cin >> a >> b >> m;
vector<int> p;
int i;
int minp, minq;
for(i=0; i<a; i++){
int n;
cin >> n;
p.push_back(n);
}
vector<int> q;
for(i=0; i<b; ... | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n)... | 0 | 53,420,911 |
#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>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n), r(n);
for (int i = 0; i < n; i++) cin >> p[i];
for (int i = 0; i < n; i++) cin >> q[i];
iota (r.begin(), r.end(), 1);
bool pf = true, qf = true;
int a, b;
for (int i = 1; pf || qf; i++... | 0 | 73,535,704 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utilit... | 0 | 93,338,145 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,Q;
cin >> N >>Q;
int64_t ans=-1;
if(N==Q||Q==1)
{
cout << ans <<endl;
}
else
{
int co=1;
ans=N;
bool chk=true;
while (chk)
{
if(!(ans%Q==0))
{
... | #include <bits/stdc++.h>
using namespace std;
#define Gene template< class
#define Rics printer& operator,
Gene c> struct rge{c b, e;};
Gene c> rge<c> range(c i, c j){ return {i, j};}
struct printer{
~printer(){cerr<<endl;}
Gene c >Rics(c x){ cerr<<boolalpha<<x; return *this;}
Rics(string x){cerr<<x;return ... | 0 | 99,933,976 |
#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 <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for(ll i = 0; i < n; i++)
... | 0 | 65,432,237 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<string> a, b;
for (... | #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], ... | 0 | 17,869,200 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int lcm(int a, int b){
return a * b / gcd(a, b);
}
int main() {
int x;
int ans;
cin >> x;
cout << lcm(360, x) / x << endl;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
using namespace std;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
typedef long long ll;
typedef long double ld;
const ll SIZE = 1e5 * 3 + 10;
int main(... | 0 | 97,160,360 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int,int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define RREP(i,n)... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | 0 | 97,059,801 |
#include <iostream>
using namespace std;
int fib(int n){
int ans[45] = {1,1},i;
for(i=2;i<=n;i++){
ans[i] = ans[i-1]+ans[i-2];
}
return ans[n];
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 81,881,909 |
#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();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
#define IOS ios_base::sync_with_stdio(0); cin... | 0 | 89,564,696 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int ans = 0;
int N;
std::cin >> N;
vector<int> tako(N);
for(int i = 0; i < N; i++){
std::cin >> tako[i];
}
for(int i = 0; i < N-1; i++){
for(int j = i+1; j < N; j++){
ans = ans + tako[i]*tako[j];... | #include <bits/stdc++.h>
#define long long long int
using namespace std;
const long MOD = 1000000007;
long power(long a, long b) {
long res = 1;
while (b > 0) {
if (b & 1) {
res *= a;
res %= MOD;
}
a *= a;
a %= MOD;
b >>= 1;
}
return res;
}... | 0 | 85,580,659 |
#include <cstdio>
#include <cstring>
using namespace std;
#define MAX_L 16
int table[MAX_L + 1][MAX_L + 1];
bool wall[MAX_L + 1][MAX_L + 1];
int a, b, n;
int main(){
while(1){
scanf("%d%d", &a, &b);
if(a == 0 && b == 0) return 0;
scanf("%d", &n);
int in_x, in_y;
memset(wall, 0, sizeof(wall));
for(int i = 0... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | 0 | 10,300,775 |
#include<stdio.h>
int main(){
int angka, digitBelakang, digitTengah, digitAwal;
scanf("%d", &angka);
digitBelakang = angka % 10;
digitTengah = (angka - digitBelakang) / 10 % 10;
digitAwal = (angka - digitBelakang) / 100 % 10 ;
if (digitBelakang == 7){
puts ("Yes");
}
else if (digitTengah == 7){
puts (... | #include <iostream>
#include <cstdio>
using namespace std;
int n;
bool flag;
int a[15] = { 0, 111, 222, 333, 444, 555, 666, 777, 888, 999 };
int main() {
scanf("%d", &n);
flag = n > a[n / 100];
printf("%d\n", a[n / 100 + flag]);
return 0;
} | 0 | 32,350,652 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int a[5];
int x=0,tmp=0;
int sum=0;
for(int i=0;i<5;i++){
cin>>a[i];
if(a[i]%10==0){
sum+=a[i];
}else{
sum+=(a[i]/10+1)*10;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, pair<int, int> > p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S;
cin >> N >> S;
int left, right;
left = 0;
right = 0;
int la = 0;
for(int i = 0; i < N; i++) {
if(S[... | 0 | 52,851,405 |
#include <iostream>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main()
{
int n,flag=1,i;
char str[200];
cin>>str;
n=strlen(str);
if(n%2)
n--;
else
n-=2;
while(flag)
{
flag=0;
for(i=0;i<n/2;i++)
{
if(str[i]!=str[(n/2... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
struct union_find{
vector<int> par;
vector<int> rank;
union_find(int sz){
par.resize(sz);
rank.assign(sz,0);
for(int i=0;i < sz;i++) par[i]=i;
}
int find(int a){
if(par[a]==a)... | 0 | 10,023,850 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;
int main(){
string s;
cin>>s;
ll N = int(s.size());
ll cnt[30] = {0};
for(int i(0);i<N;i++){
cnt[s[i]-'a']++;
}
ll ans(N*(N-1)/2+1);
for(int i(0);i<30;i++){
an... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | 0 | 35,324,691 |
#include <bits/stdc++.h>
using namespace std;
int n, p;
int main(){
cin >> n;
for(int i=1; i<n; ++i){
if(i * (i + 1) / 2 >= n){
p = i;
break;
}
}
for(int i=1; i<=p; ++i){
if(i == p * (p + 1) / 2 - n) continue;
cout << i << "\n";
}
if(n == 1) cout << 1 << "\n";
if(n == 2) cout << 2 << "\n";
} | #include <iostream>
#include <queue>
using namespace std;
int H,W;
char A[1007][1007];
int D[1007][1007];
int vx[4] = {0,-1,0,1};
int vy[4] = {1,0,-1,0};
int bfs(){
int ans = 0;
queue<pair <int,int> > Q;
for(int y = 1; y< H+1;y++){
for(int x = 1;x < W+1;x++){
if(A[x][y] == '#'){
... | 0 | 47,990,967 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--... | #include <iostream>
using namespace std;
#define MAX 10005
struct Node {
int v, p, h;
};
Node node[MAX];
int findSet(int x) {
int now, p, result;
now = x;
p = node[now].p;
while (now != p) {
now = p;
p = node[now].p;
}
result = p;
p = x;
while (p != result) {
... | 0 | 1,789,532 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n,k;
string s; cin>>n>>s>>k; k--;
rep(i,n) if(s[i]!=s[k]) s[i]='*';
cout<<s<<'\n';
return 0;
} | #include <iostream>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.... | 0 | 55,675,710 |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
while (1) {
int h, w;
cin >> h >> w;
if (h == 0 && w == 0) {
break;
}
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
} | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debug_with_space(x) cerr << #x << " " << x << " "
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <ll, pii> muchie;
const ll NMAX = 61 * 200;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const l... | 0 | 6,009,806 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | #include <iostream>
#include <string>
using namespace std;
int main(){
while (1) {
string s;
cin >> s;
if (s == "-") break;
int n;
cin >> n;
while (n) {
n--;
int h;
cin >> h;
string b1 = s.substr(0, h);
string b2 = s.substr(h);
s = b2 + b1;
}
cout <<... | 0 | 82,532,346 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main(){
LL N, A, B;
scanf("%lld %lld %lld", &N, &A, &B);
LL ans = max(0LL, (N - 2) * (B - A) + 1);
printf("%lld\n", ans);
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <string>
#include <climits>
using namespace std;
#define MAX_N 101
int main()
{
vector<vector<int> > A(MAX_N, vector<int>(MAX_N, 0));
int i, k, u, v, n;
cin >> n;
for (i = 1; i <= n;... | 0 | 58,931,995 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int s=0;
int x=n;
while(x>0){
s+=x%10;
x/=10;
}
cout<<(n%s==0?"Yes":"No")<<endl;
} | #include<bits/stdc++.h>
#define int long long
using namespace std;
const double eps=1e-8;
int read()
{
int s=0;
char c=getchar(),lc='+';
while (c<'0'||'9'<c) lc=c,c=getchar();
while ('0'<=c&&c<='9') s=s*10+c-'0',c=getchar();
return lc=='-'?-s:s;
}
void write(int x)
{
if (x<0)
{
putchar('-');
x=-x;
}
if (x<... | 0 | 41,376,097 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin >> N >> A >> B;
int ua=0,ab=0,ob=0;
for(int i=0;i<N;i++){
int x;
cin >> x;
if(x<=A)ua++;
else if(x>=B+1)ob++;
else ab++;
}
cout << min({ua,ab,ob});
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define PI (acos(-1))
template<class T>
inline bool ... | 0 | 55,284,141 |
#include<iostream>
#include<stdio.h>
#include<cmath>
using namespace std;
int main(){
double x1,x2,y1,y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int o[100];
int u[200];
int root(int s){
while(o[s]>=0)
s=o[s];
return u[s];
}
void merge(int x, int y){
x = root(x);
y = root(y);
if(x == y) return;
o[x]+=o[y];
o[y]=x;
}
bool same(int x,int y){
return root(x) == root(y);
}
int main(){
string str;
fo... | 0 | 60,512,457 |
#include <iostream>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <functional>
#define big ((long long)(1e9) + 7)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define DBG(x) cerr << #x << ": " << (... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statistics_n... | 0 | 18,774,035 |
#include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath... | #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
int main(){
long long inf=10000000000;
int v,e;
cin >> v >> e;
long long dp[v][v];
for(int i=0;i<v;i++){
for(int j=0;j<v;j++){
dp[i][j]=inf;
}
}
for(int i=0;i<e;i++)... | 0 | 31,551,127 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#def... | #include<stdio.h>
#include<string.h>
int n,m;
char s1[100],s2[100];
char hash[2000];
char output[20000000];
int main(){
int i;
while(1){
for( i = 0; i < 1000; i++ )
hash[i] = 0;
scanf("%d",&n);
if(!n)break;
for( i = 0; i < n; i++ ){
scanf("%s%s",s1,s2);
hash[(int)s1[0]] = s2[0];
}
scanf("%d",&m);... | 0 | 64,291,698 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int mod=1000000007;
int n,m,k;
cin >> n>>m>>k;
bool ex=false;
rep(i,n+1){
rep(j,m+1){
if(i*j+(n-i)*(m-j)==k){
ex... | #include <iostream>
#include <string>
int main(){
std::string O, E;
std::cin >> O >> E;
std::string S, Sout;
S = O + E;
int N = S.size();
for (int i=0; i<N; i++){
if (i % 2 == 0){
Sout = Sout + O.at(i/2);
} else{
Sout = Sout + E.at(i/2);
}
}
std::cout << Sout ... | 0 | 55,291,874 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, const char *argv[]) {
vector<int> p(3);
cin >> p[0] >> p[1] >> p[2];
sort(p.begin(), p.end(), greater<int>());
cout << p[0] * 10 + p[1] + p[2] << endl;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 57,572,846 |
#include <bits/stdc++.h>
using namespace std;
int nth_bit(int64_t num, int n){
return (num >> n) & 1;
}
int main(){
int M, K;
cin >> M >> K;
if(M == 1){
if(K == 0){
cout << "0 0 1 1" << endl;
}else{
cout << -1 << endl;
}
return 0;
}
int MX ... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | 0 | 53,408,757 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int a,b;
char c;
cin>>a>>c>>b;
if(c=='+') cout<<a+b<<endl;
else cout<<a-b<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll, ll> >
#define plli pair... | 0 | 99,857,763 |
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
using namespace std;
#define REP(i, a,b) for(i=a;i<b;i++)
#define output(x) cout<<x<<endl;
typedef long long int ll;
int main()
{
ll i, j, k, l, m, sum, flag,ans,W,H,N;
sum = 0;
flag = 0;
cin >> N;
vector<ll>A(N);
REP(i, ... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main(){
int n,h; cin >> n >> h;
vector<int> hai(n),hei(n);
for(int i = 0; i < n; i++){
cin >> hai[i];
hei[i] = 0;
}
int sum = 0;
int a, b;
for(int i = 0; i < h; i++){
cin >> a >> b;
hei[a -1] =... | 0 | 53,816,775 |
#include<bits/stdc++.h>
using namespace std;
#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 erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | 0 | 70,600,064 |
#include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 10000000... | #include <iostream>
#include <vector>
#include <tuple>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector< vector<int> > wf(N, vector<int>(N, 1000000000));
vector< tuple<int,int,int> > edge;
while(M--) {
int a, b, c;
cin >> a >> b >> c;
--a;
--b;
... | 0 | 10,732,602 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(i,e) for(ll i=0;i<e;i++ )
typedef pair<ll,ll> P;
const ll mod = 1e9+7;
const ll INF = INT64_MAX;
ll i;
int main(){
string A,B,C;
cin>>A>>B>>C;
if(A.at(A.length()-1)==B.at(0)&&B.at(B.length()-1)==C.at(0))cout<<"... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if ... | 0 | 13,404,404 |
#include<iostream>
using namespace std;
int main() {
int n, y, m, d;
int totalDays = 999*(5*19+5*20) + 333*5;
cin>>n;
for(int i=0; i<n; i++) {
int ans = totalDays;
cin>>y>>m>>d;
for(int a=1; a<=y; a++) {
if(a != y) {
for(int b=1; b<=10; b++) {
if(a%3==0 || b%2==1) {
ans -= 20;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 66,368,220 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int a,b,c;
cin >> a >> b >> c;
int count=3;
if (a==b && b==c) {
cout << 1 << endl;
return 0;
}
if (a==b) --count;
if (b==c) --count;
if (a==c) --count;
cout << count << endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
string t_cade,h_cade;
int t_point=0,h_point=0;
cin >>n;
for(int i=0;i<n;i++)
{
cin>>t_cade>>h_cade;
if(t_cade==h_cade)
{
t_point++;
h_point++;
}else
{
... | 0 | 78,369,922 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using u32 = uint32_t;
using vi = vector<int>; using vvi = vector<vi>;
using vb = vector<bool>; using vvb = vector<vb>;
using vl = vector<ll>; using vvl = vector<vl>;
using vd = vector<dou... | #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 | 86,912,300 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = (ll) 1e18;
int main()
{
int N;
cin >> N;
string s;
cin >> s;
rep(i,2){
rep(j,2){
vector<int>now(N,-1);
now[0]=i;
now[1]=j;
for(int k=... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
int N;
cin >> N;
int X[N];
ll sum = 0;
for (int i = 0; i <... | 0 | 23,950,966 |
#include<bits/stdc++.h>
using namespace std ;
const int A_MAX = 1000005 ;
int main() {
int N ;
cin >> N ;
vector<int> A(A_MAX+1) ;
vector<int> C(A_MAX+1), cnt(A_MAX+1);
for(int i = 1 ; i <= N ; i++) {
cin >> A.at(i) ;
C.at(A.at(i))++ ;
}
int ans = 0 ;
for(int i = 1 ; i <= A_MAX ; i++){
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int mod = 1e9 + 7;
int main() {
string s1, s2;
cin >> s1 >> s2;
int n = (int)s1.size();
int m = (int)s2.size();
if (n > m) {
cout << "GREATER";
return 0;
}else if (n < m) {
cout << "LESS";
return 0;
}
for (int i = 0; i < n; ++i) {
if ... | 0 | 32,878,555 |
#ifndef ___Class_Union_Find
#define ___Class_Union_Find
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
class Union_Find
{
private:
vector<int> data;
public:
Union_Find(unsigned size_) : data(size_, -1) { }
void unite(int x, int y);
bool same(int x, int y);
int root(int x);
};
void U... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#define pi 3.14159265358979323846264338327950
int main() {
int N; std::cin >> N;
std::vector<double> v(N);
for (auto& r : v) std::cin >> r;
std::sort(v.begin(), v.end());
double ans = v[0];
for (int... | 0 | 72,185,422 |
#include <iostream>
using namespace std;
int main(void){
string s;
long long k;
cin >> s;
cin >> k;
long t = 0;
char c = '1';
for(long i = 0;i < s.size();i++){
if(s[i] == '1'){
t++;
}else{
c = s[i];
break;
}
}
... | #include <stdio.h>
#include <math.h>
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int i,j,k,m;
main()
{
int c=0;
int k,s;cin>>k>>s;
for(i=0;i<=k;i++)
{
for(j=0;j<=k;j++)
{
int f=i+j;
if((s-f)>=0&&(s-f)<=k) c++;
}
}
cout<<c... | 0 | 70,374,935 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | 0 | 78,485,899 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
using namespace std;
int main(){
int N;
double v[100];
cin >> N;
for (int i = 0; i < N; i++){
cin >> v[i];
}
sort(v, v + N);
double ans = (v[0] + v[1... | #include <bits/stdc++.h>
using namespace std;
int main()
{
std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
long test;
test=1;
while(test--)
{
long a,b;
cin>>a>>b;
if(a==b)cout<<"Draw";
else if(a==1 || b==1)
{
if(a==1)cout<<"Alice";
else cout<<"Bob... | 0 | 13,677,428 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
void xinf(int x,int y,int W,int H,bool xy[][101]){
for(int i = 0;i <= x;i++){
for(int j = 0;j <= H;j++){
xy[i][j] = false;
}
}
}
void xsup(int x,int y,int W,int H,bool ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = (1LL << 60) * (-1);
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main()
{
... | 0 | 52,673,943 |
#include<iostream>
#include<cstring>
#include<cstdio>
int main()
{
char a[10],b[10],c[10];
scanf("%s %s %s",a,b,c);
printf("%c%c%C\n",toupper(a[0]),toupper(b[0]),toupper(c[0]));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> data(N, vector<int> (D));
for(int i = 0; i < N; i++) {
for(int j = 0; j < D; j++) {
cin >> data.at(i).at(j);
}
}
int count = 0;
for(int i = 0; i < N - 1; i++) {
for(int j = i + 1; j < ... | 0 | 58,909,727 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string s;
cin >>s;
int n=s.size();
if(n==26){
int chk=5000;
for(int i=24;i>=0;i--){
int a=s.at... | 0 | 79,588,310 |
#include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(is... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 0 | 85,672,162 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int a,b;
string s;
int main(void){
cin>>a>>b>>s;
for(int i=0;i<a+b+1;i++){
if(i==a){
if(s[i]!='-'){
cout<<"No"<<endl;
return 0;
}
}else{
... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ld long double
using ll = long long;
... | 0 | 61,350,091 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | 0 | 94,635,273 |
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end(... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n), b(n);
for(int i = 0; i < n; ++i)
{
int num;
cin >> num;
a[i] = num;
b[i] = num;
}
sort(a.begin(), a.end());
int max = a[n-1];
int next;
bool dup = false;
... | 0 | 80,269,524 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n;
cin>>n;
vector<int> a(n);
rep(i,n){
cin>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MAX 100000
#define NIL -1
#define MOD 1000000007
typedef int _loop_int;
#define rep(i,n) for(int i = 0; i < n; i++)
#define FOR(i,a,b) for(_loop_... | 0 | 85,072,551 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N;
cin >> N;
vector<ll> t(N+1, 0), x(N+1, 0), y(N+1, 0);
rep(i, 0, N) cin >> t[i+1] >> x[i+1] >> y[i+1];
rep(i, 0, N){
ll dx = abs... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | 0 | 86,544,501 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | #include<bits/stdc++.h>
using namespace std;
#define SORT(c) sort((c).begin(),(c).end());
#define pb push_back
#define MP make_pair
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define pi 3.141592653589793
#d... | 0 | 1,207,239 |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#incl... | #include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
\
#define FOR(i,l,r) for(size_... | 0 | 97,318,856 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,int> P;
int main() {
int N;
cin >> N;
vector<vector<char>> vec(N,vector<char>(N));
for(int i = 0;i ... | #include <bits/stdc++.h>
using namespace std;
int const MOD = 1000000007;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int dp[1001][1001];
int main(){
cin.tie(0); ios::sync_wi... | 0 | 91,513,563 |
#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()
int get(int a, int b, int x) {
int l = ((a - 1) / x + 1) * x;
int r = b / x * x;
return (r - l) / x + 1;
}
int lcm(int a, int b) {
return a / __gcd... | #include<bits/stdc++.h>
using namespace std;
const long long int modu=1e9+7;
#define endl '\n'
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define inp(x) for(auto &t:x) cin>>t;
#define itr vector<int>::iterator
#define debug(a) cout << #a << "=" << a << ' '<<endl;
#define out(x) for(aut... | 0 | 78,803,774 |
#include <iostream>
using namespace std;
int main()
{
int t , x;
double ans;
cin >> t >> x;
ans = (double)t / (double)x;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 38,121,143 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
type... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 0 | 3,992,887 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
ll A, B;
vector<vector<ll>> G(N);
for (ll i=0; i<M; i++) {
cin >> A >> B;
A--;
B--;
G[A].push_back(B);
G[B].push_back(A);
}
vector<ll> di... | 0 | 93,135,803 |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int i;
cin >> i;
cout << N - i + 1 << endl;
return 0;
} | #include<iostream>
#include<unordered_map>
#include<algorithm>
#include<vector>
#include<string>
#include<string.h>
#include<unordered_set>
using namespace std;
vector<int> prime_sieve(int n)
{
int* arr = new int[n+1];
int i, p;
for (i = 0; i <= n; ++i) {
arr[i] = i;
}
for (i = 2; i <= n; ++... | 0 | 90,273,187 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define LINF 100000000000000007LL
#define ll long long
using namespace std;
signed main(){
int n;
cin>>n;
cout<<0<<endl;
string st;
cin>>st;
if( st == "Vacant" )return 0;
int ok = 0, ng = n;
while( ng... | #include<bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define rep0(i,j) for(int i=0;i<j;i++)
#define rep1(i,j) for(int i=1;i<=j;i++)
#define rep0d(i,j) for(int i=j-1;i>=0;i--)
#define MOD 1000000007
#define MAX (lli)1e12
typedef pair<lli... | 0 | 92,817,777 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<pair<ll, ll>> drink(N);
for (int i = 0; i < N; i++) cin >> drink[i].first >> drink[i].second;
sort(drink.begin(), drink.end());
ll ans = 0;
for (int i = 0; i < N; i++) {
if (drink[i].second... | #include <bits/stdc++.h>
#include <iostream>
#include <ctime>
using namespace std;
#define _LL long long
#define rep(i, n) for (_LL i = 0; i < (_LL)(n); i++)
#define vecrep(itr, v) for (auto itr = (v).begin(); itr != (v).end(); itr++)
int main()
{
string s; cin >> s;
_LL k; cin >> k;
int l = s.length();
... | 0 | 82,959,719 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i... | 0 | 8,058,180 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n), d(n + 1);
rep(i, n) cin >> a[i];
rep(i, n) {
d[i + 1] = d[i] + a[i];
d[i + 1] %= k;
}
map<ll, ll> mp;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
int len = s.leng... | 0 | 45,503,381 |
#include<bits/stdc++.h>
#define MAX 100001
using namespace std;
struct Struct
{
int Left;
int Right;
int Dist;
};
int Total,Have;
Struct Array[2*MAX];
int Fa[MAX];
int Dis[MAX];
inline int Find(int X)
{
if(X!=Fa[X])
{
register int Fax;
Fax=Fa[X];
Fa[X]=Find(Fa[X]);
Dis[X]+=Dis[Fax];
}
return Fa[X];
}
int... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | 0 | 95,209,334 |
#include "bits/stdc++.h"
using namespace std;
int main()
{
long t,x;
cin>>t;
float sum=0.0;
for(int i=1;i<=t;i++)
{
cin>>x;
sum+=1.0/x;
}
cout<<fixed<<setprecision(10)<<1.0/sum<<endl;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vecto... | 0 | 28,796,614 |
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define typeof(x) __typeof__(x)
#define int long long int
#define mo... | #include <bits/stdc++.h>
#define F(i,j,k) for(int i=(j);i<=(k);++i)
#define _F(i,j,k) for(int i=(j);i<(k);++i)
#define D(i,j,k) for(int i=(j);i>=(k);--i)
#define _D(i,j,k) for(int i=(j);i>(k);--i)
#define rep(it,s) for(__typeof(s.begin()) it=s.begin();it!=s.end();++it)
#define Rep(a,s) for(auto a:s)
#define PB push_bac... | 0 | 73,285,937 |
#include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rev2(i, s, n) for (int i = (int)(n) - 1; i >= (int)(s); i--)
#define bitrep(... | 0 | 61,493,826 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,0,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
int A,c;
char ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int ans=0;
if(abs(a)>abs(b)){
ans+=abs(a)-abs(b);
if(a>0)
ans++;
if(b>0)
ans++;
}else if(abs(a)<abs(b)){
ans+=abs(b)-abs(a);
if(a<0)
ans++;
if(b<0)
ans++;
}else{
ans=1;
}
... | 0 | 8,539,082 |
#include <iostream>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <algorithm>
#define rep(i, n) for(i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1 << 30
using namespace std;
t... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int t=1;
while(t--)
{
ll n;
cin>>n;
ll a[n+5];
map<ll,ll>cnt;
for(ll i=1; i<=n; i++)
{
cin>>a[i];
cnt[a[i]]++;
}
ll ans=0;
vector<ll>... | 0 | 9,963,993 |
#include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <t... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | 0 | 25,716,360 |
End of preview. Expand in Data Studio
- Downloads last month
- 40