code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <iostream>
using namespace std;
int main()
{
int n;
int a, b, c;
cin >> n;
if (n == 2){
cin >> a >> b;
if (a > b){
int c = a;
a = b;
b = c;
}
for (int i = 1; i <= a; i++){
if (a % i == 0 && b % i == 0){
cout << i << "\n";
}
}
return 0;
}
cin >> a >> b >> c;
if (c < b){
int d = c;
c = b;
b = d;
}
if (b < a){
int d = a;
a = b;
b = d;
}
if (c < b){
int d = c;
c = b;
b = d;
}
for (int i = 1; i <= a; i++){
if (a % i == 0 && b % i == 0 && c % i == 0){
cout << i << endl;
}
}
return 0;
} | #include<iostream>
using namespace std;
int main() {
int n;
int data[3] = {0, 0, 0};
cin >> n;
for(int i = 0; i < n; i++) {
cin >> data[i];
}
for ( int i = 1; i <= 100000000; i++) {
if ( data[0] % i == 0 && data[1] % i == 0 && data[2] % i == 0 ) {
cout << i << endl;
}
}
return (0);
}
| 1 |
#include<iostream>
#define INF 5000000
using namespace std;
const int V=120;
int map[V][V]={INF};
int dis[V];
bool used[V];
int dijkstra(int s,int e){
fill(dis,dis+V,INF);
fill(used,used+V,false);
dis[s]=0;
while(true){
int v=-1;
for(int u=0;u<V;u++){
if(!used[u] && (v==-1 || dis[u]<dis[v]))v=u;
}
if(v==-1)break;
used[v]=true;
for(int u=0;u<V;u++){
dis[u]=min(dis[v]+map[v][u],dis[u]);
}
}
if(dis[e]!=INF)return dis[e];
else return -1;
}
int main(){
int N,K;
while(cin>>N>>K && N && K){
fill((int*)map,(int*)map+V*V,INF);
for(int loop=0;loop<K;loop++){
int check;
cin>>check;
if(check==0){
int s,e;
cin>>s>>e;
cout<<dijkstra(s,e)<<endl;
}
else {
int c,d,e;
cin>>c>>d>>e;
map[c][d]=map[d][c]=min(map[c][d],e);
}
}
}
} |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
typedef vector<int> vi;
typedef pair<int,int> pii;
int i,j;
int a[105][105];
int used[105][105];
int h,w;
void search(int y,int x,int c){
if(x<0 || y<0 || y>=h || x>=w || a[y][x]!=c)return;
if(used[y][x])return;
used[y][x]++;
int i;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
rep(i,4)
search(y+dy[i],x+dx[i],c);
return;
}
int main(void) {
while(1){
cin>>w>>h;
if(h==0 && w==0)break;
rep(i,h)rep(j,w)used[i][j]=0;
int xs,ys,xg,yg,n;
cin>>xs>>ys;
xs--;ys--;
cin>>xg>>yg;
xg--;yg--;
cin>>n;
rep(i,n){
int c,d,x,y;
cin>>c>>d>>x>>y;
x--;y--;
int p[8]={0,0,0,0,1,1,1,1};
int q[8]={0,1,2,3,0,1,2,3};
if(d)
rep(j,8)
a[y+q[j]][x+p[j]]=c;
else
rep(j,8)
a[y+p[j]][x+q[j]]=c;
}
if(a[ys][xs]==0){
cout<<"NG"<<endl;
continue;
}
search(ys,xs,a[ys][xs]);//dfs
if(used[yg][xg])
cout<<"OK"<<endl;
else
cout<<"NG"<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, q;
string s;
cin >> n >> q >> s;
s = ' ' + s; // 文字列を1オリジンで考える
n++;
vector<int> dp(n); // sの先頭からi文字目(1<=i<=n)までに含まれるACの数を記録する配列
rep(i, n) {
if (i == 0 || i == 1) dp[i] == 0;
else if (s[i-1] == 'A' && s[i] == 'C') dp[i] = dp[i-1] + 1;
else dp[i] = dp[i-1];
// cout << dp[i] << " ";
}
cout << endl;
rep(i, q) {
int l, r;
cin >> l >> r;
// int cnt = 0;
// for (int i = l; i <= r - 1; i++) {
// if (s[i] == 'A' && s[i+1] == 'C') cnt++;
// }
// cout << cnt << endl;
cout << dp[r] - dp[l] << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
const int N=100100;
int a[N],n,f[N][30],L,Q;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;++i)cin>>a[i];
cin>>L>>Q;
for(int i=1;i<=n;++i)f[i][0]=upper_bound(a+1,a+n+1,a[i]+L)-a-1;
for(int i=1;i<=20;++i)
for(int j=1;j<=n;++j)f[j][i]=f[f[j][i-1]][i-1];
for(;Q --> 0;){
int l,r;cin>>l>>r;
if(l>r)swap(l,r);
int ans=1;
for(int i=20;~i;--i)
if(f[l][i]<r)l=f[l][i],ans+=1<<i;
cout<<ans<<'\n';
}
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=5500+5,M=1500,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
int sx,sy,ex,ey;
int main(){
cin>>sx>>sy>>ex>>ey;
for(int i=0;i<ey-sy;i++) putchar('U');
for(int i=0;i<ex-sx;i++) putchar('R');
for(int i=0;i<ey-sy;i++) putchar('D');
for(int i=0;i<ex-sx;i++) putchar('L');
putchar('L');
for(int i=0;i<=ey-sy;i++) putchar('U');
for(int i=0;i<=ex-sx;i++) putchar('R');
putchar('D');
putchar('R');
for(int i=0;i<=ey-sy;i++) putchar('D');
for(int i=0;i<=ex-sx;i++) putchar('L');
putchar('U');
return 0;
} | #include <iostream>
using namespace std;
int main (void) {
int G[101][101] = {0}, sum[101] = {0}, rank[101] = {0};
int a, b, c, d;
int n;
cin >> n;
for(int i = 1; i <= n*(n-1)/2; i++) {
cin >> a >> b >> c >> d;
if(c < d) {
G[a][b] = 0; G[b][a] = 3;
} else if(c == d) {
G[a][b] = 1; G[b][a] = 1;
} else {
G[a][b] = 3; G[b][a] = 0;
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if (i == j) continue;
sum[i] += G[i][j];
}
}
//cout << sum[0] << " " << sum[1] << " " << sum[2] << " " << sum[3] << endl;
int daburi = 1;
// rankの出し方は俺が考えたアルゴリズムじゃない
for(int i = 1; i <= n; i++) {
rank[i] = 1;
for(int j = 1; j <= n; j++) {
if(sum[i] < sum[j]) rank[i]++;
}
}
for(int i = 1; i <= n; i++) {
cout << rank[i] << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
const int N = 2020;
const int mod = 1e9 + 7;
using namespace std;
int ans(int res)
{
cout << res << "\n";
exit(0);
}
int main()
{
ios_base::sync_with_stdio(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int x, y;
cin >> x >> y;
if(x <= y){
if(y <= 0) ans(y - x);
if(x <= -y) ans(-y - x + 1);
if(x < 0) ans(y + x + 1);
ans(y - x);
} else if(-x <= y){
x = -x;
if(y <= 0) ans(y - x + 1);
if(x <= -y) ans(-y - x + 2);
if(x < 0) ans(y + x + 2);
ans(y - x + 1);
} else{
int res = 0;
if(x < 0){
res = 1;
x = -x;
}
res += -y - x;
res += 1;
ans(res);
}
}
| #include <stdio.h>
int main() {
int h,w,n;
scanf("%d", &h);
scanf("%d", &w);
scanf("%d", &n);
int ctr = 0;
int total = 0;
while (n > total){
if(w >= h){
total += w;
ctr++;
}else if(h > w){
total += h;
ctr++;
}
}
printf("%d\n",ctr);
return 0;
}
| 0 |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main() {
string line;
while(cin >> line) {
for(int i = 0; i < line.size(); ++i)
if(line[i] == ',') line[i] = ' ';
istringstream is(line);
vector<int> ls(10);
int v1, v2;
for(int i = 0; i < 10; ++i) is >> ls[i];
is >> v1 >> v2;
int len = accumulate(ls.begin(), ls.end(), 0);
int pos = v1*len/(v1+v2);
int mod = v1*len%(v1+v2);
int acc = 0;
for(int i = 0; i < 10; ++i) {
acc += ls[i];
if(acc >= pos) {
if(acc > pos || (acc == pos && mod == 0)) cout << i+1 << endl;
else cout << i+2 << endl;
break;
}
}
}
return 0;
} | // 問題: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0034
#include <iostream>
#include <vector>
bool input(std::vector<int> & l, int & v1, int & v2)
{
char comma;
if (!(std::cin >> l[0])) return false;
for (int i = 1; i < 10; i++) {
std::cin >> comma >> l[i];
}
std::cin >> comma >> v1 >> comma >> v2;
return true;
}
int sum_of_length(std::vector<int> l) // 全体の道のり(距離)
{
int sum = 0;
for (std::vector<int>::size_type i = 0; i < l.size(); i++) {
sum += l[i];
}
return sum;
}
double left_length(int v1, int v2, std::vector<int> l)
{
// 全体の道のり.(ふたつの列車の走る合計の距離)
int distance = sum_of_length(l);
// ふたつの列車がすれ違った時の時間(=走る時間はふたつの列車共同じ)
double hour = static_cast<double>(distance) / (v1 + v2);
// 左の列車がどれくらいの距離を走ったか
return v1 * hour;
}
int get_sect(std::vector<int> l, const double left_length)
{
int sum = 0;
for (std::vector<int>::size_type i = 0; i < l.size(); i++) {
sum += l[i];
if (left_length <= sum) return i + 1;
}
return -1;
}
int main()
{
int v1, v2; // 左からの列車の速さ, 右からの列車の速さ
std::vector<int> l(10, 0); // 各区間の距離x10
while (input(l, v1, v2)) {
std::cout << get_sect(l, left_length(v1, v2, l)) << std::endl;
}
} | 1 |
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
int k , n;
cin >> k >> n;
if(k % n == 0)cout << 0 << endl;
else cout << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
ll powM(ll a,ll b,ll m )
{
a%=m;
ll ans=1;
while(b>0)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll c(ll a,ll b)
{
if(a==0)return b==0?1:0;
if(b>a)return 0;
ll val=1;
ll fac=1;
for(int i=1;i<=b;i++)fac*=i;
for(int i=a;i>=a-b+1;i--)val*=i;
return val/fac;
}
ll f(ll n)
{
ll ans=1LL;
while(ans<=n)ans<<=1;
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k;
cin>>n>>k;
ll ans=0;
if(n%k)ans=1;
cout<<ans<<"\n";
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.bigin(), a.end())
#define Srep(n) for(int i = 0; i < (n); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define Lrep(i,a,n) for(int i = (a); i < (n); i++)
#define Brep(n) for(int bit = 0; bit < (1<<n); bit++)
#define vi vector<int>
#define vi64 vector<int64_t>
#define vvi vector<vector<int>>
#define vvi64 vector<vector<int64_t>>
using namespace std;
int main(){
int n, m, ans = 0;
cin >> n >> m;
int Max = 1, Min = n;
Srep(m){
int l,r;
cin >> l >> r;
Max = max(l,Max);
Min = min(r,Min);
}
if(Min - Max < 0) ans = 0;
else ans = Min - Max + 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
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 (a>b) { a=b; return true; } return false; }
int main(){
int n;
cin >> n;
vector<ll> sum(n), b(n);
rep(i,n){
ll ai, bi;
cin >> ai >> bi;
sum[i] = ai + bi;
b[i] = bi;
}
sort(rall(sum));
ll sumAB = 0, sumB = 0;
rep(i,n){
if (i % 2 == 0) sumAB += sum[i];
sumB += b[i];
}
cout << sumAB-sumB << endl;
return 0;
} | 0 |
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll INF=1e15;
const int MAX_N=1<<18;
int m;
ll dat[2][2*MAX_N-1];
void init(int m_){
m=1;
while(m<m_) m*=2;
for(int i=0; i<2*m-1; i++){
dat[0][i]=INF;
dat[1][i]=INF;
}
}
void update(int i, int k, ll a){
k+=m-1;
dat[i][k]=a;
while(k>0){
k=(k-1)/2;
dat[i][k]=min(dat[i][k*2+1], dat[i][k*2+2]);
}
}
ll query(int i, int a, int b, int k, int l, int r){
if(r<=a || b<=l) return INF;
if(a<=l && r<=b){
return dat[i][k];
}else{
ll vl=query(i, a, b, k*2+1, l, (l+r)/2);
ll vr=query(i, a, b, k*2+2, (l+r)/2, r);
return min(vl, vr);
}
}
int main()
{
int n, q, a, b;
cin>>n>>q>>a>>b;
a--; b--;
init(n);
ll dp[200001];
fill(dp, dp+n, INF);
int x[200001];
for(int i=0; i<q; i++){
cin>>x[i];
x[i]--;
}
if(q==1){
cout<<min(abs(x[0]-b), abs(x[0]-a))<<endl;
return 0;
}
dp[a]=min(dp[a], (ll)abs(x[0]-b));
dp[b]=min(dp[b], (ll)abs(x[0]-a));
update(0, a, dp[a]-a);
update(1, a, dp[a]+a);
update(0, b, dp[b]-b);
update(1, b, dp[b]+b);
for(int i=1; i<q; i++){
ll mn=query(0, 0, x[i]+1, 0, 0, m)+(ll)x[i]-(ll)abs(x[i]-x[i-1]);
mn=min(query(1, x[i], n, 0, 0, m)-(ll)x[i]-(ll)abs(x[i]-x[i-1]), mn);
dp[x[i-1]]=min(dp[x[i-1]], mn);
update(0, x[i-1], dp[x[i-1]]-x[i-1]);
update(1, x[i-1], dp[x[i-1]]+x[i-1]);
}
ll s=0;
for(int i=1; i<q; i++) s+=(ll)abs(x[i]-x[i-1]);
ll ans=INF;
for(int i=0; i<n; i++){
ans=min(ans, dp[i]+s);
}
cout<<ans<<endl;
return 0;
} | //
// main.cpp
// DPu
#include <iostream>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using P=pair<int,int>;
using ll = long long;
ll dp[1<<16]={};
ll cost[1<<16]={};
int main(int argc, const char * argv[]) {
int n;
cin >>n;
ll a[n][n];
rep(i,n) rep(j,n) cin>>a[i][j];
for (int s=1; s<(1<<n); s++) {
for (int i=0; i<n; i++) {
if((s>>i)%2==0) continue;
for (int j=i+1;j<n; j++) {
if((s>>j)%2==0)continue;
cost[s]+=a[i][j];
}
}
}
for (int s=1; s<(1<<n); s++) { // 全集合
for (int t=(1<<n)-1; t>=0; --t) { // 集合Sの部分集合T
t&=s; // 部分集合tの全列挙の方法、処理はこの下に書く
// https://primenumber.hatenadiary.jp/entry/2016/12/01/000000
dp[s]=max(dp[s],dp[s-t]+cost[t]);
}
}
cout<<dp[(1<<n)-1]<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define ss second
#define ff first
#define pb push_back
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL);
ll e[mx], w[mx];
int main() {
FIO;
ll n;
cin >> n;
string s;
cin >> s;
ll cnt = 0;
for (ll i = 0; i < n; i++) {
if(s[i] == 'W') {
cnt++;
}
w[i+1] = cnt;
}
cnt = 0;
for (ll i = n - 1; i >= 0; i--) {
if(s[i] == 'E') {
cnt++;
}
e[i+1] = cnt;
}
ll ans = INT_MAX;
for (ll i = 1; i <= n; i++) {
ans = min(ans, w[i-1]+e[i+1]);
}
cout << ans << endl;
}
| #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int mod=1e9+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
string k;
cin>>k;
int d;
cin>>d;
//dp[0][0]=1;
vector< vector<int> >dp(d,vector<int>(2));
dp[0][0]=1;
// dp[0][1]=1;
int n=k.length();
for(int i=0;i<n;i++)
{
// cout<<"s";
vector< vector<int> >new_dp(d,vector<int>(2));
for(int sum=0;sum<d;sum++)
{
//cout<<"x";
for(bool j:{false,true})
{
for(int digit=0;digit<10;digit++)
{
if(digit>k[i]-'0'&& !j)
{
break;
}
new_dp[(sum+digit)%d][j||(digit< k[i]-'0')]=(new_dp[(sum+digit)%d][j||(digit< k[i]-'0')]+dp[sum][j])%mod;
}
}
}
dp=new_dp;
}
int ans=(dp[0][false]+dp[0][true])%mod;
ans--;
if(ans==-1)
{ans=mod-1;
}
cout<<ans;
return 0;
} | 0 |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans=2e9;
for(int i=0;i<n;i++){
int cnt=0;
while(a[i]%2==0){
cnt++;
a[i]/=2;
}
ans=min(cnt,ans);
}
cout<<ans<<endl;
return 0;
} | #include <vector>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m = 1e9;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m = min(__builtin_ctz(a), m);
}
cout << m << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }
#define debug(...) do {cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)
#else
#define dump(...)
#define debug(...)
#endif
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
const ll LINF = 1LL << 60;
const int INF = 1001001001;
/////////////////////////////////////////////////////////////////////
int main() {
ll n,k; cin>>n>>k;
cout << n-k+1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
int X;
X = N-(K-1);
cout<<X<<endl;
}
| 1 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; }
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
ll calc(ll x){
ll res = 1;
while(x%2 == 0){
x /= 2;
res *= 2;
}
while(x%5 == 0){
x /= 5;
res *= 5;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
map<P, ll> mp;
rep(i,n){
string s;
cin >> s;
ll a = 0, b = 1;
bool f = false;
for(char c : s){
if(c == '.'){
f = true;
continue;
}
a = a * 10 + (c - '0');
if(f) b *= 10;
}
ll g = gcd(a, b);
a /= g;
a = calc(a);
b /= g;
b = calc(b);
++mp[P(a, b)];
}
vector<P> v;
v.reserve(mp.size());
for(auto& p : mp){
v.push_back(p.first);
}
int sz = v.size();
ll ans = 0;
rep(i,sz){
P p1 = v[i];
rep(j,i+1){
P p2 = v[j];
if(p2.first % p1.second == 0 && p1.first % p2.second == 0){
ll tmp = mp[p1] * mp[p2];
if(i == j){
tmp -= mp[p1];
tmp /= 2;
}
ans += tmp;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2005;
#define int long long
int gcd(int x, int y) {
return (!y) ? x : gcd(y, x % y);
}
int lcm(int x, int y) {
return x / gcd(x, y) * y;
}
int n, A[N][N], pr[N], cnt;
bitset <100005> isp;
void prework(int tot) {
for(int i = 1; i < 100005; ++ i) isp[i] = 1;
isp[1] = 0;
for(int i = 1; cnt < tot; ++ i) {
if(isp[i]) pr[++ cnt] = i;
for(int j = 1; j <= cnt && pr[j] * i <= 100000; ++ j) {
isp[i * pr[j]] = 0;
if(i % pr[j] == 0) {
break;
}
}
}
}
main() {
isp = 0;
cin >> n;
n += 2;
prework(n * 2 + 2);
//for(int i =1; i <= cnt; ++ i) cerr << pr[i] << " ";
//puts("");
for(int i = 0; i <= n + 1; ++ i) {
for(int j = 0; j <= n + 1; ++ j) {
A[i][j] = 1;
}
}
int now = 0;
for(int i = 1; i <= n; i += 2) {
int nx = i, ny = 1;
int G = pr[++ now];
while(nx <= n && ny <= n) {
A[nx][ny] *= G;
++ nx, ++ ny;
}
}
for(int i = 3; i <= n; i += 2) {
int nx = 1, ny = i;
int G = pr[++ now];
while(nx <= n && ny <= n) {
A[nx][ny] *= G;
++ nx, ++ ny;
}
}
for(int i = n; i >= 1; i -= 2) {
int nx = n, ny = i;
int G = pr[++ now];
while(nx && ny <= n) {
A[nx][ny] *= G;
-- nx, ++ ny;
}
}
for(int i = n - ((n & 1) ^ 1); i >= 1; i -= 2) {
int nx = i, ny = 1;
if(i == n) continue;
int G = pr[++ now];
while(nx && ny <= n) {
A[nx][ny] *= G;
-- nx, ++ ny;
}
}
for(int i = 1; i <= n; ++ i) {
for(int j = 1; j <= n; ++ j) {
if((i + j) & 1) {
//cerr << i <<" " << j << endl;
//cerr << A[i][j - 1] <<" " << A[i - 1][j] <<" " << A[i + 1][j] <<" " << A[i][j + 1] << endl;
A[i][j] = lcm(lcm(A[i][j - 1], A[i - 1][j]), lcm(A[i + 1][j], A[i][j + 1])) + 1;
}
}
}
for(int i = 2; i <= n - 1; ++ i) {
for(int j = 2; j <= n - 1; ++ j) {
printf("%lld", A[i][j]);
if(j != n - 1) putchar(' ');
//assert(max(A[i][j], A[i - 1][j]) % min(A[i][j], A[i - 1][j]) == 0);
//assert(max(A[i][j], A[i][j - 1]) % min(A[i][j], A[i][j - 1]) == 0);
}
puts("");
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll>P;
int main(){
ll N;
cin>>N;
vector<P>Sup;
vector<P>Sdown;
rep(i,N){
string s;
cin>>s;
ll total=0,mini=0;
rep(j,s.size()){
if(s[j]=='('){total++;}
else{total--;}
mini=min(mini,total);
}
if(total>=0){Sup.push_back(P(mini,total));}
else{Sdown.push_back(P(mini-total,-total));}
}
sort(Sup.begin(),Sup.end());
reverse(Sup.begin(),Sup.end());
sort(Sdown.begin(),Sdown.end());
reverse(Sdown.begin(),Sdown.end());
int flag=0;
ll sum1=0;
ll sum2=0;
rep(i,Sup.size()){
if(Sup[i].first<0&&sum1+Sup[i].first<0){flag=1;}
else{sum1+=Sup[i].second;}
if(sum1<0){flag=1;}
}
rep(i,Sdown.size()){
if(Sdown[i].first<0&&sum2+Sdown[i].first<0){flag=1;}
else{sum2+=Sdown[i].second;}
if(sum2<0){flag=1;}
}
if(sum1!=sum2){flag=1;}
if(flag==1){cout<<"No";}
if(flag==0){cout<<"Yes";}
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Graph=vector<vector<int>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
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;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,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;}
int main(){
ll N,ans=0;
cin>>N;
ll A[N],B[N];
// A[i] S[i]の最小値
// B[i] S[i]の値
REP(i,N){
A[i]=0;
B[i]=0;
}
string S[N];
REP(i,N) cin>>S[i];
REP(i,N){
ll cnt=0;
REP(j,S[i].size()){
if(S[i].at(j)=='(') cnt++;
else cnt--;
chmin(A[i],cnt);
}
B[i]=cnt;
}
vector<pair<int,int>> L,LL,LLL;
bool CAN=true;
REP(i,N){
if(B[i]>0){
if(A[i]>=0ll) L.PB(MP(A[i],B[i]));
else LL.PB(MP(A[i],B[i]));
}
else LLL.PB(MP(B[i]-A[i],A[i]));
}
SORT(L);
REVERSE(L);
SORT(LL);
REVERSE(LL);
SORT(LLL);
REVERSE(LLL);
REP(i,L.size()){
if(ans+L[i].first<0) CAN=false;
ans+=L[i].second;
}
REP(i,LL.size()){
if(ans+LL[i].first<0) CAN=false;
ans+=LL[i].second;
}
REP(i,LLL.size()){
if(ans+LLL[i].second<0) CAN=false;
ans+=LLL[i].first+LLL[i].second;
}
if(ans!=0) CAN=false;
if(CAN) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void abc_160a();
void abc_161a();
void abc_162a();
void abc_163a();
void abc_164a();
void abc_165a();
void abc_166a();
void abc_167a();
void abc_168a();
void abc_169();
int main()
{
//abc_160a();
//abc_161a();
//abc_162a();
//abc_163a();
//abc_164a();
//abc_165a();
//abc_166a();
//abc_167a();
//abc_168a();
abc_169();
}
void abc_160a()
{
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5]) cout << "Yes\n";
else cout << "No\n";
}
void swap(int& a, int& b)
{
int tmp;
tmp = a;
a = b;
b = tmp;
}
void abc_161a()
{
int x, y, z;
cin >> x >> y >> z;
swap(x, y);
swap(x, z);
cout << x << " " << y << " " << z << "\n";
}
void abc_162a()
{
string s;
cin >> s;
for (char c : s)
{
if (c == '7')
{
cout << "Yes\n";
return;
}
}
cout << "No\n";
}
void abc_163a()
{
int R;
cin >> R;
cout << (double)(2 * R * M_PI);
}
void abc_164a()
{
int s, w;
cin >> s >> w;
if (s <= w) cout << "unsafe\n";
else cout << "safe\n";
}
void abc_165a()
{
int k, a, b;
cin >> k >> a >> b;
for (int i = a; i <= b; ++i)
{
if (i % k == 0)
{
cout << "OK\n";
return;
}
}
cout << "NG\n";
}
void abc_166a()
{
string s;
cin >> s;
if (s == "ABC") cout << "ARC\n";
if (s == "ARC") cout << "ABC\n";
}
void abc_167a()
{
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); ++i)
{
if (s[i] != t[i])
{
cout << "No\n";
return;
}
}
if ('a' <= t[t.size() - 1] && t[t.size() - 1] <= 'z') cout << "Yes\n";
else cout << "No\n";
}
void abc_168a()
{
string s;
cin >> s;
if (s[s.size() - 1] == '3') cout << "bon\n";
else if (s[s.size() - 1] == '0' ||
s[s.size() - 1] == '1' ||
s[s.size() - 1] == '6' ||
s[s.size() - 1] == '8') cout << "pon\n";
else cout << "hon\n";
}
void abc_169()
{
int a, b;
cin >> a >> b;
cout << a * b << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
void YN(bool flg){if(flg) cout << "YES" << endl; else cout << "NO" << endl;}
void Yn(bool flg){if(flg) cout << "Yes" << endl; else cout << "No" << endl;}
void yn(bool flg){if(flg) cout << "yes" << endl; else cout << "no" << endl;}
int main()
{
int a, b;
cin >> a >> b;
cout << a * b << endl;
return 0;
}
| 1 |
#include<stdio.h>
int main(){
int x,y = 0;
scanf("%d", &x);
y = x * x * x;
printf("%d\n", y);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int64_t n;
string s = "";
cin >> n;
while(n!=0)
{
n--;
s += 'a' + n % 26;
n /= 26;
}
reverse(s.begin(), s.end());
cout << s << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
bool check(int a,int b,int c)
{
if((a+b)>c && (c+b)>a && (a+c)>b)
return true;
return false;
}
int main()
{
// freopen("input01.txt", "r", stdin);
// freopen("output01.txt", "w", stdout);
int n;
cin>>n;
map<ll int,int> mp;
ll int a;
int l,ct=0;
for(l=0;l<n;l++)
{
cin>>a;
mp[a]++;
}
if(mp.size()<3)
{
cout<<0;
return 0;
}
for(auto i=mp.begin();next(next(i))!=mp.end();i++)
{
for(auto j=next(i);next(j)!=mp.end();j++)
{
for(auto k=next(j);k!=mp.end();k++)
{
if(check(i->first,j->first,k->first))
ct+=(i->second*j->second*k->second);
}
}
}
cout<<ct;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
int res=0;
for(int i=0;i<n-2;i++)
{
for(int j=i+1;j<n-1;j++)
{
for(int k=j+1;k<n;k++)
{
if(a[i]==a[j] || a[j]==a[k])
continue;
if(a[i]+a[j]>a[k] && a[i]+a[k]>a[j] && a[j]+a[k]>a[i])
res++;
}
}
}
cout<<res<<endl;
} | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A + B + C - max({A, B, C}) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll int64_t
#define rep(i,n) for(int64_t i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr int64_t INF=(1ll<<60);
constexpr int64_t mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
Graph G;
ll n;
void bfs(vector<ll> &dist,queue<ll> que,ll start){
vector<bool> visit(n,false);
que.push(start);
while(!que.empty()){
ll now=que.front();
que.pop();
visit[now]=true;
for(ll next:G[now]){
if(visit[next]==true) continue;
visit[next]=true;
que.push(next);
dist[next]=dist[now]+1;
}
}
return;
}
int main(){
ll u,v;cin>>n>>u>>v;
u--;v--;
G.resize(n);
rep(i,n-1){
ll a,b;cin>>a>>b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
queue<ll> que;
vector<ll> takahashi(n),aoki(n);
bfs(takahashi,que,u);
bfs(aoki,que,v);
ll ans=0,key=0;
rep(i,n){
if(aoki[i]>takahashi[i]){
chmax(ans,aoki[i]);
}
}
ans--;
cout<<ans<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
const ll mod=1e9+7;
const int N=1e5+1;
ll dp[N][101][2],d,n;
string s;
ll go(ll pos, ll k, ll mx){
if(pos==n){
if(k==0) return 1;
else return 0;
}
if(dp[pos][k][mx]!=-1)
return dp[pos][k][mx];
ll ans=0,lim=s[pos]-'0';
if(mx==0) lim=9;
for(int i=0;i<lim;i++)
ans=(ans+go(pos+1,(k+i)%d,0))%mod;
if(mx==1) ans=(ans+go(pos+1,(k+lim)%d,1))%mod;
else ans=(ans+go(pos+1,(k+lim)%d,0))%mod;
return dp[pos][k][mx]=ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll T=clock();
cin>>s;
cin>>d;
n=s.size();
memset(dp,-1,sizeof(dp));
cout<<(go(0,0,1)-1+mod)%mod;
cerr<<"\n\nTIME: "<<(double)(clock()-T)/CLOCKS_PER_SEC<<" sec\n";
T = clock();
return 0;
} | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M;
int64_t result = 1;
for (int64_t d = 1; d * d <= M; ++d) {
if (M % d == 0 && M / d >= N) {
result = max(result, d);
}
if (M % d == 0 && d >= N) {
result = max(result, M / d);
}
}
cout << result << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll mod = 1e9+7;
void chmod(ll &M){
if(M >= mod) M %= mod;
else if(M < 0){
M += (abs(M)/mod + 1)*mod;
M %= mod;
}
}
ll modpow(ll x, ll n){
if(n==0) return 1;
ll res=modpow(x, n/2);
if(n%2==0) return res*res%mod;
else return res*res%mod*x%mod;
}
int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
using namespace std;
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/*int main()
{
double D, T, S;
cin >> D >> T >> S;
if (T >= D/S) cout << "Yes" << endl;
else cout << "No" << endl;
}*/
int main()
{
int N, X, T;
cin >> N >> X >> T;
int ans = 0, sum = 0;
while (N > sum)
{
ans += T;
sum += X;
// cout << ans << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b%a, a);
}
int lcm(int a, int b) {
return (a*b)/gcd(a,b);
}
ll pow(ll x, ll y, ll p) {
if(y == 0) return 1;
ll res = 1;
x %= p;
if(x == 0) return 0LL;
while(y > 0) {
if(y & 1) res = (res*x) % p;
y >>= 1;
x = (x*x) % p;
}
return res;
}
int find(int x) {
return x == parent[x] ? x : parent[x] = find(parent[x]);
}
void Union(int x, int y) {
int xPar = find(x), yPar = find(y);
if(xPar != yPar) parent[xPar] = yPar;
}
ll nCr(ll n, ll r) {
ll res = 1;
for(ll i=1;i<=r;i++) {
res = res * (n - r + i) / i;
// is different from
// res *= (n -r + i) / i;
}
return res;
}
int ask(int i, int j) {
cout << "? " << i + 1 << ' ' << j + 1 << endl;
int v;
cin >> v;
return v;
}
void solve() {
int n, x, t;
cin >> n >> x >> t;
cout << (int)(ceil)(n / (double)x) * t << endl;
return;
}
int main()
{
IOS
//int t;
//cin >> t;
//while(t--)
solve();
return 0;
} | 1 |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <tuple>
#include <cstring>
#include <map>
#include <iomanip>
#include <ctime>
#include <complex>
#include <cassert>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define _ << " " <<
#define all(X) (X).begin(), (X).end()
#define len(X) (X).size()
#define Pii pair<int, int>
#define Pll pair<ll, ll>
#define Tiii tuple<int, int, int>
#define Tlll tuple<ll, ll, ll>
bool dual = 1;
int d[100020] = {};
vector<int> G[100010];
vector<bool> vis;
void dfs(int k, int dep) {
vis[k] = 1;
if (d[k] == 0) {
if (dep % 2) d[k] = 1;
else d[k] = 2;
}
for (auto &i : G[k]) {
if (!vis[i]) {
dfs(i, dep + 1);
}
else if (d[i] % 2 == dep % 2) {
dual = 0;
return;
}
}
}
int main() {
ll n, m;
cin >> n >> m;
int x[m], y[m];
vis.assign(n, 0);
for (int i = 0; i < m; i++) {
cin >> x[i] >> y[i];
x[i]--; y[i]--;
G[x[i]].push_back(y[i]);
G[y[i]].push_back(x[i]);
}
dfs(0, 0);
if (dual) {
ll p = 0, q = 0;
for (int i = 0; i < n; i++) {
if (d[i] == 1) p++;
else q++;
}
ll ans = p * q;
for (int i = 0; i < m; i++) {
if (d[x[i]] != d[y[i]]) ans--;
}
cout << ans << endl;
}
else {
cerr << 0 << endl;
cout << n * (n - 1) / 2 - m << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl #define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl #define no cout<<"no"<<endl
#define vec(a,y,x) vector<vector<char>> a (y,vector<char>(x))
const vector<int> dx={1,0,-1,0};
const vector<int> dy={0,1,0,-1};
in sum_vec(vector<int> a){
in sum=0;
rep(i,a.size())
sum+=a.at(i);
return sum;
}
vector<int> color;
bool dfs (vector<vector<int>>&G,int v,int cur){
color.at(v)=cur;
for(int next_v : G.at(v)){
//cout<<"v:"<<v<<" next_v:"<<next_v<<" ";
if(color.at(next_v)==-1){
//cout<<"未探索"<<endl;
if(!dfs(G,next_v,1-cur)) return false;
}
else{
if(color.at(next_v)==cur) {/*cout<<"矛盾"<<endl;*/ return false;}
if(color.at(next_v)==1-cur){/*cout<<"矛盾無し"<<endl;*/ continue;}
}
}
return true;
}
int main(){
in m;
in n;
cin>>n>>m;
vector<vector<int>> G(n);
rep(i,m){
int a,b;
cin>>a>>b;
G.at(a-1).push_back(b-1);
G.at(b-1).push_back(a-1);
}
color.assign(n,-1);
in sum;
if(dfs(G,0,0)){
sum=sum_vec(color);
printf("%ld \n",sum*(n-sum)-m);
}
else
printf("%ld \n",(n*(n-1))/2-m);
//color.assign(n,-1);
//cout<<dfs(G,0,0)<<endl;
//cout<<sum<<endl;
//rep(i,n)
//cout<<color.at(i);
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,ans=0,a,b;
int main()
{
cin>>n;
cin>>a;
for(int i=1;i<=n-1;i++)
{
cin>>b;
if(b<a) ans+=a-b;
else a=b;
}
cout<<ans;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n) ;i++)
using namespace std;
using p=pair<int,int>;
typedef long long ll;
int main() {
int n,r;
cin >> n >> r;
int ans=0;
if(n<=9){
ans=r+100*(10-n);
}
else{
ans=r;
}
cout << ans << endl;
return 0;
}
| 0 |
#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) < (long long)(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(0);
int N;
cin >> N;
long long L[N], R[N];
for (int i = 0; i < N; i++) cin >> L[i] >> R[i];
int idx[N];
iota(idx, idx + N, 0);
// debugArray(idx, N);
auto step = [&]() {
long long leftl[N + 1], leftr[N + 1], rightl[N + 1], rightr[N + 1];
leftl[0] = 0, leftr[0] = INT_MAX;
for (int i = 0; i < N; i++) {
int j = idx[i];
leftl[i + 1] = max(leftl[i], L[j]);
leftr[i + 1] = min(leftr[i], R[j]);
}
rightl[N] = 0, rightr[N] = INT_MAX;
for (int i = N - 1; i >= 0; i--) {
int j = idx[i];
rightl[i] = max(rightl[i + 1], L[j]);
rightr[i] = min(rightr[i + 1], R[j]);
}
// debugArray(leftl, N + 1);
// debugArray(leftr, N + 1);
// debugArray(rightl, N + 1);
// debugArray(rightr, N + 1);
long long ret = 0;
for (int i = 0; i < N - 1; i++) {
ret = max(ret, max(0ll, leftr[i + 1] - leftl[i + 1] + 1)
+ max(0ll, rightr[i + 1] - rightl[i + 1] + 1));
}
for (int i = 0; i < N; i++) {
int j = idx[i];
int ll = max(leftl[i], rightl[i + 1]);
int rr = min(leftr[i], rightr[i + 1]);
ret = max(ret, max(0, rr - ll + 1) + R[j] - L[j] + 1);
}
return ret;
};
long long ans = 0;
sort(idx, idx + N,
[&](int l, int r) { return L[l] == L[r] ? R[l] > R[r] : L[l] < L[r]; });
ans = max(ans, step());
sort(idx, idx + N,
[&](int l, int r) { return R[l] == R[r] ? L[l] > L[r] : R[l] < R[r]; });
ans = max(ans, step());
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b); i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a-1)
#define trav(x, a) for (auto& x: a)
const int MX = 2e5+5;
const int MOD = 1e9+7;
const ll INF = 1061109567; // 4557430888798830399LL
const ld EPS = 1e-9;
const ld PI = acos(-1);
ll arr[18][18],dp[1<<18],cost[1<<18];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int N; cin >> N;
F0R(i,N) F0R(j,N) {
cin >> arr[i][j];
}
memset(dp,-1,sizeof dp);
F0R(i,N) dp[i] = 0;
F0R(mask,1<<N) {
F0R(i,N) {
FOR(j,i+1,N) {
if (mask&(1<<i) && mask&(1<<j)) {
cost[mask] += arr[i][j];
}
}
}
}
F0R(mask,1<<N) {
for (int smask = mask; smask; smask = (smask-1)&mask) {
dp[mask] = max(dp[mask],dp[mask^smask]+cost[smask]);
}
}
cout << dp[(1<<N)-1] << "\n";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
int main(void){
int n;
cin>>n;
int ans=0;
int a;
set<int> s;
while(n--){
cin>>a;
auto itr=s.lower_bound(a);
if(a==(*itr)){
ans--;
s.erase(a);
}else{
ans++;
s.insert(a);
}
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<int, int> mp;
for(int i = 0; i < n; i++) {
int foo;
cin >> foo;
mp[foo]++;
}
int ans = 0;
for(auto p : mp) {
if(p.second & 1) ans++;
}
cout << ans << endl;
} | 1 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int s[501],q[1001][5];
int main()
{
int i,j,n,m,a,b,c;
while(cin>>a>>b>>c)
{
if(a==0&&b==0&&c==0)break;
cin>>n;
for(i=1;i<=500;i++)s[i]=2;
for(i=1;i<=n;i++)
{
for(j=1;j<=4;j++)
{
cin>>q[i][j];
}
if(q[i][4]==1)
{
s[q[i][1]]=1;
s[q[i][2]]=1;
s[q[i][3]]=1;
}
}
for(i=1;i<=n;i++)
{
if(s[q[i][1]]==1&&s[q[i][2]]==1&&q[i][4]==0)s[q[i][3]]=0;
else if(s[q[i][1]]==1&&s[q[i][3]]==1&&q[i][4]==0)s[q[i][2]]=0;
else if(s[q[i][3]]==1&&s[q[i][2]]==1&&q[i][4]==0)s[q[i][1]]=0;
}
for(i=1;i<=a+b+c;i++)
{
cout<<s[i]<<endl;
}
}
return 0;
} | #include<iostream>
#include<cstring>
using namespace std;
int main(){
int n,m,x[10001],y[10001],c;
bool tomo[600][600],party[600][2];
while(true){
memset(tomo,false,sizeof(tomo));
memset(party,false,sizeof(party));
cin>>n;
cin>>m;
c=0;
if(n==0 && m==0){
break;
}
for(int i=0;i<m;i++){
cin>>x[i]>>y[i];
tomo[x[i]][y[i]]=true;
tomo[y[i]][x[i]]=true;
}
for(int i=2;i<=n;i++){
if(tomo[1][i]==true){
party[i][0]=true;
}
}
for(int i=2;i<=n;i++){
if(party[i][0]==true){
for(int j=2;j<=n;j++){
if(tomo[i][j]==true){
party[j][1]=true;
}
}
}
}
for(int i=2;i<=n;i++){
if(party[i][0]==true || party[i][1]==true){
c++;
}
}
cout<<c<<endl;
}
return 0;
} | 0 |
# include<bits/stdc++.h>
using namespace std;
# define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
# define S second
# define F first
# define kill(x) return(cout << x << endl, 0)
# define debug(x) cerr<< #x << " : " << x << endl
# define ddebug(x, y) cerr<< #x << " : " << x << ", " << #y << " : " << y << endl
# define sz(s) (int)s.size()
# define sq(x) (x) * (x)
# define PB(x) push_back(x)
# define smax(x, y) (x) = max((x), (y))
# define smin(x, y) (x) = min((x), (y))
# define all(x) x.begin(), x.end()
# define SP fixed << setprecision(10)
const int MAXN = 2000 + 10;
int cnt[MAXN][MAXN], a1[MAXN][MAXN], a2[MAXN][MAXN];
string s[MAXN];
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, m, q;
cin >> n >> m >> q;
for (int i = 0; i < n; i ++)
cin >> s[i];
for (int i = 0; i < n; i ++)
for (int j = 0; j < m; j ++)
cnt[i + 1][j + 1] = cnt[i + 1][j] + cnt[i][j + 1] - cnt[i][j] + (s[i][j] - '0');
for (int i = 0; i < n; i ++)
for (int j = 1; j < m; j ++)
a1[i + 1][j + 1] = a1[i + 1][j] + a1[i][j + 1] - a1[i][j] + (s[i][j] == '1' && s[i][j - 1] == '1');
for (int i = 1; i < n; i ++)
for (int j = 0; j < m; j ++)
a2[i + 1][j + 1] = a2[i + 1][j] + a2[i][j + 1] - a2[i][j] + (s[i][j] == '1' && s[i - 1][j] == '1');
while (q --)
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << (cnt[x2][y2] - (cnt[x2][y1 - 1] + cnt[x1 - 1][y2] - cnt[x1 - 1][y1 - 1])) -
((a1[x2][y2] - (a1[x2][y1] + a1[x1 - 1][y2] - a1[x1 - 1][y1])) +
(a2[x2][y2] - (a2[x1][y2] + a2[x2][y1 - 1] - a2[x1][y1 - 1]))) << endl;
}
return 0;
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
#define double long double
typedef pair<double, string> P;
bool solve(){
int n;
string name;
int p, a, b, c, d, e, f, s, m;
P data[50];
cin >> n;
if( n == 0 ) return false;
for( int i = 0; i < n; i++ ){
cin >> name >> p >> a >> b >> c >> d >> e >> f >> s >> m;
int income = s * f * m - p;
int timer = a + b + c + m * (d + e);
double effect = (double)income / timer;
data[i].first = -effect; //Swap Order Technic.
data[i].second = name;
}
sort(data, data + n);
for( int i = 0; i < n; i++ ){
cout << data[i].second << endl;
}
}
int main(){
while(1){
if( !solve() )
break;
else
cout << "#" << endl;
}
return 0;
} | 0 |
// J'aime
// Chemise Blanche
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int a, b;
cin >> a >> b;
cout << max(max(a + b, a - b), a * b) << '\n';
}
signed main() {
#ifdef _DEBUG
// freopen("in" , "r", stdin );
// freopen("out", "w", stdout);
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) MAIN();
}
| #include <iostream>
#include <vector>
using namespace std;
int main(){
int N, M; cin >> N >> M;
vector<vector<long long>> dp(3*N+1, vector<long long>(N+1, 0));
dp[3*N][0] = 1;
for(int i=3*N;i>0;i--){
for(int j=0;j<=N;j++){
long long m = 1;
for(int k=1;k<=3;k++){
if(i-k < 0) break;
if(j+k/2 > N) break;
dp[i-k][j+k/2] += dp[i][j] * m;
dp[i-k][j+k/2] %= M;
m = m * (i-k) % M;
}
}
}
long long res = 0;
for(int i=0;i<=N;i++) res = (res + dp[0][i]) % M;
cout << res << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int n,r,ans;
int main()
{
scanf("%d%d",&n,&r);
if(n<10){
ans=r+100*(10-n);
printf("%d",ans);
}else{
ans=r;
printf("%d",ans);
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
void abc_150a();
void abc_151a();
void abc_152a();
void abc_154a();
void abc_156a();
int main()
{
//abc_150a();
//abc_151a();
//abc_152a();
//abc_154a();
abc_156a();
}
void abc_150a()
{
int K, X;
cin >> K >> X;
if (500 * K >= X) cout << "Yes\n";
else cout << "No\n";
}
void abc_151a()
{
char C;
cin >> C;
cout << (char)((int)C + 1) << "\n";
}
void abc_152a()
{
int N, M;
cin >> N >> M;
if (N == M) cout << "Yes\n";
else cout << "No\n";
}
void abc_154a()
{
string S, T;
cin >> S >> T;
int a, b;
cin >> a >> b;
string U;
cin >> U;
if (S == U) cout << a - 1 << " " << b << "\n";
else cout << a << " " << b - 1 << "\n";
}
void abc_156a()
{
int N, R;
cin >> N >> R;
if (N >= 10) cout << R << "\n";
else cout << R + 100 * (10 - N) << "\n";
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int n,t,a[505050],tr[505050],ans[505050],lt[505050];
vector<int>q[505050],qq[505050];
void gx(int x,int vl)
{
while(x<=n)
{
tr[x]+=vl;
x+=x&(-x);
}
}
int sm(int x)
{
int rt=0;
while(x>0)
{
rt+=tr[x];
x-=x&(-x);
}
return rt;
}
int main()
{
cin>>n>>t;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=t;i++)
{
int l,r;
cin>>l>>r;
q[r].push_back(l);
qq[r].push_back(i);
}
for(int i=1;i<=n;i++)
{
if(lt[a[i]]!=0)
{
gx(lt[a[i]],-1);
}
lt[a[i]]=i;
gx(i,1);
for(int j=0;j<q[i].size();j++)
{
ans[qq[i][j]]=sm(i)-sm(q[i][j]-1);
}
}
for(int i=1;i<=t;i++)
{
cout<<ans[i]<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 10;
const int MAX_NODE_CNT = MAXN << 6;
int n, m, lst[MAXN];
struct Persistent_Segment_Tree {
#define mid ((l + r) >> 1)
#define ls(_) t[_].ls
#define rs(_) t[_].rs
#define lq(_) t[_].ls, l, mid
#define rq(_) t[_].rs, mid + 1, r
int node_cnt, rt[MAXN];
int& operator [](const int& x) { return rt[x]; }
struct node { int ls, rs, data; } t[MAX_NODE_CNT];
int build(int l, int r) {
int cur = ++node_cnt;
if (l == r) return cur;
ls(cur) = build(l, mid), rs(cur) = build(mid + 1, r);
return cur;
}
int modify(int pre, int l, int r, int pos, int val) {
int cur = ++node_cnt; t[cur] = t[pre], t[cur].data += val;
if (l == r) { return cur; }
if (pos <= mid) ls(cur) = modify(ls(pre), l, mid, pos, val);
else rs(cur) = modify(rs(pre), mid + 1, r, pos, val);
return cur;
}
int query(int cur, int l, int r, int ql, int qr) {
if (ql <= l && r <= qr) return t[cur].data;
int ret = 0;
if (ql <= mid) ret += query(lq(cur), ql, qr);
if (qr > mid) ret += query(rq(cur), ql, qr);
return ret;
}
} t;
int main() {
scanf("%d %d", &n, &m);
t[0] = t.build(1, n);
for (int i = 1, x; i <= n; ++i) {
scanf("%d", &x); t[i] = t.modify(t[i - 1], 1, n, i, 1);
if (lst[x]) t[i] = t.modify(t[i], 1, n, lst[x], -1);
lst[x] = i;
}
int pre_ans = 0;
for (int i = 1, u, v; i <= m; ++i) {
scanf("%d %d", &u, &v);
printf("%d\n", (t.query(t[v], 1, n, u, v)));
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,ans;
while(cin >> a >> b >> c >> d){
ans = 0;
ans+=min(a,b);
ans+=min(c,d);
cout << ans << endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int i,n,a[5],b[5];
n=2;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0;i<n;i++)
{
cin>>b[i];
}
sort(a,a+n);
sort(b,b+n);
cout<<a[0]+b[0]<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
ll x,y;
cin >> x >> y;
ll ans;
// 1回目に符号を反転させる場合
ll A = 1 + y - (-x);
// 最後に符号を反転させる場合
ll B = (-y) - x + 1;
// 最初と最後に符号を反転させる場合
ll C = 2 + (-y) - (-x);
// 反転させない場合
ll D = y - x;
if(A<0) A = INF;
if(B<0) B = INF;
if(C<0) C = INF;
if(D<0) D = INF;
ans = min(min(A,B),min(C,D));
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include <random>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
#define dame { puts("-1"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,vector<T>,greater<T> >
#define bn(x) ((1<<x)-1)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(vector<T>&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const int MX = 100005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;
int main() {
int a,b;
scanf("%d%d",&a,&b);
if (a == b) {
cout<<0<<endl;
return 0;
}
if (abs(a) == abs(b)) {
cout<<1<<endl;
return 0;
}
if (abs(a) < abs(b)) {
int ans = abs(b)-abs(a);
if (a < 0) ans++;
if (b < 0) ans++;
cout<<ans<<endl;
return 0;
} else {
int ans = abs(a)-abs(b);
if (a > 0) ans++;
if (b > 0) ans++;
cout<<ans<<endl;
return 0;
}
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if (a<b){
int tmp =a;
a=b;b=tmp;
}
int ans = a;
a--;
if (a<b){
int tmp =a;
a=b;b=tmp;
}
ans+=a;
cout<<ans;
}
| #include "iostream"
using namespace std;
int main(){
int a; int b;
cin>>a>>b;
if(a==b){
cout<<2*a<<endl;
}
else if(a>b){
cout<<a+(a-1)<<endl;
}
else{
cout<<b+(b-1)<<endl;
}
}
| 1 |
#include <bits/stdc++.h> //万能头文件
using namespace std;
int main()
{
string a;
int pos=0; //记录位置
cin>>a;
a=a+"D"; //为防止最后一个字母是"A",添加一个不是"C"的字母
while(1)
{
pos=a.find("A",pos); //find()函数查找位置
if(pos<0) //如果没找到，返回-1
{
cout<<"No"<<endl; //endl养成好习惯
break; //跳出循环
}
if(a[pos+1]=='C') //判断"A"下一个是不是"C"
{
cout<<"Yes"<<endl;
break; //跳出循环
}
pos++; //下一次从pos+1找起
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;cin>>s;
int r=0;
for(int i=1;i<s.size();++i){
if(s[i]=='C'&&s[i-1]=='A'){r=1;break;}
}
cout<<(r?"Yes":"No");
} | 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void abc_160a();
void abc_161a();
void abc_162a();
void abc_163a();
int main()
{
//abc_160a();
//abc_161a();
//abc_162a();
abc_163a();
}
void abc_160a()
{
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5]) cout << "Yes\n";
else cout << "No\n";
}
void swap(int& a, int& b)
{
int tmp;
tmp = a;
a = b;
b = tmp;
}
void abc_161a()
{
int x, y, z;
cin >> x >> y >> z;
swap(x, y);
swap(x, z);
cout << x << " " << y << " " << z << "\n";
}
void abc_162a()
{
string s;
cin >> s;
for (char c : s)
{
if (c == '7')
{
cout << "Yes\n";
return;
}
}
cout << "No\n";
}
void abc_163a()
{
int R;
cin >> R;
cout << (double)(2 * R * M_PI);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
string S;
cin >> S;
int count = 0;
rep(i,3){
if(S.at(i) == 'R'){
count ++;
}
}
if(count == 2){
if(S.at(1) == 'S'){
count --;
}
}
cout << count << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef struct _dot{
int x;
int y;
}Dot;
bool Check(vector<Dot> list,int Assumption[]){
for(int i=0;i<list.size();i++){
if(Assumption[list[i].x ] != list[i].y) return false;
}
return true;
}
int main(){
int N; cin >> N;
vector<vector<Dot>> list(N);
for(int i=0;i<N;i++){
int k; cin >> k;
for(int j=0;j<k;j++){
int x,y; cin >> x >> y;
Dot k; k.x = x-1; k.y = y;
list.at(i).push_back(k);
}
}
int ans = 0;
int size = pow(2,N) - 1;
for (int bits = size;bits >=0; bits--) {
int Assumption[N];
int num = 0;
for(int i=0;i<N;i++){
int mask = 1 << i;
if(bits & mask){Assumption[i] = 1;num++;}
else{Assumption[i] = 0;}
}
for (int i=0;i<N;i++) {
int mask = 1 << i;
if (bits & mask) {
if(Check(list.at(i),Assumption) == false) break;
}
if(i== N-1 && ans < num) ans = num;
}
}
cout << ans << endl;
} | #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)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e10;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;return 1;}return 0;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a = b;return 1;}return 0;}
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)};
////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////
int n,m,a[310][310], ans;
int cnt[310];bool used[310];
void j(){
P mx;
while(true){
rep(i,m)cnt[i] = 0;
rep(i,n){
rep(j,m){
if(!used[a[i][j]]){
cnt[a[i][j]]++;
break;
}
}
}
mx = P(-1, -1);
rep(i,m)if(mx.first < cnt[i])mx = P(cnt[i], i);
chmin(ans, mx.first);
used[mx.second] = true;
bool r = false;rep(i,m)if(!used[i])r = true;
if(!r)return;
}
}
signed main(){
cin>>n>>m;
rep(i,n)rep(j,m){
cin>>a[i][j];a[i][j]--;
}
ans = INF;j();
cout << ans << endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define int int64_t
#define double long double
#define nitro ios_base::sync_with_stdio(false);cin.tie(0);
#define vi vector<int64_t>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define PI 3.1415926535897932384626433832795
#define read(a) for(auto& x : a) cin>> x
#define endl '\n'
#define gap ' '
#define min3(a,b,c) min(a, min(b, c))
#define max3(a,b,c) max(a, max(b, c))
#define MOD 1000000007
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int32_t main()
{
nitro
int n;cin>>n;
int a=ceil(sqrt(n));
for(int i=a;~i;--i)
if(i*i<=n) return cout<<i*i,0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
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; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int mod=1e9+7;
const int MOD=998244353;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin >> n;
cout << n/3 << endl;
} | 0 |
#include<iostream>
using namespace std;
int a[1000005];
int main(){
int k,i;
cin>>a[0]>>a[1]>>k;
for(i=0;i<k;i++){
a[!(i&1)]+=(a[i&1]>>=1);
}
cout<<a[0]<<" "<<a[1];
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
#define out(s) cout<<s<<endl;
#define Reverse(x) reverse(all(x));
#define Sort(x) sort(all(x));
#define pb(s) push_back(s);
#define sp " "
#define INF 10000000000
#define LINF 9000000000000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(lli i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
cout << std::fixed << std::setprecision(10);
lli a, b,k;
cin >> a >> b >> k;
lli c = true;
rep(i, k) {
if(c)
{
if(a%2!=0)
{
a--;
}
b += a / 2;
a -= a / 2;
c = false;
}
else
{
if(b%2!=0)
{
b--;
}
a += b / 2;
b -= b / 2;
c = true;
}
}
out(a << sp << b);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
//isPrime
//modpow modinv
//getDigit
int main() {
cout << fixed << setprecision(10);
double n,k;
cin >> n >> k;
cout << (int)(ceil(n/k)-floor(n/k)) << endl;
}
| #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <tuple>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
int main(void){
int l,r;
cin >> l >> r;
int mi=2018*2018;
for (int i = l; i<r; i++)
{
int L=i%2019;
for (int j = i+1; j <= r; j++)
{
int R=j%2019;
int ama=(L*R)%2019;
if (ama<mi)
{
mi=ama;
if (mi==0)
{
cout << 0 << endl;
return 0;
}
}
}
}
cout << mi << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n, x, ans=0;
map<int, int> mp;
cin >> n;
while(n--){
cin >> x;
if(!mp[x]){
mp[x]=1;
ans++;
}else mp[x]=0, ans--;
}
cout << ans << endl;
}
int main(){
solve();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
int n;
cin >> n;
vector<int>a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
int ans=n;
for(int i=1;i<n;i++){
if(a[i-1]==a[i]){
ans-=2;
i++;
}
}
cout << ans << endl;
}
| 1 |
#include <iostream>
using namespace std;
int num=0;
int liner_search(int x,int S[],int N){
int n=0;
while(n<N && S[n]!=x){
n++;
}
if(n<N){
++num;
return n;
}
else
return -1;
}
int main(){
int num1;
cin>>num1;
int a[num1];
for(int i=0;i<num1;i++)
cin>>a[i];
int num2;
cin>>num2;
int b[num2];
for(int i=0;i<num2;i++)
cin>>b[i];
int x[num2];
for(int i=0;i<num2;i++){
x[i]=liner_search(b[i],a,num1-1);
}
cout<<num<<endl;
return 0;
} | #include <cstdio>
#include <cstdlib>
#define N 10000
#define Q 500
using namespace std;
int main(){
int *a,*b;
a = new int[N];
b = new int[Q];
int n,q;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf(" %d", &a[i]);
}
scanf("%d",&q);
for(int i=0;i<q;i++){
scanf(" %d", &b[i]);
}
int ans = 0;
for(int i=0;i<q;i++){
for(int j=0;j<n;j++){
if(a[j] == b[i] ){
ans++;
break;
}
}
}
printf("%d\n",ans);
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int v = 1;
rep(i, n) {
v = min(v * 2, v + k);
}
put(v)
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;
int main() {
vint a(3);
rep(i,3) cin >> a[i];
int k; cin >> k;
sort(be(a));
rep(i,k) a[2]=a[2]*2;
cout << a[0]+a[1]+a[2] << endl;
} | 0 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#include<sstream>
#include<stack>
#include<queue>
#include<list>
#include<functional>
#define _USE_MATH_DEFINES
#include<math.h>
#include<map>
#define SENTINEL 1000000001
#define min(a,b) ((a)>(b)?(b):(a))
#define max(a,b) ((a)>(b)?(a):(b))
#define INF 200000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
struct OwnEdge
{
ll from, to, cost;
OwnEdge() :from(-1), to(-1), cost(-1) {}
OwnEdge(ll from, ll to, ll cost) : from(from), to(to), cost(cost) {}
};
OwnEdge edges[10000];
ll tod[100][100];
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int V, E;
scanf("%d %d", &V, &E);
for (int i = 0; i < V; i++)for (int j = 0; j < V; j++)
{
tod[i][j] = INF;
}
for (int i = 0; i < E; i++)
{
int s, t, d;
scanf("%d %d %d", &s, &t, &d);
edges[i] = OwnEdge(s, t, d);
}
for (int k = 0; k < V; k++)
{
tod[k][k] = 0;
bool ns = false;
for (int i = 0; i < V; i++)
{
for (int j = 0; j < E; j++)
{
OwnEdge t = edges[j];
if (tod[k][t.from] != INF&&tod[k][t.to]>(tod[k][t.from] + t.cost))
{
tod[k][t.to] = (tod[k][t.from] + t.cost);
if (i == (V - 1))
{
ns = true;
}
}
}
}
if (ns)
{
printf("NEGATIVE CYCLE\n");
return 0;
}
}
for (int i = 0; i < V; i++)
{
for (int j = 0; j < V; j++)
{
if (j == 0)
{
printf(tod[i][j] == INF ? "INF" : "%lld", tod[i][j]);
}
else
{
printf(tod[i][j] == INF ? " INF" : " %lld", tod[i][j]);
}
}
printf("\n");
}
return 0;
}
| #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn = 100 + 10;
int n, m, a[maxn];
int main() {
scanf("%d%d", &n, &m);
int cnt = 0;
for(int i = 1;i <= m;i ++) scanf("%d", &a[i]), cnt = cnt + ((a[i] & 1) ? (1) : (0));
if(cnt > 2) puts("Impossible");
else {
for(int i = 1;i <= m;i ++) {
if(a[i] & 1) {
if(a[1] & 1) swap(a[i],a[m]);
else swap(a[1],a[i]);
}
}
for(int i = 1;i <= m;i ++) printf("%d ", a[i]);
puts("");
if(m == 1) a[++ m] = a[1], a[1] = 0;
a[1] ++;
a[m] --;
if(!a[m]) m --;
printf("%d\n", m);
for(int i = 1;i <= m;i ++) printf("%d ", a[i]);
puts("");
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int func(int N){// 例: 11221213312, 12, 432, 8
if (N < 10) return N;
return func(N/10) + N % 10;
}
int main()
{
int n;
cin >> n;
int s = func(n);
if (n % s == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for(int i=0; i < s.size()-1; i++) {
if(s.substr(i,2) == "AC"){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | 0 |
// 問題の URL を書いておく
//
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
//#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: " << v[__i] << endl; \
}\
}while(0)
#else
#define Print(v) ((void)0)
#define PrintVec(v) ((void)0)
#endif
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using ll = int64_t;
int main(int, const char**)
{
string s;
cin >> s;
int ans;
if(s == "RRR")
{
ans = 3;
}
else if(s == "RRS" || s == "SRR")
{
ans = 2;
}
else if(s == "SSS")
{
ans = 0;
}
else
{
ans = 1;
}
cout << ans << endl;
return 0;
}
| //#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
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;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
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; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
rep(i,8)s.pop_back();
cout<<s<<"\n";
}
| 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN=100005;
int n,m;
int head[MAXN];
struct node
{
int from;
int to;
int next;
}edge[MAXN<<1];
int edge_cnt;
void add_edge(int fr,int to)
{
edge[++edge_cnt].from=fr;
edge[edge_cnt].to=to;
edge[edge_cnt].next=head[fr];
head[fr]=edge_cnt;
}
int col[MAXN];
bool flag;
void dfs(int x)
{
for(int i=head[x];i;i=edge[i].next)
{
int u=edge[i].to;
if(col[u]==-1)
{
col[u]=col[x]^1;
dfs(u);
}
else if(col[x]==col[u]) flag=1;
}
}
bool check()
{
for(int i=1;i<=n;i++) col[i]=-1;
for(int i=1;i<=n;i++)
{
if(col[i]==-1)
{
col[i]=0;
dfs(i);
}
}
return !flag;
}
long long ans;
signed main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int u,v;
scanf("%lld%lld",&u,&v);
add_edge(u,v),add_edge(v,u);
}
if(check())
{
int temp=0;
for(int i=1;i<=n;i++)
{
if(col[i]) temp++;
}
ans=temp*(n-temp)-m;
}
else ans=n*(n-1)/2-m;
cout<<ans<<endl;
// system("pause");
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> s(N);
long long ans = 0;
for(int i = 0; i < N; i++){
long long a, b;
cin >> a >> b;
ans -= b;
s[i] = a + b;
}
sort(s.begin(), s.end());
int f = 0;
for(int i = 0; i < N; i++){
if(f % 2 == 0) ans += s[N - 1 - i];
f++;
}
cout << ans << endl;
} | 0 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <string>
#include <queue>
#include <iomanip>
#include <iterator>
#define MOD 1000000007
#define INF 1000000001
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
template <class T>
ostream &operator<<(ostream &o, const vector<T>&obj) {
o << "["; for (int i = 0; i < (int)obj.size(); ++i) o << (i > 0 ? ", " : "") << obj[i]; o << "]"; return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U>&obj) {
o << "(" << obj.first << ", " << obj.second << ")"; return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U>&obj) {
o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;
}
template <class T>
ostream &operator<<(ostream &o, const set<T>&obj) {
o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;
}
template <class T>
ostream &operator<<(ostream &o, const queue<T>&obj) {
queue<T> obj_cp = obj;
bool first = true;
o << "{";
while (!obj_cp.empty()) { o << (!first ? ", " : "") << obj_cp.front(); obj_cp.pop(); first = false; }
o << "}"; return o;
}
void print() {
cout << "\n";
}
template<class Head, class... Body>
void print(Head head, Body... body) {
cout << head << " ";
print(body...);
}
int H, W, K;
vector<int> pattern_nums;
void init_pnums() {
pattern_nums.resize(W);
pattern_nums[0] = 1;
pattern_nums[1] = 2;
for (int i = 0; i <= W-2; ++i) {
pattern_nums[i+2] = pattern_nums[i] + pattern_nums[i+1];
}
}
int get_pnum(int h) {
if (h < 0) return 1;
return pattern_nums[h];
}
int main(int argc, char const *argv[]) {
cin >> H >> W >> K;
init_pnums();
// print(pattern_nums);
vector<vector<ull>> dp(H+1, vector<ull>(W, 0));
dp[0][0] = 1;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
dp[i+1][j] = (dp[i][j] * get_pnum(j-1) * get_pnum(W-j-2)) % MOD;
// print(i, j, "center", dp[i][j] * get_pnum(j-1) * get_pnum(W-j-2));
if (j > 0) {
dp[i+1][j] = (dp[i+1][j] + dp[i][j-1] * get_pnum(j-2) * get_pnum(W-j-2)) % MOD;
// print(i, j, "left", dp[i][j-1] * get_pnum(j-2) * get_pnum(W-j-2));
}
if (j < W-1) {
dp[i+1][j] = (dp[i+1][j] + dp[i][j+1] * get_pnum(j-1) * get_pnum(W-j-3)) % MOD;
// print(i, j, "right", dp[i][j+1] * get_pnum(j-1) * get_pnum(W-j-3));
}
}
// print(i+1, dp[i+1]);
}
cout << dp[H][K-1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
//dp[i][j][k],i番目の高さで,左からj列目、k：見ている箇所の左側に橋がかかっている。
lli dp[110][10];
signed main(){
lli h,w,k;
cin>>h>>w>>k;
dp[0][0]=1;
REP(i,1,h+1){
REP(bit,0,(1LL)<<(w-1)){
if(DEBUG)cout<<"bit="<<bit<<endl;
//cout<<endl;
bool ok=false;
REP(j,0,w){
//cout<<(bit&(1LL<<j))<<" ";
if(bit&(1LL<<j) && bit&(1LL<<(j+1))){
ok=true;
break;
}
}
if(ok)continue;
REP(j,0,w+1){
bool flag=false;
if(bit&(1LL<<j)){
dp[i][j+1] += dp[i-1][j];
dp[i][j] += dp[i-1][j+1];
flag=true;
}
else{
dp[i][j] += dp[i-1][j];
}
dp[i][j]%=MOD;
dp[i][j+1]%=MOD;
if(flag)j++;
}
}
}
if(DEBUG){
cout<<"show"<<endl;
REP(i,0,h+1){
REP(j,0,w){
cout<<dp[i][j]%MOD<<" ";
}
cout<<endl;
}
}
cout<<dp[h][k-1]%MOD<<endl;
return 0;
} | 1 |
#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; }
int main() {
int l[10],v1,v2;
for(;~scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d\n",l,l+1,l+2,l+3,l+4,l+5,l+6,l+7,l+8,l+9,&v1,&v2);){
int sum=0;
int i;
for(i=0;i<10;i++){
sum+=l[i];
//cout<<l[i]<<endl;
}
int len=0;
for(i=0;i<10;i++){
len+=l[i];
if(len*v2>=(sum-len)*v1){
cout<<i+1<<endl;
break;
}
}
}
return 0;
} | #include<cstdio>
#include<vector>
#include<numeric>
using namespace std;
int main()
{
int l[10],v[2];
while(~scanf("%d",l)){
for(int i=1;i<10;i++) scanf(",%d",l+i);
scanf(",%d,%d",v,v+1);
int len=accumulate(l,l+10,0);
vector<int> rail(len);
for(int i=0,cnt=0;i<10;i++){
for(int j=0;j<l[i];j++,cnt++){
rail[cnt]=i+1;
}
}
double x=1.0*v[0]/(v[0]+v[1])*len;
if(-1e-9<(x-(int)x) && (x-(int)x)<1e-9) x-=0.1;
printf("%d\n",rail[(int)x]);
}
return 0;
} | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int MAX = 1100;
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 modpow(ll a, ll n, ll MOD) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
vector<ll> dp(n+1, 0);
dp[0] = 1;
COMinit();
for (int i = a; i <= b; i++) {
for (int j = n; j >= 0; j--) {
for (int k = c; i*k <= j && k <= d; k++) {
dp[j] += dp[j-i*k] * fac[n-(j-i*k)] % MOD * finv[n-j] % MOD * finv[k] % MOD * modpow(finv[i], k, MOD) % MOD;
dp[j] %= MOD;
}
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2005;
const int mod = 1e9+7;
int fac[N],combi[N][N];
int add(int x,int y) {
int ret = ((x+y)%mod + mod)%mod;
return ret;
}
int mul(int x,int y) {
ll ret = (ll)x*y;
ret%=mod;
return ret;
}
int num[2];
int group[2];
int dp[N][N];
int inv[N];
int invFac[N];
int solveDp(int x,int rem) {
if(rem==0) {
return 1;
}
if(x>num[1]) {
return 0;
}
int &ret = dp[x][rem];
if(ret != -1) {
return ret;
}
ret = solveDp(x+1,rem);
int cur = 1;
for(int j = 0;j<group[0];++j) {
cur = mul(cur, invFac[x]);
}
for(int f = group[0];f<=group[1] && f*x<=rem;++f) {
int tot = f*x;
int m = fac[tot];
int t = cur;
t = mul(t, invFac[f]);
m = mul(t,m);
m = mul(combi[rem][tot],m);
ret = add(ret, mul(m,solveDp(x+1,rem-tot)));
cur = mul(cur,invFac[x]);
}
return ret;
}
int myPow(int x,int c) {
int ret = 1;
while(c>0) {
if(c&1) {
ret = mul(ret,x);
}
x = mul(x,x);
c/=2;
}
return ret;
}
void solve() {
int n;
memset(dp,-1,sizeof(dp));
scanf("%d",&n);
for(int i=0;i<2;++i) {
scanf("%d",&num[i]);
}
for(int i=0;i<2;++i) {
scanf("%d",&group[i]);
}
fac[0] = 1;
inv[0] = 1;
invFac[0] = 1;
for(int i=1;i<N;++i) {
fac[i] = mul(fac[i-1],i);
inv[i] = myPow(i,mod-2);
invFac[i] = myPow(fac[i],mod-2);
}
for(int i=0;i<N;++i) {
combi[i][i] = combi[i][0] = 1;
for(int j = 1;j<i;++j) {
combi[i][j] = add(combi[i-1][j],combi[i-1][j-1]);
}
}
printf("%d\n", solveDp(num[0],n));
}
int main()
{
//freopen("input.txt","r",stdin);
solve();
} | 1 |
#include <iostream>
#include <algorithm>
#include <numeric>
const int NUM = 10000;
using namespace std;
int main() {
int n, a[NUM];
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;
return 0;
}
| #include<iostream>
#include<cstdio>
using namespace std;
int main(){
long long Min,Max,sum=0,n,m;
scanf("%lld%lld",&n,&Max);
Min=sum=Max;
for(int i=1;i<n;i++){
scanf("%lld",&m);
if(m>Max) Max=m;
if(m<Min) Min=m;
sum+=m;
}
printf("%lld %lld %lld\n",Min,Max,sum);
return 0;
}
| 1 |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MAX = 1000000;
using Graph =vector<vector<lint>>;
typedef pair<lint,lint> P;
typedef map<lint,lint> M;
lint fac[MAX], finv[MAX], inv[MAX];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (lint 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(lint n, lint k)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
lint primary(lint num)
{
if (num < 2) return 0;
else if (num == 2) return 1;
else if (num % 2 == 0) return 0;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return 0;
}
}
return 1;
}
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;
}
lint lcm(lint a,lint b){
return a/__gcd(a,b)*b;
}
lint gcd(lint a,lint b){
return __gcd(a,b);
}
int main(){
int h,w;
cin>>h>>w;
int x[h][w];
rep(i,h){
rep(j,w){
cin>>x[i][j];
}
}
vector<tuple<lint,lint,lint,lint>>ans;
rep(i,h){
rep(j,w){
if(x[i][j]%2==1){
if(i!=(h-1)&&j!=(w-1)){
if(x[i][j+1]%2==1){
x[i][j]--;
x[i][j+1]++;
ans.push_back(make_tuple(i,j,i,j+1));
}else {
x[i][j]--;
x[i+1][j]++;
ans.push_back(make_tuple(i,j,i+1,j));
}
}else if(i==(h-1)&&j==(w-1));
else if(i==(h-1)){
x[i][j]--;
x[i][j+1]++;
ans.push_back(make_tuple(i,j,i,j+1));
}else{
x[i][j]--;
x[i+1][j]++;
ans.push_back(make_tuple(i,j,i+1,j));
}
}
}
}
cout<<ans.size()<<endl;
rep(i,ans.size()){
lint a,b,c,d;
tie(a,b,c,d)=ans[i];
cout<<a+1<<" "<<b+1<<" "<<c+1<<" "<<d+1<<endl;
}
}
| #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int main() {
in(int, h, w);
vector a(h, vector(w, 0));
rep(i, h) rep(j, w) cin >> a[i][j];
int r = 0, c = 0;
vector<string> moves;
while (true) {
dbg(r, c);
int nr = r, nc = c + ((r & 1) ? -1 : 1);
if (nc < 0 || w <= nc) {
++nr;
if (nr == h) break;
nc = c;
}
if (a[r][c] & 1) {
stringstream ss;
ss << (r + 1) << " " << (c + 1) << " " << (nr + 1) << " " << (nc + 1);
moves.push_back(ss.str());
--a[r][c];
++a[nr][nc];
}
r = nr;
c = nc;
}
out(moves.size());
for (auto& m : moves) out(m);
}
| 1 |
// F.
#include <iostream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
const int INF = 1 << 30;
int solve(vector<int> x, vector<int> y, vector<string> dir) {
int ans = INF;
int n = (int)x.size();
map<int, set<int>> a, b, v, h;
for (int i = 0; i < n; ++i) {
if (dir[i] == "L") {
a[x[i] - y[i]].insert(x[i]);
h[y[i]].insert(x[i]);
}
if (dir[i] == "R") {
b[x[i] + y[i]].insert(x[i]);
}
if (dir[i] == "D") {
v[x[i]].insert(y[i]);
}
}
for (int i = 0; i < n; ++i) {
if (dir[i] == "R") {
if (h.find(y[i]) != h.end()) {
set<int>& s = h[y[i]];
auto it = s.lower_bound(x[i]);
if (it != s.end()) {
ans = min(ans, (*it - x[i]) * 5);
}
}
}
if (dir[i] != "U") {
continue;
}
int key = x[i] - y[i];
if (a.find(key) != a.end()) {
set<int>& s = a[key];
auto it = s.lower_bound(x[i]);
if (it != s.end()) {
ans = min(ans, (*it - x[i]) * 10);
}
}
key = x[i] + y[i];
if (b.find(key) != b.end()) {
set<int>& s = b[key];
auto it = s.lower_bound(x[i]);
if (it != s.begin()) {
--it;
ans = min(ans, (x[i] - *it) * 10);
}
}
if (v.find(x[i]) != v.end()) {
set<int>& s = v[x[i]];
auto it = s.lower_bound(y[i]);
if (it != s.end()) {
ans = min(ans, (*it - y[i]) * 5);
}
}
}
return ans;
}
int main(int argc, char* argv[]) {
cout.precision(20);
#ifdef _MSC_VER
while (true)
#endif
{
int ans = INF;
LL n = -1;
cin >> n;
if (n < 0) return 0;
vector<int> x(n), y(n);
vector<string> dir(n);
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i] >> dir[i];
}
ans = solve(x, y, dir);
map<string, string> t;
t["D"] = "U";
t["U"] = "D";
t["L"] = "R";
t["R"] = "L";
for (int i = 0; i < n; ++i) {
x[i] = -x[i];
y[i] = -y[i];
dir[i] = t[dir[i]];
}
ans = min(ans, solve(x, y, dir));
if (ans == INF) {
cout << "SAFE" << endl;
} else {
cout << ans << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); ++i)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr ll INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;
const int MAXD = 200010;
ll compare(vector<vector<int>> &A,vector<vector<int>> &B,int sz = MAXD * 2) {
int ans = INF;
rep(i,sz) {
sort(B[i].begin(),B[i].end());
for (int a:A[i]) {
int idx = lower_bound(B[i].begin(),B[i].end(),a + 1) - B[i].begin();
if (idx >= (int)B[i].size()) continue;
ans = min(ans,B[i][idx] - a);
}
}
return ans;
}
int main() {
int N; cin >> N;
vector<vector<int>> XU(MAXD),XD(MAXD),YR(MAXD),YL(MAXD),mR(2*MAXD),mD(2*MAXD),mU(2*MAXD),mL(2*MAXD),aR(2*MAXD),aU(2*MAXD),aD(2*MAXD),aL(2*MAXD);
rep(i,N) {
int x,y; char s;
cin >> x >> y >> s;
if (s == 'U') {
XU[x].push_back(y);
mU[y - x + MAXD].push_back(x);
aU[y + x].push_back(x);
} else if (s == 'R'){
YR[y].push_back(x);
mR[y - x + MAXD].push_back(x);
aR[y + x].push_back(x);
} else if (s == 'D') {
XD[x].push_back(y);
mD[y - x + MAXD].push_back(x);
aD[y + x].push_back(x);
} else {
YL[y].push_back(x);
mL[y - x + MAXD].push_back(x);
aL[y + x].push_back(x);
}
}
ll ans = INF;
ans = min(ans,compare(XU,XD,MAXD)*5LL);
ans = min(ans,compare(YR,YL,MAXD)*5LL);
ans = min(ans,compare(mR,mD)*10LL);
ans = min(ans,compare(mU,mL)*10LL);
ans = min(ans,compare(aR,aU)*10LL);
ans = min(ans,compare(aD,aL)*10LL);
if (ans == INF) cout << "SAFE" << '\n';
else cout << ans << '\n';
return 0;
} | 1 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef vector<vector<P>> vvP;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
vector<P> p(n);
rep(i, n) {
p[i] = make_pair(abs(sum - n*a[i]), i);
}
sort(all(p));
out(p[0].second);
re0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi first
#define se second
#define setpre(x) cout << fixed << setprecision(x)
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, y; cin >> (x) >> (y)
#define ii3(x, y, z) int x, y, z; cin >> (x) >> (y) >> (z)
#define out(x) cout << (x) << endl
#define outs(x) cout << (x) << " "
#define yn(x) cout << ((x)?("Yes"):("No")) << endl
#define YN(x) cout << ((x)?("YES"):("NO")) << endl
#define bit_c(x) __builtin_popcountll(x)
inline void logger(){ cout << endl; }
template<typename A, typename... B>
void logger(const A& a, const B&... b){
cout << a << " , ";
logger(b...);
}
typedef pair<lint, lint> P;
const lint MOD = 1000000007;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 100005;
/* ...o(^-^)o... */
int main(){
int n; cin >> n;
string s; cin >> s;
int o[] = {0, 3, 1, 2};
int x[] = {1, 2, 0, 3};
string sr[] = {"SS", "SW", "WS", "WW"};
rep(t, 4){
int u = t; vector<int> v;
rep(i, n){
v.push_back(u);
if(s[i] == 'o') u = o[u];
else u = x[u];
}
if(u != t) continue;
string ans = "";
rep(i, n){
if(v[i] % 2) ans += "W";
else ans += "S";
}
out(ans); return 0;
}
out(-1);
}
| 0 |
#include<bits/stdc++.h>
#define rep(i,n)for(ll i=0;i<n;i++)
using namespace std;
typedef long long ll;
int cnt[50];
int main() {
int n, p;
while (scanf("%d%d", &n, &p), n) {
int k = p;
memset(cnt, 0, sizeof(cnt));
for (int i = 0;; i = (i + 1) % n) {
if (k == 1 && cnt[i] == p - 1) {
printf("%d\n", i);
break;
}
if (k) { cnt[i]++; k--; }
else { k = cnt[i]; cnt[i] = 0; }
}
}
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m&&!(n==0&&m==0)){
int scores[1001];
vector<int> comb;
for(int i = 0; i < n; i++){
cin>>scores[i];
}
scores[n]=0;
for(int i = 0; i < n+1; i++){
for(int j = 0; j < n+1; j++){
int sum=scores[i]+scores[j];
if(sum<=m)
comb.push_back(sum);
}
}
sort(comb.begin(),comb.end());
int maxNum=0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
int left = (scores[i]+scores[j]);
if(left<=m&&comb[0]+left<=m){
vector<int>::iterator it = lower_bound(comb.begin(),comb.end(),m-left);
if(it==comb.end()){
maxNum=max(maxNum,comb[comb.size()-1]+left);
}
else{
if(*it==(m-left)){
maxNum=m;
}
else{
it--;
maxNum=max(maxNum,*it+left);
}
}
}
}
}
cout<<maxNum<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
cout << "2018";
for(int i = 4; i < s.size(); i++) cout << s[i];
cout << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string A;
cin >> A;
cout << 2018 << "/" << 0 << 1 << "/" << A.at(8) << A.at(9) << endl;
} | 1 |
#include <stdio.h>
#include <limits.h>
int main(){
int n,m,s,i,j;
scanf("%d%d",&n,&m);
int e[m+1][3],dist[m+1],update=1,k,d[200][200];
//printf("xxx");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(i==j)d[i][j]=0;
else d[i][j]=INT_MAX;
}
}
for(i=0;i<m;i++){
for(j=0;j<3;j++){
scanf("%d",&e[i][j]);
}
d[e[i][0]][e[i][1]]=e[i][2];
}
for(i=0;i<n;i++){
dist[i]=INT_MAX;
}
dist[s]=0;
for(i=0;i<n-1;i++){
update=0;
for(j=0;j<m;j++){
if(dist[e[j][0]]!=INT_MAX&&dist[e[j][1]]>dist[e[j][0]]+e[j][2]){
dist[e[j][1]]=dist[e[j][0]]+e[j][2];
update=1;
}
}
if(update==0)break;
}
for(j=0;j<m;j++){
if(dist[e[j][0]]!=INT_MAX&&dist[e[j][1]]>dist[e[j][0]]+e[j][2]){
printf("NEGATIVE CYCLE\n");
return 0;
}
}
for(k=0;k<n;k++){
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if((d[i][k]!=INT_MAX&&d[k][j]!=INT_MAX)&&d[i][j]>d[i][k]+d[k][j]){
d[i][j]=d[i][k]+d[k][j];
}
}
}
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(j>0)printf(" ");
if(d[i][j]==INT_MAX){
printf("INF");
}
else{
printf("%d",d[i][j]);
}
}
printf("\n");
}
return 0;
} | # define _CRT_SECUREj_NO_WARNINGS 1
# define _USE_MATH_DEFINES
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <string>
# include <ctime>
# include <set>
# include <forward_list>
# include <map>
# include <stack>
using namespace std;
# define INF ((int)(1<<25))
# define REP(i,n) for(int i=0;i<(int)n;i++)
# define FOR(i,n) REP(i,n)
# define FORI(i,k,n) for(int i=k;i<(int)n;i++)
# define TORAD 2.0*M_PI/360.0
# define INT(x) int x;cin>>x;
# define ALL(x) (x).begin(),(x).end()
# define RALL(x) (x).rbegin(),(x).rend()
# define DEBUG(x) cout<<#x<<":"<<x<<endl;
# define EPS 1e-12
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#endif
#define int long long
typedef long long lint;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
const int dx[4] = { 0,1,0,-1 }, dy[4] = { -1,0,1,0 };
template<class T> void debug(T a) { for (auto i : a)cout << i << endl; }
const int M = 110;
int f[M][M];
int v, e, r;
signed main()
{
cin >> v >> e;
FOR(i, M)FOR(j, M)f[i][j] = INT_MAX;
FOR(i, M)f[i][i] = 0;
FOR(i, e)
{
int s, t, d;
cin >> s >> t >> d;
f[s][t] = d;
}
FOR(k, M)
{
FOR(i, M)
{
FOR(j, M)
{
if (f[i][k] == INT_MAX || f[k][j] == INT_MAX)continue;
f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
}
}
}
FOR(i, M)if (f[i][i] < 0) { cout << "NEGATIVE CYCLE" << endl; return 0; }
FOR(i, v)
{
FOR(j, v)
{
if (j)cout << " ";
if (f[i][j] == INT_MAX)cout << "INF";
else cout << f[i][j];
}
cout << endl;
}
} | 1 |
#include<bits/stdc++.h>
using std::cout;
using std::cin;
using std::endl;
std::vector<std::string> split(const std::string &str, char sep)
{
std::vector<std::string> v;
std::stringstream ss(str);
std::string buffer;
while( std::getline(ss, buffer, sep) ) {
v.push_back(buffer);
}
return v;
}
int Stoi(const std::string &str)
{
int num=0, i=0;
std::string s = str;
while (i<s.size())
{
if (s[i]<'0'||s[i]>'9')
break;
num = num * 10 + (str[i] - '0');
i++;
}
return num;
}
std::string replace(const std::string &str1, int a, int b, const std::string &str2)
{
std::string s1, s2;
s1 = str1; s2 = str2;
s1 = s1.erase(a, b-a+1);
//cout << s1 << endl;
s1 = s1.insert(a, s2);
//cout << s1 << endl;
return s1;
}
int main(){
int a, b, count=1;
long long n;
std::string str, line, doubt, s;
cin >> str;
cin >> n;
std::getline(cin, doubt);
std::vector<std::string> Priope, v;
std::vector<int> num(n);
for (int i = 0; i < n; i++)
{
std::getline(cin, line);
v = split(line, ' ');
a = Stoi(v[1]); b = Stoi(v[2]);
if (v[0] == "print")
{
s = str.substr(a, b-a+1);
Priope.push_back(s);
num.push_back(i);
//cout << s << endl;
}
else if (v[0] == "reverse")
{std::reverse(str.begin()+a, str.begin()+b+1); }//cout << str << endl;}
else if(v[0] == "replace")
str = replace(str, a, b, v[3]);
else
{
cout << "Wrong Command:" << v[0] << endl;
i--;
}
}
/*
for (int i = 0; i < num.size(); i++)
cout << Priope(i) << endl;
*/
std::vector<std::string>::iterator itr;
itr = Priope.begin();
while (itr != Priope.end())
{
cout << *itr << endl;
itr++;
}
return 0;
}
| #include<iostream>
#include<cstdio>
#define eps 10e-9
using namespace std;
int main()
{
int data[10],sum=0;
int v1,v2;
while(scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d",&data[0],&data[1],&data[2],&data[3],&data[4],&data[5],&data[6],&data[7],&data[8],&data[9],&v1,&v2)!=EOF)
{
sum=data[0];
for(int i = 1; i < 10; ++i)
{
sum+=data[i];
data[i]=sum;
}
//cout<<"sum="<<data[9]<<endl;
double t=data[9]/(double)(v1+v2);
//printf("t=%.9lf\n",t);
for(int i = 0; i < 10; ++i)
{
if(v1*t<(double)data[i]+eps)
{
cout<<i+1<<endl;
break;
}
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=6100;
int n,mod,fac[N],inv[N],tot[4][N],invtot[4][N];
int p[N];
inline void add(int &a,int b){a=(a+b)%mod;}
inline void del(int &a,int b){a=(a-b+mod)%mod;}
inline void mul(int &a,int b){a=(a*b)%mod;}
inline int C(int n,int m){return fac[n]*inv[n-m]%mod*inv[m]%mod;}
inline int m_pow(int a,int b)
{
int ans=1;
while (b)
{
if (b&1) mul(ans,a);
b>>=1;
mul(a,a);
}
return ans;
}
signed main()
{
scanf("%lld%lld",&n,&mod);n*=3;
fac[0]=1;
for (int i=1;i<=n;i++) fac[i]=(fac[i-1]*i)%mod;
inv[n]=m_pow(fac[n],mod-2);
for (int i=n-1;i>=0;i--) inv[i]=(inv[i+1]*(i+1))%mod;
p[0]=1;
for (int i=1;i<=n;i++) p[i]=(p[i-1]*2)%mod;
for (int i=1;i<=3;i++)
{
for (int j=0;j<i;j++) tot[i][j]=1;
for (int j=i;j<=n;j++) tot[i][j]=(tot[i][j-i]*C(j,i))%mod;
for (int j=0;j<=n;j++) invtot[i][j]=m_pow(tot[i][j],mod-2);
}
int ans=0;
for (int i=0;i<=n;i++)
{
for (int j=0;j<=i;j++)
{
int k=n-i-2*j,num=1,tmp=n;
if (k<0) break;
if (k%3!=0) continue;
k/=3;
mul(num,tot[1][tmp]*invtot[1][tmp-i]%mod);tmp-=i;
mul(num,tot[2][tmp]*invtot[2][tmp-2*j]%mod);tmp-=2*j;
mul(num,tot[3][tmp]);
mul(num,inv[i]);mul(num,inv[j]);mul(num,inv[k]);
mul(num,p[k]);
// printf("1:%d 2:%d: %d\n",i,j,num);
add(ans,num);
}
}
printf("%lld\n",ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long Int;
typedef pair<Int,Int> PII;
typedef vector<int> VInt;
#define FOR(i, a, b) for(i = (a); i < (b); ++i)
#define RFOR(i, a, b) for(i = (a) - 1; i >= (b); --i)
#define EACH(it, a) for(auto it = (a).begin(); it != (a).end(); ++it)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define SIZE(a) int((a).size())
#define ALL(a) (a).begin(),(a).end()
#define MP make_pair
#define MAX (6 << 10)
Int R[MAX][MAX + MAX];
int main()
{
int n, m;
cin >> n >> m;
CLEAR(R, 0);
R[0][MAX] = 1;
int i, j;
FOR(i, 0, 3*n)
FOR(j, 0, MAX + MAX)
if(R[i][j] != 0)
{
R[i + 1][j + 1] = (R[i + 1][j + 1] + R[i][j]) % m;
if(i + 2 <= 3*n) R[i + 2][j - 1] = (R[i + 2][j - 1] + R[i][j]*(i + 1)) % m;
if(i + 3 <= 3*n) R[i + 3][j] = (R[i + 3][j] + R[i][j]*(i + 1)*(i + 2)) % m;
}
Int res = 0;
FOR(i, MAX, MAX + MAX) res += R[3*n][i];
res %= m;
cout << res << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
using namespace std;
set<string>mo;
int N,k;
bool use[15];
map<string,int>memo;
string n[10];
void g(int m,string a){
if(m==k){
memo[a]=1;
return;
}
for(int i=0;i<N;i++){
if(!use[i]){
string _a=a+n[i];
use[i]=1;
g(m+1,_a);
use[i]=0;
}
}
}
//??¨??????????????????(????????????)
int main(){
while(1){
int ans=0;
cin >> N >> k;
if(N==0&&k==0)break;
for(int y=0;y<N;y++){
cin >> n[y];
}
fill(use,use+15,0);
memo.clear();
g(0,"");
cout << memo.size() << endl;
}
return 0;
} | #include <stdio.h>
#include <stdlib.h>
int n,k,card[10],count;
int check[10001];
// used[i]==1ÈçÎ iÍgÁÄ¢é
// used[i]==1ÈçÎ card[i]ÍgÁÄ¢é
void func(int a[],int now)
{
int i,j,temp,keta=0,flg;
if(now == k){
char str[9];
for(i=0;i<k;i++){
temp=sprintf(str+keta,"%d",a[i]);
keta+=temp;
}
temp=atoi(str);
check[count]=temp;
count++;
}
else {
int used[10] = { 0 };
for(i=0; i<now; i++){
for(j=0;j<n;j++){
if(a[i]==card[j] && used[j]==0){
used[j]=1;
break;
}
}
}
for(i=0;i<n;i++){
if(used[i] == 0){
a[now] = card[i];
func(a,now+1);
}
}
}
}
int main(void)
{
int i,j,array[5];
while(scanf("%d",&n),n){
scanf("%d",&k);
for(i=0;i<n;i++){
scanf("%d", &card[i]);
}
func(array,0);
for(i=0;i<count;i++){
for(j=0;j<count;j++){
if(check[i]==check[j] && i!=j && check[i]!=0){
check[j]=0;
}
}
}
count=0;
for(i=0;i<10000;i++){
if(check[i]!=0){
count++;
}
}
printf("%d\n",count);
for(i=0;i<10001;i++){
check[i]=0;
}
count=0;
for(i=0;i<10;i++){
card[i]=0;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<string> vec = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
int cnt = 0;
for (string x:vec) {
if (S == x) {
cout << 7 - cnt << endl;
} else {
cnt++;
}
}
} | #include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(_i,_a,_n) for(int _i=_a;_i<=_n;++_i)
#define PER(_i,_a,_n) for(int _i=_n;_i>=_a;--_i)
#define hr putchar(10)
#define pb push_back
#define lc (o<<1)
#define rc (lc|1)
#define mid ((l+r)>>1)
#define ls lc,l,mid
#define rs rc,mid+1,r
#define x first
#define y second
#define io std::ios::sync_with_stdio(false)
#define endl '\n'
#define DB(_a) ({REP(_i,1,n) cout<<_a[_i]<<',';hr;})
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int P = 1e9+7, INF = 0x3f3f3f3f;
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll qpow(ll a,ll n) {ll r=1%P;for (a%=P;n;a=a*a%P,n>>=1)if(n&1)r=r*a%P;return r;}
ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}
inline int rd() {int x=0;char p=getchar();while(p<'0'||p>'9')p=getchar();while(p>='0'&&p<='9')x=x*10+p-'0',p=getchar();return x;}
//head
#ifdef __APPLE__
const int N = 1e2+50;
#else
const int N = 1e6+50;
#endif
ll a[60];
int main() {
ll k;
cin>>k;
ll p = k/50, r = k-50*p;
int n = 50;
REP(i,1,n) a[i] = p+49;
REP(i,1,r) a[i]+=n-r+1;
REP(i,r+1,n) a[i]-=r;
printf("%d\n",n);
REP(i,1,n) printf("%lld ",a[i]);hr;
}
| 0 |
#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>;
int main() {
int n,ans;
cin >> n;
if (n <= 111) ans = 111;
else if (n <= 222) ans = 222;
else if (n <= 333) ans = 333;
else if (n <= 444) ans = 444;
else if (n <= 555) ans = 555;
else if (n <= 666) ans = 666;
else if (n <= 777) ans = 777;
else if (n <= 888) ans = 888;
else ans = 999;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
using namespace std;
class dice {
public:
dice(int* a) {
set(a[0], a[1], a[2], a[3], a[4], a[5]);
}
dice(int& a, int& b, int& c, int& d, int &e, int& f) {
set(a, b, c, d, e, f);
}
void turn(int n) {
if (n < 4)
{
turndice(n);
return;
}
switch (n)
{
case 'N':
turndice(0);
break;
case 'E':
turndice(1);
break;
case 'S':
turndice(2);
break;
case 'W':
turndice(3);
break;
}
}
void turn(const char* str)
{
for (size_t i = 0; str[i] != '\0' ; i++)
{
turn(str[i]);
}
}
int getcurrent(int n = 0) { return label[n]; }
public:
int topfronttoright(const int & top, const int & front) {
char n3[] = { "NES" };
const char ne[][3] = { "N","N","N","E","EE" };
for (size_t i = 0; i < 6; i++)
{
if (top == getcurrent())
for (size_t j = 0; j < 4; j++)
{
if (front == getcurrent(1))
{
return getcurrent(2);
}
turn(n3);
}
turn(ne[i]);
}
return 0;
}
bool cmper(dice b) {
char n3[] = { "NES" };
const char ne[][3] = { "N","N","N","E","EE" };
for (size_t i = 0; i < 6; i++)
{
if (b.getcurrent() == getcurrent())
for (size_t j = 0; j < 4; j++)
{
if (b.getcurrent(1) == getcurrent(1) &&
b.getcurrent(2) == getcurrent(2) &&
b.getcurrent(3) == getcurrent(3) &&
b.getcurrent(4) == getcurrent(4) &&
b.getcurrent(5) == getcurrent(5) )
{
return true;
}
turn(n3);
}
turn(ne[i]);
}
return false;
}
private:
int label[6];
void set(int& a, int& b, int& c, int& d, int &e, int& f) {
label[0] = a;
label[1] = b;
label[2] = c;
label[3] = d;
label[4] = e;
label[5] = f;
}
void turndice(int n)
{
int m = (n > 1) ? n - 2 : n + 2;
int f[] = { 1, 3, 4, 2 };
int tmp;
tmp = label[0];
label[0] = label[f[n]];
label[f[n]] = label[5];
label[5] = label[f[m]];
label[f[m]] = tmp;
}
};
#define D
#ifdef D
int main(void)
{
int n;
cin >> n;
vector<dice> arr;
arr.reserve(n);
int label[6];
for (size_t i = 0; i < n; i++)
{
for (auto &a : label)
cin >> a;
dice d(label);
arr.push_back(d);
}
bool flag = true;
for (size_t i = 0; i < n -1 && flag; i++)
{
for (size_t j = i+1; j < n; j++)
{
if (arr[i].cmper(arr[j]))
flag = false;
}
}
if (!flag)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
#endif // D | 0 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\b.answer"
int main() {
string st; cin >> st;
int ans = 0;
for (int l = 0; l < st.size(); ++l) {
if (st[l] == 'O') {
int r = l;
while (r!=st.size()&&st[r] == 'O') {
r++;
}
int len = r - l;
if (l - len >= 0 && r + len <= st.size()) {
bool ok = true;
for (int t = 0; t < len; ++t) {
if (st[l - t - 1] != 'J')ok = false;
if (st[r + t] != 'I')ok = false;
}
if (ok)ans = max(ans, len);
}
l += len - 1;
}
}
cout << ans << endl;
return 0;
} | #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>
#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)
template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }
//改造
typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//ここから編集する
class Solve {
public:
Int modmul(Int a, Int b) {
return a * b % MOD;
}
void solve() {
Int N;
string S;
cin >> N >> S;
N *= 2;
vector<int> LR(N);
if (S[0] == 'W' || S.back() == 'W') {
cout << 0 << endl;
return;
}
LR[0] = 0;
for (int i = 1; i < N; ++i) {
if (S[i - 1] == S[i]) {
LR[i] = 1 - LR[i - 1];
} else {
LR[i] = LR[i - 1];
}
}
Int ans = 1;
Int tapi = 0;
for (int i = 0; i < N; ++i) {
if (LR[i] == 0) {
tapi++;
} else {
ans = modmul(ans, tapi);
tapi--;
}
}
if (tapi != 0) {
cout << 0 << endl;
return;
}
for (int i = 0; i < N / 2; ++i) {
ans = modmul(ans, i + 1);
}
cout << ans << endl;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solve().solve();
return 0;
}
| 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<map>
#define PRE std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
const int Max = 1e6 + 5;
const int Mod = 1e9 + 7;
ll ls1[Max], ls2[Max],ls3[Max],sum[Max];
int main()
{
PRE;
int n;
cin >> n;
for (int i = 1;i <= n;i++)cin >> ls1[i];
for (int i = 1;i <= n;i++)cin >> ls2[i];
for (int i = 1;i <= n;i++)cin >> ls3[i];
sort(ls1 + 1, ls1 + 1 + n);
sort(ls2 + 1, ls2 + 1 + n);
for (int i = 1;i <= n;i++)
{
int g = lower_bound(ls1 + 1, ls1 + 1 + n, ls2[i]) - ls1-1;
sum[i] = sum[i - 1] + lower_bound(ls1 + 1, ls1 + 1 + n, ls2[i]) - ls1-1;
}
ll res = 0;
for (int i = 1;i <= n;i++)
{
res += sum[lower_bound(ls2 + 1, ls2 + n + 1, ls3[i]) - ls2-1];
}
cout << res;
} | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
ll n;
cin >> n;
vector<ll> A(n);
rep(i, n) cin >> A[i];
vector<ll> B(n);
rep(i, n) cin >> B[i];
vector<ll> C(n);
rep(i, n) cin >> C[i];
sort(all(A));
sort(all(B));
sort(all(C));
vector<int> Ia(n);
vector<int> Ic(n);
ll sum = 0;
rep(i, B.size()) {
ll b = B[i];
// b以上Aのインデックスの最後
Ia[i] = lower_bound(all(A), b) - A.begin();
// bより大きいBのインデックスの最初
Ic[i] = upper_bound(all(C), b) - C.begin();
sum += Ia[i] * (n - Ic[i]);
}
put(sum);
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll mod = 1e9+7;
int main()
{
int n;
cin>>n;
vector<ll> a(n);
ll s1 = 0, s2 = 0;
for (int i=0; i<n; i++) {
cin>>a[i];
s1 += a[i];
s2 += (a[i] * a[i]);
s1 %= mod;
s2 %= mod;
}
ll res = (s1 * s1 - s2);
res %= mod;
while (res < 0) res += mod;
ll ans;
if (res % 2) ans = (res + mod) / 2;
else ans = res / 2;
cout << ans << '\n';
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <utility>
#include <vector>
#include <cmath>
using namespace std;
#define INF 10000001
int main()
{
int a, n;
int maxi, mini;
int i;
long long sum = 0ll;
mini = INF;
maxi = -10000001;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
maxi = max(a, maxi);
mini = min(a, mini);
sum += a;
}
printf("%d %d ", mini, maxi);
cout << sum << endl;
return (0);
} | 0 |
#include<bits/stdc++.h>
#define L long long
#define pb push_back
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define aa first
#define bb second
#define xx aa.aa
#define yy aa.bb
#define zz bb
#define mp make_pair
#define mpp(a,b,c) mp(mp(a,b),c)
using namespace std;
int n;
L p,q;
inline void dfs(L x,L n,L m)
{
//cout<<x<<" "<<n<<" "<<m<<"\n";
if(x==0)
{
if(!n)
p+=m;
return;
}
if(x==1)
{
if(!n)
p+=m*10;
return;
}
int k=(10-n%10)%10;
dfs(x/100,abs(n-k*x+k)/10,m*(10-abs(k)-(x==q)));
}
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
scanf("%d",&n);
for(L k=1;k<=100000000000000000ll;k*=10)
q=k,dfs(k,n,1);
printf("%lld\n",p);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,l;
cin>>n;
if(n%3 == 0){
cout<<n/3<<'\n';
}
else{
cout<<n/3<<'\n';
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
signed main(void){
string s;
while(getline(cin,s)){
while(s.find("this")==s.npos&&s.find("that")==s.npos&&s.find("the")==s.npos)
for(int i=0;i<(int)s.length();i++){
if(s[i]>'z'||s[i]<'a')continue;
if(s[i]!='z')s[i]++;
else s[i]='a';
}
cout<<s<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 30;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };
string str;
map<char, char> change;
int main() {
for ( int i = 0; i < 26; i++ ) {
change[ i + 'a' ] = ( i + 25 ) % 26 + 'a';
}
while ( getline( cin, str ) ) {
for ( ;; ) {
for ( int j = 0; j < str.size(); j++ ) {
if ( str[ j ] >= 'a' && str[ j ] <= 'z' ) {
str[ j ] = change[ str[ j ] ];
}
}
bool is_can = false;
for ( int j = 2; j < str.size(); j++ ) {
if ( str.substr( j - 2, 3 ) == "the" ) {
is_can = true;
break;
}
}
for ( int j = 3; j < str.size(); j++ ) {
if ( str.substr( j - 3, 4 ) == "that" || str.substr( j - 3, 4 ) == "this" ) {
is_can = true;
break;
}
}
if ( is_can ) {
break;
}
}
printf( "%s\n", str.c_str() );
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define per(i, n) for (int i = (int)(n - 1); i > -1; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
int d, g;
cin >> d >> g;
vector<int> p(d), c(d);
rep(i, d) cin >> p[i] >> c[i];
reverse(p.begin(), p.end());
reverse(c.begin(), c.end());
int ans = 1e9;
rep(bit, 1 << d)
{
int score = 0, cnt = 0;
rep(i, d)
{
if (bit & (1 << i))
{
bool ok = true;
rep(j, p[i])
{
score += (d - i) * 100;
cnt++;
if (score >= g)
{
ok = false;
ans = min(ans, cnt);
break;
}
}
if (ok)
{
score += c[i];
if (score >= g)
{
ans = min(ans, cnt);
}
}
}
}
}
cout << ans << endl;
}
int main()
{
solve();
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>
#include<cstdint>
#include<bits/stdc++.h>
#include<queue>
#include<set>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for(int i = n-1; i >= 0; i--)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((ll)(x).size())
#define bit(n) (1LL<<(n))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define INF bit(60)
#define pb push_back
#define mod 1000000007
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 namespace std;
using uif=uint_fast64_t;
using ll=long long int;
int qp(int a,ll b){int ans=1;do{if(b&1)ans=1ll*ans*a%mod;a=1ll*a*a%mod;}while(b>>=1);return ans;}
int qp(int a,ll b,int mo){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
ll uf[100000];
struct edge{int u,v,cost;};
bool comp(const edge& e1,const edge& e2){
return e1.cost < e2.cost;
}
ll root(ll i){
if( uf[i] == i ) return i;
else{
ll t=root(uf[i]);
uf[i] = t;
return uf[i];
}
}
bool same(ll x,ll y){
return root(x) == root(y);
}
void unite(ll x,ll y){
ll x_r=root(x);
ll y_r=root(y);
if(x_r == y_r) return;
uf[x_r] = uf[y_r];
}
int main(void){
ll n;
cin>>n;
vector<ll> x(n);
vector<ll> y(n);
vector< pair<ll,ll> > p_x(n);
vector< pair<ll,ll> > p_y(n);
vector<ll> mincost(n);
vector<bool> used(n);
vector<edge> es(0);
rep(i,n){
cin>>x[i];
cin>>y[i];
pair<ll,ll> p;
p.first=x[i];
p.second=i;
p_x[i]=p;
p.first=y[i];
p_y[i]=p;
mincost[i] = INF;
used[i] = false;
uf[i]=i; // UnionFind init
}
mincost[0]=0;
ll ans=0;
sort(all(p_x));
sort(all(p_y));
/*
rep(i,n){
cout << p_x[i].first << "," << p_x[i].second << endl;
}
cout << endl;
rep(i,n){
cout << p_y[i].first << "," << p_y[i].second << endl;
}
*/
rep(i,n){
if(i==0) continue;
edge e;
e.u=p_x[i-1].second;
e.v=p_x[i].second;
e.cost=min(abs(x[e.u]-x[e.v]),abs(y[e.u]-y[e.v]));
es.pb(e);
e.u=p_y[i-1].second;
e.v=p_y[i].second;
e.cost=min(abs(x[e.u]-x[e.v]),abs(y[e.u]-y[e.v]));
es.pb(e);
}
sort(all(es),comp);
for(auto e:es){
//cout << e.u << "," << e.v << "," << e.cost << endl;
if(!same(e.u,e.v)){
unite(e.u,e.v);
//cout << "unite!"<< endl;
ans+=e.cost;
}
}
/*
while(true){
ll v=-1;
rep(u,n){
if(!used[u] && (v==-1 || mincost[u] < mincost[v])){
v=u;
//cout << "v update into " << v << endl;
}
}
if(v == -1){
//cout << "break!" << endl;
break;
}
used[v]=true;
//cout << v << ":" << mincost[v] << endl;
ans+=mincost[v];
rep(u,n){
if(u==v) continue;
mincost[u] = min(mincost[u], min(abs(x[u]-x[v]),abs(y[u]-y[v])) );
}
}
*/
cout << ans << endl;
return 0;
}
| 0 |
// review
#include <iostream>
using namespace std;
int n, m;
void solve() {
int second = m & 1 ? m + 1 : m + 2;
int cnt = 1;
int cnt2 = 0;
for (int i=0;i<m;i++) {
if (i < m / 2) {
cout << cnt << " " << (second - cnt) << endl;
cnt++;
} else {
cout << cnt2 + second << " " << (2 * m + 1 - cnt2) << endl;
cnt2++;
}
}
}
int main() {
cin >> n >> m;
solve();
}
| // skip until line 65
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <istream>
#include <iterator>
#include <sstream>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;
#define BR "\n"
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define ALL(cont) begin(cont),end(cont)
#define AS_MOD(a, b) ((((a) % (b) ) + (b)) % (b))
#define FEACH(it, cont) for(auto (it) = begin(cont); it!=end(cont);++it)
#define FEACHR(it, cont) for(auto (it) = rbegin(cont); it!=rend(cont);++it)
#define pb push_back
#define pob pop_back
#define fi first
#define se second
#define getll() ([](){ll s;scanf("%lld", &s);return s;})()
#define getld() ([](){ld s;scanf("%Lf", &s);return s;})()
#define prl(P) printf("%lld", P)
#define prd(P) printf("%.10Lf", P)
#define pr(P) printf(P)
#define MAX(V, T) V=max(V,T)
#define MIN(V, T) V=min(V,T)
#define DumpArray(cont, from, to) for(int __i=from;__i<to;++__i) {cout<<"(" <<__i<<": " << cont[__i]<<")";} cout<<endl;
/*
* ***_bound(6)
* 5 6 6 6 6 6 7 7 7
* ^lower ^upper
* void reverse(c.begin(), c.end())
*
* graph
* seg tree
* dp
* brute force
*/
struct Comparator{
int operator()(int l, int r) const {
return r<l;
}
};
struct Vec{
double v[2];
string to_s(){
return "("+to_string(v[0])+","+to_string(v[1])+")";
}
double& operator[](int t){
return v[t];
}
Vec operator+(Vec t) {
return {v[0]+t[0],v[1]+t[1]};
}
Vec& operator+=(Vec t) {
v[0]+=t[0];v[1]+=t[1];
return *this;
}
Vec operator-(Vec t) {
return {v[0]-t[0],v[1]-t[1]};
}
Vec& operator-=(Vec t) {
v[0]-=t[0];v[1]-=t[1];
return *this;
}
Vec operator*(double t) {
return {v[0]*t,v[1]*t};
}
Vec& operator*=(double t) {
v[0]*=t;v[1]*=t;
return *this;
}
double operator*(Vec t) {
return v[0]*t[0]+v[1]*t[1];
}
Vec operator-(){
return {-v[0],-v[1]};
}
static Vec Z;
};
Vec Vec::Z={0,0};
//set<int, Comparator> S;
// solution below
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
int main() {
ll N,M;
cin>>N>>M;
vector<int> arr;
arr.pb(1);
REP(i,M-1){
int n=arr.back()+2;
if (N%2==0&&(n==N/2||N/2+1==n))++n;
arr.pb(n);
}
REP(i,M) {
cout << N/2 -i << " " << N/2-i + arr[i]<<endl;
}
}
| 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll INF=1e18;
const ll mod=1e9+7;
int main(){
ll h,w;
cin >> h >> w;
ll dx[4]={-1,1,0,0};
ll dy[4]={0,0,-1,1};
vector<vector<char>> s(h,vector<char>(w));
rep(i,h){
rep(j,w){
cin >> s[i][j];
}
}
vector<vector<ll>> used(h,vector<ll>(w));
ll ans=0;
rep(i,h){
rep(j,w){
if(used[i][j]) continue;
queue<pll> que;
que.push({i,j});
ll white=0,black=0;
used[i][j]=1;
while(!que.empty()){
pll x=que.front();
que.pop();
if(s[x.fi][x.se]=='#') black++;
else white++;
rep(k,4){
ll nx=x.fi+dx[k];
ll ny=x.se+dy[k];
if(0<=nx && nx<=h-1 && 0<=ny && ny<=w-1 && s[x.fi][x.se]!=s[nx][ny] && used[nx][ny]==0){
que.push({nx,ny});
used[nx][ny]=1;
}
}
}
ans+=white*black;
}
}
cout << ans << endl;
return 0;
}
| #include <cstdio>
int h, w, dx[] = {0,0,-1,1}, dy[] = {1,-1,0,0};
long long a, b, ans;
char s[405][405], t;
void dfs(int x, int y){
char t;
((t = s[x][y]) == '#' ? a : b)++;
s[x][y] = 0;
for(int i = 0; i < 4; i++) if((s[x+dx[i]][y+dy[i]] | t) > t) dfs(x+dx[i], y+dy[i]);
}
int main(){
scanf("%d %d\n", &h, &w);
for(int i = 1; i <= h; i++){scanf("%s", s[i]+1);s[i][w+1] = 0;}
for(int i = 1; i <= h; i++) for(int j = 1; j <= w; j++)
if(s[i][j]) a = b = 0, dfs(i,j), ans += a*b;
printf("%lld\n", ans);
}
| 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
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;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
vector<ll> pw2(62,1);vector<ll> pw10(19,1);
int main(){
{rep1(i,61) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll K,T; cin>>K>>T;
vector<ll> A(T,0);
rep(i,T){
cin>>A[i];
}
sort(all(A));
ll L=A[sz(A)-1];
rep(i,sz(A)-1){
L-=A[i];
}
cout<<max(L-1,0ll)<<endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int k, t;
cin >> k >> t;
priority_queue<int> pq;
rep(i, 0, t) {
int a;
cin >> a;
pq.push(a);
}
int ans = 0;
bool is_first = true, flg = false;
rep(i, 0, k) {
if (flg)
ans++;
if (pq.size() == 1)
flg = true;
if (is_first) {
int a = pq.top();
pq.pop();
a--;
if (a)
pq.push(a);
} else {
int a = pq.top();
pq.pop();
if (!pq.empty()) {
int b = pq.top();
pq.pop();
b--;
if (b)
pq.push(b);
}
pq.push(a);
}
is_first = !is_first;
}
cout << ans << endl;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (n) ; ++i)
#define orep(i,n) for(long long i = 1; i <= (n); ++i) // one rep
#define drep(i,n) for(long long i = (n)-1; i >= 0; --i) // down rep
#define srep(i,s,t) for(long long i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(),(x).end()
// range
#define rrng(a) (a).rbegin(),(a).rend() // reverse range
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define ru(x,y) (((x)+(y)-1)/(y)) // round up
#define fi first
#define se second
#define eb emplace_back
#define fcout cout << fixed << setprecision(15)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vp = vector<P>;
using vl = vector<ll>;
template<typename T> void Yes(T flag) {
cout << (flag ? "Yes" : "No") << endl;
}
template<typename T> void pv(vector<T> vec) {
cout << "[";
for(auto& v : vec) { cout << v << ","; }
cout << "]" << endl;
}
template<>
void pv(vector<P> vec) {
cout << "[";
for(auto& v : vec) {
cout << "<" << v.fi << ","<< v.se << ">" << ",";
}
cout << "]" << endl;
}
template<typename T> void pv2(vector<vector<T>> vec) {
for(auto& v : vec) pv(v);
}
int n;
vvi maze;
vi seen;
vi dTaka;
vi dAo;
void dfs(int x,int length,vi &d) {
int sz = maze.at(x).size();
seen.at(x) = 1;
d.at(x) = min(length,d.at(x));
rep(i,sz) {
int nx = maze.at(x).at(i);
if(!seen.at(nx)) dfs(nx,length+1,d);
}
}
const int INF = 100100101;
int main() {
cin >> n;
int taka,ao;cin >> taka >> ao;
taka--;ao--;
maze = vvi(n,vi());
int m = n-1;
rep(i,m) {
int a,b;cin >> a >> b;
a--;b--;
maze.at(a).eb(b);
maze.at(b).eb(a);
}
seen = vi(n,0);
dTaka = vi(n,INF);
dfs(taka,0,dTaka);
seen = vi(n,0);
dAo = vi(n,INF);
dfs(ao,0,dAo);
int ans = 0;
rep(i,n) {
if(dTaka.at(i) < dAo.at(i)) ans = max(ans,dAo.at(i)-1);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
int main() {
int n;
cin >> n;
vector<pair<int,int>> a(n);
vector<pair<int,int>> b(n);
rep(i,n)
cin >> a[i].second >> a[i].first;
sort(a.rbegin(),a.rend());
rep(i,n)
cin >> b[i].first >> b[i].second;
sort(b.begin(),b.end());
int c=0;
rep(i,n){
rep(j,n){
if((b[i].first>a[j].second)&&(b[i].second>a[j].first)){
a[j]=make_pair(300,300);
c++;
break;
}
}
}
cout << c << endl;
}
| 0 |
#include <stdio.h>
int main () {
int a,b;
int tampung = 1;
scanf("%d", &a);
scanf("%d", &b);
for ( int i = 0 ; i < a; i++) {
if (tampung <= b) {
tampung *= 2;
} else {
tampung += b;
}
}
printf ("%d\n", tampung);
return 0;
} | # include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define F first
# define S second
# define pb push_back
# define ub upper_bound
# define lb lower_bound
# define all(x) x.begin(), x.end()
# define pqueue priority_queue
# define mset multiset
# define umap unordered_map
# define Speed() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
# define rep(i,n) for(int i=0;i<n;++i)
# define forn(i,n) for(int i=1;i<=n;++i)
# define lr(i,l,r) for(int i=l;(l>r?i>=r:i<=r);(l>r?--i:++i))
using namespace std;
template<class T> void umin(T &a,T b){a=min(a,b);}
template<class T> void umax(T &a,T b){a=max(a,b);}
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int dx[]={1,0,-1,0,-1,-1,1,1},dy[]={0,1,0,-1,-1,1,-1,1};
const int mod = 1e9+7;
const ll N = 1e5+4;
ll n,m;
void solve(){
vector<int>d;
cin>>n>>m;
for(int i=1;i*i<=m;++i){
if(m%i==0){
d.pb(i);
if(m/i!=i)d.pb(m/i);
}
}
sort(all(d));
reverse(all(d));
rep(i,sz(d)){
if(n*d[i]<=m){
cout<<d[i];
return;
}
}
}
int main(){
Speed();
int T=1;
//cin>>T;
while(T--)
solve();
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<utility>
#include<map>
#include<algorithm>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<string, int>ma;
string tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
ma[tmp]++;
}
int M;
cin >> M;
for (int i = 0; i < M; i++) {
cin >> tmp;
ma[tmp]--;
}
int ans = 0;
for (auto itr : ma) {
ans = max(itr.second, ans);
}
cout << ans << endl;
} | #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
#include <cassert>
#include <bitset>
using namespace std;
using LL = long long;
LL N;
vector<LL>A;
vector<LL>xmos;
const LL MOD = 1000000007;
LL solvedp(vector<pair<LL, int>>& vec, LL lasval) {
LL zero = 1, notz = 0;
LL zpar = 1, npar = 0;
for (auto p : vec) {
if (p.first == 0) {
zpar = (notz * p.second) % MOD;
zero += zpar;
zero %= MOD;
}
else {
npar = (zero * p.second) % MOD;
notz += npar;
notz %= MOD;
}
}
if (lasval == 0) {
return zpar;
}
return npar;
}
int main() {
cin >> N;
LL xsum = 0;
xmos.push_back(0);
for (int i = 0; i < N; ++i) {
LL tmp;
cin >> tmp;
A.push_back(tmp);
xsum ^= tmp;
xmos.push_back(xsum);
}
/*vector<LL>dp(N + 1);
dp[1] = 1;
LL odd = 1, eve = 0;
for (int i = 2; i <= N; ++i) {
if (i % 2) {
dp[i]++;
dp[i] += eve;
dp[i] %= MOD;
odd += dp[i];
odd %= MOD;
}
else {
dp[i] += odd;
eve += dp[i];
eve %= MOD;
}
}*/
if (xsum != 0) {
vector<pair<LL, int>>nowarr;
for (int i = 1; i <= N; ++i) {
if (xmos[i] == 0) {
nowarr.push_back({ 0,1 });
}
if (xmos[i] == xsum) {
nowarr.push_back({ xsum,1 });
}
}
LL ans = solvedp(nowarr, xsum);
cout << ans << endl;
}
else {
map<LL, int>zerolas;
map<LL, vector<pair<LL, int>>>arrs;
int zerocnt = 0;
LL zerotwo = 1;
for (int i = 1; i <= N; ++i) {
if (xmos[i] == 0) {
zerocnt++;
if (i < N) {
zerotwo *= 2;
zerotwo %= MOD;
}
}
else {
if (zerocnt != zerolas[xmos[i]]) {
arrs[xmos[i]].push_back({ 0,zerocnt - zerolas[xmos[i]] });
zerolas[xmos[i]] = zerocnt;
}
arrs[xmos[i]].push_back({ xmos[i],1 });
}
}
LL ans = zerotwo;
for (auto& elm : arrs) {
if (elm.second.back().second != 0) {
elm.second.push_back({ 0,1 });
}
ans += solvedp(elm.second, 0);
ans %= MOD;
}
cout << ans << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
using lli = long long int;
template <typename T>
vector<T> read_vector(int n) {
vector<T> result(n);
for (auto& a : result) cin >> a;
return result;
}
template <typename T>
vector<T> read_vector() {
int n;
cin >> n;
return read_vector<T>(n);
}
int main() {
ios_base::sync_with_stdio(false);
auto v = read_vector<int>();
bool valid = v[0] == 0;
for (int i = 1; i < v.size(); ++i) valid &= v[i] <= v[i - 1] + 1;
if (!valid) {
cout << -1;
return 0;
}
lli cost = 0;
int prev = 0;
reverse(all(v));
for (auto a : v) {
prev = max(0, prev - 1);
if (a < prev) {
cout << -1;
return 0;
} else if (a > prev) {
cost += a;
}
prev = a;
}
cout << cost;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[214514];
int main() {
ll n;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
ll ans=0;
if(a[0]!=0)cout<<-1<<endl;
else{
ll cnt=1;
for(int i=1;i<=n;i++){
if(a[i]==a[i-1])cnt++;
else if(a[i]>a[i-1]){
if(a[i]-a[i-1]>1){
cout<<-1<<endl;
return 0;
}
ans+=(cnt-1)*a[i-1];
cnt=1;
}else{
ans+=cnt*a[i-1];
cnt=1;
}
}
cout<<ans<<endl;
}
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <ctime>
#include <map>
#include <queue>
#include <functional>
using namespace std; using ll=long long; using P=pair<ll,ll>; const int INF=1e9; const ll LNF=1e18;
int main(){
int n; cin>>n;
string s; cin>>s;
bool ok = false; int ans[n];
for(int i=0;i<4;i++) {
fill(ans, ans+n, -1);
ans[0]=i/2, ans[1]=i%2;
for(int j=2;j<n;j++) {
ans[j] = ans[j-2] ^ (s[j-1]=='x') ^ (ans[j-1]==1);
// ひつじさんが「o」→同じひと
}
bool o1 = (ans[n-1] ^ (s[0]=='x') ^ (ans[0]==1)) == ans[1];
bool o2 = (ans[n-2] ^ (s[n-1]=='x') ^ (ans[n-1]==1)) == ans[0];
if (o1 && o2) {ok=true; break;}
}
if (ok) {
for(int i=0;i<n;i++) {
if (ans[i]==0) cout<<"S";
else cout<<"W";
}cout<<endl;
} else {
cout<<-1<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1000000010
#define N 2000010
#define P 1000000007
char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<'0'||c>'9')) c=getchar();return c;}
int gcd(int n,int m){return m==0?n:gcd(m,n%m);}
int read()
{
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
return x*f;
}
int n,a[N],s[N],id[N],nxt[N],p[N],b[N],f[N][2],m,ans;
int ksm(int a,int k)
{
int s=1;
for (;k;k>>=1,a=1ll*a*a%P) if (k&1) s=1ll*s*a%P;
return s;
}
void inc(int &x,int y){x+=y;if (x>=P) x-=P;}
int solve(int x)
{
if (p[x]<=n)
{
id[m=1]=p[x];
while (nxt[id[m]]<=n) id[m+1]=nxt[id[m]],m++;
}
else return 0;
int t=0;
for (int i=1;i<=m;i++)
{
b[++t]=-1;
if (i<m) b[++t]=s[id[i+1]]-s[id[i]];
}
f[0][0]=1;
for (int i=1;i<=t;i++)
{
f[i][0]=f[i][1]=0;
if (b[i]==-1)
{
f[i][0]=f[i-1][0];
f[i][1]=(f[i-1][1]+f[i-1][0])%P;
}
else
{
f[i][1]=f[i-1][1];
f[i][0]=(f[i-1][0]+1ll*f[i-1][1]*b[i])%P;
}
}
return f[t][1];
}
int solve2(int x)
{
if (p[x]<=n)
{
id[m=1]=p[x];
while (nxt[id[m]]<n) id[m+1]=nxt[id[m]],m++;
}
else return 0;
int t=0;id[m+1]=n;
for (int i=1;i<=m;i++)
{
b[++t]=-1;
b[++t]=s[id[i+1]]-s[id[i]];
}
f[0][0]=1;
for (int i=1;i<=t;i++)
{
f[i][0]=f[i][1]=0;
if (b[i]==-1)
{
f[i][0]=f[i-1][0];
f[i][1]=(f[i-1][1]+f[i-1][0])%P;
}
else
{
f[i][1]=f[i-1][1];
f[i][0]=(f[i-1][0]+1ll*f[i-1][1]*b[i])%P;
}
}
return f[t][0];
}
signed main()
{
n=read();
for (int i=1;i<=n;i++) a[i]=a[i-1]^read();
for (int i=1;i<=n;i++)
{
s[i]=s[i-1];
if (a[i]==0) s[i]++;
}
for (int i=0;i<(1<<20);i++) p[i]=n+1;
for (int i=n;i>=1;i--)
{
nxt[i]=p[a[i]];
p[a[i]]=i;
}
if (a[n]==0)
{
ans=ksm(2,s[n]-1);
for (int i=1;i<(1<<20);i++) inc(ans,solve(i));
}
else ans=solve2(a[n]);
cout<<ans;
return 0;
//NOTICE LONG LONG!!!!!
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define vvl vector<vector<long long>>
#define vvi vector<vector<int>>
#define vvb vector<vector<bool>>
#define vb vector<bool>
#define vpli vector<pair<long long, int>>
#define vs vector<string>
#define deb(x) cout << x << endl;
#define all(x) x.begin(), x.end()
vector<vvi> dp;
int M = 1e9 + 7;
vi k;
int d;
void modadd(int &a, int b)
{
a = (a + b) % M;
if(a<0)
a+= M;
}
int helper(int pos, bool full, int sum)
{
if (pos == k.size())
return (sum == 0);
if (dp[pos][full][sum] != -1)
return dp[pos][full][sum];
int limit = (full ? (k[pos]) : (9));
int ans = 0;
for (int i = 0; i <= limit; i++)
{
modadd(ans, helper(pos + 1, full && (i == limit), (sum+i)%d ) );
}
dp[pos][full][sum] = ans;
return ans;
}
void solve()
{
string s;
cin >> s >> d;
k.resize(s.size());
for (int i = 0; i < s.size(); i++)
{
k[i] = s[i] - '0';
}
dp.resize(s.size());
for (vvi &t : dp)
{
t.resize(2);
for (vi &u : t)
{
u.resize(d+1);
for (int &x : u)
x = -1;
}
}
cout << ((helper(0, 1, 0)-1+M)%M)<<endl;
}
int main()
{
int t = 1;
//cin>>t;
while (t--)
{
solve();
}
return 0;
} | #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);
}
const int N = 1e5+34;
int a[N];
void solve() {
int n; scanf("%d", &n);
int sum = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", a+i);
sum += abs(a[i]-a[i-1]);
}
sum += abs(a[n]);
debug(sum);
for (int i = 1; i <= n; ++i) {
int cur = sum-abs(a[i]-a[i-1]);
if (i == n) {
cur -= abs(a[i]);
cur += abs(a[i-1]);
} else {
cur -= abs(a[i+1]-a[i]);
cur += abs(a[i+1]-a[i-1]);
}
printf("%d\n", cur);
}
}
int main() {
init();
int t = 1; //scanf("%d", &t);
while (t--) {
solve();
}
return 0;
} | 0 |
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <utility>
#include <cstring>
#define NOT_DEFINED 2
#define NORMAL 1
#define IRREGULAR 0
using namespace std;
typedef struct {
int battery;
int motor;
int cable;
bool hasSucceeded;
} Query;
struct IsSuccess {
bool operator()(Query &a, Query &b) const {
return (a.hasSucceeded < b.hasSucceeded);
}
};
char parts[300];
int main() {
while (1) {
int i, a, b, c;
int N;
priority_queue<Query, vector<Query>, IsSuccess> queries;
scanf("%d %d %d", &a, &b, &c);
if (a == 0 && b == 0 && c ==0) {
return 0;
}
scanf("%d", &N);
for (i=0;i<N;i++) {
int i, j, k ,r;
Query query;
scanf("%d %d %d %d", &i, &j, &k, &r);
query.battery = i-1;
query.motor = j-1;
query.cable = k-1;
query.hasSucceeded = r;
queries.push(query);
}
memset(parts, NOT_DEFINED, 300);
while (!queries.empty()) {
int i, j, k, r;
Query query = queries.top();
i = query.battery;
j = query.motor;
k = query.cable;
r = query.hasSucceeded;
if (r) {
parts[i] = NORMAL;
parts[j] = NORMAL;
parts[k] = NORMAL;
} else {
if (parts[i] == NORMAL && parts[j] == NORMAL) {
parts[k] = IRREGULAR;
}
if (parts[j] == NORMAL && parts[k] == NORMAL) {
parts[i] = IRREGULAR;
}
if (parts[k] == NORMAL && parts[i] == NORMAL) {
parts[j] = IRREGULAR;
}
}
queries.pop();
}
for (i=0;i<a+b+c;i++) {
printf("%d\n", parts[i]);
}
}
} | #include <cstdio>
#include <algorithm>
using namespace std;
int a, b, c, N, i[1000], j[1000], k[1000], r[1000], h[301];
int main(){
while(scanf("%d%d%d", &a, &b, &c), a+b+c){
scanf("%d", &N);
for(int x = 0; x < N; x++){
scanf("%d%d%d%d", i+x, j+x, k+x, r+x);
}
fill(h, h+301, 2);
for(int x = 0; x < N; x++){
if(r[x] == 1){
h[i[x]] = h[j[x]] = h[k[x]] = 1;
}
}
for(int x = 0; x < N; x++){
if(r[x]) continue;
if(h[i[x]]%2 + h[j[x]]%2 + h[k[x]]%2 == 2){
if(h[i[x]]/2){
h[i[x]] = 0;
}
if(h[j[x]]/2){
h[j[x]] = 0;
}
if(h[k[x]]/2){
h[k[x]] = 0;
}
}
}
for(int x = 1; x <= a+b+c; x++){
printf("%d\n", h[x]);
}
}
return 0;
} | 1 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
#include <cassert>
#include <bitset>
using namespace std;
using LL = long long;
//??°?????????lowlink???????????????????????¢????????¨??????????????????
//?¨??????? O(|V|+|E|)
void lowlink(vector<int>graph[], int n, vector<int>&low, vector<pair<int, int>>&br, vector<int>&jnt) {
low.resize(n);
vector<int>ord(n);//DFS?????????
vector<bool>vis(n);//?¨???????????????????
//?????°????????????
function<void(int, int, int&)>dfs = [&](int v, int p, int &k) {
vis[v] = true;
ord[v] = k++;
low[v] = ord[v];
bool joint = false;
int cnt = 0;
for (auto nxt : graph[v]) {
if (!vis[nxt]) {
cnt++;
dfs(nxt, v, k);
low[v] = min(low[v], low[nxt]);
if (p >= 0 && ord[v] <= low[nxt]) joint = true;
if (ord[v] < low[nxt])br.push_back({ min(v,nxt),max(v,nxt) });
}
else if (nxt != p) {
low[v] = min(low[v], ord[nxt]);
}
}
if (p < 0 && cnt > 1) joint = true;
if (joint) jnt.push_back(v);
};
int k = 0;
for (int i = 0; i < n; ++i)
if (!vis[i])dfs(i, -1, k);
}
int N, M;
vector<int>graph[123456];
int main(void)
{
cin >> N >> M;
for (int i = 0; i < M; ++i) {
int s, t;
cin >> s >> t;
graph[s].push_back(t);
graph[t].push_back(s);
}
vector<int>low, jnt;
vector<pair<int, int>>br;
lowlink(graph, N, low, br, jnt);
sort(jnt.begin(), jnt.end());
for (int i : jnt) {
cout << i << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using i64 = long;
struct BitVector
{
vector<uint64_t> v;
vector<int> r;
BitVector(){}
void build(){
r.assign((int)v.size() + 1, 0);
for(int i = 0; i < (int)v.size(); ++i)
r[i + 1] = r[i] + __builtin_popcountll(v[i]);
}
bool access(int x){
return (v[x >> 6] >> (x & 63)) & 1;
}
// [0, x)の1の出現回数
int rank(int x){
return r[x >> 6] + __builtin_popcountll(v[x >> 6] & ((1uLL << (x & 63)) - 1));
}
int rank(int x, bool fl){
return fl ? rank(x) : x - rank(x);
}
};
template <typename T, int W>
struct WaveletMatrix
{
array<BitVector, W> bv;
array<int, W> zero_cnt;
WaveletMatrix(vector<T>& a){
int n = a.size();
vector<T> v(a);
for(int i = W - 1; i >= 0; --i){
vector<uint64_t> b((n >> 6) + 1, 0);
vector<T> v1, v2;
for(int j = 0; j < n; ++j){
((v[j] >> i) & 1 ? v2 : v1).push_back(v[j]);
b[j >> 6] |= uint64_t((v[j] >> i) & 1) << (j & 63);
}
for(int j = 0; j < (int)v.size(); ++j)
v[j] = (j < (int)v1.size() ? v1[j] : v2[j - (int)v1.size()]);
bv[i].v = move(b);
bv[i].build();
zero_cnt[i] = bv[i].rank(n, 0);
}
}
// [l, r)内のxの数
int count(int l, int r, T x){
for(int i = W - 1; i >= 0; --i){
bool fl = (x >> i) & 1;
int st = bv[i].rank(l, fl);
int en = bv[i].rank(r, fl);
l = (fl ? zero_cnt[i] : 0) + st;
r = (fl ? zero_cnt[i] : 0) + en;
}
return r - l;
}
// [l, r)内で[0, x)を満たす値の数
int count_lower(int l, int r, T x){
int cnt = 0;
for(int i = W - 1; i >= 0; --i){
bool fl = (x >> i) & 1;
int st = bv[i].rank(l, fl);
int en = bv[i].rank(r, fl);
if(fl){
st += zero_cnt[i];
en += zero_cnt[i];
cnt += (bv[i].rank(r, 0) - bv[i].rank(l, 0));
}
l = st, r = en;
}
return cnt;
}
// [l, r)内で[x, y)を満たす値の数
int count_range(int l, int r, T x, T y){
return count_lower(l, r, y) - count_lower(l, r, x);
}
// 0-indexedでk番目に小さいものを返す
T kth_min(int l, int r, int k){
T ans = 0;
for(int i = W - 1; i >= 0; --i){
int st = bv[i].rank(l, 0);
int en = bv[i].rank(r, 0);
if(en - st <= k){
k -= en - st;
l = zero_cnt[i] + bv[i].rank(l, 1);
r = zero_cnt[i] + bv[i].rank(r, 1);
ans |= (1uLL << i);
}
else{
l = st, r = en;
}
}
return ans;
}
// [l, r)でのx以上最小値
pair<T, bool> predecessor(int l, int r, T x){
int idx = count_lower(l, r, x);
if(idx == r - l){
return make_pair((1uLL << W) - 1, false);
}
return make_pair(kth_min(l, r, idx), true);
}
// [l, r)でのx以下最大値
pair<T, bool> successor(int l, int r, T x){
int idx = count_lower(l, r, x + 1);
if(idx == 0)
return make_pair(0, false);
return make_pair(kth_min(l, r, idx - 1), true);
}
};
#define rep(i,N) for(int i=0;i<(int)N;i++)
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline int IN(void)
{
int x=0,f=0,c=getchar();while(c<48||c>57){f^=c==45,c=getchar();}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f?-x:x;
}
static inline void OUT(int a)
{
if(a<0)PUT('-'),a=-a;
int d[40],i=0;do{d[i++]=a%10;}while(a/=10);
while(i--){PUT(d[i]+48);}PUT('\n');
}
int main()
{
int N=IN(),Q=IN(),mn=N,mx=0,C[N],temp[N];
vector<int>direction(N);
rep(i,N){C[i]=IN();mn=mn<C[i]?mn:C[i];mx=mx>C[i]?mx:C[i];temp[i]=N;}
rep(i,N){direction[N-1-i]=temp[C[N-1-i]-1];temp[C[N-1-i]-1]=N-1-i;}
WaveletMatrix<int,20> wm(direction);
while(Q--){int l=IN()-1,r=IN();OUT(wm.count_range(l,r,r,N+1));}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;cin>>n>>k;
int ans = 0; if (n%k > 0) ans++;
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
if(N % K == 0){
cout << "0" << endl;
}else{
cout << "1" << endl;
}
return 0;
} | 1 |
#include <algorithm>
#include <cstdio>
static const size_t n_max = 200000;
static int S[n_max], L[n_max], R[n_max];
static long long c = 0;
void merge_sort(size_t i, size_t j) {
switch (j - i) {
case 0:
case 1:
break;
case 2:
if (S[i+1] < S[i]) {
c++;
std::swap(S[i], S[i+1]);
}
break;
default:
size_t k = (i + j) / 2;
merge_sort(i, k);
merge_sort(k, j);
std::copy(S + i, S + k, L);
std::copy(S + k, S + j, R);
for (size_t l = i, p = 0, q = 0;; l++) {
if (p < k - i && q < j - k) {
if (L[p] <= R[q])
S[l] = L[p++];
else {
c += k - i - p;
S[l] = R[q++];
}
} else if (p < k - i)
S[l]= L[p++];
else if (q < j - k)
S[l] = R[q++];
else
break;
}
break;
}
}
int main() {
size_t n;
scanf("%zu", &n);
for (size_t i = 0; i < n; i++)
scanf("%d", S + i);
merge_sort(0, n);
printf("%lld\n", c);
return 0;
} | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
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;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin>>N;
vector<int> L(N);
rep(i,N) cin>>L[i];
int ans = 0;
for(int i=0; i<N; ++i) {
for(int j=i+1; j<N; ++j) {
for(int k=j+1; k<N; ++k) {
if((L[i] != L[j]) && (L[j] != L[k]) && (L[i] !=L[k])) {
if((abs(L[i]-L[j]) < L[k]) && (L[k] < (L[i]+L[j]))) {
++ans;
}
}
}
}
}
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int k[101];
char s[101];
int main() {
vector<char>v;
for (char c = 'a'; c <= 'z'; c++)v.push_back(c);
for (char c = 'A'; c <= 'Z'; c++)v.push_back(c);
int n;
while (scanf("%d", &n), n) {
rep(i, n)scanf("%d", &k[i]);
scanf("%s", s);
int len = strlen(s);
rep(i, len) {
s[i] = v[(find(v.begin(), v.end(), s[i]) - v.begin() + 52 - k[i%n]) % 52];
}
puts(s);
}
} | #include <iostream>
#include <string>
using namespace std;
#define KEY_NUM 100
char process_key(char c, int key) {
int num=0;
//cout << "[" << c << "," << key << "," << num << "]";
if ('a' <= c && c <= 'z') {
num = 25 - (int)('z' - c);
}
if ('A' <= c && c <= 'Z') {
num = 51 - (int)('Z' - c);
}
num = (num - key + 104) % 52;
if ( 0 <= num && num <= 25) {
c = 'a' + num;
}
if (26 <= num && num <= 51) {
c = 'A' + (num - 26);
}
//cout << "[" << c << "," << key << "," << num << "]";
return c;
}
int main(void) {
string s;
int n;
int keys[KEY_NUM];
while (cin >> n, n) {
for (int i=0; i<n; i++) {
cin >> keys[i];
}
cin >> s;
//cout << n << endl;
for (int i=0; i<s.size(); i++) {
//cout << process_key(s[i], keys[i % n]) << "_";
cout << process_key(s[i], keys[i % n]);
}
//cout << s << endl;
cout << endl;
}
} | 1 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <utility>
#include <stack>
#include <queue>
#include <set>
#include <list>
#include <bitset>
#include <array>
using namespace std;
#define fi first
#define se second
#define long long long
typedef pair<int,int> ii;
vector<long> vec;
bool prime(int x)
{
for(int i = 2; i <= sqrt(x); i++)
{
if(x%i == 0)
return 0;
}
return 1;
}
long MAXN = 500;
long A[503][503];
long gcd(long a, long b) {return (b)? gcd(b,a%b) : a;}
long lcm(long a, long b)
{
if(a == b && b == 0) return 0;
else if(a == 0) return b;
else if(b == 0) return a;
else return a/gcd(a,b)*b;
}
int main()
{
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen("input.in", "r", stdin);
for(int i = 2; i <= 10000; i++)
if(prime(i))
vec.push_back(i);
int n; scanf("%d", &n);
int idx = 0;
for(int i = 1; i <= MAXN; i+=2)
{
int x = 1, y = i;
while(y <= MAXN)
A[x++][y++] = vec[idx];
idx++;
}
for(int i = 3; i <= MAXN; i+=2)
{
int x = i, y = 1;
while(x <= MAXN)
A[x++][y++] = vec[idx];
idx++;
}
for(int i = 1; i <= MAXN; i+=2)
{
int x = 1, y = i;
while(y >= 1 && x <= MAXN)
A[x++][y--] *= vec[idx];
idx++;
}
for(int i = MAXN; i >= 2; i-=2)
{
int x = i, y = MAXN;
while(y >= 1 && x <= MAXN)
A[x++][y--] *= vec[idx];
idx++;
}
long mx = 0;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(A[i][j] == 0) A[i][j] = lcm(lcm(A[i-1][j],A[i][j-1]),lcm(A[i+1][j],A[i][j+1]))+1;
// mxnax(A[i][j],mx);
printf("%lld", A[i][j]);
if(j < n) printf(" ");
}
printf("\n");
}
// printf("%lld\n", mx);
}
| #include<bits/stdc++.h>
#define rg register
#define oo 0x7fffffff
#define ll long long
using namespace std;
inline int read()
{
int out=0,fh=1;
char jp=getchar();
while ((jp>'9'||jp<'0')&&jp!='-')
jp=getchar();
if (jp=='-')
{
fh=-1;
jp=getchar();
}
while (jp>='0'&&jp<='9')
{
out=out*10+jp-'0';
jp=getchar();
}
return out*fh;
}
const int MAXN=5e2+10;
const int MAXM=1e5+10;
int n;
ll Mat[MAXN][MAXN];
int pcnt=0,prime[MAXM],vis[MAXM];
void Linear_Shaker()
{
for(rg int i=2;i<=MAXM;++i)
{
if(!vis[i])
prime[++pcnt]=i;
for(rg int j=1;i*prime[j]<=MAXM;++j)
{
vis[i*prime[j]]=1;
if(i % prime[j]==0)
break;
}
}
}
ll GCD(ll x,ll y)
{
return y==0? x: GCD(y,x%y);
}
ll LCM(ll x,ll y)
{
return x / GCD(x,y) * y;
}
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
n=read();
if(n==2)
{
printf("4 7\n23 10");
return 0;
}
Linear_Shaker();
for(rg int i=1;i<=n;++i)
for(rg int j=1;j<=n;++j)
Mat[i][j]=1ll;
for(rg int i=1;i<=n;++i)
for(rg int j=1;j<=n;++j)
{
if((i&1)==(j&1))
{
Mat[i][j]=1ll* prime[(i+j)/2] * prime[(i+n+1-j)/2+n];
Mat[i+1][j]=LCM(Mat[i+1][j],Mat[i][j]);
Mat[i-1][j]=LCM(Mat[i-1][j],Mat[i][j]);
Mat[i][j+1]=LCM(Mat[i][j+1],Mat[i][j]);
Mat[i][j-1]=LCM(Mat[i][j-1],Mat[i][j]);
}
}
for(rg int i=1;i<=n;++i)
for(rg int j=1;j<=n;++j)
printf("%lld%c",(i&1)==(j&1)?Mat[i][j]:Mat[i][j]+1,j==n?'\n':' ');
//fclose(stdin);
//fclose(stdout);
return 0;
}
| 1 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
class dice{
private:
int s[6];
int top;
int bottom;
int r_side;
int l_side;
int face;
int rev;
public:
dice(){
top = 0;
bottom = 5;
r_side = 2;
l_side = 3;
face = 1;
rev = 4;
s[0] = 1;
s[1] = 2;
s[2] = 3;
s[3] = 4;
s[4] = 5;
s[5] = 6;
}
dice(int a[5]){
top = 0;
bottom = 5;
r_side = 2;
l_side = 3;
face = 1;
rev = 4;
REP(i, 6) s[i] = a[i];
}
dice(int x, int y, int z, int u, int v, int w){
top = 0;
bottom = 5;
r_side = 2;
l_side = 3;
face = 1;
rev = 4;
s[0] = x;
s[1] = y;
s[2] = z;
s[3] = u;
s[4] = v;
s[5] = w;
}
int get_top() {
return s[top];
}
int get_bottom(){
return s[bottom];
}
int get_r_side(){
return s[r_side];
}
int get_l_side(){
return s[l_side];
}
int get_face(){
return s[face];
}
int get_rev(){
return s[rev];
}
int set_top(int i) {
top = i;
bottom = 5 - top;
r_side = (i+1)%5;
l_side = 5 - r_side;
face = (i+2)%5;
rev = 5 - face;
return s[top];
}
int rotate_r(int i) {
while(i<0)
i+=4;
i %= 4;
REP(j, i){
int temp = face;
face = r_side;
r_side = rev;
rev = l_side;
l_side = temp;
}
return s[top];
}
int roll_r(int i) {
while(i<0)
i+=4;
i %= 4;
REP(j, i){
int temp = top;
top = l_side;
l_side = bottom;
bottom = r_side;
r_side = temp;
}
return s[top];
}
int roll_f(int i){
while(i<0)
i+=4;
i %= 4;
REP(j, i){
int temp = top;
top = face;
face = bottom;
bottom = rev;
rev = temp;
}
return s[top];
}
};
int main() {
int in[6];
REP(i, 6) cin >> in[i];
dice d = dice(in);
string roll;
cin >> roll;
while(roll.size() != 0){
string order = roll.substr(0, 1);
if(order == "E")
d.roll_r(1);
else if(order == "S")
d.roll_f(-1);
else if(order == "N")
d.roll_f(1);
else if(order == "W")
d.roll_r(-1);
roll = roll.substr(1);
}
cout << d.get_top() << endl;
return 0;
} | #include <stdio.h>
struct Dice
{
int n[6];
};
Dice InputDice()
{
Dice d;
for(int i = 0; i < 6; ++i)
{
scanf("%d", &d.n[i]);
}
return d;
}
Dice SetDice(int a, int b, int c, int d, int e, int f)
{
Dice dice;
dice.n[0] = a;
dice.n[1] = b;
dice.n[2] = c;
dice.n[3] = d;
dice.n[4] = e;
dice.n[5] = f;
return dice;
}
Dice Roll(Dice dice, char dir)
{
switch(dir)
{
case 'N':
return SetDice(dice.n[1], dice.n[5], dice.n[2], dice.n[3], dice.n[0], dice.n[4]);
case 'S':
return SetDice(dice.n[4], dice.n[0], dice.n[2], dice.n[3], dice.n[5], dice.n[1]);
case 'W':
return SetDice(dice.n[2], dice.n[1], dice.n[5], dice.n[0], dice.n[4], dice.n[3]);
case 'E':
return SetDice(dice.n[3], dice.n[1], dice.n[0], dice.n[5], dice.n[4], dice.n[2]);
}
}
bool IsSame(Dice a, Dice b)
{
for(int i = 0; i < 6; ++i)
{
if(a.n[i] != b.n[i])
{
return false;
}
}
return true;
}
bool IsEqual(Dice a, Dice b)
{
char cmd[25] = "NNNNWNNNWNNNENNNENNNWNNN";
for(int i = 0; i < 24; ++i)
{
b = Roll(b, cmd[i]);
if(IsSame(a, b))
{
return true;
}
}
return false;
}
int FindTop(Dice a, int top, int front)
{
char cmd[25] = "NNNNWNNNWNNNENNNENNNWNNN";
for(int i = 0; i < 24; ++i)
{
a = Roll(a, cmd[i]);
if(a.n[0] == top && a.n[1] == front)
{
return a.n[2];
}
}
return -1;
}
int main()
{
Dice D = InputDice();
char cmd[128];
scanf("%s", cmd);
for(int i = 0; cmd[i] != 0; ++i)
{
D = Roll(D, cmd[i]);
}
printf("%d\n", D.n[0]);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100001,INF=1<<30;
vector<int> S[MAX],color(MAX,0),odd,even;
void DFS(int u){
int cnt=1;
bool ok=true;
stack<int> ST;
color[u]=1;
ST.push(u);
while(!ST.empty()){
int a=ST.top();
ST.pop();
for(int i=0;i<S[a].size();i++){
int b=S[a][i];
if(color[b]==0){
if(color[a]==1){
color[b]=2;
ST.push(b);
cnt++;
}else{
color[b]=1;
ST.push(b);
cnt++;
}
}else if(color[a]==color[b]){
ok=false;
}
}
}
if(ok) even.push_back(cnt);
else odd.push_back(cnt);
return;
}
int main(){
int N,M;cin>>N>>M;
for(int i=0;i<M;i++){
int a,b;cin>>a>>b;
a--;b--;
S[a].push_back(b);
S[b].push_back(a);
}
for(int i=0;i<N;i++){
if(S[i].size()==0||color[i]) continue;
DFS(i);
}
int rem=N;
ll ans=0;
for(int i=0;i<odd.size();i++){
rem-=odd[i];
}
for(int i=0;i<even.size();i++){
rem-=even[i];
}
ans+=odd.size()+even.size()*2;
ans+=ll(N)*ll(N)-ll((N-rem))*ll((N-rem));
ans+=ll(4)*ll(even.size())*ll((even.size()-1))/2;
ans+=ll(2)*ll(even.size())*ll(odd.size());
ans+=ll(2)*ll(odd.size())*ll((odd.size()-1))/2;
cout<<ans<<endl;
//cout<<rem<<" "<<odd.size()<<" "<<even.size()<<endl;
}
| #include<bits/stdc++.h>
#define mo 1000000007
using namespace std;
long long read(){
long long xx=0,flagg=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')
ch=getchar();
if(ch=='-'){
flagg=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
xx=xx*10+ch-'0';
ch=getchar();
}
return xx*flagg;
}
void pus(long long xx,long long flagg){
if(xx<0){
putchar('-');
xx=-xx;
}
if(xx>=10)
pus(xx/10,0);
putchar(xx%10+'0');
if(flagg==1)
putchar(' ');
if(flagg==2)
putchar('\n');
return;
}
long long ksm(long long u,long long v){
long long o=1;
while(v){
if(v&1)
o=o*u%mo;
u=u*u%mo;
v>>=1;
}
return o;
}
long long n,m,i,j,x,y,flag,book[100005],sd[100005],sum,c,p,ans;
long long top,nex[400005],to[400005],fir[100005];
void lj(int u,int v){
top++;
nex[top]=fir[u];
fir[u]=top;
to[top]=v;
}
void ss(int v,int w){
sd[v]=w;
for(int top1=fir[v];top1;top1=nex[top1])
if(sd[to[top1]]==0)
ss(to[top1],w+1);
else if(sd[v]>sd[to[top1]]){
if((sd[v]-sd[to[top1]]&1)==0)
flag=1;
}
}
int main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
n=read();m=read();
for(i=1;i<=m;i++){
x=read();y=read();
lj(x,y);
lj(y,x);
book[x]=1;
book[y]=1;
}
for(i=1;i<=n;i++)
if(book[i]==0)
sum++;
for(i=1;i<=n;i++)
if(book[i]==1&&sd[i]==0){
flag=0;
ss(i,1);
if(flag==1)
p++;
else
c++;
}
ans=sum*n*2-sum*sum+c*c*2+p*(p+c*2);
pus(ans,2);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
// macros
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#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 FOR(i,a,b) for(int i=(a);i<(b);i++)
#define PB push_back
#define EB emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
string a,b,c;
cin>>a>>b>>c;
ll ans=0;
REP(i,n){
map<ll,ll> m;
m[a[i]-'a']+=1;
m[b[i]-'a']+=1;
m[c[i]-'a']+=1;
ll h=0;
REP(j,26)
h=max(h,m[j]);
ans+=3-h;
//cout<<n-h<<endl;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
namespace FAST_IO
{
template<typename T> void read(T &a)
{
a=0;
int f=1;
char c=getchar();
while(!isdigit(c))
{
if(c=='-')
{
f=-1;
}
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
a=a*f;
}
template <typename T> void write(T a)
{
if(a<0)
{
a=-a;
putchar('-');
}
if(a>9)
{
write(a/10);
}
putchar(a%10+'0');
}
template <typename T> void writeln(T a)
{
write(a);
puts("");
}
}
int n,ans;
string a,b,c;
int main()
{
cin>>n>>a>>b>>c;
for(int i=0;i<n;i++)
{
if(a[i]==b[i]||a[i]==c[i]||b[i]==c[i])
{
if(!(a[i]==b[i]&&b[i]==c[i]))
{
ans++;
}
}
else
{
ans+=2;
}
}
cout<<ans;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int k,x;
cin >> k >> x ;
for(int i=1; i<k*2; i++){
cout << x-k+i << " " << flush;
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include "E:\CP\Debugger\debugger.h"
#else
#define debug(x...)
#endif
#define int long long
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define TC int tc; cin>>tc; for(int cn=1; cn<=tc; ++cn)
const int mx = 2e6+2, neg = -1e6, pos = 1e6;
bitset<mx> vis;
signed main(){
int k, x;
cin>>k>>x;
int st = (x-k+1 >= neg? x-k+1: neg);
int ed = (x+k-1 <= pos? x+k-1: pos);
for(int i= st; i<=ed; ++i)
cout<<i<<' ';
return 0;
} | 1 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
string s;
cin >> s;
int a = (s[0] - '0');
int b = (s[1] - '0');
int c = (s[2] - '0');
int d = (s[3] - '0');
for(int op1 = -1; op1 <= 1; op1 += 2)
for(int op2 = -1; op2 <= 1; op2 += 2)
for(int op3 = -1; op3 <= 1; op3 += 2)
{
if (a + b * op1 + c * op2 + d * op3 == 7)
{
cout << a;
cout << (op1 == -1 ? '-' : '+');
cout << b;
cout << (op2 == -1 ? '-' : '+');
cout << c;
cout << (op3 == -1 ? '-' : '+');
cout << d;
cout << "=7";
return;
}
}
}
int main()
{
fastio;
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string input;
int tmp = 0;
char op[3] = {'+','+','+'};
cin >> input;
for(int bit = 0; bit < (1<< 3); bit++){
tmp = 0;
for(int i = 0;i<3;i++){
if(bit & (1 << i)){
op[i] = '-';
tmp += (input[i+1] - '0') * (-1);
}else{
op[i] = '+';
tmp += (input[i+1] - '0');
}
}
tmp += input[0] - '0';
if(tmp == 7)break;
}
for(int i = 0; i<3;i++){
cout << input[i] << op[i];
}
cout << input[3] << "=7" << endl;
return 0;
} | 1 |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,d,e,n,k,maxi=0,f=0,mini=INF,sum=0,q;
string str,stra,straa;
ll x,y,w,z;
char ca,cb,cc;
cin>>a>>b;
cout<<max(a+b,max(a-b,a*b))<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
swap(a,b);
swap(a,c);
cout<<a<<" "<<b<<" "<<c;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
int main() {
ll n;
string s;
cin >> n >> s;
for(ll j=0;j<4;j++) {
vec a(n);
a[0]=j&1;
a[1]=(j>>1)&1;
for(ll i=1;i<n-1;i++) {
ll c=i%n;
if(a[c]) {
if(s[c]=='o') {
a[(c+1)%n]=a[(c-1)%n];
}
else {
a[(c+1)%n]=1-a[(c-1)%n];
}
}
else {
if(s[c]=='x') {
a[(c+1)%n]=a[(c-1)%n];
}
else {
a[(c+1)%n]=1-a[(c-1)%n];
}
}
}
ll f=1;
for(ll i=0;i<2;i++) {
if(a[(n+i-1)%n]) {
if(s[(n+i-1)%n]=='o') {
if(a[(n+i-2)%n]!=a[i])f=0;
}
else {
if(a[(n+i-2)%n]==a[i])f=0;
}
}
else {
if(s[(n+i-1)%n]=='x') {
if(a[(n+i-2)%n]!=a[i])f=0;
}
else {
if(a[(n+i-2)%n]==a[i])f=0;
}
}
}
if(f) {
for(ll i=0;i<n;i++) {
if(a[i]) {
cout << "S";
}
else {
cout << "W";
}
}
cout << endl;
return 0;
}
}
cout << -1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
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; }
vector<char> ans(100100, '.');
int n;
string s;
void swcheck(vector<char> &sw) {
for(int i = 1; i < n; ++i) {
if(s.at(i) == 'o') {
if(sw.at(i) == 'S') {
if(sw.at(i-1) == 'S') sw.at(i+1) = 'S';
else sw.at(i+1) = 'W';
}else {
if(sw.at(i-1) == 'S') sw.at(i+1) = 'W';
else sw.at(i+1) = 'S';
}
}else {
if(sw.at(i) == 'S') {
if(sw.at(i-1) == 'S') sw.at(i+1) = 'W';
else sw.at(i+1) = 'S';
}else {
if(sw.at(i-1) == 'S') sw.at(i+1) = 'S';
else sw.at(i+1) = 'W';
}
}
}
}
bool lacheck(vector<char> &sw) {
if(sw.at(0) == sw.at(n)) {
if(s.at(0) == 'o') {
if(sw.at(0) == 'S') {
if(sw.at(n-1) == sw.at(1)) return true;
}else {
if(sw.at(n-1) != sw.at(1)) return true;
}
}else {
if(sw.at(0) == 'S') {
if(sw.at(n-1) != sw.at(1)) return true;
}else {
if(sw.at(n-1) == sw.at(1)) return true;
}
}
}
return false;
}
void swprint(vector<char> &sw) {
for(int i = 0; i < n; ++i) {
if(i == n-1) cout << sw.at(i) << endl;
else cout << sw.at(i);
}
}
int main() {
cin >> n >> s;
ans.at(0) = 'S'; ans.at(1) = 'S';
swcheck(ans);
if(lacheck(ans)) {
swprint(ans); return 0;
}
ans.at(0) = 'S'; ans.at(1) = 'W';
swcheck(ans);
if(lacheck(ans)) {
swprint(ans); return 0;
}
ans.at(0) = 'W'; ans.at(1) = 'S';
swcheck(ans);
if(lacheck(ans)) {
swprint(ans); return 0;
}
ans.at(0) = 'W'; ans.at(1) = 'W';
swcheck(ans);
if(lacheck(ans)) {
swprint(ans); return 0;
}
cout << -1 << endl;
} | 1 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
using namespace std;
int main()
{
string s;
for (; getline(cin, s); )
{
stringstream ss;
ss << s;
vector<int> l(10);
int v0, v1;
for (int i = 0; i < 10; i++)
{
ss >> l.at(i);
ss.ignore();
l.at(i) *= 1000;
}
int d0 = 0;
int d1 = accumulate(l.begin(), l.end(), 0);
ss >> v0;
ss.ignore();
ss >> v1;
for (; d0 < d1;)
{
d0 += v0;
d1 -= v1;
}
int ll = 0;
int x = 0;
for (int i = 0; i < 10; i++)
{
ll += l.at(i);
if (ll >= d0)
{
x = i + 1;
break;
}
}
cout << x << endl;
}
}
| #include <stdio.h>
int main(void){
int n, a[100], i, j;
char c, s[53] = {"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"};
while(1){
scanf("%d",&n);
if(!n) break;
for(i = 0;i < n;i++)
scanf("%d",&a[i]);
getchar();
for(i = 0;(c = getchar()) != '\n';i++){
for(j = 0;j < 52;j++){
if(s[j] == c)
printf("%c",s[(52 + j - a[i % n]) % 52]);
}
}
printf("\n");
}
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
int main(){
string s;
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++){
getline(cin,s);
while (1){
int index = s.find("Hoshino");
if (index == -1) break;
s.replace(index,7,"Hoshina");
}
cout << s << endl;
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string S;
cin>>S;
if(S[0]!='A'){
cout<<"WA";
return 0;
}
bool Cflag=0;
if('a'<=S[1]&&S[1]<='z'){
}
else{
cout<<"WA";
return 0;
}
for(size_t i=2;i<=S.length()-2;i++){
if(S[i]=='C'){
if(Cflag==1){
cout<<"WA";
return 0;
}
Cflag=1;
}
else if('a'<=S[i]&&S[i]<='z'){
}
else{
cout<<"WA";
return 0;
}
}
if('a'<=S[S.length()-1]&&S[S.length()-1]<='z'&&Cflag==1){
}
else{
cout<<"WA";
return 0;
}
cout<<"AC";
return 0;
} | 0 |
#define alphanso \
ios_base::sync_with_stdio(0); \
cin.tie(NULL)
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main()
{
alphanso;
int n, k, i, gcd = 0, x, mx = INT_MIN;
cin >> n >> k;
for (i = 1; i <= n; i++)
{
cin >> x;
gcd = __gcd(gcd, x);
mx = max(mx, x);
}
if (mx < k)
cout << "IMPOSSIBLE";
else
!(k % gcd) ? cout << "POSSIBLE" : cout << "IMPOSSIBLE";
return 0;
} | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <string.h>
#define s(n) scanf("%d",&n)
#define sc(n) scanf("%c",&n)
#define sl(n) scanf("%I64d",&n)
#define sf(n) scanf("%lf",&n)
#define ss(n) scanf("%s",n)
#define INF (int)1e9
#define EPS 1e-9
#define bitcount __builtin_popcount
#define gcd __gcd
#define forall(i,a,b) for(int i=a;i<b;i++)
#define foreach(v, c) for( typeof( (c).begin()) v = (c).begin(); v != (c).end(); ++v)
#define all(a) a.begin(), a.end()
#define in(a,b) ( (b).find(a) != (b).end())
#define pb push_back
#define fill(a,v) memset(a, v, sizeof a)
#define sz(a) ((int)(a.size()))
#define mp make_pair
#define MOD 1000000007
typedef long long ll;
/*For you see , each day i love you
more.Today more than yesterday
less than tomorrow.*/
using namespace std;
int main()
{
int n,m;cin>>n>>m;
int maxi = 0;
for(int i = 1;i*i<=m;i++)
{
if(m%i) continue;
int b = m/i;
if(b >= n) maxi = max(maxi , i);
if(i >= n) maxi = max(maxi , b);
}
cout<<maxi<<endl;
return 0;
} | 0 |
#include <stdio.h>
int main(){
int n;
scanf("%d", &n);
long long int total = 0;
for (int i = 1; i <= n; i++){
if (i % 3 != 0 && i % 5 != 0){
total += i;
}
}
printf("%lld", total);
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
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;}
template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >>p.second ;
return is;
}
template <class T>istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) {
is >> v[i];
}
return is;
}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
ll x;
ll ans=0LL;
cin >>x;
ans += x / 500 * 1000;
x %= 500;
ans += x / 5 * 5;
cout<<ans<<endl;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,a[1010][1010],h[1000100],dist[1000100];
vector<int>to[1000100];
int encode(int i, int j){
if(i>j)swap(i,j);
return i*n+j;
}
int main(){
cin>>n;
rep(i,n)rep(j,n-1){
cin>>a[i][j];
a[i][j]--;
}
rep(i,n)rep(j,n-2){
int v=encode(i,a[i][j]);
int u=encode(i,a[i][j+1]);
to[v].push_back(u);
h[u]++;
}
stack<int>st;
rep(i,n*n)if(h[i]==0)st.push(i),dist[i]=1;
while(st.size()){
int v=st.top(); st.pop();
for(int u:to[v]){
h[u]--;
if(h[u]==0)st.push(u);
dist[u]=max(dist[u],dist[v]+1);
}
}
int mx=0,in=0;
rep(i,n*n)mx=max(mx,dist[i]);
rep(i,n*n)in=max(in,h[i]);
if(in!=0)cout<<-1<<endl;
else cout<<mx<<endl;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <array>
#include <list>
#include <stack>
#include <valarray>
using namespace std;
typedef unsigned uint;
typedef long long Int;
typedef unsigned long long UInt;
const int INF = 1001001001;
const Int INFLL = 1001001001001001001LL;
template<typename T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<typename T> void chmin(T& a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T& a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
double fin() { double x; scanf("%lf", &x); return x; }
Int lin() { Int x; scanf("%lld", &x); return x; }
Int P[5050];
pair<int, int> A[5050];
int main() {
int N = in();
P[0] = 0;
for (int u = 1; u <= N; ++u) {
P[u] = INFLL;
}
for (int i = 0; i < N; ++i) {
A[i].first = in();
A[i].second = in();
}
sort(A, A + N, [] (const pair<int, int>& a, const pair<int, int>& b) {
return a.first + a.second < b.first + b.second;
});
for (int i = 0; i < N; ++i) {
int H = A[i].first;
int Z = A[i].second;
for (int u = i; u >= 0; --u) {
if (P[u] <= H) {
chmin(P[u + 1], P[u] + Z);
}
}
}
int res = 0;
for (int u = 0; u <= N; ++u) {
if (P[u] < INFLL) {
chmax(res, u);
}
}
printf("%d\n", res);
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
int a,b,c,d;
cin >> a >> b >>c >>d;
int ans = min(a,b) + min(c,d);
cout << ans << endl;
return 0;
}
|
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <type_traits>
using namespace std;
#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}
using LL = long long;
//------------------------------------------
//------------------------------------------
constexpr int MAX_N = 200200;
constexpr LL mod = 1e9 + 7;
LL mul[MAX_N];
LL inv[MAX_N];
LL POW_MOD(LL N, LL P, LL M) {
LL ret = 1;
while (P > 0) {
if (P & 1LL) ret = (ret * N) % M;
N = (N * N) % M;
P >>= 1LL;
}
return ret;
}
void setup() {
mul[0] = mul[1] = 1;
inv[0] = inv[1] = 1;
for (LL i = 2; i <= MAX_N - 2; i++) {
mul[i] = mul[i - 1] * i;
mul[i] %= mod;
inv[i] = POW_MOD(mul[i], mod - 2, mod);
}
}
LL nCr_mod(LL n, LL r) {
if (n < r) return 0;
return mul[n] * inv[r] % mod * inv[n - r] % mod;
}
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
setup();
LL ans = 0;
int y = H - A - 1;
int x = B;
while (y >= 0 && x < W) {
LL n = y + x;
LL r = y;
ans += (nCr_mod(n, r) * nCr_mod(W - x - 1 + H - y - 1, H - y - 1)) % mod;
ans %= mod;
y--;
x++;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using std::cin;
using std::cout;
using std::endl;
struct data_t {
int height;
int width;
int dia;
bool operator<( const data_t& right) const {
if (dia == right.dia) {
return (height < right.height);
}
else {
return ((dia == right.dia) || (dia < right.dia));
}
}
};
int main(void) {
int h,w;
int ind = 0;
cin >> h;
cin >> w;
int lim = ((149-1)*149)/2;
std::vector<data_t> all(lim);
for (int i = 1; i < 150; i++) {
for (int j = i+1; j < 151; j++) {
all[ind].height = i;
all[ind].width = j;
all[ind].dia = pow(i,2) + pow(j,2);
ind++;
}
}
std::sort(all.begin(), all.end());
while (h!=0||w!=0) {
int d = pow(h,2) + pow(w,2);
bool find = false;
bool pro = false;
for (int i = 0; i < lim && !find; i++) {
if (pro) {
cout << all[i].height << " " << all[i].width << endl;
find = true;
}
else {
if (h == all[i].height && w == all[i].width) {
pro = true;
}
}
}
cin >> h;
cin >> w;
}
return 0;
} | /*
My heart’s beating faster
I know what I’m after
I’ve been standing here my whole life
Everything I’ve seen twice
Now it’s time I realized
It’s spinning back around now
On this road I’m crawlin’
Save me 'cause I’m fallin’
Now I can’t seem to breathe right
'Cause I keep runnin' runnin' runnin' runnin'
Runnin' runnin' runnin' runnin'
Runnin' from my heart
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define nt _int128
#define fir first
#define sec second
#define slow_as_snail ios_base::sync_with_stdio(false) , cin.tie(NULL);
#define debug(x) cout<<x<<"\n";
#define debugged cout<<"debugged\n";
#define inf 0x3f3f3f3f
#define rall(v) v.rbegin(),v.rend()
#define all(v) v.begin(),v.end()
const ll mod = 1000000007;
#define mx 10000005
const ll mxi = 100005;
int main()
{
slow_as_snail;
ll n,l;
cin>>n>>l;
if(abs(l)>n)
{
if(l<0)
{
l = abs(l);
ll tm = l*(l+1)/2;
tm = -1*tm;
// cout<<tm<<"\n";
ll tmp = (abs(l)-n+1) * (abs(l)-n+2)/2;
cout<< tm + tmp;
}
else
{
ll tm = l+n-1;
ll tmp = l*(l+1)/2;
cout<<tm*(tm+1)/2 - tmp;
}
}
else if(abs(l)<n)
{
if(l>0)
{
ll tm = l+n-1;
ll tmp = l*(l+1)/2;
cout<<tm*(tm+1)/2 - tmp;
}
else
{
l = abs(l);
ll tm = l*(l+1)/2;
ll tmp = (n-l-1)*(n-l)/2;
cout<<tmp-tm;
}
}
else
{
if(l<0)
{
l = abs(l);
ll tmp = l*(l+1)/2;
tmp = -1*tmp;
cout<<tmp+1;
}
else
{
ll tm = l+n-1;
ll tmp = l*(l+1)/2;
cout<<tm*(tm+1)/2 - tmp;
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#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()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k; cin >> n >> k;
vector<ll> V(n); rep(i, n) cin >> V[i];
ll ans = 0;
rep(i, k+1) rep(j, k+1) {
int rem = k-(i+j);
if(rem < 0) continue;
if(i+j > n) continue;
priority_queue<ll, vector<ll>, greater<ll>> q;
rep(ii, i) q.push(V[ii]);
rep(jj, j) q.push(V[n-1-jj]);
rep(kk, rem) {
if(q.empty()) break;
if(q.top() >= 0) break;
q.pop();
}
ll sum = 0;
while(!q.empty()) {
sum += q.top();
q.pop();
}
chmax(ans, sum);
}
cout << ans << endk;
return 0;
}
| #include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000
template <typename T,typename U>
struct compressor{
vector<pair<T,U>> v;
void add(T x,U y){
v.emplace_back(x,y);
}
void compress(bool stable = false){
if(stable){
stable_sort(v.begin(),v.end(),[&] (pair<T,U> a,pair<T,U> b){
return a.first < b.first;
}
);
}
else sort(v.begin(),v.end());
vector<pair<T,U>> t;
rep(i,v.size()){
if(t.size()!=0 && t.back().first == v[i].first){
t.back().second = func(t.back().second,v[i].second);
}
else{
t.push_back(v[i]);
}
}
swap(v,t);
}
U func(U a,U b){
return a+b;
}
U e(){
return 0;
}
int size(){
return v.size();
}
pair<T,U> get(int p){
return v[p];
}
U operator[] (T &x){
auto it = lower_bound(v.begin(),v.end(),make_pair(x,e()));
if(it==v.end() || it->first!=x){
if(it!=v.begin()){
it--;
}
}
if(it==v.end() || it->first!=x){
return e();
}
else return it->second;
}
U operator[] (T x){
auto it = lower_bound(v.begin(),v.end(),make_pair(x,e()));
if(it==v.end() || it->first!=x){
if(it!=v.begin()){
it--;
}
}
if(it==v.end() || it->first!=x){
return e();
}
else return it->second;
}
};
bool f = false;
compressor<pair<string,string>,int> get(string S){
int N = S.size();
compressor<pair<string,string>,int> C;
for(int i=0;i<(1<<N);i++){
string s="",t="";
for(int j=0;j<N;j++){
if((i>>j)&1)s+=S[j];
else t+=S[j];
}
reverse(t.begin(),t.end());
if(f)swap(s,t);
C.add(make_pair(s,t),1);
}
f=true;
C.compress();
return C;
}
int main(){
int N;
cin>>N;
string S;
cin>>S;
compressor<pair<string,string>,int> C0 = get(S.substr(0,N)),C1 = get(S.substr(N));
long long ans = 0;
rep(i,C0.size()){
ans += (long long)C0.get(i).second * C1[C0.get(i).first];
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using vc = vector<char>;
using pll = pair<ll, ll>;
template<class T> void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T> void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U> bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U> bool isin(T el, U container) { return find(all(container), el) != container.end(); }
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; }
template<class T> bool even(T n) { return ! (n & 1); }
template<class T> bool odd(T n) { return n & 1; }
template<class T> ll rup(T a, T b) { return a % b ? a / b + 1 : a / b; }
template<class T> ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T> ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
ll intpow(ll a, ll n, ll _mod=numeric_limits<ll>::max()) { ll p=1; while (n) { if (n&1) p=p*a%_mod; a=a*a%_mod; n>>=1; } return p; }
ll modc(ll a, char op, ll b, ll _mod=mod) { a %= _mod; b %= _mod; ll res = 1; switch(op) {
case '+': res = (a + b) % _mod; break;
case '-': res = (a - b) % _mod; break;
case '*': res = a * b % _mod; break;
case '/': res = modc(a, '*', modc(b, '^', _mod-2, _mod), _mod); break;
case '^': res = intpow(a, b, _mod); break;
case 'P': rep(i, a-b+1, a+1) res = modc(res, '*', i, _mod); break;
case 'C': res = modc(modc(a, 'P', b, _mod), '/', modc(b, 'P', b, _mod)); break; } if (res < 0) res += _mod; return res; }
int main()
{
ll N, K;
cin >> N >> K;
cout << N - K +1 << 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>;
int main()
{
int a, b;
cin >> a >> b;
if (a < 9 && b < 9) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
vector<vector<pair<int,int>>> G(20);
int main(){
int n;
cin>>n;
rep(i,n){
int a;
cin>>a;
rep(j,a){
int x,y;
cin>>x>>y;
x--;
G[i].push_back({x,y});
}
}
int ans=0;
rep(bit,1<<n){
int tmp=0;
bool ok=true;
rep(i,n){
if(bit & 1<<i){
tmp++;
rep(j,G[i].size()){
int x=G[i][j].first;
int y=G[i][j].second;
if(y==0 && bit & 1<<x) ok=false;
else if(y==1 && !(bit & 1<<x)) ok=false;
}
}
}
if(ok) ans=max(ans,tmp);
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
if (N == 1){
cout << 1 << endl;
return 0;
}
vector<int>A(N);
vector<vector<vector<int>>> data(N, vector<vector<int>>(N, vector<int>(2)));
for (int i = 0; i < N; i++) {
cin >> A.at(i);
for (int j = 0; j < A.at(i); j++) {
for (int k = 0; k < 2; k++) {
cin >> data.at(i).at(j).at(k);
}
}
}
int Max = 0;
// すべての選び方を試して、総和がKになるものがあるかを調べる
for (int tmp = 0; tmp < (1 << 15); tmp++) {
bitset<15> s(tmp); // 最大20個なので20ビットのビット列として扱う
if (N < 15 && s.test(N)) {
break;
}
// ビット列の1のビットに対応する整数を選んだとみなして総和を求める
int count = 0;
int honest = 0;
for (int i = 0; i < N; i++) {
if (s.test(i)) {
honest++;
for (int j = 0; j < A.at(i); j++) {
int B = data.at(i).at(j).at(0) - 1;
if (s.test(B)){
if (data.at(i).at(j).at(1) == 0){
count++;
}
}
else {
if (data.at(i).at(j).at(1) == 1){
count++;
}
}
}
}
}
if (count == 0){
if (honest > Max){
Max = honest;
}
}
}
cout << Max << endl;
}
| 1 |
#include <iostream>
using namespace std;
struct Node {
Node *parent;
Node *left;
Node *right;
int key;
};
Node *NIL, *root;
void init() {
root = NIL;
}
void insert(int key) {
Node *y = NIL;
Node *x = root;
while (x != NIL) {
y = x;
if (key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
Node *node = (Node *)malloc(sizeof(Node));
node->parent = y;
node->key = key;
node->left = NIL;
node->right = NIL;
if (y == NIL) {
root = node;
} else if (key < y->key) {
y->left = node;
} else {
y->right = node;
}
}
Node* find(int key) {
Node *x = root;
while (x != NIL && x->key != key) {
if (key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
return x;
}
void attachNodeToParent(Node *node, Node *attached) {
if (node->parent->left == node) {
node->parent->left = attached;
} else {
node->parent->right = attached;
}
}
Node* findNextNode(Node *node) {
Node *x;
if (node->right != NIL) {
x = node->right;
while(x->left != NIL) {
x = x->left;
}
} else {
Node *y = node;
x = node->parent;
while(y == x->right) {
y = x;
x = x->parent;
}
}
return x;
}
void deleteNode(Node *node) {
if (node == NIL) {
return;
}
Node *deleted;
if (node->left == NIL || node->right == NIL) {
deleted = node;
} else {
deleted = findNextNode(node);
}
Node *child;
if (deleted->left != NIL) {
child = deleted->left;
} else {
child = deleted->right;
}
if (child != NIL) {
child->parent = deleted->parent;
}
if (deleted->parent == NIL) {
root = child;
} else if (deleted->parent->left == deleted) {
deleted->parent->left = child;
} else {
deleted->parent->right = child;
}
if (deleted != node) {
node->key = deleted->key;
}
free(deleted);
}
void printByPreorder(Node *node) {
if (node == NIL) {
return;
}
cout << " "<< node->key;
printByPreorder(node->left);
printByPreorder(node->right);
}
void printByInorder(Node *node) {
if (node == NIL) {
return;
}
printByInorder(node->left);
cout << " "<< node->key;
printByInorder(node->right);
}
int main() {
int n;
cin >> n;
init();
string command;
int key;
for (int i = 0; i < n; i++) {
cin >> command;
if (command == "insert") {
cin >> key;
insert(key);
} else if (command == "find") {
cin >> key;
Node *node = find(key);
if (node != NIL) cout << "yes" << endl;
else cout << "no" << endl;
} else if (command == "delete") {
cin >> key;
Node *node = find(key);
deleteNode(node);
} else {
printByInorder(root);
cout << endl;
printByPreorder(root);
cout << endl;
}
}
return 0;
}
| #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
const int dx[4]={ 1,0,-1,0 };
const int dy[4]={ 0,1,0,-1 };
int M;
vector<int> D; vector<ll> C;
int n = 0;
ll ans = 0;
ll memo[10][10] ={};
ll calcC(int n, int m){
if(memo[n][m] != 0) return memo[n][m];
deque<int> que;
que.pb(n);
rep(i, 9) que.pb(m);
ll ret = 0;
while(que.size() > 1){
int a = que[0];
int b = que[1];
que.pop_front();
que.pop_front();
if(a+b >= 10){
que.push_front((a+b)%10);
que.push_front(1);
}
else{
que.push_front(a+b);
}
ret++;
}
return memo[n][m] = ret;
}
void calc(deque<int> &que){
while(que.size() > 1){
int a = que[0];
int b = que[1];
que.pop_front();
que.pop_front();
if(a+b >= 10){
que.push_front((a+b)%10);
que.push_front(1);
}
else{
que.push_front(a+b);
}
ans++;
}
}
signed main(){
cin >> M;
rep(i, M){
int d; ll c;
cin >> d >> c;
if(d == 0){
ans += c;
}
else{
if(n == 0){
n = d;
c--;
}
if(c > 0){
D.pb(d);
C.pb(c);
}
}
}
rep(i, D.size()){
ll k = C[i] / 9;
ans += k * calcC(n, D[i]);
deque<int> d;
d.pb(n);
rep(j, C[i]-9*k) d.pb(D[i]);
calc(d);
n = d.front();
}
cout << ans << endl;
} | 0 |
#include <cstdio>
#include <algorithm>
const int N = 6e3+5;
int n, P, f[N][N<<1], ans; void fix(int &x) { x<P?0:x-=P; }
int main()
{
scanf("%d%d", &n, &P), n *= 3, f[0][N] = 1;
for(int i = 0; i < n; ++i) for(int j = -i; j <= i; ++j)
fix(f[i+1][j+1+N]+=f[i][j+N]),
fix(f[i+2][j-1+N]+=f[i][j+N]*(i+1ll)%P),
fix(f[i+3][j+N]+=f[i][j+N]*(i+1ll)*(i+2ll)%P);
for(int i = 0; i <= n; ++i) fix(ans+=f[n][i+N]); printf("%d\n", ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
set<ll> primeFactorization( ll n ){
set<ll> a = {1};
while( n != 1 ){
ll root = (ll)sqrt(n);
for(ll i=2;i<=n;++i){
if( i > root ){
a.insert(n);
n /= n;
break;
}
if( n%i == 0 ){
a.insert(i);
n /= i;
break;
}
}
}
return a;
}
int main() {
ll a,b;cin >> a >> b;
ll num = __gcd(a,b);
set<ll> array = primeFactorization(num);
//for( auto p : array ) cout << p << endl;
cout << array.size() << endl;
return 0;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.