code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
int n;
void dijkstra(vector<vector<pair<ll,ll>>>& graph,vector<long long> &distance,int start){
priority_queue<pair<ll,ll>> PQ;
vector<bool> checked(n,false);
distance[start]=0;
PQ.push(make_pair(0,start));
int u;
while(1){
u=-1;
while(!PQ.empty()){
if(!checked[PQ.top().second]){
u=PQ.top().second;
distance[u]=-PQ.top().first;
PQ.pop();
break;
}
PQ.pop();
}
if(u==-1)break;
checked[u]=true;
for(int i=0;i<graph[u].size();i++){
PQ.push(make_pair(-(distance[u]+graph[u][i].second),graph[u][i].first));
}
}
}
int main(){
in(n);
vector<vector<pair<ll,ll>>> graph(n);
vector<ll> distance(n,1000000000000000000);
int u,k,v,c,q;
rep(i,n-1){
in(u,v,c);
graph[u-1].push_back(make_pair(v-1,c));
graph[v-1].push_back(make_pair(u-1,c));
}
in(q,k);
dijkstra(graph,distance,k-1);
rep(i,q){
in(u,v);
out(distance[u-1]+distance[v-1]);
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
// cout << fixed << setprecision(10) << flush;
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
vector<vector<int>> edge(n, vector<int>());
vector<vector<int>> weight(n, vector<int>());
for(int i=0; i<n-1; i++){
cin >> a[i] >> b[i] >> c[i];
a[i]--; b[i]--; c[i];
edge[a[i]].push_back(b[i]);
edge[b[i]].push_back(a[i]);
weight[a[i]].push_back(c[i]);
weight[b[i]].push_back(c[i]);
}
int q, k;
cin >> q >> k;
k--;
vector<int> dis(n, -1);
#if 0
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
pq.push(make_pair(0, k));
while(!pq.empty()){
int d = pq.top().first;
int p = pq.top().second;
pq.pop();
if(dis[p] != -1) continue;
dis[p] = d;
for(int i=0; i<edge[p].size(); i++){
int next = edge[p][i];
if(dis[next] == -1){
pq.push(make_pair(d + weight[p][i], next));
}
}
}
#else
stack<int> s;
s.push(k);
dis[k] = 0;
while(!s.empty()){
int p = s.top();
s.pop();
for(int i=0; i<edge[p].size(); i++){
int next = edge[p][i];
if(dis[next] == -1){
s.push(next);
dis[next] = dis[p] + weight[p][i];
}
}
}
#endif
for(int i=0; i<q; i++){
int x, y;
cin >> x >> y;
x--; y--;
cout << dis[x] + dis[y] << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll N, M;
cin >> N >> M;
ll even_max_len = M % 2 == 0 ? M : M - 1;
ll odd_max_len = M % 2 == 1 ? M : M - 1;
for (ll i = M; i > 0; i--) {
if (i % 2 == 0) {
ll j = (even_max_len - i) / 2;
printf("%lld %lld\n", 1 + j, 1 + j + i);
} else {
ll base = even_max_len + 2;
ll j = (odd_max_len - i) / 2;
printf("%lld %lld\n", base + j, base + j + i);
}
}
}
| // practice with Dukkha
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m; cin >> n >> m;
for (int i = 1, j = m + 1; i < j; i++, j--)
cout << i << ' ' << j << '\n';
for (int i = m + 2, j = m + m + 1; i < j; i++, j--)
cout << i << ' ' << j << '\n';
return 0;
}
| 1 |
#include <string>
#include <vector>
#include <iostream>
using namespace std;
vector<int> x[100]; int n, t;
bool same(vector<int> a, vector<int> b) {
for(int i = 0; i < 4; i++) {
for(int j = 0; j < 4; j++) {
for(int k = 0; k < 4; k++) {
for(int l = 0; l < 4; l++) {
string s;
for(int m = 0; m < i; m++) s += 'N';
for(int m = 0; m < j; m++) s += 'E';
for(int m = 0; m < k; m++) s += 'S';
for(int m = 0; m < l; m++) s += 'W';
for(int i = 0; i < s.size(); i++) {
t = a[0];
switch(s[i]) {
case 'N':
a[0] = a[1];
a[1] = a[5];
a[5] = a[4];
a[4] = t;
break;
case 'E':
a[0] = a[3];
a[3] = a[5];
a[5] = a[2];
a[2] = t;
break;
case 'S':
a[0] = a[4];
a[4] = a[5];
a[5] = a[1];
a[1] = t;
break;
case 'W':
a[0] = a[2];
a[2] = a[5];
a[5] = a[3];
a[3] = t;
break;
}
}
if(a == b) return true;
}
}
}
}
return false;
}
int main() {
scanf("%d", &n);
for(int i = 0; i < n; i++) {
x[i].resize(6);
for(int j = 0; j < 6; j++) scanf("%d", &x[i][j]);
}
for(int i = 0; i < n; i++) {
for(int j = i + 1; j < n; j++) {
if(same(x[i], x[j])) {
printf("No\n"); return 0;
}
}
}
printf("Yes\n");
return 0;
} | #include <iostream>
#include <sstream>
using namespace std;
class Dice {
public:
static int rollingface[][4];
static int sideface[][4];
int face[6];
Dice(string &face_data);
// ~Dice();
void roll(const char &op);
int top();
int front_face(int top, int right);
void print_faces();
bool operator==(const Dice& other);
};
int Dice::rollingface[][4] = {
{0, 2, 5, 3},
{0, 4, 5, 1},
{0, 1, 5, 4},
{0, 3, 5, 2},
};
int Dice::sideface[][4] = {
{1, 3, 4, 2},
{0, 2, 5, 3},
{0, 4, 5, 1},
{0, 1, 5, 4},
{0, 3, 5, 2},
{1, 2, 4, 3},
};
Dice::Dice(string &face_data) {
istringstream strm;
strm.str(face_data);
for (int i = 0; i < 6; i++) {
strm >> face[i];
}
}
void Dice::roll(const char &op) {
int *fseq;
switch (op) {
case 'E': fseq = Dice::rollingface[0]; break;
case 'N': fseq = Dice::rollingface[1]; break;
case 'S': fseq = Dice::rollingface[2]; break;
case 'W': fseq = Dice::rollingface[3]; break;
default: break;
}
int t, p = face[fseq[3]];
for (int i = 0; i < 4; i++) {
t = face[fseq[i]];
face[fseq[i]] = p;
p = t;
}
}
int Dice::front_face(int top, int right) {
int i;
for (i = 0; i < 6; i++) {
if (face[i] == top) break;
}
int *fseq = Dice::sideface[i];
for (i = 0; i < 4; i++) {
if (face[fseq[i]] == right) return face[fseq[(i-1+4)%4]];
}
return -1;
}
void Dice::print_faces() {
cout << "face:" << endl;
cout << " " << face[4] << endl;
cout << face[3] << " " << face[0] << " " << face[2] << endl;
cout << " " << face[1] << endl;
cout << " " << face[5] << endl;
cout << endl;
}
bool Dice::operator==(const Dice& other) {
int i;
for (i = 0; i < 6; i++) {
if (other.face[i] == face[0]) {
if (other.face[5-i] != face[5]) continue;
int *f = Dice::sideface[0], *of = Dice::sideface[i];
for (int j = 0; j < 4; j++) {
if (face[f[0]] == other.face[of[j]]) {
for (int k = 1; k < 4; k++) {
if (face[f[k]] != other.face[of[(j+k)%4]]) goto NOT_MATCH;
}
return true;
}
}
NOT_MATCH:;
}
}
return false;
}
int Dice::top() {
return face[0];
}
int main() {
int n, i;
string buf;
istringstream strm;
Dice *dice[100];
getline(cin, buf);
strm.str(buf);
strm >> n;
for (i = 0; i < n; i++) {
getline(cin, buf);
dice[i] = new Dice(buf);
}
for (i = 0; i < n-1; i++) {
Dice *s = dice[i];
for (int j = i + 1; j < n; j++) {
if (*s == *dice[j]) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
} | 1 |
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int dm = 1 << 16;
char dn[dm], * di = dn;
inline void putint(int X) {
int keta = 0;
char C[10];
while (X) {
*(C + keta) = '0' + X % 10;
X /= 10;
keta++;
}
for (int i = keta - 1; i >= 0; i--)* di++ = (*(C + i));
*di++ = '\n';
}
const ll mod = 998244353;
ll modpow(ll A, ll B) {
ll kotae = 1;
while (B > 0) {
if (B & 1) kotae = kotae * A % mod;
A = A * A % mod;
B >>= 1;
}
return kotae;
}
const int IMAX = 4000;
int fac[IMAX + 1], ifac[IMAX + 1];
inline ll comb(int A, int B) {
return fac[A] * ifac[B] % mod * ifac[A - B] % mod;
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
int K, N;
scanf("%d", &K);
scanf("%d", &N);
if (K == 1) {
printf("0");
return 0;
}
fac[0] = 1;
rep1(i, IMAX) fac[i] = (ll)fac[i - 1] * i % mod;
ifac[IMAX] = modpow(fac[IMAX], mod - 2);
for (int i = IMAX; i > 0; i--) ifac[i - 1] = (ll)ifac[i] * i % mod;
int H[1001];
rep(i, 1001) {
if (N >= 2 * i) {
if (i & 1) H[i] = (ll)-fac[N + K - 1 - 2 * i] * ifac[N - 2 * i] % mod;
else H[i] = (ll)fac[N + K - 1 - 2 * i] * ifac[N - 2 * i] % mod;
}
}
int kotae[1001];
rep1(i, (K + 1) / 2) {
ll tmp = 0;
for (int j = 0; j <= i && N >= j * 2; j++) {
tmp += (ll)ifac[j] * ifac[i - j] % mod * H[j] % mod;
}
kotae[i] = (tmp % mod * ifac[K - 1] % mod * fac[i] % mod + mod) % mod;
}
rep1(i, (K + 1) / 2 - 1) {
putint(kotae[i]);
putint(kotae[i]);
}
putint(kotae[(K + 1) / 2]);
if (!(K & 1)) {
putint(kotae[(K + 1) / 2]);
putint(kotae[(K + 1) / 2]);
}
for (int i = (K + 1) / 2 - 1; i >= 1; i--) {
putint(kotae[i]);
putint(kotae[i]);
}
fwrite(dn, 1, di - dn, stdout);
Would you please return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int N, K;
const ll MOD = 998244353;
ll F[4002], F_inv[4002];
ll modpow(ll a, ll b) {
ll rtn = 1, kakeru = a;
while (b > 0) {
if (b & 1)rtn *= kakeru;
kakeru *= kakeru;
kakeru %= MOD;
rtn %= MOD;
b >>= 1;
}
return rtn;
}
void calc_fac() {
F[0] = 1, F[1] = 1;
for (int i = 2; i <= 4001; i++) {
F[i] = F[i - 1] * i;
F[i] %= MOD;
}
F_inv[4001] = modpow(F[4001], MOD - 2);
for (int j = 4000; j >= 0; j--) {
F_inv[j] = F_inv[j + 1] * (j + 1);
F_inv[j] %= MOD;
}
}
ll comb(ll a, ll b) {
if (a < 0)return 0;
if (b < 0)return 0;
if (b > a)return 0;
ll ans = (F[a] * F_inv[b])%MOD * F_inv[a - b];
return ans % MOD;
}
ll hcomb(ll a, ll b) {
return comb(a + b - 1, b);
}
int main() {
calc_fac();
cin >> K >> N;
for (int i = 2; i <= 2 * K; i++) {
if (i % 2 == 1) {
ll cnt = 0;
int A = min((i - 1) / 2, (2 * (K + 1) - i) / 2);
for (int j = 0; j <= A; j++) {
ll tmp = 1;
tmp *= (modpow(2, j) * comb(A, j)) % MOD;
tmp *= hcomb(K - 2 * A + j, N - j);
tmp %= MOD;
cnt += tmp;
cnt %= MOD;
}
cout << cnt << endl;
}
else {
ll cnt = 0;
int A = min((i) / 2, (2 * (K + 1) - i) / 2) - 1;
for (int j = 0; j <= A; j++) {
ll tmp = 1;
tmp *= (modpow(2, j) * comb(A, j)) % MOD;
ll a = hcomb(K - 2 * A + j - 1, N - j) + hcomb(K - 2 * A + j - 1, N - j - 1);
a %= MOD;
tmp *= a;
tmp %= MOD;
cnt += tmp;
cnt %= MOD;
}
cout << cnt << endl;
}
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<char,int> P;
int main(){
char s[1000005];
scanf("%s",s);
vector<P> d;//(?¨????,??°)
int count=1; char before=s[0];
for(int i=1;s[i]!=0;i++){
if(s[i]!=before){
d.push_back(P(before,count));
before=s[i];
count=1;
}else count++;
}
d.push_back(P(before,count));
int res=0;
if(d.size()==1||d.size()==2) printf("0\n");
else{
for(int i=0;i<d.size()-2;i++)
if(d[i].first=='J'&&d[i+1].first=='O'&&d[i+2].first=='I')
if(d[i].second>=d[i+1].second&&d[i+1].second<=d[i+2].second) res=max(res,d[i+1].second);
printf("%d\n",res);
}
} | #include <iostream>
#include <string>
using namespace std;
int main(void)
{
string s;
cin >> s;
if (s.length() % 2 == 1)
{
cout << "No" << endl;
}
else
{
for (int i = 0; i < (int)s.length(); i += 2)
{
if (s[i] != 'h' || s[i + 1] != 'i')
{
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
return 0;
}
| 0 |
//
// main.c
// ITP1_4_D
//
// Created by ??±??°?????? on 2015/09/29.
// Copyright ?? 2015??´ HamadaShogo. All rights reserved.
//
#include <stdio.h>
#include <stdlib.h>
long long intSum(int *num, int size);
int intMax(int *num, int size);
int intMin(int *num, int size);
int main(int argc, const char * argv[]) {
int *num;
int size;
long long sum;
int max;
int min;
int i;
scanf("%d", &size);
num = (int *)malloc(sizeof(int) * size);
if (num == NULL) {
printf("?????¢???????¢??????§????????????\n");
exit(1);
}
for (i=0; i<size; i++) {
scanf("%d", &num[i]);
}
sum = intSum(num, size);
max = intMax(num, size);
min = intMin(num, size);
printf("%d %d %lld\n", min, max, sum);
free(num);
return 0;
}
long long intSum(int *num, int size){
int i;
long long sum = 0;
for(i=0; i<size; i++){
sum += num[i];
}
return sum;
}
int intMax(int *num, int size){
int i;
int max = num[0];
for (i=0; i<size; i++) {
if (max < num[i]) {
max = num[i];
}
}
return max;
}
int intMin(int *num, int size){
int i;
int min = num[0];
for (i=0; i<size; i++) {
if (num[i] < min) {
min = num[i];
}
}
return min;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){ cin >> a[i]; }
int min=0, max=0;
long long sum=0;
min = *min_element(a.begin(), a.end());
max = *max_element(a.begin(), a.end());
for(int i=0; i<a.size(); i++){ sum += a[i]; }
cout << min << " " << max << " " << sum << endl;
return 0;
} | 1 |
#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#define l(x) (x<<1)
#define r(x) ((x<<1)|1)
#define IL inline
#define reg register
#define LL long long
#define N 200010
#define INF 0x3f3f3f3f
using namespace std;
int n,i,j;
int ans=INF;
set <int> S[N*4];
struct Data{
int x,y;
char c;
}a[N];
IL int Abs(int x){return (x<0)?-x:x;}
IL void Swap(int &a,int &b){a^=b^=a^=b;}
IL int Min(int a,int b){return (a<b)?a:b;}
IL int Max(int a,int b){return (a>b)?a:b;}
IL int read(){
int p=0,f=1; char c=getchar();
while (c<48||c>57) {if (c=='-') f=-1; c=getchar();}
while (c>=48&&c<=57) p=(p<<1)+(p<<3)+c-48,c=getchar();
return p*f;
}
int main(){
#ifdef __Marvolo
freopen("zht.in","r",stdin);
freopen("zht.out","w",stdout);
#endif
n=read();
for (i=1;i<=n;i++){
a[i].x=read(); a[i].y=read(); a[i].c=getchar();
}
if (n==1){
puts("SAFE");
return 0;
}
for (i=1;i<=n;i++)
if (a[i].c=='U') S[a[i].x+a[i].y].insert(a[i].x);
for (i=1;i<=n;i++){
if (a[i].c=='R'){
if (!S[a[i].x+a[i].y].size()) continue;
j=*(--S[a[i].x+a[i].y].end());
if (j<a[i].x) continue;
j=*S[a[i].x+a[i].y].upper_bound(a[i].x);
ans=Min(ans,j-a[i].x);
}
}
for (i=0;i<4*N;i++) S[i].clear();
//U--R
for (i=1;i<=n;i++)
if (a[i].c=='D') S[a[i].x+a[i].y].insert(a[i].x);
for (i=1;i<=n;i++){
if (a[i].c=='L'){
if (!S[a[i].x+a[i].y].size()) continue;
j=*S[a[i].x+a[i].y].begin();
if (j>a[i].x) continue;
j=*(--S[a[i].x+a[i].y].upper_bound(a[i].x));
ans=Min(ans,a[i].x-j);
}
}
for (i=0;i<4*N;i++) S[i].clear();
//D--L
for (i=1;i<=n;i++)
if (a[i].c=='R') S[a[i].y-a[i].x+N].insert(a[i].x);
for (i=1;i<=n;i++){
if (a[i].c=='D'){
if (!S[a[i].y-a[i].x+N].size()) continue;
j=*S[a[i].y-a[i].x+N].begin();
if (j>a[i].x) continue;
j=*(--S[a[i].y-a[i].x+N].upper_bound(a[i].x));
ans=Min(ans,a[i].x-j);
}
}
for (i=0;i<4*N;i++) S[i].clear();
//D--R
for (i=1;i<=n;i++)
if (a[i].c=='L') S[a[i].y-a[i].x+N].insert(a[i].x);
for (i=1;i<=n;i++){
if (a[i].c=='U'){
if (!S[a[i].y-a[i].x+N].size()) continue;
j=*(--S[a[i].y-a[i].x+N].end());
if (j<a[i].x) continue;
j=*S[a[i].y-a[i].x+N].upper_bound(a[i].x);
ans=Min(ans,j-a[i].x);
}
}
for (i=0;i<4*N;i++) S[i].clear();
//D--R
if (ans!=INF) ans*=2;
for (i=1;i<=n;i++)
if (a[i].c=='R') S[a[i].y].insert(a[i].x);
for (i=1;i<=n;i++){
if (a[i].c=='L'){
if (!S[a[i].y].size()) continue;
j=*S[a[i].y].begin();
if (j>a[i].x) continue;
j=*(--S[a[i].y].upper_bound(a[i].x));
ans=Min(ans,a[i].x-j);
}
}
for (i=0;i<4*N;i++) S[i].clear();
//L--R
for (i=1;i<=n;i++)
if (a[i].c=='U') S[a[i].x].insert(a[i].y);
for (i=1;i<=n;i++){
if (a[i].c=='D'){
if (!S[a[i].x].size()) continue;
j=*S[a[i].x].begin();
if (j>a[i].y) continue;
j=*(--S[a[i].x].upper_bound(a[i].y));
ans=Min(ans,a[i].y-j);
}
}
for (i=0;i<4*N;i++) S[i].clear();
//U--D
if (ans==INF) puts("SAFE");
else cout<<ans*5<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n;
cin >> n;
map<char, vector<P>> mp;
rep(i, n) {
ll x, y;
char c;
cin >> x >> y >> c;
mp[c].push_back({x, y});
}
ll ans = 1e18;
map<ll, set<ll>> ds, ls;
for(auto p : mp['D']) ds[p.first].insert(p.second);
for(auto p : mp['U']) {
ll x = p.first;
ll y = p.second;
auto in = ds[x].lower_bound(y);
if(in == end(ds[x])) continue;
ll now = (*in - y) * 5;
ans = min(ans, now);
}
for(auto p : mp['L']) ls[p.second].insert(p.first);
for(auto p : mp['R']) {
ll x = p.first;
ll y = p.second;
auto in = ls[y].lower_bound(x);
if(in == end(ls[y])) continue;
ll now = (*in - x) * 5;
ans = min(ans, now);
}
map<ll, set<ll>> u, d;
for(auto p : mp['U']) u[p.first + p.second].insert(p.first);
for(auto p : mp['D']) d[p.first - p.second].insert(p.first);
for(auto p : mp['R']) {
ll x = p.first;
ll y = p.second;
auto in = u[x + y].lower_bound(x);
ll now;
if(in != end(u[x + y])) {
now = (*in - x) * 10;
ans = min(ans, now);
}
in = d[x - y].lower_bound(x);
if(in != end(d[x - y])) {
now = (*in - x) * 10;
ans = min(ans, now);
}
}
u.clear();
d.clear();
for(auto p : mp['U']) u[p.first - p.second].insert(p.first);
for(auto p : mp['D']) d[p.first + p.second].insert(p.first);
for(auto p : mp['L']) {
ll x = p.first;
ll y = p.second;
auto in = u[x - y].upper_bound(x);
ll now;
if(in != begin(u[x - y])) {
in--;
now = (x - *in) * 10;
ans = min(ans, now);
}
in = d[x + y].upper_bound(x);
if(in != begin(d[x + y])) {
in--;
now = (x - *in) * 10;
ans = min(ans, now);
}
}
if(ans == 1e18)
cout << "SAFE" << endl;
else
cout << ans << endl;
} | 1 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
struct Dice {
string input;
size_t pos;
int values[6];
int top;
int bottom;
int front;
int back;
int left;
int right;
void Init() {
pos = 0;
top = 1;
bottom = 6;
front = 2;
back = 5;
left = 4;
right = 3;
}
int Value() const {
return values[top - 1];
}
bool Done() const {
return pos == input.size();
}
void Next() {
const char d = input[pos];
int temp = 0;
switch (d) {
case 'S':
temp = front;
front = top;
top = back;
back = bottom;
bottom = temp;
break;
case 'N':
temp = back;
back = top;
top = front;
front = bottom;
bottom = temp;
break;
case 'E':
temp = right;
right = top;
top = left;
left = bottom;
bottom = temp;
break;
case 'W':
temp = left;
left = top;
top = right;
right = bottom;
bottom = temp;
break;
}
++pos;
}
};
int main() {
Dice dice;
dice.Init();
for (int i = 0; i < 6; ++i) {
cin >> dice.values[i];
}
cin >> dice.input;
for (;;) {
if (dice.Done()) {
break;
}
dice.Next();
}
cout << dice.Value() << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
class Dice {
public:
int a, b, c, d, z, f;
Dice(int a, int b, int c, int d, int z, int f) {
this->a = a;
this->b = b;
this->c = c;
this->d = d;
this->z = z;
this->f = f;
}
void s() {
int tmp = this->b;
this->b = this->a;
this->a = this->z;
this->z = this->f;
this->f = tmp;
}
void e() {
int tmp = this->c;
this->c = this->a;
this->a = this->d;
this->d = this->f;
this->f = tmp;
}
void n() {
int tmp = this->b;
this->b = this->f;
this->f = this->z;
this->z = this->a;
this->a = tmp;
}
void w() {
int tmp = this->c;
this->c = this->f;
this->f = this->d;
this->d = this->a;
this->a = tmp;
}
void printTop() {
cout << this->a << endl;
}
};
int main () {
int a, b, c, d, z, f;
cin >> a >> b >> c >> d >> z >> f;
Dice dd(a, b, c, d, z, f);
char orders[100];
scanf("%s", orders);
for(int i=0; i<strlen(orders); i++) {
if (orders[i] == 'S') {
dd.s();
}
else if (orders[i] == 'E') {
dd.e();
}
else if (orders[i] == 'W') {
dd.w();
}
else if (orders[i] == 'N') {
dd.n();
}
}
dd.printTop();
return 0;
} | 1 |
#include <stdio.h>
int main() {
int n, i, j, k, l, p[101], m[101][101];
scanf("%d", &n);
for ( i = 1; i <= n; i++) {
scanf("%d", &p[i - 1]);
scanf("%d", &p[i]);
}
for ( i = 1; i <= n; i++) {
m[i][i] = 0;
}
for ( l = 2; l <= n; l++) {
for ( i = 1; i <= n - l + 1; i++) {
int j = i + l - 1;
m[i][j] = ( 1 << 21);
for ( k = i; k <= j - 1; k++) {
if ( m[i][j] < m[i][k] + m[k + 1][j] + p[i - 1]*p[k]*p[j]) {
m[i][j] = m[i][j];
} else {
m[i][j] = m[i][k] + m[k + 1][j] + p[i - 1]*p[k]*p[j];
}
}
}
}
printf("%d\n", m[1][n]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int limN = 105;
int xs[limN], ys[limN];
ll dp[limN][limN];
bool usd[limN][limN];
ll memo(int l, int r) {
if(l>=r)
return 0;
if(usd[l][r])
return dp[l][r];
usd[l][r] = true;
ll &ans = dp[l][r];
ans = (1LL<<62);
for(int i=l; i<r; i++) {
// printf("%d %d %d\n", xs[l], ys[i], ys[i+1]);
// printf("considerando %d %d %d => %d %lld %lld\n", l, i, r, xs[l]*ys[i]*ys[r], memo(l, i), memo(i+1, r));
ans = min(ans, xs[l]*ys[i]*ys[r] + memo(l, i) + memo(i+1, r));
}
return ans;
}
int main() {
int N ;
scanf("%d", &N);
for(int i=0; i<N; i++) {
scanf("%d%d", &xs[i], &ys[i]);
}
printf("%lld\n", memo(0, N-1));
}
| 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pf(n) printf("%d\n",n)
#define pff(a,b) printf("%d %d\n",a,b);
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1001001001;
const double PI = acos(-1);
int main() {
ll l, r;
cin >> l >> r;
ll ans = 1001001;
if (r - l >= 2019) {
ans = 0;
}
else {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i*j) % 2019);
}
}
}
cout << ans << endl;
return 0;
} | ///////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////
// _oo0oo_ //
// o8888888o //
// 88" . "88 ------ hzt1 //
// (| -_- |) //
// 0\ = /0 //
// ___/`---'\___ //
// .' \| |// '. //
// / \||| : |||// \ //
// / _||||| -:- |||||- \ //
// | | \ - /// | | //
// | \_| ''\---/'' |_/ | //
// \ .-\__ '-' ___/-. / //
// ___'. .' /--.--\ `. .'___ //
// ."" '< `.___\_<|>_/___.' >' "". //
// | | : `- \`.;`\ _ /`;.`/ - ` : | | //
// \ \ `_. \_ __\ /__ _/ .-` / / //
// =====`-.____`.___ \_____/___.-`___.-'===== //
// `=---=' //
// //
// //
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ //
// //
// God-He Bless All. //
// This Code Will Never Explode. //
// //
// //
///////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<vector>
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<=i##_end_;i++)
#define dwn(i,a,b) for(int i=(a),i##_end_=(b);i>=i##_end_;i--)
using namespace std;
const int Size=1<<16;
char buffer[Size],*head,*tail;
inline char Getchar() {
if(head==tail) {
int l=fread(buffer,1,Size,stdin);
tail=(head=buffer)+l;
}
if(head==tail) return -1;
return *head++;
}
inline int read() {
int x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
return x*f;
}
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=1000010;
const int mod=998244353;
int fac[maxn],ifac[maxn];
int reC(int n,int m) {return (ll)ifac[n]*fac[m]%mod*fac[n-m]%mod*ifac[2]%mod;}
int C(int n,int m) {return (ll)fac[n]*ifac[m]%mod*ifac[n-m]%mod;}
void init(int n) {
ifac[0]=ifac[1]=fac[0]=1;
rep(i,1,n) fac[i]=(ll)fac[i-1]*i%mod;
rep(i,2,n) ifac[i]=(ll)(mod-mod/i)*ifac[mod%i]%mod;
rep(i,1,n) ifac[i]=(ll)ifac[i-1]*ifac[i]%mod;
}
int main() {
int n,m;
n=read();m=read();init(n+m);
int ans=0;
rep(i,1,min(n,m)) (ans+=(ll)C(2*i,i)*C(n+m-2*i,n-i)%mod)%=mod;
ans=(ll)ans*reC(n+m,n)%mod;
printf("%d\n",(ans+max(n,m))%mod);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9+7;
void add(int64_t& a, int64_t b){
a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
a = a*b % MOD;
}
int nth_bit(int64_t num, int n){
return (num >> n) & 1;
}
int main(){
int N, X, Y, Z;
cin >> N >> X >> Y >> Z;
int XYZ = (1<<Z) + (1<<(Y+Z)) + (1<<(X+Y+Z));
const int M = 1<<18;
const int B = M-1;
static int64_t dp[41][M][2];
dp[0][1][0] = 1;
for(int i=0; i<N; i++) for(int j=0; j<M; j++) for(int k=0; k<2; k++) for(int l=1; l<=10; l++){
int j2 = ((j<<l) + 1) & B;
int k2 = k | (XYZ == (XYZ&j2));
add(dp[i+1][j2][k2], dp[i][j][k]);
}
int64_t ans = 0;
for(int j=0; j<M; j++) add(ans, dp[N][j][1]);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const double EPS = 1e-8;
template<typename T> T chmax(T& a, const T& b){return a = (a > b ? a : b);}
template<typename T> T chmin(T& a, const T& b){return a = (a < b ? a : b);}
ll modPow(ll x, ll n) {
ll ret = 1;
while(n) {
if(n&1LL) (ret *= x) %= MOD;
n >>= 1;
(x *= x) %= MOD;
}
return ret;
}
ll dp[41][(1<<17)+10];
int main(){
int n;
vi v(3);
cin >> n;
rep(i, 3) cin >> v[i];
int sum_v = v[0] + v[1] + v[2];
dp[0][0] = 1;
auto check = [&](int mask) {
bool f = true;
f &= (mask >>=(v[2]-1)) & 1;
f &= (mask >>=v[1]) & 1;
f &= (mask >>=v[0]) & 1;
return f;
};
auto pop_mask = [&](int mask) {
if(mask == 0) return 0;
bool f = true;
repr(i, sum_v) {
if(mask & (1<<i)) {
if(f) {
mask -= (1<<i);
f = false;
break;
}
}
}
return mask;
};
auto getSize = [&](int mask) {
if(mask == 0) return 0;
repr(i, sum_v) {
if(mask&(1<<i)) {
return i+1;
}
}
return 0;
};
auto push_mask = [&](int mask, int add) {
if(add > sum_v) return 0;
while(getSize(mask)+add > sum_v) {
mask = pop_mask(mask);
}
mask <<= add;
mask |= 1<<(add-1);
return mask;
};
rep(i, n) rep(mask, 1<<sum_v) {
REP(k, 1, 11) {
int nxt = push_mask(mask, k);
if(check(mask) || check(nxt)) continue;
(dp[i+1][nxt] += dp[i][mask]) %= MOD;
}
}
ll sum = 0LL;
rep(mask, 1<<sum_v) (sum += dp[n][mask]) %= MOD;
ll ans = modPow(10, n);
(ans += MOD - sum) %= MOD;
cout << ans << endl;
return 0;
} | 1 |
#include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
using namespace std;
// N, E, S, W
const int dx[4] = { 1, 0, -1, 0};
const int dy[4] = { 0, 1, 0, -1};
using LL = long long int;
using LD = long double;
const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;
using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;
//==============================================
int n, e;
vvl M;
void warshallFloyd() {
REP(k, n) {
REP(i, n) {
if (M[i][k] == INF64) continue;
REP(j, n) {
if (M[k][j] == INF64) continue;
M[i][j] = min(M[i][j], M[i][k] + M[k][j]);
}
}
}
}
void print() {
REP(i, n) {
if (M[i][i] < 0) {
cout << "NEGATIVE CYCLE" << "\n";
return;
}
}
REP(i, n) {
REP(j, n) {
if (j) cout << " ";
if (M[i][j] == INF64) cout << "INF";
else cout << M[i][j];
}
cout << "\n";
}
}
void solve() {
warshallFloyd();
print();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> e;
M.resize(n, vl(n, INF64));
REP(i, n) M[i][i] = 0;
LL s, t, d;
REP(i, e) {
cin >> s >> t >> d;
M[s][t] = d;
}
solve();
return 0;
} | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat;
typedef vector<vector<bool> > matb;
typedef vector<string> vst;
typedef pair<lli,lli> pll;
typedef pair<double,double> pdd;
vll par;
vll rnk;
void init(lli n){
par = vll(n);
rnk = vll(n);
for(lli i = 0;i < n;i++) par[i] = i;
}
lli find(lli x){
if(par[x] == x) return x;
else return par[x] = find(par[x]);
}
void unite(lli x,lli y){
x = find(x);y = find(y);
if(x == y) return;
if(rnk[x] < rnk[y]) par[x] = y;
else {
par[y] = x;
if(rnk[x] == rnk[y]) rnk[x]++;
}
}
bool same(lli x,lli y){
return find(x) == find(y);
}
lli n;
vll c,r,l;
vll p;
mat g;
lli ans = 0;
int main(){
cin >> n;
g = mat(n,vll(n));
for(lli i = 0;i < n;i++){
for(lli j = 0;j < n;j++){
cin >> g[i][j];
}
}
for(lli i = 0;i < n;i++){
for(lli j = i+1;j < n;j++){
if(g[i][j] >= 0) c.push_back(g[i][j]),r.push_back(i),l.push_back(j);
}
}
p = vll(c.size());
for(lli i = 0;i < p.size();i++) p[i] = i;
sort(p.begin(),p.end(),[](lli a,lli b){
return c[a] < c[b];
});
init(n);
for(lli i = 0;i < p.size();i++){
if(!same(r[p[i]],l[p[i]])) unite(r[p[i]],l[p[i]]),ans += c[p[i]];
}
cout << ans << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
const int M=1e9+7,N=1<<20;
int n,i,ans,x,f[N],g[N],now,la[N];
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int rd(){
int x=0,fl=1;char ch=gc();
for(;ch<48||ch>57;ch=gc())if(ch=='-')fl=-1;
for(;48<=ch&&ch<=57;ch=gc())x=(x<<3)+(x<<1)+(ch^48);
return x*fl;
}
void inc(int &x,int y){x+=y;if(x>=M)x-=M;}
int main(){
//freopen("inp","r",stdin);
n=rd();
for (i=1;i<N;i++) f[i]=1;
for (i=ans=1;i<=n;i++){
x^=rd();
if (x) inc(f[x],1ll*(now-la[x])*g[x]%M),inc(g[x],f[x]),la[x]=now;
else inc(ans,ans),now++;
}
if (x) return printf("%d",f[x]),0;
ans=1ll*ans*(M+1>>1)%M;
for (i=1;i<N;i++) inc(ans,g[i]);
printf("%d",ans);
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll inf=1000000000000000000;
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(int i=n;i>=m;i--)
ll lmax(ll a,ll b){
if(a<b)return b;
else return a;
}
ll lmin(ll a,ll b){
if(a<b)return a;
else return b;
}
ll gya[200010];
ll kai[200010];
ll beki(ll n,ll k){
ll ret=1;
ll now=n;
while(k>0){
if(k%2==1){
ret*=now;
ret%=mod;
}
now*=now;
now%=mod;
k/=2;
}
return ret;
}
ll gyaku(ll n){
return beki(n,mod-2);
}
void nckinit(ll n){
gya[0]=1;
gya[1]=1;
for(int i=2;i<=n;i++){
gya[i]=gya[i-1]*gyaku(i);
gya[i]%=mod;
}
kai[0]=1;
kai[1]=1;
for(int i=2;i<=n;i++){
kai[i]=kai[i-1]*i;
kai[i]%=mod;
}
}
ll nck(ll n,ll k){
if(k<0)return 0;
if(k==0||n==k)return 1;
ll ret=kai[n];
ret*=gya[n-k];
ret%=mod;
ret*=gya[k];
ret%=mod;
return ret;
}
ll npk(ll n,ll k){
if(k<0)return 0;
if(k==0)return 1;
ll ret=kai[n];
ret*=gya[n-k];
ret%=mod;
return ret;
}
int main(){
ll n;cin>>n;
ll a[n];rep(i,0,n)cin>>a[i];
ll b[n];
b[0]=a[0];
rep(i,1,n)b[i]=b[i-1]^a[i];
vector<ll> w;
rep(i,0,n)w.push_back(b[i]);
sort(w.begin(),w.end());
w.erase(unique(w.begin(),w.end()),w.end());
unordered_map<ll,ll> mp;
rep(i,0,w.size()){
if(w[i]==0)mp[w[i]]=0;
else mp[w[i]]=i+1;
}
rep(i,0,n)b[i]=mp[b[i]];
ll m=w.size();
vector<ll> v[m+2];
rep(i,0,n){
v[b[i]].push_back(i);
}
//rep(i,0,n)cout<<b[i]<<" ";
bool used[m+2];
ll ans=0;
fill(used,used+m+2,false);
rep(i,0,n-1){
//cout<<ans<<" ";
if(used[b[i]])continue;
if(b[i]==0&&b[n-1]==0){
ll y=beki(2,v[0].size()-1);
y--;
y=(y+mod)%mod;
ans+=y;
ans%=mod;
used[0]=true;
continue;
}
if(b[n-1]!=0&&b[i]!=b[n-1])continue;
used[b[i]]=true;
ll jou=1,ka=1;
ll now=lower_bound(v[0].begin(),v[0].end(),i)-v[0].begin();
//cout<<now<<endl;
rep(j,1,v[b[i]].size()){
ll ne=v[b[i]][j];
ll r=lower_bound(v[0].begin(),v[0].end(),ne)-v[0].begin();
jou+=ka*(r-now);
jou%=mod;
ka+=jou;
ka%=mod;
now=r;
}
if(b[n-1]==b[i]){
ans=(ans+jou-1+mod)%mod;
continue;
}
if(v[b[i]].size()==1){
ans=(ans+1)%mod;
continue;
}
ans=(ans+ka)%mod;
}
ans=(ans+1)%mod;
cout<<ans<<endl;
}
| 1 |
#include <stdio.h>
#include <math.h>
#define MAXINPUT 100
int main(void){
int h[MAXINPUT],w[MAXINPUT];
int ansh[MAXINPUT]={},answ[MAXINPUT]={};
int i=0,j=0;
int ans=0;
int num=0;
int k;
while(i<MAXINPUT){
scanf("%d %d",&h[i],&w[i]);
if(h[i]==0 && w[i]==0)break;
i++;
num++;
}
for(i=0;i<num;i++,ans=0){
ans=h[i]*h[i]+w[i]*w[i];
for(;(ansh[i]==0||answ[i]==0);){
for(j=1;k==0;j++){
double temp=ans-(j*j);
double tempa=0;
if(temp<=0){
k=1;
break;
}
temp=sqrt(temp);
temp=modf(temp,&tempa);
if(temp==0 && tempa<=150 && j<tempa){
if(tempa*tempa+j*j==h[i]*h[i]+w[i]*w[i] && j<=h[i]){
continue;
}
ansh[i]=j;
answ[i]=(int)tempa;
printf("%d %d\n",ansh[i],answ[i]);
break;
}
}
ans++;
k=0;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
#define MAXI 1000000
struct NODE{
int h, w;
NODE(){h = w = 0;}
NODE(int h, int w): h(h), w(w){}
bool operator<(const NODE r){
if(h * h + w * w != r.h * r.h + r.w * r.w) return h * h + w * w < r.h * r.h + r.w * r.w;
return h < r.h;
}
};
int main() {
vector<NODE> vec;
REP(i, 1, 151){
REP(j, i+1, 151){
vec.push_back(NODE(i, j));
}
}
SORT(vec);
int h, w;
while(cin >> h >> w, h, w){
int num = 0;
while(vec[num].h != h || vec[num].w != w) num++;
cout << vec[num+1].h << " " << vec[num+1].w << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x;
cin >> n >> x;
long long a[n], c = 0;
for (long long i = 0; i < n; i++)
{
cin >> a[i];
if (a[i] > x)
{
c += a[i] - x;
a[i] = x;
}
}
for (long long i = 1; i < n; i++)
{
if (a[i] + a[i - 1] > x)
{
c += a[i] + a[i - 1] - x;
a[i] = x - a[i - 1];
}
}
cout << c;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int w = 0, e = 0;
int ans[n];
rep(i,n)ans[i] = 0;
rep(i,n){
ans[i] = w;
if(s[i]=='W')w++;
}
rep(i,n){
ans[n-1-i] += e;
if(s[n-1-i]=='E')e++;
}
int minans = INF;
rep(i,n)if(minans > ans[i]) minans = ans[i];
cout << minans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 200005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
res = 0;T f = 1;char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
res = res * 10 +c - '0';
c = getchar();
}
res *= f;
}
template<class T>
void out(T x) {
if(x < 0) {x = -x;putchar('-');}
if(x >= 10) {
out(x / 10);
}
putchar('0' + x % 10);
}
map<pii,int> zz;
int N,K,L;
int fa[MAXN],col[MAXN][2],tot;
int getfa(int x) {
return fa[x] == x ? x : fa[x] = getfa(fa[x]);
}
void Solve() {
read(N);read(K);read(L);
for(int i = 1 ; i <= N ; ++i) fa[i] = i;
int a,b;
for(int i = 1 ; i <= K ; ++i) {
read(a);read(b);
fa[getfa(a)] = getfa(b);
}
tot = 0;
for(int i = 1 ; i <= N ; ++i) {
if(getfa(i) == i) col[i][0] = ++tot;
}
for(int i = 1 ; i <= N ; ++i) col[i][0] = col[getfa(i)][0];
for(int i = 1 ; i <= N ; ++i) fa[i] = i;
for(int i = 1 ; i <= L ; ++i) {
read(a);read(b);
fa[getfa(a)] = getfa(b);
}
tot = 0;
for(int i = 1 ; i <= N ; ++i) {
if(getfa(i) == i) col[i][1] = ++tot;
}
for(int i = 1 ; i <= N ; ++i) col[i][1] = col[getfa(i)][1];
for(int i = 1 ; i <= N ; ++i) {
zz[mp(col[i][0],col[i][1])]++;
}
for(int i = 1 ; i <= N ; ++i) {
out(zz[mp(col[i][0],col[i][1])]);space;
}
enter;
}
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
Solve();
return 0;
}
| #define NguyenDangQuan the_author
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define mset(x, i) memset(x,i,sizeof(x))
#define elif else if
#define heap priority_queue
#define fi first
#define se second
#define pb push_back
#define ld long double
#define ll long long
#define ull unsigned long long
#define task "codejam"
using namespace std;
int typetest;
template<class T>
void read(T &x){
register int c;
T neg = 1;
x = (T)0;
while ((c = getchar()) <= 47 || c >= 58)
if(c == '-') neg = -1;
for (; (c > 47 && c < 58); c = getchar()){
x = (x << 3) + (x << 1) + (T)(c - 48);
}
x *= neg;
}
inline void fastIOfileinput(){
ios:: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen(task".INP", "r", stdin);
// freopen(task".OUT", "w", stdout);
// freopen(task".in", "r", stdin);
// freopen(task".out", "w", stdout);
typetest = 0;
}
const int N = 2e5 + 2;
int m, n, k;
vector<int> ker[N], kel[N];
int ltr[N], ltl[N];
void Enter(){
read(n); read(m); read(k);
while(m--){
int a, b;
read(a); read(b);
ker[a].pb(b);
ker[b].pb(a);
}
while(k--){
int a, b;
read(a); read(b);
kel[a].pb(b);
kel[b].pb(a);
}
}
void BFS(int i, int lt[], vector<int> ke[]){
++m;
lt[i] = m;
queue<int> open;
open.push(i);
while(open.size()){
int c = open.front();
open.pop();
for(auto i : ke[c]){
if((!lt[i]))
open.push(i), lt[i] = m;
}
}
}
void solve(){
m = 0;
for(int i = 1; i <= n; ++i)
if(ltr[i] == 0)
BFS(i, ltr, ker);
m = 0;
for(int i = 1; i <= n; ++i)
if(ltl[i] == 0)
BFS(i, ltl, kel);
map<int, map<int, int> > s;
for(int i = 1; i <= n; ++i){
++s[ltr[i]][ltl[i]];
// cerr << ltr[i] << " " << ltl[i] << "\n";
}
for(int i = 1; i <= n; ++i){
int& v = s[ltr[i]][ltl[i]];
cout << v << " ";
}
}
signed main(){
fastIOfileinput();
if(typetest){
int t;
cin >> t;
int v = t;
while(t--){
Enter();
cout << "Case #" << v - t << ": ";
solve();
}
}
else{
Enter();
solve();
}
}
| 1 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#define N 45
#define mod 1000000007
using namespace std;
int n, x, y, z, f[N][(1 << 17) + 5], ans;
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
while(c < '0' || c > '9') { if(c == '-') w = -1; c = getchar(); }
while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * w;
}
int main()
{
n = read <int> (), x = read <int> (), y = read <int> (), z = read <int> ();
ans = 1;
for(int i = 1; i <= n; i++)
ans = 1ll * ans * 10 % mod;
int sz = (1 << (x + y + z)) - 1, ck = (1 << (x + y + z - 1)) | (1 << (y + z - 1)) | (1 << (z - 1));
f[0][0] = 1;
for(int i = 1; i <= n; i++)
for(int j = 0; j <= sz; j++)
if(f[i - 1][j])
{
for(int k = 1; k <= 10; k++)
{
int tmp = (j << k) | (1 << (k - 1));
tmp &= sz;
if((tmp & ck) != ck) f[i][tmp] = (1ll * f[i][tmp] + f[i - 1][j]) % mod;
}
}
for(int j = 0; j <= sz; j++)
ans = ((1ll * ans - f[n][j]) % mod + mod) % mod;
printf("%d\n", ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int md = 1e9+7;
int n, x, y, z, sm, g;
long long a[2][1<<20] = {1}, ans;
int main(){
scanf("%d%d%d%d", &n, &x, &y, &z);
sm = x + y + z;
g = (((1<<y)+1)<<z)+1;
for(int i = 0; i <= n; i++){
(ans *= 10) %= md;
for(int j = 0; j < 1<<sm; j++){
if((j & g) == g) (ans += a[i&1][j]) %= md;
else for(int k = 1; k <= 10; k++) (a[i&1^1][(j+(1<<sm))>>k] += a[i&1][j]) %= md;
a[i&1][j] = 0;
}
}
printf("%lld\n", ans);
} | 1 |
#include<stdio.h>
int main(void)
{
int i,j,n,n1;
int a,b,c,d;
int cnt[100];
int sum[100];
scanf("%d",&n);
n1=n*(n-1)/2;
for (i=0; i<n; i++) {
sum[i]=0;
cnt[i]=1;
}
for(i=0;i<n1;i++){
scanf("%d %d %d %d",&a,&b,&c,&d);
if(c>d){
sum[a-1]+=3;
}
else if(c<d){
sum[b-1]+=3;
}
else{
sum[a-1]+=1;
sum[b-1]+=1;
}
}
for (i=0; i<n;i++) {
for (j=0;j<n;j++){
if(sum[i]<sum[j]){
cnt[i]++;
}
}
printf("%d\n",cnt[i]);
}
return 0;
} | #include <stdio.h>
#define MAX 200000
using namespace std;
int temp[MAX];
long long merge(int A[], int lo, int mid, int hi) {
for(int i = lo; i <= hi; i++) temp[i] = A[i];
long long cnt = 0;
int i = lo, j = mid + 1;
for(int k = lo; k <= hi; k++) {
if(i > mid) A[k] = temp[j++];
else if(j > hi) A[k] = temp[i++];
else if(temp[i] <= temp[j]) A[k] = temp[i++];
else {
A[k] = temp[j++];
cnt = cnt + mid+1 - i;
}
}
return cnt;
}
long long mergeSort(int A[], int lo, int hi) {
if(lo >= hi) return 0;
long long v1, v2, v3;
int mid = (lo + hi) / 2;
v1 = mergeSort(A, lo, mid);
v2 = mergeSort(A, mid+1, hi);
v3 = merge(A, lo, mid, hi);
return v1 + v2 + v3;
}
int main()
{
int n, A[MAX];
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
long long res = mergeSort(A, 0, n-1);
printf("%lld\n", res);
return 0;
} | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
long long Mod = 998244353, F[10100], InvF[10100], po[10100];
long long Pow(long long a, long long b) {
long long r = 1;
while (b) {
if (b & 1)r = r*a%Mod;
a = a*a%Mod; b >>= 1;
}
return r;
}
long long Comb(int a, int b) {
if (a >= b&&b >= 0)return F[a] * InvF[b] % Mod*InvF[a - b] % Mod;
return 0;
}
long long Get(int a, int b) {
return Comb(a + b - 1, b);
}
long long Go(int n, int p, int c) {
if (n == 0)return 1;
int i;
long long r = 0;
for (i = 0; i <= p; i++) {
if (n < i)continue;
r = (r + Get(i + c, n - i) * Comb(p,i)%Mod * po[i]) % Mod;
}
return r;
}
int main() {
int i, n, K;
scanf("%d%d", &K,&n);
F[0] = InvF[0] =po[0] = 1;
for (i = 1; i <= 10000; i++) {
F[i] = F[i - 1] * i%Mod;
InvF[i] = Pow(F[i], Mod - 2);
po[i] = po[i - 1] * 2 % Mod;
}
for (i = 2; i <= K + K; i++) {
if (i % 2 == 0) {
long long t = min(i - 1, K + K + 1 - i);
printf("%lld\n",(Go(n, t / 2, K - t) + Go(n - 1, t / 2, K - t)) % Mod);
}
else {
long long t = min(i - 1, K + K + 1 - i);
printf("%lld\n",Go(n, t / 2, K - t));
}
}
} | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < n; i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
const int MX = 5005, mod = 998244353;
ll fac[MX], inv[MX];
int n, k;
ll pot (ll b, int p) {
ll res = 1;
while (p) {
if (p & 1) (res *= b) %= mod;
(b *= b) %= mod;
p >>= 1;
}
return res;
}
ll comb (int n, int k) {
if (n < 0 || k < 0 || n < k) return 0;
return fac[n] * inv[k] % mod * inv[n-k] % mod;
}
// n espacios, k numeros
ll f (int n, int k) {
if (!n) return 1;
return comb(n + k - 1, n);
}
int main () {
ios_base::sync_with_stdio(0); cin.tie(0);
fac[0] = inv[0] = 1;
for (ll i = 1; i < MX; i++) {
fac[i] = i * fac[i-1] % mod;
inv[i] = pot(fac[i], mod - 2);
}
cin >> k >> n;
for (int i = 2; i <= 2 * k; i++) {
ll res = 0;
int a = 0, b = 0, mit = 0;
for (int j = 1; j <= k; j++) {
if (2 * j == i) mit = 1;
else if (1 <= i - j && i - j <= k) a++;
else b++;
}
a /= 2;
for (int j = 0; j <= a; j++) {
res += comb(a, j) * pot(2, j) % mod *
(f(n - j, j + b) + mit * f(n - j - 1, j + b)) % mod;
res %= mod;
}
cout << res << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }//sqrt(x)は平方根;
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>()) //降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
///////////////////////////////////////////////////////////////////////////////////
void solve(){
ll n;
cin >> n;
Vi a(n);
rp(i,n){
string s;
cin >> s;
int si=s.size();
bool point=false;
int num=0;
rp(j,si){
if(s[j]=='.') {
point=true;
num=si-j-1;
continue;
}
if(point){
s[j-1]=s[j];
}
}
if(point) s[si-1]='0';
ll aa=stoll(s);
if(!point) aa*=1000000000;
else{
rp(j,9-num-1)aa*=10;
if(num==9) aa/=10;
}
a[i]=aa;
}
matrix mat(19,Vi(19,0)),summat(19,Vi(19,0));
rp(i,n){
ll t=0,f=0;
ll as=a[i];
while(as%2==0){
as/=2;
t++;
}
while(as%5==0){
as/=5;
f++;
}
if(t>18)t=18;
if(f>18)f=18;
mat[t][f]++;
}
for(ll i=18; i>=0; i--){
for(ll j=18; j>=0; j--){
if(i==18&&j==18){
summat[i][j]=mat[i][j];
continue;
}
if(i==18){
summat[i][j]=summat[i][j+1]+mat[i][j];
continue;
}
if(j==18){
summat[i][j]=summat[i+1][j]+mat[i][j];
continue;
}
summat[i][j]=summat[i+1][j]+summat[i][j+1]-summat[i+1][j+1]+mat[i][j];
}
}
ll ans=0;
rp(i,19){
rp(j,19){
if(i>=9&&j>=9){
ans+=mat[i][j]*(summat[18-i][18-j]-1);
continue;
}
ans+=mat[i][j]*summat[18-i][18-j];
}
}
ans/=2;
print(ans);
return;
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
solve();
return 0;
} | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 2000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
ll n,a[maxn],b[maxn],c[maxn];
inline ll read()
{
ll x=0,w=1,x2=0,base=1e9; char c=getchar();
while(c<'0'||c>'9') c=getchar();
while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
if(c=='.')
{
while(c<'0'||c>'9') c=getchar();
while(c<='9'&&c>='0') {x2=(x2<<1)+(x2<<3)+c-'0'; base/=10; c=getchar();}
return x*1e9+x2*base;
}
else return x*1e9;
}
ll dp[55][55];
int main()
{
ll n,ans=0; cin>>n; rep(i,1,n) a[i]=read();
rep(i,1,n)
{
int c1=0,c2=0;
while(a[i]%2==0) a[i]/=2,c1++; c1=min(18,c1);
while(a[i]%5==0) a[i]/=5,c2++; c2=min(18,c2);
rep(j,18-c1,50) rep(k,18-c2,50) ans+=dp[j][k];
dp[c1][c2]++;
}
cout<<ans<<endl;
return 0;
} | 1 |
#include<iostream>
#include<string>
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
cin >> n >> s;
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
ll ans = 0;
ll cm = 0, cc = 0;
int left = 0, right = 0;
ll plus = 0;
for (; left < n; left++) {
while (right < n && right - left < k) {
if (s[right] == 'M')cm++;
if (s[right] == 'C')plus += cm, cc++;
right++;
}
if (s[left] == 'D')ans += plus;
if (s[left] == 'M')plus -= cc, cm--;
if (s[left] == 'C')cc--;
}
cout << ans << endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
/*
void swap(int &a,int &b){
int tmp=a;
a=b;
b=tmp;
}*/
int partition(int A[],int p,int r){
int x=A[r-1];
int i=p-1;
for(int j=p;j<r;j++){
if(A[j]<=x){
i++;
if(i>=0&&j>=0)
swap(A[i],A[j]);
}
//swap(A[i],A[r-1]);
}
//swap(A[i],A[r-1]);
return i;
}
int main(){
int tmp[1000000];
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>tmp[i];
}
int q;
q=partition(tmp,0,n);
for(int i=0;i<n;i++){
if(i==q){
cout<<"["<<tmp[i]<<"]";
}
else cout<<tmp[i];
if(i==n-1)cout<<endl;
else cout<<" ";
}
return 0;
} | 0 |
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<iostream>
#include<queue>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<long long,long long> pll;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define rep(i,j,k) for(register int i=(int)(j);i<=(int)(k);i++)
#define rrep(i,j,k) for(register int i=(int)(j);i>=(int)(k);i--)
ll read(){
ll 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*10+c-'0';c=getchar();}
return x*f;
}
const int maxn=200;
int n,m;
int a[maxn];
int main(){
#ifdef LZT
// freopen("in","r",stdin);
#endif
int num=0;
n=read();m=read();
rep(i,1,m){
a[i]=read();
if(a[i]&1) num++;
}
if(num>2){
puts("Impossible");
return 0;
}
for(int i=1;i<=m;i++)
if(a[i]&1){
if(a[1]&1) swap(a[i],a[m]);
else swap(a[i],a[1]);
}
rep(i,1,m) cout<<a[i]<<' ';
cout<<endl;
a[1]++;a[m]--;
if(a[m]==0) m--;
if(m>=2){
cout<<m<<endl;
rep(i,1,m) cout<<a[i]<<' ';
cout<<endl;
}
else{
if(n<=2){
cout<<1<<endl;
cout<<n<<endl;
}
else{
cout<<2<<endl;
cout<<n-1<<' '<<1<<endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int A[103], B[103], cnt;
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for(int i = 1; i <= m; i++)
{
scanf("%d", &A[i]);
cnt += (A[i] & 1);
}
if(cnt > 2) return puts("Impossible"), 0;
if(m == 1 && A[1] == 1) return printf("1\n1\n1\n"), 0;
if(m == 1) return printf("%d\n2\n%d 1\n", A[1], A[1] - 1), 0;
sort(A + 1, A + 1 + m, [](int x, int y) { return (x & 1) > (y & 1); });
swap(A[2], A[m]);
for(int i = 1; i <= m; i++)
printf("%d%c", A[i], " \n" [i == m]);
printf("%d\n%d ", A[m] > 1 ? m : m - 1, A[1] + 1);
for(int i = 2; i < m; i++)
printf("%d ", A[i]);
if(A[m] > 1) printf("%d\n", A[m] - 1);
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>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define infi 1900000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T> using ve = vector<T>;
template<typename T> using pq2 = priority_queue<T>;
template<typename T> using pq1 = priority_queue<T,vector<T>,greater<T>>;
int main()
{
int N;
cin >> N;
cout << 180*((N-3)+1) << endl;
return 0;
}
| 0 |
// lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
//#define double long double
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,n,maxi=0,f=0,mini=INF;
ll sum=0;
string str,sub;
ll h,w;
ll m;
cin>>n>>m;
if(m==0){
if(n==1){
cout<<0<<endl;
}else if(n==2){
cout<<10<<endl;
}else{
cout<<100<<endl;
}
return 0;
}
vector<pair<ll,ll>> s(m);
rep(i,m){
cin>>a>>b;
s[i]=make_pair(a,b);
}
f=0;
sort(s.begin(),s.end());
sum=0;
if(s[0].first==1) {
//sum-=100;
if(s[0].second==0&&n!=1) f=1;
sum+=100*s[0].second;
}
if(s[0].first==2){
//if(s[0].second==0&&n==2) f=1;
sum+=10*s[0].second;
// sum-=10;
}
if(s[0].first==3){
//sum-=1;
sum+=1*s[0].second;
}
for(ll i=1;i<m;i++){
if(s[i-1].first==s[i].first&&s[i-1].second!=s[i].second) f=1;
else if(s[i-1].first==s[i].first&&s[i-1].second==s[i].second) continue;
else{
if(s[i].first==1) {
// sum-=100;
if(s[i].second==0&&n!=1) f=1;
sum+=100*s[i].second;
}
if(s[i].first==2) {
// sum-=10;
sum+=10*s[i].second;
}
if(s[i].first==3) {
// sum--;
sum+=1*s[i].second;
}
}
}
if(n==1&&sum!=0) sum/=100;
if(n==2&&sum!=0) sum/=10;
if(n==3&&sum!=0&&sum<100) sum+=100;
if(n==2&&sum<10) sum+=10;
if(f!=1&&sum==0&&n==1){
cout<<0<<endl;
return 0;
}
if(f==1){
cout<<"-1"<<endl;
}else{
cout<<sum<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
vector<pair<int,int>> pr(m);
rep(i,m){
int s,c;cin>>s>>c;
s--;
pr[i]=make_pair(s,c);
}
rep(i,1000){
string s=to_string(i);
if(s.size()==n){
bool ans=true;
rep(j,m){
if((s[pr[j].first]-'0')!=pr[j].second)ans=false;
}
if(ans){
cout<<i<<endl;
return 0;
}
}
}
cout<<-1<<endl;
} | 1 |
#include <stdio.h>
#include <string.h>
void shift(char *str, int len, int n){
char t[] = "abcdefghijklmnopqrstuvwxyz";
char c;
for(int i=0; i<len; ++i){
c = *(str + i);
if(c >= 'a' && c <= 'z'){
str[i] = t[(c-'a'+n)%26];
}
}
}
int main(void){
char input[81];
char copy[81];
char *token;
int len = 0;
int n = 0;
while(fgets(input, 80, stdin) != NULL){
n = -1;
strcpy(copy, input);
token = strtok(copy, " .\n");
while(token != NULL && n == -1){
len = strlen(token);
if(len == 4){
for(int i=0;i<26; ++i){
shift(token, 4, 1);
if(strcmp(token, "this")==0 ||
strcmp(token, "that")==0){
n = i + 1;
break;
}
}
}else if(len ==3){
for(int i=0;i<26; ++i){
shift(token, 3, 1);
if(strcmp(token, "the")==0){
n = i + 1;
break;
}
}
}
token = strtok(NULL, " .\n");
}
shift(input, strlen(input), n);
printf(input);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
while (getline(cin, str)) {
for (int i = 0; i < 26; ++i) {
for (char& c : str) {
if (isalpha(c)) {
if (c != 'z') ++c;
else c = 'a';
}
}
if (str.find("that") != string::npos || str.find("this") != string::npos || str.find("the") != string::npos) {
cout << str << endl;
}
}
}
} | 1 |
#include<cstdio>
void swap(int &x,int &y)
{
int t=x;
x=y;
y=t;
return ;
}
int main()
{
int a,b,c;
while(~scanf("%d %d %d",&a,&b,&c))
{
int t;
swap(a,b);
swap(a,c);
printf("%d %d %d\n",a,b,c);
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<string> a;
bool cmp(string s, string t) {
if (s.length() != t.length()) return s.length() < t.length();
return s < t;
}
void sol(string s) {
a.push_back(s);
if (s.length() == 10) return;
if (s.back() != '0') {
s += (s.back() - 1);
sol(s);
s.pop_back();
}
s += (s.back());
sol(s);
s.pop_back();
if (s.back() != '9') {
s += (s.back() + 1);
sol(s);
s.pop_back();
}
}
int main() {
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << c << ' ' << a << ' ' << b;
}
| 1 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define pb push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
if (n % k == 0)
cout << 0 << endl;
else
cout << 1 << endl;
} | #pragma GCC optimize(3,"Ofast","inline")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
#define getchar gc
inline char gc(){
static char buf[1<<16],*p1=buf,*p2=buf;
if(p1==p2){
p2=(p1=buf)+fread(buf,1,1<<16,stdin);
if(p2==p1) return EOF;
}
return *p1++;
}
#endif
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<class t> inline void write(t x){
if(x<0) putchar('-'),write(-x);
else{if(x>9) write(x/10);putchar('0'+x%10);}
}
int n,k;
signed main(){
read(n);read(k);
for(int i=1,l=1,r=k+1;i<=k;i++){
if(l>=r) l=k+2,r=k<<1|1;
printf("%d %d\n",l++,r--);
}
} | 0 |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_poizcy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define mem(a,h) memset(a, (h), sizeof(a))
#define fi first
#define se second
#define por(a,b) (((a%MOD) * (b%MOD))%MOD)
#define forg(i, b, e, c) for (ll i = (ll)b; i < (ll)e; i+=c)
#define forr(i, b, e) for (ll i = b; i < e; i++)
using namespace std;
//using namespace __gnu_pbds;
typedef double lldb;
typedef pair<ll, ll> ii;
typedef pair<double, double> iidb;
typedef pair<ii, ll> iii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<ll> vll;
//typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const ll INF = 1e18+7;
const double PI = acos(-1);
const ll MOD= 1e9+7;
#define initseg ll new_nodo=(nodo*2),mid=(iz+der)/2;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define tam 210000
#define offset 200
#define ptr nodo*
map<ll,vector<iii> > chocarx,chocary,flechader,flechaiz,flechader2,flechaiz2;
vector<pair<ii,string> >lst,lst2;
ll ANSWER;
void update(ii par1, ii par2)
{
if (par1.fi==INF|| par2.fi==INF)return;
ll dist=abs(par1.fi-par2.fi)+abs(par1.se-par2.se);
ANSWER=min(ANSWER,dist*5);
}
void resolver1(map<ll,vector<iii> > & mapa)
{
//<<"mira \n";
for(auto ite:mapa)
{
sort(all(ite.se));
ii actant={INF,INF};
//<<ite.fi<<":\n";
for(iii par:ite.second)
{
//<<par.fi.fi<<","<<par.fi.se<<" "<<par.se<<" - ";
if (par.se==1)
{
actant=par.fi;
}
else
{
update(par.fi,actant);
}
}
//<<endl;
}
}
void resolver2(map<ll,vector<iii> > & mapa)
{
for(auto ite:mapa)
{
sort(all(ite.se));
ii actant={INF,INF};
for(iii par:ite.second)
{
if (par.se==1)
{
actant=par.fi;
}
else
{
update(par.fi,actant);
}
}
}
}
void solve(vector<pair<ii,string> >este)
{
ll x,y;
string tipo;
chocarx.clear(),chocary.clear(),flechaiz.clear(),flechader.clear();
flechaiz2.clear(),flechader2.clear();
for(auto par:este)
{
x=par.fi.fi;
y=par.fi.se;
tipo=par.se;
if (tipo=="U" || tipo=="D")
chocarx[x].pb({{y,x},tipo=="U"});
else
chocary[y].pb({{y,x},tipo=="R"});
if (tipo=="D"|| tipo=="U")
{
if (tipo=="U"){
flechader[x-y].pb({{y,x},tipo=="U"});
flechaiz[x+y].pb({{y,x},tipo=="U"});
}
else
{
flechader2[x-y].pb({{y,x},0});
flechaiz2[x+y].pb({{y,x},0});
}
}
else
{
if (tipo=="L")
{
flechader[x-y].pb({{y,x},tipo=="U"});
flechaiz2[x+y].pb({{y,x},1});
}
else
{
flechaiz[x+y].pb({{y,x},tipo=="U"});
flechader2[x-y].pb({{y,x},1});
}
}
}
resolver1(chocarx);
resolver1(chocary);
resolver1(flechaiz);
resolver1(flechader);
resolver1(flechaiz2);
resolver1(flechader2);
}
int main()
{
ANSWER=INF;
ll n;
cin>>n;
ll x,y;
string tipo;
map<string,string> inv;
inv["L"]="R";inv["R"]="L";inv["U"]="D";inv["D"]="U";
forr(i,0,n)
{
cin>>x>>y>>tipo;
lst.pb({{x,y},tipo});
lst2.pb({{x,y},inv[tipo]});
}
solve(lst);
//solve(lst2);
if (ANSWER==INF)
cout<<"SAFE\n";
else
cout<<ANSWER<<endl;
} | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <complex>
#include <functional>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(c,i) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;
string replace(string s,char table[])
{
rep(i,s.size())
if(islower(s[i]))
s[i]=table[s[i]-'a'];
return s;
}
int main()
{
for(string s;getline(cin,s);){
char table[]="abcdefghijklmnopqrstuvwxyz";
rep(i,26){
string s2=" "+s+" ";
rep(i,s2.size())
if(s2[i]=='.' || s2[i]=='\n')
s2[i]=' ';
s2=replace(s2,table);
if(s2.find(" the ")!=string::npos || s2.find(" this ")!=string::npos ||s2.find(" that ")!=string::npos){
cout<<replace(s,table)<<endl;
break;
}
rotate(table,table+1,table+26);
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> v(4);
for(int i = 0; i < 4; i++){
v.at(i) = (int)S.at(i) - (int)'0';
}
bool finish = false;
for (int tmp = 0; tmp < (1 << 3); tmp++){
if(finish) break;
bitset<3> s(tmp);
int test = v.at(0);
int sign = 1;
string op = "+++";
for(int i = 0; i < 3; i++){
if(s.test(i)){
sign = -1;
op.at(i)='-';
}else{
sign = 1;
}
test += sign * v.at(i+1);
}
if(test == 7){
for(int i=0; i<3;i++){
cout << v.at(i) << op.at(i);
}
cout << v.at(3) << "=7" << endl;
finish = true;
}
}
}
| #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define n1 "\n"
#define B begin()
#define E end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define popb pop_back()
#define popf pop_front()
const int BIG=1e5+55;
const int BIGG=1e9+7;
const ll BIGGE=1e12+55;
const double SML=(1e-7);
using namespace std;
int a[5];
bool go = 0;
void dp(int i, int sum, string s) {
if (go || i > 3)
return;
if (sum == 7 && i == 3) {
go = 1;
cout <<s <<'=' <<7;
return;
}
string ans = s , an = s;
ans += '-';
ans += (a[i+1] + '0');
if (i != -1)
an += '+';
an += (a[i+1] + '0');
if (i != -1)
dp(i+1 , sum-a[i+1] ,ans);
dp(i+1 , sum+a[i+1] ,an);
}
int main()
{
ios::sync_with_stdio(false); cin.tie(NULL);
cout.tie(NULL);
for (int i=0; i<4; i++) {
char c;
cin >>c;
a[i] = c - '0';
}
dp(-1,0,"");
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
//S の先頭から 3 文字目と末尾から 2 文字目の間（両端含む）に大文字の C がちょうど 1 個含まれる。
int count = 0;
int index;
for (int i = 2; i < S.size() - 1; i++) {
if(S[i] == 'C'){
count++;
index = i;
}
}
int up_count = 0;
for (int i = 1; i < S.size(); i++) {
if(i != index){
if(S[i] >= 'A' && S[i] <= 'Z'){
up_count++;
}
}
}
if(S[0] == 'A' && count == 1 && up_count == 0){
cout << "AC" << endl;
}else{
cout << "WA" << endl;
}
} | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の入力を受け取る
void read(){
}
template<typename First, typename... Rest>
void read(First& first, Rest&... rest){
cin >> first;
read(rest...);
}
//配列を区切って出力する
template<typename T>
void write_vec(vector<T>& v, char divider){
for(size_t i = 0; i < v.size(); i++){
cout << v[i] << divider;
}
}
};
int main(){
Stream io;
string S;
io.read(S);
string ans = "AC";
if(S[0] != 'A') ans = "WA";
int c = 0;
for(int i = 1; i < S.size(); i++){
if(!(S[i] <= 'z' && S[i] >= 'a')){
if(i <= S.size() - 2 && i >= 2){
c++;
}
else ans = "WA";
}
}
if(c != 1) ans = "WA";
cout << ans;
return 0;
} | 1 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
#include<queue>
using namespace std;
namespace MyLib {
#define ALL(a) a.begin(),a.end()
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define debug(x) if(1)cout<<#x<<":"<<x<<endl;
#define DEBUG(x) if(1)cout<<#x<<":"<<x<<endl;
#define ll long long
}
using namespace MyLib;
bool ju[21][21];
int rx[30], ry[30];
int main() {
int m;
int l[30];
char buf;
int x, y;
int n;
while (cin >> n, n) {
REP(i, 21)
REP(j, 21)
ju[i][j] = 0;
REP(i, n)
cin >> x >> y, ju[y][x] = 1;
cin >> m;
REP(i, m) {
cin >> buf >> l[i];
if (buf == 'E') {
rx[i] = 1;
ry[i] = 0;
}
else if (buf == 'W') {
rx[i] = -1;
ry[i] = 0;
}
else if (buf == 'N') {
rx[i]= 0;
ry[i] = 1;
}
else if (buf == 'S') {
rx[i] = 0;
ry[i] = -1;
}
}
x = 10, y = 10;
int count = 0;
REP(i,m)
REP(j, l[i]) {
x += rx[i];
y += ry[i];
if (ju[y][x]) {
ju[y][x] = 0;
count++;
}
}
if (count == n)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int L;
int l[10];
int v1, v2;
int st, la;
double pass;
double time;
char comma;
while(cin >> l[0]){
for(int i=1;i<10;i++){
cin >> comma >> L;
l[i] = L + l[i-1];
}
cin >> comma >> v1 >> comma >> v2;
time = l[9] / (double)(v1+v2);
pass = time * v1;
for(int i=0;i<10;i++){
if(pass <= l[i]){
cout << i+1 << endl;
break;
}
}
}
} | 0 |
#include <iostream>
#include <vector>
#include <string>
#define rep(i,N) for(int i=0;i<(N);i++)
using namespace std;
int main(){
long long N,i=0;
cin>>N;
vector<long long> p;
while(N!=0){
N=N-1;
p.push_back(N % 26);
N = N / 26;
i++;
}
string res = "";
for(int i = p.size() -1 ; i >= 0 ; i-- )res += (char)('a' +p[i]);
cout<<res<<endl;
} | #include <stdio.h>
int main(){
int t;
scanf("%d", &t);
long long int sum=0;
long long int min =0;
for (int i=1; i<= t; i++){
if (i%3==0 || i%5==0){
min += i;
}
sum+=i;
}
printf("%lld", sum-min);
return 0;
} | 0 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
#include <map>
using namespace std;
const int MAXN = 1000005;
char S[MAXN], T[MAXN];
int n, q[MAXN], head = 1, tail;
signed main () {
scanf("%d%s%s", &n, S+1, T+1);
if(strcmp(S+1, T+1) == 0) { puts("0"); return 0; }
int ans = 0;
for(int i = n, j = n; i >= 1; --i) {
if(T[i] == T[i-1]) continue;
j = min(j, i);
for(; j && S[j] != T[i]; --j);
if(!j) { puts("-1"); return 0; }
while(head <= tail && q[head] - (tail-head+1) + 1 > i) ++head;
q[++tail] = j;
if(i != j) ans = max(ans, tail-head+1);
}
printf("%d\n", ans+1);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 998244353
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
char a[1000005],b[1000005];
vector<int>from;
vector<int>to;
vector<int>pos[26];
int main(){
int n;
scanf("%d%s%s",&n,&a,&b);
for(int i=0;i<n;i++) if(a[i] != b[i]) goto nxt;
puts("0"); return 0; nxt:;
for(int i=0;i<n;i++) pos[a[i]-'a'].pb(i);
bool dif = 0;
int pre = INF;
for(int i=n-1;i>=0;i--){
if(i == 0 || (i > 0 && b[i-1] != b[i])){
int id = b[i]-'a';
int x = POSU(pos[id],min(pre-1,i));
if(x == 0){
puts("-1");
return 0;
}
from.pb(pos[id][x-1]);
to.pb(i);
if(pos[id][x-1] != i) dif = 1;
pre = pos[id][x-1];
}
}
int ret = 0;
for(int i=0;i<to.size();i++){
//(lb,ub]
int lb = -1,ub = i+1;
while(ub-lb > 1){
int mid = (lb+ub)/2;
int x = from[i-mid]-mid;
if(x >= to[i]) ub = mid;
else lb = mid;
}
ret = max(ret,ub+1);
}
cout<<ret<<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
// DAG
vector<bool> visited;
vector<int> dp;
int DFS(const vector<vector<int>> &graph, int v){
if(visited[v] == true) return dp[v];
visited[v] = true;
for(auto next_v : graph[v]){
if(DFS(graph, next_v) == -1) return -1;
dp[v] = max(dp[v], DFS(graph, next_v) + 1);
}
return dp[v] = max(0, dp[v]);// if no next_v (i.e. source) dp[v] = 0
}
int main(){
int n;
cin >> n;
int V = n * (n-1) / 2;
visited.assign(V,false);
dp.assign(V,-1);
vector<vector<int>> a(n, vector<int>(n-1));
for(int i=0; i<n; i++){
for(int j=0; j<n-1; j++){
cin >> a[i][j];
a[i][j] -= 1;
}
}
vector<vector<int>> matchID(n, vector<int>(n));
int id = 0;
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
matchID[i][j] = id;
matchID[j][i] = id;
id += 1;
}
}
vector<vector<int>> graph(V);
for(int i=0; i<n; i++){
for(int j=1; j<n-1; j++){
int s = matchID[i][a[i][j-1]];
int t = matchID[i][a[i][j]];
//cout << s << " " << t << endl;
graph[t].push_back(s);// arrow inversed
}
}
int ans = 0;
for(int i=0; i<V; i++){
int depth = DFS(graph, i);
if(depth == -1){
cout << -1 << endl;
return 0;
}
ans = max(ans, depth);
}
cout << ans + 1 << endl;
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>;
using ll = long long;
int main(){
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n-1));
rep(i, n){
rep(j, n-1){
cin >> a[i][j];
a[i][j]--;
}
reverse(a[i].begin(), a[i].end());
}
vector<P> q;
auto check = [&](int i){
if(a[i].size() == 0) return;
int j = a[i].back();
if(a[j].size() == 0) return;
if(a[j].back() == i){
P p(i, j);
if(p.second < p.first) swap(p.first, p.second);
q.push_back(p);
}
};
rep(i, n){
check(i);
}
int day = 0;
while(q.size() > 0){
day++;
sort(q.begin(), q.end());
q.erase(unique(q.begin(), q.end()), q.end());
vector<P> prevQ;
swap(prevQ, q);
for(P p : prevQ){
int i = p.first, j = p.second;
a[i].pop_back();
a[j].pop_back();
}
for(P p : prevQ){
int i = p.first, j = p.second;
check(i);
check(j);
}
}
rep(i, n){
if(a[i].size() != 0){
puts("-1");
return 0;
}
}
cout << day << endl;
} | 1 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
//#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int N = 3000000;
int mod = 1e9 + 7;
int s[N], dp[N][2], b[N];
map < int, int > m;
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("input.txt", "r", stdin);
int n;
cin >> n;
s[0] = 0;
set < int > t;
for (int i = 1; i <= n; i++){
int x;
cin >> x;
s[i] = (s[i - 1] ^ x);
t.insert(s[i]);
}
t.insert(0);
int cnt = 0;
for (auto i: t){
m[i] = cnt;
cnt++;
}
for (int i = 1; i <= cnt; i++) dp[i][0] = 1;
int g = 0;
for (int i = 1; i <= n; i++){
if (s[i] == 0){
g++;
} else{
int p = m[s[i]];
if (b[p] < g){
dp[p][0] = (dp[p][0] + (g - b[p]) * dp[p][1]) % mod;
b[p] = g;
}
dp[p][1] = (dp[p][1] + dp[p][0]) % mod;
}
}
if (s[n] == 0){
int c = 1;
for (int i = 1; i < n; i++) if (s[i] == 0) c = (c + c) % mod;
for (int i = 1; i <= cnt; i++){
c = (c + dp[i][1]) % mod;
}
cout << c << endl;
}
else {
int p = m[s[n]];
if (b[p] < g) dp[p][0] = (dp[p][0] + (g - b[p]) * dp[p][1]) % mod;
cout << dp[p][0];
};
}
| #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define __ ios_base::sync_with_stdio(0);cin.tie(0);
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define forn(i,a,n) for(int i=a; i < n; i++)
typedef long long int lli;
typedef long double Double;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define MAXN (1<<16)
lli val[MAXN];
lli dp[MAXN];
int used[MAXN];
int a[17][17];
int n;
lli solve(int msk){
if(msk == (1<<n)-1){
return 0ll;
}
if(used[msk]) return dp[msk];
used[msk] = 1;
lli ans = -1ll;
int ini = msk ^ ((1<<n)-1);
for(int i=ini; i >=1; i--){
int andi = msk & i;
if(andi == 0){
ans = max(ans, solve(msk | i) + val[i]);
}
}
return dp[msk] = ans;
}
int main(){__
cin >> n;
for(int i=0; i < n; i++){
for(int j=0; j < n; j++){
cin >> a[i][j];
}
}
for(int i=1; i < (1<<n);i++){
int msk = i;
lli res = 0ll;
for(int j =0; j < n; j++){
if(msk & (1<<j)){
for(int k =j; k < n; k++){
if(msk & (1<<k)){
res+= a[j][k];
}
}
}
}
val[i] = res;
}
cout << solve(0) << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {if(b>a) return b; else return a;}
int min(int a, int b) {if(b<a) return b; else return a;}
const int INF = 1e18;
int N, M;
vvi A(305, vi(305));
int dfs(int n, V(bool) D) {
if(n==0) return 0;
//int res = INF;
int t = 0;
vi cnt(M, 0);
rep(i, N) {
rep(j, M) {
if(D[A[i][j]]) {
cnt[A[i][j]]++;
break;
}
}
}
int mi = 0;
rep(i, M) {
if(cnt[i]>cnt[mi]) mi = i;
}
int res = cnt[mi];
D[mi] = false;
int nx = dfs(n-1, D);
if(nx) res = min(res, nx);
return res;
}
signed main() {
cin >> N >> M;
rep(i, N) rep(j, M) {
cin >> A[i][j];
A[i][j]--;
}
V(bool) D(M, true);
cout << dfs(M, D) << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define rep(A,B,C) for(A=B;A<C;++A)
#define repd(A,B,C) for(A=(ll)C-1;A>=B;++A)
#define pii pair<int,int>
#define pll pair<ll,ll>
template<typename T>
void mxin(T& a,T b){if(a<b)a = b;}
template<typename T>
void mnin(T& a,T b){if(a>b)a = b;}
using namespace std;
/////////////////////////////////////////////////////
#define MOD 998244353
#define MXN 333
char S[333];
ll N,K;
ll dp[MXN][MXN], odp[MXN][MXN];
ll i, j, k, l;
int main(){
scanf("%s%lld", S, &K);
N = strlen(S);
K = min(N, K);
dp[0][0] = 1;
ll pi = N;
for (i = N - 1; i >= 0;--i)
{
if(S[i]=='1')
continue;
rep(j,0,MXN){
rep(k,0,MXN){
odp[j][k] = dp[j][k];
dp[j][k] = 0;
}
}
ll a = pi - i;
pi = i;
rep(j,0,K+1){
ll b = 0;
for(k = j; k >= 0;--k){
(b += odp[j][k]) %= MOD;
(dp[j][k] += b) %= MOD;
if(odp[j][k]==0)
continue;
rep(l,1,a){
(dp[j + l][k + l] += odp[j][k]) %= MOD;
}
}
}
//printf("\n%lld:\n", i);
/*
rep(j,0,N+1){
rep(k,0,j+1){
printf("%lld ", dp[j][k]);
}
printf("\n");
}*/
}
ll ans = 0;
rep(i,0,K+1){
rep(j,0,i+1){
(ans += dp[i][j]) %= MOD;
}
}
printf("%lld\n", ans);
return 0;
} | 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 main() {
int N, T; cin >> N >> T;
vector<int> t(N);
rep(i, N){
cin >> t[i];
}
int ans = t[N-1] + T;
for (int i = 1; i < N; i++){
int d = t[i] - t[i-1];
if(d > T){
ans -= d-T;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
vector<int>A(N);
vector<int>B(N);
vector<int>C(N);
vector<long long>D(N);
for(int i=0;i<N;i++)cin>>A[i];
for(int i=0;i<N;i++)cin>>B[i];
for(int i=0;i<N;i++)cin>>C[i];
sort(A.begin(),A.end());
sort(C.begin(),C.end());
long long ans=0;
for(int i=0;i<N;i++){
ans+=(N-(A.end()-lower_bound(A.begin(),A.end(),B[i])))*(C.end()-upper_bound(C.begin(),C.end(),B[i]));
}
cout<<ans<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
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<typename T, typename U>
void print1(T Array, U size) {
for (int i = 0; i < size; i++) {
cout << Array[i] << " ";
}
cout << endl;
}
template<typename T>
void print(T Array, int height, int width) {
for (int i = 0; i < height; i++) {
for (int j = 0; j < width; j++) {
cout << " " << Array[i][j];
}
cout << endl;
}
}
// ------------------------------------------------------------------------------------------
int n;
int dp[55];
int rec(int stage) {
if (stage == 0) {
return dp[stage] = 1;
}
if (dp[stage] != -1) {
return dp[stage];
}
int ans = 0;
for (int i = 1; i <= 3; i++) {
if (stage - i < 0) continue;
ans += rec(stage - i);
}
return dp[stage] = ans;
}
signed main() {
fill(dp, dp+33, -1);
rec(30);
while (1) {
cin >> n;
if (n == 0) break;
int t = (dp[n] + 3650 - 1) / 3650;
cout << t << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main(){
int A[128], N;
A[0] = 1;
for(int i=1; i<=32; i++){
A[i] = A[i-1];
if(i>=1) A[i] += A[i-2];
if(i>=2) A[i] += A[i-3];
}
while (cin >> N && N) cout << (((A[N] + 9)/ 10) + 364) / 365 << endl;
} | 1 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
// MAX int 2,147,483,647 -> 10桁
// MAX ll 9,223,372,036,854,775,807 -> 19桁
// MAX O(n) 10^8 -> 8回
// double pi = M_PI or acos(-1)
// printf("%.10f\n", ans);
int main() {
int n;
cin >> n;
vector<int> x(n), y(n);
rep(i, n) cin >> x[i] >> y[i];
auto dist = [&](int i, int j) {
double dx = x[i] - x[j];
double dy = y[i] - y[j];
return sqrt(dx * dx + dy * dy);
};
vector<int> p(n);
rep(i, n) p.at(i) = i;
double len = 0;
int cnt = 0;
do {
rep(i, n - 1) {
len += dist(p.at(i), p.at(i + 1));
}
cnt++;
} while (next_permutation(p.begin(), p.end()));
double ans = len / cnt;
printf("%.10f\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using ll = long long;
using P = pair<ll,ll>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()
int main(){
ll T;
cin >> T;
rep(w,T){
ll N;
cin >> N;
vec A(N);
rep(i,N){
cin >> A.at(i);
}
string S;
cin >> S;
set<ll> B;
B.insert(0);
rep(i,N){
set<ll> C;
auto b=B.end();
ll a=A.at(N-1-i);
rep(j,(ll)B.size()){
b--;
a=min(a,a^*b);
}
if(S.at(N-1-i)=='0'){
if(a!=0){
B.insert(a);
}
}else{
if(a!=0){
B=C;
break;
}
}
}
if(B.size()==0){
cout << 1 << endl;
}else{
cout << 0 << endl;
}
}
} | 0 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
using namespace std;
long long int arr[5000+5];
long long int result[5000+5];
int main()
{
int n;
int count=0;
while(cin>>n&&(n!=0))
{
long long int sum;
long long int max;
for(int i=0;i<n;i++)
{
cin>>arr[i];
if(i==0)
{
sum=arr[i];
max=arr[i];
continue;
}
if(sum<0)
{
sum=arr[i];
if(sum>max) max=sum;
}
else if(sum+arr[i]>0)
{
sum=sum+arr[i];
if(sum>max) max=sum;
}
else sum=arr[i];
}
result[count++]=max;
}
for(int i=0;i<count;i++) cout<<result[i]<<endl;
//while(1);
return 0;
}
| #include<iostream>
using namespace std;
int main(){
int count,max,i,j,k,l;
int sum,data_set[5000];
while(cin>>count){
if(!count)break;
cin>>data_set[0];
max=data_set[0];
for( i=1;i<count;i++){
cin>>data_set[i];
}
// for(l=1;l<=count;l++){
for( j=0;j<count;j++){
sum=0;
for( k=j;k<count;k++){
sum+=data_set[k];
if(max<sum)max=sum;
}
}
cout<<max<<endl;
}
} | 1 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define INF 120000000
using namespace std;
typedef pair<int, int> P;
typedef long long int LL;
int v, e;
vector<int> g[10010], rg[10010], vs, st;
vector<bool> vis;
void dfs(int x) {
vis[x] = true;
for (int i = 0; i < g[x].size(); i++) {
if (!vis[g[x][i]]) dfs(g[x][i]);
}
vs.pb(x);
}
void rdfs(int x, int k) {
vis[x] = true;
st[x] = k;
for (int i = 0; i < rg[x].size(); i++) {
if (!vis[rg[x][i]]) rdfs(rg[x][i], k);
}
}
bool isSame(int u, int v) {
return (st[u] == st[v]);
}
int main() {
cin >> v >> e;
for (int i = 0; i < e; i++) {
int a, b;
cin >> a >> b;
g[a].pb(b);
rg[b].pb(a);
}
st.resize(v);
vis.resize(v, false);
for (int i = 0; i < v; i++) {
if (!vis[i]) dfs(i);
}
int k = 0;
fill(vis.begin(), vis.end(), false);
for (int i = vs.size() - 1; i >= 0; i--) {
if (!vis[vs[i]]) rdfs(vs[i], k++);
}
int q;
cin >> q;
int u, v;
for (int i = 0; i < q; i++) {
cin >> u >> v;
cout << isSame(u, v) << endl;
}
return 0;
} | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9+7;
template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}
void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}
class ConnectNodeInfo{
vector<vector<pair<ll,ll>>> graph;
public:
ConnectNodeInfo(int node_num){
graph.resize(node_num);
}
void AddNonDirectionalConnection(ll u,ll v,ll w){
graph[u].emplace_back(v,w);
graph[v].emplace_back(u,w);
}
void AddDirectionalConnection(ll u,ll v,ll w){
graph[u].emplace_back(v,w);
}
vector<pair<ll,ll>>& operator[](ll index){
return graph[index];
}
size_t size(){return graph.size();}
};
class UnionFind{
vector<ll> rank;
vector<ll> diff_weight;
vector<ll> num;
public:
vector<ll> par;
UnionFind(ll N):par(N),num(N),rank(N),diff_weight(N){
for(ll i=0;i<N;i++){
par[i]=i;
num[i]=1;
rank[i]=0;
diff_weight[i]=0;
}
}
ll root(ll x){
if(par[x]==x){
return x;
}
ll r = root(par[x]);
diff_weight[x]+=diff_weight[par[x]];
return par[x]=r;
}
void unite(ll x,ll y){
ll rx = root(x);
ll ry = root(y);
if (rx == ry) return;
if(rank[rx]<rank[ry]) swap(rx,ry);
if(rank[rx]==rank[ry]) ++rank[rx];
par[ry] = rx;
num[rx] += num[ry];
}
void relate(ll x,ll y,ll w){
w+=weight(x),w-=weight(y);
ll rx = root(x);
ll ry = root(y);
if (rx == ry) return;
if(rank[rx]<rank[ry]){
swap(rx,ry);
w = -w;
}
if(rank[rx]==rank[ry]) ++rank[rx];
par[ry] = rx;
diff_weight[ry] = w;
num[rx] += num[ry];
}
bool same(ll x,ll y){
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll getsize(ll x){
return num[root(x)];
}
ll weight(ll x){
root(x);
return diff_weight[x];
}
ll diff(ll x,ll y){
return weight(y)-weight(x);
}
};
void FirstDFS(int child,int& post_count,vector<int>& post,ConnectNodeInfo& connect,vector<int>& memo){
memo[child] = 1;
for(auto& x:connect[child]){
if(!memo[x.first]){
FirstDFS(x.first,post_count,post,connect,memo);
}
}
post[child] = post_count++;
}
void SecondDFS(int start,int child,ConnectNodeInfo& connect,UnionFind& uf,vector<int>& memo){
uf.unite(start,child);
memo[child] = 1;
for(auto& x:connect[child]){
if(!memo[x.first]){
SecondDFS(start,x.first,connect,uf,memo);
}
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
int N=in(),M=in();
ConnectNodeInfo connect(N),inverse_connect(N);
REP(i,M){
int u=in(),v=in();
connect.AddDirectionalConnection(u,v,1);
inverse_connect.AddDirectionalConnection(v,u,1);
}
int post_count=0;
vector<int> post(N,-1);
vector<int> memo(N,0);
REP(i,N){
if(!memo[i]) FirstDFS(i,post_count,post,connect,memo);
}
vector<pair<int,int>> new_order(N);
REP(i,N){
new_order[i].first=i;
new_order[i].second=post[i];
}
sort(ALL(new_order),PAIRCOMP(second,>));
UnionFind uf(N);
fill(ALL(memo),0);
REP(i,N){
if(!memo[new_order[i].first]) SecondDFS(new_order[i].first,new_order[i].first,inverse_connect,uf,memo);
}
int Q=in();
LOOP(Q){
int u=in(),v=in();
out(uf.same(u,v)?1:0);
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define N 1001
using namespace std;
int n,m;
string s1,s2;
int mem[N][N],used[N][N];
int dfs(int I,int J){
if(I == n) return m-J;
if(J == m) return n-I;
if(used[I][J]++) return mem[I][J];
int res = 1e9;
res = min(res,1+dfs(I+1,J));//insert
res = min(res,1+dfs(I,J+1));//erase
res = min(res,(s1[I]!=s2[J])+dfs(I+1,J+1));//replace or same
return mem[I][J] = res;
}
int main(){
cin>>s1>>s2;
n = s1.size();
m = s2.size();
cout<<dfs(0,0)<<endl;;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
//#include "toollib.h"
#pragma warning (disable:4018)
#define INT_MAX 2147483647
using namespace std;
int judge_equivalent(char a, char b) {
if (a == b) return 0;
else return 1;
}
int main() {
string a, b;
cin >> a >> b;
vector<vector<int>> dp(a.length() + 1, vector<int>(b.length() + 1, 0));
for (int i = 0; i <= a.length(); i++) dp[i][0] = i;
for (int j = 1; j <= b.length(); j++) dp[0][j] = j;
for (int i = 1; i <= a.length(); i++) {
for (int j = 1; j <= b.length(); j++) {
int p = dp[i - 1][j - 1] + judge_equivalent(a[i - 1], b[j - 1]);
int q = dp[i - 1][j] + 1;
int r = dp[i][j - 1] + 1;
dp[i][j] = min({ p, q, r });
}
}
cout << dp[a.length()][b.length()] << endl;
return 0;
} | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%lld",&x);
int main(){
ll n, a, b;
sc(n) sc(a) sc(b)
ll X[n];
for (int i = 0; i < n; i++) sc(X[i])
ll x,ans = 0;
for (int i = 0; i < n - 1; i++){
x = (X[i + 1] - X[i]) * a;
ans += min(x, b);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int t = 753;
int d = 1000;
string res;
for (int i = 0; i + 2 < n; i++) {
string ss = string(1, s[i]) + string(1, s[i + 1]) + string(1, s[i + 2]);
if (abs(stoi(ss) - t) < d) {
res = ss;
d = abs(stoi(ss) - t);
}
}
cout << d << endl;
}
| 0 |
#include <stdio.h>
#include <iostream>
#include <string>
int main(void){
int *num,t=0,a[4];
a[0] = 0, a[1] = 1;
int ans;
num = new int[1000];
do{
std::cin >> num[t];
t++;
} while (num[t - 1] != 0);
t = 0;
while (num[t] != 0){
a[0] = 0; a[1] = 0, a[2] = 1;
for (int i = 0; i < num[t]; i++){
a[3] = a[2] + a[1]+a[0];
a[0] = a[1];
a[1] = a[2];
a[2] = a[3];
}
std::cout << (int)a[3]/365/10+1<<std::endl;
t++;
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int stair(int n){
if(n==1)
return 1;
else if(n==2)
return 2;
else if(n==3)
return 4;
else
return stair(n-1)+stair(n-2)+stair(n-3);
}
int main(){
int n;
while(scanf("%d",&n) && n!=0){
int year = stair(n)/3650;
if(stair(n)%3650!=0) year++;
cout<<year<<endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld=long double;
using vin=vector<int>;
using vvin=vector<vin>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vst=vector<string>;
using P = pair<ll,ll>;
const int inf=1e9+7;
const ll INF=9e18;
const long double PI = acos(-1.0);
template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}
template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(20);
ll m;
cin>>m;
vll d(m),c(m);
ll ans=0;
rep(i,0,m){
cin>>d[i]>>c[i];
ans+=c[i];
}
ll cnt=0;
rep(i,0,m){
cnt+=d[i]*c[i];
while(cnt>=10){
ll c=cnt/10;
ans+=c;
cnt%=10;
cnt+=c;
}
}
cout<<ans-1<<endl;
} | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N; cin >> N;
int x, y;
vector<int> y_x(8, -1);
for (int i = 0; i < N; i++)
{
cin >> y >> x;
y_x[y] = x;
}
vector<int> perm(8);
for (int i = 0; i < 8; i++) { perm[i] = i; }
bool ok = true;
do
{
ok = true;
for (int y = 0; y < 8; y++)
{
if (y_x[y] != -1 && perm[y] != y_x[y])
{
ok = false;
}
}
if (ok == true)
{
for (int i = 0; i < 8; i++)
{
for (int j = 0; j < 8; j++)
{
if (i != j)
{
if (i - perm[i] == j - perm[j] || i + perm[i] == j + perm[j])
{
ok = false;
}
}
}
}
}
if (ok == true)
{
for (int i = 0; i < 8; i++)
{
for (int j = 0; j < 8; j++)
{
if (perm[i] == j)
{
cout << 'Q';
}
else
{
cout << '.';
}
}
cout << endl;
}
}
} while (next_permutation(perm.begin(), perm.end()));
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("../data.txt");
int x1, y1, x2, y2, aux, sx, sy, tx, ty, roads, minix, miniy, nx, ny, ax, ay;
char dir;
int a[2005][2005];
string ans, sdir;
vector<pair<int, int>> d = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
int absVal(int x) {
if (x < 0) return -x;
return x;
}
bool isValid(int x, int y) {
if (x > 2004 || x < 0 || y > 2004 || y < 0 || a[x][y] == 1) return 0;
return 1;
}
int main() {
ans = "", sdir = "URDL";
cin >> x1 >> y1 >> x2 >> y2;
aux = x1;
x1 -= aux - 1;
x2 -= aux - 1;
aux = y1;
y1 -= aux - 1;
y2 -= aux - 1;
sx = x1;
sy = y1;
tx = x2;
ty = y2;
//cout << sx << " " << sy << " " << tx << " " << ty << "\n";
//cout << x1 << " " << y1 << " " << x2 << " " << y2;
a[sx][sy] = 1;
while (roads < 4) {
// cout << sx << " " << sy << " " << tx << " " << ty << "\n\n";
// for (int i = 0; i < 5; i++) {
// for (int j = 0; j < 5; j++) {
// cout << a[i][j] << " ";
// }
// cout << "\n";
// }
//if (sx == 0 && sy == 2) return 0;
//cout << "\n";
minix = miniy = 20000;
for (int i = 0; i < 4; i++) {
if (isValid(sx + d[i].first, sy + d[i].second)) {
ax = absVal(tx - sx - d[i].first);
ay = absVal(ty - sy - d[i].second);
if (minix > ax || miniy > ay) {
//cout << ax << " " << ay << "\n";
minix = ax;
miniy = ay;
nx = sx + d[i].first;
ny = sy + d[i].second;
dir = sdir[i];
}
}
}
ans += string(1, dir);
a[nx][ny] = 1;
sx = nx;
sy = ny;
if (sx == tx && sy == ty) {
roads++;
if (roads % 2) {
sx = x2;
sy = y2;
tx = x1;
ty = y1;
} else {
sx = x1;
sy = y1;
tx = x2;
ty = y2;
}
a[sx][sy] = 1;
a[tx][ty] = 0;
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int sx,sy,tx,ty;
cin >> sx >> sy >> tx >>ty;
for(int i = sy; i < ty; i++){
cout << "U";
}
for(int i = sx; i < tx; i++){
cout << "R";
}
for(int i = ty; i > sy; i--){
cout << "D";
}
for(int i = tx; i > sx; i--){
cout << "L";
}
cout << "L";
for(int i = sy; i <= ty; i++){
cout << "U";
}
for(int i = sx; i <= tx; i++){
cout << "R";
}
cout << "D" << "R";
for(int i = ty; i >= sy; i--){
cout << "D";
}
for(int i = tx; i >= sx; i--){
cout << "L";
}
cout << "U";
return 0;
} | 1 |
#include <array>
#include <cstdlib>
#include <iostream>
#include <string>
#include <queue>
#include <vector>
class SSF {
private:
void ScanLine(std::vector<std::string> *map, const char lx, const char rx, const char y, const char oy, std::array<std::queue<char>, 4> *buffer) {
unsigned char i = lx;
while (i <= rx) {
while (i < rx) {
if (map->at(y).at(i) != '0') {
break;
}
++i;
}
if (map->at(y).at(i) == '0') {
break;
}
buffer->at(0).push(i);
while (i <= rx) {
if (map->at(y).at(i) == '0') {
break;
}
++i;
}
buffer->at(1).push(i - 1);
buffer->at(2).push(y);
buffer->at(3).push(oy);
}
return;
}
public:
unsigned char SeedFill(std::vector<std::string> *map, const unsigned char x, const unsigned char y) {
std::array<std::queue<char>, 4> buffer;
unsigned char lx, rx, ly, oy;
if (map->at(y).at(x) == '0' || map->empty() == true) {
return 0;
}
buffer.at(0).push(x);
buffer.at(1).push(x);
buffer.at(2).push(y);
buffer.at(3).push(y);
while (buffer.front().empty() == false) {
char lxsav = buffer.at(0).front() - 1, rxsav = buffer.at(1).front() + 1;
lx = buffer.at(0).front();
buffer.at(0).pop();
rx = buffer.at(1).front();
buffer.at(1).pop();
ly = buffer.at(2).front();
buffer.at(2).pop();
oy = buffer.at(3).front();
buffer.at(3).pop();
if (map->at(ly).at(lx) == '0') {
continue;
}
while (rx < map->at(ly).size() - 1) {
if (map->at(ly).at(rx + 1) == '0') {
break;
}
++rx;
}
while (lx > 0) {
if (map->at(ly).at(lx - 1) == '0') {
break;
}
--lx;
}
for (unsigned char i = lx; i <= rx; ++i) {
map->at(ly).at(i) = '0';
}
if (ly - 1 >= 0) {
if (ly - 1 == oy) {
ScanLine(map, lx, lxsav, ly - 1, ly, &buffer);
ScanLine(map, rxsav, rx, ly - 1, ly, &buffer);
}
else {
ScanLine(map, lx, rx, ly - 1, ly, &buffer);
}
}
if (ly + 1 <= map->size() - 1) {
if (ly + 1 == oy) {
ScanLine(map, lx, lxsav, ly + 1, ly, &buffer);
ScanLine(map, rxsav, rx, ly + 1, ly, &buffer);
}
else {
ScanLine(map, lx, rx, ly + 1, ly, &buffer);
}
}
}
return 1;
}
};
int main() {
while (1) {
SSF ssf;
std::vector<std::string> map;
unsigned short count = 0;
do {
map.resize(count + 1);
std::getline(std::cin, map.at(count));
if (map.at(count).empty() == true) {
std::getline(std::cin, map.at(count));
if (map.at(count).empty() == true) {
return EXIT_SUCCESS;
}
}
map.at(count).resize(map.front().size(), '0');
map.at(count).shrink_to_fit();
} while (++count < map.front().size());
map.shrink_to_fit();
count = 0;
for (unsigned char j = 0; j < map.size(); ++j) {
for (unsigned char i = 0; i < map.at(j).size(); ++i) {
count += ssf.SeedFill(&map, i, j);
}
}
std::cout << count << std::endl;
}
return EXIT_SUCCESS;
} | #include<iostream>
#include<cstdio>
#include<queue>
#include<string>
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int ans;
string island[20];
int dfs(int x,int y){
island[y][x]='0';
REP(i,4){
int nx=x+dx[i];
int ny=y+dy[i];
if(nx>=0&&nx<12&&ny>=0&&ny<12&&island[ny][nx]=='1')dfs(nx,ny);
}
return 0;
}
int main(){
while(1){
REP(y,12){
if(!(cin>>island[y]))return 0;
}
ans=0;
REP(y,12){
REP(x,12){
if(island[y][x]=='1'){
dfs(x,y);
ans++;
}
}
}
cout<<ans<<endl;
}
} | 1 |
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<stack>
#include<list>
typedef long long ll;
using namespace std;
int a[100010] , n;
int partition(int p , int r){
int x = a[r];
int i,j;
i = p-1;
for(j = p ; j<r ; j++){
if(a[j] <= x){
i++;
swap(a[i],a[j]);
}
}
swap(a[r],a[i+1]);
return i+1;
}
int main(){
ios::sync_with_stdio(false);
cin>>n;
for(int i = 0 ; i<n ; i++){
cin>>a[i];
}
int q = partition(0,n-1);
for(int i = 0 ; i<n ; i++){
if(i)
printf(" ");
if(i==q){
printf("[%d]",a[i]);
}
else
printf("%d",a[i]);
}
printf("\n");
return 0;
} | #include <iostream>
using namespace std;
void swap(int A[], int i, int j)
{
int t = A[i];
A[i] = A[j];
A[j] = t;
}
int partition(int A[], int p, int r)
{
int x = A[r], i = p - 1;
for (int j = p; j <= r; j++) {
if (A[j] > x) continue;
swap(A, ++i, j);
}
return i;
}
int main()
{
int n;
cin >> n;
int A[n];
for (int i = 0; i < n; i++) cin >> A[i];
int p = partition(A, 0, n - 1);
for (int i = 0; i < n; i++) {
if (i == p) cout << "[" << A[i] << "]";
else cout << A[i];
if (i == (n - 1)) cout << endl;
else cout << " ";
}
return 0;
} | 1 |
#include <iostream>
using namespace std;
int main() {
int a, n;
cin >> n >> a;
if(n >= 10){
cout << a;
}else{
cout << a + 100 * (10 - n);
}
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 p[1000005];
int getSum(int* BIT,int idx){
int sum=0;
while(idx>0){
sum+=BIT[idx];
idx-=(idx&-idx);
}
return sum;
}
void update(int* BIT,int N,int idx,int val){
while(idx<=N){
BIT[idx]+=val;
idx+=(idx&-idx);
}
return;
}
int main() {
memset(p,0,sizeof(p));
int N,i;
scanf("%d",&N);
int Q;
scanf("%d",&Q);
int A[N+1];
for(i=1;i<=N;i++)
scanf("%d",&A[i]);
int *BIT=new int[N+1];
for(i=0;i<=N;i++)
BIT[i]=0;
vector<pair<int,pair<int,int> > > queries(Q);
for(i=0;i<Q;i++){
scanf("%d %d",&queries[i].second.first,&queries[i].first);
queries[i].second.second=i;
}
vector<int> ans(Q,0);
sort(queries.begin(),queries.end());
int j=0;
for(i=1;i<=N;i++){
if(p[A[i]]>0)
update(BIT,N,p[A[i]],-1);
p[A[i]]=i;
update(BIT,N,i,1);
while(j<Q&&queries[j].first==i){
ans[queries[j].second.second]=getSum(BIT,i)-getSum(BIT,queries[j].second.first-1);
++j;
}
if(j==Q)
break;
}
for(int i=0;i<Q;i++)
printf("%d\n",ans[i]);
// your code goes here
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) cin >> l[i] >> r[i];
sort (l.begin(), l.end());
sort (r.begin(), r.end());
int ans = r[0] - l[m-1] + 1;
ans = max (ans, 0);
cout << ans << endl;
} | 0 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define res(i,n) for(int i=n;;i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define REV(i,n) for(int i=n-1;i>0;i--)
#define req(i,n,m) for(int i=n;i<m;i++)
#define REQ(i,n,m,l) for(int i=n;i<m;i+=l)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
signed gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
signed lcm(int x, int y) {
return x / gcd(x, y) * y;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<int>A(N);
rep(i, N) {
cin >> A[i];
if (A[i] == K) {
cout << "POSSIBLE" << endl;
return 0;
}
}
if (N == 1) {
if (A[0] != K)cout << "IMPOSSIBLE" << endl;
else cout << "POSSIBLE" << endl;
return 0;
}
sort(A.begin(), A.end());
int B=gcd(A[0],A[1]);
REP(i, N - 1)B = gcd(B, A[i + 1]);
rep(i,N){
if (A[i] % B == K % B && K <= A[i]) {
cout << "POSSIBLE" << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const ll inf = 1001001001;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
int main() {
int n;
ll k, p;
cin >> n >> k >> p;
ll m = p;
rep(i, 1, n){
ll q;
cin >> q;
p = gcd(p, q);
m = max(m, q);
}
if(k%p == 0 && k <=m) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a;
cin>>a;
int res=a*(1+a+a*a);
cout<<res;
}
| #include <bits/stdc++.h>
using namespace std;
void h(){
cout << "Hello World" << endl;
exit(0);
}
int main() {
int x,a,b; cin>>x;
if(x==1) h();
cin>>a>>b;
cout << a+b << endl;
} | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
int main(){
int n; cin >> n;
string s; cin >> s;
vi txt(n);
rep(i,n){
if(s[i] == 'R') txt[i] = 0;
if(s[i] == 'G') txt[i] = 1;
if(s[i] == 'B') txt[i] = 2;
}
vi rgb(3);
rep(i,n) rgb[txt[i]]++;
ll ans = 1;
rep(i,3) ans *= rgb[i];
rep(j,n){
rep(i,j){
if(2*j-i < n && txt[i] != txt[j] && txt[j] != txt[2*j-i] && txt[2*j-i] != txt[i]) ans--;
}
}
cout << ans;
cout << "\n";
return 0;
}
| #include <iostream>
using namespace std;
int main()
{
bool cr = false, cg = false, cb = false;
int n;
long long ans = 0;
string s;
cin >> n >> s;
int r[n + 1], g[n + 1], b[n + 1];
r[0] = 0;
g[0] = 0;
b[0] = 0;
for(int i = 0; i < n; i++)
{
r[i + 1] = r[i];
g[i + 1] = g[i];
b[i + 1] = b[i];
if(s[i] == 'R')
{
r[i + 1]++;
}
else if(s[i] == 'G')
{
g[i + 1]++;
}
else
{
b[i + 1]++;
}
}
for(int i = 0; i < n - 2; i++)
{
if(s[i] == 'R')
{
cr = true;
}
else if(s[i] == 'G')
{
cg = true;
}
else
{
cb = true;
}
for(int j = i + 1; j < n - 1; j++)
{
if(s[i] != s[j])
{
if(s[j] == 'R')
{
cr = true;
}
else if(s[j] == 'G')
{
cg = true;
}
else
{
cb = true;
}
if(!cr)
{
ans += r[n] - r[j];
if(j + j - i < n && s[j + j - i] == 'R')
{
ans--;
}
}
else if(!cg)
{
ans += g[n] - g[j];
if(j + j - i < n && s[j + j - i] == 'G')
{
ans--;
}
}
else
{
ans += b[n] - b[j];
if(j + j - i < n && s[j + j -i] == 'B')
{
ans--;
}
}
if(s[j] == 'R')
{
cr = false;
}
else if(s[j] == 'G')
{
cg = false;
}
else
{
cb = false;
}
}
}
if(s[i] == 'R')
{
cr = false;
}
else if(s[i] == 'G')
{
cg = false;
}
else
{
cb = false;
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
ll n, m;
cin >> n >> m;
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
for (ll i = m / n; i >= 1; --i) {
if (m % i != 0) continue;
ll rest = m - i * n;
if (rest < 0) continue;
if (rest % i == 0) {
cout << i << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define append push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<ll> enum_divisors(ll N) {
vector<ll> res;
for (ll i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N/i != i) res.push_back(N/i);
}
}
sort(res.begin(), res.end());
return res;
}
int main() {
ll n,m;
cin >> n >> m;
const auto &res = enum_divisors(m);
ll ans = 0;
for (ll i : res) {
if (n * i <= m) ans = i;
}
cout << ans << endl;
} | 1 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の入力を受け取る
void read(){
}
template<typename First, typename... Rest>
void read(First& first, Rest&... rest){
cin >> first;
read(rest...);
}
//配列を区切って出力する
template<typename T>
void write_vec(vector<T>& v, char divider){
for(size_t i = 0; i < v.size(); i++){
cout << v[i] << divider;
}
}
};
int main(){
Stream io;
int A, B, C, D;
io.read(A, B, C, D);
string ans;
if(A + B < C + D){
ans = "Right";
}
else if(A + B == C + D){
ans = "Balanced";
}
else{
ans = "Left";
}
cout << ans;
return 0;
} | #include<iostream>
int main(){
int A, B, C, D;
std::cin >> A >> B >> C >> D;
if(A+B > C+D) std::cout<<"Left";
else if(A+B < C+D) std::cout<<"Right";
else std::cout<<"Balanced";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> 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);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
ll x; cin >> x;
if (x%11 == 0) {
cout << x/11*2 << "\n";
} else if (x%11 <= 6) {
cout << x/11*2+1 << "\n";
} else {
cout << x/11*2+2 << "\n";
}
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //GCC5.4.1で配列の範囲外アクセスをエラーにする
//cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
// https://github.com/atcoder/live_library
// cppdbg: test.exeのterminalに標準入力を打てる
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll; //long long
typedef pair<int,int> pii; //pair<int,int>
typedef pair<long long,long long> pllll; //pair<ll,ll>
typedef vector<int> vi; //vector<int>
typedef vector<vector<int>> vvi; //vector<vector<int>>
typedef vector<ll> vll; //vector<long long>
typedef vector<vector<ll>> vvll; //vector<vector<long long>>
typedef priority_queue<ll, vector<ll>, greater<ll> > gpq; //逆順priority_queue
typedef priority_queue<ll> pq;
//const int MOD=998244353;
const int MOD=1000000007; //10^9+7
const long double PI=3.1415926535897932;
int main(){
ll x;cin>>x;
ll ans=0;
ans+=x/11;
x-=ans*11;
ans*=2;
if(x>0){ans+=(x<=6)?1:2;}
cout<<ans<<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define FOR(itr, v) for (auto itr = (v).begin(); itr != (v).end(); ++itr)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
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> void PrintVector(const vector<T> &vec) {for (auto val : vec) cout << val << " "; cout << endl;}
const long long INF = 1LL << 60;
const long long minusINF = -(1LL << 40);
const int MOD = 1000000007;
const double PI = acos(-1); //3.14~
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
const int MAX = 210000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < MAX; i++){
fac[i] = fac[i-1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
finv[i] = finv[i-1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if(n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
}
int main()
{
int n, m; cin >> n >> m;
COMinit();
auto vec = prime_factorize(m);
ll ans = 1;
for (auto pa : vec)
{
int num = pa.second;
ll tmp = COM(num + n - 1, num);
ans = (ans * tmp) % MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define rep(i,x) for(int i = 0;i<x;i++)
#define REP(i,x) for(int i = 1;i<=x;i++)
#define mp make_pair
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const dou pi = 3.14159265358;
//const ll mod = 1000000007LL;
const ll mod = 998244353LL;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
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;}
template<class T> inline bool change(T a,T b){if(a > b){swap(a,b);return true;}return false;}
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
ll lcm(ll a,ll b){
return a / gcd(a,b) * b;
}
//素数判定O(sqrt(N))
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
const ll cmax = 1000000;
ll fac[cmax], finv[cmax], inv[cmax];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < cmax; 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 nCk(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
//nのm乗をMODで割ったあまりO(logm)
ll modpow(ll n,ll m,ll MOD){
if(m == 0)return 1;
if(m < 0)return -1;
ll res = 1;
while(m){
if(m & 1)res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
ll mypow(ll n,ll m){
if(m == 0)return 1;
if(m < 0)return -1;
ll res = 1;
while(m){
if(m & 1)res = (res * n);
m >>= 1;
n *= n;
}
return res;
}
//printf("%.10f\n", N);
/* vector<ll> vec = {1,2,5,6,8,9,10};
cout << binary_search(all(vec),5) << endl; -> true*/
/*
vector<ll> vec = {1,2,5,6,8,9,10};
auto n = upper_bound(all(vec),4);
cout << *n << endl; -> 5*/
// cout << fixed << setprecision(15);
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll N,M;
cin >> N >> M;
swap(N,M);
vector<ll> vec(N);
ll up = 0,wa = 0;
rep(i,N){
cin >> vec[i];
wa += vec[i];
chmax(up,vec[i]);
}
if(N == 1){
cout << vec[0] - 1 << "\n";
return 0;
}
wa -= up;
if(up + 1 <= wa){
cout << "0\n";
return 0;
}
else{
cout << up - wa - 1 << endl;
}
} | 0 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n | m) {
vector<vector<int>> graph(n);
for (int i = 0; i < m; ++i) {
int a, b; cin >> a >> b; --a; --b;
graph[a].push_back(b);
graph[b].push_back(a);
}
vector<int> dist(n, 3);
queue<int> Q;
Q.push(0);
dist[0] = 0;
while (!Q.empty()) {
int v = Q.front(); Q.pop();
for (int w : graph[v]) {
if (dist[w] == 3) {
dist[w] = dist[v] + 1;
Q.push({w});
}
}
}
int ans = 0;
for (int d : dist)
if (d < 3) ++ans;
cout << ans - 1 << endl;
}
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
while(1){
int n,i,a[10000],b[10000],c=0,m,j,d[1000000]={0},y=1,e=1,g=0,w=0;
cin >> n >> m;
if(n==0 && m==0){
break;
}
for(i=1;i<=m;i++){
cin >> a[i] >> b[i];
}
for(i=1;i<=m;i++){
if(a[i]==1){
d[y]=b[i];
y++;
}
else if(b[i]==1){
d[y]=a[i];
y++;
}
}
w=y;
for(i=1;i<w;i++){
for(j=1;j<=m;j++){
if(d[i]==a[j] && b[j]!=1){
d[y]=b[j];
y++;
}
if(d[i]==b[j] && a[j]!=1){
d[y]=a[j];
y++;
}
}
}
sort(d,d+y);
for(i=1;i<y;i++){
if(c!=d[i]){
g++;
}
c=d[i];
}
cout << g << endl;
}
} | 1 |
#include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
SORT(A);
int ans = 0;
int tmp = 0;
int count = 0;
for (ll& a : A) {
if (tmp != a) {
if (count % 2 == 1) { ++ans; }
count = 0;
}
++count;
tmp = a;
}
if (count % 2 == 1) { ++ans; }
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 1;
vector<int> g[N];
vector<int> vis(N);
void solve(){
int n;
cin >> n;
int a[n];
set<int> s;
for(int &i : a){
cin >> i;
if(s.find(i) == s.end()){
s.insert(i);
}else{
s.erase(i);
}
}
cout << (int)s.size() << '\n';
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tc = 1;
while(tc--){
solve();
}
} | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[4],b,c;
cin>>a[0]>>a[1]>>a[2]>>a[3]>>b>>c;
sort(a,a+4);
if(b>c)swap(b,c);
cout<<a[1]+a[2]+a[3]+c<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e9+7;
int main(){
ll a,c,b;
cin>>a>>b>>c;
cout<<c<< " "<<a<<" "<<b<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
int main(){
int N;
cin >> N;
multiset<int> s;
rep(i, N){
int A; cin >> A;
s.insert(-A);
}
int ans = 0;
multiset<int>::iterator it;
for(it = s.begin(); sz(s);){
int A = -(*it);
s.erase(it);
rep3(j, 29, 0){
if(A & (1<<j)){
int B = -((1<<(j+1))-A);
if(s.count(B)){
s.erase(s.find(B));
ans++;
}
break;
}
}
it = s.begin();
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long long i=0;i<x;i++)
#define repn(i,x) for(long long i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<pair<string,P> >vec;
void solve(long long n, long long m, vector<long long> x, vector<long long> y){
ll sumx = 0, sumy = 0;
rep(i, n) {
sumx = (sumx + (2*i-n+1) * x[i]) % mod;
}
rep(i, m) {
sumy = (sumy + (2*i-m+1) * y[i]) % mod;
}
cout << sumx * sumy % mod << endl;
}
int main(){
long long m;
long long n;
scanf("%lld",&n);
vector<long long> x(n-1+1);
scanf("%lld",&m);
vector<long long> y(m-1+1);
for(int i = 0 ; i <= n-1 ; i++){
scanf("%lld",&x[i]);
}
for(int i = 0 ; i <= m-1 ; i++){
scanf("%lld",&y[i]);
}
solve(n, m, x, y);
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front //deque
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair< int, int >
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) for(auto i:v) cout<<i<<" ";
#define tc int t; cin >> t; while(t--)
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i=0; i<n;i++)
s1+=s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b){
if (a == 0) return b;
return gcd(b % a, a);
}
void solve(){
int h,w;
cin>>h>>w;
char x[h][w];
rep(i,0,h){
rep(j,0,w){
cin>>x[i][j];
}
}
rep(i,0,h){
rep(j,0,w){
int flag=0;
if(x[i][j]=='#'){
if(i>0) flag+= x[i-1][j]==x[i][j]?1:0;
if(i<h-1) flag+= x[i+1][j]==x[i][j]?1:0;
if(j>0) flag+= x[i][j-1]==x[i][j]?1:0;
if(j<w-1) flag+= x[i][j+1]==x[i][j]?1:0;
if(flag==0){
cout<<"No\n";
return;
}
}
}
}
cout<<"Yes\n";
}
int main(){
optimizeIO();
// tc
{ solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//name[i][j]-> vvl name(i,vl(j))
//map<int,int>mp
//余りを切り上げる => (a + b - 1) / b
vi vx={-1,0,1,0};
vi vy={0,1,0,-1};
using pi = pair<int,int>;
signed main(){
int a,b; cin>>a>>b;
vvi v(a,vi(b));
queue<pi> q;
rep(i,0,a){
rep(j,0,b){
char c; cin>>c;
if(c=='#'){
v[i][j]=1;
q.push(make_pair(i,j));
}
else v[i][j]=0;
}
}
while(!q.empty()){
pi p=q.front(); q.pop();
int k,l; tie(k,l)=p;
bool ok=false;
rep(i,0,4){
k+=vx[i]; l+=vy[i];
if(k>=0 && k<a){
if(l>=0 && l<b){
if(v[k][l]==1)ok=true;
}
}
k-=vx[i]; l-=vy[i];
}
if(!ok){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (double i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef pair<double,double> P;
const int INF=1001001001;
// Morris-Pratt
template<typename T>
struct MP {
int n;
T t;
vector<int> a;
MP() {}
MP(const T& t): t(t) {
n = t.size();
a = vector<int>(n+1);//便宜上最初に-1を入れるため（1 indexにした方が良い)
a[0] = -1;
int j = -1;
for (int i = 0; i < n; ++i) {
while (j != -1 && t[j] != t[i]) j = a[j];//次の文字が一致するようなaを見つける
j++;
a[i+1] = j;
}
}
int operator[](int i) { return a[i];}//添字アクセスできるように
vector<int> findAll(const T& s) {
vector<int> res;
int j = 0;
for (int i = 0; i < s.size(); ++i) {
while (j != -1 && t[j] != s[i]) j = a[j];
j++;
if (j == n) {
res.push_back(i-j+1);
j = a[j];
}
}
return res;
}
};
int main(){
int n;
cin>>n;
vector<int> a(n);
vector<int> b(n);
vector<int> a1(n);
vector<int> b1(n);
rep(i,n)cin>>a[i];
rep(i,n)cin>>b[i];
rep(i,n-1){
a1[i+1]=a[i]^a[i+1];
}
rep(i,n-1){
b1[i+1]=b[i]^b[i+1];
}
a1[0]=a[0]^a[n-1];
b1[0]=b[0]^b[n-1];
vector<int> A=a1;
A.insert(A.end(), A.begin(), A.end());
// rep(i,A.size())cout<<A[i];
MP <vector<int>> mp(b1);
vector<int> res=mp.findAll(A);
rep(i,res.size()){
if (res[i]>=n)continue;
int now=res[i];
int x=b[0]^a[now];
cout<<res[i]<<" "<<x<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
struct Compress {
vector<T> xs;
Compress(const vector<T>& vs) : xs(vs) {
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
}
int compress(const T& x) {
return lower_bound(xs.begin(), xs.end(), x) - xs.begin();
}
T decompress(int i) {
return xs[i];
}
};
vector<int> suffix_array(vector<int>& s) {
int n = s.size();
Compress<int> comp(s);
vector<int> t(n);
for (int i = 0; i < n; i++) t[i] = comp.compress(s[i]);
vector<int> p(n), c(n), cnt(n);
for (int i = 0; i < n; i++) cnt[t[i]]++;
for (int i = 1; i < n; i++) cnt[i] += cnt[i-1];
for (int i = 0; i < n; i++) p[--cnt[t[i]]] = i;
int cl = 0;
for (int i = 1; i < n; i++) {
if (s[p[i]] != s[p[i-1]]) cl++;
c[p[i]] = cl;
}
vector<int> pn(n), cn(n);
for (int h = 0; (1 << h) < n; h++) {
for (int i = 0; i < n; i++) {
pn[i] = p[i] - (1 << h);
if (pn[i] < 0) pn[i] += n;
}
fill(cnt.begin(), cnt.end(), 0);
for (int i = 0; i < n; i++) cnt[c[pn[i]]]++;
for (int i = 1; i < n; i++) cnt[i] += cnt[i-1];
for (int i = n - 1; i >= 0; i--) {
cnt[c[pn[i]]]--;
p[cnt[c[pn[i]]]] = pn[i];
}
cn[p[0]] = 0;
cl = 0;
for (int i = 1; i < n; i++) {
pair<int, int> cur(c[p[i]], c[(p[i] + (1 << h)) % n]);
pair<int, int> prev(c[p[i-1]], c[(p[i-1] + (1 << h)) % n]);
if (cur != prev) cl++;
cn[p[i]] = cl;
}
swap(c, cn);
}
return p;
}
int bin_search(vector<int>& a, vector<int>& b, vector<int>& sa, bool lower) {
int n = a.size();
int lb = -1, ub = n;
while (ub - lb > 1) {
int m = (lb + ub) / 2;
bool flag = false;
for (int i = 0; i < n; i++) {
int j = (sa[m] + i) % n;
if (a[i] < b[j]) {
ub = m;
flag = true;
break;
}
if (a[i] > b[j]) {
lb = m;
flag = true;
break;
}
}
if (!flag) {
if (lower) ub = m;
else lb = m;
}
}
return ub;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N), b(N);
for (int i = 0; i < N; i++) cin >> a[i];
for (int i = 0; i < N; i++) cin >> b[i];
vector<int> c(N), d(N);
for (int i = 0; i < N; i++) {
c[i] = a[i] ^ a[(i+1) % N];
d[i] = b[i] ^ b[(i+1) % N];
}
auto sa = suffix_array(d);
int lb = bin_search(c, d, sa, true);
int ub = bin_search(c, d, sa, false);
vector<pair<int, int>> ans;
for (int i = lb; i < ub; i++) {
int k = (N - sa[i]) % N;
int x = a[k] ^ b[0];
ans.push_back({k, x});
}
sort(ans.begin(), ans.end());
for (auto& p : ans) cout << p.first << " " << p.second << "\n";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 1001001001;
int bills[3] = {10000, 5000, 1000};
int main() {
int N, Y;
cin >> N >> Y;
rep(i, N+1) {
rep(j, N+1) {
int k = N-(j+i);
if(k<0) continue;
if(bills[0]*i+bills[1]*j+bills[2]*k==Y) {
print(i, j, k);
return 0;
}
}
}
print(-1, -1, -1);
return 0;
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<time.h>
#include<vector>
using namespace std;
int main()
{
//ios::sync_with_stdio(false);
//cin.tie(0);
//cout.tie(0);
int n,x,t;
int ans;
scanf("%d%d%d",&n,&x,&t);
if(n%x==0)
ans = n/x*t;
else
ans = n/x*t + t;
printf("%d\n",ans);
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,p;
cin>>n;
vector<int>v;
for(int i=0;i<2*n;i++){
cin>>p;
v.push_back(p);
}
sort(v.begin(),v.end());
long res=0;
for(int i=0;i<2*n;i+=2){
res+=min(v[i],v[i+1]);
}
cout<<res;
return 0;
} | #include<iostream>
#include<unordered_map>
using namespace std;
int main(){
int n;
cin>>n;
unordered_map<string,int>bmp,rmp;
for(int i=0;i<n;i++)
{
string element;
cin>>element;
if(bmp.find(element)==bmp.end()){
bmp[element]=1;
}
else
{
bmp[element]++;
}
}
int m;
cin>>m;
for(int i=0;i<m;i++)
{
string element;
cin>>element;
if(rmp.find(element)==rmp.end()){
rmp[element]=1;
}
else
{
rmp[element]++;
}
}
int finalresult=0;
for(auto it=bmp.begin();it!=bmp.end();it++)
{
int result=0;
if(rmp.find(it->first)==rmp.end()){
result+=it->second;
}
else
{
int red=rmp.find(it->first)->second;
result+=max(0,it->second-red);
}
if(finalresult<result)
{
finalresult=result;
}
}
cout<<finalresult;
} | 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;
vector<long long int> divisor(long long int n) {
vector<long long int> res;
for (long long int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) res.push_back(n / i);
}
}
sort(begin(res), end(res));
return res;
}
long long int gcd(long long int l, long long int r) {
if (l > r)return gcd(r, l);
else {
if (r%l) {
return gcd(l, r%l);
}
else {
return l;
}
}
}
int main() {
int N; cin >> N;
vector<long long int>ns(N);
for (int i = 0; i < N; ++i) {
cin >> ns[i];
}
long long int a = gcd(ns[0], ns[1]);
if (N == 3) {
a = gcd(a, ns[2]);
}
auto v(divisor(a));
for (auto n : v) {
cout << n << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<ll,P> event;
const ll MAX = 510000;
const ll MOD = 1000000007;
int main() {
ll N;
cin>>N;
ll A[N];
rep(i,N){cin>>A[i];A[i]=-1ll*A[i];}
multiset<ll>ma;
ma.insert(2ll);
ma.insert(-100000000000ll);
ll ans=0ll;
rep(i,N){
auto t=ma.upper_bound(A[i]);
if(*t==2){ma.insert(A[i]);ans++;continue;}
else{
ma.erase(t);
ma.insert(A[i]);
}
}
cout<<ans;
}
| 0 |
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
int main(){
int N,M;
cin >> N >> M;
int r= 2;
int count=0;//素因数の数
map<long long ,int > insuu;
vector<int > prime;
COMinit();
//因数分解部
int pM=M;
while(M>1){
if(M%r!=0){//割り切れないなら次の因数を検索
while(true){
if(r==2){
r++;
}else{
r+=2;
}
if(M%r==0){
break;
}
if(r>sqrt(pM)){
prime.push_back(M);
insuu[M]++;
M=1;
break;
}
}
}else{
M=M/r;
if(insuu[r]<1){
prime.push_back(r);
}
count++;
insuu[r]++;
}
}
//出力計算部
long long ans=1;
for(auto v :prime){
ans*=fac[N+insuu[v]-1]*((finv[insuu[v]])*finv[N-1]%MOD)%MOD;
ans=ans%MOD;
}
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <cstdlib>
#include <utility>
#include <cmath>
#include <queue>
#include <stack>
#include <cstring>
using namespace std;
#define ll long long
#ifndef ONLINE_JUDGE
#define debug(format, ...) fprintf(stderr, \
"%s:%d: " format "\n", __func__, __LINE__,##__VA_ARGS__)
#else
#define debug(format, ...)
#define NDEBUG
#endif
int n, m;
bool vis[1005][1005];
char s[1005];
int dist[1005][1005];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main()
{
scanf("%d%d", &n, &m);
queue<pair<int, int> > bfs;
for (int i = 1; i <= n; i++) {
scanf("%s", s + 1);
for (int j = 1; j <= m; j++) {
if (s[j] == '#') {
bfs.push(make_pair(i, j));
vis[i][j] = true;
}
}
}
while (!bfs.empty()) {
pair<int, int> cur = bfs.front();
bfs.pop();
for (int i = 0; i < 4; i++) {
pair<int, int> newpos = make_pair(cur.first
+ dx[i], cur.second + dy[i]);
if (newpos.first < 1 || newpos.first > n ||
newpos.second < 1 || newpos.second > m) continue;
if (vis[newpos.first][newpos.second]) continue;
bfs.push(newpos);
dist[newpos.first][newpos.second] =
dist[cur.first][cur.second] + 1;
vis[newpos.first][newpos.second] = true;
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
ans = max(ans, dist[i][j]);
}
}
printf("%d", ans);
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
#define ll long long
char a[N];
int main(){
int n,q,k;
scanf("%d\n",&n);
scanf("%s",a);
scanf("%d",&q);
while(q--){
scanf("%d",&k);
ll nowd=0,nowm=0,cnt=0;
ll sum=0;
for(int i=0;i<n;i++){
if(i-k>=0&&a[i-k]=='D'){
nowd--;
cnt-=nowm;
}
else if(i-k>=0&&a[i-k]=='M'){
nowm--;
}
if(a[i]=='D')nowd++;
if(a[i]=='M'){
nowm++;
cnt+=nowd;
}
if(a[i]=='C')sum+=cnt;
}
printf("%lld\n",sum);
}
return 0;
}
| #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<cctype>
#include<string.h>
#include <stdlib.h>
#define PI 3.1415926
void swap(int* x, int* y) {
int a = *x;
int b = *y;
*x = b;
*y = a;
}
int factorial(int n);
int sum(int n, int*);
int ave(int n, int*);
int min(int n, int*), min(int n, int m);
int max(int n, int*), max(int n, int m);
int main() {
int N, X[200] = { 0 }, a, b, c, d, Y[200];
scanf("%d", &N);
for (int i = 1; i <= N*(N - 1) / 2; i++) {
scanf("%d %d %d %d", &a, &b, &c, &d);
if (c == d) {
X[a]++;
X[b]++;
}
else if (c < d) {
X[b] += 3;
}
else {
X[a] += 3;
}
}
int p = 1;
for (int i = 1; i <= N; i++) {
p = 1;
//printf("%d\n", X[i]);
for (int j = 1; j <= N; j++) {
if (X[i] < X[j]) {
p++;
}
}
printf("%d\n", p);
}
return 0;
}
int factorial(int n) {
if (n > 0) {
return n * factorial(n - 1);
}
else {
return 1;
}
}
int sum(int n, int *all) {
int total = 0;
for (int i = 0; i < n; ++i) {
total += all[i];
}
return total;
}
int ave(int n, int *all) {
int total = 0;
for (int i = 0; i<n; ++i) {
total += all[i];
}
return total / n;
}
int min(int n, int *all) {
int min = all[0];
for (int i = 1; i < n; ++i) {
if (all[0] > all[i]) {
min = all[i];
}
}
return min;
}
int max(int n, int *all) {
int max = all[0];
for (int i = 1; i<n; ++i) {
if (all[0]<all[i]) {
max = all[i];
}
}
return max;
}
int max(int n, int m) {
if (n >= m) {
return n;
}
else {
return m;
}
}
int min(int n, int m) {
if (n >= m) {
return m;
}
else {
return n;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,Q;
cin>>N>>Q;
int I=1100100100;
vector<pair<int,int>> p;
for(int i=0;i<N;i++){
int a,b,c;
cin>>a>>b>>c;
p.push_back(make_pair(a-c,c));
p.push_back(make_pair(b-c,-1*c));
}
for(int i=0;i<Q;i++){
int a;
cin>>a;
p.push_back(make_pair(a,I));
}
sort(p.begin(),p.end());
priority_queue<int, vector<int>, greater<int>> pq;
priority_queue<int, vector<int>, greater<int>> end;
for(int i=0;i<2*N+Q;i++){
int a,b;
tie(a,b)=p[i];
if(b<0){
end.push(b*-1);
}
else if(b<I){
pq.push(b);
}
else{
while(!pq.empty()&&!end.empty()){
if(pq.top()!=end.top()){
break;
}
pq.pop();
end.pop();
}
if(pq.empty()){
cout<<"-1"<<endl;
}
else{
cout<<pq.top()<<endl;
}
}
}
} | #include<bits/stdc++.h>
using namespace std;
int psum[505][505];
int main(){
int n,m,q;
cin>>n>>m>>q;
while(m--){
int l,r;
cin>>l>>r;
psum[r][l]++;
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++) psum[i][j]+=psum[i][j-1];
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++) psum[i][j]+=psum[i-1][j];
}
while(q--){
int l,r;
cin>>l>>r;
cout<<psum[r][n]-psum[r][l-1]<<'\n';
}
} | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
//typedef modint998244353 mint;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
const ll MAX = 1e9 + 5;
int main() {
int m;
cin >> m;
vector<int> d(m);
vector<ll> c(m);
for (int i = 0; i < m; i++) {
cin >> d[i] >> c[i];
}
vector<vector<pll>> dl(10);
for (int i = 0; i < 10; i++) {
dl[i].emplace_back(make_pair(i, 0));
}
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 60; j++) {
//cout << j << endl;
ll num = dl[i][j].first * 2;
ll cnt = dl[i][j].second * 2 + 1;
if (num >= 10) {
cnt++;
num = num % 10 + 1;
}
dl[i].emplace_back(make_pair(num, cnt));
}
//cout << i << endl;
}
/*
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 60; j++) {
cout << dl[i][j].first << " ";// << dl[i][j].second << endl;
}
cout << endl;
}
*/
ll cnt = 0;
vector<int> a(m);
for (int i = 0; i < m; i++) {
int num = 0;
cnt--;
for (int b = 0; b < 60; b++) {
if (((c[i] >> b) & 1) == 1) {
num += dl[d[i]][b].first;
cnt += dl[d[i]][b].second;
cnt++;
//cout << i << " " << dl[d[i]][b].second << " " << dl[d[i]][b].first << endl;
}
if (num >= 10) {
num -= 9;
cnt++;
}
}
a[i] = num;
}
//cout << cnt << endl;
int num = a[0];
for (int i = 1; i < m; i++) {
//cout << a[i] << endl;
num += a[i];
cnt++;
if (num >= 10) {
num -= 9;
cnt++;
}
}
cout << cnt << endl;
} | #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> pp;
const int INF = 1e9;
const int MOD = 1000000007;
int main() {
int m;
cin >> m;
ll now = 0;
ll nine_count = 0;
ll d = 0;
rep(i,m){
ll a,b;
cin >> a >> b;
d += b;
nine_count += (a * b)/9;
now += (a * b) % 9;
}
nine_count += now/9;
if(now%9 == 0) cout << nine_count + d - 2 << endl;
else cout << nine_count + d - 1 << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mo = 1000000007;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++)
{
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll mypow(ll a, ll b){
ll res = 1;
a %= mo;
while (b)
{
if (b & 1)
res = res * a % mo;
a = a * a % mo;
b >>= 1;
}
return res;
}
int main()
{
ll n ;
cin >> n ;
ll a , b , c , d ;
cin >> a >> b >> c >> d ;
COMinit();
vector<vector<ll>> dp(b-a+2, vector<ll>(n+1,0) );
dp[0][0]=1;
rep(i,b-a+1)rep(j,n+1){
ll te=dp[i][j];
for (ll k = 0; k <= d && j+k*(i+a)<=n ; k++)
{
if(te==0)break;
if(k){
te*=COM(n-j-(k-1)*(i+a),i+a);
te%=mo;
te*=mypow(k,mo-2);
te%=mo;
}
te%=mo;
if(k==0 || k>=c)dp[i+1][j+k*(i+a)]=(dp[i+1][j+k*(i+a)]+te)%mo;
}
}
cout << dp[b-a+1][n]%mo << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#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 yes cout<<"Yes"<<endl
#define YES cout<<"YES"<<endl
#define no cout<<"No"<<endl
#define NO cout<<"NO"<<endl
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
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};
ll mpow(ll m, ll p){
ll power = m;
ll res = 1;
while(p>0){
if(p&1)
res = res*power%MOD;
power = (power*power)%MOD;
p /= 2;
}
return res;
}
ll mod_inv(ll m){
return mpow(m, MOD-2);
}
struct COM{
vll fact, fact_inv;
COM(ll n): fact(n+1,1), fact_inv(n+1,1){
for(ll i=1; i<=n; i++)
fact[i] = fact[i-1]*i%MOD;
fact_inv[n] = mod_inv(fact[n]);
for(ll i=n; i>=1; i--)
fact_inv[i-1] = fact_inv[i]*i%MOD;
}
ll calc(ll n, ll k){
if(k<0 || n<k)
return 0;
ll res = fact[n]*fact_inv[n-k]%MOD*fact_inv[k]%MOD;
return res;
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m,k;
cin>>n>>m>>k;
COM com(n*m);
ll ans2=0;
for(ll d=1; d<=m-1; d++){
ll cost=d*n*n*(m-d)%MOD;
ans2=(ans2+com.calc(n*m-2,k-2)*cost%MOD)%MOD;
}
for(ll d=1; d<=n-1; d++){
ll cost=d*m*m*(n-d)%MOD;
ans2=(ans2+com.calc(n*m-2,k-2)*cost%MOD)%MOD;
}
cout<<ans2<<endl;
}
| 0 |
#include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (ll i = 0; i < n; i++)
#define forr(i,a,b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef vector<ll> vl;
typedef vector<ii> vii;
const ll MX = 300005;
const ll inf = 2e18;
#define ptr nodo*
#define tam 1234
char resp[tam][tam];
int main ()
{
vector<string> v4;
v4.pb("bbio");
v4.pb("ppio");
v4.pb("omqq");
v4.pb("omcc");
vector<string> v5;
v5.pb("..cnk");
v5.pb("..cnk");
v5.pb("bbuuq");
v5.pb("mmi.q");
v5.pb("qqibb");
vector<string> v6;
v6.pb("..cctr");
v6.pb("...ktr");
v6.pb("..ck.h");
v6.pb("bbc..h");
v6.pb("mmf.gg");
v6.pb("qqfee.");
vector<string> v7;
v7.pb("....gca");
v7.pb("....gca");
v7.pb("....vks");
v7.pb("....vks");
v7.pb("bbaa.jj");
v7.pb("mmzzf..");
v7.pb("qqoof..");
vector<vector<string> > vvs;
vvs.pb(v4);
vvs.pb(v5);
vvs.pb(v6);
vvs.pb(v7);
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
cin>>n;
int N=n;
if (n==2)
cout<<"-1";
else
{
if (n==3)
cout<<"a..\na..\n.bb\n";
else
{
forr(i,0,n)
forr(j,0,n)
resp[i][j]='.';
int x,y;
x=y=0;
while(n>7)
{
forr(i,0,4)
forr(j,0,4)
resp[y+i][x+j]=v4[i][j];
x+=4,y+=4;
n-=4;
}
n-=4;
int m=vvs[n].size();
forr(i,0,m)
forr(j,0,m)
resp[y+i][x+j]=vvs[n][i][j];
forr(i,0,N)
{
forr(j,0,N)
cout<<resp[i][j];
cout<<endl;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) ((x).size()))
typedef long long ll;
typedef long double ld;
int n;
char g3[3][3] = {
{0, 1, 1},
{1, 0, 0},
{1, 0, 0}
}, g4[4][4] = {
{1, 2, 3, 3},
{1, 2, 1, 1},
{3, 3, 2, 3},
{1, 1, 2, 3}
}, g5[5][5] = {
{2, 3, 3, 2, 2},
{2, 0, 1, 1, 3},
{3, 1, 0, 0, 3},
{3, 1, 0, 0, 2},
{2, 2, 3, 3, 2}
}, g7[7][7] = {
{1, 2, 2, 0, 0, 2, 2},
{1, 0, 0, 2, 2, 0, 1},
{0, 1, 0, 3, 3, 0, 1},
{0, 1, 3, 0, 0, 1, 0},
{1, 0, 3, 0, 0, 1, 0},
{1, 0, 2, 2, 0, 0, 1},
{2, 2, 0, 0, 2, 2, 1}
}, r[1100][1100];
char itc(int v) {
return v == 0 ? '.' : ('a' + v);
}
void place3(int i, int j) {
for (int k = 0; k < 3; k++)
for (int l = 0; l < 3; l++)
r[i + k][j + l] = itc(g3[k][l]);
}
void place4(int i, int j) {
for (int k = 0; k < 4; k++)
for (int l = 0; l < 4; l++)
r[i + k][j + l] = itc(g4[k][l]);
}
void place5(int i, int j) {
for (int k = 0; k < 5; k++)
for (int l = 0; l < 5; l++)
r[i + k][j + l] = itc(g5[k][l]);
}
void place7(int i, int j) {
for (int k = 0; k < 7; k++)
for (int l = 0; l < 7; l++)
r[i + k][j + l] = itc(g7[k][l]);
}
void place9(int i, int j) {
for (int k = 0; k < 9; k += 3)
for (int l = 0; l < 9; l += 3)
place3(i + k, j + l);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
cin >> n;
if (n == 2) {
cout << -1 << "\n";
return 0;
}
if (n % 3 == 0) {
for (int i = 0; i < n; i += 3)
place3(i, i);
} else {
for (int i = n - 9; i >= 4; i -= 9)
place9(i, i);
if (n % 9 == 1)
place5(0, 0), place5(5, 5);
else if (n % 9 == 2)
place4(0, 0), place7(4, 4);
else if (n % 9 == 4)
place4(0, 0);
else if (n % 9 == 5)
place5(0, 0);
else if (n % 9 == 7)
place7(0, 0);
else if (n % 9 == 8)
place4(0, 0), place4(4, 4);
}
for (int i = 0; i < n; i++, cout << "\n")
for (int j = 0; j < n; j++)
cout << (r[i][j] == 0 ? '.' : r[i][j]);
}
| 1 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
for(int i=n-1;i>0;i--) cout << a[i] << " ";
cout << a[0] << endl;
} | #include<iostream>
using namespace std;
int a[10];
int b[10];
int score(int x[10]){
int a=0,b=0,c=0,tmp;
for(int i=0;i<10;i++){
if(a < x[i]){
tmp = a;
a = x[i];
x[i] = tmp;
}
if(b < x[i]){
tmp = b;
b = x[i];
x[i] = tmp;
}
if(c < x[i]){
tmp = c;
c = x[i];
x[i] = tmp;
}
}
return a + b + c;
}
int main(){
for(int i=0;i<10;i++)cin >> a[i];
for(int i=0;i<10;i++)cin >> b[i];
int sa = score(a);
int sb = score(b);
cout << sa << " " << sb << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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 int INF=1e9;
const int mod = 1000000007;
int main(){
int N,L;
cin>>N>>L;
int MIN=INF,sum=0;
for(int i=1;i<=N;i++){
sum+=L+i-1;
}
int ans=0;
for(int i=1;i<=N;i++){
int x=sum-(L+i-1);
if(abs(sum-x)<MIN){MIN=abs(sum-x);ans=x;}
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
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;}
#define rep(i,n) for(int i=0;i<n;i++)
#define all(a) (a).begin(),(a).end()
#define P pair<int, int>
#define ll long long
const int MOD = 1000000007;
//bitset<64>(x).count()
//fixed << setprecision(15) <<
int main(){
int n, l;
cin >> n >> l;
ll ans = (n*(n+2*l-1))/2;
if(l>=0)
ans -= l;
else
if(n+l-1<0)
ans -=n+l-1;
cout << ans << endl;
}
| 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#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 fore(i,a) for(auto &i:a)
#define INF INT_MAX/2;
typedef long long ll;
using namespace std;
using vi = vector<int>;
using vll = vector<ll>;
ll mod = 1e9 + 7;
//ll llmax = 10000000000000000000ll;
using namespace std;
using Graph = vector<vector<int>>;
int cnt_digit(ll N)
{
int digit = 0;
while (N > 0)
{
N /= 10;
digit++;
}
return digit;
}
// 最大公約数計算
ll gcd(ll a, ll b)
{
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
// 最小公倍数の計算
ll lcm(ll a, ll b)
{
ll g = gcd(a, b);
return a / g * b;
}
struct union_find
{
vector<int> par, r;
union_find(int n)
{
par.resize(n);
r.resize(n);
init(n);
}
void init(int n)
{
for (int i = 0; i < n; i++) par[i] = i;
for (int i = 0; i < n; i++) r[i] = 0;
}
int find(int x)
{
if (par[x] == x)return x;
else return find(par[x]);
}
void unite(int x, int y)
{
x = find(x);
y = find(y);
if (r[x] < r[y])
{
par[x] = y;
}
else
{
par[y] = x;
if (r[x] == r[y])
{
r[x]++;
}
}
}
};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> data(n + 2);
vector<int> ans(n);
data[0] = data[n + 1] = 0;
rep(i, 1, n + 1) {
cin >> data[i];
}
int orians = 0;
rep(i, 0, n + 1) {
orians += abs(data[i + 1] - data[i]);
}
rep(i, 0, n) {
ans[i] = orians - abs(data[i + 1] - data[i]) - abs(data[i + 2] - data[i + 1]) + abs(data[i + 2] - data[i]);
}
rep(i, 0, n) {
cout << ans[i] << endl;
}
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define INF 1000000001
#define inf1 1000000000000000001
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 1000005
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define vecl vector<ll>
#define umap unordered_map<ll,ll>
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define endl "\n"
using namespace std;
ll gcd(ll a, ll b) {
if(b==0)
return a;
return gcd(b, a%b);
}
void solve(){
int n,M;
cin>>n>>M;
int a,b;
if(M%2==0){
a=M/2;
b=M/2;
}else{
a=M/2;
b=M-a;
}
for(int i=1;i<=a;++i){
cout<<i<<" "<<2*a+2-i<<endl;
}
for(int i=1;i<=b;++i){
cout<<i+2*a+1<<" "<<M*2+2-i<<endl;
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed<<setprecision(20);
int t = 1;
// cin >> t;
while (t--)
{
solve();
}
} | 0 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <math.h>
//#define PI 3.141592653589
using namespace std;
int main()
{
int n;
long seisuu[3];
cin >> n;
for (int i=0; i<n; i++) cin >> seisuu[i];
sort(seisuu, seisuu+n);
for (int i=1; i<=seisuu[0]; i++)
{
if (n == 2)
{
if (seisuu[0]%i==0 && seisuu[1]%i==0)
{
cout << i << endl;
}
} else {
if (seisuu[0]%i==0 && seisuu[1]%i==0 && seisuu[2]%i==0)
{
cout << i << endl;
}
}
}
//for (int i=0; i<n; i++) cout << seisuu[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const string YES = "POSSIBLE";
const string NO = "IMPOSSIBLE";
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
void solve(long long N, long long K, std::vector<long long> A)
{
long long gc = 0, ma = 0;
for (int i = 0; i < N; i++)
gc = gcd(A[i], gc), ma = max(ma, A[i]);
if (K % gc)
{
cout << NO << endl;
return;
}
if (K > ma)
{
cout << NO << endl;
return;
}
cout << YES << endl;
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
int main()
{
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
std::vector<long long> A(N);
for (int i = 0; i < N; i++)
{
scanf("%lld", &A[i]);
}
solve(N, K, std::move(A));
return 0;
}
| 0 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<P,P> PP;
const ll MOD=998244353;
const ll MAX_N=500010;
const ll INF=100100100100100;
int main(){
int n,k;
cin>>n>>k;
vector<ll> v(n);
vector<ll> sum(n+1);
ll s=0;
for(int i=0;i<n;i++){
cin>>v[i];
sum[i+1]=sum[i]+v[i];
s+=v[i];
}
ll ans=-INF;
for(int l=0;l<=n;l++){
for(int r=0;r<=n;r++){
if(l>r) continue;
ll buf=0;
int life=k;
vector<ll> q(0);
for(int i=0;i<l;i++){
buf+=v[i];
q.push_back(v[i]);
life--;
}
for(int i=r;i<n;i++){
buf+=v[i];
q.push_back(v[i]);
life--;
}
if(life<0) continue;
sort(q.begin(), q.end());
int m=q.size();
for(int i=0;i<min(life,m);i++){
if(q[i]>=0) break;
buf-=q[i];
}
ans=max(ans,buf);
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
long long mod=(1e+9)+7;
long long n,m;
cin>>n>>m;
static long long sum_x,sum_y;
vector<long long> x(n+10),y(m+10);
for(ll i=1;i<=n;i++) cin>>x[i];
for(ll i=1;i<=m;i++) cin>>y[i];
for(ll xx=1;xx<=n;xx++){
sum_x+=(2*xx-n-1)*x[xx];
sum_x%=mod;
}
for(ll yy=1;yy<=m;yy++){
sum_y+=(2*yy-m-1)*y[yy];
sum_y%=mod;
}
cout<<(sum_x*sum_y)%mod<<endl;
}
| 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++) //0から
#define REP(i,N) for(int j=i;j<N;j++) //iから
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1){
if(a[md] <= key){
right = md;
}else{
left = md;
}
md = (right + left) / 2;
}
if(left == -1) return -1; //無い場合
return right;
}
vector<ll> prime;
void Prime(ll n){ //線形篩,素数列挙
vector<ll> p(n,0);
p[0]=1;
p[1]=1;
for(ll i=2;i<n;i++){
if(p[i]==0){
prime.push_back(i);
p[i]=i;
}
ll k=prime.size();
for(ll j=0;j<k && i*prime[j]<n && prime[j]<=p[i];j++){
p[i*prime[j]]=prime[j];
}
}
}
#define MOD ((ll)1e+9 + 7)
//cout<<fixed<<setprecision(10);
int main(){
int n,m;
cin>>n>>m;
vector<int> L(m),R(m+1);
rep(i,m){
cin>>L[i]>>R[i];
L[i]--;
}
vector<int> cnt(n+1,0);
rep(i,m){
cnt[L[i]]++;
cnt[R[i]]--;
}
rep(i,n){
cnt[i+1]+=cnt[i];
}
int ans=0;
rep(i,n){
if(cnt[i]==m){
ans++;
}
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
// debug templates
#define debug(x) cerr<< #x <<" : "<< x << endl;
#define debuga(A,N) cerr<< #A <<" : [";for(int i = 0; i<N;i++) cerr<<A[i]<<" "; cerr<<"]\n";
#define debuga2(A,N,M) cerr<< #A << " : \n"; for(int i=0;i<N;i++){cerr<<"[";for(int j=0;j<M;++j) cerr<<A[i][j]<<" ";cerr<<"]\n";}
#define debugp(p) cerr<< #p <<" : "<<"("<<(p).first<<","<<(p).second<<")\n";
#define debugv(v) cerr<< #v <<" : "<<"[";for(int i = 0; i< (v).size(); i++) cerr<<v[i]<<" "; cerr<<"]\n";
#define debugv2(v) cerr<< #v << " : \n"; for(int i=0;i<v.size();i++){cerr<<"[";for(int j=0;j<(v[0].size());++j) cerr<<v[i][j]<<" ";cerr<<"]\n";}
#define debugs(m) cerr<< #m <<" : [ "; for(auto itr = m.begin(); itr!=m.end();itr++) cerr<<*itr<<" "; cerr<<"]\n";
#define debugm(m) cerr<< #m <<" : [ "; for(auto itr = m.begin();itr!=m.end(); itr++) cerr<<"("<<itr->first<<","<<itr->second<<") ";cerr<<"]\n";
void solve(){
int n,m; cin >> n >> m;
int big_l = 0, small_r = inf;
FOR(m){
int l,r; cin >> l >> r;
big_l = max(l,big_l);
small_r = min(small_r, r);
}
cout << max(small_r - big_l + 1,0);
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
typedef vector<int> ivec;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
const int MOD=1000000007;
int INF=100100100100100;
int sa[100010];
signed main(){
int n;cin>>n;
int ans=0;
rep(i,n){
int a,b;cin>>a>>b;
sa[i]=a+b;
ans-=b;
}
sort(sa,sa+n,greater<int>());
for(int i=0;i<n;i+=2){
ans+=sa[i];
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<long> a(N);
vector<long> b(N);
for(int i=0;i<N;i++) cin>>a[i]>>b[i];
vector<vector<long>> c(N,vector<long>(2));
for(int i=0;i<N;i++) c[i][0]=a[i]+b[i],c[i][1]=i;
sort(c.begin(),c.end());
reverse(c.begin(),c.end());
long A=0,B=0;
for(int i=0;i<N;i++){
if(i%2) B+=b[c[i][1]];
else A+=a[c[i][1]];
}
cout<<A-B<<endl;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;
int cnt = 0;
int a[1000500];
void insertsort(int a[], int n, int g){
for (int i = g; i < n; i++){
int v = a[i];
int j = i - g;
while (j >= 0 && a[j] > v){
a[j + g] = a[j];
j -= g;
cnt++;
}
a[j + g] = v;
}
}
int main(void)
{
int n;
cin >> n;
for (int i = 0; i < n; i++){
scanf("%d", &a[i]);
}
// 3g + 1
vector <int> kotori;
for (int g = 1; g <= n; g = 3 * g + 1){
kotori.push_back(g);
}
for (int i = kotori.size() - 1; i >= 0; i--){
insertsort(a, n, kotori[i]);
}
reverse(kotori.begin(), kotori.end());
cout << kotori.size() << endl;
for (int i = 0; i < kotori.size(); i++){
cout << kotori[i] << (i + 1 == kotori.size() ? '\n' : ' ');
}
cout << cnt << endl;
for (int i = 0; i < n; i++){
cout << a[i] << endl;
}
return 0;
} | #include<stdio.h>
#include<algorithm>
using namespace std;
int a[200000];
int main()
{
int i,n,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
flag=1;
break;
}
}
if(flag==1)
{
printf("NO\n");
}
else
{
printf("YES\n");
}
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
const int MAX = 410000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
//invの要素にはiの逆元が格納されている
//前処理
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;//i!(mod MOD)を計算
inv[i] = MOD - inv[MOD%i]* (MOD / i) % MOD;//iの逆元を計算
finv[i] = finv[i - 1] * inv[i] % MOD;//i!(mod MOD)の逆元を計算
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;//nCk = n!/(k!*(n-k)!)を計算
}
//例のアレ
long long nPm(int n, int m){
if(n < m) return 0;
if(n < 0 || m < 0) return 0;
return fac[n] * finv[n - m] % MOD;
}
map<long long, long long> divide(long long n){//素因数分解
map<long long, long long> res;
for(long long i = 2; i * i <= n; i++){
while(n % i == 0){
res[i]++;
n /= i;
}
}
if(n != 1) res[n] = 1;
return res;
}
int main(){
int N;
long long M;
cin >> N >> M;
COMinit();
map<long long, long long> m = divide(M);
long long ans = 1;
for(auto v: m){
ans = ans * COM(v.second + N - 1, v.second) % MOD;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int n,lst[1000100][26],gg[1000100];
char s[1000100],t[1000100];
struct treaps
{
int son[1201000][2],size[1201000],num[1201000],tag[1201000],rd[1200100],tt;
void update(int s){size[s]=size[son[s][0]]+size[son[s][1]]+1;}
int build(int n)
{
if (n==0) return 0;
int s=++tt;size[s]=1;
n--;
son[s][0]=build(n/2);son[s][1]=build(n-n/2);
update(s);
return s;
}
inline void pushdown(int s)
{
if (son[s][0]) {tag[son[s][0]]+=tag[s];num[son[s][0]]+=tag[s];}
if (son[s][1]) {tag[son[s][1]]+=tag[s];num[son[s][1]]+=tag[s];}
tag[s]=0;
}
void addtag(int s) {tag[s]++;num[s]++;}
int merge(int s,int t)
{
if (!s) return t;
if (!t) return s;
pushdown(s);pushdown(t);
if ((rand()*32768+rand())%(size[s]+size[t])<size[s]) {son[s][1]=merge(son[s][1],t);update(s);return s;}
else {son[t][0]=merge(s,son[t][0]);update(t);return t;}
}
pair<int,int> split(int s,int k)
{
if (!s) return pair<int,int>(0,0);
pushdown(s);
if (size[son[s][0]]>=k)
{
pair<int,int> ls=split(son[s][0],k);
son[s][0]=ls.second;update(s);
return pair<int,int>(ls.first,s);
}
pair<int,int> ls=split(son[s][1],k-size[son[s][0]]-1);
son[s][1]=ls.first;update(s);
return pair<int,int>(s,ls.second);
}
int findkth(int s,int k)
{
while (1)
{
pushdown(s);
if (size[son[s][0]]>=k) s=son[s][0];
else if (size[son[s][0]]+1==k) return num[s];
else {k-=(size[son[s][0]]+1);s=son[s][1];}
}
}
}treap;
int main()
{
//freopen("in.txt","r",stdin);
scanf("%d\n%s\n%s",&n,s+1,t+1);
bool err=false;
for (int i=1;i<=n;i++)
{
for (int j=0;j<26;j++) lst[i][j]=lst[i-1][j];
lst[i][s[i]-'a']=i;
if (s[i]!=t[i]) err=true;
}
if (err==false) {printf("0\n");return 0;}
int root=treap.build(n),ans=1,rem=n;
for (int i=n;i>=1;i--) if (t[i]!=t[i-1])
{//if (i%10000==0) cerr<<i<<' '<<treap.size[root]<<endl;
//for (int j=1;j<=i;j++) cout<<treap.findkth(root,j)<<' ';cout<<endl;
int w=treap.findkth(root,i);
if ((w!=0)||(s[i]!=t[i])) ans=max(ans,w+2);
int d=lst[min(i-(w!=0),rem)][t[i]-'a'];rem=d-1;
if (d==0) {printf("-1\n");return 0;}
pair<int,int> p=treap.split(root,d-1);
pair<int,int> q=treap.split(p.second,1);
treap.addtag(q.second);
root=treap.merge(p.first,q.second);
}
printf("%d\n",ans);
} | 0 |
// ░░░░░░░░( •̪●)░░░░░░░░░░░░░░░░░░░░░░░░
// ░░░░░░███████ ]▄▄▄▄▄▄▄▄▃░░░▃░░░░ ▃░
// ▂▄▅█████████▅▄▃▂░░░░░░░░░░░░░░░░░
// [███████████████████].░░░░░░░░░░░░░░
// ◥⊙▲⊙▲⊙▲⊙▲⊙▲⊙▲⊙◤...░░░░░░░░░░░░
//PointBlank's code (⌐■_■)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll power(ll x, ll y);
#define repp(I, A, B) for(int I = A; I <= B; I++)
#define rep(I, A, B) for(int I = A; I < B; I++)
#define rrep(I, B, A) for(int I = B; I >= A; I--)
#define pb emplace_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define LB lower_bound
#define UB upper_bound
#define MP make_pair
#define mem(A, B) memset(A, B, sizeof(A));
#define mem0(A) memset(A, 0, sizeof(A));
#define quickio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(this) cerr<<"> "<<#this<<" : "<<this<<"\n"
#define bitcount(n) __builtin_popcountll(n)
#define in_edges(M) repp(I, 1, M){int A, B; cin >> A >> B; v[A].pb(B), v[B].pb(A);}
#define in_edges2(M) repp(I, 1, M){int A, B; cin >> A >> B; v[A].pb(B);}
#define endl "\n"
const ll MOD = 1000000007;
vector<int> en[505];
int n, m, q;
int main() //PointBlank's code ¯\_(ツ)_/¯
{
quickio
cin >> n >> m >> q;
repp(i, 1, m){
int l, r;
cin >> l >> r;
en[l].pb(r);
}
repp(i, 0, 500) sort(all(en[i]));
while(q--){
int l, r;
cin >> l >> r;
ll res = 0;
repp(i, l, r) res += UB(all(en[i]), r) - en[i].begin();
cout << res << endl;
}
}
ll power(ll x, ll y)
{
ll res = 1; x %= MOD;
while(y > 0){if(y & 1) res = (res*x) % MOD; y = y>>1, x = (x*x) % MOD;}
return res;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int n, m, q;
cin >> n >> m >> q;
vector<vector<int>> table(n + 1, vector<int>(n + 1, 0));
while(m--)
{
int l,r;
cin >> l >> r;
table[l][r]++;
}
rep(i, n) rep(j, n) table[i + 1][j + 1] += table[i + 1][j] + table[i][j + 1] - table[i][j];
while (q--)
{
int s, t;
cin >> s >> t;
cout << table[t][t] - table[s - 1][t] - table[t][s - 1] + table[s - 1][s - 1] << endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rg register
template <typename _Tp> inline _Tp read(_Tp&x){
char c11=getchar();x=0;while(!isdigit(c11))c11=getchar();
while(isdigit(c11))x=x*10+c11-'0',c11=getchar();return x;
}
int n,m,tot,a[105];
int main(){
read(n),read(m);
for(rg int i=1;i<=m;i++)read(a[i]),tot+=(a[i]&1);
if(tot>2){puts("Impossible");return 0;}
if(tot){
bool flag=0;
for(rg int i=1;i<m;i++)
if(a[i]&1)
if(flag)swap(a[i],a[m]);
else flag=1,swap(a[i],a[1]);
}
if(m==1){
if(a[1]==1){puts("1\n1\n1");return 0;}
printf("%d\n",a[1]);puts("2");
printf("1 %d\n",a[1]-1);
return 0;
}
for(rg int i=1;i<=m;i++)printf("%d ",a[i]);
if(a[m]==1){
printf("\n%d\n",m-1);
printf("%d\n",a[1]+1);
for(rg int i=2;i<m;i++)printf("%d ",a[i]);
}
else {
printf("\n%d\n",m);
printf("%d\n",a[1]+1);
for(rg int i=2;i<m;i++)printf("%d ",a[i]);
printf("%d\n",a[m]-1);
}return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
class Dice{
public:
int value[6];
void roll(char _order) {
switch(_order) {
case 'N':
swap(value[4], value[0]);
swap(value[0], value[1]);
swap(value[1], value[5]);
break;
case 'E':
swap(value[2], value[0]);
swap(value[0], value[3]);
swap(value[3], value[5]);
break;
case 'S':
swap(value[1], value[0]);
swap(value[0], value[4]);
swap(value[4], value[5]);
break;
case 'W':
swap(value[0], value[2]);
swap(value[2], value[5]);
swap(value[5], value[3]);
break;
}
}
void rotate(void) {
this->roll('N');
this->roll('E');
this->roll('S');
}
bool operator==(const Dice other) {
bool res = true;
for (int knock=1;knock<=30;knock++) {
res = true;
for (int i=0;i<6;i++)
if (other.value[i] != this->value[i])
res = false;
if (res)
break;
else {
if (knock % 5 == 0) {
if (knock / 5 <= 3) {
this->roll('N');
} else if (knock / 5 == 4) {
this->roll('E');
} else {
this->roll('E');
this->roll('E');
}
} else {
this->rotate();
}
}
}
return res;
}
};
int main() {
int n;
Dice dice[100];
cin >> n;
for (int i=0;i<n;i++)
for (int j=0;j<6;j++)
cin >> dice[i].value[j];
bool res = true;
for (int i=0;i<n;i++)
for (int j=i+1;j<n;j++)
if (dice[i] == dice[j])
res = false;
if (res)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| 0 |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define M 1000020
using namespace std;
int read(){
int nm=0,fh=1; char cw=getchar();
for(;!isdigit(cw);cw=getchar()) if(cw=='-') fh=-fh;
for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
return nm*fh;
}
int n,m,ans,s[M],dt;
char S[M],ch[M];
bool fg=false;
int main(){
n=read(),scanf("%s%s",S+1,ch+1);
for(int last=n,i=n;i>0;i--,fg=false){
m+=s[i+dt];
while(last>i||(S[last]!=ch[i]&&last)) last--,fg=true;
if(last<=0){puts("-1");return 0;}
if(fg&&last<i) m++,s[i+dt]=0,s[last+dt]--,dt++;
ans=max(ans,m);
}
printf("%d\n",ans); return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
typedef complex<ld> com;
constexpr ll INF = 1000000000000000000;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
constexpr ll mod = 1000000007;
constexpr ll modsize = 2000;
vector<ll> fac(modsize);
vector<ll> inv(modsize);
vector<ll> facinv(modsize);
void modcalc() {
if (modsize == 0) abort();
fac[0] = 1; fac[1] = 1; inv[1] = 1;
facinv[0] = 1; facinv[1] = 1;
for (ll i = 2; i < modsize; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
facinv[i] = facinv[i - 1] * inv[i] % mod;
}
}
ll modinv(ll a) {
if (a == 0) abort();
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= mod;
if (u < 0) u += mod;
return u;
}
ll modpow(ll a, ll b) {
ll ans = 1;
a %= mod;
while (b) {
if (b & 1) ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
ll modcomb(ll n, ll k) {
if (n < 0 || k < 0 || n < k) return 0;
return fac[n] * facinv[k] % mod * facinv[n - k] % mod;
}
ll modperm(ll n, ll k) {
if (n < 0 || k < 0 || n < k) return 0;
return fac[n] * facinv[n - k] % mod;
}
ll modhom(ll n, ll k) {
if (n < 0 || k < 0 || n == 0 && k > 0) return 0;
if (n == 0 && k == 0) return 1;
return fac[n + k - 1] * facinv[k] % mod * facinv[n - 1] % mod;
}
ll dp[1010][1010];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
modcalc();
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
dp[0][a] = 1;
for (int j = a; j <= b; j++) {
rep(i, n + 1) {
dp[i][j + 1] += dp[i][j];
if (dp[i][j + 1] > mod) dp[i][j + 1] -= mod;
int st = i;
for (int k = c; k <= d; k++) {
if (i + j * k > n) break;
dp[i + j * k][j + 1] += dp[i][j] * fac[n - i] % mod * modpow(facinv[j], k) % mod * facinv[n - i - j * k] % mod * facinv[k] % mod;
if (dp[i + j * k][j + 1] > mod) dp[i + j * k][j + 1] -= mod;
}
}
}
cout << dp[n][b + 1] << endl;
} | 0 |
#include <bits/stdc++.h>
#define MAXN 100005
#define lowbit(x) x & -x
using namespace std;
int n, N;
int a[MAXN][4], b[MAXN], c[MAXN], t[2][MAXN * 3], sum[2];
int read() {
char c = getchar();
int x = 0;
while (!isdigit(c))
c = getchar();
while (isdigit(c)) {
x = (x << 3) + (x << 1) + c - '0';
c = getchar();
}
return x;
}
void add(int c, int x, int v) {
while (x <= N) {
t[c][x] += v;
x += lowbit(x);
}
}
int query(int c,int x) {
int res = 0;
while (x) {
res += t[c][x];
x -= lowbit(x);
}
return res;
}
int main() {
n = read();
N = n * 3;
for (int j = 1; j <= 3; ++j)
for (int i = 1; i <= n; ++i)
a[i][j] = read();
for (int i = 1; i <= n; ++i) {
if (a[i][1] > a[i][2]) {
sum[i & 1] ^= 1;
swap(a[i][1], a[i][3]);
}
b[i] = a[i][3];
if (a[i][1] != a[i][2] - 1 || a[i][2] != a[i][3] - 1 || b[i] % 3 != 0 || ((b[i] / 3) & 1) != (i & 1)) {
puts("No");
return 0;
}
}
for (int i = n; i >= 1; --i) {
sum[(i & 1) ^ 1] ^= query(i & 1, b[i] / 3) & 1;
add(i & 1, b[i] / 3, 1);
}
if ((sum[0] & 1) || (sum[1] & 1))
puts("No");
else
puts("Yes");
}
| #include <bits/stdc++.h>
using namespace std;
#define dump(...) cout<<"# "<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp make_pair
#define mt make_tuple
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vd=vector<double>;
using vvd=vector<vd>;
using vs=vector<string>;
template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
return os<<'('<<p.first<<','<<p.second<<')';
}
template<typename Tuple>
void print_tuple(ostream&,const Tuple&){}
template<typename Car,typename... Cdr,typename Tuple>
void print_tuple(ostream& os,const Tuple& t){
print_tuple<Cdr...>(os,t);
os<<(sizeof...(Cdr)?",":"")<<get<sizeof...(Cdr)>(t);
}
template<typename... Args>
ostream& operator<<(ostream& os,const tuple<Args...>& t){
print_tuple<Args...>(os<<'(',t);
return os<<')';
}
template<typename Ch,typename Tr,typename C>
basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){
os<<'[';
for(auto i=begin(c);i!=end(c);++i)
os<<(i==begin(c)?"":" ")<<*i;
return os<<']';
}
constexpr int INF=1e9;
constexpr int MOD=1e9+7;
constexpr double EPS=1e-9;
struct FenwickTree{
vector<ll> data;
FenwickTree(int n):data(n+1){}
void Add(int i,int x){
for(i++;i<data.size();i+=i&-i)
data[i]+=x;
}
ll Sum(int i){
ll res=0;
for(;i;i-=i&-i)
res+=data[i];
return res;
}
ll Sum(int i,int j){
return Sum(j)-Sum(i);
}
};
ll InversionNumber(const vi& a)
{
FenwickTree ft(a.size());
ll res=0;
rep(i,a.size()){
res+=ft.Sum(a[i],a.size());
ft.Add(a[i],1);
}
return res;
}
bool test(vector<tuple<int,int,int>> src,vector<tuple<int,int,int>> dst)
{
int n=src.size();
rep(i,n){
int x,y,z;
tie(x,y,z)=src[i];
src[i]=x<z?mt(x,y,z):mt(z,y,x);
tie(x,y,z)=dst[i];
dst[i]=x<z?mt(x,y,z):mt(z,y,x);
}
sort(all(src)); sort(all(dst));
return src==dst;
}
tuple<bool,bool> calc(vector<tuple<int,int,int>> src,vector<tuple<int,int,int>> dst)
{
int m=src.size(),flip=0;
rep(i,m){
int x,y,z;
tie(x,y,z)=src[i];
src[i]=x<z?mt(x,y,z):(flip++,mt(z,y,x));
tie(x,y,z)=dst[i];
dst[i]=x<z?mt(x,y,z):(flip++,mt(z,y,x));
}
map<tuple<int,int,int>,int> f;
rep(i,m) f[dst[i]]=i;
vi a(m);
rep(i,m) a[i]=f[src[i]];
return mt(InversionNumber(a)&1,flip&1);
}
bool solve(int n,vvi grid)
{
array<bool,2> inv,flip;
rep(i,2){
vector<tuple<int,int,int>> src,dst;
rep(j,n) if(j%2==i){
if(j/2%2==0){
src.emplace_back(mt(3*j+1,3*j+2,3*j+3));
dst.emplace_back(mt(grid[0][j],grid[1][j],grid[2][j]));
}
else{
src.emplace_back(mt(3*j+3,3*j+2,3*j+1));
dst.emplace_back(mt(grid[2][j],grid[1][j],grid[0][j]));
}
}
if(!test(src,dst)) return false;
tie(inv[i],flip[i])=calc(src,dst);
}
return inv[0]==flip[1]&&inv[1]==flip[0];
}
int main()
{
for(int n;cin>>n&&n;){
vvi grid(3,vi(n));
rep(i,3) rep(j,n) cin>>grid[i][j];
cout<<(solve(n,grid)?"Yes":"No")<<endl;
}
}
| 1 |
#include <bits/stdc++.h>
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int N; cin >> N;
cout << 0 << endl;
string pres,s;
int l,r,prei;
l = N-1; r=0;
cin >> pres;
if(pres == "Vacant") return 0;
else cout << N-1 << endl;
cin >> s;
if(s == "Vacant") return 0;
else{
cout << (l+r)/2 << endl;
}
prei = 0;
for (int i = 0; i < 30; i++)
{
cin >> s;
if(s == "Vacant") return 0;
else if(s == pres){
if(abs((l+r)/2-prei)%2 == 0){
if(prei == r){
prei = (l+r)/2;
r = (l+r)/2;
}else{
prei = (l+r)/2;
l = (l+r)/2;
}
}
else{
if(prei == r){
prei = (l+r)/2;
l = (l+r)/2;
}else{
prei = (l+r)/2;
r = (l+r)/2;
}
}
}
else{
if(abs((l+r)/2-prei)%2 == 0){
if(prei == r){
prei = (l+r)/2;
l = (l+r)/2;
}else{
prei = (l+r)/2;
r = (l+r)/2;
}
}
else{
if(prei == r){
prei = (l+r)/2;
r = (l+r)/2;
}else{
prei = (l+r)/2;
l = (l+r)/2;
}
}
}
pres = s;
cout << (l+r)/2 << endl;
}
return -1;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}
const int MOD = 1e9 + 7;
const int INF = 2e18;
signed main() {
int N;
cin >> N;
vector<int> A(N);
cin >> A;
{
bool check = (A[0] == 0);
for (int i = 1; i < N - 1; i++) {
if (A[i] > i) check = false;
}
if (!check) {
cout << -1 << endl;
return 0;
}
}
int ans = 0;
for (int i = N - 1; i >= 1;) {
ans += A[i];
int count = 0;
for (int j = i - 1; j >= 0; j--) {
if (A[j] != A[i] - ++count) {
if (A[j] < A[i] - count) {
cout << -1 << endl;
return 0;
}
i = j;
break;
}
if (j == 0) i = 0;
}
}
cout << ans << endl;
}
| 0 |
#include <stdio.h>
int main(){
int h1, m1, h2, m2, k;
scanf("%d %d %d %d %d", &h1, &m1, &h2, &m2, &k);
if(h1>h2){
h1-=24;
}
if(h2 == 0 && h1 != 0){
h2 = 24;
}
if(m2<m1){
m2 += 60;
h2--;
}
int mins = (h2-h1)*60 + (m2-m1);
mins-=k;
printf("%d\n", mins);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(0)
typedef long long ll;
#define int ll
#define swap(x, y)((x)^=(y)^=(x)^=(y))
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> matrix;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(c) c.begin(),c.end()
#define mp make_pair
#define pb push_back
#define f first
#define tcase int _; cin>> _; for( ; _; --_)
#define s second
#define endl '\n'
const int MAX = 1e6+1;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
const double DEG = 180/PI;
const int MOD = 1e9+7;
int mod(int x, int m){ if(x >= 0) return x % m; if(-x < m) return m-(-x); return mod(x%m, m);}
int gcd (int a, int b) {while(b){a = mod(a, b); swap(a, b);} return a;}
int lcm (int a, int b) {return a / gcd(a, b) * b;}
int fexp(int base, int exp, int m){
int total = 1;
while(exp > 0){
if(exp % 2 == 1){
total = mod(((mod(total, m)) * (mod(base, m))), m);
exp--;
}
base= mod((mod(base, m) * mod(base, m)), m);
exp /= 2;
}
return mod(total, m);
}
int n;
void solve(){
cin>> n;
vector<ll> cnt(60, 0);
for(int i = 0; i<n; ++i){
ll x;
cin>> x;
for(int j = 1, k = 0; j <= x; j<<=1LL, ++k) if(j & x) cnt[k]++;
}
ll ans = 0LL;
for(int i = 0; i<60; ++i){
ll temp = mod(cnt[i] * (n - cnt[i]), MOD);
ans = mod(ans + mod(temp * mod(1LL << i, MOD), MOD), MOD);
}
cout<< ans << endl;
}
int32_t main(){
fastio;
solve();
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
long long ara[3][4007];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x,y=0,z=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long long,long long> >vct; vector<string>vst;
set<long long>st,nt,tt; map<long long,long long>mp,nq,qr; string str,ttr,ntr;
scanf("%lld",&n);
cin>>str;
if(n<=3)printf("0\n");
else
{
for(i=0;i<n;i++)
{
if(str[i]=='R')cnt++;
else if(str[i]=='G')y++;
else{ z++; }
ara[0][i+1]=cnt; ara[1][i+1]=y; ara[2][i+1]=z;
}
char ch,th,rh;
for(i=0;i<n-2;i++)
{
ch=str[i];
for(j=i+1;j<n-1;j++)
{
if(str[j]!=ch)
{
th=str[j];
if(ch!='R' && th!='R')x=0;
else if(ch!='G' && th!='G')x=1;
else{ x=2; }
fr=ara[x][n]-ara[x][j+1-1];
p=j-i; h=j+p;
if(h<=n-1)
{
if(x==2)rh='B';
else if(x==1)rh='G';
else{ rh='R'; }
if(str[h]==rh)fr--;
}
ans=ans+fr;
}
}
}
printf("%lld\n",ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
void solve() {
int n;
cin >> n;
ll a[n];
rep(i, n) {
cin >> a[i];
}
string s;
cin >> s;
reverse(a, a + n);
reverse(ALL(s));
vector<ll> bs;
rep(i, n) {
for (auto b : bs) {
a[i] = min(a[i], a[i] ^ b);
}
if (s[i] == '0') {
if (a[i] != 0) bs.emplace_back(a[i]);
} else {
if (a[i]) {
cout << 1 << endl;
return;
}
}
}
cout << 0 << endl;
}
signed main() {
int tt;
cin >> tt;
while (tt--) {
solve();
}
return 0;
} | 0 |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <math.h>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <string.h>
#include <bitset>
#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
const int N = 2010, M = 4e6+10;
int n, k, dp[N][N];
int fac[M], ifac[M];
int C(int n, int m) {
if (n<m) return 0;
return (ll)fac[n]*ifac[m]%P*ifac[n-m]%P;
}
int main() {
fac[0]=1;
REP(i,1,M-1) fac[i]=(ll)fac[i-1]*i%P;
ifac[M-1]=inv(fac[M-1]);
PER(i,0,M-2) ifac[i]=(ll)ifac[i+1]*(i+1)%P;
scanf("%d%d", &n, &k);
if (k==1) return puts("1"),0;
dp[0][0] = 1;
REP(i,0,n) REP(j,0,i) {
dp[i+1][j] = (dp[i+1][j]+dp[i][j])%P;
dp[i][j+1] = (dp[i][j+1]+(ll)C(n*k-j*(k-1)-i-1,k-2)*dp[i][j])%P;
}
int ans = (ll)dp[n][n]*fac[n]%P;
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_X 200005
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long FINV(int n){
if (n < 0) return 0;
return finv[n];
}
ll dp[MAX_X];
int main() {
int n, x;
cin >> n >> x;
int a[n];
rep(i,n)cin >> a[i];
sort(a,a+n);
COMinit();
int ite = lower_bound(a,a+n,x+1) - a;
ite = n - ite;
dp[x] = COM(n, ite) * fac[ite] % MOD;
drep(i,MAX_X){
if(dp[i] == 0)continue;
if(i < a[0])break;
drep(j,n){
if(a[j] > i)continue;
int after = i % a[j];
int nn = 0;
int kk = 0;
rep(k,n){
if(a[k] <= i){
nn++;
if(after < a[k])kk++;
}
}
nn--;
kk--;
// cout << i << ' ' << a[j] << ' ' << after << ' ' << kk << ' ' << dp[i] * COM(nn, kk) << endl;
dp[after] += dp[i] * COM(nn, kk) % MOD * fac[kk];
dp[after] %= MOD;
}
}
ll ans = 0;
rep(i,a[0]){
ans += dp[i] * i;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int scores[2] = {0, 0};
int points[2][10];
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 10; ++j) {
cin >> points[i][j];
}
sort(points[i], points[i]+10);
for (int j = 0; j < 3; ++j) {
scores[i] += points[i][9 - j];
}
}
cout << scores[0] << ' ' << scores[1] << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
long long e;
while ((cin >> e), e){
long long x,y, z, min = 1000000;
for (z = 0; z*z*z <= e; z++){
for (y = 0; y*y <= e; y++){
x = e - z*z*z - y*y;
if (x >= 0 && min > x + y + z)min = x + y + z;
}
}
cout << min << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
for (int i = 1; i < n; ++i) {
if (s[i - 1] == 'A' && s[i] == 'C') {
cout << "Yes" << '\n';
return 0;
}
}
puts("No");
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i=1; i<=n; i=i+1) {
int x = i;
if (x % 3 == 0) {
cout << " " << i;
} else {
while (x % 10 != 3 && x > 0) {
x = x / 10;
}
if (x % 10 == 3)
cout << " " << i;
}
}
cout << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int d,ans,p[25];
int Abs(int x)
{
return x<0?-x:x;
}
signed main()
{
cin>>d;
p[0]=1LL;
for(int i=1;i<=20;i++) p[i]=p[i-1]*10LL;
for(int i=2;i<=20;i++)
{
int k=i/2;
for(int s=0;s<(1<<k);s++)
{
int w,x=d;
if(i&1) w=10;
else w=1;
for(int j=0;j<k;j++)
{
int d2=Abs(x)%10LL;
if(x<0) d2=(10-d2)%10;
if(s&(1<<j))
{
int n=10LL-d2;
if(j==0) n--;
w*=n;
x+=d2*p[i-2*j-1];
x-=d2;
}
else
{
int n=d2;
if(j==0) n--;
if(n<0)
{
w=0;
break;
}
w*=n;
x-=(10LL-d2)*p[i-2*j-1];
x+=10LL-d2;
}
x/=10LL;
}
if(!x) ans+=w;
}
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define INF 1 << 30
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define FORALL(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define FOREACH(i,c) for(auto (i) : (c))
#define BIT(i,j) ((i)>>(j))&1
#define ALL(o) (o).begin(), (o).end()
#define ERASE(o) (o).erase(unique((o).begin(),(o).end()), (o).end())
#define SQ(x) ((x)*(x))
using namespace std;
typedef long long ll;
typedef valarray<int> Array;
typedef pair<ll,ll> Pll;
typedef pair<int, int> Pii;
typedef pair<double, double> Pdd;
template<typename T> inline void priv(vector<T>a){REP(i,a.size()){cout<<a[i]<<((i==a.size()-1)?"\n":" ");}}
ll gcd(ll a,ll b){int c=max(a,b);int d=min(a,b);return c==0||d==0?c:gcd(c%d,d);}
ll lcm(ll a,ll b){return a==0||b==0?0:a*b/gcd(a,b);}
int a[144];
void flip(int x, int y)
{
if(x>11||y>11||x<0||y<0) return;
if(a[x+y*12])
{
a[x+y*12] = 0;
flip(x+1,y);
flip(x-1,y);
flip(x,y+1);
flip(x,y-1);
}
}
void solve()
{
int cnt = 0;
REP(i,144) if(a[i])
{
cnt++;
flip(i%12,i/12);
}
cout << cnt << endl;
}
int main()
{
string s;
int i = 0;
while(cin >> s)
{
REP(j,12) a[i*12+j] = s[j]-'0';
i=(++i)%12;
if(i==0) solve();
}
return 0;
} | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
const long long MOD = 1000000007;
long long N;
long long a[100000] = {0};
int main() {
cin >> N;
long long ans = 1;
rep(i, N) {
long long A;
cin >> A;
long long temp;
if(A == 0) {
temp = 3 - a[A];
} else {
temp = a[A-1] - a[A];
}
ans = ans * temp % MOD;
a[A]++;
}
if(ans <= 0) cout << 0 << endl;
else cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main(){
int n;
cin >> n;
vector<ll>v(100000);
vector<int>a(n);
rep(i, 0, n)cin >> a[i];
ll ans = 1;
rep(i, 0, n){
ll p = a[i];
if(p==0){
v[p]++;
ans *= (4-v[p]);
ans %= mod;
}else{
v[p]++;
ans *= min(v[p-1],v[p-1]+1-v[p]);
ans %= mod;
}
//cout << ans << endl;
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ss(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define per(i, l, r) for (int i = r; l <= i; --i)
using ll = long long;
using namespace std;
string s;
int cnt[26];
int main() {
cin >> s;
for (auto x : s)
cnt[x - 'a']++;
ll res = 0;
rep(i, 0, 25)
rep(j, i + 1, 25)
res += 1LL * cnt[i] * cnt[j];
cout << res + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
int main() {
string S;
cin>>S;
vector<int64_t> A(26,0);
int64_t a=-97,b=S.size();
rep(i,b){
int64_t c=S.at(i);
A.at(a+c)++;
}
int64_t ans=b*(b-1)/2;
rep(i,26){
int64_t d=A.at(i);
if(d>1) ans-=d*(d-1)/2;
}
cout<<ans+1;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
char s[3];
cin>>s[0]>>s[1]>>s[2];
int max=0, locmax=0;
for(int i=0;i<3;i++){
if(s[i] == 'R'){
locmax++;
}
else{
locmax=0;
}
if(locmax>max){
max=locmax;
}
}
cout<<max;
}
| #include<iostream>
#include<cmath>
using namespace std;
int main()
{
int a, b, c, k, x, y, z;
cin >> a >> b >> c >> k;
if(a >= b && a >= c)
{x = a; y = b; z = c;}
if(b > a && b >= c)
{x = b; y = c; z = a;}
else if(c > a && c > b)
{x = c; y = a; z = b;}
while(k > 0)
{
k--;
x = x * 2;
}
cout << y + z + x;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll stoi9(string s) {
// 10 ^ 9倍した整数を返す
int digit = 0;
for (int i = sz(s)-1; i >= 0; i--) {
if (s[i] == '.') {
s.replace(i, 1, "");
break;
}
digit++;
if (i == 0) digit = 0;
}
ll x = stoll(s);
rep(i, 9-digit) x *= 10;
return x;
}
int table[20][20];
ll cum[20][20];
int main() {
int N;
cin >> N;
ll ans = 0;
rep(i, N) {
string S;
cin >> S;
ll x = stoi9(S);
int two = 0, five = 0; // 2と5で何回割れるか
while (x%2 == 0 && two < 18) {
two++;
x /= 2;
}
while (x%5 == 0 && five < 18) {
five++;
x /= 5;
}
table[two][five]++;
if (two >= 9 && five >= 9) ans--;
}
for (int i = 18; i >= 0; i--) {
for (int j = 18; j >= 0; j--) {
cum[i][j] = table[i][j] + cum[i+1][j] + cum[i][j+1] - cum[i+1][j+1];
}
}
for (int i = 0; i < 19; i++) {
for (int j = 0; j < 19; j++) {
ans += table[i][j] * cum[18-i][18-j];
}
}
ans /= 2;
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
vector<long long> a(n);
const int b = 200;
for(int i = 0; i < n; i++) {
double p;
cin >> p;
a[i] = p * 1000000000 + 0.5;
}
vector<vector<int>> cnt(b, vector<int>(b));
long long res = 0;
for(int i = 0; i < n; i++) {
int two = 0, five = 0;
while(a[i] % 2 == 0) {
two++;
a[i] /= 2;
}
while(a[i] % 5 == 0) {
five++;
a[i] /= 5;
}
res += cnt[18 + b / 2 - two][18 + b / 2 - five];
for(int u = -30; u <= two; u++) {
for(int v = -30; v <= five; v++) {
cnt[b / 2 + u][b / 2 + v]++;
}
}
}
cout << res;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE\n" : "IMPOSSIBLE\n" )
#define ANS(n) cout << (n) << "\n"
#define REP(i,n) for(int64 i=0;i<(n);++i)
#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)
#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)
#define ALL(obj) (obj).begin(),(obj).end()
#define pii pair<int32,int32>
#define pll pair<int64,int64>
#define pb(a) push_back(a)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int32 n;
cin >> n;
vector<int64> a(n);
REP(i,n)cin >> a[i];
int64 s = 0;
REP(i,n)s ^= a[i];
REP(i,n)a[i] &= ~s;
// REP(i,n){
// cout << bitset<60>(a[i]) << endl;
// }
int32 r = 0;
FORR(d,61,0){
int32 i;
for(i = r; i < n; ++i){
if((a[i]>>d)&1){
swap(a[r],a[i]);
break;
}
}
if(i == n)continue;
REP(j,n){
if(j == r)continue;
if((a[j]>>d)&1)a[j] ^= a[r];
}
r++;
}
// REP(i,n){
// cout << bitset<60>(a[i]) << endl;
// }
int64 ad = 0;
REP(i,n)ad ^= a[i];
ANS(s + (ad << 1));
return 0;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
int main(){
INT(h,w);
vector2d(int,table,h,w);
vector<tuple<int,int,int,int>> ope;
in(table);
rep(y,h){
rep(x,w){
table[y][x]%=2;
if(y<h-1&&table[y][x]==1){
table[y+1][x]++;
ope.push_back(make_tuple(y+1,x+1,y+2,x+1));
}
if(y==h-1&&x+1<w&&table[y][x]==1){
table[y][x+1]++;
ope.push_back(make_tuple(y+1,x+1,y+1,x+2));
}
}
}
out(ope.size());
rep(i,ope.size())out(get<0>(ope[i]),get<1>(ope[i]),get<2>(ope[i]),get<3>(ope[i]));
}
| 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int> > VVI;
typedef vector< vector<ll> > VVL;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pf push_front
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ub upper_bound
#define lb lower_bound
int main(){
int N,M;
cin>>N>>M;
VI A(N-1+M),B(N-1+M);
rep(i,N-1+M) cin>>A[i]>>B[i];
VVI X(N,VI(0));
VI I(N);
rep(i,N-1+M){
X[A[i]-1].pb(B[i]-1);
I[B[i]-1]++;
}
int S=0;
rep(i,N) if(I[i]==0) S=i;
VI T(0);
T.pb(S);
queue<int> Q;
Q.push(S);
VI F(N);
F[S]++;
while(!Q.empty()){
int now=Q.front();
Q.pop();
rep(i,X[now].size()){
int nxt=X[now][i];
if(!F[nxt]){
I[nxt]--;
if(!I[nxt]){
Q.push(nxt);
T.pb(nxt);
}
}
}
}
VI Z(N);
rep(i,N){
int now=T[i];
if(!Z[now]) Z[now]=1;
rep(j,X[now].size()){
int nxt=X[now][j];
Z[nxt]=max(Z[nxt],Z[now]+1);
}
}
VI ans(N);
rep(i,N){
rep(j,X[i].size()){
int nxt=X[i][j];
if(Z[i]+1==Z[nxt]) ans[nxt]=i+1;
}
}
ans[S]=0;
rep(i,N) cout<<ans[i]<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){//priority_queue?
int n, m;
cin >> n >> m;
vector<vector<int>> elist(n), rlist(n);
vector<int> indeg(n);
for(int i=0; i<n-1+m; ++i){
int s, t;
cin >> s >> t;
--s; --t;
elist[s].push_back(t);
rlist[t].push_back(s);
++indeg[t];
}
queue<int> zeroq;
for(int i=0; i<n; ++i){
if(indeg[i]==0) zeroq.push(i);
}
vector<int> result, par(n,0);
while(!zeroq.empty()){
int u=zeroq.front();
zeroq.pop();
result.push_back(u);
for(int i : elist[u]){
--indeg[i];
if(indeg[i]==0){
zeroq.push(i);
par[i]=u+1;
}
}
}
for(int i : par) cout << i << endl;
} | 1 |
#include<iostream>
#include<set>
using namespace std;
int main(){
int K, N, i=0;
int input, output;
cin >> N >> K;
set<int> num;
while (i < K){
cin >> input;
num.insert(input);
i++;
}
int a1, a2=10, a3=10, a4=10, a5=10;
output = N;
while (1){
if (output >= 10000){a5 = output / 10000;}
if (output >= 1000){a4 = (output % 10000) / 1000;}
if (output >= 100){a3 = (output % 1000) / 100;}
if (output >= 10){a2 = (output % 100) / 10;}
a1 = (output % 10);
if (num.find(a5) == num.end() && num.find(a4) == num.end() && num.find(a3) == num.end() && num.find(a2) == num.end() && num.find(a1) == num.end()){
break;
}
output += 1;
}
cout << output << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> X(N);
int res = 0;
REP(i, N){
if (S[i] == 'W'){
res++;
}
X[i] += res;
}
res = 0;
REPD(i, N){
if (S[i] == 'E'){
res++;
}
X[i] += res;
}
int ans = MIN(X);
cout << ans-1 << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int MAXN = 1e4 + 10;
ll dp[MAXN][128], num[MAXN];
char s[MAXN];
int len, D;
ll dfs(int pos, int tot, bool lim) {
if (pos == len + 1) return dp[pos][tot] = (tot == 0);
if (!lim && dp[pos][tot] != -1) return dp[pos][tot];
int up = lim ? num[pos] : 9;
ll ret = 0;
for (int i = 0; i <= up; i++) {
ret += dfs(pos + 1, (tot + i) % D, lim && (i == up));
ret %= mod;
}
if (!lim) dp[pos][tot] = ret;
return ret;
}
int main() {
memset(dp, -1, sizeof(dp));
scanf("%s%d", s + 1, &D);
len = strlen(s + 1);
for (int i = 1; i <= len; i++) num[i] = s[i] - '0';
ll ans = (dfs(1, 0, 1) - 1 + mod) % mod;
// minus one to deduct the zero
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
const int MOD = 1e9 + 7;
using namespace std;
int main(){
string K;
cin >> K;
int D;
cin >> D;
vector<vector<vector<long long>>> dp(K.size() + 1, vector<vector<long long>>(D, vector<long long>(2, 0)));
dp[0][0][1] = 1;
for(int i = 0; i < (int)K.size(); i++){
for(int j = 0; j < D; j++){
for(int k = 0; k < 10; k++){
dp[i + 1][(j + k) % D][0] += dp[i][j][0];
if(k < K[i] - '0'){
dp[i + 1][(j + k) % D][0] += dp[i][j][1];
}else if(k == K[i] - '0'){
dp[i + 1][(j + k) % D][1] += dp[i][j][1];
}
dp[i + 1][(j + k) % D][0] %= MOD;
dp[i + 1][(j + k) % D][1] %= MOD;
}
}
}
cout << ((dp[K.size()][0][0] + dp[K.size()][0][1] - 1) % MOD + MOD) % MOD << endl;
return 0;
} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.