code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<iostream>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<cstring>
#include<string>
#include<cmath>
#include<list>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
typedef long long ll;
const int maxn = 200000 + 8;
int n,a[maxn];
ll num = 0;
void Merge(in... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main(){
std::ios::sync_with_stdio(false);
cin.tie... | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define mod 998244353
#define ld long double
#define pb push_back
#define inf INT_MAX
#define N 1000000
using namespace std;
int n,m,k;
ll ans=0;
ll inv[N+3];
ll fact_inv[N+3];
ll fact[N+3];
//modulo inverse
void inverse(){
inv[1]=1;//MMI
int i;
for(i=2;i<=N;i++){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int cnt=0;
string A,B,C;
cin>>A>>B>>C;
for(int i=0;i<N;i++){
if((A.at(i) == B.at(i))&&(B.at(i) == C.at(i))) continue;
if((A.at(i) != B.at(i))&&(B.at(i) == C.at(i))){
cnt++;
continue;
}
if((A.at(i) == B.at(i... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
string s,t;
cin>>N>>s>>t;
long long len1,len2,count=0;
len1=s.length();
len2=t.length();
if(len1==len2&&len1==N&&N>=1&&N<=100){
if (N>=len1+len2){
count=N;
}
else {
count=len1+len2;
for(int i=0;i<=l... | 1 |
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <fstream>
#include <itera... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int H,W,A,B; cin >> H >> W >> A >> B;
rep(i,H) {
rep(j,W) {
if (i < B) {
cout << ((j < A) ? 0 : 1);
} else {
... | 1 |
#include <stdio.h>
int main(void)
{
int i, n, x;
i = 1;
x = i;
scanf("%d", &n);
while (i <= n) {
x = i;
if(x%3==0)
printf(" %d", i);
else {
while(x) {
if(x%10==3) {
printf(" %d", i);
break;
... | #include <iostream>
using namespace std;
int main(int argc, char **argv)
{
int n;
cin>>n;
for(int i=1;i<=n;i++){
int x = i;
if(x%3==0){
cout<<' '<<i;
}
else if(x%10==3){
cout<<' '<<i;
}else{
while(x/=10){
if(x%10==3){... | 1 |
#include <stdio.h>
int main(){
int A;
int B;
int C;
scanf("%d %d %d",&A,&B,&C);
if (A==B && B!=C && C!=A) {
printf("Yes\n");
}
else if (A==C && A!=B && C!= B){
printf("Yes\n");
}
else if (B==C && A!=B && C!=A){
printf ("Yes\n");
}
else printf ("No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
set<int> nums;
int a;
whil... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int N;
string S;
string Mena(string str) {
string res = str;
for (int i = 2; i < N; i++) {
if ((S[i-1] == 'o' && res[i-1] == 'S') || (S[i-1] == 'x' && res[i-1] == 'W')) {
res += res[i-2];
... | #include "algorithm"
#include "iostream"
#include "cmath"
#include "string"
#include "map"
using namespace std;
const char dir[4]={'N','E','S','W'};
int x[20],y[20];
int nx,ny,cnt;
void find(char d,int I,int N){
int a=-1;
for(int i=0;i<4;++i){
if(dir[i]==d)a=i;
}
for(int i=0;i<I;++i){
if(a==0)ny+=1;
... | 0 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
using namespace std;
type... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
while (cin >> n, n)
{
long int ary[5001] = {};
for (int i = 1; i <= n; i++)
{
cin >> ary[i];
}
for (int i = 1; i <= n; i++)
{
ary[i] += ary[i - 1];
}
long int ans = -9999999999;
for (int i = 0; i <= n; i++)
... | 0 |
#include <iostream>
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
using namespace std;
int main(){
int n, m;
while(cin >> n, n) {
int cnt[10] = {};
rep(i,n) {
cin >> m;
cnt[m]++;
}
rep(i,10) {
if(cnt[i]==0) cout << "-";
else {
rep(j,cnt[i]) cout << "*"... | #include <stdio.h>
int main(void)
{
int a[10]={0};
int n,i,j,k,l,x;
for(j=0;j<20;j++)
{
//printf("?????°???");
for(l=0;l<10;l++)
a[l]=0;
scanf("%d",&n);
if(n==0)
break;
else
{
for(i=0;i<n;i++)
{
scanf("%d",&x);
a[x]=a[x]+1;
}
}
for(k=0;k<10;k++)
{
if(a[k])
{
for(l=0... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int N;
long M,V,P;
long A[1<<17];
long po[1<<17];
main()
{
cin>>N>>M>>V>>P;
for(int i=0;i<N;i++)cin>>A[i];
sort(A,A+N);
int Li=-1,Ri=N-1;
long okv=A[N-P];
while(Ri>=0&&A[Ri]>=okv)Ri--;
Ri++;
while(Ri-Li>1)
{
int Mi=(Li+Ri)/2;
long dist=A[Mi]+M;
... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
using namespace std;
inline int read()
{
int x = 0, f = 1; char ch = getchar();
while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
while(ch >= '0' && ch <= '9') {x = (x << 3) + (x << 1) + (ch ^ 48); ch... | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int ,int > pii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll maxn = 3e6;
const ll mod =1e9+7;
const ld PI = acos((ld)-1);
#define pb push_back
#define endl '\n'
#define dokme(... | 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>;
int main() {
int n, r;
cin >> n >> r;
int ans = r + 100*max(0,10-n);
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
int main() {
long long n, t;
std::cin >> n >> t;
long long timings[n], intervals[n - 1];
for (long long i = 0; i < n; i++) {
std::cin >> timings[i];
if (i > 0) {
intervals[i - 1] = timings[i] - timings[i - 1];
}
}
long long ans = 0;
for (long lon... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
const int MAX=1e5+10;
int n,q;
cin>>n>>q;
string str;
cin>>str;
str+=' ';
vector<int> a(MAX,0),s(MAX,0);
for(int i=0;i<n;i++) {
if(str[i]=='A'&&str[i+1]=='C') a[i+1]=1;
}
for(int i=0;i<MAX;i++) s[i+1]=s[i]+a[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n, m;
cin >> n >> m;
vector<int> ac(n), wa(n);
for (int i = 0; i < m; i++)
{
int p;
string s;
cin >> p >> s;
if (ac[p - 1])
{
continue;
}
if (s == "WA")
{
wa[p - 1]++;
}
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while( cin >> n, n ) {
int student[n+1]; // 2:friend 1:friends_frined 0:others
for(int i=1; i<=n; i++) student[i] = 0;
cin >> m;
int a[m+1], b[m+1];
for(int i=0; i<m; i++) {
cin >> a[i] >> b[i];
if( a[i] == 1 ) st... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
struct Edge
{
int MFrom;
int MTo;
};
void solve()
{
int n, m;
while(cin >> n >> m, n || m)
{
vector< vector<int> > Vertex(n);
vector<Edge> Vec(m);
for(int i = 0; i < m; ++i)
{
cin >> Vec[i].MFrom >> Vec[i].MTo;
Vec[i].MFrom--;... | 1 |
#include <stdio.h>
#define MYSCAN scanf
int main(void){
int n, pm, pe, pj;
while (true){
MYSCAN("%d", &n);
if (n == 0){ break; }
for (int i = 0; i < n; i++){
MYSCAN("%d%d%d", &pm, &pe, &pj);
if (pm == 100 || pe == 100 || pj == 100){
printf("A\n");
}
else if (pm + pe >= 180){
printf("A\n"... | #include <iostream>
using namespace std;
char divide(int m, int e, int j) {
if (m == 100 || e == 100 || j == 100) return 'A';
if ( (m+e)/2 >= 90 ) return 'A';
if ( (m+e+j)/3 >= 80 ) return 'A';
if ( (m+e+j)/3 >= 70 ) return 'B';
if ( (m+e+j)/3 >= 50 && (m >= 80 || e >= 80) ) return 'B';
return... | 1 |
//
// abc167_Bracket_Sequencing.cpp
// learningCplusplus
//
// Created by Tran Duc Chinh on 2020/04/04.
// Copyright © 2020 Tran Duc Chinh. All rights reserved.
//
#include <iostream>
#include <queue>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
ll mod = 99824435... | //! 尺卂乃卂.卂ﾌ乇乇ㄒ
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<vector<int>>
#define mii map<int,int>
#define mip map<pair<int... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
template<typename T> bool chmax(T &a,const T b... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans=1e18;
int main(){
int n;
cin >> n;
vector<ll> a(n),dp(n+1,0);
for(int i=0;i<n;i++){
cin >> a[i];
dp[i+1]=dp[i]+a[i];
}
for(int split=2;split+1<n;split++){
ll p=0,q=dp[split],r=0,s=dp[n];
auto itr1 = lower_bound(dp.begi... | #include<bits/stdc++.h>
using namespace std;
int n,ans,q[1<<17],f[1<<17],dp[1<<17],a[1<<17];
int main(){
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
memset(q,0x3f,sizeof(q));
for(int i=1;i<=n;i++){
f[i]=upper_bound(q+1,q+n,-a[i])-q;
q[f[i]]=-a[i];
ans=max(ans,f[i]);
}
cout<<ans<<endl;
}
| 0 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int h, w;
cin >> h >> w;
vector<string> m(h);
for (int i = 0; i < h; ++i) {
cin >> m[i];
}
vector<vector<bool>> seen(h, vector<bool>(w, false));
long long ans = 0;
for (int i = 0; i < h; ++i)... | 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
string a,b,c;
cin >> n >> a >> b >> c;
int cnt=0;
rep(i,n){
char aa=a.at(i);
... | 0 |
#include<iostream>
using namespace std;
main(){
int K,X,s,e,max_x = 1000000, min_x = -1000000;
cin>>K>>X;
if(X-K+1>min_x) s = X-K+1;
else s = min_x;
if(X+K>max_x) e=max_x;
else e = X+K;
for(int i=s;i<e;i++){
cout<<i<<" ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string _... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define elif else if
typedef long long ll;
typedef unsigned long long ull;
#define DEBUG(x) cout << (x) << endl
#define TGET(a, b) get<b>(a)
#define MAXN 200100
ll arr[MAXN] = {0};
ll odd_pos[MAXN] = {0};
ll even_pos[MAXN] = {0};
ll dp[MAXN] = {0};
int main()
{
int ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
int before_min = arr[0];
int ret = 0;
for(int i=0; i<n; i++){
before_min = min(before_min,arr[i]);
if(before_min>=arr[i]) ret++;
}
cout<<ret;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod = int(1e9)+7;
using V = vector<ll>;
using P = pair<ll,ll>;
int main()
{
string s;cin >>s;
string ans="";
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll A,B;
cin>>A>>B;
ll ans=1;
for(ll i=2;i<=sqrt(min(A,B));i++) {
if(A%i==0&&B%i==0) {
ans++;
}
if(A%i==0) {
while(A%i==0) {
A/=i;
}
}
if(B%i==0) {
while(B%i==0) {
B/=i;
}
}
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
const long long inf = 1000000001; // const 書き換え禁止
const double PI = 3.14159265358979323846; //M_PI はライブラリ
int main(void){
int k,x;
cin >> k >> x;
int a = k-1;
for... | #include <stdio.h>
int main (){
char w1[101], w2[101];
scanf ("%s %s", &w1, &w2);
printf ("%s%s", w2, w1);
return 0;
} | 0 |
#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... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main()
{
string s;
se... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 105
#define INF 100000000
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a)<<endl
typedef pair<int,int> P;
const int MAX = 100005;
const in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> v = {2,5,5,4,5,6,3,7,6};
int n,m;
cin >> n >... | 1 |
#include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
int main(){
int n,m;
string S;
int dice[6];
for(int i=0;i<6;i++){
cin>>dice[i];
}
cin>>S;
for(int i=0;i<S.size();i++){
if(S[i]=='N'){
m=dice[0];
dice[0]=dice[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... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
#define LIMIT 1000000007 //10^9+7
#define rep(i, n) for(int i=0; i<(int)n; i++)
#define all(v) (v).begin(), (v).end()
namespace /* debug */{
#define DEBUG(...) do{cout<<#__VA_ARGS__<<" = ";debug(__VA_ARGS__);}while(0) //変数
#... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,ll>
con... | 0 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;typedef double db;
typedef pair<int, int> pii;typedef pair<ll, ll> pll;
typedef pair<int,ll> pil;typedef pair<ll,int> pli;
#define Fi first
#define Se second
#define _Out(a) cerr<<#a<<" = "<<(a)<<endl
const int INF = 0x3f3f3f3f, MAXN = 1e6 + 50;
const ll... | // g++ -std=c++11 test.cpp && ./a.out
// g++ -std=c++11 test.cpp && cat test.txt | ./a.out
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<unordered_map>
#include<queue>
#include<bitset>
#include<vector>
#... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int a[n+1];
int b[n+1];
int j=0;
a[0]=0;
b[0]=0;
int f=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]>=0)
{
j=i;
break;
}
else
a[i]*=(-1);
if(i==n)
{
j=n;
f=1;
}
}
b[1]=a[j];
int s=2;
for(int i=j+1... | #include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int n,k,x[maxn];
const int inf=0x3f3f3f3f;
long long a,b,now;
int topp,topn;
long long ans;
int main(){
cin>>n>>k;
ans=inf;
for(int i=1;i<=n;i++){
cin>>x[i];
}
for(int i=1;i+k-1<=n;i++){
a=min(abs(x[i]),abs(x[i+k-1]));
b=x[i+k-1]-x[i];
ans... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
S[3] = '8';
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define l long
#define pb push_back
#define mp make_pair
#define mt make_tuple
int main() {
// your code goes here
//ifstream cin("input.txt");
//ofstream cout("output.txt");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s; cin>... | 0 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(... | #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
int n,m;
string s[200],t[200];
cin >> n;
for(int i = 0; i < n; i++)
cin >> s[i];
cin >> m;
for(int i = 0; i < m; i++)
cin >> t[i];
int sum = 0;
for(int i = 0... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
int main() {
ll n;
cin >> n;
vector<string> s(3);
for(ll i=0;i<3;i++) {
cin >> s[i];
}
ll ans=0;
for(ll i=0;i<n;i++) {
set<char> ss;
for(ll j=0;j<3;j++) {
ss.insert(s[j][i]);
}
ans+=ss.si... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | 1 |
#include<stdio.h>
#include<map>
#include<algorithm>
using namespace std;
typedef pair<int,int> P;
P s[101];
int r[100];
int main(){
int n;
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)s[i]=P(0,i);
for(i=0;i<n*(n-1)/2;i++){
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
a--;b--;
if(c>d)s[a].first+=3;
if(c<d)s... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int teamn = 0;
cin >> teamn;
vector<int> point(teamn,0);
vector<int> run(teamn,0);
vector<int> plist;
vector<int> rank(teamn,1);
int fteam1,fteam2;
int point1,point2;
for(int n = 0;n<(teamn*(teamn-1))/2;n++){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N, x; cin >> N >> x;
ll ans = 0;
ll prev; cin >> prev;
for (int i = 1; i < N; i++){
ll num; cin >> num;
ll sum = prev + num;
if(sum<=x){
prev = num;
continue;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define inf 1000000100
int main()
{
ll n, x;
cin >> n >> x;
vector<long long> candy;
while(n--)
{
int a;
cin >> a;
candy.pb(a);
}
ll ans = 0;
for(int i = 1; i < c... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 998244353;
ll Ep(int x, int y){
if(y == 1) return x;
ll r = Ep(x,y/2);
if(y%2 == 1) return r *r%MOD *x%MOD;
else return r *r%MOD;
}
int main(){
int n, x;
cin >> n;
cin >> x;
if(x != 0){
cout << 0 << endl;
retur... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int N;
cin>>N;
long long D[100000],num[100000];
int judge=0;
for(int i=0;i<N;i++){
cin>>D[i];
num[i]=0;
}
if(D[0]==0){
sort(D,D+N);
for(int i=0;i<N;i++){
if(judge==D[i]) judge++;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
const ll MAX = 8;
string S[MAX];
ll x[8] = {1, 1,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
pii p[100005]... | 0 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using PI = pair<int, int>;
struct Dice {
Dice() {}
~Dice() {}
void get() {
for (int i = 0; i < 6; i++) {
cin >> d[i];
}
}
void roll(char c) {
int t = d[0];
switch (c) {
case 'N':
d[0] = d[1]; d[1] = d[5];... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s;
cin>>s;
int er=0;
int ans=s.size();
rep(i,s.size()){
if(s[i]=='S') er++;
if(s[i]=='T' && er!=0){
er--; ans-=2;
}
}
cout<<ans<<endl;
}
| 0 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
int solve() {
int a, b, c; scanf("%d%d%d", &a, &b, &c);
int h[10] = {};
++h[a]; ++h[... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
int p[n];
rep(i,n) cin >> p[i];
int min = 1e9;
int ans = 0;
for(int i = 0; i < n; i++){
if(p[i] <= min){
min = p[i];
ans++;
}
}
cout << ans << e... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define fi first
#define se second
#define pb push_back... | 0 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
long long mod = 1000000007;
int main() {
int n;
cin >> n;
long l... | 0 |
#include <iostream>
using namespace std;
int main()
{
int n, a, b, count = 0, pointX = 0, pointY = 0;
cin >> n;
do {
cin >> a >> b;
if (a > b) {
pointX += (a + b);
}
else if (a < b) {
pointY += (a + b);
}
else {
pointX += a;
pointY += b;
}
count++;
if (count == n) {
cout << pointX ... | #include <stdio.h>
int n, A[11234], B[11234];
int ans[2];
int main(void) {
while (true) {
ans[0] = ans[1] = 0;
scanf("%d", &n);
if (n == 0) { break; }
for (int i = 0; i < n; ++i) { scanf("%d%d", &A[i], &B[i]); }
for (int i = 0; i < n; ++i) {
if (A[i] > B[i]) { ans[0] += A[i] + B[i]; }
else if (A[i] ... | 1 |
//Radhe Radhe
#include<bits/stdc++.h>//157B
#define ll long long
#define fixed cout.setf(ios::fixed);
#define rep1 for( i=0; i<n; i++)
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll i,j,n;
cin>>n;
// ll a[n];
ll x,cnt=0,sum=0,mini=INT_MAX;
for(i=0; i<n; i++){
cin>... | #include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int N = 0, M = 0;
int points[1001];
int scores[1002001];
bool check(int a, int c){
if(a >= (N + 2) * (N + 1) / 2 - 1){
return true;
}
return (scores[a] <= c && scores[a + 1] > c);
}
int search2(int a, int b, int c){
... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define ... | #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>
... | 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... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
cin >> s;
array<vector<int>, 26> p;
for (int i = 0; i < s.size(); ++i) {
p[s[i] - 'a'].push_back(i);
}
int l = -1, r = -1;
for (int i = 0; i < p.size() && l < 0; ++i) {
for (int j = 1; j < p[i].siz... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
int main() {
int n, k;
while (cin >> n >> k, n + k) {
vector<int> card(n);
for (int i = 0; i < n; ++i) cin >> card[i];
sort(card.begin(), card.end());
set<int> cnt;
do {
int tmp = 0;
for (int i = 0; i < k... | #include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#defin... | 1 |
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int g[10];
memset(g, 0, sizeof(g));
for (int i = 0; i < n; i++) {
int x;
cin >> x;
g[x]++;
}
for (int i = 0; i < 10; i++) {
if (g[i] == 0) cout << '-' << endl;
else {
c... | #include<iostream>
#include<iomanip>
#include<algorithm>
#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<sstream>
#include<queue>
#include<ve... | 0 |
#include<bits/stdc++.h>
#define del(a,i) memset(a,i,sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l+r)>>1)
#define lowbit(x) (x&(-x))
#define INF 0x3f3f3f3f
using namespace std;
template<c... | #include<bits/stdc++.h>
#define int long long
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin(),a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a,b) memset(a,b,sizeof(a))
using namespa... | 1 |
#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 fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) <... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int p[11];
int c[11];
int main() {
int d, g;
cin >> d >> g;
for (int i = 0; i < d; i++)
cin >> p[i] >> c[i];
int ans = 1e9;
for (int i = 0; i < (1 << d); i++) {
int tmp = 0;
long sum = 0;
for (int j = 0; j < d; j++) {
if (i & (1 <... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long INF=1LL << 60;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> dan(35,0);
vector<int> dp(35,0);
int N;
for(int i=0;i<35;i++){
int tmp;
cin>>tmp;
if(tmp==0){
N=i;
bre... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb(in,tmp) in.push_back(tmp)
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
using namespace std;
int main(... | 1 |
#include <iostream>
using namespace std;
int main(){
int n;
while (cin >> n){
if(n==0)
break;
int x,y;
int a=0;
int b=0;
for(int i=0;i<n;i++){
cin >> x >> y;
if(x>y)
a+=x+y;
if(x<y)
b+=x+y;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
bool ac[100010]={};
ll wa[100010]={};
int main() {
ll n,k;
cin>>n>>k;
for(ll i=0;i<k;i++){
ll x;string s;
cin>>x>>s;x--;
if(s=="AC"){
ac[x]=true;
}
else{
if(ac[x]!=true){
wa[x]++;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | /**
* author: souzai32
* created: 12.08.2020 23:03:31
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int a=(n+1)/2,b=n/2;
vector<int> v(n),o(a),e(b);
rep(i,n) cin >> v.at(i);
rep(i,a) o.at(i)=v.at(2*i... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=200010;
const ll mo... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <set>
# include <map>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end() //sortなどの引数を省略したい
#define SIZE(x) ((ll)(x)... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b, c;
cin >> a >> b >> c;
char judge='a';
int numa=a.size();
int numb=b.size();
int numc=c.size();
bool fin=true;
while(fin){
if(judge=='a'){
if(numa==0){
fin=false;
}
if(numa>0){
judge=a.at(a.size()-numa);
numa--;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
queue<char>q[3];
void scan(int n)
{
char c;
while((c=getchar() )!='\n')
{
q[n].push(c);
}
}
int main()
{
fast;
scan(0);
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin>>s;
string ans;
for (char c: s)
if (c == 'S') ans += c;
else if (ans.size() && ans.back() =='S') ans.pop_back();
else ans += c;
cout<<ans.size()<<endl;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<"... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define dl long double
#define pb push_back
#define F first
#define S second
//#define endl "\n"
#define rep(i,a,b) for(i=a;i<b;i++)
#define all(v) v.begin(),v.en... | #include<stdio.h>
#include<stdlib.h>
#define ll long long
const int Inf=1e9+10;
ll jiu[19];
int gi(){
int sum=0,f=1;char ch=getchar();
while(ch>'9' || ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch<='9' && ch>='0'){sum=sum*10+ch-'0';ch=getchar();}
return sum*f;
}
int d;
ll ans;
ll sm[20];
void dfs(int i,int n... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0);
string s;
cin >> s;
if(s.length() == 2) {
if(s[0] == s[1]) cout << "1 2" << endl;
else cout ... | #include <bits/stdc++.h>
using namespace std;
#define data_type int
#define endl "\n"
int main()
{
//ios_base::sync_with_stdio(false);
//cin.tie(NULL);
data_type x1=-2,y1=-2,n;
bool check=0;
string str;
cin>>str;
n=str.size();
for(int i=0; i<n-1; i++)
{
if(str[i]==s... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
typedef long long ll;
vector<vector<char>> g(100,vector<char>(100));
int main(){
int a,b; cin >> a >> b;
rep... | #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<ll, ll>;
const ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
int main() {
int h, w;
cin >> h >> w;
vector<vector<int>> a(h, vector<int>(w)), ans;
... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve(void)
{
string ... | #include <stdio.h>
int main (){
int year, month, day;
scanf ("%d/%d/%d", &year, &month, &day);
year = 2018;
printf ("%d/%02d/%02d\n", year, month, day);
return 0;
} | 1 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | // A.
#include <stdio.h>
typedef long long LL;
char buffer[3072000];
LL cnt[20][20];
LL sum[20][20];
LL n;
LL ans;
int main(int argc, char* argv[]) {
char c, *bufptr = buffer;
fread(buffer, 1, 3072000, stdin);
while ((c = *bufptr++) >= '0') {
n = (n * 10) + (c - '0');
}
for (LL i = 0; i < n; ++i) {
LL x = ... | 0 |
#include <bits/stdc++.h>
// #include <atcoder/all>
#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 (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin()... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#define sc... | 1 |
//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
/*
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::number<mp:... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
int min,max=0;
cin>>a>>b>>c;
if(a<=b)
{
min = a;
max = b;
}
else
{
min = b;
max = a;
}
if(c>min && c<max)
cout<<"Yes"<<endl;
else
{
cout<<"No"<<endl;
}
return ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int pow;
int limit = N;
for (int i = 0; i < N; i++){
pow = 1;
for (int j = 0; j < i; j++){
pow *= 2;
}
if (K < pow){
limit = i;
break;
}
}
int total = 1;
for (... | #include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int n, k, score = 1;
cin >> n >> k;
for(int i = 0; i < n; i++)
if( score < k )
score += score;
else
score += k;
cout << score;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll a[3... | #include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
int main(){
int H,W,i,j,a;scanf("%d%d",&H,&W);
bool odd[H][W];
for(i=0;i<H;i++){
for(j=0;j<W;j++){
scanf("%d",&a);
odd[i][j] = a&1;
}
}
bool coin = false;... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
int main(){
for(int d; cin >> d; ){
int ans = 0;
for(int dd = d; dd <= 600 - d; dd += d)
ans += d * dd * d... | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int d, ans, n;
while(cin >> d){
ans = pow(d, 3);
n = 600 / d - 1;
ans *= n*(n+1)*(2*n+1) / 6;
cout << ans << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) (x).begin(), (x).end()
template <typename T> using ord_set = tree <T, null_type, less <T... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A(N+2, 0);
for(int i=1;i<=N;i++){
cin >> A[i];
}
int sum = 0;
for(int i=0;i<N+1;i++){
sum += abs(A[i+1] - A[i]);
}
for(int i=1;i<N+1;i++){
auto res = sum;
res -= a... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
int a,b,c;
cin>>a>>b>>c;
if((a<=c&&c<=b)||(b<=c&&c<=a)){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
| #include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
const string YES = "Yes";
const string NO = "No";
void solve(ll A, ll B, ll C) {
bool pred = (A-C) * (C-B) > 0;
cout << (pr... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 |
#include<bits/stdc++.h>
using namespace std ;
int main() {
int R ;
cin >> R ;
if(R >=2800){
cout << "AGC" << endl ;
}
else if(R >=1200 && R < 2800){
cout << "ARC" << endl ;
}
else {
cout << "ABC" << endl ;
}
} | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mi... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#define MOD 1000000007
typedef long long ll;
using namespace std;
vector<pair<int,int>> v[100010];
ll dist[100010];
const ll INF=1e10;
vector<set<int>> s(10001... | #include <bits/stdc++.h>
#include <atcoder/fenwicktree>
using namespace std;
int main(){
int n, q;
cin >> n >> q;
vector<int> A(n);
copy_n(istream_iterator<int>(cin), n, A.begin());
atcoder::fenwick_tree<int64_t> fw(n);
for (int i = 0; i < n; i++)
fw.add(i, A[i]);
for (int i = 0; i < q; i++){
i... | 0 |
#include <bits/stdc++.h>
#define rep(i,a,n) for (int i = (a); i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll n;
cin >> n;
string s;
while(n>0){
int r = n%26;
char c;
if(r>0) c = 'a' + r - 1;
else c = 'z';
s += c;
n /= 26;
if(r==0) n-... | #include <stdio.h>
#define LL long long
#define ULL unsigned long long
#define UI unsigned int
#define UC unsigned char
#define UL unsigned long
int main() {
LL llMax = 1000000000000001, llN;
scanf("%lld", &llN);
//a = 97
int iChar[20], iCnt = 0;
llN--;
while (iCnt < 20) {
iChar[iCnt++] = llN % 26;
if (llN ... | 1 |
// Created by conan1024hao in 2019.
// Copyright © 2019 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao QQ:810396815
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
set<ll> num;
ll t = 1;
while(t<ll(1e9)+5){
t*=2;
num.insert(t);
}
ll N;
cin >> N;
map<ll,ll> mp;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
mp[A[i]]++;
}
s... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
bool seen[10000][10000];
char S[10000][10000];
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
vector<pair<ll, ll>> prime_factorize(ll n) { //素因数分解と各素数の個数
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
long long X = 0;
long long preT = 0;
cin >> preT;
for (int i = 0; i < N - 1; ++i) {
int t; cin >> t;
if (preT + T < t) {
X += T;
}
else {
X += (t -... | 1 |
#if 0
2020.03.22
如果已知 A ，考虑 P 会长什么样。
对于一个 A[i] ，划分为若干极大的以左端点为最大值的区间，称为块。
一个显而易见的性质是一个块一定连续出现在 P 中。
进一步可以得到把所有块按左端点升序后拼接起来就能得到 P 。
那么问题就是统计有多少排列 P 能够被划分为若干块，这些块能够构成 A 。
首先块长不能超过 3 ，其次块长为 2 的块数不能超过块长为 1 的块数，
后者保证了这些块能够组成长为 3 的序列 A 。
接着考虑确定了 P 是由什么样的块构成的，统计 P 的方案数。
具体地，设 P 由 k 个块组成，第 i 个块的大小为 b[i] ，b 的前缀和为 s 。
那么满足这个分块... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n+2);
a[0] = 0;
a[n+2] = 0;
rep(i, n) cin >> a[i+1];
rep(i, n+1) sum += abs... | //include,using,define等
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deq... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef unsign... | #include <bits/stdc++.h>
#define cal(x,y) (x=x>y?x:y)
using namespace std;
const int N=350;
int gi(){
char ch=getchar(); int x=0,q=0;
while(ch<'0'||ch>'9') q=ch=='-'?1:q,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return q?-x:x;
}
int f[N][N][N],n,k;
char s[N];
int main(){
scan... | 1 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
const double pi = acos(-1);
pair <double, double> rotate(int x, int y, int degree, double d) {
double theta = (2 * pi / 360) * degree;
double x_ = x * cos (theta) - y * sin(theta);
double y_ = x * sin (theta) + y * cos(theta);
x_ *= d;
... | #include <stdio.h>
#include <string.h>
int main ()
{
int A, B;
scanf ("%d %d", &A, &B);
getchar ();
char S[A+B+2] = {};
scanf ("%s", &S);
int len = strlen(S);
int flag = 0;
for (int i = 0; i < len; i++)
{
if (48 <= S[i] && S[i] <= 57)
{
continue;
}
else if (48 > S[i] || S[i] > 57)
{
if ( i == A... | 1 |
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
using namespace std;
const int dx[] = {1,0,-1,0},dy[] = {0,1,0,-1};
#define INF 999999
#define rep(i,j) for(int i=... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <iostream>
using namespace std;
int main()
{
char* ara = "IVXLCDM";
int num[] = { 1, 5, 10, 50, 100, 500, 1000 };
char buf[101];
while (scanf("%... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | //#pragma GCC optimize(3)
#include<iostream>
#include<iomanip>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#define ll long long
#define db double
#def... | 0 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <numeric>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <deque>
#include <cmath>
#include <complex>
#include <cassert>
#include <cstring>
#include <functional>
#include <bitset>
#include <clim... | 0 |
#include<bits/stdc++.h>
using namespace std;
map<long long int,long long int> mp;
int main(){
int n;
long long int m;
cin >> n >> m;
long long int a[n];
long long int sum =0;
for(int i=0;i<n;i++){
cin >> a[i];
sum += a[i];
sum %= m;
mp[sum]++;
}
long long ... | #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) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | 1 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
vector<bool> v(26);
for (int i = 0; i < S.size(); i++) {
char ch = S.at(i);
int n = (int)ch - 97;
v.at(n) = 1;
}
string ans = "None";
for (int i = 0; i < 26... | #include <bits/stdc++.h>
using namespace std;
string t;
char ch;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>t;
sort(t.begin(),t.end());
if(t.size()==1&&t[0]=='a') {
cout << "None";
return 0;
}
set <char> s;
for(long long i=0;i<t.size();i++){
s.insert(t[i]);
}
for(ch... | 1 |
//#pragma GCC oplmize(2)
#include <bits/stdc++.h>
#define ll long long
#define sc(x) scanf("%lld",&x)
#define scs(x) scanf("%s",x+1)
#define pr(x) printf("%lld\n",x)
#define prs(x) printf("%s\n",x)
using namespace std;
const int maxn=1e7+5;
const int mod=998244353;
const double pi=acos(-1.0);
const double eps = 1e-8;
c... | #include <bits/stdc++.h>
using namespace std;
#define name ""
#define ini freopen(name".inp","r",stdin); freopen(name".out","w",stdout)
#define foe(it,c) for (__typeof(c.begin()) it = c.begin(); it != c.end(); it++)
#define long long long
#define db double
#define pii pair <int, int>
#define pll pair <long, long>
#d... | 1 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
using namespace std;
int n,d;
long long v[20],maxv[30];
long long qpow(int x,int y){
long long ans=1;
while(y){
if(y&1)ans*=x;
y>>=1,x*=x;
}
return ans;
}
long long dfs(long long x,int p){
if(p==n)return (x==... | #include <bits/stdc++.h>
using namespace std;
using ll=long long ;
int D;
int res = 0;
ll pw[19];
int digit[19];
void dfs(int high, int low, ll dif, ll way, bool carry) {
if (high < low) {
if (dif == D) res += way;
} else if(high == low) {
dfs(high-1, low+1, dif, way*10, 0);
} else {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
int val=1;
int cnt=0;
int ans[n+1]={0};
for(int i=n-1;i>=0;i--... | 1 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, v;
cin >> n;
vector<vector<int>> V(2, vector<int>(100001));
for (int i = 0; i != n; ++i) {
cin >> v;
++V[i % 2][v];
}
vector<vector<int>> I(2, vector<int>(100001));
for (auto i... | #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... | 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... | #define _GLIBCXX_DEBUG //エラーを出すためのおまじない
#include <bits/stdc++.h>
#include <algorithm>
//#include <cstdlib> // abs() for integer
#include <cmath> // abs() for float, and fabs()
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a,b,c,d;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cout << min(a,b)+min(c,d) <<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
int sum = 0;
for (int i = 0; i < 4; i++) {
cin >> a >> b >> c >> d;
}
sum += (a < b) ? a : b;
sum += (c < d) ? c : d;
cout << sum << endl;
return 0;
} | 1 |
typedef unsigned long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll m;
std::cin >> m;
ll dsum = 0;
ll sum = 0;
for (int i = 0; i < m; i++) {
ll d,c;
std::cin >> d>>c;
dsum += c;
sum += d*c;
}
std::cout << dsum-1+(sum-1)/9 << std:... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ls( s) (s&(-s))
#define ll long long
#define inf 0x3f3f3f3f
const ll N = 500030;
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin... | 0 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<tuple>
#include<map>
#include<bitset>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int N, M;
cin >> N;
vector<string> vec1(N);
for (int i=0; i<N; i++){
cin >> vec1.at(i);
}
cin >> M;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 0 |
#include <iostream>
#include <string>
using namespace std;
void process_command(istream &istr, string &str);
void my_print(const string &str, int a, int b);
void my_reverse(string &str, int a, int b);
void my_replace(string &str, int a, int b, string &p);
int main(){
string str;
cin >> str;
int q;
c... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a,b,c;
cin >> a >> b >> c;
int A, B, C;
A = a.size()-1;
B = b.size()-1;
C = c.size()-1;
if(a.at(A)==b.at(0)&& b.at(B)==c.at(0))
cout << "YES" <<endl;
else
cout <<"NO" <<endl;
} | #include <stdio.h>
int main(){
char arr[355];
scanf("%[^\n]", &arr);
int test = 1;
for(int i=0;arr[i]!='\0';i++){
if(arr[i]==' '&&arr[i-1]!=arr[i+1]){
test=0;
break;
}
}
if(test==1){
printf("YES\n");
}
else {
printf("NO\n");
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1e9+7;
const ll LINF = 1e18;
con... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
if(s.length() == 3) reverse(s.begin(),s.end());
cout << s << endl;
return 0;
} | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 0 |
#include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N;
cin >> N;
unsigned long ans{~0UL};
for(unsigned long i{0}, pa{~0UL}, a; i < N; ++i){
cin >> a;
if(pa + 1 < a)return 0 & puts("-1");
if(pa + 1 == a)++ans;
else ans += a;
pa = a;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 1 |
#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) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | #include <stdio.h>
#include <string.h>
int main() {
char a[15];
char b[15];
char c[15];
scanf("%s %s %s", a, b, c);
if(a[strlen(a)-1] == b[0] && b[strlen(b)-1] == c[0]){
printf("YES");
}
else{
printf("NO");
}
return 0;
} | 1 |
#include <stdio.h>
int main (){
char huruf1[249];
char huruf2[249];
scanf("%s %s", huruf1 , huruf2);
printf("%s%s", huruf2 , huruf1);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define Pi acos(-1)
#define _terminated return 0
#define endl "\n"
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define booster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef ve... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n, a[10000];
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
cout << *min_element( a, a + n) << " "
<< *max_element( a, a + n) << " "
<< accumulate( a, a + n, 0LL) << endl;
} | #include<iostream>
using namespace std;
int main(){
int n;
int ai, min, max;
long long sum = 0;
cin >> n;
min = 1000000;
max = -1000000;
while (n--){
cin >> ai;
sum += ai;
if (max < ai) max = ai;
if (min > ai) min = ai;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.