code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <cassert>
#include <limits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <array>
#include <map>
#include <set>
#include <deque>
#include <list>
#include <sstream>
#include <iomanip>
#include <numeric>
#i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#define all(v) (v).begin(),(v)... | 0 | 49,998,896 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <functional>
#include <iomanip>
#include <bitset>
#include <numeric>
#include <queue>
#include <map>
#include <cstdint>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 0 | 92,624,322 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | #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... | 0 | 83,303,702 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char const* argv[]) {
int A, B, C, D;
scanf("%d %d %d %d", &A, &B, &C, &D);
if (A + B > C + D) printf("Left\n");
else if (A + B < C + D) printf("Right\n");
else printf("Balanced\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
vector<ll>pos[21];
ll inp[100];
map<ll,ll>mp;
vector<ll>points;
vector<ll>::iterator upper1, upper2;
int main()
{
ll i,j,k,l,t,n,x=0,y=0,p,q,z=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>p;
points.push_back(p);
}
for(i=0;i<n;i+... | 0 | 70,513,041 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,j,n) for(int i=j;i<=n;i++)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin>>a>>b;
if(a%500<=b)
cout<<"Yes";
else
cout<<"No";
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
int main() {
int n; cin >> n;
V<ll> a(n), b(n);
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) cin >> b... | 0 | 70,046,040 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> price(N);
for (int i = 0; i < N; i++) {
cin >> price.at(i);
}
sort(price.begin(), price.end());
int sum = 0;
for (int i = 0; i < M; i++) {
sum += price.at(i);
}
cout << sum << endl;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned long long
#define rep(i,n,N) for(ll i=n;i<=N;++i)
#define rap(i,n,N) for(ll i=n;i>=N;--i)
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se s... | 0 | 51,747,435 |
#include<bits/stdc++.h>
using namespace std;
const int N=100100;
vector<int>g[N];
int n;
int dfs(int x,int fa=-1){
int ret=0;
for(int i:g[x])if(i!=fa){
ret+=dfs(i,x);
if(ret==2){
cout<<"First\n";
exit(0);
}
}
return !ret;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define endl "\n"
#define pb push_back
#define mod 1000000007
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
int dx8[]={1,-1,0,0,1,1,-1,-1};
int dy8[]={0,0,1,-1,1,-1,1,-1};
ll binexp(ll a, ll b, ll m... | 0 | 64,617,740 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
template <class T, class F>
T UpperBound(T i0, T i1, F f) {
while (i0 < i1) {
T i = i0 + (i1 - i0) / 2;
if (f(i)) i0 = i + 1; ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.... | 0 | 65,909,640 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll A[N],B[N];
for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
vector<P> Q;
for (int i = 0; i < N; i++) {
Q.push_back(make_pair(A[i]+B[i],i));
}
sort(Q.begi... | #include <iostream>
#include <climits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <deque>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
#define DEBUG false
using namespace std;
const int MAX = 100001;
const int MOD = ... | 0 | 88,522,955 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdlib.h>
#include <cmath>
#include <numeric>
#include <functional>
#include <stack>
#include <iomanip>
#include <map>
#include <cstdio>
int main() {
long long n;
std::cin >> n;
std::vector<std::pair<std::string, long long> > v(n)... | #include<bits/stdc++.h>
#define ll long long int
#define db long double
#define mp make_pair
#define F first
#define S second
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
#define Nmax 1000005
#define INF 1000000000
#define MOD 1000000007
#define MAXN 1000005
using names... | 0 | 34,077,890 |
#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 Graph = vector<vector<int>>;
using P = pair<int, int>;
const int INF = 1001;
int main()
{
string s;
cin >> s;
int mini = INF;
rep(i, s.size() - 2) {... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base :: sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<pair<string, int>> songs(n);
for(int i = 0; i < n; i++){
cin >> songs[i].first >> songs[i].second;
}
reverse(songs.begin(), songs.end());
string x; cin >> x;
... | 0 | 50,632,282 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<bool> stairs(n+1, true);
for (size_t i = 0; i < m; i++) {
int a;
cin >> a;
stairs[a] = false;
}
vector<long long> dp(n+1);
dp[0] = 1;
for (size_t... | 0 | 74,568,365 |
#include<iostream>
#include<map>
#include<algorithm>
using namespace std;
pair<int,int> road[10000];
int main() {
int N,M,d,p;
while(cin>>N>>M, N|M) {
for(int i=0; i<N; ++i) {
cin>>d>>p;
road[i] = pair<int,int>(p,d);
}
sort(road,road+N);
int ans = 0;
for(int i=N-1; i>=0; --i) {
if(M... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> mp;
while (m--) {
int a, b;
cin >> a;
cin >> b;
mp[a]++;
mp[b]++;
}
for (auto &x :mp) {
if ((x.second) % 2 != 0) {
cout << "NO" << endl;
... | 0 | 74,191,333 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
long a, b, k;
cin >> a >> b >> k;
if(a < k) {
b = max(b-(k-a), 0L);
a = 0;
} else {
a = a - k;
}
cout << a << " " << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 13,637,479 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; ty... | #include <iostream>
#define oo 0x7fffff
namespace MyNameIsLzz {
int N, M, X;
int map[15][15];
int C[15];
int val[15];
int ans = oo;
void dfs(int cur, int sum) {
if (cur == N) {
for (int i = 0; i < M; i++)
if (val[i] < X)
return;
... | 0 | 39,488,550 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int input;
cin >> input;
int D = input%10;
int C = (input%100 - D)/10;
int B = (input%1000 - C*10 - D)/100;
int A = (input - B*100 - C*10 -D)/1000;
bool is_seven = false;
int op1, op2, op3;
for(int i=0; i<pow(2,3);i++){
... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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) { ... | 0 | 5,842,507 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w,'*'));
rep(i,h) rep(j,w) cin >> a[i][j];
rep(i,h) {
bool flag = true;
rep(j,w) if (a[i][j] == '#') flag = false;
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 | 45,521,372 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){return b!=0?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
int main(){
ll n,t;
cin>>n>>t;
vector<ll> ti(n);
rep(i,n) cin>>ti[i];
... | #define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dpr(x) cerr<<#x<<": "<<x<<endl;
#define dprc(c) do{cerr<<#c<<":";for(auto&_i:(c)){cerr<<" "<<_i;}cerr<<endl;}while(0)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int INF = 1e9+7;
#define al... | 0 | 43,495,573 |
#include <iostream>
using namespace std;
int main(){
int n, b, f, r, v;
cin >> n;
int a[4][3][10];
for(int h=0; h<4; h++){
for(int i=0; i<3; i++){
for(int j=0; j<10; j++){
a[h][i][j] = 0;
}
}
}
for(int i=0; i<n; i++){
cin >> b >> f >> r >>v;
b -= 1; f -= 1;r -= 1;
a[b... | #include<bits/stdc++.h>
using namespace std;
int find_par(vector<int> &par, int ver){
if(par[ver] == ver)return ver;
return par[ver] = find_par(par,par[ver]);
}
void make(vector<int> &par,int x,int y){
int px = find_par(par, x);
int py = find_par(par, y);
par[px] = py;
}
int main(){
int n,m;
... | 0 | 55,652,103 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll x,t;cin >>x>>t;
x-=t;
cout <<max(x,0LL)<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
string s;
int k;
ll dp[200][4][2];
ll f(int i,int cnt,bool b)
{
if (i==(int)s.length())
return(cnt==k);
if (dp[i][cnt][b]!=-1)
ret... | 0 | 99,690,369 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()0
#define e() end()
#define all(x) x.begin(), x... | #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 << " = " <... | 0 | 94,264,913 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl... | 0 | 6,841,031 |
#include <iostream>
using namespace std;
constexpr int infty = 1000000000;
int main() {
int N, K, S;
cin >> N >> K >> S;
if (S < infty) {
for (int i = 0; i != N; ++i) {
cout << (i ? " " : "") << S+(i>=K);
}
} else {
for (int i = 0; i != N; ++i) {
cout << (i ? " " : "") << (i<K ? S : 1);
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
set<int> s;
int n;
cin >> n;
int a;
cin >> a;
s.insert(a);
rep(i,n-1){
cin >> a;
if(s.find(a) != s.end()){
cout<< "NO"<<endl;
return... | 0 | 56,344,966 |
#include <iostream>
int ans;
int count(int change)
{
if(!change)
return 0;
if(change >= 500){
ans += change / 500;
count(change % 500);
}
else if(change >= 100){
ans += change / 100;
count(change % 100);
}
else if(change >= 50){
ans += change / 50;
count(change % 50);
}
else if(change >= 10){
an... | #pragma GCC optimize ("O3")
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <list>
using namespace std;
using ... | 0 | 43,437,021 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int ara[n+5];
for(int i=0;i<n;i++)cin>>ara[i];
sort(ara,ara+n);
reverse(ara,ara+n);
int sum=0;
for(int i=0;i<k;i++)sum+=ara[i];
cout<<sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define VV(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | 0 | 19,482,754 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int size = 101;
vector<int> numbers(size, 0);
vector<int> result;
for (int n; cin >> n;)
numbers[n]++;
int max = 0;
for (int i = 0; i < size; i++)
if (numbers[i] == max)
result.push_back(i);
... | #include <iostream>
#include <string>
#include <array>
using namespace std;
struct Dice
{
array<int, 6> roll;
void toNorth()
{
array<int, 6> t = roll;
roll[4] = t[0];
roll[0] = t[1];
roll[5] = t[4];
roll[1] = t[5];
}
void toSouth()
{
array<int, 6> ... | 0 | 7,066,384 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int mod=1e9+7;
int fac[100005];
int modInverse(int a, int m)
{
int m0 = m;
int y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
int q = a / m;
int t = m;
m = a % m, a = t;
t = y;
y ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll ... | 0 | 20,675,758 |
#include <bits/stdc++.h>
using namespace std;
#define fore(i, a, b) for (int i = a, to = b; i < to; i++)
#define foref(i, a, b) for (int i = b - 1, to = a; i >= to; i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define SZ(v) (int)v.size()
#define pb push_back
typedef long long Long;
typede... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int m , n_min , n_max;
int P[200];
while(true){
int ans, max_gap = 0;
cin >> m >> n_min >> n_max;
if(m == 0 && n_min == 0 && n_max == 0) break;
for(int i = 0 ; i < m ; i++) cin >> P[i];
for(int i = n_min - 1 ; i < n_max ; i++){
... | 0 | 50,377,396 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A = 0, W = 0;
cin >> N >> M;
vector<int> a(N, 0), b(N, 0);
for(int i = 0;i < M;i++) {
int p;
string s;
cin >> p >> s;
if(a[p-1] == 0) {
if(s == "AC") {
a[p-1] = 1;
A++;
} else {
b[p-1]++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
vector<int>vec(N);
vector<int>vec2(N);
for(int i=0;i<N;i++){
cin >> vec.at(i);
vec2.at(i)=vec.at(i);
}
sort(vec2.begin(),vec2.end());
reverse(vec2.begin(),vec2.end());
for(int i=0;i<N;i++){
... | 0 | 94,588,598 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
string s;
cin >> s;
set<char> d;... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
const long long INF=1e18;
int main(){
int v,e;
cin >> v >> e;
vector<vector<long long> > dif(101,vector<long long>(101,INF));
for(int i = 0; i < v; i++) dif[i][i] = 0;
for(int i = 0; i < e; i++){
int a,... | 0 | 23,699,875 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
vector <ll> primes;
ll divi[1000005];
vector <ll> fact;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i,j,k,l,m,n,t;
cin >> n;
if(n == 1)
{
cout << 0 << '\n';
return 0;
}
for(i=2;i<1000005;i++)
{
for(j=i+i;j<1000005... | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 0 | 64,233,894 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cmath>
#include<cstdlib>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
typedef long long LL;
typedef pair<int,int> PII;
#define X first
#define Y second
inline int read()
{
int x=0,f=1;char c=getchar();
while(!isdigit... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 20,219,122 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <stack>
#define rep(x,to) for(x=0;x<to;x++)
#define rep2(x,from,to) for(x=from;x<to;x++)
using namespace std;
int main(void){
stack<int> stk;
int ww;
while(cin >> ww){
if(ww != 0){
stk.push(ww);
}else{
cout << stk.top() <<... | #include<bits/stdc++.h>
#define REP(i,x) for(int i=0,i##_len=(x);i<i##_len;++i)
#define rep(i,a,b) for(int i=(a),i##_len(b);i<i##_len;++i)
#define All(x) begin(x),end(x)
#define rAll(x) rbegin(x),rend(x)
using namespace std;
using ll = long long;
int main(){
ll n,m,d;cin>>n>>m>>d;
ll ans=0;
if(d<=n){
... | 0 | 26,904,191 |
#include<stdio.h>
int main(void) {
int n, a[100][100] = {0}, u, k, v, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%d", &u);
scanf("%d", &k);
for (j = 0; j < k; j++)
{
scanf("%d", &v);
a[u - 1][v - 1] = 1;
}
}
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
printf("%d", a[i]... | #include<stdio.h>
int main()
{
int a[55];
int n,k;
for(int i = 0 ; i <= 55 ; i ++ )
{
a[i] = i;
}
scanf("%d%d",&n,&k);
int sum = 0;
int p = 1;
int t = 0;
while(p <= n)
{
p ++ ;
t ++ ;
if(t == k)
{
sum ++ ;
t = 0;... | 0 | 72,499,858 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int A, B, X;
cin >> A >> B >> X;
... | #include<iostream>
#include <cstring>
using namespace std;
int r[105];
int c[105];
int cache[105][105];
int f(int a, int b) {
if (a == b) return 0;
if (cache[a][b] == -1) {
cache[a][b] = 2000000000;
for (int i = a; i < b; i++) {
int res = f(a, i) + f(i + 1, b) + r[a] * c[i] * c[b];
... | 0 | 88,133,337 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (... | 0 | 77,834,407 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int S, W;
cin >> S >> W;
cout << ((W >= S) ? "unsafe" : "safe") << "\n";
} | #include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
... | 0 | 92,566,905 |
#include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a), i##_END_ = (b); i <= i##_END_; i++)
#define DNF(i, a, b) for (int i = (a), i##_END_ = (b); i >= i##_END_; i--)
template <typename Tp> void in(Tp &x) {
char ch = getchar(), f = 1; x = 0;
while (ch != '-' && (ch < '0' || ch > '9')) ch... | #include <iostream>
#include <vector>
#include <deque>
#include <math.h>
#include <set>
#include <iomanip>
#include <time.h>
#include <list>
#include <stdio.h>
#include <queue>
#include <map>
#include <algorithm>
#include <assert.h>
#include <memory.h>
#define mk make_pair
#define sc second
#define fr first
#define pb ... | 0 | 34,786,682 |
#include <stdio.h>
#include <string.h>
int main(void) {
char str[1001], p[1001], state[10];
int a, b, q;
scanf("%s\n%d", str, &q);
for (int i = 1; i <= q; i++) {
scanf("%s", state);
if (strcmp(state, "replace") == 0) {
scanf("%d %d %s", &a, &b, p);
for (int j = 0; j < b - a + 1; j++) {
str[a + j] = p[... | #include<iostream>
using namespace std;
typedef long long ll;
int N;
ll a[50];
ll K;
int main() {
cin >> N;
for (int i = 0; i < N; i++)cin >> a[i];
while (true) {
bool update = false;
ll total = 0, dec[50] = {};
for (int i = 0; i < N; i++) {
total += (a[i] / N);
dec[i] = (a[i] / N);
if (a[i] / N != 0)... | 0 | 36,821,874 |
#include <iostream>
using namespace std;
int main(int argc, char** argv) {
int x = 0;
int i = 1;
while (cin >> x, x) {
cout << "Case " << i << ": " << x << endl;
i++;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pb push_back
#define mk make_pair
typedef long long ll;
typedef long double ld;
ll f(ll n){
ll res = n - n % 4;
for(ll m = res + 1; m <= n; m++){
res ^= m;
}
return res;
}
void... | 0 | 98,278,538 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 26,050,140 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n-1; i >= 0; i -= 2) {
cout << a[i] << " ";
}
if (n % 2) {
for (int i = 1; i < n; i += 2) {
cout << a[i] << " ";
}
} else {
f... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX=1e5+5;
int ara[MX];
int main(){
int i, j, k;
int n, l;
cin >> n >> l;
for(i=0; i<n; ++i){
cin >> ara[i];
}
for(i=0; i+1<n; ++i){
if(ara[i]+ara[i+1]>=l) break;
}
if(i>=n-1){
... | 0 | 95,100,394 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
ll odd(ll x){ return (x+1)/2 % 2;}
ll cal(ll x){
if(x%2==1) return odd(x);
else return odd(x+1) ^ (x+1);
}
int main() {
... | #include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <numeric>
#include <vector>
#include <iterator>
#include <set>
#include <map>
using namespace std;
const double PI=acos(-1);
int main(){
long n;
cin >> n;
vector<long> l(n);
for(int ... | 0 | 7,747,957 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long n,ans=0,r[4001]={},g[4001]={},b[4001]={};;
string s;
cin >> n >> s;
rep(i,n){
if(s[i]=='R') r[i+1] = r[i] + 1;
else r[i+1] = r[i];
if(s[i]=='G') g[i+1] = g[i] + 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 48,333,439 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
for(int i = 0; 7*i<=n; i++){
if((n - 7*i)%4==0){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 998244353
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--... | 0 | 3,655,730 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | #include<bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define MP make_pair
const ll MOD = 1e9+7;
ll INF = 1e18;
void chmin(ll &a,ll b){if(a>b)a=b;}
void chmax(ll &a,ll b){if(a<b)a=b;}
... | 0 | 44,934,179 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,k;
cin >> n >> k;
long long mod=1000000007;
long long ans=0;
long long a[n+2];
a[0]=0;
for(long long i=1;i<=n+1;i++){
a[i]=a[i-1]+i-1;
}
for(long long i=k;i<=n+1;i++){
ans+=(((a[n+1]-a[n-i+1])-(a[i]-a[0])+1)%mod);
ans=ans%mod;
}
cou... | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | 0 | 19,242,878 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | #include <bits/stdc++.h>
using namespace std;
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 55,642,027 |
#include <iostream>
#include <cstring>
#include <cmath>
#define Rep(i, b, e)\
for (int i = (int)b; i < (int)e; i++)
using namespace std;
const int MAXN = 999999;
bool isPrime[MAXN];
int countPrime(int n) {
memset(isPrime, true, sizeof isPrime);
Rep(i, 0, 1000)
isPrime[i] = true;
isPrime[0] = fal... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(... | 0 | 47,658,745 |
#include <stdio.h>
int main() {
int hoge = 0, ahoge = 0;
scanf("%d %d", &hoge, &ahoge);
printf("a %s b\n", hoge < ahoge ? "<" : hoge == ahoge ? "==" : ">");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(n);
int sum=0;
for(int i=0; i<n; i++){
cin >> a[i];
... | 0 | 41,817,905 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string str;
string str2;
int n,s,s2;
int cou[1024][1024] = {{}};
int max = 0;
cin >> n;
for(int i = 0;i < n;i++){
cin >> str >> str2;
str = ' ' + str;
str2 = ' ' + str2;
s = str.size();
s2 = str2.size();
for(int... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | 0 | 3,521,070 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9+7;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vector<ll> arr(n+1, 0);
arr[0] = 0;
arr[1] = 1;
for (int i = 2; i <= n; i++) {
arr[i] = (arr[i-1] + i) % mod;
}
for (int i = k; i <= n; i++) {
... | 0 | 91,818,511 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 0 | 97,337,808 |
#include<iostream>
#include<cmath>
#include<iomanip>
int main(){
int a, b, C;
std::cin >> a >> b >> C;
std::cout << std::fixed << std::setprecision(8) << a*b*sin(C*M_PI/180)/2 << std::endl;
std::cout << std::fixed << std::setprecision(8) << a+b+sqrt(pow(a,2)+pow(b,2)-2*a*b*cos(C*M_PI/180)) << std::endl;
std::... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A,B,C,a,b,c,K;
cin >> A >> B>>C>>K;
for(int i=0;i<=K;i++)
for(int j=0;j<=K-i;j++)
for(int s=0;s<=K-i-j;s++){
a = (i==0)? A : A*pow(2.0,(double)i);
b = (j==0)? B : B*pow(2.0,(double)j);
c = (s==0)? C : C*pow(2.0,(doubl... | 0 | 56,481,439 |
#include <iostream>
using namespace std;
int a,b;
int main()
{
cin >> a;
cin >> b;
const char* gg = ((a * b) % 2 == 0) ? "Even" : "Odd";
cout << gg;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
const ll mo = 1000000007;
const ll INF = 1 << 30;
double ans = 0;
int main()
{
ll n;
cin >> n;
ll t[n] = {};
ll v[n] = {};
double co[50010]={};
doubl... | 0 | 27,520,299 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
const int MAX = 200;
const int MOD = 1000000007;
ll fact[MAX], inv_fact[MAX], inv[MAX];
void init() {
fact[0... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | 0 | 52,309,562 |
#include<bits
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
string s;
cin >> s;
int ans = 0;
int l = 0,r = s.size() - 1;
while(l < r)
{
if(s[l] == s[r])
{
l++;
r--;
}
else if(s[l] == 'x')
... | 0 | 89,929,029 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(n) for(int i=0;i<n;i++)
#define ms(x) memset(x,0,sizeof(x))
#define ms2d(x,m... | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | 0 | 52,001,461 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define MAX 510000
#define INF 1<<30
#define LINF (ll)1<<62
#define rep(i,n) for(ll i=0; i<(n); i+... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> T(N);
rep(i, N) { cin >> T[i]; }
vector<int> A(N);
rep(i, N) { cin >> A[i]; }
int Tpeak;
int prev = 0;
vector<bool> Lo... | 0 | 69,056,955 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
const ll T = 1e9+7;
int main(){
vector<ll> t(4);
ll w[4][4]={};
ll a,b;
for(int i=0;i<3;i++){
cin >> a >> b;
if(w[a-1][b-1]!=0||w[b-1][a-1]!=0){
... | 0 | 58,743,676 |
#include <iostream>
using namespace std;
int main() {
string S,T;
int N,syutsuryoku;
cin >> S;
cin >> T;
N = S.size();
for (int i=0;i<(N-1);i++) {
if (S.at(i) != T.at(i)) {
syutsuryoku++;
}
}
if (syutsuryoku != 0) cout << syutsuryoku+1 << endl;
else cout << syutsuryok... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
using ll =unsigned long long;
using dl = long double;
const ll m=1000000007;
ll fac[1000001];
void pre(){
fac[0]=fac[1]=1;
for(int i=2;i<=1000001;i++)
{
fac[i]=(fac[i-1]*1LL*i)%m;
}
}
ll power(ll a,ll n){
ll res=1;
while(n){
if(n%2... | 0 | 100,792,199 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, p, q;
cin >> a >> b;
for(int i = 0; i < a; i++){
bool r = 0;
for(int j = 0; j < b; j++){
string s;
cin >> s;
if(s == "snuke"){
p = i + 1;
q = j;
r = 1;
break;
}
}
if(r)
... | 0 | 49,015,040 |
#include<bits/stdc++.h>
#define ll long long int
#define l(i,a,b) for(ll i=a;i<b;i++)
#define PI 3.14159265358979323846
using namespace std;
int main(){
ll n,m,sum=0;
cin>>n>>m;
ll a[m];
l(i,0,m) cin>>a[i],sum+=a[i];
if(sum>n) cout<<-1<<"\n";
else{
cout<<n-sum<<"\n";
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template < class T > using Tree = tree < T , null_type , less < T > , rb_tree_tag , tree_order_statistics_node_update >;
typedef long long ll;
typedef long d... | 0 | 88,179,940 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define SIZE 1000001
#define pib pair<int,bool>
using namespace std;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n; cin>>n;
vector<int> num(n);
for(int i=0;i<n;i++){
cin>>num[i];
}
sort(num.begin(), num.end());
vec... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 0 | 15,198,732 |
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
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() {
string s;
cin >> s;
int ans = INF;
repi(i, s.size() - 2, 0) {
int num =... | #include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
int main(){
double a, b ,C;
cin >>a >> b >>C;
double C_r = C * M_PI /180;
double c = pow( (pow(a,2)+pow(b,2)-(2.0*a*b*cos(C_r))),0.5);
double S = (a * b * sin(C_r)) /2;
double L = a + b + c;
... | 0 | 57,239,653 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int Min(int a,int b,int c){
return min(a,min(b,c));
}
int main(){
string X,Y;
cin>>X>>Y;
vector<vector<int> > v(X.size()+1,vector<int>(Y.size()+1,0));
for(int i=0;i<=X.size();i++) v[i][0]=i;
for(int i=0;i<=Y.size();i++) v[0][i]=i;
f... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
string s; cin>>s;
ll K; cin>>K;
if(s.size()==1){
... | 0 | 64,534,592 |
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<string.h>
#include<string>
#include<functional>
#include<iomanip>
using namespace std;
#define INF 1<<21
#define DIV 1000000007
int main() {
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax, (m || nmin || nmax)) {
int p[10005];
int ... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define ... | 0 | 20,753,423 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define PB push_back
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define NMAX (int)(1e3+5)
#define INF 0x3f3f3f
#define MOD (int)... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | 0 | 41,762,809 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
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 int INF=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main(void){
int n,q;
cin >> n >> q;
int a[n+1],b[n+1];
int p[q],x[q];
vector<vector<int>> s(n+1);
vector<bool> seen;
vector<int> num(n+1,0);
seen.assign(n+1,false);
for(int i = 1... | 0 | 48,614,968 |
#include <iostream>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
long long res=0;
for(int i=0;i<=N;i++){
int tmp=i, sum=0;
while(1){
sum+=tmp%10;
if(tmp/10 == 0) break;
else tmp/=10;
}
if(A<=sum && sum<=B) res+=i;
}
co... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 0 | 39,871,683 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
long double sum=0;
int n;
cin >> n;
rep(i,n){
long double x;
string s;
cin >> x >> s;
if(s=="JPY"){
sum += x;
}
else{
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
ll N, M;
vector<ll> p, x, y;
class UnionFind {
public:
vector<int> Parent;
UnionFind(int N) {
Parent = vector<int>(N, -1);
}
int root(int A) {
... | 0 | 64,633,594 |
#include <iostream>
#include<string>
#include<map>
#include<vector>
using namespace std;
int main()
{
map<char, char>m;
string s, t;
cin >> s ;
cin >> t;
vector<int>start(26, -1);
vector<int>goal(26, -1);
bool ok = true;
for (int i = 0; i < s.size(); i++) {
int a = s[i] - 'a';
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc084_c.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cou... | 0 | 75,617,527 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
int n,l,t,k,cnt,w[N];
int main()
{
scanf("%d%d%d",&n,&l,&t);
for(int i=1;i<=n;i++) {scanf("%d%d",&w[i],&k),w[i]+=(k==1)?t:-t,cnt+=w[i]/l; if(w[i]%l<0) cnt--; ((w[i]%=l)+=l)%=l;}
sort(w+1,w+n+1),((cnt%=n)+=n)%=n; for(int i=cnt+1;i<=n;i++) printf... | #include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define DEBUG
#define fi first
#defin... | 0 | 93,510,798 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll R[400009];
string s;
cin >> s;
ll n = s.size();
map<char, int>mp;
for (int i = 0; i < n; i++) {
mp[s[i]]++;
}
ll ans = n*(n-1)/2;
for (auto& p : mp) {
ll v = p.second;
ans -= v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
int main() {
int A, B;
cin >> A >> B;
vector<vector<char>> G(100, vector<char>(100));
for (int i = 0; i... | 0 | 13,658,909 |
#include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
int main()
{
int n,x;
scanf("%d%d",&n,&x);
if (x<=(500*n))
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include<iostream>
using namespace std;
class Cube{
public:
int f[6];
Cube(){}
void roll_z(){ roll(1, 2, 4, 3);}
void roll_y(){ roll(0, 2, 5, 3);}
void roll_x(){ roll(0, 1, 5, 4);}
void roll(int i, int j, int k, int l){
int t = f[i]; f[i] = f[j]; f[j] = f[k]; f[k] = f[l]; f[l] = t;
}
void move(ch... | 0 | 92,853,877 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed io... | #include <stdio.h>
int main (){
int a,b,c;
scanf ("%d", &a);
scanf ("%d", &b);
if (a == 1 && b == 2 || a == 2 && b == 1){
printf ("3");
}
else if (a == 1 && b == 3 || a == 3 && b == 1){
printf ("2");
}
else if(a == 2 && b == 3 || a == 3 && b == 2){
printf ("1");
}
return 0;
} | 0 | 27,378,848 |
#include <iostream>
#include <utility>
int selectionSort(int A[], int N){
int ans = 0;
for(int i = 0; i < N; i++){
int minj = i;
for(int j = i; j < N; j++){
if(A[j] < A[minj]){
minj = j;
}
}
if(minj != i){
std::swap(A[minj], A[i]);
ans++;
}
}
for(int i = 0; i < N; i++){
if(i) std::cout <... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
int H,W;
cin >> H >> W;
vector<vector<int>> left(H, vector<int>(W,0));
vector<vector<int>> right(H, vector<int>(W,0));
vector<vector<int>> up(H,... | 0 | 11,821,293 |
#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;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#def... | 0 | 38,440,370 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll,ll> P;
const ll MOD = 1e9;
int main(){
ll n;
cin>>n;
if(n==1){
cout<<"Yes"<<endl;
cout<<2<<endl;
cout<<1<<" "<<1<<endl;
cout<<1<<" "<<1<<endl;
return 0;
}
ll f=0;
ll k;
for(int i=0;i<n;i++){
if(i*(i+1)==n*2){
f=1;
... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 87,357,952 |
#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<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | #include<bits/stdc++.h>
using namespace std;
typedef string STR;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef priority_queue<int> PQI;
typedef vector... | 0 | 47,172,311 |
#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
#define PI 3.141592653589
int main(){
int n, a, b, c, d;
char ss;
while(1){
cin >> a >> b >> c;
if(a == -1 && b == -1 && c == -1)break;
if(a == -1 || b == -1){
a = 0;
b = 0;
}
if(80 <= a + b)ss = 'A';
else if(65 <= a +... | #include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | 0 | 32,011,485 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin >> n;
long long int ans=0;
long long five=10;
if(n%2==1) cout << 0 << endl;
else{
while(1){
if(five>n) break;
ans+=n/five;
five*=5;
}
cout << ans << endl;
... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define foo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_ba... | 0 | 32,703,289 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
vector<int> cnt(26);
int ans = 0;
rep(i, 4) {
int t;
t = s[i]-'A';
if (cnt[t] == 1) {
ans++;
}
cnt[t]++;
}
... | #include <bits/stdc++.h>
using namespace std ;
const int MAX = 1e4 + 5 ;
int cost[] = {2,5,5,4,5,6,3,7,6} ;
int can[MAX], dig[MAX] , arr[12];
int m ;
void solve(int n)
{
if(n == 0)
return ;
for(int i = m-1 ; i >= 0 ; --i)
{
if(n-cost[arr[i]-1] < 0)
continue ;
if(can[n-cost[arr[i]-1]] && dig[n] == dig[n-cost... | 0 | 38,718,053 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, m;
cin >> n >> m;
vector<vector<ll>> a(8, vector<ll>(n));
rep(i, n){
ll ai, bi, ci;
cin >> ai >> bi >> ci;
a.at(0).at(i) = +ai+bi+ci;
a.at(1).at(i) =... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | 0 | 83,081,560 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n; cin >> n;
vi v(n + 2), jf(n + 2, n + 1), jf2(n + 2, n + 1), jb(n +... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<pair<string,ll> > svp;
#define spc ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb p... | 0 | 5,184,282 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int num;
int len;
cin >> num >> len;
string words[num];
for (int i = 0; i < num; i++)
{
cin >> words[i];
}
for (int i = 0; i < num - 1; i++)
{
for (int j = num - 1; j > i; j--)
{
string tem... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int MOD = 1000000007;
double PI = 3.14159265358979323846;
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;... | 0 | 55,237,307 |
#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<ll,ll>;
int main(){
int n;cin>>n;
vector<int> a(n+1);
ll sum=0;
a[0]=0;
rep(i,n+1){
if(i==0)continue;
cin>>a[i];
sum+=abs(a[i-1]-a[i]);
}
sum+=abs(a[0]-a[n]);
rep(i,n){
... | #include <unordered_set>
#include <string>
#include <iostream>
using namespace std;
int main() {
typedef unordered_set<string> set_t;
set_t A;
int n;
string s,t;
cin >> n;
for (int i = 0; i<n; i++){
cin >> s >> t;
if (s == "insert"){
... | 0 | 27,579,453 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ss set<string>
#define si set<int>
#define pii pair<int,int>
#define vi vector<int>
#define mii map<... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> a(n);
std::set<int> as;
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
as.insert(a[i]);
}
std::sort(a.begin(),... | 0 | 30,530,596 |
#include<iostream>
using namespace std;
int main() {
int datas[100] = { 0 };
int num,biggest_num=0;
while (cin >> num) {
datas[num-1]++;
}
for (int i = 0; i < 100; i++) {
if (biggest_num < datas[i]) {
biggest_num = datas[i];
}
}
for (int i = 0; i < 100; i++) {
if (biggest_num == datas[i]) {
cout <<... | #include<algorithm>
#include<cmath>
#include<cstdio>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<unordered_set>
#include<vector>
#define ll long long
#define P pair<int,int>
#define FOR(i,N) for(int i=0;i<(int)N;i++)
#define FORIN(i,a,b)... | 0 | 20,618,518 |
#include<iostream>
using namespace std;
int main(){
int N, K, h;
int ans = 0;
std::cin >> N >> K;
for(int i = 0; i < N; i++){
std::cin >> h;
if(h >= K){
ans++;
}
}
std::cout << ans;
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int n; cin >> n;
vector<int> b(n-1);
rep(i,n-1) cin >> b[i];
vector<int> a(n);
a[0] = b[0]; a[n-1] = b[n-2];
int sum = a[0] + a[n-1];
for(int i=0; i<n-2; i++){
a[i+1] = min(b[i],b[i+1... | 0 | 65,353,966 |
#include <iostream>
using namespace std;
int main()
{
int x, n, i, j, k, C;
while(1)
{
C=0;
cin >> n >> x;
if(n==0 && x==0)
break;
for(i=1;i<=n-2;i++)
for(j=1+i;j<=n-1;j++)
for(k=1+j;k<=n;k++)
if(i+j+k==x)
C += 1;
cout << C << endl;
}
} | #include <string>
#include <cctype>
#include <iostream>
using namespace std;
int toInt(char c){
switch(c){
case 'm':
return 1000;
case 'c':
return 100;
case 'x':
return 10;
case 'i':
return 1;
}
cout << "impossible" << endl;
return 0;
}
int encode(string str){
int ret=0;
for(int i=0;i<str.size();i++){... | 0 | 23,078,318 |
#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 <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n;
int h[N], e[N], ne[N], idx;
int ma... | 0 | 66,408,893 |
#include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define MAX(a,b) (a>b)?a:b
#define MIN(a,b) (a>b)?b:a
#define REP(n) for(int i=0; i<n; i++)
#define REPj(n) for(int j=0; j<n; j++)
#define REPS(... | #include <iostream>
#include <string>
#include <queue>
using namespace std;
int main() {
long long K;
cin >> K;
queue<long long> Que;
for (long long i = 1; i <= 9; i++) Que.push(i);
long long res = 0;
for (long long i = 0; i < K; i++){
long long a = Que.front();
Que.pop();
if (i == K - 1) res = ... | 0 | 46,663,876 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
char A;
cin >> A;
if(isupper(A)){
cout << 'A' << endl;
}else{
cout << 'a' << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, a, b) for(int i = a, i##_len = (b); i < i##_len; ++i)
int graph[4][4];
bool visited[4];
bool all_vis(int cur) {
visited[cur] = true;
for(int i = 0; i < 4; ++i) if(graph[cur][i]) {
if(visited[i]) continue;
if(all_vi... | 0 | 70,835,742 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#define BLACK 0
#define RED 1
#define MAN 2
int count;
int tile[20][20];
int dx[] = {0,0,-1,1};
int dy[] = {-1,1,0,0};
int W,H;
int countdebug;
void hukasa(int width,int height);
int main(){
int height,width;
int i,j;
char s;
while(scanf("%d %d",&W,&H) && W... | #include <iostream>
#include <string>
using namespace std;
int main(){
int Q;
string str_x, str_y;
int memo[1001][1001];
cin >> Q;
for(int q = 0;q < Q;q++){
cin >> str_x >> str_y;
for(unsigned int i = 0;i < str_x.size();i++){
for(unsigned int j = 0;j < str_y.size();j++){
... | 0 | 42,284,550 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N,vector<int>(M));
for (int i = 0; i < N; i++) {
cin >> C.at(i);
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define mod 1000000007
#define string_mod 2549536629329_base_255
#define pb push_back
#define F first
#define S second
#define ff first
#defin... | 0 | 68,001,726 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
string s;
cin>>n;
cin>>s;
ll r,g,b;
r=g=b=0;
for(char ch: s){
if(ch == 'R'){
++r;
}else if(ch == 'G'){
++g;
}else if (ch == 'B'){
++b;
}
}
ll total = r*g*b;
if(total == 0){
cout<<total<<endl;
}else{
for... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int ... | 0 | 21,907,198 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
const ll INF = 1LL<<60;
const ll MOD = 1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin>>n;
ve... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ans = 1000;
rep(i, n - 1) {
ll pre = ans / a[i];
if (a[i] < a[i + 1])
... | 0 | 23,967,837 |
#include<stdio.h>
int main(){
int n,k,i,c=0,d=0,e=0;
scanf("%d%d",&n,&k);
e=(n-1)-(k-2);
printf("%d\n",e);
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int n;
cin >> n;
for(int i=0;i<n;i++){
string m;
int a,b;
cin >> m >> a >> b;
if(m=="print") cout << s.substr(a,b-a+1) << endl;
else if(m=="reverse"){
st... | 0 | 45,258,782 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
double sol = 0;
double c;
double x,y;
int n;
cin>>n;
vector<pair<int,int>>data;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
data.push_back(make_pair(a,b));
}
for(int r = 0; r < 100; r++) {
random_shuffle(data.begin(), dat... | #include<iostream>
#include<vector>
using namespace std;
int main() {
while(1) {
int n, a, b, c, x;
cin >> n >> a >> b >> c >> x;
if (n == 0) break;
vector<int> y;
for (int i = 0; i < n; ++i) {
int yi;
cin >> yi;
y.push_back(yi);
}
... | 0 | 59,052,272 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.