code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | #include<iostream>
#include <climits>
#include<vector>
#include<list>
#include<numeric>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long l... | 0 | 96,411,272 |
#include "bits/stdc++.h"
#define all(x) x.begin(), x.end()
#define rep(i,n) for (i64 i = 0; i < (n); ++i)
#define reps(i,s,t) for (i64 i = (s); i <= (t); ++i)
#define repr(i,s,t) for (i64 i = (s); i >= (t); --i)
#define LF '\n'
#ifdef DBG
#define trace(...) _trace(#__VA_ARGS__, __VA_ARGS__);
#else
#def... | #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 | 52,298,077 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, z, w;
scanf("%d %d %d", &n, &z, &w);
vector<int> a(n);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
if (n == 1) {
printf("%d\n", abs(a[0] - w));
return 0;
}
printf("%d\n", max(abs(a[n - 1] - w), abs(a[n - 2] - a[n - 1])));
retu... | #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;
cin >> N;
vector<int> A(N);
rep(i, N){
int a;
cin >> a;
A.at(i) = a - (i + 1);... | 0 | 61,797,709 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double ans = sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));
printf("%0.8f\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define FORN(i, x, y) for (int i = x; i <= y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define scan1(X) scanf("%d", &X)
#define scan2(X, Y) scanf("%d%d", &X, &Y)
#define scan3(X, Y, Z) scanf("%d%d%d", &X, &Y, &Z... | 0 | 20,001,241 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n, a, b;
cin >> n >> a >> b;
if (a > b){
puts("0");
return 0;
}
if (n == 1 && a != b){
puts("0");
return 0;
}
if (a == b){
... | 0 | 25,453,349 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for(long long int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000
#define LLINF 1000000000000000000
#define PI 3.14159265358979
using namespace std;
typedef long long int ll;
typedef pair< long long... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 45,523,189 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <stdio.h>
using namespace std;
const int NOT_LEAP_YEAR = 19*5+20*5;
const int LEAP_YEAR = 20*10;
const int MAX = 100;
int Mill(int Y,int M,int D){
int days;
int quot=(Y-1)/3;
days= LEAP_YEAR*quot + NOT_LEA... | 0 | 33,671,908 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d %d", &a, &b)
#define scan3Int(a, b, c) scanf("%d %d %d", &a, &b, &c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll k, n;
cin>> k >> n;
vector<ll> a(2*n);
vector<ll> dis(n+1);
for(int i=0; i<n; i++){
cin>>a[i];
a[i+n] = a[i]+k;
}
ll ans = 1e18;
for(int i=0; i<n; i++){
ans = min(ans, abs(a[i+n-1] -... | 0 | 90,250,768 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const int mod = 1e9 + 7;
int main()
{
string s;
cin >> s;
int n = s.size();
int a = -1, b = -1;
for (int i = 1; i < n; i++)
{
if (s.at(i - 1) == s.at(i))
{
a = i;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll ... | 0 | 96,529,997 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> s(19);
for (int i = 0; i < 19; i++) {
cin >> s.at(i);
if (s.at(i) == ',') s.at(i) = ' ';
if (i + 1 == 19) {
cout << s.at(i) << endl;
}
else {
cout << s.at(i);
}
}
} | #include <iostream>
#include <vector>
#include <cstdio>
#include <string.h>
#include <algorithm>
using namespace std;
typedef long long ll;
int lcs(string X, string Y){
int x = X.size();
int y = Y.size();
int d[y+1][x+1];
memset(d, 0, sizeof(d));
for(int i = 1; i <= y; i++){
char a = Y[i-1];
for(int j... | 0 | 74,945,836 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <random>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
int bin(int a, int n) {
int res = 1;
while (n) {
if (n & 1) res = 1LL * res * a % MOD;
a = 1LL * a * a % MOD;
n >>= 1;
}
return res;
}
int inv(int x) {
return bin(x, MOD - 2);
}
... | 0 | 96,131,614 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include<cmath>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
stack<int> st;
queue<int> qu;
queue<pair<int,int> > qu2;
priority_queue<int> pq;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rep2(i,n) for(int i=1; i<=(int)(n); i++)
#define mins(x,y) x=min(x,y)
#define maxs(x,y) x=max(x,y)
#... | 0 | 48,102,296 |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include <math.h>
#define M 1046527
#define L 15
char H[M][L];
long long convertToNum(char* str) {
long long result = 0;
int i = 0;
int len = strlen(str);
for (int i = 0; i < len; ++i) {
int j = 0;
switch (str[i]) {
case... | #include <cstdio>
const int MAX = 2000000;
const int VMAX = 10000;
int A[MAX+2], C[VMAX+2];
int
main(int argc, const char *argv[])
{
int n;
scanf("%d", &n);
int *B = new int[n];
for (int i = 0; i < n; ++i) {
scanf("%d", &A[i+1]);
C[A[i+1]]++;
}
for (int i = 1; i <= VMAX; ++i) C[i... | 0 | 72,467,599 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
double a, b, x;
cin >> a >> b >> x;
double s = x / a;
double rad;
if(s >= a * b / 2) {
... | #include<stdio.h>
#include<string.h>
int main(){
char input[11];
scanf("%s",input);
int tanda=0;
int len=strlen(input);
char c[11]={'\0'};
int d=0;
for(int i=0;i<len;i++){
if(input[i]=='0'){
c[d]='0';
d++;
}
else if(input[i]=='1'){
c[d]='1';
d++;
}
else if(input[i]=='B'){
if(d!=0){
d... | 0 | 44,931,858 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define ll long lon... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
int N;
int main(int argc, char* argv[]){
cin.... | 0 | 23,244,995 |
#include "bits/stdc++.h"
using namespace std;
#define long int64_t
struct Solver {
Solver() {
ios::sync_with_stdio( false );
cout << fixed << setprecision( 10 );
}
void solve() {
int N;
string S;
cin >> N >> S;
string l, r;
int a = 0;
int b = 0;
for( int i = 0; i < N; ++i ) {
if( S[i] == '(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll X,Y,Z,K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> C(Z);
vector<ll> D;
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for (int i = 0; i < Y; ... | 0 | 12,790,654 |
#include<string>
#include<iostream>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<list>
using namespace std;
int main(){
int n;
scanf("%d",&n);
list<int> v;
char aa[20];
int i;
for(i=0;i<n;i++){
scanf("%s",aa);
if(aa[0]=='i'){
int a;
scanf("%d",&a);
v.push_front(a);
}
else if(... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | 0 | 41,971,680 |
#ifdef DAIJOBU
#include "/home/v-o_o-v/deb.h"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
using namespace std;
long double eps = 1e-9;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while(t--){
pair<long double, long doubl... | #include<iostream>
#define MAX 99999999;
using namespace std;
int p[102];
int mcm[102][102];
int n;
int min(int x,int y) {
int m = MAX;
int cost = 0;
for (int j = x; j < y; j++) {
cost = mcm[x][j] + mcm[j + 1][y] + p[x-1]*p[j]*p[y];
if (cost < m) {
m = cost;
}
}
return m;
}
int calMcm() {
for (int j = 2;... | 0 | 65,690,558 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n, m;
cin>>n>>m;
ll x;
string s;
map<ll,ll>mp1, mp2;
ll c = 0, p = 0;
for(ll i=0; i<m; i++)
{
cin>>x;
cin>>s;
if(mp2[x] == 0 && s == "WA") mp1[x]++;
if(mp2[x] == 0 && s ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+9;
int a[maxn];
int main()
{
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
while(k--)
{
int b[maxn];
memset(b,0,sizeof(b));
for(int i=1;i<=n;i++)
{
int l = max(1,i-a[i]);
... | 0 | 16,534,814 |
#include<bits/stdc++.h>
using namespace std;
int sum(int x){
int d1,d2,d3,d4,d5;
d1=x%10;
x/=10;
d2=x%10;
x/=10;
d3=x%10;
x/=10;
d4=x%10;
x/=10;
d5=x%10;
return d1+d2+d3+d4+d5;
}
int main(){
int N,a,b;
cin>>N>>a>>b;
int ans=0;
for(int i=0;i<=N;i++){
if(sum(i)>=a&&sum(i)<=b){
ans+... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include <iomanip>
#include<utility>
us... | 0 | 70,058,652 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 1000000000000000000;
i... | #include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
int n, pt = 0, px = 0, py = 0;
cin >> n;
repi(i, n, 0)
{
int x, y, t;
cin >> t >> x >> y;
... | 0 | 44,390,836 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int> p(n),x(m),y(m);
rep(i,n){
cin >> p[i];
p[i]--;
}
vector<int> uf(n);
rep(i,n)uf[i] = INF;
rep(i,m){
cin >> x[i] >> y[i];
x[i]--;y[i]--;... | #include <stdio.h>
#include <string.h>
int main(void){
char card[201];
char f;
int i, ii, iii, m, h, a, o;
for(o = 0; o > -1; o++){
scanf("%s", card);
if(card[0] == '-') return 0;
a = strlen(card) -1;
scanf("%d", &m);
for(i = 0; i < m; i++){
scanf("%d", &h);
for(ii = 0; ii < h; i... | 0 | 17,644,468 |
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == b) cout << "Draw\n";
else if(a == 1) cout << "Alice\n";
else if(b == 1) cout << "Bob\n";
else if(a > b) cout << "Alice\n";
else cout << "Bob\n";
} | #include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
cin>>s;
int n=s.size();
int count=0;
for(int i=0;i<n;i++){
if(s[i]==s[n-1-i]){
count++;
}
}
if(count==n){
int x=(n-1)/2;
for(int i=0;i<x;i++){
if(s[i]==s[x-1-i]){
count++;
}
}
... | 0 | 64,787,378 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YE... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using names... | 0 | 1,288,399 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool check( string s , string t)
{
for( int i=0;i<s.length() ;i++)
{
if( s[i] != t[i] && s[i] != '?' )
return false;
}
return true;
}
int main()
{
string s,t;
cin>>s>>t;
bool found = false;
for( int i=s.l... | #include <bits/stdc++.h>
using namespace std;
vector<int> verdes,vermelhas,incolores,vazio;
vector<vector<int>> DP;
int main(){
int x,y,a,b,c;
cin >> x >> y >> a >> b >> c;
for (int i = 0; i < a; ++i)
{
int val;
cin >> val;
verdes.push_back(val);
}
for (int i = 0; i < b; ++i)
{
int val;
cin >> val;
... | 0 | 65,525,955 |
#include <iostream>
#include <algorithm>
#define MAXN 100
#define WHITE 0
#define BLACK 1
using namespace std;
int D[MAXN][MAXN];
bool judge ( int color, int i, int j)
{
if ( i-1 >= 0 && j-1 >= 0 && D[i-1][j-1] == color ) return false;
if ( i-1 >= 0 && D[i-1][j] == color ) return false;
if ( i-1 >= 0 && j+1 < MAX... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 94,088,472 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <string>
#include <map>
#include <cerrno>
#include <stdio.h>
#include <stdlib.h>
#include <cfenv>
#include <stack>
#include <math.h>
#include <iomanip>
#include <limits>
#include <queue>
#define ll long long int
#define... | #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 | 95,628,330 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stdlib.h>
#include <map>
#include <cmath>
#define MOD_P 1000000007
#define MOD_Q 998244353
#define PI 3.14159265358979
#define ll long long
using namespace std;
int main()
{
int x;
cin >> x;
if (x < 600) {
print... | #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 n;
cin >> n;... | 0 | 56,362,683 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
vector<int> a(N);
for(int i=0;i<N;i++){
cin>>a[i];
}
int b=0;
int c=0;
while(b<N-1){
c++;
b+=K-1;
}
cout<<c<<endl;
return 0;
} | #include<iostream>
#include<string.h>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=0;i<n;i++)
u... | 0 | 70,776,346 |
#include <bits/stdc++.h>
using i64 = long long;
i64 gcd(i64 a, i64 b) { return a ? gcd(b % a, a) : b; }
const int MOD = 1000000007;
i64 pow64(i64 a, i64 b) {
a %= MOD;
i64 result = 1;
while(b) {
if(b & 1) result = result * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return result;
}... | #include <iostream>
#include <string>
using namespace std;
int num[] = {1000, 100, 10, 1};
char chr[] = {'m', 'c', 'x', 'i'};
int frommcxi(string x){
int res = 0, n = 1;
for(int i=0; i<x.size(); i++){
int j;
for(j=0; j<4; j++){
if(x[i] == chr[j]){
res += n*num[j];
... | 0 | 58,982,562 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
if (n >= 400 && n < 600) {
cout << 8;
}
else if (n >= 600 && n < 800) {
cout << 7;
}
else if (n >= 800 && n < 1000) {
cout << 6;
}
else if (n >= 1000 && n < 1200) {
cout << 5;
}
else if (n >= 12... | 0 | 35,280,171 |
#include <bits/stdc++.h>
#define ll long long
#define MAX 500005
using namespace std;
ll n, m, p, v;
ll a[MAX], b[MAX];
int main()
{
cin >> n >> m >> v >> p;
for(ll i = 1; i <= n; ++i){
scanf("%lld", &a[i]);
}
sort(a+1, a+n+1, greater<ll>());
for(ll i = 1; i <= n; ++i){
b[i] = b[i-1]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n;
cin >> n;
vector<ll> a(n+1),b(n);
rep(i,n+1){
cin >> a.at(i);
}
rep(i,n){
cin >> b.at(i);
}
ll ans=0,q=0;
rep(i,n){
if(a.at(i)+a.at(i+1)<=b.at(i)){
... | 0 | 78,929,842 |
#include <iostream>
using namespace std;
int main(){
const int max = 20;
char str[max + 1];
char c;
int count = 0;
while(cin.get(c)){
str[count] = c;
count++;
}
for(int i = 1; i <= count-1; i++)
cout << str[count - i - 1];
cout << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for ... | 0 | 77,042,813 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
while(true){
int N,A,B,C,X;
cin >> N >> A >> B >> C >> X;
if(N==0) break;
vector<int> Y(N);
for(int j=0;j<N;j++) cin >> Y[j];
int ind = 0;
int s=0;
for(int i=0;i<10002;i++){
... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb ... | 0 | 57,236,276 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x) ... | #include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | 0 | 43,025,294 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int n=s.length();
stack<char>s1;
for(int i=0;i<n;i++)
{
if(s[i]=='B')
{
if(!s1.empty())
{
s... | 0 | 45,520,123 |
#include <iostream>
using namespace std;
bool F[1000003] = { false };
int DP[80000] = { 0 };
void prepa_Prime();
int count_Prime(int);
int main() {
int n;
prepa_Prime();
while (cin >> n) {
cout << count_Prime(n) << endl;;
}
return 0;
}
void prepa_Prime() {
int i, c = 2;
F[0] = F[1... | #include <iostream>
#include <string>
using namespace std;
int main() {
int rounds;
cin >> rounds;
int pts_taro = 0, pts_hanako = 0;
for (int r = 0; r < rounds; r++) {
string taro, hanako;
cin >> taro >> hanako;
int compare = taro.compare(hanako);
if (compare == 0) {
... | 0 | 99,941,463 |
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<map>
#define ran(x) (x).begin(),(x).end()
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
vector<int> a(h,0), b(w,0);
for(int i = 0; i < h; ++i) {
cin >> s[i];
int cou = 0;
for(i... | #include<bits/stdc++.h>
#define endl "\n"
#define PI acos(-1)
#define BMW_GTR ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
typedef long long ll;
using namespace std;
int main()
{
BMW_GTR;
string S;
cin >> S;
if(S[0] == 'R' && S[1] == 'R' && S[2] == 'R')
{
cout << 3;
retu... | 0 | 4,112,434 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double x1,x2,x3,y1,y2,y3,xp,yp;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp){
double o1,o2,o3;
o1=(x2-x1)*(yp-y2)-(y2-y1)*(xp-x2);
o2=(x3-x2)*(yp-y3)-(y3-y2)*(xp-x3);
o3=(x1-x3)*(yp-y1)-(y1-y3)*(xp-x1);
if((o1>0 && o2>0 && o3>0)||(o1<0 && o2<0 && o3<0... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define mod 1000000007
using namespace std;
ll binpow(ll x,ll y){ll res=1;while (y > 0){if(y&1)res=(res*x);y = y>>1;x=(x*x);}return res;}
ull binpowmod(ull x,ull y,ull p){ull res=1;x=x%p;while (y > 0){if(y&1)res=(res*x)%p;y = y>>1;x=(x*x)%p;}re... | 0 | 54,135,518 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define SZ(i) int(i.size())
#define eb emplace_back
#define ALL(i) i.begin(),i.end()
#define X first
#define Y second
#ifd... | #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 namespace std;
int main(){
int n;
cin >> n;
vector<int> h(n);
for(int i = 0; i < n; i++)cin >> h[i];
vector<int> dp(100100 , 0);
fo... | 0 | 28,561,127 |
#include "bits/stdc++.h"
using namespace std;
int main() {
using ull = unsigned long long;
ull ans[50];
ull k;
cin >> k;
cout << 50 << endl;
ull j = k / 50;
int i = k % 50;
for (auto &x : ans) {
x = 49 + j;
}
for (int a = 0; a < i; ++a) {
ans[a] += 51;
}
for (auto &x : ans) {
x -= i;... | #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 | 77,879,003 |
#include <bits/stdc++.h>
#include <string>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, a, b;
cin >> n >> a >> b;
int sum=0;
for(int i=1; i<=n; i++) {
string s=to_string(i);
int ibuff=0;
rep... | #include <iostream>
#include <vector>
#include <tuple>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector< vector<int> > wf(N, vector<int>(N, 1000000000));
vector< tuple<int,int,int> > edge;
while(M--) {
int a, b, c;
cin >> a >> b >> c;
--a;
--b;
... | 0 | 95,850,645 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int N;
cin >> N;
map<int, int> mp;
bool is = true;
rep(i, N){
int a;
cin >> a;
if(mp.count(a) != 0){
is = false;
break;
... | 0 | 47,718,361 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n, m, i, ans=0, money=0;
map<string, long long> mpr, mpb;
cin >> n;
for(i=0;i<n;i++){
string s;
cin >> s;
mpb[s]++;
}
cin >> m;
for(i=0;i<m;i++){
string s;
cin >> s;
mpr[s]++;
... | 0 | 74,479,460 |
#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 x;
cin >> x;
if (x < 1200)
cout << "ABC" << endl;
else
cout << "ARC" << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 52,035,590 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
unsigned long long ans=1;
vector<long long> a(n);
for(int i=0;i<n;i++)cin>>a.at(i);
sort(a.begin(),a.end());
if(a[0]==0){
cout<<0<<endl;
return 0;
}
for(int i=0;i<n;i++){
if(ans>(long long)1e18/a[i]){
cout<<-1<<... | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define rep(i, n) for (int i = 0; i < n; i++)
#defin... | 0 | 28,155,274 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define lp(var,start,end) for (ll var = start; var <=end ; ++var)
#define ilp(var,start,end) for(ll var = start; var>=end ; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss seco... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define nl "\n"
#define pb push_back
#define fi first
#define se second
#define PI (acos(-1.0))
#define repp(i,a,n) for(int i=a;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#def... | 0 | 95,877,385 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<cmath>
#include<complex>
using namespace std;
bool isin(double a, double b, double c){
if(a>b) swap(a,b);
if(b-a<M_PI){
return (a<c && c<b);
}
else{
return (b<c || c<a);
}
}
int main(void){
double a, b, c, d, e, f, g, h;
while(cin>>a>>b>>c>>d>>e>>f>>g>>h)... | #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 | 25,007,731 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
char
SwapCase(const char c)
{
if (isupper(c)) {
return tolower(c);
} else if (islower(c)) {
return toupper(c);
}
return c;
}
int
main()
{
ios::sync_with_stdio(false);
string str;
getline(cin, str);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200005;
int n, p, a[N], ps[N];
int mul(int aa, int bb) {
return int(1LL * aa * bb % p);
}
int fexp(int b, int e = p - 2) {
int ans = 1;
while(e) {
if(e & 1) ans = mul(ans, b);
b = mul(b, b);
e /= 2;
}
return ans;
}
int cnt[N];
... | 0 | 19,728,968 |
#include <stdio.h>
#include <string.h>
typedef struct{
long long int prev;
long long int next;
long long int data;
} list;
list L[2000000];
long long int ff = -1,bb = -1;
long long int num = 0,usecnt = -1;
int main(){
int i,j,k;
long long int n;
scanf("%lld",&n);
for(i=0; i<n; i++){
char op[20];
scanf("%s",o... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
int max_x;
cin >> max_x;
rep(i, N - 1){
int x;
cin >> x;
max_x = max(max_x, x);
}
int min_y;... | 0 | 60,051,944 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
const int MAX_N = 15;
const ll INF = 1000100100100100100;
int main()
{
int n, k; cin... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
string S;
cin >> S;
vector<int> count(2,0);
for(int j : {0, 1}){
int target = j;
for(int i=0; i<S.size(); i++){
int val = S[i] - '0';
if(target == val){
co... | 0 | 32,689,590 |
#include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n=s.size();
while(s.size()>0){
s = s.substr(0,s.size()-2);
str... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e18;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int H,W,K;
cin >> H >> W >> K;
vector<string>c(H);
for(int i = 0; i < H; i++) {
cin >> c[i];
}
... | 0 | 11,985,870 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) for(ll i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
ll Div(ll a, ll b){
if(a >= 0) return a / b;
return -((- a - 1)/ b) - 1;
}
int main() {
ll n;
cin >> n;
ll l, t;
cin >> l >> t;
ll BeforeX[100050];
ll AfterX[100... | 0 | 83,095,815 |
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for(int i = (... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < n; i++)
int main() {
ll n,k;
cin >> n >> k;
int p[n];
ll c[n];
rep(i,n) {
cin >> p[i];
p[i]--;
}
rep(i,n) cin >> c[i];
ll ans = -1000000000000;
rep(i,n) {
int now = i;
ll cycle_... | 0 | 63,673,386 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | #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 _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 9,916,531 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <valarray>
#include <algorithm>
#include <time.h>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <random>
int main(void) {
int dice[6] = {};
for (int i = 0; i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int,int>
ll len;
ll fun1(string str,ll prime)
{
ll ans=0;
for(ll i=0;i<len;i++){
if((str[i]- '0')%prime==0) ans+=(i+1);
}
return ans;
}
ll bigmod(ll a,ll pr,ll mod)
{
if(pr==0) return 1ll;
else if(pr==... | 0 | 63,012,343 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int n,d,x;
cin >> n >> ... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
while (true) {
long long n, m;
cin >> n >> m;
if (n == 0)
break;
vector<pair<lon... | 0 | 52,728,693 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e2 + 5, mod = 1e9 + 7;
int main()
{
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
for (int i = 0; i < s.size(); i++)
{
ans1 += s[i] != '0' + i % 2;
ans2 += s[i] == '0' + i % 2;
}
cout << min(ans1... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 18,630,659 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
ll r,D,x2000;
scanf("%lld %lld %lld",&r,&D,&x2000);
ll pre = x2000;
for(int i = 0; i <... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int ans = 0;
n += 1;
bool *p = new bool[n];
fill(p, p + n, true);
p[0] = p[1] = false;
for (int i = 2; i * i < n; i++)
if (p[i] == true)
for (int j = i * i; j < n; j += i)
p[j] = false;
for (int i = 0; i < n; i++... | 0 | 70,262,102 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
string S;
cin >> S;
if(S == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1 << endl;
return 0;
}... | 0 | 14,937,385 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using ll = long long;
#define chmin(i, j) i = min(i, j);
#define chmax(i, j) i = max(i, j);
#define rep(i, n) for(int i=0;i<n;i++)
int main() {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
r... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 12,500,602 |
#include <bits/stdc++.h>
#include <string>
#include <cmath>
using namespace std;
int main()
{
int n;
cin >> n;
int alpha[n]['z' - 'a' + 1];
for (int x = 'a'; x <= 'z'; x++)
{
for (int j = 0; j < n; j++)
{
alpha[j][x - 'a'] = 0;
}
}
for (int i = 0; i < n; i... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | 0 | 46,192,499 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
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;}
int ... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 30,584,721 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;cin>>s;
char c=s[0];
int ans=0;
for(int i=1;i<s.length();++i){
if(s[i]!=c){
ans++;
c=s[i];
}
}
cout<<ans<<endl;
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inline bool chmax... | 0 | 19,987,921 |
#include <iostream>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <queue>
using namespace std;
int N, A, B, C, X;
vector<int> randomnum;
int main(void){
while(true){
cin >> N >> A >> B >> C >> X;
if(N == 0) break;
int i, j = 0;
randomnum.clear();
for(i = 0; i < N; i++){... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n = 3;
int cnt = 0;
cin >> str;
vector<int> vec(4);
for (int i = 0; i < 4; i++) vec.at(i) = str.at(i) - '0';
for (int bit = 0; bit < (1 << n); bit++) {
int calc = vec.at(0);
string str = to_string(vec.... | 0 | 92,827,082 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #include<iostream>
#include<algorithm>
using namespace std;
int dp[1001][1001];
string s,t;
int n,m,a,ans;
int main(){
cin>>a;
for(int k=0;k<a;k++){
cin>>s>>t;
for(int i=0;i<=1000;i++)
for(int j=0;j<=1000;j++)
dp[i][j]=0;
m=s.size();
n=t.size();
ans=0;
for(int i=1;i<=m;i++){
... | 0 | 52,949,373 |
#include <bits/stdc++.h>
#define PI acos(-1.0)
#define eps 1e-9
#define ll long long
#define ull unsigned long long
#define nl printf("\n")
#define sf scanf
#define pf printf
#define INF (ll)1e15
#define mod 1000000007
using namespace std;
const int S=123456;
int main()
{
#ifndef ONLINE_JUDGE
#endif
int n;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=1010010010010010000;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
retur... | 0 | 78,536,168 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n)... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 38,632,086 |
#include <iostream>
#include <set>
int main()
{
int N, K;
std::cin >> N >> K;
std::multiset<int> ps;
for(int i=0; i<N; i++) {
int p;
std::cin >> p;
ps.insert(p);
}
int sum = 0;
int i = 0;
for(auto p: ps) {
sum += p;
i++;
if(i == K) {
break;
}
}
std::cout << sum << s... | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
string S;
ci... | 0 | 62,691,751 |
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
const int BUILDINGS = 4;
const int FLOORS = 3;
const int ROOMS = 10;
int house[BUILDINGS+1][FLOORS+1][ROOMS+1];
string border(20,'#');
int n;
int b, f, r, v;
memset(house, 0, sizeof(house));
cin >> n;
for(in... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define M 200020
using namespace std;
LL read(){
LL nm=0,fh=1; char cw=getchar();
for(;!isdigit(cw);cw=getchar()) if(cw=='-') fh=-fh;
for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
return nm... | 0 | 13,539,506 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N,ans=0;
cin >> N;
vector<ll> A(N),B(N),diff;
ll sum=0;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
cin >> B[i];
if(A[i] >= B[i]) diff.push_back(A[i]-B[i]);
else{
sum += B[i] - A[i]... | 0 | 15,695,651 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
using namespace std;
int a[10]={0,1,2,3,4,5,6,7,8,9};
int n,s;
... | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
int d;
while ( cin >> d )
{
... | 0 | 4,950,436 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int MAX = 2100000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
signed main()
{
int A,B,C,K;
cin>>A>>B>>C>>K;
int ans=0;
if(K>0)
{
ans+=min(K,A);
K -=min(K,A);
}
if(K>0)
{
K -=min(K,B);
}
if(K>0)
{
ans -= min(K,C);
K-= min(K,C);... | 0 | 71,481,212 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
... | 0 | 61,875,109 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<queue>
#include<map>
#include<vector>
#include<cmath>
#include<fstream>
#include <set>
const int MAXN =2e5+10;
const int mod = 1e14 ;
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int inf= 0x3f3f3f3f;
#define eps 1e... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
typedef long long LL;
#define ld long double
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pi... | 0 | 52,218,874 |
#include<bits/stdc++.h>
#define parent(i) i/2
#define left(i) i*2
#define right(i) i*2+1
using namespace std;
int main(){
int h;
scanf("%d",&h);
int heap[h+1];
for(int i=1;i<=h;++i) scanf("%d",&heap[i]);
for(int i=1;i<=h;++i){
printf("node %d: key = %d, ",i,heap[i]);
if(parent(i)>0&&... | #include "bits/stdc++.h"
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a%b);
}
long lcm(long long x, long long y) {
return x / gcd(x, y)*y;
}
int f(int x) {
int res = 0;
while (x % 2 == 0) {
x /= 2;
res++;
}
return res;
}
int main() {
int N, M;
cin... | 0 | 4,920,433 |
#include "bits/stdc++.h"
using namespace std;
#define sp(x) cout<<setprecision(x);
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX*0.99
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define yes "Yes"
#define no "No"
#define divs 100000000... | #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
long long n;
cin>>n;
int a[n];
for (int i=0;i<n;i++){
cin>>a[i];
}
int u=0;
long long ans=0;
int biggest=0;
while(u<n){
biggest=max(a[u],biggest);
int b1=biggest;
ans+=b... | 0 | 65,914,439 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int k, a, b;
cin >> k;
cin >> a... | #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 | 4,306,357 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int temp; vector<int> vec(0);
while (cin >> temp) {
if (temp == 0) {
cout << vec[vec.size() - 1] << endl;
vec.pop_back();
}
else vec.push_back(temp);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 1;
vector<int> g[N];
vector<int> vis(N);
int32_... | 0 | 41,776,889 |
#include <iostream>
#include <cstring>
using namespace std;
int main(){
int h, w, a, b, arr[1005][1005];
memset(arr, 0, sizeof(arr));
cin >> h >> w >> a >> b;
for(int i=1; i<=b; i++){
for(int j=1; j<=a; j++){
arr[i][j]=1;
}
}
for(int i=b+1; i<=h; i++){
for(int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
char pixel_org[H][W];
for(int i=0; i<H; i++)
for(int j=0; j<W; j++)
cin >> pixel_org[i][j];
cout << endl;
for(int i=0; i<H; i++)
{
for(int j=0; j<W; j++)
{
cout ... | 0 | 76,264,610 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin>>s;
for(int i=0;i<s.size();i+=2) {
cout<<s[i];
}
return 0;
} | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int A,B;
cin>>A>>B;
string S;
cin>>S;
bool res=true;
for(int i=0;i<S.size();i++){
if(i==A){
if(isdigit(S[i])!=0){
res=false;
}
}
else{
if(S[i]=='-'){
... | 0 | 53,218,052 |
#include <bits/stdc++.h>
#define INF pow(10, 9) + 7
#define rep(i, N) for(ll i = 0; i < N; i++)
#define rep2(i, j, k) for(ll i = j; i < k; i++)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define chmax(x, y) x = max(x, y)
#define print(x) cout << x << "\n"
#define ALL(v) v.begin(), v.en... | #include <bits/stdc++.h>
#define db(x) cout << (x) << '\n';
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pii;
typedef pair<double,ll> pdi;
typedef pair<ld,ld> pdd;
type... | 0 | 45,461,491 |
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 100070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m... | #include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(ll i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
... | 0 | 45,699,730 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main()
{
int n, a, b, c, x;
while(1){
cin >> n >> ... | 0 | 84,178,708 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N;
string S;
cin >> N >> S;
long long R = 0;
long long G = 0;
long long B = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R'){
R++;
}
else if (S.at(i) == 'G'){
G++;
}
else if (S.at(i) == 'B'){
B++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int t = 0, x = 0, y = 0;
for (int i = 0; i < n; i++) {
int tt, xt, yt;
cin >> tt >> xt >> yt;
int tm = tt - t;
int dist = abs(x - xt) + abs(y - yt);
if (dist > tm) {
puts("No");
retu... | 0 | 12,323,591 |
#include <stdio.h>
int main(void)
{
int a, b, c;
scanf("%d",&a); scanf("%d",&b); scanf("%d",&c);
if(a< b && a< c && b< c)
puts("Yes");
else
puts("No");
return 0;
} | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 0 | 87,555,598 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | #include<iostream>
#include<list>
#include<utility>
#include<algorithm>
using namespace std;
int main() {
list<int> L;
int n;
cin >> n;
pair<string,int> u;
for(int i=0;i<n;i++) {
cin >> u.first;
if (u.first[0] == 'i')
{
cin >> u.second;
L.push_front(u.second);
}
else if (u.first[6] == 'F')
{L.pop_front(... | 0 | 23,469,908 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <climits>
using namespace std;
typedef ... | #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 << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#defin... | 0 | 88,792,814 |
#include<iostream>
#include<map>
#include<string>
using namespace std;
int main()
{
map<string,size_t> word_count;
string word;
while(cin>>word)
++word_count[word];
map<string,size_t>::iterator a,b,c;
a=b=word_count.begin();
for( c=word_count.begin();c!=word_count.end();c++)
{
... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int N; cin >> N;
if(N % 2){
cout << "First" << "\n"; return 0;
}
set<int> S[100010];
int D[100010] = {};
for(int i = 0; i < N-1; i++){
int a, b; cin >> a >> b;
a--; b--;
S[a].insert(b); S[b]... | 0 | 22,796,563 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
int n, a;
cin >> n >> a;
if (n % 500 <= a) cout << "Yes" << '\n';
else cout << "No" << '\n';
}
signed main() {
#ifdef _DEBUG
#endif
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
int main(){
int n;
cin >> n;
string s,t;
cin >> s >> t;
int cnt = 0;
int i = 0;
for(int i = 1; i <= n; i++){
string tmps = s.substr(n-i,i);
string tmpt = t.substr(0,i);
if(t... | 0 | 1,023,556 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
getline(cin,a);
if(a.size()==2 && a[0]==a[1]){
cout<<"1 2"<<endl;
return 0;
}
long long i,flag=0;
for(i=0;i<a.size()-2;i++)
{
if(a[i]==a[i+1] || a[i]==a[i+2] || a[i+1]==a[i+2]){
cout<<i+1<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S>... | 0 | 78,313,170 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
long sumx=0;
long sumy=0;
const int mod=1000000007;
for(int i=0;i<n;i++){
long x;
cin >> x;
sumx=(sumx+x*(-n+2*i+1))%mod;
}
for(int i=0;i<m;i++){
long y;
cin >> y;
sumy=(sumy+y*(-m+2*i+1))%mod;
}... | #include <bits/stdc++.h>
using namespace std;
long long n, a, b;
int main()
{
cin >> n >> a >> b;
if (a+b>n+1 || a*b < n)
{
cout << "-1\n";
return 0;
}
if (a == 1)
{
for (int i=n; i>=1; i--)
{
cout << i << " ";
}
return 0;
}
vec... | 0 | 8,657,596 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,d[110],s=0; cin>>n;
for(int i=0;i<n;i++) cin>>d[i];
for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) s+=d[i]*d[j];
cout<<s;
} | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retur... | 0 | 76,110,423 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
int main()
{
string s;
cin >> s ;
bool ans = false;
if(s.at(0) == s.at(1) && s.at(2) == s.at(3) && s.at(0) != s.at(2)) ans = true;
if(s.at(0) == s.at(2) && s.at(1) == s.at(3) && s.at(0) != s.at(1)) ans = true;
if(s.at(0) == s.at(3) && s.at(1... | #include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#defi... | 0 | 21,779,484 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
# define M_PI 3.14159265358979323846
const int MOD=1e9+7;
void solve(){
int n,k;
cin>>n>>k;
vector<int>a(n+1);
for(int i=1;i<=n;i++)
cin>>a[i];
int dp[n+1][k+1];... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
map<ll, ll> primes;
void primefactorize(ll n)
{
wh... | 0 | 82,294,028 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <map>
#include <cctype>
#include <string>
#include <cstdlib>
#include <math.h>
using namespace std;
int main()
{
cout << setprecision(6);
cout << setiosflags(ios::sc... | #include <bits/stdc++.h>
#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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 20,288,717 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll k, a, b; cin >> k >> a >> b;
ll ans=1;
if(2<b-a && 2<=k-(a-1)){
k -= a-1;
ans += k/2*(b-a) + k%2 + a-1;
}else{
ans += k;
}
cout << ans << endl;
} | #include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
int a[10],b[111];
int main()
{
int s=0;
for(int i=1;i<=3;i++)
{
cin>>a[i];
b[a[i]]++;
}
for(int i=0;i<=111;i++)
{
if(b[i]>0)
{
... | 0 | 804,009 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
double n, k;
cin >> n >> k;
double cnt = 1 / n, half = 1, ans = 0;
while(n > 0) {
if(n >= k) {
ans += cnt * half;
n--;
... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
}
int kan_hyaku(int n){
... | 0 | 64,506,075 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
#define ll long long
using namespace std;
int main() {
int n; cin>>n;
vector<int> A(n);
rep(i, n) cin>>A[i];
ll ans=0;
int right=0;
int X=0;
for (int left=0; left<n; left++) {
while ((right<n)&&((X+A[right])==(X^A[right]))) {
X+=A... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
string S;
cin >> S;
S += ".";
vector<pa... | 0 | 73,964,700 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#include <vector>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
int h, w;
... | #include <iostream>
#include<iomanip>
#include <map>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <queue>
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
#define NO cout<<"NO"<<endl;
#define YES cout<< "YES"<<endl;
#define No cout<< "No"<<endl;
#define Yes cout<< "Yes"<<en... | 0 | 33,156,751 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.