code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int f(int n) { return (n*(n-1))/2; }
int main() {
int N, M; cin >> N >> M;
cout << f(N) + f(M) << endl;
} | #include<bits/stdc++.h>
#define int long long
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define lbound lower_bound
#define ubound upper_bound
#define pqueue priority_queue
#define umap unordered_map
#define uset unordered_set
#define len(a) (int)a.size()
#define all(a) (a).begin(... | 0 | 30,847,295 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string target;
vector<string> targets;
for (int i = 0; i < n; ++i) {
cin >> target;
sort(target.begin(), target.end());
targets.push_back(target);
}
sort(targ... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
ll llmax(ll x, ll y){
if (x > y) return x;
retu... | 0 | 37,757,487 |
#include<bits/stdc++.h>
using namespace std;
int n,s;
int ans;
void solve(int sum,int idx,int n){
if(n==0 && sum==s){
ans++;
return;
}else if(n==0 || idx==10){
return;
}
solve(sum+idx,idx+1,n-1);
solve(sum,idx+1,n);
return;
}
int main(){
while(1){
ans=0;
cin>>n>>s;
if(n==0 && s==0)... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 80,697,606 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<ll>> dp(n + 1, vector<ll>(m + 1, 0));
dp[0]... | #include <iostream>
#include <vector>
using namespace std;
int n, m, x;
const int INF = 1e9 + 5;
int min_cost = INF;
int main() {
scanf("%d %d %d", &n, &m, &x);
vector<int> cost(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
scanf("%d", &cost[i]);
for (int j ... | 0 | 67,411,092 |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int sum = 0;
for (auto x : s)
sum = sum + (int)x - 48;
if (sum % 9 == 0) cout << "Yes"; else cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
int64_t dp[105][100005];
int main()
{
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
}
dp[0][0] = 1;
for (int i = 0; i < N; i++)
{
for (int j = 0; j <= K; j++)
{
(d... | 0 | 19,995,902 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S; cin >> S;
bool C_exist = false;
int C = 0;
if(S[0] == 'A'){
for(int i = 1; i < (int)S.size(); i++){
if(S[i] == 'C'){
C_exist = true;
C++;
}
if(C > 1 ||(S[i] != 'C' && S[i] < 'a')){
C_exist = false;... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 73,081,126 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A(0), B(0), C(0), D(0);
cin >> A >> B >> C >> D;
const int L = A + B;
const int R = C + D;
if(L > R)
{
cout << "Left" << endl;
}
else if (L == R)
{
cout << "Balanced" << endl;
}
else
{
cout << "Right" << endl;
}
} | #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 | 66,598,992 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
const int N=100005;
const int P=998244353;
int n;
long long x,y,z;
void init(){
cin>>x>>y;
if(x>y) swap(x,y);
z=x*y;
long long w=sqrt(z);
if(w*w==z){
if(x==w){
cout<<2*w-2<<en... | #include<vector>
#include<algorithm>
#include<functional>
#include<iostream>
#include<string>
using namespace std;
template<class T>
class IntervalHeap{
std::vector<T> data;
template<int b,class C>
void heapup(C cmp,int k=-1){
if(k==-1)k=(1+size())/2-1;
int p;
while(k){
p=(k-1)/2;
if(!cmp(data[2*k+b],dat... | 0 | 12,534,673 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(int argc, char **argv)
{
string s1, s2;
cin >> s1 >> s2;
int n1 = s1.size(), n2 = s2.size();
vector<vector<int>> dp(n1+1, vector<int>(n2+1));
for (int i = 0; i <= n1; i++)
dp[... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 90,197,001 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define PII pair<ll, ll>
#define llu long long unsigned
#define ld long double
const ll MAX = 1e18 + 100;
const int Max = 1e9 + 500;
const int sz=1e5+100;
int pos[sz];
int par[sz], ran[sz];
void init(int n)
{
for(int i=... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 60,779,886 |
#include <bits/stdc++.h>
using namespace std;
vector<int> next_int_vector(int n) {
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v.at(i);
}
return v;
}
int main() {
int n;
cin >> n;
long ans = 0;
for (int i = 1; i <= n; ++i) {
long y = n / i;
ans += y * (... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | 0 | 97,010,392 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
long long int max(long long int a,long long int b){
if(a>b)
return a;
else
return b;
}
typedef pair<int,int> pii;
typedef vector<int> vi;
bool check(int len,vector<char>& str){
bool flag = true;
if((len+1)%2!=0){
return false;
... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define MP make_pair
#define ERR cout << "==================================... | 0 | 98,050,841 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
vector<int> vec = {a,b,c};
sort(vec.begin(),vec.end());
cout << vec.at(0) + vec.at(1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100003,INF=1<<30;
int main(){
int N;cin>>N;
vector<ll> A(N),B(N);
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
}
ll ans=0;
vector<ll> S,T;
for(int i=0;i<N;i... | 0 | 62,369,109 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | 0 | 92,778,481 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll m;
cin >> m;
ll sum = 0;
ll size = 0;
for(int i = 0; i < m; i++){
ll d, c;
cin >> d >> c;
sum += d*c;
size += c;
}
cout << size-1+(sum-1)/9 << endl;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | 0 | 99,715,592 |
#include<bits/stdc++.h>
#include<set>
#define lli long long int
using namespace std;
int main()
{
lli t,a,i;
string s1,s2;
cin>>s1>>s2;
cout<<s2+s1;
return 0;
} | #include <iostream>
bool isRight(int a, int b, int c)
{
if (a > c) {
std::swap(a, c);
}
if (b > c){
std::swap(b, c);
}
return a * a + b * b == c * c;
}
int main()
{
int N;
int a, b, c;
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> a >> b >> c;
... | 0 | 32,751,038 |
#include <bits/stdc++.h>
using namespace std;
int value(string S){
int N = S.size();
int num = 1;
int ans = 0;
for (int i = 0; i < N; i++){
if (isdigit(S[i])){
num = S[i] - '0';
} else {
if (S[i] == 'm'){
ans += num * 1000;
}
if (S[i] == 'c'){
ans += num * 100;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A = 0, W = 0;
cin >> N >> M;
vector<int> a(N, 0), b(N, 0);
for(int i = 0;i < M;i++) {
int p;
string s;
cin >> p >> s;
if(a[p-1] == 0) {
if(s == "AC") {
a[p-1] = 1;
A++;
} else {
b[p-1]++;
... | 0 | 85,535,100 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[500][500];
const ll LINF = 1e18+5;
int main() {
int n,k;
cin >> n >> k;
int h[500] = {};
for (int i=1;i<=n;i++) cin >> h[i];
for (int i=0;i<=n;i++)
for (int j=0;j<=i;j++)
dp[i][j] = LINF;
dp[0][0] = 0;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define T ll t; cin>>t; while(t--)
#define mod 1000000007
#define inf 1000000000000000000
#define mem(name,val) memset(name,val,sizeof(name))
#define f(n) for(ll i=0;i<n;i++)
#define rep(i,a,n) for(ll i=a;i<n;i+... | 0 | 93,116,756 |
#include <stdio.h>
int main() {
int K, A, B;
scanf("%d %d %d", &K, &A, &B);
int flag = 0;
for(int i = A; i <= B; i++) {
if(i % K == 0) {
printf("OK");
flag = 1;
break;
}
}
if(!flag) {
printf("NG");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
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; }
c... | 0 | 49,903,546 |
#include <iostream>
#include <queue>
#include <string.h>
using namespace std;
typedef pair<int, int> P;
int sx,sy,H,W,N;
char map1[1002][1002];
int step[1002][1002];
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
void find1(int g){
for(int i = 0; i < W; i++)
for(int k = 0; k < H; k++)
if(map1[i][k] == 'S' ... | #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | 0 | 51,031,603 |
#include<iostream>
using namespace std;
int main() {
long N, Y;
cin >> N >> Y;
long x, y, z, p;
x = y = z = -1;
p = Y / 1000;
for (long i = 0; i <= N; i++)
{
for (long t = 0; t <= N - i; t++)
{
if (9 * i + 4 * t == p-N)
{
x = i;
y = t;
z = N - i - t;
}
}
}
cout << x << " " << y << " ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int sum = 0;
int num = 0;
int ans = 0;
for (int i = 1; i <= N; i++) {
sum = 0;
num = i;
while (num !=0) {
sum += num % 10;
num /=10;
}
if (s... | 0 | 54,604,784 |
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int d = a / b;
int r = a % b;
double f = static_cast<double>(a) / b;
cout << d << ' ' << r << ' ' << fixed << setprecision(5) << f << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 6,529,055 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#defi... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | 0 | 97,104,315 |
#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 <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int A, B, K;
cin >> A >> B >> K;
for (int i = 100; i > 0; i--)
{
if (A % i == 0 && B % i == 0)
{
K--;
if (K =... | 0 | 27,181,840 |
#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);... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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 true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 25,496,076 |
#include <iostream>
using namespace std;
int main()
{
int W, H, x, y, r;
do
{
cin >> W >> H >> x >> y >> r;
} while (x < -100 || y < -100 || x > 100 || y > 100 || W <= 0 || H <= 0 || r <= 0 || W > 100 || H > 100 || r > 100);
if (r <= x && r <= y && x <= W - r && y <= H - r)
cout << "Yes" << endl;
else if (x ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) pu... | 0 | 90,436,757 |
#include<stdio.h>
int main()
{
long long int n, a,save, remind, a500=0, b =0, sum =0 ;
scanf("%lld%lld", &n, &a);
save = n;
a500 = save / 500;
remind = n % 500;
if(remind >= 1)
b = remind / 1;
sum = b;
if(sum <= a)
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 90,623,449 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
template <uns... | #include<iostream>
using namespace std;
#include<string>
class list
{
int L[1000001];
int head, tail, MAX;
public:
list();
void initialize();
void ins(int);
void del(int);
void del_first();
void del_last();
void show();
};
list::list() : MAX(1000001){}
void list::initialize(){ head =... | 0 | 49,191,961 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int k, x;
cin >> k >> x;
if (k * 500 >= x) cout << "Yes\n";
else cout << "No\n";
return (0);
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int ans = 1;
while(1){
if(ans * 2 <= N){
ans *= 2;
}
else{
break;
}
}
cout << ans << endl;
return 0;
} | 0 | 96,157,719 |
#include <iostream>
#include <vector>
#include <cmath>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, s, n) for(int i = s; i < n; i++)
using namespace std;
int main(){
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
rep(i, n)rep(j, d) cin >> x[i][j];
int ans = 0;
rep(i, n-1)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N, P;
cin >> N >> P;
string S;
cin >> S;
if(P != 2 && P != 5){
reverse(S.begin(),S.end());
vector<int> ten(N+1,10%P);
for(int i=1; i<N+1; i++){
ten[i] = (ten[i-1]*10)%P;
}
int64_t dp[N+1];
for(int i=0; i<N+1; i++){
dp[i] = 0;... | 0 | 16,538,796 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | 0 | 48,410,098 |
#include<bits/stdc++.h>
using namespace std;
#define Ff(i,a,n) for(i=a;i<n;i++)
#define Fr(i,a,n) for(i=a;i>n;i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x,... | #include<bits/stdc++.h>
#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__)
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } re... | 0 | 61,737,121 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=unsigned long long;
using namespace std;
int main(){
int maxv=0;
int sum=0;
rep(i,5){
int t;
cin>>t;
int x=t%10;
if(x!=0){
t+=(10-x);
maxv=max(maxv,10-x);
}
sum+=t... | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.... | 0 | 88,316,101 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(n);i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> ... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 | 59,468,503 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int D, T, S;
cin >> D >> T >> S;
if (S*T >= D) puts("Yes");
else puts("No");
} | #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 | 50,177,619 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 100;
long long arr[N];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
long long s = 0;
for(int i = 1;i <= n;++i)cin >> arr[i];
long long ans = 0;
for(int i = 1;i <= n;i++){
ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0; i<(ll)n; i++)
#define REPR(i, n) for(ll i=(ll)n-1; i>=0; i--)
#define FOR(i, m, n) for(ll i=(ll)m; i<(ll)n; i++)
#define FORR(i, m, n) for(ll i=(ll)m-1; i>=(ll)n; i--)
#define ALL(x) (x).begin(), (x).end()
#define ASC(v) s... | 0 | 64,964,615 |
#include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | #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 | 14,402,956 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
while (1) {
int n, nmin, nmax, x;
vector<int> vc;
cin >> n >> nmin >> nmax;
if (n == 0 && nmin == 0 && nmax == 0) break;
for (int i = 0; i < n; i++) {
cin >> x;
vc.push_back(x);
}
sort(... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
using ll = long long;
const int inf = 99999999;
using namespace std;
int main(){
int n,m,x;
cin >> n >> m >> x;
vector<int> c(n);
vector<ve... | 0 | 68,571,222 |
#include<bits/stdc++.h>
const long long INF = INT_MAX / 2;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n)
#define RREP(i,n) RFOR(i,0,n)
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
in... | 0 | 8,081,583 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main(){
ll r... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | 0 | 62,338,802 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
double sum=0;
for (int i = 0; i < n; i++) {
double x;
string u;
cin>>x>>u;
if(u=="JPY"){
sum+=x;
}
else{
sum +=380000*x;
}
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 18,431,714 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7; ll LLINF = 1LL << 60; int INF = INT_MAX;
int main(){
char x,y; cin>>x>>y;
if(x>y) cout<<'>'<<endl;
else if(x<y) cout<<'<'<<end... | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<map>
#include<string>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
int main(){
int N; cin >> N;
int t, x, y, lx, ly, lt, tmp;
lx = 0;
ly = 0;
... | 0 | 14,132,384 |
# include <iostream>
# include <algorithm>
using namespace std;
int main(){
int n, c, k;
cin >> n >> c >> k;
int num[n+5];
for(int i=0; i<n; i++) cin >> num[i];
sort(num, num+n);
int ans = 0;
int left = 0, right = 0;
while(left < n){
ans++;
while(right+1 < n && num[right+1] <= num[left]+k && (ri... | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define RE... | 0 | 70,974,742 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
const int N = (int) 1e5 + 7;
int n;
ll a[N];
ll b[N];
ll suf[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = ... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <unordered_map>
#include <array>
#include <fstream>
#include <cassert>
#include <cmath>
#inclu... | 0 | 31,953,371 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
using namespace std;
static const double EPS=1e-12;
static const double INF=1e24;
using Point=complex<double>;
using Plane=vector<Point>;
namespace std {
bool operator<(const Point &a, const Point &b) {
return real(a)!=real(b)? real... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1000000009
#define LINF 1000000000000000009
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define l... | 0 | 78,653,339 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
const double PI = acos(-1);
#define MP make_pair
#define PB push_back
#define si(a) scanf(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 0 | 47,660,792 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int>height;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
height.push_back(x);
}
vector<int>dp(n,INT_MAX);
dp[0]=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<=i+2;j++)
{
if(j<n)
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
static const int INF = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> v;
ll sum = 0;
for (int i = 0; i < n; ++i) {
... | 0 | 49,536,991 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define isSu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int counter = 0;
int n, d;
cin >> n >> d;
double sum = 0;
double x[n][d];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < d; j++)
{
cin >> x[i][j];
}
}
for (int i = 0; i < n-1; i++)
{
for (int j = i + 1; j < n; j++)
... | 0 | 86,573,053 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | 0 | 13,744,341 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | 0 | 38,337,429 |
#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
double Sines(double a, double b, double Z){
double S = a * b * sin(Z) / 2;
return S;
}
double Cosines(double a, double b, double Z){
double c = sqrt( a * a + b * b - 2 * a * b * cos(Z) );
return c;
}
int main(){
double a, b;
int C;
cin >> ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
int n,k;
cin>>n>>k;
vector<int> a(n);
for(auto&& e: a)
{
cin>>e;
}
for (int i = 0; i < min(k,100); ++i)
{
vector<int> tmp(n,0);
for (int j = 0; j < n; ++j)
{
int l=max(0,j-a[j]);
... | 0 | 88,052,882 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
int n;
string s;
ll ans;
ll cnt[30] = {};
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++) {
cnt[s[i]-'a']++;
}
ans = 1;
for (int i = 0; i < 26; i++) {
ans *= (cnt[i]+1);
ans %= mod;
}
cout << (ans+mod-1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for (int i = 0; i < (n); ++i)
void solve(long long X, long long N, std::vector<long long> p){
ll ans = 0;
ll score = 999999999999999;
vector<ll> a(200);
rep(i,200) a[i] = 0;
rep(i,N) a[p[i]... | 0 | 53,154,473 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pie 3.1415926536
#define pb push_back
#define N 1000000007
#define M 998244353
#define ff first
#define ss second
#define INF 1ll<<63 - 1
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nrep(i,a,b) for(int i=a;i>=b;i--)... | #include <bits/stdc++.h>
using namespace std;
#define INPUT freopen("input.txt", "r", stdin);
#define ll long long
#define ld long double
#define len(s) s.size()
#define fl(st, en, in) for (int i = st; i < en; i += in)
#define rfl(st, en, de) for (int i = st; i < en; i -= de)
#define fll fl(0, n, 1)
#define cy cout << ... | 0 | 86,119,415 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b)
{
if ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int dp[9];
int n,a,F =0;
for(int i=0; i<9; i++) cin>>dp[i];
cin>>n;
for(int i=0; i<n; i++)
{
cin>>a;
for(int j=0; j<9; j++)
if(dp[j]==a) dp[j]=0;
}
if(dp[0]==0&&dp[4]==0&&dp[8]==0) F=1;
else if(dp[... | 0 | 8,553,386 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string s;
cin >> a >> b >> s;
if (s.length() == a+b+1) {
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '-')
count++;
}
if (count == 1) {
if (s[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<long long> sum;
for (int l = 0; l < n; l++) {
for (int r = l; r < n; r++) {
long long s = 0;
... | 0 | 69,599,436 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
#define r 1000001
int main()
{
ll n;
cin>>n;
ll mini=n-1;
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
ll d=n/i;
mini=min(mini,i+d-2);
}
}
c... | #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 maxs(x,y) (x = max(x,y))
#d... | 0 | 43,617,306 |
#include <bits/stdc++.h>
using namespace std;
#define ENDL '\n'
#define io ios_base::sync_with_stdio(false);cin.tie(0);
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
string group(string s){
string result;
result += s[0];
for(int i(0); i<s.length() - 1; i++){
if(s[i] != s[i+1]){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-... | 0 | 40,146,302 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int k, a, b;
cin >> k >> a >> b;
ll ans;
if (b - a <= 2) {
ans = k + 1;
} else {
if (a - 1 > k) ans = k + 1;
else {
ans = a;
k -= a -... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | 0 | 48,177,834 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define INIT(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll h,w, Min = 1e18;
int main(){
scanf("%lld%lld",&h,&w);
if(h % 3 == 0 || w % 3 == 0) printf("0\n");
else{
for(ll i = 1; i < w; i++){
ll One = i * h;
ll w1 = w - i;
ll Two = h / 2 * w1;
... | 0 | 66,486,917 |
#include <iostream>
#include <string>
#include <limits.h>
#include <algorithm>
using namespace std;
int main(void){
int h, w, ans1, ans2;
string s;
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 'A'; j < 'A' + w; j++) {
cin >> s;
if (s == "snuke") {
... | #include <iostream>
#include <map>
using namespace std;
int main(void) {
int N;
cin >> N;
map<int,int> mp;
for(int i=1; i<=N; i++) {
int tmp = i;
for(int j=2; j<=N; j++) {
while(tmp%j == 0) {
tmp /= j;
mp[j]++;
}
}
}
... | 0 | 35,539,688 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int H,W;
cin >> H >> W;
vector<string> S(H);
for(int i=0; i<H ; i++)
{
cin >> S.at(i);
}
const vector<int> dx = {0,0,1,-1};
const vector<int> dy = {1,-1,0,0};
int flag = 0;
for(int i=0; i<H; i++)
{
for(int j=0; j<W; j++)
{
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
fast_io
int n;
cin>>n;
vector<ll> a(n);
rep... | 0 | 43,072,202 |
#include<iostream>
using namespace std;
int n,A[2000100],B[2000100];
void CountingSort(int *A,int *B,int k){
int* C=new int[k+1];
for(int i=0;i<=k;++i){
C[i]=0;
}
for(int i=1;i<=n;++i){
++C[A[i]];
}
for(int i=1;i<=k;++i){
C[i]+=C[i-1];
}
for(int i=n;i>=1;--i){
... | #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 n,m,ans=0;
Graph g;
vector<bool>seen;
void dfs(int x){
seen[x]=true;
bool flag=true;
rep(i,n){
if(!seen[i]){
flag=fals... | 0 | 57,134,635 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const ll LINF = 1LL<<60;
#define int long long
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, m, X; cin >> n >> m >> X;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i ... | 0 | 7,066,216 |
#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;
constexpr int mod = 1000000007;
int main() {
ll n, z, w;
cin >> n >> z >> w;
vector<ll> a(n);
rep(i, n) cin >> a[i];
if (n == 1) {
cout << abs(a[0] - w) << endl;
return 0;
}
l... | #include<iostream>
using namespace std;
int main() {
int n, min, max, sum, p;
while (true) {
cin >> n;
if (n == 0) {
break;
}
sum = 0;
for (int i=0; i<n; i++) {
cin >> p;
sum += p;
if (i == 0) {
min = p;
... | 0 | 30,623,665 |
#include <iostream>
using namespace std;
int main()
{
int n[26] = {}, i, t;
char c;
do
{
t = 0;
while( cin.get(c) )
{
if( c == '\n' )
break;
if( 'a' <= c && c <= 'z') ++n[c - 'a'];
else if( 'A' <= c && c <= 'Z') ++n[c - 'A'];
++t;
}
}while( 0 != t );
for(i = 0; i < 26; ++i)
cout << char... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <climits>
using namespace std;
#define FOR(i,... | 0 | 30,707,370 |
#include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define F first
#define S second
typedef pair<li, li> PI;
map<PI, li> cnt;
int main(void)
{
string a, b;
cin >> a >> b;... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define re... | 0 | 12,088,314 |
#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;
ll const INF = 1LL << 60;
int main() {
ll N, M;
cin >> N >> M;
vector<string> ... | #include <iostream>
#include <sstream>
#include <fstream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
using namespace std;
int main() {
int n;
scanf("%d", &n);
... | 0 | 19,053,324 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a, b, k;
cin >> a >> b >> k;
if (a > k)
{
a -= k;
}
else
{
k -= a;
a = 0;
if (b > k)
{
b -= k;
}
else
{
b = 0;
}
}
cout << a << ' ' << b << endl;
} | #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;
int main(){
int n,k,r,s,p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
vector<char> d(n);
rep(i,n){
if(t.at(i) == 'r') d.at(i) = 'p';
... | 0 | 44,680,444 |
#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;
... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr <... | 0 | 87,469,895 |
#include <iostream>
#include <vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<map>
#include<math.h>
#include<queue>
using namespace std;
int main() {
char a[1000]="", b[1000]="";
cin >> a[0] >> b[0];
for (int i = 1; i < b[0]-'0'; i++) {
a[i] = a[0];
}
for (int i = 1; i < a[0]-'0'; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
#define ff first
#define ss second
#define pb ... | 0 | 75,321,832 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int a;
if (2 * x == w && 2 * y == h)
a = 1;
else
... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
struct UnionFind
{
vector<int> par;
UnionFind(int n): par(n){
for(int i = 0;i < n;++i){
par.at(i) = i;
}
}
int root(int x){
if(par.at(x) == x){
return x;
}else{
... | 0 | 44,642,671 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int T=0,H=0;
for(int i=0;i<n;i++){
string t,h;
cin>>t>>h;
for(int g=0;g<t.size();g++){
if(t[g]>h[g]){T+=3; break;}
if(t[g]<h[g]){H+=3; break;}
if(g+1==t.size() && t[g+1]<h[g+1]){H+=3; break;}
if(g+1==t.size() && t[g]==h[g]){T+=1; H+=1;}
}}
cout<<T<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N, K;
cin >> N >> K;
vector<ll> a(N), sum(N+1, 0);
vector<ll> b;
for (int i = 0; i < N; i++) cin >> a[i];
for (int i = 0; i < N; i++) sum[i+1] = sum[i] + a[i];
for (int i = 1; i <= N; i++) {
for (int j... | 0 | 50,176,849 |
#include <algorithm>
#include <bitset>
#include <boost/rational.hpp>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(... | #include<iostream>
#include<vector>
#include<string>
using ll = long long;
int main(){
ll n, t;
std::cin >> n >> t;
ll last = 0;
ll sum = 0;
for(int i = 0; i < n; i++){
ll tmp;
std::cin >> tmp;
if(last <= tmp){
sum += t;
last = tmp + t;
}else{... | 0 | 74,212,001 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define all(a) a.begin(),a.end()
void solve()
{
vector <int> v;
int n,i,x,sum=0,cn=0;
cin >> n;
for(i=0; i<2*n; i++)
{
cin >> x;
v.push_back(x);
}
sort(all(v));
for(i=0; i<2*n; i+=2)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
#define FOR(i, m, n) for (int i =... | 0 | 58,507,201 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int main(){
int x,y... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#defi... | 0 | 19,285,485 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a,b;
cin >> a >> b;
if(a>8||b>8) cout << ":(" << endl;
else cout << "Yay!" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a, h;
cin >> a >> h ;
int s;
for(int i = 0; i < h ; i++){
cin >> s ;
a -= s;
}
if(a < 0){
cout << -1 << endl;
} else {
cout << a << endl;
}
} | 0 | 23,776,134 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
void solve()
{
int k, s;
cin >> k >> s;
int ans = 0;
rep(x, k + 1) rep(y, k + 1)
{
int z = s - x - y;
if (!(0 <= z && z <= k))
continue;
an... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const ll MOD = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
... | 0 | 87,141,695 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
long n;
cin >> n;
long ans = 0, nn = n;
for(long i=2;i<=sqrt(nn);i++){
if(n%i!=0) continue;
long tmp = 0;
while(n%i==0){
tmp++;
n /= i;
}
long num = 1;
while(... | 0 | 13,968,049 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.en... | #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 | 47,446,253 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
while (a >= 2){
a = a - 2;
}
if (a == 0){
cout << "Even";
}
else {
while (b >= 2){
b = b - 2;
}
if (b == 0){
cout << "Even";
}
else{
cout << "Odd";
}
}
} | #include <iostream>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,b,f,r,v;
cin >> n;
int house[4][3][10];
REP(i,4){
REP(j,3){
REP(k,10){
house[i][j][k]=0;
}
}
}
REP(i,n){
cin >> b >> f >> r >> v;
house[b-1][f-1][r-1]=house[b-1][f-1][r-1]+v;
... | 0 | 14,423,092 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long int n, m;
cin>> n >>m;
long int input1,input2;
map<long int,int>mp;
bool x = false;
vector<long int>check;
for(long int i = 1; i <= m; i++)
{
cin>> input1 >> input2;
if(!x)
{
if((input1 == 1)&&... | #include <bits/stdc++.h>
using namespace std;
const int nax=1e5+5;
const int mod=1e9+7;
#define ll long long
void add_self(int &a,int b)
{
a+=b;
if(a>=mod)
a-=mod;
}
void sub_self(int &a,int b)
{
a-=b;
if(a<0)
a+=mod;
}
int main()
{
int n,k;
cin >> n >> k;
vector<int> dp(k+1);
dp... | 0 | 52,446,401 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,d;
d=0;
while(1){
cin>>a>>b>>c;
if(c%a==0){
d=d+1;
}
a=a+1;
if(a>b)
break;
}
cout<<d<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int X;
cin >> X;
int D = X%10;
X /= 10;
int C = X%10;
X /= 10;
int B = X%10;
X /= 10;
int A = X;
if(A+B+C+D==7){
cout <<A<<"+"<<B<<"+"<<C<<"+"<<D<<"=7";
}else if(A+B+C-D==7){
cout <<A<<"+"<<B<<"+"<<C<<"-"<<D<<"=7";
}else if(A+B-C+D==7)... | 0 | 34,456,126 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n, i;
cin >> n >> i;
if(n - i >= 0)
cout << n - i + 1;
else
cout << 0;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int K, N, lastto = 0, distance=0, where = -1, dochu = 0;
cin >> K >> N;
vector<int> A(N);
vector<int> vec(N);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
if (i >= 1 && distance <= A.at(i) - A.at(i - 1))
{
... | 0 | 85,448,140 |
#include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
int a, b; cin >> a >> b;
if (a == b) cout << "a == b" << endl;
else if (a > b) cout << "a > b" << endl;
else cout << "a < b" << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
const ll SIZE = 1e6 + 100;
vector<pair<ll, ll>> bst[SIZE];
vector<ll> pref;
int main()
{
fastInp;
ll n;
cin >> n;
... | 0 | 32,389,619 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
int main()
{
int n,k;
int p[6000];
int c[6000];
cin>>n>>k;
rep(i,n)cin>>p[i];
rep(i,n)p[i]--;
rep(i,n)cin>>c[i];
ll ans=(ll)-1e18;
for(int i=0;i<n;i++)
{
int si=i;
vector<int>s;
in... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int n... | 0 | 17,140,391 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | 0 | 83,669,453 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
string S;
cin >> S;
ll ans = 0;
int now = 0;
int g = 0;
int l = 0;
rep(i,S.size()) {
if (S[i] == '<') {
now++;
g = now;
ans += now;
}
else {
if (now == 0) l++;
else l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S second
const in... | 0 | 26,086,494 |
#include <iostream>
#include <string>
using namespace std;
int main() {
char a;
string str;
cin >> str;
for (int i = 0; i < str.size()-1-i; i++) {
a = str[i];
str[i] = str[str.size()-1-i];
str[str.size()-1-i] = a;
}
cout << str << endl;
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 | 17,459,394 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> vp(n);
rep(i, n) {
int a;
cin >> a;
vp[i] = make_pair(a, i);
}
sort(vp.begin(), vp.end());
rep(i, n) {
if (vp[n - 1].second == i) {
cout ... | #include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fwd(i,a,n) for(int i=a;i<=n;i++)
#define bak(i,a,n) for(int i=a;i>=n;i--)
#define all(v) v.begin(),v.end()
#define pb push_back
#define lop '\n'
#define mp make_pair
typedef long long ll;
typ... | 0 | 97,711,700 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
int k;
cin >> k;
for(int i=0; i<k; i++){
if(s[i]=='1'){
}else{
cout << s[i] << endl;
return 0;
}
}
cout << "1" << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define pi pair<int, int>
#define l first
#define r second
#define all(x) x.begin(), x.end()
#define fori(a, b, step) for (int i = a; i < b; i += step)
#define forj(a, b, step) for (int j = a; j < b; j += step)
#define int long long
const int maxn = 5e5 + 1, mod = 1e9 + 7;
... | 0 | 94,768,643 |
#include<iostream>
#include<string>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
using namespace std;
bool sameside(double ax, double ay, double bx, double by, double cx, double cy, double dx, double dy) {
if (ax =... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define deb... | 0 | 8,295,888 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a=100000;
while(cin>>n){
for(int i=1;i<=n;i++){
int b=a*0.05;
if(b%1000)
b=(b/1000+1)*1000;
a+=b;
}
cout<<a<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
int main() {
string s, t;
int n; cin >> n >> s >> t;
rep(i, 0, n + 1) {
bool ok = true;
rep(j, 0, n - i) {
if (s[i + j] != t[j]) ok = false;
}
if (ok) {
cout << i + n << endl;
return 0;
}
}
return 0;
} | 0 | 77,481,833 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int mod = 1e9+7;
int main(){
string s;
cin >> s;
int n = s.size();
vector<vector<int>> dp(n+1, vector<int>(2, 0));
dp[0][0] = 1;
for... | #include <string>
#include <iostream>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <array>
#include <vector>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <utility>
#include <cmath>
#include <random>
using namespace std;
using ll = long lon... | 0 | 92,384,365 |
#include<stdio.h>
int main(){
char S1;
char S2;
char S3;
scanf("%c %c %c",&S1,&S2,&S3);
if(S1==S2,S1!=S3,S2!=S3){
puts("Yes");
}
else if(S1==S3,S1!=S2,S3!=S2){
puts("Yes");
}
else if(S2==S3,S1!=S2,S1!=S3){
puts("Yes");
}
else {
puts("No");
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 0 | 75,754,256 |
#include <ios>
#include <iostream>
#include <vector>
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; ++i)
std::cin >> a[i];
int m = 1;
for ... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 90,018,962 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a,b) for(ll i=(a);i<(b);++i)
#define minv(v) *min_element(... | 0 | 28,709,078 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int n, maxv = -114514191, minv = 9810114514;
cin >> n;
for(int i=1; i<=n; i++)
{
int x;
cin >> x;
maxv = max(maxv, x);
minv = min(minv, x);
}
cout << abs(maxv - minv);
return 0;
} | #include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<t... | 0 | 82,917,808 |
#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(... | #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... | 0 | 93,324,070 |
#include <stdio.h>
int main (){
int N,K,x=1;
scanf ("%d",&N);
scanf ("%d",&K);
for (int i=0; i<N; i++){
if (x*2 > x+K){
x = x + K;
}
else {
x = x * 2;
}
}
printf ("%d",x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string c;
cin>> c;
for(int i = 0; i < c.size(); i++){
if(c.at(i) == 'a'){
cout << "vowel" << endl;
}
else if(c.at(i) == 'i'){
cout << "vowel" << endl;
}
else if(c.at(i) == 'u'){
cout << "vowel" << endl;
}
else... | 0 | 25,374,363 |
#include <iostream>
using namespace std;
struct Point {
double X, Y;
Point(double x, double y) :X(x), Y(y) {}
};
double cross(Point p0, Point p1, Point p2) {
Point a = Point(p1.X - p0.X, p1.Y - p0.Y);
Point b = Point(p2.X - p0.X, p2.Y - p0.Y);
return a.X * b.Y - a.Y * b.X;
}
bool is_contain(Point a, Point b, ... | #include <iostream>
#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>
#inc... | 0 | 90,426,656 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.