code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<cstdio>
const int N=1e5+9;
int L[17][N],R[17][N],n,t,q,X[N],ans;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d",X+i);
scanf("%d",&t);
for(int i=1,it=1;i<=n;++i){
while(it<n&&X[it+1]-X[i]<=t)++it;
R[0][i]=it;
}
for(int i=n,it=n;i;--i){
while(it>1&&X[i]-X[it-1]<=t)--it;
L[0][i]=it;
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)
#define F first
#define S second
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define PI 3.141592653589
// Input
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,... | #include <bits/stdc++.h>
using namespace std;
const int N=200005;
int f1[N],f2[N];
map <pair <int ,int > ,int > ans;
inline int getrt(int x,int *f){
return f[x]==x?x:f[x]=getrt(f[x],f);
}
inline void merge(int x,int y,int*f){
if (getrt(x,f)!=getrt(y,f))
f[getrt(x,f)]=y;
}
int main (){
int n,m,k;scanf ("%d%d%d",&n,... | 1 |
#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 nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans *= A - i;
}
for (int i = 0; i < B; i++) {
ans /= i + 1;
}
... | //高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 10... | 0 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
int main(){
int n;
string st = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
cin >>n;
while(n!=0){
string s;
vector<int>key;
string ans = "";
for(int i = 0; i<n;i++){
int x;
cin >>x;
key.push_back(x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = (int)1e5 + 9;
int l[N], r[N];
int main(){
fastIO;
int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template<typename T>inline
#define TTF_ templ... | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | 1 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int w[10], k[10];
for(int i = 0;i < 10;i++)scanf("%d",w + i);
for(int i = 0;i < 10;i++)scanf("%d",k + i);
sort(w,w + 10);
sort(k,k + 10);
printf("%d %d\n",w[9] + w[8] + w[7], k[9] + k[8] + k[7]);
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(void)
{
int wc[10], wsum=0, kc[10], ksum=0;
for(int i = 0 ; i < 10 ; i++) {
cin >> wc[i];
}
for(int i = 0 ; i < 10 ; i++) {
cin >> kc[i];
}
sort(wc, wc+10);
sort(kc, kc+10);
for(int i = 9 ; i > 6 ; i--) {
wsum += wc... | 1 |
#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... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vll vector<long long>
#define inf 1000000100
#define infll 1LL << 50
ll gcd(ll a, ll b)
{
if(b == 0)
{
return a;
}
return gcd(b, a%b);
}
ll ... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
struct edge{
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SZ(X) ((int)(X).size())
#define endl "\n";
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
string... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll =... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int l[200000] = {0};
int main() {
int N;
map<int, int> d;
scanf("%d", &N);
for(int i=0;i<N;i++) {
scanf("%d", &l[i]);
}
for(int i=0;i<N;i++) {
auto itr = d.find(l[i]);
if(itr != d.end()) {
d... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
const int iINF = 1001001001;
const long long llI... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N,L;
cin>>N>>L;
int data[N];
int m=1000,sum=0;
rep(i,N){
data[i]=L+i;
m=min(m,abs(data[i]));
sum+=data[i];
}
bool exist=false;
rep(i,N){
if(m==data[i]){... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define f(i,a,n) for(ll i=a;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll isPrime(int n)
{
// Corner cases
if (n <= 1)
return 1;
if (n <= 3)
return 2;
// This is checked so that we can skip
// mid... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define N 1001000
#define inf INT_MAX
inline int read()
{
int s=0,w=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){s=s*10+ch-'0';ch=getchar();}
return s*w;
}
int n;
char a[N],b[N];
int pos[N],Ans,cnt,ans[N];
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
int K,T; cin >> K >> T;
int a[T];
for(int i=0;i<T;i++){
cin >> a[i];
}
sort(a,a+T);
int sum=0;
for(int i=0;i<T-1;i++){
sum+=a[i];... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i=0; i<(int64_t)(n); i++)
#define all(v) v.begin(), v.end()
//c
int main(){
int n, k;cin >> n >> k;
vector<vector<int>> a(51, vector<int>(n));
rep(i, n) cin >> a[0][i];
rep(i, k){
vector<int> memo(n+1);
rep(... | #include <cstdio>
#include <algorithm>
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using usize = std::size_t;
i32 a[200000];
auto main() -> i32 {
i32 n,... | 1 |
#ifndef _WIN32
#include<iostream>
#endif
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
#define FOR(i,bg,ed) for(int i = (bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
}star;
template<typ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<bitset>
#include<functional>
#include<climits>
using namespace std;
typedef pair<int,int>pii;
const int INF=... | 1 |
#include <cstdio>
#include <cstring>
const int mod = 1e9 + 7;
const int MAXN = 3e5 + 5;
template<typename _T>
void read( _T &x )
{
x = 0;char s = getchar();int f = 1;
while( s > '9' || s < '0' ){if( s == '-' ) f = -1; s = getchar();}
while( s >= '0' && s <= '9' ){x = ( x << 3 ) + ( x << 1 ) + ( s - '0' ), s = getc... | #include <bits/stdc++.h>
using namespace std;
const int N=300005,M=1e9+7;
char s[N];
int t[8][2],f[N][8];
int main(){
t[0][0]=2;t[0][1]=1;t[1][0]=3;t[1][1]=5;
t[2][0]=4;t[2][1]=7;t[3][0]=6;t[3][1]=1;
t[4][0]=2;t[4][1]=2;t[5][0]=5;t[5][1]=5;
t[6][0]=3;t[6][1]=3;t[7][0]=2;t[7][1]=1;
scanf("%s",s);
int n=strlen(s);
... | 1 |
#include <iostream>
int main(){
int a, b, x, i, n;
long long int s = 0;
a=-1000000;//MAX
b=1000000;//min
std::cin >> n;
for(i=0;i<n;i++){
std::cin >> x;
s += x;
if(x > a) a = x;
if(x < b) b = x;
}
std::cout << b << " " << a << " " << s << std::endl;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(2);
int k;
cin >> a[0] >> a[1] >> k;
int times = 0;
int side = 0;
while(1){
if(a[side] % 2 == 1) a[side] -= 1;
a[side] /= 2;
a[(side+1)%2] += a[side];
side += 1;
side %= 2;
t... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#d... | #include "bits/stdc++.h"
#define sp <<" "
#define el <<"\n"
#define S second
#define F first
#define mp make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define obit __builtin_popcount
#define pof pop_front
#define For(i,a,n) for(i=a;i<n;i++)
#define all(ar) ar.begin(),ar.end()
using namespac... | 1 |
#include <bits/stdc++.h>
#define maxn 100010
#define ll long long
using namespace std;
int n,m,vis[maxn];
ll ans[maxn],a[maxn],k,cnt,q[maxn],pos[maxn];
template <class T>
void read(T &x){
char s=getchar();int f=0;x=0;
while(s<'0'||s>'9'){if(s=='-') f=1;s=getchar();}
while(s>='0'&&s<='9') x=(x<<3)+(x<<1)+s-'0',s=g... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
using... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
if (N == 1){
cout << 1 << endl;
return 0;
}
vector<int>A(N);
vector<vector<vector<int>>> data(N, vector<vector<int>>(N, vector<int>(2)));
for (int i = 0; i < N; i++) {
cin >> A.at(i);
for (int j = 0; j < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int a,b;
cin>>a>>b;
if(n%2==0)cout<<a+b<<endl;
else cout<<"Hello"<<" "<<"World"<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int ans=0,N,X,T;
cin >> N >> X >> T;
if(N%X){
ans = (N/X+1)*T;
}else{
ans = (N/X)*T;
}
cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main() {
int x,y;
cin >> x >> y;
if (x == 1 && y == 1) {
cout << 1000000 << endl;
} else {
cout << (max(0,4-x)+max(0,4-y))*100000 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
if (B == 1) {
cout << 0 << endl;
return 0;
}
int output = 1;
int socket = A;
while (1) {
if (socket >= B) break;
socket--;
socket += A;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int K,T;
cin >> K >> T;
int a[T];
for (int i = 0; i < T; i++) {
cin >> a[i];
}
sort(a,a+T);
reverse(a,a+T);
int ma = max(0,a[0] - (K - a[0]));
int ans = max(0,ma-1);
co... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); +... | 1 |
#include <bits/stdc++.h>
//#include <tr1/unordered_map>
//#include"Bignum/bignum.h"
//#define big bignum
#define lowbit(x) (x & -x)
#define debug(x) (cout << "#x = " << (x) << endl)
#define Set(x, i) memset (x, i, sizeof(x))
#define R register
#define For(i, j, k) for(R int i = (j); i <= (int) (k); ++i)
#define Rep(i, ... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 3000005;
const int MOD = 998244353;
long long fac[MAX]; //i!%MOD=fac[i]
long long finv[MAX]; //pow(i!,-1)%MOD=finv[i]
long long inv[MAX]; //pow(i,-1)%MOD=inv[i]
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] ... | 0 |
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct edge{
int to;
int cap;
int rev;
};
struct Dinic{
int V;
vector<int> level, used;
vector<vector<edge>> G;
Dinic(int N){
V = N;
used.resize(V, 0);
level.resize(V, -1);
G.resize(V)... | 1 |
#include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
const int MOD=1e9+7;
int D[1<<20], Dsum[1<<20], Dminus[1<<20], PS[500001];
long long mod(long long a)
{
if(a>=0) return a%MOD;
return ((-a/MOD+1)*MOD+a)... | /** Created by: Marcos Portales
Codeforces User: marcosportales
Country: Cuba
Copyright */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas:
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
#pragma GCC option("... | 0 |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
#define bitcnt(v) __builtin_popcount(v)
#define all(v) v.... | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int n,id[maxn],omove,orev,emove,erev,bit[maxn],rnk[maxn];
bool rev[maxn],vis[maxn];
inline void wrong(){
puts("No");
exit(0);
}
inline void add(int x,int val){
while(x<maxn){
bit[x]+=val;
x+=x&-x;
}
}
inline int sum(int x){
int res=0;
while... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int n,h,v;
cin >> n >> h >> v;
cout << (n - h + 1) * (n - v + 1) ;
}
| #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 x;
cin >> x;
int ans = 0;
ans += x / 500 * 1000;
x %= 500;
ans += x / 5 * 5;
cout << ans << endl;
return 0;
} | 0 |
//Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | #include <bits/stdc++.h>
#define ll long long
#define maxn 100005 /*rem*/
#define mod 998244353
#define db double
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define fi first
#define se second
using namespace std;
ll ksm(ll a, ll b) {
if (!b) return 1;
ll ns = ksm(a,... | 1 |
#include<iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a<=8&&b<=8)
cout<<"Yay!\n";
else
cout<<":(\n";
} | #include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
vo... | 1 |
#include <bits/stdc++.h>
#define lop(i, n) for (int i = 0; i < (n); ++i)
#define tc(t) int t; cin>>t; while(t--)
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;
int a1 = a + b;
int a2 = a + c;
int ... | #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 mk(arr,n,type) type *arr=new type[n];
#define sl s1.length();
#define yes cout<< "Yes"<<endl
#define no cout<< "No"<<endl
#define all(v)... | 1 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n;
while(cin>>n,n){
long long int syain,kakaku,kosuu,syains[5000]={0};
long long int bango[5000]={0},flag[5000]={0};
bool flag2=0;
for(int i=0;i<n;i++){
cin>>... | #include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
struct EmployeeSale {
long employee_number;
long long sales;
};
int main()
{
int data_count = 0;
while (std::cin >> data_count) {
if (data_count == 0) {
break;
}
std::vector<EmployeeSale> sales_per_employee;
for (int i = 0; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
int n;
string ans, newans;
int main() {
cin.tie(0), ios::sync_with_stdio(0);
cin >> n;
cout << "0\n";
cout.flush();
cin >> ans;
if(ans == "V... |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;... | 1 |
#include <iostream>
using namespace std;
int main() {
int N, K; cin >> N >> K;
int ans = 0;
for (int i = 1; i <= N; i++) if (i + (K - 1) <= N) ans++;
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N, K;
cin >> N >> K;
cout << N - K + 1 << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string A,B,C;
cin >> A >> B >> C;
int D = A.size() - 1;
int E = B.size() - 1;
int F = C.size() - 1;
if(A[D] == B[0] && B[E] == C[0]){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
#define TOP 0
#define FRONT 1
#define LEFT 2
#define RIGHT 3
#define BACK 4
#define BOTTOM 5
using namespace std;
//TOP,FRONT,LEFT,RIGHT,BACK,BOTTOM
int dice[6]={1,2,4,3,5,6};
//?\\?????¢??????
void rotN(){
swap(dice[TOP],dice[FRONT]);
swap(dice[FRONT],dice[BOTTOM]);
swap(dice[BOTTOM],d... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long k, n;
string s;
cin >> k >> s;
n = (long long)(s.length());
if (k >= n){
cout << s << endl;
}
else{
cout << s.erase(k) << "..." << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll x,y;
cin >> x >> y;
ll ans = 0;
if (x * y > 0){
if (x <= y){
ans = y-x;
}
else{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mn=2e6+10;
const ll mod=998244353;
ll inv(ll x){
ll ans=1;
for(ll i=mod-2;i;i>>=1,x=x*x%mod)if(i&1)ans=ans*x%mod;
return ans;
}
ll fact[mn];
ll ch(ll n,ll k){
if(k<0||k>n)return 0;
return fact[n]*inv(fact[k])%mod*inv(fact[... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxN = 2000 + 5;
int n;
LL P;
LL f[maxN * 3][maxN];
int main() {
cin >> n >> P;
f[0][0] = 1;
for(int i = 0; i <= n * 3; ++i) {
for(int j = 0; j <= i / 2 && j <= n; ++j) {
(f[i + 1][j] += f[i][j]) %= P;
(f[i + 2][j + 1] += f[i][j]... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2000+5,base=2001*3;
int f[N*3][N*6],mod;
void add(int &x,int y){
x=(x+y)%mod;
}
signed main(){
int n;
cin>>n>>mod;
n*=3;
f[0][base]=1;
for(int i=0;i<n;++i)
for(int j=-i;j<=i;++j)
if(f[i][j+base]){
add(f[i+1][j+1+base],f[i][j+b... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
// Morris-Pratt
//... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
bool f(P l,P r){
int a = l.second - l.first;
... | 0 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#define ll long long
using namespace std;
ll _11[18];
int main()
{
ll d;
scanf("%lld",&d);
if(d%9){puts("0");return 0;}
d/=9;
ll ans=0;
for(int i=1;i<=17;i++) _11[i]=_11[i-1]*10+1;
ll len=1;
for(int i=1;i<=17;i++)
{
ll res=1,del=d,L=len,R=... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int e;
cin >>e;
while(e)
{
int x=0;
int y=0;
int z=0;
int m=0;
for(z=0;z*z*z<=e;z++)
for(y=0;z*z*z+y*y<=e;y++)
{
x = e-z*z*z-y*y;
if(x<0)
continue;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int k;
int numShow = 1;
int minNumber = 9999999;
cin >> n >> k;
for (int i = 0; i < n; i++) {
// 操作Aの処理
for (int a = i; a < n; a++) {
numShow *= 2;
if (numShow > minNumber) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9 * 2;
int main() {
int n, k;
cin >> n >> k;
int num = 1;
rep(i, n){
num += min(num, k);
}
cout << num << endl;
... | 1 |
#include <array>
#include <cstdlib>
#include <iostream>
#include <string>
#include <queue>
#include <vector>
class SSF {
private:
void ScanLine(std::vector<std::string> *map, const char lx, const char rx, const char y, const char oy, std::array<std::queue<char>, 4> *buffer) {
unsigned char i = lx;
while (i <= rx) ... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> PA;
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
queue<PA> que;
int main(){
int n,ans;
char m[13][13];
while(cin >> m[0]){
for(int j = 0;j < 12;j++){
if(j==0) continue;
cin >> m[j];
}
ans = 0;
for(int j = 0;j... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
#define all(c) (c).begin(), (c).end()
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main() {
int n; ci... | #include <bits/stdc++.h>
using namespace std;
int main() {
string az="abcdefghijklmnopqrstuvwxyz";
string s;
cin >> s;
sort(s.begin(),s.end());
int i=0,j=0;
for(int j=0;j<s.length();j++) {
if(az[i]==s[j]) {
i++;
}
if(i==26) {
cout << "None" << endl;
return 0;
}
}
c... | 0 |
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define mod 1000000007
int main() {
int n;
cin >> n;
int k = 0, l = 0, m = 0;
ll ret = 1;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (k == a) {
int count = 1;
k++;
... | #include<bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long n, long long p){
long long res = 1;
while(n > 0){
if(n & 1){
res = res*a%p;
}
a = a*a%p;
n >>=1;
}
return res;
}
int main()
{
int n;
long long ans = 0;
cin>> n;
vector<int> a(n);
vector<int> cnt(n);
for(int i=0;... | 1 |
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
while(1){
int N;
cin>>N;
if(!N)break;
int rui[10000]={0};
for(int i=1;i<=N;i++){
int a;
cin>>a;
rui[i]=rui[i-1]+a;
}
in... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sst... | 1 |
#include <iostream>
using namespace std;
int main(){
int a,s;
while(cin>>a){//EOF?????§
s=0;
for(int i=a;i<600;i+=a){
s+=i*i*a;
}
cout<<s<<endl;
}
return 0;
}
| #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... | 0 |
#include <iostream>
#include <vector>
#include <queue>
#include <functional>
#include <algorithm>
using namespace std;
const int INF = 1 << 30;
const int V = 100000;
const int E = 500000;
struct Edge{ int to, cost; };
vector<Edge> list[E];
typedef pair<int, int> P;
int d[V];
int main()
{
cin.tie(0);
ios::sync_with_... | #include<functional>
#include<algorithm>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define pf push_front
#define pb push_back
#define ... | 0 |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int temp=n;
int lastdigit;
int digits=0;
while(n!=0){
lastdigit=n%10;
n/=10;
digits++;
}
int result=0;
while(digits){
result*=10;
digits--;
result+=lastdigit;
}
... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
int next = n / 100 * 111;
if (next < n) {
next += ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector< vector<ll> > vvint;
typedef vector< vector< vector<ll> > > vvvint;
typedef vector<string> vstring;
typedef vector< vector<string> > vvstring;
typedef ve... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
long k;
cin >> k;
long q = k / 50, r = k % 50;
cout << 50 << '\n';
for (long i=0; i<50; i++)
cout << q + i - r + (i < r ? 51 : 0) << (i < 49 ? ' ' : '\n');
return 0;
} | 1 |
#include<stdio.h>
#include<string.h>
void haichi(void);
void Block(int,int);
int c,d,x,y,xg,yg,M,Flag;
int MAP[101][101],MF[101][101];
int main(void)
{
int w,h,xs,ys,n;
while(1){
Flag=0;
memset(MAP,0,sizeof(MAP));
memset(MF,0,sizeof(MF));
scanf("%d %d",&w,&h);
if(w == 0 && h == 0) break;
scanf("%d %d %d %... | #include<iostream>
using namespace std;
#define MAX 100
#define BLANK 0
#define LONG 4
#define SHORT 2
#define HORIZONTAL 0
#define VERTICAL 1
#define VISITED 9
int field[MAX+2][MAX+2];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
void rec(int x,int y,int c)
{
int i;
if(field[x][y]!=c)return;
field[x][y]=VISITED;... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string a;
cin>>a;
if(a.at(0)!='A'){
cout<<"WA"<<endl;
return 0;
}
for(ll i=2;i<a.size()-1;i++){
if(a.at(i)=='C'){
a.at(i)='z';
break;
}
if(i==a.size()-2){
cout<<"WA"<<endl;
return 0;
... | #include <iostream>
#include <string>
using namespace std;
int main(){
string str;
cin >> str;
for(auto it=str.rbegin();it!=str.rend();++it)cout << *it;
cout << endl;
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
int n,k;
int card[16];
int check[16];
set<string> ss;
string tos(int a){
char str[100];
int i=0;
while( a>0 ){
str[i++] ... | #include <iostream>
#include <map>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#pragma warning (disable: 4996)
using namespace std;
int dat[10] = { 0,2,5,5,4,5,6,3,7,6 };
int N, M, A[1 << 18];
int dp[1 << 18];
int main() {
cin >> N >> M;
for (int... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main() {
bool A=0;
char ch,ch_;
cin>>ch;
ch_=ch;
while((cin>>ch)!=0) {
if(ch_=='A'&&ch=='C') {
cout<<"Yes";
return 0;
}
ch_=ch;
}
cout<<"No";
return 0;
} | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <fstream>
using name... | 1 |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
template<class T, class T2> inline void chkmax(T &x, const T2 &y) { if(x < y) x = y; }
template<class T, class T2> inline void chkmin(T &x, const T2 &y) { if(x > y) x = y; }
const int MAXN = (int)3e5 + 17;
const int mod = (int)1e9 + 7;
const int OFFSET = ... | #include<bits/stdc++.h>
using namespace std;
#define MAXN 1000005
#define P 998244353
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
x *= f;
}
long long fac[MAXN], inv[MAX... | 0 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | //by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define bged(v) (v).begin(),(v).end()
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
typedef long long ll;
const int Imx=2147483647;
const ll Lbig=2e18;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
const int mod = (int) 1e9+7;
void __print() {cerr << "]\n";}
template<typename T, typename... V>
void __print(T t, V... v)
{ cerr << t; if(sizeof...(v)) cerr << ", "; __print(v...);}
#define dbg(x...) cerr << "[" <<... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e9+7 ;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n ;
cin >> n ;
vector<pair<ll,ll>> A(n);
for(int i = 0 ; i < n ; ++i){
cin >> A[i].first >> A[i].second ;
}
au... | #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD (1000000007)
//#define MOD (998244353)
#define PI ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18 + 10;
const int dx[9] = {1, 0, -1, 0, 1, -1, -... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool AC = true;
if(s[0] != 'A') AC = false;
int count = 0;
for(int i=2; i<s.size()-1; i++) {
if(s[i]=='C') count++;
else if (isupper(s[i])) AC = false;
if(i==s.size()-2 && count != 1) AC = fals... | #include <iostream>
#include <string>
#include <regex>
using namespace std;
int main() {
string input;
cin >> input;
regex pattern("^A[a-z]+C[a-z]+$");
if (regex_match(input, pattern))
{
cout << "AC" << endl;
}
else
{
cout << "WA" << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
... | // ALDS1_13_A
#include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)... | 0 |
#include <cstdio>
#include <cmath>
#define buf 10000
using namespace std;
int k=0;
int B[buf];
void Answer(int n);
int PrimeNumber(int n);
int main(void){
int i,n;
char str[buf];
for(i=2;i<buf;i++)
PrimeNumber(i);
for( ;fgets(str,sizeof(str),stdin)!=NULL; ){
sscanf(str,"%d",&n);
if(n==0) break;
... | #include<iostream>
using namespace std;
bool isp[10000];
main()
{
isp[0]=isp[1]=1;
for(int i=2;i<=100;i++)
{
if(isp[i])continue;
for(int j=i*i;j<=10000;j+=i)isp[j]=1;
}
int n;
while(cin>>n,n)
{
while(isp[n]||isp[n-2])n--;
cout<<n-2<<" "<<n<<endl;
}
}
| 1 |
#include <iostream>
using namespace std;
int main(void){
int n,a[100];
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
cout << a[n];
for(int i = n-1; i >= 1; i--){
cout << " " << a[i];
}
cout << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | #include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
using ll=long long;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> V(N,0);
for (int i=1; i<N; i++) {
if (S[i-1]=='A' && S[i]=='C') {
V[i]=V[i-1]+1;
}
else {
V[i]=V[i-1];
}
//cout << V[i]<< ... | 0 |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
// -fsanitize=undefinedでオーバーフロー検出,オーバーフローする入力を投げるとよい
#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
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
if (n == 2) {
int o, e; cin >> o >> e;
if (o == e) cout << 1 << endl;
else cout << 0 << endl;
return 0;
}
const int p = n / 2;
const int z = 100001;
vector<int> o_num(z, 0), e_num(z, 0);
for (int i = 0; i... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1e9 + 7;
int N, K;
vector<int> D;
void dfs(int n) {
bool flag = false;
int tmp = n;
while (tmp > 0) {
for (int i = 0; i < K; i++) {
if (tmp % 10 == D[i]) {
flag = true... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T ... | 1 |
#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
#define ll long long
int main() {
ll a,b;
cin >> a >> b;
vector<ll> ay;
vector<ll> by;
for(ll i = 1; i <= sqrt(a);i++){
if(a%i == 0){
ay.push_back(i);
if(i != a/i){
ay.push_back(a/i);
}
}
}
for(ll ... | #include <stdio.h>
int main(void){
int A,B;
scanf ("%d %d",&A,&B);
if (B+2<=A) printf ("%d",A+(A-1));
if (A+2<=B) printf ("%d",B+(B-1));
else {
if (A==B+1||B==A+1||A==B) printf ("%d",A+B);
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int cpN = N;
int sum = 0;
while(cpN > 0){
sum += cpN % 10;
cpN /= 10;
}
if(N % sum == 0)cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).su... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return tr... | #include<bits/stdc++.h>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
typedef long long ll;
using namespace std;
const int maxn=2e3+5;
char S[maxn];
int s[maxn][maxn],a[maxn][maxn];
int i,j,H,W,ans,h[maxn][maxn],t,q[maxn][2],cnt,len;
int m... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x[n],i=0;
int z=0;
for (;i<n;i++){
cin>>x[i];
if(z==0&&i>0){
int j=i-1;
if(x[j]==x[i]||x[j-1]==x[i])
z++;
}
}
if(z==0){
sort(x,x+n);
int j=n-1;
int m=n/2+1;
int k=n/2-1;
for (int i=0;i<n/4+2;i++){
if(x[i+1]==x[i]||x[j]==x[j-1]||x[m]==x[m-1]||... | #include<iostream>
#include<algorithm>
using namespace std;
int p[200000];
int main() {
//C
int n;
cin >> n;
int i;
for (i = 0; i < n; i++) {
cin >> p[i];
}
sort(p, p + n);
for (i = 0; i < n-1; i++) {
if (p[i] == p[i + 1]) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string str;
int A, B, C, D;
int N[15];
cin >> str;
transform(begin(str), end(str), N, [](char c) {return c - '0'; });
A = N[0];
B = N[1];
C = N[2];
D = N[3];
for (int i=0;i<2;++i) {
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
c... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int n;
cin>>s>>n;
for(int i=0;i<s.size();i+=n)cout<<s[i];
puts("");
} | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<... | 1 |
#include<cstdio>
#include<cstring>
#define N 300010
using namespace std;
int to[8][2]={2,1,
3,5,
4,7,
6,1,
2,2,
5,5,
3,3,
2,1};
char s[N];
int f[N][8];
const int p=1e9+7;
int main()
{
scanf("%s",s);
int n=strlen(s);
f[n][1]=f[n][5]=1;
for(int i=n-1;i>=0;i--)
for(int j=0;j<8;j++)... | #include<cstdio>
#include<cstring>
#define N 300003
#define p 1000000007
inline int mod(int x){return x>p?x-p:x;}
char c[N];int f[8],g[8],i,j,k,n,x;const int a[8]={1,3,5,1,1,7,6,5},b[8]={2,4,6,1,2,2,6,5};
int main()
{
scanf("%s",c+1),n=strlen(c+1),*f=1;
for(i=1;i<=n;i++,memcpy(f,g,32),memset(g,0,32))
{
if(c[i]!=48... | 1 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
... | #include<stdio.h>
int main(){
char str[15];
scanf("%s", str);
str[3] = '8';
printf("%s\n", str);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans=0;
for(int i=n;i!=0;i--){
int a=sqrt(i);
if(a*a==i){
ans=i;
break;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Arra... | 1 |
#include<iostream>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,ans=0x3f3f3f3f;
int a[100000+5];
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n-m+1;i++){
int j=m+i-1;
ans=min(ans,min(abs(a[i])+abs(a[j]-a[i]),abs(a[j])+abs(a[j]-a[i])));
}
if(an... | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
... | 1 |
//bayemirov
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define pb push_back
const int MOD = 1e9 + 7;
const int N = 1e5;
int dp[N][100];
void add(int& x, int y) {
x += y;
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
void solve(){
int n;
string s;
cin >> n >> s;
ve... | 0 |
#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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
in... | #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 all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N,M;
cin >> N >> M;
vector<ll> vec(N + 1);
vec[0] = 0;
rep(i,N){
cin >>... | 1 |
#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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,k;
cin >> n >> k;
vector<ll> a(n);
rep(i,n){
cin >> a.at(i);
}
ll i,sum=0,mini=1e9+7;
for(i=0;i<=n-k;i++){
sum=a.at(i+k-1)-a.at(i);
if(a.at(i+k-1)>0 && a.at(... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int a , b;
cin >> a >> b;
int c = 1 , ans = 0;
while(c<b){
c--;
c += a;
ans++;
}
cout<<ans;
} | #include<bits/stdc++.h>
#define ll long long int
#define vl vector<ll>
#define pl pair<ll,ll>
#define pb push_back
#define F first
#define S second
using namespace std;
ll tako(ll a,ll b)
{
if(a>=b)
return 1;
return 1+tako(a,b-a+1);
}
int main()
{
ll a,b;
cin >> a >> b;
if(b==1)
cout << "0";
else
cout <<... | 1 |
//Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debugg cout<<"debugged\n"... | // J'aime
// Chemise Blanche
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n, m, x, y;
cin >> n >> m >>... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<int, ii>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define mp make_pair
#define fi first
#define se second
// #define multicase
const int MOD = 1e9 + 7;
const int INF = 2e9;
// const i... | # include<iostream>
# include<math.h>
using namespace std;
int main()
{
int a,b;
cin>>a;
b=pow(a,1)+pow(a,2)+pow(a,3);
cout<<b<<"\n";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll x, y, ans = 0;
cin >> x >> y;
if (x == 1) {
... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 |
#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[505][505];
bool chk[23333333];
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
int nxtPrime(int&x){
auto chk=[&](int x){
if(x<2)return false;
for(int i=2;i*i<=x;i++)
if(x%i==0)
... | 0 |
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;
// AOJ 0168
// KannonDou
// input n = year
// EOF = 0
int main(){
long long a[30] = {1, 2, 4}; //a[0] = 1, a[1] = 2, a[2] = 4??§?????????
//i+1????????§?????????????????°
for(int i=3 ; i... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <cstring>
#include <climits>
#define MAX
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
using... | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[111];
int n;
void bs(){
bool flag = true;
int cnt = 0;
while(flag){
flag = false;
for(int j = n-1; j > 0; j--){
if(a[j] < a[j-1]){
cnt++;
swap(a[j],a[j-1]);
flag = true;
}
}
}
for(int i = 0; i < n; i++){
... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
#define N 1000005
queue<int> q;
char a[N],b[N];
int main()
{
int n,i,j,ans=0;
scanf("%d%s%s",&n,a+1,b+1);
if(strcmp(a+1,b+1)==0){printf("0");return 0;}
i=j=n;
while(j){
while(j&&b[j]==b[j-1])j--;
while(i&&(i>j||a[i]!=b[... | 0 |
#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,b;
cin>>a>>b;
if(a<9 && b<9){
cout<<"Yay!"<<"\n";
}
else{
cout<<":("<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N, K, i, min;
cin >> N >> K;
min = 1;
for (i = 0; i < N; ++i)
{
if (min * 2 < min + K)
{
min *= 2;
}
else
{
min += K;
}
}
cout << min << endl;
return (0);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
#define Graph vector<vector<int>>
int main() {
int A, B; cin >> A >> B;
string ans = "Yay!";... | #include<bits/stdc++.h>
using namespace std;
int main()
{ int a,b;
cin>>a>>b;
int r=abs(a-b);
int k=0;
if(a<b)
k=2*a+2*r;
else
k=2*b+2*r;
if(k<=16)
cout<<"Yay!";
else
cout<<":(";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int k, t;
cin >> k >> t;
vector<int> a(t);
rep(i,t) cin >> a[i];
sort(all(a));
int mx = a[t-1];
int e = k-mx;
... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main(){
int N;cin >> N;
int ans=0;
for(int i=3;i<N;i++){
ans=max(ans, N/i);
}
cout << ans << endl;
}
| #include <iostream>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <cstring>
#include<cmath>
using namespace std;
int main() {
int x;
cin >> x;
cout << x / 3;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if(a == 2){cout << -1 << endl;}
else if(a == 3){cout << "aa." <<endl;
cout << "..a" <<endl;
cout << "..a" <<endl;}
else{
int c;
c = (a/4-1)*4;
for(int i = 0;i < c/2;i++){
for(int j... | #include<stdio.h>
#include<algorithm>
#include<vector>
#define fst first
#define snd second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
char three[3][4] = {
"xx.",
"..y",
"..y"
};
char four[4][5] = {
"aacd",
"bbcd",
"cdaa",
"cdbb"
};
char five[5][6] = {
"a... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
ll a,b, k; cin >> a >> b >> k;
for(int i = 0; i < k; i++){
if(i %2 == 0){
a/=2; b += a;
}else{
b/=2; a += b;
}
}
cout << a << " " << b << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,h,w;
cin >>n>>h>>w;
long long kotae=(n-h+1)*(n-w+1);
cout<<kotae<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int sum = 0;
int a, b, m = 101;
for (int i = 0; i < 4; i++){
cin >> a;
m = min(a, m);
sum += a;
}
sum -= m;
cin >> a >> b;
sum += max(a, b);
cout << sum << endl;
} | #include <iostream>
using namespace std;
int main(){
int a[6];
int sum=0;
for(int i=0;i<6;i++){
cin>>a[i];
sum+=a[i];
}
int min=100;
for(int j=0;j<4;j++){
if(min>a[j])min=a[j];
}
sum=sum-min;
if(a[4]>a[5])sum=sum-a[5];
else sum=sum-a[4];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repA(i, a, n) for(int i = a; i <= (n); ++i)
#define repD(i, a, n) for(int i = a; i >= (n); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memset... | #include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
using namespace std;
const int MAX_N = 2e3 + 6, MOD = 1e9 + 7;
int n, k;
int F[MAX_N * MAX_N];
int D[MAX_N * MAX_N];
int dp[MAX_N][MAX_N];
int _sum(int a, int b) {
int c = a + b;
if (MOD <= c)
c -= MOD;
return c;
}
int _mul(int a, in... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[200010],d,n,ans;
int dpl[200010],dpr[200010];
signed main(){
cin>>n>>d;
for(int i=1 ;i<=n;i++)cin>>a[i],ans+=a[i];
ans+=(n-1)*d;
dpr[1]=a[1];
for(int i=2;i<=n;i++)dpr[i]=min(a[i],dpr[i-1]+d);
dpl[n]=a[n];
for(int i=n-1;i>=1;i--)dpl[i]=min(... | 1 |
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, ... | #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 <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
std::vector<int> parse_line(std::string const& line) {
using namespace std;
vector<int> result;
istringstream s(line);
string element;
while (getlin... | #include <cstdio>
#include <iostream>
using namespace std;
int a[11][11];
int main()
{
int i, j;
int n;
while (1){
cin >> n;
if (n == 0){
break;
}
for (i = 0; i <= n; i++){
for (j = 0; j <= n; j++){
a[i][j] = 0;
}
}
for (i = 0; i < n; i++){
for (j = 0;... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> p, r;
void makeSet(int x){
p[x] = x;
r[x] = 0;
}
int findSet(int x){
if(x != p[x])p[x] = findSet(p[x]);
return p[x];
}
void link(int x, int y){
if(r[x] > r[y]) p[y] = x;
else {
p[x] = y;
if(r[x] == r[y]... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
vector<int>E[200000];
int id[200000];
int col[200000];
bool b[200000];
bool dfs(int v,int k,int c){
id[v]=k;
col[v]=c;
bool flag=true;
for(int u:E[v]){
if(id[u]==-1){
flag&=dfs(u,k,!c);
}
else{
i... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
template<class T1, class T2> v... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pair;
vector<Pair> rects;
bool Compare(const Pair &a, const Pair &b) {
int h1 = a.first;
int h2 = b.first;
int w1 = a.second;
int w2 = b.second;
int t1 = h1*h1+w1*w1;
int t2 = h2*h2+w2*w2;
if (t1 != t2) return t1 < t2;
return h1 < h... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,k,sum=0;
cin >> a >> b >> c >> k;
sum+=(a+b+c);
long long x=max(a,max(b,c));
sum-=x;
for(long long i=0; i<k; i++){
x*=2;
}
cout << x+sum << endl;
} | #include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<set>
#include<stack>
#include<queue>
using namespace std;
int s[5];
int ans=-1;
string x;
int flg=0;
void wf(int i,int w ,int z) //i文字目までの部分和w zで＋と－の状況を管理
{
if(flg==1){return;}
int g,h;
//+を挿入し... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
int main() {
vector<int> W, K;
int dommy;
for (int i = 0; i < 10; ++i) {
cin >> dommy;
W.push_back(dommy);
}
sort(W.begin(), W.end(), greater<int>());
for (int i = 0; i < 10; ++i) {
cin >> dommy;
K.push_back(... | //32
#include<iostream>
#include<algorithm>
#include<numeric>
#include<functional>
using namespace std;
int main(){
int p[2][10];
for(int i=0;i<2;i++){
for(int j=0;j<10;j++){
cin>>p[i][j];
}
}
for(int i=0;i<2;i++){
sort(p[i],p[i+1],greater<int>());
cout<<accumulate(p[i],p[i]+3,0)<<((i==0... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.