code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
signed main() {
int a,b,c,k;
cin >> a >> b >> c >> k;
int odd = (b - a);
int even = (a - b);
if(k % 2 == 0) cout << even << '\n';
else cout << odd << '\n';
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<functional>
#include<map>
#include<iomanip>
#include<limits>
#include<unordered_set>
#include<cmath>
using namespace std;
long long p = 1000000007;
#define int long long
#def... | 0 | 66,330,142 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i,n) {
cin >> p[i];
}
vector<int> ans;
ans.push_back(p[0]);
for(int i = 1; i < n; i++) {
if(p[i] <= ans.back())
ans... | 0 | 59,266,436 |
#include<stdio.h>
#include<string.h>
int main(){
char string[15];
char hasil[15];
scanf("%s", string);
int batas=strlen(string);
int index=0;
for(int i=0; i<batas;i++){
if(string[i]=='B'){
index--;
if(index<0){
index=0;
}
}
else{
hasil[index++]=string[i];
}
}
hasil[index]='\0';
printf("... | #include"bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
const long long mod = 1000000007;
const double eps = 1e-11;
const int inf = 1ll << 62;
int x[55],y[55];
signed main(){
int n,K;cin>>n>>K;
rep(i,n)cin>>x[i]>>y[i];
vector<int>xa,ya;
rep(i,n){
xa.push_back(x[i])... | 0 | 8,371,950 |
#include <iostream>
using namespace std;
bool solve(int,int,int,int,int);
int main()
{
int W,H,x,y,r;
cin >> W >> H >> x >> y >> r;
if(solve (W,H,x,y,r)) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
bool solve(int W,int H,int x,int y,int r)
{
if(!(x > 0 && x < W && y > 0 && y < H)) return false... | #include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[200000],N;
cin>>N;
for(int i=0;i<N;i++)
{
cin>>a[i];
}
sort(a,a+N);
for(int i=0;i<N;i++)
{
if(a[i]==a[i+1])
{
cout<<"NO"<<'\n';
return 0;
}
}
cout<<"YES"<<'\n';
return 0;
} | 0 | 92,119,116 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int a, b; cin >> a >> b;
int cnt1 = 0, cnt2 = 0, cnt3 = 0;
for (int i=0; i<n; ++i) {
int p; cin >> p;
if (p <= a) cnt1++;
else if (p >= b+1) cnt3++;
else cnt2++;
}
cout << min({cnt1, cnt2,... | #include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typed... | 0 | 51,499,223 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
int main(void){
ll n;
cin>>n;
string s;
cin>>s;
ll tmp=0,r=0,g=0,b=0;
rep(0,i,n){
if(s[i]=='R')++r;
else if(s[i]=='G')++g;
else if(s[i]=='B')++b;
rep(i+1,j,n... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int C[m], T[m][n + 1];
for(int i = 0; i < m; i++) {
cin >> C[i];
T[i][0] = 0;
}
sort(C, C + m);
for(int i = 0; i < m; i++) {
if(i == 0) {
for(int j = 1; j <... | 0 | 6,726,931 |
#include <iostream>
int a;
int b;
int c;
int main() {
std::cin >> a >> b >> c ;
int out;
if (a - b > c) {
out = 0;
} else {
out = c - (a - b);
}
std::cout << out;
} | #include<iostream>
#include<string>
#include<queue>
#include<algorithm>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
long long N; cin >> N;
vector<long long> fac(N+1);
for(int i=1; i<=N; ++i)
{
for(int k=1; k*i<=N; ++k)
{
++fac[k*i];
}
}
... | 0 | 40,883,798 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<tuple<int,int,int>> a(m+1);
for(int i=1; i<=m; i++) {
int p, y;
cin >> p >> y;
a[i... | 0 | 54,453,616 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
signed main() {
string s;
cin >> s;
bool flag = false;
if(s[0] == s[1] && s[2] == s[3]) flag = true;
if(s[0] == s[2] && s[1] == s[3]) flag = true;
if(s[0] == s[3] && s[1] == s[2]) flag = ... | #include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
int N, M, C[1 << 18];
int main() {
cin >> N >> M;
for (int i = 1; i <= M; i++) {
int num; cin >> num;
for (int j ... | 0 | 55,573,018 |
#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 dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const int INF=1e10;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
int next=1,ans=0;
rep(i,n){
if(next==a[i... | #include <stdio.h>
int main(){
int kelipatan, batas1, batas2;
scanf("%d %d %d", &kelipatan, &batas1, &batas2);
int temp=(batas2/kelipatan);
if (temp*kelipatan >=batas1){
printf("OK\n");
}
else printf("NG\n");
return 0;
} | 0 | 33,569,271 |
#include <iostream>
#include <vector>
using namespace std;
enum Query {
Unit,
Same,
};
class DisjointSet {
public :
DisjointSet(int size) {
rank.resize(size, 0);
parent.resize(size, 0);
for (int i = 0; i < size; i++) {
MakeSet(i);
}
}
bool Same(int x, int y) {
return FindSet(x) == FindSet(y);
}
void... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <functional>
#include <queue>
#include <cmath>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define rep1(i,n) for(int i=1;i<=(int)n;++i)
int N, K;
int Sum[200010];
map<int, int>... | 0 | 27,019,221 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X;
cin >>X;
int syou = X/100;
int amari = X%100;
int ans=0;
if(amari<=syou*5)ans =1;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
string S;
cin >> S;
int l=0;
int r=S.size()-1;
ll ans=0;
while(r-l>0){
if(S[l]==S[r]){
l++;
... | 0 | 10,737,457 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define pb push_back
#define ff first
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define hello777 ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#include <string>
#... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
string S;
cin >> S;... | 0 | 35,453,320 |
#include <iostream>
using namespace std;
int main(){
char ch;
while(1){
cin.get(ch);
if(ch=='\n')break;
else if(islower(ch)){
cout << (char)toupper(ch);
}else if(isupper(ch)){
cout << (char)tolower(ch);}
else{
cout.put(ch);
}
}
... | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define mod(x) ((x % MOD) + MOD) % MOD
#define int long long int
#de... | 0 | 86,637,476 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>
#include <cassert>
#include <iomanip>
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define printVector(v) rep(i, v.size()) cout << v[i] << endl;
struct UnionFind
{
vector<int> d;
Uni... | 0 | 92,430,796 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,K;
cin>>N>>K;
ll cnt;
ll ans;
cnt = N/K;
ans = cnt*cnt*cnt;
if(K % 2 == 0) {
ll add = 0;
for(int i=1; i<=N; i++){
if(i % K == K/2 && (K % 2 == 0)){
add++;
... | #include <stdio.h>
#include <vector>
#include <iostream>
#include <queue>
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
struct node{
ll num;
int cnt;
... | 0 | 66,980,982 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 998244353
#define PI 2*acos(0.0)
#d... | #include<iostream>
#include<algorithm>
using namespace std;
typedef long long Int;
Int n, k, sum, res;
Int a[108000];
int main(){
while(true){
cin >> n >> k;
if(n == 0 && k == 0)break;
for(int i = 0;i < n;i++){
cin >> a[i];
}
sum = 0;
for(int i = 0;i < k;i++){
sum += a[i];
}
res = sum;
for(int i... | 0 | 5,701,892 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(ll n, vector<ll> a) {
ll res = 0;
ll sum = 0;
ll right = 0;
for(ll left = 0;left<n; left++) {
while(right < n && (sum ^ a[right]) == (sum + a[right])) {
sum += a[right];
right++;
}
if(left == right) {
res++... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1e5+5;
int ans[maxn];
int s[maxn];
typedef pair<int,int> ii;
priority_queue<ii> pq;
signed main() {
int n;
cin>>n;
for(int i=1 ; i<=n ; i++) {
int a;
cin>>a;
pq.push(ii(a,i));
s[i]=1;
}
... | 0 | 49,161,592 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 1000000007;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
string N;
vector<int> n;
int dp[110][2][5];
int main() {
cin >> N;
int K;
cin >> K;
for (auto a : N) {
n.push_back(a-'0');
}
int l = n.size();
... | 0 | 41,828,783 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<int> to[200005];
int main()
{
int n;
cin >> n;
vector<string> w(n);
rep(i, 0, n) cin >> w[i];
map<string, int> mp;
rep(i, 0, n){
if(mp[w[i]... | #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)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long
ll;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
vector<pair<ll, int>> factorize(ll n) { ... | 0 | 3,402,492 |
#include <cstdio>
#include <iostream>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
inline char nc() {
return getchar();
static char buf[100000], *l = buf, *r = buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;
}
template<class T> void read(T &x) {
x = 0; int ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
string o,e,ans="";
cin>>o>>e;
int n=o.size()+e.size();
rep(i,n) {
if (i%2==0) {
ans.push_back(o[0]);
... | 0 | 23,555,720 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
int main(){
string s;
string target="keyence";
cin >>s;
int n=s.size();
bool a=false;
int cnnt=0;
if(s==target)a=true;
rep(i,n){
for(int j=i;... | 0 | 76,661,075 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<pair<string,int>> vc;
for(int i=0;i<n;i++){
string s; cin >> s;
int tim; cin >> tim;
vc.push_back(make_pair(s,tim));
}
string s; cin >> s;
int j;
int total = 0;
for(int i=0;i<n;i++){
if(vc... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
constexpr ll INF = ll(1e+18) + 1;
int main() {
ll N;
ll buf;
ll sum = 0;
cin >> N;
vector<ll> a(N+1);
vector<ll> b(N+1);
rep(i, N) {
cin >> buf;
a[buf]++;
... | 0 | 79,969,562 |
#include <iostream>
#include <vector>
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
using namespace std;
const ll MAX = 1e18;
int n;
int main() {
cin >> n;
vector<ll> a(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m; cin >> n >> m;
if(m % 2 == 0) {
int st = 1;
for(int i = m - 1; i > 0; i -= 2) {
cout << st << " " << st + i << '\n';
++st;
}
st = m + 1;
for(int i = m; i > 0; i -= 2) {
cout << st << " " << st + i << '\n';
++st;
}
} else {
... | 0 | 40,901,839 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int n;
cin>>n;
cout<<(n*800)-((n/15)*200)<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define fill(a,b) memset(a,b,sizeof(a))
#define f first
#define s second
#define inf 1e15
#define ninf -1*1e15
#define mod 1000000007
#define N 500005
#define Ns 5005
string s;
ll n,... | 0 | 69,216,339 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | #include <bits/stdc++.h>
#include<chrono>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
using namespace chrono;
const ll MOD = 1000000007;
const ll N = 300... | 0 | 34,643,537 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string str;
while(cin>>str) {
if(str=="-") return 0;
int m,h;
cin>>m;
for(int i=0;i<m;i++) {
cin>>h;
string sub=str.substr(0,h);
str+=sub;
str.erase(0,h);
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, Y;
cin >> N >> Y;
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) {
cout << i << ' ' << j << ' ' << N - i - j << endl;
... | 0 | 100,757,969 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> vec = {1,2,4,8,16,32,64};
int n;
cin >> n;
if(n == 1)cout << vec.at(0) << endl;
else if(2 <= n && n < 4)cout << vec.at(1) << endl;
else if(4 <= n && n < 8)cout << vec.at(2) << endl;
else if(8 <= n && n < 16)cout << vec.at(3) << endl;
e... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int T = 1;
while (T--) {
int n;
cin >> n;
int a[n + 5];
map<int, int> mp;
for(int i = 1; i <= n; i++) {
cin >> a[i];
... | 0 | 12,605,814 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int N, K;
cin >> N >> K;
vector <int> l(N);
rep(i,N) cin >> l[i];
sort(all(l));
reverse(all(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
char b;
cin >> b;
if(b == 'A' || b == 'T')
cout << (b == 'A' ? 'T' : 'A') << endl;
else
cout << (b == 'C' ? 'G' : 'C') << endl;
return 0;
} | 0 | 11,049,426 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;
int main()
{
... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | 0 | 92,828,260 |
#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 ans=0;
vector<char>memo;
ll n,k;cin >>n>>k;
ll r,s,p;cin >>r>>s>>p;
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define OUT(x) std::cout << (x) << std::endl
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << "Draw" << endl;
return 0;
}
if (A == 1) {
cout << "Alice" << endl... | 0 | 69,888,246 |
#include<stdio.h>
#include<string.h>
int main(){
int index;
scanf("%d", &index);
char string[index+2];
scanf("%s", &string);
if(index%2==1){
printf("No");
}
else{
int flag=1;
int i=0,j=0;
for(i=0;i<=(index/2)-1;i++){
j=(index/2)+i;
if(string[i]==string[j]){
flag=1;
}
else{
flag=0;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 45,136,672 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
int K;
string S;
void inc()
{
int N = S.size() - 1;
for(int i = N; i >= 0; i--)
{
int now = S[i] - '0';
if(i == 0)
{
S.clear();
if(now == 9)
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 0 | 82,054,611 |
#define _USE_MATH_DEFINES
#include<cmath>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<iostream>
#include<algorithm>
#include<string>
#include<utility>
#include<tuple>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<numeric>
#include<functional>
#incl... | #include <iostream>
#include <vector>
#include <algorithm>
#define inf 1<<30
using namespace std;
int b_search(vector<int> &dp,int k){
int a=0;
int b=dp.size();
while(a+1<b){
int m=(a+b)/2;
if(k>dp.at(m)){
a=m;
}else if(k<=dp.at(m)){
b=m;
}
}
return a;
}
int main(){
int N;
cin ... | 0 | 92,020,569 |
#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
using namespace std;
const ... | #include<bits/stdc++.h>
#define Fst first
#define Snd second
#define RG register
#define mp make_pair
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UI;
typedef unsigned long long ULL;
template<typename T> inline void read(T& x) {
char c =... | 0 | 24,522,733 |
#include <iostream>
#include <fstream>
#include <iostream>
#include "bits/stdc++.h"
using namespace std;
typedef unsigned long long ll;
typedef int integer;
#define int long long
#define ii pair<int,int>
#define vii vector<pair<int,int>>
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
cin >> A >> B;
if ( A.length() > B.length() ){
cout << "GREATER";
}
if ( A.length() < B.length() ){
cout << "LESS";
}
if ( A.length() == B.length() ){
char X = 'E';
for (int i = 0 ; i < A.length() ; i++ ){
if (A... | 0 | 86,356,766 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
#include <deque>
#include <tuple>
#include <map>
#include <set>
#include <stack>
#include <functional>
#define ll long long
using namespace std;
int main() {
int N, X, T;
cin >> N >> X >> T;
int times = ceil((double)N / X... | #include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
using namespace std;
typedef pair<ll,ll> pll;
typedef long double ld;
ll n;
vector< pll > v;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
inline ll f(ll X, ll Y)
{
return (X*X + Y*Y);
}
ld g(pll X, pll Y)
{
if... | 0 | 80,023,735 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int main() {
int n,k;
cin >> n >> k;
string a;
for(int i = 0;i < n;i++){
cin >> a;
for(int j = 0;j < 2;j++){
... | #include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <functional>
#include <numeric>
#include <vector>
using namespace std;
const double PI=acos(-1);
int main(){
int a, b, m;
cin >> a >> b >> m;
vector<int> aa(a), bb(b);
int am = 99999... | 0 | 64,617,142 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
using ll = long long;
int main() {
int n; cin >> n;
ll ans = 0;
ll high = 0;
rep(i, n){
ll a; cin >> a;
ans += max(high - a, ll(0));
high = max(a, high);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
void solve(){
int n,m;
cin>>n>>m;
vector<int>sw[n+1];
for(int i=0;i<m;i++){
int s;
c... | 0 | 90,853,889 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int prev = s.at(0) - '0';
int ans = 0;
for (int i = 1; i < (int)s.size(); i++) {
int n = s.at(i) - '0';
if (n == prev) {
n = 1 - prev;
s.at(i) = (char)n;
ans++;
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;
int main(){
int N;
cin>>N;
vector<ll> A(N),R(N);
for(int i(0);i<N;i++){
cin>>A[i];
}
sort(A.rbegin(),A.rend());
ll l = 0,r = N;
while(l+1<r){
ll x = (l+r)/2;
... | 0 | 22,983,641 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N=0,A=0,rest_space=0;
cin >> N;
N=N*N;
cin >> A;
rest_space=N-A;
cout << rest_space << endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
using namespace std;
const int MAX = 1000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[... | 0 | 18,393,706 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for... | 0 | 9,024,924 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
struct edge {
ll to;
ll cost;
};
int n;
vector<vector<edge>> g;
vector<ll> d;
void dfs(ll s, ll di, ll pa = -1) {
d[s] = min(d[s], di);
for (auto t : g[s]) {
if... | #include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.... | 0 | 81,633,262 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include<algorithm>
#include<cctype>
using namespace std;
const int M = 100000;
const double pi = 3.141592653589;
int sum(int n, int array[]) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum += array[i];
}
return sum;
}
int main(){
char c... | #include<iostream>
#include<cstdio>
using namespace std;
inline int rd(){
int ret=0,af=1; char gc=getchar();
while(gc < '0' || gc > '9'){ if(gc == '-') af=-af; gc=getchar(); }
while(gc >= '0' && gc <= '9') ret=ret*10+gc-'0',gc=getchar();
return ret*af;
}
int main(){
int a=rd(),b=rd();
printf("%d",a-b+1);
return ... | 0 | 100,053,431 |
#include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define Rep(i, n) for(int i = 1; i < n; i++)
const int mod = 1000000007;
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;
using... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
long long getDigit(long long n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),... | 0 | 41,303,642 |
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#inclu... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
bool zero = false;
long long res = 1, input;
vector<long long> numbers;
for (int i = 0; i < n; ++i) {
cin >> input;
if (!input) {
zero = true;
break;
}
numbers.push_back(input);
}
if (zero)
res ... | 0 | 40,511,159 |
#include <iostream>
using namespace std;
struct Dice
{
int lable1;
int lable2;
int lable3;
int lable4;
int lable5;
int lable6;
};
struct Dice num;
void mN(Dice &num)
{
int tmp = num.lable1;
num.lable1 = num.lable2;
num.lable2 = num.lable6;
num.lable6 = num.lable5;
num.lable5 ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 30,709,219 |
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#defi... | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int a,b,c,d;
cin>>a>>b>>c>>d;
long s=(long)b*d,t=(long)a*c;
if(s<t){
s=t;
}
t=(long)a*d;
if(s<t){
s=t;
}
t=(long)b*c;
if(s<t){
s=t;
}
cout<<s<<endl;
return 0;
} | 0 | 41,887,265 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
vector<vector<int>> V0(H, vector<int>(W, 0));
char D;
char B = '#';
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> D;
if (D == B) {
V0.at(i).at(j) = 1;
}
else {... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
using namespace std;
#define REP... | 0 | 82,530,767 |
#include <bits/stdc++.h>
#include <list>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 100000007;
using Graph = vector<vector<int>>;
int main(){
int N,M;
cin >> N >> M;
int ans = 0;
int a,b;
a=0;
b=0;
if... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
using namespace std;
long long int num[2000000]={};
int main() {
const long long int mod = 1000000007,INF=50... | 0 | 42,428,558 |
#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; typedef pair<int,int> pii;... | #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<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
int main(){
int n,k;cin>>n>>k;
vector<ll>v(n);
for (int i = 0; i ... | 0 | 5,208,873 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pin;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
#define ff(i, a, b) for ( ll i=a; i<(b); i++)
#define ffd(i, a, b) for... | #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
s... | 0 | 62,828,223 |
#include <iostream>
using namespace std;
class Dice {
private:
int dice[6];
int tmp;
public:
Dice(int a, int b, int c, int d, int e, int f) {
dice[0] = a;
dice[1] = b;
dice[2] = c;
dice[3] = d;
dice[4] = e;
dice[5] = f;
}
void roll(char ch) {
if(ch == 'N') {
rollN();
}
else if(ch == 'E') {
rol... | #include <iostream>
#include <math.h>
#include <sstream>
using namespace std;
string bubble_sort(string, int, int&);
string select_sort(string, int, int&, int&);
string stringArrayToString(string*, int);
int main()
{
string str;
getline(cin, str);
int num;
stringstream num_ss(str);
num_ss >> num;
getline(cin, str... | 0 | 78,391,462 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
template<class T>
using MaxHeap = std::priority_queue<T>;
int main(){
cout << setprecision(10);
MaxHeap<ll> pq;
int N, M; cin >> N >> M;
vector<pair<ll,ll>> v(N);
for(int i = 0; i < N;... | #include <stdio.h>
int main() {
int m, f, r;
int mf;
scanf("%d %d %d", &m, &f, &r);
mf = m + f;
while(m != -1 || f != -1 || r != -1) {
if(m == -1 || f == -1) {
printf("F\n");
} else if(mf >= 80) {
printf("A\n");
} else if(65 <= mf && mf < 80) {
printf("B\n");
} else if(50 <= ... | 0 | 35,335,194 |
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main(... | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, a, b, s, mn=1e9;
int main() {
cin >> n;
while(n--) {
scanf("%lld%lld", &a, &b);
s += a;
if(a>b) mn = min(mn, b);
}
cout << (mn<1e9 ? s-mn : 0);
return 0;
} | 0 | 46,282,501 |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define FOR(i,a,b) for(ll i=a; i<= b; ++i)
#define all(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp m... | #include<bits/stdc++.h>
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define w(x) scanf("%d",&x);while(x--)
#define rep(i,a,b) for(i=a;i<=b;i++)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi 2*acos(0.0)
using namespace std;
typedef long long ll;
typedef pair... | 0 | 12,023,301 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
int main() {
int r,g;
cin >> r >> g;
cout << 2 * g - r << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
long long int n,m;
cin>>n>>m;
long long int arr[n];
long long int brr[m];
for(int i = 0;i<n;i++)
{
cin>>arr[i];
}
for(int i = 0;i<m;i++)
{
cin>>brr[i];
}
long long int dp[n+1][m+1];
for(int i = 0 ;... | 0 | 13,924,387 |
#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;
using ll=long long;
using ld=long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | 0 | 60,607,763 |
#include <iostream>
#include <cstdio>
using namespace std;
long long gcd(long long a, long long b){
if(b== 0){
return a;
}
return gcd(b, a%b);
}
int main(){
long long n;
cin >> n;
long long a[n];
for(long long i = 0; i < n; i++) cin >> a[i];
long long g;
for(long long i = 0; i < n; i++... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 86,416,310 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for (int i=0;i<n;i++)
int main(){
int n;
cin >> n;
vector<int> l(n);
vector<int> r(n);
rep(i,n) cin >> l.at(i) >> r.at(i);
int ans=0;
rep(i,n) ans += 1 + r[i] - l[i];
cout << ans << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,D;
cin >>N>>D;
vector<vector<double>>vec(N,vector<double>(D));
for(int i=0;i<N;i++){
for(int j=0;j<D;j++){
cin>>vec.at(i).at(j);
}
}
int count=0;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){... | 0 | 42,789,960 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
string ptn = "keyence";
int n = ptn.size();
string ans = "NO";
if( S == ptn ) ans = "YES";
if( S.substr( 0, n ) == ptn ) ans = "YES";
if( S.substr( S.size() - n, n ) == ptn ) ans = "YES";
for( int i = 1; ans == "NO" && i < ptn.size(... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 86,137,240 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x;
scanf("%d", &x);
int k = 1;
while (k * x % 360 != 0) k++;
printf("%d\n", k);
return 0;
} | #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
const ll MOD = 10000... | 0 | 34,238,832 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int count = 1;
cin >> a >> b >> c;
if (a != b) count++;
if (a != c) count++;
if (b == c) count--;
if (count == 0) count++;
cout << count << endl;
} | #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, k;
cin >> n >> k;
vector<int> int_seq(n);
rep(i, n){cin >> int_seq.at(i);}
rep(i, n){int_seq[i]--;}
vector<int> cumulative_sum(n+1);
for (int i = 0; i < (n); ... | 0 | 19,979,088 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long N, A, B;
cin >> N >> A >> B;
if(A > B){
cout << 0 << endl;
return 0;
}
if(N == 1){
if(A < B){
cout << 0 << endl;
return 0;
}
if(A == B){
cout << 1 << endl;
... | #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<ll> vi;
typedef pair... | 0 | 62,982,996 |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) d... | #include <bits/stdc++.h>
using namespace std;
template <class T> using vec = vector<T>;
template <class T, class U> using vep = vec<pair<T,U> >;
template <class T> using PQ = priority_queue<T>;
using ll = long long;
using vll = vec<ll>;
using pll = pair<ll, ll>;
using vpll = vec<pll>;
using str = string;
static const l... | 0 | 26,258,301 |
#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()
{
map<string, int> mp;
string s, t;
cin >> s >> t;
int a, b;
cin >> a >> b;
mp[s] = a;
mp[t] = b;
string u;
cin >> u;
mp[u]--;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n;
ll t[100005],x[100005],y[100005];
int main(void){
cin>>n;
t[0]=0; x[0]=0; y[0]=0;
for(int i=1;i<=n;i++){
cin>>t[i]>>x[i]>>y[i];
if(t[i]-t[i-1]<(abs(x[i]-x[i-1])+abs(y[i]-y[i-1]))||(x[i]+y[i])%2!=... | 0 | 59,254,653 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
deque<char>c;
for(int i=0;i<s.length();i++)
{
c.push_back(s[i]);
}
bool flag = true;
string loc;
string s1 = "maerd",s2 = "remaerd",s3 = "esare",s4 = "re... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &... | 0 | 63,487,101 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i = x; i < (int)(n); i++)
#define rep_ll(i,x,n) for(ll i = x; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[] = {-... | #include <iostream>
using namespace std;
int main() {
int n,m;
cin>>n>>m;
int ass=0,t;
while(m--){
cin>>t;
ass+=t;
}if(ass>n){
cout<<-1;
}else cout<<n-ass;
return 0;
} | 0 | 70,645,756 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#define R... | #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 int long long
#define _GLIBCXX_DEBUG
signed main() {
int N; cin >> N;
vector<int> D(N);
rep(i, N) cin >> D[i];
if(D[0] != 0) {
cout << 0 << endl;
return 0;
}
s... | 0 | 53,150,866 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define vii vector<int>
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pdd pair<double,double>
#define pldld pair<long long double, long long double>
#define ff first
#define ss second
#define pb pu... | #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 | 25,635,712 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
string s; cin >> s;
int k; cin >> k;
ll c = 1, head = -1, tail = 0;
ll ans = 0;
ll len = s.length();
for(int i = 1; i < len; i++){
if(s[i-1] == s[i]){
c++;
}else{
... | #define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) ... | 0 | 78,408,684 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 0 | 45,409,791 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define whatis(x) cout << #x << " is " << x<<" ";
#define whatisl(x) cout << #x << " is " << x<<"\n";
#define parr(array,end)for(ll loop=0;loop<end;loop++)cout<<array[loop]<<" ";cout<<"\n";
#define lline cout<<"\n";
#define e... | #include<iostream>
using namespace std;
int main(){
for(;;){
int i,j,o;
cin >> i >> j;
if((i == 0) && (j == 0)){
break;
}
if(i > j){
o = i;
i = j;
j = o;
}
cout << i << " " << j << endl;
}
} | 0 | 2,261,908 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n;
cin >> n;
int cnt = 1;
int m;
cin >> m;
for(int i=1; i<n; i++){
int tmp;
cin >> tmp;
if(m<=tmp){
cnt++;
m = tmp;
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long gcd(long long a, long long b) {
if (a%b == 0) {
return b;
} else {
return gcd(b, a%b);
}
}
long long lcm(long long a, long long b) {
return (a / gcd(a, b)) * b;
}
int main() {
... | 0 | 22,284,643 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int N, M; cin >> N >> M;
vector<vector<int>> A(M);
r... | 0 | 41,534,006 |
#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
#define REP(i,n) for (int i = 0; i < n; ++i)
const int MAX = 2e5+10;
int N;
int A[MAX];
bool check(int n) {
map<int, int> m;
REP (i, N-1) {
if (A[i+1] > A[i]) continue;
int a = A[i+1];
while (m[a] == n-1) {
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MOD 1000000007
#define test int t; cin>>t; while(t--)
#define init(arr,val) memset(arr,val,sizeof(arr))
#define loop(i,a,b) for(int i=a;i<b;i++)
#define loopr(i,a,b) for(int i=a;i>=b;i--)
#define loops(i,a,b,s... | 0 | 22,391,667 |
#include<stdio.h>
#include<string.h>
int main(void){
char str[1001];
int q;
char Q[101];
int i;
int a,b,m;
scanf("%s",str);
scanf("%d",&q);
for(i=0;i<q;i++){
scanf("%s",Q);
if(strcmp(Q,"replace") == 0){
scanf(" %d",&a);
scanf(" %d",&b);
m = (b-a)+1;
char p[m];
scanf("%s",p);
memcpy( a + ... | #include <bits/stdc++.h>
using namespace std;
long long const MX = 2e5 + 2, MOD = 1e9 + 7;
long long c[MX], p[MX];
int main()
{
long long t = 1;
while(t--){
long long n , k;
cin>>n>>k;
long long mx = -1e9 - 1;
for(long long i = 0; i < n; i++) cin>>p[i],p[i]--;
for(long lo... | 0 | 65,720,222 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k; cin >> n >> k;
ll ans = 1;
ll cnt = n;
ans *= k;
cnt--;
if (cnt != 0) {
while (cnt--) {
ans *= k - 1;
}
}
cout << ans << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | 0 | 92,173,639 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
#define reverse(s) reverse(s.begin(),s.end())
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n; cin >> n;
int sx = 0,sy = 0,diff = 0;
... | 0 | 67,342,972 |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-... | #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... | 0 | 67,077,894 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,n,m;
cin>>a>>b;
n = a / 500;
m = a % 500;
if(a-n*500 > b){
cout<<"No"<<'\n';
}
else{
cout<<"Yes"<<'\n';
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const i... | 0 | 28,835,662 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define OP ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repr(i,n) for(int i = n - 1; i >= 0; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
int main(){
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) cin >> h.at(i);
int ans = 0;
while (true) {
bool flag = false;
int cnt = 0;
... | 0 | 67,206,543 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | 0 | 16,417,755 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 77,503,915 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
int main(){
string s;
cin>>s;
map<char,int> mp;
rep(i,0,s.size()){
mp[s[i]]++;
if(mp[s[i]]>1){cout<<"no"<<endl;return 0;... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll maxn=1e5+10, ma... | 0 | 9,519,088 |
#include <stdio.h>
int main() {
int K, A, B;
scanf("%d %d %d", &K, &A, &B);
int N = (B/K) * K;
(N > B || N < A) ? puts("NG") : puts("OK");
return 0;
} | #include <vector>
#include <math.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <deque>
#include <cctype>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<long, lo... | 0 | 2,275,406 |
#include<bits/stdc++.h>
using namespace std;
void solve(){
long long a,b,c,d,x,y;
cin>>a>>b>>c>>d;
x=max(b*d,a*c);
y=max(a*d,b*c);
cout<<max(x,y);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
} | #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... | 0 | 61,776,483 |
#include<iostream>
using namespace std;
int p;
int main(){
while(true){
cin>>p;if(p==0)break;
p=1000-p;
int a1=p/500;p-=500*a1;
int a2=p/100;p-=100*a2;
int a3=p/50;p-=50*a3;
int a4=p/10;p-=10*a4;
int a5=p/5;p-=5*a5;
int a6=p/1;p-=1*a6;
cout<<a1+a2+a3+a4+a5+a6<<endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 58,787,330 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll k, a, b;
cin >> k >> a >> b;
if (b - a <= 2) {
cout << k + 1 << "\n";
}
else {
ll ans = a;
k -= ... | #include <cstdio>
#include <ctime>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <bitset>
#include <stack>
#include <set>
#include <vector>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long... | 0 | 83,807,248 |
#include <cstdio>
#include <algorithm>
using namespace std;
int n, a[100005];
int main() {
int i;
scanf("%d", &n);
for(i=0; i<n; i++) scanf("%d", &a[i]);
sort(a, a+n);
for(i=0; 2*a[i]<a[n-1]; i++);
printf("%d %d", a[n-1], a[n-1]-2*a[i-1] <= 2*a[i]-a[n-1] ? a[i-1] : a[i]);
return 0;
} | #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 | 79,983,025 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
using namespace std;
int main(void){
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<vector<ll>> data(2, vector<ll>(0));
int cur = 1, num = 0;
for (ll i = 0; i < s.size(); i++)... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 55,453,146 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod*3LL;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
in... | #include<bits/stdc++.h>
#define ll long long
#define mod 838627288460106
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
fast_io
ll n,y,i,j,c10k=0,c5k=0,c1k=0;
cin>>n>>y;
bool ok=1;
for(i=0; i<=n; i++)
{
for(j=0; j<=n; j++)... | 0 | 36,742,824 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for (typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
... | 0 | 64,997,358 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#include<cmath>
#define ll long long
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
static const int MAX = 200005;
vector<pair<ll,int> > X;
template<typename T>
struct LazySegmentTree {
private:
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long>>;
template<class T> in... | 0 | 47,358,588 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | 0 | 68,565,061 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include <iostream>
using namespace std;
int main()
{
int l, i = 0, buf[10000], cnt = 1;
while (cin >> l) {
buf[i++] = l;
}
for (int j = 0; j < i; j++) {
int num = buf[j];
if (num == 0)
continue;
cout << "Case " << cnt++ << ": " << num << endl;
}
retur... | 0 | 60,792,408 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<ll> a(n+1);
for(i = 0;i <= n;++i){
cin >> a.at(i);
}
vector<ll> limi2(n+1,1);
for(i = 1;i <= n;+... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
const int INF = 1000000007;
int main() {
ll L, R;
cin >> L >> R;
R = min(R, L + 4038);
ll ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1;... | 0 | 20,485,252 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
vector<int> l(n);
rep(i,n) cin >> l[i];
sort(l.begin(),l.end(),greater<int>());
int sum = 0;
rep(i,k) sum += l[i];
cout << sum << endl;
retu... | #include<stdio.h>
int main(){
int n,k,x,y;
scanf("%d %d %d %d", &n, &k, &x, &y);
int total = 0;
while(n--){
if(k > 0){
total += x;
}
else{
total += y;
}
k--;
}
printf("%d\n", total);
return 0;
} | 0 | 35,461,924 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef complex<double> pnt;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, pii> pp;
typedef double ld;
typedef long double lld;
#define INF 0x3f3f3f3f ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
int k,n;
cin>>k>>n;
int dis=-1;
int a[200010];
rep(i, n){
cin>>a[i];
if(i!=0){
int tmp=a[i]-a[i-1];
dis=max(dis,tmp);
}
}
... | 0 | 78,833,136 |
#include<iostream>
#include<algorithm>
int n, s;
bool numbers[10] = { true };
int ans;
void dfs(int sum, int i, int num){
if (i == n){
if (sum == s) ans++;
return ;
}
for (int j = num+1; j < 10; ++j){
if(sum + j <= s)dfs(sum + j, i + 1,j);
}
}
int main(){
while (std::cin >> n >> s){
if (n == 0 && s == 0)br... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<ctime>
#define re register
const int MAXN=2e5+10;
int n,K,s[MAXN],a[MAXN],timee;
char fin[10010],*p1=fin,*p2=fin;
char getc()
{
return p1==p2&&(p2=(p1=fin)+fread(fin,1,10000,stdin),p1==p2)?EOF:*p1++;
}
int read()
{
re int x=0;
re char ch=0;
while(ch<'0'... | 0 | 89,636,873 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.