code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
string str;
cin>>k;
cin.ignore();
getline(cin,str);
int len = str.length();
if(len>k){
str[k]='.';
k++;
str[k] ='.';
k++;
str[k]='.';
for(int i=0;i<k+1;i++)
cout<<str[i];
}
else
cout<<str;
} | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | 1 | 60,843,432 |
#include <bits/stdc++.h>
using namespace std;
string s;
const int maxn = 5e5+10;
int n, countN, front[maxn];
long long ans;
int main() {
cin >> s;
n = s.size();
for(int i=0; i<n; i++){
if(s[i] == '>'){
countN=0;
}
else{
countN++;
}
front[i+1]=countN;
}
countN=0;
for(int i=n-1; i>-1; i--){
if(s[i... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 1 | 70,261,244 |
#include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define ull unsigned long long
typedef string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se se... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
map <long long,long long,greater<long long>> dic;
cin>>N;
for(int i=0; i<N; i++){
long long a;
cin>>a;
dic[a]++;
}
long long ans = 1;
int cnt = 0;
for(auto a : dic){
if(cnt == 2) break;
... | 1 | 38,172,529 |
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
int mai... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N = 2e5 + 5;
const ll INF = 1e9 + 5;
const ll mxN = 1000000007;
const double E = 1e-9;
int n;
int32_t main()
{
ios_base::sync_with_stdio... | 1 | 5,887,769 |
#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;
int main(){
string S;
int w;
cin >> S >> w;
int N=0;
int L=S.size();
while(N<L){
cout << S.at(N);
N+=w;
}
} | 1 | 94,194,173 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
string S;
cin >> S;
int A = count(S.begin(), S.end(), 'a');
int B = count(S.begin(), S.end(), 'b');
int C = count(S.begin(), S.end(), 'c');
if (A == B && B == C) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 1 | 72,824,578 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin>>S>>T;
int N=S.size(),a=0;
for(int i=0;i<N;i++){
string A,B;
for(int j=0;j<i;j++){
A.push_back(S.at(j));
}
for(int j=i;j<N;j++){
B.push_back(S.at(j));
}
string C=B+A;
if(C==T){
a=1;
brea... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define eps 1e-9
#define maxp 1000400
#define mod 1000000007
#define pi 3.141592653589793238
#define sin(s) scanf("%lld",&s);
#define sout(s) printf("%lld\n",s);
#define in(s) cin>>s
#define in2(a,b) cin>>a>>b
#define in3(a,b,c) ci... | 1 | 61,725,391 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<pair<string,int>> A(N);
for(pair<string,int> &i:A)
cin>>i.first>>i.second;
string X;
cin>>X;
bool bo=false;
int j=0;
for(pair<string,int> &i:A){
if(bo)
j+=i.second;
else if(i.first==X)
bo=true;
}
... | #include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | 1 | 57,099,705 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; ++i)
int main (){
int n,k; cin >> n >> k;
vector<int> a(n);
if((n-k)%(k-1) == 0){
cout << (n-k)/(k-1)+1 << endl;
}else{
cout << (n-k)/(k-1)+2 << endl;
}
} | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N);
rep... | 1 | 36,194,361 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i,1000) {
string t;
int x = i;
rep(j,3) {
t += '0'+x%10;
x /= 10;
}
int ti = ... | #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;
string s;
cin >> n >> s;
int ans = 0;
for (char i = '0'; i <= '9'; ++i) {
for (char j = '0'; j <= '9'; ++j) {
for (char k = '0'; k <= '9'; +... | 1 | 40,133,323 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main() {
ios
#ifndef ONLINE_JUDGE
in;
out;
#endif
int n;
cin>>n;
... | #include <bits/stdc++.h>
using namespace std;
char S[110];
char T[110];
int main(){
int a;scanf("%d",&a);
scanf("%s%s",S,T);
for(int i=0;i<a;i++)printf("%c%c",S[i],T[i]);printf("\n");
} | 1 | 22,335,137 |
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (c <= a + b ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
int main() {
uint input_a,input_b,input_c;
cin >> input_a >> input_b >> input_c;
if(input_a + input_b >= input_c){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 1 | 65,662,041 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n, m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
for (int i = 0; i <= n-m; i++){
for (int j = 0; j <= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 1 | 93,809,124 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n;
cin>>n;
vector<int>a(n+1);
a[0]=0;
for(int i=1;i<n+1;i++)cin>>a[i];
ll saou=0;
for(int i=1;i<n+1;i++){
saou+=abs(a[i]-a[i-1]);
}
saou+=abs(a[n]);
... | 1 | 56,830,054 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x;
cin >> x;
int res = (2199 - x) / 200;
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int X;
cin >> X;
cout << 9 - (X - X % 200 - 200) / 200 << endl;
} | 1 | 6,328,631 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#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;
typedef long long ll;
int main() {
int H1, H2, M1, M... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int H, M, h, m, K;
cin >> H >> M >> h >> m >> K;
cout << h*60+m-K-(H*60+M) << endl;
} | 1 | 91,628,510 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<pair<int, int>> vec(n);
for(int i=0;i<n;i++){
int d;
cin >> d;
vec[i].first = d;
vec[i].second = i;
}
sort(vec.begin(), vec.end());
cout << vec[n/2].first - vec[n/2 - 1].first << ... | 1 | 61,893,364 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#define CONTAINS(v,n) (find((v).begin(), (v).end(), (n... | #include <bits/stdc++.h>
using namespace std;
int freq[200005],dp[200005],i,j;
unordered_map<int,int> best;
#define get(k) (best.find(k)!=best.end()?best[k]:dp[i-1])
int main(){
ios_base::sync_with_stdio(0);
string s;
cin>>s;
for(int i=0;i<s.size();++i)
freq[i+1]=freq[i]^(1<<(s[i]-'a'));
for(best[0]=0,i=1;i<=s.s... | 1 | 96,067,511 |
#include <bits/stdc++.h>
#include <string.h>
#define rep(i, n) for(int i=0; i < n; i++)
#define REP(i, n, m) for(int i=n; i < m; i++)
#define reps(i, n) for(int i=1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
using namesp... | #include <iostream>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
string x;
cin >> x;
for (int j = 97; j <= 122; j++) {
bool a = 0;
for (int i = 0; i < x.size(); i++) {
if (char(j) == x[i]) {
a = 1;
continue;
... | 1 | 67,284,425 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[]) {
int W, H;
while(1){
cin >> H >> W;
if(W == 0 && H == 0) break;
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
if((i == 0) || (i == H - 1) || (j == 0) || (j == W - 1)) printf("#");
... | #include <cstdio>
int main(){
while(1){
int h, w;
scanf(" %d %d", &h, &w);
if(h==0 && w==0) break;
for(int i=0; i<h; ++i){
for(int j=0; j<w; ++j){
if(i==0 || i==h-1 || j==0 || j==w-1) printf("#");
else printf(".");
}
printf("\n");
}
printf("\n");
}
return 0;
} | 1 | 16,743,016 |
#include <iostream>
#include <cctype>
#include <string>
using namespace std;
int main() {
string str;
getline(cin, str);
for (int i = 0; i < str.length(); i++) {
if (islower(str[i])) str[i] = toupper(str[i]);
else if (isupper(str[i])) str[i] = tolower(str[i]);
}
cout << str << "\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string inp;
getline(cin, inp);
for (int i = 0; i < 1200; i++){
if (inp[i] == '\0'){
break;
}
if (inp[i] >= 'A' && inp[i] <= 'Z'){
inp[i] = inp[i]+ 'a' - 'A' ;
} else if (inp[i] >= 'a' && inp[i] <= 'z'){
inp[i] = inp[i]+ 'A' - 'a... | 1 | 54,556,262 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
if (n % k == 0) {
cout << 0 << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
int N,K;
cin >> N >> K;
if (N % K == 0) cout << 0 << endl;
else cout << 1 << endl;
return 0;
} | 1 | 98,985,525 |
#include<stdio.h>
#include<algorithm>
#define PI 3.1415927
int a[105];
int main()
{
int n,ans=1;
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d",&a[i]);
for(int i=1;i<n;i++)
{
int flast=1;
for(int j=0;j<i;j++)
{
if(a[i]<a[j])
{
flast=0;
break;
}
}
if(flast) ans++;
}
printf("%d\n"... | #include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
using namespace std;
int main() {
int n,h[30];
cin >> n;
for(int i = 0; i < n; i++)
cin >> h[i];
int sum = 1;
bool flag;
for(int i = 1; i < n; i++) {
for(int j = 0; j <= i-1; j++) {
if(h[i] >= ... | 1 | 100,234,701 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
if((a+b)>(c+d)){
cout << "Left\n";
} else if((a+b) == (c+d)){
cout << "Balanced\n";
} else {
cout << "Right\n";
}
return(0);
} | 1 | 40,709,891 |
#include<bits/stdc++.h>
using namespace std;
int main(){
uint64_t n;
uint64_t m,x;
cin>>n>>x>>m;
vector<int64_t> r(m,-1);
vector<int64_t> sum(2,0);
sum[1]=x;
r[x]=1;
int curr=2;
uint64_t next=x*x%m;
while(r[next]==-1){
r[next]=curr;
sum.push_back(sum[sum.size()-1]+next);
next=next*next%m... | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
#include <ext/pb_ds/assoc_container.hpp>
#inc... | 1 | 75,983,520 |
#include<iostream>
#include<climits>
#include<vector>
#include<list>
#include<functional>
#include<algorithm>
#include<string>
#include<cmath>
#include<complex>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)... | #include<cstdio>
void InitializeIntegerMatrix(int nmbr_of_rows, int nmbr_of_columns, int m[][100]){
for (int row = 0; row < nmbr_of_rows; ++row) {
for (int column = 0; column < nmbr_of_columns; ++column)
m[row][column] = 0;
}
}
void ListToMatrix(int number_of_vertices, int adjmtr[][100]){
int vertex_from, verte... | 1 | 29,433,489 |
#include <bits/stdc++.h>
#define ll long long int
#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 put(x) cout << x << endl;... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int w,h,n;
cin>>w>>h>>n;
vector<vector<bool> >rect(w,vector<bool>(h,false));
for(int i=0;i<n;i++)
{
int x1,y1,a;
cin>>x1>>y1>>a;
if(a==1){
for(int i=0;i<x1;i++)
{
for(... | 1 | 10,802,854 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
#define PI 3.141592653
bool cross(double x1,double y1,double x2,double y2,double x3,double y3,double x4,double y... | #include<iostream>
#include<complex>
#include<vector>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define X real()
#define Y imag()
typedef long double D;
typedef complex<D> P;
typedef pair<P, P> L;
typedef vector<P> Pol;
const D INF = 1e4... | 1 | 87,974,966 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1000;
int n,m,a,b;
void into(){
scanf("%d%d%d%d",&n,&m,&a,&b);
}
int ans[N+9][N+9];
void Get_ans(){
for (int i=1;i<=b;++i)
for (int j=1;j<=m;++j) ans[i][j]=1;
for (int i=1;i<=n;++i)
for (int j=1;j<=a;++j) ans[i][j]^=1;
}
void work(){... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
typedef long long ll;
int main(){
int h,w;
cin >> h >> w;
int a,b;
cin >> a >> b;
int ans[1005][1005];
rep(i,h){
rep(j,w){
if(i<b && j<a){
ans[i][j] = 1;
} else if (i < b && j >= ... | 1 | 27,025,331 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
int j;
j = A[i] - 1;
if (A[j] - 1 == i) {ans++;}
}
cout << ans/2 << endl;
r... | 1 | 60,874,439 |
#include <bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
int N = S.length(), cnt1 = 0, cnt2 = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0') cnt1++;
else cnt2++;
}
cout << 2 * min(cnt1, cnt2) << endl;
} | #include <iostream>
using namespace std;
int main() {
int a = 0, b = 0;
char c;
while (cin >> c) {
if (c == '0')
++a;
else
++b;
}
cout << a + b - abs(a - b) << endl;
} | 1 | 47,161,651 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
char an... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
string O, E;
cin >> O >> E;
int n;
rep(i, E.length())
{
cout << O[i] << E[i];
}
if (O.length() > E.length... | 1 | 68,392,203 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define co(n) cout<<n<<endl
#define all(n) (n).begin(),(n).end()
#define pb(n,m) n.push_back(m)
#define pi(n,m) n.insert(n.begin(),m);
#define ee(n) n.erase(n.end()-1)
#define eb(n) n.erase(n.begin())
#define check(n) reverse(all(n));rep(z,0,n.size())cout... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int p, q, r, sum = 0;
cin >> p >> q >> r;
sum = max(max(p, q), r);
if(p == sum)
cout << q + r << endl;
else if(r == sum)
cout << p + q << endl;
else cout << r + p << endl;
return 0;
} | 1 | 50,780,249 |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long N, K;
cin >> N >> K;
vector<long long> cnt(1e5 + 1, 0);
for(int i = 0; i < N; i++) {
int a, b... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <map>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> ... | 1 | 31,265,124 |
#include<iostream>
#include<queue>
#include<algorithm>
#include<numeric>
#include<string>
#include<map>
#include<bitset>
using namespace std;
using int_greater_PQ = priority_queue<int,vector<int>,greater<int>>;
int main()
{
int N,K;
cin>>N>>K;
vector<int>H;
for(int i=0;i<N;++i)
{
int h;
... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include <cassert>
#include <numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
t... | 1 | 57,506,899 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for(int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main(){
int h, w;
cin >> h >> w;
char paint[h][w];
rep(i, h){
rep(j, w){
cin >> paint[i][j];
}
}
int x[4] = {0, 0, -1, 1};
int y[4] = {-1, 1, 0, 0};
int check... | #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... | 1 | 52,380,575 |
#include<bits/stdc++.h>
using namespace std;
long long unit = 1;
int visited[105]={0};
bool check(long long curr){
for(int j=0; j<25; j++){
if((unit<<j)&curr){
if(visited[j]) return false;
}
}
for(int j=0; j<25; j++){
if((unit<<j)&curr) visited[j]++;
}
return true;
}
void proccess(long long curr){
for(in... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << f... | 1 | 60,024,845 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N,K;
cin >> N >> K;
str... | #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>... | 1 | 51,376,271 |
#pragma GCC target ("avx2")
#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define input(a,n) for(ll i1=0;i1<n;i1++)cin>>a[i1]
#define ll long long
#define pi 2 * acos(0.0)
#define usll unordered_set<ll>
#define sll set<ll>
#define vll vec... | #include <bits/stdc++.h>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
typedef long long ll;
using namespace std;
bool check(vector<int> p, int x){
rep(i, p.size()){
if(p[i]==x)return false;
}
return true;
}
int main(){
int x, n;
cin >> x >> n;
vecto... | 1 | 5,682,881 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int MXN = 8;
int n, m;
vector<bool> vis(MXN);
vector<int> adj[MXN];
ll dfs(int cur) {
ll ans = 0;
vis[cur] = true;
bool all = true;
for (int i=0; i<n && all; i++)
if (!vis[i]) all = false;
if (all) {
vis[cur] = f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
int ans = 0;
vector<bool> seen;
void dfs(const Graph& G, int v, int n, int cnt) {
seen[v] = true;
if (cnt == n - 1) {
bool ok = true;
for (int i = 0; i < n; i++) {
if(!seen[i]){
... | 1 | 635,658 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int main() ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 1 | 70,375,493 |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long LL;
int n, a[N], b[N];
LL ans;
map <int, int> M;
int main() {
cin>>n;
for(int i = 1; i <= n; i++)
cin>>a[i], b[i] = a[i];
sort(b + 1, b + n + 1);
for(int i = 1; i <= n; i++)
M[b[i]] = i;
for(int i = 1; i <= n; i++)
a... | #include<bits/stdc++.h>
#include<math.h>
#include<vector>
using namespace std;
#define MAX 200005
#define MOD 1000000000
#define NINF -1000000000000000000
int main()
{
int n,i,j;
scanf("%d",&n);
pair<int,int> arr[n];
for(i=0;i<n;i++)
{
arr[i].second=i;
scanf("%d",&arr[i].first);
... | 1 | 14,942,121 |
#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 endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){os << "["; for (c... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int K;
int A[100010];
... | 1 | 12,421,951 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a,b,c,k;
cin >> a >> b >> c >> k;
int64_t ans;
if(a>k)
ans = k;
else{
if(a+b > k)
ans = a;
else if (a+b+c <k)
ans = a-c;
else
ans = a - (k-a-b);
}
cout << ans << endl;
} | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int main()
{
int a, b, c, k, total=0;
cin >> a >> b >> c >> k;
total += min(a, k);
k -= min(a, k);
k -= min(b, k);
total += k*-1;
cout << total;
} | 1 | 12,250,924 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string query,strconv,str,p;
int q,a,b;
cin>>str;
cin>>q;
for(int i=0; i<q; i++){
cin>>query;
cin>>a>>b;
if(query == "print"){
cout<<str.substr(a,b-a+1)<<endl;
}else if(query == "reverse"){
reverse(str.begin()+a,str.begin()+b+... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <functional>
#include <algorithm>
#include <string>
using namespace std;
int main (void)
{
string str,E,ttt,kkk,lll,p,O;
long q,a,b;
cin >> str >> q;
for (long s = 0; s < q; s++)
{
cin >> E >> a >> b;
if (E == "print")
{
cout << str.subst... | 1 | 95,974,235 |
#include <algorithm>
#include <iostream>
#include <string>
int main()
{
std::string str;
std::cin >> str;
bool ans = true;
for (int i = 0; i < str.size(); i++) {
if (str.at(i) == 'd') {
if ((i + 5) < str.size() && str.substr(i, 6) == "dreamd") {
i += 4;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a... | 1 | 31,607,671 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define IN... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n,l,r,hantei,count;
string s;
while(1){
l = r = hantei = count = 0;
cin >> n;
if(n == 0)break;
for(int i = 0;i < n;i++){
cin >> s;
if(s == "lu"){
l = 1;
}
else if(s == "ru"){
r = 1;
}
else if(s == "ld"){
... | 1 | 10,590,760 |
#include <iostream>
#include <stack>
using namespace std;
int main(){
stack<int> stop;
int come;
while(cin >> come){
if(come!=0) stop.push(come);
else{
cout << stop.top() << endl;
stop.pop();
}
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> a;
for(int n; cin >> n;){
if(!n) cout << a[a.size() - 1] << endl, a.pop_back();
else a.push_back(n);
}
return 0;
} | 1 | 11,563,254 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main()
{
int n;
cin >> n;
vector<int> a(n + 2);
for (int i = 1; i <= n; i++) cin >> a[i];
int sum = 0;
for (int i = 1; i < a.size(); i++) sum += abs(a[i] - a[i - 1]);
vector<int> diff(n + 2);
for (int i = 1; i <=... | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n+2);
a[0] = 0;
a[n+1] = 0;
for(int i = 1; i <= n; i++) cin >> a[i];
int sum = 0;
for(int i = 1; i <= n+1; i++){
sum += abs(a[i]-a[i-1]);
}
for(int i = 1... | 1 | 70,084,907 |
#include<iostream>
#include<string>
#include<map>
using namespace std;
map<string,int> table;
int main()
{
string word, frequent, longest;
size_t N=0;
while(cin>>word){
table[word]++;
if(table[word]>N){
N=table[word];
frequent=word;
}
if(word.size()>longest.size()){
longest=word;
}
}
cout<<frequ... | #include <iostream>
#include <string>
using namespace std;
struct DataBox
{
int frequentCount;
int maxLength;
string frequentWord;
string maxLengthWord;
DataBox() : frequentCount(0), maxLength(0)
{
}
};
int main(void)
{
struct DataBox dataBox;
string sentence;
int count = 0;
int maxSentenceWord = 1000;
int... | 1 | 47,168,236 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d", &n);
int arr[n+1];
for(int i = 0; i < n; i++){
scanf("%d", &arr[i]);
}
sort(arr, arr+n);
arr[n] = 0;
int top = arr[0] * 2;
if(arr[1] == arr[0]) --top;
if(arr[2] == arr[0] || arr[n-1] != top){
printf("Impossible");
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, a[100];
int cnt[100] = {0};
cin >> n;
int mn = n, mx = 0;
for(int i=0;i<n;++i){
cin >> a[i];
mn = min(mn, a[i]);
mx = max(mx, a[i]);
++cnt[a[i]];
}
if(mx % 2){
if(cnt[mn] != 2) goto l_ng;... | 1 | 10,930,294 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,max=0,sum=0;
cin >> n;
vector<string> blue(n);
for(int i=0;i<n;i++){
cin >> blue.at(i);
}
cin >> m;
vector<string> red(m);
for(int i=0;i<m;i++){
cin >> red.at(i);
}
for(int i=0;i<n;i++){
sum=0;
string word = blue.at... | 1 | 91,816,648 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
template <typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
cout << "{";
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
cout ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<int,int>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++... | 1 | 69,352,532 |
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr int MOD = 1000000007;
conste... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } ... | 1 | 53,441,969 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string s;
cin >> s;
string d1 = "dreameraser";
string d2 = "dreamerase";
string d3 = "dreamer";
string d4 = "dream";
string r1 = "eraser";
string r2 = "erase";
bool ans = 1;
for (int i = 0; i < (int)... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
std::string cons_s[] = {"resare", "remaerd", "maerd", "esare"};
int main() {
std::string s;
std::cin >> s;
std::reverse(s.begin(), s.end());
bool found = true;
while (found) {
found = false;
for (int i = 0; i < 4; i++) {
... | 1 | 81,418,574 |
#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 priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pull = pair<ull, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
int main() {
cin.tie(0);
ios::... | 1 | 51,559,038 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
long long N, A, B, C;
long long l[8];
long long dfs(long long cur, long long a, long long b, long long c){
if (cur == N){
return (min({a,b,c}) > 0)? abs(a - A) + abs(b - B) + abs(c - C) - 30 : INF;
}
long long ret0 = dfs(cur + 1, a, b, c);
l... | 1 | 67,993,414 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
bool bl;
cin >> a >> b >> c >> d;
if(abs(c-a) <= d){
cout << "Yes" << endl;
}else if(abs(a-b) <= d && abs(c-b) <= d){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | 1 | 70,820,001 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin>>n;
double bo=0;
rep(i,n){
double a;
cin>>a;
bo+=1/a;
}
cout<<fixed<<setprecision(10)<<1/bo<<endl;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
double ans = 0;
for (int i = 0; i < n; i++) {
double a;
cin >> a;
ans += 1 / a;
}
cout << fixed << setprecision(10) << 1 / ans << endl;... | 1 | 55,918,672 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
int W, H, N;
cin >> W >> H >> N;
vector<vector<int>> map(W, vector<int>(H, 0));
int x, y, a;
int... | 1 | 2,875,071 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,y;
cin >> n >> y;
int a=-1,b=-1,c=-1;
for(int i=0;i<=n;i++){
for(int j=0;j<=n-i;j++){
if(10000*i+5000*j+1000*(n-i-j)==y){
a=i;
b=j;
c=n-i-j;
}
}
}
cout << a << ' '<< b << '... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)... | 1 | 95,106,494 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
using namespace std;
using namespace boost::adaptors;
using namespace std::string_literals;
using ll = int64_t;
using vecint = vector<int>;
using ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n,a,b;
cin>>n>>a>>b;
if(n==2){
cout<<"Borys"<<endl;
}else if((a%2==0 && b%2==0) || (a%2==1 && b%2==1)){
cout<<"Alice"<<endl;
}else{
cout<<"Bo... | 1 | 66,810,041 |
#include "bits/stdc++.h"
using namespace std;
int main(){
double T,X;
cin >> T >> X;
cout << T/X << endl;
return 0;
} | #include <iostream>
#include <iomanip>
using namespace std;
int main(void){
double T, X, t;
cin >> T >> X;
t = T/X;
cout << setprecision(64) << t << endl;
} | 1 | 42,721,012 |
#include<bits/stdc++.h>
using namespace std;
struct UnionFind{
vector<int> r;
vector<int> count;
UnionFind(int N):r(N),count(N){
for(int i=0;i<N;i++){
r.at(i)=i;
count.at(i)=1;
};
}
int root(int x){
return r.at(x)==x?x:r.at(x)=root(r.at(x));
}
... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
#include <map>
#include <queue>
#define N 200010
#define ll long long
#define mo ((ll)1e9+7)
#define db double
#define cmax(a,b) a=max(a,b)
#define cmin(a,b) a=min(a,b)
#define rep(i,a,b) ... | 1 | 12,916,132 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int n;
ll k;
cin >> n >> k;
vector<ll> cnts(200000, 0);
for (int i = 0; i < n; ++i) {
int a;
ll b;
cin >> a >> b;
cnts[a] += b;
}
ll acc = 0, ans = 0;
for (int i = 1; i < cnts.siz... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k, m, s = 0;
cin >> n >> k;
vector<pair<ll, ll>>v;
for (ll i = 0; i < n; i++) {
ll x, y;
cin >> x >> y;
v.push_back({x, y});
}
sort(v.begin(), v.end());
for (ll i = 0; i < v.size(); i++) {... | 1 | 46,692,373 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int64_t> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
sort(data.begin(), data.end());
vector<int64_t> cumsum(N);
int min_eater= 0;
for(int i=0; i<N-1; i++){
cumsum.at(i)= (i > 0) ? data.at(i)+ cumsum.at(... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
class Prints {
private:
class __Pr... | 1 | 7,078,891 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
#include<bitset>
using name... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
#ifndef UTIL_HPP
#define UTIL_HPP
typedef ::std::int_fast64_t i64;
typedef ::std::uint_fast64_t u64;
typedef ::std::int_fast32_t i32;
typedef ::std::uint_fast32_t u32;
namespace tools {
template ... | 1 | 24,632,071 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e15;
int dp[55555];
int c[22];
int n, m;
int rec(int money) {
if (money == 0) {
return dp[money] = 0;
}
if (dp[money] != INF) {
return dp[money];
}
int ans = INF;
for (int i = 0; i < m; i++) {
if (money - c[i] <... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,m,c[20],dp[50001],i=0,j=0;
cin >> n >> m;
for(i;i<m;i++){
cin >> c[i];
}
sort(c,c+m);
for(i=0;i<=n;i++){
dp[i] = 100000;
}
dp[0]=0;
for(i=0;i<m;i++){
dp[c[i]]=1;
}
for(i=1;i<... | 1 | 82,930,772 |
#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 pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long int ans = 0, a = 0, b = 0, c = 0;
vector<string> s(n);
for(int i=0; i<n; i++){
cin >> s[i];
for(int j=0; j+1<s[i].length(); j++){
if(s[i][j] == 'A' && s[i][j+1] == 'B') ans += 1;
... | 1 | 27,935,497 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main(){
int N;... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
#define pb push_back
#define pp pop_back
#define ubo upper_bound
#define lbo lower_bound
#define VI vector<int>
#define VL vector<ll>
#define VP vector<pll >
#define ... | 1 | 58,072,985 |
#include <iostream>
using namespace std;
int main()
{
int n, m;
char change[60][2];
char moji;
string ans;
while (cin >> n, n){
ans = "";
for (int i = 0; i < n; i++){
cin >> change[i][0] >> change[i][1];
}
cin >> m;
for (int i = 0; i < m; i++){
cin >> moji;
for (int j = 0; j < n; j++){
if (c... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define foreac... | 1 | 81,736,353 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SIZ 1000000000
#define mod 1000000007
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,k;
cin >> n >> k;
ll ans = 0;
for(ll i = k - 1; i <= n; i++){
ans += ((i + 1)*(n - i)) + 1;
ans = ans%mod;
}
cout << ans << "\n";
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
long long N,K;
cin>>N>>K;
long long ans=0;
long long mod=1000000007;
for(long long i=K;i<=N+1;i++){
ans+=(N*(N+1)/2-(N-i)*(N-i+1)/2-(i-1)*i/2)+1;
ans%=mod;
}
cout<<ans<<endl;
return 0... | 1 | 76,095,375 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | #include<bits/stdc++.h>
using namespace std;
long long N, M, X;
long long C[20];
long long A[20][20];
int main(){
cin >> N >> M >> X;
for(long long i = 0; i < N; i++) {
cin >> C[i];
for(long long j = 0; j < M; j++) {
cin >> A[i][j];
}
}
long long ans = LONG_MAX;
for(long long pat = 0; pat < (1<<N); pat++)... | 1 | 43,437,432 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int n;
cin>>n;
cout<<n/3<<endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
int ma... | 1 | 32,592,999 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> v(n);
for(int i=0; i<n; i++) v[i] = i+1;
vector<int> h(n);
for(int i=0; i<n; i++) cin >> h[i];
int a, b;
for(int i=0; i<m; i++) {
cin >> a >> b;
if(h[a-1]==h[b-1]) v[a-1]=0, v[b-1]=0;
else if(h[a-... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<int> H;
vector<int> ma;
cin >> N >> M;
H.push_back(0);
ma.push_back(0);
for (int i = 1; i <= N; i++) {
int n;
cin >> n;
H.push_back(n);
ma.push_back(0);
}
for (int i = 0; i < M... | 1 | 75,230,267 |
#include<iostream>
using namespace std;
long long int faktorial(long long int n){
if (n==0)return 1;
return n*faktorial(n-1);
}
long long int n,z;
int main (){
while(cin>>n){
if(n>=0&&n<21){
z = faktorial(n);
cout<<z<<endl;}}
return 0;
} | #include <iostream>
using namespace std;
typedef long long int ll;
ll fact(int n){
if(n==1)return 1;
return n*fact(n-1);
}
int main()
{
int n;
cin>>n;
cout<<fact(n)<<endl;
return 0;
} | 1 | 2,314,000 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
int res = 0;
while(n>0){
if(res==0){
res++; n -= k;
}else{
res++; n -= (k-1);
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
int ans = (n - 1 + k - 2) / (k - 1);
printf("%d\n", ans);
return 0;
} | 1 | 96,706,352 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b;
cin>>a>>b;
if(a.size()>b.size())cout<<"GREATER"<<endl;
if(a.size()<b.size())cout<<"LESS"<<endl;
if(a.size()==b.size()){
if(a>b)cout<<"GREATER"<<endl;
else if(a<b)cout<<"LESS"<<endl;
else if(a==b)cout<<"EQUAL"<<endl;
}
} | #include <iostream>
#include <algorithm>
using namespace std;
void solve() {
string gr, ls, eq;
gr = "GREATER"; ls = "LESS"; eq = "EQUAL";
string A, B;
cin >> A; cin >> B;
if (A.size() > B.size())
cout << gr;
else if (A.size() < B.size())
cout << ls;
else {
if (A < B)... | 1 | 24,652,790 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
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... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
ll n;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
cout<<(n/3);
return 0;
} | 1 | 75,675,955 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
typedef long long ll;
template<class T> inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(... | 1 | 19,724,930 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,c) for(int i=0;i<c;++i)
int main(){
int a,b,c;
cin >> a>> b>> c;
bool yon = c>=a && c<=a+b;
if(yon){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
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 a, b, x;
cin >> a >> b >> x;
if(a>x){
cout << "NO" << endl;
return 0;
}
if(a+b<x){
... | 1 | 40,799,677 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<string>
#include<stdio.h>
#include<cmath>
#include<map>
#include<bitset>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repn(i, n) for(int i = 1; i <= n; i++)
#define repr(i, n) for(int i = n-1; i >... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = vector... | 1 | 87,823,370 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> P_vec(N), Q_vec(N);
for (int i = 0; i < N; ++i)
cin >> P_vec.at(i);
for (int i = 0; i < N; ++i)
cin >> Q_vec.at(i);
vector<int> perm(N);
for (int i = 0; i < N; ++i)
perm.at(i) = i ... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | 1 | 43,788,525 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | #include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> a(N);
for(int i=0; i<N; ++i) cin >> a[i];
ll ans=a[0]-1, now=2;
for(int i=1; i<N; ++i){
if(a[i]==now) ++now;
else if(a[i]>now){
ans += a[i]/now-(a[i]%now==0 ? 1 : 0);
}
... | 1 | 44,563,479 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int a, b, c;
cin>>a>>b>>c;
if(a > b) swap(a, b);
if(b > c) swap(b, c);
if(a > b) swap(a, b);
cout<<a<<' '<<b<<' '<<c<<'\n';
return 0;
} | #include<iostream>
using namespace std;
int main(void)
{
int a,b,c,max=0,half=0,min=0;
cin>>a>>b>>c;
if(a<=b && a<=c) min=a;
else if(b<=a && b<=c) min=b;
else min=c;
if(b<=a && c<=a) max=a;
else if(a<=b && c<=b) max=b;
else max=c;
if((b<=a && a<=c) || (c<=a && a<=b)) half=a;
else if((a<=b && b<=c) || (c<=b &&... | 1 | 56,147,503 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main(void){
vvi a(3, vi(3));
for(vi &vr : a) for(int &v : vr) cin >> v;
int n;
cin >> n;
for(int i=0; i<n; i++){
int b;
cin >> b;
for(vi &vr:a... | #include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
#define MOD 1000000007
#define acc... | 1 | 63,218,350 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int ans;
if (n < 10) ans = n;
else if(n < 100) ans = 9;
else if(n < 1000) ans = (n / 100 - 1) * 100 + n % 100 + 1 + 9;
else if(n < 10000) ans = 909;
else if(n <... | #include <bits/stdc++.h>
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
#define check cout<<"?\n";
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int n; cin >> n;
int ans = 0;
for(int i =... | 1 | 58,138,442 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(N); i++)
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 main() {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 1 | 19,532,106 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
string s;
cin >> s;
int cnt = 1;
s.erase(s.size()-2);
while(1){
... | 1 | 51,945,484 |
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int GCD(int a,int b){
if(b == 0)return a;
return GCD(b,a%b);
}
int main(void){
int N,X;
cin >> N >>X;
int x[N];
for(int i=0;i<N;i++){
cin >> x[i];
x[i] = abs(X-x[i])... | 1 | 41,873,808 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
string S;
cin >> S;
for (int i = 0; i < 3; i++)
{
if (S[i] == '1')
cout << '9';
else if (S[i] == '9')
cout << '1'... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
#define f(i, l, r) for (int i = l; i <= r; i++)
#define rf(i, r, l) for (int i = r; i >= l; i--)
#define all(x) (x).begin(), (x).end()
#define sf(a) scanf("%d",&a)
#define llsf(a) scanf("%lld"... | 1 | 42,092,774 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll a,b,c,k,cnt=0;
cin>>a>>b>>c>>k;
if(k<=(a+b)){
cout<<min(a,k)<<endl;
}
else{
cout<<2*a-k+b<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
#define _GLIBCXX_DEBUG
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a <... | 1 | 63,436,696 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = B - A + 1;
for (int i = A; i <= B; i++) {
string s = to_string(i);
int j = 0, k = s.size() - 1;
while (j <= k) {
if (s.at(j) == s.at(k)) {
j++;
k--;
} else {
ans--;
... | 1 | 74,974,430 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int max = 0;
int all = 0;
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == 'R') {
max += 1;
} else {
max = 0;
}
if (max > all) {
all = max;
}
}
cout << all;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
string s;
cin>>s;
ll r=0;
ll cnt=0;
for(ll i=0;i<s.length();i++)
{
if(s[i]=='R'){
r++;
cnt=max(cnt,r);
}
else{
r=0;
}
}
cout<<cnt;
} | 1 | 97,491,897 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | #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.at(i);
}
int count = 0;
while(1){
N -= K-1;
count += 1;
if(N <= 1){
break;
}
}
cout << count << endl;
} | 1 | 63,887,426 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define FIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(in) in.begin(), in.end()
ll base[65];
void smallAns(ll x){
for(ll i = 60 ; i >= 0 ; i--){
if((x>>i) & 1){
if(base[i] == 0){
... | #include<bits/stdc++.h>
using namespace std;
long long int min(long long int a, long long int b){
return (a<b) ? a : b;
}
long long int max(long long int a, long long int b){
return (a>b) ? a : b;
}
int main(){
int n,k,q;
cin >> n;
vector<long long int> a(n);
long long int res=0;
long long int allxor=0;
... | 1 | 77,602,599 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | #include<iostream>
#include<cmath>
using namespace std;
long long a[200005];
long long b[200005];
int main()
{
int n;
cin >> n;
long long sum = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (i == 0)
b[i] = a[i];
else
b[i] = b[i - 1] + a[i];
sum = sum + a[i];
}
long long min;
if (b[0] > sum - b[... | 1 | 72,659,002 |
#include <bits/stdc++.h>
long long int m,n,z,ans;
using namespace std;
long long int vp[200010],sum;
map<long long int,long long int>q;
int main()
{
int n,k;
scanf("%d %d",&n,&k);
for(int i=1;i<=n;i++)
{
scanf("%lld",&vp[i]);
vp[i]+=vp[i-1]-1;
}
for(int i=1;i<=n;i++)
vp[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
int v;
cin >> v;
a[i] = (v-1+k)%k;
}
map<int, int> cnt;
cnt[0] = 1;
int s = 0;
... | 1 | 90,907,946 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 1 | 20,057,246 |
#include <iostream>
using namespace std;
int main() {
for(;;){
int m,f,r;
cin >> m >>f >>r;
if(m==-1 && f==-1 && r==-1){break;}
if(m==-1||f==-1){
cout<<"F"<<endl;
continue;
}
if(m+f>=80){cout<<"A"<<endl;}
else if(m+f>=65){cout<<"B"<<endl;}
else if(m+f>=50||r>=50 ){cout<<"C"<<endl... | #include <stdio.h>
int main(void) {
int m, f, r, i, j;
while( 1 ) {
scanf("%d%d%d", &m, &f, &r);
if(m == -1 && f == -1 & r == -1) break;
if(m == -1 || f == -1 || m + f < 30) {
printf("F\n");
continue;
}
int s = m + f;
if(s >= 80) printf("A\n");
else if(s >= 65) printf("B\n");... | 1 | 18,783,290 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.