code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
typedef pair<int,int> pii;
typedef pair <long long,long long> pll;
typedef long long ll;
typedef long double ld;
const ll mod = 1e9+7;
ll dp[10001][101][2];
ll solve( string & k, int... | #include <iostream>
#include <cstdio>
#include <algorithm>
#define mod 998244353
#define ll long long
#define N 1000005
#define inv 499122177
using namespace std;
int n, m;
ll fac[N], ifac[N];
ll ans;
void init();
ll quick_pow(ll ,int);
ll C(int ,int);
int main(){
cin >> n >> m;init();
if(n < m) swap(n, m);
for(... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <tuple>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for(int i = (int)n - 1; j <= i; -... | #include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mod 1000000007ll
const ll maxn = 9e18;
using namespace std;
const ll maxsize = 100000009;
vector<bool> mark(100005, 0);
int wa[100005];
void solve() {
int n, k;
cin >> n >> k;
map<string,ll> m;
m["AC"] = 0;
int ac_cnt = 0, wa_cnt ... | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //GCC5.4.1で配列の範囲外アクセスをエラーにする
//cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
// https://github.com/atcoder/live_library
// cppdbg: test.exeのterminalに標準入力を打てる
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(... | 0 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll = long long;
using ld = long double;
ll mod = ll(1e9)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<int,int>
#define lowbit(i) i&-i
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
#define pb push_ba... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#defin... | #include <bits/stdc++.h>
#define mod 998244353
#define int long long
using namespace std;
const int N=3*1e6+100;
int n,m,fac[N],inv[N],a,b;
inline int m_pow(int a,int b)
{
int ans=1;
while (b)
{
if (b&1) ans=(ans*a)%mod;
b>>=1;
a=(a*a)%mod;
}
return ans;
}
inline int c(int n,int m)
{
if (m>n) return 0;
re... | 0 |
#include<iostream>
using namespace std;
int main(){
int a[10][10];
int d, i, j, k, temp,sum=0;
while (1){
cin >> d;
if (d == 0){
return 0;
}
for (i = 0, j = 0; i < d; i++){
for (j = 0; j < d; j++){
cin >> a[i][j];
}
}
for (i = 0, j = 0; i < d; i++){
for (j = 0; j < d; j++){
cou... | #include <bits/stdc++.h>
#define loop(v, f, l) for(int v = (f), v##_ = (l); v < v##_; ++v)
using namespace std;
typedef long long int lint;
static inline int in(){ int x; scanf("%d", &x); return (x); }
static inline lint inl(){ lint x; scanf("%lld", &x); return (x); }
int matrix[11][11];
int main()
{
int n;
whi... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
int x[n],y[n];
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
}
int p[10]={0,1,2,3,4,5,6,7,8,9};
double sum=0;
int divide=0;
do{
for(int i=0;i<n-1;i++) sum+=sqrt(pow(x[p[i+1]]-x[p[i]],2)+pow(y[p[i+1]]-y[p[... | #include"bits/stdc++.h"
using namespace std;
#define ll long long
#define mod 1000000007
#define prec(n) fixed<<setprecision(n)
int N;
int x[10], y[10];
double dist(int i, int j) {
double dx = x[i] - x[j];
double dy = y[i] - y[j];
return pow(dx * dx + dy * dy, 0.5);
}
void solve() {
cin >> N;
fo... | 1 |
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
using... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
while (cin >> a >> b >> c, a | b | c) {
int N;
cin >> N;
vector<int> res(a + b + c, 2);
vector<vector<int>> no;
for (int i = 0; i < N; i++) {
int x, y, z, t;
cin >> x >> y >> z >> t; x--, y--, z--;
if (t) {
res[x] = res[y]... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#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++)
#d... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <vector>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a[5];
int ans;
for(int i=0;i<2;i++){
cin>>a[i];
}
sort(a,a+2);
ans=a[1];
a[1]--;
sort(a,a+2);
ans+=a[1];
cout<<ans<... | 1 |
#include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 998244353;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for... | #include <bits/stdc++.h>
using namespace std;
const int N = 200;
const int S = 100005;
const int mo = 1e9 + 7;
int n, x;
int a[N + 5];
int f[N + 5][S + 5];
int main() {
#ifdef Wearry
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endif
cin >> n >> x;
for (int i = 0; i < n; ++i) {
cin >> a[i];
... | 0 |
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
typedef pair<int, int> P;
int main()
{
int n, q;
cin >> n >> q;
int s[200005], t[200005], x[200005];
P p[400005];
for(int i = 0; i < n; i++){
cin >> s[i] >> t[i] >> x[i];
p[i * 2] = P(s[i] - x[i], x[i]);
... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
// #define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i... | 1 |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, se... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int a,b,n,x,y,z,i=0,ans=0,c=0;
string s;
cin >> x >> y >> z;
cout << z << " "<< x << " "<< y << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 |
// Aaradhya Beri
#pragma GCC optimze("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef long double f80;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sz(x) ((long long)x.si... | #include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
if(s[0]=='7')
cout<<"Yes"<<endl;
else if(s[1]=='7')
cout<<"Yes"<<endl;
else if(s[2]=='7')
cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll> ;
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
int main(){
ll N;cin>>N;
vector<int> A(N);rep(i,N)cin>>A[i];
map<int,int> m;
ll ans = 1;
rep(i,N){
m[A[i]... | #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;
for(int i=0;i<N;i++) {
ll a;
cin >> a;
if(i==0&&a!=0) {
cout << -1 << end... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector <long> a(n);
rep(i, n)
cin >> a[i];
vecto... | #include <iostream>
#include <unordered_map>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
long long N;
cin >> N;
long long A[N];
long long count = 0;
long long sum=0;
long long ans ;
for(int i=0;i<N;i++){
cin >> A[i];
if(A[i] < 0)count++;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 10005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main()
{
FAST;
ll n;
ll a, b;
cin ... | #include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(i=a;i<b;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define hell 1000000007
using namespace std;
const int N=500;
vo... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
typedef long long ll;
typedef pair<int,int> P;
//-----------------------------------------------------------------------
vector<pair<int,P> > p;
int main()
{
cin.tie(0);... | #include <iostream>
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <map>
#include <queue>
#include <string>
using namespace std;
char ch;
string text;
int main() {
while(getline(cin,text)){
for(int i=0;i<26;i++){
for(int j=0;j<text.size();j++){
if(text[j]>='a... | 0 |
#include <iostream>
#include <string>
#define llint long long
#define mod 1000000007
using namespace std;
string s;
llint dp[300005][2][2][2][3];
int main(void)
{
cin >> s;
s += "1";
int n = s.size();
s = "#" + s;
dp[0][0][0][0][0] = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j < 2; j++){
for(int k =... | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 2020;
const int Q = N * N;
const int mod = 1e9 + 7;
using namespace std;
int pw(int x, int n)
{
int res = 1;
for(; n > 0; n >>= 1){
if(n & 1){
res = 1ll * res * x % mod;
... | 0 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retu... | 1 |
#include <stdio.h>
typedef struct _Gem{
int x;
int y;
bool hit;
} Gem;
static void
pick_gem(Gem* g, int n, int x, int y)
{
for (int i = 0; i < n; i++) {
if (!g[i].hit && g[i].x == x && g[i].y == y) {
g[i].hit = true;
return;
}
}
}
static bool
check_gem(Gem* g, int n)
{
for (int i = 0; i < n; i++) {
... | #include <iostream>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int (i) = 0; (i) < (n); (i)++)
int main()
{
while(1){
int N;
cin >> N;
if(N == 0){
break;
}else{
int x, y;
int planet[21][21];
fill(&planet[0][0], &planet[21][0], 0);
REP(i, N){
... | 1 |
#include <iostream>
using namespace std;
int main() {
int R, G, T;
cin >> R;
cin >> G;
T = (2 * G) - R;
cout << T << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 2000000;
const int MOD = 998244353;
//
int 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]... | 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 srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using P = pair<int,int>;
int main() {
int h, w;
cin >> h >> w;
map<int,int> s;
... | 1 |
#include <cstdio>
//#include <iostream>
//#include <string>
using namespace std;
// cl /EHsc xxx.cpp
int main(int argc, char *argv[])
{
int n;
scanf("%d", &n);
int *ary = new int[n];
int v;
int t = n;
while (t)
{
scanf("%d", &v);
ary[--t] = v;
}
for (int j = 0; j < n; j++)
{
printf((j == n-1) ? ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < n; i++){
cout << a[n - 1 - i];
if(i == n - 1) break;
cout << ' ';
}
cout << endl;
}
| 1 |
#include <stdio.h>
int main(){
int date[11];
for(int i = 0; i < 10; i++){
scanf("%c", &date[i]);
}
for(int i = 0; i < 10; i++){
date[3] = '8';
printf("%c", date[i]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
//*
string a;
cin >> a ;
//*/
a.at(3) = '8';
/*
vector<int> vec(4);
cin >> vec.at(0) >> vec.at(1) >> vec.at(2) ;
sort(vec.begin(), vec.end());
*/
/*
if(a == 0){
cout << "" << en... | 1 |
#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;
typedef long long LL;
using Graph = vector<... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
class Dice_c{
private:
int me[4];
int topbot[2]; // top,bottom
public:
void Input();
void Roll(char c);
void Output();
};
int main(){
Dice_c dice;
char com;
dice.Input();
while(1){
scanf("%c",&com);
if(com=='\n')
break;
... | #include <iostream>
#include <string>
using namespace std;
class Dice{
int top, n, s, e, w;
public:
Dice();
void roll(char dir);
int getTop();
};
Dice::Dice(){
top = 1;
n = 5;
s = 2;
e = 3;
w = 4;
}
void Dice::roll(char dir){
switch (dir){
case 'N':
n = top;
top = s;
s = 7 - n;
break;
case 'S':
... | 1 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
ll c[200100], d[200100];
int main() {
int m;
cin >> m;
rep(i,m) cin >> d[i... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
const int inf = 1012345678;
int N, M, a[114], b[114], c[114], g[19][19], sum[32777], val[32777], dp[19][32777], dp2[32777];
int main() {
cin >> N >> M;
int all_cost = 0;
for (int i = 0; i < M; i++) {
cin >> a[i] >> b[i] >> c[i]; a[i]--, b[i]--;
sum[(1... | #include<bits/stdc++.h>
using namespace std;
#define D isdigit(c=getchar())
inline int getint(){
int c,l=0,x;
for (;!D;l=c)if(c==EOF)return 1<<31;
for (x=c-'0';D;x=x*10+c-'0')if(c==EOF) break;
return l=='-'?-x:x;
}
int dist[16][16],f[1<<16],dp[16][1<<16],g[1<<16][16],n,m;
int main(){
n=getint();m=getin... | 1 |
#include <iostream>
using namespace std;
int main(){
long long int n,i=1,a=0;
cin >> n;
while (i <= n) {
if (i % 3 != 0 && i % 5 != 0)
a += i;
i++;
}
cout << a;
} | ///f. fizzbuzz sequence
#include <stdio.h>
#include <math.h>
int main()
{
long long int n;
scanf("%lld",&n);
long long int d3,d5,d15;
d3=n/3; d5=n/5; d15=n/15;
long long sum = (n*(n+1)-3*d3*(d3+1)-5*d5*(d5+1)+15*d15*(d15+1))/2;
printf("%lld",sum);
return 0;
} | 1 |
#include<iostream>
#include<map>
using namespace std;
int main(){
map<string, int> weekday;
weekday["SUN"] = 0;
weekday["MON"] = 1;
weekday["TUE"] = 2;
weekday["WED"] = 3;
weekday["THU"] = 4;
weekday["FRI"] = 5;
weekday["SAT"] = 6;
string day;
std::cin >> day;
std::cout <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 1e18;
#define REP(i, n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main(){
ll n; cin >> n;
int ans=log10(n)+1;... | 0 |
//Partition
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a... | #include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(i=a;i<b;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define hell 1000000007
using namespace std;
const int N=500;
vo... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,k;
cin >> N >>k;
int sum;
if(k==1){
sum = N+1;
}
else if(k==2||k==3||k==4){
if (N==1){
sum = 2;
}
else{
sum = 4 + k*(N-2);
}
}
else if(k==5||k==6||k==7){
if (N==1){
sum = 2;
}
else if(N==2){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int x = 1;
for (int i = 0; i < N; i++) { // iのスコープはforの終わりまで
if( x * 2 <= x + K ){
x *= 2;
}
else {
x += K;
}
}
cout << x <<endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
char s[3];
cin>>s[0]>>s[1]>>s[2];
int max=0, locmax=0;
for(int i=0;i<3;i++){
if(s[i] == 'R'){
locmax++;
}
else{
locmax=0;
}
if(locmax>max){
max=locmax;
}
}
cout<<max;
}
| #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, l;
cin >> n >> l;
vector<int> d(n);
for (int i = 1; i <= n; i++) {
d[i-1] = l+i-1;
}
int all = 0;
rep(i,n) all += d[i];
... | 0 |
#include<cstdio>
int main(){
int n,x;
scanf("%d", &n);
int dice[n][6];
int tmp[6];
for(int i = 0; i < n; i++){
for(int j = 0; j < 6; j++){
scanf("%d", &dice[i][j]);
}
}
int pt[5][6] = { {5,1,3,4,6,2},
{0,0,0,0,0,0},
{4,2,1,6,5,3},
{2,6,3,4,1,5},
{3,2,6,1,5,4}};
int t[24] = {0,0,0,... | #include<iostream>
#include<string>
#include<vector>
using namespace std;
enum Diceface {
DICETOP,
DICEFRONT,
DICERIGHT,
DICELEFT,
DICEBACK,
DICEBOTTOM,
DICENUM
};
class Dice {
private:
int *face;
public:
Dice( ) { face = new int[DICENUM]; }
Dice( int top, int front, int right, int left, int back, int bott... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a % b == 0){
cout << "0\n";
return 0;
}
cout << "1\n";
}
| #include <cstdio>
#include <cmath>
#include <limits>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdint>
#include <functional>
#define rep(i, s, g) for (i = s; i < g; i++)
u... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int d, g;
cin >> d >> g;
int p[d], c[d];
int sum = 0, num_mn = 1001;
bool ach;
for (int i = 0; i < d; i++) cin >> p[i] >> c[i];
for (int bit = 0; bit < (1 << d); bit++) {
int num_tmp = 0;
sum = 0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N,M;
cin>>N>>M;
vector<bool> isAC(N, false);
vector<int> check(N,0);
int wans=0, cans=0;
int p;
string s;
for(int i=0; i<M; i++){
cin>>p>>s;
if(isAC.at(p-1)) continue;
else{
... | #include <iostream>
#include <algorithm>
using namespace std;
#include <cmath> //floor ceil
#include <cstdlib> //abs
#include <cstdio>
#include <climits> //INT_MAX
#include <cstring>
#define endl "\n"
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define lli long long int
#define MOD 1000000007
#include <map>
#defin... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846264338327950L
int main() {
int N;
cin >> N;
long long sum = 0;
for (int ii = 1; ii <= N; ii++) {
if (ii % 3 == 0 && ii % 5 == 0) {
continue;
}
if (ii % 3 == 0 || ii % 5 == 0) {
continue;
}
sum += ii;
}
cout << sum << e... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<intt>
#define ii pair<int,int>
#define pb push_back
//#define mp make_pair
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define ... | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
class Dice
{
public:
int label[6], tmp;
void in()
{
rep(i, 6) scanf("%d", &label[i]);
}
void rollS()
{
tmp = label[0];
... | 0 |
////////////////////////// Author
////////////////////////// Nasim Hossain Rabbi
////////////////////////// JU-CSE28
////////////////////////// CF - imnasim3.1415
////////////////////////// UVA - imnasim3.1415
////////////////////////// Mail - imnasim3.1415@gmail.com
#include<bits/stdc++.h>
using namespace std;
#define... |
// Problem : C - Low Elements
// Contest : AtCoder - AtCoder Beginner Contest 152
// URL : https://atcoder.jp/contests/abc152/tasks/abc152_c
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include<bits/stdc++.h>
#include<set>
#define lli long long int
... | 1 |
#include<bits/stdc++.h>
using namespace std;
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putchar(x%10+48);
}
void ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
#define int long long
#define double long double
#define all(a) a.begin(),a.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_set>
using namespace std;
using ll = long long int;
int main()
{
int x, y;
cin >> x >> y;
int prize = 0;
if (x <= 3) {
prize += (4-x) * 100000;
}
if (y <= 3) {
prize += (4-y) * 1000... | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin >> x>>y;
vector<int> a(206);
a.at(1)=300000;
a.at(2)=200000;
a.at(3)=100000;
if((x==1)&&(y==1)){
cout << 1000000 <<endl;
}
else{
cout << a.at(x) + a.at(y) << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int K, T;
cin >> K >> T;
priority_queue<pair<int, int>> q;
int ai;
for (int i = 0; i < T; i++)
{
cin >> ai;
q.push(make_pair(ai, i + 1));
}
int res = 0;
int prev = 0;
for (int i = 0; i < K; i++)
{
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int K, a, M{};
cin >> K >> a;
while (cin >> a) M = max(M, a);
cout << max(0, 2 * M - K - 1) << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN=10005;
int P=1e9+7,d,len;
char k[MAXN];
long long a[MAXN],dp[10005][105];
long long dfs(int pos,int tot,bool lim)
{
// cout<<pos<<' '<<tot<<' '<<lim<<endl;
if(pos==len+1)
{
if(tot==0) return 1;
return 0;
}
if(!lim&&dp[pos][tot]!=-1) return dp[pos][t... | #include<iostream>
#include<string>
using namespace std;
long long MOD = 1000000007;
int main(){
//input
long long D;
string S;
cin >> S;
cin >> D;
long long keta=S.length();
long long N[keta];
long long i,k, digit;
long long j;
for(i=0; i<keta; i++){
N[i]=(long long)(... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
struct mint {
ll x;
mint(ll x=0):x(x%mod){}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000 // 10^12
#define MOD 1000000007 // 10^9+7
#define PB push_back
#define MP make_pair
const int MAX_N = 100... | 0 |
#include <bits/stdc++.h>
#define rep(i, e, n) for (int i = e; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const ll inf=1000000000007;
int main() {
int n,q;
cin >> n >> q;
string s;
cin >> s;
vector<int> a(n);
a[0]=0;
rep(i,1,n){
if(s[i-1]=='A' && s[i]=='C') {
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 |
#include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
int N,M;
cin >> N;
map<string,int> blue;
string s;
for(int i=0;i<N;++... | #include <bits/stdc++.h>
using namespace std;
/* エイリアス */
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_b... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> r,g,b;
for(int i = 0; i < n; i++) {
char x;
cin >> x;
if(x=='R') r.push_back(i+1);
if(x=='G') g.push_back(i+1);
if(x=='B') b.push_back(i+1);
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100005;
int r[N],g[N],b[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
string s;
cin>>s;
ll ans = 0;
if(s[0] == 'R')r[0]++;
if(s[0] == 'G')g[0]++;
if(s[0] == 'B')b[0]++;
for(int... | 1 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
for (int ix=0; ix<n; ix++) {
int out=0,score=0;
int hit[] = {0,0,0};
string event;
while (out<3) {
cin>>event;
if (event=="HIT") {
... | #include<stdio.h>
int main(){
int n,a[101],t,i,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(j=i-1;j>=0;j--){
if(j==0){printf("%d",a[j]);
printf("\n");}
else printf("%d ",a[j]);
}
return 0;
} | 0 |
#define REP(i, s, e) for (int i = s; i <= e; i++)
#define DREP(i, s, e) for (int i = s; i >= e; i--)
#define DEBUG fprintf(stderr, "Passing [%s] in Line %d\n", __FUNCTION__, __LINE__)
#define chkmax(a, b) a = max(a, b)
#define chkmin(a, b) a = min(a, b)
#include <iostream>
#include <cstdio>
using namespace std;
cons... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define mod 998244353
#define mad(a,b) a=(a+b)%mod;
#define mul(a,b) a=a*b%mod;
#define N 100010
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
int a[n+1];
rep(i,n) cin >> a[i+1];
int ans[n+1];
rep(i,n) ans[i+1] = 0;
//rep(i,n) cout << a[i] << endl;
for(... |
#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... | 1 |
#include<iostream>
using namespace std;
int main()
{
int a,b,c;
int m,n,o;
cin>>a>>b>>c;
m=a;
n=b;
o=c;
b=m;
a=o;
c=n;
cout<<a<<" "<<b<<" "<<c;
return 0;
}
| #include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a <= c && c <= b || b <= c && c <= a ? "Yes" : "No") << endl;
re... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int N, i, div, result;
cin >> N;
vector<long long int> A_sum(N);
vector<long long int> A(N);
div = 1;
for (i = 0; i < 9; i++)
{
div *= 10;
}
div += 7;
for (i = 0; i < N; i++)
{
cin >> A[i];
... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
using P = pair<int,int>;
using ivec = vector<int>;
using Graph = vector<vector<int>>;
template<class T> inli... | 0 |
#pragma GCC optimize ("Ofast")
#include"bits/stdc++.h"
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
struct _ { ios_base::Init i; _() { cin.sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(10); } } ___;
#define trace(.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a == b && a != c) {
cout << "Yes" << "\n";
} else if (c == b && b != a) {
cout << "Yes" << "\... | 1 |
#include<iostream>
#include<algorithm>
#include<numeric>
#include<map>
#include<set>
int const MAXN = 2e5;
int a[MAXN], b[MAXN], N, k;
int c[MAXN-1], d[MAXN+MAXN-2];
int rank[MAXN+MAXN-1];
int tmp[MAXN+MAXN-1];
int sa[MAXN+MAXN-1];
bool comp_sa(int i, int j) {
if(rank[i]!=rank[j]) return rank[i] < rank[j];
int ri... | #include <bits/stdc++.h>
using namespace std;
inline char Get(){
static char ch; ch = getchar();
while (ch != '\n' && ch != '0' && ch != '1' && ch != '?') ch = getchar();
if (ch == '\n') return '*';
return ch;
}
const int P = 1e9 + 7;
inline void upd(int &x,int v){ x = (x+v>=P)?(x+v-P):(x+v); }
int f[9],g[9],nxt[9]... | 0 |
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
long long n;
cin >> n;
int l;
long stocks = 1000;
for (long long i = 1; i*i <= n; i++) {
if (n % i != 0) continue;
l = log10(n/i) + 1;
if (l < stocks) stocks = l;
}
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int R; cin >> R;
if (R < 1200) cout << "ABC" << endl;
else if (R < 2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
}
| 0 |
#include <set>
#include <cstdio>
using namespace std;
char s[1000000 + 10];
int cnt[3];
char m[128];
int main(){
scanf("%s", s);
m['J'] = 0; m['O'] = 1; m['I'] = 2;
int k = 0;
for(char *c = s; *c; c++){
int i = m[*c];
if(i == 0 && cnt[1] + cnt[2])
cnt[0] = cnt[1] = cnt[2] = 0;
if(i == 1 &... | #include<iostream>
#include<string>
using namespace std;
int conv(char r)
{
if(r=='I') return 1;
if(r=='V') return 5;
if(r=='X') return 10;
if(r=='L') return 50;
if(r=='C') return 100;
if(r=='D') return 500;
if(r=='M') return 1000;
else return 0;
}
int main()
{
string in;
while(cin>>in)
{
int ans=0;
for... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef pair<int, int> ii;
typedef pair<long long, int> li;
typedef pair<long long, pair<int, int> > lii;
const int N = 2e5 + 5;
const long long inf = 1e18 + 123;
int n, a[N], d;
long long ans;
vector<ii> vec;
vector... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | 1 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N; cin >> N;
vector<pair<ll,ll... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = vector<ii>;
using gt... | 0 |
#include<bits/stdc++.h>
using namespace std;
int psum[505][505];
int main(){
int n,m,q;
cin>>n>>m>>q;
while(m--){
int l,r;
cin>>l>>r;
psum[r][l]++;
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++) psum[i][j]+=psum[i][j-1];
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++) psum[i][j]+=psum[i-1][j];
... | #include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <map>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int n,N;
ll s[4000][2],a,b;
string d;
int main(){
while(cin>>N){
if(N==0)return 0;
for(int i=0;i<4000;i+... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin>>N>>A>>B;
if(N==1)
cout<<"Hello World"<<endl;
else
cout<<A+B<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout<<#x<<" = "<<(x)<<endl;
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using M = map<int,int>;
usin... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a,b,c;
while(cin>>a>>b>>c,a||b||c){
int n,parts[500],input[10000][4],bd;
for(int i=0;i<500;i++) parts[i]=2;
cin>>n;
for(int _i=0;_i<n;_i++){
for(int _j=0;_j<4;_j++){
cin>>input[_... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<l... | #include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
#include <random>
#include <map>
#include <unordered_map>
#include <cstdlib>
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,k;
cin>>a>>b>>k;
while(k){
if(a%2==1)a--;
a/=2;
b+=a;
k--;
if(k==0)break;
if(b%2==1)b--;
b/=2;
a+=b;
k--;
if(k==0)break;
}
cout<<a<<" "<<b<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000;
double PI = 3.1415926535;
template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<pair<ll,ll>>>;
int main(){
... | 0 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <queue>
#define LL long long
#define N 55555
#define maxn 10005
#define INF 0x3f3f3f3f
#define mase(a,b) memset(a,b,sizeof(a))
#define MIN(a,b) (a<b?a:b)
#define MAX(a,... | #define scanf_s scanf
#include <stdio.h>
#include <string>
#include <iostream>
using namespace std;
#define MAX 20
int main(void)
{
int i;
char str[MAX + 1];
scanf_s("%s", str, MAX);
for (i = 0; str[i + 1] != '\0'; ++i);
for (; i >= 0;--i){
printf("%c", str[i]);
}
printf("\n");
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n; cin >> n;
if (n-1) {
ll a, b; cin >> a >> b;
cout << a + b << endl;
} else {
cout << "Hello World" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin>>S;
int w;
cin>>w;
int a=S.size();
if(w!=1){
for(int i=1; i<a+1; i++){
if(i%w==1){
cout<<S[i-1];
... | 0 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n,rank[100];
pair<int,int> point[100];
scanf("%d",&n);
for(int i=0;i<n;i++){
point[i].first = 0;
point[i].second = i;
}
for(int i=0;i<n*(n-1)/2;i++){
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
if(c<d){
p... | 0 |
#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
using ll = long long;
string s;
void dfs(string op,int now,int i)
{
if(i==4)
{
if(now==7)
{
for(int i =0 ;i<3;i++)cout<<s[i]<<op[i+1];
cout<<s.back();
cout<<"=7"<<endl;
exit(0);
}
return;
}
dfs(op+'+',now+s[i]-'0',i+1);
if(i)dfs... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
int a[4], ans, k;
for (int i = 3; i >= 0; i--)
{
a[i] = n % 10;
n = n / 10;
}
string op;
for (int i = 0; i < 8; i++)
{
ans = a[0];
k = 1;
for (int j = 2; j >= 0; j--)
{
if (i & (1 << j))
{
... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
string s, t;
cin >> s >> t;
int index = -1;
REP(i, n) {
if (s.substr(i, n - i) == t.substr(0, n - i)) {
index... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pii pair<int,int>
const long long MOD=1000000007;
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int xmax=x,ymin=y;
rep(i,n){
int x0;
cin>>x0;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w
#define i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
int bit[55][55];
void add(int x, int y){
for(int i=x;i>0;i-=(i&-i)){
for(int j=y;j>0;j-=(j&-j)){
bit[i][j]++;
}
}
}
ll g... | 0 |
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG_MODE
#define DBG(n) n;
#else
#define DBG(n) ;
#endif
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int W = 0;W < (n);W++)cerr << v[W] << ' ';cerr << end... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | #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... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int ans = 0;
for (int i = 1; i < N; i++) {
int d = A[i - 1] - A[i];
if (d > 0) {
ans += d;
A[i] = A[i - 1];
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int r;
int x;
cin >> n;
cin >> r;
x = 100*(10-n)+r;
if (n >= 10) {
cout << r;
} else {
cout << x;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, R;
cin >> N >> R;
if (N < 10) {
R += 100 * (10 - N);
... | 1 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <assert.h>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <complex>
#include <iomanip>
#include <stack>
using namespac... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S, target = "FESTIVAL";
cin >> S;
S.replace(S.length()-target.length(),S.length(),"");
cout << S << endl;
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main() {
int month, day; cin >> month >> day;
while (month != 0 && day != 0) {
if (month >= 1) day = day;
if (month >= 2) day = day + 31;
if (month >= 3) day = day + 29;
if (month >= 4) day = day + 31;
if (month >= 5) day = day + 30;
if (month >= 6) day = day ... | #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << (#x) << " is " << x << endl;
#define Q int t; scanf("%d", &t); for(int q=1; q<=t; q++)
typedef long long int lli;
typedef pair<int, int> pi;
int main()
{
int has = 1, a, b, ans=0;
cin >> a >> b;
while(has < b){
has--;
has += a;
an... | 0 |
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
struct LowLink{
vector<vector<int>>& edges;
// 関節点
vector<int> art;
vector<pair<int,int>> bridge;
vector<int> used, ord, low;
int k;
void dfs(int idx, int par){
ord[idx] = k++;
... | #include <vector>
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
#define MAX 10000
vector<int> G[MAX];
int n;
bool visited[MAX];
int treeIdx[MAX], parent[MAX], lowest[MAX], treeNodeCounter;
void dfs(int curIdx, int prev)
{
treeIdx[curIdx] = lowest[curIdx] = treeNodeCounter;
treeNodeCo... | 1 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
string s;
cin >> s;
if(s.size() == 2)
{
cout << s << "\n";
}
else
{
for(int i = s.size() - 1;i >= 0;i--)
{
cout << s[i];
}
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
if(s.length()==3)
{
reverse(s.begin(),s.end());
}
cout << s << '\n';
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll Mod = 1000000007;
bool exists(vector<ll>& vec,ll x)
{
auto pos = lower_bound(vec.begin(),vec.end(),x);
if(pos == vec.end())return false;
return *pos == x;
}
void solve(ll N, ll M, vector<ll> A, vector<ll> B)
{
ll ans = 1;
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define inf 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(c... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin>>A>>B;
int i=0;
int j=B-A;
int sum=0;
int C=A;
while(i<=j){
A=C;
int a=A%10;//A=12345の時5
A/=10;//A=1234
int b=A%10;
A/=10;//A=123
A/=10;//A=12
int d=A%10;
A/=10;//A=1
int e=A;
if(a==e&&b... | #include<iostream>
using namespace std;
int main() {
string sa, sb, sc;
cin >> sa >> sb >> sc;
int na = sa.length() + 1;
int nb = sb.length() + 1;
int nc = sc.length() + 1;
int a = 0, b = 0, c = 0;
char next = 'a', ans = 'A';
while(a < na && b < nb && c < nc) {
if (next == 'a')... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int ma = 0, mi = 999;
for (int i=0; i<5; i++) {
cin >> a;
ma = max(ma, a);
mi = min(mi, a);
}
int dist = ma - mi;
int k;
cin >> k;
if (dist <= k) cout << "Yay!" << endl;
else cout << ":(" << endl;
}
| #include <iostream>
using namespace std;
void call(int n){
bool end_check_num=false;
int i=1,x;
while(1){//check_num
while(1){//end_check_num
x=i;
if(x%3==0){
cout<<" "<<i;
break;//goto end_check_num
}
while(1){//include3
if(x%10==3){
cout<<" "<<i;
end_check_num=true;
break;... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
if(N<K){
cout<<1<<endl;
}
else if(N%K==0){
cout<<0<<endl;
}
else{
cout<<1<<endl;
}
}
| #include <iostream>
#include <climits> // to use INT_MIN and INT_MAX
using namespace std;
typedef long long ll;
ll arr[100005];
ll gcd(ll a, ll b) { // Euclidean algorithm
if (b == 0) return a;
return gcd(b, (a%b));
// doing a%b will also help swap both numbers in the case b>a
}
bool multiples(l... | 0 |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
long long ret = 0;
int neg = 0;
vector<long long>arr(n);
for(int i=0; i<n; i++){
cin>>arr[i];
if(arr[i]<0) neg++;
ret+=abs(arr[i]);
arr[i] = abs(arr[i]);
}
if(neg%2) ret-=2*(*min_element(arr.begin(),arr.end()));
cout<<ret;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
set <int> s;
for(int i = 0;i < n;++i){
int num;
cin >> num;
auto itr = s.find(num);
if(itr == s.end()) s.insert(num);
else s.erase(num);
}
cout << (int)s.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,i,c=0,d=0,n,m,t,j;
cin>>n;
long long A[n];
for(i=0;i<n;i++)
cin>>A[i];
sort(A,A+n);
for(i=0;i<n-1;i++)
{
if(A[i]==A[i+1])
{
c+=2;
i++;
}
}
std::cout <<n-c<< '\n';
return 0;
}
| 1 |
#include <cstdio>
#include <utility>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
int in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}
int in() {return in(gcu());}
bool scan(int &n){int c=gcu();return c==EOF?fa... | #include <stdio.h>
#include <iostream>
#include <queue>
#include <map>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#define PB push_back
#define in scanf
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#... | 1 |
#include<iostream>
#include<math.h>
using namespace std;
int main(){
long long a,b,c,d=0,e=0;
cin>>a>>b>>c;
if(a==b && b==c || a!=b && b!=c && a!=c){cout<<"No";return 0;}
else{cout<<"Yes";}
return 0;
}
| //============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
string s;
cin >> s;
int n = int(s.size());
if(n == 2 && s[0] == s[1]) return cout << 1 << ' ' << 2 << '\n', 0;
for(int i = 0; i < n - 2; ++i){
string ac = s.substr(i, 3);
if(ac[0] =... | #include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
string S;
cin >> S;
ve... | 1 |
#include <iostream>
using namespace std;
int bubbleSort(int A[], int N)
{
int s = 0;
for(int i = 0; i < N - 1; i++)
for(int j = N - 1; j > i; j--)
if(A[j] < A[j - 1]){
int tmp = A[j - 1];
A[j - 1] = A[j];
A[j] = tmp;
s++;
}
return s;
}
int main()
{
int N;
cin >> N;
int A[N];
for(int ... | #include <iostream>
#include <cmath>
#include <vector>
#include <climits>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> v;
for(int i = 0;i < n;i++)
{
int t;
cin >> t;
v.push_back(t);
}
bool f = true;
int c = 0;
while(f)
{
f = false... | 1 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#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++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) fo... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#define MN 301000
#define MM 1601000
typedef std::pair<int, int> P;
int h[MN], nxt[MM], to[MM], cost[MM], K = 0;
std::vector<P> v[101000];
int d[MN], n, m;
std::deque<int> q;
void ins(int u, int v, int c) {nxt[++K] = h[u]; ... | 1 |
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>... | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr... | 1 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
// For modular arithmetic when a modular is specified per input case.
// Verified: ABC129F
struct ModInt {
private:
static int64 M;
int64 x;
public:
static void SetMod(int64 mod) {
M = mod;
}
ModInt(int64 ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
int n , g , p[11] , c[11] , mn=1e9;
bool vis[11];
void solve(int i , int sum , int cnt)
{
if (i > n)
{
int rem = g-sum;
if (rem <= 0) mn = min(mn , cnt);
else
... | 0 |
#include<iostream>
#include<string>
using namespace std;
int main(void) {
string str, cmd, rep;
int q, s, e;
cin >> str >> q;
for (int i = 0; i < q; i++) {
cin >> cmd >> s >> e;
int interval = e - s + 1;
if (cmd == "print") {
cout << str.substr(s, interval) << endl... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
int H, W;
cin >> H >> W;
int... | 0 |
#include "bits/stdc++.h"
using namespace std;
// Inserted snippets: io, root
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if ... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
u... | 1 |
// luogu-judger-enable-o2
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
typedef long long int64;
using namespace std;
inline int64 read(int f = 1, int64 x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();... | //Optional FAST
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
//Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_... | 1 |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#d... | /*
* Since g++10 is released, some characters is not valid inside #if 0 :(
* So, why not using clang++? :D
* Date:
echo -n ' ' && date +%Y.%m.%d # Just Run this (Type !!sh in Vim).
* Solution:
* 考虑边界，推导结论，子问题递归求解
如果 S <= p[1] 或者 S >= p[n] ，显然所有人投票都是一个方向，不妨假设 p[1] < S < p[n] 。
考虑处在最边上的 1 号点和 n 号点，如果 a[1]... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<iomanip>
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define sz(a) (int)a.size()
using namespace std;
int main() {
ios::sync_with_st... | #include <iostream>
using namespace std;
int main()
{
int D,T,S;
cin>>D>>T>>S;
double t=(double)D/S;
if(t<=T){
cout<<"Yes"<<endl;
}
else {
cout<<"No"<<endl;
}
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll read(){
ll a=0,b=getchar(),c=1;
while(!isdigit(b))c=b=='-'?-1:1,b=getchar();
while(isdigit(b))a=a*10+b-'0',b=getchar();
return a*c;
}
string s;
int main(){
cin >> s;
if(s.size()<26){
for(char c='a';c<='z';c++)
if(s.find(c)==string::npos){
... | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <assert.h>
#include <numeric>
#include <time.h>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(... | 0 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define DEBUG true
#ifdef ONLINE_JUDGE
#undef DEBUG
#define DEBUG false
#endif
using namespace std;
#define TRACE(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); cerr ... | #include<bits/stdc++.h>
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long int
#define mod 998244353
using namespace std;
int fact[200005];
int power(int a, int b)
{
if(b==0)
return 1;
int t = power(a,b/2);
t*=t;
t%=mod;
if(b&1)
t*=a;
return t%... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,L;cin>>N>>L;
int left=L;
int right=L+N-1;
int all=0;
for(int i=1;i<=N;i++) all+=L+i-1;
if(left>=0) cout<<all-L<<endl;
else if(right<=0) cout<<all-L-N+1<<endl;
else cout<<all<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll=long long;
using Graph=vector<vector<ll>>;
int main(){
ll n,t;cin>>n>>t;
vector<ll> ti(n);
rep(i,n)cin>>ti[i];
ll c=t;
for(int i=n-1;i>0;--i){
c+=min(t,ti[i]-ti[i-1]);
}
cout<<c;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.