code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using ll = long long;
const ll MOD = 1e9 + 7;
const int MX = 1e5 + 5;
string s;
ll mpow(ll a, ll b) {
a %= MOD;
b %= (MOD - 1);
ll res = 1;
while (b > 0) {
if (b & 1) res = res * a % MOD;
a = a * a % MOD;... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 91,136,811 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
int main() {
string s; cin >> s;
int n = s.size();
int red = 0; int blue = 0;
REP(i, n) {
if (s[i] == '0') ++red;
else ++blue;
}
cout << min(red, blue) * 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 0 | 77,623,169 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for(int i = (int)(k);i < (int)(n);i++)
int main() {
int N;cin >> N;
vector<int> dp(N), c(N);
rep(i, 0, N) cin >> c[i];
dp[0] = 0, dp[1] = abs(c[1]-c[0]);
rep(i, 2, N) dp[i] = min(dp[i-1]+abs(c[i-1]-c[i]), dp[i-2]+abs(c[i-2]-c[i]));
cout << d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...) 0
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int m = 1 << n;
vector<int> a... | 0 | 4,248,576 |
#include<iostream>
#include<algorithm>
using namespace std;
int head, tail;
int Q[100000];
int n, d[110];
bool a[110][110] = {};
void enqueue(int x){
Q[tail] = x;
if(tail + 1 == 100000) tail = 0;
else tail++;
}
int dequeue(){
int x = Q[head];
if(head + 1 == 100000) head = 0;
else head++;
return x;
}
void ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int A, B, K;
cin >> A >> B >> K;
int m = A < B ? A : B;
int cdiv = 0;
for (int i = m; true; i--) {
if (A % i == 0 &... | 0 | 3,774,679 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n+1,0);
for (int i = 1; i <= n; i++) {
int b;
cin >> b;
a[i] = b;
}
long long cumulativeSum = 0;
for (int i = 1; i <= n; i++){
cumulativeSum += a... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define endl '\... | 0 | 100,573,939 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin>>H>>W;
vector<vector<string>>box(H,vector<string>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>box.at(i).at(j);
}
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(box.a... | 0 | 37,378,541 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)n; i++)
#define PI 3.14159265358979323846
#define vll vector<long long>
#define vvll vector<vector<long long>>
#define pll pair<long long, long long>
#define cld complex<long double>
using namespace std;... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000007LL;
constexpr int inf =... | 0 | 16,440,704 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,... | 0 | 12,052,469 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define INF 1000000000
#define loop(i,a,b) for(int i=a;i<b;i++)
int main()
{
IOS
int w,s;
cin>>s>>w;
if(w>=s)
cout<<"u... | #include <bits/stdc++.h>
using namespace std;
long long n,a[200010],ans;
int main()
{
scanf("%lld",&n);
for(int i=1; i<=n; i++)
scanf("%lld",&a[i]);
long long l=1,r=1,sumx=a[1],sum=a[1];
for(int i=1; i<=n; i++)
{
while((sumx==sum)&&r<=n)
{
sum+=a[r+1];
sumx^=a[r+1];
r++;
}
... | 0 | 32,154,345 |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1){
cout << 1;
return 0;
}
for (int i = 0; i < n; i++) {
if (pow(2, i) > n) {
cout << pow(2, i - 1);
return 0;
}
}
} | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(){
long long n;
cin >> n;
long long a[n+1], b[n+1];
for(long long i = 0; i <= n; i++){
cin >> a[i];
}
if(n == 0){
if(a[0] == 1){
cout << 1 << endl;
return 0;
}
... | 0 | 68,320,635 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
int main()
{
int N, K;
cin >> N >> K;
vector<long long> a(N);
REP(i, N) cin >> a[i];
sort(a... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
using ll = long long;
string s;
int x, y;
int l;
int dp(vector<int> v, int t) {
int len = l + 2;
if (t > len)
return false;
int dp[len];
for (int i = 0; i < len; ++i) dp[i] = 0;
... | 0 | 33,182,521 |
#include<bits/stdc++.h>
#define MAX 100000
#define MOD 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k,s;
cin>>k>>s;
int ans = 0;
for(int i=0;i<=k;++i)
{
for(int j=0;j<=k;++j)
{
if(i+j>s||s-i-j>k)
continue;
++ans;
}
}
cout<<ans<<endl;
return ... | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, n)for(int i=0; i<n; i++)
using namespace std;
int main(){
int a, b, k;
vector<int> divisor;
cin >> a >> b >> k;
int j=0;
for(int i=1; i<=a || i<=b; i++){
if(a%i==0 && b%i==0){
divisor.push_back(i);
... | 0 | 78,003,299 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a,b,i=1,j;
cin >> a >> b;
while(1)
{
if(floor (i*0.08)==a && floor (i*0.1)==b)
{
cout << i << endl;
return 0;
}
if(i>b*20)
{
cout << "-1" << endl;
r... | #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 | 84,990,935 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)
using namespace std;
struct Edge{
int to;
long weight;
Edge(int t, long w) : to(t), weight(w) {}
};
long modpow(long a, long n, long mod) {
long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a ... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
vector<string> Bubble(vector<string> s, int n){
for(int i=0; i<n; i++){
for(int j = n-1... | 0 | 64,110,237 |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a = N/100;
int b = (N-100*a)/10;
int c = N-(100*a+10*b);
if (a == 7 || b == 7 || c == 7) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <cstdio>
int main(){
int a, b, c, i, j;
j = 0;
scanf("%d %d %d", &a, &b, &c);
for( i=a; i<=b; i++){
if(c % i == 0) j += 1;
}
printf("%d\n", j);
return 0;
} | 0 | 9,392,508 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mod 1000000007
ll ceil1(ll n,ll m){if(n%m==0){return n/m;}return n/m +1;}
void solve()
{
ll a,b;
cin>>a>>b;
if(a%3==0 || (a+b)%3==0 || b%3==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | 0 | 40,104,707 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
const int INF=1e9;
ll gcd(ll x,ll y){
if(y==0) return 0;
return gcd(y,x%y);
}
int main(){
int x,y;cin>>x>>y;
int ... | #include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
int A[111];
int main(){
int N, a, K = 0;
scanf("%d", &N);
rep(i, N){
scanf("... | 0 | 20,063,020 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int n, k;
cin >> n >> k;
ll ans;
int a = n / k;... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s,t;
cin >> s >> t;
string tmp = s;
for(int i=0;i<s.size();i++) {
tmp = tmp[s.size()-1] + tmp.substr(0,s.size()-1);
if(tmp == t) {
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
... | 0 | 51,742,900 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<iostream>
#include<cmath>
#include<math.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
int n;
cin >> n;
int a[n];
int ans = 0;
for(int i = 0;i < n;i++)
{
cin >> a[i];
if(i > 0 && a[i] == a[i - 1])
{
ans++;
a[i] = -1;
}
... | 0 | 41,414,512 |
#include<iostream>
#include<cstring>
#include<cassert>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<time.h>
#include<algorithm>
using namespace std;
#define REP(i,x,y) for(ll i=x;i<=y;i++)
#define rep(i,n) REP(i,1,n)
#define rep0(i,n) REP(i,0,n-1... | #include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
using namespace std;
void fastio()
{
#ifndef ONLINE_JUDGE
freopen("INPUT.txt","r",stdin);
freopen("OUTPUT.txt","w",s... | 0 | 17,096,240 |
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T &a, T b) {
if (a < b) a = b; return true;
return false;
}
void solve(long long N, std::vector<long long> H){
int count = 0;
long long maxi = H[0];
REP(i, N... | #include <iomanip>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define vec vector<long long int>
#define fi first
#define se second
#define pb push_back
void sieve(vector<int> &x, int k)
{
for (int i = 1; i <= k; i++)
{
x[i] = i;
}
int i = 2;
... | 0 | 39,759,237 |
#include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n, m;
cin >> n >> m;
vector<ll> h(n);
for (ll i = 0; i < n; i++)
{
cin >> h[i];
}
vector<ll> ans(n, 0);
for (ll i = 0; i < m; i++)
{
ll a, b;
cin >> a >> b;
a--;
b--;
ans[a] = max(ans[a], h[b]);... | 0 | 83,617,494 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<ll> b(N + 1, 0);
for (int i = 1; i < N + 1; i++) {
b[i] = b[i - 1] + (a[i - 1] > 0 ? a[i - 1] : 0);
... | #include <cstdio>
#define MAX_S 12
class Trie {
public:
bool exist;
char c;
Trie* child[4];
Trie(bool exist,char c);
~Trie();
void addNext(Trie* trie,int id);
};
Trie::Trie(bool exist,char c) {
this->exist = exist;
this->c = c;
for(int i=0;i<4;i++) {
this->child[i] = NULL;
}
}
Trie::~Trie() {}
v... | 0 | 78,205,691 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
const int inf=1e9+7;
const ll INF=1LL<<61;
const ll mo... | #include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
int n;
vector<int> lst[100010];
int main() {
scanf("%d", &n);
int lo = 1, hi = n;
while(lo < hi) {
int mid = (lo + hi) / 2;
if(1ll*mid*(mid+1)/2 < n) lo ... | 0 | 38,665,805 |
#include <iostream>
using namespace std;
bool isEven(const string &s){
int mid = s.length() / 2;
for(int i = 0 ; i < mid ; ++i){
if(s[i] != s[i + mid]) return false;
}
return true;
}
int main(int argc, char const *argv[])
{
string s;
cin >> s;
s.pop_back(); s.pop_back();
while(!i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
vector<vector<char>> upper(50, vector<char>(100, '.'));
vector<vector<char>> lower(50, vector<char>(100, '#'));
int sx = 0, sy = 0;
for(int i=0; i<b-1; i++){
upper[sx][sy] = '#';
sy += 2;
i... | 0 | 47,254,920 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int w,h,n;
cin >> w >> h >> n;
vector<vector<bool>> p(h, vector<bool>(w, true));
for(int i = 0; i < n; i++) {
int x,y,a;
cin >> x >> y >> a;
if(a==1){
for(int j = 0; j < h; j++) {
... | 0 | 6,439,973 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) f... | 0 | 30,762,055 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
#define press_F_to_pay_respect ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn for(int i=0;i<n;i++)
#define fore(i,a,b) for(int i = a; i < (b); ... | 0 | 17,483,677 |
#include <stdio.h>
int main(void){
int a,b;
scanf("%d %d",&a,&b);
if(a+b ==15)
printf("+");
else if(a*b ==15)
printf("*");
else
printf("x");
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int h, w, a, b;
... | 0 | 24,694,353 |
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | #include <iostream>
using namespace std;
int main(void){
int x,y;
for(;;){
cin>>x>>y;
if(x==0&&y==0){
break;
}
for(int i=1;i<=x;i++){
for(int o=1;o<=y;o++){
cout<<'#';
}
cout<<endl;
}
cout<<endl;
... | 0 | 19,469,664 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
usi... | 0 | 10,879,631 |
#include <iostream>
using namespace std;
int main()
{
int n, x, t;
cin >> n >> x >> t;
cout << (n/x+((n%x>0)?1:0))*t << endl;
return 0;
} | #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cs... | 0 | 21,214,331 |
#include<iostream>
#include<string>
#include<cstdlib>
#include<map>
#include<algorithm>
using namespace std;
int main(){
string str;
int max_len = 0;
int max_fac = 0;
string max_str1;
string max_str2;
map<string, int> map_str;
while(cin >> str) {
transform(str.begin(), str.end(), str.begin(), ::tolowe... | #include<bits/stdc++.h>
using namespace std;
int R;
int main()
{
scanf("%d",&R);
if(R<1200)
printf("ABC");
else if(R<2800)
printf("ARC");
else
printf("AGC");
return 0;
} | 0 | 48,786,139 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll a,b,i; cin>>a>>b;
for(i=1;i<=1001;i++)
{
if (i*8/100==a&&i/10==b) {cout<<i; return 0;}
}
cout<<-1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long INF = (1LL<<32);
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 RREP(i, n) RFO... | 0 | 2,960,502 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<cstring>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
in... | #include<algorithm>
#include<functional>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
#define all(c) (c).begin(), (... | 0 | 55,694,123 |
#include <bits/stdc++.h>
#include <iostream>
#include <string.h>
using namespace std;
int main(void)
{
int h, w;
cin >> h;
cin >> w;
char *initmap = (char*) malloc(h * w);
int *changennum = (int*) malloc(h * w * sizeof(int));
{
string s;
getline(cin,s);
for(int r = 0; r ... | #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int main (int argc, char *argv[]) {
int n, Y, M, D;
const int b = 20;
const int s = 19;
int total = 0;
for (int i = 1; i < 1000; ++i) {... | 0 | 81,871,613 |
#include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define moca(a, s, b) a=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
const int INF = 2e9;
const int MOD = 1e9+7;
const int MAX = 2e5+10;
const lint LNF = 2e18;
int n, A[MAX];
lint F[MAX], I[MAX];
int P[MAX], a, c;
lint pw(lint a, int e){
if(e==0) return 1;
lint t = pw(a, e/2); t = t*t%MOD... | 0 | 59,618,442 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0, s, nv;
cin >> s;
nv = s;
set<int> st;
st.insert(nv);
while(1){
if(nv%2 == 0) nv/=2;
else nv = 3*nv + 1;
ans++;
if(st.find(nv) != st.end()) break;
st.insert(nv);
}
cout << ans + 1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<int> L(n);
rep(i, n) cin >> L.at(i);
int ans = INF;
f... | 0 | 62,947,130 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
c... | #include <stdio.h>
#define debug
#define NMAX 2000000
#define VMAX 10000
int main() {
int n, C[VMAX + 10];
int *A = new int[NMAX+10];
int *B = new int[NMAX+10];
debug("=== LINE %d ===\n", __LINE__);
scanf("%d", &n);
for (int i = 0; i <= VMAX; i++) {
C[i] = 0;
}
for (int i = 1; i ... | 0 | 27,956,717 |
#include<iostream>
#include<vector>
using namespace std;
#define INF 1980000001
int main(){
int V, E;
cin >> V >> E;
vector<vector<int> > A(V, vector<int>(V, INF));
for (int i = 0; i < V; i++) {
A[i][i] = 0;
}
for (int i = 0; i < E; i++) {
int s, t, d;
cin >> s >> t >> d;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(de... | 0 | 16,813,977 |
#include <iostream>
#include <map>
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int ok, arr[100];
int main(void) {
memset(arr, 0, sizeof(arr));
while(~scanf("%d", &ok)) {
arr[ok] += 1;
}
int mx = *max_element(arr, arr + 100);
for(int i = 0; i < 100; i++) {... | #include <iostream>
int main()
{
int x, y;
std::cin >> x >> y;
while (x != 0 || y != 0) {
if (x < y) {
std::cout << x << " " << y << std::endl;
}
else {
std::cout << y << " " << x << std::endl;
}
std::cin >> x >> y;
}
} | 0 | 15,361,678 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <array>
#include <cmath>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
int main() {
int a, b, c, k,ans=0;
cin >> a >> b >> c >> k;
for (int i = 0; i < a; i++) {
if (k == 0)break... | #include "bits/stdc++.h"
using namespace std;
void Main() {
long long N, K;
cin >> N >> K;
map<long long, long long> arr;
for (long long i = 0; i < N; ++i) {
long long a, b;
cin >> a >> b;
if (arr.count(a) == 0) {
arr.insert(make_pair(a, 0));
}
arr[a] ... | 0 | 4,081,931 |
#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 A[9];
int match_map[10] = {0, 2, 5,... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | 0 | 3,816,155 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | 0 | 967,659 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
int rest = n % 500;
cout << (rest <= a ? "Yes" : "No") << endl;
return 0;
} | #include<iostream>
#include<math.h>
using namespace std;
int main(){
int week, fraction;
cin >> week;
double debt = 100000;
double const rate = 1.05;
for (int i = 0; i < week; i++){
debt = debt*rate;
fraction = (int)debt % 1000;
if (fraction > 0){
... | 0 | 19,928,362 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n; ++ i) {
if (s[i] == s[i + 1]) {
cout << i + 1 << " " << i ... | #include <stdio.h>
#include <string.h>
#define ll long long int
#define fl(i,a,n) for(int i = a; i < (n); i++)
#define fls(i,a,s) for(int i = a; s[i] != '\0'; i++)
int main() {
int n,m;
scanf("%d %d", &n, &m);
int ctr = 0;
fl(i,0,n){
fl(j,i+1,n){
ctr++;
}
}
fl(i,0,m){... | 0 | 2,885,740 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int m... | #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;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | 0 | 25,550,728 |
#include<iostream>
using namespace std;
int in(){int a;cin>>a;return a;}
int a[100001],b[100001],ans,ak=1e9+7,ac=ak;
int main(){
int n=in(),m=in(),k=in();
for(int i=1;i<=n;i++)a[i]=in(),ac=min(a[i],ac);
for(int i=1;i<=m;i++)b[i]=in(),ak=min(b[i],ak);
ans=ak+ac;
while(k--)ans=min(ans,a[in()]+b[in()]-in());
return ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int dp[1111][1111];
cin >> n;
while(n--){
string str1, str2;
cin >> str1 >> str2;
memset(dp,0,sizeof(dp));
for(int i = 1; i <= str1.size(); i++){
for(int j = 1; j <= str2.size(); j++){
if(str1[i-1] == str2[j-1]){
... | 0 | 96,463,975 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 105;
... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#ifdef RUBICK
#include "dbg.h"
#else
#define dbg(exp)
#endif
using namespace std;
using namespace __gnu_pbds;
template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_upd... | 0 | 33,091,741 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | #include "bits/stdc++.h"
using namespace std;
const int MAX = 10000000;
int f(int x) {
if (x % 2 == 0) {
return x / 2;
}
else {
return 3 * x + 1;
}
}
void Main() {
int s;
cin >> s;
set<int> hist;
hist.insert(s);
int ans = 0;
for (int i = 2; i < MAX; ++i) {
... | 0 | 35,520,728 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mp make_pair
#define pb push_back
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,m;cin>>n>>m;
vector < pair<ll,int> > v;
ll a;int b;
for (int i = 0; i < n; i++)
{
cin>>a>>b; v.pb(mp(a,b));
}
sort(v.begin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N, M; cin >> N >> M;
map<int,int> ac;
map<int,int> wa;
int wa_num = 0;
int ac_num = 0;
for(int i = 0; i < M; i++){
int num; string ... | 0 | 29,244,129 |
#include <cstdio>
#include <vector>
int main(){
std::vector< std::vector<int> > M;
int n, r, k, c;
scanf("%d", &n);
M.resize(n);
for (int i=0;i<n;i++){
M[i].resize(n);
scanf("%d %d", &r, &k);
for (int j=0; j<k;j++){
scanf("%d", &c);
M[i][c-1]=1;
}
}
for (int i=0;i<n;i++){
for (int j=0;j<n;j++){
... | #include<bits/stdc++.h>
using namespace std;
int par[10001];
int root(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = root(par[x]);
}
}
bool same(int x, int y) {
return root(x) == root(y);
}
void unit(int x, int y) {
int root_x = root(x);
int root_y = root(y);
... | 0 | 48,793,451 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; ++i){
cin >> a[i];
}
int ans=0;
for(int i=0; i<n; ++i){
int j=0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int h, n;
cin >> h >> n;
int a[n], b[n];
rep(i, n) cin >> a[i] >> b[i];
vector<int> dp(h + 5, INF);
for (int i = 1; i <= h; i++) {
rep(j, n)... | 0 | 80,352,947 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S, T, ans="Yes";
cin >> S >> T;
int Ns = S.size(), Nt = T.size();
for (int i=0; i<Ns; i++) {
if (S[i]!=T[i]) {
ans = "No";
break;
}
}
cout << ans << endl;
} | 0 | 70,638,692 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << ... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#include <unordered_map>
#inc... | 0 | 16,221,695 |
#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_boun... | #include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back... | 0 | 46,319,678 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <deque>
#include <numeric>
#include <map>
#include <stack>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF 1000000000000
using names... | #include <bits/stdc++.h>
using namespace std;
#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__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | 0 | 57,240,878 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | #include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | 0 | 74,627,630 |
#include <iostream>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
int a[n];
int days = 0;
for(int i=0; i<m; i++){
cin >> a[i];
days += a[i];
}
cout << (n >= days ? n-days : -1) << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#def... | 0 | 6,668,966 |
#include<iostream>
using namespace std;
int main(){
long long a, b;
cin >> a >> b;
if(b%2!=0)
{
if((b+1)%4!=0)
{
b = 1;
}
else
{
b = 0;
}
}
else
{
if(b%4!=0)
{
b = b ^ 1;
}
el... | #include<iostream>
#include<queue>
using namespace std;
const int MAX = 1e5+1;
int A[MAX];
int main(){
int n, l; cin >> n >> l;
for (int i = 1; i <= n; i++)
{
cin >> A[i];
}
int mx = 0;
int tie = 0;
for (int i = 1; i < n; i++)
{
if (mx < A[i]+A[i+1])
{
... | 0 | 85,064,007 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <list>
#include <numeric>
#include <stack>
#include <unordered_map>
#include <map>
#include <set>
using namespace std;
#define sz(a) int((a).size())
#define all(... | 0 | 20,314,864 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
int main()
{
int n,h,w;
cin>>n>>h>>w;
int a[n];
int b[n];
int ans=0;
rep(i,n)
{
cin>>a[i];
cin>>b[i];
if(a[i]>=h&&b[i]>=w)
ans++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
string sub(int n) {
string ret = "";
string num = to_string(n);
for (int i = 0; i < 6 - num.size(); i++) {
ret += '0';
}
return ret + num;
}
int binar... | 0 | 73,066,385 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int v[5];
for(int i=0; i<5; i++){
cin >> v[i];
}
sort(v, v+5, greater<int>());
for(int i=0; i<5; i++){
cout << v[i];
if(i != 4)
cout << " ";
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<tuple<int,int,int>>a(m,tuple<int,int,int>(0,0,0));
for(int i=0;i<m;i++){
cin >> get<0>(a.at(i)) >> get<1>(a.at(i));
get<2>(a.at(i))=i;
}
vector<tuple<int,int,int>>b=a;
sort(b.begin(),b.end());
int c=1;
for(... | 0 | 3,253,914 |
#include<iostream>
#include<climits>
#include<bits/stdc++.h>
#include<algorithm>
#include<deque>
#include<set>
#include<cstdio>
#include<vector>
#include<string>
#include<cmath>
#define fo(i,n) for(i=0;i<n;i++)
#define ll long long
#define mod 1000000007
using namespace std;
ll npow(ll base, ll exp) {
int reaction=12... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 0 | 77,702,929 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int W,H,x,y;
cin>>H>>W>>x>>y;
cout<<fixed<<setprecision(1)<<H*W*0.5<<' ';
cout<<(x*2==H && y*2==W?1:0)<<endl;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end... | 0 | 83,648,056 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#de... | #include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 39,868,430 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pai acos(-1)
#... | 0 | 87,742,732 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
typedef long long LL;
typedef long long int int64;... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 26,840,983 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for(int i=0;i<4;i++){
cout << s.at(i);
}
cout << " ";
for(int i=4;i<12;i++){
cout << s.at(i);
}
cout << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 0 | 84,187,958 |
#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>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<math.h>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
const int N=10000;
const db pi=acos(-1.0);
#define lowb... | 0 | 15,234,115 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define filein freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
void fun1(int* a,int* b){
int sum=*a+*b;
int dif=abs(*a-*b);
*a=sum;
*b=dif;
}
int main() {
int n,m;
cin>>n>>m;
int a[n];
double d=(double)1... | #include<cmath>
#include<vector>
#include<queue>
#include<iostream>
#include<algorithm>
#define debug(ARGS) cout << #ARGS << ": " << ARGS << endl;
#define ll long long
#define INF (int)1e7
#define p pair<int, int>
#define F 0
#define X -1
#define S -2
using namespace std;
int convert(char c){
int ret;
if('1' <= c &... | 0 | 77,025,177 |
#include <iostream>
#include <vector>
#include <cstring>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
string S;
cin >> S;
REP(i,S.size())
{
if(i == 4)
{
cout << " ";
}
cout << S[i];
}
cout... | #include <iostream>
#include <unordered_set>
#include <queue>
#include <algorithm>
using namespace std;
using edge_set = unordered_set<int>;
int main() {
int V, E;
cin >> V >> E;
int count = 0;
pair<int, int> order[V];
edge_set indeg[V], outdeg[V];
for (int i = 0; i < V; i++) {
order[i].... | 0 | 74,623,458 |
#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 ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
int a[5010];
long long int s[5010];
int main(void){
int n;
while(cin >> n && n) {
rep(i, n) cin >> a[i];
s[0] = 0;
rep(i, n) s[i+1] = a[i]+s[i];
long long int ans = numeric_limits<long long i... | 0 | 22,589,838 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >>N;
string S;
cin >>S;
char b=S[0];
int ans=N;
for(int i=1;i<N;i++){
if(S[i]==b){
ans--;
}
else{
b=S[i];
}
}
cout << ans <<endl;
} | #include<iostream>
using namespace std;
int main(){
int a[10];
for(int i=0;i<10;i++)cin>>a[i];
int x=-1,y=-1,z=-1;
for(int i=0;i<10;i++){
if(a[i]>x){
z=y;
y=x;
x=a[i];
}else if(a[i]>y){
z=y;
y=a[i];
}else if(a[i]>z){
... | 0 | 79,013,083 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vect... | #include <bits/stdc++.h>
using namespace std;
int ctoi(char);
int main()
{
string s;
while (1)
{
cin >> s;
if (s == "0") break;
int digs = 0;
for (long unsigned int i = 0; i < s.length(); i++) {
digs += ctoi(s[i]);
}
cout << digs << endl;
}
... | 0 | 51,129,752 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
string s;
cin >> s;
int ans = 0;
int flag = 0;
if(s[0] == 'B') flag = 1;
rep(i,s.size() - 1){
char tmp = s[i+1];
int num = 0;
if(tmp == 'W')... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 0 | 38,014,430 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
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; }
const long long INF = 1LL << 60;
typed... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, x, j, k;
while(cin >> n >> x && (n || x)) {
if(x > 3*n - 3) {
cout << "0\n";
continue;
}
int count = 0;
int kmax = min(n+1, x-2);
for(k = max(3,x-2*n+3); k < kmax; ++k) {
int jmax = min(k, x-k);
for(j ... | 0 | 17,328,364 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0,... | #include<iostream>
using namespace std;
bool ispal(int n)
{
int j=1;
while(n/j!=0)
j*=10;
j/=10;
while(n!=0)
{
if(n/j != n%10)
return false;
n=n%j;
n=n/10;
j/=100;
}
return true;
}
int main()
{
int a,b,cnt=0;
cin >> a >> b;
for( int i=a ; i<=b ; i++ )
if(ispal(i))
cnt++;
cout << cnt << endl... | 0 | 90,753,139 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N < 15)
cout << 800 * N << endl;
if (15 <= N)
cout << (800 * N) - 200 * (N / 15) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
vector<string> s(n);
rep(i,n)cin >> s.at(i);
map<char ,int > alph;
for(int i='... | 0 | 32,812,997 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, H;
cin >> N >> H;
vector<pair<int,int>> dam(2*N);
for (int i = 0; i < 2*N; i++) {
int x;
cin >> x;
dam[i] = make_pair(x,i);
}
sort(dam.begin(), dam.end(), greater<pair<int,int>>());
int AC = 0;
int i = 0;
while (H > 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 44,267,009 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
if (A == 0) {
if (N % 500 == 0) {
cout << "Yes"<< endl;
}
else {
cout << "No" << endl;
}
return 0;
}
if (N <= A) {
cout << "Yes" << endl;
return 0;
}
int modulo = N % 500;
if (mo... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | 0 | 2,032,043 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
class Stream{
public:
Stre... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<vector<int>> a(3, vector<int>(3));
vector<vector<int>> r(3, vector<int>(3, 0));
rep(i, 3) rep(j, 3) cin>> a[i][j];
int n;
cin >> n;
int b;
rep(i, n){
cin >> b;
rep(... | 0 | 25,553,285 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long int;
using ld=long double;
using VI=vector<ll>;
using VD=vector<ld>;
using VVI=vector<VI>;
using VC=vector<char>;
using VB=vector<bool>;
using VVC=vector<VC>;
using VS=vector<string>;
using PLL =pair<ll,ll>;
using PLD=pair<ld,ld>;
using VPLL=vector<PLL>;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | 0 | 90,235,947 |
#define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b... | #include <iostream>
#include <vector>
using namespace std;
bool isCheck(int y){
return y % 3 == 0;
}
int main(){
int n, i,j,k,l,y,m,d;
cin >> n;
for(i=0; i<n; i++){
cin >> y >> m >> d;
int res = 0;
for(j=y; j<1000; j++){
for(k=(j == y ? m : 1); k<=10; k++){
... | 0 | 6,902,075 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
cout << char (a.at(0) - 0x20) << char (b.at(0) - 0x20) << char (c.at(0) - 0x20) << endl;
} | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
ll a_sum = 0, b_sum = 0;
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
a_sum += A.at(i);
}
for (ll i = 0; i < ... | 0 | 13,493,712 |
#include <iostream>
using namespace std;
int main(){
while(true){
string s;
string bottom;
string top;
int m;
int h;
cin >> s;
if(s=="-")break;
cin >> m;
for(int i=0; i<m; i++){
cin >> h;
bottom = s.substr(0, h);
top = s.substr(h, s.length()-h);
for(int i=0;... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
while(cin>>n){
if(n==0)break;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
int ans=-1000000;
for(int i=0;i<n;i++){
int sum=0;
for(int j=i;j<n;j++){
sum+... | 0 | 18,375,438 |
#include <iostream>
using namespace std;
int main() {
int X,A;
cin >> X >> A ;
if (X<A) {
cout << 0 << endl;
}
else {
cout << 10 << endl;
}
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<lo... | 0 | 28,331,330 |
#include<iostream>
using namespace std;
int main()
{
long int A;
double B;
cin >> A >> B;
long int B_ = 100*B+0.5;
cout << A*B_/100 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define VL vector<lol>
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ... | 0 | 7,953,871 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i, n) FOR(i,0,(n))
#define SP << " " <<
class BRuinedSquare {
public:
void solve(std::istream &in, std::ostream &out) {
int x1, y1, x2, y2;
in >> x1 >> y1 >> x2 >> y2;... | #include <bits/stdc++.h>
using namespace std;
int K;
vector<int> n(100000,100000);
deque<int> deq;
int BFS(){
while(!deq.empty()){
int f=deq.front();
deq.pop_front();
if(f==0)return n[0];
if(n[f]<n[(f*10)%K]){
n[(f*10)%K]=n[f];
deq.push_front((f*10)%K);
}
if(n[f]+1<n[(f+1)%K]){
n[(f+1)%K]=n[f]+1;
... | 0 | 40,418,264 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string s;
cin >> s;
int64_t ans = 0;
int64_t b_cnt = 0;
rep(i, s.size())
{
if (s[i] == 'W')
{
ans += b_cnt;
}
else
{
b_c... | 0 | 14,979,064 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int) (n); i++)
#define _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typenam... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a... | 0 | 3,242,396 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
#define FOUT(n, dist) cout<<fixed<<setprecision(n)<<(dist);
#define BR cout<<endl;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e6 + 100;
int n, x, ans, maxx, res, i, j, num[N];
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
cin >> n >> ans;
num[ans]++;
for (i = 2; i <= n; i++) {
cin >> x;
num[x]++;
maxx = max(maxx, ... | 0 | 93,423,901 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
cout << (char)toupper(s1[0]) << (char)toupper(s2[0]) << (char)toupper(s3[0]) << endl;
} | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI=acos(-1.0);
#define t1(x) cerr<<#x<<"="<<x<<endl
#define t2(x, y) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<endl
#define t3(x, y, z) cerr<<#x<<"=" <<x<<" "<<#y<<"=... | 0 | 79,243,402 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
using namespace std;
int n, i;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
deque<ll> ans;
if (n % 2) {
ans.pb(a[i]);
i++;
}
while (i < n) {
ans.pb(a... | #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
using namespace std;
bool is_palindrome(const string &s) {
bool res = true;
for (int i = 0; i < s.size() / 2; i++) {
if (s[i] != s[s.size() - i - 1]) {
res = false;
break;
}
}
return res;
}
int solve(string &s, int l, int r) {... | 0 | 51,270,859 |
#include <bits/stdc++.h>
using namespace std;
vector<string> button = {
"",
".,!? ", "abc", "def",
"ghi", "jkl", "mno",
"pqrs", "tuv", "wxyz",
};
int main() {
int n; cin >> n;
for (int i = 0; i < n; ++i) {
int x = 0;
int cnt = -1;
string s; cin >> s;
for (auto&& c : s) {
int num = c - ... | #include <iostream>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
if(a<=c){
if(c<b){
if(b<d) cout << b-c << "\n";
else cout << d-c << "\n";
}
else cout << 0 << "\n";
}
else {
if(a<d){
if(d<b) cout << d-a << "\n";
else cout << b-a << "\n";
}
... | 0 | 46,555,790 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,a[100000],i,cnt=1;
cin >> n;
for(i=0;i<n;i++)cin >> a[i];
sort(a,a+n);
for(i=1;i<n;i++) if(a[i-1]!=a[i])cnt++;
cout << cnt - (n-cnt)%2;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
int k;
cin>>k;
vector<int> ans;
ans.push_back(1);
ans.push_back(2);
if(k<11){
cout<<k<<endl;
return 0;
}
int lun=2;
rep(i,k-12){
boo... | 0 | 9,434,765 |
#include <bits/stdc++.h>
using namespace std;
int main() {int a,b;
cin >> a >> b;
int c = a-b;
if(c < 0)c = 0;
cout << c << endl;} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>c(n,0),s(n,0),f(n,0);
for(int i = 0 ;i < n-1 ;i++)
{
cin >> c.at(i) >> s.at(i) >> f.at(i);
}
for(int i=0;i<n;i++)
{
int cnt=0;
cnt = s.at(i) + c.at(i);
for(int j=i+1;j<n-1;j++)
{
if(s.at(j) >= cnt)
{
cnt =... | 0 | 16,575,514 |
#include<iostream>
using namespace std;
#define MAX 100005
#define NIL -1
struct Node{int parent, left, right;};
Node Tree[MAX];
int n, Depth[MAX];
void print(int index){
int i, child;
cout << "node " << index << ": ";
cout << "parent = " << Tree[index].parent << ", ";
cout << "depth = " << Depth[index... | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define INF ((long) 2e18)
#define MOD ((long) (1e9 + 7))
#define umap unordered_map
int main()
{
ios::sync_with_stdio(true); cin.tie(0); cout.tie(0);
long t = 1;
while (t--) {
long n;
cin >> n;
long best = INF;
... | 0 | 42,443,606 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <set>
using namespace std;
int main()
{
multiset<int, greater<int> > n;
multiset<int>::iterator ite;
int a;
for(int i=0; i<5; i++){
cin >> a;
n.insert(a);
}
int i=0;
for(ite=n.begin(); i<5; ite++, i++){
if(i==4){ cout << *ite << endl;}
els... | #include<cstdio>
#include<iostream>
#include<vector>
using namespace std;
int main(void) {
int K;
scanf("%d", &K);
string S;
cin >> S;
if (S.length() <= K) {
cout << S << "\n";
} else {
cout << S.substr(0, K) << "..." << "\n";
}
return 0;
} | 0 | 60,005,069 |
#include <bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define in insert
#define mp make_pair
#define F first
#define S second
#define ppf pop_front
#define pb push_back
#define ppb pop_back
#define pf push_front
#define pii pair <int, int>
#define boost() ios_base::sync_with_stdio(0), cin.tie(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll ans = 0;
if (a >= b - 1) {
ans = k + 1;
} else {
k -= a - 1;
ans = a;
ans += (b - a) * (k / 2);
... | 0 | 4,767,417 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.