code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define N 610
int a[N][N],n,d1,d2,b;
int main()
{
scanf("%d%d%d",&n,&d1,&d2);
while (d1%4==0)
{
b++;
d1/=4;
}
if (d1&1)
{
for (int i=0; i<2*n; i++)
for (int j=0; j<2*n; j++)
if (((i>>b)+(j>>b))&1)
a[i][j]=1;
}
else
for (int i=0; i<2*n; i++)
for (int j=0; j<2*n; j++)
if ((i>>b)&1) a[i][j]=1;
b=0;
while (d2%4==0)
{
b++;
d2/=4;
}
if (d2&1)
for (int i=0; i<2*n; i++)
{
for (int j=0; j<2*n; j++)
if (((i>>b)+(j>>b))&1)
a[i][j]=1;
}
else
for (int i=0; i<2*n; i++)
for (int j=0; j<2*n; j++)
if ((i>>b)&1) a[i][j]=1;
int tt=0;
for (int i=0; i<2*n; i++)
for (int j=0; j<2*n; j++)
if (a[i][j]==0)
{
tt++;
printf("%d %d\n",i,j);
if (tt==n*n) return 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define mod 1000000007LL
#define eps 1e-13
// #define PI 3.141592653589793238L
#define INF 1000000011
#define INFLL 1000000000000000011LL
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pil pair<int, long long>
#define pli pair<long long, int>
#define mp make_pair
#define F first
#define S second
#define pb push_back
#define fo(i,a,n) for(i = (a); i < (n); i++)
#define gtl(x) getline(cin, (x))
#define flsh fflush(stdout)
#define sws ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define gcd __gcd
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)((a).size())
#define io_file freopen("D:/Coding Problems/Contest/input_file.in", "r", stdin); freopen("D:/Coding Problems/Contest/output_file.out", "w", stdout)
ll modx(ll Base, ll exponent)
{
ll ans = 1;
if(Base == 1)
return Base;
while(exponent)
{
if(exponent & 1)
ans = (ans * Base)%mod;
Base = (Base * Base)%mod;
exponent = exponent >> 1;
}
return ans;
}
ll inmodx(ll num)
{
return (modx(num, mod-2LL));
}
bool cmp(pair < pii, int > a, pair < pii, int > b)//true for a before b
{
if(a.F.F/300 < b.F.F/300)
return 1;
if(a.F.F/300 > b.F.F/300)
return 0;
if(a.F.S < b.F.S)
return 1;
if(a.F.S > b.F.S)
return 0;
if(a.F <= b.F)
return 1;
return 0;
}
const int N = (6e2) + 9;
const int M = (36e4) + 9;
const int LOGN = ((int)log2(N)) + 3;
const int LOGM = ((int)log2(M)) + 3;
const int BUCK = 2*550;
const int SQRT = BUCK+9;
vector < pii > arr[2], ans[4];
int node[N][N];
pii val[M];
vi v[2][M];
int mark[2][M];
bool vis[2][M];
queue < int > q;
int n;
inline void add_edge(int bit, int a, int b, int x, int y)
{
if(x < 0 || x >= n+n || y < 0 || y >= n+n)
return;
v[bit][node[a][b]].pb(node[x][y]);
return;
}
void bfs(int cur, int bit)
{
if(vis[bit][cur])
return;
while(!q.empty())
q.pop();
int z;
q.push(cur);
vis[bit][cur] = 1;
mark[bit][cur] = 0;
while(!q.empty())
{
z = q.front();
q.pop();
for(auto x : v[bit][z])
if(!vis[bit][x])
{
vis[bit][x] = 1;
mark[bit][x] = 1 - mark[bit][z];
q.push(x);
}
}
return;
}
void solve()
{
int d1, d2, i, j, k, d, cnt = 0;
cin >> n >> d1 >> d2;
fo(i,0,n+n)
fo(j,0,n+n)
{
int d = i*i + j*j;
if(d == d1)
arr[0].pb({i,j});
if(d == d2)
arr[1].pb({i,j});
}
fo(i,0,n+n)
fo(j,0,n+n)
{
node[i][j] = cnt;
val[cnt] = {i,j};
cnt++;
}
fo(i,0,n+n)
fo(j,0,n+n)
fo(k,0,2)
for(auto x : arr[k])
{
add_edge(k,i,j,i+x.F,j+x.S);
add_edge(k,i,j,i+x.F,j-x.S);
add_edge(k,i,j,i-x.F,j+x.S);
add_edge(k,i,j,i-x.F,j-x.S);
}
fo(i,0,cnt)
{
bfs(i,0);
bfs(i,1);
}
fo(i,0,cnt)
ans[mark[0][i]*2 + mark[1][i]].pb(val[i]);
fo(j,0,4)
if(sz(ans[j]) >= n*n)
{
fo(i,0,n*n)
cout << ans[j][i].F << " " << ans[j][i].S << '\n';
return;
}
return;
}
int main()
{
sws;
clock_t clk;
clk = clock();
// io_file;
// srand (time(NULL));
//Code here
int t = 1, cs;
cout << fixed << setprecision(9);
// cin >> t;
fo(cs,1,t+1)
{
// cout << "Case #" << cs << ": ";
solve();
}
// Code ends here
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk)/CLOCKS_PER_SEC << "\n";
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+9;
int a[maxn];
int main()
{
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
while(k--)
{
int b[maxn];
memset(b,0,sizeof(b));
for(int i=1;i<=n;i++)
{
int l = max(1,i-a[i]);
int r = min(n,i+a[i]);
b[l]++;
b[r+1]--;
}
int flag = 1;
for(int i=1;i<=n;i++)
{
a[i] = a[i-1] + b[i];
if(a[i]!=n)
flag = 0;
}
if(flag)
break;
}
for(int i=1;i<=n;i++)
{
cout<<a[i]<<" ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, k;
double kitaichi(vector<int> p, int start, int k){
double ans;
for (int i = 0; i < k; i++){
double sum = 0;
for (int j = 1; j <= p[start+i]; j++){
sum += j;
}
ans += sum/p[start+i];
}
return ans;
}
int main() {
cin >> n >> k;
vector<int> p(n);
for (int i = 0; i < n; i++){
cin >> p.at(i);
}
int sum = 0;
int start;
int s = 0;
for (int i = 0; i < 1; i++){
for (int j = 0; j < k; j++){
s += p.at(i+j);
}
sum = s;
start = i;
}
for (int i = 1; i + k <= n; i++){
s += p.at(i+k-1);
s -= p.at(i-1);
if (sum < s){
sum = s;
start = i;
}
}
cout << fixed << setprecision(15) << kitaichi(p, start, k) << endl;
} | 0 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const* argv[])
{
std::string s;
std::cin >> s;
std::reverse(s.begin(),s.end());
std::cout << s << std::endl;
return 0;
} | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
int i,b;
char srt[100];
gets(srt);
b=strlen(srt);
for(i=b-1;i>=0;i--)
{
printf("%c",srt[i]);
}
printf("\n");
} | 1 |
#include<iostream>
using namespace std;
int main(void) {
int N;
int a[200];
int count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
while (true) {
bool odd_flag = false;
//奇数かどうかの判定
for (int j = 0; j < N; j++) {
if (a[j] % 2 != 0) {
odd_flag = true;
}
}
//flagがtrueならwhile文を抜ける
if (odd_flag) break;
//実際に2で÷処理をする
for (int k = 0; k < N; k++) {
a[k] /= 2;
}
count++;
}
printf("%d", count);
}
| #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
int n;
cin>>n;
int p[200010];
int ans=0;
int tmp=200010;
rep(i, n){
cin>>p[i];
if(tmp>p[i]) ans++;
tmp=min(tmp,p[i]);
}
cout<<ans<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int num(int N){
int a = 0 , b = 1, c;
for(int i = 0 ; i < 9 ; i++){
a += N / b % 10;
b *= 10;
}
c = N % a;
return c;
}
int main(){
int N;
cin >> N;
if(num(N) == 0){
cout << "Yes" <<endl;
}
else if(num(N) != 0){
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c = s.size();
int p = 0;
int q = 0;
for (int i = 0; i < c; i++){
p *= 10;
p += s.at(i) - '0';
q += s.at(i) - '0';
}
if(p%q==0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
| 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<list>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<ctime>
using namespace std;
const int NIL = -1;
const int MAX = 2147483647;
clock_t START, END;
struct Node {
int l, r, key, lazy;
};
bool debug = false;
Node Tree[500010];
int mark[500010];
int n = 0, N = 1;
void update(int x, int y, int z, int k, int height)
{
if (!mark[k]) {
Tree[k].l = k * (1 << height) - N;
Tree[k].r = min(Tree[k].l + (1 << height) - 1, n - 1);
mark[k] = 1;
}
if (x > y)
return;
if (x <= Tree[k].l && Tree[k].r <= y) {
Tree[k].key = z;
Tree[k].lazy = 1;
return;
}
else if (Tree[k].r < x || Tree[k].l > y) {
return;
}
else {
if (Tree[k].lazy) {
Tree[k].lazy = 0;
Tree[2 * k].key = Tree[2 * k + 1].key = Tree[k].key;
Tree[2 * k].lazy = Tree[2 * k + 1].lazy = 1;
}
update(x, min(Tree[k].l + (1 << (height - 1)) - 1, y), z, 2 * k, height - 1);
update(max(Tree[k].l + (1 << (height - 1)), x), y, z, 2 * k + 1, height - 1);
}
}
int find(int k, int height, int z)
{
if (!mark[k]) {
Tree[k].l = k * (1 << height) - N;
Tree[k].r = min(Tree[k].l + (1 << height) - 1, n - 1);
mark[k] = 1;
}
if (Tree[k].lazy) {
Tree[2 * k].key = Tree[2 * k + 1].key = Tree[k].key;
Tree[2 * k].lazy = Tree[2 * k + 1].lazy = 1;
return Tree[k].key;
}
else {
if (z <= Tree[k].l + (1 << (height - 1)) - 1)
return find(2 * k, height - 1, z);
else
return find(2 * k + 1, height - 1, z);
}
}
int main(void)
{
if (debug) {
START = clock();
freopen("in15.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
int q, com, x, s, t, k, height = 0;
scanf("%d%d", &n, &q);
while (N < n) {
N *= 2;
height++;
}
for (int i = 1; i <= n + N - 1; i++) {
Tree[i].key = MAX;
Tree[i].lazy = 1;
}
for (int i = 0; i < q; i++) {
scanf("%d", &com);
if (com) {
scanf("%d", &k);
printf("%d\n", find(1, height, k));
}
else {
scanf("%d%d%d", &s, &t, &x);
update(s, t, x, 1, height);
}
}
if (debug) {
END = clock();
double endtime = (double)(END - START) / 1000;
printf("total time = %lf s", endtime);
}
return 0;
}
| #include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
struct node{
int num;
node *parent,*left,*right;
};
node *root,*NIL;
node *treemin(node *x){
while(x->left!=NIL)
x=x->left;
return x;
}
node *nextnode(node *x){
if(x->right!=NIL) return treemin(x->right);
node *y=x->parent;
while(y!=NIL && x==y->right){
x=y;
x=y->parent;
}
return y;
}
void denode(node *z){
node *x,*y;
if(z->left==NIL||z->right==NIL) y=z;
else y=nextnode(z);
if(y->left!=NIL) x=y->left;
else x=y->right;
if(x!=NIL) x->parent=y->parent;
if(y->parent==NIL) root=x;
else{
if(y==y->parent->left) y->parent->left=x;
else y->parent->right=x;
}
if(y!=z) z->num=y->num;
// denode(y);
return ;
}
node *find(int a){
node *x=root;
while(x!=NIL){
if(x->num<a) x=x->right;
else if(x->num>a) x=x->left;
else return x;
}
return NIL;
}
void print_inorder(node *x){
if(x==NIL) return ;
print_inorder(x->left);
printf(" %d",x->num);
print_inorder(x->right);
return ;
}
void print_preorder(node *x){
if(x==NIL) return ;
printf(" %d",x->num);
print_preorder(x->left);
print_preorder(x->right);
return ;
}
void insert(int a){
node *x=root,*y=NIL;
node *z=new node();
z->num=a;z->left=NIL;z->right=NIL;
while(x!=NIL){
y=x;
if(z->num < x->num) x=x->left;
else x=x->right;
}
z->parent=y;
if(y==NIL) root=z;
else {
if(z->num < y->num) y->left=z;
else y->right=z;
}
return ;
}
int main(){
int n;
cin>>n;
string s;
node *f;
int a;
for(int i=0;i<n;i++){
cin>>s;
if(s[0]=='i') cin>>a,insert(a);
else if(s[0]=='p'){
print_inorder(root);
printf("\n");
print_preorder(root);
printf("\n");
}
else if(s[0]=='f'){
cin>>a;
f=find(a);
if(f==NIL) printf("no\n");
else printf("yes\n");
}
else{
cin>>a;
denode(find(a));
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char **argv) {
string s;
cin >> s;
cout << s.substr(0, s.length() - 8) << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n;
cin>>n;
ll m=n,sum=0;
while(m>0)
{
sum+=m%10;
m=m/10;
}
// cout<<sum<<endl;
if(n%sum==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin>>n;
vector<ll >v;
vector<ll >vp;
ll i,j,k;
ll a,b;
for(i=0; i<n; i++)
{
cin>>a;
v.push_back(a);
}
for(i=0; i<n; i++)
{
cin>>a;
vp.push_back(a);
}
reverse(vp.begin(),vp.end());
ll f=0;
ll l=0,r=n-1;
for(i=0; i<n; i++)
{
if(v[i]==vp[i])
{
if(v[l]!=vp[i]&&v[i]!=vp[l])
{
// cout<<l<<" f "<<i<<endl;
swap(vp[l],vp[i]);
l++;
}
else if(v[r]!=vp[i]&&v[i]!=vp[r] )
{
// cout<<l<<" s "<<endl;
f=0;
swap(vp[r],vp[i]);
r--;
}
else
{
f=1;
break;
}
}
}
if(f)
{
cout<<"No"<<endl;
}
else
{
cout<< "Yes"<<endl;
for(ll i=0; i<n; i++)
{
cout<<vp[i]<<" ";
}
cout<<endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
char S;
int mix=0;
int a=0;
for(int i=0; i<3;i++){
cin >> S;
if (S=='R'){
a++;
mix=max(a,mix);
} else {
a=0;
}
}
cout << mix << endl;
} | 0 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false) ;
cin.tie(NULL);
int a,b;
cin>>a>>b;
cout<<(2*b)-a<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y; cin >> x >> y;
int ans = 0;
if(x>0){
if(y>0){
if(x>y){
ans++; // x -> -x
ans += abs(x-y); // x -> -y
ans++; // x-> y
}else if(x < y){
ans+= y-x; // x->y
}
}else if(y<0){
if(abs(x) > abs(y)){
ans++; // x->-x
ans+= abs(x) - abs(y); // x->-y
}else if(abs(x) < abs(y)){
ans+= abs(y) - abs(x); // x->y
ans++; // x -> -y
}else{
ans++;
}
}else{
ans++;
ans+= x;
}
}else if(x<0){
if(y>0){
if(abs(x)>abs(y)){
ans += abs(x) -abs(y);
ans++;
}else if(abs(x)<abs(y)){
ans++;
ans += abs(y) - abs(x);
}else{
ans++;
}
}else if(y<0){
if(abs(x)>abs(y)){
ans += abs(x) -abs(y);
}else if(abs(x)<abs(y)){
ans++;
ans += abs(y) - abs(x);
ans++;
}
}else{
ans+=abs(x);
}
}else{
if(y>0) ans+=y;
else if(y<0) ans+= abs(y) + 1;
}
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll h,w,a,b;
cin >> h >> w >> a >> b;
if(h == 1){
for(i = 0;i < a;++i) cout << 0;
for(i = a;i < w;++i) cout << 1;
cout << endl;
return 0;
}else if(w == 1){
for(i = 0;i < b;++i){
cout << 0 << endl;
}
for(i = b;i < h;++i){
cout << 1 << endl;
}
return 0;
}
for(i = 0;i < h;++i){
for(j = 0;j < w;++j){
if(i < b && j < a) cout << 0;
else if(i >= b && j >= a) cout << 0;
else cout << 1;
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
constexpr ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#define RREPS(i,n) for(ll (i)=(n);(i)>0;(i)--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
template<class T> inline void chmin(T& a, T b){
if (a > b){
a = b;
}
}
template<class T> inline void chmax(T& a, T b){
if (a < b){
a = b;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(12);
ll H,W,A,B;
cin >> H >> W >> A >> B;
vector<string> S(H);
REP(i,B){
S[i] = string(A,'0') + string(W-A,'1');
}
REP(i,H-B){
S[B+i] = string(A,'1') + string(W-A,'0');
}
REP(i,H)cout << S[i] << "\n";
} | 1 |
#include <bits/stdc++.h>
#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>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define vv vector< vector< int > >
#define ll long long
#define ALL(a) (a).begin(), (a).end()
const long long mod = 1000000000 + 7;
const long long INF = 9e18;
const double PI = 3.14159265358979323846;
ll gcd(ll a, ll b){if (b == 0) return a;return gcd(b, a % b);}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
int main(){
string S, ans="AC";
cin >> S;
if(S[0] != 'A') ans = "WA";
else {
S[0] = 'a';
string sub;
sub = S.substr(2, S.length()-3);
if(stringcount(sub, 'C') != 1) ans = "WA";
else {
S[S.find('C')] = 'c';
for(char c : S) {
if(!islower(c)) {
ans = "WA";
break;
}
}
}
}
cout << ans << endl;
return 0;
}
| #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define re_ return
ll e[19];
ll DFS(ll n, ll m, char k)
{
// printf("%lld %lld\n", n, m);
n=abs(n);
if(m==-1) re_ !n;
if(!m) re_ n? 0: 10;
int i=n/e[m];
if(i>9) re_ 0;
if((n+i)%10==0)
re_ max(10-i-k, 0)*DFS((n-i*e[m]+i)/10, m-2, 0);
else if((n+i+1)%10==0)
re_ max(10-i-1-k, 0)*DFS((n-(i+1)*e[m]+i+1)/10, m-2, 0);
re_ 0;
}
int main()
{
ll n, i, r=0;
scanf("%lld", &n);
for(i=e[0]=1; i<19; ++i) e[i]=e[i-1]*10;
// printf("%lld\n", e[18]);
for(i=1; i<19; ++i) r+=DFS(n, i, 1);
// DFS(n, 8, 1);
printf("%lld\n", r);
re_ 0;
}
| 0 |
#include<iostream>
#include<string>
using namespace std;
void sort(int card[5])
{
for(int i=0;i<5;i++)
{
int max=i;
for(int j=i+1;j<5;j++)
{
if(card[max]<card[j])
{
max=j;
}
}
int tmp=card[i];
card[i]=card[max];
card[max]=tmp;
}
}
bool fourcard(int card[5])
{
if((card[0]==card[1]&&card[1]==card[2]&&card[2]==card[3])||
(card[1]==card[2]&&card[2]==card[3]&&card[3]==card[4]))
{
return true;
}
else
{
return false;
}
}
bool fullhouse(int card[5])
{
if((card[0]==card[1]&&card[2]==card[3]&&card[3]==card[4])||
(card[0]==card[1]&&card[1]==card[2]&&card[3]==card[4]))
{
return true;
}
else
{
return false;
}
}
bool straight(int card[5])
{
if((card[0]-1==card[1]&&card[1]-1==card[2]&&card[2]-1==card[3]&&card[3]-1==card[4])||
(card[0]==13&&card[1]==12&&card[2]==11&&card[3]==10&&card[4]==1))
{
return true;
}
else
{
return false;
}
}
bool threecard(int card[5])
{
if((card[0]==card[1]&&card[1]==card[2])||
(card[1]==card[2]&&card[2]==card[3])||
(card[2]==card[3]&&card[3]==card[4]))
{
return true;
}
else{
return false;
}
}
bool twopair(int card[5])
{
if((card[0]==card[1]&&card[2]==card[3])||
(card[0]==card[1]&&card[3]==card[4])||
(card[1]==card[2]&&card[3]==card[4]))
{
return true;
}
else return false;
}
bool onepair(int card[5])
{
if(card[0]==card[1]||
card[1]==card[2]||
card[2]==card[3]||
card[3]==card[4])
{
return true;
}
else return false;
}
char *solve(int card[5])
{
sort(card);
if(fourcard(card))
{
return "four card";
}
else if(fullhouse(card))
{
return "full house";
}
else if(straight(card))
{
return "straight";
}
else if(threecard(card))
{
return "three card";
}
else if(twopair(card))
{
return "two pair";
}
else if(onepair(card))
{
return "one pair";
}
else
{
return "null";
}
}
int main(void)
{
int card[5];
char c;
while(cin>>card[0])
{
for(int i=1;i<5;i++)
{
cin>>c>>card[i];
}
cout<<solve(card)<<endl;
}
} |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
typedef vector<int> vi;
typedef pair<int,int> pii;
int main(void) {
int i,j;
int a,b,c,d,e;
while(scanf("%d,%d,%d,%d,%d",&a,&b,&c,&d,&e)!=EOF){
vi v(14,0);
v[a]++;
v[b]++;
v[c]++;
v[d]++;
v[e]++;
bool ans=false;
if(v[1]&&v[10]&&v[11]&&v[12]&&v[13]){
cout<<"straight"<<endl;
ans=true;
}
rep(i,10)
if(v[i]&&v[i+1]&&v[i+2]&&v[i+3]&&v[i+4]){
cout<<"straight"<<endl;
ans=true;
}
if(ans)continue;
int na=0,nb=0,nc=0;
rep(i,14)
if(v[i]==2)na++;
else if(v[i]==3)nb++;
else if(v[i]==4)nc++;
if(nc)cout<<"four card"<<endl;
else if(na&&nb)cout<<"full house"<<endl;
else if(nb)cout<<"three card"<<endl;
else if(na==2)cout<<"two pair"<<endl;
else if(na)cout<<"one pair"<<endl;
else cout<<"null"<<endl;
END:;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b,c) for(ll i=a;i<b;i+=c)
#define r(i,a,b,c) for(ll i=a;i>=b;i-=c)
#define mod 1000000007
int main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
ll n; cin >> n;
ll ar[n];
f(i,0,n,1){
cin >> ar[i];
}
ll c = 0;
sort(ar,ar+n);
f(i,0,n-2,1){
f(j,i+1,n-1,1){
f(k,j+1,n,1){
if(ar[i]+ar[j]>ar[k] && (ar[i]!=ar[j] && ar[j]!=ar[k] && ar[k]!=ar[i]))
c++;
}
}
}
cout << c;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int mn = INT_MAX;
long long res = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n && a[i] < 0) {
a[i + 1] *= -1;
a[i] *= -1;
}
res += abs(a[i]);
mn = min(mn, abs(a[i]));
}
if (a[n - 1] < 0) res -= 2 * mn;
cout << res;
return 0;
} | 0 |
#include<iostream>
#include<string.h>
#include<string>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
#define N
int main()
{
std::ios::sync_with_stdio(false);
long long n,i,j,k;
while(cin>>i>>j>>k)
{
cout<<k<<" "<<i<<" "<<j<<endl;
}
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>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int main(){
int h,w;
cin>>h>>w;
vector<vector<int>> c(h,vector<int>(w));
vector<pair<int,P>> coin;
rep(i,h){
rep(j,w) cin>>c[i][j];
if(i%2==1) reverse(c[i].begin(),c[i].end());
}
rep(i,h)rep(j,w){
if(i%2==0) coin.push_back(make_pair(c[i][j],make_pair(i+1,j+1)));
else coin.push_back(make_pair(c[i][j],make_pair(i+1,w-j)));
}
vector<pair<P,P>> ans;
rep(i,h*w-1){
if(coin[i].first%2 == 1){
coin[i+1].first++;
ans.push_back(make_pair(make_pair(coin[i].second.first,coin[i].second.second),make_pair(coin[i+1].second.first,coin[i+1].second.second)));
}
}
cout<<ans.size()<<endl;
for(auto x : ans){
cout<<x.first.first<<" "<<x.first.second<<" "<<x.second.first<<" "<<x.second.second<<endl;
}
}
| #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 REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
void insertionSort(int array[], int N, int g, int *cnt){
int i,j,v;
for(i = g; i < N; i++){
v = array[i];
j = i - g;
while( j >= 0 && array[j] > v){
array[j+g] = array[j];
j = j - g;
(*cnt)++;
}
array[j+g] = v;
}
return;
}
int main(int argc, const char * argv[]){
//Input
int i, N, value, ans;
int cnt = 0;
scanf("%d", &N);
int *array = NULL;
array = (int*)malloc(sizeof(int) * N);
REP(i, N){
scanf("%d", &value);
array[i] = value;
}
int m;
int G[100];
for( i = 0; i < 100; ++i ){
if( i == 0 ) G[i] = N / 2 + 1;
else G[i] = G[i-1] / 2 - 1;
if( G[i] < 0 ){
G[i-1] = 1;
G[i] = 0;
m = i;
break;
}
}
ans = 0;
for(int i = 0; i < m; i++){
insertionSort(array, N, G[i], &cnt);
}
//print m
printf("%d\n", m);
//print G[]
for(i = 0; i < m; i++){
printf("%d", G[i]);
if(i != m-1){
printf(" ");
}
}
printf("\n");
//print cnt
printf("%d\n", cnt);
REP(i, N){
printf("%d\n", array[i]);
}
return 0;
} | 0 |
#include <iostream>
#include <math.h>
using namespace std;
int fl[10001] = {0};
void isfl(int);
void twlf(int);
int main(void) {
int tag;
while(1){
cin >> tag;
if(tag == 0) break;
isfl(tag);
twlf(tag);
}
return 0;
}
void isfl(int tag){
int i,lim,idx = 2;
fl[0] = 1;
fl[1] = 1;
lim = sqrt(tag);
while(idx <= lim){
if(fl[idx] == 0) for(i = idx*2;i<=tag;i+=idx) fl[i] = 1;
idx++;
}
return;
}
void twlf(int tag){
int k=0,data[10000];
for(int i=1;i<=tag;i++) if(fl[i] == 0){
data[k] = i;
k++;
}
for(int i=k-1;i>=0;i--){
if(data[i] - data[i-1] == 2){
cout << data[i-1] << " " << data[i] << endl;
break;
}
}
return;
} | #include <iostream>
#include <iomanip>
using namespace std;
int main(){
int n;
int i , j;
while(cin >> n, n!=0) {
int arr[10][10]={0,0};
int ansW[11]={0};
int ansH[11]={0};
for(i=0 ; i<n ; i++){
for(j=0 ; j <n ; j++){
cin >>arr[i][j];
}
}
for(i=0 ; i<n ; i++){
for(j=0 ; j<n ; j++){
ansH[i]+=arr[i][j];
}
}
for(i=0 ; i<n ; i++){
for(j=0 ; j<n ; j++){
ansW[i]+=arr[j][i];
}
}
for(i=0 ; i<n ; i++){
for(j=0 ; j<n ; j++){
cout.fill(' ');
cout << setw(5) <<right <<arr[i][j];
}
cout << setw(5) <<right <<ansH[i] << endl;
}
for(i=0; i<n ; i++){
ansW[n]+=ansW[i];
}
for(i=0 ; i<n+1 ; i++){
cout << setw(5) <<right << ansW[i];
}
cout << endl;
}
return 0;
} | 0 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define AB(A) for(A=0;A<100;A++)a[A]=0
int main() {
int n = 0, tmp0 = 0, tmp1 = 0;
int tmp2 = 0, tmp3, out1 = 0, out2 = 0;
int a[100];
scanf("%d", &n);
while (n) {
AB(tmp3);
tmp0 = 0, out2 = 0;
while (tmp0 < n) {
tmp1 = 0, out1 = 0;
while (tmp1 < n) {
scanf("%d", &tmp2);
a[tmp1] += tmp2;
printf("%5d", tmp2);
out1 += tmp2;
tmp1++;
}
printf("%5d\n", out1);
a[tmp1] += out1;
tmp0++;
}
tmp0 = 0;
while (tmp0 < n) {
printf("%5d", a[tmp0]);
tmp0++;
}
printf("%5d\n", a[tmp0]);
scanf("%d", &n);
}
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int matrix[11][11] = {0};
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
cin >>matrix[i][j];
}
}
int suma = 0;
for(int i=0,sumc,sumr; i<n; i++){
sumc = 0;
sumr = 0;
for(int j=0; j<n; j++){
sumc+=matrix[i][j];
sumr+=matrix[j][i];
}
suma+=sumc;
matrix[i][n] = sumc;
matrix[n][i] = sumr;
}
matrix[n][n] = suma;
for(int i=0; i<=n; i++){
for(int j=0; j<=n; j++){
printf("%5d",matrix[i][j]);
}
cout <<endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, l;
cin >> n >> l;
vector<int> d(n);
for (int i = 1; i <= n; i++) {
d[i-1] = l+i-1;
}
int all = 0;
rep(i,n) all += d[i];
int ans = 0;
int mn = 10000;
rep(i,n) {
int dall = all-d[i];
if (abs(all-dall) < mn) {
mn = abs(all-dall);
ans = dall;
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
FastRead
//freopen("output.txt", "w", stdout);
int n,k;
cin>>n>>k;
if(n%k==0)
cout<<"0"<<endl;
else
cout<<"1"<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T,vector<T>,greater<T>>
#define vecunique(vec) sort(vec.begin(), vec.end());decltype(vec)::iterator result = std::unique(vec.begin(), vec.end());vec.erase(result, vec.end())
using namespace std;
template<class T> inline void chmax(T& a, T b) { a = max(a, b); }
template<class T> inline void chmin(T& a, T b) { a = min(a, b); }
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)return false;
}
return x > 1;
}
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
int lcm(int x, int y) {
return x / gcd(x, y) * y;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i; res %= mod;
}
return res;
}
int mod_pow(int x, int y) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % mod;
}
x = x * x % mod;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2) % mod;
}
/*--------Library Zone!--------*/
int n; string s;
vector<pair<string, string>>le, ri;
signed main() {
cin >> n >> s;
rep(i, 1 << n) {
string p = "", q = "", r = "", u = "";
rep(j, n) {
if (i >> j & 1) {
p += s[j]; r += s[n + j];
}
else {
q += s[j]; u += s[n + j];
}
}
le.push_back({ p,q });
ri.push_back({ r,u });
}
sort(all(ri));
int ans = 0;
for (auto p : le) {
string red = p.first, blue = p.second;
reverse(all(red)); reverse(all(blue));
int index = upper_bound(all(ri), mkp(blue, red)) - lower_bound(all(ri), mkp(blue, red));
ans += index;
}
cout << ans << endl;
}
| #include<iostream>
#include<iomanip>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<string>
#include<bitset>
#include<memory>
using namespace std;
using ll=long long;
const int SIZE=17;
const int MOD=1e9+7;
inline void add(int &lhs,int rhs){
lhs=(lhs+rhs);
if(lhs>=MOD) lhs-=MOD;
}
int dp[41][1<<SIZE];
int isAccept[1<<SIZE];
int mypow10[40];
int main(){
int n;
cin>>n;
int xyz[3];
for(int i=0;i<3;i++) cin>>xyz[i];
dp[0][(1<<SIZE)-1]=1;
for(int bit=0;bit<(1<<SIZE);bit++){
int st=0;
int buf=0;
for(int i=0;i<SIZE;i++){
buf++;
if(!((bit>>i)&1) && xyz[st]==buf){
st++;
buf=0;
if(st==3){
isAccept[bit]=true;
break;
}
}
}
}
mypow10[0]=1;
for(int i=0;i+1<n;i++) mypow10[i+1]=ll(mypow10[i])*10%MOD;
int res=0;
int mask=(1<<SIZE)-1;
for(int i=0;i<n;i++){
res=res*10LL%MOD;
for(int bit=0;bit<(1<<SIZE);bit++){
if(dp[i][bit]==0) continue;
for(int v=1;v<=7;v++){
int nex=(bit<<v)+(1<<(v-1))-1;
nex&=mask;
add(dp[i+1][nex],dp[i][bit]);
}
add(dp[i+1][mask],dp[i][bit]);
add(dp[i+1][mask],dp[i][bit]);
add(dp[i+1][mask],dp[i][bit]);
}
for(int bit=0;bit<(1<<SIZE);bit++){
if(isAccept[bit]){
add(res,dp[i+1][bit]);
dp[i+1][bit]=0;
}
}
}
cout<<res<<endl;
return 0;
}
| 0 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
template <class T>
using vec = vector<T>;
template <class T>
using vec2 = vector<vec<T>>;
template <class T>
using vec3 = vector<vec2<T>>;
constexpr int INF = numeric_limits<int>::max();
constexpr ll INFL = numeric_limits<ll>::max();
//constexpr ll MOD = 1000000007; // 10^9+7
constexpr ll MOD = 998244353;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
template <class T>
bool chmax(T &a, const T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <class T>
bool chmin(T &a, const T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
vector<long long> fac, finv, inv;
// テーブルを作る前処理
void COMinit(int max)
{
fac.resize(max);
finv.resize(max);
inv.resize(max);
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 modpow(ll x, ll n, const ll &mod)
{
ll ret = 1;
while (n > 0)
{
if (n & 1)
{
(ret *= x) %= mod;
}
(x *= x) %= mod;
n >>= 1;
}
return ret;
}
ll N, M, K;
ll solve()
{
ll ret = 0;
for (int k = 0; k <= K; ++k)
{
ll a = 1;
a *= M;
a %= MOD;
a *= modpow(M - 1, N - 1 - k, MOD);
a %= MOD;
a *= COM(N - 1, k);
a %= MOD;
ret += a;
ret %= MOD;
}
return ret;
}
int main()
{
COMinit(2 * 100000);
cin >> N >> M >> K;
cout << solve() << endl;
return 0;
}
| #include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define MOD 998244353
#define INIT -1
long long int fact[200010] = {};
long long int mypow(long long int x, long long int n)
{
if (n == 0)
return 1;
long long int tmp = mypow(x, n / 2);
long long int res = (tmp * tmp) % MOD;
if (n % 2 == 1)
res = (res * x) % MOD;
return res;
}
long long int comb(int n, int r)
{
long long int res = fact[n];
res = (res * mypow(fact[r], MOD - 2)) % MOD;
res = (res * mypow(fact[n - r], MOD - 2)) % MOD;
return res;
}
int main()
{
long long int n, m, k;
cin >> n >> m >> k;
fact[0] = 1;
for (int i = 1; i <= n - 1; i++)
{
fact[i] = (fact[i - 1] * i) % MOD;
}
long long int ans = 0;
for (int i = 0; i <= k; i++)
{
ans += (m * ((comb(n - 1, i) * mypow(m - 1, n - 1 - i)) % MOD)) % MOD;
ans %= MOD;
}
cout << ans << endl;
} | 1 |
//Tanzim bin nasir
#include<bits/stdc++.h>
typedef long long ll;
#define ff first
#define ss second
using namespace std;
void fast()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
ll gcd(ll a,ll b)
{
if(b==0)
return a;
else
gcd(b,a%b);
}
ll lcd(ll a,ll b)
{
return (a*b)/gcd(a,b);
}
int main()
{
int n,ans=1,mn,temp;
cin>>n>>mn;
for(int i=1;i<n;i++)
{
cin>>temp;
if(temp<=mn)
{
mn=temp;
++ans;
}
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll n;
cin >> n;
int m, p;
ll ans = 0;
m = 1e6;
rep(i, n) {
cin >> p;
if (m >= p) {
ans++;
}
m = min(m, p);
}
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
bool is_sum (vector<int> s, int n){
if(s.size() == 1) {
if(s.at(0) == n) return true;
else return false;
}
else{
int a = s.at(s.size()-1);
s.pop_back();
if(is_sum(s,n+a) || is_sum(s,n-a)) return true;
else return false;
}
}
vector<string> cal_sum (vector<int> s, int n){
if(s.size() == 1) return {};
else{
int a = s.at(s.size()-1);
s.pop_back();
if(is_sum(s,n-a)){
vector<string> v = cal_sum(s,n-a);
v.push_back("+");
return v;
}
if(is_sum(s,n+a)){
vector<string> v = cal_sum(s,n+a);
v.push_back("-");
return v;
}
}
}
int main(){
string s ;
cin >> s;
vector<int> v(s.size());
for (int i = 0; i < s.size(); i++)
{
v.at(i) = s.at(i) -48;
}
vector<string> sign = cal_sum(v,7);
cout << s.at(0);
for (int i = 1; i < 4; i++)
{
cout << sign.at(i-1) << v.at(i) ;
}
cout << "=7" << endl;
} | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <iostream>
#include <bitset>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <list>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array)/sizeof(array[0]))
using namespace std;
void solve(){
string s;
cin >> s;
for (int bit=0; bit<(1<<3); bit++) {
string ans = s.substr(0,1);
int result = s.at(0) - '0';
for (int i=0; i<3; i++) {
if (bit>>i&1) {
// iビット目が1なら+演算する
result += s.at(i+1)-'0';
ans += "+";
}
else {
// iビット目が0なら-演算する
result -= s.at(i+1)-'0';
ans += "-";
}
ans.push_back(s.at(i+1));
}
if (result == 7) {
cout << ans << "=7" << endl;
return;
}
}
}
int main(int argc, char const *argv[]){
solve();
return 0;
} | 1 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <time.h>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <string.h>
#define sf scanf
#define pf printf
#define lf double
#define ll long long
#define p123 printf("123\n");
#define pn printf("\n");
#define pk printf(" ");
#define p(n) printf("%d",n);
#define pln(n) printf("%d\n",n);
#define s(n) scanf("%d",&n);
#define ss(n) scanf("%s",n);
#define ps(n) printf("%s",n);
#define sld(n) scanf("%lld",&n);
#define pld(n) printf("%lld",n);
#define slf(n) scanf("%lf",&n);
#define plf(n) printf("%lf",n);
#define sc(n) scanf("%c",&n);
#define pc(n) printf("%c",n);
#define gc getchar();
#define re(n,a) memset(n,a,sizeof(n));
#define len(a) strlen(a)
using namespace std;
//https://codeforces.com/contest/1213/problems
//https://codeforces.com/contest/1213/submit
ll a[100];
int main(){
ll n;
sld(n)
re(a,0ll);
for(int i = 0ll; i < 50ll; i ++){
a[i] = 49ll;
}
ll count0 = n/50ll;
ll count1 = n%50ll;
for(int i = 0; i < 50; i ++){
a[i] += count0;
}
for(int i = 0; i < count1; i ++){
a[i] += 50ll;
for(int j = 0; j < 50; j ++){
if(i == j){
}else{
a[j] --;
}
}
}
pld(50ll) pn
for(int i = 0; i < 49; i ++){
pld(a[i]) pk
}
pld(a[49]) pn
return 0;
}
| #include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#include <deque>
#include <list>
#include <stack>
#include <queue>
using namespace std;
class MCMult
{
public:
vector<vector<int>> mat;
int solve();
};
int MCMult::solve()
{
int ms = mat.size();
vector<vector<int>> dp(ms, vector<int>(ms, 0));
for ( auto i = 0; i < ms - 1; ++i )
dp[i][i+1] = mat[i][0] * mat[i][1] * mat[i+1][1];
for ( auto k = 2; k < ms; ++k )
{
for ( auto i = 0; i + k < ms; ++i )
{
int ret = dp[i+1][i+k] + mat[i][0] * mat[i][1] * mat[i+k][1];
ret = min( ret, dp[i][i+k-1] + mat[i+k][0] * mat[i+k][1] * mat[i][0]);
for ( auto j = i + 1; j < i + k - 1; ++j )
{
ret = min( ret, dp[i][j] + dp[j+1][i+k] + mat[i][0] * mat[j][1] * mat[i+k][1]);
}
dp[i][i+k] = ret;
}
}
cout << dp[0][ms-1] << endl;
return 0;
}
int main()
{
int n;
cin >> n;
MCMult m;
for ( int i = 0; i < n; ++i )
{
int x;
vector<int> v;
cin >> x;
v.push_back( x );
cin >> x;
v.push_back( x );
m.mat.push_back( v );
}
m.solve();
return 0;
} | 0 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14159265358979323846
#define int64 long long
#define uint64 unsigned long long
#define coutfix(i) cout << fixed << setprecision(i) //coutの浮動小数出力の桁数設定
using namespace std;
int main()
{
int64 aa, bb, ans = 1, tmp1, tmp2;
cin >> aa >> bb;
tmp1 = tmp2 = gcd(aa, bb);
for(int64 ii = 2;ii * ii <= tmp2;ii++)
{
if(tmp1 % ii == 0)
{
ans++;
while(tmp1 % ii == 0)
{
tmp1 /= ii;
}
}
}
if(tmp1 != 1)
{
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int R;
int G;
//Rは現在のレート,Gは取るべき点数
//R,Gで入力を受け取る
cin>> R;
cin>> G;
cout << (G*2)-R << endl;
}
| 0 |
//include
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
//using
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
using vvl = vector<vector<ll> >;
//vector<vector<char> > hyou(N, vector<char>(N));
using vd = vector <double>;
//define
//#define int long long
#define rep(i,n) for(int i=0; i<n; i++)
#define print(n) cout<<n<<endl;
#define sortp(d) sort(d.begin(),d.end()) //1234
#define sortm(d) sort(d.rbegin(),d.rend()) //4321
//素数判定 O(√A)
bool is_prime(int x){
if(x<=1) return false;
for(int i=2;i*i<=x;i++)
if(x%i==0) return false;
return true;
}
/*順列生成
do {
// 順列に対する処理
} while (next_permutation(配列変数.begin(), 配列変数.end()));*/
//絶対値 abs()
//文字→数字 '0' アルファベット→数字 'a' 'A'が65番,'a'が97番だわ
//型キャスト char('a'+1)
//グローバル変数宣言
ll p=0,q=0;//r=0;
int main()
{
ll n,m;
cin>>n>>m;
vl l(m),r(m);
q=n;
rep(i,m){cin>>l[i]>>r[i];p=max(p,l[i]);q=min(q,r[i]);}
ll a=0;
a=max(a,q-p+1);
print(a)
} | #include <stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
const int MAXN=1000005;
vector <int> adj[MAXN];
int prof[MAXN],low[MAXN],padre[MAXN],cont,N,M,root;
bool usa[MAXN],ap[MAXN];
void articulationPoints(int v){
int child=0;
usa[v]=true;
low[v]=prof[v]=++cont;
for (int i=0; i<(int)adj[v].size(); i++){
int w=adj[v][i];
if (!usa[w]){
child++;
padre[w]=v;
articulationPoints(w);
low[v]=min(low[v],low[w]);
if (padre[v]==-1 && child>1) ap[v]=true;
if (padre[v]!=-1 && low[w]>=prof[v]) ap[v]=true;
} else if(w!=padre[v]) low[v]=min(low[v],prof[w]);
}
}
int main()
{
scanf("%d%d",&N,&M);
int a,b;
for (int i=0; i<M; i++){
scanf("%d%d",&a,&b);
adj[a].push_back(b); adj[b].push_back(a);
}
fill(padre,padre+N,-1);
articulationPoints(0);
for (int i=0; i<N; i++)
if (ap[i])printf("%d\n",i);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const int INF=1001001001;
const int mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
ll ans=0;
const int l=20;
vi dep;
vvi table;
vvi g;
void dfs0(int i,int p,int d){
table[i][0]=p;
dep[i]=d;
for(ll x:g[i])if(x!=p)dfs0(x,i,d+1);
}
void init(ll n){
g=vvi(n);
dep=vi(n);
table=vvi(n,vi(l,-1));
rep(i,n-1){
ll a;cin>>a;a--;
g[a].pb(i+1);
g[i+1].pb(a);
}
dfs0(0,-1,0);
}
vb done;
void dfs(int i){
done[i]=true;
for(ll x:g[i])if(x!=table[i][0]){
if(!done[x])dfs(x);
}
}
int main(){
ll n,k,t;cin>>n>>k>>t;
if(t!=1)ans++;
if(k==1){
rep(i,n-1){
ll a;cin>>a;if(a!=1)ans++;
}
dame(ans);
}
init(n);
REP(i,1,l){
rep(j,n){
ll id=table[j][i-1];
if(id!=-1)table[j][i]=table[id][i-1];
}
}
k--;
vp v(n);
rep(i,n)v[i]=P(dep[i],i);
sort(all(v));reverse(all(v));
done=vb(n,false);
rep(tt,n){
ll i=v[tt].se;
if(dep[i]<=k+1)break;
if(done[i])continue;
ll w=i;
rep(j,l)if(k>>j&1)w=table[w][j];
ans++;
dfs(w);
}
out(ans);
} | #include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 1e5 + 5;
int K, ans;
int par [MAX_N];
vector<int> adj [MAX_N];
int subh [MAX_N];
int del [MAX_N];
void dfs (int u) {
subh[u] = 0;
for (int nxt : adj[u]) {
dfs(nxt);
if (!del[nxt]) {
subh[u] = max(subh[u], 1 + subh[nxt]);
}
}
if (u != 1 && subh[u] == K - 1 && par[u] != 1) {
del[u] = 1;
ans++;
}
}
int main () {
ios::sync_with_stdio(false);
int n;
cin >> n >> K;
for (int i = 1; i <= n; i++) {
cin >> par[i];
}
if (par[1] != 1) ans++;
for (int i = 2; i <= n; i++) {
adj[par[i]].push_back(i);
}
dfs(1);
cout << ans << endl;
}
| 1 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
int main(){
string s1,s2;
cin >> s1 >> s2;
vector<vector<int>> dp(s1.size()+1,vector<int>(s2.size()+1,0));
REP(i,s1.size()+1)dp[i][0] = i;
REP(i,s2.size()+1)dp[0][i] = i;
REP(i,s1.size()){
REP(j,s2.size()){
int tmp = 1;
if(s1[i] == s2[j])tmp = 0;
dp[i+1][j+1] = min(dp[i][j] + tmp, min(dp[i][j+1],dp[i+1][j])+1);
}
}
cout << dp[s1.size()][s2.size()] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i,k,n) for(int i = k; i < n; i++)
#define mmax(start, end) *max_element(start, end)
#define mmin(start, end) *min_element(start, end)
#define argmax max_element
#define argmin min_element
#define push push_back
#define pop pop_back
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef string str;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
template<class T = ll> T in() {
T _in;
cin >> _in;
return _in;
}
int dp[1001][1001];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s[2];
int len[2];
rep(i, 2) {
cin >> s[i];
len[i] = s[i].size();
}
// 表埋め
rep(i, len[0]+1) {
dp[i][0] = i;
}
rep(j, len[1]+1) {
dp[0][j] = j;
}
REP(i, 1, len[0]+1) {
REP(j, 1, len[1]+1) {
// if(i==2 && j==1) {
// cout << s[0][i-1] << " " << s[1][j-1] << endl;
// }
int top_left = dp[i-1][j-1];
if(s[0][i-1] != s[1][j-1]) {
top_left++;
}
int top = dp[i-1][j] + 1;
int left = dp[i][j-1] + 1;
dp[i][j] = min(top, min(top_left, left));
}
}
// rep(i, len[0]+1) {
// rep(j, len[1]+1) {
// cout << dp[i][j] << " ";
// }
// cout << endl;
// }
// cout << endl;
cout << dp[len[0]][len[1]] << endl;
return 0;
}
| 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
#define ve vector
#define pint pair<int,int>
const int INF = 1000000007;
const long double EPS = 1e-15;
const long double PI = acos(-1);
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
// *max_element(all(d))
int solve(){
int n;
cin >> n;
cout << 0 << endl;
string f;
cin >> f;
int l = 0,r = n;
if(f!="Vacant")while(1){
int m = (l + r) / 2;
cout << m << endl;
string s;
cin >> s;
if(s == "Vacant")break;
if(m % 2 && s != f || m % 2 == 0 && s == f)l = m + 1;
else r = m;
}
return 0;
}
int main(){
// ios::sync_with_stdio(false);cin.tie(nullptr);
cout << fixed;cout << setprecision(16);
solve();
return 0;
} | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include<cmath>
#include<limits>
#define ll long long
#define ALL(x) (x).begin(),(x).end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define int_INF 2147483647
#define pint_INF 2000000000
#define ll_INF 9223372036854775807
#define MOD 1000000007
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define sysp system("PAUSE")
using namespace std;
int Getinput(){
string s; cin >> s;
if(s == "Vacant") return 0;
else if(s == "Male") return 1;
else if(s == "Female") return 2;
}
int main(){
int N; cin >> N;
cout << N - 1 << endl;
if(Getinput() == 0){
return 0;
}
cout << 0 << endl;
int x = Getinput();
if(x == 0){
return 0;
}
int low = 0,high = N - 1;
int stnd = x;
while(high - low > 2){
int mid = (high + low) / 2;
if(mid % 2 == 1) mid--;
cout << mid << endl;
int y = Getinput();
if(y == 0){
return 0;
}else if(stnd == y){
low = mid;
}else{
high = mid;
}
}
cout << low + 1 << endl;
int z = Getinput();
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
template<typename T>
void cout_vec(vector<T> &vec){
for(int i=0; i<vec.size(); i++){
if (i!=0){
cout << ' ';
}
cout << vec[i];
}
cout << endl;
}
template<typename T>
void cout_mat(vector<vector<T> > &mat){
for(int i=0; i<mat.size(); i++){
vector<T> vec = mat[i];
cout_vec(mat[i]);
}
}
int main(){
int H, W;
cin >> H >> W;
vector<vector<int>> grid(H,vector<int>(W,0));
for(auto &line:grid){
for(auto &a:line){
cin >> a;
}
}
for(auto &line:grid){
for(auto &a:line){
int x;
cin >> x;
a-=x;
}
}
int N=160*160;
vector<vector<vector<int>>> dp(H+1,vector<vector<int>>(W+1,vector<int>(N+1,0)));
dp[0][0][N/2]=1;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
int diff=grid[i][j];
for(int k=0; k<=N; k++){
if(0<=k+diff && k+diff<=N){
dp[i+1][j][k+diff]|=dp[i][j][k];
dp[i][j+1][k+diff]|=dp[i][j][k];
}
if(0<=k-diff && k-diff<=N){
dp[i][j+1][k-diff]|=dp[i][j][k];
dp[i+1][j][k-diff]|=dp[i][j][k];
}
}
}
}
for(int i=0; i<N; i++){
if(dp[H][W-1][N/2-i] || dp[H][W-1][N/2+i]){
cout << i << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
const ll d[2][2] = {{0, 1}, {1, 0}};
const ll MAXV = 80 * (80 + 80);
ll h, w;
cin >> h >> w;
vector<vector<ll>> a(h, vector<ll>(w)), b(h, vector<ll>(w));
rep(i, h) rep(j, w) cin >> a[i][j];
rep(i, h) rep(j, w) cin >> b[i][j];
vector<vector<vector<bool>>> dp(h, vector<vector<bool>>(w, vector<bool>(MAXV + 1, false)));
dp[0][0][abs(a[0][0] - b[0][0])] = true;
queue<pair<ll, ll>> q;
q.push(make_pair(0, 0));
vector<vector<bool>> seen(h, vector<bool>(w, false));
seen[0][0] = true;
while(!q.empty()) {
pair<ll, ll> p = q.front(); q.pop();
ll x = p.second, y = p.first;
rep(i, 2) {
ll nx = x + d[i][1];
ll ny = y + d[i][0];
if ((nx >= w) || (ny >= h)) continue;
rep(j, MAXV + 1) {
if (!dp[y][x][j]) continue;
dp[ny][nx][j + abs(a[ny][nx] - b[ny][nx])] = true;
dp[ny][nx][abs(j - abs(a[ny][nx] - b[ny][nx]))] = true;
}
if (!seen[ny][nx]) {
seen[ny][nx] = true;
q.push(make_pair(ny, nx));
}
}
}
ll ans = LONG_LONG_MAX;
rep(i, MAXV + 1) {
if (dp[h - 1][w - 1][i]) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
void Input(int*,int*);
int Calc(int*,int*);
void Output(int*,int*,int*);
int main(int argc,char* argv[]){
int n,count=0;
int arr[100];
Input(&n,arr);
count=Calc(&n,arr);
Output(&n,&count,arr);
return 0;
}
void Input(int* pn,int *arr){
cin>>*pn;
for(int i=0;i<*pn;i++){
cin>>*arr++;
}
}
int Calc(int* pn,int* arr){
int count=0;
for(int i=0;i<*pn;i++){
for(int j=*pn-1;j>i;j--){
if(arr[j]<arr[j-1]){
swap(arr[j],arr[j-1]);
count++;
}
}
}
return count;
}
void Output(int* pn,int* pcount,int* arr){
printf("%d",*arr++);
for(int i=1;i<*pn;i++)
printf(" %d",*arr++);
puts("");
printf("%d\n",*pcount);
} | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<eps)
const int MAX=100000;
const int geta=100;
struct BIT
{
int bit[MAX+1];
void add(int i,int x)
{
while(i<=MAX)
{
bit[i]+=x;
i+=i&-i;
}
}
int sum(int i)
{
int res=0;
while(i>0)
{
res+=bit[i];
i-=i&-i;
}
return res;
}
};
BIT bit;
int N,a[105];
int main()
{
scanf("%d",&N);
for(int i=0;i<N;i++)
{
scanf("%d",&a[i]);
a[i]+=geta;
}
int ans=0;
for(int i=0;i<N;i++)
{
ans+=bit.sum(a[i]);
bit.add(a[i],1);
}
sort(a,a+N);
for(int i=0;i<N;i++)printf("%d%c",a[i]-geta,(i==N-1)?'\n':' ');
printf("%d\n",N*(N-1)/2-ans);
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
int ans=1;
rep(i,n){
if(ans<k)ans*=2;
else ans+=k;
}
cout << ans;
return 0;
} | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
ll N, K;
ll solve(ll N);
int main()
{
cin >> N >> K;
cout << solve(N) << endl;
}
ll solve(ll N)
{
if (N == 1)
{
return 2;
}
return min(solve(N - 1) * 2, solve(N - 1) + K);
} | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename A,typename B>inline bool chmin(A &a,const B &b){if(a>b){a=b;return true;}else{return false;}}
template<typename A,typename B>inline bool chmax(A &a,const B &b){if(a<b){a=b;return true;}else{return false;}}
const ll INF = 1LL << 60;
const ll MOD = 1e9+7;
int main()
{
string A,B,C;
cin >> A >> B >> C;
queue<char> qA,qB,qC;
for(auto a:A){
qA.push(a);
}
for(auto b:B){
qB.push(b);
}
for(auto c:C){
qC.push(c);
}
bool flag = true;
char now = qA.front();
qA.pop();
string ans;
while(flag){
switch(now){
case 'a':
if(qA.empty()){
ans = "A";
flag = false;
}else{
now = qA.front();
qA.pop();
}
break;
case 'b':
if(qB.empty()){
ans = "B";
flag = false;
}else{
now = qB.front();
qB.pop();
}
break;
case 'c':
if(qC.empty()){
ans = "C";
flag = false;
}else{
now = qC.front();
qC.pop();
}
break;
default:
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fill(x,v) memset(x,v,sizeof(x))
#define all(x) (x).begin(), (x).end()
#define trace(x) cerr << #x <<": " << x << endl
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
const int MAX = 3002;
const ll INF = 1LL<<62;
bool exist[30];
vi mayor, menor;
void solve(){
ll n, k;
cin >> n >> k;
ll on = 0, a;
rep(i,0,n){
cin >> a;
if(a < 0) menor.pb(a);
if(a > 0) mayor.pb(a);
if(a == 0) on = 1;
}
ll sobra = k - on;
ll rpta = 0;
if(sobra){
reverse(all(menor));
ll aux = INF;
int j;
ll aux1, aux2;
for(int i = 0; i <= min(sobra, ll(mayor.size())); i++){
j = sobra - i;
if(j > menor.size()) continue;
aux1 = 0;
aux2 = 0;
if(i) aux1 = mayor[i-1];
if(j) aux2 = menor[j-1]*-1;
if(aux1 > aux2) swap(aux1, aux2);
aux = min(aux, aux1+aux1+aux2);
}
rpta += aux;
}
cout << rpta << endl;
}
int main(){
fastio;
int t = 1;
//cin >> t;
while(t--) solve();
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main()
{
int m[50],d[50];
int x = 0;
string Day[7] = {"Thursday", "Friday","Saturday","Sunday","Monday", "Tuesday", "Wednesday"};
int BanyakHari[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
string ThatDayIs[50];
do
{
int DayinBetween = 0;
cin >> m[x] >> d[x];
if((m[x] == 0) && (d[x] == 0))
{
break;
}
//Check banyak hari antara 1 Januari - Input
for(int y = 0; y < m[x]-1; y++)
{
DayinBetween = DayinBetween + BanyakHari[y];
}
DayinBetween = (DayinBetween + d[x] - 1)%7;
ThatDayIs[x] = Day[DayinBetween];
x++;
}
while(x < 50);
for(int z = 0; z < x; z++)
{
cout << ThatDayIs[z] << endl;
}
} | #include <iostream>
#include <map>
#include <vector>
using namespace std;
void getDays(int month, int day)
{
int dayNum[12] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int fst=0; // 1/1 ?????? (month-1)??????????????\?????§?????\??°
for(int i=0; i<month-1; i++)
fst += dayNum[i];
fst += day; // month???1??\?????§?????\??°
switch(fst % 7) {
case 0:
cout << "Wednesday" << endl;
break;
case 1:
cout << "Thursday" << endl;
break;
case 2:
cout << "Friday" << endl;
break;
case 3:
cout << "Saturday" << endl;
break;
case 4:
cout << "Sunday" << endl;
break;
case 5:
cout << "Monday" << endl;
break;
case 6:
cout << "Tuesday" << endl;
break;
default:
break;
}
}
int main(void)
{
ios::sync_with_stdio(false);
int month, day;
while(1) {
cin >> month >> day;
if(month == 0) break;
getDays(month, day);
}
return 0;
} | 1 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)
#define all(i,n) (i),(i+n)
int dx4[4]={1,0,-1,0};
int dy4[4]={0,-1,0,1};
int dx8[8]={1,0,-1,1,-1,1,0,-1};
int dy8[8]={1,1,1,0,0,-1,-1,-1};
int dx9[9]={0,1,0,-1,1,-1,1,0,-1};
int dy9[9]={0,1,1,1,0,0,-1,-1,-1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6+1;
const ll mod = 1000000007;
// << fixed << setprecision
// --------------------------------------
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vector<ll> a(n);
int c = 0;
ll sum = 0;
REP(i, n) {
cin >> a[i];
sum += abs(a[i]);
if(a[i] < 0) c++;
}
if(c % 2 == 1) {
ll mi = INF;
REP(i, n) {
mi = min(abs(a[i]), mi);
}
sum -= (mi * 2);
}
cout << sum << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define sc1(a) scanf("%d",&a)
int main(){
bool f=0;
int n;
long long a,b=0ll,x=2e9;
sc1(n);
rep(i,n){
scanf("%lld",&a);
if (a<0) f=f^1;
b+=abs(a);
x=min(x,abs(a));
}
printf("%lld\n",f?b-x*2:b);
return 0;
}
| 1 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = pair<P,ll>;
using PQ = priority_queue<P,vector<P>,greater<P>>;
signed main(){
ll x,y;
cin >> x >> y;
if(x < 0 && y < 0){
if(x > y){
cout << 2 + x - y << endl;
}
else{
cout << y - x << endl;
}
}
else if(x < 0 && y >= 0){
if(y == 0){
cout << abs(x) << endl;
}
else{
cout << 1 + abs(abs(x) - abs(y)) << endl;
}
}
else if(x >= 0 && y < 0){
if(x == 0){
cout << 1 + abs(y) << endl;
}
else{
cout << 1 + abs(abs(x) - abs(y)) << endl;
}
}
else{
if(y == 0){
cout << 1 + x << endl;
}
else if(x <= y){
cout << y - x << endl;
}
else{
cout << 2 + x - y << endl;
}
}
return 0;
}
| #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
map<int,int>dis;
map<int,vector<pair<int,int> > >mm;
void bfs(int ver)
{
priority_queue<pair<int,int> ,vector<pair<int,int> >,greater<pair<int,int>> >qq;
qq.push({0,ver});
while (!qq.empty())
{
pair<int,int>pp=qq.top();
qq.pop();
for(auto i:mm[pp.second])
{
if(dis[i.first]>pp.first+i.second)
{
dis[i.first]=pp.first+i.second;
qq.push({dis[i.first],i.first});
}
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
int x,y;
cin>>x>>y;
mm[x].push_back({-x,1});
mm[-x].push_back({x,1});
mm[y].push_back({-y,1});
mm[-y].push_back({y,1});
int arr[4];
arr[0]=x;
arr[1]=-x;
arr[2]=-y;
arr[3]=y;
for(int i=0;i<4;i++)
{
dis[arr[i]]=1e17;
for(int j=0;j<4;j++)
{
if(arr[j]>arr[i])
mm[arr[i]].push_back({arr[j],arr[j]-arr[i]});
}
}
dis[x]=0;
bfs(x);
cout<<dis[y];
}
| 1 |
#include<stdio.h>
int main(){
int a,b,x,y,kurang;
scanf("%d %d %d %d %d", &a,&b,&x,&y,&kurang);
int temp=((x*60)+y)-((a*60)+b);
printf("%d\n", temp-kurang);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
# define rep(i,n) for(int i=0;i<n;i++)
void solve(){
int n;
cin>>n;
int a[n];
rep(i,n)
cin>>a[i];
lli sum=0;
for(int i=1;i<n;i++){
if(a[i-1]>a[i]){
sum+=(a[i-1]-a[i]);
a[i]=a[i-1];
}
}
cout<<sum<<endl;
}
int main()
{
int t;
// cin>>t;
t=1;
while(t--){
solve();
}
} | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read() {
int res=0,fh=1;
char ch=getchar();
while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
if(ch=='-')fh=-1,ch=getchar();
while(ch>='0'&&ch<='9')res=res*10+ch-'0',ch=getchar();
return fh*res;
}
const int maxn=4000010;
const int mod=1e9+7;
int fac[maxn],inv[maxn];
inline int fpw(int x,int a){
int ans=1;
while(a){
if(a&1) (ans*=x)%=mod;
(x*=x)%=mod;
a>>=1;
}
return ans;
}
inline int C(int n,int m){
return (((fac[m]*inv[n])%mod)*inv[m-n])%mod;
}
#define LL int
#define inv_fac inv
#define Mod mod
#define re register
#define Maxn maxn
inline void pre(){
fac[0]=1;
for(int i=1;i<maxn;i++)
fac[i]=(fac[i-1]*i)%mod;
inv[maxn-1]=fpw(fac[maxn-1],mod-2);
for(int i=maxn-2;i>=0;i--)
inv[i]=(inv[i+1]*(i+1))%mod;
}
int n,k;
int f[2010][2010];
//f[i][j] 表示在这些位置上已经放了i个白球，j种其他颜色的球。(i<j)
signed main(){
n=read();if((k=read())==1) return puts("1"),0;
pre();
memset(f,0,sizeof f);f[0][0]=1;
for(int i=1;i<=n;i++){
for(int j=0;j<=i;j++){
f[i][j]=f[i-1][j];
if(!j) continue;
(f[i][j]+=f[i][j-1]*(n-j+1)%mod*C(k-2,n-i+(n-j+1)*(k-1)%mod-1)%mod)%=mod;
}
}
return printf("%lld",f[n][n]%mod),0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e6 + 10, M = 2e3 + 10, MOD = 1e9 + 7;
int fac[N], inv[N], dp[M][M], ps[M][M];
int sum(int a, int b) {return (a + b) % MOD;}
int mul(int a, int b) {return (a * b) % MOD;}
int Pow(int a, int b)
{
int res = 1;
for (; b; b>>=1, a = mul(a, a)) if (b & 1) res = mul(res, a);
return res;
}
int C(int n, int k)
{
if (k < 0 || n < 0 || k > n) return 0;
return mul(fac[n], mul(inv[k], inv[n - k]));
}
int32_t main()
{
fac[0] = 1;
for (int i = 1; i < N; i++) fac[i] = mul(fac[i - 1], i);
inv[N - 1] = Pow(fac[N - 1], MOD - 2);
for (int i = N - 2; i >= 0; i--) inv[i] = mul(inv[i + 1], i + 1);
int n, k; cin >> n >> k;
if (k == 1) return cout << "1\n", 0;
ps[1][1] = dp[1][1] = 1;
for (int i = 2; i <= n; i++) {
dp[i][1] = mul(ps[i - 1][1], C(i * k - 2, k - 2));
for (int j = 2; j <= i; j++) {
dp[i][j] = mul(ps[i - 1][j - 1], C(i * k - j - 1, k - 2));
}
for (int j = i; j >= 1; j--) ps[i][j] = sum(ps[i][j + 1], dp[i][j]);
}
cout << mul(ps[n][1], fac[n]) << "\n";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i=0; i<N; i++) {
cin >> data.at(i);
}
int count = 0;
while (true) {
for (int j=0; j<N; j++) {
if (data.at(j)%2 != 0) {
cout << count << endl;
exit(0);
}
data.at(j) /= 2;
}
count++;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int n = 1000000000;
for (int i = 0; i < N; i++){
int A;
cin >> A;
int a = 0;
while ( A % 2 == 0){
a++;
A /= 2;
}
if(n > a)
n = a;
}
cout << n << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MAX=100005;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define sum(v) accumulate(ALL(v),0)
#define fi first
#define se second
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
int len=v.size();
for(int i=0; i<len; ++i) {
s<<v[i];
if(i<len-1) s<<" ";
}
return s;
}
// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
int len=vv.size();
for(int i=0; i<len; ++i) {
s<<vv[i]<<endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout<<std::setprecision(10);
ll a,b;
cin>>a>>b;
//a 白 b 黒
VV g(100,Vec(100,0));
rep(i,50){
rep(j,100){
g[i][j] = 1;
}
}
a--;b--;
REP(i,0,a){
ll h = i/50;
ll w = i%50;
g[h*2][w*2] = 0;
}
REP(i,0,b){
ll h = i/50;
ll w = i%50;
g[99-h*2][w*2] = 1;
}
cout<<100<<" "<<100<<endl;
rep(i,100){
string s;
rep(j,100){
s += g[i][j]==1?'#':'.';
}
cout<<s<<endl;
}
return 0;
}
| #include<iostream>
#include<queue>
using namespace std;
int H,W;
char A[1005][1005];
int dist[1005][1005];
bool visited[1005][1005];
int white_cnt=0;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
class Node{
public:
int x,y;
Node(int a, int b):x(a),y(b){}
};
void input(){
cin>>H>>W;
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cin>>A[i][j];
}
}
}
void init(){
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
dist[i][j]=-1;
}
}
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
visited[i][j]=false;
}
}
}
void bfs(){
init();
queue<Node> que;
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
if(A[i][j]=='#'){
Node temp(j,i);
que.push(temp);
visited[i][j]=true;
dist[i][j]=0;
}
}
}
while(!que.empty()){
Node cur=que.front();
que.pop();
int cur_x=cur.x;
int cur_y=cur.y;
for(int i=0;i<4;++i){
int next_x=cur_x+dx[i];
int next_y=cur_y+dy[i];
bool b=0<=next_x&&next_x<W&&0<=next_y&&next_y<H;
if(A[next_y][next_x]=='#'||visited[next_y][next_x]||!b) continue;
visited[next_y][next_x]=true;
dist[next_y][next_x]=dist[cur_y][cur_x]+1;
Node next(next_x,next_y);
que.push(next);
}
}
}
int max_search(){
int ans=0;
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
ans=ans<dist[i][j]?dist[i][j]:ans;
}
}
return ans;
}
void output(){
cout<<max_search()<<endl;
}
int main(){
input();
bfs();
output();
} | 0 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
// long long mod = 998244353;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
long long modpow(long long m, long long n, long long modvalue) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2, modvalue);
return t * t % modvalue;
} else {
return modpow(m, n - 1, modvalue) * m % modvalue;
}
}
long long moddiv(long long a, long long b, ll modvalue) { return (a * modpow(b, mod - 2, modvalue)) % modvalue; }
const ll INF = 1LL << 60;
string change_binary(long long a) {
string ret;
for (int i = 31; i >= 0; i--) {
ret += (a >> i & 1) + '0';
}
return ret;
}
ll nCkmod(ll n, ll k, ll modvalue) {
ll numera = 1;
for (int i = n; i > n - k; i--) {
numera *= i;
numera %= modvalue;
}
ll denomi = 1;
REP(i, k) {
denomi *= (i + 1);
denomi %= modvalue;
}
return moddiv(numera, denomi, modvalue);
}
map<ll, ll> cnt;
void primeFactors(long long n) {
while (n % 2 == 0) {
cnt[2]++;
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
cnt[i]++;
n = n / i;
}
}
if (n > 2) {
cnt[n]++;
}
}
vector<ll> dijkstra(vector<vector<P>> graph, ll s) {
vector<ll> ans(graph.size(), -1);
priority_queue<P, vector<P>, greater<P>> pq;
pq.push({0, s});
while (pq.size() > 0) {
ll cur1 = 0;
ll cur2 = 0;
if (ans[pq.top().second] != -1) {
pq.pop();
} else {
cur1 = pq.top().first;
cur2 = pq.top().second;
pq.pop();
ans[cur2] = cur1;
for (ll i = 0; i < graph[cur2].size(); i++) {
pq.push({cur1 + graph[cur2][i].first, graph[cur2][i].second});
}
}
}
return ans;
}
vector<string> maze;
ll h, w;
bool check(ll y, ll x) {
if (x < 0 || x >= w || y < 0 || y >= h || maze[y][x] == '#') {
return false;
}
return true;
}
double p;
long double f(long double x) { return x + p / (pow(2, x / 1.5)); }
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> as(m);
ll match[10] = {INF, 2, 5, 5, 4, 5, 6, 3, 7, 6};
REP(i, m) { cin >> as[i]; }
sort(as.rbegin(), as.rend());
vector<ll> digit(10001, -INF);
digit[0] = 0;
rep(i, 1, n + 1) {
REP(j, m) {
if (i - match[as[j]] >= 0) {
digit[i] = max(digit[i], 1 + digit[i - match[as[j]]]);
}
}
}
ll k = n;
REP(i, digit[n]) {
REP(j, as.size()) {
if ((k - match[as[j]]) >= 0 && digit[k - match[as[j]]] == digit[k] - 1) {
k -= match[as[j]];
cout << as[j];
break;
}
}
}
} | #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, M; cin >> N >> M;
vector<int> A(N);
rep(i, N){
cin >> A[i];
}
vector<int> R(N+1);
R[0] = 0;
rep(i, N){
int r = A[i] + R[i];
r %= M;
R[i+1] = r;
}
map<ll, ll> m;
rep(i, N+1){
m[R[i]]++;
}
ll ans = 0;
for (auto p : m){
ll value = p.second;
value = value * (value-1) / 2;
ans += value;
}
cout << ans << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,s=0;
cin>>n;
for(i=1;i<=n;i++)
{
if(i%3==0||i%5==0)
continue;
s+=i;
}
cout<<s<<endl;
}
| // God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#define mnlld -LLONG_MAX
#define mxd 2e8
#define mnd -2e8
#define pi 3.14159265359
using namespace std;
bool check(ll n, ll pos)
{
return n & (1LL << pos);
}
ll Set(ll n, ll pos)
{
return n = n | (1LL << pos);
}
int main()
{
ll i, j, k, l, m, n, o, r, q;
ll testcase;
ll input, flag, tag, ans;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ans = 0;
while(cin >> n)
{
for(ll i = 1; i <= n; i++)
{
if(i % 3 && i % 5) ans += i;
}
cout << ans << "\n";
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;i++){
if(n & (1<<i)){
ans *= tmp;
ans %= MOD;
}
tmp *= tmp;
tmp %= MOD;
}
return ans;
}
long long kaizyou(long long x){
if(x == 0)return 1;
return x * kaizyou(x-1) % MOD;
}
long long comb(long long x,long long y){
long long bunsi = kaizyou(x);
long long bunbo = kaizyou(x-y) * kaizyou(y) % MOD;
return bunsi * ruizyou((int)bunbo,MOD-2) % MOD;
}
struct unionfind{
vector<int> par;
vector<int> hukasa;
unionfind(int n){
par = vector<int>(n);
hukasa = vector<int>(n,0);
for(int i=0;i<n;i++){
par.at(i) = i;
}
}
int root(int x){
if(par.at(x) == x)return x;
return root(par.at(x));
}
void unite(int x,int y){
int rx = root(x);
int ry = root(y);
if(rx == ry)return;
if(hukasa.at(rx) >= hukasa.at(ry)){
par.at(ry) = rx;
hukasa.at(rx) = max(hukasa.at(ry) + 1,hukasa.at(rx));
}
else{
par.at(rx) = ry;
}
}
bool same(int x,int y){
return root(x) == root(y);
}
};
int main(){
int n,m,q;
cin >> n >> m >> q;
vector<vector<int>> lr(m,vector<int>(2));
for(int i=0;i<m;i++){
cin >> lr.at(i).at(0) >> lr.at(i).at(1);
lr.at(i).at(0)--;lr.at(i).at(1)--;
}
vector<vector<int>> pq(q,vector<int>(2));
for(int i=0;i<q;i++){
cin >> pq.at(i).at(0) >> pq.at(i).at(1);
pq.at(i).at(0)--;pq.at(i).at(1)--;
}
vector<vector<int>> table(n,vector<int>(n,0));
for(int i=0;i<m;i++){
table.at(lr.at(i).at(0)).at(lr.at(i).at(1))++;
}
vector<vector<int>> s(n,vector<int>(n));
s[0][0] = table[0][0];
for(int i=1;i<n;i++){
s[i][0] = s[i-1][0] + table[i][0];
s[0][i] = s[0][i-1] + table[0][i];
}
for(int i=1;i<n;i++){
for(int j=1;j<n;j++){
s[i][j] = s[i-1][j] + s[i][j-1] - s[i-1][j-1] + table[i][j];
}
}
for(int i=0;i<q;i++){
int pp = pq.at(i).at(0),qq = pq.at(i).at(1);
if(pp == 0)cout << s[qq][qq] << endl;
else{
cout << s[qq][qq] - s[qq][pp-1] - s[pp-1][qq] + s[pp-1][pp-1] << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,x=0;string A,B,C;
cin>>N>>A>>B>>C;
for(int i=0;i<N;i++){
char a=A.at(i),b=B.at(i),c=C.at(i);
if(a==b){if(a!=c)x++;}
else{
if(a==c||b==c)x++;
else x+=2;
}
}
cout<<x<<endl;
} | 0 |
#include<functional>
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return 0;}
template<typename T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return 0;}
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> S(N);
for (auto& s : S) {
cin >> s;
}
vector<P> pos, neg;
for (auto& s : S) {
string now;
for (auto& c : s) {
if (now.empty()) {
now += c;
} else {
if (now.back() == '(' && c == ')') {
now.pop_back();
} else {
now += c;
}
}
}
int A = 0, B = 0;
for (auto& c : now) {
if (c == ')') {
++A;
} else {
++B;
}
}
if (B - A >= 0) {
pos.emplace_back(A, B);
} else {
neg.emplace_back(A, B);
}
}
sort(all(pos), [](P a, P b) {
return a.first < b.first;
});
int cumsum = 0;
for (auto& p : pos) {
cumsum -= p.first;
if (cumsum < 0) {
cout << "No" << endl;
return 0;
}
cumsum += p.second;
}
sort(all(neg), [](P a, P b) {
return a.second > b.second;
});
for (auto& p : neg) {
cumsum -= p.first;
if (cumsum < 0) {
cout << "No" << endl;
return 0;
}
cumsum += p.second;
}
if (cumsum) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
const int mxn = 1e6 + 5;
int n;
char s[mxn];
int bg[mxn], ln[mxn];
int a[mxn], b[mxn];
int id[mxn];
bool comp(int x, int y) {
return min(-a[x], -a[x] + b[x] - a[y]) > min(-a[y], -a[y] + b[y] - a[x]);
}
void NO() {
puts("No");
exit(0);
}
int main() {
scanf("%d", &n);
rep(i, n) {
scanf("%s", s + bg[i]);
ln[i] = strlen(s + bg[i]);
rep(j, ln[i]) {
if (s[bg[i] + j] == '(') {
++ b[i];
} else {
if (b[i]) -- b[i];
else ++ a[i];
}
}
bg[i + 1] = bg[i] + ln[i];
id[i] = i;
}
sort(id, id + n, comp);
int A = 0;
rep(xx, n) {
int i = id[xx];
A -= a[i];
if (A < 0) NO();
A += b[i];
}
if (A != 0) NO();
puts("Yes");
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int partition(int A[],int n,int p,int r){
int i=p-1;
int x=A[r];
for(int j=p;j<r;j++){
if(A[j]<=x){
++i;
int t=A[j];
A[j]=A[i];
A[i]=t;
}
}
A[r]=A[i+1];
A[i+1]=x;
return i+1;
}
int main(){
int n;
cin>>n;
int *A=new int[n];
for(int i=0;i<n;i++)cin>>A[i];
int q=partition(A,n,0,n-1);
for(int i=0;i<n;i++){
if(i>0)cout<<' ';
if(i==q)cout<<"[";
cout<<A[i];
if(i==q)cout<<"]";
}
cout<<endl;
return 0;
}
| #include<iostream>
using namespace std;
int main(){
int a[100001],n,count=0;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
if(a[i]>a[n-1])
count++;
else
swap(a[i],a[i-count]);
for(int i=0;i<n-count-1;i++)
cout<<a[i]<<' ';
cout<<'['<<a[n-count-1]<<']'<<' ';
for(int i=n-count;i<n-1;i++)
cout<<a[i]<<' ';
cout<<a[n-1]<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
long long modpow(long long m, long long n, long long modvalue) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2, modvalue);
return t * t % modvalue;
} else {
return modpow(m, n - 1, modvalue) * m % modvalue;
}
}
bool bitcheck(ll x, ll y) { return (x >> y) & 1; }
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
// long long mod = 998244353;
long long moddiv(long long a, long long b, ll modvalue) { return (a * modpow(b, mod - 2, modvalue)) % modvalue; }
const ll INF = 1LL << 60;
void print_binary(long long a) {
for (int i = 31; i >= 0; i--) {
cout << (a >> i & 1);
}
cout << endl;
}
ll nCkmod(ll n, ll k, ll modvalue) {
ll numera = 1;
for (int i = n; i > n - k; i--) {
numera *= i;
numera %= modvalue;
}
ll denomi = 1;
REP(i, k) {
denomi *= (i + 1);
denomi %= modvalue;
}
return moddiv(numera, denomi, modvalue);
}
map<ll, ll> cnt;
void primeFactors(long long n) {
while (n % 2 == 0) {
cnt[2]++;
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
cnt[i]++;
n = n / i;
}
}
if (n > 2) {
cnt[n]++;
}
}
int main() {
ll n, m;
cin >> n >> m;
primeFactors(m);
ll ans = 1;
for (auto x : cnt) {
ans *= nCkmod(x.second + n - 1, n - 1, mod);
ans %= mod;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FILL0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
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; }
bool cmp(P a, P b)
{
return a.first < b.first;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
int N;
ll M;
cin >> N >> M;
if(N==1)
{
cout << M << endl;
return 0;
}
ll ans=0;
vector<P> div;
for(ll i=2; i*i<=M; i++)
{
ll cnt = 0;
if(M%i==0)
{
cnt=M/i;
div.push_back(P(i, cnt));
div.push_back(P(cnt, i));
}
}
sort(div.begin(), div.end(), cmp);
reverse(div.begin(), div.end());
rep(i, div.size())
{
if(div[i].second>=N)
{
cout << div[i].first << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
} | 0 |
#include <cstdio>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
typedef pair<int, int> P;
P po[100], res[100];
int main() {
int n; scanf("%d",&n);
for (int i=0; i<n; i++) {
po[i].second=i;
po[i].first=0;
}
for (int i=0; i<n*(n-1)/2; i++) {
int a,b,c,d; scanf("%d%d%d%d",&a,&b,&c,&d);
if (c>d) {
po[a-1].first+=3;
} else if (c<d) {
po[b-1].first+=3;
} else {
po[a-1].first++;
po[b-1].first++;
}
}
sort(po, po+n);
int pos=1, cnt=0, bef=0;
for (int i=n-1; i>=0; i--) {
if (bef!=po[i].first) {
pos+=cnt;
res[i].first=po[i].second;
res[i].second=pos;
cnt=1; bef=po[i].first;
} else {
res[i].first=po[i].second;
res[i].second=pos;
cnt++;
}
}
sort(res,res+n);
for (int i=0; i<n; i++) printf("%d\n",res[i].second);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void pv(vector <int> &v) {
for(int i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve() {
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector <int> a(n, 0);
vector <int> b(n, 0);
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) cin >> b[i];
reverse(b.begin(),b.end());
// pv(b);
int prob = 0;
for(int i = 0; i < n; i++) {
if(a[i] == b[i]) prob++;
}
int c = -1;
int l = INT_MAX;
int r = INT_MIN;
for(int i = 0; i < n; i++) {
if(a[i] == b[i]) {
c = a[i];
l = i;
break;
}
}
for(int i = n-1; i >= 0; i--) {
if(a[i] == b[i]) {
r = i;
break;
}
}
int toSwap = (r-l+1);
if(toSwap == 0 || prob == 0) {
cout << "Yes" << endl;
pv(b);
return 0;
}
int l0 = l;
int r0 = r;
int avail = 0;
for(int i = 0; i < l; i++) {
if(a[i] != c && b[i] != c) avail++;
}
for(int i = r+1; i < n; i++) {
if(a[i] != c && b[i] != c) avail++;
}
if(avail < toSwap) {
cout << "No" << endl;
return 0;
}
else cout << "Yes" << endl;
int i = 0;
int j = r0+1;
while(l <= r) {
if(i < l0 && i < n) {
if(a[i] != c && b[i] != c) {
swap(b[i], b[l]);
l++;
}
}
i++;
if(i == n) break;
}
// if(j < n) {
while(l <= r) {
if(j < n && a[j] != c && b[j] != c) {
swap(b[j], b[l]);
l++;
}
j++;
// if(j == n) break;
}
// }
// while(l <= r) {
// if(i < l0 && a[i] != c && b[i] != c) {
// swap(b[i], b[l]);
// l++;
// i++;
// continue;
// }
// else if(i == l0 && a[j] != c && b[j] != c && j < n) {
// swap(b[j], b[l]);
// l++;
// j++;
// continue;
// }
// i++;
// if(i == l0) j++;
// }
pv(b);
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
map<int,int> m;
for(int i=0; i<n; i++){
int a;
cin >> a;
m[a]++;
}
vector<int> use;
for(auto p:m){
if(p.second>=4){
use.push_back(p.first);
use.push_back(p.first);
}
else if(p.second >=2){
use.push_back(p.first);
}
}
sort(use.begin(), use.end());
reverse(use.begin(), use.end());
if(use.size()<=1){
cout << 0 << endl;
return 0;
}
cout << (ll)use.at(0)*use.at(1) << endl;
} | #include <stdio.h>
int main(void)
{
int n,a[4],t[100],p[100],i,j,k;
scanf("%d",&n);
for(i=0;i!=n;++i)
t[i]=0;
for(i=0;i!=n*(n-1)/2;i++){
for(j=0;j!=4;j++)
scanf("%d",&a[j]);
if(a[2]<a[3])
t[a[1]-1]+=3;
else if(a[2]>a[3])
t[a[0]-1]+=3;
else{
t[a[0]-1]+=1;
t[a[1]-1]+=1;
}
}
for(i=0;i!=n;++i)
p[i]=t[i];
for(i=0;i!=n;++i){
for(j=i;j!=n;j++){
if(p[i]<p[j]){
k=p[i];
p[i]=p[j];
p[j]=k;
}
}
}
for(i=0;i!=n;++i){
for(j=0;j!=n;++j){
if(t[i]==p[j]){
printf("%d\n",j+1);
break;
}
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> P;
const int inf = INT_MAX;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos(-1.0);
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<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val) { fill( (T*)array, (T*)(array+N), val ); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B; cin >> A >> B;
A--, B--;
int h = 100, w = 100;
vector<string> maze(h, string(w, '.'));
rep(i, h/2) maze[i] = string(w, '#');
bool flag = false;
for (int i = 0; i < h / 2; i += 2) {
for (int j = 0; j < w; j += 2) {
if (A == 0) {
break;
flag = true;
}
maze[i][j] = '.';
A--;
}
if (flag) break;
}
flag = false;
for (int i = h / 2 + 1; i < h; i += 2) {
for (int j = 0; j < w; j += 2) {
if (B == 0) {
break;
flag = true;
}
maze[i][j] = '#';
B--;
}
if (flag) break;
}
cout << h << ' ' << w << endl;
rep(i, h) {
cout << maze[i] << endl;
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<98<<" "<<99<<endl;
a--;
b--;
for(int i=0;i<=48;i++){
for(int j=0;j<=98;j++){
if(i%2==0||j%2==0||a==0)
cout<<'#';
else{
cout<<'.';
a--;
}
}
cout<<endl;
}
for(int i=0;i<=48;i++){
for(int j=0;j<=98;j++){
if(i%2==0||j%2==0||b==0)
cout<<'.';
else{
cout<<'#';
b--;
}
}
cout<<endl;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a <= b*c)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int d, t, s;
cin >> d >> t >> s;
if(d % s == 0 && d / s <= t){
cout << "Yes" << endl;
return 0;
}else if(d % s != 0 && d / s < t){
cout << "Yes" << endl;
return 0;
}else{
cout << "No" << endl;
return 0;
};
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef multiset<ll> S;
typedef priority_queue<ll> PQ;
typedef priority_queue<P,vector<P>,greater<P>> SPQ;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
const ll inf=1001001001001001;
const int INF=1001001001;
const int mod=1000000007;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())outp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size()){rep(j,v[i].size()){if(j)cout<<' ';cout<<v[i][j];}cout<<'\n';}}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
int main(){
ll n,ans=0;cin>>n;
multiset<ll> v;
rep(i,n){
ll a;cin>>a;
v.insert(a);
}
while(!v.empty()){
auto it=v.end();
it--;
ll k=1;
while(k<=*it)k*=2;
k=k-*it;
v.erase(it);
auto w=v.lower_bound(k);
if(*w==k){
ans++;
v.erase(w);
}
}
out(ans);
} | #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 rep(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; }
///////////////////////////////////////////////////////////////////////////////////
ll n;
Vi a;
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
cin>>n;
a.resize(n);
map<ll,ll> ma;
rep(i,n){
cin>>a[i];
ma[a[i]]++;
}
ll idt = 1;
Vi tws;
Sort(a);
ll mx = a[0] + a[1];
while(idt<=mx){
idt *= 2;
tws.pb(idt);
}
ll ans = 0;
rep(i,n){
if(ma[a[i]]<=0)continue;
ll id = upper_bound(all(tws),a[i]) - tws.begin();
for(ll j=tws.size();j>=id;j--){
ll now = tws[j] - a[i];
if(ma[now]<=0)continue;
if(a[i]==now){
if(ma[a[i]]>=2){
ans++;
ma[a[i]] -= 2;
break;
}
}else{
ans++;
ma[a[i]]--;
ma[now]--;
break;
}
}
}
print(ans);
return 0;
} | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
int n, m; cin >> n >> m;
vector<ll>x(n), y(m); for (auto&& xx : x)cin >> xx;for (auto&& yy : y)cin >> yy;
sort(x.begin(), x.end());sort(y.begin(), y.end());
ll a = 0, b = 0;
for (int i = 0; i < n; i++)a -= x[i] * (n - 1 - i - i);
for (int i = 0; i < m; i++)b -= y[i] * (m - 1 - i - i);
cout << (a % mod) * (b % mod) % mod << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, m, x[100004], y[100004];
const int mod = 1000000007;
long long mul(long long a, long long b){
long long ret = a * b;
return ret% mod;
}
long long sum(long long a, long long b){
return (a+b)%mod;
}
int main() {
ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin>>n>>m;
for(int i = 0;i<n;i++) cin>>x[i];
for(int i = 0;i<m;i++) cin>>y[i];
int ver = 0, hor = 0;
for(int i = 1;i<n;i++) ver = sum(ver,mul(mul(x[i]-x[i-1],i),n-i));
for(int i = 1;i<m;i++) hor = sum(hor,mul(mul(y[i]-y[i-1],i),m-i));
cout<<mul(ver,hor);
return 0;
}
| 1 |
//#include <bits/stdc++.h>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <limits>
#include <map>
#include <vector>
#include <queue>
#define LL long long
#define ft first
#define sd second
#define mp(x,y) make_pair(x,y)
//#define int LL
using namespace std;
const int N = 3e5+233;
//const int mod = ;
const int INF =numeric_limits<int >::max();
#define For(n) for (int i=1;i<=n;++i)
#define rep(i,n) for (int i=1;i<=n;++i)
#define repp(i,x,y) for (int i=x;i<=y;++i)
void read(int &x)
{
x=0;
char ch=getchar();
int f=1;
while (!isdigit(ch)) (ch=='-'?f=-1:0),ch=getchar();
while ( isdigit(ch)) x=x*10+ch-'0',ch=getchar();
x*=f;
}
void write(int x)
{
if (x<0) putchar('-'),x=-x;
if (x>9) write(x/10);
putchar(x%10+'0');
}
int n,a[N],b[N],c[N],d[N];
signed main()
{
read(n);
rep(i,n) read(a[i]),++c[a[i]];
rep(i,n) read(b[i]),++d[b[i]];
reverse(b+1,b+1+n);
rep(i,n ) if (c[i]+d[i]>n)
{
printf("No");
return 0;
}
int l=n,r=1;
rep(i,n) if (a[i]==b[i]) l=min(l,i),r=max(r,i);
int pos=l;
for (int i=1;i<l&&pos<=r;++i) if (b[i]!=a[l]&&a[i]!=a[l]) swap(b[i],b[pos]),++pos;
for (int i=r+1;i<=n&&pos<=r;++i) if (b[i]!=a[l]&&a[i]!=a[l]) swap(b[i],b[pos]),++pos;
printf("Yes\n");
rep(i,n) printf("%d ",b[i]);
return 0;
}
| #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T>
using Vvec = vector<vector<T> >;
template <class T>
void debug(T& v)
{
for(auto& x: v) cout << x << " ";
cout << endl;
}
// KMP
template <class T>
std::vector<int> KMP(T& S)
{
std::vector<int> A(S.size()+1);
A[0] = -1;
int j = -1;
for(int i=0; i<S.size(); i++){
while(j > -1 && S[j] != S[i]) j = A[j];
j++;
A[i+1] = j;
}
return A;
}
// detect T from S
template <class Type>
std::vector<int> matchedIndex(Type& S, Type& T)
{
std::vector<int> ret;
std::vector<int> A = KMP(T);
for(int m = 0, i = 0; m + T.size() <= S.size();){
while(m+i < S.size() && i < T.size() && S[m+i] == T[i]) i++;
if(i == T.size()) ret.push_back(m);
m += std::max(i - A[i], 1);
i = std::max(A[i], 0);
}
return ret;
}
int main()
{
int N;
cin >> N;
vector<int> a(N), b(N);
for(auto& x: a) cin >> x;
for(auto& x: b) cin >> x;
a.push_back(a[0]);
b.push_back(b[0]);
vector<int> c(N), d(2*N);
for(int i=0; i<N; i++){
c[i] = a[i] ^ a[i+1];
d[i] = b[i] ^ b[i+1];
d[N+i] = d[i];
}
d.pop_back();
vector<int> index = matchedIndex(d, c);
for(auto& k: index){
k = (N-k)%N;
}
sort(index.begin(), index.end());
for(auto& k: index){
cout << k << " " << (a[k] ^ b[0]) << endl;
}
} | 0 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<time.h>
#include<cassert>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
#define EPS (1e-13)
#define bit(n,k) ((n>>k)&1)
#define Mod = 1e9 + 7;
#define mod = 998244353;
struct H {
ll x, y;
bool operator<(const H& b) const {
if (x != b.x) return x < b.x;
return y < b.y;
}
bool operator>(const H& b) const {
if (x != b.x) return x > b.x;
return y > b.y;
}
bool operator==(const H& b) const { return x == b.x && y == b.y; }
bool operator!=(const H& b) const { return (*this) != b; }
};
struct P {
ll pos, cost;
bool operator<(const P& b) const { return cost < b.cost; }
bool operator>(const P& b) const { return cost > b.cost; }
};
struct B {
ll to, cost;
};
struct E {
ll from, to, cost;
bool operator<(const E& b) const { return cost < b.cost; }
bool operator>(const E& b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T& a, U b) {
if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T& a, U b) {
if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
if (a < 0) return 0;
return a;
}
template<typename T>
T min_0(T a) {
if (a > 0) return 0;
return a;
}
ll read() {
ll u;
ll k = scanf("%lld", &u);
return u;
}
ll gcd(ll i, ll j) {
if (i > j) swap(i, j);
if (i == 0) return j;
return gcd(j % i, i);
}
ll mod_pow(ll x, ll n, ll p) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
}//x^n%p
ll bitcount(ll x) {
int sum = 0;
for (int i = 0; i < 20; i++)
if ((1ll << i) & x) sum++;
return sum;
}
void spsp(vector<ll>&v) {
for (int i = 0; i < v.size(); i++) {
printf("%lld%s", v[i], (i == v.size() - 1 ? "\n" : " "));
}
}
/*ll fact_[200000];
ll comb(ll x, ll y, ll mod = Mod) {
if (!fact_[0]) {
fact_[0] = 1;
for (int i = 1; i < 200000; i++) {
fact_[i] = fact_[i - 1] * i % mod;
}
}
if (x < y) return 0;
return mod_pow(fact_[x], mod, mod) *
mod_pow(fact_[x - y], mod - 2, mod) % mod *
mod_pow(fact_[y], mod - 2, mod) % mod;
}//xCy*/
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
signed main() {
int n;
vector<H>a;
cin >> n;
int mx = -Inf, mn = Inf;
for (int i = 0; i < n; i++) {
int u, v;
cin >> u >> v;
a.push_back(H{ --u,v });
chmax(mx, a[i].x);
chmin(mn, a[i].y);
}
int ans = 0;
for (auto z : a) {
chmax(ans, max(0ll, mn - mx) + z.y - z.x);
}
vector<H>v;
for(int i=0;i<n;i++){
int c = max(0ll, mn - a[i].x);
int d = max(0ll, a[i].y - mx);
v.push_back(H{ d, -c });
}
sort(all(v));
int w = inf;
for(int i=0;i<n;i++){
auto z = v[i];
z.y = -z.y;
if (i) chmax(ans, w + z.x);
chmin(w, z.y);
}
cout << ans << endl;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
int dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;
int n,m,used[101010],cmp[101010];
vector<int> v[101010],rv[101010],vs;
void dfs(int x){
used[x]=true;
for(auto to:v[x])if(!used[to])dfs(to);
vs.push_back(x);
}
void rdfs(int x,int k){
used[x]=true;
cmp[x]=k;
for(auto to:rv[x])if(!used[to])rdfs(to,k);
}
int scc(){
rep(i,n)if(!used[i])dfs(i);
rep(i,n)used[i]=0;
reverse(vs.begin(),vs.end());
int k=0;
for(auto x:vs)if(!used[x])rdfs(x,k++);
return k;
}
int main(){
cin>>n>>m;
rep(i,m){
int s,t;
cin>>s>>t;
v[s].push_back(t);
rv[t].push_back(s);
}
scc();
int q;
cin>>q;
rep(i,q){
int s,t;
cin>>s>>t;
cout<<(cmp[s]==cmp[t])<<endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
const int N = 108;
int n;
int a[N], b[N];
int main() {
int i, mid;
scanf("%*d%d", &n);
for (i = 0; i < n; ++i) scanf("%d", a + i);
if (n == 1) return *a == 1 ? puts("1\n1\n1") : printf("%d\n2\n1 %d\n", *a, *a - 1), 0;
mid = std::partition(a, a + n, [] (const int x) -> bool {return x % 2;}) - a;
if (mid > 2) return puts("Impossible"), 0;
a[n] = *a;
for (i = 1; i <= n; ++i) printf("%d%c", a[i], i == n ? 10 : 32);
memcpy(b + 1, a + 1, n << 2), ++b[1], --b[n], n -= !b[n];
printf("%d\n", n);
for (i = 1; i <= n; ++i) printf("%d%c", b[i], i == n ? 10 : 32);
return 0;
} | #include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=105;
int n,m,a[maxn],b[maxn];
inline char nc(){
static char buf[100000],*p1,*p2;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read(){
int ret=0;bool f=0;char ch=nc();
while(ch>'9'||ch<'0') f^=ch=='-',ch=nc();
while(ch<='9'&&ch>='0') ret=ret*10+ch-'0',ch=nc();
return f?-ret:ret;
}
int main(){
n=read(),m=read();
for (int i=1;i<=m;i++) a[i]=read();
for (int i=2;i<=m;i++)
if(a[i]&1) swap(a[i],a[1]);
for (int i=m-1;i>1;i--)
if(a[i]&1) swap(a[i],a[m]);
for (int i=2;i<m;i++)
if(a[i]&1) return puts("Impossible")&0;
for (int i=1;i<=m;i++)
printf("%d",a[i]),putchar(i==m?'\n':' ');
if(a[1]>1) b[++b[0]]=a[1]-1;
for (int i=2;i<m;i++) b[++b[0]]=a[i];
if(m>1){
b[++b[0]]=2;
if(a[m]>1) b[++b[0]]=a[m]-1;
}else b[++b[0]]=1;
for (int i=0;i<=b[0];i++)
printf("%d",b[i]),putchar(!i||i==b[0]?'\n':' ');
return 0;
} | 1 |
/********************************************************
**░██████╗██╗░░░░░░█████╗░██╗░░░██╗██╗░█████╗░░██████╗░**
**██╔════╝██║░░░░░██╔══██╗██║░░░██║██║██╔══██╗██╔════╝░**
**╚█████╗░██║░░░░░███████║╚██╗░██╔╝██║██║░░╚═╝██║░░██╗░**
**░╚═══██╗██║░░░░░██╔══██║░╚████╔╝░██║██║░░██╗██║░░╚██╗**
**██████╔╝███████╗██║░░██║░░╚██╔╝░░██║╚█████╔╝╚██████╔╝**
**╚═════╝░╚══════╝╚═╝░░╚═╝░░░╚═╝░░░╚═╝░╚════╝░░╚═════╝░**
*********************************************************/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend();
#define isSubstring(s1,s2) s1.find(s2) != std::string::npos
#define pb push_back
#define pf push_front
#define mp make_pair
#define fr first
#define sc second
#define vpi <vector<pair<int,int>>
#define vi vector<int>
#define sz(a) (int)a.size()
#define endl "\n"
#define nl cout<<"\n";
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define MN INT_MIN
#define MX INT_MAX
bool isPrime(ll n){if(n<2)return false;for(ll x = 2;x*x <=n;x++){if(n%x == 0)return false;}return true;}
bool isPerfectSquare(long double x){long double sr=sqrt(x);return((sr-floor(sr))==0);}
int gcd(int a, int b){if(a==0)return b;if(b==0) return a;if(a==b)return a;if(a>b)return gcd(a-b,b);return gcd(a,b-a);}
int32_t main()
{
int n;
cin >> n;
int a[n];
for(int i = 0;i<n;i++)
cin >> a[i];
int mn = MX,cnt = 0;
for(int i = 0;i<n;i++)
{
mn = min(mn,a[i]);
if(a[i] <= mn)
{
cnt++;
}
}
cout <<cnt<<endl;
} | #include <bits/stdc++.h>
#include <cassert>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = vector<ii>;
using gt = greater<int>;
using minq = priority_queue<int, vector<int>, gt>;
using P = pair<ll,ll>;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
//clang++ -std=c++11 -stdlib=libc++
int main() {
ll n; cin >> n;
vll A(5);
rep(i,5) cin >> A[i];
rep(i,4) {
if (A[i] < A[i+1]) A[i+1] = A[i];
}
ll ans = 4 + (n-1)/A[4] + 1;
printf("%lld\n", ans);
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
vector<int> card(5);
vector<int> count(13);
string handName[7] = {"null", "one pair", "two pair", "three card", "straight", "full house", "four card"};
int hand;
int max, pair;
int i;
while (scanf("%d,%d,%d,%d,%d", &card[0], &card[1], &card[2], &card[3], &card[4]) != EOF) {
fill(count.begin(), count.end(), 0);
max = 0;
pair = 0;
for (i = 0; i < 5; i++) {
if ( ++count[card[i]-1] > max )
max = count[card[i]-1];
if ( count[card[i]-1] == 2 )
pair++;
}
if (max == 4) hand = 6;
else if (max==3 && pair==2) hand = 5;
else if (max == 3) hand = 3;
else if (pair == 2) hand = 2;
else if (pair == 1) hand = 1;
else hand = 0;
if (hand < 4) {
for (i = 0; i < 13-3; i++) {
if (count[i]==1 && count[i+1]==1 && count[i+2]==1 && count[i+3]==1 && count[(i+4)%13]==1)
hand = 4;
}
}
cout<<handName[hand]<<endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int l[5];
char c;
while (cin >> l[0] >> c >> l[1] >> c >> l[2] >> c >> l[3] >> c >> l[4]) {
sort(l, l + 5);
if (l[0] == l[1] && l[1] == l[2] && l[2] == l[3])
cout << "four card";
else if (l[4] == l[1] && l[1] == l[2] && l[2] == l[3])
cout << "four card";
else if (l[0] == l[1] && l[1] == l[2] && l[4] == l[3])
cout << "full house";
else if (l[0] == l[1] && l[3] == l[2] && l[4] == l[3])
cout << "full house";
else if (l[4] == l[3] + 1 && l[3] == l[2] + 1 && l[2] == l[1] + 1 && l[1] == l[0] + 1)
cout << "straight";
else if (l[0] == 1 && l[1] == 10 && l[2] == 11 && l[3] == 12 && l[4] == 13)
cout << "straight";
else if (l[0] == l[1] && l[1] == l[2])
cout << "three card";
else if (l[3] == l[1] && l[1] == l[2])
cout << "three card";
else if (l[3] == l[4] && l[3] == l[2])
cout << "three card";
else if (l[0] == l[1] && l[2] == l[3])
cout << "two pair";
else if (l[0] == l[1] && l[4] == l[3])
cout << "two pair";
else if (l[2] == l[1] && l[4] == l[3])
cout << "two pair";
else if (l[0] == l[1] || l[1] == l[2] || l[2] == l[3] || l[3] == l[4])
cout << "one pair";
else cout << "null";
cout << endl;
}
} | 1 |
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int N, M;
int score[1002001];
int point[1001];
int bin_search(int n){
int h=0, t=(N+1)*(N+1);
int temp;
int status;
while(h<=t){
temp = (t+h)/2;
if(n == score[temp]) return -1;
else if(n > score[temp]){
h = temp + 1;
status = 1;
}else{
t = temp - 1;
status = 0;
}
}
if(status){
return score[temp];
}else{
return score[temp-1];
}
}
int main(){
int a;
int size;
int b;
int m;
cin >> N >> M;
while(N || M){
m = 0;
point[0] = 0;
for(int i=1;i<=N;i++){
cin >> point[i];
}
size = -1;
for(int i=0;i<=N;i++){
for(int j=0;j<=N;j++){
score[size++] = point[i]+point[j];
}
}
sort(score,score+size);
for(int i=0;i<size && score[i] < M;i++){
b = bin_search(M-score[i]);
if(b == -1){
break;
}else{
m = max(m, b+score[i]);
}
}
cout << m << endl;
cin >> N >> M;
}
} | #include<iostream>
#include<vector>
#include<map>
#include<utility>
#include<algorithm>
#include<queue>
#include<stack>
#include<string>
#include<stdlib.h>
#include<stdio.h>
#include<cmath>
#include<cstdlib>
#include<typeinfo>
#include<sstream>
#include<list>
#include<set>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fori(i,k,n) for(int i=k;i<(int)n;i++)
using namespace std;
int in()
{
int x;cin>>x;
return x;
}
int stringInt(string a)
{
return atoi(a.c_str());
}
string intString(int a)
{
stringstream ss;
ss<<a;
return ss.str();
}
vector<int> SieveOfEratosthenes(int x)
{
vector<int> a;
vector<int> b(x+1,0);
for(int i=2;i<=x;i++)
{
if(b[i]==0)
{
a.push_back(i);
for(int l=i;l<=x;l+=i)
{
b[l]=1;
}
}
}
return a;
}
int main ()
{
int n,m;
while(cin>>n>>m&&n&&m)
{
vector<long long > a,b;
b.push_back(0);
rep(i,n)
{
b.push_back(in());
}
rep(i,n+1)
{
rep(l,n+1)
{
a.push_back(b[i]+b[l]);
}
}
long long ans = 0;
sort(a.begin(),a.end());
rep(i,a.size())
{
vector<long long>::iterator t=upper_bound(a.begin(),a.end(),m-a[i]);
if(t==a.begin())continue;
t--;
ans=max(ans,*t+a[i]);
}
cout<<ans<<endl;
}
} | 1 |
#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;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
//const ll mod = 998244353;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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 (a>b) { a=b; return 1; } return 0; }
int main() {
string s;
cin >> s;
int n = s.length();
rep(i, n - 1) {
if (s.substr(i, 2) == "AC") {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | 0 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typedef long long ll;
using namespace std;
const ll x=1000000007;
int mod(ll a){
return a%x;
}
int main(){
ll n;
cin>>n;
ll a[n],ans=0,mins=n+1;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<mins){
ans+=mins-a[i]-1;
mins=a[i];
}
}
cout<<n-ans;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define lw(vc,num) lower_bound(vc.begin(), vc.end(), num) - vc.begin();
#define hg(vc,num) upper_bound(vc.begin(), vc.end(), num) - vc.begin();
#define bn(v,x) binary_search (v.begin(), v.end(), x)
#define mx 100001
#define eps 0.00000000001
#define mod 1000000007
#define pi acos(-1)
#define inf 100000000
#define loop(i,b,n) for(int i=b;i<n;++i)
#define rev_loop(i,b,n) for(int i=b;i>=n;--i)
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
bool isprime(int n)
{
if(n == 1) return false;
if(n == 2 || n == 3) return true;
if(n%2 == 0 || n%3 == 0) return false;
for(int i=5; i*i<=n; i+=6){
if((n%i == 0)||(n%(i+2) == 0)) return false;
}
return true;
}
long long binpow(long long a, long long b) {
if (b == 0)
return 1;
long long res = binpow(a, b / 2);
if (b % 2)
return res * res * a;
else
return res * res;
}
int main()
{
fio;
int n;
cin>>n;
vi v1(n);
loop(i,0,n)
{
cin>>v1[i];
}
int ans = 0,k1 = INT_MAX;
loop(i,0,n)
{
if(k1>v1[i])
{
k1 = v1[i];
ans++;
}
}
cout<<ans<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, i, a, b, x, y, z = 0;
cin >> A >> B;
for (int i = A; i < B + 1; i++){
a = i / 10000;
b = (i / 1000) % 10;
x = i % 10;
y = (i % 100) / 10;
if (a == x && b == y){
z += 1;
}
else
continue;
}
cout << z << endl;
}
| #include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define tcase int _; cin >> _; while(_--)
const int MAX = 1e6;
const int MOD = 1e9+7;
int ans;
int n;
ll v[MAX], sum[MAX];
void solve() {
cin >> n;
for(int i=0; i<n; i++) cin >> v[i];
ans = 0;
for(int i=0; i<61; i++) {
ll c1 = 0;
for(int j=0; j<n; j++) c1 += (v[j] >> i)&1;
ll sum = c1*(n-c1);
for(int j=0; j<i; j++) sum = 2*sum % MOD;
ans = (ans + sum) % MOD;
}
cout << ans%MOD << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int lengths[105];
bool allDifferent(int len1, int len2, int len3)
{
return (len1 != len2) && (len2 != len3) && (len3 != len1);
}
bool canFormTriangle(int len1, int len2, int len3)
{
int maxLen = max(max(len1, len2), len3);
return len1 + len2 + len3 - maxLen > maxLen;
}
int main()
{
int N;
scanf("%d", &N);
for(int i = 1; i <= N; i++)
scanf("%d", &lengths[i]);
int ans = 0;
for(int i = 1; i <= N; i++)
{
for(int j = i + 1; j <= N; j++)
{
for(int k = j + 1; k <= N; k++)
{
if(allDifferent(lengths[i], lengths[j], lengths[k]) && canFormTriangle(lengths[i], lengths[j], lengths[k]))
ans++;
}
}
}
printf("%d", ans);
} | 0 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
for(int64_t i=1;i<n;++i){
if(i*i>n){
cout<<(i-1)*(i-1)<<endl;
return 0;
}
}
cout<<1<<endl;
} | #include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
ll e, m, x, min_;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (cin >> e, e) {
min_ = m = (int)(1e9 + 7);
for (int y = 0; y <= sqrt((double)e); y++) {
for (int z = 0; z <= sqrt((double)e); z++) {
x = e - y * y - z * z * z;
if (x < 0) break;
else {
m = x + y + z;
//cout << "x, m = " << x << " " << m << endl;
if (min_ > m) min_ = m;
}
}
}
cout << min_ << endl;
}
return 0;
} | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define inf 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) num = num * 10 + (ch & 15);
if(neg) num = -num;
}
int N, M, A[1005], B[1005];
ll ans = 1;
int main(){
getint(N), getint(M);
for(register int i = 1; i <= N; i++) getint(A[i]);
for(register int i = 1; i <= M; i++) getint(B[i]);
sort(A + 1, A + N + 1), sort(B + 1, B + M + 1), A[N + 1] = B[M + 1] = inf;
for(register int i = 1; i < N; i++) if(A[i] == A[i + 1]) return puts("0"), 0;
for(register int i = 1; i < M; i++) if(B[i] == B[i + 1]) return puts("0"), 0;
for(register int i = 1, j = 1, k = 1; i <= N * M; i++){
while(j <= N && A[j] < i) j++;
while(k <= M && B[k] < i) k++;
if(A[j] == i && B[k] != i) ans = ans * (M - k + 1) % MOD;
else if(A[j] != i && B[k] == i) ans = ans * (N - j + 1) % MOD;
else if(A[j] != i && B[k] != i) ans = ans * ((M - k + 1) * (N - j + 1) - (N * M - i)) % MOD;
}
return printf("%lld\n", ans), 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define dbg(x) cout<<#x<<":"<<x<<endl
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
ll ca[1111111]={};
ll cb[1111111]={};
int main(){
ll n,m,p=1e9+7;
cin>>n>>m;
ll f=0;
for(int i=0;i<n;i++){
ll a;
cin>>a;
ca[a]++;
if(ca[a]==2)f=1;
}
for(int i=0;i<m;i++){
ll b;
cin>>b;
cb[b]++;
if(cb[b]==2)f=1;
}
ll nm=n*m;
if(ca[nm]==0||ca[nm]==0||f){
cout<<0<<endl;
return 0;
}
ll cr=0,cc=0;
ll ans=1;
ll c0=0;
for(int i=nm;i>0;i--){
// cout<<ans<<" "<<cr<<" "<<cc<<endl;
if(ca[i]&&cb[i]){
cc++;
cr++;
c0++;
continue;
}
if(ca[i]){
ans*=cc;
ans%=p;
cr++;
c0++;
continue;
}
if(cb[i]){
ans*=cr;
ans%=p;
cc++;
c0++;
continue;
}
ans*=(cr*cc-c0);
ans%=p;
c0++;
continue;
}
cout<<ans<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define mem(a,b) memset(a,b,sizeof(a))
#define eb emplace_back
using namespace std;
string s;
ll ans=1,cnt=0,n;
const int mod=1e9+7;
int main(){
cin>>n>>s;
for(auto x:s){
if(x=='W'&&(cnt&1)){
cnt++;
}else if(x=='B'&&!(cnt&1)){
cnt++;
}else{
(ans*=cnt)%=mod;
cnt--;
}
}
for(ll i=1;i<=n;i++){
(ans*=i)%=mod;
}
if(cnt){
ans=0;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using std::cerr;using std::cin;using std::cout;using std::abs;using std::min;using std::max;using std::swap;using std::map;using std::unordered_map;using std::unordered_set;using std::bitset;using std::pair;using std::set;using std::string;using std::vector;using std::sort;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}template<typename T,typename...Ts>void _(const char*s,T h,Ts...t){int b=0;while(((b+=*s=='(')-=*s==')')!=0||*s!=',')cerr<<*s++;cerr<<" = "<<h<<",";_(s+1,t...);}// break continue pop_back 998244353
#define int ll
#define pii pll
#define f first
#define s second
#define pb emplace_back
#define forn(i,n) for(int i=0;i<(n);++i)
#define sqr(x) ((x)*(x))
struct init{init(){cin.tie(0);std::iostream::sync_with_stdio(0);cout<<std::fixed<<std::setprecision(10);cerr<<std::fixed<<std::setprecision(5);}~init(){
#ifdef LOCAL
#define dbg(...) _(#__VA_ARGS__,__VA_ARGS__)
cerr<<"Time elapsed: "<<(double)clock()/CLOCKS_PER_SEC<<"s.\n";
#else
#define dbg(...)
#endif
}}init;template<typename T,typename U>void upx(T&x,U y){if(x<y)x=y;}template<typename T,typename U>void upn(T&x,U y){if(x>y)x=y;}
const int N=2e5+2,M=1e9+7;
int32_t main(){
int n;
string s;
cin>>n>>s;
int ans=1,fac=1,bal=0;
for(int i=1;i<=n;++i)(fac*=i)%=M;
for(char c:s){
if(c=='B'){
if(bal&1){
(ans*=bal)%=M;
bal--;
}else{
bal++;
}
}else{
if(bal&1){
bal++;
}else{
(ans*=bal)%=M;
bal--;
}
}
}
if(bal!=0)ans=0;
cout<<(ans*fac)%M<<'\n';
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n - 8; ++i) {
cout << s[i];
}
puts("");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&&x<b)
#define out(ans) cout << ans << endl
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<ll,ll>P;
const ll mod=1e9+7;
const ll INF = 1LL<<60;
const int dx[]={0,-1,1,0},dy[]={-1,0,0,1};
int main(){
string s;cin>>s;
out(s.substr(0,s.size()-8));
return 0;
}
| 1 |
#include<iostream>
using namespace std;
int main(){
int n;
int a;
int count = 1e9;
cin >> n;
for(int i = 0;i<n;i++){
cin >> a;
int key = 0;
while(a%2 == 0){
a /= 2;
key++;
}
if(key<count){
count = key;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (long long)(n); ++i)
using namespace std;
using ll = long long;
int main() {
ll n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
if (i % 3 == 0 || i % 5 == 0) continue;
ans += i;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string x;
cin >> x;
for(int i=x.length()-1;i>=0;i--)
cout << x[i];
cout << endl;
return 0;
} | #include<iostream>
#include<string>
#include<iterator>
std::string reverse_str(std::string str);
int main()
{
std::string str;
while (std::cin >> str)
{
str = reverse_str(str);
std::cout << str << std::endl;
}
return 0;
}
std::string reverse_str(std::string str)
{
std::string str_ans;
for (unsigned long i = 1; i <= str.size(); ++i)
{
std::string::iterator it = std::prev(end(str), i);
str_ans += *it;
}
return str_ans;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define Int register int
#define mod 1000000007
template <typename T> inline void read (T &t){t = 0;char c = getchar();int f = 1;while (c < '0' || c > '9'){if (c == '-') f = -f;c = getchar();}while (c >= '0' && c <= '9'){t = (t << 3) + (t << 1) + c - '0';c = getchar();} t *= f;}
template <typename T,typename ... Args> inline void read (T &t,Args&... args){read (t);read (args...);}
template <typename T> inline void write (T x){if (x < 0){x = -x;putchar ('-');}if (x > 9) write (x / 10);putchar (x % 10 + '0');}
int N,X,Y,Z,dp[41][1 << 17];
int mul (int a,int b){return 1ll * a * b % mod;}
int dec (int a,int b){return a >= b ? a - b : a + mod - b;}
int add (int a,int b){return a + b >= mod ? a + b - mod : a + b;}
void Add (int &a,int b){a = add (a,b);}
int qkpow (int a,int b){
int res = 1;for (;b;b >>= 1,a = mul (a,a)) if (b & 1) res = mul (res,a);
return res;
}
signed main(){
read (N,X,Y,Z),dp[0][0] = 1;
int ans = 1,up = (1 << X + Y + Z) - 1,st = (1 << X + Y + Z - 1) | (1 << Y + Z - 1) | (1 << Z - 1);
for (Int i = 1;i <= N;++ i){
ans = 1ll * ans * 10 % mod;
for (Int S = 0;S <= up;++ S)
if (dp[i - 1][S] && (S & st) != st)//(S&st)!=st：如果前面还没有出现过合法解
for (Int c = 1;c <= 10;++ c)
Add (dp[i][((S << c) | (1 << c - 1)) & up],dp[i - 1][S]);
}
for (Int S = 0;S < (1 << X + Y + Z);++ S) if ((S & st) != st) ans = dec (ans,dp[N][S]);
write (ans),putchar ('\n');
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 45,mx = 1 << 17 + 5;
int n,x,y,z;
int lim,chk,ans = 0;
int dp[N][mx] = {0};
int fa[N][mx] = {0};
int main(){
scanf("%d%d%d%d",&n,&x,&y,&z);
lim = 1 << (x+y+z);
chk = (1 << (x+y+z-1)) + (1 << (y+z-1)) + (1 << (z-1));
fa[0][0] = 1;
for(int i = 1;i<=n;i++){
for(int j = 0;j<lim;j++){
for(int k = 1;k<=10;k++){
int res = ((j << k) + (1 << (k-1))) % lim;
if((res & chk) == chk) dp[i][res] += fa[i-1][j];
else dp[i][res] += dp[i-1][j];
dp[i][res] %= mod;
fa[i][res] = (fa[i][res] + fa[i-1][j]) % mod;
}
}
}
for(int i = 0;i<lim;i++) ans = (ans + dp[n][i]) % mod;
printf("%d",ans);
return 0;
} | 1 |
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
int i;
double x,sum,v1,v2,a[100];
while(cin >> a[0]){
sum = 0;
for(i=1;i<9;i++) scanf(",%lf",&a[i]);
scanf(",%lf,%lf,%lf",&a[9],&v1,&v2);
for(i=0;i<10;i++) sum += a[i];
x = sum/(v1+v2);
sum = v1 * x;
for(i=0;i<10;i++){
if(sum - a[i] > 0) sum -= a[i];
else{
cout << i+1 << endl;
break;
}
}
}
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int sx,sy,tx,ty;
cin>>sx>>sy>>tx>>ty;
int dx=abs(sx-tx);
int dy=abs(sy-ty);
cout<<string(dx,'R')<<string(dy,'U');
cout<<string(dx,'L')<<string(dy,'D');
cout<<'L'<<string(dy+1,'U')<<string(dx+1,'R')<<'D';
cout<<'R'<<string(dy+1,'D')<<string(dx+1,'L')<<'U';
cout<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) { // 発見できたとき
return 1;
}
else { // 発見できなかったとき
return 0;
}
}
int main() {
int sx, sy, tx, ty; cin >> sx >> sy >> tx >> ty;
int x = tx - sx; int y = ty - sy;
vector<string> ans;
REP(i, y) ans.push_back("U");
REP(i, x) ans.push_back("R");
REP(i, y) ans.push_back("D");
REP(i, x) ans.push_back("L");
ans.push_back("L");
REP(i, y + 1) ans.push_back("U");
REP(i, x + 1) ans.push_back("R");
ans.push_back("D");
ans.push_back("R");
REP(i, y + 1) ans.push_back("D");
REP(i, x + 1) ans.push_back("L");
ans.push_back("U");
REP(i, ans.size()) cout << ans[i];
cout << endl;
} | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
const int MOD = 1000000007;
const int MAXN = 2 * 100005;
LL H, W;
LL A, B;
LL fact[MAXN];
// Exponentiation by squaring
LL expsq(LL x, LL p) {
LL res = 1;
while (p > 0) {
if (p & 1) {
res = (res * x) % MOD;
}
x = (x * x) % MOD;
p /= 2;
}
return res;
}
// Extended Euler's algorithm
LL modinv(LL x) {
return expsq(x, MOD - 2);
}
LL C(LL n, LL k) {
return (fact[n] * modinv(fact[n - k] * fact[k] % MOD)) % MOD;
}
int main() {
cin >> H >> W >> A >> B;
fact[0] = 1;
for (int i = 1; i < MAXN; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
LL ans = 0;
for (LL i = B; i <= W - 1; i++) {
LL res = C(H - A - 1 + i, i);
LL end = C(W - i - 1 + A - 1, A - 1);
res *= end;
res %= MOD;
ans += res;
ans %= MOD;
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int M = N;
int i = 0;
int sum = 0;
while (M >= 1) {
sum += (M - (M / 10) * 10);
M = M / 10;
}
if (N % sum == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
ll N;
cin>>N;
string tmp = to_string(N);
int X = 0;
for(int i=0;i<tmp.size();++i) {
X += tmp[i]-'0';
}
if(N%X==0) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
int lmax = 0, rmin = n;
rep(i,m) {
int l, r;
cin >> l >> r;
lmax = max(lmax, l);
rmin = min(rmin, r);
}
int ans = rmin - lmax + 1;
if (ans <= 0) ans = 0;
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long ll;
int read() {
char ch;
for(ch=getchar();ch<'0'||ch>'9';ch=getchar());
int x=ch-'0';
for(ch=getchar();ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
return x;
}
const int N=1e5+5;
int n,ord[N];
ll val[N],l[N],u[N],b[N],s[N],x;
bool cmp(int x,int y) {return val[x]>val[y];}
ll chk_mx(ll k) {
ll mx=0;
ll p=k/x,q=k%x;
if (p==n) return s[n];
fo(i,1,n) {
int z=ord[i];
ll tmp=(q<=b[z])?q*l[z]:b[z]*l[z]+(q-b[z])*u[z];
tmp+=(i<=p)?s[p+1]-val[z]:s[p];
mx=max(mx,tmp);
}
return mx;
}
int main() {
n=read();x=read();
fo(i,1,n) b[i]=read(),l[i]=read(),u[i]=read();
fo(i,1,n) val[i]=l[i]*b[i]+(x-b[i])*u[i];
fo(i,1,n) ord[i]=i;sort(ord+1,ord+n+1,cmp);
fo(i,1,n) s[i]=s[i-1]+val[ord[i]];
ll d=0;fo(i,1,n) d+=l[i]*b[i];
ll L=0,R=0,ans=0;fo(i,1,n) R+=b[i];
while (L<=R) {
ll mid=L+R>>1;
if (chk_mx(mid)>=d) ans=mid,R=mid-1;
else L=mid+1;
}
printf("%lld\n",ans);
return 0;
} | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n,0);
REP(i,n) cin >> a[i];
sort(a.begin(), a.end());
bool ok = true;
REP(i,n){
if(i != n-1){
if(a[i] == a[i+1]){
ok = false;
}
}
}
if(ok) cout << "YES" << endl;
else cout << "NO" << endl;
} | //\\//\\ * * * //\\// ||
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
const int N = 110;
int a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = j + 1; k < n; k++) {
if (a[i] != a[j] && a[i] != a[k] && a[j] != a[k]) {
if (a[i] + a[j] > a[k]) {
++ans;
// debug(i);
// debug(j);
// debug(k);
// debug(a[i]);
// debug(a[j]);
// debug(a[k]);
}
}
}
}
}
cout << ans << '\n';
return 0;
}
| 0 |
#ifndef TEMPLATE_HPP
#define TEMPLATE_HPP
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
#define sz(v) ((int) v.size())
using namespace std;
using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> void chmax(T &x, T y) { x = max(x, y); }
template <typename T> void chmin(T &x, T y) { x = min(x, y); }
template <typename T> T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename U> vector<U> make_vector(T&& n, U&& val) { return vector<U>(forward<T>(n), forward<U>(val)); }
template <typename T, typename... Args> decltype(auto) make_vector(T&& n, Args&&... args) { return vector<decltype(make_vector(forward<Args>(args)...))>(forward<T>(n), make_vector(forward<Args>(args)...)); }
const int INF = 1001001001;
const i64 LINF = 1001001001001001001ll;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
#endif
void solve() {
int n;
cin >> n;
vi32 a(n);
cin >> a;
sort(a.rbegin(), a.rend());
map<int, int> cnt;
rep(i, n) cnt[a[i]]++;
int ans = 0;
rep(i, n) {
if (cnt[a[i]] == 0) continue;
cnt[a[i]]--;
int m = 1;
while (a[i] >= m) m <<= 1;
int b = m - a[i];
if (cnt[b] == 0) continue;
cnt[b]--;
ans += 1;
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
solve();
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
while(1)
{
int sell_num[10] = {};
cin >> n;
if(n == 0)
{
break;
}
for(int i=0; i<n; i++)
{
int id;
cin >> id;
sell_num[id]++;
}
for(int i=0; i<10; i++)
{
if(sell_num[i] == 0)
{
cout << "-" << endl;
}
else
{
string str;
for(int j=0; j<sell_num[i]; j++)
{
str += "*";
}
cout << str << endl;
}
}
}
return 0;
} | 0 |
#include<stdio.h>
int d,t,s;
int main()
{
scanf("%d %d %d", &d, &t, &s);
d=d+s-1;
if(t>=(d/s))printf("Yes");
else printf("No");
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
const double PI=3.14159265358979323846;
const in MOD = 1000000007;
const in INF=1e18+7;
const int inf=1e9+7;
using P=pair<int,int>;
vector<int> dx={0,1,-1,0};
vector<int> dy={1,0,0,-1};
using ld=long double;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cout << fixed << setprecision(10);
ld n,m,d;
cin>>n>>m>>d;
ld ans=(m-1.0)*(n-d);
if(d!=0.0) ans *=2.0;
ans /=n;
ans /=n;
cout<<ans<<'\n';
}/*
./problem.exe
*/ | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string root;
int sx, sy, tx, ty;
int dx, dy;
int i, j;
cin >> sx >> sy >> tx >> ty;
dx = tx - sx;
dy = ty - sy;
//root = NULL;
//root = '\0';
root = 'R';
for (i=1; i<dx; i++){
root = root + 'R';
}
for (i=0; i<dy; i++) {
root = root + 'U';
}
for (i=0; i<dx; i++){
root = root + 'L';
}
for (i=0; i<dy; i++) {
root = root + 'D';
}
root = root +'L';
for (i=0; i<dy+1; i++) {
root = root + 'U';
}
for (i=0; i<dx+1; i++){
root = root + 'R';
}
root = root +'D';
root = root +'R';
for (i=0; i<dy+1; i++) {
root = root + 'D';
}
for (i=0; i<dx+1; i++){
root = root + 'L';
}
root = root +'U';
cout << root << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
#define INF 100000100LL
int main(){
int A, B, M;
cin >> A >> B >> M;
ll ans = INF, MINa = INF, MINb = INF;
vector<ll> a(A), b(B);
rep(i, A){
cin >> a[i];
MINa = min(MINa, a[i]);
}
rep(i, B){
cin >> b[i];
MINb = min(MINb, b[i]);
}
ans = min(ans, MINa + MINb);
rep(i, M){
int x, y, c;
cin >> x >> y >> c;
x--; y--;
ll tmp = a[x] + b[y] - c;
ans = min(ans, tmp);
}
cout << ans << endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i, n) for (int i=0; i<int(n); i++)
int main() {
string s,t; cin >> s >> t;
cout << t+s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
int k;
string ss;
cin>>k>>s;
if(s.length()>k){
for(int i=0; i<k; i++){
ss += s[i];
}
ss+="...";
}
else {
ss =s;
}
cout<<ss;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
int n, m;
cin >> n >> m;
int p;
string s;
vector<int>v(n, 0);
int c = 0, w = 0;
rep(i, m) {
cin >> p >> s;
p--;
if (v[p] != -1) {
if (s == "AC") {
w += v[p];
c++;
v[p] = -1;
}else{
v[p]++;
}
}
}
cout << c << ' ';
cout << w << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = 0x3F3F3F3F;
const int NEGINF = 0xC0C0C0C0;
const int NULO = -1;
const double EPS = 1e-10;
const ll mod = 1e9 + 7;
inline int cmp(double x, double y = 0)
{
if(fabs(x - y) < EPS)
return 0;
return x > y ? 1 : -1;
}
ll exp(ll a, ll b)
{
ll ans = 1;
while(b)
{
if(b & 1)
ans = (ans * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
const int maxn = 1005;
vector<int>graph[maxn];
vector<int>ans;
int n,m;
int vis[maxn];
void dfs(int u, int target)
{
vis[u] = 1;
for(const auto &v: graph[u])
{
if(vis[v] == 1)
{
if(v == target)
{
vector<int>cycle;
for(int i = 1; i <= n ; i++)
if(vis[i] == 1)
cycle.push_back(i);
if(ans.size() == 0 || cycle.size() < ans.size())
ans = cycle;
}
}
else if(vis[v] == 0)
{
dfs(v, target);
}
}
vis[u] = 2;
}
int main()
{
ios::sync_with_stdio(false);
cin >> n >> m;
for(int i = 0 ; i < m ; i++)
{
int u,v;
cin >> u >> v;
graph[u].push_back(v);
}
for(int i = 1 ; i <= n ; i++)
{
MSET(vis, 0);
dfs(i, i);
}
if(ans.size() == 0)
cout << "-1\n";
else
{
cout << ans.size() << endl;
for(int i = 0; i < ans.size(); i++)
{
cout << ans[i] << endl;
}
}
return 0;
} | 0 |
/* Great things never come from comfort zones,
"whatever the mind of a man can conceive and believe,it can achieve." */
#include <bits/stdc++.h>
#define ll long long
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) printf("%d\n",(int)n)
#define lprin(n) printf("%lld\n",n)
#define rep(i,ini,n) for(ll i=ini;i<(int)n;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define tc int tt; scf(tt); while(tt--)
#define inf INT_MAX
#define ninf INT_MIN
#define gcd __gcd
#define bitcount(n) __builtin_popcount(n)
typedef double dd;
using namespace std;
const ll mod =1e9+7;
const int N = 1e6+7;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
int main()
{
int n;
scf(n);
if(n==1)
cout<<"Hello World";
else
{
int a,b;
scf(a),scf(b);
prin(a+b);
}
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string str;
int q;
int a,b;
string p;
string query;
cin>>str;
cin>>q;
for(int i=0;i<q;++i){
cin>>query;
cin>>a>>b;
if(query=="print"){
cout<<str.substr(a,b-a+1)<<endl;
}else if(query=="reverse"){
reverse(&(str[a]), &(str[b+1]));
}else if(query=="replace"){
cin>>p;
for(int j=0;j<b-a+1;++j){
str[a+j] = p[j];
}
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 303;
const int MOD = 998244353;
int n, k;
char s[N];
vector<int> ones;
int dp[N][N][N];
int f(int x, int use, int sum) {
if (use > k) return 0;
if (x < 0) return sum == 0;
if (~dp[x][use][sum]) return dp[x][use][sum];
int ret = f(x-1, use, sum);
for (int i = 1; i <= ones[x]; ++i) {
ret = (ret + f(x-1, use + i, sum + i)) % MOD;
}
for (int i = 1; i <= sum; ++i) {
ret = (ret + f(x-1, use, sum - i)) % MOD;
}
return dp[x][use][sum] = ret;
}
int solve() {
scanf("%s %d", s, &k);
int n = strlen(s);
ones.push_back(0);
for (int i = 0; i < n; ++i) {
if (s[i] == '0') {
ones.push_back(0);
} else {
++ones.back();
}
}
// for (int o: ones) cerr << o << " "; cerr << endl;
memset(dp, -1, sizeof dp);
printf("%d\n", f((int) ones.size() - 1, 0, 0));
return 0;
}
int main() {
int t = 1;
// scanf("%d", &t);
while (t--) solve();
return 0;
}
| #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
namespace asl
{
template <typename T>
std::vector<std::vector<T>> board(int n = 0, int m = 0)
{
return std::vector<std::vector<T>>(n, std::vector<T>(m));
}
}
namespace asl
{
const int m1000000007 = 1000000007;
const int m998244353 = 998244353;
int MOD = m1000000007;
void set_mod(int mod)
{
MOD = mod;
}
class Mint
{
public:
int val;
Mint(long long v = 0)
{
if (v >= 0)
{
if (v < MOD)
val = v;
else
val = v % MOD;
}
else
{
if (v >= -MOD)
{
val = v + MOD;
}
else
{
v %= MOD;
if (v < 0)
v += MOD;
val = v;
}
}
}
Mint &operator+=(const Mint &other)
{
val += other.val;
if (val >= MOD)
val -= MOD;
return *this;
}
Mint &operator-=(const Mint &other)
{
val -= other.val;
if (val < 0)
val += MOD;
return *this;
}
friend std::ostream &operator<<(std::ostream &stream, const Mint &m)
{
return stream << m.val;
}
};
}
#include <random>
#define endl '\n'
using namespace std;
using namespace asl;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
set_mod(m998244353);
string s;
int k;
cin >> s >> k;
s += "0";
vector<int> g;
int total = 0;
int ones = 0;
for (auto x : s)
{
if (x == '1')
{
++total;
++ones;
}
else
{
g.push_back(total);
total = 0;
}
}
reverse(g.begin(), g.end());
auto dp = board<Mint>(ones + 1, ones + 1);
dp[0][0] = 1;
for (int i = 0; i < g.size(); ++i)
{
auto ndp = board<Mint>(ones + 1, ones + 1);
for (int k = 0; k <= ones; ++k)
{
for (int l = 0; l <= ones; ++l)
{
if (l > 0 && k > 0)
ndp[l][k] = ndp[l - 1][k - 1];
int rmin = l - g[i] - 1;
if (rmin >= 0 && k - l + rmin >= 0)
ndp[l][k] -= dp[rmin][k - l + rmin];
int rmax = l - 1;
if (rmax >= 0 && k - l + rmax >= 0)
ndp[l][k] += dp[rmax][k - l + rmax];
}
}
for (int k = 0; k <= ones; ++k)
{
Mint A(0);
for (int l = ones; l >= 0; --l)
{
A += dp[l][k];
ndp[l][k] += A;
}
}
dp.swap(ndp);
}
Mint ans;
for (int d = 0; d <= min(ones, k); ++d)
{
ans += dp[0][d];
}
cout << ans << endl;
return 0;
}
| 1 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>
#include <queue>
#include <map>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
//BDD,ZDD,kdtree, bdtree,bicalc, bolonoy, doloney,chinesemod,segmenttree,daikusutora, saidairyuu, 2bugurahu, heirokenshutu, topologicalsort, kyourenketuseibun
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
int ctoi(char c) {
switch (c)
{
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
case '4': return 4;
case '5': return 5;
case '6': return 6;
case '7': return 7;
case '8': return 8;
case '9': return 9;
default:
cout << "ERR_ctoi" << endl;
return -1;
}
}
//最大公約数
template<typename T>
constexpr T gcd(T a, T b)
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
//最小公倍数
template<typename T>
constexpr T lcm(T a, T b)
{
return a * b / gcd(a, b);
}
int main() {
int a, b;
cin >> a >> b;
if (a <= 8 && b <= 8) {
PRI("Yay!");
}
else PRI(":(");
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(i=a;i<b;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define hell 1000000007
using namespace std;
const int N=500;
void solve()
{
ll i,j,k,n,m,c=0,ans=0;
string s;
cin>>n>>m;
if(abs(n-m)<=16-n-m)
cout<<"Yay!";
else cout<<":(";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
//cin>>t;
while(t--)
solve();
}
| 1 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define ggr getchar();getchar();return 0;
#define prique priority_queue
constexpr auto mod = 1000000007;
#define inf 1e15
#define key 1e9
using namespace std;
typedef pair<int, int>P;
template<class T> inline void chmax(T& a, T b) {
a = std::max(a, b);
}
template<class T> inline void chmin(T& a, T b) {
a = std::min(a, b);
}
//combination(Nが小さい時はこれを使う
const int MAX = 2330000;
int 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 COMB(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;
}
bool prime(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)cnt++;
}
if (cnt != 1)return false;
else return n != 1;
}
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
int lcm(int x, int y) {
return x / gcd(x, y) * y;
}
//繰り返し二乗法（Nが大きい時の場合のcombination)
int mod_pow(int x, int y, int m) {
int res = 1;
while (y) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= (i % mod); res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
//UnionFind
class UnionFind {
protected:
int* par, * rank, * size;
public:
UnionFind(unsigned int size) {
par = new int[size];
rank = new int[size];
this->size = new int[size];
rep(i, size) {
par[i] = i;
rank[i] = 0;
this->size[i] = 1;
}
}
int find(int n) {
if (par[n] == n)return n;
return par[n] = find(par[n]);
}
void unite(int n, int m) {
n = find(n);
m = find(m);
if (n == m)return;
if (rank[n] < rank[m]) {
par[n] = m;
size[m] += size[n];
}
else {
par[m] = n;
size[n] += size[m];
if (rank[n] == rank[m])rank[n]++;
}
}
bool same(int n, int m) {
return find(n) == find(m);
}
int getsize(int n) {
return size[find(n)];
}
};
int dight(int n) {
int ans = 1;
while (n >= 10) {
n /= 10;
ans++;
}
return ans;
}
int dight_sum(int n) {
int sum = 0;
rep(i, 20)sum += (n % (int)pow(10, i + 1)) / (pow(10, i));
return sum;
}
int dight_min(int n) {
int ans = 9;
while (n >= 10) {
ans = min(ans, n % 10);
n /= 10;
}
ans = min(ans, n);
return ans;
}
int dight_max(int n) {
int ans = 0;
while (n >= 10) {
ans = max(ans, n % 10);
n /= 10;
}
ans = max(ans, n);
return ans;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
int n, m, k;
cin >> n >> m >> k;
int xx = 0, yy = 0, memo = comb(n * m - 2, k - 2);
for (int i = 1; i <= n - 1; i++) {
int p = ((n - i) * m * m * i) % mod * memo % mod;
xx += p;
xx %= mod;
}
for (int j = 1; j <= m - 1; j++) {
int p = ((m - j) * n * n * j) % mod * memo % mod;
yy += p;
yy %= mod;
}
cout << (xx + yy) % mod << endl;
ggr
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <unordered_map>
#define rep(i,n) for(ll i=0;i<n;i++)
#define repn(i,n) for(ll i=1;i<=n;i++)
using namespace std;
typedef long long ll;
const ll MOD=1'000'000'007;
const ll c[7]={1,2,3,5,8,13,21};
ll H,W,K;
ll dp[101][8];
int main(){
rep(i,101) fill(dp[i],dp[i]+8,0);
dp[0][0]=1;
cin>>H>>W>>K;
repn(i,H){
rep(j,W){
if(j==0)
dp[i][j]=dp[i-1][j]*c[max((ll)0,W-2)]
+dp[i-1][j+1]*c[max((ll)0,W-3)];
else if(j==W-1)
dp[i][j]=dp[i-1][j]*c[max((ll)0,W-2)]
+dp[i-1][j-1]*c[max((ll)0,W-3)];
else
dp[i][j]=dp[i-1][j-1]*c[max((ll)0,j-2)]*c[max((ll)0,W-j-2)]
+dp[i-1][j]*c[max((ll)0,j-1)]*c[max((ll)0,W-j-2)]
+dp[i-1][j+1]*c[max((ll)0,j-1)]*c[max((ll)0,W-j-3)];
dp[i][j]%=MOD;
}
}
ll ans=dp[H][K-1]>=0?dp[H][K-1]:dp[H][K-1]+MOD;
cout<<ans<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//name[i][j]-> vvl name(i,vl(j))
//map<int,int>mp
//余りを切り上げる => (a + b - 1) / b
signed main(){
int a,b,c; cin>>a>>b>>c;
int k; cin>>k;
int d=max({a,b,c});
//d*=2;
rep(i,0,k) d*=2;
cout<<(a+b+c-max({a,b,c})+d);
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (ll)(m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (ll)(m); --i)
template<class T, class U> bool chmax(T &a, U b) { if (a < b) a = b; return true; }
template<class T, class U> bool chmin(T &a, U b) { if (a > b) a = b; return true; }
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
vi d(3);
rep(i, 3) cin >> d[i];
int k; cin >> k;
sort(all(d));
rep(i, k) d[2] *= 2;
cout << accumulate(all(d),0) << endl;
return (0);
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b) return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
int main() {
ll n, m, q;
cin >> n >> m >> q;
vector<vector<ll>> z(n+1,vector<ll>(n+1));
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
z[a][b]++;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
z[i][j + 1] += z[i][j];
}
}
for (int i = 0; i < q; i++) {
ll a, b;
cin >> a >> b;
ll ans = 0;
for (int j = a; j < b+1; j++) {
ans += z[j][b];
}
cout << ans << endl;
}
} | //-- In The Name of God --
#include<bits/stdc++.h>
using namespace std;
#define mod 1e9+7
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define fii freopen("input.txt","r",stdin);
#define foo freopen("output.txt","w",stdout);
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
const ll mx=1e5+100;
ll arr[600][600];
map<pair<ll,ll>,bool>visit;
int main()
{
fast;
ll i,j,a,b,c,d,n,m,t;
cin>>n>>m;
memset(arr,-1,sizeof(arr));
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
cin>>arr[i][j];
}
}
vector<pair<pair<ll,ll>,pair<ll,ll> > >vec;
ll flag=1;
for(i=1;i<=n;i++)
{
if(flag==1)
{
for(j=1;j<m;j++)
{
if(arr[i][j]&1)
{
if(arr[i][j+1]!=-1)
{
arr[i][j+1]+=1;
vec.pb(mp(mp(i,j),mp(i,j+1)));
}
}
}
if(arr[i+1][m]!=-1 && arr[i][m]&1)
{
arr[i+1][m]+=1;
vec.pb(mp(mp(i,j),mp(i+1,j)));
}
flag=2;
}
else if(flag==2)
{
for(j=m;j>1;j--)
{
if(arr[i][j]&1)
{
arr[i][j-1]+=1;
vec.pb(mp(mp(i,j),mp(i,j-1)));
}
}
if(arr[i+1][1]!=-1 && arr[i][1]&1)
{
arr[i+1][1]+=1;
vec.pb(mp(mp(i,j),mp(i+1,j)));
}
flag=1;
}
}
ll cnt=vec.size();
cout<<cnt<<endl;
for(auto it:vec)
{
a=it.first.first;
b=it.first.second;
c=it.second.first;
d=it.second.second;
cout<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
}
return 0;
}
| 0 |
#include <iostream>
int main () {
std::string a, b, c;
std::cin >> a >> b >> c;
if(a.substr(a.size()-1, 1) == b.substr(0, 1) && b.substr(b.size()-1, 1) == c.substr(0, 1)) {
std::cout << "YES" << std::endl;
}else {
std::cout << "NO" << std::endl;
}
} | #include <stdio.h>
int main() {
char str[31], ctr = 0;
scanf("%[^\n]", str);
for(int i = 0; str[i] != '\0'; i++) {
if(str[i] == ' ' && str[i-1] == str[i+1]) {
ctr++;
}
}
if(ctr == 2) {
puts("YES");
}
else {
puts("NO");
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#include<tr1/unordered_map>
#define ri register int
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> poly;
#define pb push_back
const int rlen=1<<18|1,inf=0x3f3f3f3f;
const ll Inf=1e18;
char buf[rlen],*ib=buf,*ob=buf;
#define gc() (((ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin)),ib==ob)?-1:*ib++)
inline int read() {
int ans=0;
bool f=1;
char ch=gc();
while(!isdigit(ch)) f^=ch=='-',ch=gc();
while(isdigit(ch)) ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return f?ans:-ans;
}
inline ll readl() {
ll ans=0;
bool f=1;
char ch=gc();
while(!isdigit(ch)) f^=ch=='-',ch=gc();
while(isdigit(ch)) ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return f?ans:-ans;
}
inline int Read(char*s) {
int tp=0;
char ch=gc();
while(!isdigit(ch)&&!isalpha(ch)) ch=gc();
while(isdigit(ch)||isalpha(ch)) s[++tp]=ch,ch=gc();
return tp;
}
namespace modular {
const int mod=1e9+7;
inline int add(int a,int b) { return a+b<mod?a+b:a+b-mod; }
inline int dec(int a,int b) { return a<b?a-b+mod:a-b; }
inline int mul(int a,int b) { return (ll)a*b%mod; }
inline void Add(int&a,int b) { a=a+b<mod?a+b:a+b-mod; }
inline void Dec(int&a,int b) { a=a<b?a-b+mod:a-b; }
inline void Mul(int&a,int b) { a=(ll)a*b%mod; }
inline int ksm(int a,int p) { int ret=1;for(;p;p>>=1,Mul(a,a)) (p&1)&&(Mul(ret,a),1);return ret; }
inline int Inv(int a) { return ksm(a,mod-2); }
inline int sqr(int a) { return mul(a,a); }
inline int cub(int a) { return (ll)a*a%mod*a%mod; }
}
using namespace modular;
template<typename T> inline void ckmax(T&a,T b) { a<b?a=b:0; }
template<typename T> inline void ckmin(T&a,T b) { a>b?a=b:0; }
template<typename T> inline T gcd(T a,T b) { T t;while(b)t=a,a=b,b=t-t/a*a;return a; }
template<typename T> inline T Abs(T x) { return x<0?-x:x; }
inline int rd() { return rand()|(rand()<<15); }
const int N=5e5+5;
int n,pre[N],suf[N];
pii a[N];
int main() {
#ifdef ldxcaicai
freopen("lx.in","r",stdin);
#endif
n=read();
for(ri i=1;i<=n;++i) a[i].fi=read(),a[i].se=read();
sort(a+1,a+n+1);
pre[0]=0x3f3f3f3f,suf[n]=0x3f3f3f3f;
for(ri i=1;i<n;++i) pre[i]=min(pre[i-1],a[i].se);
for(ri i=n-1;i;--i) suf[i]=min(suf[i+1],a[i].se);
int res=0;
for(ri mn,r1,r2,t,i=1;i<n;++i) {
r1=a[i].se,r2=min(max(suf[i+1],a[n].fi-1),a[n].se);
t=(r1-a[i].fi+1)+(r2-a[n].fi+1);
mn=pre[i-1];
ckmax(res,t-max(0,min(r1-max(a[i].fi-1,mn),r2-max(a[n].fi-1,mn))));
}
cout<<res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
#define all(x) x.begin(),x.end()
const int maxn = 100010;
const int INF = INT_MAX/2;
int n;
vector <pi> v;
int pre[maxn],suf[maxn];
int dist(int x, int y) {
return max(y - x + 1,0ll);
}
int32_t main() {
FAST
cin >> n;
v.push_back(pi(0,0));
for (int i =1;i<=n;i++) {
int a,b; cin >> a >> b;
v.push_back(pi(a,b));
}
sort(all(v));
//CASE 1: All .f of group 1 < All .f of group 2
//prefix[i] from 1 to i
int maxl=0, minr=INF;
for (int i = 1;i<=n;i++) {
maxl = max(maxl,v[i].f);
minr = min(minr,v[i].s);
pre[i] = dist(maxl,minr);
}
int whack = pre[n];
//Suffix[i] from n to i+1
maxl = 0; minr = INF;
for (int i =n-1;i>=1;i--) {
maxl = max(maxl,v[i+1].f);
minr = min(minr,v[i+1].s);
suf[i] = dist(maxl,minr);
}
int ans = 0;
for (int i =1;i<n;i++) {
ans = max(ans, pre[i] + suf[i]);
}
//CASE 2: Just take largest guy for group 1 and throw the rest into group 2.
for (int i =1;i<=n;i++) {
ans = max(ans, whack + dist(v[i].f,v[i].s));
}
cout << ans;
}
| 1 |
#include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, q, inf=2e9, cnt;
vector<int> par ;
vector<pair<int,pair<int,int> > > v;
map<int,int> id ;
int tree[3000006];
void update(int node, int s, int e, int l, int r, int val)
{
if(s>r||e<l)
return ;
if(s>=l && e<=r)
{
tree[node]=min(tree[node],val);
return ;
}
int m=(s+e)/2;
update(2*node,s,m,l,r,val);
update(2*node+1,m+1,e,l,r,val);
}
int solve(int node, int s,int e, int pos)
{
if(s==e)
return tree[node];
int m=(s+e)/2;
tree[2*node]=min(tree[node],tree[2*node]);
tree[2*node+1]=min(tree[node],tree[2*node+1]);
return pos<=m ? solve(2*node,s,m,pos) : solve(2*node+1,m+1,e,pos);
}
int main()
{
IO
cin>>n>>q;
for(int i=1; i<=3e6; i++)
tree[i]=inf;
for(int i=1; i<=n; i++)
{
int s, t, x;
cin>>s>>t>>x;
v.push_back({x,{s-x,t-x-1}});
id[s-x]++;
id[t-x-1]++;
}
for(int i=1; i<=q; i++)
{
int d;
cin>>d;
id[d]++;
par.push_back(d);
}
for(auto i : id)
id[i.first]=++cnt;
for(int i=0; i<n; i++)
{
int l=id[v[i].second.first], r=id[v[i].second.second];
update(1,1,cnt,l,r,v[i].first);
}
for(int i=0; i<q; i++)
{
int ans=solve(1,1,cnt,id[par[i]]);
if(ans==inf)
ans=-1;
cout<<ans<<"\n";
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const ll inf=1e9+7;
const ll INF=1e18;
int main(){
int n,q;cin>>n>>q;
int S,T,X;
vector<tuple<int,int,int>> ban(n);
rep(i,n){
cin>>S>>T>>X;
ban[i]=make_tuple(X,S-X,T-X);
}
sort(all(ban));
int d;
map<int,int> num;
set<int> time;
rep(i,q){
cin>>d;
num[d]=i;
time.insert(d);
}
time.insert(inf);
vin ans(q,-1);
//s<=d<tなるdをxが小さい順に見つけていく
queue<int> que;
int x,s,t;
rep(i,n){
if(time.size()==1)break;
x=get<0>(ban[i]);
s=get<1>(ban[i]);
t=get<2>(ban[i]);
auto l=time.lower_bound(s);
auto r=time.lower_bound(t);
for(auto itr=l;itr!=r;itr++){
ans[num[*itr]]=x;
que.push(*itr);
}
while(que.size()){
time.erase(que.front());
que.pop();
}
}
rep(i,q)cout<<ans[i]<<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 6010;
int MOD;
int dp[N][2*N];
int add(int a, int b){
return (a + b) % MOD;
}
int mul(ll a, int b){
return (a * b) % MOD;
}
void sadd(int &a, int b){
a = add(a, b);
}
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n;cin >> n >> MOD;
n *= 3;
dp[0][n] = 1;
for(int i=1 ; i<=n ; i++)
for(int j=0 ; j<=2*n ; j++){
if(j)
sadd(dp[i][j], dp[i-1][j-1]);
if(i>1)
sadd(dp[i][j], mul(i-1, dp[i-2][j+1]));
if(i>2)
sadd(dp[i][j], mul((i-1)*(i-2), dp[i-3][j]));
}
int ans=0;
for(int i=n ; i<=2*n ; i++)
sadd(ans, dp[n][i]);
cout << ans << "\n";
}
| #include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int i=(s);(i)<(int)(e);++(i))
#define REP(i,e) FOR(i,0,e)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define ppb(x) pop_back(x)
#define mp make_pair
#define mt make_tuple
#define t0(t) get<0>((t))
#define t1(t) get<1>((t))
#define t2(t) get<2>((t))
typedef long long ll;
int main() {
int h, w;
fscanf(stdin, "%d%d ", &h, &w);
multiset<int> hd; // horizontal distance between from start to current position
map<int, int> hdmap; // (current column, start column) to obtain the answer in log(n)
REP(i,w) {
hdmap[i] = i;
hd.insert(0);
}
REP(i,h) {
int l, r;
fscanf(stdin, "%d%d ", &l, &r);
--l; // semiopen interval [l-1, r) based on 0-index
auto it = hdmap.lower_bound(l);
int re = -1;
while (it != hdmap.end() && it->first <= r) {
re = max(re, it->second);
hd.erase(hd.find(it->first - it->second));
hdmap.erase(it++);
}
// the only optimal start point in [l-1, r) remains
if (re != -1 && r < w) {
hd.insert(r-re);
hdmap[r] = re;
}
int res = -1;
if (hd.size()) res = *hd.begin() + (i+1);
fprintf(stdout, "%d\n", res);
}
return 0;
}
| 0 |
#include <cstdio>
#include <cassert>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <iostream>
using namespace std;
void erase1(multiset<int> &s, int x) {
auto it = s.find(x);
if (it != s.end()) s.erase(it);
}
const int INF = 1<<30;
vector<int> solve(int H, int W, const int *L, const int *R) {
map<int, int> m;
multiset<int> distances;
vector<int> ans(H);
for (int i = 0; i < W; i++) {
m[i] = 0;
distances.insert(0);
}
for (int h = 0; h < H; h++) {
int l = L[h], r = R[h];
auto it = m.lower_bound(l);
int d = INF;
while (it != m.end() && it->first <= r) {
d = min(d, it->second + r + 1 - it->first);
erase1(distances, it->second);
it = m.erase(it);
}
if (d < INF && r < W - 1) {
if (it == m.end() || it->first > r + 1) {
m[r+1] = d;
distances.insert(d);
} else if (d < it->second) {
erase1(distances, it->second);
distances.insert(d);
m[r+1] = d;
}
}
ans[h] = distances.empty() ? -1 : *distances.begin() + h + 1;
}
return ans;
}
vector<int> check(int H, int W, const int *L, const int *R) {
int dp[H+1][W];
fill(dp[0], dp[0]+W, 0);
for (int i = 1; i <= H; i++) {
dp[i][0] = L[i-1] == 0 ? INF : dp[i-1][0];
for (int j = 1; j < W; j++) {
if (j < L[i-1]) dp[i][j] = min(dp[i-1][j], dp[i][j-1] + 1);
else if (j <= R[i-1]) dp[i][j] = dp[i][j-1] + 1;
else dp[i][j] = min(dp[i-1][j], dp[i][j-1] + 1);
}
}
vector<int> ans(H);
for (int h = 0; h < H; h++) {
ans[h] = h + 1 + *min_element(dp[h+1], dp[h+1] + W);
if (ans[h] >= INF) ans[h] = -1;
}
return ans;
}
int main() {
int H, W; scanf("%d %d", &H, &W);
int L[H], R[H];
for (int i = 0; i < H; i++) {
scanf(" %d %d ", &L[i], &R[i]);
L[i]--; R[i]--;
}
vector<int> ans = solve(H, W, L, R);
for (int x : ans) printf("%d\n", x);
// vector<int> expect = check(H, W, L, R);
// for (int x : expect) cerr << x << endl;
// for (int i = 0; i < H; i++) assert(ans[i] == expect[i]);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
map<int, int> MA;
multiset<int> MS;
for (int i = 0; i < W; i++) MA[i] = i, MS.insert(0);
for (int h = 1, A, B; cin >> A >> B; h++) {
auto it = MA.lower_bound(--A);
int tmp = -1;
while (it != MA.end() && it -> first <= B) {
tmp = max(tmp, it -> second);
MS.erase(MS.find(it -> first - it -> second));
MA.erase(it++);
}
if (tmp != -1 && B < W) MA[B] = tmp, MS.insert(B - tmp);
cout << ((MS.size()) ? *MS.begin() + h : -1) << "\n";
}
} | 1 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=2005,Mod=1e9+7;
int dp[N][N],fac[N*N],inv[N*N];
inline int C(int n,int m){
return 1ll*fac[n]*inv[m]%Mod*inv[n-m]%Mod;
}
inline int qpow(int a,int b){
int ans=1;
while (b){
if (b&1) ans=1ll*ans*a%Mod;
a=1ll*a*a%Mod,b>>=1;
}
return ans;
}
int main (){
int n,k;scanf ("%d%d",&n,&k);
if (k==1) {puts("1");return 0;}
dp[0][0]=1;fac[0]=1;
for (int i=1;i<=n*k;i++) fac[i]=1ll*fac[i-1]*i%Mod;
inv[n*k]=qpow(fac[n*k],Mod-2);for (int i=n*k-1;i>=0;i--) inv[i]=1ll*inv[i+1]*(i+1)%Mod;
for (int i=0;i<=n;i++) dp[i][0]=1;
for (int i=1;i<=n;i++)
for (int j=0;j<=i;j++)
dp[i][j]=dp[i-1][j]+1ll*dp[i][j-1]*(n-j+1)%Mod*C(n*k-(i+(j-1)*(k-1))-1,k-2)%Mod,dp[i][j]%=Mod;
printf ("%d",dp[n][n]);
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <climits>
#include <algorithm>
using namespace std;
string a;
int d,n,mod=1e9+7;
int digitSum(int idx,int sum,bool tight,vector<vector<int> > &dp){
if(idx==n)
return sum==0?1:0;
if(!tight&&dp[n-idx-1][sum]!=-1)
return dp[n-idx-1][sum];
int ans =0;
int k = tight?a[idx]-48:10;
for(int i=0;i<k;i++)
ans = (digitSum(idx+1,(sum+i)%d,0,dp)+ans)%mod;
if(tight){
ans = (digitSum(idx+1,(sum+k)%d,1,dp)+ans)%mod;
} else {
dp[n-idx-1][sum] = ans;
}
return ans;
}
int main()
{
cin >> a >> d;
n = a.size();
vector<vector<int> > dp(n,vector<int>(d,-1));
cout << (digitSum(0,0,1,dp)-1+mod)%mod;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
vector<int> num(3);
rep(i, 3) cin >> num.at(i);
for(int i = 1; i < 3; i++) {
int tmp = 0;
tmp = num.at(0);
num.at(0) = num.at(i);
num.at(i) = tmp;
}
rep(i, 3) cout << num.at(i) << " ";
cout << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
void abc_160a();
void abc_161a();
int main()
{
//abc_160a();
abc_161a();
}
void abc_160a()
{
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5]) cout << "Yes\n";
else cout << "No\n";
}
void swap(int& a, int& b)
{
int tmp;
tmp = a;
a = b;
b = tmp;
}
void abc_161a()
{
int x, y, z;
cin >> x >> y >> z;
swap(x, y);
swap(x, z);
cout << x << " " << y << " " << z << "\n";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int insertionSort(vector<int> &A, int N, int g, int &cnt){
for(int i = g; i < N; i++){
int v = A.at(i);
int j = i - g;
while(j >= 0 && A.at(j) > v){
A.at(j+g) = A.at(j);
j = j - g;
cnt++;
}
A.at(j+g) = v;
}
}
void shellSort(vector<int> &A, int N){
int cnt = 0;
int m;
vector<int> G(100);
for(int i = 0; i < 100; i++){
if(i == 0){
G.at(i) = N / 2 + 1;
}
else{
G.at(i) = G.at(i-1) / 2 - 1;
}
if(G.at(i) < 0){
G.at(i-1) = 1;
G.at(i) = 0;
m = i;
break;
}
}
for(int i = 0; i < m; i++){
insertionSort(A, N, G.at(i), cnt);
}
cout << m << endl;
for(int i = 0; i < m; i++){
if(i) cout << " ";
cout << G.at(i);
}
cout << endl << cnt << endl;
for(int i = 0; i < N; i++){
cout << A.at(i) << endl;
}
}
int main(){
int n;
cin >> n;
vector<int> R(n);
for(int i = 0; i < n; i++){
cin >> R.at(i);
}
shellSort(R, n);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
void insertion_sort(vector<int>& A, int n, int g, int& cnt)
{
for (int i = g; i < n; ++i) {
int key = A[i];
int j = i - g;
while (j >= 0 && A[j] > key) {
A[j + g] = A[j];
j -= g;
++cnt;
}
A[j + g] = key;
}
}
void shell_sort(vector<int>& A, int n, int& cnt)
{
vector<int> G;
int h = 1;
G.push_back(h);
int upper = n / 2;
if (n >= 1000) { upper = n / 9; }
else if (n >= 100) { upper = n / 7; }
for (int i = 3 * h + 1; i < upper; i = 3 * i + 1) {
G.push_back(i);
}
reverse(G.begin(), G.end());
int m = G.size();
fprintf(stdout, "%d\n", m);
for (int i = 0; i < m; ++i) {
if (i) { fprintf(stdout, " "); }
fprintf(stdout, "%d", G[i]);
}
fprintf(stdout, "\n");
for (int i = 0; i < m; ++i) {
insertion_sort(A, n, G[i], cnt);
}
}
int main()
{
int n = 0;
fscanf(stdin, "%d", &n);
vector<int> A(n);
for (int i = 0; i < n; ++i) {
fscanf(stdin, "%d", &A[i]);
}
int cnt = 0;
shell_sort(A, n, cnt);
fprintf(stdout, "%d\n", cnt);
for (int i = 0; i < n; ++i) {
fprintf(stdout, "%d\n", A[i]);
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll s;
cin >> s;
int cnt = 0;
ll S = s;
while(S > 0){
S /= 10;
cnt++;
}
const int f = 753;
int ans = 1000;
for(int i = 3; i <= cnt; i++){
int x = s/pow(10,cnt -i);
ans = min(abs(x-f), ans);
ll p = pow(10,cnt+2-i);
s %= p;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int main(){
string s;
cin >> s;
vector<int> cnts;
bool isS = true;
int cnt = 0;
rep(i,s.size()){
if (isS && s[i] == 'T'){
cnts.push_back(cnt);
isS = !isS;
cnt = 0;
}else if (!isS && s[i] == 'S'){
cnts.push_back(cnt);
isS = !isS;
cnt = 0;
}
cnt++;
}
cnts.push_back(cnt);
if (s[s.size()-1] != 'S') cnts.push_back(0);
int tot = cnts[1] - cnts[0];
int ans = 0, sz = cnts.size();
for(int i = 3; i < sz; i+=2){
tot += cnts[i] - cnts[i-1];
ans = max(ans, tot);
}
tot = cnts[sz-1];
ans = max(ans, tot);
for(int i = sz-3; i >= 0; i -= 2){
tot += cnts[i] - cnts[i+1];
ans = max(ans, tot);
}
cout << ans * 2 << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
long long n,q;
cin >> n >> q;
long long s[n],t[n],x[n],d[q];
pair<long long, int> p[n];
for(int i=0;i<n;i++){
cin >> s[i] >> t[i] >> x[i];
p[i]=make_pair(x[i], i);
}
sort(p, p+n);
vector<pair<long long, int> > vec;
bool active[n];
for(int i=0;i<n;i++){
vec.push_back(make_pair(s[p[i].second]-x[p[i].second]-1, i));
vec.push_back(make_pair(t[p[i].second]-x[p[i].second]-1, i));
active[i]=false;
}
for(int i=0;i<q;i++){
cin >> d[i];
vec.push_back(make_pair(d[i], -1));
}
sort(vec.begin(), vec.end());
priority_queue<int, vector<int>, greater<int> > que;
for(size_t i=0;i<vec.size();i++){
if(vec[i].second == -1){
if(!que.empty()){
cout << p[que.top()].first << endl;
}else{
cout << -1 << endl;
}
}else{
long long idx = vec[i].second;
if(active[idx]){ //工事終了
active[idx] = false;
if(idx == que.top()){
que.pop();
while(!que.empty()){
if(active[que.top()]){
break;
}else{
que.pop();
}
}
}
}else{ //工事開始
active[idx] = true;
que.push(idx);
}
}
}
return 0;
}
| #include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define RE return 0
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
const int mod=1e9+7;
const int big=1e9+100;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
template <class T> void soun(T& ar)
{sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());}
int main(void){
int bi,i,j,n,m,all=0;cin>>n>>m;
int hen[15][15];
for(i=0;i<15;i++){
for(j=0;j<15;j++){
hen[i][j]=-big;
}
}
for(i=0;i<m;i++){
int a,b,c;cin>>a>>b>>c;a--;b--;
all+=c;
hen[a][b]=c;
hen[b][a]=c;
}
int waka[32768]={0};
//bitが立っているところでの残す道のア
for(bi=0;bi<(1<<n);bi++){
for(i=0;i<n;i++){
if((bi&(1<<i))==0){continue;}
for(j=0;j<i;j++){
if((bi&(1<<j))==0){continue;}
waka[bi]+=max(0,hen[i][j]);
}
}
}
static int dp[32768][15]={0};
for(bi=0;bi<(1<<n);bi++){for(j=0;j<15;j++){dp[bi][j]=-big;}}
for(bi=0;bi<(1<<(n-1));bi++){dp[bi][0]=waka[bi];}
for(bi=0;bi<(1<<n);bi++){
for(int bjj=0;bjj<(1<<n);){
if((bi&bjj)!=0){
bjj+=(bi&bjj);
continue;
}
for(i=0;i<n;i++){
if((bi&(1<<i))==0){continue;}
for(j=0;j<n;j++){
if((bjj&(1<<j))==0){continue;}
maxeq(dp[bjj+bi][j],dp[bi][i]+waka[bjj]+hen[i][j]);
}
}
bjj++;
}
}
cout<<all-dp[(1<<n)-1][n-1]<<endl;
RE;
} | 0 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#define int long long
#define dotimes(i, n) for (int i : range(n))
using namespace std;
class range {
class iterator {
int i, s;
public:
iterator(int i, int s): i(i), s(s) {}
int& operator*() {
return i;
}
void operator++() {
i += s;
}
bool operator!=(iterator const& that) {
return i < that.i;
}
};
iterator b, e;
public:
range(int e): b({0, 1}), e({e, 1}) {}
range(int b, int e): b({b, 1}), e({e, 1}) {}
range(int b, int e, int s): b({b, s}), e({e, s}) {}
iterator begin() {
return b;
}
iterator end() {
return e;
}
};
int rint() {
int n;
scanf("%lld", &n);
return n;
}
void wint(int n) {
printf("%lld\n", n);
}
template<typename T>
inline int size(T container) {
return static_cast<int>(container.size());
}
template<typename T>
inline bool maxs(T& a, T const& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<typename T>
inline bool mins(T& a, T const& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
const int k = rint();
int rf[8] = {}, p[8 - k];
bool cf[8] = {};
dotimes(i, k) {
int r = rint();
int c = rint();
rf[r] = c + 1;
cf[c] = true;
}
for (int i = 0, j = 0, c = 0; i < 8; i++)
if (!rf[i]) {
while (cf[c])
c++;
p[j++] = ++c;
}
int a[8];
for (;; next_permutation(p, p + 8 - k)) {
for (int i = 0, j = 0; i < 8; i++)
a[i] = rf[i] ? rf[i] : p[j++];
dotimes(i, 8)
dotimes(j, i)
if (abs(a[j] - a[i]) == abs(j - i))
goto failed;
break;
failed:
;
}
dotimes(i, 8) {
dotimes(j, 8)
putchar(a[i] == j + 1 ? 'Q' : '.');
putchar('\n');
}
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <numeric>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <functional>
#include <list>
#include <random>
#include <time.h>
#include <iomanip>
#include <assert.h>
#include <numeric>
#include <new>
#include <sstream>
#include <complex>
#define BIT(nr) (1ULL << (nr))
#define int long long
#define ll long long
#define double complex<long double>
#define mod 1000000007
#define MAXN (int)1e+5 * 2+1
#define LL_MAX 9223372036854775807
#define LL_HALFMAX 9223372036854775807 / 2
#define MIN -(9223372036854775807 / 2)
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define mp make_pair
template<typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
using namespace std;
int G[15][15];
signed main() {
map<int, int> x, y, d1, d2;
// d1: 和が一定 d2: 差が一定
int k;
cin >> k;
vector<string> ans(8, "........"), fans(8, "........");
rep(i, k) {
int r, c;
cin >> r >> c;
ans[r][c] = 'Q';
y[r] = 1;
x[c] = 1;
d1[r + c] = 1;
d2[c - r] = 1;
}
function<void(int)> dfs = [&](int xPos) {
if (xPos == 8) {
fans = ans;
return;
}
// 既に置いてあったらNG
if (x[xPos] == 1) {
dfs(xPos+1);
}
rep(yPos, 8) {
if (y[yPos] == 1) {
continue;
}
if (d1[xPos + yPos] == 1) {
continue;
}
if (d2[xPos - yPos] == 1) {
continue;
}
y[yPos] = 1;
d1[xPos + yPos] = 1;
d2[xPos - yPos] = 1;
ans[yPos][xPos] = 'Q';
dfs(xPos + 1);
y[yPos] = 0;
d1[xPos + yPos] = 0;
d2[xPos - yPos] = 0;
ans[yPos][xPos] = '.';
}
};
dfs(0);
rep(i, 8) {
cout << fans[i] << "\n";
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define fil(a,b) memset((a),(b),sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pa;
typedef pair<ll,ll> PA;
typedef vector<int> poly;
inline ll read(){
ll x=0,f=1;char c=getchar();
while ((c<'0'||c>'9')&&(c!='-')) c=getchar();
if (c=='-') f=-1,c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
const int N = 2e5+10;
int n;
inline PA Get(int d,ll c){
if (c==1) return {d,0};
PA tmp=Get(d,c/2);
tmp.se=(tmp.se*2+1+(tmp.fi*2>=10));
if (tmp.fi*2>=10) tmp.fi=(tmp.fi*2)/10+(tmp.fi*2)%10;
else tmp.fi*=2;
if (c&1){
tmp.se=tmp.se+1+(tmp.fi+d>=10);
tmp.fi=(tmp.fi+d)/10+(tmp.fi+d)%10;
}
return tmp;
}
int main(){
n=read();
ll x=0,ans=0;
For(i,1,n){
ll d=read(),c=read();
PA tmp=Get(d,c);
ans+=tmp.se;
if (i!=1) ans++;
ans+=(x+tmp.fi>=10);
x=(x+tmp.fi)/10+(x+tmp.fi)%10;
//printf(" %lld %lld\n",x,ans);
}
printf("%lld\n",ans);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a; i<n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 999999999
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long int ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int const MOD = 1000000007;
int dayOfTheWeek( int y, int m, int d )
{
if( m < 3 ) {
y--; m += 12;
}
return ( y + y/4 - y/100 + y/400 + ( 13*m + 8 )/5 + d )%7;
}
int main() {
string dayname[] = {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};
int m,d;
while(cin >> m, m) {
cin >> d;
cout << dayname[dayOfTheWeek(2004,m,d)] << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, j, k) for (int i = j; i <= k; ++i)
#define per(i, j, k) for (int i = j; i >= k; --i)
#define int long long
using namespace std;
const int N = 1000001;
int a[N], sum[N];
inline int read() {
int x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') flag = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * flag;
}
int Abs(int x) {return x < 0 ? -x : x;}
signed main() {
int n = read();
rep(i, 1, n) {
a[i] = read();
sum[i] = sum[i - 1] + a[i];
}
int ans = 1e18, s1 = a[1], s2 = a[2], s3 = a[3], s4 = sum[n] - sum[3], l = 2, r = 4;
rep(i, 3, n) {
while (l < i && Abs(s1 - s2) > Abs(s1 + a[l] - s2 + a[l])) {
s1 += a[l];
s2 -= a[l];
l++;
}
while (r <= n && Abs (s3 - s4) > Abs(s3 + a[r] - s4 + a[r])) {
s3 += a[r];
s4 -= a[r];
r++;
}
int mn = min(s1, min(s2, min(s3, s4)));
int mx = max(s1, max(s2, max(s3, s4)));
ans = min(ans, mx - mn);
s2 += a[i];
s3 -= a[i];
// printf("%d %d %d %d %d %d %d\n", s1, s2, s3, s4, mn, mx, ans);
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r);
template <class T1, class T2>
bool chmax(T1 &l, const T2 &r);
lli sum[200005] = {};
lli rec(lli l, lli r)
// [l, r)
{
return sum[r] - sum[l];
}
bool pivot(lli l, lli r, lli piv)
{
// assert(l <= piv + 1 && piv < r - 1);
return rec(piv, r) - rec(l, piv) >= 0;
}
lli calc(int l, int r, int piv)
{
return rec(piv, r) - rec(l, piv);
}
int good(int l, int r, int piv1, int piv2)
{
if (abs(calc(l, r, piv1)) < abs(calc(l, r, piv2)))
return piv1;
return piv2;
}
pair<lli, lli> calc(lli l, lli r)
{
lli low = l + 1, up = r;
while (up - low > 1)
{
lli mid = (up + low) / 2;
if (pivot(l, r, mid))
{
low = mid;
}
else
{
up = mid;
}
}
int go = good(l, r, low, up);
return make_pair(rec(l, go), rec(go, r));
}
void solve(long long N, std::vector<long long> A)
{
rep(i, N) sum[i + 1] = sum[i] + A[i];
lli ans = 1e18;
for (int i = 2; i <= N - 2; i++)
{
// [0, i) , [i, N) に分割
int ll = 0, lr = i;
int rl = i, rr = N;
auto ls = calc(ll, lr);
auto rs = calc(rl, rr);
chmin(ans, max({ls.first, ls.second, rs.first, rs.second}) - min({ls.first, ls.second, rs.first, rs.second}));
}
cout << ans << endl;
}
int main()
{
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++)
{
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
// -- lib
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r)
{
return (l > r) ? (l = r, true) : false;
}
template <class T1, class T2>
bool chmax(T1 &l, const T2 &r)
{
return (l < r) ? (l = r, true) : false;
} | 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() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b > c + d) {
cout << "Left" << endl;
}
else if (a + b < c + d) {
cout << "Right" << endl;
}
else {
cout << "Balanced" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
ll d,t,s;
cin>>d>>t>>s;
float time = (float)d/s;
if(time <= t)
{
cout<<"Yes"<<'\n';
}
else
{
cout<<"No"<<'\n';
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAXN = 15;
struct edg{
int s, e, x;
};
vector<edg> v;
int cyc[1 << MAXN];
int dp[1 << MAXN][MAXN];
int adj[MAXN][MAXN];
int n, m;
int main(){
scanf("%d %d",&n,&m);
for(int i=0; i<MAXN; i++){
for(int j=0; j<MAXN; j++){
adj[i][j] = -1e9;
}
}
int ans = 0;
for(int i=0; i<m; i++){
int s, e, x;
scanf("%d %d %d",&s,&e,&x);
adj[s-1][e-1] = x;
adj[e-1][s-1] = x;
v.push_back({s-1, e-1, x});
}
for(int i=0; i<(1<<n); i++){
for(auto &j : v){
if((i >> j.s) % 2 == 1 & (i >> j.e) % 2 == 1){
cyc[i] += j.x;
}
}
}
for(int i=0; i<(1<<n); i++){
for(int j=0; j<n; j++){
dp[i][j] = -1e9;
if((i >> j) % 2 == 0){
continue;
}
if(j == 0){
dp[i][j] = cyc[i];
}
for(int k=i; k; k=(k-1)&i){
if((k >> j) % 2 == 0) continue;
for(int l=0; l<n; l++){
dp[i][j] = max(dp[i][j], dp[i^k][l] + adj[l][j] + cyc[k]);
}
}
}
}
int ret = dp[(1<<n)-1][n-1];
for(auto &i : v) ret -= i.x;
cout << -ret << endl;
}
| #include <algorithm>
// #include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long LL;
typedef double db;
const int oo=2139063143;
const int N=17;
const int P=1000000007;
const db eps=1e-7;
#define pritnf printf
//char buf[1<<22],*p1=buf,*p2=buf,obuf[1<<22],*O=obuf;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
template <typename T>
inline void sc (T &x)
{
x=0; static int p; p=1; static char c; c=getchar();
while (!isdigit(c)) { if (c=='-') p=-1; c=getchar(); }
while ( isdigit(c)) { x=(x<<1)+(x<<3)+(c-48); c=getchar(); }
x*=p;
}
template <typename T>
inline void print (T x)
{
if (x< 0) putchar('-'),x=-x;
if (x>=10) print(x/10);
putchar(x%10+'0');
}
template <typename T>
inline void pr (T x) { print(x),putchar('\n'); }
template <typename T1,typename T2>
void chkmax (T1 &A,T2 B) { A=A>=B?A:B; }
template <typename T1,typename T2>
void chkmin (T1 &A,T2 B) { A=A<=B?A:B; }
int n,m,e[N][N],e0=0,g[1<<N|1],f[1<<N|1][N];
int main ()
{
// freopen (".in","r",stdin);
// freopen (".out","w",stdout);
sc(n),sc(m);
for (int i=1; i<=m; i++)
{
int x,y; sc(x),sc(y),sc(e[x][y]),e[y][x]=e[x][y];
e0+=e[x][y];
}
int S=(1<<n)-1;
for (int s=1; s<=S; s++)
for (int i=1; i<=n; i++) if (s>>(i-1)&1)
for (int j=i; j<=n; j++) if (s>>(j-1)&1)
g[s]+=e[i][j];
for (int s=0; s<=S; s++)
for (int i=0; i<=n; i++)
f[s][i]=-2e9;
f[1][1]=0;
for (int s=1; s< S; s++)
for (int u=1; u<=n; u++) if (s>>(u-1)&1)
{
for (int v=1; v<=n; v++) if (!(s>>(v-1)&1)&&e[u][v])
chkmax (f[s|(1<<(v-1))][v],f[s][u]+e[u][v]);
int ss=S^s;
for (int t=ss; t; t=(t-1)&ss)
chkmax (f[s|t][u],f[s][u]+g[t|(1<<(u-1))]);
}
pr(e0-f[S][n]);
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int S, n;
cin >> S >> n;
vector<int> a(n);
for (auto &t : a) {
cin >> t;
}
int mx = *max_element(a.begin(), a.end());
if (mx > (S + 1) / 2) {
cout << (mx - (S + 1) / 2) * 2 - (S % 2 == 0) << endl;
} else {
cout << 0 << endl;
}
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip> //cout << fixed << setprecision(15) << x << endl;
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define Pint pair<int, int>
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
/* -- template -- */
int main() {
int K, T; cin >> K >> T;
int a[T]; rep(i, T) cin >> a[i];
sort(a, a + T, greater<int>());
int sum = 0;
rep(i, T - 1)
sum += a[i + 1];
cout << ((a[0] - sum - 1 < 0) ? 0 : a[0] - sum - 1) << endl;
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.