code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | #include<iostream>
#include<algorithm>
using namespace std;
static const int N = 100;
struct Matrix{int row, col;};
Matrix M[N];
int cost[N][N] = {0};
int prod(int begin, int end){
int mincost = 100000000, l = end - begin;
if(cost[begin][end] > 0){
return cost[begin][end];
} else {
if(l == 0){
minco... | 0 | 27,057,528 |
#include <stdio.h>
int main()
{
int K, X;
scanf("%d %d", &K, &X);
(K * 500 >= X)?
puts("Yes") : puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n,k;
cin >> n >> k;
vector<pair<ll,ll>>cnt(n);
for(ll i=0;i<n;i++){
ll a,b;
cin >> a >> b;
cnt[i]=make_pair(a,b);
}
sort(cnt.begin(),cnt.end());
ll count=0;
l... | 0 | 2,742,635 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
int sum = 0;
for(int i = 1; i <= n; i++)... | 0 | 80,181,678 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,K,S;
cin>>N>>K>>S;
vector<int>A(N);
for(int i=0;i<K;i++)
A.at(i)=S;
for(int i=K;i<N;i++){
if(S==1000000000){
A.at(i)=3;
}else{A.at(i)=1+S;}
}for(int i=0;i<N;i++)
cout<<A.at(i)<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 0 | 80,102,183 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <cstdio>
#define INF 1LL<<60
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
... | # include <iostream>
using namespace std;
int main(){
int N, M;
int a, b, c, count;
int d[100][100], dc[100][100];
cin >> N >> M;
for(int n1 = 0; n1 < N; n1++) {
for(int n2 = 0; n2 < N; n2++) {
d[n1][n2] = 1001;
dc[n1][n2] = 0;
}
}
for(int m = 0; m < M; m++) {
cin >> a >> b >> c;
... | 0 | 64,295,002 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
us... | #include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define pb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define v... | 0 | 97,468,405 |
#include"bits/stdc++.h"
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << ((abs(a - b) > d || abs(b - c) > d ) && abs(c - a) > d ? "No" : "Yes") << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
const int INF = 1 << 25;
const LL MOD = 1000000007LL;
using namespace std;
int dp[1 << 26];
int main() {
string s;
cin >> s;
int bit = 0, opt;
fill(dp, dp + (1 << 26), INF);
dp[0] = 0;
rep(i, ... | 0 | 68,042,717 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin>>N;
vector<char> vec(N);
for(int i=0;i<N;i++){
cin>>vec[i];
}
int ans=1;
for(int i=0;i<N-1;i++){
if(vec[i+1]!=vec[i]){
ans++;
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
map<int,int> ac,wa;
int a=0,w=0;
rep(i,m){
int p;string s;cin>>p>>s;
if(s=="WA")wa[p]++;
else {
if(ac[p]==0){
... | 0 | 68,887,392 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
void solve(){
int k, n;
cin >> k >> n;
vector<int> dis(n);
for(int i = 0; i < n; ++i) cin >> dis[i];
int bigger = 0;
int sum = 0;
for(int i = 0; i < n; ++i) {
int value;
if(i <... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
int N,K,R,S,P;
string T;
cin >> N >> K;
cin >> R >> S >> P;
cin >> T;
ll ans = 0;
ll count[T.length()];
for(int i=0;i<K;i++){
count[i]=0;
if(T[i]... | 0 | 58,818,183 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
ll const mod = 1e9+7;
int main() {
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define F first
#define S second
#d... | 0 | 22,474,779 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int (i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define RFOR(i,e,s) for(int (i)=(e)-1;(i)>=(int)(s);(i)--)
#define RREP(i,e) RFOR(i,e,0)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
t... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P... | 0 | 80,273,437 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;
int main() {
long n, m;
long x, y, c;
vector<long> xs... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 94,354,931 |
#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;
cin >> n;
vector<vector<int>> v(n + 1, vector<int>(0));
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string s;
int count = 0;
cin >> s;
if(s[0] == 'R' ||
s[1] == 'R' ||
s[2] == 'R'
)
count = 1;
if(s[0] == 'R' &&
s[1] == 'R'
||
s[1] == 'R' &&
... | 0 | 41,083,756 |
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < n; i++)
using namespace std;
long gcd(long a, long b) {
while... | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
bool b[33000];
int main() {
int n;
while (cin >> n&&n) {
int a=10000000, b=-100,x;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> x;
sum += x;
a = min(a, x);
b = max(b, x);
}
sum -= a;
sum -= b;
double c = ... | 0 | 57,074,324 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 200000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
typedef int64_t ll... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int tmp,cnt = 0;
map<int,int> num_cnt;
vector<int> num;
cin >> N;
for(int i = 0; i < N; i++){
cin >> tmp;
if(num_cnt.count(tmp))
num_cnt.at(tmp)++;
else{
num.push_back(tmp);
num_cnt[tmp] = 1;
}
}
for(int... | 0 | 73,304,960 |
#include <bits/stdc++.h>
using namespace std;
signed main () {
int n, k;
cin >> n >> k;
int64_t ans = 0;
map < int, int64_t > mods;
for (int i = 1; i <= n; ++i)
++mods[i % k];
for (int i = 1; i <= n; ++i) {
if ((i % k) == ((k - (i % k)) % k))
ans += mods[i % k] * mod... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define abdelrahman010 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
using namespace std;
const int N = 1e3 + 5;
int x , y , z , k;
ll a[N] , b[N] , c[N];
int main() {
abdelrahman010
cin >> x >> y >> z >> k;
for(int i = 0;i < ... | 0 | 62,420,542 |
#include<algorithm>
#include<cstring>
#include<cctype>
#include<cstdio>
#define rep(i,x,y) for(int i=x; i<=y; ++i)
using namespace std;
const int N=100005;
int n,L,T,x,w,a[N],id;
int getint()
{
char ch;
while(!isdigit(ch=getchar()));
int x=ch-48;
while(isdigit(ch=getchar())) x=x*10+ch-48;
return x;
}
int main()
{
... | #include <iostream>
using namespace std;
int m[50][50],a,b,c,d,e,cou;
void dfs(int i,int j){
if(i==b&&j==a)cou++;
if(m[i+1][j]==0&&i+1<=b)dfs(i+1,j);
if(m[i][j+1]==0&&j+1<=a)dfs(i,j+1);
}
int main(){
while(1){
cin >>a>>b;
if(a==0&&b==0)break;
for(int i=1;i<=b;i++){
for(int j=1;j<=a;j++){
m[i]... | 0 | 11,318,824 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void){
int N, Z, W;
cin >> N >> Z >> W;
int A[N]; rep(i, N) cin >> A[i];
if(N == 1) cout << abs(A[0]-W) << endl;
else{
cout << max( ab... | #include <iostream>
#include <string>
using namespace std;
int main(void){
string S;
cin >> S;
char a,b;
int count[2] = {0};
for(int i=0;i<S.size();i++){
if(i == 0){
a = S[i];
count[0]++;
continue;
}
if(S[i] == a){
count[0]++;
... | 0 | 44,476,873 |
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n,k;
std::cin >> n>>k;
vector<ll> a(n);
vector<ll> sumb;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
sumb.push_back(a[i]);
for (int j = i+1; j < n; ... | #include "bits/stdc++.h"
using namespace std;
int main()
{
int n,ans;
ans=0;
cin>>n;
vector<int> v;
v.push_back(n);
for(int i=1;;i++)
{
if(n%2==0)
n/=2;
else
n=n*3+1;
v.push_back(n);
for(int k=0;k<i;k++)
{
if(v.at(i)==v.at(k))
{
ans=i+1;
break;
... | 0 | 4,445,216 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
ll k,a,b;cin>>k>>a>>b;
ll ans=1;
if(k<a)ans+=k;
else if(b-a>2)
{
ans+=a-1;
k-=a-1;
ans+=(b-a)*(k/2)+(k%2);
}
else
{
ans+=k;
}... | 0 | 82,715,443 |
#include<cstdio>
#include<bits/stdc++.h>
typedef long long int ll;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for(int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b))
#define BIT(b, i) (((b) >> (i)) & 1)
#define LOG_F 1
#define LOG(...) if(LOG_F) fprintf(stderr, __V... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
ll gcd(ll a, ll b... | 0 | 15,488,428 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
char a,b;
cin>>a>>b;
if(a=='H'&&b=='H')cout<<"H"<<endl;
else if(a=='D'&&b=='H')cout<<"D"<<endl;
else if(a=='H'&&b=='D')cout<<"D"<<endl;
else if(a=='D'&&b=='D')cout<<"H"<<endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 27,859,785 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
void go(int x) {
cout << x << endl;
exit(0);
}
void solve() {
int x, y;
cin >> x >> y;
if(x == 0 || y == 0) {
if(x == 0) {
if(y >= 0) go(y - x);
else go(abs(y) + 1);
} else if(y == 0) {
if(x < 0) go... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"... | 0 | 13,026,825 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, a, b;
cin >> h >> w >> a >> b;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if ((i - b + 0.1) * (j - a... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <numeric>
#include <ctime>
#include <bitset>
#include <cctype>
#include <vector>
#include <map>
#include <... | 0 | 40,209,731 |
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define ll long long int
#define pb push_back
int m... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | 0 | 61,499,811 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010]={0,1,2,3,4,5,6,7,8,9};
int main()
{
int k,id=1;scanf("%d",&k);
for(int i=10; i<=k; )
{
ll x=a[id]*10,y=a[id++]%10;
if(y==0)
{
a[i++]=x;
a[i++]=x+1;
}
else if(y==9)
{
a[i++]=x+8;
a[i++]=x+9;
}
else
{
a[i+... | 0 | 18,621,998 |
#include <iostream>
using namespace std;
int isintersecter(double x1,double y1,double x2,double y2,double px,double py,
double qx,double qy){
if(((py-y1)*(x1-x2)-(y1-y2)*(px-x1))*((qy-y1)*(x1-x2)-(y1-y2)*(qx-x1)) < 0)return 1;
else return 0;
}
int main(){
double x1,y1,x2,y2,x3,y3,xp,xy;
while(cin>>x1>>y1>>x... | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
const int MAX_N=1e5;
const ll INF=1e18;
int N;
ll D[MAX_N];
map<ll,int> dmp;
int par[MAX_N],chl[MAX_N];
vector<int> G[MAX_N];
ll dist[MAX_N];
int main(){
cin>>N;
REP(i,N)cin>>D[i... | 0 | 1,645,957 |
#include<bits/stdc++.h>
using namespace std;
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl '\n'
#define ll long long
int main()
{
faster();
int t,n,x;
cin>>n>>x>>t;
int ans;
if(n%x==0) ans = n/x;
else ans = n/x + 1;
cout<<ans*t<<endl;
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
#define ll long long
const int MAX=1e6;
const int MOD=1e9+7;
vector<ll> fact(MAX),inv(MAX),finv(MAX);
int X,Y;
void COMinit(){
fact[0]=fact[1]=1;
inv[1]=1;
finv[0]=finv[1]=1;
for(int i=2;i<MAX;i++){
fact[i]=fact[i-1]*i%MOD;
inv[i]=... | 0 | 58,007,117 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#in... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
vector<ll> v(4);
for(int i = 0; i < 4; i++) cin >> v[i];
ll ans = -2e18;
for(int i = 0; i < 2; i++){
for(int j = 2; j < 4;... | 0 | 10,726,268 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<in... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-... | 0 | 4,278,183 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pii pair<int,int>
#define pll pair<lli, lli>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vll vector<lli>
#define pb push_back
#define mpr make_pair
#define ss second
#define ff first
#define INF 1000000001
#define i... | #include <iostream>
using namespace std;
int main() {
int p[201], ans, t;
int m, n_min, n_max;
while (cin >> m >> n_min >> n_max) {
if (m == 0 && n_min == 0 && n_max == 0) { break; }
for (int i = 0; i < m; i++) {
cin >> p[i];
}
ans = 0; t = 0;
for (int i ... | 0 | 12,973,831 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | #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 | 12,265,466 |
#define DEBUG
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define IOS { ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#ifdef... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(20);}} fast;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define C... | 0 | 13,732,073 |
#include<iostream>
using namespace std;
struct Node{int parent,left,right;};
struct Node T[100001];
#define NIL -1
int D[100001],n,dim,child,v,l,s;
void getDepth(int u,int p){
D[u]=p;
if(T[u].right!=NIL) getDepth(T[u].right,p);
if(T[u].left!=NIL) getDepth(T[u].left,p+1);
}
void printchild(struct Node T[],in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<ll> dp(n,0);
dp[0] = 1000;
for(i = 1;i < n;++i){
dp[i] = ... | 0 | 39,200,782 |
#include <stdio.h>
#include <map>
#include <string>
#include <string.h>
using namespace std;
map<string,int> words;
int alltoupper(char *s){
int i,l=strlen(s);
for(i=0;i<l;i++){
s[i] = tolower(s[i]);
}
}
int main(){
char s[32];
int max=0;
string my;
int maxlength=0;
string self;
while(scanf(" %s",... | #include <iostream>
#include <string>
#include <map>
#include <queue>
#include <math.h>
#include <bitset>
#include <cmath>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(int i = s;i<n;i++)
#define repe(i,s,n)for(ll... | 0 | 16,790,730 |
#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>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
if(n==111)cout<<999<<endl;
if(n=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a,b;
cin >> a >> b;
if(a==b){
cout << a << endl;
return 0;
}
ll res;
if(a%2==0){
ll n=b-a+1;
if(n%4==0) res=0;
else if(n%4==2) res=1;
else if(n%4==1) res=b;
... | 0 | 37,399,117 |
#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){
int N,i;
cin>>N>>i;
int ans=N-i+1;
cout<<ans<<endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S ... | 0 | 38,925,253 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x,sum;
cin>>x>>a>>b;
sum=x+a;
if(b>sum)
cout<<"dangerous"<<endl;
else
{
if(sum>=b&&x>b)
cout<<"delicious"<<endl;
else
cout<<"safe"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<int,int>;
ll mod = 1000000007,mod2 = 998244353;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
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& ... | 0 | 54,345,174 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N;
vector<int> g[100010];
bool used[100010];
int dfs(int now){
used[now]=true;
int res=0;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> lines(h);
string s;
int cnt = 0;
for (int hi = 0; hi < h; hi++) {
cin >> s;
if (s.find("#") != string::npos) {
lines.at(cnt) = s;
cnt++;
}
}
... | 0 | 71,137,028 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s;cin >>s;
ll ans=0;
ll cnt=0;
for (int i = 0; i < s.size(); ++i) {
... | #include <iostream>
#include <string>
using namespace std;
int main(){
while(1){
int n;
int sum = 0;
int flag = 0;
int p = 0;
string ud[100];
cin >> n;
if (n == 0)
return 0;
for(int i = 0; i < n; i++){
cin >> ud[i];
if(ud[i] == "ru" || ud[i] == "lu"){
p++;
... | 0 | 70,131,437 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#include <vector>
#include <numeric>
#include <map>
#include <cmath>
#include <iomanip>
#include <queue>
using ll =long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vs = vector<string>;
int main() {
... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | 0 | 8,516,033 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x2000;
cin >> r >> d >> x2000;
int tmp = x2000;
for (int i = 1; i <= 10; i++) {
int next = tmp * r - d;
cout << next << endl;
tmp = next;
}
return 0;
} | #include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[100010],L[100010]; int n;
int lis(){
L[0]=a[0];
int l=1;
for(int i=1;i<n;i++){
if(a[i]>L[l-1]) L[l++]=a[i];
else{
*lower_bound(L,L+l,a[i])=a[i];
}
}
return l;
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("... | 0 | 26,720,368 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
s[5]=' ';
s[13]=' ';
cout << s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int64_t X,Y;
int cnt = 0;
int64_t target;
cin >> X >> Y;
target = Y/X;
for(int64_t i=0;i<61;i++) {
if(((int64_t)1<<i) <= target) {
cnt++;
} else {
break;
}
}
cout << cnt << endl... | 0 | 37,727,344 |
#include<cstdio>
long long a[100005];
long long upper[100005], lower[100005];
long long power[100005];
long long count[100005];
long long min(long long a,long long b){ return a>b?b:a; }
int main(){
int n;
scanf("%d",&n);
for(int i = 0; i <= n; i++) scanf("%lld",&a[i]);
upper[n] = 0;
for(int i = n-1... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll d(ll x){
ll ans = 0;
while(x){
++ans;
x/=10;
}
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
ll dp[n+1];
dp[0]=0;
for(int i=1; i<=n; i++){
... | 0 | 76,536,420 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using pll = pair<ll, ll>;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace __gnu_pbds;... | 0 | 14,844,792 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main(){
int n, c, k;
cin >> n >> c >> k;
... | #include<iostream>
#include<cstdio>
#include<map>
using namespace std ;
int main(){
int n;
char a,b;
for(;;){
map<char,char> a2b;
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin >> a >> b;
a2b[a]=b;
}
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a2b.count(a)==0){
cout<... | 0 | 77,010,249 |
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
vector<long long int> a(5);
long long int high=10000000;
long long int pre=0;
for(l... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Graph
{
public:
Graph(int n);
void Show() const;
private:
vector<vector<int>> m_graph;
};
Graph::Graph(int n) :
m_graph(n, vector<int>(n, 0))
{
for (int i = 0; i < n; ++i)
{
int u, k;
cin >> u >> k;
v... | 0 | 53,669,537 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int d,i,ans,d_di;
while(cin>>d){
ans = 0;
for(i = d;i < 600;i += d){
ans += i*i*d;
}
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
int n, k, s;
cin >> n >> k >> s;
vector<int> ans(n);
int prime;
if(s != 144701) prime = 144701;
else prime = 144497;
if(k == 0) {
rep(i, n) c... | 0 | 63,275,107 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
int main() {
int n, k;
std::cin >> n >> k;
int ans = 1;
for (int i = 0; i < n; i++)
{
ans = std::min(ans * 2, ans + k);
}
std::cout << ans << "\n";
} | #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 | 47,115,557 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9+7;
#define REP(i,n) for (int i = 0; i < (n); i++)
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
int main(){
ios::sync_with... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
struct Node{
int parent;
int depth;
vector<int> children;
};
void solve(vector<struct Node> &node, int x){
for(int i=0;i<node[x].children.size();i++){
node[node[x].children[i]].depth += node[x].depth + 1;
solve(node, node[x].children[... | 0 | 19,383,918 |
#include <iostream>
using namespace std;
inline void swap(int a[], int i, int j){
int t = a[i]; a[i] = a[j]; a[j] = t;
}
void selection(int a[], int N)
{
int i, j, min;
for(i = 1; i < N; i++){
min = i;
for(j = i + 1; j <= N;j++)
if(a[min] > a[j]) min = j;
swap(a, min, i);
}
}
int main(){
int a[6];
for(in... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>
using namespace std;
int n;
vector<int> g[110000];
int v[110000];
int du[110000],root;
int sz[110000],f[110000];
void ... | 0 | 81,319,366 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define endl "\n"
#define nl cout<<endl
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define txti freopen("input.txt", "r", stdin);
#de... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int n;
string s;
cin >> n >> s;
int ans = 0;
for(int i = 0; i < 10... | 0 | 92,246,314 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> si( string s ){
vector<char> A(s.size()) ;
for( int i=0 ; i<s.size() ; i++ ){
A.at(i) = s.at(i) ;
}
vector<ll> a(s.size()) ;
for( int i=0 ; i<s.size() ; i++ ){
a.at(i) = A.at(i) - '0' ;
}
return a ... | #include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 10000000... | 0 | 78,796,787 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<pair<int, int>> ans;
if (N % 2 =... | #pragma GCC optimize ("O3")
#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = doubl... | 0 | 51,449,742 |
#include <iostream>
int main(){
int i,x;
i=1;
while(true){
std::cin>>x;
if(x == 0) break;
std::cout << "Case "<< i << ": " << x << std::endl;
i++;
}
return 0;
} | #include <iostream>
bool is_right_triangle(const int a, const int b, const int c)
{
bool ret;
int aa;
int bb;
int cc;
aa = a * a;
bb = b * b;
cc = c * c;
if (aa + bb == cc || bb + cc == aa || cc + aa == bb){
ret = true;
}
else {
ret = false;
}
return ret;
... | 0 | 77,545,840 |
#include <iostream>
int main(int argc, char* argv[] ){
int a,b;
std::cin >> a >> b;
const char* exp = (a == b) ? "==":
(a<b)? "<" : ">" ;
std::cout<<"a "<<exp<<" b"<<std::endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 | 33,277,326 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 2e5 + 7... | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n;
cin >> n;
vector<ll> arr(n+1, 0);
for(auto& val... | 0 | 8,487,162 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(a) (a).begin(),(a).end()
typedef pair<int,int> P;
typedef long long ll;
int main() {
int a,b;... | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define rep(n) for( int i = 0 ; i < n ; i++ )
#define REP(n) for( int i = 1 ; i <= n ; i++ )
#define repll(n) fo... | 0 | 85,933,218 |
#include <cstring>
#include <iostream>
using namespace std;
int n, m, sum;
int main()
{
cin >> n >> m >> sum;
for (int i = 1; i <= m; i++)
{
cout << sum << " ";
}
int temp = n - m;
for (int i = 1; i <= temp; i++)
{
if (sum == 1e9)
{
cout << sum - 1 << " ";... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main(){
ll n, k;
cin >> n >> k;
vector<p> array;
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
array.push_back(p(a, b));
}
sort(array.begin(), array.end());
ll ans ... | 0 | 55,135,469 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((&a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " <... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
int cumsum[60 * 60 * 24];
int to_sec(st... | 0 | 36,569,292 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
int i,j,k;
main()
{
int n,k,x,y;
cin>>n>>k>>x>>y;
if(k>=n) cout<<x*n<<endl;
else
{
cout<<(k*x)+(n-k)*y<<endl;
}
} | #include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
class Dice{
public:
int face[7];
int nowFace;
int center;
int top;
int bottom;
int left;
int right;
Dice(int num[]){
for(int i = 1; i <= 6; i++){
face[i] = num[i];
}
... | 0 | 39,777,800 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = '\n'... | #include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define Re register
#define LL long long
#define U unsigned
#define FOR(i,a,b) for(Re in... | 0 | 445,648 |
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#incl... | #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,q;
cin >> n >> q;
vector<vector<int>> to(n);
rep(i,n-1){
int x,y;
cin >> x >> y;
x--;y--;
to[x].push_back(y);
to[y].push_back(x);
}
queue<... | 0 | 14,804,644 |
#include <iostream>
#include <string>
using namespace std;
int main(void)
{
int m,h,i;
string str;
cin >> str;
while(str != "-") {
cin >> m;
for(i=0;i<m;i++) {
cin >> h;
string left = str.substr(0,h);
str.erase(0,h);
str+=left;
}
... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int s=S.size();
if (s==1||s==2) {
cout << S.at(0) << endl;
}
else {
if (s%2==0) {
for (int i=0; i<s/2-1; i++) {
cout << S.at(2*i);
}
cou... | 0 | 70,469,231 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 83,438,167 |
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int n, m, d, p, res, cnt[11];
while (cin >> n >> m, n | m) {
res = 0;
for (int i = 0; i < 11; ++i)
cnt[i] = 0;
for (int i = 0; i < n; ++i) {
cin >> d >> p;
cnt[p] += d;
... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
for (int i = N; i <= 999; i++) {
int num = i;
int a = num / 100;
num = num % 100;
int b = num / 10;
num = num % 10;
if (a == b && b == nu... | 0 | 1,904,288 |
#include<bits/stdc++.h>
#include<set>
#define lli long long int
#define pb push_back
#define cio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define rep(i,a,n) for(i=a;i<n;i++)
#define all(v) (v.begin(),v.end())
#define ppb pop_back
#define vsz v.size()
#define pi 3.141592653589793238
using namespac... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<long long> V(n);
for(int i = 0; i < n; i++){
cin >> V[i];
}
long long ans = 0;
for(int l = 0; l <= min(k, n); l++){
for(int r = 0; l + r <= min(k, n); r++){
vector<long long> v;
... | 0 | 56,943,896 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int main(void){
int dictionaly_size;
while(true){
cin >> dictionaly_size;
if(dictionaly_size == 0){
break;
}
map<char, char> change;
for(int i = 0;... | #include <iostream>
#include <vector>
using namespace std;
int N,x,y,visited[100010] = {0};
vector<vector<int>> v(100010);
int dfs(int n){
visited[n] = 1;
int g = 0;
if(n!=1 && v[n].size()==1) return 0;
for(int i=0;i<v[n].size();i++){
int s = v[n][i];
if(visited[s]==0){
if((n==1 && v[n].size()==1) || n!=1 &&... | 0 | 6,620,657 |
#include <iostream>
#include <vector>
#include <algorithm>
#define INF 1010101010
using namespace std;
int main()
{
int n, m, o;
cin >> n >> m >> o;
vector<int> r(o);
for (int i = 0; i < o; i++) {
cin >> r[i];
r[i]--;
}
sort(r.begin(), r.end());
vector<vector<int>> a(n, vector<int>(n, INF));
for (int i = 0;... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
int a,b,c;
cin >> a >> b >> c;
int k;
cin >> k;
if( a < b && b < c ){
cout << "Yes" << endl;
return 0;
}
while(k--){
if( a >= b ){
b = b*2;
}
els... | 0 | 47,771,519 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define INF 1000000000000
#define MOD 10000007
typedef long long ll;
int main(){
int n;cin>>n;
vector<int> v;
rep... | 0 | 35,953,205 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;... | 0 | 34,056,668 |
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn(1e5 + 5);
int n, a[maxn];
ll sum, cur, x, v[maxn];
int main() {
int i;
scanf("%d", &n);
if (n == 1) return puts("YES"), 0;
for (i = 1; i <= n; ++i) scanf("%d", &a[i]), sum += a[i];
cur = (ll)n * (n + 1) / 2;
if (sum % cur) return ... | using namespace std;
#include <bits/stdc++.h>
#define int long long
const int INF=1e18;
const int MOD=1e9+7;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n)... | 0 | 3,816,471 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 2000000000;
int main(){
string s;
cin >> s;
bool... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
using Graph ... | 0 | 26,210,143 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long long ll;
int D;
int main(){
cin>>D;
string an... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | 0 | 34,032,497 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll MX = ll(1e9)+7;
int main(){
int n;
cin >> n;
map<int,int> m;
rep(i,n) {
int a;
cin >> a;
m[a]++;
}
for(auto p : m) {
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 75,076,221 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N,M;
cin >> N >> M;
vector<int> X(N + 1);
vector<int> Y(M + 1);
cin >> X[0] >> Y[0];
rep(i,N) {
cin >> X[i + 1];
}
rep... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#define ll long long
using namespace std;
int main(){
ll n;
cin>>n;
vector<int> va(n);
for(ll i=0;i<n;i++){
ll a;
cin>>a;
va[i]=a;
}
sort(va.begin(),va.end(),greate... | 0 | 66,531,481 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PrePro ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define fr(i,n) for(ll i = 0; i < n; i++)
#define fre(i,a,b) for(ll i = a; i <= b; i++)
#define fb(i,n) for(ll i = n; i >= 0; i--)
#define fbe(i,a,b) for(ll i = a; i >= b; ... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <math.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
int n;
cin>>n;
ll x[n+1]={};
ll y[n+1]={};
ll z[n+1]={};
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
z[i]=abs(x[i])+abs(y[i]);
}
... | 0 | 56,301,032 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int w,h,x,y,r;
cin>>w>>h>>x>>y>>r;
if(x<r||x>w-r||y<r||y>h-r)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 88,543,267 |
#include <bits/stdc++.h>
#define fi first
#define se second
#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 srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 | 93,494,638 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define si(a) scanf("%d",&a)
#define si2(a,b) scanf("%d%d",&a,&b)
#define sl(a) scanf("%lld",&a)
#define sl2(a,b) scanf("%lld%lld",&a,&b)
#define pb push_back
#define mk make_pair
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >>S;
int count=0;
if(S.at(0)=='A'){
if(islower(S.at(1))){
for(int i=2;i<S.size()-1;i++){
if(S.at(i)=='C'){
count ++;
}
else if(isupper(S.at(i))){
cout <<"WA"<<end... | 0 | 24,097,197 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char ch;
int cnt[26] = {};
while(cin >> ch){
if('a' <= ch && ch <= 'z'){
cnt[ch - 'a']++;
}
else if('A' <= ch && ch <= 'Z'){
cnt[ch - 'A']++;
}
}
for(int i = 0; i < 26; i++){
printf("%c : %d\n", 'a' + i, cnt[i]);
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
string S; cin >> S;
ll len = S.length();
for (int i = 0; i < S.length(); i+=2) {
len -= 2;
string s1 = S.substr(0, len/2);
string s2 = S.substr... | 0 | 69,124,876 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod =1e9+7;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> T maxt(T x,T y) {if (x>y) return x;else return y;}
template<class T> T mint(T x,T y) {if (x>y) return y;el... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
long long multi = 1;
vector<long long> a;
for(int i = 0; i < n; i++){
long long x; cin >> x;
a.push_back(x);
if(x == 0){
cout << 0;
return 0;
}
}
for(int i = 0; i < n; i++){
if(a.at(i) <=100000000000000... | 0 | 54,276,838 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll i=0; i<n; i++)
#define frep(i,m,n) for(ll i=m; i<=n; i++)
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll my_abs(ll a);
ll a_n(ll a, ll n);
ll my_gcd(ll a, ll b);
ll inv(ll a);
ll madd(ll... | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(void){
int n;
ll d, a;
cin>>n>>d>>a;
vector<pair<ll, ll> > v(n);
rep(i, n){
ll x, h;
cin>>x>>h;
v[i] = make_pair(x, h);
}
sort(v.begin(), v.end());
... | 0 | 70,679,545 |
#include<bits/stdc++.h>
#define ll long long int
#define st string
#define con continue
#define br break
#define rt return 0
#define fr first
#define sec second
using namespace std;
int main(){
ll n,m,i,x,j,mx=0,t,k,b=0,a=0,ans=0,c=0;
ll mn;
st s,str; char strn;
cin>>n;
mn=n-1;
ll ara[n+1],bra[n+1],taj[n+1];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
void Suhaib_Sawalha (){
int n , m;
cin >... | 0 | 67,172,646 |
#include<bits/stdc++.h>
using namespace std;
int x,y;
int main(){
cin>>x>>y;
if(x<y&&x>1){
cout<<"Bob"<<endl;
}
else if(x>y&&y>1){
cout<<"Alice"<<endl;
}
else if(x<y&&x==1){
cout<<"Alice"<<endl;
}
else if(x>y&&y==1){
cout<<"Bob"<<endl;
}
else if(x=... | #include <bits/stdc++.h>
#define fi first
#define se second
#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 srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 50,654,285 |
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int a[200005];
int book[200005];
int main()
{
int n,m;
int l,r,t;
scanf("%d %d",&n,&m);
t=m;
memset(book,0,sizeof(book));
while(t--)
{
scanf("%d %d",&l,&r);
for(int i=l;i<=r;i++)
{
b... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <limits>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <inttypes.h>
using namespace std;
int main()
{
int32_t N;
scanf("%d", &N);
int32_t t[101];
int32_t T = 0;
for (int32_t i = 0... | 0 | 20,989,582 |
#include<iostream>
#include<cstdio>
#include<stack>
using namespace std;
stack<int> sta;
int main(void)
{
int a;
while(scanf("%d", &a)!=EOF){
if(a)
sta.push(a);
else{
cout<<sta.top()<<endl;
sta.pop();
}
}
return 0;
} | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) f... | 0 | 34,239,147 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll x[1005], y[1005];
int main() {
scanf("%d", &n);
bool flag;
for (int i = 1; i <= n; ++i) {
scanf("%lld%lld", x + i, y + i);
x[i] += y[i];
if (i == 1) flag = !(x[i] % 2);
else if (x[i] % 2 == flag) return puts("-1"), 0;
y[i] = x[i]... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 52,756,579 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = (s); i <= (int)(n); i++)
int a[200010];
int b[200010];
int main() {
long long n;
long long x,m;
long long ans;
long long p,p_max,p_round;
long long ansm;
long long mm,mn;
cin >> ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#include<stack>
usi... | 0 | 76,705,228 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | #include<bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=998244353;
const ll INF=1000000010;
const ll LINF=1000000000000000010;
int dx[8]={0,0,1,1,1,-1,-1,-1};
int dy[8]={1,-1,1,-1,0,1,-1,0};
int main(){
ll s=1;
int keta=0;
... | 0 | 34,479,198 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
int main(){
int n,k,r,s,p;
string t;
cin >> n >> k;
cin >> r >> s >> p;
cin >>t;
long long int sum = 0;
vector<bool> win(n,true);
bool pre = f... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 0 | 17,378,999 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include "bits/stdc++.h"
using namespace std;
const long long MOD = 1000000007;
long long factorial(long long n) {
long long ret = 1;
for (long long i = 2; i <= n; ++i) {
ret *= i;
ret %= MOD;
}
return ret;
}
long long modPow(long long n, long long p) {
if (p == 0) {
return 1... | 0 | 67,802,038 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin>>s; bool finish=false;
for(int i='a'; i<'z'; i++){
for(int j=0; j<s.size(); j++){
if(s[j]==i) break;
if(j==s.size()-1){
finish=true;
s.push_back(i);
}
}
if(finish) break;
}
string t=s;
if(fini... | #include <random>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cstring>
#include <stack>
using namespace std;
typedef long long ll;
int main() {
vector<int> X, Y;
int N, K;
cin >> N >> K;
vector<pair<int, int> > P;
for (int i = 0; i < N; i++) {
int x, y... | 0 | 11,554,464 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n,k;cin>>n>>k;
long long ans=0;
const int MOD=1000000007;
for(long long i=k;i<=n+1;i++){
long long low=(i+1)*i/2;
long long tmp=n-i+1;
long long high=(n+2)*(n+1)/2 -(tmp+1)*tmp/2;
ans+=high-... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll INF =ll(1e18)+5;
ll H,W;
vector<std::string> s;
bool onBoard(int y,int x){
if(y>=0 && y<H && x>=0 && x<W){
return true;
}
return false;
}
void solve(){
priority_queue<pair<ll,P>,vector<pair<ll,P>>... | 0 | 32,018,014 |
#include <iostream>
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
typedef long long int ll;
int main()
{
int n;
string s;
cin >>n >>s;
int ans=0;
for(char i='0';i <= '9';i++)
{
for(char k='0';k<='9';k++)
{
for(char j... | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
int y,m,d;
cin>>y>>m>>d;
int sum=0;
if(y%3==0){
sum=201-(m-1)*20-d;
}else{
for(int i=m+1;i<=10;i++){
sum+=19+i%2;
}
sum+=20-d+m%2;
}
for(int i=y+1;i<1000;i++){
if(i%3==0){
sum... | 0 | 20,501,745 |
#include <iostream>
using namespace std;
int DIVISOR(int num1, int num2, int num3) {
int TIMES = 0;
for (int i = num1; i <= num2; i++) {
if (num3 % i == 0) {
TIMES++;
}
}
return TIMES;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << DIVISOR(a, b, c) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const string JpyStr = "JPY";
const int BtcJpyRate = 380000;
int main()
{
int n;
cin >> n;
double sum = 0;
for (int i = 0; i < n; ++i)
{
double input;
cin >> input;
string unit;
cin >> unit;
sum += (unit == JpyStr ?... | 0 | 73,230,467 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=10000000000000000;
int main(){
int n,m;
cin >> n >> m;
... | 0 | 7,829,406 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using P = ... | #include<iostream>
using namespace std;
int main() {
string S;
string T;
do {
cin >> S;
cin >> T;
} while (S.length() - T.length() < 0 && S.length() >=1000 && T.length() >= 1000);
int min_num = 10001;
for (int i = 0; i < S.length() - T.length()+1; i++) {
int count_num = 0;
for (int j = 0; j < T.length(); ... | 0 | 71,182,029 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include<algorithm>
#include<cassert>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<iomanip>
#include<map>
#include<numeric>
#include<queue>
#include<vector>
#include<set>
#include<string>
#include<stack>
#include<sstream>
#include<co... | 0 | 96,206,563 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
double n; cin >> n;
double k; cin >> k;
double ans = 0;
for(ll i = 1; i <= n; ++i){
ll cnt = 0, tmp = i;
while(tmp < k){
tmp *= 2;
cnt++;
}
ans += (double(1) / double(n)) * double(pow((double(1)/ double(2)), double(cnt)));... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 0 | 36,367,955 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.