code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include "bits/stdc++.h"
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define LOWER_BOUND(A, key) distance(A.begin(),... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
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> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax... | 1 | 88,213,708 |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
template <class RandomIt>
size_t ssort(RandomIt first, RandomIt last) {
size_t times=0;
for (RandomIt it=first; it<last; ++it) {
RandomIt min_=it;
for (RandomIt it2=it+1; it2<last; ++it2)
if (*min_ > *it2)
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
void outStr(vector<int>& ary) {
string aryStr = "";
for (int i = 0; i < ary.size(); i++)
{
aryStr = aryStr + to_string(ary[i]);
if (i < ary.size() - 1) aryStr = aryStr + " ";
}
cout << aryStr << endl;
return;
}
i... | 1 | 1,364,897 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
signed main()
{
int n,m,x;
cin>>n>>m>>x;
int arr[n][m+1];
for(int i=0;i<n;i++)
{
for(int j=0;j<=m;j++)
{
cin>>arr[i][j];
}
}
int cost=INT_MAX;
for(int it=0;it<(1<<n);it++)
{ vector<int>dp(m+1,0... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define SZ(x) ((int)(x).size())
#define fastin ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
const int ... | 1 | 72,973,841 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <iomanip>
#include <cstdio>
#include <stack>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<string>
using namespace std;
typedef long long ll;
void optimize_cpp_stdio() {
std::ios::sync_with_stdio(false);
std::cout.tie(NULL);
std::cin.tie(NULL);... | 1 | 48,404,025 |
#include <iostream>
#include <vector>
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
template<typename A> using V = std::vector<A>;
using vi = V<int>;
using vvi = V<vi>;
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
const in... | #include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<iomanip>
#include<complex>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VV... | 1 | 53,090,958 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int fN = 0;
cin >> N;
for(int n = N; n > 0; n = n / 10){
fN += n % 10;
}
if(N % fN == 0){
cout << "Yes" << endl;
}
else cout << "No " << endl;
} | #include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | 1 | 47,326,257 |
#include<iostream>
int main(){
unsigned long long int a;
double b;
std::cin >> a >> b;
int bb = b * 100 + 0.5;
unsigned long long int ans = a * bb / 100;
std::cout << ans << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define Fast_Input ios_base :: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds... | 1 | 81,772,334 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <map>
using namespace std;
int main() {
int N, D, X, *a, sum = 0;
cin >> N >> D >> X;;
a = new int[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
sum += (D - 1) / a[i] + 1;
}
cout << sum + X... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, X;
cin >> N >> D >> X;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
int ans = X;
for (int i = 0; i < N; i++) {
int days = 0;
for (int j = 0; j < D; j++) {
days = j * A[i] + 1;
if (D >= days) ans++;
... | 1 | 12,953,698 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline int rd(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=0;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
return f?x:-x;
}
struct Edge{
int nxt,to;
}e[400050];
int fir[200050],n,cnt;
inline v... | #include <bits/stdc++.h>
#define MOD 100000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n;
vector<int> G[100001];
int dp[100001];
bool used[100001];
int cnt[100001];
int dfs(int v,int p){
int res=0;
for(int i=0;i<G[v].size();i++){
if(G[v][i]!=p){
res^=(dfs(G[v][i],v)+1);
}
}
... | 1 | 77,373,137 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<ll> a(n);
for(int i = 0; i < n; i++) cin >> a.at(i);
vector<ll> b(n + 1), c(n + 1);
for(int i = 0; i < n; i++){
b.at(i + 1) = b.at(i) + a.at(i);
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | 1 | 13,385,025 |
#include <iostream>
#include <string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
#define INF long long int(1e18+1)
#define rep(i,n,m) for(int i=n;i<m;i++)
using namespace std;
int main() {
string s, t, u;
int x, y;
cin >> s >> t... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string a, b; cin >> a >> b;
int na, nb; cin >> na >> nb;
string s; cin >> s;
if(a == s) --na;
else --nb;
cout << na << " " << nb;
return 0;
} | 1 | 88,844,821 |
#include <iostream>
#include <string>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
string s, t;
int i, ans=0;
cin >> s >> t;
for (int i = 0; i < 3; i++) {
if (s[i] == t[i])ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string S, T;
cin >> S >>T;
int ans=0;
for (int i=0; i<3; i++) {
if (S.at(i)==T.at(i)) {
ans=ans+1;
}
}
cout << ans << endl;
} | 1 | 2,009,445 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
int P[1000004] = {0};
string S, T;
int main(in... | #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... | 1 | 70,279,537 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std;
int num[1005];
int main()
{
int n,k;
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++)
scanf("%d",&num[i]);
int ans=-100000000;
for(int a=0;a<=k;a++)
{
for(int b=0;b<=k;b++)
{
for(int c=0;c<=k;c++)
{
if((a+b+c)<=... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int m... | 1 | 35,656,820 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int n = s.size();
n -= 2;
s = s.substr(0, n);
while (1) {
string t = s.substr(0, n / 2);
t += t;
if (s == t) {
cout << n << endl;
return 0;
}
n -= 2;
s = s.substr(0, n);
... | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#include "/home/v-o_o-v/deb.h"
#define deb(x...)cerr << "[" << #x << "] = [";_print(x);
#else
#define deb(x...)
#endif
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).r... | 1 | 4,094,637 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <queue>
#include <utility>
#include <functional>
#include <sstream>
using namespace std;
#define ll long long
int main(void){
... | #include <iostream>
#include <cmath>
using namespace std;
int sign(int x){
return (x>0)-(x<0);
}
int main(){
int x,y;
int count = 0;
cin >> x >> y;
if( sign(x)*sign(y)==1 ){
if( x<y ) cout << y-x << endl;
if( x>y ) cout << x-y+2 << endl;
}
if( sign(x)*sign(y)==-1 ){
if( sign(x)*x<=sign(y)*y ) ... | 1 | 9,077,637 |
#include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int a,int b){return (int64_t)a*b/gcd(a, b);}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int a){if(a<=1)return false;for(int i=2;(int64_t)i*i<=a;i++){if(a%i==0)return fa... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
double n,k;
cin>>n>>k;
for(int i=0;i<n;++i){
int a;
cin>>a;
}
cout<<ceil((n-1)/(k-1));
... | 1 | 15,059,468 |
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 1000005;
vector<int> G[maxn];
int sg[maxn];
void dfs(int u, int fa)
{
sg[u] = 0;
for (auto v : G[u]) {
if (v == fa)
continue;
dfs(v, u);
sg[u] ^= sg[v] + 1;
}
}
int main()
{
... | #include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 100010
int Adj[MAXN],V[MAXN*2],nxt[MAXN*2],c,n;
void AddEdge(int u,int v)
{
c++;V[c]=v,nxt[c]=Adj[u];Adj[u]=c;
}
int dfs(int u,int p)
{
int ret=0;
for(int i=Adj[u];i;i=nxt[i])
if(V[i]!=p)
{
ret^=dfs(V[i],u)+1;
}
return ret;
}
int main()... | 1 | 34,818,847 |
#include"bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
rep(i, 7) {
if (S.substr(0, i) + S.substr(S.size() - 7 + i, 7 - i) == "keyence") {
puts("YES");
return 0;
}
}
puts("NO");
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | 1 | 70,770,517 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin >> n >> a >> b;
vector<int> p(n);
for(int i = 0; i <n; i++){
cin >> p[i];
}
int cnt1 = 0, cnt2 = 0, cnt3 = 0;
for(int i = 0; i <n; i++){
p[i] <= a ? cnt1++ :p[i] > a && p[i] <= b ? cnt2++ : cnt3++;
}
... | #include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<T... | 1 | 88,276,389 |
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int d[n];
rep (i, n) cin >> d[i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 1 | 65,124,486 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MOD=1000000007;
int main() {
int n,m;
cin >> n >> m;
cout << (1900*m+100*(n-m))*pow(2,m) << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
int main()
{
ll N,M; cin>>N>>M;
ll T=(N-M)*100+1900*M;
cout<<T*pow(2,M)<<endl;
return 0;
} | 1 | 24,248,729 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
ll n;
int main()
{
_FastIO;
cin >> n;
if(n % 2){
cout << "0" << endl;
return 0;
}
ll k = 1;
ll a... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define pb push_back
#define vvi vector<vi>
signed main() {
int n;
cin >> n;
if(n % 2) {
cout << 0 << endl;
return 0;
}
int cnt = 0;
for(int i = 10; i <= n; i *= 5) {
cnt += (n /... | 1 | 95,973,433 |
#include <iostream>
#include <utility>
using namespace std;
int main(int argc, char const* argv[])
{
int n, ar[100], swapc = 0;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
for (int i = 0; i < n - 1; i++) {
int minj = i;
... | #include <sstream>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iterator>
#include <numeric>
#include <f... | 1 | 52,844,077 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<math.h>
#include<limits>
#include<list>
#include <stdio.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0;i < (n); ++i)
#pragma GCC optimize("Ofast")
int main() {
int n;
cin >> n;
if (n >= 64)... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(void){
int N;
cin >> N;
int cmax = 0, Nmax = 1;
for (int i = 1; i <= N; i++) {
int c = 0;
int t = i;
while (t%2 == 0){
c++;
t /= 2;
}
if (c > cmax){
cmax = c;
Nmax = i;
... | 1 | 1,295,967 |
#include <iostream>
#include <stack>
using namespace std;
int main()
{
stack<int> trains;
int i;
do
{
cin >> i;
if (i != 0) trains.push(i);
else
{
if (trains.empty()) break;
cout << trains.top() << endl;
trains.pop();
}
} while (true);
return 0;
} | #include<stack>
#include<cstdio>
using namespace std;
int main(){
int n;
int temp;
stack<int> data;
while(1){
scanf("%d",&n);
if(n!=0){
data.push(n);
}
else{
if(data.empty() == true)break;
else{
printf("%d\n",data.top());
data.pop();
}
}
}
return 0;
} | 1 | 78,763,633 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, vector<long long> a){
vector<long long> v(N + 1);
for(int i = 0; i < N; ++i) {
v[i + 1] = v[i] + a[i];
}
long long res = (long long)1e+18;
for(int i = 1; i < N; ++i) {
res = min(res, abs(v[i] - (v[N] - v[i])));
}
cout << res << endl;
}
int... | #include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <limits.h>
#define MAXN 200000;
#define Amari 1000000007;
#define p pair <int,int>
using namespace std;
int main(int argc,char const* argv[])
{
int n;
cin >> n;
vector<long long> a(n,0);
lon... | 1 | 95,012,689 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repo(i,N) for(int i = 1; i < (N); i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define pi acos(-1.0)
int main() {
string s;
cin >> s;
cout <... | 1 | 41,824,648 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n, sum;
bool flg = false;
cin >> n;
vector<ll> t(n+1,0), x(n+1,0), y(n+1,0);
for (int i = 1; i <= n;i++){
cin >> t[i] >> x[i] >> y[i];
sum = t[i] - t[i - 1];
sum -= abs(x[i - 1] - x[i]) + abs(y[i - 1] - y[i]);
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, N;
cin >> N;
int t[100001], x[100001], y[100001], z[100001];
for (int i = 0; i < N; i++) cin >> t[i+1] >> x[i+1] >> y[i+1];
t[0] = 0; x[0] = 0; y[0] = 0;
for (int i = 0; i <= N; i++) z[i] = x[i] + y[i];
for (int i = 0; i< N; i++) {
a... | 1 | 83,274,453 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define ... | #include<bits/stdc++.h>
using namespace std;
vector<int> cnt(100005,0);
int main(){
int N, M;
scanf("%d %d", &N, &M);
for(int i=0; i<M; i++) {
int a, b;
scanf("%d %d", &a, &b);
cnt[a-1]++, cnt[b-1]++;
}
bool flag = true;
for(int i=0; i<N; i++) {
if(cnt[i]%2) flag ... | 1 | 40,738,165 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N, M;
cin >> N >> M;
vector<int> memo(N);
vector<int> A(M), B(M);
for (int i = 0; i < M; i++) {
cin >> A.at(i) >> B.at(i);
if (A.at(i) == 1) {
memo.at(B.at(i) - 1)++;
}
if (B.at(i) == 1) {
memo.at(A.at(i) - 1)++;
}... | 1 | 92,342,432 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
typedef l... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long N,cnt,now,ans;
cin>>N;
vector<long long> H(N);
rep(i,N) cin>>H[i];
cnt=0;
now=H[0];
ans=0;
rep(i,N-1){
if(now<H[i+1]){
if(ans<cnt) ans=cnt;
cnt=0;
}
else cnt++;
now=H[i+1];
}
if(... | 1 | 79,190,476 |
#include <bits/stdc++.h>
#define int long long int
#define gif(a,b) (a/b +(a%b?1:0))
#define watch(x) cout<<(#x)<<" is "<<(x)<<"\n";
using namespace std;
int32_t main()
{
cin.tie(NULL);
std::ios::sync_with_stdio(false);
int s, t;
cin >> s >> t;
if(s <= t)
cout << "unsafe";
else
cout << "saf... | #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 S, W;
cin >> S >> W;
cout << (W >= S ? "unsafe" : "safe") << endl;
} | 1 | 35,003,465 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<(n);++i)
#define rep2(i,a,b) for (ll i=(a);i<(b);++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(),(v).end()
const ll MOD=1e9+7;
const ll I... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 1 | 87,913,500 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <deque>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
u... | 1 | 78,590,206 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
set<long long> a;
long long b,ma=0;
for (int i = 0; i < n; ++i)
{
cin>>b;
a.insert(b);
ma=max(ma,b);
}
if (n==2)
{
cout<<ma<<" "<<*a.begin()<<endl;
return 0;
}
auto i=a.lower_bound(ma/2LL+1LL);
if... | #include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
int comb(int n, int r){
int res = 1;
for(int i=0; i<r; i++){
res = res*(n-i)/(i+1);
}
return res;
}
int main(){
int n;
cin >> n ;
vector<int> vec(n);
for(int i=0; i<n; i++){
cin >> vec.at(i);
}
std::sort(vec.begin(), vec.end());
int resa = ... | 1 | 94,588,250 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
char a,b;
cin >> a>>b;
if(a=='H'&&b=='H'||a=='D'&&b=='D') cout << 'H' << endl;
else cout << 'D' <... | #include<bits/stdc++.h>
using namespace std;
int main(void){
char a, b;
cin >> a >> b;
if(a == b){
cout << "H" << "\n";
return 0;
}
cout << "D" << "\n";
return 0;
} | 1 | 40,988,611 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 0;
int main()
{
ll n ;
cin >> n ;
char s[n][n];
rep(i,n)rep(j,n){
cin >> s[i][j];
}
ll t[n][n]={};
rep(i,n)rep(j,n){
rep(k,n-1){
if(s[(i+k+1)%n][j]!=s[i][(j+k+1)%n]){
t[i][j]=k;
... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
ll N, ans=0, tmp=0;
vector<ll> A;
signed main(){
cin >> N;
char S1[N][N], S2[N][N];
for(int i=0;i<N;i++) {
for(int j=0;j<N;j++) {
cin >> S1[i][j];
... | 1 | 41,627,679 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
a.at(5) = ' ';
a.at(13) = ' ';
cout << a << endl;
} | #include <stdio.h>
int main(){
char s[19];
scanf("%[^\n]",s);
int lol;
for(int i=0;i<19;i++){
if(s[i]==','){
printf(" ");
}else {
printf("%c",s[i]);
}
}
return 0;
} | 1 | 43,667,064 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int p,q,r,sum,maxm;
cin >> p >> q >> r;
sum = p + q + r;
maxm = max({p,q,r});
cout << sum - maxm;
} | #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)
using ll = long long;
const int Inf = 100100100;
const double EPS = 1e-9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int p, q, r;
cin >> p >> q >> r;
... | 1 | 1,466,533 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s1,s2;
cin>>s1>>s2;
cout<<s2<<s1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout <<... | 1 | 31,906,782 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll m,v,a[100009];int n,p;
bool check(ll x){
if(a[n-p+1]>x+m) return 0;
ll sum=m*v-(p-1)*m;
for(int i=1;i<=n-p+1;i++){
ll t=x+m-a[i];
if(t<=0) break;
sum-=min(t,m);
if(sum<=0) return 1;
}
if(sum>0) return 0;
return 1;
}
int main() {
scanf(... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, v, p;
cin >> n >> m >> v >> p;
vector<long long> A;
A.reserve(n);
copy_n(istream_iterator<long long>(cin), n, back_inserter... | 1 | 16,920,937 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<stack>
#include<string>
#include<cstring>
#include<cstdio>
#define ll long long
#define ull unsigned long long
#define IO ios::sync_with_stdio(false), cin.tie(0)
#define endl '\n'
#define pi acos(-1)
#define l... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n;
cin >> n;
int g = 0;
vector<int> fre(1e6+50, 0);
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
fre[x]++;
g = __gcd(g, x);
}
if (g != 1) {
cout << "not coprime\n";
... | 1 | 69,482,585 |
#include <iostream>
using namespace std;
int main(void){
int n,m;
cin >> n >> m;
int ans = m;
if (n <= 10) {
ans = 100 * (10-n) + m;
}
cout << ans << endl;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define pi 3.14159265359
#define mk(arr,n,type) type *arr=n... | 1 | 43,091,439 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string a;
cin >> a;
int PSa = a.length();
for (int x = PSa-1; x >= 0; x--){
cout <<a[x];
}
cout<<endl;
return 0;
} | #include <stdio.h>
int main(int argc, char** argv)
{
char a[20 + 1];
fscanf(stdin, "%s", a);
char* p;
for (p = a; *p != '\0'; p ++)
;
for (int i = p - a; i > 0; i --)
fputc(a[i - 1], stdout);
fputc('\n', stdout);
} | 1 | 3,382,445 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<string> s(n);
for(int i=0; i<n; i++){
cin >> s.at(i);
}
int m;
cin >> m;
vector<string> t(m);
for(int i=0; i<m; i++){
cin >> t.at(i);
}
int count=1;
int ans=0;
for(int i=... | #include <bits/stdc++.h>
using namespace std;
vector<string> v_input(int L) {
vector<string> v(L);
for (int i = 0; i < L; i++) {
cin >> v.at(i);
}
return v;
}
int main() {
int N, M;
cin >> N;
vector<string> S = v_input(N);
cin >> M;
vector<string> T = v_input(M);
int Max = 0;
for (int i = 0; i... | 1 | 5,025,835 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | #include <unistd.h>
#define MIN(x,y) ((x)<(y)?(x):(y))
#define MAX(x,y) ((x)>(y)?(x):(y))
int n;
long long int B[60];
char ibuf[4000000];
char *ibufe = ibuf-1;
void readall(){
int k, t = 0;
while((k=read(STDIN_FILENO, ibuf+t, sizeof(ibuf)-t))>0) t += k;
}
long long int read_uintll(){
long long int x=0;
while(*(... | 1 | 75,626,246 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<int(n);i++)
#define FOR(i,n,m) for(int i=n;i<int(m);i++)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
int vx[... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
int X;
X = N-(K-1);
cout<<X<<endl;
} | 1 | 76,753,252 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
sort(all(A), greater<>());
ll ans = 1;
int cnt = 0;
rep(i, ... | #include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
bool cmp(int a,int b){
return a > b;
}
int main() {
int n;
cin>>n;
int data[n];
for(int i=0;i<n;i++)
{
cin>>data[i];
}
sort(data,data+n,cmp);
long long a1=0,a2=0;
for(int i=0;i<n-1;i++)
{
... | 1 | 81,857,577 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
cin >> s;
long long a, b, k, l;
a = ceil(sqrt(s));
b = ceil(sqrt(s));
long long xy = (a * b) - s;
l = b - 1;
k = xy;
cout << 0 <<" "<< b <<" "<< k <<" "<< 0 << " " << a << " " << l;
} | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define LINF (ll)1e18
#define INF (int)1e9
#define ll_1e9 (ll)1e9
using namespace std;
int main(){
ll s;
cin >> s;
ll y3 = (s-1) / ll_1e9 + 1,x3 = y3*ll_1e9 - s;
cout << 0 << "... | 1 | 86,372,180 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 100005
#define INF 1000000005
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a)<<endl
typedef pair<int,int> P;
const int MAX = 1000005;
con... | #include <bits/stdc++.h>
using namespace std;
using ll= long long ;
void solve() {
int n; cin >> n;
vector<ll> a(n);
for (auto& x: a) {
cin >> x;
}
ll res = 0;
while (*max_element(a.begin(), a.end()) >= n) {
ll cnt = 0;
for (auto& x: a) {
cnt += x/n;
}... | 1 | 35,760,837 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #pragma gcc optimize("Ofast")
#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 ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(ALL(V))
#define RSORT(V) SORT(V);REV(V)
#defin... | 1 | 66,835,599 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1000000;
const int MOD = 1000000007;
ll 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[i] = fac[i - 1] * i % MOD;
... | #include<iostream>
#include<vector>
using namespace std;
#define ll long long
const int MAX=1e6;
const int MOD=1e9+7;
vector<ll> fact(MAX),inv(MAX),finv(MAX);
int X,Y;
void COMinit(){
fact[0]=fact[1]=1;
inv[1]=1;
finv[0]=finv[1]=1;
for(int i=2;i<MAX;i++){
fact[i]=fact[i-1]*i%MOD;
inv[i]=... | 1 | 37,163,333 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<int,int>m;
map<int,int>::iterator it;
while(n--){
int a;
cin>>a;
it = m.find(a);
if(it!=m.end()) it->second+=1;
else m.insert(make_pair(a,1));
}
if(m.size()%2) cout<<m.size();
else cout<<m.size()-1;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int x;set<int> s;
for(int i=0;i<n;i++){cin>>x;s.insert(x);}
int k=s.size();
if(k&1)cout<<k;
else cout<<k-1;
} | 1 | 54,139,808 |
#include<bits/stdc++.h>
using namespace std;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int h,w,x,y;
cin>>h>>w>>x>>y;
cout<<(double)(h)*(double)(w)/2.0<<' '<<(x*2==h&&y*2==w? 1:0);
return 0;
} | #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 all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(... | 1 | 1,873,956 |
#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, K;
cin >> N >> K;
int ans = (N - 2) / (K - 1) + 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(long long n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).re... | 1 | 30,426,187 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int kk=s.length();
int t=(kk-1)/2;
for(int i=0;i<t;i++){
if(s[i]!=s[i+t+1]){printf("No\n");return 0;}
}
for(int i=0;i<t/2+1;i++){
if(s[i]!=s[t-1-i]){printf("No\n");return 0;}
}
printf("Yes\n");
} | #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 (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | 1 | 89,145,177 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin >> s >> t;
for(int i=0;i<t.size();++i)
{
cout << s.at(i) << t.at(i);
}
if(t.size()<s.size()) cout << s.at(s.size()-1);
return 0;} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string O, E, ans = ""; cin >> O >> E;
int e = E.length(), j = 0, k = 0;
for (int i = 0; i < 2 * O.length(); ++i) {
if (i % 2 == 0) {
ans += O[j];
j++;
}
... | 1 | 99,993,494 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i,n) cin >> h[i];
int count = 0;
rep(i,n) {
bool flag = true;
rep(j,i){
if(h[i]<h[j]){
flag = false;
break;
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int maxh = 0, cnt = 0;
for (int i=0; i<n; i++) {
int h;
cin >> h;
if (h >= maxh) {
maxh = h;
cnt++;
}
}
cout << cnt << endl;
} | 1 | 45,129,555 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int max_len = 1005;
int dp[max_len][max_len];
char s1[max_len];
char s2[max_len];
void solve() {
int l1 = strlen(s1);
int l2 = strlen(s2);
for (int i = 0; i < max_len; i++) {
dp[i][0] = dp[0][i] = i;
}
for (int i = 0; i <... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;
#define MAX_LEN 1000
int LevenshteinDistance(string str1, stri... | 1 | 794,831 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll f(ll a, ll b){
if(b == 0)return -a;
return 2*(a/b)*b + f(b, a%b);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
ll n, x;
cin>>n>>x;
... | #include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n)... | 1 | 58,461,315 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const int MAX = 10000;
static const ll INFTY = 1e12;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 1 | 37,406,986 |
#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();
void solve() {
ll N;
cin >> N;... | #include<iostream>
#include<set>
#include<map>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long li;
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define yn(i) print((i)?"Yes":"No")
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"... | 1 | 46,305,061 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >> S;
reverse(S.begin(),S.end());
for(int i = 0 ; i < S.size() ; ){
if(S.substr(i,7) == "remaerd"){
i+=7;
}
else if(S.substr(i,6) == "resare"){
i+=6;
}
else if(S.su... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define arep(x,n) for (int x: n)
using namespace std;
int main()
{
string s; cin >> s;
reverse(s.begin(), s.end());
vector<string> t(4);
t.at(0) = "dream";
t.at(1) = "erase";
t.at(2) = "eraser";
t.at(3) = "dreamer";
... | 1 | 66,543,049 |
#include<iostream>
using namespace std;
int main(){
int s[60]={0};int n=0,cnt=0;
while(cin>>s[n++]);n--;
for(int i=0;i<n;i++){
for(int a=0;a<10;a++){
for(int b=0;b<10;b++){
for(int c=0;c<10;c++){
if(s[i]-a-b-c>-1&&s[i]-a-b-c<10)cnt++;
}
}
}
cout<<cnt<<endl;cnt=0;
}
return 0;
} | #include <iostream>
using namespace std;
#define F(i) for (int i=0; i<10; i++)
int main()
{
int n;
while(cin >> n){
int count = 0;
F(a)F(b)F(c)F(d)if(a+b+c+d==n) count++;
cout << count << endl;
}
return(0);
} | 1 | 962,979 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | 1 | 40,220,670 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,e;
cin>>a>>b;
c=a-b;
if(b==1)
{
cout<<0<<endl;
}
else
{
cout<<c<<endl;
}
return 0;
} | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k, m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(k<'0'|... | 1 | 31,897,337 |
#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()
#define... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n,m,sum1,sum2,sum3,val1,val2,val3,val4,mn=1e18;
cin>>n>>m;
for(long long i=1;i<n;i++)
{
vector<long long> v;
sum1=m*i;
if(m%2==0)
{
... | 1 | 32,668,836 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define INF 1e9
#define EPS 1e-9
#de... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <complex>
#include <tuple>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <random>
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using na... | 1 | 33,442,521 |
#include <bits/stdc++.h>
#define MOD 1e9+7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main()
{
int n, m;
cin >> n >> m;
int t = 100 * (n - m) + 1900 * m;
cout << t * (1 << m) << endl;
}
... | #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 LINF = 1LL << 60;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int N, M; cin >> N >> M... | 1 | 95,364,976 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define repr(i,x,n) for(int i=x; i<(n); i++)
#define ALL(x) (x).begin(),(x).end()
#define INF 1e9
typedef long long ll;
using VI = vector<int>;
using VS = vector<string>;
using graph = vector<vector<int>>;
int main()
{
int x;
cin>>x... | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll a, b;
cin >> a;
if(a < 1200) cout << "ABC" << endl;
else cout << "ARC" << endl;
return 0;
} | 1 | 71,505,412 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
map<int, map<int, int> > dp1;
map<int, map<int, int> > dp2;
int mo=1000000007;
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin>>n>>m;
int x[n+5];
int y[m+5];
int dpx[n+5];
int dpy[m+5];
for(... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
const ll MOD = 1e9+7;
ll solve(){
ll n,m; cin >> n >> m;
vector<ll> x(n),y(m);
for(auto &in:x) cin >> in;
for(auto &in:y) cin >> in;
ll... | 1 | 25,959,839 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1&&B==2)cout<<"3"<<endl;
if(A==1&&B==3)cout<<"2"<<endl;
if(A==2&&B==1)cout<<"3"<<endl;
if(A==2&&B==3)cout<<"1"<<endl;
if(A==3&&B==1)cout<<"2"<<endl;
if(A==3&&B==2)cout<<"1"<<endl;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#defin... | 1 | 50,263,908 |
#include <bits/stdc++.h>
using namespace std;
int h, w;
int n;
bool ng[16][16];
int dp[16][16];
int search(int x, int y)
{
if (x > h - 1 || y > w - 1) return 0;
if (ng[x][y]) return 0;
if (x == h - 1 && y == w - 1) return 1;
if (~dp[x][y]) return dp[x][y];
return dp[x][y] = search(x + 1, y) + search(x, y + 1);
}
i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> ... | 1 | 47,280,752 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
vector<int> A(N);
int l,c=0;
for (int i=0;i<N;i++){
cin >> A.at(i);
}
l=A.at(0);
for (int j=0;j<N;j++){
c++;
if (l==2){
cout << c;break;}
else {
l=A.at(l-1);}
}
if (c==N){
cout << -1 << end... | 1 | 80,402,852 |
#include<iostream>
int main(){
int d,n,sum;
while(std::cin >> d){
n = 600/d;
for(int i=0;i<n;i++){
sum += i*i*d*d*d;
}
std::cout << sum << std::endl;
sum = 0;
}
} | #include <iostream>
int main()
{
int d;
while (std::cin >> d) {
int n = 0, s = 0;
while (n < 600) {
s += n * n * d;
n += d;
}
std::cout << s << std::endl;
}
return 0;
} | 1 | 97,786,135 |
#include <cstdio>
#include <string>
using namespace std;
struct Dice {
int face[6];
const int dir[5][6]={
{1, 5, 2, 3, 0, 4},
{3, 1, 0, 5, 4, 2},
{4, 0, 2, 3, 5, 1},
{2, 1, 5, 0, 4, 3},
{0, 2, 4, 1, 3, 5}
};
const char dchars[6]="NESWY";
int encode[256]={};
... | #include <iostream>
#include <string>
using namespace std;
class Dice
{
private:
int top, front, right, left, back, bottom, temp;
public:
void set(int *nums)
{
this->top = nums[0];
this->front = nums[1];
this->right = nums[2];
this->left = nums[3];
this->back = nu... | 1 | 53,430,127 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, X, T; cin >> N >> X >> T;
int last =0;
if(N%X > 0) last++;
cout << ((N/X)*T + T*last) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
double n, x, t;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> x >> t;
cout << (int)(ceil(n / x) * t);
} | 1 | 9,538,695 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | #include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
using ll = long long;
#define rep(i, n) for(ll i = 0; i < n; i++)
using namespace std;
int main(){
int n, k;
cin >> n >> k;
double count = 0.0;
rep(i, n){
double x = (double)k / (i+1);
int y = (int)log2(x);
if (log2(x) <= 0.0)... | 1 | 63,611,590 |
#include<cstdio>
#include<iostream>
#include<map>
#include<utility>
using namespace std;
long long B[10];
map<pair<int, int>, int> cells;
int main() {
int H, W;
int N;
scanf("%d", &H);
scanf("%d", &W);
scanf("%d", &N);
for (int i = 0; i < 10; i++) {
B[i] = 0;
}
int a, b;
int len = 0;
for (int i ... | #include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<set>
#define sqr(x) (x)*(x)
using namespace std;
long long n,m,k,i,j,l,ans[15],x[100005],y[100005];
int dx[9]={0,-1,-1,-1,0,0,1,1,1},dy[9]={0,-1,0,1,-1,1,-1,0,1};
se... | 1 | 90,164,516 |
#include <iostream>
#include <vector>
using namespace std;
void Sort(vector<int>& List);
void Output(vector<int>& List);
void Sort(vector<int>& List)
{
for(int i = 1; i < List.size(); i++){
int Temp = List[i];
int j = i - 1;
while(j >= 0 && List[j] > Temp){
List[j + 1] = List[j];
j--;
}
List[j + 1] = T... | #include <algorithm>
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a,a+3);
cout << a[0] << " " << a[1] << " " << a[2] << endl;
return 0;
} | 1 | 26,178,364 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i <= n; i++)
#define ll long long
using namespace std;
int main() {
int R, G, B, N; cin >> R >> G >> B >> N;
int ans = 0;
rep(i, 3000) rep(j, 3000)
if ((N - (i*R+j*G)) % B == 0 && (N - (i*R+j*G)) >= 0) ans++;
cout << ans << endl;
retur... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { i... | 1 | 89,014,588 |
#include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree< ll, null_type, less< ll >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int main()
{
ios_base::sync_with_stdio(... | 1 | 78,046,563 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i=0;i<(n);++i)
#define per(i, n) for(int i=(n)-1;i>=0;--i)
#define repa(i, n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#defi... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#de... | 1 | 1,733,328 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string s;
ll k;
cin >> s;
cin >> k;
int num;
for(int i=0;i<k;i++){
if((s.at(i))!='1'){
cout << s.at(i) << endl;
return 0;
}
}
cout << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;cin>>s;
long long n;cin>>n;
for(int i=0;i<n;++i){
if(s[i]=='1' && n<=i+1){
cout<<1<<endl;
return 0;
}
else if(s[i]!='1'){
cout<<s[i]<<endl;
return 0;
}
}
r... | 1 | 29,741,936 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
string s;
cin >> s;
long long ans = 0;
long long run = 0;
long long prev_climax = 0;
for (int i=0; i<=s.length(); i++) {
if (i == s.length() || (i > 0 && s[i... | #include <iostream>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <functional>
#define big ((long long)(1e9) + 7)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define DBG(x) cerr << #x << ": " << (... | 1 | 79,744,065 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | 1 | 69,104,371 |
#include<math.h>
#include<limits.h>
#include<iostream>
#include<string>
#include<vector>
#include<stdio.h>
#include<sstream>
#include<list>
#include<queue>
#include<algorithm>
#include<functional>
#include<map>
#include<set>
using namespace std;
#define ull unsigned long long
#define ll long long
#define rep(i, n) for(... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[1001][1001];
int q;
void solve(){
char x[1001],y[1001];
scanf("%s %s",x,y);
int lx = strlen(x);
int ly = strlen(y);
for(int i=0;i<=lx;i++){
for(int j=0;j<=ly;j++){
if(i==0||j==0) dp[i][j] = 0;
else if(x[i-1]==y[... | 1 | 30,744,408 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long l... | 1 | 75,344,731 |
#include <bits/stdc++.h>
using namespace std;
int M;
int main() {
cin >> M;
long long total_n=0LL;
long long total_q=0LL;
for (int i=0;i<M;i++) {
long long d,c;cin >> d >> c;
total_n+=c;
total_q+=c*d;
}
cout << total_n-1L+(total_q-1L)/9L << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long M,d,c,a=0,b=0,e=0;cin>>M;
for(int i=0;i<M;i++){
scanf("%lld%lld",&d,&c);
b+=d*c;
a+=c;
}
while(b/10){
a+=b/10;
b=b%10+b/10;
}
cout<<--a<<endl;
} | 1 | 65,659,781 |
#include <iostream>
#include <vector>
using namespace std;
static const int N = 100;
static const int no = -1;
int graph[N][N] = {{}};
int d[N] = {};
int n;
void bfs(int v){
vector<int> V;
V.push_back(v);
int u;
for(int i = 1;i <= n; i++){
d[i] = no;
}
d[v] = 0;
while(!V.empty()){
u = V.fron... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
using ll = long long;
#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++)
#define FORD(i,a,b) for(ll i=a;i>=(l... | 1 | 31,339,059 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
double const PI = 3.14159265;
struct Point
{
double x;
double y;
};
double dist(Point p1, Point p2) {
double dx = p1.x - p2.x;
double dy = p1.y - p2.y;
return sqrt(dx * dx + dy * dy);
}
vector<Point> divide(Point p1, P... | 1 | 2,228,170 |
#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;
using P = pair<int, int>;
using ll = long long;
int main()
{
string s;
cin >> s;
int n = s.size() + 1;
int a[n];
rep(i, n) a[i] = 0;
for(int i = 0; i... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#defi... | 1 | 50,870,326 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,a,b;
cin >> n >> a >> b;
if(a==0)
{
cout << "0";
exit(0);
}
long long int sum=a+b,count=a*(n/sum);
if(n%sum>a)
count+=a;
else
count += n%sum;
cout << count;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N,A,B;
cin >> N >> A >> B;
ll S;
if(N%(A+B)<=A){
cout << N/(A+B)*A+N%(A+B);
return 0;
}
else if(N%(A+B)>A){
cout << N/(A+B)*A+A;
return 0;
}
} | 1 | 29,208,917 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<long long> vec1(n);
long long tgt = 0;
long long res = 0;
for (int i = 0; i < n; i++) {
cin >> vec1.at(i);
if (tgt >= vec1.at(i)){
res += tgt - vec1.at(i);
} else {... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long doubl... | 1 | 62,113,763 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<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; }
using ll=long long;
using namespace std;
int main(){
int n;
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
const int INF = 1000000001;
int main(){
int a;
cin >> a;
cout << a*800 - 200 * (a/15) <<endl;
} | 1 | 27,720,029 |
#include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,l... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T&... | 1 | 77,281,216 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define tr... | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define acc(v) accumulate(v.begin(), v.end(), 0)
using namespace std;
typedef long long ll;
const int INF = 1e9... | 1 | 19,112,883 |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int arr[60];
int n, p;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019)
return cout << 0, 0;
ll mini = 1e18;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
mini =... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 1 | 57,253,090 |
#include "algorithm"
#include "iostream"
#include "string"
#include "vector"
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int t[N];
cin >> t[0];
int sum = 0;
for (int i = 0; i < N - 1; i++) {
cin >> t[i + 1];
sum += min(T, t[i + 1] - t[i]);
}
cout << sum + T << endl;
} | #include <bits/stdc++.h>
#define ll long long int
#define mod_ceil(a, b) (a % b) ? a / b + 1 : a / b
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, t;
cin >> n >> t;
vector<ll> A(n);
for (ll i = 0; i < n; i++)
{
cin >> A[i];
... | 1 | 37,739,472 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.