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(int a[],int left,int mid,int right,int temp[])
{
int i = left,j = mid + 1, cur = 0;
//cout << left << " "<< mid <<" "<< right << " " << n1 <<endl;
while(i <= mid && j <= right)
{
if(a[i] <= a[j]) {
temp[cur++] = a[i++];
} else{
temp[cur++] = a[j++];
num += mid - i + 1;
}
}
while(i <= mid) temp[cur++] = a[i++];
while(j <= right) temp[cur++] = a[j++];
for(int z = 0; z < cur; ++z)
{
a[left + z] = temp[z];
}
}
void MergeSort(int a[],int left,int right,int temp[])
{
if(left < right)
{
int mid = (right + left) / 2;
MergeSort(a, left, mid, temp);
MergeSort(a, mid+1, right, temp);
Merge(a,left,mid,right, temp);
}
}
int main()
{
scanf("%d",&n);
for(int i = 0; i < n; ++i)
scanf("%d",&a[i]);
int temp[maxn];
MergeSort(a, 0, n-1,temp);
printf("%lld\n", num);
return 0;
}
/*
5
3 5 2 1 4
6
3 5 2 6 1 4
*/ | #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);
ll n ;
cin>>n;
ll arr[n];
for(ll index = 0 ;index < n;index++)
{
cin>>arr[index];
if(arr[index]%2)
{
cout<<0<<endl;
return 0;
}
}
int ans =INT_MAX;
for(ll index =0;index <n;index++)
{
int div = 2;
int curr=0;
while(arr[index]%div==0)
{
curr++;
div*=2;
}
ans =min(ans,curr);
}
cout<<ans<<endl;
return 0;
}
| 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++){
inv[i]=mod-(mod/i)*inv[mod%i]%mod;
}
}
void factinv(){
int i;
fact_inv[0]=1;
for(i=1;i<=N;i++){
fact_inv[i]=fact_inv[i-1]*inv[i]%mod;
}
}
void facto(){
int i;
fact[0]=1;
for(i=1;i<=N;i++){
fact[i]=(fact[i-1]*i)%mod;
}
}
ll power(int a,int b){
if(b==0)
return 1;
else if(b==1)
return a;
else{
if(b&1)
return ((a%mod)*(power(a,b-1)%mod))%mod;
else
return ((power(a,b/2)%mod)*(power(a,b/2)%mod))%mod;
}
}
void solve(int p){
ll a=((fact_inv[n-p-1]%mod)*(fact_inv[p]%mod))%mod;
ll b=(m*power(m-1,n-p-1)%mod)%mod;
ll c=(a*b)%mod;
ans+=(fact[n-1]*c)%mod;
ans%=mod;
}
int main(void){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i;
cin>>n>>m>>k;
facto();
inverse();
factinv();
//cout<<inv[123]<<endl;
for(i=0;i<=k;i++)
solve(i);
cout<<ans<<endl;
}
| #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))&&(B.at(i) != C.at(i))){
cnt++;
continue;
}
if((A.at(i) == C.at(i))&&(B.at(i) != C.at(i))){
cnt++;
continue;
}
cnt++;
cnt++;
}
cout<<cnt<<endl;
return 0;
}
| 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<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string s, t;
cin >> N >> s >> t;
for(int l=N; l<=2*N; l++) {
string S(l, ' ');
rep(i, N) S[i] = s[i];
bool ok = true;
rep(i, N) if(S[l-N+i] != ' ' && S[l-N+i] != t[i]) ok = false;
if(ok) {
cout << l << "\n";
return 0;
}
}
return 0;
}
| #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<=len1;i++){
for(int j=1;j<=len2;j++){
if(s.substr(i,len1)==t.substr(0,j)&&len1+len2-j>=N){
count=min(len1+len2-j,count);
}
}
}
}
cout<<count;
}
return 0;
} | 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 <iterator>
#include <random>
#include <chrono>
#define forr(i,start,count) for (int i = (start); i < (start)+(count); ++i)
#define set_map_includes(set, elt) (set.find((elt)) != set.end())
#define readint(i) int i; cin >> i
#define readll(i) ll i; cin >> i
#define readdouble(i) double i; cin >> i
#define readstring(s) string s; cin >> s
typedef long long ll;
using namespace std;
ll modd = 1000*1000*1000+7;
int main() {
ios_base::sync_with_stdio(false);
cout.precision(17);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> rand_gen(0, 1000); // rand_gen(rng) gets the rand no
// auto start = chrono::steady_clock::now();
// readint(test_cases);
int test_cases = 1;
forr(t, 1, test_cases) {
readint(h); readint(w); readint(a); readint(b);
vector<string> grid(h, string(w, '0'));
forr(i,0,b) {
forr(j,0,a) {
grid[i][j] = '1';
}
}
for(int i = b; i < h; ++i) {
for(int j = a; j < w; ++j) {
grid[i][j] = '1';
}
}
for (auto s : grid) {
cout << s << endl;
}
}
// auto end = chrono::steady_clock::now();
// cout << chrono::duration_cast<chrono::milliseconds>(end - start).count() << endl;
return 0;
} | #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 {
cout << ((j < A) ? 1 : 0);
}
}
cout << endl;
}
}
| 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;
} else
x/=10;
}
}
i = i+1;
}
printf("\n");
return 0;
} | #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){
cout<<' '<<i;
break;
}
}
}
}
cout<<endl;
return 0;
} | 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;
while (cin >> a) nums.insert(a);
cout << ((nums.size() == 2) ? "Yes" : "No") << endl;
}
int main() {
setIO();
while (tt--) {
solve();
}
return 0;
} | 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];
} else {
if (res[i-2] == 'W') {
res += 'S';
} else {
res += 'W';
}
}
}
bool m = true;
if ((S[N-1] == 'o' && res[N-1] == 'S') || (S[N-1] == 'x' && res[N-1] == 'W')) {
if (res[N-2] != res[0]) {
m = false;
}
} else {
if (res[N-2] == res[0]) {
m = false;
}
}
if ((S[0] == 'o' && res[0] == 'S') || (S[0] == 'x' && res[0] == 'W')) {
if (res[N-1] != res[1]) {
m = false;
}
} else {
if (res[N-1] == res[1]) {
m = false;
}
}
if (m) return res;
else return "NG";
}
int main() {
cin >> N >> S;
string cand[4];
cand[0] = Mena("SS");
cand[1] = Mena("SW");
cand[2] = Mena("WS");
cand[3] = Mena("WW");
for (int i = 0; i < 4; i++) {
if (cand[i] != "NG") {
cout << cand[i] << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | #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;
if(a==1)nx+=1;
if(a==2)ny-=1;
if(a==3)nx-=1;
for(int j=0;j<N;++j){
if(x[j]==nx && y[j]==ny){
++cnt;
x[j]=-1;
y[j]=-1;
break;
}
}
}
}
int main(){
while(true){
int N,M,I;
cnt=0;
nx=10;
ny=10;
char d;
cin >> N;
if(!N)break;
for(int i=0;i<N;++i){
cin >> x[i] >> y[i];
}
cin >>M;
while(M--){
cin >> d >> I;
find(d,I,N);
}
if(cnt==N)cout << "Yes" <<endl;
else cout << "No" <<endl;
}
return 0;
} | 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;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair
template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }
class Plant{
public:
string name;
int d,m;
bool operator<(const Plant plant)const{
if(m*plant.d==plant.m*d){
return name<plant.name;
}else{
return m*plant.d>plant.m*d;
}
}
};
vector<Plant> plants;
int main() {
int n;
while(n=in()){
plants.clear();
string l;
int p,a,b,c,d,e,f,s,m;
int i;
for(i=0;i<n;i++){
cin>>l>>p>>a>>b>>c>>d>>e>>f>>s>>m;
Plant plant;
plant.name=l;
plant.d=a+b+c+(d+e)*m;
plant.m=f*s*m-p;
plants.push_back(plant);
}
sort(plants.begin(),plants.end());
for(i=0;i<n;i++){
cout<<plants[i].name<<endl;
//cout<<plants[i].d<<" "<<plants[i].m<<endl;
}
cout<<"#\n";
}
return 0;
} | #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++)
{
for (int j = i + 1; j <= n; j++)
{
ans = max(ans, ary[j] - ary[i]);
}
}
cout << ans << endl;
}
return 0;
} | 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 << "*";
}
cout << endl;
}
}
} | #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;l<a[k];l++)
{
printf("*");
}
printf("\n");
}
else printf("-\n");
}
}
return 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;
long ret=M*(V-1);
int okid=Mi;
for(int i=0;i<N;i++)
{
if(i==Mi)po[i]=-1;
else
{
if(A[i]<=dist)
{
po[i]=min(dist-A[i],M);
okid=i;
}
else po[i]=0;
ret-=po[i];
}
}
if(N-okid-1>=P)
{
Li=Mi;
continue;
}
if(ret<=0)
{
Ri=Mi;
continue;
}
int id=N-1;
for(int i=0;i<P-1;i++)
{
if(id==Mi)id--;
if(id<0)break;
ret-=M-po[id];
id--;
}
if(ret<=0)
{
Ri=Mi;
}
else Li=Mi;
}
cout<<N-Ri<<endl;
}
| #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 = getchar();}
return x * f;
}
const int N = 5100;
int n,tot; ll a[N][N];
int vis[N * 20],pri[N];
void init()
{
vis[1] = 1;
for(int i = 2;i <= 10000;i ++)
{
if(!vis[i]) pri[++ tot] = i;
for(int j = 1;j <= tot && pri[j] * i <= 10000;j ++)
{
vis[i * pri[j]] = 1;
if(i % pri[j] == 0) break;
}
}
}
ll gcd(ll x,ll y){return y ? gcd(y,x % y) : x;}
ll lcm(ll x,ll y){if(!x || !y) return x | y; return x / gcd(x,y) * y;}
int main()
{
n = read(); init();
if(n == 2) {puts("4 7\n23 10"); return 0;}
for(int i = 1;i <= n;i ++)
for(int j = (i + 1 & 1) + 1;j <= n;j += 2)
a[i][j] = pri[(i + j) / 2] * pri[n + (i - j) / 2 + (n + 1) / 2];
for(int i = 1;i <= n;i ++)
for(int j = (i & 1) + 1;j <= n;j += 2)
a[i][j] = lcm(lcm(a[i - 1][j],a[i][j - 1]),lcm(a[i][j + 1],a[i + 1][j])) + 1;
for(int i = 1;i <= n;i ++,cout << "\n") for(int j = 1;j <= n;j ++) cout << a[i][j] << " ";
return 0;
}
| 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 pb push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
cout << max({a + b, a - b, a * b}) << endl;
} | #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(x) return(cout << x , 0);
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ms(x , y) memset(x , y , sizeof x);
#define file_init freopen("input.txt", "r+", stdin); freopen("output.txt", "w+", stdout);
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}
ll a , b;
int main(){
migmig
ll ans = 1e18;
cin >> a >> b;
if(a <= b)ans = min(ans , b-a);
if(-a <= b)ans = min(ans ,b+a+1);
if(-a <= -b)ans = min(ans ,a-b+2);
if(a <= -b)ans = min(ans , -b-a+1);
cout << ans;
return(0);
} | 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 long i = 0; i < n - 1; i++) {
ans += std::min(intervals[i], t);
}
ans += t;
std::cout << ans << "\n";
return 0;
} | 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];
int l,r;
for(int i=0;i<q;i++) {
cin>>l>>r;
cout<<s[r]-s[l]<<endl;
}
}
| #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]++;
}
else
{
ac[p - 1] = 1;
}
}
int AC = 0;
int WA = 0;
for (int i = 0; i < n; i++)
{
AC += ac[i];
if (ac[i])
{
WA += wa[i];
}
}
cout << AC << " " << WA << endl;
}
| 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 ) student[b[i]] = 2;
}
for(int i=0; i<m; i++) {
if( student[a[i]] == 2 && student[b[i]] != 2 ) {
student[b[i]] = 1;
}
else if( student[b[i]] == 2 && student[a[i]] != 2 ) {
student[a[i]] = 1;
}
}
int ans = 0;
for(int i=2; i<=n; i++) {
if( student[i] > 0 ) ans++;
}
cout << ans << endl;
}
} | #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--; Vec[i].MTo--;
}
for(int i = 0; i < m; ++i)
{
Edge e = Vec[i];
Vertex[e.MFrom].push_back(e.MTo);
Vertex[e.MTo].push_back(e.MFrom);
}
set<int> Set;
for(int i = 0; i < Vertex[0].size(); ++i)
{
int To = Vertex[0][i];
Set.insert(To);
for(int j = 0; j < Vertex[To].size(); ++j)
{
Set.insert(Vertex[To][j]);
}
}
Set.count(0) ? cout << Set.size() - 1 : cout << Set.size();
cout << endl;
}
}
int main()
{
solve();
return(0);
} | 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");
}
else if (pm + pe + pj >= 240){
printf("A\n");
}
else if (pm + pe + pj >= 210){
printf("B\n");
}
else if (pm + pe + pj >= 150 && (pm >= 80 || pe >= 80)){
printf("B\n");
}
else{
printf("C\n");
}
}
}
return 0;
} | #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 'C';
}
int main() {
int n;
while (cin >> n, n) {
while (n--) {
int pm, pe, pj;
cin >> pm >> pe >> pj;
cout << divide(pm, pe, pj) << endl;
}
}
return 0;
} | 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 = 998244353;
ll INF = 1000000007;
#define PI 3.14159265
std::map<int, int> factorization (int n) {
std::map<int, int> f;
for (int i = 2; i*i <= n; i++) {
while (n%i == 0) {
f[i] += 1;
n /= i;
}
}
if (n > 1) {
f[n] += 1;
}
return f;
}
ll modpow (int x, int n) {
if (n==0) return 1%mod;
ll u = modpow(x, n/2);
u = (u*u)%mod;
if (n%2==1) u = (u*x)%mod;
return u;
}
void dfs(vector<int> A, int n, int m) {
if (A.size() > n) {
for (int i = 1; i <= n; i++) {
std::cout << A[i];
}
std::cout << std::endl;
return;
}
A.push_back(A.back());
while (A.back() <= m) {
dfs(A, n, m);
A.back()++;
}
}
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i=2; i<MAX; i++) {
fac[i] = fac[i-1] * i % mod;
inv[i] = mod - inv[mod%i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll COM(int n, int k) {
if(n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n-k] % mod) % mod;
}
ll HCOM(int n, int k) {
return (n == 0 && k == 0) ? 1 : COM(n+k-1, k);
}
int main() {
ll n;
std::cin >> n;
std::vector<string> s;
priority_queue<pair<ll, ll> > pos_q;
priority_queue<pair<ll, ll> > neg_q;
ll final_balance = 0;
for (int i = 0; i < n; i++) {
std::string t;
std::cin >> t;
s.push_back(t);
ll balance = 0;
ll min_prefix = 0;
for (int j = 0; j < t.size(); j++) {
if (t[j] == '(') {
balance++;
}
else {
balance--;
}
min_prefix = min(min_prefix, balance);
}
final_balance += balance;
if (balance != 0 || min_prefix != 0) {
if (balance >= 0) {
pos_q.push(make_pair(min_prefix, balance));
}
else {
neg_q.push(make_pair(min_prefix - balance, -balance)); // reverse sequence
}
}
}
bool check_pos = true;
int b_pos = 0;
while (!pos_q.empty()) {
pair<int, int> pos = pos_q.top();
pos_q.pop();
int prefix = b_pos + pos.first;
if (prefix < 0) { check_pos = false; break; }
b_pos += pos.second;
}
bool check_neg = true;
int b_neg = 0;
while (!neg_q.empty()) {
pair<int, int> neg = neg_q.top();
neg_q.pop();
int prefix = b_neg + neg.first;
if (prefix < 0) { check_neg = false; break; }
b_neg += neg.second;
}
if (final_balance == 0 && check_neg && check_pos) {
std::cout << "Yes" << std::endl;
}
else {
std::cout << "No" << std::endl;
}
// std::cout << " balance: " << final_balance << " prefix: " << final_prefix << std::endl;
return 0;
} | //! 尺卂乃卂.卂ﾌ乇乇ㄒ
#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,int>,int>
#define mic map<char,int>
#define all(v) v.begin(),v.end()
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define itr(v) for(auto it:v)
#define show(arr,n) for(int i=0;i<n;i++) cout<<arr[i]<<" "; cout<<"\n";
#define fi(i,n) for(int i=0;i<n;i++)
#define fd(i,n) for(int i=n-1;i>=0;i--)
#define fir(i,a,b) for(int i=a;i<b;i++)
#define fin(s) freopen(s,"r",stdin);
#define fout(s) freopen(s,"w",stdout);
#define MAXZ 200005
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int expo(int a,int b,int m){
if(b==0) return 1;
if(b==1) return a;
int val=(expo(a,b/2,m)*expo(a,b/2,m))%m;
if(b & 1) return (val*a)%m;
else return val;
}
int mmi(int a,int m){
return expo(a,m-2,m);
}
bool cmp(pii a,pii b){
int c1=a.first-a.second;
int c2=b.first-b.second;
if(c1*c2>=0){
if(c1>=0 && c2>=0){
return a.second<b.second;
}
else{
return a.first>b.first;
}
}
else{
if(c1>0){
return 1;
}
else{
return 0;
}
}
}
string a[2000001];
int32_t main()
{
FIO
int n; cin>>n;
fi(i,n) cin>>a[i];
vector<pii> v;
int uop=0,ucp=0;
fi(i,n) {
int op=0,cp=0;
int count=0;
for(int j=0;j<a[i].length();j++){
if(a[i][j]=='('){
count++;
}
else{
if(count<=0) {
cp++;
}
else count--;
}
}
op+=count;
pii p1(op,cp);
if(op==0 || cp==0){
uop+=op;
ucp+=cp;
}
else v.pb(p1);
// cout<<a[i]<<" "<<op<<" "<<cp<<"\n";
}
sort(v.begin(),v.end(),cmp);
int ans=1;
int op=uop;
for(int i=0;i<v.size();i++){
// cout<<v[i].first<<" "<<v[i].second<<"\n";
op=op-v[i].second;
if(op<0) {
ans=0;
break;
}
op+=v[i].first;
}
op-=ucp;
if(op==0 && ans){
cout<<"Yes\n";
}
else cout<<"No\n";
} | 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) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(N)), day(N, vector<int>(N));
vector<int> index(N);
rep(i, N) {
rep(j, N - 1) {
cin >> A[i][j];
}
}
int maxloop = (N * (N - 1)) / 2;
int before = 0;
for (int l = 0; l < maxloop; l++) {
for (int i = 0; i < N; i++) {
if (index[i] < N - 1) {
int to = A[i][index[i]];
if (i + 1 == A[to - 1][index[to - 1]]) {
int value = max(day[i][index[i]], day[to - 1][index[to - 1]]);
// cout << i + 1 << " " << to << " " << value + 1 << endl;
day[i][index[i] + 1] = value + 1;
day[to - 1][index[to - 1] + 1] = value + 1;
index[i]++; index[to - 1]++;
}
}
}
int res = 0;
for (int i = 0; i < N; i++) {
res += index[i];
}
if (res == before || res == (N - 1) * N) break;
before = res;
}
int sum = 0;
rep(i, N) sum += index[i];
int cnt = 0;
rep(i, N) {
chmax(cnt, day[i][N - 1]);
}
if (sum == (N - 1) * N) {
cout << cnt << endl;
}
else {
cout << -1 << endl;
}
return 0;
} | #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){if(a < b){a=b; return true;} return false;}
template<typename T> bool chmin(T &a,const T b){if(a > b){a=b; return true;} return false;}
int main(){
/*
int n; cin >> n;
vi x(n), y(n);
for(int i=0; i<n; i++){
cin >> x[i] >> y[i];
}
*/
int n; cin >> n;
vector<queue<int>> com(n);
for(int i=0; i<n; i++){
for(int j=0; j<n-1; j++){
int a; cin >> a;
a--;
com[i].push(a);
}
}
set<int> prev;
for(int i=0; i<n; i++) prev.insert(i);
int ans=0;
while(!prev.empty()){
set<int> tmp;
bool flag=false;
for(auto p: prev){
if(com[p].empty()) continue;
int op=com[p].front();
flag=true;
if(com[op].front() == p){
tmp.insert(p);
tmp.insert(op);
}
}
for(auto p: tmp){
com[p].pop();
}
if(tmp.empty()){
if(flag) ans=-1;
break;
}
ans++;
prev=tmp;
}
cout << ans << endl;
return 0;
} | 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.begin(), dp.end(), dp[split]/2);
auto itr2 = lower_bound(dp.begin(), dp.end(), (dp[n]+dp[split])/2);
for(int d=-1;d<2;d++){
if(max(p,q-p)>max(*(itr1+d),q-*(itr1+d))){
p=*(itr1+d);
}
if(max(r-q,s-r)>max(*(itr2+d)-q,s-*(itr2+d))){
r=*(itr2+d);
}
}
ll diff=max({s-r,r-q,q-p,p})-min({s-r,r-q,q-p,p});
ans=min(ans,diff);
}
cout << ans << endl;
}
| #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=1000001000;
ll INF=1e18+5;
int find_(int x,vector<pair<ll,ll>> &v){
if(v[x].first<0) return x;
v[x].first=find_(v[x].first,v);
return v[x].first;
}
int same_(int a,int b,vector<pair<ll,ll>> &v){
if(find_(a,v)==find_(b,v)) return 1;
return 0;
}
void union_(int a,int b,vector<pair<ll,ll>> &v){
if(same_(a,b,v)) return;
int a_p=find_(a,v),b_p=find_(b,v);
if(a_p>b_p) swap(a_p,b_p);
v[a_p].first+=v[b_p].first;
v[a_p].second+=v[b_p].second;
v[b_p].first=a_p;
}
/*
void print_v(vector<pp> v){
rep(i,v.size()) cout<<v[i]<<" ";
cout<<endl;
}
int size_(int a,vector<pp> &v){
return -v[find_(a,v)];
}
*/
int main() {
int h,w; cin>>h>>w;
vector<string> s(h,"");
rep(i,h) cin>>s[i];
vector<pair<ll,ll>> v(h*w,mk(-1,0));
rep(i,h*w){
if(s[i/w][i%w]=='#') v[i].second=-1;
}
rep(i,(h-1)*w) if(s[i/w][i%w]!=s[i/w+1][i%w]) union_(i,i+w,v);
rep(i,h*w){
if(i%w==w-1) continue;
if(s[i/w][i%w]!=s[i/w][i%w+1]) union_(i,i+1,v);
}
ll ans=0;
rep(i,h*w){
if(v[i].first<0)
ans+=(-v[i].second)*(v[i].second-v[i].first);
}
cout<<ans<<endl;
} | #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) {
for (int j = 0; j < w; j++) {
long long b_cnt, w_cnt;
b_cnt = w_cnt = 0;
stack<array<int, 3>> st;
st.push({i, j, m[i][j] != '#'});
while (!st.empty()) {
auto t = st.top();
int y = t[0], x = t[1], p = t[2];
st.pop();
if (y < 0 || y >= h || x < 0 || x >= w) {
continue;
}
if (seen[y][x] || p == m[y][x]) {
continue;
}
seen[y][x] = true;
if (m[y][x] == '.') {
w_cnt++;
} else {
b_cnt++;
}
st.push({y - 1, x, m[y][x]});
st.push({y + 1, x, m[y][x]});
st.push({y, x + 1, m[y][x]});
st.push({y, x - 1, m[y][x]});
}
ans += b_cnt * w_cnt;
}
}
cout << ans << '\n';
}
| 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 long LL;
int main() {
int N; cin >> N;
vector<int> c(N + 1, 0);
c[0] = 3;
LL v = 1;
int index = 0;
for (int i = 0; i < N; ++i) {
int x; cin >> x;
LL y = c[x];
v = (v * y) % kMod;
--c[x];
++c[x+1];
#if 0
index = max(index, x + 1);
cout << x << ":";
for (int i = 0; i <=index; ++i) cout << c[i] << " ";
cout << "->" << y << endl;
#endif
}
cout << v << endl;
}
| #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);
char bb=b.at(i);
char cc=c.at(i);
if(aa!=bb && aa!=cc && bb!=cc)cnt+=2;
else if(aa==bb && aa!=cc)cnt++;
else if(aa==cc && aa!=bb)cnt++;
else if(bb==cc && bb!=aa)cnt++;
}
cout << cnt << endl;
} | 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 __VA_ARGS__; in(__VA_ARGS__)
#define int long long
const long long inf=1e18;
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef vector<pair<long, long > > vpll;
typedef vector<pair<int, int > > vpii;
#define FORR(x,arr) for(auto& x:arr)
#define ZERO(a) memset(a,0,sizeof(a))
//3111111111111111111111111111111
bool isprime(int x){
for(int i = 2;i*i<=x;i++){
if(x%i == 0)return false;
}
return x!=1;
}
void solve(){
ini(n);
vi morty;
int i = 1;
while(morty.size()!=55){
i++;
int tmp = i*5+1;
while(!isprime(tmp)){
i++;
tmp = i*5+1;
}
morty.push_back(tmp);
}
FOR(i,0,n){
cout<<morty[i]<<" ";
}
out();
}
int32_t main() {
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
solve();
return 0;
}
| 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 n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
scanf("%lld", arr + i);
}
for (int i = 1; i <= n; i += 2)
{
if (i == 1)
{
odd_pos[i] = arr[i];
even_pos[i + 1] = arr[i + 1];
}
else
{
odd_pos[i] = arr[i] + odd_pos[i - 2];
even_pos[i + 1] = arr[i + 1] + even_pos[i - 1];
}
}
// ll ans = even_pos[n-1];
// for (int i = 1; i <= n; i += 2)
// {
// ans = max(ans, odd_pos[n] - arr[i]);
// ans = max(ans, (odd_pos[i] - arr[i]) + (even_pos[n - 1] - even_pos[i - 1]));
// ans = max(ans, (odd_pos[i] - arr[i]) + arr[i + 1] + (odd_pos[n] - odd_pos[i + 2]));
// }
// printf("%ld\n", ans);
for (int i = 2; i <= n; i++)
{
if (i % 2)
{
dp[i] = max(dp[i - 2] + arr[i], dp[i - 1]);
}
else
{
dp[i] = max(odd_pos[i - 1], dp[i - 2] + arr[i]);
}
}
printf("%lld\n", dp[n]);
return 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 REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,0,n)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
vector<vector<vector<ll>>>
dp(N+1, vector<vector<ll>>(2, vector<ll>(3, -longinf))); // index, select(1) or not(0), not select count
dp[0][0][0] = 0;
rep(i, N) {
rep(k, 3) { // select
dp[i+1][1][k] = max(dp[i][0][k]+A[i], dp[i+1][1][k]);
}
if(i) { // not select
rep(k, 3) { // selected previous index
dp[i+1][0][k] = max(dp[i][1][k], dp[i+1][0][k]);
}
rep(k, 2) { // not selected previous index
dp[i+1][0][k+1] = max(dp[i][0][k], dp[i+1][0][k+1]);
}
} else {
dp[i+1][0][1] = 0;
}
}
ll ans = -longinf;
if(N%2) ans = max(dp[N][1][2], dp[N][0][1]);
else ans = max(dp[N][1][1], dp[N][0][0]);
cout << ans << endl;
return 0;
}
| 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="";
int w;cin >>w;
for(int i=0;i<(int)s.size();i+=w){
ans+=s[i];
}
cout <<ans << endl;
return 0;
}
| 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;
}
}
}
if(A>1&&B>1) {
if(A%B==0||B%A==0) {
ans++;
}
}
cout<<ans<<endl;
}
| #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 &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; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1) res.push_back({N, 1});
return res;
}
int main() {
ll A,B;
cin >>A>>B;
const auto &res = prime_factorize(gcd(A,B));
cout<<res.size()+1<<endl;
return 0;
} | 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(int i=x-a;i<=x+k-1;i++){
cout << i;
cout << " ";
}
cout << endl;
} | #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;
}
}
cout << az[i];
}
| #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;
set<int> m2;
vector<int> result;
cin>>s;
for(int i = 0; i < s.length(); i++){
int num = s[i] - 'a';
if(m2.count(num) == 0) m2.insert(num);
}
for(int i = 0; i < 26; i++){
if( m2.count(i) == 0) result.push_back(i);
}
if( result.size() == 0){
cout<<"None"<<endl;
}else{
cout<<(char)(result[0] + 'a')<<endl;
}
return 0;
}
| 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 int MOD = 1000000007;
void changeString(string &t,string p){
if(t=="0") t=p;
else if(t.size()<p.size()) t=p;
else if(t.size()==p.size()){
if(t<p) t=p;
}
}
string dp[MAX];
int main(){
int n,m;
cin>>n>>m;
vector<int>a(m);
sort(ALL(a));
REP(i,m)IN(a[i]);
int num[10]={0,2,5,5,4,5,6,3,7,6};
REP(i,MAX){
dp[i]="0";
}
dp[0]="";
REP(i,n+1){
if(dp[i]=="0")continue;
REP(j,m){
changeString(dp[i+num[a[j]]],dp[i]+(char)(a[j]+'0'));
}
}
OUT(dp[n]);
return 0;
} | #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 >> m;
int use = 0;
rep(i,m){
int a;
cin >> a;--a;
use |= (1<<a);
}
// cout << bitset<9>(use) << endl;
vector<int> dp(n+1,-INT_MAX/5);
dp[0] = 0;
rep(i,n+1){
for(int j=8;j>=0;j--){
if((1<<j) & use) {
int nidx = i + v[j];
if(nidx<=n){
dp[nidx] = max(dp[nidx],dp[i]+1);
// cout << "i ni dpni " << i << " " << nidx << " " << dp[nidx] << endl;
}
}
}
}
int cidx = n;
while(cidx!=0){
for(int j=8;j>=0;j--){
if((1<<j) & use) {
int nidx = cidx - v[j];
if(nidx>=0 && dp[nidx] +1 == dp[cidx]){
cidx=nidx;
cout << j+1;
break;
}
}
}
}
cout << endl;
// cout << dp[n] << endl;
return 0;
}
| 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];
dice[1]=dice[5];
dice[5]=dice[4];
dice[4]=m;
}
else if(S[i]=='S'){
m=dice[0];
dice[0]=dice[4];
dice[4]=dice[5];
dice[5]=dice[1];
dice[1]=m;
}
else if(S[i]=='W'){
m=dice[0];
dice[0]=dice[2];
dice[2]=dice[5];
dice[5]=dice[3];
dice[3]=m;
}
else if(S[i]=='E'){
m=dice[0];
dice[0]=dice[3];
dice[3]=dice[5];
dice[5]=dice[2];
dice[2]=m;
}
m=0;
}
cout<<dice[0]<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//(a+b-1)/b
signed main(){
int n; cin>>n;
string a,b,c; cin>>a>>b>>c;
int ans=0;
rep(i,0,n){
if(a[i]!=b[i] && b[i]!=c[i] && a[i]!=c[i])ans+=2;
else if(a[i]==b[i] && b[i]==c[i] && a[i]==c[i])ans=ans;
else ans++;
}
cout<<ans<<endl;
return 0;
} | 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) //変数
#define ldebug(...) do{cout<<"["<<setw(3)<<__LINE__<<"] ";debug(__VA_ARGS__);}while(0) //行数
#define lDEBUG(...) do{cout<<"["<<setw(3)<<__LINE__<<"] "<<#__VA_ARGS__<<" = ";debug(__VA_ARGS__);}while(0) //変数, 行数
template<class T>void show(T&x){cout<<x<<" ";} //出力
template<class T>void showendl(T&x){cout<<x<<endl;} //出力改行
template<class P,class Q>void show(pair<P,Q>&x){cout<<"("<<x.first<<", "<<x.second<<") ";} //pair出力
template<class P,class Q>void showendl(pair<P,Q>&x){cout<<"("<<x.first<<", "<<x.second<<")"<<endl;} //pair出力改行
template<class H>void debug(H&&h){showendl(h);} //引数1つ
template<class H,class...Ts>void debug(H&&h,Ts&&...ts){show(h);debug(forward<Ts>(ts)...);} //可変引数
template<class T>void debug(vector<T>&vt){int i=0;for(auto x:vt)++i!=vt.size()?show(x):showendl(x);} //vector出力
template<class T>void debug(initializer_list<T>init){int i=0;for(auto x:init)++i!=init.size()?show(x):showendl(x);} //初期化子リスト出力
}
int main(){
ll N;cin>>N;
vi z(5);
rep(i,5)cin>>z[i];
ll neck = distance(z.begin(), min_element(all(z)));
//DEBUG(neck);
ll ans = 0;
ans += 4;
ans += (N+z[neck]-1)/z[neck];
cout<<ans<<endl;
} | #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>
const ll MOD=998244353;
const int INF=1e9;
const double PI=acos(-1);
int main() {
ios_base::sync_with_stdio(false);
vector<int> a(3);
int k;
rep(i,3) cin >> a[i];
cin >> k;
sort(a.begin(),a.end(),greater<>());
rep(i,k) a[0]*=2;
cout << a[0]+a[1]+a[2] << endl;
return 0;
}
| 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 int INF = 1<<30;
const ll mod = 1000000007LL;
int main() {
string S;
cin>>S;
reverse(S.begin(),S.end());
int l = S.size();
int ans = 0;
int over = 0;
for(int i = 0; i < l; i++){
int t = S[i]-'0';
t+=over;
over = 0;
if(t>=10) {
t-=10;
over = 1;
}
if(t<=4) ans += t;
if(t==5){
int s;
if(i!=l-1) s = S[i+1]-'0';
if(i==l-1||s<=4) ans+=t;
else if(s>=5) {
ans+=(10-t);
over=1;
}
}
if(t>=6) {
ans += (10-t);
over = 1;
}
if(i==l-1&&over!=0) ans+=over;
}
cout<<ans<<endl;
} | #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>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b) return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
struct UnionFind {
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
vector<int> tpsort(vector<vector<int>>& G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0) que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point
{
double x;
double y;
};
struct LineSegment
{
Point start;
Point end;
};
double tenkyori(const LineSegment& line, const Point& point)
{
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
int main() {
string s;
cin >> s;
ll ans = 0;
ll nans = 100000;
for (int i = 0; i < s.size(); i++) {
ll u = (ll)(s[i] - '0');
ll as = ans;
ll ns = nans;
ans =min(as+u,ns+u+1);
nans = min(as+10-u,ns+9-u);
}
cout << min(ans,nans+1) << endl;
} | 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 LINF = 0x3f3f3f3f3f3f3f3f, MOD = 998244353;
const db Pi = acos(-1), EPS = 1e-6;
void test(){cerr << "\n";}template<typename T,typename...Args>void test(T x,Args...args){cerr<<x<<" ";test(args...);}
inline ll qpow(ll a, ll b){return b?((b&1)?a*qpow(a*a%MOD,b>>1)%MOD:qpow(a*a%MOD,b>>1))%MOD:1;}
inline ll qpow(ll a, ll b,ll c){return b?((b&1)?a*qpow(a*a%c,b>>1,c)%c:qpow(a*a%c,b>>1,c)) %c:1;}
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline ll cede(ll a,ll b){if(b<0)return cede(-a,-b);if(a<0)return a/b;return (a+b-1)/b;}
inline ll flde(ll a,ll b){if(b<0)return flde(-a,-b);if(a<0)return (a-b+1)/b;return a/b;}
inline int sign(db x){return x<-EPS ? -1:x>EPS;}
inline int dbcmp(db l,db r){return sign(l - r);}
namespace Fast_IO{ //orz laofu
const int MAXL((1 << 18) + 1);int iof, iotp;
char ioif[MAXL], *ioiS, *ioiT, ioof[MAXL],*iooS=ioof,*iooT=ioof+MAXL-1,ioc,iost[55];
char Getchar(){
if (ioiS == ioiT){
ioiS=ioif;ioiT=ioiS+fread(ioif,1,MAXL,stdin);return (ioiS == ioiT ? EOF : *ioiS++);
}else return (*ioiS++);
}
void Write(){fwrite(ioof,1,iooS-ioof,stdout);iooS=ioof;}
void Putchar(char x){*iooS++ = x;if (iooS == iooT)Write();}
inline int read(){
int x=0;for(iof=1,ioc=Getchar();(ioc<'0'||ioc>'9')&&ioc!=EOF;)iof=ioc=='-'?-1:1,ioc=Getchar();
if(ioc==EOF)Write(),exit(0);
for(x=0;ioc<='9'&&ioc>='0';ioc=Getchar())x=(x<<3)+(x<<1)+(ioc^48);return x*iof;
}
inline long long read_ll(){
long long x=0;for(iof=1,ioc=Getchar();(ioc<'0'||ioc>'9')&&ioc!=EOF;)iof=ioc=='-'?-1:1,ioc=Getchar();
if(ioc==EOF)Write(),exit(0);
for(x=0;ioc<='9'&&ioc>='0';ioc=Getchar())x=(x<<3)+(x<<1)+(ioc^48);return x*iof;
}
void Getstr(char *s, int &l){
for(ioc=Getchar();ioc==' '||ioc=='\n'||ioc=='\t';)ioc=Getchar();
if(ioc==EOF)Write(),exit(0);
for(l=0;!(ioc==' '||ioc=='\n'||ioc=='\t'||ioc==EOF);ioc=Getchar())s[l++]=ioc;s[l] = 0;
}
template <class Int>void Print(Int x, char ch = '\0'){
if(!x)Putchar('0');if(x<0)Putchar('-'),x=-x;while(x)iost[++iotp]=x%10+'0',x/=10;
while(iotp)Putchar(iost[iotp--]);if (ch)Putchar(ch);
}
void Putstr(const char *s){for(int i=0,n=strlen(s);i<n;++i)Putchar(s[i]);}
} // namespace Fast_IO
using namespace Fast_IO;
vector<int>pos[MAXN];
pii cnt[MAXN];
int ccnt[MAXN];
int ans[MAXN];
bool cmp(pii l,pii r){return l.first>r.first;}
void work()
{
int n=read();
for(int i=1;i<=n;i++)
{
int x=read();
pos[x].push_back(i);
cnt[x].first++;
cnt[i].second=i;
}
for(int i=1;i<=n;i++)
{
int x=read();
cnt[x].first++;
ccnt[x]++;
}
int nowat=1;
sort(cnt+1,cnt+1+n,cmp);
srand(time(0));
if(cnt[1].first>n)
{
printf("No\n");return ;
}
random_shuffle(cnt+1,cnt+1+n);
int zcnt=0;
for(int i=1;i<=n;i++)
{
int QAQ=cnt[i].second;
if(cnt[nowat].second==QAQ)nowat++;
if(nowat>n)nowat=1;
while(ccnt[QAQ])
{
while(pos[cnt[nowat].second].size()==0||cnt[nowat].second==QAQ)
{
nowat++;if(nowat>n)nowat=1;
}
ans[pos[cnt[nowat].second].back()]=QAQ;
pos[cnt[nowat].second].pop_back();
ccnt[QAQ]--;
}
}
printf("Yes\n");
for(int i=1;i<=n;i++)printf("%d ",ans[i]);
}
int main()
{
//std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//int T=read();for(int cas=1;cas<=T;cas++)
//int T;scanf("%d",&T);for(int i=1;i<=T;i++)
work();
// Write();
}
/**
1 1
4 0 1
4 0 1000000
*/ | // 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>
#include<limits.h>
#include<assert.h>
using namespace std;
#define INF (1<<29)
#define SZ(X) ((int)(X).size())
#define PRINT(A) {for (auto it=A.begin(); it != A.end(); ++it) {cout << *it << ' ';} cout << endl;}
#define SUM(A) accumulate(A.begin(), A.end(), 0)
#define MAX(A) *max_element(A.begin(), A.end())
#define BIT_LENGTH(N) floor(log2(N)) + 1
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define RREP(I, N) for (int I = N-1; I >= 0 ; --I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RREPP(I, A, B) for (int I = A; I > (B); --I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
typedef vector<int> VI;
typedef map<int, int> MII;
typedef set<int> SI;
typedef vector<string> VS;
typedef vector<vector<int> > VVI;
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
const double PI = acos(-1);
const int MAX_SIZE = 2*1e5+1;
VI A_indexes[MAX_SIZE];
int main() {
int N;
_R(N);
// cout << N << endl;
VI C(N+1, 0);
VI A;
REP(i, N) {
int a;
_R(a);
A.push_back(a);
C[a] += 1;
}
VI B;
REP(i, N) {
int b;
_R(b);
B.push_back(b);
C[b] += 1;
}
REP(i, N+1) {
if (C[i] > N) {
puts("No");
return 0;
}
}
reverse(B.begin(), B.end());
int swap_index = 0;
REP(i, N) {
if (A[i] == B[i]) {
while (A[i] == A[swap_index] || B[i] == B[swap_index]) {
swap_index += 1;
}
swap(B[swap_index], B[i]);
swap_index += 1;
}
}
puts("Yes");
PRINT(B);
return 0;
} | 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;i<=n;i++)
{
cin>>b[s];
s++;
}
s--;
if(f==0)
j--;
long long t=9999999999;
sort(a+1,a+1+j);
for(int i=max(0,k-s);i<=min(k,j);i++)
{
int p=0;
p+=a[i];
p+=b[k-i];
p+=min(a[i],b[k-i]);
if(p<t)
{
t=p;
}
}
cout<<t;
} | #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=min(ans,a+b);
}
cout<<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>>s;
int len=s.length();
map <char,int> mp;
map <char,int> pp;
int st=-1,en=-1;
for(int i=0;i<len;i++)
{
mp[s[i]]++;
if(mp[s[i]]==1) pp[s[i]]=i;
else
{
if( i-pp[s[i]] <= 2 )
{
st=pp[s[i]]+1; en=i+1;
break;
}
pp[s[i]]=i;
}
}
cout<<st<<' '<<en;
return 0;
}
| 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(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;
using namespace std;
int main(int argc, char* argv[])
{
int n;
scanf("%d", &n);
vector<int> a(n);
int i;
long double sum=0;
for(i=0; i<n; i++) {
scanf("%d", &a[i]);
sum+=a[i];
}
const long double eps=1e-12;
long double min=HUGE_VAL;
int mini=0;
sum/=n;
for(i=0; i<n; i++) {
double tmp=fabs(a[i]-sum);
if(tmp<min-eps) {
min=tmp;
mini=i;
}
}
printf("%d\n", mini);
return 0;
}
| #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; i < n; i++) {
int cnt = 1;
for(int j = i+1; j < n; j++)
if(s[i] == s[j]) cnt++;
for(int j = 0; j < m; j++)
if(s[i] == t[j]) cnt--;
sum = max(sum, cnt);
}
cout << sum << endl;
} | 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.size()-1;
}
cout << ans << endl;
} | #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;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
template<class T> void view(T e) {cout << e << endl;}
template<class T> void view(const vector<T> &v) {for(const auto &e : v){cout << e << " ";} cout << endl;}
template<class T> void view(const vector<vector<T>> &vv) {for(const auto &v : vv){view(v);}}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 1e5;
int main() {
int n; cin >> n;
string a, b, c; cin >> a >> b >> c;
int ans = 0;
rep(i,n) {
set<char> st;
for (string s : vector<string>{a,b,c}) {
st.insert(s[i]);
}
if (st.size() == 2) ans += 1;
if (st.size() == 3) ans += 2;
}
cout << ans << endl;
} | 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[b].first+=3;
if(c==d){
s[a].first+=1;
s[b].first+=1;
}
}
s[n]=P(-1,-1);
sort(s,s+n);
reverse(s,s+n);
int p=0;
int pr=0;
while(p<n){
r[s[p].second]=pr;
while(s[p].first==s[p+1].first){
p++;
r[s[p].second]=pr;
}
p++;
pr=p;
}
for(i=0;i<n;i++)printf("%d\n",r[i]+1);
return 0;
} | #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++){
cin >> fteam1 >> fteam2;
cin >> point1 >> point2;
fteam1 -= 1;
fteam2 -= 1;
if(point1 > point2){
point[fteam1] += 3;
}else
if(point1 == point2){
point[fteam1] += 1;
point[fteam2] += 1;
}else
if(point1 < point2){
point[fteam2] += 3;
}
}
for(int g = 0;g<point.size();g++){
run[g] = point[g];
}
sort(run.begin(),run.end(),greater<int>());
//for(int n = 0;n<run.size();n++){
// if(run[n] != run[n+1]){
// plist.push_back(run[n]);
// }
//}
for(int n = 0;n<run.size();n++){
for(int g = 0;g<point.size();g++){
if(n == 0 && run[n] == point[g]){
rank[g] = n;
}
if(run[n] == point[g] && n != 0){
if(run[n] != run[n-1]){
rank[g] = n;
}
}
}
}
for(int n = 0;n<rank.size();n++){
cout << rank[n]+1 << endl;
}
return 0;
} | 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;
}
ans += sum-x;
if(sum-x > num) num = 0;
else num = num - (sum - x);
prev = num;
}
cout << ans << endl;
}
| #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 < candy.size(); i++)
{
if(i == 1)
{
if(candy[i-1] > x)
{
ans += candy[i-1] - x;
candy[i-1] = x;
}
}
if(candy[i-1] + candy[i] > x)
{
ans += candy[i-1] + candy[i] - x;
candy[i] -= candy[i-1] + candy[i] - x;
}
}
cout << ans << endl;
return 0;
} | 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;
return 0;
}
map<int, int> mp;
for(int i=1; i<n; ++i){
cin >> x;
if(x == 0){
cout << 0 << endl;
return 0;
}
++mp[x];
}
ll ans = 1;
for(auto p: mp){
if(p.first == 1) continue;
ans *= Ep(mp[p.first-1], p.second);
ans %= MOD;
}
cout << ans << endl;
} | #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++;
num[D[i]]++;
}
if(judge!=D[N-1]+1||num[0]>1) cout<<0<<endl;
else{
long long answer=1;
for(int i=1;i<judge;i++){
for(int j=0;j<num[i];j++) answer=(answer*num[i-1])%998244353;
}
cout<<answer<<endl;
}
}
else cout<<0<<endl;
return 0;
} | 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, 1, 0, -1, -1, -1, 0};
ll y[8] = {1, 0, -1, -1, -1, 0, 1, 1};
bool dfs() {
vector<vector<bool>> U(MAX, vector<bool>(MAX, true));
ll cnt = 0;
REP(h, MAX) {
REP(w, MAX) {
if (S[h][w] == '.')
continue;
cnt++;
REP(i, 8) {
ll mul = 0;
while (true) {
ll nx = x[i] * mul + h, ny = y[i] * mul + w;
if (nx < 0 || ny < 0 || nx >= MAX || ny >= MAX)
break;
U[nx][ny] = false;
mul++;
}
}
}
}
if (cnt == 8) {
REP(h, MAX) {
cout << S[h] << endl;
}
return true;
}
REP(h, MAX) {
REP(w, MAX) {
if (!U[h][w])
continue;
S[h][w] = 'Q';
if (dfs())
return true;
S[h][w] = '.';
}
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
REP(i, MAX) {
string s = "";
REP(j, MAX) {
s.push_back('.');
}
S[i] = s;
}
ll N;
cin >> N;
REP(i, N) {
pll p;
cin >> p.first >> p.second;
S[p.first][p.second] = 'Q';
}
dfs();
return 0;
}
| #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];
int x[100005], y[100005];
int r[100005];
int root(int a){
return r[a] == a?a:(r[a]=root(r[a]));
}
void merge(int a, int b){
a = root(a), b = root(b);
if(a != b) r[a] = b;
}
int main(){
int n;
scanf("%d", &n);
for(int i=1;i<=n;i++){
scanf("%d%d", &x[i], &y[i]);
p[i] = pii(x[i], i);
r[i] = i;
}
sort(p+1, p+1+n);
vector<pipii> edges;
for(int i=2;i<=n;i++) edges.eb(pipii(p[i].fi-p[i-1].fi, pii(p[i].se, p[i-1].se)));
sort(all(edges));
for(int i=1;i<=n;i++) p[i] = pii(y[i], i);
sort(p+1, p+1+n);
for(int i=2;i<=n;i++) edges.eb(pipii(p[i].fi-p[i-1].fi, pii(p[i].se, p[i-1].se)));
sort(all(edges));
int ans = 0;
for(int i=0;i<sz(edges);i++){
if(root(edges[i].se.fi) != root(edges[i].se.se)){
merge(edges[i].se.fi, edges[i].se.se);
ans += edges[i].fi;
}
}
printf("%d\n", ans);
} | 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]; d[5] = d[4]; d[4] = t;
break;
case 'S':
d[0] = d[4]; d[4] = d[5]; d[5] = d[1]; d[1] = t;
break;
case 'W':
d[0] = d[2]; d[2] = d[5]; d[5] = d[3]; d[3] = t;
break;
case 'E':
d[0] = d[3]; d[3] = d[5]; d[5] = d[2]; d[2] = t;
break;
default:
break;
}
}
int top() { return d[0]; }
int d[6];
};
int main() {
Dice d;
d.get();
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
d.roll(s[i]);
}
cout << d.top() << endl;
return 0;
}
| #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>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define res(i,n) for(int i=n;;i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define REV(i,n) for(int i=n-1;i>0;i--)
#define req(i,n,m) for(int i=n;i<m;i++)
#define REQ(i,n,m,l) for(int i=n;i<m;i+=l)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
signed gcd(long long x, long long y) {
if (y == 0)return x;
return gcd(y, x % y);
}
signed lcm(long long x, long long y) {
return x / gcd(x, y) * y;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
int N; cin >> N;
string s, t; cin >> s >> t;
rev(i, N+1) {
rep(j, i) {
if (s.at(N - i + j) != t.at(j))break;
if (j == i-1) {
cout << N *2-i << endl;
return 0;
}
}
}
cout << N * 2 << endl;
} | #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[b]; ++h[c];
for (int i = 1; i < 10; ++i) if (h[i] == 2) return !printf("Yes");
return !printf("No");
}
int main() {
init();
int t = 1; //scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| 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 << endl;
} |
#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
#define int long long
#define ll long long
#define ld long double
#define pii pair<ll,ll>
#define read(t) ll t;cin>>t;
#define all(x) x.begin(),x.end()
#define f(a,b,c) for(ll a=b;a<c;a++)
#define For(i,n) for(ll i=0;i<n;i++)
#define what(x) cerr << #x << " is " << x << endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) ;
typedef tree<pair<ll,ll>, null_type,less<pair<ll,ll>>, rb_tree_tag,tree_order_statistics_node_update> omultiset;
typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> oset;
typedef tree<long long,null_type,greater<long long>,rb_tree_tag,tree_order_statistics_node_update> oset1;
/*.....................................................................................................................*/
const ll mod=(ll)1e9+ 7;
ll add(ll x,ll y) {return (x+y)%mod;}
ll mult(ll x, ll y){return ((x%mod )* (y%mod)) % mod;}
long long binpow(long long x, long long p)
{
if (p == 0) {return 1;}
if (p == 2 || (p & 1)) {return mult(x, binpow(x, p - 1));}
return binpow(binpow(x, p / 2), 2);
}
ll modinv(ll a) {return binpow(a,mod-2);}
//A.erase(unique(A.begin(),A.end()),A.end());
double pi=3.141592653589793238462641;
ll dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};
const ll man = (int)2e6+2 , inf = 1e18;
/*......................................................................................................................*/
signed main()
{
fast;
int n,ans=0;
cin>>n;
vector<long double>a(n);
for(int i=0;i<n;i++)cin>>a[i];
map<pair<int,int>,int>cnt;
for(int i=0;i<n;i++)
{
long double y=a[i];
y*=1000000000;
ll x=round(y);
pair<int,int>p;
while(x%2==0)
{
x/=2;
p.first++;
}
while(x%5==0)
{
x/=5;
p.second++;
}
cnt[p]++;
}
for(auto x:cnt)
{
for(auto y:cnt)
{
if((x.first.first+y.first.first>=18))
{
if(x.first.second+y.first.second>=18)
{
if(x<y)
{
ans+=(x.second*y.second);
}
else if(x==y)
{
ans+=(x.second*(x.second-1))/2;
}
}
}
}
}
cout<<ans<<endl;
} | 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)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
x=0;int f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
x*=f;
}
inline void judge(){
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
}
/*******************************head*******************************/
const int maxn=1000005;
const int mod=998244353;
int fac[maxn],facinv[maxn];
inline int powmod(int a,int b){
int res=1;for(;b;b>>=1){
if(b&1)res=1ll*res*a%mod;a=1ll*a*a%mod;
}return res;
}
inline int C(int n,int m){
if(n<0||m<0||n<m)return 0;
return 1ll*fac[n]*facinv[m]%mod*facinv[n-m]%mod;
}
inline void prprpr(){
fac[0]=1;
rep(i,1,1000000)fac[i]=1ll*fac[i-1]*i%mod;
facinv[1000000]=powmod(fac[1000000],mod-2);
per(i,999999,0)facinv[i]=1ll*facinv[i+1]*(i+1)%mod;
}
int n,m;
int main(){
read(n);read(m);prprpr();
if(n<m)swap(n,m);//cout<<facinv[1000000]<<endl;
int ans=n;//cout<<C(2,1)<<endl;
int d=powmod(C(n+m,n),mod-2);
rep(i,1,m){
ans=(ans+1ll*C(2*i-1,i)*C(n+m-2*i,n-i)%mod*d%mod)%mod;
}
cout<<ans<<endl;
return 0;
}
| #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 long a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
long long sum = 0;
long long acc = 0;
for (int i = 0; i < n; ++i) {
sum = (sum + (a[i] * acc)) % mod;
/* acc += (a[i] % mod); */
acc = (acc + a[i]) % mod;
}
cout << sum % mod << "\n";
return 0;
}
| 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 << " " << pointY << endl;
pointX = pointY = count = 0;
cin >> n;
}
} while (n != 0);
return 0;
} | #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] < B[i]) { ans[1] += A[i] + B[i]; }
else { ans[0] += A[i], ans[1] += B[i]; }
}
printf("%d %d\n", ans[0], ans[1]);
}
return 0;
} | 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>>x;
if(x<0) cnt++;
mini=min(mini,abs(x));
sum+=abs(x);
}
if(cnt%2)
sum-=(2*mini);
cout<<sum<<endl;
return 0;
}
| #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){
int pib = a + b - b / 2;
if(check(pib, c)){
return pib;
}else if(scores[pib] < c){
return search2(pib, b / 2, c);
}else{
return search2(a, b / 2, c);
}
}
int main(){
for(;;){
for(int i = 0; i < 1001; i++){
points[i] = 0;
}
for(int i = 0; i < 1002001; i++){
scores[i] = 0;
}
if(cin >> N){
if(N == 0){
break;
}
cin >> M;
for(int i = 1; i <= N; i++){
cin >> points[i];
}
for(int i = 0; i <= N; i++){
for(int j = i; j <= N; j++){
scores[(2 * N - i + 1) * i / 2 + j] = points[i] + points[j];
}
}
int mxsco = 0;
sort(scores, scores + ((N + 2) * (N + 1)) / 2);
for(int i = 0; i < (N + 2) * (N + 1) / 2; i++){
if(scores[i] > M){
break;
}
int nosco = scores[i] + scores[search2(0, (N + 2) * (N + 1) / 2, M - scores[i])];
if(nosco >= mxsco && nosco <= M){
mxsco = nosco;
}
}
cout << mxsco << endl;
}else{
break;
}
}
return 0;
} | 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 REP(i,n) for(int i=0; i<(int)(n); i++)
#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define IN(x,s,g) ((x) >= (s) && (x) < (g))
#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))
#define print(x) printf("%d\n",x)
using namespace std;
typedef unsigned int uint;
typedef long long ll;
const int _dx[] = {0,1,0,-1};
const int _dy[] = {-1,0,1,0};
int getInt(){
int ret = 0,c;
c = getchar();
while(!isdigit(c)) c = getchar();
while(isdigit(c)){
ret *= 10;
ret += c - '0';
c = getchar();
}
return ret;
}
int main(){
int n, m;
while((n = getInt()) + (m = getInt())){
vector<int> v(n);
int ans = 0;
REP(i,n) v[i] = getInt();
sort(v.rbegin(), v.rend());
REP(i,n) if(i % m != (m - 1))
ans += v[i];
print(ans);
}
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }
int main()
{
int n, m;
while(cin >> n >> m && n)
{
vint p(n);
rep(i, n)
cin >> p[i];
sort(ALL(p));
int res = accumulate(ALL(p), 0);
rep(i, n)
res -= ((i + 1) % m== 0) * p[n - i - 1];
cout << res << endl;
}
} | 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>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)
#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
template<class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> p) {
os << p.first << ":" << p.second;
return os;
}
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
REP(i, SZ(v)) {
if (i) os << ", ";
os << v[i];
}
return os << "]";
}
// edit
int N;
vector<ll> A;
vector<vector<ll>> dp;
vector<vector<bool>> vis;
ll dfs(int n, int c) {
if (vis[n][c]) return dp[n][c];
if (n == 0) {
if (c <= 1) {
return 0;
} else {
return -LINF;
}
}
if (n == 1) {
if (c == 0) {
return A[0];
} else if (c <= 2) {
return 0;
} else {
return -LINF;
}
}
vis[n][c] = true;
ll &ret = dp[n][c];
ret = dfs(n - 2, c) + A[n - 1];
if (c >= 1) {
chmax(ret, dfs(n - 1, c - 1));
}
return ret;
}
void solve() {
cin >> N;
A.resize(N);
REP(i, N) cin >> A[i];
dp.resize(N + 1, vector<ll>(3));
vis.resize(N + 1, vector<bool>(3));
ll ans = dfs(N, 1 + (N + 0) % 2);
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
solve();
return 0;
}
| #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].size() && l < 0; ++j) {
if (p[i][j] - p[i][j - 1] <= 2) {
l = p[i][j - 1] + 1;
r = p[i][j] + 1;
}
}
}
cout << l << ' ' << r << '\n';
return 0;
} | 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; ++i)
tmp = tmp * (card[i] >= 10 ? 100 : 10) + card[i];
cnt.insert(tmp);
} while (next_permutation(card.begin(), card.end()));
cout << cnt.size() << endl;
}
return 0;
}
| #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;
#define REP(i,s,e) for(int i=int(s);i<=int(e);i++)
#define rep(i,n) for(int i=0;i<int(n);i++)
int f(int n){
if(n==0) return 1;
else return 10*f(n-1);
}
int main(){
int n,k;
while(1){
cin >> n >> k;
if(n==0 && k==0) break;
vector<int>card(n);
rep(i,n) cin >> card[i];
if(k==2){
vector<int>u;
rep(i,n){
rep(j,n){
if(i!=j){
vector<int>v;
if(card[i]/10!=0) v.push_back(card[i]/10);
v.push_back(card[i]%10);
if(card[j]/10!=0) v.push_back(card[j]/10);
v.push_back(card[j]%10);
int s=v.size(); int p=0;
rep(i,s) p+=v[i]*f(s-1-i);
u.push_back(p);
v.clear();
}
}
}
sort(u.begin(),u.end());
vector<int>::iterator it=unique(u.begin(),u.end());
u.erase(it,u.end());
cout << u.size() << endl;
u.clear();
}
if(k==3){
vector<int>u;
rep(i,n){
rep(j,n){
rep(k,n){
if(i!=j && i!=k && j!=k){
vector<int>v;
if(card[i]/10!=0) v.push_back(card[i]/10);
v.push_back(card[i]%10);
if(card[j]/10!=0) v.push_back(card[j]/10);
v.push_back(card[j]%10);
if(card[k]/10!=0) v.push_back(card[k]/10);
v.push_back(card[k]%10);
int s=v.size(); int p=0;
rep(i,s) p+=v[i]*f(s-1-i);
u.push_back(p);
v.clear();
}
}
}
}
sort(u.begin(),u.end());
vector<int>::iterator it=unique(u.begin(),u.end());
u.erase(it,u.end());
cout << u.size() << endl;
u.clear();
}
if(k==4){
vector<int>u;
rep(i,n){
rep(j,n){
rep(k,n){
rep(l,n){
if(i!=j && i!=k && i!=l && j!=k && j!=l && k!=l){
vector<int>v;
if(card[i]/10!=0) v.push_back(card[i]/10);
v.push_back(card[i]%10);
if(card[j]/10!=0) v.push_back(card[j]/10);
v.push_back(card[j]%10);
if(card[k]/10!=0) v.push_back(card[k]/10);
v.push_back(card[k]%10);
if(card[l]/10!=0) v.push_back(card[l]/10);
v.push_back(card[l]%10);
int s=v.size(); int p=0;
rep(i,s) p+=v[i]*f(s-1-i);
u.push_back(p);
v.clear();
}
}
}
}
}
sort(u.begin(),u.end());
vector<int>::iterator it=unique(u.begin(),u.end());
u.erase(it,u.end());
cout << u.size() << endl;
u.clear();
}
}
return 0;
} | 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 {
cout << string(g[i], '*') << endl;
}
}
}
return 0;
} | #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<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<double, string> pds;
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
bool cmp(pds a, pds b) {
return (a.first == b.first) ? (a.second < b.second) : (a.first > b.first);
}
int main() {
for (int N; cin >> N&&N;) {
vector<pds> p;
for (int i = 0; i < N; i++) {
string L; int P, A, B, C, D, E, F, S, M;
cin >> L >> P >> A >> B >> C >> D >> E >> F >> S >> M;
int Q = (S*F)*M;
double cp = (double)(Q - P) / (A + B + C + (D + E)*M);
p.push_back(pds(cp, L));
}
sort(p.begin(), p.end(), cmp);
for (int i = 0; i < p.size(); i++) {
cout << p[i].second /*<< " " << p[i].first*/ << endl;
}
cout << "#" << endl;
}
return 0;
} | 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<class T>il read(T &x){
int f=1;char k=getchar();x=0;
for(;k>'9'||k<'0';k=getchar()) if(k=='-') f=-1;
for(;k>='0'&&k<='9';k=getchar()) x=x*10+k-'0';
x*=f;
}
template<class T>il _print(T x){
if(x>=10) _print(x/10);
putchar(x%10+'0');
}
template<class T>il print(T x){
if(x<0) putchar('-'),x=-x;
_print(x);
}
ll mul(ll a,ll b,ll mod){long double c=1.;return (a*b-(ll)(c*a*b/mod)*mod)%mod;}
it qpow(int x,int k,int mod){
int res=1,bas=x;
while(k){
if(k&1) res=1ll*res*bas%mod;
bas=1ll*bas*bas%mod,k>>=1;
}
return res;
}
const int N = 2e5+5,mod = 1e9+7;
it add(int x,int y){return x+y>=mod?x+y-mod:x+y;}
it mul(int x,int y){return 1ll*x*y%mod;}
il inc(int &x,int y){x=add(x,y);}
int n,m,k,ans,fac[N],ifac[N];
it C(int n,int m){return mul(mul(ifac[n-m],ifac[m]),fac[n]);}
int main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
read(n),read(m),read(k),fac[0]=1;
for(ri i=1;i<=n*m;++i) fac[i]=mul(fac[i-1],i);
ifac[n*m]=qpow(fac[n*m],mod-2,mod);
for(ri i=n*m-1;i>=0;--i) ifac[i]=mul(ifac[i+1],i+1);
for(ri i=1;i<=n-1;++i) inc(ans,mul(mul(mul(m,m),n-i),i));
for(ri i=1;i<=m-1;++i) inc(ans,mul(mul(mul(n,n),m-i),i));
print(mul(ans,C(n*m-2,k-2)));
return 0;
} | #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 namespace std;
int mod=1e9+7;
int inv[200005],finv[200005],f[200005];
void C(){
f[0]=1;finv[0]=1;finv[1]=1;f[1]=1;inv[1]=1;
FOR(i,2,200000){
f[i]=f[i-1]*i%mod;
inv[i]=mod-inv[mod%i]*(mod/i)%mod;
finv[i]=finv[i-1]*inv[i]%mod;
}
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m,k;
cin>>n>>m>>k;
C();
int sum,ans=0,t=n*m;
FOR(i,1,n){
FOR(j,1,m){
sum=0;
int t1=i-1,t2=j-1;
sum=sum+t1*(t1+1)/2%mod*m+t2*(t2+1)/2%mod*n;sum=sum%mod;
t1=n-t1-1;t2=m-t2-1;
sum=sum+t1*(t1+1)/2%mod*m+t2*(t2+1)/2%mod*n;sum=sum%mod;
sum=sum*inv[t-1]%mod*f[t-1]%mod*finv[t-k]%mod*finv[k-2]%mod;
ans=(ans+sum)%mod;
}
}
cout<<ans*inv[2]%mod;
RE 0;
}
| 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) << "\n"
#define ENDL cout << "\n"
#define DF(x) x.erase(x.begin()) // 先頭文字削除
#define ALL(x) x.begin(), x.end()
#define SZ(x) (ll) x.size()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define MAX(x, y, z) max(x, max(y, z))
#define MIN(x, y, z) min(x, min(y, z))
#define ANS cout << ans << "\n"
#define RETURN(x) \
cout << x << "\n"; \
return 0
clock_t CLOCK;
#define START_TIMER CLOCK = clock()
#define SHOW_TIMER cerr << "time: " << (ld)(clock() - CLOCK) / 1000000 << "\n"
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define LINE cerr << "[debug] line: " << __LINE__ << "\n";
#define debug(x) cerr << "[debug] " << #x << ": " << x << "\n";
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << "\n";
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using mll = map<ll, ll>;
using qll = queue<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
signed main() {
init();
ll D, G;
cin >> D >> G;
G /= 100;
ll max_p = 300000;
vll dp(max_p, INF);
dp[0] = 0;
rep(i, D + 1) {
if (i == 0) continue;
ll p, c;
cin >> p >> c;
c /= 100;
vll next = dp;
rep(j, p + 1) {
if (p == 0) continue;
rep(k, max_p) {
ll ni = k + i * j;
if (ni >= max_p) continue;
if (j == p) ni += c;
next[ni] = min(next[ni], dp[k] + j);
}
}
dp = next;
}
ll ans = INF;
rep2(i, G, max_p) {
ans = min(ans, dp[i]);
}
ANS;
return 0;
} | #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 << j)) {
tmp += p[j];
sum += 100 * (j + 1) * p[j] + c[j];
}
}
for (int j = d - 1; j >= 0 && sum < g; j--) {
if (!(i & (1 << j))) {
for (int l = 1; l <= p[j] && sum < g; l++) {
tmp++;
sum += 100 * (j + 1);
}
}
}
ans = min(ans, tmp);
}
cout << ans << endl;
} | 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;
break;
}
dan[i]=tmp;
}
dp[0]=1;
for(int i=1;i<31;i++){
dp[i]+=dp[i-1];
if(i>1)dp[i]+=dp[i-2];
if(i>2)dp[i]+=dp[i-3];
}
for(int i=0;i<N;i++){
int tmp=dp[dan[i]]/3650;
if(dp[dan[i]]%3650!=0) tmp++;
cout << tmp <<endl;
}
return 0;
}
| #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(){
int a[31]={1,1,2};
int n;
loop(i,3,31)a[i]=a[i-1]+a[i-2]+a[i-3];
while(cin>>n,n)cout<<(a[n]-1)/365/10+1<<endl;
} | 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;
if(x==y){
a+=x;
b+=y;
}
}
cout << a << " " << b << endl;
}
} | #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]++;
}
}
}
ll cnt1=0;
ll cnt2=0;
for(ll i=0;i<n;i++){
if(ac[i]){
cnt1++;
cnt2+=wa[i];
}
}
cout << cnt1<<" "<<cnt2;
// your code goes here
return 0;
} | 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 string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep(i,n) for (int i = 0; i < n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define per1(i,n) for (int i = n; i >= 1; --i)
#define all(c) begin(c),end(c)
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; } return 0; }
template<typename T> inline T intceil(T a, T b) { return (a + (b - 1)) / b; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
// if(nextY >= 0 && nextY < H && nextX >= 0 && nextX < W)
static const long double pi = acos(-1.0);
typedef complex<ld> cd;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m,v,p; cin >> n >> m >> v >> p;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
// debug(a);
int lo = -1, hi = n - 1;
while(hi - lo > 1) {
int mid = (lo + hi) / 2;
vector<ll> b;
rep(i, n) {
if(i != mid) {
b.push_back(a[i]);
}
}
reverse(all(b));
ll base = a[mid] + m;
ll ok = 0;
bool ng = 0;
rep(i, b.size()) {
if(i < p - 1) ok += m;
else if(base >= b[i]) ok += min(m, base - b[i]);
else ng = 1;
}
// debug(mid, base, ok, b);
if(ng || ok < (m * (v - 1))) {
lo = mid;
} else {
hi = mid;
}
}
cout << n - hi << endl;
}
| /**
* 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);
rep(i,b) e.at(i)=v.at(2*i+1);
// rep(i,a) cout << o.at(i) << endl;
// rep(i,b) cout << e.at(i) << endl;
sort(o.begin(),o.end());
sort(e.begin(),e.end());
int count=1;
int on,en,co1=0,co2=0,ce1=0,ce2=0;
rep(i,a){
if(i==0) continue;
else if(o.at(i)==o.at(i-1)) count++;
else if(o.at(i)!=o.at(i-1)){
if(count>=co1){
co2=co1;
co1=count;
on=o.at(i-1);
}
else if(count>=co2){
co2=count;
}
count=1;
}
if(i==a-1){
if(count>=co1){
co2=co1;
co1=count;
on=o.at(i);
}
else if(count>=co2){
co2=count;
}
count=1;
}
}
rep(i,b){
if(i==0) continue;
else if(e.at(i)==e.at(i-1)) count++;
else if(e.at(i)!=e.at(i-1)){
if(count>=ce1){
ce2=ce1;
ce1=count;
en=e.at(i-1);
}
else if(count>=ce2){
ce2=count;
}
count=1;
}
if(i==b-1){
if(count>=ce1){
ce2=ce1;
ce1=count;
en=e.at(i);
}
else if(count>=ce2){
ce2=count;
}
count=1;
}
}
int ans;
if(on==en) ans=min(n-ce1-co2,n-co1-ce2);
else ans=n-ce1-co1;
// cout << co1 << ' ' << co2 << ' ' << ce1 << ' ' << ce2 << endl;
cout << ans << endl;
return 0;
} | 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 mod=1e9+7;
vector<int> Z_algorithm(vector<ll> S) {
int c = 0, n = S.size();
vector<int> Z(n, 0);
for (int i = 1; i < n; i++) {
int l = i - c;
if (i + Z[l] < c + Z[c]) {
Z[i] = Z[l];
} else {
int j = max(0, c + Z[c] - i);
while (i + j < n && S[j] == S[i + j])j++;
Z[i] = j;
c = i;
}
}
Z[0] = n;
return Z;
}
int main(){
int n;
cin >> n;
vector<ll> a(mx), b(mx);
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
vector<ll> axor(n),bxor(n);
rep(i,n){ axor[i]=a[i]^a[i+1]; } axor[n-1]=a[n-1]^a[0];
rep(i,n){ bxor[i]=b[i]^b[i+1]; } bxor[n-1]=b[n-1]^b[0];
auto tmp = bxor;
rep(j,2)rep(i,n) tmp.emplace_back(axor[i]);
vector<pair<int,ll>> kx;
auto res = Z_algorithm(tmp);
for(int i=n; i<n*2; i++)if(res[i]>=n){
kx.push_back({i-n,b[0]^a[i-n]});
}
sort(kx.begin(),kx.end());
for(auto ans:kx){
cout << ans.F << " " << ans.S << endl;
}
return 0;
}
| #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).size()) //sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
typedef long long ll;
typedef long double ld;
int main(){
ll n; cin>>n;
vector<ll> v(n);
REP(i,n)cin>>v[i];
sort(ALL(v));
vector<ll> sides;
vector<ll> list;
map<ll,ll> mp;
REP(i,n){
ll a=v[i];
if(mp.find(a)!=mp.end()){
mp.at(a)++;
list.push_back(a);
}else{
mp.insert(make_pair(a,1));
}
}
REP(i,SIZE(list)){
ll s=list[i];
while(mp.at(s)/=2){
sides.push_back(s);
}
}
ll ans;
if(SIZE(sides)<2){
ans=0;
}else{
sort(ALL(sides),greater<>());
ans=sides[0]*sides[1];
}
cout<<ans<<endl;
return 0;
}
| 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--;
}
}
if(judge=='b'){
if(numb==0) fin=false;
if(numb>0){
judge=b.at(b.size()-numb);
numb--;
}
}
if(judge=='c'){
if(numc==0) fin=false;
if(numc>0){
judge=c.at(c.size()-numc);
numc--;
}
}
}
if(judge=='a') cout << "A" << endl;
if(judge=='b') cout << "B" << endl;
if(judge=='c') cout << "C" << endl;
}
| #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);
scan(1);
scan(2);
ll k=0;
while(!q[k].empty())
{
char c=q[k].front();
q[k].pop();
k=c-'a';
}
cout<<char(k +'A');
}
| 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<<")" << "\n";
#define DEBUG(x) cout<<#x<<":"<<x<<"\n"
#define DEBUGS(v) cout << #v << ":";for(auto x:v){cout<<x<<" ";}cout<<"\n"
#endif
#ifndef __DEBUG__
#define CH_P(a)
#define DEBUG(x)
#define DEBUGS(v)
#endif
/* clang-format on */
int main() {
string x;
ll ans = 0;
cin >> x;
ll s = 0, t = 0;
REP(i, x.size()) {
if (x[i] == 'S')
s++;
else if (s > 0)
s--;
else
ans++;
}
ans += s;
cout << ans << endl;
return 0;
}
| 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.end()
#define allr(v) v.rbegin(),v.rend()
#define mod 1000000007LL
#define CIN(V,s,n) for(int i=s;i<n;i++){cin >> V[i];}
#define COUT(V,s,n) {for(int i=s;i<n;i++){cout << V[i] << " " ;} cout << endl;}
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define CLEAR(V); for(ll i=0;i<V.size();i++) V[i] = 0;
#define N 101LL
#define tmod 998244353LL
using namespace std;
bool sBs(const pair<int,int> &a,const pair<int,int> &b)
{ return (a.second < b.second); }
ll Powb(ll b,ll n,ll m);
ll BS(vector<pair< ll ,ll > > &PS,ll s,ll e,ll ser);
ll MI(ll a, ll m);
ll P[N+1];
void Sieve(int n=N);
int main()
{
fast;
ll q=1,t;
//cin >> q; t = q;
while(q--)
{
ll i,j,n,m,k,l=0,r=0,a=0,b=0,c=0,d=0,e,g=1,p,u,v,w,x,y,flag=0;
//n=m=k=i=j=l=r=a=b=c=d=u=v=w=p=x=y=0;
string s;
cin >> s;
if(s=="SUN") cout << 7;
else if(s=="MON") cout << 6;
else if(s=="TUE") cout << 5;
else if(s=="WED") cout << 4;
else if(s=="THU") cout << 3;
else if(s=="FRI") cout << 2;
else if(s=="SAT") cout << 1;
}
return 0;
}
//*****************************************************************************************************************************************
ll Powb(ll b,ll n,ll m)
{
if(n==0) return 1LL;
if(n==1) return b;
ll temp = Powb(b,n/2,m);
if(n%2==0){return (temp*temp)%m;}
else{return (b*((temp*temp)%m))%m;}
}
ll BS(vector<pair<ll,ll> > &PS,ll s,ll e,ll ser)
{
if(s>e)
return s;
ll mid = (s+e)/2;
if(PS[mid].F==ser)
{
return mid;
}
else if(PS[mid].F > ser)
{
return BS(PS,s,mid-1,ser);
}
else
return BS(PS,mid+1,e,ser);
}
ll MI(ll a, ll m)
{
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
void Sieve(int n)
{
//memset(P,true,sizeof(P));
//P[0] = false;
//P[1]= false;
for(int i=1;i<=n;i++) P[i] = i;
for(ll i=2;i*i<=n;i++)
{
if(P[i]==i)
{
for(ll j=i*i;j<=n;j+=i)
{
if(P[j]==j)
P[j]=i;
}
}
}
}
| #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,ll N,ll revN,ll cif){
if(i>n){
if(revN-N==d){
ans++;
}
return;
}
ll maxd=revN*sm[n-i+1]+1-N-sm[n-i+1];
ll mind=revN*sm[n-i+1]+jiu[n-i+1]-(jiu[n-i+1]*sm[i-1]+N);
if(N && revN-N+maxd<d)return;
if(N && revN-N+mind>d)return;
for(int j=9;j>=(i==n)?1:0;j--)
dfs(i+1,n,N+j*cif,revN*10+j,cif*10);
}
int main(){
int i,j,k,n,m;
scanf("%d",&d);
if(d%9){
puts("0");
return 0;
}
d/=9;
ll len=1,ini=0;
for(i=1;i<=18;i++)
sm[i]=sm[i-1]*10;
for(i=1;i<=17;i++){
ll tmp=1,D=d;
ini=ini*10+1;
ll base=ini,lten=len,rten=1;
for(int j=0;j<=(i>>1);j++){
tmp*=10-abs(D%(rten*10)/rten)-(!j?1:0);
D-=base*(D%(rten*10)/rten);
base-=lten+rten;
lten/=10;
rten*=10;
}
len*=10;
if(!D)ans+=tmp;
}
printf("%lld\n",ans);
return 0;
}
| 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 << "-1 -1" << endl;
return 0;
} else {
for(int i = 0; i < s.length() - 2; i++) {
if(s[i] == s[i + 1] || s[i] == s[i + 2] || s[i + 1] == s[i + 2]) {
cout << i + 1 << " " << i + 3 << endl;
return 0;
}
}
}
cout << "-1 -1" << endl;
return 0;
} | #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]==str[i+1])
{
x1=i,y1=i+1;
check=1;
break;
}
}
if(!check)
{
for(int i=1; i<n-1; i++)
{
if(str[i-1]==str[i+1])
{
x1=i-1,y1=i+1;
check=1;
break;
}
}
}
cout<<x1+1<<" "<<y1+1<<endl;
return 0;
}
| 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(i,100){
rep(j,100){
if(i < 50) g[i][j] = '#';
else g[i][j] = '.';
}
}
int p = (a-1)/50;
for(int i = 0; i < 2*p; i += 2){
for(int j = 0; j < 100; j += 2){
g[i][j] = '.';
}
}
int q = (a-1)%50;
for(int j = 0; j < 2*q; j += 2){
g[2*p][j] = '.';
}
int r = (b-1)/50;
for(int i = 0; i < 2*r; i += 2){
for(int j = 0; j < 100; j += 2){
g[i+51][j] = '#';
}
}
int s = (b-1)%50;
for(int j = 0; j < 2*s; j += 2){
g[2*r+51][j] = '#';
}
cout << "100 100" << endl;
rep(i,100){
rep(j,100){
cout << g[i][j];
}
cout << endl;
}
} | #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;
rep(i, h) rep(j, w) cin >> a[i][j];
rep(i, h - 1) rep(j, w) {
if (a[i][j] % 2 == 1) {
ans.push_back({i + 1, j + 1, i + 2, j + 1});
// cout << i + 1 << " " << j + 1 << " " << i + 2 << " " << j + 1 << endl;
a[i][j]--;
a[i + 1][j]++;
}
}
rep(i, w - 1) {
if (a[h - 1][i] % 2 == 1) {
ans.push_back({h, i + 1, h, i + 2});
// cout << h - 1 << " " << i + 1 << " " << h - 1 << " " << i + 2 << endl;
a[h - 1][i]--;
a[h - 1][i + 1]++;
}
}
cout << ans.size() << endl;
rep(i, ans.size()) rep(j, 4) printf("%d%c", ans[i][j], (j == 3 ? '\n' : ' '));
// rep(i, h) rep(j, w)
// fprintf(stderr, "%d%c", a[i][j], (j == w - 1 ? '\n' : ' '));
return 0;
}
| 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 s;
cin >> s;
cout << "2018" + s.substr(4) << endl;
}
int main(void)
{
solve();
} | #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 <queue>
#include <cstring>
#include <iomanip>
#include <cassert>
using namespace std;
typedef long long ll;
int main(){
int N;
cin >> N;
map<int,int> M;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
M[A[i]]++;
}
sort(A.begin(),A.end());
A.erase(unique(A.begin(),A.end()),A.end());
int size = A.size();
int ind = size-1;
long long ans=0;
for(long long offset = (1LL<<31); offset > 1; offset /=2){
while(ind>=0&&A[ind]*2>=offset){
int cur = A[ind];
int partner = offset-A[ind];
if(cur == partner){
int pair= M[cur]/2;
ans += pair;
M[cur]-= pair*2;
}
else{
int pair= min(M[cur],M[partner]);
ans += pair;
M[cur]-=pair;
M[partner]-=pair;
}
ind--;
}
}
cout << ans << endl;
return 0;
}
| // 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, two = 0, five = 0, df = 0;
while ((c = *bufptr++) >= ' ') {
if (c == '.') {
df = -1;
} else {
x = (x * 10) + c - '0';
five += df;
}
}
two = __builtin_ctzll(x);
x >>= two;
two += five;
while (x % 5 == 0) {
++five;
x /= 5;
}
if (two > 9) two = 9;
if (five > 9) five = 9;
cnt[10 + two][10 + five] += 1;
sum[10 - two][10 - five] += 1;
}
for (int i = 0; i < 20; ++i) {
for (int j = 1; j < 20; ++j) {
sum[i][j] += sum[i][j - 1];
}
}
for (int i = 1; i < 20; ++i) {
for (int j = 0; j < 20; ++j) {
sum[i][j] += sum[i - 1][j];
}
}
for (int i = -9; i <= 9; ++i) {
for (int j = -9; j <= 9; ++j) {
ans += sum[10 + i][10 + j] * cnt[10 + i][10 + j];
if (i >= 0 && j >= 0) {
ans -= cnt[10 + i][10 + j];
}
}
}
printf("%lld\n", ans >> 1);
return 0;
}
| 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(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
// using namespace atcoder;
// Eratosthenes
vector<int> eratTable;
vector<ll> eratosthenes(ll n) {
eratTable.assign(n + 1, 1);
eratTable[0] = 0;
eratTable[1] = 0;
for (ll i = 2; i <= n; i++) {
if (eratTable[i] == 1) {
for (ll j = 2; i * j <= n; j++) {
eratTable[i * j] = 0;
}
}
}
vector<ll> primes;
rep(i, eratTable.size()) {
if (eratTable[i] >= 1) {
primes.push_back(i);
}
}
return primes;
}
bool check(const vector<ll>& a) {
for (ll i = 0; i < a.size() - 4; i++) {
for (ll j = i + 1; j < a.size() - 3; j++) {
for (ll k = j + 1; k < a.size() - 2; k++) {
for (ll l = k + 1; l < a.size() - 1; l++) {
for (ll m = l + 1; m < a.size(); m++) {
ll v = a[i] + a[j] + a[k] + a[l] + a[m];
// 1なら素数
if (eratTable[v] == 1) {
return false;
}
}
}
}
}
}
return true;
}
void Main()
{
ll n;
cin >> n;
vector<ll> res;
auto primes = eratosthenes(55555);
rep (i, primes.size()) {
if (primes[i] % 5 == 1) {
res.push_back(primes[i]);
}
}
rep(i, n) cout << res[i] << (i == n - 1 ? "" : " ");
cout << endl;
}
signed main(){ Main();return 0;} | #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 scout cout << fixed << setprecision(20)
ll INF = 1LL << 60;
ll mod = 1e9 + 7;
bool isplime(int p){
if(p==1) return false;
for(int i=2;i<p;i++) {
if(p%i==0) return false;
}
return true;
}
int main() {
int n; cin >> n;
for(int i=31;i<=55555;i+=30) {
if(isplime(i)) {
if(i!=31) cout << " ";
cout << i;
n--;
}
if(n==0) break;
}
cout << endl;
} | 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::cpp_dec_float<1024>>;
using Bint = mp::cpp_int;
*/
using namespace std;
#define int long long
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
#define FOR(i,n) for((i)=(0);(i)<(n);(i)++)
#define RFOR(i,n) for((i)=((n)-1);(i)>=(0);(i)--)
#define MOD 1000000007
signed main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
int AB=A+B;
int CD=C+D;
if(AB>CD) cout<<"Left"<<endl;
else if(AB<CD) cout<<"Right"<<endl;
else cout<<"Balanced"<<endl;
}
| #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;
}
| 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 (int i = 0; i < limit; i++){
total *= 2;
}
for (int i = 0; i < N - limit; i++){
total += K;
}
cout << total << endl;
}
| #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[310][310];
bool ok[310];
ll ans = LINF;
int main(){
int n, m;
cin >> n >> m;
rep(i, n) rep(j, m) cin >> a[i][j], a[i][j]--;
rep(i, 310) ok[i] = 1;
rep(i, m){
int selected[310] = {};
rep(j, n){
rep(k, m){
if (ok[a[j][k]]) {
selected[a[j][k]]++;
break;
}
}
}
ll mx = 0, idx = -1;
rep(j, m){
if(selected[j] == 0) continue;
if(selected[j] > mx){
mx = selected[j];
idx = j;
}
}
ans = min(ans, mx);
ok[idx] = 0;
}
cout << ans << endl;
return 0;
}
| #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;vector<pair<pair<int,int>,pair<int,int>>> v;
i = 0;j = 0;int ni,nj;
while(true){
if((!(i&1)) && j+1 == W){
ni = i+1;nj = j;
}
else if(i&1 && j == 0){
ni = i+1;nj = j;
}
else if(!(i&1)){
ni = i;nj = j+1;
}
else{
ni = i;nj = j-1;
}
if(ni == H) break;
if(odd[i][j]){
if(coin == false){
coin = true;
v.push_back(make_pair(make_pair(i,j),make_pair(ni,nj)));
}
else{
coin = false;
}
}
else{
if(coin == true){
v.push_back(make_pair(make_pair(i,j),make_pair(ni,nj)));
}
}
i = ni;j = nj;
}
printf("%d\n",v.size());
for(i=0;i<v.size();i++) printf("%d %d %d %d\n",v[i].first.first+1,v[i].first.second+1,v[i].second.first+1,v[i].second.second+1);
} | 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 * dd;
cout << ans << endl;
}
return 0;
} | #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>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2e5 + 123;
int n, a[N];
array <ll, 2> p[N], s[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
int j = 1;
ll pref = a[1], cur = a[1];
for (int i = 2; i <= n; i++) {
pref += a[i];
while (abs(cur + a[j + 1] - (pref - cur - a[j + 1])) < abs(cur - (pref - cur)))
cur += a[++j];
p[i] = {cur, pref - cur};
if (p[i][0] > p[i][1]) swap(p[i][0], p[i][1]);
}
ll suf = a[n];
cur = a[n], j = n;
for (int i = n - 1; i >= 1; i--) {
suf += a[i];
while (abs(cur + a[j - 1] - (suf - cur - a[j - 1])) < abs(cur - (suf - cur)))
cur += a[--j];
s[i] = {cur, suf - cur};
if (s[i][0] > s[i][1]) swap(s[i][0], s[i][1]);
}
ll ans = 1e9 + 123;
for (int i = 2; i <= n - 2; i++)
ans = min(ans, max(p[i][1], s[i + 1][1]) - min(p[i][0], s[i + 1][0]));
cout << ans;
}
| #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 -= abs(A[i+1] - A[i]);
res -= abs(A[i] - A[i-1]);
res += abs(A[i+1] - A[i-1]);
cout << res << endl;
}
return 0;
} | 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 << (pred ? YES : NO) << endl;
}
int main() {
ll A;
cin >> A;
ll B;
cin >> B;
ll C;
cin >> C;
solve(A, B, C);
return 0;
}
| 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);
}
// long long mod = 998244353;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
long long modpow(long long m, long long n, long long modvalue) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2, modvalue);
return t * t % modvalue;
} else {
return modpow(m, n - 1, modvalue) * m % modvalue;
}
}
long long moddiv(long long a, long long b, ll modvalue) { return (a * modpow(b, mod - 2, modvalue)) % modvalue; }
const ll INF = 1LL << 60;
string change_binary(long long a) {
string ret;
for (int i = 31; i >= 0; i--) {
ret += (a >> i & 1) + '0';
}
return ret;
}
ll nCkmod(ll n, ll k, ll modvalue) {
ll numera = 1;
for (int i = n; i > n - k; i--) {
numera *= i;
numera %= modvalue;
}
ll denomi = 1;
REP(i, k) {
denomi *= (i + 1);
denomi %= modvalue;
}
return moddiv(numera, denomi, modvalue);
}
map<ll, ll> cnt;
void primeFactors(long long n) {
while (n % 2 == 0) {
cnt[2]++;
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
cnt[i]++;
n = n / i;
}
}
if (n > 2) {
cnt[n]++;
}
}
int main() {
int n, m;
cin >> n >> m;
ll now = 0;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0 && m / i >= n) {
now = max(now, (ll)i);
}
if (m % i == 0 && m / (m / i) >= n) {
now = max(now, (ll)m / i);
}
}
cout << now << endl;
} | #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) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
cout << (B == 1 ? 0 : (B - 2) / (A - 1) + 1) << '\n';
return 0;
}
| 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); }
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod - a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; }
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1) a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint& operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream & is, const mint & a) { return is >> a.x; }
ostream& operator<<(ostream & os, const mint & a) { return os << a.x; }*/
int main() {
int r;
cin >> r;
if (r < 1200)
cout << "ABC" << endl;
else if (r < 2800)
cout << "ARC" << endl;
else
cout << "AGC" << endl;
return 0;
}
/*���C�u�����ő����*/
//���[�O���b�h�̌ݏ��@
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
} | 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(100010);
void dijkstra(){
priority_queue<pair<ll,int>> PQ;
//priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> PQ;
for(int i=0;i<=100005;i++) dist[i]=INF;
PQ.push(make_pair(0,1));
dist[1]=0;
while(!PQ.empty()){
pair<ll,int> f=PQ.top();
PQ.pop();
int t=f.second;
if(dist[t]<-f.first) continue;
for(int i=0;i<v[t].size();i++){
pair<int,int> u=v[t][i];
ll c=0;
if(s[t].count(u.second)==0) c++;
if(dist[u.first]>dist[t]+c){
s[u.first].clear();
s[u.first].insert(u.second);
dist[u.first]=dist[t]+c;
PQ.push(make_pair(-dist[u.first],u.first));
}else if(dist[u.first]==dist[t]+c){
if(s[u.first].count(u.second)==0){
s[u.first].insert(u.second);
//PQ.push(make_pair(dist[u.first],u.first));
}
//s[u.first].insert(u.second);
}
//cout<<u.first<<" "<<u.second<<" "<<dist[u.first]<<endl;
}
}
return;
}
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int p,q,c;
scanf("%d %d %d",&p,&q,&c);
v[p].push_back(make_pair(q,c));
v[q].push_back(make_pair(p,c));
}
dijkstra();
//for(int i=0;i<n;i++) cout<<i+1<<" "<<dist[i+1]<<endl;
if(dist[n]==INF) cout<<-1<<endl;
else cout<<dist[n]<<endl;
return 0;
}
| #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++){
int a, l, r;
cin >> a >> l >> r;
if (a == 0)
fw.add(l, r);
else
cout << fw.sum(l, r) << endl;
}
} | 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--;
}
reverse(s.begin(),s.end());
cout << s << endl;
return 0;
} | #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 < 26)
break;
llN -= (iChar[iCnt - 1] + 1);
llN /= 26;
//printf("%lld\n", llN);
}
while (iCnt-- > 0) {
printf("%c", (char)(iChar[iCnt] + 97));
}
return 0;
}
| 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 <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 10e16
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
//using Int=int_fast64_t;
typedef long long int ll;
typedef pair<ll,ll>Pll;
typedef pair<int,int>Pin;
long long GCD(long long a, long long b) { return b ? GCD(b, a%b) : a; }
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[8]={-1,0,1,0,1,1,-1,-1};
int dy[8]={0,-1,0,1,1,-1,1,-1};
char dir[4]={'u','l','d','r'};
ll cmp1(pair<ll,string>a,pair<ll,string> b){
if(a.fi!=b.fi)
return a.fi<b.fi;
else
return a.se<b.se;
}
//--------------------------------------------------------------------------
//---------------------------------------------------------------------------
int main(){//問題をちゃんと見ろ!!!!!!!!!!!!!!!!! llか?????????? memset()!!!!!!!!!!!! ペナを減らせ!!!!!!!!!!!!!
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
int n;cin>>n;
vector<int>a(n);
for(int i=0;i<n;i++)cin>>a[i];
int sum=0;double ave=0;
for(int i=0;i<n;i++)sum+=a[i];
ave=(double)sum/n;
double minm=INF;
int ans=0;
for(int i=0;i<n;i++){
if(minm>abs(a[i]-ave)){
minm=abs(a[i]-ave);
ans=i;
}
}
cout<<ans<<endl;
return 0;
for(int i=0;i<n;i++){
if(abs(a[i]-ave)==minm){
cout<<i<<endl;
return 0;
}
}
//-------------------------------
return 0;
}
//---------------------------------------------------------------------------
| #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]]++;
}
sort(A.rbegin(),A.rend());
ll ans =0;
for(int i=0;i<N;i++){
if(mp[A[i]] ==0){
continue;
}
ll n = A[i];
ll t = *num.upper_bound(n);
t-=n;
mp[n]--;
if(mp.find(t) == mp.end()|| mp[t] ==0){
continue;
}
ans++;
mp[t]--;
}
cout << ans << endl;
return 0;
} | 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++)
{
if (n % i != 0)
{
continue;
}
int num = 0;
while (n % i == 0)
{
++num;
n /= i;
}
res.push_back(make_pair(i, num));
}
if (n != 1)
{
res.push_back(make_pair(n, 1));
}
return res;
}
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
ll lcm(ll x, ll y) {
return x / GCD(x, y) * y;//先に割り算をして掛けられる数を小さくして掛け算を行う
}
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void dfs(int st, int fi) {
// cout << st << " " << fi << endl;
if (st < 0 || fi < 0 || st >= H || fi >= W)
{
return ;
}
if (S[st][fi] == '#')
{
return ;
}
if (seen[st][fi] == 1)
{
return ;
}
if (S[st][fi] == '.')
{
seen[st][fi] = 1;
}
dfs(st + 1, fi);
dfs(st, fi + 1);
dfs(st, fi - 1);
dfs(st - 1, fi);
}
int main() {
ll N, T;
cin >> N >> T;
vector<ll> t(N);
for(int i = 0; i < N; i++) cin >> t[i];
ll ans = 0;
for(int i = 0; i < N - 1; i++) {
if(t[i] + T <= t[i + 1]) ans += T;
else {
ans += (t[i + 1] - t[i]);
}
}
ans += T;
cout << ans << endl;
return 0;
}
| #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 - preT);
}
preT = t;
}
cout << X + T << endl;
return 0;
} | 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 。
那么满足这个分块方式的 P 有 n!/prod(s) 。
证明：
考虑从左到右确定排列 P 的相对权值，把块的最大值定在块的右端点。
不考虑块限制时第 i 个位置有 i 种选数方案，考虑块限制，事实上块限制只会影响到块的右端点，
这些点在选数时必须选当前最大值，那么用 n! 除掉这些点的位置乘积即可。
于是可以对于分母进行 DP ，设 f[i][j] 表示当前块长和为 i ，块长为 1 与块长为 2 的块数差为 j ，
这种情况下的分母的和，转移枚举最后一个块的大小即可。
#endif
#include <cstdio>
#include <algorithm>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
struct {
inline operator int () { int x; return scanf("%d", &x), x; }
} read;
const int maxn = 6005;
ll f[maxn][maxn << 1];
ll inv[maxn];
int main () {
int n = read * 3, mod = read;
inv[1] = 1;
for (int i = 2; i <= n; i ++)
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
f[0][maxn + 0] = 1;
f[1][maxn + 1] = inv[1];
f[2][maxn + 2] = inv[2];
f[2][maxn - 1] = inv[2];
for (int s = 3; s <= n; s ++)
for (int i = maxn - s; i <= maxn + s; i ++)
f[s][i] = (f[s - 1][i - 1] + f[s - 3][i] + f[s - 2][i + 1]) * inv[s] % mod;
ll ans = 0;
for (int i = maxn; i <= maxn + n; i ++)
ans += f[n][i];
ans %= mod;
for (int i = 1; i <= n; i ++)
(ans *= i) %= mod;
printf("%lld\n", ans);
}
| #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 RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
template<class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }
template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while(*sdbg!=',')cerr<<*sdbg++;
cerr<<'='<<h<<','; _dbg(sdbg+1, a...);
}
template<class T> ostream &operator<<(ostream& os, vector<T> V) {
os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
return os << "(" << P.st << "," << P.nd << ")";
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif
int n,m;
int mul(int a,int b){
return a * b % m;
}
void add(int &a,int b){
a += b;
if(a >= m)
a -= m;
}
int po2(int a){
return (a-2) * (a - 1) % m;
}
// int odw3 = 1;
// int po3(int a){
// return a * (a - 1) % m * (a - 2) % m * odw3 % m;
// }
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(11);
cerr << fixed << setprecision(6);
cin >> n >> m;
vector<int> zost(3 * n + 1);
// while(odw3 % 3 != 0)odw3 += m;
// odw3 /= 3;
zost[3*n] = 1;
int res = 0;
R(_,n+1){
debug(zost);
R(i,SZ(zost))add(res, zost[i]);
debug(res);
if(_ == n)break;
for(int i = 3 * n - 1; i >= 0; i--){
add(zost[i], zost[i + 1]);
}
vector<int> ak(3 * n + 1);
R(i,SZ(zost)){
if(i >= 2)add(ak[i - 2], mul(i-1, zost[i]));
if(i >= 3)add(ak[i - 3], mul(po2(i), zost[i]));
}
swap(ak, zost);
}
cout << res << "\n";
}
| 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(a[i] - a[i+1]);
rep(i, n){
cout << sum + abs(a[i] - a[i+2]) - abs(a[i] - a[i+1]) - abs(a[i+1] - a[i+2])<< endl;
}
}
| //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 <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
#include <cstring>
// ===============================================================
//using系
#pragma region header
using namespace std;
using ll = long long;
using lint = long long;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vvi = vector<vector<int>>;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
using ui = unsigned int;
using qul = queue<ll>;
using pql = priority_queue<ll>;
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr ll mod = 1e9 + 7;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
// ========================================================================
//define
#pragma region header
//#define int long long
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i <= n; i++)
#define INF (ll)10000000000000000
#define mod (ll)1000000007
#define P pair<lint,lint>
template <class T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b; // aをbで更新
return true;
}
return false;
}
template <class T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b; // aをbで更新
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main() {
lint n; cin >> n;
lint ans = 0;
lint cnt = 0;
lint minn = INF;
for (int i = 0; i < n; i++) {
lint x; cin >> x;
if (x < 0) cnt++;
ans += abs(x);
minn = min(minn, abs(x));
}
if (cnt % 2 == 0) printf("%lld\n", ans);
else printf("%lld\n", ans - minn * 2);
return 0;
} | 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 unsigned long long ull;
typedef long double ld;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int dp[311][311][311];
string s;
int solve(int l, int r, int k)
{
if(k<0) return -int(1e9);
if(l>r) return 0;
if(dp[l][r][k]>=0) return dp[l][r][k];
if(l==r) return 1;
int ans = max(solve(l,r-1,k),solve(l+1,r,k));
ans=max(ans,solve(l+1,r-1,k-(s[l]!=s[r]))+2);
return (dp[l][r][k]=ans);
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>s; int k; cin>>k;
memset(dp,-1,sizeof(dp));
cout<<solve(0,int(s.length())-1,k)<<'\n';
}
| #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(){
scanf("%s%d",s+1,&k);
n=strlen(s+1);
int ans=0;
for (int i=1; i<=n; ++i)
for (int j=n; j>=i; --j)
for (int l=k; ~l; --l){
cal(f[i+1][j][l],f[i][j][l]);
cal(f[i][j-1][l],f[i][j][l]);
cal(f[i+1][j-1][l],f[i][j][l]+(s[i]==s[j]));
if (l) cal(f[i+1][j-1][l-1],f[i][j][l]+1);
}
for (int i=1; i<=n; ++i)
for (int j=0; j<=k; ++j){
cal(ans,f[i+1][i-1][j]*2-1);
cal(ans,f[i+1][i][j]*2);
}
cout<<ans;
return 0;
}
| 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;
y_ *= d;
return {x_, y_};
}
const double eps = 1e-3;
int near(double x) {
for(int i = (int)(x - 2); i < (int)(x + 2); i++) {
if(abs(i - x) < eps) {
return i;
}
}
return 0;
}
void solve() {
string s;
int a, b;
cin >> a >> b >> s;
bool ok = true;
ok &= s[a] == '-';
for(int i = 0; i < s.length(); i++) {
if(i == a)
continue;
else ok &= s[i] >= '0' && s[i] <= '9';
}
cout << (ok?"Yes":"No") << endl;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int testcase = 1;
// cin >> testcase;
for(int i = 0; i < testcase; i++) {
solve();
}
return 0;
}
| #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)
{
flag = 1;
continue;
}
else if ( i != A)
{
flag = 0;
break;
}
}
}
flag ? printf("Yes\n") : printf("No\n");
return 0;
} | 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=0;i<(j);i++)
#define reps(i,j,k) for(int i=j;i<k;i++)
typedef long long ll;
typedef unsigned long long ull;
int check(char str);
int counter(int res,char *str);
int main(){
char str[128]={0};
while(~scanf("%s",str)){
/*宣言*/
int ans = 0,bef = 0;
int cnt = 1;
int len = strlen(str);
int x;
bool f = false;
/*宣言終了*/
reverse(str,str+len);
rep(i,len){
x = check(str[i]);
if(!f){
bef = x;
f = true;
continue;
cnt++;
}
if(bef == x){
cnt++;
}
else if(bef < x){
ans += cnt*bef;
cnt = 1;
bef = x;
}
else{
int coun = counter(i,str);
ans += (bef*cnt) - (coun*x);
cnt = 1;
f = false;
i += coun-1;
}
}
if(x == bef)ans += cnt*bef;
printf("%d\n",ans);
}
return 0;
}
int check(char str){
if(str == 'I')return 1;
if(str == 'V')return 5;
if(str == 'X')return 10;
if(str == 'L')return 50;
if(str == 'C')return 100;
if(str == 'D')return 500;
if(str == 'M')return 1000;
}
int counter(int res , char *str){
int cnt = 1;
for(int i = res; str[i] != str[res] ; i++){
cnt++;
}
return cnt;
} | #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("%s\n", buf) != EOF)
{
int len = strlen(buf);
int n[100];
for (int i = 0; i < len; ++i)
{
for (int j = 0; j < 7; ++j)
{
if (buf[i] == ara[j])
{
n[i] = num[j];
break;
}
}
}
for (int i = 0; i < len-1; ++i)
n[i] *= n[i] < n[i+1] ? -1 : 1;
int res = 0;
for (int i = 0; i < len; ++i)
res += n[i];
printf("%d\n", res);
}
return 0;
} | 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)
return 1;
else
return ((n%M)*(fact(n-1)%M))%M;
}
int div(int n)
{ int c=0;
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
if(n/i==i)
c++;
else
c+=2;
}
}
return c;
}
int func(int n)
{
return (n*(n+1))/2;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string str;
cin>>str;
set<char> s;
for(int i=0;i<str.length();i++)
{
s.insert(str[i]);
}
if(s.size()==26)
cout<<"None";
else
{ int i=0;
for(auto it=s.begin();it!=s.end();it++,i++)
{
if(*it!=(97+i))
{
cout<<(char)(97+i);
return 0;
}
}
if(s.size()<26)
{
cout<<char(97+s.size());
}
}
return 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
#define mxlen 1000+9
#define inf 1000009
#define INF (int)1e9
#define pi acos(-1)
#define rd(n) {n=0;char ch;int f=0;do{ch=getchar();if(ch=='-'){f=1;}}while(ch<'0'||ch>'9');while('0'<=ch&&ch<='9'){n=(n<<1)+(n<<3)+ch-48;ch=getchar();}if(f)n=-n;}
using namespace std;
char s1[inf],s2[inf];
int q[inf*2],head=inf,tail=inf-1;
int main(){
int n;
rd(n)
scanf("%s%s",&s1,&s2);
q[++tail]=n+1;
int pos=n+1,cnt=0,ans=0;
for (int i=n;i>=1;i--){
int tmp=pos;
while (pos>0 && (pos>i || s1[pos-1]!=s2[i-1])){
pos--;
}
if (pos==0){
puts("-1");
return 0;
}
if (tmp==pos){
while (head<=tail && q[tail]-cnt>=i){
tail--;
}
q[++tail]=i+cnt;
}
else{
cnt++;
if (i!=pos){
ans=max(ans,tail-head+1);
q[--head]=pos+cnt;
}
}
}
printf("%d\n",ans);
return 0;
} | 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")
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
int main(){
int n,t,a,b;
in(n);
vector2d(int,vec,n,n,-1);
rep(i,n){
in(t);
while(t--){
in(a,b);
vec[i][a-1]=b;
}
}
int maxv=0,flag=1;
for(int i=0;i<(1<<n);i++){
bitset<15> table(i);
flag=1;
rep(k,n){
if(table.test(k)){
for(int j=0;j<n;j++){
if(vec[k][j]==-1)continue;
if(vec[k][j]!=table.test(j)){
flag=0;
goto skip;
}
}
}
}
skip:
if(flag)maxv=max(maxv,(int)table.count());
}
out(maxv);
}
| #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 <climits>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define cmn(x,y) x=min(x,y)
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
template<typename T> class segtree {
private:
int n,sz;
vector<pair<T, int> > node;
public:
segtree(vector<T>& v) : sz((int)v.size()){
n = 1;
while(n < sz){
n *= 2;
}
node.resize(2*n, make_pair(numeric_limits<T>::max(), sz));
for(int i = 0; i < sz; i++){
node[i+n] = make_pair(v[i], i);
}
for(int i=n-1; i>=1; i--){
node[i] = min(node[2*i], node[2*i+1]);
}
}
void update(int k, T a)
{
node[k+n] = make_pair(a, k);
k += n;
while(k>>=1){
node[k] = min(node[2*k], node[2*k+1]);
}
}
pair<T, int> query(int a,int b,int k=0,int l=0,int r=-1)
{
pair<T, int> res1 = make_pair(numeric_limits<T>::max(), sz);
pair<T, int> res2 = make_pair(numeric_limits<T>::max(), sz);
a += n, b += n;
while(a != b){
if(a % 2) cmn(res1, node[a++]);
if(b % 2) cmn(res2, node[--b]);
a >>= 1, b>>= 1;
}
return min(res1, res2);
}
void print()
{
for(int i = 0; i < sz; i++){
pair<T, int> p;
p = query(i,i+1);
cout << "st[" << i << "]: " << p.first << " " << p.second << endl;
}
}
};
int n;
ll d;
ll saiki(segtree<ll>& sg, int a,int b){
//cerr << a << " " << b << endl;
if(b==a+1)return 0;
auto p = sg.query(a,b);
ll s = p.first;
ll ans = 0;
int ind = p.second;
if(ind-1>=a){
ll xx = sg.query(ind-1,ind).first;
ans += s+d+xx;
sg.update(ind-1,min(xx,s+d));
ans += saiki(sg,a,ind);
}
if(ind+1<b){
ll xx = sg.query(ind+1,ind+2).first;
ans += s+d+xx;
sg.update(ind+1,min(xx,s+d));
ans += saiki(sg,ind+1,b);
}
return ans;
}
int main(){
cin >> n >> d;
vector<ll>v(n+1);
rep(i,n)cin >> v[i];
segtree<ll> sg(v);
ll ans = saiki(sg,0,n);
cout << ans << endl;
return 0;
}
| 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 int ans=0;
for(auto u:mp){
if(u.first==0LL)ans += u.second;
ans += u.second*(u.second-1)/2;
}
cout << ans << endl;
} | #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"
#define DF(x) x.erase(x.begin()) // 先頭文字削除
#define ALL(x) x.begin(), x.end()
#define SZ(x) (ll) x.size()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define ANS cout << ans << "\n"
#define RETURN(x) \
cout << x << "\n"; \
return 0
clock_t CLOCK;
#define START_TIMER CLOCK = clock()
#define SHOW_TIMER cerr << "time: " << (ld)(clock() - CLOCK) / 1000000 << "\n"
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define LINE cerr << "[debug] line: " << __LINE__ << "\n";
#define debug(x) cerr << "[debug] " << #x << ": " << x << "\n";
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << "\n";
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using mll = map<ll, ll>;
using qll = queue<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
signed main() {
init();
ll N, M;
cin >> N >> M;
vll A(N + 1);
mll m;
rep(i, N + 1) {
if (i == 0) {
A[i] = 0;
m[0]++;
continue;
}
ll a;
cin >> a;
A[i] = A[i - 1] + a;
m[A[i] % M]++;
}
ll ans = 0;
rep(i, N + 1) {
ans += m[A[i] % M] - 1;
}
ans /= 2;
ANS;
return 0;
} | 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; i++) {
if (v.at(i) == 0) {
ans = (char)i + 97;
break;
}
}
cout << ans << endl;
} | #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(char i='a';i<='z';i++){
if(s.count(i)==true)continue;
else{
cout<<i;
return 0;
}}
cout<<"None";
return 0;}
| 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;
char s[maxn];
int a[maxn],len;
ll sum;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
scs(s);
len=strlen(s+1);
for(int i=1;i<=len;i++){
a[i]=s[len-i+1]-'0';
}
for(int i=1;i<=len+1;i++){
if(a[i]==10){
a[i]-=10;
a[i+1]++;
}
if(a[i]>5){
sum+=(10-a[i]);
a[i+1]++;
}
else if(a[i]<5){
sum+=a[i];
}
else{
sum+=5;
if(a[i+1]>=5){
a[i+1]++;
}
}
}
pr(sum);
return 0;
} | #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>
#define all(c) c.begin(), c.end()
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
const int INF = 1e9+7;
const int MOD = 1e9+7;
const int dx[4] = {0,0,-1,1};
const int dy[4] = {-1,1,0,0};
const int N = 1e6+2;
string s;
int n, dp[N][2], ssum[N];
int main()
{
fastio;
cin >> s; reverse(all(s));
int n = s.size(); s = '#' + s;
for (int i = n; i > 0; i--) ssum[i] = ssum[i + 1] + (9 - (s[i] - '0'));
dp[0][0] = dp[0][1] = 0;
int mn = ssum[1];
for (int i = 1; i <= n; i++){
dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + (s[i] - '0');
dp[i][1] = mn - ssum[i + 1] + 2;
mn = min(mn, dp[i][0] + ssum[i + 1]);
mn = min(mn, dp[i][1] + ssum[i + 1]);
}
cout << min(dp[n][0], dp[n][1]);
return 0;
} | 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==d);
if(d<x-maxv[p]||d>x+maxv[p])return 0;
long long ans=0;
for(int i=-9;i<=9;i++){
if(p)ans+=dfs(x+v[p]*i,p+1)*(10-abs(i));
else if(i^9)ans+=dfs(x+v[p]*i,p+1)*(i>=0?9-i:10+i);
}
return ans;
}
int main(){
scanf("%d",&d);
long long ans=0;
for(int i=1;i<=18;i++){
memset(maxv,0,sizeof(maxv));
n=i+1>>1;
for(int j=0;j<n;j++)v[j]=qpow(10,i-j)-qpow(10,j);
for(int j=0;j<n;j++)
for(int k=j;k<n;k++)maxv[j]+=v[k]*9;
ans+=dfs(0,0)*(i&1?1:10);
}
printf("%lld\n",ans);
return 0;
} | #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 {
int d = digit[low] + carry; carry = 0;
if (d == 10) d = 0, carry = 1;
dfs(high-1, low+1, dif + (pw[low] - pw[high])*d, way*(10-d-(low==0 && d==0)), carry);
if (d > 0) {
dfs(high-1, low+1, dif + (pw[low] - pw[high])*(d-10), way*(d - (low==0)), 1);
}
}
}
void solve() {
cin >> D;
pw[0] = 1;
for (int i = 1; i <= 18; i++) {
pw[i] = 10*pw[i-1];
}
ll x = D;
for (int i = 0; i <= 18; i++) {
digit[i] = x%10;
x/=10;
}
for (int len = 1; len <= 18; len++) {
dfs(len-1, 0, 0, 1, 0);
}
cout << res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| 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) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int mi = N + 1;
int ans = 0;
for (int i = 0; i < N; i++) {
int P;
cin >> P;
ans += P <= mi;
mi = min(mi, P);
}
cout << ans << "\n";
return 0;
}
| #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--){
if(a[i]==val){
cnt++;
ans[val]=1;
while(ans[val]==1){
val++;
}
}
ans[a[i]]=1;
}
cout << cnt << endl;
}
| 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 : {0, 1}) {
iota(begin(I[i]), end(I[i]), 1);
partial_sort(begin(I[i]), begin(I[i]) + 2, end(I[i]),
[&](int a, int b) { return V[i][a] > V[i][b]; });
}
auto ans = n - ((I[0][0] != I[1][0]) ? V[0][I[0][0]] + V[1][I[1][0]]
: max(V[0][I[0][0]] + V[1][I[1][1]],
V[0][I[0][1]] + V[1][I[1][0]]));
cout << ans << endl;
}
| #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() {
int n;
cin >> n;
map<int,int> a, b;
rep(i,n) {
int v;
cin >> v;
if (i%2) a[v]++;
else b[v]++;
}
priority_queue<P> ap, bp;
for (auto p : a) {
ap.emplace(p.second, p.first);
}
for (auto p : b) {
bp.emplace(p.second, p.first);
}
vector<P> x, y;
int cnt = 2;
while (!ap.empty() && cnt > 0) {
auto p = ap.top();
ap.pop();
x.push_back(p);
cnt--;
}
cnt = 2;
while (!bp.empty() && cnt > 0) {
auto p = bp.top();
bp.pop();
y.push_back(p);
cnt--;
}
int ans = INF;
rep(i,x.size())rep(j,y.size()) {
int now = 0;
if (x[i].second == y[j].second) {
now = n/2 + n/2 - max(x[i].first, y[j].first);
}
else {
now = n - x[i].first - y[j].first;
}
ans = min(ans, now);
}
cout << ans << endl;
return 0;
} | 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 <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
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; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e15;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
typedef pair<double,double> point;
const ll MAX = 2010;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m;
cin >> n >> m;
vector<ll> a(n+1);
rep(i,n) cin >> a[i+1];
rep(i,n) a[i+1] += a[i];
map<ll,ll> cnt;
vector<ll> mod;
rep(i,n+1){
cnt[a[i]%m]++;
mod.push_back(a[i]%m);
}
SORT(mod);
mod.erase(unique(all(mod)),mod.end());
ll ans = 0;
for(ll i:mod){
ans += cnt[i]*(cnt[i]-1)/2;
}
PRINT(ans);
}
| #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" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono cout << "no" << endl
//#define cocount cout << count << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define Cinint(n) int n;\
cin >> n;
#define Cinvecint(a, n) vector<int> a(n);\
for (int i = 0; i < (int)(n); i++) {\
int num;\
cin >> num;\
a.at(i) = num;\
}
#define Cinstring(s) string s;\
cin >>s;
int main() {
Cinint(n);
Cinstring(s);
int64_t count = 0;
int64_t Rcount = 0;
int64_t Gcount = 0;
int64_t Bcount = 0;
rep(i, n) {
if (s.at(i) == 'R') {
Rcount++;
}
else if (s.at(i) == 'G') {
Gcount++;
}
else {
Bcount++;
}
}
count = Rcount*Gcount*Bcount;
rep(i, n-2) {
for (int j = i+1; j < n-1; j++) {
int sa = j-i;
int k = j+sa;
if (k <= n-1) {
if (s.at(i) == 'R') {
if (s.at(j) == 'G') {
if (s.at(k) == 'B') {
count--;
}
}
else if (s.at(j) == 'B') {
if (s.at(k) == 'G') {
count--;
}
}
}
else if (s.at(i) == 'G') {
if (s.at(j) == 'B') {
if (s.at(k) == 'R') {
count--;
}
}
else if (s.at(j) == 'R') {
if (s.at(k) == 'B') {
count--;
}
}
}
else {
if (s.at(j) == 'R') {
if (s.at(k) == 'G') {
count--;
}
}
else if (s.at(j) == 'G') {
if (s.at(k) == 'R') {
count--;
}
}
}
}
}
}
cout << count << endl;
}
| 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::endl;
}
|
#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) > (end)))
const ll mod = 998244353;
ll n;
vector<pair<ll,ll> > vp;
ll pre[N],suf[N];
bool comp(pair<ll,ll> p1,pair<ll,ll> p2)
{
return p1.fi<p2.fi||(p1.fi==p2.fi&&p1.se<p2.se);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(ll i=0;i<n;i++)
{
ll x,y;
cin>>x>>y;
vp.emplace_back(x,y);
}
sort(vp.begin(),vp.end(),comp);
ll x1=vp[0].fi;
ll y1=vp[0].se;
pre[0]=max(0ll,y1-x1+1);
for(ll i=1;i<n;i++)
{
x1=max(x1,vp[i].fi);
y1=min(y1,vp[i].se);
pre[i]=max(0ll,y1-x1+1);
}
x1=vp[n-1].fi;
y1=vp[n-1].se;
suf[n-1]=max(suf[n-1],y1-x1+1);
for(ll i=n-2;i>=0;i--)
{
x1=max(x1,vp[i].fi);
y1=min(y1,vp[i].se);
suf[i]=max(suf[i],y1-x1+1);
}
ll ans=0;
for(ll i=0;i<n-1;i++)
{
if(pre[i]+suf[i+1]>ans)
ans=pre[i]+suf[i+1];
// cout<<pre[i]<<" "<<suf[i+1]<<endl;
}
ll xx=vp[n-1].fi;
y1;ll y2;
ll mn=1e9+6;
for(int i=0;i<n;i++)
{
if(vp[i].se<mn)
{
mn=vp[i].se;
y1=i;
}
}
mn=1e9+2;
for(int i=0;i<n;i++)
{
if(i!=y1)
if(vp[i].se<mn)
{
mn=vp[i].se;
y2=i;
}
}
for(ll i=1;i<n-1;i++)
{
ll y;
if(i!=y1)
y=vp[y1].se;
else
y=vp[y2].se;
ans=max(ans,vp[i].se-vp[i].fi+1+max(0ll,y-xx+1));
// cout<<xx<<" "<<y<<endl;
}
cout<<ans;
}
| 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;
vector<string> vec2(M);
for (int i=0; i<M; i++){
cin >> vec2.at(i);
}
int max=0;
for (int i=0; i<N; i++){
int sum=0;
for (int j=0; j<N; j++){
if (vec1.at(i)==vec1.at(j)){
sum++;
}
}
for (int k=0; k<M; k++){
if (vec1.at(i)==vec2.at(k)){
sum--;
}
}
if (sum>max){
swap(sum, max);
}
}
cout << max << endl;
}
| #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
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9+7;
const int INF = 2e9;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main(){
ll n;
cin >> n;
string a, b, c;
cin >> a >> b >> c;
ll ans = 0;
rep(i,n){
if(a[i]==b[i]&&b[i]==c[i]){
continue;
}
else if(a[i]!=b[i]&&b[i]!=c[i]&&c[i]!=a[i]){
ans += 2;
}
else{
ans++;
}
}
print(ans);
} | 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;
cin >> q;
for(int i = 0; i != q; ++i){
process_command(cin, str);
}
}
void process_command(istream &istr, string &str){
string command;
istr >> command;
if (command == "print"){
int a, b;
istr >> a >> b;
my_print(str, a, b);
}else if (command == "reverse"){
int a, b;
istr >> a >> b;
my_reverse(str, a, b);
}else if (command == "replace"){
int a, b;
string p;
istr >> a >> b >> p;
my_replace(str, a, b, p);
}else {
cout << "Unexpected command encountered! " << command << endl;
}
}
void my_print(const string &str, int a, int b){
cout << str.substr(a, b - a + 1) << endl;
}
void my_reverse(string &str, int a, int b){
while(a < b){
auto tmp = str[a];
str[a] = str[b];
str[b] = tmp;
++a;
--b;
}
}
void my_replace(string &str, int a, int b, string &p){
str.replace(a, b - a + 1, p);
} | #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.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
const int inf=1e8;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
vector<vector<char> >tmp;
vector<vector<int> >scr;
int main(){
int n,m;
while(cin>>n>>m,n||m){
vector<int>d(m);
vector<vi >cost(m,vector<int>(m));
vector<vi >tim(m,vector<int>(m));
vector<bool>used(m);
rep(i,m)rep(j,m){cost[i][j]=inf;tim[i][j]=inf;}
rep(i,n){
int a,b,c,d;
cin>>a>>b>>c>>d;
a--;b--;
cost[a][b]=cost[b][a]=c;
tim[a][b]=tim[b][a]=d;
}
cin>>n;
rep(i,n){
int a,b,c;
cin>>a>>b>>c;
a--;b--;
rep(j,m)d[j]=inf;
rep(j,m)used[j]=false;
if(c){
d[a]=0;
while(1){
int v=-1;
rep(j,m)if(!used[j]&&(v==-1||d[v]>d[j]))v=j;
if(v==-1)break;
used[v]=true;
rep(j,m)d[j]=min(d[j],d[v]+tim[v][j]);
}
}else{
d[a]=0;
while(1){
int v=-1;
rep(j,m)if(!used[j]&&(v==-1||d[v]>d[j]))v=j;
if(v==-1)break;
used[v]=true;
rep(j,m)d[j]=min(d[j],d[v]+cost[v][j]);
}
}
cout<<d[b]<<endl;
}
}
} | 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(int i = 0; i < n; ++i) cout << UIET[i]
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vpp vector<pair< int, int > >
#define pll pair<int , int >
#define ppll pair < pll , pll >
#define debug(n1) cout << n1 << endl
#define len(a) ((int) (a).size())
#define endl "\n"
#define mod 1000000007
const int INF=(1LL<<60)-1;
const int MAXN = 1000001;
vector<int> adj[MAXN];
int power(int x, int y, int p = mod){
int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0) {
if (y & 1) res = (res*x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int modFact(int n, int p = mod)
{
if (n >= p)
return 0;
int result = 1;
for (int i = 1; i <= n; i++)
result = (result * i) % p;
return result;
}
int32_t main(){
SPEED;
SPEED;
string s;
cin >> s;
map<char, int> fre;
for(char c : s){
fre[c]++;
}
int cnt = 0;
if(s[0] == 'A'){
int yes = 0;
for(int i = 2; i < len(s) - 1; ++i){
if(s[i] == 'C') yes++;
}
if(yes == 1){
for(char c: s){
if(c >= 97 && c <= 122) cnt++;
}
if(cnt + 2 == len(s)) cout << "AC";
else cout << "WA";
}
else cout << "WA" ;
}
else cout << "WA" ;
}
// check indices of loop
// check for overflow
| #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;
const int INF = 1e9;
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
int main()
{
cin >> S;
smatch ssmm;
if(regex_search(S,ssmm,regex("^A[a-z]+C[a-z]+$")))
{
cout << "AC";
return 0;
}
cout << "WA";
return 0;
} | 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<<60;
const int INF = 1001001001;
const int MOD = 1000000007;
/* --------------------------------------------------- */
int main() {
int n;
cin >> n;
cout << 180 * (n - 2) << endl;
return 0;
} | 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;
}
cout << ans << endl;
return 0;
} | #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 = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) cin >> a[i];
bool ok = true;
if(a[0] != 0) ok = false;
rep(i, n - 1) if(a[i] + 1 < a[i + 1]) ok = false;
if(!ok) {
cout << -1 << endl;
return 0;
}
ll ans = 0;
rep(i, n - 1) {
if(a[i + 1] - 1 == a[i])
ans++;
else
ans += a[i + 1];
}
cout << ans << endl;
} | 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"
#define DF(x) x.erase(x.begin()) // 先頭文字削除
#define ALL(x) x.begin(), x.end()
#define SZ(x) (ll) x.size()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define MAX(x, y, z) max(x, max(y, z))
#define MIN(x, y, z) min(x, min(y, z))
#define ANS cout << ans << "\n"
#define RETURN(x) \
cout << x << "\n"; \
return 0
clock_t CLOCK;
#define START_TIMER CLOCK = clock()
#define SHOW_TIMER cerr << "time: " << (ld)(clock() - CLOCK) / 1000000 << "\n"
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define LINE cerr << "[debug] line: " << __LINE__ << "\n";
#define debug(x) cerr << "[debug] " << #x << ": " << x << "\n";
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << "\n";
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using mll = map<ll, ll>;
using qll = queue<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
signed main() {
init();
string a, b, c;
cin >> a >> b >> c;
if (a.back() == b[0] && b.back() == c[0]) {
COUT("YES");
} else {
COUT("NO");
}
return 0;
} | #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 vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<long> > v2l;
const int mod = 1e+5;
const int mx = 2e+5;
const ll inf = 1e18;
void upper_bubble_sort(){
int i,j,temp,number_of_input;
int array[100];
cin >> number_of_input;
for(i=0; i<number_of_input; i++)
cin >> array[i];
for(i=0; i<number_of_input; i++){
for(j=0; j<(number_of_input-i-1); j++){
if(array[j] > array[j+1]){
temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
}
}
}
for(i=0; i<number_of_input; i++)
cout << array[i] << endl;
}
void bst(void){
int low,high,mid,keynum,num,array[100];
cin >> keynum;
low = 1;
high = num;
do{
mid = (low + high) / 2;
if(keynum < array[mid])
high = mid - 1;
else if (keynum > array[mid])
low = mid + 1;
}
while (keynum != array[mid] && low <= high);
if(keynum == array[mid]){
cout << "number located at " << mid +1 << endl;}
else
no;
}
void solvio(void){
string s,t;
cin >> s >> t;
cout << t << s << endl;
}
int main(){
booster;
solvio();
_terminated;
} | 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.