code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int main()
{
int A,B,C;
int ans;
cin >> A >> B >> C ;
if (A == B)
{
cout << C;
}
else if (B == C)
{
cout << A;
}
else if (A == C)
{
cout << B;
}
else
{
cout << 0;
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
int a,b,k;
int gcd(int x,int y)
{
if(y==0) return x;
else return gcd(y,x%y);
}
void dfs(int n,int m,int x)
{
if(n==0){while(m--)cout<<'b';return;}
if(m==0){while(n--)cout<<'a';return;}
int q=1,w,ci=n+m-1,hh=1,yue=max(n-1,m),shao=min(m,n-1);
for(int i=yue+1,j=1;i<=ci;i++,j++)
{
if(j<=shao)hh*=j;
q*=i;w=gcd(q,hh);
q/=w;hh/=w;
}
if(q<x){cout<<'b';dfs(n,m-1,x-q);}
else {cout<<'a';dfs(n-1,m,x);}
}
signed main()
{
scanf("%lld%lld%lld",&a,&b,&k);
dfs(a,b,k);
return 0;
}
|
//@formatter:off
#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 rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
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;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on
ll dp[60][2];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
ll X;
cin >> n >> X;
vl a(n);
cin >> a;
vl x(n);
rrep(i, n) {
x[i] = X / a[i];
X %= a[i];
}
rrep(i, n - 1) {
a[i + 1] /= a[i];
}
rep(i, n - 1) {
a[i] = a[i + 1];
}
dp[0][0] = 1;
rep(i, n - 1) rep(j, 2) {
if (dp[i][j] == 0) continue;
if (j + x[i] < a[i]) {
dp[i + 1][0] += dp[i][j];
if (j + x[i] > 0)dp[i + 1][1] += dp[i][j];
} else {
dp[i + 1][1] += dp[i][j];
}
}
cout << dp[n - 1][0] + dp[n - 1][1] << endl;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
map<pair<LL, LL>, LL> memo;
LL solve(LL x, LL i, const vector<LL> &a) {
if (i >= a.size()) return 1;
pair<LL, LL> key(x, i);
if (memo.find(key) != memo.end()) return memo[key];
LL w = 0;
LL y = a[i];
if (i == a.size() - 1) {
return (x % y) == 0;
}
LL r = x % a[i + 1];
if (r == 0) {
w = solve(x, i + 1, a);
} else {
w = solve(x - r, i + 1, a) + solve(x - r + a[i + 1], i + 1, a);
}
memo[key] = w;
return w;
}
int main() {
LL N, X;
cin >> N >> X;
vector<LL> a(N);
for (LL i = 0; i < N; ++i) {
cin >> a[i];
}
LL ans = solve(X, 0, a);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define Rep(i,j,n) for (ll i=(ll)(j);i<=(ll)(n);++i)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9+7;
const int mod = 998244353;
const ll INF = 2e15;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
/*
ll ti=clock();
cout<<("Execution Time: %.4lf sec", 1.0 * (clock() - ti) / CLOCKS_PER_SEC)<<endl;
*/
int main(){
ll n,m,q;
cin>>n>>m>>q;
vl w(n),v(n);
vector<Pll> bag;
rep(i,n){
cin>>w[i]>>v[i];
bag.emplace_back(v[i],w[i]);
}
sort(all(bag),greater<Pll>());
vl x(m);
rep(i,m){
cin>>x[i];
}
rep(i,q){
ll l,r;
cin>>l>>r;
vl tmp;
rep(i,m){
if(i==l-1){
i=r;
if(r==m){
break;
}
}
tmp.eb(x[i]);
}
sort(all(tmp));
vector<bool> empty(sz(tmp),true);
ll sum=0;
rep(i,n){
rep(j,sz(tmp)){
if(bag[i].S<=tmp[j]&&empty[j]){
sum+=bag[i].F;
empty[j]=false;
break;
}
}
}
print(sum);
}
} | #include<bits/stdc++.h>
using namespace std;
int n,m,q;
struct node{
int w,v;
}a[55];
struct node1{
int x,num;
}b[55];
int cmp(node x,node y){
if(x.v==y.v)return x.w<y.w;
return x.v>y.v;
}
int cmp2(node1 x,node1 y){
return x.x<y.x;
}
typedef long long ll;
int x[55];
bool v[55];
ll ans=0ll;
int main(){
cin>>n>>m>>q;
for(int i=1;i<=n;i++)cin>>a[i].w>>a[i].v;
for(int i=1;i<=m;i++)cin>>b[i].x,b[i].num=i;
sort(b+1,b+m+1,cmp2);
sort(a+1,a+n+1,cmp);
while(q--){
ans=0ll;
memset(v,0,sizeof(v));
int l,r;
cin>>l>>r;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(b[j].num>=l&&b[j].num<=r)continue;
if(b[j].x>=a[i].w&&!v[b[j].num]){
ans+=a[i].v;v[b[j].num]=1;break;
}
}
}
cout<<ans<<endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vt vector
#define ar array
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define pb push_back
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class T> void read(T& x) {
cin >> x;
}
void read(double& d) {
string t;
read(t);
d=stod(t);
}
void read(long double& d) {
string t;
read(t);
d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
read(h);
read(t...);
}
template<class A> void read(vt<A>& x) {
for (A & it : x) read(it);
}
template<class A, size_t S> void read(array<A, S>& x) {
for (A & it : x) read(it);
}
template<class A> void read(vt<vt<A>> & x) {
for (vt<A> & it : x) for (A & itt : it) read(itt);
}
template<class A> void read(vt<pair<A, A>> & x) {
for (pair<A, A> & it : x) {
read(it.first);
read(it.second);
}
}
string to_string(char c) {
return string(1, c);
}
string to_string(bool b) {
return b?"true":"false";
}
string to_string(const char* s) {
return string(s);
}
string to_string(string s) {
return s;
}
string to_string(vt<bool> v) {
string res;
for (int i = 0; i < sz(v); i++)
res+=char('0'+v[i]);
return res;
}
template<size_t S> string to_string(bitset<S> b) {
string res;
for (int i = 0; i < S; i++)
res+=char('0'+b[i]);
return res;
}
template<class T> string to_string(T v) {
bool f=1;
string res;
for (T & x : v) {
if(!f)
res+=' ';
f=0;
res+=to_string(x);
}
return res;
}
template<class A> void print(A x) {
cout << to_string(x);
}
template<class H, class... T> void print(const H& h, const T&... t) {
print(h);
print(t...);
}
void println() {
cout << endl;
}
template<class A> void println(A x) {
print(x);
println();
}
template<class H, class... T> void println(const H& h, const T&... t) {
print(h);
print(t...);
println();
}
template<class A> bool umin(A & x, A a) {
if (a < x) {
x = a;
return 1;
}
return 0;
}
template<class A> bool umax(A & x, A a) {
if (a > x) {
x = a;
return 1;
}
return 0;
}
int readInt () {
bool minus = false;
int result = 0;
char ch;
ch = getchar();
while (true) {
if (ch == '-') break;
if (ch >= '0' && ch <= '9') break;
ch = getchar();
}
if (ch == '-') minus = true; else result = ch-'0';
while (true) {
ch = getchar();
if (ch < '0' || ch > '9') break;
result = result*10 + (ch - '0');
}
if (minus)
return -result;
else
return result;
}
//----------------------------------Solution starts here-------------------------------//
void solve() {
ll n;
read(n);
set<ll> s;
for (ll i = 2; i <= sqrt(n); i++) {
ll j = i * i;
while (j <= n) {
s.insert(j);
j *= i;
}
}
println(n - sz(s));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/*
freopen("in.txt", "r", stdin);
freopen ("out.txt", "w", stdout);
*/
int t = 1;
//read(t);
for (int i = 1; i <= t; i++) {
//print("Case #", i, ": ");
solve();
}
}
| //Δke_D
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 333;
int n,m,a[N][N];
int main()
{
int i,j,k;
cin>>n;
for(i=1;i<=n;i=i+1){
m=1<<(i-1);
for(j=m;j<m*2;j=j+1)
for(k=0;k<m;k=k+1)
a[j][k]=a[j-m][k];
for(j=0;j<m;j=j+1)
for(k=m;k<m*2;k=k+1)
a[j][k]=a[j][k-m];
for(j=m;j<m*2;j=j+1)
for(k=m;k<m*2;k=k+1)
a[j][k]=a[j-m][k-m]^1;
}
m=1<<n;
cout<<m-1<<endl;
for(i=1;i<m;i=i+1){
for(j=0;j<m;j=j+1)
cout<<(char)(a[i][j]+'A');
cout<<endl;
}
return 0;
} |
//x<<y=x*2^y,x>>y=x/2^y
//1e5+3 is prime
// in a matrix, all elements of a primary diagonal have constant diff of coordinates
// and a secondary diagonal has constant sum of coordinates
//use ll() for using an integer in self-built fn
//(x&-x) bitwise and of (x and its 2's complement) returns (last set bit)
//eg if x=1010 then it will return 0010
// careful dont print empty container(run time error)
//v.erase O(n)
//use ("\n") instead of endl as endl flushes the output buffer
//every time so takes more time than \n (TLE)
//stoll() and to_string((less than 1e19))
//INT_MAX is approx 3e10
//For sets use set_name.lower_bound(x)(strictly O(logn))
//NOT lb(all(s),x)(O(logn) for random access (eg vector) but for sets it is O(n));
#include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define sp setprecision
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b) for(long long int i = (a); i >= (b); i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define pll pair<ll,ll>
#define vlld vector<lld>
#define vi vector<int>
#define vch vector<char>
#define sll set<ll>
#define sch set<ch>
#define vpll vector< pair<ll,ll> >
#define vpii vector< pair<int,int> >
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mll map<ll, ll>
#define mcll map<char,ll>
#define sz(container) ll((container).size())
#define fill(a,b) memset(a, b, sizeof(a))
#define fast_io ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
using namespace std;
lld pi=3.1415926535897932;
const ll mod=998244353;
const ll dx[4]={-1, 0, 1, 0} , dy[4]={0, 1, 0, -1};
const ll dxx[8]={-1, -1, 0, 1, 1, 1, 0, -1} , dyy[8]={0, 1, 1, 1, 0, -1, -1, -1};
string ds="RLDU";
/***************************************
struct cmp
{
bool operator() (const pll &a, const pll &b) const
{
ll lena = a.sec - a.fi + 1;
ll lenb = b.sec - b.fi + 1;
if (lena == lenb) return a.fi < b.fi;
return lena > lenb;
}
};
********************************/
ll lcm(ll a, ll b)
{
ll g=__gcd(a, b);
return a/g*b;
}
ll binpow(ll a, ll b,ll m)
{
a %= m;
ll res = 1;
while (b > 0)
{
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll modinv(ll n)
{
return binpow(n, mod - 2,mod);
}
/**************coding*********************/
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast_io;
ll T=1;//cin>>T;
For(i,1,T)
{
ll n;cin>>n;
vll a(n);
For(j,0,n-1) cin>>a[j];
ll g=a[0];
For(j,1,n-1) g=__gcd(g,a[j]);
cout<<g;
}
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin >> n;
vector<int> a(n);
for (auto &i : a) cin >> i;
a.emplace_back(0);
sort(a.begin(), a.end());
ll ans = 1;
for (int i = 0; i < n; i++)
ans = ans * (a[i + 1] - a[i] + 1) % MOD;
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define Pii pair<int,int>
#define Pll pair<long long,long long>
#define fout(num) cout << fixed << setprecision(20) << (num) << endl
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;}
//vector<vector<ll>> dp(n,vector<ll>(n))
//2-dim:vector<vector<Type>> vv(n, vector<Type>(m, d));
//3-dim:vector<vector<vector<Type>>> vvv(n, vector<vector<Type>>(m, vector<Type>(l, d)));
using namespace std;
signed main(){
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
int n; cin >> n;
vector<int> p(n);
vector<int> idx(n);
vector<bool> use(n,false);
rep(i,n){
cin >> p[i];
p[i]--;
idx[p[i]]=i;
}
vector<int> ans;
rep(i,n){
int x = idx[i];
//cout << x << endl;
for(int j=x;j>i;j--){
if(use[j]){
cout << -1 << endl;
return 0;
}
ans.pb(j);
idx[p[j]]=j-1;
idx[p[j-1]]=j;
swap(p[j],p[j-1]);
use[j] = true;
}
}
if(ans.size()!=n-1) cout << -1 << endl;
else{
for(int u:ans) cout << u << endl;
}
return 0;
}
// g++ main.cpp -o a.out && ./a.out | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cctype>
#include <fstream>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <sstream>
#include <stack>
#include <set>
#include <vector>
#define rep(i,a,b) for((i)=a;i<(int)(b);i++)
const int AAA = 1000000007;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pairII;
typedef vector<int> vecI;
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;
}
ll powD(ll a, ll b) {
ll ans = 1;
a %= AAA;
for (int i = 0; i < b; i++)
{
ans *= a;
ans %= AAA;
}
return ans;
}
int main(int argc, char* argv[]) {
int i, j;
string N;
cin >> N;
if (N.size() == 1) {
cout << 0;
return 0;
}
if (N.size() % 2 == 1) {
string S;
rep(i, 0, N.size() - 1) {
S.push_back('9');
}
N = S;
}
ll shift_len = N.size() / 2;
ll shift = pow(10, shift_len);
ll X = stoll(N);
ll n1 = stoll(N) / shift;
ll n2 = stoll(N) % shift;
ll n = pow(10, shift_len-1);
ll ans = pow(10, shift_len - 1) - 1;
while (n * shift + n <= X) {
ans++;
n++;
}
cout << ans;
return 0;
}
|
//Utkarsh.25dec
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
#define loop(i,a,b) for(ll i=a;i<=b;i++)
#define vi vector <int>
#define vs vector <string>
#define vc vector <char>
#define vl vector <ll>
#define all(c) (c).begin(),(c).end()
#define max3(a,b,c) max(max(a,b),c)
#define min3(a,b,c) min(min(a,b),c)
#define deb(x) cerr<<#x<<' '<<'='<<' '<<x<<'\n'
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// ordered_set s ; s.order_of_key(val) no. of elements strictly less than val
// s.find_by_order(i) itertor to ith element (0 indexed)
typedef vector<vector<ll>> matrix;
ll power(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll modInverse(ll a){return power(a,mod-2);}
const int N=500023;
bool vis[N];
vector <int> adj[N];
void solve()
{
ll n;
cin>>n;
set <ll> s;
map <ll,ll> cnt;
for(int i=0;i<n;i++)
{
ll c;
cin>>c;
s.insert(c);
cnt[c]^=1;
}
if(n%2==1)
{
cout<<"Second\n";
}
else
{
ll odd=0;
for(auto it:s)
{
if(cnt[it]==1)
odd=1;
}
if(odd==1)
cout<<"First\n";
else
cout<<"Second\n";
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T=1;
cin>>T;
int t=0;
while(t++<T)
{
//cout<<"Case #"<<t<<":"<<' ';
solve();
//cout<<'\n';
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
} | #include<bits/stdc++.h>
using namespace std;
#define res register int
#define ll long long
//#define cccgift
#define lowbit(x) ((x)&-(x))
#define rep(i,l,r) for(res i=l,_r=r;i<=_r;++i)
#define per(i,r,l) for(res i=r,_l=l;i>=_l;--i)
#define mkp make_pair
#define pb push_back
#define mem0(a) memset(a,0,sizeof(a))
#define mem0n(a,n) memset(a,0,(n)*sizeof(a[0]))
#define iter(x,v) for(res v,_p=head[x];v=ver[_p],_p;_p=nxt[_p])
#ifdef cccgift //by lqh
#define SHOW(x) cerr<<#x"="<<(x)<<endl
#else
#define SHOW(x) 0
#endif
//#define getchar()(ip1==ip2&&(ip2=(ip1=ibuf)+fread(ibuf,1,1<<21,stdin),ip1==ip2)?EOF:*ip1++)
//char ibuf[1<<21],*ip1=ibuf,*ip2=ibuf;
template<typename T>
inline void read(T &x)
{
static char ch;bool f=1;
for(x=0,ch=getchar();!isdigit(ch);ch=getchar()) if(ch=='-') f=0;
for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=getchar());x=f?x:-x;
}
template<typename T>
void print(T x)
{
if (x<0) x=-x,putchar('-');
if (x>9) print(x/10);
putchar(x%10+48);
}
template<typename T>
inline void print(T x,char ap) {print(x);if (ap) putchar(ap);}
template<typename T>
inline void chkmax(T &x,const T &y) {x=x<y?y:x;}
template<typename T>
inline void chkmin(T &x,const T &y) {x=x<y?x:y;}
unordered_map<int,bool> mp;
int t,n,x;
int main()
{
read(t);
while(t--) {
read(n),mp.clear();
rep(i,1,n) read(x),mp[x]^=1;
if(n&1) {puts("Second");continue;}
bool flag=false;
for(auto &p:mp) if(p.second) flag=true;
puts(flag?"First":"Second");
}
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do something instead of nothing and stay organized
*/
|
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
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; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
int main(){
ll n;
cin>>n;
V<V<ll>> g(n+1);
for(ll i=1;i<=n;i++){
for(ll j=i;j<=n;j+=i){
g[j].emplace_back(i);
}
}
int ma=0;
for(int i=1;i<=n;i++){
chmax(ma,int(g[i].size()));
}
V<int> ans(n,0);
for(int i=0;i<n;i++){
V<bool> ok(ma+1,true);
for(int v:g[i+1]){
ok[ans[v-1]]=false;
}
for(int j=1;j<=ma;j++){
if(ok[j]){
ans[i]=j;
break;
}
}
}
print(ans);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
int main() {
#ifdef LOCAL
freopen("A.INP", "r", stdin);
freopen("A.OUT", "w", stdout);
#endif // LOCAL
int N;
cin >> N;
V<int> A(N), B(N);
int sz = N * 2;
V<int> have(sz), go(sz, -1);
bool ng = true;
rep(i, N) {
cin >> A[i] >> B[i];
if (A[i] != -1) {
--A[i];
if (have[A[i]]) ng = false;
have[A[i]] = i + 1;
}
if (B[i] != -1) {
--B[i];
if (have[B[i]]) ng = false;
have[B[i]] = -(i + 1);
}
if (A[i] != -1 && B[i] != -1) {
go[A[i]] = B[i];
go[B[i]] = A[i];
}
}
if (!ng) {
puts("No");
return 0;
}
V<bool> dp(sz + 1);
dp[0] = true;
rep(i, sz) {
if (!dp[i]) continue;
for (int j = i + 1; j < sz; ++j) {
int w = j - i + 1;
if (w & 1) continue;
w /= 2;
bool ok = true;
V<bool> exist(N);
rep(k, w) {
int l = i + k, r = i + k + w;
if (go[l] != -1 && go[l] != r) {
ok = false;
}
if (go[r] != -1 && go[r] != l) {
ok = false;
}
if (have[l] && have[r]) {
if (have[l] + have[r]) {
ok = false;
}
}
if (have[l] < 0 || have[r] > 0) {
ok = false;
}
}
if (ok) {
dp[j + 1] = true;
}
}
}
puts(dp[sz] ? "Yes" : "No");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)
template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}
const char newl = '\n';
array<array<ll,1100000>,2> dp0,dp1;
int main() {
int n,k,mod,m = 510000,z = 4;
cin >> n >> k >> mod;
vector<int> ans(n+1);
for (int x = 0;x < ((n+1)/2+z-1)/z;++x) {
int cnt[200];
for (int i = 0;i < 200;++i) cnt[i] = 0;
int s = min(z,(n+1)/2-x*z);
for (int i = 1;i <= s;++i) for (int j = 1;j <= n;++j) cnt[j-(x*z+i)+100]++;
dp0[0].fill(0);
dp0[1].fill(0);
dp0[0][m] = k+1;
int p = 0,l = m,h = m;
for (int i = 1;i <= n;++i) {
if (cnt[i+100] == s) {
h += i*k;
for (int j = l;j <= h-i;++j) (dp0[(p)&1][j+i] += dp0[(p)&1][j]) %= mod;
for (int j = l;j <= h;++j) (dp0[(p+1)&1][j] = dp0[(p)&1][j]-dp0[(p)&1][j-i*(k+1)]) %= mod;
p++;
}
if (cnt[-i+100] == s) {
l -= i*k;
for (int j = l;j <= h+i*k;++j) (dp0[(p)&1][j+i] += dp0[(p)&1][j]) %= mod;
for (int j = l;j <= h;++j) (dp0[(p+1)&1][j] = dp0[(p)&1][j+i*k]-dp0[(p)&1][j-i]) %= mod;
for (int j = h;j <= h+i*(k+1);++j) dp0[(p)&1][j+i] = 0;
p++;
}
}
for (int y = x*z+1;y <= x*z+s;++y) {
dp1[1].fill(0);
dp1[0] = dp0[p&1];
P a[100];
for (int i = 1;i <= n;++i) a[i-1] = {abs(i-y),i-y};
sort(a,a+n);
int ll = l,hh = h,pp = 0;
for (int i = 0;i < n;++i) {
if (cnt[a[i].second+100] == s) {
continue;
} else if (a[i].second > 0) {
hh += a[i].first*k;
for (int j = ll;j <= hh-a[i].first;++j) (dp1[(pp)&1][j+a[i].first] += dp1[(pp)&1][j]) %= mod;
for (int j = ll;j <= hh;++j) (dp1[(pp+1)&1][j] = dp1[(pp)&1][j]-dp1[(pp)&1][j-a[i].first*(k+1)]) %= mod;
} else {
ll -= a[i].first*k;
for (int j = ll;j <= hh+a[i].first*k;++j) (dp1[(pp)&1][j+a[i].first] += dp1[(pp)&1][j]) %= mod;
for (int j = ll;j <= hh;++j) (dp1[(pp+1)&1][j] = dp1[(pp)&1][j+a[i].first*k]-dp1[(pp)&1][j-a[i].first]) %= mod;
for (int j = hh;j <= hh+a[i].first*k;++j) dp1[(pp)&1][j+a[i].first] = 0;
}
pp++;
}
ans[y] = ans[n-y+1] = (dp1[(pp)&1][m]-1+mod)%mod;
}
}
for (int i = 1;i < n+1;++i) cout << ans[i] << newl;
} | #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 emplace_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);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
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 vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll 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){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
int main(){
ll n,k,m;cin>>n>>k>>m;
vvi dp(n,vi(n*(n+1)/2*k+1));
rep(i,k+1)dp[0][i]=1;
REP(i,1,n){
ll sum=0;
rep(j,i+1){
for(ll t=j;t<dp[0].size();t+=i+1){
sum+=dp[i-1][t];sum%=m;
if(t-(i+1)*(k+1)>=0)sum=(sum-dp[i-1][t-(i+1)*(k+1)]+m)%m;
dp[i][t]=sum;
}
}
}
vi ans(n);ans[0]=1;
REP(i,1,n){
if(n-i-1<i)ans[i]=ans[n-i-1];
else{
rep(j,dp[i-1].size())ans[i]=(ans[i]+dp[i-1][j]*dp[n-i-2][j])%m;
}
}
rep(i,n)ans[i]=(ans[i]*(k+1)+m-1)%m;
for(ll x:ans)out(x);
} |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef unsigned long long ull;
typedef unsigned uint;
typedef long long ll;
#define G getchar()
int read()
{
int x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return flg?-x:x;
}
#undef G
#define fi first
#define se second
/*
const int mod=;
inline int upd(const int &x){return x+(x>>31&mod);}
inline void add(int &x,const int &y){x=upd(x+y-mod);}
inline void iadd(int &x,const int &y){x=upd(x-y);}
int qpow(int x,int y){
int res=1;
for (;y;y>>=1,x=1LL*x*x%mod)
if (y&1) res=1LL*res*x%mod;
return res;
}
*/
typedef pair<ll,int> P;
#define rep(i,l,r) for (int i(l),_##i(r);i<=_##i;i++)
#define per(i,l,r) for (int i(r),_##i(l);i>=_##i;i--)
#define all(x) (x).begin(),(x).end()
#define forall(x,y) for (const int &y: e[x])
int n,a[300010];
P b[300010];
void solve(){
n=read();
rep(i,1,n) a[i]=read()*(i&1?-1:1);
ll S=0; b[0]=P(0,0);
rep(i,1,n) S+=a[i],b[i]=P(S,i);
sort(b,b+n+1);
ll z=0; S=0;
rep(i,1,n){
S+=a[i];
auto l=lower_bound(b,b+n+1,P(S,0));
auto r=lower_bound(b,b+n+1,P(S,i));
// printf("test %lld,%d: ",S,i);
// rep(j,l-b,r-b-1) printf("%lld,%d ",b[j].fi,b[j].se);
// puts("");
z+=r-l;
}
printf("%lld\n",z);
}
int main()
{
for (int T=1;T--;) solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
cin.tie(nullptr)->sync_with_stdio(false);
int h,w,a,b;
cin >> h >> w >> a >> b;
int ans = 0;
for(int i = 0; i<(1<<((h-1)*w)); i++){
for(int j = 0; j<(1<<((w-1)*h)); j++){
if(__builtin_popcount(i)+__builtin_popcount(j)!=a)continue;
vector<vector<int>>arr(h+1,vector<int>(w+1));
int cur = 1;
for(int a = 0; a<h-1; a++){
for(int b = 0; b<w; b++){
if((1<<(a*w+b))&i){
arr[a][b] = cur; arr[a+1][b] = cur;
cur++;
}
}
}
for(int b = 0; b<w-1; b++){
for(int a = 0; a<h; a++){
if((1<<(b*h+a))&j){
arr[a][b] = cur; arr[a][b+1] = cur;
cur++;
}
}
}
bool f = true;
for(int a = 0; a<h-1; a++){
for(int b = 0; b<w; b++){
if((1<<(a*w+b))&i){
if(arr[a][b]==arr[a+1][b]&&arr[a][b]>0){
continue;
}
f = false;
}
else{
if(arr[a][b]==0||arr[a+1][b]==0||arr[a][b]!=arr[a+1][b]){
continue;
}
f = false;
}
}
}
for(int b = 0; b<w-1; b++){
for(int a = 0; a<h; a++){
if((1<<(b*h+a))&j){
if(arr[a][b]==arr[a][b+1]&&arr[a][b]>0){
continue;
}
f= false;
}
else{
if(arr[a][b]==0||arr[a][b+1]==0||arr[a][b]!=arr[a][b+1]){
continue;
}
f = false;
}
}
}
ans+=f;
}
}
cout << ans << "\n";
return 0;
} |
#include <bits/stdc++.h>
#define inf 0x7fffffff
typedef long long ll;
using namespace std;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
using namespace std;
inline ll read(){
ll x = 0, f = 1;char ch = getchar();
while(ch > '9' || ch < '0'){if(ch == '-') f = -1;ch = getchar();}
while(ch >= '0' && ch <= '9'){x = x * 10 + ch -'0';ch = getchar();}
return x * f;
}
ll ans;
char ch[2005][2005];
int pre[2005][2005][4], sum;
int n, m, bit[4000005];
int main(){
int i, j;
n = read(), m = read();
bit[0] = 1;
for(i = 1;i <= n * m;i++) bit[i] = bit[i - 1] * 2 % mod;
for(i = 1;i <= n;i++) scanf("%s", ch[i] + 1);
for(i = 1;i <= n;i++){
int now = 0;
for(j = 1;j <= m;j++){
if(ch[i][j] == '#') now = 0;
else now++, sum++;
pre[i][j][0] = now;
}
now = 0;
for(j = m;j >= 1;j--){
if(ch[i][j] == '#') now = 0;
else now++, sum++;
pre[i][j][1] = now;
}
}
for(i = 1;i <= m;i++){
int now = 0;
for(j = 1;j <= n;j++){
if(ch[j][i] == '#') now = 0;
else now++, sum++;
pre[j][i][2] = now;
}
now = 0;
for(j = n;j >= 1;j--){
if(ch[j][i] == '#') now = 0;
else now++, sum++;
pre[j][i][3] = now;
}
}
sum/=4;
int ans = 0;
for(i = 1;i <= n;i++){
for(j = 1;j <= m;j++){
if(ch[i][j] == '#') continue;
int now = 0;
for(int k = 0;k <= 3;k++) now += pre[i][j][k];
now -= 3;
ans = (ans + 1ll * (bit[now] - 1) * (bit[sum - now]) % mod) % mod;
}
}
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> T(N);
for (int i = 0; i < N; i++){
cin >> T[i];
}
int S = 0;
for (int i = 0; i < N; i++){
S += T[i];
}
vector<vector<bool>> dp(N + 1, vector<bool>(S + 1, false));
dp[0][0] = true;
for (int i = 0; i < N; i++){
for (int j = 0; j <= S; j++){
if (dp[i][j]){
dp[i + 1][j] = true;
dp[i + 1][j + T[i]] = true;
}
}
}
int ans = S;
for (int i = 0; i <= S; i++){
if (dp[N][i]){
ans = min(ans, max(i, S - i));
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define um unordered_map
#define MOD 1000000007
#define rep(i,s,e) for(int i=s; i<e; i++)
#define rrep(i,s,e) for(int i=e-1; i>=s; i--)
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define ff first
#define ss second
#define mp make_pair
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define pii pair<int,int>
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define google(test_no) cout<<"Case #"<<test_no<<": ";
#define DEBUG true
#define deb(x) \
if (DEBUG) \
cerr << #x << " " << x << endl;
#define debarr(arrayName, s, n) \
if (DEBUG) \
{ \
cout << #arrayName << endl; \
for (ll i = s; i < n; i++) \
cout << arrayName[i] << " "; \
cout << endl; \
}
#define debarr2d(arrayName,s, n, m) \
if (DEBUG) \
{ \
cout << #arrayName << endl; \
for (ll i = s; i < n; i++){ \
for(ll j = s; j < m; j++){ \
cout << arrayName[i][j] << " "; \
} \
cout << endl; \
} \
}
#define debv(vec) \
if (DEBUG) \
{ \
cout << #vec << " "; \
for (auto x : vec) \
cout << x << " "; \
cout << endl; \
}
#define tc \
ll test_case; \
cin >> test_case; \
while (test_case--)
//********************************************************************************************
void solve(int test){
ll n;
cin>>n;
int i=1;
while((ll)(i*(i+1))/2 < n){
i++;
}
cout << i;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t = 1;
// cin>>t;
for(int i=1; i<=t; i++){
solve(i);
}
return 0;
}
| #include<bits/stdc++.h>
typedef long long ll;
#define V(a) vector<a>
#define P(a,b) pair<a,b>
#define A(a) set<a>
#define M(a,b) map<a,b>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define in insert
#define bp __builtin_popcount
#define ppb pop_back
#define FOR(a,b,c) for(ll(a) = b; a < c; a++)
#define FORN(a,b,c) for(ll(a) = b; a <= c; a++)
#define FOREV(a,b,c) for(ll(a)=b; a > c; a--)
#define FOREVN(a,b,c) for(ll(a)=b; a >= c; a--)
#define fastio ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
using namespace std;
bool cprime(int x)
{
if (x == 1)
return false;
if (x <= 3)
return true;
if (x % 2 == 0 || x % 3 == 0)
return false;
for (int i = 5; i <= sqrt(x); i += 6)
if (x % i == 0 || x % (i + 2) == 0)
return false;
return true;
}
bool cpalin(string s)
{
int n = s.length(), l;
if (n == 1)
return true;
if (n % 2 == 0)
l = n / 2 - 1;
else
l = (n - 1) / 2 - 1;
for (int i = 0; i <= l; i++)
if (s[i] != s[n - i - 1])
return false;
return true;
}
void sieveOfEratosthenes(int n)
{
bool arr[n + 1];
FOR(i, 0, n + 1)
arr[i] = true;
for (int i = 2; i * i <= n; i++)
{
if (arr[i] == true)
{
for (int j = i * i ; j <= n; j += i)
{
if (arr[j] == true)
arr[j] = false;
}
}
}
}
ll ndivs(ll n)
{
int N = 1000;
bool arr[N];
FOR(i, 0, N)
arr[i] = true;
for (int i = 2; i * i <= N; i++)
{
if (arr[i] == true)
{
for (int j = i * i ; j <= N; j += i)
{
if (arr[j] == true)
arr[j] = false;
}
}
}
ll p = 1;
FOR(i, 2, N)
{
if (arr[i] == true && n % i == 0)
{
ll m = 0; ll cp = n;
while (cp % i == 0)
{
cp /= i;
m++;
}
p *= (m + 1);
}
}
return p;
}
bool compare( ll a, ll b) // false return swap
{
return a > b;
}
ll power( ll a, ll b)
{
ll p = 1;
ll N = 1e9+7;
while (b > 0)
{
if (b & 1)
p = (p%N * a%N)%N;
a = (a%N*a%N)%N;
b >>= 1;
}
return p;
}
string dtobin(ll n)
{
string s;
while (n)
{
s = to_string((n % 2)) + s;
n /= 2;
}
return s;
}
ll bintod(string s)
{
ll n = 0;
FOR(i, 0, s.length())
if (s[i] == '0')
continue;
else
n += pow(2, (s.length() - 1 - i));
return n;
}
ll sdigs(ll n)
{
int s = 0;
while (n)
{
s += n % 10;
n /= 10;
}
return s;
}
ll fact(ll p)
{
int x = 1;
FORN(i, 1, p)
x *= i;
return x;
}
ll ncr(ll n , ll r)
{
ll ans = (fact(n) ) / (fact(r) * fact(n - r));
return ans;
}
ll __lcm(ll a, ll b)
{
ll g = __gcd(a,b);
return (a*b)/g;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
#endif
ll n;
cin >> n;
ll c = 0;
while(c*(c+1)/2<n)
c++;
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define tani_nachi_ke ios_base::sync_with_stdio(false); cin.tie(NULL);
#define M_PI 3.14159265358979323846
#define data data_
#define ff first
#define ss second
#define pb push_back
#define ld long double
#define int long long
#define print(t) cout << "Case #" << t << ": ";
int32_t main()
{
tani_nachi_ke
int n,m;
cin >> n >> m;
int a[n+1]={0},b[m+1]={0};
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 1; i <= m; i++)
cin >> b[i];
sort(a+1, a+n+1);
int suff[n+10] = {0}, pref[n+10] = {0};
for(int i = n-1; i >= 1; i-=2)
{
suff[i] = a[i+1] - a[i];
suff[i] += suff[i+2];
}
for(int i = 2; i <= n; i+=2)
{
pref[i] = a[i] - a[i-1];
pref[i] += pref[i-2];
}
int ans = 1e18;
// for(int i = 1; i <= n; i++)
// cout << a[i] << " ";
// cout << endl;
for(int i = 1; i <= m; i++)
{
int j = lower_bound(a+1, a+n+1, b[i]) - (a+1);
// cout << j << endl;
if(j%2)
{
ans = min(ans, pref[j-1] + abs(b[i] - a[j]) + suff[j+1]);
}
else
{
ans = min(ans, pref[j] + abs(b[i] - a[j+1]) + suff[j+2]);
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int H, W;
cin >> H >> W;
vector<string> A(H);
for(int i = 0; i < H; ++i) cin >> A[i];
vector<vi> dp(H, vi(W));
for(int i = H-1; i >= 0; --i) {
for(int j = W-1; j >= 0; --j) {
if(i == H-1 && j == W-1) {
dp[i][j] = 0;
} else if((i+j)&1) {
dp[i][j] = H+W;
if(i+1 < H) dp[i][j] = min(dp[i][j], dp[i+1][j] + (A[i+1][j] == '-' ? 1 : -1));
if(j+1 < W) dp[i][j] = min(dp[i][j], dp[i][j+1] + (A[i][j+1] == '-' ? 1 : -1));
} else {
dp[i][j] = - (H+W);
if(i+1 < H) dp[i][j] = max(dp[i][j], dp[i+1][j] + (A[i+1][j] == '+' ? 1 : -1));
if(j+1 < W) dp[i][j] = max(dp[i][j], dp[i][j+1] + (A[i][j+1] == '+' ? 1 : -1));
}
}
}
if(dp[0][0] > 0) cout << "Takahashi\n";
else if(dp[0][0] == 0) cout << "Draw\n";
else cout << "Aoki\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pvec(v) for(auto e: v) cout << e << " ";
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define rep(i, a, b) for(int i = (a); i<(b); ++i)
#define pb push_back
#define INF 1000000005
#define MOD (1e18 + 5)
#define all(v) v.begin(), v.end()
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
ll power(ll x, ll y){
ll res = 1LL;
if (x == 0) return 0;
while (y > 0){
if (y & 1LL)
res = (res*x);
y = y>>1LL;
x = (x*x);
}
return res;
}
long double log3(long double d) {
return log(d*1.0)*1.0/log(3.0);
}
vi *adj;
vi vis, a, b;
void dfs(int u, ll &sum) {
vis[u] = 1;
sum += (a[u] - b[u])*1LL;
for(int v: adj[u]) {
if(!vis[v]) {
dfs(v, sum);
}
}
}
int main(){
IO
int n, m;
cin >> n >> m;
if(m < 0 || (m > 0 && m + 2 > n)) {
cout << -1 << '\n';
return 0;
}
if( m == 0) {
int l = 1, r = 5;
for(int i = 0; i < n; ++i) {
cout << l << " " << r << '\n';
l+=5;
r+=5;
}
return 0;
}
else {
ll l = 2, r = 5;
for(int i = 0; i <= m; ++i) {
cout << l << " " << r << '\n';
l+=5;
r+=5;
--n;
}
cout << 1 << " " << r << '\n';
--n;
l+=5;
r+=5;
while(n) {
cout << l << " " << r << '\n';
l += 5;
r += 5;
--n;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
/// cin/cout overloading
template <typename T>
ostream &operator<<(ostream &out, const vector<T> &vec) {
for (auto it = vec.begin(); it != vec.end(); ++it) {
out << *it << " ";
}
return out;
}
template <typename T>
ostream &operator<<(ostream &out, const pair<T, T> &P) {
out << P.first << " " << P.second;
return out;
}
template <typename T>
istream &operator>>(istream &in, vector<T> &vec) {
for (auto it = vec.begin(); it != vec.end(); ++it) {
in >> *it;
}
return in;
}
template <typename T>
istream &operator>>(istream &in, pair<T, T> &P) {
in >> P.first >> P.second;
return in;
}
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
cerr << endl; \
}
void err(istream_iterator<string>) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << ", ";
err(++it, args...);
}
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define all(x) (x).begin(), (x).end()
#define coutp(x, y) cout << (x) << " " << (y) << endl
#define coutn(x) cout << (x) << endl
#define coutd(x) cout << setprecision(10) << (x) << endl
ll calc(const string &S) {
ll res = 0;
for (int i = 1; i <= 9; ++i) {
ll base = 1;
for (auto c : S) {
if (c - '0' == i) {
base *= 10;
}
}
res += i * base;
}
return res;
}
/// main函数
int main() {
ll A, B;
cin >> A >> B;
double ans = (double(A) - B) / A * 100;
coutd(ans);
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int A,B,C;
cin>>A>>B>>C;
if(A*A+B*B<C*C) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll a, b, c, d;
cin>>a>>b>>c>>d;
if(b < c*d)
{
ll cy = a;
ll r = 0;
for(ll i = 0; ; i++)
{
//cout<<"r = "<<r<<" cy = "<<cy<<endl;
if(r*d >= cy)
{
cout<<i<<endl;
break;
}
cy += b;
r += c;
}
}
else
{
cout<<-1<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, Q;
const int maxn = 2e5 + 5;
typedef long long ll;
inline ll read()
{
ll x = 0;
int s = 1;
char c = getchar();
while (c < 48 || c > 57)
{
if (c == '-')
s = -1;
c = getchar();
}
while (c >= 48 && c <= 57)
{
x = (x << 3) + (x << 1) + c - '0';
c = getchar();
}
return x * s;
}
int main()
{
int N, Q;
N = read();
ll a, t;
ll l = -1e9, r = 1e9, b = 0;
for (int i = 0; i < N; i++)
{
a = read();
t = read();
if (t == 1)
{
l += a;
r += a;
b += a;
}
else if (t == 2)
{
l = max(l, a);
r = max(r, a);
}
else
{
l = min(l, a);
r = min(r, a);
}
}
Q = read();
while (Q--)
{
ll x = read() + b;
if (x < l)
cout << l;
else if (x > r)
cout << r;
else
cout << x;
cout << ' ';
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
int main(){
int a,b,c;cin>>a>>b>>c;
cout<<a+b+c-min({a,b,c})<<endl;
}
|
//clear adj and visited vector declared globally after each test case
//check for long long overflow
//while adding and subs check if mod becomes -ve
//while using an integer directly in a builtin function add ll
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Dont keep array name as size or any other key word
//ctrl+end - to break infinite loop in sublime text
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
using namespace std;
#define Fio \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr)
#define ll long long int
#define fo(i, a, b) for (long long int i = a; i <= b; i++)
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define all(v) v.begin(),v.end()
#define vi vector<int>
#define vl vector<long long int>
#define vvi vector<vector<int>>
#define vvl vector<vector<long long int>>
#define mii map<int, int>
#define umii unordered_map<int, int>
#define mll map<ll,ll>
#define umll unordered_map<ll,ll>
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const ll inf = 1e9+7;
const ll mod = 998244353 ;
#define MAX 200005
void call_priyanshu(){
Fio;
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt", "w", stdout);
#endif
}
ll mini(ll a,ll b){
if(a>=b)return b;
return a;
}
ll maxi(ll a,ll b){
if(a>=b)return a;
return b;
}
void run(ll n,ll d1,ll d2,ll d3,ll d4,ll d5,ll d6,vector<pair<ll,ll>> &A,vector<pair<ll,ll>> &B){
if(d1>=d2){
if((B[0]==A[0] && B[n-1]==A[n-1]) || (B[n-1]==A[0] && B[0]==A[n-1])){
cout<<max(max(d3,d4),max(d5,d6));
return;
}else{
cout<<max(d2,max(d3,d4));
return;
}
}else{
if((B[0]==A[0] && B[n-1]==A[n-1]) || (B[n-1]==A[0] && B[0]==A[n-1])){
cout<<max(max(d3,d4),max(d5,d6));
return;
}else{
cout<<max(d1,max(d5,d6));
return;
}
}
}
void calc(vector<pair<ll,ll>> &A,vector<pair<ll,ll>> &B,ll n){
ll v1 = abs(A[0].first - A[n-1].first);
ll v2 = abs(B[0].first - B[n-1].first);
ll v3 = abs(A[0].first - A[n-2].first);
ll v4 = abs(A[1].first - A[n-1].first);
ll v5 = abs(B[0].first - B[n-2].first);
ll v6 = abs(B[1].first - B[n-1].first);
run(n,v1,v2,v3,v4,v5,v6,A,B);
}
void solve(){
//write your code here
ll n;
cin>>n;
vector<pair<ll,ll>> A,B;
for(ll i = 0;i<n;i++){
ll x,y;
cin>>x>>y;
A.pb(mp(x,y));
B.pb(mp(y,x));
}
sort(all(A)),sort(all(B));
calc(A,B,n);
}
int main(){
call_priyanshu();
// w(T){
solve();
// }
return 0;
} | #include<bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#ifndef LOCAL
#define cerr if(0)cerr
#endif
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using pii = pair<int, int>;
const int MAXN = 101, MAXM = MAXN*MAXN;
int n, m, c[MAXN], a[MAXM], b[MAXM], dep[MAXN];
bool direc[MAXN][MAXN];
bool vis[MAXN];
vector<int> g[MAXN];
void dfs(int x, int prv) {
vis[x] = 1;
dep[x] = dep[prv]+1;
for(int i: g[x]) {
if(!vis[i]) {
direc[x][i] = 1;
dfs(i, x);
}
}
for(int i: g[x]) {
if(i!=prv && dep[i]<dep[x]) {
direc[x][i] = 1;
}
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>m;
for(int i=0; i<m; ++i) {
cin>>a[i]>>b[i];
}
for(int i=1; i<=n; ++i) {
cin>>c[i];
}
for(int i=0; i<m; ++i) {
if(c[a[i]] > c[b[i]]) {
direc[a[i]][b[i]] = 1;
}
if(c[b[i]] > c[a[i]]) {
direc[b[i]][a[i]] = 1;
}
if(c[a[i]]==c[b[i]]) {
g[a[i]].push_back(b[i]);
g[b[i]].push_back(a[i]);
}
}
for(int i=1; i<=n; ++i) {
if(!vis[i]) {
dfs(i, i);
}
}
for(int i=0; i<m; ++i) {
if(direc[a[i]][b[i]]) cout<<"->\n";
else cout<<"<-\n";
}
}
|
// Author : Sarthak Kapoor
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int ll
#define rep(i,n) for(int i=0;i<n;++i)
#define repa(i,a,n) for(int i=a;i<n;++i)
#define repr(i,n) for(int i=n-1;i>=0;--i)
#define ll long long
#define pi pair<int,int>
#define pii pair<pi,int>
#define vi vector<int>
#define pb push_back
#define fi first
#define sec second
#define all(v) v.begin(),v.end()
#define s(v) v.size()
ll mod = 1000000007;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());//use rng()%n for numbers in range [0,n-1]
ll gcd(ll a,ll b){
if(b==0)return a;
return gcd(b,a%b);
}
ll fastexp(ll x,ll a){
ll res = 1;
while(a>0){
if(a&1){
res = (res*x)%mod;
}
a=a>>1;
x=(x*x)%mod;
}
return res;
}
ll inverse(ll n){
return fastexp(n,mod-2);
}
template <typename T>
void add(T &a, T b){
a += b;
if(a >= mod)a -= mod;
}
template <typename T>
void sub(T &a, T b){
a -= b;
if(a < 0)a += mod;
}
template <typename T>
void mul(T &a, T b){
a *= b;
if(a >= mod)a %= mod;
}
int n,k;
int a[10][10];
int ans;
void find(vi v,int cost,int cur){
// cout<<cur<<" ";
if(s(v) == 0){
// cout<<cost<<"\n";
if(cost + a[cur][0] == k){
ans++;
}
return;
}
rep(i,s(v)){
vi new_v;
rep(j,s(v)){
if(j == i)continue;
new_v.pb(v[j]);
}
find(new_v,cost+a[cur][v[i]],v[i]);
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>k;
rep(i,n){
rep(j,n){
cin>>a[i][j];
}
}
vi v;
repa(i,1,n)v.pb(i);
find(v,0,0);
cout<<ans;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int aa,b,t=0,sum=0;
cin>>aa>>b;
int d[aa+1][aa+1];
for(int i=1;i<=aa;i++){
for(int ii=1;ii<=aa;ii++){
cin>>d[i][ii];
}
}
int a[aa+2],e[aa+2],c[aa+2],z[aa+2];
c[1]=1;c[aa+1]=1;e[1]=1;e[aa+1]=1;z[1]=1;z[1+aa]=1;
for(int i=0;i<=aa-2;i++)a[i]=i+2;
do{
for(int i=0;i<=aa-2;i++){
c[i+2]=a[i];
z[i+2]=a[i];
e[i+2]=a[i];
}
for(int i=1;i<=aa;i++){
sum+=d[e[i]][e[i+1]];
if(sum==b)t+=1;
}
sum=0;
} while (next_permutation(a,a+aa-1));
cout<<t;
return 0;
} |
#include <vector>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define lo(i,a,b) for(int i=a; i<b; i++) // loop
int main(){
int A, B;
cin >> A >> B;
int res = 2 * A + 100 - B;
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
cout << max (2 * a + 100 - b, 0) << '\n';
return 0;
}
|
#include<bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(zf)return -res;
return res;
}
const int maxn=2e5+5,P=998244353;
int f[maxn],g[maxn];
int p[maxn],r;
int v[maxn],inv[25];
signed main(){
int n=read(),m=read(),ans=1;
inv[1]=1;
for(register int i=2;i<=20;++i){
inv[i]=1ll*inv[P%i]*(P-P/i)%P;
}
for(register int i=2,t;i<=m;++i){
if(!v[i]){
f[i]=n,g[i]=1,p[++r]=i;
}
for(register int j=1;j<=r&&(t=i*p[j])<=m;++j){
v[t]=1;
if(i%p[j]){
f[t]=1ll*f[i]*n%P,g[t]=1;
}
else{
f[t]=1ll*f[i]*(n+g[i])%P*inv[g[i]+1]%P,g[t]=g[i]+1;
break;
}
}
ans+=f[i];
(ans>=P)&&(ans-=P);
}
printf("%d\n",ans);
return 0;
} | /*
/^--^\
\____/
/ \ _____ _ __ __ ____ _ ____ ____ _____
| || ()_)| |\ \/ /| ===|| |__ / (__` / () \|_ _|
\__ __/ |_| |_|/_/\_\|____||____|\____)/__/\__\ |_|
|^|^\ \^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|
| | |\ \| | | | | | | | | | | | | | | | | | | | | | | | |
#####/ /#################################################
| | |\/ | | | | | | | | | | | | | | | | | | | | | | | | |
|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|*/
#pragma GCC optimize("O4,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<ll,ll>;
#define int ll
#define double long double
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Forr(i,a,b) for(int i=a;i>=b;i--)
#define F first
#define S second
#define L(id) (id<<1)
#define R(id) (id<<1|1)
#define LO(x) (x&(-x))
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define mkp make_pair
#define MOD (ll)(1e9+7)
#define INF (ll)(1e15)
#define EPS (1e-6)
#ifdef LOCALMEOW
#define debug(...) do{\
cerr << __PRETTY_FUNCTION__ << " - " << __LINE__ <<\
" : ("#__VA_ARGS__ << ") = ";\
_OUT(__VA_ARGS__);\
}while(0)
template<typename T> void _OUT(T x) { cerr << x << "\n"; }
template<typename T,typename...I>
void _OUT(T x,I ...tail) { cerr << x << ", "; _OUT(tail...); }
#else
#define debug(...)
#endif
inline void IOS(){ ios::sync_with_stdio(false); cin.tie(0); }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int gcd(int a,int b) { return b==0?a:gcd(b,a%b); }
int lcm(int a,int b) { return a/gcd(a,b)*b; }
int fpow(int b,int p){
int ans=1,now=b;
while(p){
if(p&1) ans=ans*now%MOD;
p/=2; now=now*now%MOD;
}
return ans;
}
void minify(int &a,int b) { if(b<a) a=b; }
void maxify(int &a,int b) { if(b>a) a=b; }
int32_t main(){
IOS();
//code...
string s; cin>>s;
int n=sz(s);
int cnt[26];
For(i,0,25) cnt[i]=0;
int ans=0;
Forr(i,n-1,1){
if(s[i]==s[i-1]){
ans+=n-i-1-cnt[s[i]-'a'];
memset(cnt,0,sizeof(cnt));
cnt[s[i]-'a']=n-i-1;
}
cnt[s[i]-'a']++;
}
cout<<ans<<"\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
struct UnionFind{
int num;//連結成分の数
vector<int> r,p;//そのグループのサイズ,自分の親っぽいやつ
vector<map<int,int>> mp;
UnionFind(){}
UnionFind(int n):num(n),r(n,1),mp(n),p(n,0){iota(p.begin(),p.end(),0);}
int find(int x){//どのグループに所属するか
return (x==p[x]?x:p[x]=find(p[x]));//xがグループの名前と一致するまでxを親にする
}
bool same(int x,int y){//同じグループかどうか
return find(x)==find(y);
}
void unite(int x,int y){//xとyを同じグループにする
x=find(x);y=find(y);//xとyのグループの名前をどっちかが変える
if(x==y) return;
if(mp[x].size()<mp[y].size()) swap(x,y);//サイズが大きい方をxとする
for(auto p:mp[y])mp[x][p.first]+=p.second;
p[y]=x;
num--;
}
int size(int x){//グループの大きさ
return r[find(x)];
}
int count() const{//グループの数
return num;
}
};
signed main(){
int n,q;cin>>n>>q;
UnionFind uf(n);
REP(i,n){
int c;cin>>c;c--;uf.mp[i][c]++;
}
REP(_,q){
int c,a,b;cin>>c>>a>>b;a--;b--;
if(c==1)uf.unite(a,b);
else cout<<uf.mp[uf.find(a)][b]<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using iPair = pair<int,int>;
using lPair = pair<ll, ll>;
using ivector = vector<int>;
using lvector = vector<ll>;
using istack = stack<int>;
using iqueue = queue<int>;
using ivv = vector<vector<int>>;
using lvv = vector<vector<ll>>;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
vector<iPair> dir = {{1,0}, {-1,0}, {0,1}, {0,-1}};
#define dump(x) cout << #x << " = " << (x) << endl
#define ALL(x) begin(x),end(x)
#define rep(i,s,e) for(ll i=(s), i_stop=(e); i<i_stop; ++i)
#define repRev(i,s,e) for(ll i=(e)-1, i_stop=(s); i>=i_stop; --i)
#define range(i,s,n) for(ll i=(s), i_stop=(s)+(n); i<i_stop; ++i)
#define rangeRev(i,s,n) for(ll i=(s), i_stop=(s)-(n); i>i_stop; --i)
#define foreach(x,container) for(auto &&x:container)
bool chmax(ll& a, ll b) {if(a<b) {a=b;return true;} return false;}
bool chmin(ll& a, ll b) {if(a>b) {a=b;return true;} return false;}
template<typename T> void printArr(vector<T> &arr){
for(auto &&x:arr) {cout << x << " ";} cout << endl;
}
/*
## 關鍵詞：
## 題意：
## 思路：
## 雜多：
*/
#define maxn 200000
int r[maxn+10];
int father[maxn+10];
map<int,int> group[maxn+10];
int find_top(int x) {
if(father[x] == x) return x;
else return (father[x] = find_top(father[x]));
}
void merge(int x, int y) {
int fax = find_top(x);
int fay = find_top(y);
if(fax == fay) return;
if(r[fax] < r[fay]) {
father[fax] = fay;
r[fay] += r[fax];
for(auto&& [k,v]: group[fax]) {
group[fay][k] += v;
}
}else{
father[fay] = fax;
r[fax] += r[fay];
for(auto&& [k,v]: group[fay]) {
group[fax][k] += v;
}
}
}
void solve() {
// 預處理
range(i, 1, maxn) {father[i] = i; r[i] = 1;}
int n,q; cin>>n>>q;
range(i, 1, n) {
int c; cin>>c;
group[i][c] = 1;
}
while(q--) {
int op, x, y; cin>>op>>x>>y;
if(op == 1) {
merge(x, y);
}else{
cout << group[find_top(x)][y] << endl;
}
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long //data types used often, but you don't want to type them time by time
#define ull unsigned long long
#define ui unsigned int
//#define ld long double
#define mod 1000000007
//define inf 100000000000010
#define us unsigned short
#define IOS ios_base::sync_with_stdio(0); //to synchronize the input of cin and scanf
//#define INF LONG_MAX
#define PI 3.1415926535897932384626
//#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define rep(x,j,n)for(int x=j;x<n;x++)
#define repr(x,n,j)for(ll x=n;x>j;x--)
#define all(x) (x).begin(), (x).end()
typedef vector<pair<ll,ll>> vpi;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> pi;
typedef long double ld;
mt19937 myrand(time(0));
bool isprime(ll n)
{
if(n<=1)return false;
if(n<=3)return true;
if(n%2==0||n%3==0)return false;
for(ll i=5;i*i<=n;i+=6)
{
if(n%i==0||n%(i+2)==0)return false;
}
return true;
}
ll modexp(ll a,ll b,ll m)
{
ll r=1;
a=a%m;
while(b>0)
{
if(b&1)r=(r*a)%m;
b = b>>1;
a=(a*a)%m;
}
return r%m;
}
ll builtin_popcount(ll x)
{
ll cnt = 0;
for(ll i=60;i>=0;i--)
{
if((1LL<<i)&x)cnt++;
}
return cnt;
}
ll addmod(ll a,ll b)
{
a%=mod;
b%=mod;
return (a+b)%mod;
}
ll mulmod(ll a,ll b)
{
a%=mod;
b%=mod;
return (a*b)%mod;
}
ll submod(ll a,ll b)
{
a%=mod;
b%=mod;
a-=b;
if(a<0)a+=mod;
return a%mod;
}
struct CustomCompare
{
bool operator()(pi a,pi b)
{
return a.fi<b.fi;
}
};
/*
const int mxn = 5*(1e6) +10;
vi spf(mxn);
void sieve()
{
for(ll i =0;i<mxn;i++)spf[i] = i;
for(ll i=2;i<mxn;i+=2)spf[i] = 2;
for(ll i = 3;i*i<mxn;i++)
{
if(spf[i]==i)
{
for(ll j = i*i;j<mxn;j+=i)
{
if(spf[j]==j)spf[j] = i;
}
}
}
}
*/
const int mxn = 18;
ll adj[mxn][mxn];
bool check[(1LL<<mxn)];
ll dp[(1LL<<mxn)];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll n,m; cin>>n>>m;
rep(i,0,m)
{
ll x,y; cin>>x>>y;
--x,--y;
adj[x][y] = adj[y][x] = 1;
}
//cout<<"ok"<<endl;
rep(i,1LL,1LL<<n)
{
vi arr;
rep(j,0,n)if((1LL<<j)&i)arr.pb(j);
check[i] = true;
ll sz = arr.size();
rep(j,0,sz)
{
rep(k,j+1,sz)
{
ll x = arr[j] ,y = arr[k];
if(!adj[x][y]&&!adj[y][x])check[i] = false;
}
}
}
//cout<<"ok"<<endl;
rep(i,1LL,1LL<<n)dp[i] = 1e10;
dp[0] = 0;
rep(i,1LL,1LL<<n)
{
if(check[i])dp[i] = 1;
for(ll j=i;j;j=(j-1LL)&i)dp[i] = min(dp[i],dp[j]+dp[i^j]);
}
cout<<dp[(1LL<<n)-1];
return 0;
}
/*
1
4 7
...*...
..***..
.****..
*******
*/
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define endl '\n'
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sz(x) ((long long)x.size())
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define frev(a,b,c) for(int a=c; a>=b; a--)
#define rep(a,b,c) for(int a=b; a<c; a++)
#define trav(a,x) for(auto &a:x)
#define all(con) con.begin(),con.end()
#define done(x) {cout << x << endl;return;}
#define mini(x,y) x=min(x,y)
#define maxi(x,y) x=max(x,y)
const ll infl = 0x3f3f3f3f3f3f3f3fLL;
const int infi = 0x3f3f3f3f;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
//const int mod = 998244353;
const int mod = 1e9 + 7;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int>> vvi;
typedef vector<pair<int, int>> vpii;
typedef map<int, int> mii;
typedef set<int> si;
typedef set<pair<int,int>> spii;
typedef queue<int> qi;
uniform_int_distribution<int> rng(0, 1e9);
//DEBUG FUNCTIONS START
#define cerr cout
void __print(int x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define deb(x...) _print(x)
#else
#define deb(x...)
#endif
// DEBUG FUNCTIONS END
const int N = 2e5 + 5;
vpii g[N];
int f[60][2];
void dfs(int v, int p, int msk){
rep(i,0,60){
f[i][msk >> i & 1]++;
}
for(auto [to, w] : g[v]){
if(to != p){
dfs(to, v, msk ^ w);
}
}
}
int powm(int a, int b){
int res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void solve(){
int n;
cin >> n;
fr(i,2,n){
int u, v, w;
cin >> u >> v >> w;
g[u].pb({v, w});
g[v].pb({u, w});
}
dfs(1, 1, 0);
int ans = 0;
rep(i,0,60){
ans += (1ll << i) % mod * f[i][0] % mod * f[i][1] % mod;
ans %= mod;
}
cout << ans << endl;
}
signed main() {
#ifdef LOCAL
(void)!freopen("input.txt","r",stdin);
(void)!freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
int t = 1;
//cin >> t;
while (t--)
solve();
return 0;
}
int divide(int a, int b) {
return (a % mod) * powm(b % mod, mod - 2) % mod;
}
|
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int a[n];
for (auto &i : a) i = ri();
int res = 2000000000;
for (int i = 0; i < 1 << (n - 1); i++) {
int xored = 0;
int ored = 0;
for (int j = 0; j <= n; j++) {
if (j < n) ored |= a[j];
if (j == n || (i >> j & 1)) xored ^= ored, ored = 0;
}
res = std::min(res, xored);
}
printf("%d\n", res);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
long long int count=0;
cin>>n;
int ar[n]={};
int arr[200]={};
for (int i = 0; i < n; i++)
{
cin>>ar[i];
}
for (int i = 0; i < n; i++)
{
arr[ar[i]%200]++;
}
for (int i = 0; i <n; i++)
{
if ((arr[ar[i]%200])>1)
{
count=count+arr[ar[i]%200]-1;
}
arr[ar[i]%200]--;
}
cout<<count;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
t=1;
while(t--)
{
string s;
cin>>s;
for(int i=s.size()-1;i>=0;i--)
{
if(s[i]=='9')
cout<<6;
else if(s[i]=='6')
cout<<9;
else
cout<<s[i];
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
#define all(x) (x).begin(),(x).end()
#define fr first
#define sc second
#define nl '\n'
void solve(){
ll n;cin>>n;
ll ans=0;
ll a[5]={999,999999,999999999,999999999999,999999999999999};
int i=0;
while(n-a[i]>0 && i<5){
ans+=n-a[i];
i++;
}
cout<<ans;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int n,ans;
string a;
int main()
{
cin>>n>>a;
for(int i=0;i<n;i++)
{
map <char,int> m;
for(int j=i;j<n;j++)
{
m[a[j]]++;
if(m['A']==m['T'] and m['C']==m['G']) ans++;
}
}
cout<<ans;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ll long long
#define ld long double
#define endl '\n'
#define all(A) (A).begin(),(A).end()
#define traceA(A,x) cerr<<#A<<": ";for(int i = 0; i < (x) ; ++i) cerr<<A[i]<<' ';cerr<<endl
#define traceV(A) cerr<<#A<<": ";for(auto i:A)cerr<<i<<' ';cerr<<endl
#define traceM(A,n,m) cerr<<#A<<": "<<endl;for(int i = 0; i < (n) ; ++i){for(int j = 0; j < (m) ; ++j) cerr << A[i][j] << ' ';cerr << endl;}
#define TRACE
#ifdef TRACE
#define trace(...) __f__(#__VA_ARGS__,__VA_ARGS__)
template<typename Arg1> void __f__(const char* name,Arg1&& arg1){cerr<<name<<" : "<<arg1<<endl;}
template <typename Arg1,typename... Args> void __f__(const char* names,Arg1&& arg1,Args&&... args){const char* comma=strchr(names+1,',');cerr.write(names,comma-names)<<" : "<<arg1<<" | ";__f__(comma+1,args...);}
#else
// #define trace(...) 1
#endif
const int N = 2e5 + 77;
int A[N], C[N], G[N], T[N];
int a , c, g, t;
void sol(){
int n ; cin >> n ;
string s ; cin >> s;
for(int i = 0 ; i < n ; ++i){
if(s[i] == 'A') A[i+1]++;
if(s[i] == 'C') C[i+1]++;
if(s[i] == 'G') G[i+1]++;
if(s[i] == 'T') T[i+1]++;
}
{
for(int i = 1; i <= n ; ++i){
a += A[i];
A[i] = a;
}
for(int i = 1; i <= n ; ++i){
c += C[i];
C[i] = c;
}
for(int i = 1; i <= n ; ++i){
g += G[i];
G[i] = g;
}
for(int i = 1; i <= n ; ++i){
t += T[i];
T[i] = t;
}
}
// traceA(A,n+1);
// traceA(C,n+1);
// traceA(G,n+1);
// traceA(T,n+1);
int ans = 0;
for(int l = 1 ; l <= n ; ++l){
for(int r= l+1; r <= n ; ++r){
a = A[r]-A[l-1];
c = C[r]-C[l-1];
g = G[r]-G[l-1];
t = T[r]-T[l-1];
if(a == t && c == g) ans++;
}
}
cout << ans << endl;
}
int32_t main(){
fast;
int t = 1;
// cin >> t;
// while(t--)
sol();
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> at(n);
ll pinf = 4e18, minf = -4e18, bias = 0;
rep(i, n) {
ll a, t;
cin >> a >> t;
if(t == 1) {
bias += a;
pinf += a;
minf += a;
}
if(t == 2) {
pinf = max(pinf, a);
minf = max(minf, a);
}
if(t == 3) {
pinf = min(pinf, a);
minf = min(minf, a);
}
}
int q;
cin >> q;
while(q--) {
ll x;
cin >> x;
ll ans = min(pinf, max(minf, x+bias));
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define pb push_back
#define mp make_pair
const ll INF = 1e16;
const int MOD = 1e9+7;
const int MAX_N = 2e5+12;
int N, Q;
ll a[MAX_N],t[MAX_N];
ll x[MAX_N];
void solve()
{
ll lo = -INF, hi = INF, add = 0;
for(int i=0;i<N;++i){
if(t[i]==1){
add += a[i];
lo += a[i];
hi += a[i];
}else if(t[i]==2){
lo = max(lo, a[i]);
hi = max(hi, a[i]);
}else{
lo = min(lo, a[i]);
hi = min(hi, a[i]);
}
}
for(int i=0;i<Q;++i){
cout<<min(hi,max(lo, x[i]+add))<<'\n';
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
cin >> N;
for(int i=0;i<N;++i)cin>>a[i]>>t[i];
cin >> Q;
for(int i=0;i<Q;++i)cin>>x[i];
solve();
return 0;
} |
#include<bits/stdc++.h>
#define mod 998244353
using namespace std;
struct DSU{
int n;
int parent[55];
int size[55];
void init(int _n){
n = _n;
for(int i=1;i<=n;i++){
parent[i]=i;
size[i]=1;
}
}
int findSet(int i){
if(parent[i]==i)return i;
return parent[i]=findSet(parent[i]);
}
void unionSet(int u, int v){
u = findSet(u), v = findSet(v);
if(u!=v){
if(size[u]<size[v]){
parent[u]=v;
size[v]+=size[u];
}else{
parent[v]=u;
size[u]+=size[v];
}
}
}
vector<int>sz(){
vector<int>res;
for(int i=1;i<=n;i++){
if(parent[i]==i)res.push_back(size[i]);
}
return res;
}
};
long long fact(int n){
if(n==1)return 1;
else return (n%mod*fact(n-1)%mod)%mod;
}
int main(){
int n,K;cin>>n>>K;
int a[n+5][n+5];
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
DSU dsu;
dsu.init(n);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
bool valid = true;
for(int k=1;k<=n;k++){
if(a[k][i] + a[k][j] > K){
valid=false;
break;
}
}if(valid)dsu.unionSet(i,j);
}
}
long long ans = 1;
for(int x : dsu.sz()){
// cout<<x<<endl;
ans = (1LL * fact(x) * ans )%mod;
}
dsu.init(n);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
bool valid = true;
for(int k=1;k<=n;k++){
if(a[i][k] + a[j][k] > K){
valid=false;
}
}if(valid){
dsu.unionSet(i,j);
}
}
}
for(int x : dsu.sz()){
ans = (ans * 1LL * fact(x))%mod;
}
cout<<ans<<endl;
} | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int CM = 1 << 17, CL = 12;
char cn[CM + CL], * ci = cn + CM + CL, * owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
ll tmp = *(ll*)ci;
if ((tmp & ma0) ^ ma0) {
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += (72 - dig >> 3);
}
else {
tmp = tmp & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += 8;
if ((ct = *ci++) >= '0') {
tmp = tmp * 10 + ct - '0';
if (*ci++ == '0') {
tmp = tmp * 10;
ci++;
}
}
}
return tmp;
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
int N = getint();
int kotae = 2e9;
rep(i, N) {
int a = getint();
int p = getint();
int x = getint();
if (a < x && p < kotae) kotae = p;
}
if (kotae > 1e9) printf("-1");
else printf("%d", kotae);
Would you please return 0;
} |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI=3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for(int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y) - 1) / (y))
#define MOD 1000000007ULL
#define IN(l, r, x) ((l) <= (x) && (x) < (r))
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
s64 s, p;
cin >> s >> p;
string ans = "No";
for (s64 n = 1; n * n <= p; ++n)
{
if (p % n == 0)
{
s64 m = p / n;
if (n + m == s) ans = "Yes";
}
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define nline "\n"
const ll M1=1e9+7;
const ll M=998244353;
const ll N=100005;
const ll INF_ADD=1e18;
const ll INF_MUL=1e13;
#define f first
#define s second
#define pll pair<ll,ll>
#ifndef ONLINE_JUDGE
#define debug(x) cerr<<#x<<" "; _print(x); cerr<<nline;
#else
#define debug(x);
#endif
void _print(ll x){cerr<<x;}
template<class T,class V> void _print(pair<T,V> p) {cerr<<"{"; _print(p.first);cerr<<","; _print(p.second);cerr<<"}";}
template<class T>void _print(vector<T> v) {cerr<<" [ "; for (T i:v){_print(i);cerr<<" ";}cerr<<"]";}
template<class T>void _print(set<T> v) {cerr<<" [ "; for (T i:v){_print(i); cerr<<" ";}cerr<<"]";}
template<class T>void _print(multiset<T> v) {cerr<< " [ "; for (T i:v){_print(i);cerr<<" ";}cerr<<"]";}
template<class T,class V>void _print(map<T, V> v) {cerr<<" [ "; for(auto i:v) {_print(i);cerr<<" ";} cerr<<"]";}
//--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
ll optimal(ll x,ll t){
ll sq=sqrt(x);
set<ll> comp;
comp.insert(t+x/(t+1));
if(sq>t)
comp.insert(sq+x/(sq+1));
sq++;
if(sq>t)
comp.insert(sq+x/(sq+1));
sq++;
if(sq>t)
comp.insert(sq+x/(sq+1));
sq=sqrt(x);
sq--;
if(sq>t)
comp.insert(sq+x/(sq+1));
sq--;
if(sq>t)
comp.insert(sq+x/(sq+1));
ll best=*(comp.begin());
return best;
}
void solve(){
ll n,m; cin>>n>>m;
vector<vector<pll>> adj(n+2);
vector<ll> ans(n+5,INF_ADD);
priority_queue<pll> prefer;
prefer.push({0,1});
vector<vector<ll>> a(m+4,vector<ll>(5,0));
ans[1]=0;
for(ll i=1;i<=m;i++){
for(ll j=1;j<=4;j++)
cin>>a[i][j];
adj[a[i][1]].pb({a[i][2],i});
adj[a[i][2]].pb({a[i][1],i});
}
while(prefer.size()){
auto it=prefer.top();
prefer.pop();
if(ans[it.s]!=-it.f)
continue;
ll node=it.s,instant=-it.f;
for(auto chld:adj[node]){
ll compare=(a[chld.s][3]+optimal(a[chld.s][4],instant));
if(compare<ans[chld.f]){
prefer.push({-compare,chld.f});
ans[chld.f]=compare;
}
}
}
if(ans[n]!=INF_ADD)
cout<<ans[n];
else
cout<<"-1";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
ll t=1;
//cin>>t;
while(t--){
solve();
}
/*
Correct data type?
Infinity?
Base case?
*/
cerr<<"Time:"<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";
} |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli, lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes(x) cout << (x ? "Yes" : "No") << endl;
#define YES(x) cout << (x ? "YES" : "NO") << endl;
#define out(s) cout << s << endl;
#define Reverse(x) reverse(all(x));
#define Sort(x) sort(all(x));
#define pb(s) push_back(s);
#define sp " "
#define INF 10000000000
#define LINF 9000000000000000000
#define all(s) s.begin(), s.end()
void vout(vi v)
{
for (lli i = 0; i < v.size(); i++)
cout << v.at(i) << endl;
}
vvi dp(1 << 17, vi(17,-1));
lli n;
vvi place(17, vi(3));
lli rec(lli s, lli v)
{
if (dp[s][v] >= 0)
{
return dp[s][v];
}
if (s == (1 << n) - 1 && v == 0)
{
return dp[s][v] == 0;
}
lli tmp = INF;
rep(i, n)
{
if (!(s >> i & 1))
{
lli p = (abs(place[v][0] - place[i][0]) + abs(place[v][1] - place[i][1]) + max((lli)0, place[i][2] - place[v][2]));
//out("P" << p);
if (p==0)
{
p = INF;
}
//out("P" << p <<"S" << s << "G" << v);
tmp = min(tmp, rec(s | 1 << i, i) +p);
//out(rec(s | 1 << i, i) + p << "S" << s << "G" << v);
}
}
return dp[s][v]=tmp;
}
int main()
{
cout << std::fixed << std::setprecision(10);
cin >> n;
rep(i, n)
{
lli a, b, c;
cin >> a >> b >> c;
place[i][0] = a;
place[i][1] = b;
place[i][2] = c;
}
out(rec(0, 0));
} | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long int ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;cin >> n;
vector<vector<int>> dist(n, vector<int>(n));
vector<tuple<int, int, int>> pos;
vector<vector<int>> dp(n, vector<int>(1 << n, 2e9));
dp[0][0] = 0;
for(int i = 0;i < n;i++){
int x, y, z;cin >> x >> y >> z;
pos.emplace_back(x, y, z);
}
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
if(i == j)continue;
dist[i][j] = abs(get<0>(pos[i]) - get<0>(pos[j])) +
abs(get<1>(pos[i]) - get<1>(pos[j])) +
max(0, get<2>(pos[j]) - get<2>(pos[i]));
}
}
for(int i = 0;i < (1 << n);i++){
for(int j = 0;j < n;j++){
for(int k = 0;k < n;k++){
if(j != k && dp[j][i] != INT_MAX){
dp[k][i | (1 << k)] = min(dp[k][i | (1 << k)], dp[j][i] + dist[j][k]);
}
}
}
}
cout << dp[0][(1 << n) - 1] << endl;
}
|
//#include <atcoder/maxflow.hpp>
#include <memory>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <fstream>
#include <iterator>
#include <random>
#include <chrono>
#include <complex>
#include <thread>
#define forr(i,start,count) for (int i = (start); i < (start)+(count); ++i)
#define set_map_includes(set, elt) (set.find((elt)) != set.end())
#define readint(i) int i; cin >> i
#define readll(i) ll i; cin >> i
#define readdouble(i) double i; cin >> i
#define readstring(s) string s; cin >> s
typedef long long ll;
using namespace std;
//using namespace atcoder;
ll modd = (1000LL * 1000LL * 1000LL + 7LL);
//ll modd = 998244353;
int main() {
ios_base::sync_with_stdio(false);
cout.precision(17);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> rand_gen(0, modd); // rand_gen(rng) gets the rand no
auto start = chrono::steady_clock::now();
// readint(test_cases);
int test_cases = 1;
forr(t, 1, test_cases) {
readint(n);
int ct = 0;
forr(i,1,n) {
bool has7 = false;
int nn = i;
while (nn>0) {
if (nn%10==7) {has7=true;}
nn/=10;
}
nn = i;
while (nn>0) {
if (nn%8==7) {has7=true;}
nn/=8;
}
if (!has7) {
++ct;
}
}
cout << ct << endl;
}
// auto stop = chrono::steady_clock::now();
// auto duration = chrono::duration_cast<chrono::milliseconds>(stop - start);
// cout << "Duration: " << duration.count() << endl;
return 0;
}
| #include <stdio.h>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#include <functional>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef vector<vector<int>> v2int;
typedef vector<vector<vector<int>>> v3int;
typedef vector<ll> vll;
typedef vector<vector<ll>> v2ll;
typedef vector<vector<vector<ll>>> v3ll;
typedef list<int> liint;
typedef pair<int, int> pint;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<ll, ll>> vpll;
typedef vector<pair<ll, int>> vpll_int;
typedef vector<pair<int, ll>> vpint_ll;
typedef set<pair<int, int>> spint;
typedef set<pair<ll, int>> spll;
typedef unordered_map<int, unordered_set<int>> Graph;
const int INF = int(2e9);
const ll LINF = ll(2e9) * ll(2e9);
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T, class C> void chmax(T& a, C b) { a > b ? : a = b; }
template<class T, class C> void chmin(T& a, C b) { a < b ? : a = b; }
bool is_seven10(int x) {
string s = to_string(x);
rep(i, s.size()) {
if (s[i] == '7') return true;
}
return false;
}
bool is_seven8(int x) {
while (1) {
if (x < 8) {
break;
}
int t = x % 8;
if (t == 7) return true;
x /= 8;
}
if (x == 7) return true;
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
ll ans = 0;
REP(x, 1, N + 1) {
if (is_seven8(x) == true) continue;
if (is_seven10(x) == true) continue;
ans++;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int INF = int (1e9) + int (1e5);
const ll INFL = ll(2e18) + ll(1e10);
const ui MOD = 1E9 + 7;
const double EPS = 1e-9;
#define FOR(i,n) for (int i=0;i<(n);++i)
#define ROF(i,x) for(int i = (x) ; i >= 0 ; --i)
#define MP make_pair
#define all(a) (a).begin(),(a).end()
#define ODD(x) ( ((x)&1)==0?0:1 )
#define SIGN(x) ( ((x) > 0) - ((x) < 0) )
#define dbg(x) cerr << #x"= " << x << endl
std::mt19937_64 generator(std::chrono::system_clock::now().time_since_epoch().count());
inline ll powmod(ll a,ll b,ll mod) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a, ll b) { return a ? gcd(b%a, a): b; }
ll lcm(ll a, ll b) { return a / gcd(a,b) * b; }
void READ(bool _local){
ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef _DEBUG
if (_local)
freopen ("in.txt", "r", stdin);
#endif
}
const int N=1E5+1;
int c[N];
vi g[N];
int cnt[N];
int n;
int good[N];
void dfs(int node, int p=-1){
if (++cnt[c[node]]==1) good[node+1]=1;
for(int v:g[node]){
if (v!=p){
dfs(v,node);
}
}
--cnt[c[node]];
}
int main() {
READ(0);
cin>>n;
FOR(i,n) cin>>c[i];
FOR(i,n-1){
int u,v;cin>>u>>v;
--u, --v;
g[u].push_back(v);
g[v].push_back(u);
}
dfs(0);
for(int i=1;i<=n;++i) if (good[i]) cout << i << " ";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define pf push_front
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
#define endl "\n"
#define pi 3.14159265358979323846
#define inf 1000000000
#define setbits(x) __builtin_popcountll(x)
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int N = 1e5+50;
const ll mod = 1e9+7;
const ll INF = 1e18;
// int dx[9]={-1,-1,-1,0,1,1,1,0,0};
// int dy[9]={-1,0,1,1,1,0,-1,-1,0};
int dx[] = {-1,0,1,0};
int dy[] = {0,1,0,-1};
bool compare(const pair<ll, ll>&i, const pair<ll, ll>&j)
{
return i.second < j.second;
}
ll fact[N];
vector<bool> is_prime(100000,true);
vector<int>prime;
void pre()
{
fact[0]=1;
for(ll i=1;i<N;i++)
{
fact[i]=i*fact[i-1];
fact[i]%=mod;
}
}
ll modexp(ll x,ll n)
{
ll r=1;
while(n){
if(n&1)
r=(r*x)%mod;
x=(x*x)%mod;
n>>=1;
}
return r%mod;
}
ll modinv(ll x)
{
return modexp(x,mod-2);
}
ll ncr(ll n,ll r)
{
if(n<r)
return 0;
ll ans=(fact[n]%mod * modinv(fact[r])%mod * modinv(fact[n-r])%mod)%mod;
return ans;
}
ll exp(ll x,ll n)
{
ll r=1;
while(n){
if(n&1)
r=(r*x);
x=(x*x);
n>>=1;
}
return r;
}
int n;
vector<int>C(N);
vector<int>adj[N];
bool vis[N];
map<int,int>m;
int ver;
vector<int>ans;
void dfs(int x){
vis[x]=1;
if(m[C[x]]==0)
ans.pb(x);
m[C[x]]++;
for(auto ch:adj[x]){
if(!vis[ch]){
dfs(ch);
}
}
m[C[x]]--;
}
void solve()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>C[i];
for(int i=0;i<n-1;i++){
int a,b;
cin>>a>>b;
adj[a].pb(b);
adj[b].pb(a);
}
dfs(1);
sort(ans.begin(),ans.end());
for(auto x:ans)
cout<<x<<endl;
return ;
}
int32_t main()
{
fio
// #ifdef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
// pre();
int t=1;
// cin>>t;
for(int i=0;i<t;i++)
{
solve();
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
void output(vector<int> &a){
cout << a.size();
for(auto &nx : a){
cout << ' ' << nx;
}
cout << '\n';
}
int main(){
int n;
cin >> n;
vector<int> a(n);
for(auto &nx : a){cin >> nx;}
vector<vector<int>> bk(200,vector<int>(0));
int cnt=min(n,8);
for(int i=1;i<(1<<cnt);i++){
int sig=0;
vector<int> s;
for(int j=0;j<cnt;j++){
if(i&(1<<j)){
s.push_back(j+1);
sig+=a[j];sig%=200;
}
}
if(bk[sig].size()!=0){
cout << "Yes\n";
output(bk[sig]);
output(s);
return 0;
}
else{bk[sig]=s;}
}
cout << "No\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define eni(x) template < class c > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
template < class c > struct rge { c b, e; };
template < class c > rge<c> range(c i, c j) { return rge<c>{i, j}; }
template < class c > auto dud(c* x) -> decltype(cerr << *x, 0);
template < class c > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; return * this; }
eni(==) return * this << range(begin(i), end(i)); }
template < class c, class b > debug & operator <<(pair < b, c > d) {
return * this << "(" << d.first << ", " << d.second << ")";
}
template < class c > debug & operator <<(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
return * this << "]";
}
#else
template < class c > debug & operator <<(const c&) { return * this; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define mod 998244353
#define mx 1000050
mt19937 myrand(time(0));
ll fact[52];
int n,k,cnt;
int a[52][52];
vector<int> adj[52];
bool vis[52];
void dfs(int u){
if(vis[u]) return;
cnt++;
vis[u]=1;
for(auto& v:adj[u]){
if(!vis[v]) dfs(v);
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(),cout.tie();
fact[0]=1;
for(int i=1;i<=50;i++) fact[i]=(fact[i-1]*i)%mod;
cin>>n>>k;
for(int i=0;i<n;i++) for(int j=0;j<n;j++) cin>>a[i][j];
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
bool paisi=0;
for(int l=0;l<n;l++){
if(a[l][i]+a[l][j]>k){
paisi=1;
break;
}
}
if(!paisi){
adj[i].pb(j);
adj[j].pb(i);
}
}
}
ll ans=1;
for(int i=0;i<n;i++){
if(!vis[i]){
cnt=0;
dfs(i);
ans=(ans*fact[cnt])%mod;
}
}
for(int i=0;i<n;i++) vis[i]=0,adj[i].clear();
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
bool paisi=0;
for(int l=0;l<n;l++){
if(a[i][l]+a[j][l]>k){
paisi=1;
break;
}
}
if(!paisi){
adj[i].pb(j);
adj[j].pb(i);
}
}
}
for(int i=0;i<n;i++){
if(!vis[i]){
cnt=0;
dfs(i);
ans=(ans*fact[cnt])%mod;
}
}
cout<<ans<<endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (auto &&i : v) scanf("%d", &i);
int ans = 0;
for (int i = 0; i < n; ++i) {
int l = i, r = i;
while(l > 0 && v[l-1] >= v[i]) l--;
while(r < n && v[r] >= v[i]) r++;
ans = max(ans, (r-l)*v[i]);
}
cout << ans << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define INF_ll 1000000000000000007
#define ll long long
#define endl "\n"
#define uint unsigned long long
#define unmp unordered_map
#define unst unordered_set
#define int long long
#define watch(x) cerr << "\n" << (#x) << " is " << (x) << endl
#define line cout << " " << endl
/////////////////////////////////////////////////////
void hi(){
static int i=0;
cout << "Check Point : " << ++i << endl;
return;
}
/////////////////////////////////////////////////////
/////////////////////////////////////////////////////
int stoi1(string str){
int n=str.length();
int number = 0;
int pos = 1;
for(int i=n-1;i>=0;i--){
number = number + (str[i]-'0')*pos;
pos=pos*10;
}
return number;
}
int power(int a,int n){
int res = 1;
while(n>0){
if(n%2!=0){
res = res*a;
n--;
}
else if(n%2==0){
a = a*a;
n=n/2;
}
}
return res;
}
/////////////////////////////////////////////////////
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//#ifndef ONLINE_JUDGE
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
//#endif
int t;
t=1;
//cin >> t;
while(t--){
int k;
cin >> k;
int pdt;
int count=0;
for(int i=1;i<=k;i++){
for(int j=1;j<=k;j++){
if(i*j>k) break;
for(int l=1;l<=k;l++){
pdt = i*j*l;
if(pdt<=k) count++;
else break;
}
}
}
cout << count << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<long long> vl;
typedef vector<vector<long long>> vvl;
typedef vector<vector<vector<long long>>> vvvl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef long long ll;
const long long MOD=1000000007;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
int main(){
int n;
cin>>n;
vl a(n);
rep(i,n) cin>>a[i];
ll sum=0;
rep(i,n) sum+=a[i]*a[i];
ll tmp=0;
rep(i,n) tmp+=a[i];
tmp=tmp*tmp;
cout<<n*sum-tmp<<endl;
} | #include<stdio.h>
#include<queue>
#include<vector>
#include<string.h>
#include<iostream>
#include<math.h>
#include<map>
#include<algorithm>
using namespace std;
#define int long long
#define ll long long
#define speed(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
const int maxn=2e5+10;
const int inf=0x3f3f3f3f;
const int INF=1ll<<62;
inline int rd() {
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9') {
if(ch=='-')f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') {
x=x*10+ch-'0';
ch=getchar();
}
return x*f;
}
int gcd(int a,int b) {
return b? gcd(b,a%b):a;
}
int n;
signed main() {
n=rd();
int ans=0;
for(int i=1;i<=1000000;i++){
int ceng=1;
while(pow(10,ceng)<=i)ceng++;
int res=pow(10,ceng)*i+i;
// cout<<res<<endl;
if(res>n)break;
ans=i;
}
printf("%lld\n",ans);
return 0;
}
//5 3 12 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll fact(ll n)
{
ll f=1;
for(int i=1;i<=n;i++){
f*=i;
}
return f;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
string s;
cin>>s;
int n=s.size();
int flag=0,no=0;
int l=0,r=n-1;
while(l<r){
if(s[l]!=s[r] && flag==0){
if(s[r]=='0'){
r--;
continue;
}
else{
no=1;
break;
}
}
else if(s[l]==s[r]){
flag=1;
l++;r--;
}
else if(s[l]!=s[r]){
no=1;
break;
}
}
if(no==1) cout<<"No";
else cout<<"Yes";
} | #include<bits/stdc++.h>
#define inf 0x3f3f3f3f
typedef unsigned long long ull;
typedef long long ll;
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void sc(int &x){scanf("%d",&x);}
void sc(int &x,int &y){scanf("%d%d",&x,&y);}
void sc(int &x,int &y,int &z){scanf("%d%d%d",&x,&y,&z);}
void sc(ll &x){scanf("%lld",&x);}
void sc(ll &x,ll &y){scanf("%lld%lld",&x,&y);}
void sc(ll &x,ll &y,ll &z){scanf("%lld%lld%lld",&x,&y,&z);}
void sc(char *x){scanf("%s",x);}
void sc(char *x,char *y){scanf("%s%s",x,y);}
void sc(char *x,char *y,char *z){scanf("%s%s%s",x,y,z);}
void out(int x){printf("%d\n",x);}
void out(ll x){printf("%lld\n",x);}
void out(int x,int y){printf("%d %d\n",x,y);}
void out(ll x,ll y){printf("%lld %lld\n",x,y);}
void out(int x,int y,int z){printf("%d %d %d\n",x,y,z);}
void out(ll x,ll y,ll z){printf("%lld %lld %lld\n",x,y,z);}
using namespace std;
const int N=5e3+5;
bool judge(int x)
{
if(x==0) return true;
vector<int>ans;
while(x) ans.push_back(x%10),x/=10;
for(int l=0,r=ans.size()-1;l<=r;l++,r--)
if(ans[l]!=ans[r]) return false;
return true;
}
int main()
{
//freopen("1.in","r",stdin);freopen("1.out","w",stdout);
int n;cin>>n;
while(n&&n%10==0) n/=10;
if(judge(n)) printf("Yes\n");
else printf("No\n");
}
|
#include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define gmn(a,b) a=min(a,b)
#define gmx(a,b) a=max(a,b)
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const int infi=2e9;//infi较大，注意涉及inf相加时爆int
const ll infl=4e18;
inline ll ceil_div(ll a,ll b){ return (a+b-1)/b; }
inline ll pos_mod(ll a,ll b){ return (a%b+b)%b; }
//std::mt19937 rnd(time(0));//std::mt19937_64 rnd(time(0));
}
using namespace Sakurajima_Mai;
namespace Fast_Read{
inline int qi(){
int f=0,fu=1; char c=getchar();
while(c<'0'||c>'9'){ if(c=='-')fu=-1; c=getchar(); }
while(c>='0'&&c<='9'){ f=(f<<3)+(f<<1)+c-48; c=getchar(); }
return f*fu;
}
inline ll ql(){
ll f=0;int fu=1; char c=getchar();
while(c<'0'||c>'9'){ if(c=='-')fu=-1; c=getchar(); }
while(c>='0'&&c<='9'){ f=(f<<3)+(f<<1)+c-48; c=getchar(); }
return f*fu;
}
inline db qd(){
char c=getchar();int flag=1;double ans=0;
while((!(c>='0'&&c<='9'))&&c!='-') c=getchar();
if(c=='-') flag=-1,c=getchar();
while(c>='0'&&c<='9') ans=ans*10+(c^48),c=getchar();
if(c=='.'){c=getchar();for(int Bit=10;c>='0'&&c<='9';Bit=(Bit<<3)+(Bit<<1)) ans+=(double)(c^48)*1.0/Bit,c=getchar();}
return ans*flag;
}
}
namespace Read{
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define rai(x,a,b) repi(i,a,b) x[i]=qi()
#define ral(x,a,b) repi(i,a,b) x[i]=ql()
}
namespace Out{
#define pi(x) printf("%d",x)
#define pl(x) printf("%lld",x)
#define ps(x) printf("%s",x)
#define pc(x) printf("%c",x)
#define pe() puts("")
}
namespace DeBug{
#define MARK false
#define DB if(MARK)
#define pr(x) cout<<#x<<": "<<x<<endl
#define pra(x,a,b) cout<<#x<<": "<<endl; \
repi(i,a,b) cout<<x[i]<<" "; \
puts("");
#define FR(a) freopen(a,"r",stdin)
#define FO(a) freopen(a,"w",stdout)
}
using namespace Fast_Read;
using namespace Read;
using namespace Out;
using namespace DeBug;
int qpow(int x,int n,int mod){ int res=1;while(n){ if(n&1) res=(1ll*res*x)%mod; x=1ll*x*x%mod,n>>=1; } return res; }
int main()
{
int a=qi(),b=qi(),c=qi();
int fac=qpow(b,c,4)+4;
pi(qpow(a,fac,10)),pe();
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
long power(long x, long y, long mod){
if(y==0)return 1;
else if(y==1)return x%mod;
else if(y%2==0)return (power(x,y/2,mod)*power(x,y/2,mod))%mod;
else return (((power(x,y/2,mod)*power(x,y/2,mod))%mod) *x)%mod;
}
int main(){
long a,b,c;
cin >> a >> b >> c;
long f = a%10, count = 1, aa = (a%10)*(a%10);
while(aa%10 != f){
aa *= (a%10);
count++;
}
// int bc = power(b,c,count);
// if(bc == 0)bc += count;
if(count == 1)cout << f << endl;
else cout << power(a,power(b,c,count)+count,10) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))
#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))
#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T=ll> T read(){ T re; cin>>re; return move(re);}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}
vv<int> readG(const int &n){ return readG(n,n-1);}
#define TT cauto TTT=read();rep(_,TTT)
const ll MOD=1e9+7; //998244353;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cout<<fixed<<setprecision(0);
cauto n=read();
auto as=readV(n); reverse(all(as));
cauto bs=readV(n);
priority_queue<int,vector<int>,greater<int>> pq;
ll re=0;
rep(i,n){
cauto a=max(as[i],bs[i]);
cauto b=min(as[i],bs[i]);
re+=a; pq.emplace(a);
if(pq.top()<b){
re-=pq.top(); pq.pop();
re+=b; pq.emplace(b);
}
}
cout<<re NL;
return 0;
}
| #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define X first
#define Y second
#define nl '\n'
#define AC return 0
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#define scd(a) scanf("%lld", &a)
#define scdd(a,b) scanf("%lld%lld", &a, &b)
#define scs(s) scanf("%s", s)
//#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
const ll INF = (ll)0x3f3f3f3f3f3f3f, MAX = 9e18, MIN = -9e18;
const int N = 1.5e6+10, M = 2e6+10, mod = 1e9+7, inf = 0x3f3f3f;
ll a[N], nex[N], pre[N];
map<int, int> mp;
vector<int> v[N];
int main()
{
IOS;
int _;
_ = 1;
while(_--)
{
ll n, m;
cin>>n>>m;
rep1(i, n) cin>>a[i], v[a[i]].pb(i);
rep1(i, n)
{
if(mp[a[i]])
nex[mp[a[i]]] = i, pre[i] = mp[a[i]];
mp[a[i]] = i;
}
rep1(i, n)
{
if(!nex[i])
nex[i] = n+1;
if(!pre[i])
pre[i] = 0;
}
rep(i, n+1)
{
if(!v[i].size())
{
cout<<i<<nl;
AC;
}
for(auto x : v[i])
if(nex[x]-x > m||x-pre[x] > m)
{
cout<<i<<nl;
AC;
}
}
}
AC;
}
|
/*
Saturday 01 May 2021 05:47:35 PM IST
@uthor::astrainL3gi0N
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef std::vector<int> vi;
typedef std::vector<ll> vll;
typedef std::pair<int,int> ii;
#define debg(x) std::cerr<<(#x)<<" => "<<x<<'\n';
#define debgg(x,y) std::cerr<<(#x)<<" => "<<x<<'\t'<<(#y)<<' '<<y<<'\n';
#define len(a) (int)(a).size()
#define all(x) x.begin(),x.end()
const int mod = 1000000007;
//const int mod = 998244353;
bool comp (int x, int y) {
return x > y;
}
void printarr (int arr[], int n) {
for(int i = 0; i < n; ++i)
std::cerr<<arr[i]<<(i<n-1?' ':'\n');
}
template < typename T> void printv (T &a) {
for (auto it = a.begin(); it != a.end(); ++it)
std::cerr<<*it<<' ';
std::cerr<<'\n';
}
int gint() {
int n; cin>>n;
return n;
}
const int maxn = 2009;
double ans;
double dt[maxn];
double ht[maxn];
void solve ()
{
ans = 0;
bool ok = 1;
int n = gint();
double d = gint();
double h = gint();
for (int i = 0; i < n;++i) {
dt[i] = gint();
ht[i] = gint();
}
n++;
double slope=0 ,c=0;
dt[n] = 0;
for (int i = 0;ok && i < n;++i) {
slope = (h-ht[i])/(d-dt[i]);
c = h-slope*d;
ok = 0;
for (int j = 0; !ok && j < n;++j) {
double temp = slope*dt[j]+c;
ok = ht[j] > temp;
}
}
ans = c;
cout << setprecision(10) << fixed;
std::cout<<ans;
std::cout<<'\n';
}
void sol ()
{
//test
}
int main ()
{
//sol();return 0;
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
int testcases = 1;
//testcases = gint();
for (int t = 0; t < testcases; ++t) {
//cout<<"Case #"<<t+1<<": ";
solve();
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void){
int N, D, H;
cin >> N>> D>>H;
double b, d, h;
double ans = 0.0;
for( int i=0; i<N; ++i){
cin >> d >>h;
b = ((double)D*h - (double)H*d) / ((double)D-d);
if(ans < b) ans = b;
}
cout<<ans;
return 0;
} |
#include <iostream>
//#include <vector>
//#include <string>
//#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long LL;
//typedef long double LD;
using namespace std;
//#define MOD 1000000007
//#define MOD 998244353
//#define MAX 200100
//#define NIL -1
//#define INF 1000000000000000000
//const LL SEG_VAL = 1 << 19;
pair<LL, LL> exact(const LL &B, const LL &C){
const auto n = C/2;
if(C%2){
return {-B-n, -B+n};
}else{
if(!C){
return {B, B};
}
return {B-n, B+n-1};
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
LL B;
LL C;
cin >> B >> C;
pair<LL, LL> ab = exact(B, C);
pair<LL, LL> cd = exact(B, C-1);
cout << (ab.second-ab.first+1)+(cd.second-cd.first+1)-max((LL)0, min(ab.second,cd.second)-max(ab.first,cd.first)+1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll b , c , l , r;
vector< pair<ll,ll> > v;
cin >> b >> c;
//awel segment, min positive number a2dar ageboh
r = b , l = b-c/2;
v.push_back({l,r});
//tany segment, min negative a2dar ageboh
r = -b , l = -(b - (c-1)/2);
v.push_back({l,r});
//talet seg, max neg
r = -b , l = -b - (c-1)/2;
v.push_back({l,r});
//rabe3 seg, max positive a2dar ageboh
l = b , r = b + (c-2)/2;
v.push_back({l,r});
set<ll> st;
for(int i=0; i<v.size(); i++)
{
if (v[i].f > v[i].s) swap(v[i].f , v[i].s);
}
sort(v.begin() , v.end());
ll ans = 0;
l = v[0].f , r = v[0].s;
for(int i=1; i<v.size(); i++)
{
if (v[i].f <= r) r = max(r , v[i].s);
else
{
ans += (r-l+1);
l = v[i].f , r = v[i].s;
}
}
ans += (r-l+1);
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
const int N = 300;
using std::cout;
bool f[N];
int n, id[N];
std::pair<int, int> p[N];
int main() {
std::ios::sync_with_stdio(false);
std::cin >> n;
for (int i = 1; i <= n; ++i) {
std::cin >> p[i].first >> p[i].second;
if (~p[i].first) {
if (id[p[i].first]) {
cout << "No";
return 0;
}
id[p[i].first] = -i;
}
if (~p[i].second) {
if (id[p[i].second]) {
cout << "No";
return 0;
}
id[p[i].second] = i;
}
}
f[0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= i && !f[i]; ++j) {
bool flag = 1;
for (int k = 1; k <= j; ++k) {
int x = id[2 * (i - j) + k], y = id[2 * (i - j) + j + k];
if (x > 0 || y < 0 || (x < 0 && y > 0 && x != -y)) {
flag = 0;
break;
}
}
if (flag)
f[i] |= f[i - j];
}
}
cout << (f[n] ? "Yes" : "No");
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long int
const int mod = 1e9 + 7;
using namespace std;
int ple;
int f(vector<int>arr,vector<int>brr)
{
sort(arr.begin(),arr.end());
sort(brr.begin(),brr.end());
int n=arr.size(),nn=brr.size();
int ret=mod*mod;
for(int i=0;i<n;i++)
{
int ind=lower_bound(brr.begin(),brr.end(),arr[i])-brr.begin();
int st=max(0LL,ind-2);
int en=min(nn-1,ind+2);
for(int j=st;j<=en;j++)
{
int cur=abs(arr[i]-brr[j]);
if(cur<ret)
{
ret=cur;
ple=brr[j];
}
}
}
return ret;
}
int ff(vector<int>arr,vector<int>brr,vector<int>crr)
{
int ret=f(arr,crr);
for(int &a:crr)
{
if(a==ple)
{
a=mod*mod;
break;
}
}
ret+=f(brr,crr);
return ret;
}
void myfun()
{
int n;
cin>>n;
vector<int>rr,gg,bb;
int r=0,b=0,g=0;
for(int i=0;i<(2*n);i++)
{
int a; cin>>a;
char ch; cin>>ch;
if(ch=='R')
{
r++;
rr.push_back(a);
}
if(ch=='G')
{
g++;
gg.push_back(a);
}
if(ch=='B')
{
b++;
bb.push_back(a);
}
}
if(r%2==0 && g%2==0 && b%2==0)
{
cout<<"0\n";
return;
}
int ans=mod*mod;
if(r%2==1 && g%2==1)
ans=min(ff(rr,gg,bb),f(rr,gg));
if(r%2==1 && b%2==1)
ans=min(ff(rr,bb,gg),f(bb,rr));
if(b%2==1 && g%2==1)
ans=min(ff(bb,gg,rr),f(gg,bb));
cout<<ans<<"\n";
}
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
int t=1;
//cin>>t;
while(t--)
myfun();
return 0;
} |
#include <iostream>
#include <cstdio>
#include <vector>
#define N 55
using namespace std;
typedef long long ll;
ll n, ans = 1e18, a[N];
bool vpr[N];
vector<ll> pr;
ll gcd(ll p, ll q) {
if (q == 0) return p;
return gcd(q, p % q);
}
void f(ll p, ll q) {
ll i;
if (q >= ans) return;
if (p == pr.size()) {
for (i = 0; i < n; i++) {
if (gcd(q, a[i]) == 1) return;
}
ans = q;
return;
}
f(p + 1, q);
f(p + 1, q * pr[p]);
}
int main()
{
ll i, j;
cin >> n;
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
for (i = 2; i <= 50; i++) {
if (vpr[i]) continue;
pr.push_back(i);
for (j = i * 2; j <= 50; j += i) {
vpr[j] = 1;
}
}
f(0, 1);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,srt,end) for(ll i = (srt); i < (ll)(end); i++)
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
//cout << std::fixed << std::setprecision(15) << y << endl;
// For debug
// Ref: https://qiita.com/ysuzuki19/items/d89057d65284ba1a16ac
#define dump(var) do{std::cerr << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cerr << e << "\n";}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cerr << e << " "; } std::cerr << "\n";}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ std::cerr << "\n"; for(const auto& v : vv){ view(v); } }
template<typename T> void dump_cout(const T& v) { for(long long i = 0; i < v.size(); i++) std::cout << v[i] << (i == v.size()-1 ? "\n" : " "); }
// 約数列挙
vector<ll> yakusu(ll n){
vector<ll> ret;
for(ll i = 1; i*i <= n; i++){
if(n % i != 0) continue;
ret.push_back(i);
if(i*i != n) ret.push_back(n/i);
}
sort(ret.begin(), ret.end());
return ret;
}
bool IsPrime(int num)
{
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2){
if (num % i == 0){
// 素数ではない
return false;
}
}
// 素数である
return true;
}
// 最大公約数
// 結合法則も成り立つ
ll gcd(ll a, ll b){
if(a < b) return gcd(b, a);
ll r = a % b;
while(r != 0){
a = b;
b = r;
r = a % b;
}
return b;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n; cin >> n;
vector<ll> x(n);
rep(i,0,n) cin >> x[i];
vector<ll> px;
rep(i,2,51) if(IsPrime(i)) px.push_back(i);
dump(px);
ll ans = INF;
for(int i = 0; i < (1<<px.size()); i++){
ll y = 1;
for(int j = 0; j < px.size(); j++) if(i & (1<<j)) y *= px[j];
bool f = true;
if(y != 1){
rep(i,0,n){
if(gcd(x[i], y) != 1) f *= true;
else f *= false;
}
}else f = false;
if(f) ans = min(ans, y);
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = 1'000'000'000LL + 7; //'
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
int msb(int x) {return x?31-__builtin_clz(x):-1;}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}
/**
* @url
* @est
*/
int main() {
cin.tie(0);ios::sync_with_stdio(false);
int N,M; cin >> N >> M;
vector<int> A(N+1),B(M+1);
for(int i=1;i<=N;++i) cin >> A[i];
for(int i=1;i<=M;++i) cin >> B[i];
auto dp = multivector(N+1,M+1,2,123456789);
dp[0][0][0]=0;
for(int i=0;i<=N;++i) {
for(int j=0;j<=M;++j) {
if(i+1<=N && j+1<=M) {
int flg = (A[i+1]!=B[j+1]);
chmin(dp[i+1][j+1][flg],dp[i][j][0]+flg);
chmin(dp[i+1][j+1][flg],dp[i][j][1]+flg);
}
if(i+1<=N) {
int flg = (A[i+1]!=B[j]);
chmin(dp[i+1][j][flg],dp[i][j][1]+flg);
chmin(dp[i+1][j][0] ,dp[i][j][0]+1);
}
if(j+1<=M) {
int flg = (A[i]!=B[j+1]);
chmin(dp[i][j+1][flg],dp[i][j][1]+flg);
chmin(dp[i][j+1][0] ,dp[i][j][0]+1);
}
}
}
cout << min(dp[N][M][0],dp[N][M][1]) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct io_setup{
io_setup(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
int main(){
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
rep(i, N) cin >> A[i];
rep(i, M) cin >> B[i];
vector<vector<int>> dp(N+1, vector<int>(M+1, inf));
rep(i, N+1) dp[i][0] = i;
rep(i, M+1) dp[0][i] = i;
rep2(i, 1, N){
rep2(j, 1, M){
chmin(dp[i][j], dp[i-1][j]+1);
chmin(dp[i][j], dp[i][j-1]+1);
int x = (A[i-1] == B[j-1]);
chmin(dp[i][j], dp[i-1][j-1]+1-x);
}
}
cout << dp[N][M] << '\n';
} |
#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<double,double> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const ll mod=1e9 + 7;
const ll LINF=1ll<<60;
const int INF=1<<28;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};
typedef vector<vector<ll>> mat;
mat mul(mat A,mat B){
mat C(A.size(),vector<ll> (B[0].size()));
for(int i=0;i<A.size();i++){
for(int k=0;k<B.size();k++){
for(int j=0;j<B[0].size();j++){
C[i][j]=(C[i][j]+A[i][k]*B[k][j])%mod;
}
}
}
return C;
}
mat pow(mat A,ll n){
mat B(A.size(),vector<ll> (A.size()));
for(int i=0;i<A.size();i++){
B[i][i]=1;
}
while(n>0){
if(n&1) B=mul(B,A);
A=mul(A,A);
n>>=1;
}
return B;
}
ll fpow(ll a, ll n){
ll x = 1;
if(a == 0) return 1;
while(n > 0){
if(n&1){
x=x*a%mod;
}
a=a*a%mod;
n >>= 1;
}
return x;
}
int main(){
ll n,m,k;cin >> n >> m >> k;
mat a(n, vector<ll> (1));
for (int i = 0; i < n; i++) {
cin >> a[i][0];
}
if(m == 0){
for (int i = 0; i < n; i++) {
cout << a[i][0] << endl;
}
return 0;
}
mat h(n, vector<ll> (n, 0));
for (int i = 0; i < m; i++) {
int x,y;cin >> x >> y;
x--,y--;
h[x][y]++;
h[x][x]++;
h[y][x]++;
h[y][y]++;
for (int j = 0; j < n; j++) {
if(x == j || y == j) continue;
h[j][j]+=2;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
//cout << h[i][j] << " ";
h[i][j] = h[i][j] * fpow(2, mod - 2) % mod * fpow(m, mod - 2) %mod;
}
//cout << endl;
}
auto res = mul(pow(h, k), a);
for (int i = 0; i < n; i++) {
cout << res[i][0] << endl;
//cout << res[i][0] * fpow(fpow(2, k), mod - 2) %mod << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(LL i=0;i<n;++i)
#define repn(i,n) for(LL i=1;i<=n;++i)
#define LL long long
#define pii pair <LL,LL>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
LL qpow(LL x,LL a)
{
LL res=x,ret=1;
while(a>0)
{
if((a&1LL)==1LL) ret=ret*res%MOD;
a>>=1LL;
res=res*res%MOD;
}
return ret;
}
LL n,m,t,a[110];
vector <LL> g[110];
vector <vector <LL> > pw[40],res,tmpp,mulv;
vector <LL> tmp;
vector <vector <LL> > mul(vector <vector <LL> > a,vector <vector <LL> > b)
{
vector <vector <LL> > ret(a.size(),vector <LL>(b[0].size()));
rep(i,a.size()) rep(j,b[0].size()) rep(k,b.size()) ret[i][j]=(ret[i][j]+a[i][k]*b[k][j]%MOD)%MOD;
return ret;
}
void getpow()
{
repn(i,30) pw[i]=mul(pw[i-1],pw[i-1]);
}
int main()
{
cin>>n>>m>>t;
repn(i,n) scanf("%lld",&a[i]);
LL x,y;
rep(i,m)
{
scanf("%lld%lld",&x,&y);
g[x].pb(y);g[y].pb(x);
}
if(t==0)
{
repn(i,n) cout<<a[i]<<endl;
return 0;
}
pw[0].clear();
LL add=1*qpow(m*2,MOD-2);
repn(i,n)
{
tmp.clear();
repn(j,n) tmp.pb(0);
tmp[i-1]=(m-g[i].size())*qpow(m,MOD-2)%MOD;
rep(j,g[i].size())
{
tmp[g[i][j]-1]=(tmp[g[i][j]-1]+add)%MOD;
tmp[i-1]=(tmp[i-1]+add)%MOD;
}
pw[0].pb(tmp);
}
getpow();
bool have=false;
for(LL i=30;i>=0;--i)
{
if(t<(1LL<<i)) continue;
t-=(1LL<<i);
if(!have) mulv=pw[i];
else mulv=mul(mulv,pw[i]);
have=true;
}
repn(i,n)
{
tmp.clear();
tmp.pb(a[i]);
tmpp.pb(tmp);
}
res=mul(mulv,tmpp);
rep(i,n) cout<<res[i][0]<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const long double k=0.6180339887498948482045;
ll x,y,tmp;
vector<int> ans;
int main(){
scanf("%lld",&tmp);if(tmp==0) {printf("0\n");return 0;}
//printf("%lf\n",((long double)tmp)*k-50);
for(ll i=max((ll)(((long double)tmp)*k)-50,0ll);;i++){
x=tmp;y=i;ans.clear();
while(x&&y){
if(x>y) ans.push_back(3),x=x-y;
else ans.push_back(4),y=y-x;
if(ans.size()>130) {break;}
}
if(ans.size()+max(x,y)<=130){
if(x) for(int i=1;i<=x;i++) ans.push_back(1);
else for(int i=1;i<=y;i++) ans.push_back(2);
printf("%d\n",ans.size());
for(int i=ans.size()-1;i>=0;i--) printf("%d\n",ans[i]);
return 0;
}
}
return 0;
}/*
47584759575744849
*/ | #include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<climits>
#include<stack>
#include<queue>
#include<set>
#include<array>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cctype>
#include<cstring>
#include<ctime>
#include<functional>
#include<numeric>
#include<map>
#include<list>
#include<bitset>
#include<random>
#include<chrono>
using namespace std;
#define int long long
int fib[100], fibtop;
void makefib()
{
fib[1] = 1;
for (int i = 2; fib[i - 1] < LONG_LONG_MAX / 3; i++)
{
fib[i] = fib[i - 1] + fib[i - 2];
fibtop = i + 1;
}
}
vector<int> getfibfacs(int i)
{
vector<int> r;
while (i)
{
auto p = lower_bound(fib, fib + fibtop, i);
if (*p != i) p--;
r.push_back(p - fib);
i -= *p;
}
return r;
}
signed main()
{
makefib();
int n;
scanf("%lld", &n);
vector<int> fibfacs = getfibfacs(n);
vector<int> res;
bool resultin;
int curmin;
if (fibfacs[0] % 2)
resultin = true;
else
resultin = false;
curmin = 1;
res.push_back(1);
for (int i = 1; i < fibfacs[0]; i++)
{
res.push_back(curmin ? 4 : 3);
curmin = !curmin;
}
vector<int> inserts(res.size() + 5);
for (int i = 1; i < (int)fibfacs.size(); i++)
{
inserts[fibfacs[0] - fibfacs[i]] = (fibfacs[0] - fibfacs[i]) % 2 ? 2 : 1;
}
auto f = [&](int r) -> int
{
if (resultin) return r;
else
{
if (r == 1) return 2;
if (r == 2) return 1;
if (r == 3) return 4;
return 3;
}
};
vector<int> res2;
for (int i = 0; i < (int)res.size(); i++)
{
res2.push_back(f(res[i]));
if (inserts[i]) res2.push_back(f(inserts[i]));
}
printf("%lld\n", res2.size());
for (int i = 0; i < (int)res2.size(); i++)
{
printf("%lld\n", res2[i]);
}
return 0;
} |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int seiv[200007];
ll res[200007];
int main () {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
memset(seiv, 0, sizeof(seiv));
memset(res, 0, sizeof(res));
res[1] = 1;
int k;
cin >> k;
if (k == 1) {
cout << 1 << endl;
return 0;
}
for (int i=2; i<=k; i++) {
if (!seiv[i]) {
res[i] = res[i-1] + 3;
for (int j=2; j*i <= k; j++) {
seiv[j*i] = 1;
int cnt = 1, tmp = j;
while (tmp%i == 0) {
cnt++;
tmp /= i;
}
if (!res[i*j]) res[i*j] = (cnt + 2)*(cnt + 1)/2;
else res[i*j] *= (cnt + 2)*(cnt + 1)/2;
}
}
else {
res[i] += res[i-1];
}
}
cout << res[k] << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
constexpr int N = 1e5 + 5;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n;
cin >> n;
LL res = 0;
for (int i = 1; i * i * i <= n; i++) {
for (int j = i; i * j * j <= n; j++) {
int k = n / (i * j);
if (i == j) {
res += (k - j) * 3 + 1;
}
else {
res += (k - j) * 6 + 3;
}
}
}
cout << res << endl;
} |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int n,nn;
int arr[1005],brr[1005];
map<int,int> m;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin>>n>>nn;
rep(x,0,n) cin>>arr[x];
rep(x,0,nn) cin>>brr[x];
rep(x,0,n) m[arr[x]]++;
rep(x,0,nn) m[brr[x]]++;
for (auto &it:m){
if (it.se==1) cout<<it.fi<<" ";
}
}
| #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1e5+2;
int num[maxn];
int f[maxn][2],last[maxn][2];
bool check(int x,int y)
{
int v=num[x]^num[y],res=0;
while(v) res++,v^=v&(-v);return res&1;
}
void solve()
{
int N,L;scanf("%d%d",&N,&L);
for(int i=1;i<=N;i++)
{
for(int j=L-1;j>=0;j--)
{
char x;scanf(" %c",&x);
num[i]|=((x-'0')<<j);
}
}
f[1][0]=f[1][1]=0;
for(int i=2;i<=N;i++)
{
last[i][1]=( check(i,i-1)?i-1:last[i-1][1] );
f[i][1]=f[last[i][1]][0];if(last[i][1]) f[i][1]++;
last[i][0]=( last[i][1]==i-1?last[i-1][1]:i-1 );
f[i][0]=f[last[i][0]][0];if(last[i][0]) f[i][0]++;
// printf("%d %d %d %d\n",f[i][0],f[i][1],last[i][0],last[i][1]);
}
long long ans=0;
for(int i=2;i<=N;i++) ans+=f[i][1];
printf("%lld",ans);
return;
}
int main()
{
int kase=1;
while(kase--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int _t = 1;
//cin >> _t;
while(_t--)
{
float x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
float ans = x1 + ( (x2-x1)/(1+y2/y1) );
cout << fixed << setprecision(8) << ans << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <algorithm>
#include <stack>
#include <queue>
#include <utility>
#include <cmath>
#include <set>
#include <iomanip>
using namespace std;
typedef long long ll;
int main()
{
double sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
gy *= -1;
double x_diff = gx - sx;
double y_diff = gy - sy;
double B = sy * x_diff - sx * y_diff;
double ans = -1 * B / y_diff;
std::cout << std::fixed <<std::setprecision(10) << ans << std::endl;
return (0);
}
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
template<typename T>void ckmn(T&a,T b){a=min(a,b);}
template<typename T>void ckmx(T&a,T b){a=max(a,b);}
void rd(int&x){scanf("%i",&x);}
void rd(ll&x){scanf("%lld",&x);}
void rd(char*x){scanf("%s",x);}
void rd(ldb&x){scanf("%lf",&x);}
void rd(string&x){scanf("%s",&x);}
template<typename T1,typename T2>void rd(pair<T1,T2>&x){rd(x.first);rd(x.second);}
template<typename T>void rd(vector<T>&x){for(T&i:x)rd(i);}
template<typename T,typename...A>void rd(T&x,A&...args){rd(x);rd(args...);}
template<typename T>void rd(){T x;rd(x);return x;}
int ri(){int x;rd(x);return x;}
template<typename T>vector<T> rv(int n){vector<T> x(n);rd(x);return x;}
template<typename T>void ra(T a[],int n,int st=1){for(int i=0;i<n;++i)rd(a[st+i]);}
template<typename T1,typename T2>void ra(T1 a[],T2 b[],int n,int st=1){for(int i=0;i<n;++i)rd(a[st+i]),rd(b[st+i]);}
template<typename T1,typename T2,typename T3>void ra(T1 a[],T2 b[],T3 c[],int n,int st=1){for(int i=0;i<n;++i)rd(a[st+i]),rd(b[st+i]),rd(c[st+i]);}
void re(vector<int> E[],int m,bool dir=0){for(int i=0,u,v;i<m;++i){rd(u,v);E[u].pb(v);if(!dir)E[v].pb(u);}}
template<typename T>void re(vector<pair<int,T>> E[],int m,bool dir=0){for(int i=0,u,v;i<m;++i){T w;rd(u,v,w);E[u].pb({v,w});if(!dir)E[v].pb({u,w});}}
const int mod=1e9+7;//998244353
int add(int a,int b){a+=b;return a>=mod?a-mod:a;}
void ckadd(int&a,int b){a=add(a,b);}
int sub(int a,int b){a-=b;return a<0?a+mod:a;}
void cksub(int&a,int b){a=sub(a,b);}
int mul(int a,int b){return (ll)a*b%mod;}
void ckmul(int&a,int b){a=mul(a,b);}
int powmod(int x,int k){int ans=1;for(;k;k>>=1,ckmul(x,x))if(k&1)ckmul(ans,x);return ans;}
int inv(int x){return powmod(x,mod-2);}
// D
int main(){
int n,m;
rd(n,m);
auto a=rv<int>(n);
int sumA=0;
for(int i:a)sumA+=i;
int N=m+n;
int K=sumA+n;
int ans=1;
if(K>N)ans=0;
else{
for(int i=1;i<=K;i++){
ckmul(ans,N-i+1);
ckmul(ans,inv(i));
}
}
printf("%i\n",ans);
return 0;
}
| #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0() {}
template<typename H,typename... T> void print0(H h,T... t){cout<<fixed<<setprecision(15)<<h;print0(t...);}
void print() { print0("\n"); }
template<typename H,typename... T>void print(H h,T... t){print0(h);if(sizeof...(T)>0)print0(" ");print(t...);}
void ioinit() { cout << fixed << setprecision(15); ios_base::sync_with_stdio(0); cin.tie(0); }
// clang-format on
ll gcdf(ll a, ll b) {
if (b == 0) {
return a;
}
return gcdf(b, a % b);
}
vector<ll> mkprimes(ll N) {
vector<bool> isprime(N + 1);
vector<ll> primes;
for (ll i = 0; i <= N; i++) {
isprime[i] = true;
}
isprime[0] = false;
isprime[1] = false;
for (ll i = 2; i <= N; i++) {
if (isprime[i]) {
primes.push_back(i);
for (ll j = 2 * i; j <= N; j += i) { // 素数iの倍数は素数ではない
isprime[j] = false;
}
}
}
return primes;
}
void update(ll org, vector<ll> &primes, ll ngp, set<ll> &result) {
if (org > 10000) return;
ll c = primes.size();
result.insert(org);
for (ll j = 0; j < c; j++) {
if (j != ngp) {
update(org * primes[j], primes, ngp, result);
}
}
}
int main() {
vector<ll> primes = mkprimes(10000);
ll c = primes.size();
set<ll> r0;
update(6, primes, 2, r0);
update(10, primes, 1, r0);
update(15, primes, 0, r0);
update(30, primes, INF, r0);
vector<ll> r3 = {6, 10, 15};
for (auto p : r0) {
if (p != 6 && p != 10 && p != 15) {
r3.push_back(p);
}
}
ll n;
cin >> n;
{
//print(r3.size());
if (r3.size() < n) return 0;
vector<ll> r4;
for (ll i = 0; i < n; i++) {
r4.push_back(r3[i]);
}
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j < n; j++) {
assert(gcdf(r4[i], r4[j]) > 1);
assert(r4[i] != r4[j]);
}
}
ll g = r4[0];
for (ll i = 0; i < n; i++) {
g = gcdf(g, r4[i]);
}
assert(g == 1);
}
for (ll i = 0; i < n; i++) {
if (i > 0) print0(" ");
print0(r3[i]);
}
print();
}
|
#include<cstdio>
using namespace std;
int num[8]={6,10,12,15,18,20,24,30};
int n;
int main()
{
scanf("%d",&n);
printf("6 10 15 ");
for(int i=1;i+3<=n;i++)
{
int lun=(i-1)/8+1;
printf("%d ",lun*30+num[(i-1)%8]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ans = {6, 10, 15};
int x = 16;
while (ans.size() < n) {
if (x % 6 == 0 || x % 10 == 0 || x % 15 == 0) {
ans.push_back(x);
}
x++;
}
for (int i = 0; i < n; i++) {
cout << ans[i];
if (i == n - 1)
cout << endl;
else
cout << " ";
}
return 0;
} |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
inline int inint(istream& in) {int x; in >> x; return x;}
inline ll inll(istream& in) {ll x; in >> x; return x;}
inline string instr(istream& in) {string x; in >> x; return x;}
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)
class DAabAbaBaa {
public:
void solve(std::istream& in, std::ostream& out) {
int A,B;
ll K;
A = inint(in);
B = inint(in);
K = inll(in);
string ans = "";
ll comb[62][62] = {0};
comb[1][1] = 1;
for (int i = 0; i < 61; ++i) {
for (int j = 0; j < i + 1; ++j) {
comb[i + 1][j] += comb[i][j];
comb[i + 1][j + 1] += comb[i][j];
}
}
while(A + B > 0){
ll now = comb[A + B][A];
if(K > now){
K -= now;
B--;
out << "b";
}else{
out << "a";
A--;
}
}
vector<int> re;
out << endl;
}
};
int main() {
DAabAbaBaa solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long A, B, K;
vector<int> ans(100, 0);
long long COM(long long n, long long k) {
long long ans = 1;
for (long long i = 1; i <= k; i++) {
ans = ans * (n - i + 1) / i;
}
return ans;
}
void saiki(long long countA, long long now, long long rank) {
if (now == A + B) {
return;
}
else if (countA != A) {
if ((K - rank) <= COM(A + B - now - 1, A - countA - 1)) {
ans[now] = 1;
saiki(countA + 1, now + 1, rank);
}
else {
ans[now] = 2;
saiki(countA, now + 1, rank + COM(A + B - now - 1, A - countA - 1));
}
}
else {
ans[now] = 2;
saiki(countA, now + 1, rank + COM(A + B - now - 1, A - countA - 1));
}
}
int main() {
cin >> A >> B >> K;
string S;
saiki(0, 0, 0);
for (int i = 0; i < A + B; i++) {
if (ans[i] == 1) S = S + 'a';
else S = S + 'b';
}
cout << S << endl;
} |
/* Clearink */
#include <map>
#include <cstdio>
inline int rint () {
int x = 0, f = 1; char s = getchar ();
for ( ; s < '0' || '9' < s; s = getchar () ) f = s == '-' ? -f : f;
for ( ; '0' <= s && s <= '9'; s = getchar () ) x = x * 10 + ( s ^ '0' );
return x * f;
}
template<typename Tp>
inline void wint ( Tp x ) {
if ( x < 0 ) putchar ( '-' ), x = ~ x + 1;
if ( 9 < x ) wint ( x / 10 );
putchar ( x % 10 ^ '0' );
}
std::map<int, int> buc;
int main () {
for ( int T = rint (); T --; ) {
buc.clear ();
int n = rint ();
for ( int i = 1; i <= n; ++ i ) ++ buc[rint ()];
if ( n & 1 ) puts ( "Second" );
else {
bool ok = false;
for ( auto ele: buc ) {
if ( ele.second & 1 ) {
puts ( "First" ), ok = true;
break;
}
}
if ( !ok ) puts ( "Second" );
}
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e10;
int main() {
ll n;
cin >> n;
vvl v(n, vl(5));
rep(i, n) {
rep(j, 5) {
cin >> v[i][j];
}
}
// 判定問題「チームの総合力をx以上にできるか？」を二分探索で解く
ll left = 0;
ll right = INF; /*・INFの値が大きすぎてオーバーフローしていないか？
・INFの値が制約に対して小さすぎないか？ */
while(right - left > 1) {
ll x = (left + right) / 2;
set<ll> st;
rep(i, n) {
ll y = 0;
rep(j, 5) {
if(v[i][j] >= x) {
y |= 1<<j;
}
}
st.insert(y);
}
vl w;
for(ll y : st) {
w.pb(y);
}
bool ok = false;
ll m = w.size();
if(m == 1) {
if(w[0] == (1<<5) - 1) {
ok = true;
}
}
else if(m == 2) {
if((w[0] | w[1]) == (1<<5) - 1) {
ok = true;
}
}
else {
exrep(i, 0, m-3) {
exrep(j, i+1, m-2) {
exrep(k, j+1, m-1) {
if((w[i] | w[j] | w[k]) == (1<<5) - 1) {
ok = true;
}
}
}
}
}
if(ok) {
left = x;
}
else {
right = x;
}
}
out(left);
re0;
} |
#include<cstdio>
using namespace std;
long long C(int u,int d) {
long long ans=1;
for(long long i=d,num=1; num<=u; num++,i--)
ans=ans*i/num;
return ans;
}
long long a,b,k;
int main() {
scanf("%lld%lld%lld",&a,&b,&k);
for(; a+b;) {
if(a==0) {
b--;
printf("b");
continue;
}
if(b==0) {
a--;
printf("a");
continue;
}
if(k>C(a-1,a+b-1)) {
k-=C(a-1,a+b-1);
b--;
printf("b");
} else {
a--;
printf("a");
}
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long
#define P pair<int,ll>
#define MOD 1000000007
using namespace std;
int n, c1,c2, p, res;
vector<int> v1, v2;
string s, t;
int main(){
cin >> n >> s >> t;
rep(i, n)if(s[i]=='0'){v1.push_back(i);}
rep(i, n)if(t[i]=='0'){v2.push_back(i);}
if(v1.size() != v2.size()){
cout << -1 << endl;
return 0;
}
rep(i,v1.size()){
if(v1[i] != v2[i])res++;
}
cout << res << endl;
} |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long
#define max_value 0x3f3f3f
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
using namespace std;
typedef pair<ll,ll> pii;
const int inf=1e9+7;
const int mod=998244353;
const int maxn=1e3+1;
ll sqr(ll x){
return x*x;
}
ll modexpo(ll a,ll b){
a%=inf;
ll res=1;
while(b>0){
if(b&1)
res=res*a%inf;
a=a*a%inf;
b>>=1;
}
return res;
}
void solve(){
int n;
cin>>n;
string s;
cin>>s;
string t;
cin>>t;
vector<int>v,v1;
for(int i=0;i<n;i++){
if(s[i]=='0')
v.push_back(i);
if(t[i]=='0')
v1.push_back(i);
}
if((int)v.size()!=(int)v1.size())
cout<<"-1";
else{
int cnt=0;
for(int i=0;i<v1.size();i++){
if(v1[i]!=v[i]){
cnt++;
}
}
cout<<cnt;
}
}
int main(){
FIO;
/*file;*/
int t;
t=1;
while(t--){
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<ll,ll> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
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; }
void coY() {cout <<"Yes"<<endl;}
void coN(){cout <<"No"<<endl;}
void mswap(ll &a, ll &b){ if(a >= b) swap(a,b); }
void rswap(ll &a, ll &b){ if(a <= b) swap(a,b); }
const int dy[] = {0,0,1,-1};
const int dx[] = {1,-1,0,0};
const ll mod = 1e9+7;
const ll MOD = 998244353;
const double PI=3.14159265358979323846;
const int inf = 1001001001;
const ll INF = 1e18;
//Write From this Line
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(m), b(m);
rep(i,m) cin >> a[i] >> b[i];
int k;
cin >> k;
vector<int> c(k), d(k);
rep(i,k) cin >> c[i] >> d[i];
int ans = 0;
for(int bit = 0; bit < (1 << k); bit++){
bitset<16> tmp(bit);
int now = 0;
map<int, bool> mp;
rep(i,k){
// bit が立っていたらc[i]を使う
if(tmp.test(i)){
mp[c[i]] = true;
} else {
mp[d[i]] = true;
}
}
// 何個の条件を満たすことが出来ているか
rep(i,m){
if(mp[a[i]] && mp[b[i]]){
now++;
}
}
chmax(ans,now);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> x(N), y(N);
for(int i = 0; i < N; i++) cin >> x[i] >> y[i];
int cnt = 0;
for(int i = 0; i < N; i++){
for(int j = i + 1; j < N; j++){
int t = abs(y[j] - y[i]);
int s = abs(x[j] - x[i]);
if(-s <= t && t <= s) cnt++;
}
}
cout << cnt << endl;
} | #include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <memory.h>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <iostream>
#include <functional>
#include <complex>
#include <stdlib.h>
#include <fstream>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<pii, int> p3i;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<p3i> v3i;
typedef vector<vii> vvii;
typedef vector<p3i> vp3i;
typedef long double ld;
typedef vector<ld> vld;
#define pb push_back
#define mp make_pair
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define REPD(i, n) for (int (i) = (n) - 1; (i) >= 0; (i)--)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define FORD(i,a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define rv(v) reverse(all(v))
#define CL(v, val) memset((v), (val), sizeof((v)))
#define SORT(a) sort(all(a))
#define un(v) SORT(v), (v).resize(unique(all(v)) - (v).begin())
#define eps 1.0e-9
#define X first
#define Y second
#define bit(n) (1 << (n))
#define bit64(n) (ll(1) << (n))
#define sqr(x) ((x) * (x))
#define sq5(x) ((x) * (x) * (x) * (x) * (x))
#define N 1005
int x[N], y[N];
int main(void) {
int n;
scanf("%d", &n);
REP(i, n) {
scanf("%d%d", &x[i], &y[i]);
}
int cnt = 0;
REP(i, n) {
FOR(j, i + 1, n) {
pii a(x[i], y[i]), b(x[j], y[j]);
double res = 1.0 * (b.Y - a.Y) / (b.X - a.X);
if (fabs(res) - 1 < eps) {
cnt++;
}
}
}
printf("%d\n", cnt);
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, e) for (int i = 0; i < (e); ++i)
#define REP3(i, b, e) for (int i = (b); i < (e); ++i)
#define RREP(i, b, e) for (int i = (b)-1; i >= e; --i)
struct Initializer {
Initializer() {
std::cin.tie(0);
std::ios::sync_with_stdio(0);
std::cout << std::fixed << std::setprecision(15) << std::boolalpha;
}
} initializer;
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
for (auto &x : vec) {
os << x;
if (&x != &vec.back()) os << ' ';
}
return os;
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &pa) {
return os << pa.first << ' ' << pa.second;
}
template <std::size_t N, typename... T>
std::ostream &print_tuple(std::ostream &os, const std::tuple<T...> &tup) {
if constexpr (N != 1UL) {
print_tuple<N - 1, T...>(os, tup);
os << ", " << std::get<N - 1>(tup);
} else {
os << std::get<0>(tup);
}
return os;
}
template <typename... T>
std::ostream &operator<<(std::ostream &os, const std::tuple<T...> &tup) {
os << '(';
print_tuple<sizeof...(T), T...>(os, tup);
return os << ')';
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::set<T> &se) {
os << '{';
for (auto &x : se) {
os << x;
if (&x != &*se.rbegin()) os << ", ";
}
return os << '}';
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::map<T, U> &ma) {
os << '{';
for (auto &x : ma) {
os << x.first << ": " << x.second;
if (&x != &*ma.rbegin()) os << ", ";
}
return os << '}';
}
inline void print(void) {
std::cout << '\n';
}
template <class T, class... U>
inline void print(const T &x, const U &...y) {
std::cout << x;
if (sizeof...(U) != 0) {
std::cout << ' ';
}
print(y...);
}
int n;
map<int, int> ma;
vector<int> c;
vector<vector<int>> g;
vector<int> ans;
void rec(int par, int cur) {
if (ma[c[cur]] == 1) ans.emplace_back(cur);
for (auto nx : g[cur]) {
if (nx == par) continue;
++ma[c[nx]];
rec(cur, nx);
--ma[c[nx]];
}
}
int main() {
cin >> n;
c.resize(n);
REP(i, n) cin >> c[i];
g.resize(n);
REP(i, n - 1) {
int a, b;
cin >> a >> b;
--a;
--b;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
++ma[c[0]];
rec(-1, 0);
sort(ans.begin(), ans.end());
REP(i, ans.size()) { print(ans[i] + 1); }
return 0;
}
| #pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#define ll int64_t
#define ff first
#define ss second
#define mkp make_pair
#define pb push_back
#define pf push_front
#define inf 100000000
#define maxn 100005
#define mod 998244353
#define mod1 1000000009
using namespace std;
int col[maxn];
int colour[maxn];
vector<int>v[maxn];
vector<int>ans;
void dfs(int src,int par){
if(colour[col[src]]==0){
ans.push_back(src);
}
colour[col[src]]++;
for(auto it:v[src]){
if(it==par)
continue;
dfs(it,src);
}
colour[col[src]]--;
}
void solve(){
int n;
cin>>n;
for(int i=1;i<=n;++i)
cin>>col[i];
int a,b;
for(int i=0;i<n-1;++i){
cin>>a>>b;
v[a].pb(b);
v[b].pb(a);
}
dfs(1,-1);
sort(ans.begin(),ans.end());
for(int i=0;i<ans.size();++i)
cout<<ans[i]<<'\n';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n;
cin>>n;
vector<int>ans(n+1,1);
for(int i=1;i<=n;i++){
for(int j=i*2;j<=n;j+=i){
ans[j]=max(ans[j],ans[i]+1);
}
}
for(int i=1;i<=n;i++)cout<<ans[i]<<' ';puts("");
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
LL solve(long long N) {
LL N2 = N * 2, ans = 0;
for (LL i = 1; i * i <= N2; ++i) {
LL sum = (i * (i - 1)) / 2;
ans += (abs(N - sum) % i) == 0;
}
return ans * 2;
}
int main() {
long long N;
std::cin >> N;
cout << solve(N) << endl;
return 0;
}
|
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
//#define fi first
//#define se second
#define debug(x) cout << #x << ": " << x << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
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; }
template<class T> void Print(vector<T> v) {
F0R(i, v.size()) {
cout << v[i] << ' ';
}
cout << newl;
}
#if 1
// INSERT ABOVE HERE
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, K, M;
cin >> N >> K >> M;
int sum = 0;
F0R(i, N - 1) {
int a; cin >> a;
sum += a;
}
int d = max(N * M - sum, 0);
cout << (d > K ? -1 : d);
}
#endif
| #include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define ini(x, y) memset(x, y, sizeof(x));
#define pb push_back
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = (int)1e9 + 7;
const int MAX = (int)2e9;
const double PI = acos(-1);
ll exEuclid(ll a, ll b, ll& s, ll& t) {
if (b == 0) {
s = 1; t = 0;
return a;
}
ll gcd = exEuclid(b, a % b, s, t);
ll tmp = t;
t = s - (a / b) * t;
s = tmp;
if (s <= 0) { //s를 양수로
s += b;
t -= a;
}
return gcd;
}
int main(void) {
ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
// freopen("input.txt", "r", stdin);
int T; cin >> T;
while (T--) {
ll N, S, K; cin >> N >> S >> K;
ll a, x;
ll g = exEuclid(N, K, a, x);
if (S % g != 0) cout << -1 << '\n';
else {
a *= S / g;
x *= S / g;
ll k = (x + 1) / (N / g);
x -= k * (N / g);
a += k * (K / g);
cout << -x << '\n';
}
}
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt1, cnt2, m;
cin >> n >> m;
cnt1 = cnt2 = 0;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
int cnt = 0;
for (auto p : s) p == '1' ? cnt++ : 0;
cnt & 1 ? cnt1++ : cnt2++;
}
cout << 1ll * cnt1 * cnt2 << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vv = vector<vi>;
const ll INF = 1001001001001001001;
int main(){
int n, m;
cin >> n >> m;
vi a(2, 0);
rep(i,n){
string s;
cin >> s;
int num = 0;
rep(j,m)num += s[j]-'0';
a[num%2]++;
}
cout << a[0]*a[1] << endl;
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
vector<int> sum(1001,0);
for(int i=1; i<=1000; i++){
sum[i] = sum[i-1] + i;
}
if(A==B){
for(int i=1; i<=A; i++) cout << i << " " << -i << " ";
}
else if(A>B){
for(int i=1; i<=A; i++) cout << i << " ";
//sum[A]
int near = 2147483641;
int left, right;
for(int i=0; i<=1000-B; i++){
int j = i + B;
int diff = sum[A] - (sum[j]-sum[i]);
if(diff>0){
near = min(near, diff);
if(near == diff){
left = i;
right = j;
}
}
}
for(int i=left+1; i<right; i++) cout << -i << " ";
cout << -right - (sum[A] - sum[right] + sum[left]);
}
else{
for(int i=1; i<=B; i++) cout << -i << " ";
//sum[B]
int near = 2147483641;
int left, right;
for(int i=0; i<=1000-A; i++){
int j = i + A;
int diff = sum[B] - (sum[j]-sum[i]);
if(diff>0){
near = min(near, diff);
if(near == diff){
left = i;
right = j;
}
}
}
for(int i=left+1; i<right; i++) cout << i << " ";
cout << right + (sum[B] - sum[right] + sum[left]);
}
cout << endl;
} | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, s, n) for (int i = s; i <= (int)(n); i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define vec vector
#define rip return 0
typedef long long ll;
typedef pair<ll,ll> P;
ll max(ll x,ll y){
if(x>y)return x;
else return y;
}
ll min(ll x,ll y){
if(x<y)return x;
else return y;
}
int main(){
int a,b;
cin>>a>>b;
if(a%2==0){
rep(i,a){
if(i<(a/2))cout<<10000*b+a/2-i<<" ";
else cout<<10000*b+a/2-i-1<<" ";
}
}
else{
rep(i,a)cout<<10000*b+a/2-i<<" ";
}
if(b%2==0){
rep(i,b){
if(i<(b/2))cout<<-10000*a+b/2-i<<" ";
else cout<<-10000*a+b/2-i-1<<" ";
}
}
else{
rep(i,b)cout<<-10000*a+b/2-i<<" ";
}
cout<<endl;
} |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
inline int read() {
int x=0,f=1;char c=getchar();
while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
while(c>=48&&c<=57)x=(x<<1)+(x<<3)+(c^48),c=getchar();
return x*f;
}
using namespace std;
const int M=1005;
struct node {
int to,c;
};
vector <node> E[M];
bool vis[M][M];
struct PR {
int l,r,dis;
bool operator <(const PR &a)const {return dis>a.dis;}
};
priority_queue <PR> Q;
int main() {
int n=read(),m=read();
char s[5];
rep(i,1,m){
int u=read(),v=read();scanf("%s",s+1);
E[u].push_back((node){v,s[1]});
E[v].push_back((node){u,s[1]});
Q.push((PR){u,v,1});
Q.push((PR){v,u,1});
}
rep(i,1,n)Q.push((PR){i,i,0});
while(!Q.empty()){
PR top=Q.top();Q.pop();
if(top.l==1&&top.r==n){
printf("%d\n",top.dis);
return 0;
}
if(vis[top.l][top.r])continue;
vis[top.l][top.r]=1;
rep(i,0,E[top.l].size()-1){
int to=E[top.l][i].to,c=E[top.l][i].c;
rep(j,0,E[top.r].size()-1){
int t=E[top.r][j].to,cc=E[top.r][j].c;
if(c!=cc)continue;
Q.push((PR){to,t,top.dis+2});
}
}
}
puts("-1");
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<string,int> psi;
typedef pair<int,string> pis;
typedef array<int,2> aii;
typedef array<int,3> aiii;
typedef array<int,4> aiiii;
typedef unsigned long long ull;
typedef long long int ll;
typedef array<ll,2> all;
typedef array<ll,3> alll;
typedef array<ll,4> allll;
#define pb push_back
#define ff first
#define ss second
#define MAX 1000005
#define MOD 1000000007
#define INF 1e9+100
vector<int>adj[MAX];
int xMove[] = { 0,1,0,-1,1,1,-1,-1, 2, 2, -2, -2, 1, 1, -1, -1 };
int yMove[] = { 1,0,-1,0,1,-1,1,-1, 1, -1, 1, -1, 2, -2, 2, -2 };
void add_edge(int a, int b, int c, int d, int n)
{
int u=(a-1)*n+b,v=(c-1)*n+d;
adj[u].pb(v);
adj[v].pb(u);
}
int dist[MAX];
void bfs(int s)
{
memset(dist,-1,sizeof dist);
queue<int> q;
q.push(s);
dist[s]=0;
while(!q.empty())
{
int u=q.front();
q.pop();
for(int v: adj[u])
{
if(dist[v]==-1)
{
dist[v]=dist[u]+1;
q.push(v);
}
}
}
}
int main()
{
//freopen("input.in","r",stdin);
//freopen("output.txt","w",stdout);
cin.tie(0),cout.tie(0);
ios_base::sync_with_stdio(0);
cout.setf(ios::fixed);
cout.precision(10);
int TC=1;
int n,m,k,q;
//cin>>TC;
for(int t1=1; t1<=TC; t1++)
{
cin>>n>>m;
vector<aiii> edges(m);
int mp[n*n+1];
memset(mp,-1,sizeof mp);
for(auto &[u,v,c]: edges)
{
char c1;
cin>>u>>v>>c1;
c=c1;
mp[(u-1)*n+v]=1;
mp[(v-1)*n+u]=1;
}
for(auto [a,b,c1]: edges)
{
for(auto [c,d,c2]: edges)
{
if(c2==c1)
{
add_edge(a,c,b,d,n);
add_edge(c,a,d,b,n);
add_edge(a,d,b,c,n);
add_edge(d,a,c,b,n);
}
}
}
bfs(n);
int mn=INF;
for(int i=1;i<=n*n;i++)
{
if(dist[i]!=-1)
{
int r=i%n;
int d=(i-r)/n;
if(d+1==r)
mn=min(mn,2*dist[i]);
else if(mp[i]==1)
mn=min(mn,2*dist[i]+1);
}
}
cout<<(mn==INF?-1:mn)<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
const ll MOD = 1e9+7;
bool sprawdz(vector<vector<int>> & grid, int n, int k, int value){
vector<vector<int>> edit(n+1, vector<int>(n+1));
vector<vector<int>> sums(n+1, vector<int>(n+1, 0));
for(int i = 1; i<=n; i++){
for(int j = 1; j<=n; j++){
if(grid[i][j] <= value){
edit[i][j] = 1;
}
else{
edit[i][j] = 0;
}
sums[i][j] = sums[i-1][j] + sums[i][j-1] - sums[i-1][j-1] + edit[i][j];
}
}
for(int i = k; i<=n; i++){
for(int j = k; j<=n; j++){
if(sums[i][j] - sums[i-k][j] - sums[i][j-k] + sums[i-k][j-k] >= (k*k+1)/2 ){
return true;
}
}
}
return false;
}
void solve()
{
int n, k;
cin >> n >> k;
vector<vector<int>> grid(n+1, vector<int>(n+1));
int MIN = INT_MAX;
int MAX = 0;
for(int i = 1; i<=n; i++){
for(int j = 1; j<=n; j++){
cin >> grid[i][j];
MIN = min(MIN, grid[i][j]);
MAX = max(MAX, grid[i][j]);
}
}
int start = MIN, end = MAX;
while(start < end){
int mid = (start+end)/2;
if(sprawdz(grid, n, k, mid)){
end = mid;
}
else{
start = mid+1;
}
}
cout << start << endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
bool testcases = false;
if (testcases)
{
int t;
cin >> t;
while (t--)
{
solve();
}
}
else
{
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define deb(x) cout << #x << " " << x << endl;
#define debtwo(x,y) cout << x << ", " << y << endl;
#define mod 1000000007
#define N 1000001
void solve() {
ll n, m;
cin >> n >> m;
vector<ll> arr(n), brr(m);
for (ll &x : arr) cin >> x;
for (ll &x : brr) cin >> x;
ll dp[n + 1][m + 1];
memset(dp, 0, sizeof dp);
for (int j = 1; j <= m; j++) dp[0][j] = j;
for (int i = 1; i <= n; i++) {
dp[i][0] = i;
for (int j = 1; j <= m; j++) {
if (arr[i - 1] == brr[j - 1]) {
dp[i][j] = min({1 + dp[i][j - 1], 1 + dp[i - 1][j], dp[i - 1][j - 1]});
}
else {
dp[i][j] = min({1 + dp[i][j - 1], 1 + dp[i - 1][j], 1 + dp[i - 1][j - 1]});
}
}
}
// cout << "x ";
// for (int i = 1; i <= m; i++) cout << brr[i - 1] << " "; cout << endl;
// for (int i = 0; i <= n; i++) {
// if (i != 0) cout << arr[i - 1] << " ";
// else cout << " ";
// for (int j = 0; j <= m; j++) {
// cout << dp[i][j] << " ";
// }
// cout << endl;
// }
cout << dp[n][m];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1;
//cin >> t;
while (t--) {
solve();
}
} |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#define pb push_back
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(),(a).end()
#define mp make_pair
using namespace std;
typedef long long int64;
typedef vector<int> vi;
typedef pair<int,int> ii;
//https://codeforces.com/problemset/page/7?order=BY_RATING_ASC//
class A
{
public:
void solveOne(istream &in,ostream &out)
{
int a,b,c,d;
in>>a>>b;
in>>c>>d;
out<<a*d-b*c<<"\n";
}
void solve(std::istream &in,std::ostream &out)
{
int tc=1;
//in>>tc;
for(int i=0;i<tc;++i)
{
solveOne(in,out);
}
}
};
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
A a;
std::istream& in(std::cin);
std::ostream& out(std::cout);
a.solve(in,out);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, C;
cin >> A >> B >> C;
C = C % 2;
if(C==0){C+=2;}
if(C==2){
A*=A;
B*=B;
}
if (A > B)
cout << '>' << endl;
else if (A < B)
cout << '<' << endl;
else
cout << '=' << endl;
} |
#include<bits/stdc++.h>
#include<tuple>
typedef long long ll;
#define INF 99999999999999
#define mod 1000000007
#define eps 1e-9
using namespace std;
ll n,h,l=1,r=1000000000;
ll val[10][3005];
ll ans,res;
set<ll>bsk;
map<ll,ll>cnt;
bool check(ll x){
bsk.clear();
ll can=0;
//cout<<"x="<<x<<endl;
for(ll i=1;i<=n;i++){
ll res=0;
for(ll j=0;j<=4;j++)
if(val[j][i]>=x)
res+=1<<j;
//cout<<res<<endl;
bsk.insert(res);
}
for(auto i:bsk)
for(auto j:bsk)
for(auto k:bsk){
if((i|j|k)==31)
can=1;
}
return can;
}
int main(){
ios::sync_with_stdio(0);
auto st=clock();
cin>>n;
srand(time(NULL));
for(ll i=1;i<=n;++i)
for(ll j=0;j<=4;++j)
cin>>val[j][i];
while(l<=r){
ll mid=(l+r)>>1;
if(check(mid))
ans=mid,l=mid+1;
else
r=mid-1;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define li long int
#define lli long long
#define pb push_back
#define fi first
#define se second
#define si size()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define lb lower_bound
#define ub upper_bound
#define BS binary_search
#define pll pair < lli, lli >
#define pii pair < int, int>
#define vi vector < int >
#define vvi vector < vector < int > >
#define vlli vector < lli >
#define all(x) x.begin(), x.end()
using namespace std;
int main()
{
fastio;
int mid,ans=1,n,i,l,r,j,f=0,k;
cin>>n;
vvi v(n, vi(5)), arr(n, vi(5));
for(i=0;i<n;i++) cin>>v[i][0]>>v[i][1]>>v[i][2]>>v[i][3]>>v[i][4];
l=1, r=1e9;
while(l<=r)
{
arr=v;
mid=(l+r)/2;
f=0;
set<int> s;
for(i=0;i<n;i++)
{
for(j=0;j<5;j++)
{
if(arr[i][j]<mid) arr[i][j]=0;
else arr[i][j]=1;
}
int zz=arr[i][0]*16+arr[i][1]*8+arr[i][2]*4+arr[i][3]*2+arr[i][4];
if(zz==31) {f=1;}
s.insert(zz);
}
if(f)
{
l=mid+1;
ans=max(ans, mid);
continue;
}
vi pos;
for(auto ii:s) pos.pb(ii);
int sz=s.size();
if(sz==1)
{
r=mid-1; continue;
}
if(sz==2)
{
if((pos[0]|pos[1])==31)
{
l=mid+1;ans=max(ans, mid);
}
else r=mid-1;
continue;
}
for(i=0;i<sz-2;i++)
{
for(j=i+1;j<sz-1;j++)
{
for(k=j+1;k<sz;k++)
{
if((pos[i]|pos[j]|pos[k])==31){f=1; break;}
}
}
}
if(f) { l=mid+1;ans=max(ans, mid);}
else r=mid-1;
}
cout<<ans<<"\n";
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)
template<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);cerr<<fixed<<setprecision(15);}}init_;
#ifdef DEBUG
template <class T> void verr(const set<T> &st) { repa(a, st) cerr << a << " "; cerr << endl; }
template <class S, class T> void verr(const map<S, T> &mp) { repa(a, mp) cerr << "{" << a.first << ", " << a.second << "} "; cerr << endl; }
template <class S, class T, class N> void verr(const vector<pair<S,T>>& a, const N& n) { rep(i, n) cerr << "{" << a[i].first << ", " << a[i].second << "} "; cerr << endl; }
template <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << endl; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << endl; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif
const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
int main() {
ll N;
cin >> N;
if(N == 3){
cout << "6 10 15" << endl;
return 0;
}
vl cand;
repe(i, 1, 10001){
int d2 = i % 2 == 0, d3 = i % 3 == 0, d5 = i % 5 == 0;
if (d2 + d3 + d5 >= 2) cand.eb(i);
}
// vl ans(N);
rep(i, N) cout << cand[i] << " ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef complex<double> point;
#define endl '\n'
#define F first
#define S second
#define dbg(x) cerr<<#x<<" = "<<x<<endl
#define dbg2(x,y) cerr<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<endl
#define dbg3(x,y,z) cerr<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<endl
#define dbg4(x,y,z,q) cerr<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<", "<<#q<<" = "<<q<<endl
#define FOR(sz) for(int i = 0; i < sz; ++i)
#define dbg_array(x,sz) FOR(sz) cerr << x[i] << " \n"[i==sz-1]
#define X real()
#define Y imag()
const int d4i[4] = { -1, 0, 1, 0 }, d4j[4] = { 0, 1, 0, -1 };
const int d8i[8] = { -1, -1, 0, 1, 1, 1, 0, -1 }, d8j[8] = { 0, 1, 1, 1, 0, -1, -1, -1 };
void _init_() {
ios_base::sync_with_stdio(0), cin.tie(0);
#ifdef ECLIPSE
freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);
#endif
}
const int N = 2e4 + 9, M = 1e8 + 9, SEG = 131072; // SEG = 1 << ((int) ceil(log2(N)) + 1)
const int Mod_M = 1e9 + 7;
int n;
vector<int> ans;
int vis[N], vid = 1;
void generate(int num, int a, int b) {
if (int(ans.size()) == n) return;
if (num > 10000) return;
if (vis[num] != vid) ans.push_back(num);
vis[num] = vid;
generate(num * a, a, b);
generate(num * b, a, b);
}
vector<int> sieve(int n) {
vector<bool> is_prime(n + 1, true);
vector<int> prime;
for (int i = 2; i <= n; ++i) {
if (!is_prime[i]) continue;
else {
prime.push_back(i);
for (int j = 2; i * j <= n; ++j) {
is_prime[i * j] = 0;
}
}
}
return prime;
}
ll GCD(ll a, ll b) { // a>b
if (b == 0) return a;
return GCD(b, a % b);
}
bool checker() {
for (int i = 0; i < int(ans.size()); ++i) {
for (int j = i + 1; j < int(ans.size()); ++j) {
ll gcd;
if (ans[i] > ans[j]) gcd = GCD(ans[i], ans[j]);
else if (ans[i] < ans[j]) gcd = GCD(ans[j], ans[i]);
else {
dbg2(ans[i], ans[j]);
return false;
}
if (gcd == 1) {
return false;
}
}
}
ll gcd = ans[0];
for (int i = 1; i < int(ans.size()); ++i) {
gcd = GCD(gcd, ans[i]);
}
return gcd == 1;
}
void solve() {
// vector<int> prime = sieve(1000);
scanf("%d", &n);
ans.push_back(6);
ans.push_back(10);
ans.push_back(15);
// vis[6] = vid;
// vis[10] = vid;
// vis[15] = vid;
// generate(6, 2, 3);
// generate(10, 2, 5);
// generate(15, 5, 3);
// int num = 2 * 3, k = 3, num2 = num;
// while (num2 < 10000) {
// for (int i = k; i < int(prime.size()); ++i) {
// int tmp = num2 * prime[i];
// if (tmp > 10000 || int(ans.size()) == n) break;
// generate(tmp, 2, 3);
// generate(tmp, 2, prime[i]);
// generate(tmp, 3, prime[i]);
// generate(tmp, 2, prime[k - 1]);
// generate(tmp, 3, prime[k - 1]);
// }
// num2 = num * prime[k];
// ++k;
// }
for (int i = 16; i < 10001; ++i) {
if (GCD(i, 6) > 1 && GCD(i, 10) > 1 && GCD(i, 15) > 1) ans.push_back(i);
}
dbg(ans.size());
dbg(checker());
for (int i = 0; i < n; ++i)
printf("%d%c", ans[i], " \n"[i == int(ans.size()) - 1]);
}
int main() {
_init_();
// int t;
// scanf("%d", &t);
// while (t--) {
solve();
// }
return 0;
}
|
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using pl = pair<ll, ll>;
constexpr int MX = 5005, MOD = 998244353;
pl DP[MX][2];
int main() {
if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
cin.tie(0)->sync_with_stdio(0);
int N, M; cin >> N >> M;
ll ans = 0;
for (int i = 1; i <= M; ++i) {
DP[0][0] = pl(0, M-1), DP[0][1] = pl(1, 1);
for (int j = 0; j < N-1; ++j) {
DP[j+1][0] = pl((M-1)*DP[j][0].f+(i-1)*DP[j][1].f, (M-1)*DP[j][0].s+(i-1)*DP[j][1].s);
DP[j+1][1] = pl(DP[j][0].f+DP[j][0].s+(M-i+1)*DP[j][1].f, DP[j][0].s+(M-i+1)*DP[j][1].s);
DP[j+1][0].f %= MOD, DP[j+1][0].s %= MOD;
DP[j+1][1].f %= MOD, DP[j+1][1].s %= MOD;
}
(ans += DP[N-1][0].f+DP[N-1][1].f) %= MOD;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll z = 0;
int main(){
ll H, W;
cin >> H >> W;
vector<vector<char>> S(H + 1, vector<char>(W + 1));
for (ll i = 1; i <= H; i++){
for (ll j = 1; j <= W; j++){
cin >> S[i][j];
}
}
vector<vector<ll>> Wtate(H + 1, vector<ll>(W + 1)), Wyoko(H + 1, vector<ll>(W + 1)), Wnaname(H + 1, vector<ll>(W + 1));
for (ll i = 1; i <= H; i++){
ll now = 0;
for (ll j = 1; j <= W; j++){
if (S[i][j] == '#'){
now = j;
}
Wtate[i][j] = now;
}
}
for (ll j = 1; j <= W; j++){
ll now = 0;
for (ll i = 1; i <= H; i++){
if (S[i][j] == '#'){
now = i;
}
Wyoko[i][j] = now;
}
}
for (ll i = H; i > 0; i--){
ll now = 0;
for (ll j = 1; j <= W; j++){
if (i + j > H || j > W){
break;
}
if (S[i + j][j] == '#'){
now = j;
}
Wtate[i + j][j] = now;
}
}
for (ll j = 2; j <= W; j++){
ll now = 0;
for (ll i = 1; i <= H; i++){
if (i + j > W || i > H){
break;
}
if (S[i][i + j] == '#'){
now = i;
}
Wtate[i][i + j] = now;
}
}
vector<vector<ll>> ruitate(H + 1, vector<ll>(W + 1, 0)), ruiyoko(H + 1, vector<ll>(W + 1, 0)), ruinaname(H + 1, vector<ll>(W + 1, 0)), ans(H + 1, vector<ll>(W + 1, 0));
for (ll i = 1; i <= H; i++){
for (ll j = 1; j <= W; j++){
if (i == 1 && j == 1){
ruitate[i][j] = 1;
ruiyoko[i][j] = 1;
ruinaname[i][j] = 1;
ans[i][j] = 1;
continue;
}
if (S[i][j] == '.'){
ans[i][j] += ruitate[max(z, i - 1)][j];
ans[i][j] += ruiyoko[i][max(z, j - 1)];
ans[i][j] += ruinaname[max(z, i - 1)][max(z, j - 1)];
ans[i][j] %= 1000000007;
ruitate[i][j] = (ans[i][j] + ruitate[max(z, i - 1)][j]) % 1000000007;
ruiyoko[i][j] = (ans[i][j] + ruiyoko[i][max(z, j - 1)]) % 1000000007;
ruinaname[i][j] = (ans[i][j] + ruinaname[max(z, i - 1)][max(z, j - 1)]) % 1000000007;
}
}
}
cout << ans[H][W] << endl;
} |
#include<bits/stdc++.h>
using namespace std;
long long t,l,r;
int main() {
cin>>t;
while(t--) {
cin>>l>>r;
if(r-2*l+1>0) cout<<(r-2*l+1)*(r-2*l+2)/2<<endl;
else cout<<0<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << (a) << endl
#define prld(a) cout << setprecision(15)<< (a) << endl
#define allrange(a) a.begin(),a.end()
bool solve_translated(vector<pair<int,int>> &S,vector<pair<int,int>> &T){
int N = S.size();
int dx = S[0].first-T[0].first;
int dy = S[0].second-T[0].second;
bool flg = true;
reps(i,1,N){
if(!((S[i].first==T[i].first+dx) && (S[i].second==T[i].second+dy))){flg = false; break;}
}
return flg;
}
/*ピタゴラ三角形
5 12 13
8 15 17
3 4 5
*/
vector<pair<int,int>> Pitagora_rot(vector<pair<int,int>> &S,int a, int b , int c){
int N = S.size();
vector<pair<int,int>> PS(N);
auto pt0 = S[0];
PS[0] = pt0;
bool flg = true;
reps(i,1,N){
int dx = S[i].first - pt0.first;
int dy = S[i].second - pt0.second;
if(((dx*b+dy*a)%c)!=0 || ((dx*a-dy*b)%c)!=0) {flg = false; break;}
PS[i] = make_pair((dx*a-dy*b)/c+pt0.first, (dx*b+dy*a)/c+pt0.second);
}
if(flg) return PS;
else return vector<pair<int,int>>();
}
int main(){
std::cin.tie(0); // cinとcoutの同期を解除
std::ios::sync_with_stdio(false);
int N;cin >> N;
vector<pair<int,int>> S(N),T(N);
rep(i,N)
{
int x,y;
cin >> x >> y;
S[i].first = x;S[i].second = y;
}
rep(i,N)
{
int x,y;
cin >> x >> y;
T[i].first = x;
T[i].second = y;
}
sort(allrange(T));
/*ピタゴラ三角形
5 12 13
8 15 17
3 4 5
*/
vector<vector<int>> tri(12);
tri[0]={0,1,1};
tri[1]={-1,0,1};
tri[2]={0,-1,1};
tri[3]={1,0,1};
tri[4]={3,4,5};
tri[5]={4,3,5};
tri[6]={-3,4,5};
tri[7]={-4,3,5};
tri[8]={-3,-4,5};
tri[9]={-4,-3,5};
tri[10]={3,-4,5};
tri[11]={4,-3,5};
/*
vector<vector<int>> tri(0);
tri.push_back(vector<int>({0,1,1}));
tri.push_back(vector<int>({-1,0,1}));
tri.push_back(vector<int>({0,-1,1}));
tri.push_back(vector<int>({1,0,1}));
tri.push_back(vector<int>({3,4,5}));
tri.push_back(vector<int>({4,3,5}));
tri.push_back(vector<int>({-3,4,5}));
tri.push_back(vector<int>({-4,3,5}));
tri.push_back(vector<int>({-3,-4,5}));
tri.push_back(vector<int>({-4,-3,5}));
tri.push_back(vector<int>({3,-4,5}));
tri.push_back(vector<int>({4,-3,5}));
*/
// tri.push_back(vector<int>({-5, -12, 13}));
// tri.push_back(vector<int>({-12, -5, 13}));
// tri.push_back(vector<int>({-8,-15,17}));
// tri.push_back(vector<int>({-15,-8,17}));
// tri.push_back(vector<int>({5, 12, 13}));
// tri.push_back(vector<int>({12, 5, 13}));
// tri.push_back(vector<int>({8,15,17}));
// tri.push_back(vector<int>({15,8,17}));
// tri.push_back(vector<int>({-5, 12, 13}));
// tri.push_back(vector<int>({-12, 5, 13}));
// tri.push_back(vector<int>({-8,15,17}));
// tri.push_back(vector<int>({-15,8,17}));
// tri.push_back(vector<int>({5, -12, 13}));
// tri.push_back(vector<int>({12, -5, 13}));
// tri.push_back(vector<int>({8,-15,17}));
// tri.push_back(vector<int>({15,-8,17}));
bool flg;
if(S.size()==2 && T.size()==2){
auto sx = S[0].first-S[1].first;
auto sy = S[0].second-S[1].second;
auto tx = T[0].first-T[1].first;
auto ty = T[0].second-T[1].second;
flg= (sx*sx+sy*sy==tx*tx+ty*ty);
} else {
rep(j,tri.size()){
auto S2 = Pitagora_rot(S,tri[j][0],tri[j][1],tri[j][2]);
if(S2.empty()) continue;
sort(allrange(S2));
flg = solve_translated(S2,T);
if(flg) break;
}
}
if(flg) prl("Yes"); else prl("No");
}
|
#include<iostream>
using namespace std;
int N;
main()
{
cin>>N;
for(int i=0;i<N;i++)
{
cout<<i/2+1<<" "<<(i+N)/2+1<<endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
template<class T> ostream& operator << (ostream &s, vector<T> &P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
using P = pair<int,int>;
void slv(){
int n;cin>>n;
vector<vector<int>> divisor(n + 1,vector<int>{});
rep1(i,n){
for (int j = i; j <= n; j += i){divisor[j].push_back(i);}
}
vector<int> color(n);
vector<P> A;
rep1(i,n){int l = divisor[i].size();A.push_back(P{l,i});}
sort(A.begin(),A.end());
for (auto [dcnt,v] : A){
set<int> S;
for (auto div : divisor[v]) S.insert(color[div - 1]);
int m = *S.rbegin();
m++;
color[v - 1] = m;
}
cout << color << endl;
return;
}
signed main(){
int t;t = 1;
rep(i,t){slv();}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(vector<bool>::reference b) { return to_string(int(b)); }
string to_string(char b) { return "'" + string(1, b) + "'"; }
template <typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A>
string to_string(A v) {
string res = "{";
for (const auto& x : v) res += (res == "{" ? "" : ", ") + to_string(x);
return res + "}";
}
void debug() { cerr << endl; }
template <typename Head, typename... Tail>
void debug(Head H, Tail... T) {
cerr << " " << to_string(H);
debug(T...);
}
#define db(...) cerr << "[" << #__VA_ARGS__ << "]:", debug(__VA_ARGS__)
#else
#define db(...) 42
#endif
typedef long long ll;
typedef long double ld;
int main() {
int n, K;
scanf("%d%d", &n, &K);
vector<vector<int>> E(n);
for (int i = 1; i < n; ++i) {
int u, v;
scanf("%d%d", &u, &v);
--u;
--v;
E[u].push_back(v);
E[v].push_back(u);
}
vector<int> depth(n, -1), par(n, -1);
depth[0] = 0;
function<void(int)> dfs = [&](int x) {
for (int y : E[x]) {
if (depth[y] != -1) continue;
depth[y] = depth[x] + 1;
par[y] = x;
dfs(y);
}
};
dfs(0);
vector<int> vs(n);
iota(vs.begin(), vs.end(), 0);
sort(vs.begin(), vs.end(), [&](int x, int y) {
return depth[x] > depth[y];
});
auto check = [&](int d) {
vector<bool> used(n);
function<void(int, int, int)> flood = [&](int x, int cur, int p) {
used[x] = true;
if (!cur) return;
for (int y : E[x]) {
if (y == p) continue;
flood(y, cur - 1, x);
}
};
int need = 0;
for (int v : vs) {
if (used[v]) continue;
++need;
if (need > K) return false;
int x = v;
for (int i = 0; i < d; ++i) {
if (par[x] == -1) break;
x = par[x];
}
flood(x, d, -1);
assert(used[v]);
}
return true;
};
int lo = 1, hi = n - 1;
while (lo < hi) {
int d = (lo + hi) >> 1;
if (check(d)) hi = d;
else lo = d + 1;
}
printf("%d\n", lo);
}
| #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//uniform_int_distribution<int>(1000,10000)(rng)
ll binpow(ll a, ll b)
{
ll res = 1;
while (b > 0)
{
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ll gcd(ll a,ll b)
{
if (b==0) return a;
return gcd(b,a%b);
}
string to_upper(string a)
{
for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
return a;
}
string to_lower(string a)
{
for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
return a;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n,m,k,ans=0,cur;
cin>>n>>m;
int a[m][2],b[n+1];
for (int i=0;i<m;++i)
cin>>a[i][0]>>a[i][1];
cin>>k;
int c[k][2];
for (int i=0;i<k;++i)
cin>>c[i][0]>>c[i][1];
for (int i=0;i<(1<<k);++i)
{
for (int j=1;j<=n;++j)
b[j]=0;
for (int j=0;j<k;++j)
{
if (i&(1<<j))
++b[c[j][0]];
else
++b[c[j][1]];
}
cur=0;
for (int j=0;j<m;++j)
if (b[a[j][0]]&&b[a[j][1]])
++cur;
ans=max(ans,cur);
}
cout<<ans;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - min({ a, b, c }) << endl;
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LL unsigned long long
#define vec(x) vector<x>
#define emb(x) emplace_back(x)
#define fall(x) x.begin(),x.end()
#define rfall(x) x.rbegin(),x.rend()
#define fo(a,b) for(int i=a; i < int(b); i++)
#define fset(x) setprecision(x) << fixed
#define fast ios::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
/*
*---------------------------------------------
* --------------------------------------------
* --------------------------------------------
*
العمل الجاد يتفوق على الموهبة الكسولة
* 勤勉は怠惰な才能に勝る
*
* 努力打敗懶惰的人才
*
* कड़ी मेहनत आलसी प्रतिभा को हरा देती है
*
* тяжелая работа превосходит ленивый талант
*
* 勤勉は怠惰な才能に勝る
*
* 努力打敗懶惰的人才
*
* malfacila laboro superas maldiligentan talenton
*
* el trabajo duro supera al talento perezoso
*
* η σκληρή δουλειά κερδίζει τεμπέλης ταλέντο
*
* il duro lavoro batte il talento pigro
*
* munca grea bate talentul leneș
*
* kazi ngumu hupiga talanta ya uvivu
*
* piger ingenii labore verberat
*
* làm việc chăm chỉ đánh bại tài năng lười biếng
*
* trabalho duro vence talento preguiçoso
*
* працавітасць перамагае лянівы талент
*
* le travail acharné bat le talent paresseux
*
* --------------------------------------------------
* --------------------------------------------------
* --------------------------------------------------
*/
#define MOD 10
#define use 1000000000000000007
LL mpow(LL a, LL b){
LL res = 1;
while(b){
if(b&1)res=(res%4)*(a%4);
a=(a%4)*(a%4);
b>>=1;
}
return res+4;
}
void runcase(){
LL a, b,c;
cin>>a>>b>>c;
b=mpow(b,c);
LL res=1;
while(b){
if(b&1)res = (res%MOD)*(a%MOD);
a=(a%MOD)*(a%MOD);
b>>=1;
}
cout << (res%MOD);
cout << endl;
}
int main(){
fast
int tt;
tt=1;
while(tt--){
runcase();
}
return 0;
}
|
// #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) std::begin(x), std::end(x)
using namespace std;
void dump_func()
{
cerr << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&h, Tail &&... t)
{
cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...);
}
#define dump(...) \
cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), \
cerr << "*/\n\n";
typedef long long ll;
const int INF = 100000000;
double solve(double n)
{
double res = 0;
REP3R(i, 1, n + 1)
{
res += n / i;
}
return res - 1.0;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
double n;
cin >> n;
double res = solve(n);
printf("%.9f\n", res);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
const int M = 1000000007;
#define AKTG ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long
#define ff first
#define all(x) x.begin(),x.end()
#define ss second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pii pair<long long,long long>
#define fix fixed<<setprecision(19)
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define endl "\n"
vector<int> adj[N];
bool visited[N]={false};
void solve()
{
double n;
cin>>n;
double ans=0;
for(int i=1;i<n;i++)
{
double p=(n/(n-i));
ans+=p;
}
cout<<fix<<ans<<endl;
}
signed main()
{
int t=1;
// cin>>t;
while(t--)
{
solve();
}
// getch();
return 0;
} |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>
#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
#include <random>
using namespace std;
#define cauto const auto&
#define ALL(v) begin(v),end(v)
#else
#define ALL(v) (v).begin(),(v).end()
#endif
namespace{
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define VV(T) vector<vector< T > >
template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
v.assign(a, vector<T>(b, t));
}
template <class T> inline bool chmin(T &x, const T &y){ if(y < x){ x = y; return true; } return false; }
template <class T> inline bool chmax(T &x, const T &y){ if(x < y){ x = y; return true; } return false; }
template <class F, class T>
void convert(const F &f, T &t){
stringstream ss;
ss << f;
ss >> t;
}
template <class Con>
string concat(const Con &c, const string &spr){
stringstream ss;
typename Con::const_iterator it = c.begin(), en = c.end();
bool fst = true;
for(; it != en; ++it){
if(!fst){ ss << spr; }
fst = false;
ss << *it;
}
return ss.str();
}
template <class Con, class Fun>
vector<typename Con::value_type> cfilter(const Con &c, Fun f) {
vector<typename Con::value_type> ret;
typename Con::const_iterator it = c.begin(), en = c.end();
for(; it != en; ++it){
if(f(*it)){
ret.emplace_back(*it);
}
}
return ret;
}
#if __cplusplus >= 201103L
template <class Con, class Fun>
auto cmap(const Con &c, Fun f) -> vector<decltype(f(*c.begin()))> {
vector<decltype(f(*c.begin()))> ret;
ret.reserve(c.size());
for(const auto &x: c){
ret.emplace_back(f(x));
}
return ret;
}
#endif
#if __cplusplus >= 201402L
#define lambda(e) ([&](const auto &_){ return (e); })
#define lambda2(e) ([&](const auto &_a, const auto &_b){ return (e); })
#endif
#define REP(i,n) for(int i=0;i<int(n);++i)
#define RALL(v) (v).rbegin(),(v).rend()
#define tget(t,i) get<i>(t)
#define MOD 1000000007LL
#define EPS 1e-8
void mainmain(){
int n;
cin >> n;
vll ls(n), rs(n);
REP(i, n){
LL t, l, r;
cin >> t >> l >> r;
l *= 10;
r *= 10;
if(t == 2 || t == 4){ --r; }
if(t == 3 || t == 4){ ++l; }
ls[i] = l;
rs[i] = r;
}
int ans = 0;
REP(i, n)
REP(j, i){
if(!(rs[i] < ls[j] || rs[j] < ls[i])){
++ans;
}
}
cout << ans << "\n";
}
}
int main() {
ios::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(4);
mainmain();
}
| #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <iomanip>
using namespace std;
int main(){
long k;
cin >> k;
string s,t;
cin >> s >> t;
vector<long> viCount(10,k);
vector<long> viTak(10,0), viAok(10,0);
for(long i = 0; i < 4; i++){
int j1 = s[i] - '0';
int j2 = t[i] - '0';
viCount[j1]--;
viTak[j1]++;
viCount[j2]--;
viAok[j2]++;
}
double dAns = 0.0;
for(int i = 1; i <= 9; i++){
for(int j = 1; j <= 9; j++){
vector<long> viTakThis = viTak, viAokThis = viAok;
viTakThis[i]++;
viAokThis[j]++;
long nTak=0,nAok=0;
for(long k = 1; k <= 9; k++){
nTak += pow(10,viTakThis[k]) * k;
nAok += pow(10,viAokThis[k]) * k;
}
if(nTak > nAok){
double dThis = double(viCount[i]*viCount[j]);
dThis -= double(i==j ? viCount[i] : 0);
dThis /= double((9*k-8)*(9*k-9));
dAns += max(0.0, dThis);
}
}
}
cout << dAns << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};
const ll INF = (1ll<<62);
// const ld EPS = 1e-10;
// const ld PI = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;
int main(){
ll N;
string S, T;
cin >> N >> S >> T;
ll cntS=0, cntT=0;
REP(i, N) cntS += (S[i] == '1');
REP(i, N) cntT += (T[i] == '1');
if(cntS != cntT){
cout << -1 << endl;
return 0;
}
V<ll> posS, posT;
REP(i, N) if(S[i] == '0') posS.push_back(i);
REP(i, N) if(T[i] == '0') posT.push_back(i);
ll sz = posS.size();
ll res = 0;
REP(i, sz){
if(posS[i] != posT[i]) res++;
}
cout << res << endl;
return 0;
} | #include<iostream>
#include<string>
#include<queue>
using namespace std;
typedef long long ll;
const int N = 5e5+10;
string s,t;
int sums = 0,sumt = 0,cnt;
bool st[N],flag = false;
priority_queue<int,vector<int>,greater<int>> fla;
int main()
{
int n;
scanf("%d",&n);
cin>>s>>t;
for(int i = 0;i<n;i++)
{
sums+=s[i]-'0';
sumt+=t[i]-'0';
if((sums != sumt || s[i] != t[i]) && s[i] == '0')cnt++;
}
if(sums != sumt)printf("-1\n");
else printf("%d\n",cnt);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define mod 998244353
int main()
{
ll a,b,c;
cin>>a>>b>>c;
ll sum1 = ((a*(a+1))/2);
ll sum2= ((b*(b+1))/2);
ll sum3= ((c*(c+1))/2);
cout<<(((sum1%mod)*(sum2%mod))%mod*(sum3%mod))%mod;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, k, n) for(ll i = ll(k); i <= ll(n); i++)
#define rep3(i, n, k) for(ll i = ll(n); i >= ll(k); i--)
#define all(v) (v).begin(), (v).end()
ll mod(ll a, ll b) {if(b == 0) return 0; return (a % b + b) % b;}
bool chmin(ll &a, ll b) {if(b < a) {a = b; return 1;} return 0;}
bool chmax(ll &a, ll b) {if(b > a) {a = b; return 1;} return 0;}
const ll INF = 1LL << 60;
//const ll MOD = 1e9 + 7;
const ll MOD = 998244353;
const ll MAX = 2e5;
const ld eps = 1e-9;
const char newl = '\n';
ll Triangular_Number(ll n) {return ((n*(n+1))/2)%MOD;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, c;
cin >> a >> b >> c;
cout << ((Triangular_Number(a) * Triangular_Number(b) % MOD) * Triangular_Number(c)) % MOD << newl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = long long;
using Graph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int SINF = 1LL << 29;
const ll mod = 1000000000+7;
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> 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; }
int main() {
int n;
cin >> n;
vector<ll> x(n);
rep(i, n) cin >> x[i];
vector<ll> prime = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
vector<ll> a;
for(int bit = 1; bit<(1<<15); bit++) {
ll f = 1;
for(int i=0; i<15; i++) {
if(bit>>i&1) {
f *= prime[i];
}
}
a.push_back(f);
}
sort(all(a));
for(int i=0; i<a.size(); i++) {
bool flg = true;
for(int j=0; j<n; j++) {
if(gcd(a[i], x[j]) == 1) {
flg = false;
break;
}
}
if(flg) {
cout << a[i] << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// THINGS TO REMEMBER
// ENDL is slow, '\n' is fast
// Clear everything (including graphs) between test cases
// use anti-anti-hash: https://codeforces.com/blog/entry/62393
// pb-ds: https://codeforces.com/blog/entry/11080
// check when to use LLONG_MAX/LLONG_MIN vs INT_MAX or INT_MIN
// You frequently suffer from confirmation bias - you trust your initial solution and miss simple things.
// When you hit a roadblock, remember to rethink the solution ground up, not just try hacky fixes
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47
vector<ll> primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
ll ans=LLONG_MAX;
ll tot = 1<<(15);
for(int i=0;i<tot;i++){
ll currNum=1;
ll tt = i;
for(int j=0;j<15;j++){
if(tt&1){
currNum*=primes[j];
}
tt>>=1;
}
// cerr<<i<<endl;
// cerr<<currNum<<endl;
bool works=true;
for(int j=0;j<n;j++){
if(__gcd(currNum, (ll)arr[j])==1){
works=false;
break;
}
}
cerr<<i<<endl;
if(works){
ans=min(ans,currNum);
}
}
cout<<ans<<endl;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}
int main()
{
string s;
cin >> s;
deque<char> que;
int f = 1;
int n = s.size();
rep(i, n)
{
if (s[i] == 'R') f = !f;
else
{
if (f)
{
if (que.size() && que.back() == s[i]) que.pop_back();
else que.push_back(s[i]);
}
else
{
if (que.size() && que.front() == s[i]) que.pop_front();
else que.push_front(s[i]);
}
}
}
int m = que.size();
string ans = "";
rep(i, m) ans += que[i];
if (!f) reverse(all(ans));
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
using std::cout; using std::endl;
using std::string; using std::reverse;
// 自己テンプレート
typedef long long ll;
// 比較して上書きマクロ
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;} }
// dpリソース
const ll INF = 1LL << 60;
ll dp[100010];
int main() {
int N; cin >> N;
string str;
str = to_string(N);
string rev = str;
std::reverse(rev.begin(), rev.end());
if (str == rev) {
cout << "Yes" << endl;
return 0;
}
for (int i = 0; i < 9; i++) {
str.insert(0, "0");
rev.append("0");
if (str == rev) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} |
#include<stdio.h>
int main(){
int n;
scanf("%d", &n);
int a[n],b[n];
int temp;
int maxa=0;
int minb=1001;
for (int i = 0;i< n; i++){
scanf("%d",&a[i]);
}
for (int i = 0;i< n; i++){
scanf("%d",&b[i]);
}
for (int i = 0; i < n; i++){
if (a[i] > maxa) maxa=a[i];
if (b[i] < minb) minb=b[i];
}
temp = minb-maxa+1;
if (temp >= 0) printf("%d", temp);
if (temp < 0) printf("0");
} | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <climits>
constexpr int SINT_MAX = std::numeric_limits<int>::max();
constexpr int SINT_MIN = std::numeric_limits<int>::min();
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
template<class T>
T choose(bool b, T t, T f)
{
if (b) return t;
else return f;
}
const char *YesNo(bool b)
{
return choose(b, "Yes", "No");
}
const char *YESNO(bool b)
{
return choose(b, "YES", "NO");
}
template<class NumT>
NumT diffabs(NumT l, NumT r)
{
if (l < r) return r-l;
else return l-r;
}
struct myinout_t {} io;
template<class T>
myinout_t &operator >>(myinout_t &my, T &i)
{
cin >> i;
return my;
}
myinout_t &operator >>(myinout_t &my, int &i)
{
int r = scanf("%d", &i);
if (r != 1) exit(EXIT_FAILURE);
return my;
}
myinout_t &operator >>(myinout_t &my, ll &i)
{
int r = scanf("%lld", &i);
if (r != 1) exit(EXIT_FAILURE);
return my;
}
template<class T>
myinout_t &operator <<(myinout_t &my, const T &i)
{
cout << i;
return my;
}
myinout_t &operator <<(myinout_t &my, int i)
{
printf("%d", i);
return my;
}
myinout_t &operator <<(myinout_t &my, ll i)
{
printf("%lld", i);
return my;
}
myinout_t &operator <<(myinout_t &my, double i)
{
printf("%.20f", i);
return my;
}
constexpr char BR = '\n';
///////////////////////////////////////////////////
int div3(ll k)
{
int d = 0;
while(true)
{
if (k == 1) return d;
if (k % 3 != 0) return -1;
d++;
k /= 3;
}
}
int main()
{
ll N;
io >> N;
int a = -1, b = 1;
ll bb = 5;
while (bb < N)
{
if (int d = div3(N-bb); d >= 1)
{
a = d;
break;
}
b++;
bb *= 5;
}
if (a < 0)
{
io << "-1" << BR;
}
else
{
io << a << ' ' << b << BR;
}
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, S, D;
cin >> N >> S >> D;
int a=0;
for(int i=0; i<N; i++){
int X, Y;
cin >> X >> Y;
if(X<S && Y>D){
cout << "Yes" << endl;
a++;
break;
}
}
if(a==0){
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rrepi(i,a,b) for(int i=((int)(b)-1);i>=(a);--i)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) rrepi(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(x) memset(x,0,sizeof(x))
#define MINUS(x) memset(x,-1,sizeof(x))
#define UNIQUE(x) (x).erase(unique(ALL(x)), (x).end())
#define TOUPPER(x) transform(ALL(x), (x).begin(), ::toupper)
#define TOLOWER(x) transform(ALL(x), (x).begin(), ::tolower)
#define debug(var) do{std::cout << #var << " : "; view(var);}while(0)
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<int,int>;
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){for(const auto& v : vv){ view(v); } }
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void viewarr(T arr[], int n) { for(int i = 0; i < n; ++i) std::cout << arr[i] << " "; std::cout << std::endl; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll qp(ll a,ll b){ll ans=1;do{if(b&1)ans=1ll*ans*a;a=1ll*a*a;}while(b>>=1);return ans;}
ll qp(ll a,ll b,ll mo){ll ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const int INF = 1e9;
const ll INFL = 1e18;
const int MOD = 1e9 + 7;
const int MAX_N = 1e5;
int main() {
int N, S, D;
cin >> N >> S >> D;
vector<int> X(N), Y(N);
rep(i,N) cin >> X[i] >> Y[i];
bool f = false;
rep(i,N) if(X[i] < S && Y[i] > D) f = true;
cout << (f ? "Yes" : "No") << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
double R, X, Y; cin >> R >> X >> Y;
double d = sqrt(X * X + Y * Y);
int ans = ceil(d / R);
if (ans == 1 && d != R) ans++;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define fp(i,a,b) for(ll i=a ; i<b ; i++)
#define fn(i,a,b) for(int i=a ; i>=b ; i--)
#define ones(x) __builtin_popcount(x)
#define pb push_back
#define mk make_pair
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define dbg(x) cout << (#x) << " = " << x << " "
#define fini cout << "\n";
#define line cout << "-----------------------------------\n";
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef tree<
ll,
null_type,
less_equal<ll>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int read (){
int x = 0, f = 1; char s = getchar();while (s < '0' || s > '9') {if (s == '-') f = -1; s = getchar();}
while (s >= '0' && s <= '9') x = x * 10 + s - '0', s = getchar();
return x * f;
}
const ll M=2e5+7;
const ll N=1e6+7;
const ll inf=1e18;
const ll mod=1e9+7;
const ll mod2=998244353;
ll r,x,y;
void go(int ide){
cin >> r >> x >> y;
ld d = sqrt(x*x + y*y);
if ((int)d < r) cout << "2\n";
else cout << ceil(d/r) << "\n";
}
int main(){
fastio;
int tst=1;
// cin >> tst;
// cout << fixed << setprecision(12);
fp(i,0,tst) go(i+1);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int price;
string answer = "";
price = N * 1.08;
if(price < 206){
answer = "Yay!";
}
else if(price == 206){
answer = "so-so";
}
else{
answer = ":(";
}
cout << answer << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int count = 0;
int sub = 1;
while(1){
count += sub;
if (count >= N){
cout << sub<< endl;
break;
}
sub += 1;
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAXN = 1e6 + 3;
#define each(it,s) for(auto it = s.begin(); it != s.end(); ++it)
#define sortA(v) sort(v.begin(), v.end())
#define sortD(v) sort(v.begin(), v.end(), greater<auto>())
#define fill(a) memset(a, 0, sizeof (a))
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define repA(i, a, n) for(ll i = a; i <= (n); ++i)
#define repD(i, a, n) for(ll i = a; i >= (n); --i)
#define watch(x) cout << (#x) << " is " << (x) <<endl
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
ll power(ll x,ll y){ll res=1ll; while(y>0){if(y&(1ll)) res=res*x;y=y>>(1ll);x=x*x;}return res;} // modular exponent
int main()
{
ios_base::sync_with_stdio(false); // don't use printf and scanf
cin.tie(NULL); // cout<<fixed<<setprecision
int n;cin>>n;
vector<vector<int>> v(n,vector<int>(5,0));
for(int i=0;i<n;i++)
{
for(int j=0;j<5;j++) cin>>v[i][j];
}
// now we will do binary search by answer
int hi=1e9;int lo=1;
while(hi>lo)
{
int mid=(lo+hi+1)/2;
// we need the biggest possible
vector<int> b(n,0);
for(int i=0;i<n;i++)
{
for(int j=0;j<5;j++)
{
if(v[i][j]>=mid) b[i]|=(1<<j);
}
}
vector<vector<int>> dp(4,vector<int>((1<<5),0));
dp[0][0]=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<=2;j++)
{
for(int k=0;k<(1<<5);k++)
{
if(dp[j][k])
{
dp[j+1][k|b[i]]=1;
}
}
}
}
if(dp[3][(1<<5)-1]) lo=mid;
else hi=mid-1;
}
cout<<lo<<'\n';
return 0;
}
// JUST ASK YOURSELF DID YOU GIVE YOUR BEST ? ISSE ZYADA
// KUCH KAR BHI NAHI SAKTE !! ENJOY AND GIVE YOUR BEST!!
|
/*
* Created By: 'Present_Sir'
* Created On: 02.05.2021 10:06:31
*/
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sz(v) ((int)v.size())
#define int long long
//#define i_n_p_u_t(t) cin >> t
#define i_n_p_u_t(t) t = 1
void solve(){
int n;
cin >> n;
vector < vector < int > > v(n);
for(int i=0; i<n; ++i){
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
v[i] = {a, b, c, d, e};
}
auto check = [&](int mid){
vector < int > t;
map < int, int > mp;
for(int i=0; i<n; ++i){
int _s=0;
for(int j=0; j<5; ++j){
if(v[i][j] >= mid){
_s = ( (_s << 1) | 1 );
}else{
_s = _s << 1;
}
}
if(mp.count(_s) and mp[_s]==3)continue;
t.push_back(_s);
mp[_s] += 1;
}
for(int i=0; i<sz(t); ++i){
for(int j=i+1; j<sz(t); ++j){
for(int k=j+1; k<sz(t); ++k){
bool ok = true;
for(int p=0; p<5; ++p){
if( ( t[i]&(1ll<<p) ) == 0 and ( t[j]&(1ll<<p) ) == 0 and ( t[k]&(1ll<<p) ) == 0)ok=false;
}
if(ok) return true;
}
}
}
return false;
};
int l = 1, r = 1e9+5;
while(l<=r){
int mid = (l+r) >> 1;
if(check(mid)){
l = mid+1;
}else{
r = mid-1;
}
}
int ans = l-1;
cout << ans << "\n";
}
int32_t main(){
IOS;
int t;
i_n_p_u_t(t);
for(int i=1; i<=t; ++i){
// cout << "Case #" << i << ": ";
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
const int MOD = 1e9+ 7;
const int INF = numeric_limits<int>::max() - (int)1e8;
const ll INFLL = numeric_limits<ll>::max() - (ll)1e17;
int main() {
int N, M;
cin >> N >> M;
vector<int> G(N);
for (int i = 0; i < N; i++) {
G[i] = (1<<i);
}
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--; b--;
G[a] |= (1<<b);
G[b] |= (1<<a);
}
vector<bool> is_complete(1<<N);
for (int i = 0; i < (1<<N); i++) {
bool check = true;
for (int j = 0; j < N; j++) {
if (((i>>j)&1) == 0) {
continue;
}
if ((G[j]&i) != i) {
check = false;
}
}
is_complete[i] = check;
}
vector<int> dp(1<<N, INF);
dp[0] = 0;
for (int i = 0; i < (1<<N); i++) {
int other = (1<<N) - 1 - i;
for (int sub = other; ; sub = (sub - 1) & other) {
if (sub == 0) {
break;
}
if (is_complete[sub]) dp[i | sub] = min(dp[i | sub], dp[i] + 1);
}
}
cout << dp[(1<<N) - 1] << endl;
}
| #include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define me0(a) memset(a,0,sizeof(a))
#define me1(a) memset(a,-1,sizeof(a))
#define op freopen("in.txt", "r", stdin)
#define op1 freopen("C:\\acm\\Cproj\\in.txt","r",stdin);
#define pr freopen("C:\\acm\\Cproj\\out.txt","w",stdout)
#define pr2 freopen("C:\\acm\\Cproj\\std.txt","w",stdout)
#define pii pair<int,int>
#define Please return
#define AC 0
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long LL;
template <class T>
void read(T &val) { T x = 0; T bz = 1; char c; for (c = getchar(); (c<'0' || c>'9') && c != '-'; c = getchar()); if (c == '-') { bz = -1; c = getchar(); }for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48; val = x * bz; }
const int mod=998244353;
const int maxn = 1e6+10;
int n,m,a[maxn],q,t,k;
bool vis[maxn];
int pos[maxn];
int main(){
read(n);
fo(i,1,n) read(a[i]),pos[a[i]]=i;
vector<int>ans;
fod(i,n,1){
if(pos[i]!=i){
while(pos[i]!=i){
if(vis[pos[i]]) {
puts("-1");return 0;
}
vis[pos[i]] = 1;
ans.push_back(pos[i]);
int p = pos[i];
swap(a[p],a[p+1]);
pos[a[p]] = p;pos[a[p+1]] = p+1;
}
}
}
if(ans.size()!=n-1){
puts("-1");return 0;
}
for(auto to:ans) printf("%d\n",to);
Please AC;
} |
typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll a,b,c;
std::cin >> a>>b>>c;
vector<vector<vector<ld>>> memo(100,vector<vector<ld>>(100,vector<ld>(100,-1)));
function<ld(ll,ll,ll)> rec = [&] (ll a,ll b,ll c) {
if(a==100||b==100||c==100) return (ld)0;
if(memo[a][b][c]!=-1)return memo[a][b][c];
return memo[a][b][c] = 1+a/(a+b+c+0.0)*rec(a+1,b,c)+b/(a+b+c+0.0)*rec(a,b+1,c)+c/(a+b+c+0.0)*rec(a,b,c+1);
};
std::cout <<setprecision(20)<< rec(a,b,c) << std::endl;
}
| #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, s, k;
cin >> n >> s >> k;
int m = sqrt(n) + 1;
map<int, int> mp;
int jk = 0;
for (int j = 0; j < m; ++j) {
if (mp.count(jk)) break;
mp[jk] = j;
jk = (jk + k) % n;
}
long long mk = jk;
for (int i = 0; i < m; ++i) {
int now = ((-s - mk * i) % n + n) % n;
if (mp.count(now)) {
cout << m * i + mp[now] << '\n';
return;
}
}
cout << -1 << '\n';
}
int main() {
int t;
cin >> t;
while (t--) solve();
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0;i<ll(n);i++)
#define FOR(i, a, b) for(ll i=a;i<=ll(b);i++)
int read_int() {
int n;
scanf("%d", &n);
return n;
}
int main() {
string S;
bool flag = true;
cin >> S;
REP(i, S.length()) {
if (i%2 == 1){
if (islower(S[i])) flag = false;
}
else {
if (isupper(S[i])) flag = false;
}
}
if (flag) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
string s;
int main()
{
cin >> s;
for (int i = 0; i < s.size(); i++)
if (!((i % 2 == 0 && s[i] >= 'a' && s[i] <= 'z') || (i % 2 == 1 && s[i] >= 'A' && s[i] <= 'Z')))
{
cout << "No";
return 0;
}
cout << "Yes";
return 0;
} |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
#define pq(T) priority_queue<T,vector<T>,greater<T>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
struct ArbitraryModInt {
int x;
ArbitraryModInt() : x(0) {}
ArbitraryModInt(int64_t y) : x(y >= 0 ? y % get_mod() : (get_mod() - (-y) % get_mod()) % get_mod()) {}
static int &get_mod() {
static int mod = 0;
return mod;
}
static void set_mod(int md) {
get_mod() = md;
}
ArbitraryModInt &operator+=(const ArbitraryModInt &p) {
if((x += p.x) >= get_mod()) x -= get_mod();
return *this;
}
ArbitraryModInt &operator-=(const ArbitraryModInt &p) {
if((x += get_mod() - p.x) >= get_mod()) x -= get_mod();
return *this;
}
ArbitraryModInt &operator*=(const ArbitraryModInt &p) {
unsigned long long a = (unsigned long long) x * p.x;
unsigned xh = (unsigned) (a >> 32), xl = (unsigned) a, d, m;
asm("divl %4; \n\t" : "=a" (d), "=d" (m) : "d" (xh), "a" (xl), "r" (get_mod()));
x = m;
return *this;
}
ArbitraryModInt &operator/=(const ArbitraryModInt &p) {
*this *= p.inv();
return *this;
}
ArbitraryModInt operator-() const { return ArbitraryModInt(-x); }
ArbitraryModInt operator+(const ArbitraryModInt &p) const { return ArbitraryModInt(*this) += p; }
ArbitraryModInt operator-(const ArbitraryModInt &p) const { return ArbitraryModInt(*this) -= p; }
ArbitraryModInt operator*(const ArbitraryModInt &p) const { return ArbitraryModInt(*this) *= p; }
ArbitraryModInt operator/(const ArbitraryModInt &p) const { return ArbitraryModInt(*this) /= p; }
bool operator==(const ArbitraryModInt &p) const { return x == p.x; }
bool operator!=(const ArbitraryModInt &p) const { return x != p.x; }
ArbitraryModInt inv() const {
int a = x, b = get_mod(), u = 1, v = 0, t;
while(b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ArbitraryModInt(u);
}
ArbitraryModInt pow(int64_t n) const {
ArbitraryModInt ret(1), mul(x);
while(n > 0) {
if(n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ArbitraryModInt &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ArbitraryModInt &a) {
int64_t t;
is >> t;
a = ArbitraryModInt(t);
return (is);
}
};
using mint = ArbitraryModInt;
void mul(vector<mint> &dp, int d) {
int MAX = len(dp)-1;
rrep(i,MAX+1,d) {
dp[i] -= dp[i - d];
}
}
void div(vector<mint> &dp, int d) {
int MAX = len(dp);
rep(i,d,MAX+1) {
dp[i] += dp[i - d];
}
}
int main() {
int n, k, m;
cin >> n >> k >> m;
mint::set_mod(m);
vector<mint> dp(n*n*k+1, 0);
vector<vector<mint>> vals(n+1, vector<mint>(n*n*k+1));
dp[0] = mint(1);
vals[0][0] = dp[0];
rep(i,1,n) {
div(dp, i);
mul(dp, i*(k+1));
rep(j,0,n*n*k) {
vals[i][j] = dp[j];
}
}
rep(i,0,n) {
mint ans = 0;
rep(j,0,n*n*k+1) {
ans += vals[i][j] * vals[n-i-1][j];
}
cout << ans*(k+1)-1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool ll_sqrt(ll x, ll& lower_bound, ll& upper_bound)
{
constexpr ll ll_max = numeric_limits<ll>::max();
bool first_boost = true;
lower_bound = 0;
upper_bound = x;
while (upper_bound - lower_bound > 1)
{
if (first_boost)
{
ll guess = (ll)sqrt((double)x);
lower_bound = max(guess - 1, (ll)0);
upper_bound = lower_bound + 3;
first_boost = false;
}
ll newval = (lower_bound + upper_bound) / 2;
if ((newval != 0) && (newval > ll_max / newval)) // newval*newval becomes overflow
upper_bound = newval; // because overflow means newval is too big
else
{
ll newval_sqr = newval * newval;
if (newval_sqr < x)
lower_bound = newval;
else
upper_bound = newval;
}
}
if ((upper_bound != 0) && (upper_bound > ll_max / upper_bound))
{
if (lower_bound * lower_bound == x)
upper_bound = lower_bound;
}
else
{
if (lower_bound * lower_bound == x)
upper_bound = lower_bound;
else if (upper_bound * upper_bound == x)
lower_bound = upper_bound;
}
bool is_exact = (lower_bound == upper_bound);
return is_exact;
}
ll ll_ceil(ll x, int digit);
ll ll_floor(ll x, int digit);
ll ll_floor(ll x, int digit)
{
if (x < 0)
return -ll_ceil(-x, digit);
ll div = 1;
while (digit != 0)
{
div *= 10;
digit--;
}
ll modval = x % div;
ll ans = x - modval;
return ans;
}
ll ll_ceil(ll x, int digit)
{
if (x < 0)
return -ll_floor(-x, digit);
ll div = 1;
while (digit != 0)
{
div *= 10;
digit--;
}
ll modval = x % div;
ll ans = x - modval;
if (modval != 0)
ans += div;
return ans;
}
int main() {
ll N;
ll X;
cin >> N >> X;
X*=100;
ll V[N];
ll P[N];
for(int i = 0; i<N ; i++) {
cin >> V[i] >> P[i];
}
ll ans = 0;
for(int i = 0; X >=0 && i<N; i++) {
ans ++;
X -= V[i]*P[i];
}
if(X >= 0){
ans = -1;
}
cout << ans << endl;
return 0;
} |
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ff first
#define ss second
#define ins insert
#define sz(x) (int)x.size()
#define dbg(x) cout << x << "\n";
const int N = 2e5 + 5;
const long long int mod = 1e9 + 7;
const long long int Mod = 998244353;
const long double Pi = acos(-1);
const long long int Inf = 4e18;
const long double Eps = 1e-9;
int dx[9] = {0, 1, -1, 0, 0, 1, 1, -1, -1};
int dy[9] = {0, 0, 0, 1, -1, 1, -1, 1, -1};
using namespace std;
#define int long long int
void TestCase (){
int n, q;
cin >> n >> q;
vector <int> a(n + 1, 0), b(n + 2, 0);
for(int i = 1; i<=n; i++){
cin >> a[i];
if(i == 1) b[i] = a[i] - 1;
else b[i] = b[i - 1] + a[i] - a[i - 1] - 1;
}
b[n + 1] = Inf;
while(q--){
int k;
cin >> k;
int lb = 1, ub = n + 1, pos = n + 2;
while(lb <= ub){
int mid = (lb + ub) / 2;
if(k <= b[mid]){
pos = min(pos, mid);
ub = mid - 1;
}
else lb = mid + 1;
}
k -= b[pos - 1];
cout << a[pos - 1] + k << "\n";
}
}
#undef int
int main(){
IOS;
int T = 1;
// cin >> T;
while(T--){
TestCase();
cout << "\n";
}
return 0;
} | #include <bits/stdc++.h>
#define Fr(i,a,b) for(int i=(a);i<=(b);++i)
#define Fl(i,a,b) for(int i=(a);i>=(b);--i)
#define Fe(i,u) for(int i=H[u];i;i=e[i].nx)
#define ms(a,x) memset((a),(x),sizeof(a));
using namespace std;
int N,W;
long long p[200005],f;
int main()
{
scanf("%d%d",&N,&W);
Fr(i,1,N)
{
int s,t,x;
scanf("%d%d%d",&s,&t,&x);
p[s]+=x,p[t]-=x;
}
Fr(i,0,200000)
{
f+=p[i];
if(f>W)
{
cout<<"No";
return 0;
}
}
cout<<"Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}
template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
for(auto &e:u) fill_v<T>(e,v...);
}
template <typename F>
class
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
FixPoint final : private F
{
public:
template <typename G>
explicit constexpr FixPoint(G&& g) noexcept
: F{std::forward<G>(g)}
{}
template <typename... Args>
constexpr decltype(auto)
operator()(Args&&... args) const
#if !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9
noexcept(noexcept(F::operator()(std::declval<FixPoint>(), std::declval<Args>()...)))
#endif // !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9
{
return F::operator()(*this, std::forward<Args>(args)...);
}
}; // class FixPoint
#if defined(__cpp_deduction_guides)
template <typename F>
FixPoint(F&&)
-> FixPoint<std::decay_t<F>>;
#endif // defined(__cpp_deduction_guides)
namespace
{
template <typename F>
#if !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)
# if defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
# elif defined(_MSC_VER) && _MSC_VER >= 1700 && defined(_Check_return_)
_Check_return_
# endif // defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
#endif // !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)
inline constexpr decltype(auto)
makeFixPoint(F&& f) noexcept
{
return FixPoint<std::decay_t<F>>{std::forward<std::decay_t<F>>(f)};
}
} // namespace
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int64 T;
cin >> T;
REP(_, T) {
int64 N;
cin >> N;
if (N % 4 == 0) {
cout << "Even" << endl;
} else if (N % 2 == 0) {
cout << "Same" << endl;
} else {
cout << "Odd" << endl;
}
}
}
| #include <bits/stdc++.h>
#define ll long long int
#define db double
#define pb push_back
#define mpr make_pair
#define andl "\n"
#define f first
#define s second
#define mset(x,y) memset(x,y,sizeof(x))
#define fr(i,n) for(long long int i=0;i<n;i++)
#define trace(it,x) for(auto it = (x).begin(); it != (x).end(); it++)
#define mod 1000000007
#define fastio ios::sync_with_stdio (false); cin.tie (0); cout.tie (0);
#define runtime cerr<< '\n' << "Time elapsed :" << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n" ;
using namespace std;
// convert number to string to_string(x);
// convert string to number stoi();
// ll mulmod(ll x,ll y)
// {
// return ((x%mod)*(y%mod))%mod;
// }
// ll binpow(ll x, ll y)
// {
// ll z = 1;
// while(y > 0)
// {
// if(y % 2 == 1)
// z = mulmod(z, x);
// x = mulmod(x, x);
// y /= 2;
// }
// return z;
// }
// ll ncr(ll n,ll r)
// {
// return mulmod(fact[n],binpow(mulmod(fact[n-r],fact[r]),mod-2));
// }
// ll pwr(ll n,ll m)
// {
// if(n==1 || m==0)
// return 1;
// ll x=pwr(n,m/2);
// if(m%2==0)
// return x*x;
// else
// return n*x*x;
// }
// ll pwr(ll n,ll m,ll b)
// {
// if(n==1 || m==0)
// return 1;
// ll x=pwr(n,m/2,b);
// if(m%2==0)
// return ((x%b)*(x%b))%b;
// else
// return ((n%b)*(((x%b)*(x%b))%b))%b;
// }
bool compare(pair<pair<ll,ll>,ll>a,pair<pair<ll,ll>,ll>b)
{
return a.f.s+2*a.f.f > b.f.s+2*b.f.f;
}
void solve()
{
ll n,s1=0,s2=0,ans=0;
cin >> n;
vector<pair<pair<ll,ll>,ll>>v(n);
fr(i,n)
{
cin >> v[i].f.f >> v[i].f.s;
v[i].s=v[i].f.f+v[i].f.s;
s1+=v[i].f.f;
}
sort(v.begin(),v.end(),compare);
fr(i,n)
{
if(s2>s1)
break;
else
{
ans++;
s2+=v[i].s;
s1-=v[i].f.f;
}
}
cout << ans;
return ;
}
int main()
{
fastio
ll t=1;
// cin >> t;
while(t--)
solve();
runtime
} |
// -- //
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 5e5+228;
const ll C = 600000;
char c[3*N];
signed main(){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
string s;
cin >> s;
ll l=C, r=C;
ll rc=1;
for(auto i : s){
if(i=='R'){
if(rc==1){
rc=-1;
swap(l, r);
r--, l--;
}else{
rc=1;
swap(l, r);
r++, l++;
}
}else{
if(abs(r-l)>0&&c[r-rc]==i)r-=rc;
else{
c[r]=i;
r+=rc;
}
}
}
string res="";
if(rc==-1){
for(ll i = l;i>r;i--) res.push_back(c[i]);
}else{
for(ll i = l;i<r;i++) res.push_back(c[i]);
}
cout<<res<<'\n';
}
| #line 1 "main.cpp"
#include <bits/stdc++.h>
using namespace std;
// template {{{
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)
#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)
#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl
constexpr i32 inf = 1001001001;
constexpr i64 infll = 1001001001001001001ll;
constexpr i32 dx[] = {0, -1, 1, 0, -1, 1, -1, 1};
constexpr i32 dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};
struct IoSetup { IoSetup(i32 x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;
template <typename T = i64> T input() { T x; cin >> x; return x; }
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != (int)v.size() ? " " : ""); } return os; }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// }}}
vector< int > calc(int n, vector< int > ps) {
vector< int > res;
for (auto &p : ps) {
p--;
}
// v : 0-indexed
auto find_idx = [&](int v) {
range(i, 0, n) {
if (ps[i] == v) return i;
}
return -1ll;
};
int k = 0;
auto swap_check = [&](int i) {
return ((i & 1) == (k & 1));
};
auto swap_query = [&](int i) {
// if ((i + k) % 2 != 0) return;
swap(ps[i], ps[i + 1]);
k++;
res.emplace_back(i + 1);
};
rrange(v, 0, n) {
int idx = find_idx(v);
if (idx == v) continue;
while (not swap_check(idx)) {
if (idx == (k&1) + 1) idx--;
swap_query(k & 1);
}
range(i, idx, v) {
swap_query(i);
}
}
if (ps[n-2] != n-2) {
swap_query(n-2);
}
return res;
}
void solve() {
int t = input();
while (t--) {
int n = input();
vector< int > ps(n);
cin >> ps;
auto as = calc(n, ps);
cout << as.size() << endl;
cout << as << endl;
}
}
signed main() {
solve();
}
|
#include<iostream>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
int main() {
int a, b; cin >> a >> b;
int mx = 0;
for (int i = 1; i <= b; i++) {
int cnt = (b / i - (a - 1) / i);
if (cnt >= 2) {
mx = max(mx, i);
}
}
cout << mx << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define re register int
#define rl register ll
#define rep(i,a,b) for(re i=(a),i##end=(b);i<=i##end;++i)
#define pre(i,a,b) for(re i=(a),i##end=(b);i>=i##end;--i)
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define cpy(a1,a2) memcpy(a1,a2,sizeof(a2))
using namespace std;
ll a,b,c,d,ans;
inline int rint()
{
re x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1; ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48); ch=getchar();}
return x*f;
}
inline ll rll()
{
rl x=0ll,f=1ll; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1ll; ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48); ch=getchar();}
return x*f;
}
signed main()
{
a=rint(),b=rint(),c=rint(),d=rint();
if(c*d<=b) return printf("-1"),0;
while(a+ans*b>ans*c*d) ++ans;
printf("%lld",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i, n) for(ll i=n-1;i>=0;--i)
#define rep1(i, n) for(ll i=1; i<=n; ++i)
#define repitr(itr,mp) for(auto itr=mp.begin();itr!=mp.end();++itr)
#define ALL(a) (a).begin(),(a).end()
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
const ll MOD = 998244353;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
const double PI = 3.1415926535897932384626;
ll mod(ll a, ll m){return (a % m + m) % m;}
int main(){
ll n;
cin >> n;
vector<ll> a(n);
ll ans = 0;
rep(i, n){
cin >> a[i];
ans = mod(ans + a[i]*a[i], MOD);
}
sort(ALL(a), greater<ll>());
ll sum = 0;
rep(i, n){
ans = mod(ans + a[i] * sum, MOD);
sum = mod(sum * 2 + a[i], MOD);
}
cout << ans << endl;
} | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define DEBUG2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
typedef long long ll;
const int MAXN=1;
const ll MOD=998244353;
ll _gcd(ll a,ll b){if(b==0)return a;return _gcd(b,a%b);}
ll gcd(ll a,ll b){a=abs(a),b=abs(b);if(a<b)swap(a,b);return _gcd(a,b);}
ll qpow(ll a,ll n){ll rt=1;while(n){if(n&1)rt=(rt*a)%MOD;a=a*a%MOD;n>>=1;}return rt;}
ll factor[MAXN];
ll inv[MAXN];
void cal_factor(){factor[0]=1;for(int u=1;u<MAXN;u++){factor[u]=(factor[u-1]*u)%MOD;}}
void cal_factor_inv(){inv[0]=1;inv[MAXN-1]=qpow(factor[MAXN-1],MOD-2);for(int u=MAXN-2;u>=1;u--){inv[u]=inv[u+1]*(u+1)%MOD;}}
void init_factor(){cal_factor();cal_factor_inv();}
ll C(ll n,ll k){if(n<k)return 0;return factor[n]*qpow(factor[n-k],MOD-2)%MOD*qpow(factor[k],MOD-2)%MOD;}
template <int _MOD> struct Mint
{
long long v = 0;
Mint() {}
Mint(int _v) : v((_v%_MOD+_MOD)%_MOD) {}
Mint(long long _v) : v(static_cast<int>((_v%_MOD+_MOD)%_MOD)) {}
Mint operator = (const int &_v) { return *this = Mint(_v); }
Mint operator = (const long long &_v) { return *this = Mint(_v); }
bool operator ! () const { return !this->v; }
bool operator < (const Mint &b) const { return v < b.v; }
bool operator > (const Mint &b) const { return v > b.v; }
bool operator == (const Mint &b) const { return v == b.v; }
bool operator != (const Mint &b) const { return v != b.v; }
bool operator <= (const Mint &b) const { return v < b.v || v == b.v; }
bool operator >= (const Mint &b) const { return v > b.v || v == b.v; }
Mint operator + (const Mint &b) const { return Mint(v+b.v); }
Mint operator - (const Mint &b) const { return Mint(v-b.v); }
Mint operator * (const Mint &b) const { return Mint(1ll*v*b.v); }
Mint operator / (const Mint &b) const { return Mint(b.inv()*v); }
Mint& operator += (const Mint &b) { return *this = *this+b; }
Mint& operator -= (const Mint &b) { return *this = *this-b; }
Mint& operator *= (const Mint &b) { return *this = *this*b; }
Mint& operator /= (const Mint &b) { return *this = *this/b; }
Mint operator - () const { return Mint(-v); }
Mint& operator ++ () { return *this += 1; }
Mint& operator -- () { return *this -= 1; }
Mint operator ++ (int) { Mint tmp = *this; *this += 1; return tmp; }
Mint operator -- (int) { Mint tmp = *this; *this -= 1; return tmp; }
Mint pow(int p) const {
Mint res(1), x(*this);
while (p) {
if (p&1) res = res*x;
x *= x;
p >>= 1;
}
return res;
}
Mint inv() const {
if(v==0)return Mint(1);
return pow(_MOD-2);
}
friend istream& operator >> (istream &is, Mint &mt) { return is >> mt.v;mt.v=mt.v%_MOD; }
friend ostream& operator << (ostream &os, const Mint &mt) { return os << mt.v; }
};
using mint = Mint<MOD>;
void solve(){
int n;
cin>>n;
vector<mint>A(n);
mint tail=mint(0),acc=mint(2);
for(int u=0;u<n;u++){
cin>>A[u];
}
sort(A.begin(),A.end());
for(int u=0;u<n;u++){
if(u<2)tail+=A[u];
else {
tail+=A[u]*acc;
acc*=mint(2);
}
}
mint ans=mint(0);
for(int u=0;u<n;u++){
if(u==0)ans+=A[u]*tail;
else {
tail=(tail-A[u-1]-A[u])/mint(2)+A[u];
ans+=A[u]*tail;
}
}
cout<<ans<<"\n";
}
// #define LOCAL
int main()
{
#ifdef LOCAL
freopen("in.txt","r",stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
} |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define rreps(i, n, s) for (int i = s; i >= n; i--)
using ll = long long;
using namespace std;
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long double a, b;
cin >> a >> b;
long double res = 100 * (a - b) / a;
cout << fixed << setprecision(5) << res << endl;
return 0;
} | #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;
void solve(){
float a, b; cin >> a >> b ;
vector<float>arr;
arr.push_back(a);arr.push_back(b);
sort(arr.begin(),arr.end());
cout << 100-((arr[0]*100)/arr[1]) << "\n";
return;
}
int main(){
solve();
} |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __builtin_popcountll(x)
#define autoit(x,it) for(auto it = x.begin(); it != x.end(); it++)
#define autoitr(x,it) for(auto it = x.rbegin(); it != x.rend(); it++)
#define rep(n) for(ll i = 0; i < n; i++)
#define repi(i,n) for(ll i = 0; i < n; i++)
#define hmap gp_hash_table<ll, ll>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
ll powa(ll a, ll b, ll c)
{
a%=c;
if(a<0)
a+=c;
ll res = 1;
while(b>0)
{
if(b&1)
res*=a, res%=c;
a*=a, a%=c;
b>>=1;
}
return res;
}
ll norm(ll a)
{
a%=mod;
if(a<0)
a+=mod;
return a;
}
ll add(ll a, ll b)
{
a = norm(a);
b = norm(b);
return norm(a+b);
}
ll mul(ll a, ll b)
{
a = norm(a);
b = norm(b);
return norm(a*b);
}
ll sub(ll a, ll b)
{
a = norm(a);
b = norm(b);
return norm(a-b);
}
ll divi(ll a, ll b)
{
b = powa(b,mod-2,mod);
return mul(a,b);
}
#define N 105
void mul(ll res[N][N], ll m1[N][N], ll m2[N][N])
{
ll temp[N][N];
memset(temp,0,sizeof(temp));
for(ll i=0;i<N;i++)
for(ll j=0;j<N;j++)
for(ll k=0;k<N;k++)
{
temp[i][j]+=(m1[i][k]*m2[k][j])%mod;
temp[i][j]%=mod;
}
for(ll i=0;i<N;i++)
for(ll j=0;j<N;j++)
res[i][j] = temp[i][j];
}
void powam(ll mat[N][N], ll n)
{
ll res[N][N];
memset(res,0,sizeof(res));
for(ll i=0;i<N;i++)
for(ll j=0;j<N;j++)
if(i == j)
res[i][j] = 1;
while(n>0)
{
if(n%2 == 1)
mul(res,res,mat);
n>>=1;
mul(mat,mat,mat);
}
for(ll i=0;i<N;i++)
for(ll j=0;j<N;j++)
mat[i][j] = res[i][j];
}
int main()
{
FAST/**/
ll n,m,k;
cin>>n>>m>>k;
ll arr[n];
rep(n)
cin>>arr[i];
ll mat[N][N];
memset(mat,0,sizeof(mat));
ll adj[N][N];
memset(adj,0,sizeof(adj));
vector<ll> gr(n,0);
ll i2 = powa(2,mod-2,mod);
rep(m)
{
ll x,y;
cin>>x>>y;
x--, y--;
gr[x]++;
gr[y]++;
adj[x][y] = adj[y][x] = 1;
}
rep(n)
repi(j,n)
{
if(i == j)
mat[i][j] = sub(m, mul(1,mul(gr[i],i2)));
else if(adj[i][j])
mat[i][j] = i2;
}
powam(mat,k);
ll fac = powa(powa(m,mod-2,mod),k,mod);
ll ans[n];
memset(ans,0,sizeof(ans));
rep(n)
{
repi(j,n)
ans[i] = add(ans[i], mul(mat[i][j], arr[j]));
ans[i] = mul(ans[i], fac);
cout<<ans[i]<<'\n';
}
return 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 pb 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);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll 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 outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
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){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
int main(){
ll n;cin>>n;
string s,t;cin>>s>>t;
vi a,b;
rep(i,n){
if(s[i]=='0')a.pb(i);
if(t[i]=='0')b.pb(i);
}
if(a.size()!=b.size())dame(-1);
ll ans=0;
rep(i,a.size())if(a[i]!=b[i])ans++;
out(ans);
} |
#include<bits/stdc++.h>
using namespace std;
#define db(x) cout<<x<<'\n'
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define repi(i,n) for(int i=0;i<(n);++i)
//#define repA(i,a,n) for(int i=a;i<=(n);++i)
//#define repD(i,a,n) for(int i=a;i>=(n);--i)
#define ll long long int
#define endl '\n'
#define lld long long double
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int> >
#define err(t) cout<<"Error : "<<t<<endl;
#define all(v) v.begin(),v.end()
#define mp make_pair
#define M 100000
#define MD 1000000007 //998244353
#define pb push_back
#define rep(i,a,b) for(ll i = a; i <= (b); i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vec(a) vector<a >
#define se second
#define fi first
#define inf 0xffffffff
#define inchar getchar_unlocked
#define outchar(x) putchar_unlocked(x)
//template <typename T>
//using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll binpow(ll a,ll b){ if(a==0) return 0; if(b==0) return 1;ll ans=1;while(b>0){if(b&1) ans=ans*a; a=a*a; b=b>>1;} return ans;}
template <typename T>
T Min(T a,T b){ return a<b?a:b; }
template <typename T>
T Max(T a,T b){ return a>b?a:b; }
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
// int n;cin>>n;
// string s;cin>>s;
//ll n;cin>>n; vl a(n); repi(i,n) cin>>a[i];
int a,b;cin>>a>>b;
cout<<(a+b)/2<<" "<<(a-b)/2<<endl;
/*
int test1;cin>>test1;while(test1--){
}
//*/
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) begin(v), end(v)
#define sz(v) v.size()
#define INF 1e17
#define EPSILON 1e-14
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//浮動小数点はなるべく使うな、powも気をつけろ
int main()
{
ll A, B;
cin >> A >> B;
A += B;
if(A >= 15 && B >= 8){
cout << 1 << '\n';
}
else if(A >= 10 && B >= 3){
cout << 2 << '\n';
}
else if(A >= 3){
cout << 3 << '\n';
}
else
{
cout << 4 << '\n';
}
} |
/**
* author: Dooloper
* created: 26.10.2020 13:52:11
**/
#include <iostream>
#include <string>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i<n;i++)
typedef pair<int,int> P;
int main() {
ll n,k;
cin >> n >> k;
rep(i,k){
int small,b;
vector<int> tmp;
string s=to_string(n);
rep(j,(ll)s.size()){
//if(s.at(j)-'0'!=0){
tmp.push_back(s.at(j)-'0');
// }
}
s="";
sort(tmp.begin(),tmp.end());
reverse(tmp.begin(),tmp.end());
rep(j,(ll)tmp.size()){
//cout << tmp.at(j) << endl;
s.push_back(tmp.at(j)+'0');
}
//cout << s << endl;
if(s=="")
b=0;
else
b=stoi(s);
s="";
reverse(tmp.begin(),tmp.end());
rep(j,(ll)tmp.size()){
if(tmp.at(j)!=0)
s.push_back(tmp.at(j)+'0');
}
if(s=="")
small=0;
else
small=stoi(s);
n=b-small;
//cout << b << small << endl;
}
cout << n << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
const int mod = 1e9+7;
template< int mod >
struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int) (1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while(b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while(n > 0) {
if(n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt< mod >(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt< mod >;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int h,w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
vector<vector<int>> lit(h,vector<int>(w,0));
rep(i,h){
int cnt = 0;
rep(j,w){
if(s[i][j]=='#'){
cnt = 0;
}
else{
lit[i][j] += cnt;
cnt++;
}
}
cnt = 0;
for(int j = w-1;j>=0;j--){
if(s[i][j]=='#'){
cnt = 0;
}
else{
lit[i][j] += cnt;
cnt++;
}
}
}
rep(j,w){
int cnt = 0;
rep(i,h){
if(s[i][j]=='#'){
cnt = 0;
}
else{
lit[i][j] += cnt;
cnt++;
}
}
cnt = 0;
for(int i = h-1;i>=0;i--){
if(s[i][j]=='#'){
cnt = 0;
}
else{
lit[i][j] += cnt;
cnt++;
}
}
}
// rep(i,h)rep(j,w){
// cout << lit[i][j] << " \n"[j==w-1];
// }
modint ans = 0;
int tot_cnt = 0;
rep(i,h)rep(j,w) if(s[i][j]=='.') {tot_cnt++;lit[i][j]++;}
rep(i,h)rep(j,w){
ans += ((modint) 2).pow(tot_cnt-lit[i][j]) * (((modint) 2).pow(lit[i][j]) - 1);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
double A,B,sum;
cin>>A>>B;
sum=A*B/100;
cout<<sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
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;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
ll modpow(ll a, ll n, ll m)
{
ll ret = 1;
while (n > 0)
{
if (n % 2 == 1) ret = ret * a % m;
a = a * a % m;
n /= 2;
}
return ret;
}
int main()
{
ll N, M;
cin >> N >> M;
ll X = modpow(10, N, M * M);
ll Y = modpow(10, N, M);
cout << mod(X - Y, M * M) / M << endl;
} |
#include <bits/stdc++.h>
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)
#define pll pair<ll,ll>
#define pint pll
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
int main() {
int n;
cin >> n;
string s,t;
cin >> s;
cin >> t;
vector<int>v,v2;
rep(i,n){
if(s[i]=='1')v.push_back(i);
if(t[i]=='1')v2.push_back(i);
}
ll cnt=v.size(),cnt2=v2.size();
if(abs(cnt-cnt2)%2 || cnt2>cnt){
cout << -1 << endl;
return 0;
}
bool used[cnt]={};
ll ans=0;
int j=0;
rep(i,cnt){
if(used[i])continue;
if(i+1<cnt && j<cnt2 && v[i]<v2[j]){
ans+=v[i+1]-v[i];
used[i+1]=true;
}
else if(j<cnt2 && v[i]>v2[j]){
ans+=v[i]-v2[j];
j++;
}
else if(j<cnt2 && v[i]==v2[j]){
j++;
}
else if(j==cnt2 && i+1<cnt){
ans+=v[i+1]-v[i];
used[i+1]=true;
}
}
if(j!=cnt2){
cout << -1 << endl;
return 0;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define int long long
#define FOR(i, size) for (int i = 0; i < size; i++)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define MOD 1000000007
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void logger(string vars, Args &&...values)
{
cout << vars << " = ";
string delim = "";
(..., (cout << delim << values, delim = ", "));
}
template <typename T>
void print_list(vector<T> collection, bool newline = true)
{
for (const auto &item : collection)
{
cout << item << " ";
}
if (newline)
cout << endl;
}
#define ONE_TESTCASE 1
int n, m, timer;
void Solve()
{
cin >> n;
vector<pair<double, double>> v;
FOR(i, n)
{
int t;
cin >> t;
double a, b;
cin >> a >> b;
if (t == 2)
{
b -= 0.1;
}
else if (t == 3)
{
a += 0.1;
}
else if (t == 4)
{
a += 0.1;
b -= 0.1;
}
v.push_back({a, b});
}
int cnt = 0;
for (int i = 0; i < n - 1; i++)
{
for (int j = i + 1; j < n; j++)
{
if ((v[i].second >= v[j].first and v[i].first <= v[j].first) or (v[j].second >= v[i].first and v[i].first >= v[j].first))
cnt++;
}
}
cout << cnt;
}
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#if ONE_TESTCASE
int test = 1;
#else
int test;
cin >> test;
#endif
for (int t = 1; t <= test; t++)
{
Solve();
cout << endl;
}
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios::sync_with_stdio(false); cin.tie(nullptr)
#define TC(t) int t; cin >> t; for(int i = 1; i <= t; i++)
#define deb(x) cerr << #x << " = " << x << endl
#define deb2(x, y) cerr << #x << " = " << x << ", " << #y << " = " << y << endl
#define f0(i, a, n) for(i = a; i < n; i++)
#define f1(i, a, n) for(i = a; i <= n; i++)
#define ini(x, y) memset(x, y, sizeof(x))
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define ll long long int
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define M 1000000007
#define endl '\n'
#define bits(x) __builtin_popcountll(x)
#define zrbits(x) __builtin_ctzll(x)
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pii>
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define multi_ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
const int N = 1e5 + 1;
const int MX = 1e9;
const ll INF = 1e18;
using namespace std;
using namespace __gnu_pbds;
inline ll uceil(ll a,ll b) {return (a % b ? a / b + 1 : a / b);}
inline ll mod(ll x) {return ( (x % M + M) % M );}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) {for(auto& x : v) os << x << " "; return os << '\n';}
template<typename... T> void in(T&... args) {((cin >> args), ...);}
template<typename... T> void out(T&&... args) {((cout << args << endl), ...);}
template<typename... T> void out2(T&&... args) {((cout << args << " "), ...);}
void solve() {
ll n, w, i, j;
cin >> n >> w;
vector<pair<ll,ll>> v;
f0(i, 0, n) {
ll x, y, c;
cin >> x >> y >> c;
v.pb({x,c});
v.pb({y,-c});
}
sort(all(v));
ll sum = 0;
for(auto it : v) {
sum += (it.ss);
if(sum > w) {
out("No");
return;
}
if(sum < 0) sum = 0;
}
out("Yes");
}
int main () {
FIO;
// TC(t)
solve();
return 0;
} | #include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll MAX = 1e18 + 100;
const int maxN = 1e5 + 5;
const int maxM = 2e5 + 5;
ll head[maxN], cnt;
struct edge {
ll c, d;
ll to, best_time, next;
}e[maxM];
ll n, m, dis[maxN];
void add_e(ll x, ll y, ll val_t, ll c, ll d)
{
e[++cnt].to = y;
e[cnt].best_time = val_t;
e[cnt].c = c; e[cnt].d = d;
e[cnt].next = head[x];
// cout<<x<<' '<<head[x]<<endl;
head[x] = cnt;
// printf("cnt=%d\n",cnt);
// cout<<x<<' '<<head[x]<<endl<<endl;
}
struct node {
ll time, dis, pos;
bool operator < (const node& a)const {
return dis > a.dis;
}
}t;
void dij()
{
int i;
priority_queue<node>qu;
dis[1] = 0;
qu.push(node{ 0, 0, 1 });
while (!qu.empty())
{
t = qu.top(); qu.pop();
int now = t.pos;
if (dis[now] != t.dis) continue;
for (i = head[now]; i; i = e[i].next)
{
int To = e[i].to;
if (t.time < e[i].best_time)
{//要等待时间
int minn_dis = e[i].c + (ll)(e[i].d / (e[i].best_time + 1));
if (dis[To] > dis[now] + minn_dis + e[i].best_time - t.time)
{
dis[To] = dis[now] + minn_dis + e[i].best_time - t.time;
qu.push(node{ dis[To], dis[To], To });
}
}
else
{//不用等待时间
int minn_dis = e[i].c + (ll)(e[i].d / (t.time + 1));
if (dis[To] > dis[now] + minn_dis)
{
dis[To] = dis[now] + minn_dis;
qu.push(node{ dis[To], dis[To], To });
}
}
}
}
}
int main()
{
int i, j;
ll x, y;
ll c, d;
cin >> n >> m;
for (i = 0; i < m; i++)
{
cin >> x >> y >> c >> d;
if (x == y)continue;
ll minn = MAX, tt;
double pos = sqrt(d);
for (j = (int)pos - 2; j <= (int)pos + 2; j++)
if (j >= 0)
if (minn > (c + (int)(d / (j + 1)) + j))
{
minn = c + (int)(d / (j + 1)) + j;
tt = j;
}
add_e(x, y, tt, c, d);
add_e(y, x, tt, c, d);
}
for (i = 1; i <= n; i++)
dis[i] = MAX;
dij();
if (dis[n] == MAX)
cout << -1 << endl;
else
cout << dis[n] << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <limits>
#include <cmath>
#include <iomanip>
#include <functional>
#include <random>
#include <set>
using namespace std;
using ll = long long;
const long long BASE_NUM = 1000000007;
//https://scrapbox.io/pocala-kyopro/%E6%8B%A1%E5%BC%B5%E3%83%A6%E3%83%BC%E3%82%AF%E3%83%AA%E3%83%83%E3%83%89%E3%81%AE%E4%BA%92%E9%99%A4%E6%B3%95
// https://ei1333.github.io/luzhiled/snippets/math/combination.html
template< int mod >
struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int) (1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while(b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while(n > 0) {
if(n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt< mod >(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt< BASE_NUM >;
template< typename T >
struct Combination {
vector< T > _fact, _rfact, _inv;
Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
_fact[0] = _rfact[sz] = _inv[0] = 1;
for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
_rfact[sz] /= _fact[sz];
for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
}
inline T fact(int k) const { return _fact[k]; }
inline T rfact(int k) const { return _rfact[k]; }
inline T inv(int k) const { return _inv[k]; }
T P(int n, int r) const {
if(r < 0 || n < r) return 0;
return fact(n) * rfact(n - r);
}
T C(int p, int q) const {
if(q < 0 || p < q) return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
T H(int n, int r) const {
if(n < 0 || r < 0) return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
using modint = ModInt< BASE_NUM >;
int main()
{
ll N, M, K;
cin >> N >> M >> K;
Combination<modint> combination(2000000);
if (N - M > K){
cout << 0 << endl;
}else if(N == K){
cout << combination.C(N+M,N) << endl;
}else{
cout << combination.C(N+M,N) - combination.C(N+M,N-K-1) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int getInt(){int x;scanf("%d",&x);return x;}
template<typename T>istream& operator>>(istream&i,v(T)&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const v(T)&v){if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>ll suma(const v(T)&a){ll res(0);for(auto&&x:a)res+=x;return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 3005;
// Mod int
const int mod = 998244353;
struct mint {
ll x;
mint():x(0){}
mint(ll x):x((x%mod+mod)%mod){}
// mint(ll x):x(x){}
mint& fix() { x = (x%mod+mod)%mod; return *this;}
mint operator-() const { return mint(0) - *this;}
mint operator~() const { return mint(1) / *this;}
mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
mint& operator/=(const mint& a){ (x*=a.pow(mod-2).x)%=mod; return *this;}
mint operator+(const mint& a)const{ return mint(*this) += a;}
mint operator-(const mint& a)const{ return mint(*this) -= a;}
mint operator*(const mint& a)const{ return mint(*this) *= a;}
mint operator/(const mint& a)const{ return mint(*this) /= a;}
mint pow(ll t) const {
if(!t) return 1;
mint res = pow(t/2);
res *= res;
return (t&1)?res*x:res;
}
bool operator<(const mint& a)const{ return x < a.x;}
bool operator==(const mint& a)const{ return x == a.x;}
};
mint ex(mint x, ll t) { return x.pow(t);}
istream& operator>>(istream&i,mint&a){i>>a.x;return i;}
ostream& operator<<(ostream&o,const mint&a){o<<a.x;return o;}
typedef vector<mint> vm;
struct comb {
vm f, g;
comb(){}
comb(int mx):f(mx+1),g(mx+1) {
f[0] = 1;
rrep(i,mx) f[i] = f[i-1]*i;
g[mx] = f[mx].pow(mod-2);
for(int i=mx;i>0;i--) g[i-1] = g[i]*i;
}
mint operator()(int a, int b) {
if (a < b) return 0;
return f[a]*g[b]*g[a-b];
}
};
//
mint dp[MX][MX];
int main() {
int n,k;
scanf("%d%d",&n,&k);
dp[0][0] = 1;
rep(i,n+1)drep(j,n+1) {
dp[i+1][j+1] += dp[i][j];
if (j%2 == 0) dp[i][j/2] += dp[i][j];
}
cout<<dp[n][k]<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int x, y;
x = (a + b) / 2;
y = (a - b) / 2;
cout << x << " " << y;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define rsz resize
#define ins insert
#define mp make_pair
#define pf push_front
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rep(i,a,b) for (int i = (a); i < (b); ++i)
#ifndef ONLINE_JUDGE
#define deb(x) cerr<< #x <<" "; __print(x); cerr<<endl;
#else
#define deb(x)
#endif
const ll mod = 1e9+7; // 998244353;
const ll inf = 1e18;
const ld pie = acos((ld)-1);
ll mod_add(ll a, ll b, ll m) {a = a % m; b = b % m; return (((a + b) % m) + m) % m;}
ll mod_mul(ll a, ll b, ll m) {a = a % m; b = b % m; return (((a * b) % m) + m) % m;}
ll mod_sub(ll a, ll b, ll m) {a = a % m; b = b % m; return (((a - b) % m) + m) % m;}
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
void __print(int x) {cerr<<x;}
void __print(char x) {cerr<<x;}
void __print(string x) {cerr<<x;}
void __print(float x) {cerr<<x;}
void __print(double x) {cerr<<x;}
void __print(bool x) {cerr<<x;}
void __print(ll x) {cerr<<x;}
template<class T, class U> void __print(pair<T,U> p) {cerr<<"{"<<p.ff<<", "<<p.ss<<"}";}
template<class T> void __print(vector<T> arr) { cerr<<"[ "; for(auto x:arr) { __print(x);cerr<<" "; } cerr<<"]"; }
template<class T> void __print(set<T> st) { cerr<<"{ "; for(auto x:st) { __print(x); cerr<<" "; } cerr<<"}";}
template<class T, class U> void __print(vector<pair<T,U>> arr) { cerr<<"[ "; for(auto x:arr) {__print(x);cerr<<", ";}cerr<<"]";}
template<class T, class U> void __print(unordered_map<T,U> arr) { cerr<<"{ "; for(auto x:arr) {__print(x);cerr<<", ";}cerr<<"}";}
template<class T, class U> void __print(map<T,U> arr) { cerr<<"{ "; for(auto x:arr) {__print(x);cerr<<", ";}cerr<<"}";}
template<typename... T> void read(T&... args) { ((cin>>args),...);}
template<typename... T> void write(T&&... args){((cout<<args<<" "),...);cout<<'\n';}
int main(){
int a,b;
scanf("%d%d",&a,&b);
int x = (a+b)>>1;
int y = a - x;
printf("%d %d\n",x,y);
return 0;
/*STUFF TO LOOK:
1. Check the constraints
2. Corner cases(n==0||n==1)
3. Variables in loops
4. Make sure two ints aren’t multiplied to get a long long
5. Don't use scanf or printf while using ios_base
6. using the local variable of the same name when global variable was required to be used
*/
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
int n,a[200005],maxx,sum,s2;
void solve()
{
int ans=0;
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
sum=a[1],s2=a[1];
ans=a[1]*2;
maxx=a[1];
cout<<ans<<endl;
for(int i=2;i<=n;i++)
{
s2+=a[i];
maxx=max(maxx,a[i]);
sum+=s2;
cout<<sum+maxx*i<<endl;
}
}
signed main()
{
int _=1;
//cin>>_;
while(_--) solve();
return 0;
} | #pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##_len; ++i)
#define EACH(i, v) for(const auto& i : v)
#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>using vec = vector<T>;
template<class T, class U>using umap = unordered_map<T, U>;
template<class T>using uset = unordered_set<T>;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vl = vec<ll>;
#define fi first
#define se second
#define el endl
constexpr ll INF = numeric_limits<ll>::max()/2-1;
#pragma endregion
#pragma region IOMacros
template<class T>
istream &operator>>(istream &stream, vec<T>& o){REP(i, o.size())stream >> o[i];return stream;}
template<class T>
ostream &operator<<(ostream &stream, vec<T>& objs){REP(i, objs.size())stream << objs[i] << " ";stream << el;return stream;}
#define I(T, ...) ;T __VA_ARGS__;__i(__VA_ARGS__);
void __i() {}
template<class T, class... Ts> void __i(T&& o, Ts&&... args){cin >> o;__i(forward<Ts>(args)...);}
void O() {cout << el;}
template<class T, class... Ts> void O(T&& o, Ts&&... args){cerr << o << " ";O(forward<Ts>(args)...);}
#pragma endregion
void Main();
int main(){
std::cin.tie(nullptr);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
#pragma region graph
struct edge{
ll from, to, cost;
bool operator<(const edge& r) const{return cost<r.cost;}
bool operator>(const edge& r) const{return cost>r.cost;}
};
struct graph{
ll V;
vector<vector<edge> > G;
graph(ll n){
init(n);
}
void init(ll n){
V = n;
G.resize(V);
}
// 無向グラフ
void add_edge(ll s, ll t, ll cost = 1){
add_diedge(s, t, cost);
add_diedge(t, s, cost);
}
// 有向グラフ
void add_diedge(ll s, ll t, ll cost = 1){
if(s < 0 || t < 0 || s >= V || t >= V) return;
G[s].push_back({s, t, cost});
}
auto pos2d(ll height, ll width){
return [height, width](ll y, ll x){
return
(y < 0 || y >= height || x < 0 || x >= width)
? -1
: y*width + x;
};
}
};
#pragma endregion
// O(|E|log|V|)
vector<ll> dijkstra(const graph& g, ll s){
vector<ll> d(g.V, INF);
d[s] = 0;
priority_queue<P,vector<P>, greater<P>> que;
que.push({0, s});
while(!que.empty()){
auto [c, v] = que.top(); que.pop();
if(d[v]<c) continue;
for(auto e : g.G[v]){
if(d[e.to]>d[v]+e.cost){
d[e.to] = d[v]+e.cost;
que.push({d[e.to],e.to});
}
}
}
return d;
}
void Main(){
I(ll, R, C);
graph g(2*R*C);
auto pos = g.pos2d(R, C);
ll W = R*C;
REP(i, R){
REP(j, C-1){
I(ll, A);
g.add_edge(pos(i, j), pos(i, j+1), A);
}
}
REP(i, R-1){
REP(j, C){
I(ll, B);
g.add_diedge(pos(i, j), pos(i+1, j), B);
}
}
REP(i, R-1){
REP(j, C){
g.add_diedge(W+pos(i+1, j), W+pos(i, j), 1);
}
}
REP(i, R){
REP(j, C){
g.add_diedge(pos(i, j), W+pos(i, j), 1);
g.add_diedge(W+pos(i, j), pos(i, j), 0);
}
}
auto d = dijkstra(g, pos(0, 0));
cout << d[pos(R-1, C-1)] << el;
}
|
#include<bits/stdc++.h>
#define maxn 300010
using namespace std;
typedef long long LL;
int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
int n;
long long A[maxn],s,ans;
signed main()
{
n=read();
for(int i=1;i<=n;i++) A[i]=read(),s+=A[i];
for(int i=1;i<=n;i++)
{
ans+=A[i]*A[i]*(n-1)-(s-A[i])*A[i];
}
cout<<ans<<'\n';
return 0;
} | #include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<cstdlib>
#include<time.h>
#include<string>
#include<stack>
#include<cmath>
#include<iostream>
#include<cstring>
#include<complex>
#include<tr1/unordered_set>
#include<tr1/unordered_map>
#include <chrono>
#include <iomanip>
using namespace std;
using namespace tr1;
#define FOR(i,j,k) for(int i=j;i<k;i++)
#define FORD(i,j,k) for(int i=j;i>=k;i--)
#define ll long long
//Make sure no overflow problems
#define pii pair<int, int>
#define vi vector<int >
#define pb push_back
#define mp make_pair
#define fffirst
#define ss second
#define VAR(i,n) __typeof(n) i = (n)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define FORDEACH(i,c) for( VAR(i,(c).rbegin()),i!=(c).rend();i++)
#define REP(i,n) FOR(i,0,n)
#define ld long double
const int INF = 1000000009;
const long long INFLL = (ll)INF * (ll)INF;
const ld EPS = 10e-9;
///////////////////////////////////////////////////////////////
#define curr_time std::chrono::high_resolution_clock::now()
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int n;
cin>>n;
map<int,ll> freq;
int val;
for(int i=0;i<n;i++){
cin>>val;
freq[val]++;
}
ll ans=0;
for(int i=-200;i<=200;i++){
for(int j=i+1;j<=200;j++){
ans+=freq[i]*freq[j]*abs(i-j)*abs(i-j);
}
}
cout<<ans;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.