code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int t;
cin>>t;
ll sum3 = 0;
while(t--)
{
ll a,b;
cin>>a>>b;
a--;
ll sum1 = (a*(a+1))/2;
ll sum2 = (b*(b+1))/2;
sum3 += sum2-sum1;
}
cout<<sum3<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
cout.tie(0);
int n,i,s=0;
cin>>n;
int A[n];
for(i=0;i<n;i++)
{
cin>>A[i];
if(A[i]<=10)
{
A[i]=0;
}
else
{
A[i]=A[i]-10;
}
s+=A[i];
}
cout<<s<<endl;
return 0;
}
|
/*
Author:Frozencode
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef pair<ll,ll> pii;
const ll maxn = 100010;
const ll INF = 2147483647;
ll n, c[maxn], cnt, res[maxn], x, y;
bool vis[maxn];
ll col[maxn];
vector <ll> e[maxn];
void dfs(ll tem){
vis[tem] = 1;
if(!col[c[tem]])res[++cnt] = tem;
col[c[tem]]++;
for(int i = 0; i < e[tem].size(); i++){
if(!vis[e[tem][i]])dfs(e[tem][i]);
}
col[c[tem]]--;
}
int main()
{
ios::sync_with_stdio(false);
cin >> n;
for(int i = 1; i <= n; i++)cin >> c[i];
for(int i = 1; i < n; i++){
cin >> x >> y;
e[x].pb(y);
e[y].pb(x);
}
dfs(1);
sort(res + 1, res + cnt + 1);
for(int i = 1; i <= cnt; i++)cout << res[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end());reverse(v.begin(),v.end());}
template<class T> void print_tate(vector<T> &v) {rep(i,v.size()) cout<<v[i]<<"\n";}
void yneos(bool a){if(a) cout<<"Yes"<<"\n"; else cout<<"No"<<"\n";}
ll N;
vector<ll> p;
vector<ll> c(1e5);
vector<ll> ans,seen;
vector<vector<ll>> G;
void DFS(int a){
seen[a]=1;
if(c[p[a]]==-1){
ans.push_back(a);
c[p[a]]=a;
}
for(auto x:G[a]){
if(seen[x]==0) DFS(x);
}
if(c[p[a]]==a) c[p[a]]=-1;
}
//Cとかで出てみたい
int main() {
cin>>N;
rep(i,N){
ll a;
cin>>a;
a--;
p.push_back(a);
}
G.resize(N);
rep(i,N-1){
ll a,b;
cin>>a>>b;
a--,b--;
G[a].push_back(b);
G[b].push_back(a);
}
seen.resize(N);
rep(i,1e5) c[i]=-1;
DFS(0);
rep(i,ans.size()) ans[i]++;
So(ans);
print_tate(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double a,b;
cin >> a >> b;
cout << b / 100 * a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define for_(i, a, b) for(int i = (a);i < (b);++i)
#define ford_(i, a, b) for(int i = (b)-1;i >= (a);--i)
#define rep(i, n) for_(i, 0, n)
#define repd(i, n) rfor_(i, 0, n)
int main(){
int a,b;
cin >> a >> b;
if(a == b) cout << a << endl;
else cout << 3-(a + b) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) (((a) + (b) - 1) / (b))
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
if(pvaspace) b << " "; pvaspace=true;\
b << pva;\
}\
b << "\n";}
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;
const ll MOD = 1000000007;
const ll MAX = 2147483647;
template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
return o << '(' << p.F << ',' << p.S << ')';
}
vector<int> prime, lpf;
void sieve(int n){
lpf.resize(n + 1, 1);
for(int i = 2; i <= n; i++){
if(lpf[i] == 1){
lpf[i] = i;
prime.eb(i);
}
for(int j : prime){
if((ll)j * i > n) break;
lpf[i * j] = j;
if(j == lpf[i]) break;
}
}
}
int main(){
StarBurstStream
// sieve(40000);
int n;
cin >> n;
map<int, int> tmp;
int mn = MAX;
for(int i = 0; i < n; i++){
int a;
cin >> a;
mn = min(mn, a);
for(int j = 1; (ll)j * j <= a; j++){
if(a % j) continue;
tmp[j] = __gcd(tmp[j], a);
tmp[a / j] = __gcd(tmp[a / j], a);
}
}
int ans = 0;
for(pii i : tmp){
if(i.F == i.S && i.F <= mn) ans++;
}
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int l;
#define M 1000000007
#define loop(i,n) for(int i=0;i<n;i++)
const l inf = 9e17;
struct triplet
{
l src;
l dest;
l weigh;
};
l sum;
l pa(int n)
{
l cnt=0;
for(int i=1;i*i<=n;i++)
{
if(i*i==n)
sum+=i;
else if(n%i==0)
{
sum+=i;
sum+=(n/i);
}
}
return sum%M;
}
l vis[10001];
map<l,vector<l>>mp;
int dfs(l st)
{
if(vis[st])
return 0;
vis[st]=1;
l ans=0;
for(auto x:mp[st])
{
if(!vis[x])
{
ans+=dfs(x);
}
}
return ans+1;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output1.txt","w",stdout);
#endif
l t;
t=1;
while(t--)
{
l n,m;
cin>>n>>m;
l a,b;
loop(i,m)
{
cin>>a>>b;
mp[a].push_back(b);
}
//vis.resize(n+1);
l ams=0;
loop(i,n){
memset(vis,0,sizeof(vis));
l z = dfs(i+1);
//cout<<z<<endl;
ams+=z;
}
cout<<ams;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main() {
mt19937 rng(48);
cout.tie(nullptr)->sync_with_stdio(false);
int N, M; cin >> N >> M;
array<array<bool, 20>, 20> graph{};
for (int i = 0; i < M; ++i) {
int a, b; cin >> a >> b;
--a, --b;
graph[a][b] = graph[b][a] = true;
}
int mi = N;
vector<int> S(N), cc(N);
iota(S.begin(), S.end(), 0);
for (int it = 0; it <= 25; ++it) {
shuffle(S.begin(), S.end(), rng);
int color = 1;
for (int i = 1; i < N; ++i) {
int Q = 0;
for (int j = 0; j < i; ++j) {
if (!graph[S[j]][S[i]]) Q |= (1 << cc[j]);
}
Q ^= (1 << color) - 1;
if (Q == 0) {
cc[i] = color++;
} else {
while (true) {
cc[i] = uniform_int_distribution<int>(0, color + 1)(rng);
if (Q & (1 << cc[i])) break;
}
}
}
mi = min(mi, color);
}
cout << mi << '\n';
}
| #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>;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#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(29,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...);}
#ifndef ONLINE_JUDGE
//#define deb(x...) cerr << "[" << #x << "] = "; _print(x)
#define deb(x...) _print(x)
#else
#define deb(x...)
#endif
// DEBUG FUNCTIONS END
const int N = 2e5+5;
void solve(){
int n, m;
cin >> n >> m;
vvi g(n, vi(n));
rep(_, 0, m){
int u, v;
cin >> u >> v;
u--, v--;
g[u][v] = 1;
g[v][u] = 1;
}
vi dp(1<<n);
rep(msk,0,1<<n){
bool ok = 1;
rep(i,0,n){
rep(j,i+1,n){
if((msk >> i & 1) && (msk >> j & 1))
ok &= (bool)g[i][j];
}
}
if(ok){
dp[msk] = 1;
}else{
dp[msk] = infl;
for(int s = msk; s; s = (s-1) & msk){
mini(dp[msk], dp[s] + dp[s ^ msk]);
}
}
}
cout << dp[(1<<n)-1] << endl;
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(10);
int t = 1;
//cin >> t;
while (t--)
solve();
return 0;
}
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;
}
int divide(int a, int b) {
return (a % mod) * powm(b % mod, mod - 2) % mod;
}
int norm(int a) {
while (a >= mod) a -= mod;
while (a < 0) a += mod;
return a;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define MP make_pair
const unsigned long long mod = 1e9 + 7;
const long long INF = 1LL<<60;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
void chmin(long long &a, long long b) { if (a > b) a = b; }
void chmax(long long &a, long long b) { if (a < b) a = b; }
int main(void){
ios::sync_with_stdio(0);
cin.tie(0);
int N, M, p = 0;
cin >> N >> M;
vector<int> width, blue(M);
int mw = N;
FOR(i,0,M){
cin >> blue.at(i);
}
sort(range(blue));
FOR(i,0,M){
int a = blue.at(i);
if(a-p!=1){
width.push_back(a - p - 1);
mw = min(mw, a - p - 1);
}
p = a;
}
if(N!=p){
width.push_back(N - p);
mw = min(mw, N - p);
}
/*
FOR(i,0,width.size()){
cout << width.at(i) << " ";
}
cout << endl;
cout << mw << endl;
*/
int sum = 0;
FOR(i,0,width.size()){
sum += ceil((ld)width.at(i) / mw);
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define REPS(i, ss, nn ) for(int i = ss ; i < (int) nn; i++)
#define REV(i, ss, nn ) for(int i = ss ; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
namespace std{
template<class Fun>
class y_combinator_result{
Fun fun_;
public:
template<class T>
explicit y_combinator_result(T &&fun) : fun_(std::forward<T>(fun)){}
template<class ...Args>
decltype(auto) operator()(Args&&...args){
return fun_(std::ref(*this), std::forward<Args>(args)...);
}
};
template<class Fun>
decltype(auto) y_combinator(Fun && fun){
return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}
};
template<typename T>
bool u_max(T& a, T b){
if( a < b){
a = b;
return true;
}
return false;
}
template<typename T>
bool u_min(T& a, T b){
if( a > b){
a = b;
return true;
}
return false;
}
// struct edge{
// int to, from;
// ll cost;
// edge(){ edge(0,0);}
// edge(int to_, ll cost_){ edge(0, -1, 0);}
// edge(int to_, int from_, ll cost_) : to(to_), from(from_), cost(cost_){}
// };
template<typename... T>
void read(T& ... a){
((cin >> a),...);
}
void solve(){
int n;
read(n);
ll subscription;
read(subscription);
map<ll, ll> mp;
REP(i, n){
ll a, b, c;
read(a, b, c);
mp[a] += c;
mp[b+1] -= c;
}
ll pay = 0;
ll cost = 0;
ll last = 0;
for(auto& [day, price] : mp){
if(cost < subscription){
pay += cost * (day - last);
}else{
pay += subscription * (day - last);
}
cost += price;
// debl(day) debl(cost) deb(pay)
last = day;
}
cout << pay << endl;
}
int main()
{
//making data IO Fast
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
/****************************/
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//typedef tree <int,null_type,less <int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// #include <ext/rope>
// using namespace __gnu_cxx;
typedef long long int ll;
typedef long double ld;
#define FAST \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define rep(g, i, n) for (ll g = i; g < n; g++)
#define rev(g, n, i) for (ll g = n - 1; g >= i; g--)
#define all(v) v.begin(), v.end()
#define pb push_back
#define mxe(v) *max_element(v.begin(), v.end())
#define mne(v) *min_element(v.begin(), v.end())
#define ve vector
#define lb lower_bound
#define ub upper_bound
#define bb break
#define cc continue
#define rem 1000000007
#define PI 3.141592653589793238462643383279502
ll power(ll x, ll y, ll p)
{
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p)
{
return power(n, p - 2, p);
}
struct point
{
ll x, y;
};
// ve<ve<ll>> tree;
ve <ll> ans;
ve <bool> done;
map<pair<ll, ll>, ll> val;
void dfs(ll node, ve<ll> adj[], ve<bool> &visited)
{
visited[node] = true;
for (int i = 0; i < (int)adj[node].size(); i += 1)
{
if (!visited[adj[node][i]])
{
// tree[node].pb(adj[node][i]);
// tree[adj[node][i]].pb(node);
ll x=node,y=adj[node][i];
done[val[{x,y}]]=true;
if (val[{x,y}]==ans[x]||val[{x,y}]==ans[y])
{
//nothing
}
else
{
ans[y]=val[{x,y}];
}
dfs(adj[node][i], adj, visited);
}
}
}
int main()
{
FAST
// freopen("input1.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
/*ll tests;
cin>>tests;
rep (gg,0,tests)
{}*/
ll n,
m;
cin >> n >> m;
ans.assign(n+1,0);
done.assign(n+1,false);
ve<ll> adj[n + 1];
rep(i, 0, m)
{
ll u, v, c;
cin >> u >> v >> c;
adj[u].pb(v);
adj[v].pb(u);
val[{u, v}] = c;
val[{v, u}] = c;
}
ve<bool> visit(n + 1, false);
dfs(1,adj,visit);
rep (i,1,n+1)
{
if (done[i]==false)
{
rep (j,1,n+1)
{
if (ans[j]==0)
{
ans[j]=i;
}
}
break;
}
}
rep (i,1,n+1)
{
if (ans[i]==0||visit[i]==false)
{
cout<<"No\n";
return 0;
}
}
rep (i,1,n+1)
{
cout<<ans[i]<<"\n";
}
}
| #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; string S; cin >> N >> S;
vector<int> F(N + 1, 0), G(N + 1, 1);
REP(i, 1, N + 1) {
int cnt = 0, tmp = i;
while (tmp % 3 == 0) {
cnt++;
tmp /= 3;
}
F[i] = F[i - 1] + cnt;
G[i] = (G[i - 1] * (tmp % 3)) % 3;
}
auto ncr = [&](int r) {
if (F[N - 1] - F[r] - F[N - 1 - r]) return 0;
if (G[N - 1] == 1) {
return (G[r] * G[N - 1 - r]) % 3;
} else {
return (6 - G[r] * G[N - 1 - r]) % 3;
}
};
int ans = 0;
REP(i, 0, N) {
if (S[i] == 'B') {
ans += ncr(i);
} else if (S[i] == 'R') {
ans += 2 * ncr(i);
}
}
if (N % 2 == 0) ans *= -1;
ans = (3 + ans % 3) % 3;
if (ans == 0) {
cout << "W" << endl;
} else if (ans == 1) {
cout << "B" << endl;
} else {
cout << "R" << endl;
}
return 0;
}
|
//g++ -std=c++14 test.cpp -o test.out
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long long int
const LL INF = (1LL<<60);
const int INF_INT = 2147483647-1e6-1;
const LL mod = 1000000007ll;
const int mod_int = 1000000007;
//https://github.com/atcoder-live/library/blob/master/mint.cpp
struct mint {
LL x;
mint(LL x=0):x((x%mod+mod)%mod){}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res+=a;
}
mint operator-(const mint a) const {
mint res(*this);
return res-=a;
}
mint operator*(const mint a) const {
mint res(*this);
return res*=a;
}
mint pow(LL t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime mod
mint inv() const {
return pow(mod-2);
}
mint& operator/=(const mint a) {
return (*this) *= a.inv();
}
mint operator/(const mint a) const {
mint res(*this);
return res/=a;
}
};
struct combination {
vector<mint> fact, ifact;//factに階乗を計算、ifactはその各々に対する逆元
combination(LL n):fact(n+1),ifact(n+1) {
assert(n < mod);
fact[0] = 1;
for (LL i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
ifact[n] = fact[n].inv();
for (LL i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
}
mint operator()(LL n,LL k) {
if (k < 0 || k > n) return 0;
return fact[n]*ifact[k]*ifact[n-k];
}
};
LL N;
char CAA,CAB,CBA,CBB;
mint ans = 1;
mint dp(){
//dp[i][c]:
//i文字目までカウント、最後に使った文字がc
vector<map<char,mint>> dp((N-3)+1);
dp[0]['A'] = 1;
dp[0]['B'] = 1;//Bは2文字以上連続しない
for(int i=0;i<N-3;i++){
dp[i+1]['A'] = (dp[i]['A'] + dp[i]['B']);
dp[i+1]['B'] = dp[i]['A'];
}
return dp[N-3]['A'];
}
void solve(){
if(N<=3) return;
if(CAB=='A'){
if(CAA=='A') return;
if(CAA=='B'){
if(CBA=='A'){
ans = dp();
return;
}
if(CBA=='B'){
ans = mint(2).pow(N-3);
return;
}
}
}
if(CAB=='B'){
if(CBB=='B') return;
if(CBB=='A'){
if(CBA=='B'){
ans = dp();
return;
}
if(CBA=='A'){
ans = mint(2).pow(N-3);
return;
}
}
}
}
int main(){
cin >> N;
cin >> CAA >> CAB >> CBA >> CBB;
solve();
cout << ans.x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
const int64_t MOD2 = 998244353;
const int INF = 2e9;
const long long inf = 1LL<<62;
template<int MOD> struct ModInt {
static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
int get() const { return (int)x; }
ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
return ModInt(u); }
bool operator==(ModInt that) const { return x == that.x; }
bool operator!=(ModInt that) const { return x != that.x; }
ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<998244353> mint;
int64_t po(int64_t a, int64_t b) {
int64_t ans = 1;
while (b > 0) {
if (b%2) {
ans = (ans*a)%MOD2;
}
a = a*a%MOD2;
b /= 2;
}
return ans;
}
int main() {
int n, m;
cin >> n >> m;
mint ans = (mint(m)^n)*(mint(n));
for (int l=2; l<=n; l++) {
for (int x = 1; x<=m; x++) {
ans -= (mint(m-x)^(l-2))*(mint(m)^(n-l))*mint(n-l+1);
}
}
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<n-1;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
ll n,ans=0;
cin >> n;
if(n>999){
ans+=n-999;
}if(n>999999){
ans+=n-999999;
}if(n>999999999){
ans+=n-999999999;
}if(n>999999999999){
ans+=n-999999999999;
}if(n>999999999999999){
ans+=n-999999999999999;
}
cout << ans;
} |
//12252024832524
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN = 100005;
const int MOD = 1e9 + 7;
int n;
int Read()
{
int x = 0,f = 1;char c = getchar();
while(c > '9' || c < '0'){if(c == '-')f = -1;c = getchar();}
while(c >= '0' && c <= '9'){x = (x*10) + (c^48);c = getchar();}
return x * f;
}
void Put1(int x)
{
if(x > 9) Put1(x/10);
putchar(x%10^48);
}
void Put(int x,char c = -1)
{
if(x < 0) putchar('-'),x = -x;
Put1(x);
if(c >= 0) putchar(c);
}
template <typename T>T Max(T x,T y){return x > y ? x : y;}
template <typename T>T Min(T x,T y){return x < y ? x : y;}
template <typename T>T Abs(T x){return x < 0 ? -x : x;}
int qpow(int x,int y)
{
int ret = 1;
while(y){if(y & 1) ret = 1ll * ret * x % MOD;x = 1ll * x * x % MOD;y >>= 1;}
return ret;
}
char gc()
{
char c = getchar();
while(c != 'A' && c != 'B') c = getchar();
return c;
}
int f[MAXN];
int getf(int x)
{
f[1] = 2;f[2] = 3;
for(int i = 3;i <= x;++ i) f[i] = (f[i-1] + f[i-2]) % MOD;
return f[x];
}
int main()
{
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
n = Read();
if(n <= 3) {Put(1);return 0;}
char aa = gc(),ab = gc(),ba = gc(),bb = gc();
if(ab == 'B')
{
if(bb == 'B') Put(1);
else
{
if(ba == 'A') Put(qpow(2,n-3));
else Put(getf(n-3));
}
}
else
{
if(aa == 'A') Put(1);
else
{
if(ab == 'B' || ba == 'B') Put(qpow(2,n-3));
else Put(getf(n-3));
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <set>
//#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define all(v) v.begin(), v.end()
#define front(v) *v.begin()
#define back(v) *(--v.end())
#define len(v) v.size()
#define int long long
using longl = long long;
using longd = long double;
const longl INF = 1e9;
const longl LINF = 1e18;
const longl mod = 1e9 + 7;
const double PI = acos(-1);
//------------------------------------------------------------------------------------------------
longl divup(longl a, longl b){
return (a + b - 1) / b;
}
longl bin_pow(longl a, longl b){
longl res = 1;
while (b > 0){
if (b % 2)
res = res * a % mod;
a = a * a % mod;
b /= 2;
}
return res;
}
//------------------------------------------------------------------------------------------------
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++){
cin >> v[i];
}
sort(all(v));
v.resize(unique(all(v)) - v.begin());
reverse(all(v));
int ans = 1;
for (int i = 1; i < v.size(); i++){
ans = (ans * (v[i - 1] - v[i] + 1)) % mod;
}
ans = ans * (v[v.size() - 1] + 1) % mod;
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
void __print(int x) {cerr << x;}
void __print(long long 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 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 z : x) cerr << (f++ ? "," : ""), __print(z); 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 ljuba
#define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
const char nl = '\n';
const int mxN = 3e5 + 12;
ll ft[mxN];
void update(int i, ll x) {
for(; i < mxN; i += i&-i) {
ft[i] += x;
}
}
ll query(int i) {
ll r = 0;
for(; i; i -= i&-i) {
r += ft[i];
}
return r;
}
void solve() {
int n;
cin >> n;
vll v(n);
for(auto &z : v) {
cin >> z;
++z;
}
ll ans = 0;
for(int i = 0; i < n; ++i) {
ans += query(n) - query(v[i]-1);
update(v[i], 1);
}
cout << ans << nl;
for(int i = 0; i < n-1; ++i) {
ans -= v[i]-1;
ans += (n-v[i]);
cout << ans << nl;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int testCases = 1;
//cin >> testCases;
while(testCases--)
solve();
}
| #include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define ll long long
#define repi(i,a,b) for(ll i=a;i<b;++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
template <typename T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
using vvv = vector<vector<vector<ll>>>;
using vv = vector<vector<ll>>;
using vec = vector<ll>;
using P = pair<ll, ll>;
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
template <class S, S(*op)(S, S), S(*e)()> struct segtree {
public:
segtree() : segtree(0) {}
segtree(int n) : segtree(std::vector<S>(n, e())) {}
segtree(const std::vector<S>& v) : _n(int(v.size())) {
log = ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
for (int i = 0; i < _n; i++) d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
d[p] = x;
for (int i = 1; i <= log; i++) update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
return d[p + size];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
S sml = e(), smr = e();
l += size;
r += size;
while (l < r) {
if (l & 1) sml = op(sml, d[l++]);
if (r & 1) smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
template <bool(*f)(S)> int max_right(int l) {
return max_right(l, [](S x) { return f(x); });
}
template <class F> int max_right(int l, F f) {
assert(0 <= l && l <= _n);
assert(f(e()));
if (l == _n) return _n;
l += size;
S sm = e();
do {
while (l % 2 == 0) l >>= 1;
if (!f(op(sm, d[l]))) {
while (l < size) {
l = (2 * l);
if (f(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool(*f)(S)> int min_left(int r) {
return min_left(r, [](S x) { return f(x); });
}
template <class F> int min_left(int r, F f) {
assert(0 <= r && r <= _n);
assert(f(e()));
if (r == 0) return 0;
r += size;
S sm = e();
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!f(op(d[r], sm))) {
while (r < size) {
r = (2 * r + 1);
if (f(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
ll op(ll a, ll b) {
return a + b;
}
ll e() {
return 0;
}
int main(void) {
ll n; cin >> n;
vec al(n);
rep(i, n) cin >> al[i];
auto sg = new segtree<ll, op, e>(n);
ll ans = 0;
rep(i, n) {
ans += sg->prod(al[i], n);
sg->set(al[i], 1);
}
rep(i, n) {
cout << ans << endl;
ans -= al[i];
ans += n - 1 - al[i];
}
system("pause");
}
|
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
vector<int>A(M);
vector<int>B(M);
rep(i, M) {
cin >> A[i] >> B[i];
A[i]--;
B[i]--;
}
int K;
cin >> K;
vector<int>C(K);
vector<int>D(K);
rep(i, K) {
cin >> C[i] >> D[i];
C[i]--;
D[i]--;
}
int ans = 0;
rep(i, (1 << K)) {
vector < bool >Tama(N);
rep(j, K) {
if (1&(i >> j)) {
Tama[C[j]] = true;
}
else {
Tama[D[j]] = true;
}
}
int anssub = 0;
//rep(j, N) {
// cout << Tama[j] << "_";
//}
//cout << endl;
rep(j, M) {
if ((Tama[A[j]]) && (Tama[B[j]])) {
anssub++;
}
}
ans = max(ans, anssub);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string a,b;
cin >> a >> b;
ll as = 0;
ll bs = 0;
for(int i = 0;i < (int)a.size();i++)as += a[i] - '0';
for(int i =0;i < (int)b.size();i++)bs += b[i] - '0';
cout << max(as,bs) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
ll nextLong() { ll x; scanf("%lld", &x); return x;}
string rev(string s) {
REP(i, s.size()) {
s[i] = 'A'+(1-(s[i]-'A'));
}
return s;
}
int main2() {
int N = nextLong();
int M = 1 << N;
vector<string> ans;
ans.push_back("AB");
for (int m = 1; m <= N-1; m++) {
vector<string> n_ans;
n_ans.push_back(string(1<<m, 'A') + string(1<<m, 'B'));
for (string s : ans) {
n_ans.push_back(s + s);
}
for (string s : ans) {
n_ans.push_back(s + rev(s));
}
ans = n_ans;
}
cout << (M - 1) << endl;
for (string s : ans)
cout << s << endl;
return 0;
}
int main() {
#ifdef LOCAL
for (;!cin.eof();cin>>ws)
#endif
main2();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int n;
vector<ll> with[3];
int cnt[3];
int getID(char c) {
switch (c) {
case 'R': return 0;
case 'G': return 1;
case 'B': return 2;
}
return -1;
}
signed main() {
cin >> n;
for (int i = 0; i < n * 2; i++) {
ll a;
char c;
cin >> a >> c;
int id = getID(c);
with[id].push_back(a);
cnt[id]++;
}
bool allEven = all_of(cnt, cnt + 3, [](int elem)->bool {
return elem % 2 == 0;
});
if (allEven) {
return cout << 0 << endl, 0;
}
if (cnt[0] % 2 == 0) {
swap(cnt[2], cnt[0]);
swap(with[2], with[0]);
}
else if (cnt[1] % 2 == 0) {
swap(cnt[2], cnt[1]);
swap(with[2], with[1]);
}
assert(cnt[2] % 2 == 0);
ll pos1 = 1e18;//posibilities
ll pos2[2] = {pos1, pos1};
vector<pair<ll, int>> only01;
for (int i = 0; i < 2; i++) {
for (ll c : with[i]) {
only01.emplace_back(c, i);
}
}
sort(only01.begin(), only01.end());
for (int i = 1; i < (int)only01.size(); i++) {
auto [preFi, preSe] = only01[i - 1];
auto [currFi, currSe] = only01[i];
if (currSe != preSe) {
pos1 = min(pos1, currFi - preFi);
}
}
vector<pair<ll, int>> all;
for (int i = 0; i < 3; i++) {
for (ll c : with[i]) {
all.emplace_back(c, i);
}
}
sort(all.begin(), all.end());
for (int i = 1; i < n * 2; i++) {
auto [preFi, preSe] = all[i - 1];
auto [currFi, currSe] = all[i];
if (preSe == 0 && currSe == 2 || preSe == 2 && currSe == 0) {
pos2[0] = min(pos2[0], currFi - preFi);
}
else if (preSe == 1 && currSe == 2 || preSe == 2 && currSe == 1) {
pos2[1] = min(pos2[1], currFi - preFi);
}
}
cout << min(pos2[0] + pos2[1], pos1) << endl;
return 0;
}
|
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
/*#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
/*#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")*/
using namespace std;
using ll = long long int;
using ld = long double;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define lc v<<1
#define rc v<<1|1
#define fast_io ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
const int N=5e5+10,LN=18,M=1.1e7+10,SQ=350,BS=737,inf=1e9+10;
const ll INF=1e15;
const int MH=1000696969,MOD=1000000007 /*998244353*/;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using pll=pair<ll,ll>;
using pii=pair<int,int>;
#define ordered_set tree<pll, null_type,less<pll>, rb_tree_tag,tree_order_statistics_node_update>
ll pow(ll x, ll y, ll mod){
ll ans=1;
while (y != 0) {
if (y & 1) ans = ans * x % mod;
y >>= 1;
x = x * x % mod;
}
return ans;
}
ll n,cnt[3],ls[3],mn[3],ans;
pll a[N];
int main(){
fast_io;
cin >> n;
n*=2;
mn[0]=mn[1]=mn[2]=INF;
for(ll i=1; i<=n; i++){
cin >> a[i].F;
char C;
cin >> C;
if(C=='G') a[i].S=1;
if(C=='B') a[i].S=2;
cnt[a[i].S]++;
}
sort(a+1,a+n+1);
for(ll i=1; i<=n; i++){
ls[a[i].S]=i;
for(ll j=0; j<3; j++){
if(j!=a[i].S && ls[j]){
ll k=3-a[i].S-j;
mn[k]=min(mn[k],a[i].F-a[ls[j]].F);
}
}
}
if(cnt[0]%2==1 && cnt[1]%2==1) ans=min(mn[2],mn[1]+mn[0]);
if(cnt[0]%2==1 && cnt[2]%2==1) ans=min(mn[1],mn[2]+mn[0]);
if(cnt[2]%2==1 && cnt[1]%2==1) ans=min(mn[0],mn[1]+mn[2]);
cout << ans << '\n';
return 0;
}
| /*Be patient && calm!
All our dreams can come true, if we have the courage to pursue them.
I fear not the man who has practiced 10,000 kicks once, but I fear the man who has practiced one kick 10,000 times.
Do not pray for an easy life, pray for the strength to endure a difficult one.
When something is important enough, you do it even if the odds are not in your favor.
First, solve the problem. Then, write the code.
Fix the cause, not the symptom.
Simplicity is the soul of efficiency.
Make it work, make it right, make it fast.
No matter how hard it gets, NEVER GIVE UP*/
// set<int>::iterator it;
// set<int>::reverse_iterator it;
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define Max 10000000000000000
int fact(int n)
{
int res = 1;
for (int i = 2; i <= n; i++)
res = res * i;
return res;
}
ll f1(vector<ll> &v1,vector<ll> &v2){
int sz=v1.size();
ll ans=1e18;
for(int i=0;i<sz;i++){
auto ind=lower_bound(v2.begin(),v2.end(),v1[i])-v2.begin();
if(ind<(int)v2.size()&&abs(v2[ind]-v1[i])<ans)
ans=abs(v2[ind]-v1[i]);
if(ind>0&&abs(v2[ind-1]-v1[i])<ans)
ans=abs(v2[ind-1]-v1[i]);
}
return ans;
}
ll f(vector<ll> v1,vector<ll> v2,vector<ll> v3){
return min(f1(v2,v3),f1(v1,v2)+f1(v1,v3));
}
void solve(){
int n;
cin>>n;
vector<ll> v[3];
for(int i=0;i<2*n;i++){
ll a;
cin>>a;
char c;
cin>>c;
if(c=='R')
v[0].push_back(a);
if(c=='G')
v[1].push_back(a);
if(c=='B')
v[2].push_back(a);
}
sort(v[0].begin(),v[0].end());
sort(v[1].begin(),v[1].end());
sort(v[2].begin(),v[2].end());
int l0=v[0].size(),l1=v[1].size(),l2=v[2].size();
if(l1%2==0&&l2%2==0&&l0%2==0){
cout<<"0\n";
return;
}
if(l0%2==0){
cout<<f(v[0],v[1],v[2]);
}
else if(l1%2==0){
cout<<f(v[1],v[0],v[2]);
}
else if(l2%2==0){
cout<<f(v[2],v[0],v[1]);
}
}
int main(){
// ios::sync_with_stdio(false);
// cout.tie(0);
// cin.tie(NULL);
int t;
// cin>>t;
t=1;
while(t--) {
// int n;
// cin>>n;
solve();
}
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define rep(i,n) for(int i=0; i<(n);++i)
int main()
{
ll n;
cin >> n;
vector<ll> x(n);
rep(i,n) cin >> x[i];
vector<ll> ps = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
ll ans = LONG_LONG_MAX;
for(int i = 0; i < 1 << ps.size(); i++){
bitset<20> bs(i);
bool ok = true;
rep(j,n){
bool sub = false;
rep(k,(int)ps.size()){
if(bs[k]){
if(x[j] % ps[k] == 0) {
sub = true;
break;
}
}
}
if(sub==false) ok = false;
if(!ok) break;
}
if(ok){
ll sum = 1;
rep(k,(int)ps.size()){
if(bs[k]){
sum *= ps[k];
}
}
ans = min(ans, sum);
}
}
cout << ans << endl;
return 0;
} | # include <bits/stdc++.h>
# define sz(x) (int)x.size()
# define f first
# define s second
using namespace std;
using ll = long long;
int cnt[55], a[55], n;
ll ans;
set<int> f[55];
void calc(int in) {
int x = a[in];
for (int i = 2; i <= x; ++i) {
while (x % i == 0) {
x /= i;
//cout << "HERE";
f[in].insert(i);
}
}
for (auto i : f[in]) cnt[i]++;
}
void solve() {
cin >> n;
ans = 1;
for (int i = 0; i < n; ++i) {
cin >> a[i];
calc(i);
}
vector<int> used(55);
// for (int i = 0; i < 55; ++i) cout << cnt[i] << ' ';
// cout << '\n';
for (int i = 0; i < n; ++i) {
bool ok = 0;
for (auto j : f[i]) {
if (ans % j == 0) ok = 1;
}
if (ok) {
for (auto j : f[i]) cnt[j]--;
continue;
}
int res = 0, x = 1;
for (auto j : f[i]) {
if (cnt[j] > res) {
res = cnt[j];
x = j;
}
}
ans *= x;
for (auto j : f[i]) cnt[j]--;
}
cout << ans;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//int t; cin >> t; while (t--)
solve();
} |
//#define _GLIBCXX_DEBUG
//#include <atcoder/all>
#include <bits/stdc++.h>
#include <chrono>
#include <random>
using namespace std;
//using namespace atcoder;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
//const ll MOD=1000000007;
const ll MOD=998244353;
//using mint = modint998244353;
//using mint = modint1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
int dx[9] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
int dy[9] = {0, 1, 0, -1, 1, -1, -1, 1, 0};
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
//https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a
ll mod_pow(long long x, long long n) {
long long ret = 1;
while (n > 0) {
if (n & 1) ret = ret * x % MOD; // n の最下位bitが 1 ならば x^(2^i) をかける
x = x * x % MOD;
n >>= 1; // n を1bit 左にずらす
}
return ret;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
// cout << fixed << setprecision(15);
ll N,K; cin>>N>>K;
vector<ll> A(N); rep(i,N) cin>>A[i];
vector<vector<ll>> pascal(1,{1});
for(int i=1;i<=K;i++){
vector<ll> vec={};
rep(j,i+1){
if(j==0||j==i) {vec.push_back(1); continue;}
vec.push_back((pascal[i-1][j-1]+pascal[i-1][j])%MOD);
}
pascal.push_back(vec);
}
/*
for(auto v:pascal){
rep(i,v.size()){
if(i!=0) cout<<' ';
cout<<v[i];
}
cout<<'\n';
}
*/
vector<ll> run(K+1,0);
rep(i,N){
ll a=1;
rep(_,K+1){
run[_]=(run[_]+a)%MOD;
a=a*A[i]%MOD;
}
}
for(int X=1;X<=K;X++){
auto l=pascal[X];
ll ans=0;
rep(i,X+1){
ll sans=0;
ll AA=run[X-i];
ll B=run[i];
ll C=run[X];
sans=l[i]*(AA*B%MOD-C)%MOD;
if(X%2==0&&i==X/2) sans=sans*mod_pow(2,MOD-2)%MOD;
if(i>X/2) break;
if(sans<0) sans+=MOD;
ans=(ans+sans)%MOD;
}
cout<<ans<<'\n';
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T,class U>
inline bool chmax(T &a,U b){
if(a<b){
a=b;
return true;
}
return false;
}
template<class T,class U>
inline bool chmin(T &a,U b){
if(a>b){
a=b;
return true;
}
return false;
}
constexpr int INF=1000000000;
constexpr ll llINF=3000000000000000000;
constexpr int mod=998244353;
constexpr double eps=1e-8;
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
random_device rnd;
mt19937 mt(rnd());//32bit
//[mi,ma]
uniform_int_distribution<int>engine(mi,ma);
return engine(mt);
}
/*
vector<vector<ll>>C,sC;
void init_comb(int n,int m){
C.resize(n+1,vector<ll>(m+1,0));
sC.resize(n+1,vector<ll>(m+1,0));
C[0][0]=1;
for(int i=1;i<=n;i++){
C[i][0]=1;
for(int j=1;j<=m;j++){
C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
}
}
rep(i,n+1){
rep(j,m){
sC[i][j+1]=(sC[i][j]+C[i][j])%mod;
}
}
}*/
ll gcd(ll a,ll b){
while(a%b){
a%=b;
swap(a,b);
}
return b;
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
bool isprime(int a){
if(a==1)return false;
for(int i=2;i*i<=a;i++){
if(a%i==0)return false;
}
return true;
}
vector<int>primes;
void init_prime(int n){
primes.push_back(2);
for(int i=3;i<=n;i+=2){
bool f=true;
for(int j:primes){
if(j*j>i)break;
if(i%j==0){
f=false;
break;
}
}
if(f)primes.push_back(i);
}
}
ll modpow(ll a,ll b){
ll res=1;
while(b){
if(b&1){
res*=a;
res%=mod;
}
a*=a;
a%=mod;
b>>=1;
}
return res;
}
vector<ll>inv,fact,factinv;
void init_fact(int n){
inv.resize(n+1);
fact.resize(n+1);
factinv.resize(n+1);
inv[0]=0;
inv[1]=1;
fact[0]=1;
factinv[0]=1;
for(ll i=1;i<=n;i++){
if(i>=2)inv[i]=mod-((mod/i)*inv[mod%i]%mod);
fact[i]=(fact[i-1]*i)%mod;
factinv[i]=factinv[i-1]*inv[i]%mod;
}
}
ll _inv(ll a,ll m=mod){
//gcd(a,m) must be 1
ll b=m,u=1,v=0;
while(b){
ll t=a/b;
a-=t*b;swap(a,b);
u-=t*v;swap(u,v);
}
u%=m;
if(u<0)u+=m;
return u;
}
ll comb(int a,int b){
if(a<b)return 0;
if(a<0)return 0;
return fact[a]*factinv[a-b]%mod*factinv[b]%mod;
}
ll multicomb(int a,int b){
return comb(a+b-1,b);
}
int n,k,dp[200010],res,dmax;
vector<int>g[200010];
void dfs(int x,int p){
dp[x]=0;
for(int i:g[x]){
if(i!=p){
dfs(i,x);
if(dp[i]+1>dmax)res++;
else if(dp[i]+1+dp[x]<=dmax)chmax(dp[x],dp[i]+1);
else{
res++;
chmin(dp[x],dp[i]+1);
}
}
}
}
bool check(int x){
res=0,dmax=x*2;
dfs(0,-1);
return res<k;
}
void solve(){
cin>>n>>k;
rep(i,n-1){
int a,b;
cin>>a>>b;
a--,b--;
g[a].push_back(b);
g[b].push_back(a);
}
int ok=n,ng=0;
while(ok-ng>1){
int m=(ok+ng)>>1;
if(check(m))ok=m;
else ng=m;
}
cout<<ok<<endl;
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
//int t;cin>>t;while(t--)
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
// __int128の入出力
using LL = __int128;
istream& operator>>(istream& is, LL& v)
{
string s;
is >> s;
v = 0;
for (int i = 0; i < (int)s.size(); i++) {
if (isdigit(s[i])) { v = v * 10 + s[i] - '0'; }
}
if (s[0] == '-') { v *= -1; }
return is;
}
ostream& operator<<(ostream& os, const LL& v)
{
if (v == 0) { return (os << "0"); }
LL num = v;
if (v < 0) {
os << '-';
num = -num;
}
string s;
for (; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }
reverse(s.begin(), s.end());
return (os << s);
}
using Int = __int128_t;
int main()
{
ll N; cin >> N;
ll ans = 1e18;
for(int b = 0; b <= 62; b++) {
ll num = (1LL<<b);
if(num > N)continue;
ll a = N / num;
ll c = N % num;
ans = min(ans, a + b + c);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A,count=0,B,C,D,E;
long long int ans[1000]={0};
cin >> A;
B=A;
C=1;
while(1){
D=A/C;
E=A%C;
ans[count]=count+D+E;
if(B<2)break;
B=B/2;
C=C*2;
count++;
}
long long int min=ans[0];
for(int i=1;i<count;i++){
if(min>ans[i])min=ans[i];
}
cout<<min;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, k;
int dp [105][105]; // pos, 2^x players
int win [105];
int pows [105];
int winz (int a, int b){
if (a==b) return a;
if (a>b) swap(a, b);
if(a==0 && b==1) return 1;
if(a==0 && b==2) return 0;
if(a==1 && b==2) return 2;
}
main(){
ios_base::sync_with_stdio(0);
pows[0]=1;
cin >> n >> k;
for (int i=1;i<105; i++) pows[i] = (2*pows[i-1])%n;
string s; cin >> s;//leng n
for (int i=0; i<n; i++){
if (s[i] == 'R') win[i]=0;
else if (s[i] == 'P') win[i]=1;
else win[i]=2;
}
for (int i=0; i<n; i++) dp[i][0] = win[i];
for (int i=1; i<=100; i++){
for (int j=0; j<n; j++){
int fi = dp[j][i-1];
int si = (j + pows[i-1]) % n;
si = dp[si][i-1];
dp[j][i] = winz(fi, si);
}
}
if (dp[0][k]==0)cout<<'R';
else if (dp[0][k]==1) cout << 'P';
else cout << 'S';
return 0;
} | #include <bits/stdc++.h>
//#include <atcoder/all>
#define int long long
#define rep(i,a) for (int i = 0; i < (a); i++ )
#define Rep(i,start,a) for (int i = start; i < (a); i++ )
#define ALL(vec) (vec).begin(), (vec).end()
#define Sort(vec) sort((vec).begin(), (vec).end()) // 小さい順
#define SORT(vec) sort((vec).begin(), (vec).end(), [](int a, int b){return a>b;}) // 大きい順
#define SORTll(vec) sort((vec).begin(), (vec).end(), [](long long a, long long b){return a>b;}) // 大きい順
#define debug(x) cerr << #x << " = " << (x) << endl
#define VI vector<int>
#define VLL vector<long long>
#define PII pair<int,int>
#define VPII vector<PII>
#define VB vector<bool>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define Graph vector<vector<int>>
#define PB emplace_back
#define USI unordered_set<int>
#define Maze vector<string>
#define Pqueue priority_queue
#define MP make_pair
#define WeightedGraph vector<vector<pair<int,ll>>> // parent, (to, cost)
#define mat vector<vector<long long>>
#define vecdebug(vec) {cerr << #vec << " = [" ; for(auto x : (vec)){cerr << (x) << ", ";} cerr << "]" << endl; }
#define vdebug(vec,i) cerr << #vec << "[" << (i) << "] = " << (vec)[(i)] << endl
#define vvdebug(vec,i,j) cerr << #vec << "[" << (i) << "][" << (j) << "] = " << (vec)[(i)][(j)] << endl
#define vvvdebug(vec,i,j,k) cerr << #vec << "[" << (i) << "][" << (j) << "][" << (k) <<"] = " << (vec)[(i)][(j)][(k)] << endl
#define pdebug(p) cerr << #p << " = [" << (p).first << ", " << (p).second << "]" << endl
typedef long long ll;
typedef long double ld;
const ll mod = 998244353;
const ll MOD = 1000000007;
const ll INFLL = (1LL << 62) -1;
const int INF = (1 << 30) -1;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const long double pi = 2*asin(1);
// cout << fixed << setprecision(16);
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//using mint = modint998244353;
//using mint = modint998244353;
//using mint = static_modint<7>;
inline void chmin(ll &x, ll y){
if(x>y) x=y;
}
inline void chmax(ll &x, ll y){
if(x<y) x=y;
}
inline int tonum(char X){
return (int)(X-'a');
}
inline int ctoi(char x){
return (int)(x-'0');
}
int Max(int x, int y){
if(x>y) return x;
return y;
}
int Min(int x, int y){
if(x<y) return x;
return y;
}
inline int tochar(int n){
return (char)('a' + n);
}
inline int ABS(int n){
if(n<0) return -n;
return n;
}
int n,k;
string S;
VI twomod(200);
void init(){
cin >> n >> k;
cin >> S;
twomod[0] = 1 % n;
rep(j,190) twomod[j+1] = (2 * twomod[j]) % n;
}
char winhand(char h1, char h2){
if(h1 == h2) return h1;
if(h1 == 'R' && h2 == 'S') return 'R';
if(h1 == 'R' && h2 == 'P') return 'P';
if(h1 == 'P' && h2 == 'R') return 'P';
if(h1 == 'P' && h2 == 'S') return 'S';
if(h1 == 'S' && h2 == 'R') return 'R';
if(h1 == 'S' && h2 == 'P') return 'S';
return '?';
}
void solve(){
init();
vector<vector<char>> win(n, vector<char>(110));
rep(i,n) win[i][0] = S[i];
rep(j,105) rep(i,n){
win[i][j+1] = winhand(win[i][j], win[ (twomod[j] + i) %n ][j]);
}
cout << win[0][k] << endl;
}
signed main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(16);
solve();
} |
//ver 8.1
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using pll = pair<ll,ll>;
using mll = map<ll,ll>;
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
#define each(x,v) for(auto& x : (v))
#define reps(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
const ll INF = 1LL << 60;
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) ((a)<=(x)&&(x)<=(b))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ind(...) long double __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)
void in(){}
template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
template <typename T> void in1(T &s) {rep(i,s.size()){in(s[i]);}}
template <typename T> void in2(T &s,T &t) {rep(i,s.size()){in(s[i],t[i]);}}
template <typename T> void in3(T &s,T &t,T &u) {rep(i,s.size()){in(s[i],t[i],u[i]);}}
template <typename T> void in4(T &s,T &t,T &u,T &v) {rep(i,s.size()){in(s[i],t[i],u[i],v[i]);}}
template <typename T> void in5(T &s,T &t,T &u,T &v,T &w) {rep(i,s.size()){in(s[i],t[i],u[i],v[i],w[i]);}}
void out(){cout << endl;}
template <typename T,class... U> void out(const T &t,const U &...u){cout << t; if(sizeof...(u)) cout << " "; out(u...);}
void die(){cout << endl;exit(0);}
template <typename T,class... U> void die(const T &t,const U &...u){cout << t; if(sizeof...(u)) cout << " "; die(u...);}
template <typename T> void outv(T s) {rep(i,s.size()){if(i!=0)cout<<" ";cout<<s[i];}cout<<endl;}
template <typename T> void out1(T s) {rep(i,s.size()){out(s[i]);}}
template <typename T> void out2(T s,T t) {rep(i,s.size()){out(s[i],t[i]);}}
template <typename T> void out3(T s,T t,T u) {rep(i,s.size()){out(s[i],t[i],u[i]);}}
template <typename T> void out4(T s,T t,T u,T v) {rep(i,s.size()){out(s[i],t[i],u[i],v[i]);}}
template <typename T> void out5(T s,T t,T u,T v,T w) {rep(i,s.size()){out(s[i],t[i],u[i],v[i],w[i]);}}
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
template <typename T> T allSum(vector<T> a){T ans=T();each(it,a)ans+=it;return ans;}
template<typename T> bool inside(T a,T b){auto it=a.begin()-1;each(x,b){it=find(it+1,a.end(),x);if(it==a.end())return false;}return true;}
ll ceilDiv(ll a,ll b) {return (a+b-1)/b;}
ld dist(pair<ld,ld> a, pair<ld,ld> b){return sqrt(abs(a.fi-b.fi)*abs(a.fi-b.fi)+abs(a.se-b.se)*abs(a.se-b.se));} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a,ll b){ return a / gcd(a,b) * b;}
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
#define YES(n) ((n) ? "YES" : "NO" )
#define Yes(n) ((n) ? "Yes" : "No" )
#define yes(n) ((n) ? "yes" : "no" )
int main(){
init();
inl(n);
V<ll> a(n);
in1(a);
V<ll> sum(n+1),sum2(n+1);
rep(i,n)sum[i+1]+=sum[i]+a[i];
rep(i,n)sum2[i+1]+=sum2[i]+sum[i+1];
ll mx=-INF;
rep(i,n){
chmax(mx,a[i]);
ll ans=mx*(i+1)+sum2[i+1];
out(ans);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define F(i,a,b) for(int i=(int)(a);i<=(int)(b);i++)
#define R(i,b,a) for(int i=(int)(b);i>=(int)(a);i--)
#define endl "\n"
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pii pair<int,int>
#define pb push_back
#define all(v) v.begin(),v.end()
#define I first
#define S second
const int N=2e5+7;
long double sa[N],sb[N],tmp;
int32_t main(){
ios;
int n,m,k;
cin>>n>>m>>k;
set <int> con;
F(i,1,k){
int x;
cin>>x;
con.insert(x);
}
if(m<=k){
int f=0;
F(i,1,n){
int cnt=0;
F(j,i,i+m-1) cnt+=(con.find(j)!=con.end());
if(cnt==m) f=1;
}
if(f) return cout<<-1<<endl,0;
}
R(i,n-1,0){
if(con.find(i)==con.end()){
sa[i]=(sa[i+1]-sa[i+m+1])/m;
sb[i]=(sb[i+1]-sb[i+m+1])/m+1;
}
else sa[i]=1;
sa[i]+=sa[i+1];
sb[i]+=sb[i+1];
}
tmp=(sb[0]-sb[1])/(1-(sa[0]-sa[1]));
cout<<setprecision(14)<<tmp<<endl;
}
|
#include<iostream>
#include <stdio.h>
#include<cmath>
#include <bits/stdc++.h>
using namespace std;
int check(int d,int h,int d0,int h0){
int a,b;
if(d%2==1){
a=d/2+1;
}
else{
a=d/2;
}
if(h%2==1){
b=h/2+1;
}
else{
b=h/2;
}
if(d0>a || h0<b){
return 1;
}
return 0;
}
int main()
{
int n,d,h;
cin>>n>>d>>h;
double mini=0.0;
while(n--){
int d0,h0;
cin>>d0>>h0;
double a1=(((h-h0) * (1.0*d))/ (d-d0));
a1=h-a1;
mini=max(mini,a1);
}
cout<<mini<<endl;
return 0;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }
template<class T> inline int sz(T &a) { return a.size(); }
using ll = long long; using ld = long double;
using pi = pair<int,int>; using pl = pair<ll,ll>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
const int inf = numeric_limits<int>::max();
const ll infll = numeric_limits<ll>::max();
int main()
{
int n; cin >> n;
ld D,H; cin >> D >> H;
vector<ld> d(n),h(n);
rep(i,n) cin >> d[i] >> h[i];
ld res = 0;
rep(i,n) {
ld tmp = H + D * (h[i]-H)/(D-d[i]);
tmp = max((ld)0, tmp);
chmax(res, tmp);
}
printf("%.10Lf\n", res);
return 0;
}
|
//khodaya khodet komak kon
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <pii, int> ppi;
typedef pair <int, pii> pip;
typedef pair <pii, pii> ppp;
typedef pair <ll, ll> pll;
# define A first
# define B second
# define endl '\n'
# define sep ' '
# define all(x) x.begin(), x.end()
# define kill(x) return cout << x << endl, 0
# define SZ(x) int(x.size())
# define lc id << 1
# define rc id << 1 | 1
# define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
ll power(ll a, ll b, ll md) {return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md));}
const int xn = 1e2 + 10;
const int xm = - 20 + 10;
const int sq = 320;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const ld eps = 1e-15;
const int mod = 998244353;
const int base = 257;
int n, a[xn], dp[xn][xn * xn], sum, fact[xn], ans;
int main(){
InTheNameOfGod;
fact[0] = 1;
for (int i = 1; i < xn; ++ i)
fact[i] = 1ll * fact[i - 1] * i % mod;
cin >> n;
for (int i = 1; i <= n; ++ i)
cin >> a[i], sum += a[i];
if (sum % 2)
kill(0);
dp[0][0] = 1;
for (int i = 1; i <= n; ++ i)
for (int j = i; j >= 1; -- j)
for (int k = sum / 2; k >= a[i]; -- k)
dp[j][k] = (dp[j][k] + dp[j - 1][k - a[i]]) % mod;
for (int i = 1; i <= n; ++ i)
ans = (ans + 1ll * dp[i][sum / 2] * fact[i] % mod * fact[n - i] % mod) % mod;
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>void read(_Tp &t,Args &...args){read(t);read(args...);}
const int N=105,mod=998244353;
template<typename _Tp1,typename _Tp2>inline void add(_Tp1 &a,_Tp2 b){(a+=b)>=mod&&(a-=mod);}
template<typename _Tp1,typename _Tp2>inline void sub(_Tp1 &a,_Tp2 b){(a-=b)<0&&(a+=mod);}
int f[N][20005],g[N][20005];
long long fac[N];
int main(){
fac[0]=fac[1]=1;for(int i=2;i<N;++i)fac[i]=fac[i-1]*i%mod;
int n;read(n);
f[0][10000]=1;int s=0;
for(int i=1,x;i<=n;++i){
read(x),s=std::min(10000,x+s);
memset(g,0,sizeof(g));
for(int j=0;j<i;++j){
for(int k=10000-s;k<=10000+s;++k){
if(k-x>=0)add(g[j+1][k-x],f[j][k]);
if(k+x<=20000)add(g[j][k+x],f[j][k]);
}
}
memcpy(f,g,sizeof(f));
}
int ans=0;
for(int i=0;i<=n;++i)add(ans,1LL*f[i][10000]*fac[i]%mod*fac[n-i]%mod);
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long llint;
const int maxn = 2e5+10;
const int base = 31337;
const int mod = 1e9+7;
const llint inf = (1LL << 60);
const int logo = 18;
const int off = 1 << logo;
const int treesiz = off << 1;
int n, m;
llint niz[maxn];
llint dp[maxn];
vector< int > graph[maxn];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lld", niz+i);
}
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
graph[b].push_back(a);
}
llint sol = -2*inf;
for (int i = 1; i <= n; i++) {
dp[i] = inf;
for (int j = 0; j < graph[i].size(); j++) {
int tren = graph[i][j];
dp[i] = min(dp[i], dp[tren]);
}
sol = max(sol, niz[i] - dp[i]);
dp[i] = min(dp[i], niz[i]);
}
printf("%lld\n", sol);
return 0;
}
| #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int dx[] = { 0, 1, -1, 0, 1, -1, 1, -1 }; // i<4:4way i<8:8way
int dy[] = { 1, 0, 0, -1, 1, -1, -1, 1 };
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n,m;
cin >> n >> m;
vector<pair<ll,int>> a(n);
vector<ll> b(n); // b[i] := 街iでのコスト
vector<vector<int>> g(n);
rep(i,n){
cin >> a[i].first;
a[i].second = i;
b[i] = a[i].first;
}
rep(i,m){
int x,y;
cin >> x >> y;
x--;y--;
g[x].push_back(y);
}
sort(ALL(a));
vector<bool> used(n);
ll ans = -1e18;
rep(i,n){
ll cost = a[i].first;
queue<int> q;
q.push(a[i].second);
while(!q.empty()){
auto now = q.front();q.pop();
for(auto next:g[now]){
if(used[next])continue;
else{
q.push(next);
used[next] = true;
chmax(ans,b[next] - cost);
}
}
}
}
cout << ans << endl;
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <bitset>
#include <vector>
using namespace std;
const int N = 1e5;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
int t;
cin >> t;
string atcoder = "atcoder";
for (int tests = 0; tests < t; ++tests) {
string s;
cin >> s;
if (s > atcoder) {
puts("0");
continue;
}
bool ok = false;
int ans = 1e9;
for (int i = 0; i < s.length(); ++i) {
if (s[i] > 'a') {
ok = true;
ans = min(ans, i);
}
if (s[i] > 't') {
ans = min(ans, i - 1);
}
}
if (!ok) {
puts("-1");
continue;
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
string s;
cin >> s;
string at = "atcoder";
int ans = 1e9;
int acc = 0;
for (int i = 0; i < at.size(); ++i) {
int posx = -1, posy = -1;
for (int j = i; j < s.size(); ++j) {
if (s[j] == at[i] && posx == -1) posx = j;
if (s[j] > at[i] && posy == -1) posy = j;
}
if (posy != -1) ans = min(ans, acc + posy - i);
if (posx == -1) break;
while (posx != i) {
acc += 1;
swap(s[posx], s[posx-1]);
posx -= 1;
}
}
if (at < s) ans = min(ans, acc);
if (ans < 1e7) cout << ans << endl;
else cout << -1 << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
/*very unique*/
int A,B;
cin>>A>>B;
cout<<max(A/100+(A%100)/10+A%10,B/100+(B%100)/10+B%10)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
//string s;
//vector<int> a;
//vector<int> b;
int main(){
cin >> a >> b;
if(a == b) cout << a << endl;
else if((a == 0 && b == 1) || (a == 1 && b == 0)) cout << 2 << endl;
else if((a == 1 && b == 2) || (a == 2 && b == 1)) cout << 0 << endl;
else if((a == 2 && b == 0) || (a == 0 && b == 2)) cout << 1 << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int lo = 1000000000, hi = 1;
vector<vector<int>> a(n, vector<int>(5));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 5; j++) {
cin >> a[i][j];
lo = min(lo, a[i][j]);
hi = max(hi, a[i][j]);
}
}
int ans = lo;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
vector<int> check(32, 0);
for (int i = 0; i < n; i++) {
int index = 0;
for (int j = 0; j < 5; j++) {
if (a[i][j] >= mid) index += (1 << j);
}
check[index]++;
}
bool good = false;
for (int i = 0; i < 32 && !good; i++) {
if (!check[i]) continue;
check[i]--;
for (int j = i; j < 32 && !good; j++) {
if (!check[j]) continue;
check[j]--;
for (int k = j; k < 32 && !good; k++) {
if (!check[k]) continue;
check[k]--;
bool can = true;
for (int p = 0; p < 5 && can; p++) {
int mask = 1 << p;
if (!(i & mask || j & mask || k & mask))
can = false;
}
if (can)
good = true;
check[k]++;
}
check[j]++;
}
check[i]++;
}
if (good) {
ans = max(ans, mid);
lo = mid + 1;
} else {
hi = mid - 1;
}
}
cout << ans;
} | /*
* @Author: AsilenceBTF
* @LastEditTime: 2020-11-02 19:30:56
*/
#include<bits/stdc++.h>
#define sz(x) int(x.size())
#define ALL(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
const int N = 105;
const double eps = 1e-8;
int x[N], y[N];
int sgn(double x){
if(fabs(x) < eps) return 0;
if(x < 0) return -1;
return 1;
}
struct Point{
double x, y;
Point(double _x = 0, double _y = 0){
x = _x, y = _y;
}
Point operator - (const Point &b)const{
return Point(x - b.x, y - b.y);
}
double operator ^(const Point &b)const{
return x * b.y - y * b.x;
}
};
struct Line{
Point s, e;
Line(){}
Line(Point _s, Point _e){
s = _s;
e = _e;
}
int relation(Point p){
int c = sgn((p - s) ^ (e - s));
if(c < 0) return 1;
else if(c > 0) return 2;
else return 3;
}
};
int main(){
int n, f = 0;
cin >> n;
for(int i = 1; i <= n; ++i) cin >> x[i] >> y[i];
for(int i = 1; i <= n; ++i){
for(int j = i + 1; j <= n; ++j){
for(int k = j + 1; k <= n; ++k){
Line t = Line(Point(x[i], y[i]), Point(x[j], y[j]));
if(t.relation(Point(x[k], y[k])) == 3){
cout << "Yes" << endl;
return 0;
}
}
}
}
cout << "No" << endl;
// system("pause");
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
// BFS
int main(void){
int n, m;
cin >> n >> m;
vector<vector<int>> to(n);
rep(i,m) {
int a, b;
cin >> a >> b;
--a; --b;
to[a].push_back(b);
}
int ans = 0;
rep(sv,n) {
queue<int> q;
vector<int> used(n);
used[sv] = 1; //既に訪れた点は計算しない
++ans;
q.push(sv);
while (q.size()) {
int v = q.front(); q.pop();
//cout << "----" << endl;
for (int u : to[v]) { //範囲列挙 to[0]なら1で行先
//cout << u << endl;
if (used[u]) continue;
++ans;
used[u] = 1;
q.push(u);
}
}
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
vector<int>graph[3000];
bool visited[3000];
long long int dfs(int index){
visited[index] = true;
int cnt = 1;
for (auto i:graph[index])
if (!visited[i])
cnt+=dfs(i);
return cnt;
}
int main(){
int n,m;
cin>>n>>m;
for (int i=0;i<m;i++){
int a,b; cin>>a>>b;
graph[a-1].push_back(b-1);
}
long long int ans = 0;
for (int i=0;i<n;i++){
for (int j=0;j<n;j++) visited[j] = false;
ans+=dfs(i);
}
cout<<ans<<endl;
return 0;
} |
////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
namespace my {
/*汎用*/
template <typename T>
void input_vec(vector<T> &a, ll n) {
assert(a.empty());
for (ll i = 0; i < n; i++) {
T tmp;
cin >> tmp;
a.push_back(tmp);
}
}
template <typename T>
void input_set(set<T> &a, ll n) {
assert(a.empty());
for (ll i = 0; i < n; i++) {
T tmp;
cin >> tmp;
a.insert(tmp);
}
}
char itoc(int i) { return i + '0'; }
int ctoi(char c) { return c - '0'; }
/*整数*/
ll gcd(ll a, ll b) { // O( log(max(a,b)) )
a = abs(a);
b = abs(b);
if (a < b) swap(a, b);
while (b != 0) {
a %= b;
swap(a, b);
}
return a;
}
ll lcm(ll a, ll b) { return a * (b / my::gcd(a, b)); } // O( log(max(a,b)) )
ll modinv(ll n, ll mod) { // O( log(max(n,mod)) )
assert(mod > 0 && my::gcd(n, mod) == 1);
n %= mod;
if (n < 0) n += mod;
ll a = mod, b = n, x = 1, y = 0;
while (b != 0) {
ll q = a / b, r = a % b;
a = b;
b = r;
y -= q * x;
swap(x, y);
}
y %= mod;
if (y < 0) y += mod;
return y;
}
bool is_prime(ll n) { // O( sqrt(n) )
bool flag = true;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
flag = false;
break;
}
}
return flag;
}
vector<pair<ll, ll>> prime_factorize(ll n) { // O( sqrt(n) )
vector<pair<ll, ll>> ret;
for (ll i = 2; i * i <= n; i++) {
if (n % i != 0) continue;
ll exp = 0;
while (n % i == 0) {
n /= i;
exp++;
}
ret.push_back(make_pair(i, exp));
}
if (n != 1) ret.push_back(make_pair(n, 1));
return ret;
}
/*union find*/
class unionfind {
private:
/*根のparの値は「-(その木の要素数)」とする*/
ll n_;
vector<ll> par;
ll root(ll a) { // O( log(n) )
if (par.at(a) < 0)
return a;
else {
par.at(a) = root(par.at(a)); //経路圧縮
return par.at(a);
}
}
public:
unionfind(ll n) : n_(n), par(n, -1) {} // O(n)
void unite(ll a, ll b) { // O( log(n) )
assert(0 <= a && a < n_);
assert(0 <= b && b < n_);
if (root(a) == root(b))
return;
else {
ll ra = root(a), rb = root(b);
if (-par.at(ra) < -par.at(rb)) swap(ra, rb); //サイズによる併合
par.at(ra) += par.at(rb);
par.at(rb) = ra;
}
}
bool is_same(ll a, ll b) { // O( log(n) )
assert(0 <= a && a < n_);
assert(0 <= b && b < n_);
return root(a) == root(b);
}
ll size(ll a) { // O( log(n) )
assert(0 <= a && a < n_);
return -par.at(root(a));
}
};
} // namespace my
////////////////////////////////////////////////
int main() {
ll n, m;
cin >> n >> m;
if ((m != 0 && m == n - 1) || m == n || m < 0) {
cout << -1 << endl;
return 0;
}
vector<pair<ll, ll>> lr;
ll tmpl = 1, tmpr = 2LL * n;
for (ll i = 0; i < n - m - 1; i++) {
lr.push_back(make_pair(tmpl, tmpr));
tmpl++;
tmpr--;
}
for (ll i = tmpl; i + 1 <= tmpr; i += 2) {
lr.push_back(make_pair(i, i + 1));
}
for (auto &lri : lr) cout << lri.first << " " << lri.second << endl;
} | #include<bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
#ifdef LOCAL_EXEC
#else
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif // LOCAL_EXEC
long long int n,i,j,k,x=0,y,z,sum=0;
cin>>n>>k;
long long int cnt[n+1]={0};
for(i=1;i<=n;i++){
cin>>x;
cnt[x]+=1;
}
y=n;
for(i=1;i<=k;i++){
for(j=0;j<=n;j++){
if(cnt[j]==0||y==0)
break;
cnt[j]-=1;
y-=1;
}
sum+=j;
if(y==0)
break;
}
cout<<sum;
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define double long double
#define ff first
#define ss second
#define endl '\n'
#define ii pair<int, int>
#define mp make_pair
#define mt make_tuple
#define DESYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define vi vector<int>
#define vii vector<ii>
#define all(x) x.begin(), x.end()
#define EPS 1e-9
#define INF 1e18
#define ROOT 1
#define curtime chrono::steady_clock::now().time_since_epoch().count
#define rep(i, beg, n, s) for (int i = beg; i < n; i += s)
using ll = long long;
using namespace std;
const double PI = acos(-1);
const int M = 1000000007;
// const int M = 998244353;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int mod(int n, int m = M) {
int ret = n % m;
if (ret < 0) ret += m;
return ret;
}
int exp(int n, int k, int m = M) {
if (k == 0) return 1;
if (k == 1) return n;
int ax = exp(n, k / 2, m);
ax = mod(ax * ax, m);
if (k % 2) ax = mod(ax * n, m);
return ax;
}
int gcd(int a, int b) {
if (a == 0)
return b;
else
return gcd(b % a, a);
}
int solve(const vector<int> &v, const vector<ii> &b, const vector<int> &calc) {
int n = v.size();
int g[n][n];
for (int i = 0; i < n; i++) {
int sum = v[i];
for (int j = i + 1; j < n; j++) {
sum += v[j];
int id = upper_bound(all(b), ii(sum - 1, INF)) - b.begin();
id--;
if (id == -1)
g[i][j] = 0;
else
g[i][j] = calc[id];
}
}
vector<int> d(n, 0);
d[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
d[j] = max(d[j], d[i] + g[i][j]);
}
}
return d[n - 1];
}
//#define MULTIPLE_TEST_CASE
void solution() {
int n, m;
cin >> n >> m;
vector<ii> b(m);
vector<int> calc;
vi v(n);
int mx = -INF, mn = INF;
for (int &x : v) cin >> x, mx = max(mx, x);
for (ii &x : b) cin >> x.ss >> x.ff, mn = min(mn, x.ff);
int ans = INF;
if (mx > mn) {
cout << -1 << endl;
return;
}
vector<int> p(n, 0);
for (int i = 0; i < n; i++) p[i] = i;
sort(all(v));
sort(all(b));
for (ii x : b) {
if (calc.size() == 0)
calc.pb(x.ss);
else
calc.pb(max(calc.back(), x.ss));
}
do {
vector<int> w;
for (int x : p) w.pb(v[x]);
ans = min(ans, solve(w, b, calc));
} while (next_permutation(all(p)));
cout << ans << endl;
}
int32_t main() {
DESYNC;
int t = 1;
#ifdef MULTIPLE_TEST_CASE
cin >> t;
#endif
while (t--) solution();
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,m;
int vdnsddglkdk;
cin>>n>>m;
vector<pair<int,int>>a(m);
for(int i=0;i<m;i++)
{
cin>>a[i].first>>a[i].second;
}
int k;
cin>>k;
vector<pair<int,int>>b(k);
for(int j=0;j<k;j++)
{
cin>>b[j].first>>b[j].second;
}
ll l=0;
ll tot=1<<k;
for(ll mask=0;mask<tot;mask++)
{
vector<int>v(n+1);
ll ans=0;
for(int i=0;i<k;i++)
{
if(mask & (1<<i))
v[b[i].second]=1;
else
v[b[i].first]=1;
}
for(int i=0;i<m;i++)
{
if(v[a[i].first] && v[a[i].second])
ans++;
}
l=max(l,ans);
}
cout<<l<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<vector<int>> c(n,vector<int>(n));
ll sum=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin >> c[i][j];
sum+=(ll)c[i][j];
}
}
if(sum%n!=0){
printf("No\n");
return 0;
}
sum/=n;
vector<int> a(n,2e9),b(n,2e9);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
a[i]=min(a[i],c[i][j]);
b[j]=min(b[j],c[i][j]);
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(a[i]+b[j]<c[i][j]){
printf("No\n");
return 0;
}
}
}
for(int i=0;i<n;i++){
ll psum=0;
for(int j=0;j<n;j++){
psum+=(ll)c[j][(i+j)%n];
}
if(psum!=sum){
printf("No\n");
return 0;
}
}
int mi=1e9;
int k=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(mi>c[i][j]){
mi=c[i][j];
k=j;
}
}
}
b[k]=0;
for(int i=0;i<n;i++){
a[i]=c[i][k];
}
for(int j=0;j<n;j++){
b[j]=c[0][j]-a[0];
}
cout << "Yes" << endl;
for(int i=0;i<n;i++){
cout << a[i] << " ";
}
cout << endl;
for(int i=0;i<n;i++){
cout << b[i] << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
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;}
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr << #x << " = " << (x) << endl;
class UnionFind{
private:
vec<int> p,s;
int cnt;
public:
UnionFind(){}
UnionFind(int N):cnt(N),s(N,1),p(N){
iota(p.begin(),p.end(),0);
}
int find(int x){
if(p[x]==x) return x;
else return p[x] = find(p[x]);
}
void unite(int x,int y){
x = find(x); y = find(y);
if(x==y) return;
if(s[x]>s[y]) swap(x,y);
p[x] = y;
s[y] += s[x];
cnt--;
}
bool is_same_set(int x,int y) {return find(x)==find(y);}
int size(int x) {return s[find(x)];}
int compnents_number(){return cnt;}
};
struct edge{
int s,t,val;
bool operator<(const edge& e)const{
return val<e.val;
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vec<int> X(N+2),Y(N+2);
for(int i=1;i<=N;i++) cin >> X[i] >> Y[i];
vec<edge> E;
for(int i=1;i<=N;i++){
int d = 100-Y[i];
E.push_back({0,i,d*d});
}
for(int i=1;i<=N;i++){
int d = 100+Y[i];
E.push_back({N+1,i,d*d});
}
for(int i=1;i<N;i++) for(int j=i+1;j<=N;j++){
int dx = X[j]-X[i],dy = Y[j]-Y[i];
E.push_back({i,j,dx*dx+dy*dy});
}
double ans = 0;
sort(all(E));
UnionFind uf(N+2);
for(auto& x:E){
ans = sqrt(x.val)/2;
uf.unite(x.s,x.t);
if(uf.is_same_set(0,N+1)) break;
}
cout << fixed << setprecision(10) << ans << "\n";
} |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<cstring>
#include<map>
#include<cmath>
#include<iomanip>
#include<set>
#include<stack>
#include<fstream>
#define inf 2147483647
constexpr int Mod = 998244353;
using namespace std;
long long A, B, C;
int main() {
cin >> A >> B >> C;
if (C % 2) {
if (A >= 0 && B >= 0) {
if (abs(A) < abs(B)) {
cout << "<" << endl;
}
else if (abs(A) > abs(B)) {
cout << ">" << endl;
}
else {
cout << "=" << endl;
}
}
else {
if (A < 0) {
cout << "<" << endl;
}
else if(B<0){
cout << ">" << endl;
}
}
}
else {
if (abs(A) < abs(B)) {
cout << "<" << endl;
}
else if (abs(A) > abs(B)) {
cout << ">" << endl;
}
else {
cout << "=" << endl;
}
}
return 0;
} | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define eb emplace_back
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i, begin, end) for(int i = int(begin); i < int(end); i++)
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T>using numr=std::numeric_limits<T>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1e9;
const ll LLINF = 1e16;
const int mod = 1000000007;
const int mod2 = 998244353;
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) { std::cerr << " " << head; debug_impl(tail...); }
#if DEBUG
#define debug(...)\
do {\
std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\
debug_impl(__VA_ARGS__);\
std::cerr << std::noboolalpha;\
} while (false)
#else
#define debug(...) {}
#endif
template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr>
std::istream& operator>> (std::istream& is, Container& v)
{ for (auto & x : v) { is >> x; } return is; }
template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr >
std::ostream& operator<< (std::ostream& os, Container const& v) {
os << "{";
for (auto it = v.begin(); it != v.end(); it++)
{os << (it != v.begin() ? "," : "") << *it;}
return os << "}";
}
// make_v -> auto a = make_v<int>(n,m)
template< typename T = int64_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 F >
struct FixPoint : F {
FixPoint(F &&f) : F(forward< F >(f)) {}
template< typename... Args >
decltype(auto) operator()(Args &&... args) const {
return F::operator()(*this, forward< Args >(args)...);
}
};
template< typename F >
inline decltype(auto) MFP(F &&f) {
return FixPoint< F >{forward< F >(f)};
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll a,b,c;
cin >> a >> b >> c;
if(c%2==0){
if(abs(a) > abs(b)) cout << '>' << endl;
else if(abs(a) == abs(b)) cout << '=' << endl;
else cout << '<' << endl;
}else{
if(a > b) cout << '>' << endl;
else if(a == b) cout << '=' << endl;
else cout << '<' << endl;
}
} |
#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
inline void chmin(T &a, const T &b) { a = min(a, b); }
template <class T>
inline void chmax(T &a, const T &b) { a = max(a, b); }
template <class T>
inline bool kbit(const T &x, const int &k) { return ((x >> k) & 1LL); }
inline int popcount(const int &n) { return __builtin_popcount(n); }
inline ll popcountll(const ll &n) { return __builtin_popcountll(n); }
inline ll mask(const ll &k) { return (1LL << k) - 1LL; }
template <class T>
void zip(V<T> &v) {
sort(all(v));
v.erase(unique(all(v)), v.end());
}
template <class T>
int lwb(V<T> &v, const T &x) { return lower_bound(all(v), x) - v.begin(); }
template <class T>
int upb(V<T> &v, const T &x) { return upper_bound(all(v), x) - v.begin(); }
void dump() {
cerr << '\n';
}
template <class Head, class... Tail>
void dump(Head &&head, Tail &&...tail) {
cerr << head << (sizeof...(Tail) == 0 ? " " : ", ");
dump(std::move(tail)...);
}
template <class T>
void print(const vector<T> &v) {
for (int i = 0; i < v.size(); i++) cout << v[i] << (i + 1 == v.size() ? '\n' : ' ');
}
template <class T>
void read(vector<T> &v) {
for (int i = 0; i < v.size(); i++) cin >> v[i];
}
constexpr char sp = ' ', newl = '\n';
constexpr int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
constexpr ll INF = (1LL << 60) - 1LL;
constexpr ll MOD = 998244353LL;
//@docs Docs/BinaryIndexedTree.md
template <class T>
struct BinaryIndexedTree {
int n;
vector<T> dat;
BinaryIndexedTree(const int &n) : n(n + 1), dat(n + 1) {}
void add(int k, const T &x) {
for (++k; k < n; k += k & -k) dat[k] += x;
}
T get(int k) {
T res = 0;
for (++k; k > 0; k -= k & -k) res += dat[k];
return res;
}
inline T get(const int &l, const int &r) { //0-indexed [l,r)
return get(r - 1) - get(l - 1);
}
};
//////////////////////////////////////////////INSERT ABOVE HERE
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
V<ll> a(n), b(n);
read(a);
read(b);
map<ll, int> id;
V<V<int>> pos(n + 1);
V<int> is(n + 1);
int idx = 0;
for (int i = 0; i < n; i++) {
a[i] += i;
b[i] += i;
}
V<ll> c = a, d = b;
sort(all(c));
sort(all(d));
if (c != d) {
cout << -1 << newl;
return 0;
}
//転倒数
map<P, int> mp;
map<int, int> cnt;
for (int i = 0; i < n; i++) {
if (!cnt.count(b[i])) {
cnt[b[i]] = 0;
}
cnt[b[i]]++;
mp[P(b[i], cnt[b[i]])] = i;
}
cnt.clear();
V<ll> t(n);
BinaryIndexedTree<ll> bit(n + 10);
ll res = 0;
for (int i = 0; i < n; i++) {
if (!cnt.count(a[i])) {
cnt[a[i]] = 0;
}
cnt[a[i]]++;
t[i] = mp[P(a[i], cnt[a[i]])];
res += bit.get(n + 1) - bit.get(t[i]);
bit.add(t[i], 1);
}
cout << res << newl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
bool comp(string a, string b)
{
string l = a+b;
string m = b+a;
if(l>m)
{
return true;
}
else
return false;
}
int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
int cnt[n+1] = {0};
bool valid = true;
int numbersVisited = 0;
for(int i=0;i<n;i++)
{
int val = arr[i];
if(cnt[val] != 0)
{
valid = false;
break;
}
else
{
cnt[val] = 1;
numbersVisited++;
}
}
if(valid && numbersVisited == n)
{
cout<<"Yes\n";
}
else
cout<<"No\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int n,k;
char s[500];
inline char check(char a,char b){
if(a=='R'&&b=='S')
return a;
if(a=='P'&&b=='R')
return a;
if(a=='S'&&b=='P')
return a;
return b;
}
int main(){
scanf("%d%d",&n,&k);
scanf("%s",s+1);
for(int i=1;i<=k;++i){
for(int j=1;j<=n;++j)
s[j+n]=s[j];
for(int j=1;j<=n;++j)
s[j]=check(s[j*2-1],s[j*2]);
}
printf("%c\n",s[1]);
} | #include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=1;i<=n;i++)
typedef int t;
int d[100010];
int main(){
int a,b,c;
cin>>a>>b>>c;
if(c%2==0){
a=abs(a);
b=abs(b);
}
cout<<(a<b? '<':a>b? '>':'=');
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define fi first
#define se second
#define ll long long
#define tp top()
#define fr front()
#define vi vector<int>
#define sz size()
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define mem(a, b) memset(a, (b), sizeof(a))
#define clr(a) memset(a, 0, sizeof(a))
#define sqr(x) ( (x) * (x) )
#define all(v) v.begin(), v.end()
typedef pair<int, int> pii;
typedef pair<int,pii> pip;
typedef pair<pii,int> ppi;
typedef pair<pii,pii> ppp;
void base(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void solve(){
int n;
cin>>n;
priority_queue<pair<ll, pair<ll,ll>>> pq;
ll suma=0;
rep(i,0,n){
ll a,b;
cin>>a>>b;
suma+=a;
pq.push({2*a+b,{a,b}});
}
ll sumb=0;
int cnt=0;
while(pq.sz){
sumb += pq.tp.se.fi + pq.tp.se.se;
suma -= pq.tp.se.fi;
cnt++;
pq.pop();
// cerr<<cnt<<" "<<suma<<" "<<sumb<<"|n";
if (sumb > suma) break;
}
cout<<cnt<<"\n";
}
int main()
{
base();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}
| #include <cstdio>
#include <cstring>
typedef long long ll;
const int N=300005;
int n,a[N];
ll res;
struct BIT
{
int tr[N],r;
void add(int x){for(++x;x<=n;x+=x&-x)tr[x]++;}
int ask(int x){r=0;for(++x;x;x&=x-1)r+=tr[x];return r;}
}fw;
int main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",a+i);
res+=i-fw.ask(a[i]);
fw.add(a[i]);
}
for(int i=0;i<n;i++)
{
printf("%lld\n",res);
res+=n-a[i]*2-1;
}
return 0;
}
|
// 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 mod){
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,ll mod){
return fastexp(n,mod-2,mod);
}
template <typename T>
void add(T &a, T b, T mod){
a += b;
if(a >= mod)a -= mod;
}
template <typename T>
void sub(T &a, T b, T mod){
a -= b;
if(a < 0)a += mod;
}
template <typename T>
void mul(T &a, T b, T mod){
a *= b;
if(a >= mod)a %= mod;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a,b,c;
cin>>a>>b>>c;
int ans = 1;
// mod = 4;
int z = fastexp(b,c,4ll);
// cout<<z<<"\n";
// mod = 10;
if(a%2 == 0){
int d = 0;
while(a%2 == 0){
a /= 2;
d++;
}
mul(d,z,4ll);
if(d%4 == 0){
ans = 6;
}
else if(d%4 == 1){
ans = 2;
}
else if(d % 4 == 2){
ans = 4;
}
else if(d%4 == 3){
ans = 8;
}
}
if(a % 5 == 0){
while(a % 5 == 0){
a /= 5;
}
mul(ans,5ll,10ll);
}
for(int i = 3;i*i <= a;i += 2){
if(a%i == 0){
int d = 0;
while(a%i == 0){
d++;
a /= i;
}
// cout<<i<<" "<<d<<"\n";
mul(d,z,4ll);
// cout<<d<<"\n";
int temp = fastexp(i,d,10ll);
// cout<<temp<<
mul(ans,temp,10ll);
// cout<<ans<<"\n";
}
}
if(a > 1){
// cout<<a<<"\n";
int d = 1;
// while(a%i == 0){
// d++;
// a /= i;
// }
mul(d,z,4ll);
mul(ans,fastexp(a,d,10ll),10ll);
}
cout<<ans;
// int z = fastexp(b,c);
// mod = 10;
// cout<<fastexp(a,z);
return 0;
} | #include <cstdio>
#define DIV 10000LL
using namespace std;
typedef long long LL;
LL x, y, R;
inline LL read()
{
// Returns: input * 10000.
LL res = 0LL;
int num = 0;
bool flag = false, negative = false;
for(char c=getchar(); c != ' ' && c != '\n'; c=getchar())
{
if(c == '-') negative = true;
else if(c == '.') flag = true;
else
{
res *= 10LL;
res += c - '0';
if(flag) num ++;
}
}
for(int i=num; i<4; i++)
res *= 10LL;
return negative? -res: res;
}
inline LL in_circle(const LL& dx, const LL& dy)
{
return dx * dx + dy * dy <= R * R;
}
inline LL findtop(LL i)
{
i *= DIV;
LL l = y, r = y + R;
while(l < r)
{
LL mid = l + r + 1LL >> 1LL; // l<0?
if(in_circle(i - x, mid - y))
l = mid;
else r = mid - 1LL;
}
return l;
}
inline LL ceildiv(const LL& a)
{
// Returns: ceil(a / DIV).
if(a < 0LL) return a / DIV;
if(a % DIV == 0LL) return a / DIV;
return a / DIV + 1LL;
}
inline LL floordiv(const LL& a)
{
// Returns: floor(a / DIV).
if(a >= 0LL) return a / DIV;
if(a % DIV == 0LL) return a / DIV;
return a / DIV - 1LL;
}
int main()
{
x = read(), y = read(), R = read();
LL ans = 0LL, left = ceildiv(x - R), right = floordiv(x + R);
for(LL i=left; i<=right; i++)
{
LL top = findtop(i);
LL bottom = (y << 1LL) - top;
ans += floordiv(top) - ceildiv(bottom) + 1LL;
}
printf("%lld\n", ans);
return 0;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace __gnu_pbds;
using namespace std;
using ld = long double;
using ll = long long;
int n, m, q, x[200001], y[200001];
pair<int, int> op[200001];
vector<pair<int, int>> que[200001];
pair<ll, ll> ans[200000];
int main(){
//IO("input.txt", "output.txt");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for(int i = 1; i <= n; i++) cin >> x[i] >> y[i];
cin >> m;
for(int i = 1; i <= m; i++){
int typ, p;
cin >> typ;
if(typ < 3) op[i] = make_pair(typ, 0);
else{
cin >> p;
op[i] = make_pair(typ, p);
}
}
cin >> q;
for(int i = 0; i < q; i++){
int a, b;
cin >> a >> b;
que[a].emplace_back(b, i);
}
for(auto i : que[0])
ans[i.second] = make_pair(x[i.first], y[i.first]);
bool rev = false;
ll px = 0, sx = 1, py = 0, sy = 1;
for(int i = 1; i <= m; i++){
if(op[i].first < 3){
if(rev) op[i].first = (op[i].first == 1) ? 2 : 1;
if(op[i].first == 1) sx *= -1, px *= -1;
else sy *= -1, py *= -1;
rev ^= true;
}else{
if(rev) op[i].first = (op[i].first == 3) ? 4 : 3;
if(op[i].first == 3)
px = 2 * op[i].second - px, sx *= -1;
else
py = 2 * op[i].second - py, sy *= -1;
}
for(auto j : que[i]){
pair<ll, ll> res = make_pair(px + sx * x[j.first], py + sy * y[j.first]);
if(rev) swap(res.first, res.second);
ans[j.second] = res;
}
}
for(int i = 0; i < q; i++)
cout << ans[i].first << ' ' << ans[i].second << '\n';
return 0;
}
/*
90 deg clockwise is: (x, y) -> (y, -x)
90 deg counterclockwise is: (x, y) -> (-y, x)
reflection across x = p is: (x, y) -> (2 * p - x, y)
reflection across y = p is: (x, y) -> (x, 2 * p - y)
*/ | #include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
#define rep(i,m,n) for(int (i)=(m);(i)<(n);++(i))
#define rrep(i,m,n) for(int (i)=(n)-1;(i)>=(m);--(i))
#define all(x) (x).begin(),(x).end()
#define out(y,x,h,w) (y)<0||(x)<0||(y)>=(h)||(x)>=(w)
constexpr ll INF = 1LL << 30;
constexpr ll mod = 10007; //(ll)1e9 + 7;
constexpr double PI = 3.1415926535897932;
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;
}
inline void init() {
cin.tie(nullptr); cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
vector<vector<ll>>func(vector<vector<ll>>A, vector<vector<ll>>B) {
vector<vector<ll>>res(vector<vector<ll>>(A.size(), vector<ll>(B[0].size())));
rep(i, 0, res.size()) {
rep(j, 0, res[i].size()) {
ll a = 0;
rep(k, 0, 3) {
a += A[i][k] * B[k][j];
}
res[i][j] = a;
}
}
return res;
}
int main() {
init();
int N; cin >> N;
vector<P>XY(N);
rep(i, 0, N) {
int a, b; cin >> a >> b;
XY[i] = { a,b };
}
int M; cin >> M;
vector<vector<vector<ll>>>O(M, vector<vector<ll>>(3, vector<ll>(3)));
rep(i, 0, M) {
int a;cin >> a;
vector<vector<ll>>A(vector<vector<ll>>(3, vector<ll>(3)));
if (a == 1) {
A = { {0,1,0},
{-1,0,0},
{0,0,1} };
}
if (a == 2) {
A = { {0,-1,0},
{1,0,0},
{0,0,1} };
}
if (a == 3) {
int p; cin >> p;
A = { {-1,0,2 * p},
{0,1,0},
{0,0,1} };
}
if (a == 4) {
int p; cin >> p;
A = { {1,0,0},
{0,-1,2*p},
{0,0,1} };
}
if (i == 0)O[i] = A;
else O[i] = func(A, O[i-1]);
}
int Q; cin >> Q;
rep(i, 0, Q) {
int a, b; cin >> a >> b;
--b;
if (a == 0) {
cout << XY[b].first << " " << XY[b].second << "\n";
}
else {
--a;
vector<vector<ll>>B =
{ {XY[b].first},
{XY[b].second},
{1} };
auto ans = func(O[a], B);
cout << ans[0][0] << " " << ans[1][0] << "\n";
}
}
return 0;
} |
#include<bits/stdc++.h>
#define pb push_back
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define LL long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define int long long
#define sz(x) (ll)(x.size())
using namespace std;
const int mod = 1e9+7;
int expo_pow(int x,int y){
if(y == 0) return 1;
y=y%(mod-1);
x%=mod;
if(y==0) y=mod-1;
int res=1;
while(y){
if(y&1) res=(res*x)%mod;
x=(x*x)%mod;
y>>=1;
}
return res;
}
ll add()
{
return 0;
}
template <typename T, typename... Types>
T add(T var1, Types... var2){
return (((((ll)(var1)) % mod + (ll)(add(var2...))) % mod) + mod) % mod;
}
ll mul(){
return 1;
}
template <typename T, typename... Types>
T mul(T var1, Types... var2){
return (((ll)(var1)) % mod * (ll)(mul(var2...))) % mod;
}
class triplet{
public:
LL a;
LL b;
LL gcd;
};
triplet extended_euclid(LL a,LL b)
{
if(b==0)
{
triplet x;
x.a=1;
x.b=0;
x.gcd=a;
return x;
}
triplet x1=extended_euclid(b,a%b);
triplet x;
x.a=x1.b;
x.b=x1.a-(a/b)*(x1.b);
x.gcd=x1.gcd;
return x;
}
LL mod_inverse(LL a, LL m)
{
LL ans=extended_euclid(a,m).a;
return (ans%m +m )%m;
}
void solve(){
int n,s,k;
cin >> n >> s >> k;
int gcd = __gcd(n,k);
int steps_to_move = n - s;
if (steps_to_move%gcd != 0) {
cout << "-1\n";
return;
}
n /= gcd;
k /= gcd;
steps_to_move /= gcd;
int ans = mod_inverse(k,n);
ans*= steps_to_move;
ans %= n;
ans += n;
ans %= n;
cout << ans << "\n";
}
signed main(){
fast;
int test = 1;
cin>>test;
int i=1;
while(test--){
solve();
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
//const ll mod = 998244353;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(25);
ll t;
cin >> t;
while (t--) {
ll n, a, b;
cin >> n >> a >> b;
if (n - a - b < 0) {
cout << 0 << '\n';
continue;
}
ll ans = ((n - a + 1) * (n - b + 1) - (n - a - b + 1) * (n - a - b + 2) + mod * mod) % mod;
ans = ans * ans % mod;
ans = ((n - a + 1) * (n - a + 1) % mod * (n - b + 1) % mod * (n - b + 1) % mod - ans + mod) % mod;
cout << ans << '\n';
}
return 0;
} |
/*
JAI JAGANNATH!
*/
//@Author : zanj0
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) int x; cin>>x; while(x--)
#define endl "\n"
#define timetaken cerr<<"Time : "<<1000*(long double)clock()/(long double)CLOCKS_PER_SEC<<"ms\n"
void zanj0()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int MAX = 3e6 + 5;
int fac[MAX], finv[MAX];
int inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
int COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int add(int a, int b) {
return ((a % MOD) + (b % MOD)) % MOD;
}
int mul(int a, int b) {
return ((a % MOD) * (b % MOD)) % MOD;
}
int fastPow(int base, int p) {
int ret = 1;
while (p) {
if (p & 1) ret = mul(ret, base);
base = mul(base, base);
p >>= 1;
}
return ret;
}
int sub(int a, int b) {
return (((a % MOD) - (b % MOD)) + MOD) % MOD;
}
void solve() {
int n, m, k;
cin >> n >> m >> k;
COMinit();
if (n > m + k) {
cout << 0 << endl;
} else if (k >= n) {
cout << COM(n + m, n) << endl;
} else {
cout << sub(COM(n + m, n), COM(n + m, m + k + 1)) << endl;
}
}
int32_t main()
{
zanj0();
solve();
timetaken;
return 0;
} | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007LL
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define SHIFT(n) (1LL<<((ll)n))
#define ALL(a) (a).begin(),(a).end()
#define Max(a) (*max_element(ALL(a)))
#define Min(a) (*min_element(ALL(a)))
#define Sum(a) (accumulate(ALL(a),0LL))
using namespace std;
struct Random{
random_device rd;
mt19937 eng;
uniform_int_distribution<ll> distr;
uniform_real_distribution<float> distrf;
Random():eng(rd()),distr(0,INF),distrf(0,1){}
ll nextInt(ll f, ll t){
return (distr(eng)%(t-f+1))+f;
}
double nextDouble(){
return (distrf(eng));
}
vi next_n_int(ll f, ll t, ll n){
set<ll> se;
vi ret;
while(se.size() < n){
se.insert(nextInt(f, t));
}
for(auto a:se){
ret.pb(a);
}
return ret;
}
};
vector<vvi> dist(33,vvi(33, vi(4, INF)));
vector<vvi> cd(33,vvi(33, vi(4, INF)));
Random rnd;
ll vx[4] = {1, 0, -1, 0}, vy[4] = {0, 1, 0, -1};
char nc[4] = {'D', 'R', 'U', 'L'};
ll h = 30, w = 30;
bool check(ll x, ll y){
return x >= 0 && x < h && y >= 0 && y < w;
}
pair<string, ll> make_path(ll si, ll sj, ll ti, ll tj){
priority_queue<pair<pair<ll,string>,pair<ll,ll>>,vector<pair<pair<ll,string>,pair<ll,ll>>>,greater<>>que;
que.push(mp(mp(0,""),mp(si,sj)));
vvi d(33,vi(33,llINF));
d[si][sj] = 0;
while(!que.empty()){
ll ni = que.top().S.F, nj = que.top().S.S;
ll cost = que.top().F.F;
string s = que.top().F.S;
///cout << ni << " " << nj << endl;
que.pop();
if(d[ni][nj] > cost){
continue;
}
if(ni == ti && nj == tj){
return mp(s, cost);
}
for(ll i = 0;i < 4; i++){
ll nx = ni + vx[i], ny = nj + vy[i];
if(check(nx, ny)){
if(d[nx][ny] > cost + dist[ni][nj][i]){
d[nx][ny] = cost + dist[ni][nj][i];
que.push(mp(mp(d[nx][ny], s+nc[i]),mp(nx, ny)));
}
}
}
}
}
void solve(){
cin.tie(0);
ios::sync_with_stdio(false);
ll q = 1000;
while(q--){
ll si, sj, ti, tj;
cin >> si >> sj >> ti >> tj;
pair<string, ll> path = make_path(si, sj, ti, tj);
cout << path.F << endl;
flush(cout);
ll cost;
cin >> cost;
ll pcost = path.S;
ll D = rnd.nextInt(100, 2000);
ll x = si, y = sj;
ll sum = 0, cnt = 0, nokori = cost - pcost;
ll psize = path.F.size();
ll gap = nokori/psize;
for(auto c:path.F){
//DRUL
if(c == 'U'){
dist[x][y][2] = dist[x-1][y][0] = max(1000+D, dist[x][y][2] + gap);
x--;
}else if(c == 'D'){
dist[x][y][0] = dist[x+1][y][2] = max(1000+D, dist[x][y][0] + gap);
x++;
}else if(c == 'R'){
dist[x][y][1] = dist[x][y+1][3] = max(1000+D, dist[x][y][1] + gap);
y++;
}else{
dist[x][y][3] = dist[x][y-1][1] = max(1000+D, dist[x][y][3] + gap);
y--;
}
}
}
return;
}
int main(){
solve();
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,m,n) for (int i = (m); i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; --i)
#define RREP(i,m,n) for (int i = (n)-1; i >= (m); ++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long int;
using vec = vector<ll>;
using P = pair<int,int>;
const int INF = 1e9+7;
int main() {
int n, qq; cin >> n >> qq;
vec a(n), b(n);
rep(i,n) cin >> a[i];
sort(all(a));
b[0] = a[0]-1;
REP(i,1,n) {
b[i] = a[i] - a[i-1] - 1 + b[i-1];
}
rep(q,qq) {
ll k; cin >> k;
if (k <= b[0]) {
cout << k << endl;
continue;
}
int j = upper_bound(all(b), k-1) - b.begin() - 1;
cout << k - b[j] + a[j] << endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define mem(x,y) meset(x,y,sizeof(x))
ll len = 1e10;
string pat = "110";
int main()
{
ll i,j,k,s,d,r,m,n,l;
cin>>n;
string line;
cin>>line;
if(n==1)
{
if(line=="0") cout<<len<<endl;
else cout<<2*len<<endl;
return 0;
}
if(line[0]=='1' && line[1]=='1') j = 0;
else if(line[0]=='1' && line[1]=='0') j = 1;
else j = 2;
for(i=0, d=0; i<n; i++, j++)
{
j = j%3;
if(line[i] != pat[j]) d++;
}
if(d)
{
cout<<"0\n";
return 0;
}
for(i=0, s=0; i+2<n; i++)
{
if(line[i]==pat[0] && line[i+1]==pat[1] && line[i+2]==pat[2]) s++;
//cout<<(line[i]==pat[0]) <<" "<< (line[i+1]==pat[1]) <<" "<< (line[i+2]==pat[2])<<endl;
}
if(line[0]!='1' || line[1]!='1') s++;
if(line[n-1] != '0') s++;
cout<<len-s+1<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(lli i = a; i < b; i++)
#define lli long long int
#define ld long double
#define all(v) v.begin(), v.end()
#define hell 1000000000000000
#define pb push_back
#define pf push_front
#define vi vector<lli>
#define vip vector<pair<lli, lli>>
#define F first
#define S second
#define pi 2*acos(0.0)
#define sz(s) s.size()
#define atmod (1000000000+7)
#define mod 998244353
// auto _C=clock();
/*
lli n = 10000000;
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
vector<bool> p(n + 1, true);
void sieve()
{
for (long long int i = 2; i * i <= n; i++)
{
if (p[i])
{
for (long long int j = i + i; j <= n; j = j + i)
{
p[j] = false;
}
}
}
}
*/
/*
WINNERS NEVER QUIT AND QUITTERS NEVER WIN!!
Falling down is an accident, Staying down is a choice.
*/
/*
lli binpow(lli a, lli n,lli m)
{
lli r = 1;
a %=m ;
while (n > 0)
{
if (n & 1)
{
r = (r * a)%m ;
}
a = (a * a)%m ;
n = n / 2;
}
return r;
}
*/
/*bool cmp(pair<lli,lli> a,pair<lli,lli> b)
{
if(a.F<b.F) return 1;
else if(a.F==b.F) return(a.S>b.S);
else return 0;
}*/
void solve()
{
lli h,w;
cin>>h>>w;
vector<vector<lli>> g(h+1,vector<lli>(w+1,0));
vector<vector<lli>> dp(h+1,vector<lli>(w+1,0));
// max differnce between the score of the player 1 and player 2 if currently player 1 is moving
rep(i,1,h+1)
{
rep(j,1,w+1)
{
char c;
cin>>c;
if(c == '+')
{
g[i][j] = 1;
}
else
{
g[i][j] = -1;
}
}
}
for(lli i = h;i >= 1; i--)
{
for(lli j = w;j >= 1; j--)
{
if(i==h&&j==w)
{
dp[i][j]=0;
}
else if(i==h)
{
dp[i][j] = g[i][j+1] - dp[i][j+1];
}
else if(j==w)
{
dp[i][j] = g[i+1][j] - dp[i+1][j];
}
else
{
dp[i][j] = max( g[i][j+1]-dp[i][j+1] , g[i+1][j]-dp[i+1][j] );
}
}
}
if(dp[1][1]>0)
{
cout<<"Takahashi";
}
else if(dp[1][1]<0)
{
cout<<"Aoki";
}
else
{
cout<<"Draw";
}
}
int main()
{
// ios_base::sync_with_stdio(false);
// cin.tie(0);
// cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
// sieve();
lli t = 1;
// cin >> t;
rep(i,1,t+1)
{
solve();
}
// cerr<<"\n\n\nTime elapsed: ";
// cout<<"\n"<<(double)(clock()-_C)*1000.0/CLOCKS_PER_SEC<<"ms\n";
}
| #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;}
ll gcd(ll a,ll b){
return b==0?a:gcd(b,a%b);
}
const int L=72;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll A,B;
cin>>A>>B;
vector<ll> v;
for(ll i=A;i<=B;i++) v.push_back(i);
int V=v.size();
vector<int> is_prime(L+1,1);
is_prime[0]=0;
is_prime[1]=0;
for(int i=2;i<=L;i++){
if(is_prime[i]==0) continue;
for(int j=2;i*j<=L;j++) is_prime[i*j]=0;
}
vector<int> primes;
for(int i=2;i<=L;i++) if(is_prime[i]) primes.push_back(i);
int P=primes.size();
vector<vector<ll>> dp(V+1,vector<ll> (1<<P,0));
dp[0][0]=1;
for(int i=0;i<V;i++){
for(int j=0;j<(1<<P);j++){
ll value=dp[i][j];
if(value==0) continue;
dp[i+1][j]+=value;
{
int state=0;
rep(k,P) if(v[i]%primes[k]==0) state+=(1<<k);
if((j&state)==0) dp[i+1][j^state]+=value;
}
}
}
ll ans=0;
rep(j,(1<<P)) ans+=dp[V][j];
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for (int i = 0; i < N; i++) cin >> A.at(i);
for (int i = 0; i < M; i++) cin >> B.at(i);
vector<vector<int>> DP(N + 1, vector<int>(M + 1));
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= M; j++) {
if (i == 0 || j == 0) DP.at(i).at(j) = i + j;
else if (A.at(i - 1) == B.at(j - 1)) {
DP.at(i).at(j) = min(min(DP.at(i - 1).at(j) + 1,
DP.at(i).at(j - 1) + 1),
DP.at(i - 1).at(j - 1));
}
else {
DP.at(i).at(j) = min(min(DP.at(i - 1).at(j) + 1,
DP.at(i).at(j - 1) + 1),
DP.at(i - 1).at(j - 1) + 1);
}
}
}
cout << DP.at(N).at(M) << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define lli long long int
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define pll pair<lli,lli>
#define ve vector<lli>
#define vep vector<pair<lli,lli> >
#define fr(i,a,n) for(lli i=a;i<(n);i++)
#define frj(j,a,n) for(lli j=a;j<(n);j++)
#define frx(i,a,n) for(lli i=a;i>(n);i--)
#define frxj(j,a,n) for(lli j=a;j>(n);j--)
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define db(x) cout << "[ " << x << " ]" << endl
#define db2(x,y) cout<<x<<" "<<y<<endl
#define dbarr(arr,a,n) fr(i,a,n) cout<<arr[i]<<" "; cout<<endl
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
lli dp[1005][1005],a[1005],b[1005];
lli edit(lli i,lli j){
if(i==0)return j;
if(j==0)return i;
if(dp[i][j]!=-1)return dp[i][j];
if(a[i]==b[j]){
dp[i][j]=edit(i-1,j-1);
}
else{
dp[i][j]=1+min(edit(i-1,j-1),min(edit(i-1,j),edit(i,j-1)));
}
return dp[i][j];
}
void solve(){
memset(dp,-1,sizeof(dp));
lli n,m;
cin>>n>>m;
fr(i,1,n+1)cin>>a[i];
fr(i,1,m+1)cin>>b[i];
cout<<edit(n,m);
}
int main(){
fast;
lli t=1;
// cin>>t;
while(t--){
solve();
}
}
|
//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " << (x) << endl; \
}
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) (((n) >> (k)) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b;
return 1;
} else
return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return 1;
} else
return 0;
}
void Yes(bool flag = true) {
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void No(bool flag = true) {
Yes(!flag);
}
void YES(bool flag = true) {
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void NO(bool flag = true) {
YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = true;
} // namespace mydef
using namespace mydef;
#define pb push_back
//#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans
int H, W;
void solve() {
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> H >> W;
int SUM = 0, MIN = INF;
for (int i = 0; i < H * W; i++) {
int x;
cin >> x;
chmin(MIN, x);
SUM += x;
}
cout << SUM - MIN * H * W << endl;
solve();
return 0;
}
| // Problem: F - Range Xor Query
// Contest: AtCoder - AtCoder Beginner Contest 185
// URL: https://atcoder.jp/contests/abc185/tasks/abc185_f
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
//
// Author: masked_huh
// Created: 13/12/2020 18:24
/*Success isn't permanent, failure isn't fatal,
it's the courage to continue that counts.*/
#include<bits/stdc++.h>
using namespace std;
#define pfin(a) printf("%d\n",a);
#define pfln(a) printf("%lld\n",a);
#define pfis(a) printf("%d ",a);
#define pfls(a) printf("%lld ",a);
#define sfi(a) scanf("%d",&a);
#define sfl(a) scanf("%lld",&a);
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define f(i,a,b) for(int i=a;i<b;i++)
#define pb(a) push_back(a);
#define mp(a,b) make_pair(a,b)
typedef long long ll;
#define F first
#define S second
#define vi vector<int>
#define vc vector<char>
const ll mod=1e9+7;
const int N=300001;
int arr[N];
int tree[4*N];
void build(int node,int start,int end)
{
if(start==end)
{
tree[node]=arr[start];
return;
}
int mid=(start+end)/2;
build(2*node,start,mid);
build(2*node+1,mid+1,end);
tree[node]=tree[2*node]^tree[2*node+1];
return;
}
void update(int node,int start,int end,int idx,int val)
{
if(start==end)
{
arr[idx]^=val;
tree[node]^=val;
return;
}
int mid=(start+end)/2;
if(start<=idx && idx<=mid)
update(2*node,start,mid,idx,val);
else
update(2*node+1,mid+1,end,idx,val);
tree[node]=tree[2*node]^tree[2*node+1];
return;
}
int query(int node,int start,int end,int l, int r)
{
if(start>r||end<l)
return 0;
if(start>=l&&end<=r)
return tree[node];
int mid=(start+end)/2;
int val1=query(2*node,start,mid,l,r);
int val2=query(2*node+1,mid+1,end,l,r);
return (val1^val2);
}
void solve()
{
int n,q;
sfi(n)
sfi(q)
f(i,1,n+1)
sfi(arr[i])
build(1,1,n);
while(q--)
{
int t,x,y;
sfi(t)
sfi(x)
sfi(y)
if(t==1)
{
update(1,1,n,x,y);
}
else
{
int ans=query(1,1,n,x,y);
pfin(ans)
}
}
return;
}
int main()
{
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MOD = (int)1e9 + 7;
const int NS = (int)104;
int N, k;
char s[NS];
char dlr[NS][NS];
char dp[NS][NS][NS];
int tpow[NS];
char get(char A, char B){
if(A == B){
return A;
}
if(A == 'R' && B == 'S') return A;
if(A == 'P' && B == 'R') return A;
if(A == 'S' && B == 'P') return A;
return B;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> k;
cin >> s;
tpow[0] = 1;
for(int i = 1; i < NS; ++i){
tpow[i] = tpow[i - 1] * 2 % N;
}
for(int i = 0; (1 << i) <= N; ++i){
for(int l = 0; l + (1 << i) - 1 < N; ++l){
int r = l + (1 << i) - 1;
int mid = (l + r) >> 1;
if(!i){
dlr[l][r] = s[l];
}
else{
dlr[l][r] = get(dlr[l][mid], dlr[mid + 1][r]);
}
}
}
for(int i = 1; i <= k; ++i){
for(int l = 0; l < N; ++l){
for(int r = 0; r < N; ++r){
int mid = (l + tpow[i - 1] - 1 + N) % N;
char lw, rw;
if(i <= 20 && l + (1 << (i - 1)) - 1 <= mid){
lw = dlr[l][mid];
}
else{
lw = dp[i - 1][l][mid];
}
if(i <= 20 && (mid + 1) % N + (1 << (i - 1)) - 1 <= r){
rw = dlr[(mid + 1) % N][r];
}
else{
rw = dp[i - 1][(mid + 1) % N][r];
}
// cout << i << ' ' << l << ' ' << r << ' ' << lw << ' ' << rw << endl;
dp[i][l][r] = get(lw, rw);
}
}
}
if(k <= 20 && (1 << k) <= N){
cout << dlr[0][(1 << k) - 1];
}
else{
cout << dp[k][0][(tpow[k] - 1 + N) % N];
}
return 0;
}
| /*
@author : ashnove
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define lld long double
#define F first
#define S second
#define Th third
#define endl "\n"
#define nl cout<<endl;
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define what_is(x) cerr << #x << " is " << x << endl;
#define mat vector<vector<ll>>
mat cn(ll n, ll m) {return vector< vector<ll> >(n, vector<ll>(m));}
bool comp1(char &s1, char &s2) {return s1 > s2;}
bool comp2(const pair<ll, pair<ll, ll>> &a, const pair<ll, pair<ll, ll>> &b) {
if (a.first > b.first ) return 1;
if ( a.first == b.first && a.S.S > b.S.S ) return 1;
return 0;
}
class Pair { public: ll first, second;};
bool comp3(const Pair &a, const Pair &b) {
if (a.F > b.F) return 1;
return 0;
}
class Trips { public: ll first, second, third;};
bool comp4(const Trips &a, const Trips &b) {
if (a.Th > b.Th) return 1;
return 0;
}
ll const mod = 1e9 + 7;
ll const inf = 1e18;
ll const maxn = 2e5 + 1;
ll f[maxn];
void fact(){
f[0] =1;
for(ll i = 1; i < maxn; i++)
f[i] = (f[i-1] * i)%mod;
}
bool isValid(ll i, ll j, ll n,ll m){
return (1<=i&&i<=n && 1<=j&&j<=m);
}
void solve()
{
ll n; cin >> n;
ll m; cin >> m;
string a[n];
f(i,0,n) cin >> a[i];
map<ll,ll> cnt;
vector<ll> vv;
ll o= 0, eve = 0;
f(i,0,n){
ll sum = 0;
f(j,0,m) sum += a[i][j]-'0';
vv.pb(sum);
// cout << sum << endl;
cnt[sum]++;
if(sum&1) o++; else eve++;
}
ll ans = 0;
for(ll i = 0; i < n-1; i++){
// cout << cnt[vv[i]] << endl;
// cnt[vv[i]]--;
if(vv[i]&1)o--; else eve--;
if(vv[i]&1)
ans += eve;
else ans += o;
}
cout << ans << endl;
}
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
/**/
// fact();
ll tt = 1;
// cin >> tt;
f(testcases, 0, tt) {
// cout << "Case #" <<testcases+1<<": ";
solve();
}
// printf("TIME: %.3lf\n", double(clock()) / CLOCKS_PER_SEC);
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 Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int h, w, n, m;
cin >> h >> w >> n >> m;
vector<vector<int>> field(h, vector<int>(w, 0));
rep(i,0,n) {
int a, b;
cin >> a >> b;
field[a-1][b-1] = 1;
}
rep(i,0,m) {
int c, d;
cin >> c >> d;
field[c-1][d-1] = 2;
}
rep(i,0,h) {
bool ok = false;
rep(j,0,w) {
if (field[i][j] == 1) {
ok = true;
} else if (field[i][j] == 2) {
ok = false;
} else {
if (ok) field[i][j] = 3;
}
}
ok = false;
rrep(j,w,0) {
if (field[i][j] == 1) {
ok = true;
} else if (field[i][j] == 2) {
ok = false;
} else {
if (ok) field[i][j] = 3;
}
}
}
rep(j,0,w) {
bool ok = false;
rep(i,0,h) {
if (field[i][j] == 1) {
ok = true;
} else if (field[i][j] == 2) {
ok = false;
} else {
if (ok) field[i][j] = 3;
}
}
ok = false;
rrep(i,h,0) {
if (field[i][j] == 1) {
ok = true;
} else if (field[i][j] == 2) {
ok = false;
} else {
if (ok) field[i][j] = 3;
}
}
}
int ans = 0;
rep(i,0,h) rep(j,0,w) {
if (field[i][j] == 1 || field[i][j] == 3) ans++;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
#define DAU ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
const int dx[] {1, -1, 0, 0};
const int dy[] {0, 0, 1, -1};
char mat[2002][2002];
int dp[2002][2002], n, m, x, y, xv, yv;
pair<int, int> stop, curr;
vector<pair<int, int>> telep[30];
queue<pair<int, int>> q;
inline bool Inside(int a, int b) {
return (1 <= a && a <= n && 1 <= b && b <= m);
}
int32_t main() {
DAU
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> (mat[i] + 1);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) {
dp[i][j] = 1e9;
if (mat[i][j] == 'S') {
q.emplace(i, j);
dp[i][j] = 0;
}
else if (mat[i][j] == 'G')
stop = {i, j};
else if ('a' <= mat[i][j] && mat[i][j] <= 'z')
telep[mat[i][j] - 'a'].emplace_back(i, j);
}
while (!q.empty()) {
tie(x, y) = q.front();
q.pop();
for (int dir = 0; dir < 4; ++dir) {
xv = x + dx[dir];
yv = y + dy[dir];
if (Inside(xv, yv) && mat[xv][yv] != '#' && dp[xv][yv] > dp[x][y] + 1) {
dp[xv][yv] = dp[x][y] + 1;
q.emplace(xv, yv);
}
}
if(mat[x][y] >= 'a' && mat[x][y] <= 'z') {
int val = mat[x][y] - 'a';
while (!telep[val].empty()) {
int xv = telep[val].back().first,
yv = telep[val].back().second;
telep[val].pop_back();
if(dp[xv][yv] > dp[x][y] + 1) {
dp[xv][yv] = dp[x][y] + 1;
q.emplace(xv, yv);
}
}
}
}
tie(x, y) = stop;
if (dp[x][y] == 1e9)
dp[x][y] = -1;
cout << dp[x][y];
PLEC
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
//const int MAX=INT_MAX;
const ll MAX=100000000000;
const int mod = 1000000007;
//const int mod = 998244353;
int main(){
int N;
cin>>N;
ll T;
cin>>T;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin>>A[i];
}
int M=N/2;
vector<ll> A1;
vector<ll> A2;
for(int i=0;i<(1<<M);i++){
int bit[22];
ll sum=0;
for(int j=0;j<M;j++){
int Div=(1<<j);
bit[j]=(i/Div)%2;
}
for(int j=0;j<M;j++){
sum+=A[j]*bit[j];
}
//cout<<sum<<endl;
A1.push_back(sum);
}
for(int i=0;i<(1<<(N-M));i++){
int bit[22];
ll sum=0;
for(int j=0;j<N-M;j++){
int Div=(1<<j);
bit[j]=(i/Div)%2;
}
for(int j=0;j<N-M;j++){
sum+=A[j+M]*bit[j];
}
//cout<<sum<<endl;
A2.push_back(sum);
}
sort(A1.begin(),A1.end());
sort(A2.begin(),A2.end());
/*
for(ll i=0;i<A1.size();i++){
cout<<A1[i]<<" ";
}
cout<<endl;
for(ll i=0;i<A2.size();i++){
cout<<A2[i]<<" ";
}
cout<<endl;
*/
ll ans=0;
for(ll i=0;i<A2.size();i++){
if(T-A2[i]<0){
break;
}
auto itr=lower_bound(A1.begin(),A1.end(),T-A2[i]);
// cout<<*itr<<":"<<T-A2[i]<<":"<<distance(A1.begin(),itr)<<endl;
if(itr==A1.end()){
itr=prev(itr);
//cout<<"prev"<<*itr<<endl;
ans=max(*itr+A2[i],ans);
}else if((*itr)+A2[i]==T){
ans=T;
break;
}else{
if(itr!=A1.begin()){
itr=prev(itr);
ans=max(*itr+A2[i],ans);
}else{
ans=max(A2[i],ans);
}
}
}
cout<<ans<<endl;
} | #include <algorithm>
#include <iostream>
int n, t, ans, a[45];
long long suf[45];
void dfs(int k, long long sum) {
if(k > n) return;
if(t - sum > ans)
ans = t - sum;
else if(t - sum + suf[k + 1] <= ans)
return;
if(!sum) {
printf("%lld", t);
exit(0);
}
if(sum - a[k + 1] >= 0) dfs(k + 1, sum - a[k + 1]);
dfs(k + 1, sum);
}
const bool cmp(int x, int y) {
return x > y;
}
int main() {
scanf("%d%d", &n, &t);
for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
std::sort(a + 1, a + n + 1, cmp);
for(int i = n; i >= 1; i--) suf[i] = suf[i + 1] + a[i];
dfs(0, t);
printf("%lld", ans);
return 0;
} |
#include <bits/stdc++.h>
const long long base = 2000000000ll;
const long long ten[6] = {1ll, 10ll, 100ll, 1000ll, 10000ll, 100000ll};
using namespace std;
long long str2ll(string str) {
long long ret = 0;
bool fp = false;
int f = 0;
for (int i = 0; i < (int)str.size(); i++) {
if (str[i] == '-') continue;
else if (str[i] == '.') {
fp = true;
ret *= ten[4];
} else if (fp) {
ret += ten[3 - f] * (str[i] - '0');
++f;
} else {
ret *= 10;
ret += str[i] - '0';
}
}
if (!fp) ret *= ten[4];
return ret;
}
long long sqroot(long long x) {
long long ok = 0, ng = 2000000000ll;
while (ng - ok > 1) {
long long mid = (ok + ng) >> 1;
(mid * mid <= x ? ok : ng) = mid;
}
return ok;
}
int main() {
long long X, Y, R;
string X_str, Y_str, R_str;
cin >> X_str >> Y_str >> R_str;
X = str2ll(X_str) + base;
Y = str2ll(Y_str) + base;
R = str2ll(R_str);
long long ans = 0;
for (long long x = (X - R) / ten[4] * ten[4] - ten[4]; x <= (X + R) / ten[4] * ten[4] + ten[4]; x += ten[4]) {
if (R * R - (x - X) * (x - X) < 0) continue;
long long s = sqroot(R * R - (x - X) * (x - X));
ans += (Y + s) / ten[4] - (Y - s - 1) / ten[4];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define fr first
#define sc second
#define mk make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
const int inf = 1e9 + 7;
const int N = 1e6 + 5;
void solve() {
ll b, c, ans = 1;
cin >> b >> c;
if (b != 0 && c > 0) ans ++;
if (b < 0) {
ans += c / 2;
ans += (c - 1) / 2;
ans += min(abs(b), (c - 1) / 2);
ans += min(abs(b), (c - 2) / 2);
if (abs(b) <= (c - 2) / 2) ans --;
} else if (b == 0) {
ans += c / 2;
ans += (c - 1) / 2;
} else {
ans += min(b, c / 2);
if ((c - 1) / 2 >= b) ans --;
ans += min(b, (c - 1) / 2);
ans += (c - 1) / 2;
ans += (c - 2) / 2;
}
cout << ans << endl;
}
int main() {
int tests = 1;
// cin >> tests;
while (tests --)
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N = 0;
long long cnt = 0;
long long cmb = 0;
cin >> N;
vector<long long> A(N);
vector<long long> B(N);
for(int i=0; i<N; i++){
cin >> A.at(i);
B.at(i) = A.at(i) % 200;
}
for(int j=0; j<200; j++){
cmb = 0;
for(int i=0; i<N; i++){
if(j == B.at(i)) cmb++;
}
if(cmb>0)cnt = cnt + cmb*(cmb-1)/2;
}
cout << cnt << endl;
} | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author NikuKyabe
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#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 = (b) - 1; i >= (a); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001l
#define MOD 1000000007
#define fcout cout << fixed << setprecision(12)
using namespace std;
typedef pair<int, int> P;
class comb_n{
private:
void comb_num(int n, int k, int ans = 0, int i = 0){
if(i == k){
_comb = ans;
return;
}
if(i == 0){
comb_num(n, k, ans + n, i+1);
}
else{
comb_num(n, k, ans * (n - i) / (i + 1), i+1);
}
return;
}
public:
int _comb;//この値を使う
comb_n(int n, int k){
comb_num(n, k);
}
};
class CRingosFavoriteNumbers2 {
public:
void solve(std::istream& cin, std::ostream& cout) {
int n;
cin >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
map<int, int> m;
REP(i,n){
m[a[i]%200]++;
}
int ans = 0;
for(auto itr = m.begin(); itr != m.end(); itr++){
auto cn = comb_n(itr->second, 2);
ans += cn._comb;
}
cout << ans << endl;
}
};
signed main() {
CRingosFavoriteNumbers2 solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define asort(a,n) sort(a,a+n)
#define vsort(v) sort(v.begin(),v.end())
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 1000000007
#define LL_MAX LLONG_MAX
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
//********************************* mekch ************************************//
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
/*
for(i=0;i<n;i++)
{
cout<<c[i] ;
cout<<"--->"<<d[i]<<endl;
}
for(i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
*/
int main()
{
run;
ll n;
cin>>n;
if(n>=0)
cout<<n;
else
cout<<0;
} | #include<iostream>
#include<utility>
#include<vector>
#include<climits>
#include<set>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
char ch1,ch2,ch3;
cin>>ch1>>ch2>>ch3;
if(ch1==ch2 && ch1==ch3) cout<<"Won\n";
else cout<<"Lost\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
void solve(long long N){
cout << ((N - 1) / 100) + 1 << endl;
}
int main(){
long long N;
scanf("%lld",&N);
solve(N);
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
const int MOD = 1000000007;
#define PI = acos(-1)
using namespace std ;
int main(){
fastio ;
int n ;
cin >> n ;
int ans = n/100;
if(n % 100) ans++;
cout << ans ;
}
|
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 1] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}
#define print(a) cout << a << endl;
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;}
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define pb push_back
#define fi first
#define se second
#define vi vector <int>
#define pi pair <int, int>
#define vpi vector <pi>
#define vvi vector <vi>
#define setprec cout << fixed << showpoint << setprecision(20);
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int power (int a, int b = mod - 2)
{
int res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
//cp-algo
int gcd(int a, int b, int& x, int& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int x1, y1;
int d = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
bool find_any_solution(int a, int b, int c, int &x0, int &y0, int &g) {
g = gcd(abs(a), abs(b), x0, y0);
if (c % g) {
return false;
}
x0 *= c / g;
y0 *= c / g;
if (a < 0) x0 = -x0;
if (b < 0) y0 = -y0;
return true;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
read(t);
while (t--)
{
readc(n, s, k);
int x, y, g;
bool status = find_any_solution(n, -k, s, x, y, g);
if (!status) {cout << -1 << endl; continue;}
n /= g;
int z = y/n, ans = inf;
if (y - z*n > 0) ans = min(ans, y - z*n);
if (y - (z - 1)*n > 0) ans = min(ans, y - (z - 1)*n);
print(ans);
}
}
| #include <bits/stdc++.h>
using namespace std;
using TLT = tuple<long long, long long, long long>;
//{a, b} -> {g, x, y} : ax+by=g=gcd(a,b)
TLT extgcd(const long long a, const long long b) {
if (b == 0) return make_tuple(a, 1, 0);
else {
TLT ret = extgcd(b, a%b);
return make_tuple(get<0>(ret), get<2>(ret), get<1>(ret)-a/b*get<2>(ret));
}
}
//solve Ax = b (mod m)
long long solver (long long a, long long b, long long m){
long long x, y, g;
tie(x, y, g) = extgcd(a, b);
if(b % m) return -1;
else {
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int t;
cin >> t;
while(t--){
int n, s, k;
cin >> n >> s >> k;
long long x, y, g;
tie(g, x, y) = extgcd(k, n);
if(s % g) cout << -1 << endl;
else {
s /= g;
n /= g;
x *= (-s);
cout << (x%n+n)%n << endl;
}
//kx = -s (mod n)
//(k/g)x = -(s/g)
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
vector<int> a(10,0),b(10.0),c(10,0);
int f(int i){
int S=0;
for(int j=1;j<=9;j++){
if(j!=i) S+=j*(int)pow(10,b.at(j));
else S+=j*(int)pow(10,b.at(j)+1);
}
return S;
}
int g(int i){
int S=0;
for(int j=1;j<=9;j++){
if(j!=i) S+=j*(int)pow(10,c.at(j));
else S+=j*(int)pow(10,c.at(j)+1);
}
return S;
}
int main(){
int64_t k,cnt1,cnt2=0;
string s,t;
cin >> k >> s >> t;
cnt1=(9*k-8)*(9*k-9);
int S,T;
for(int i=0;i<4;i++){
int x=s.at(i)-'0',y=t.at(i)-'0';
a.at(x)++; b.at(x)++;
a.at(y)++; c.at(y)++;
}
for(int i=1;i<=9;i++){
if(a.at(i)+1>k) continue;
for(int j=1;j<=9;j++){
if(a.at(j)+1>k || (i==j && a.at(j)+2>k)) continue;
S=f(i),T=g(j);
if(S>T){
if(i!=j) cnt2+=(k-a.at(i))*(k-a.at(j));
else cnt2+=(k-a.at(i))*(k-a.at(j)-1);
}
}
}
long double d=(long double)cnt2/(long double)cnt1;
cout << fixed << setprecision(12);
cout << d << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <numeric>
using namespace std;
using ll = int64_t;
ll score(string S){
vector<ll> cnt(10);
iota(cnt.begin(), cnt.end(), 0);
for(char c : S) cnt[c - '0'] *= 10;
return accumulate(cnt.begin(), cnt.end(), 0);
}
int main(){
ll K;
string S, T;
cin >> K >> S >> T;
vector<ll> cnt(10, K);
for(char c : S + T) cnt[c - '0']--;
ll win = 0;
for(ll x = 1; x <= 9; x++) for(ll y = 1; y <= 9; y++){
S.back() = '0' + x;
T.back() = '0' + y;
if(score(S) <= score(T)) continue;
win += cnt[x] * (cnt[y] - (x == y));
}
const ll rem = 9 * K - 8;
cout << double(win) / rem / (rem - 1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define x first
#define y second
#define bg begin()
#define ed end()
#define pb push_back
#define mp make_pair
#define sz(a) int((a).size())
#define R(i,n) for(int i(0);i<(n);++i)
#define L(i,n) for(int i((n)-1);i>=0;--i)
const int iinf=0x3f3f3f3f;
const ll linf=0x3f3f3f3f3f3f3f3f;
//Data
const int N=2e5;
int n,a[N],b[N],p[N],q[N],o[N];
vector<pair<int,int>> ns;
//Function
//Main
int main(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>n;
R(i,n) cin>>a[i],o[i]=i;
R(i,n) cin>>b[i];
R(i,n) cin>>p[i],q[--p[i]]=i;
R(i,n)if(i!=p[i]&&a[i]<=b[p[i]])
return !(cout<<-1<<'\n');
sort(o,o+n,[&](int i,int j)
{return a[i]<a[j];});
R(t,n){
int i=o[t];
if(i!=p[i]){
ns.pb({i,q[i]});
int tp=p[i],tq=q[i];
p[tq]=tp,p[i]=i;
q[tp]=tq,q[i]=i;
}
}
cout<<sz(ns)<<'\n';
for(auto u:ns) cout<<u.x+1<<' '<<u.y+1<<'\n';
return 0;
}
/*
每个连通块，从人轻到人重挪
*/ | #include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define in insert
#define ff first
#define ss second
#define int long long
#define rep(i,x,m) for(int i=x;i<m;i++)
#define MOD 1000000007
#define endl "\n"
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define vi vector<int>
#define pi pair<int,int>
#define sz(x) (int)x.size()
#define pq priority_queue<int>
#define fix(y) fixed<<setprecision(y)
#define print(v) for(int i=0;i<v.size();i++) cout<<v[i]<<" ";cout<<endl
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int power(int n,int m)
{int p=1;if(m==0)return 1;p=(power(n,m/2)%MOD);p=(p%MOD*p%MOD)%MOD;
return(m&1?((p%MOD*n%MOD)%MOD):(p%MOD));}
void solve()
{
int n;
cin>>n;
int a[n];
int sum=0,ans=0;
rep(i,0,n){
cin>>a[i];sum+=a[i];}
sort(a,a+n);
rep(i,0,n)
{
//cout<<a[i]*(n-i-1)<<" "<<(sum-a[i])<<endl;
ans+=abs(a[i]*(n-1-i)-(sum-a[i]));
sum-=a[i];
}
cout<<ans;
}
signed main()
{
FIO
int t=1;
//cin>>t;
while(t--)
solve();
cerr<<(float)clock()/CLOCKS_PER_SEC*1000<<" ms"<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define print(x) cout << (#x) << ": " << (x) << endl
#define p1d(x) cout << (#x) << ": ["; for(auto& zz: x) cout << zz << " "; cout << "]\n"
#define p2d(x) cout << (#x) << ": \n["; for(auto& vec: x) {for(auto& v: vec) cout << v << " "; cout << ",\n";}
#define p2s(x) cout << (#x) << ": ["; for(auto& vec: x) {cout << vec << ",\n";}
#define pb push_back
#define endl "\n"
// __builtin_popcount
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
// freopen("input.txt", "r", stdin);
int main() {
int n, val;
cin >> n;
vector<int> rec(n+1, 0);
for(int i = 0; i < n; i++) {
cin >> val;
rec[val] = 1;
}
for(int i = 1; i <= n; i++) {
if (rec[i] == 0) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl "\n"
int main()
{
fastio;
int n,a;
cin>> n;
vector <int> v;
list <int> lst;
while(n!=0)
{
cin>> a;
v.push_back(a);
lst.push_back(a);
n--;
}
lst.sort();
lst.unique();
if(lst.size()==v.size())
cout<< "Yes";
else
cout<< "No";
return 0;
}
|
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for(int i = 0; i < N; ++i)
void solve(std::string S){
reverse(S.begin(), S.end());
rep(i, S.size()){
char w = S[i];
if(w == '0' or w == '1' or w == '8'){
cout << w;
continue;
}
if(w == '9'){
cout << '6';
continue;
}
if(w == '6'){
cout << '9';
continue;
}
}
cout << endl;
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
int main(){
std::string S;
std::cin >> S;
solve(S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
S = regex_replace(S, regex("6"), "5");
S = regex_replace(S, regex("9"), "6");
S = regex_replace(S, regex("5"), "9");
string S_reversed (S.rbegin(), S.rend());
cout << S_reversed << endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
long long n,a[200010],b[200010],p[200010],k,ans,m;
long long f[200010];
int main(){
cin >> n;
for(int i=1;i<=n;i++)
{
cin >>a[i];
p[i]=max(a[i],p[i-1]);}
f[1]=2*a[1];b[1]=f[1];
for(int i=2;i<=n;i++)
{
f[i]=a[i]+i*(p[i]-p[i-1])+b[i-1]+f[i-1];
b[i]=p[i]-p[i-1]+b[i-1]+a[i];
}
for(int i=1;i<=n;i++)
cout << f[i]<<endl;
return 0;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repa(i,a,n) for (long long i = (a); i < (long long)(n); i++)
#define Rrep(i,n) for (long long i = (long long)(n)-1; i >= 0; i--)
#define Rrepa(i,a,n) for (long long i = (long long)(n)-1; i >= a; i--)
using ll = long long;
class Prints {
class __Prints {
public:
__Prints(const char* sep, const char* term) : sep(sep), term(term) {}
template <class... Args>
void operator()(const Args&... args) const { print(args...); }
template <typename T>
void pvec(const T& vec, size_t sz) const {
for (size_t i = 0; i < sz; i++)
std::cout << vec[i] << (i == sz - 1 ? term : sep);
}
template <typename T>
void pmat(const T& mat, size_t h, size_t w) {
for (size_t i = 0; i < h; i++)
for (size_t j = 0; j < w; j++)
std::cout << mat[i][j] << (j == w - 1 ? term : sep);
}
private:
const char *sep, *term;
void print() const { std::cout << term; }
void print_rest() const { std::cout << term; }
template <class T, class... Tail>
void print(const T& head, const Tail&... tail) const { std::cout << head, print_rest(tail...); }
template <class T, class... Tail>
void print_rest(const T& head, const Tail&... tail) const { std::cout << sep << head, print_rest(tail...); }
};
public:
Prints() {}
__Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};
Prints print;
//一次元配列はprint().pvec(vec,要素数);
//二次元配列はprint().pmat(vec,要素数1,要素数2);
int main() {
int si,sj,ti,tj;
rep(k,1000) {
cin >> si >> sj >> ti >> tj;
string ans;
if (si < ti) rep(i,ti-si) ans += 'D';
else rep(i,si-ti) ans += 'U';
if (sj < tj) rep(i,tj-sj) ans += 'R';
else rep(i,sj-tj) ans += 'L';
cout << ans << endl;
int score;
cin >> score;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<ll, ll>;
template<class T>
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}
template<class T>
bool chmin(T &a, T b) {if (a > b) {a = b;return true;}else return false;}
// struct Edge { ll to; ll cost; Edge(ll t, ll c) { to = t; cost = c;} };
// using Graph = vector<vector<Edge>>;
// using Graph = vector<vector<ll>>;
// priority_queue<P, vector<P>, greater<P>> q;
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;
const double PI = acos(-1);
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
string t = "";
for (ll i = 0; i < s.size(); i++) {
if (s[i] == '6') t = t + '9';
else if (s[i] == '9') t = t + '6';
else t = t + s[i];
}
cout << t << endl;
return 0;
}
//小数点の出力
//cout << fixed << std::setprecision(15) << ans << endl; | #include <bits/stdc++.h>//For vectors,pairs
using namespace std;
#define ll long long
#define rep(i,j,n) for(int i=j;i<n;i++)
#define _rep(i,n) for(int i=n;i>=0;i--)
void solve();
void cp(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("error.txt", "w", stderr);
freopen("output.txt", "w", stdout);
#endif
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// cp();
int t=1;//cin>>t;
while(t--){
solve();
cout<<endl;
}
// cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl;
return 0;
}
void solve(){
string s;
cin>>s;
ll n = s.size();
rep(i,0,n){
if(s[i]=='6'){
s[i] = '9';
continue;
}
if(s[i]=='9'){
s[i] = '6';
}
}
_rep(i,n-1){
cout<<s[i];
}
return;
}
|
// 2020-11-28 21:00:40
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = long long;
using ld = long double;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
using P = pair<int, int>;
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
// #include <atcoder/convolution>
// #include <atcoder/dsu>
// #include <atcoder/fenwicktree>
// #include <atcoder/lazysegtree>
// #include <atcoder/math>
// #include <atcoder/maxflow>
// #include <atcoder/mincostflow>
// #include <atcoder/modint>
// #include <atcoder/scc>
// #include <atcoder/segtree>
// #include <atcoder/string>
// #include <atcoder/twosat>
// #include <atcoder/all>
// using namespace atcoder;
// clang-format on
void answer() {
ll a, b, x, y;
cin >> a >> b >> x >> y;
ll ans = 0;
if (a == b) {
ans = x;
} else if (a > b) {
int d = a - b;
if (x * 2 < y) {
ans += x * (d - 1) * 2;
} else {
ans += y * (d - 1);
}
ans += x;
} else if (a < b) {
int d = b - a;
if (x * 2 < y) {
ans += x * d * 2;
} else {
ans += y * d;
}
ans += x;
}
cout << ans << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
} | // Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T>
inline bool chmax(T &x, const T &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
struct IOSET {
IOSET() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}
} ioset;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &element : vec) is >> element;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0, vec_len = (int)vec.size(); i < vec_len; ++i) {
os << vec[i] << (i + 1 == vec_len ? "" : " ");
}
return os;
}
// Main
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
queue<int> qs, qt;
rep(i, n) {
if (s[i] == '1') qs.push(i);
if (t[i] == '1') qt.push(i);
}
ll ans = 0;
while (!qt.empty()) {
int z = qt.front();
if (qs.empty()) {
cout << "-1\n";
return 0;
}
int x = qs.front();
if (x < z) {
qs.pop();
if (qs.empty()) {
cout << "-1\n";
return 0;
}
int y = qs.front();
qs.pop();
ans += y - x;
} else {
ans += x - z;
qs.pop();
qt.pop();
}
}
while (!qs.empty()) {
int x = qs.front();
qs.pop();
if (qs.empty()) {
cout << "-1\n";
return 0;
}
int y = qs.front();
qs.pop();
ans += y - x;
}
cout << ans << "\n";
}
|
//*******Abhijit Burman***********//
//Jalpaiguri Government Engineering College//
// Taken From Striver_79
// Never open a ranklist untill and unless you are done with solving problems, wastes 3/4 minuts
// Donot treat CP as a placement thing, love it and enjoy it, you will succeed for sure.
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ff first
#define ss second
#define mk make_pair
#define MAXX (1000000000000000000+7)
#define mod 1000000007
#define endl "\n"
#define PI 3.14159265358979323846
#define all(x) (x).begin(),(x).end()
#define fio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
void printv(vector<ll> v) { ll sz = v.size(); for(ll i=0;i<sz;i++) {if (i == sz - 1) cout << v[i] << "\n"; else cout << v[i] << " ";}}
void input(ll a[], ll sz) {for(ll i=0;i<sz;i++) cin >> a[i];}
void print(ll a[], ll sz) {for(ll i=0;i<sz;i++) {if (i == sz - 1) cout << a[i] << "\n"; else cout << a[i] << " ";}}
ll dx1[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll dy1[] = {0, 1, 1, 1, 0, -1, -1, -1};
ll dx2[] = {1, 0, -1, 0};
ll dy2[] = {0, 1, 0, -1};
ll mul(ll a, ll b, ll p = mod) {return ((a % p) * (b % p)) % p;}
ll add(ll a, ll b, ll p = mod) {return (a % p + b % p) % p;}
ll power(ll x,ll y,ll p = mod)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1; // y = y/2
x = (x*x) % p;
}
return res;
}
ll modInverse(ll n, ll p = mod)
{
return power(n, p - 2, p);
}
ll ncrMod(ll n, ll r, ll p = mod)
{
if (r == 0)
return 1;
ll fac[n + 1];
fac[0] = 1;
for (ll i = 1 ; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p *
modInverse(fac[n - r], p) % p) % p;
}
// a+b=xor(a,b)+2*(a&b)//
ll convert(string num){
ll sum=0;
for(int i=0;i<num.size();i++){
sum=sum*10;
sum+=(num[i]-'0');
}
return sum;
}
bool ispeed2ime(ll n){
for(int i=2;i*i<=n;i++){
if(n%i==0){
return false;
}
}
return true;
}
bool isPowerof2(ll n){
while(n>1){
if(n%2!=0){
return true;
}
n/=2;
}
return false;
}
ll dp[100][3];
ll cost(vector<ll>& a, string s[], ll pos,ll n,ll res){
if(pos>=n){
if(res==1){
return 1;
}
return 0;
}
if(dp[pos][res]!=-1){
return dp[pos][res];
}
ll ans=0;
if(s[pos]=="AND"){
ans+=cost(a,s,pos+1,n,a[pos]&res);
}
else{
ans+=cost(a,s,pos+1,n,a[pos]||res);
}
a[pos]=1;
if(s[pos]=="AND"){
ans+=cost(a,s,pos+1,n,a[pos]&res);
}
else{
ans+=cost(a,s,pos+1,n,a[pos]||res);
}
a[pos]=0;
return dp[pos][res] = ans;
}
void solve()
{
ll n;
cin>>n;
string s[n];
for(int i=0;i<n;i++){
cin>>s[i];
}
memset(dp,-1,sizeof(dp));
vector<ll> a(n,0);
ll ans = cost(a,s,0,n,0)+cost(a,s,0,n,1);
cout<<ans<<endl;
}
int main()
{
fio;
// #ifndef ONLINE_JUDGE
// // for getting input from input.txt
// freopen("input.txt", "r", stdin);
// // for writing output to output.txt
// freopen("output.txt", "w", stdout);
// #endif
ll t=1;
// cin>>t;
while(t--)
{
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long n,ans=1;
int main() {
scanf("%lld",&n);
for (int i=1;i<=n;++i) {
char str[11];
scanf("%s",&str);
if (str[0]=='O') ans+=1LL<<i;
}
printf("%lld",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y);}
template<class T, class U> void umax(T& x, const U& y){ x = max(x, (T)y);}
template<class T, class U> void init(vector<T> &v, U x, size_t n) { v=vector<T>(n, (T)x); }
template<class T, class U, typename... W> void init(vector<T> &v, U x, size_t n, W... m) { v=vector<T>(n); for(auto& a : v) init(a, x, m...); }
template <class T>
class SegmentTree{
struct node{
int l, r;
T x;
};
unsigned int sz;
vector<node> a;
// --- modify this for different operations ---
T zero = 0;
void merge(int to, int from1, int from2){
a[to].l = a[from1].l;
a[to].r = a[from2].r;
a[to].x = a[from1].x ^ a[from2].x;
}
// ---
public:
SegmentTree<T>(vector<T>& a){
sz = 1;
while(sz < a.size()) sz <<= 1;
this->a.resize(2*sz);
for(int i = sz; i<2*sz; i++){
if (i-sz < a.size())
this->a[i].x = a[i - sz];
else
this->a[i].x = zero;
this->a[i].l = this->a[i].r = i - sz;
}
for(int i = sz-1; i>0; i--)
merge(i, 2*i, 2*i+1);
}
inline int mid(int l, int r){ return l+(r-l)/2;}
void upd(int pos, int l, int r, int dx){
if (r < a[pos].l || a[pos].r < l) return;
if (a[pos].l == a[pos].r && a[pos].l == l) {
a[pos].x ^= dx;
return;
}
upd(2*pos, l, r, dx);
upd(2*pos+1, l, r, dx);
merge(pos, 2*pos, 2*pos+1);
}
void upd(int l, int r, int dx){
upd(1, l, r, dx);
}
void upd(int i, int dx){
upd(i, i, dx);
}
T get(int pos, int l, int r){
if (r < a[pos].l || a[pos].r < l) return zero;
if (l <= a[pos].l && a[pos].r <= r)
return a[pos].x;
int m = mid(a[pos].l, a[pos].r);
int x1 = get(2*pos, l, r);
int x2 = get(2*pos+1, l, r);
return x1 ^ x2;
}
T get(int l, int r){
return get(1, l, r);
}
};
int main(int argc, char** argv) {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(15);
if (argc == 2 && atoi(argv[1]) == 123456789) freopen("d:\\code\\cpp\\contests\\stdin", "r", stdin);
int n, q;
cin >> n >> q;
vector<int> a(n+1);
FOR1(i, n) cin >> a[i];
SegmentTree<int> st(a);
// FOR1(x, n)
// cout << st.get(1, x) << endl;
// return 0;
FOR(i, q){
int t, x, y;
cin >> t >> x >> y;
if (t == 1){
st.upd(x, y);
}
else{
int ans = st.get(x, y);
cout << ans << '\n';
}
}
if (argc == 2 && atoi(argv[1]) == 123456789) cout << clock()*1.0/CLOCKS_PER_SEC << " sec\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
template<class T> void view(T e) {cout << e << endl;}
template<class T> void view(const vector<T> &v) {for(const auto &e : v){cout << e << " ";} cout << endl;}
template<class T> void view(const vector<vector<T>> &vv) {for(const auto &v : vv){view(v);}}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1<<30;
const ll inf_l = 1LL<<61;
const int MAX = 1e5;
int main() {
int n; cin >> n;
string s; cin >> s;
vint a(n + 1);
rep(i,n+1) cin >> a[i];
int k = inf;
rep(i,n) k = min(k, abs(a[i + 1] - a[i]));
vvint b(k, vint(n + 1));
rep(i,n+1) {
rep(j,k) b[j][i] = a[i] / k;
for (int j = k - a[i] % k; j < k; j++) b[j][i]++;
}
cout << k << endl;
rep(i,k) {
rep(j,n+1) printf("%d%s", b[i][j], j != n ? " " : "\n");
}
} |
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//namespace mp = boost::multiprecision;
//using Bll = mp::cpp_int;
using namespace std;
#define ll long long
#define rep(i, m, n) for (ll i = m; i < n; i++)
#define rrep(i, m, n) for (ll i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define HpOut(S) cout << setprecision(50) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S) \
vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<ll, ll>
#define tint tuple<ll, ll, ll>
#define paf(L, R) pair<L, R>
#define mod 998244353
#define MAX 10010
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
cout << a*d - b * c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
long long a,b,c,d;
long long ans=0;
cin >> a >> b >> c >> d;
ans=(a*d)-(b*c);
cout << ans << endl;
return 0;
} |
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
#include <iomanip>
constexpr int HeighestDim = 505000;
int n, m, k;
long long int res[101];
int dim_a = 0, dim_b = 0;
int A[HeighestDim + 1], B[HeighestDim];
void mult_a(int v){
for(int i = dim_a, j = i - v; j >= 0; --i, --j){ A[i] -= A[j]; if(A[i] < 0) A[i] += m; }
}
void div_a(int v){
for(int i = v, j = 0; i <= dim_a; ++i, ++j){
A[i] += A[j]; if(A[i] >= m) A[i] -= m;
}
}
void mult_b(int v){
dim_b += v;
for(int i = dim_b, j = i - v; j >= 0; --i, --j){
B[i] -= B[j]; if(B[i] < 0) B[i] += m;
}
}
void div_b(int v){
for(int i = v, j = 0; i <= dim_b; ++i, ++j){
B[i] += B[j]; if(B[i] >= m) B[i] -= m;
}
}
int main(void){
std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(16);
A[0] = 1; B[0] = 1;
std::cin >> n >> k >> m; ++k;
const int hd = (n >> 1) + (n & 1);
{
int i, j;
for(i = 1, j = k; i <= hd; ++i, j += k){ dim_a += j; mult_a(j); div_a(i); }
for(; i < n; ++i, j += k){ mult_a(j); div_a(i); }
}
for(int i = 0, j = n, I = k, J = k * (n - 1); ; I += k, J -= k){
long long int res_v = 0;
for(int d = 0; d <= dim_b; ++d) res_v += static_cast<long long int>(A[d]) * B[d] % m;
if(res_v) res_v = (k * res_v - 1) % m; else res_v = m - 1;
res[i++] = res_v; res[--j] = res_v;
if(i > j) break;
mult_a(j); div_a(J);
mult_b(I); div_b(i);
}
for(int i = 0; i < n; ++i) std::cout << res[i] << '\n';
return 0;
} | # include <bits/stdc++.h>
#define rep(i,l,r)for(int i=(l);i<(r);i++)
# define rrep(i,r,l) for(int i=(r); i>=l; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
using namespace std;
typedef long long lint;
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; }
#define INF ((1LL<<62)-(1LL<<31)) /*オーバーフローしない程度に大きい数*/
#define MOD 1000000007
lint gcd(lint a,lint b){
if(!b)return a;
return gcd(b,a%b);
}
lint lcm(lint a,lint b){
return a*b/gcd(a,b);
}
template< typename T >
struct BinaryIndexedTree {
vector< T > data;
BinaryIndexedTree(int sz) {
data.assign(++sz, 0);
}
T sum(int k) {
T ret = 0;
for(++k; k > 0; k -= k & -k) ret += data[k];
return (ret);
}
void add(int k, T x) {
for(++k; k < data.size(); k += k & -k) data[k] += x;
}
};
void solve() {
int h,w,n;
cin >> h >>w >> n;
vector<int> a(w,h),b(h,w);
rep(i,0,n){
int x,y;
cin >> x >> y;x--,y--;
chmin(a[y],x);
chmin(b[x],y);
}
lint ans=0;
rep(y,0,b[0]) ans+=a[y];
rep(x,0,a[0]) ans+=b[x];
BinaryIndexedTree<int> t(w);
rep(i,0,b[0]) t.add(i, 1);
vector<vector<int>> ends(h+1);
rep(y,0,b[0]) ends[a[y]].push_back(y);
rep(x,0,a[0]){
for(int y:ends[x]) t.add(y,-1);
ans-=t.sum(b[x]-1);
}
cout << ans << endl;
}
signed main() {
solve();
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
if(n <= 6){
cout << n << endl;
return 0;
}
int sum = 0;
for(int i = 7; i <= n; i++){
int x = i;
int dif = 0;
do{
if(x % 10 == 7){
sum++;
dif = 1;
break;
}
else{
x /= 10;
}
}while(x != 0);
x = i;
if(dif == 0){
do{
if(x % 8 == 7){
sum++;
break;
}
else{
x /= 8;
}
}while(x != 0);
}
}
cout << n - sum << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define fe 2*idx
#define fd fe+1
#define mid (l+r)/2
int aux[1007], n;
int main(){
fastio; cin>>n;
int mx = 0, k;
for(int i=1; i<=n; i++){
int ai; cin>>ai;
for(int j=2; j<=ai; j++){
if(ai%j == 0)aux[j]++;
}
}
for(int i=2; i<=1000; i++){
if(aux[i] > mx){
mx = aux[i]; k = i;
}
}
cout<<k<<endl;
} |
#include<stdio.h>
int main(){
int t;
scanf("%d",&t);
long long l[20000];
long long r[20000];
for(int i=0;i<t;i++){
scanf("%ld%ld",&l[i],&r[i]);
}
for(int i=0;i<t;i++){
long long ll=l[i];
long long rr=r[i];
if(!(rr-ll>=ll&&rr-ll<=rr))printf("0\n");
else if(ll!=rr)printf("%ld\n",(rr-ll*2+1)*(rr-ll*2+2)/2);
else printf("%d\n",ll==0);
}
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#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 namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
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);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}
//head
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi p(n), pl(n);
rep(i, n) {
cin >> p[i];
p[i]--;
pl[p[i]] = i;
}
vi ans, box(n-1);
bool flg = false;
rep(i, n) {
while(pl[i] != i) {
int u = p[pl[i]-1];
swap(p[pl[i]], p[pl[i]-1]);
if(box[pl[i]-1]) {
flg = true;
break;
}
box[pl[i]-1] = 1;
ans.emplace_back(pl[i]-1);
swap(pl[i], pl[u]);
}
}
if(int(ans.size()) != n-1) flg = true;
if(flg) cout << "-1\n";
else {
rep(i, n-1) {
cout << ans[i]+1 << '\n';
}
}
} |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(n) cout << ( (n) ? "YES":"NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
int main(void)
{
IOS
int n; cin >> n;
vector<ll> v(n);
ll vall = 0;
REP(i,n) {
cin >> v[i];
vall += v[i];
}
sort(RALL(v));
ll ans = 0;
REP(i,n-1) {
ll x = v[i] * (n-i-1);
vall -= v[i];
ans += x - vall;
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#pragma region DEBUG
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef
tree<
pair<int,int>,
null_type,
less<pair<int,int>>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float 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...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#pragma endregion DEBUG
#define MOD 1000000007
#define MAX 500005
#define endl "\n"
vector <lli> fact(MAX,1);
vector <lli> invfact(MAX,1);
bool sev1(lli n){
while(n > 0){
if(n%10 == 7)
return true;
n /=10;
}
return false;
}
bool sev2(lli n){
while(n > 0){
if(n%8 == 7)
return true;
n /=8;
}
return false;
}
void solve(){
lli n;
cin>>n;
vector <lli> arr(n);
for(lli i = 0; i<n; i++){
cin>>arr[i];
}
sort(arr.begin(),arr.end());
lli add = n-1, sub = 0;
lli ans = 0;
for(lli i = n-1; i>=0; i--){
ans += arr[i]*add;
ans -= arr[i]*sub;
add--;
sub++;
}
cout<<ans<<endl;
}
int main(){
/* freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout); */
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/* for(lli i = 1; i<MAX-5; i++){
fact[i] = i*fact[i-1]%MOD;
invfact[i] = binpow(fact[i],MOD-2);
} */
lli t;
t = 1;
// cin>>t;
while(t--)
solve();
} |
/*Remember me,
shall you deny,
death will reply*/
#include <iostream>
#include<vector>
#define pb push_back
#define f first
#define s second
using namespace std;
typedef long long int ll;
ll ncr(ll n,ll r)
{
ll num=1;
for(ll i=2;i<=n;i++)
num*=i;
ll den1=1,den2=1;
for(ll i=2;i<=r;i++)
den1*=i;
for(ll i=2;i<=n-r;i++)
den2*=i;
return num/(den1*den2);
}
int main()
{
//optimization tool
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ll a[5]={0,1,14,36,24};
string s;
cin>>s;
ll x=0,y=0;
for(ll i=0;i<s.size();i++)
{
if(s[i]=='o')
x++;
if(s[i]=='?')
y++;
}
if(x>4||(x==0&&y==0))
{
cout<<0<<endl;
return 0;
}
//cout<<"x "<<x<<" "<<y<<endl;
ll res=a[x];
// cout<<res<<" res"<<endl;
ll i=1;
while(x+i<=4&&y>=i)
{
res+=ncr(y,i)*a[x+i];
//cout<<"here "<<ncr(y,i)<<" "<<a[x+i]<<endl;
i++;
}
cout<<res<<endl;
return 0;
}
| // give up
#include <bitset>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
// alias, using declaration
using llint = long long; using ldouble = long double;
template <class T = llint> using vector = std::vector<T>;
template <class T = llint> using deque = std::deque<T>;
template <class T = llint, class U = llint, class... V> using map = std::map<T, U, V...>;
template <class T = llint, class... U> using set = std::set<T, U...>;
template <class T = llint, class U = llint> using umap = std::unordered_map<T, U>;
template <class T = llint> using uset = std::unordered_set<T>;
template <class T = llint, class U = T> using pair = std::pair<T, U>;
template <class T = llint> using varray = std::valarray<T>;
template <class T = llint, class... U> using pqueue = std::priority_queue<T, U...>;
using std::bitset; using std::string; using std::tuple;
// constant
constexpr llint INF4 = 0x3FFFFFFF;
constexpr llint INF8 = 0x3FFFFFFFFFFFFFFF;
constexpr llint INVALID = 0x8000000000000000;
namespace io {
// in
template <class... T, size_t... S> auto in(std::index_sequence<S...>) {tuple<T...> t; (..., (std::cin >> std::get<S>(t))); return t;}
template <class... T, size_t... S> auto in(std::index_sequence<S...>, size_t n) {tuple<vector<T>...> t{vector<T>(n)...}; for (size_t i = 0; i < n; i++) (..., (std::cin >> std::get<S>(t)[i])); return t;}
template <size_t N, class T = llint, class... U, class... A> auto in(A... a) {static_assert(N >= 1); if constexpr (N > 1) return in<N - 1, T, T, U...>(a...); else return in<T, U...>(std::index_sequence_for<T, U...>(), a...);}
// out
template <bool F = true, class T, class... U> void out(const T& a, const U&... b) {(F ? std::cout : std::cerr) << a << (sizeof...(b) ? " " : "\n"); if constexpr (sizeof...(b)) out<F>(b...);}
template <bool F = true, class T, class U = const char*> void out(const vector<T>& a, U d = " ") {for (auto&& b : a) (F ? std::cout : std::cerr) << b << (&b != &a.back() ? d : "\n");}
}
int main() {
// input
auto [N, M] = io::in<2>();
auto [A, B] = io::in<2>(M);
for (auto& i : A) i--;
for (auto& i : B) i--;
// solve
vector<vector<>> graph(N);
for (llint i = 0; i < M; i++) {
graph[A[i]].emplace_back(B[i]);
}
auto dfs = [&graph](auto f, llint node, uset<>& visited) -> void {
visited.emplace(node);
for (auto next : graph[node]) {
if (visited.count(next) > 0) continue;
f(f, next, visited);
}
};
llint sum = 0;
for (llint i = 0; i < N; i++) {
uset<> visited;
dfs(dfs, i, visited);
sum += visited.size();
}
// output
auto result = sum;
io::out(result);
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
using graph = vector<VI>;
template<class T = ll> using w_graph = vector<vector<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
template<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }
template<class T>inline void END(T s) { print(s); exit(0); }
void END() { exit(0); }
int main() {
init();
int n; cin >> n;
VI v(n * 2); cin >> v;
ll ans = 0;
PQ<ll> q;
FOR(i, 0, n) {
q.push(v[n - 1 - i]);
q.push(v[n + i]);
ans += q.top();
q.pop();
}
print(accumulate(all(v), 0LL) - ans);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 998244353;
typedef long long LL;
vector<vector<LL>> dp;
template<typename T>
auto makeNdVector(int n, const T& v) {
return vector<T>(n, v);
}
template<typename T, typename N, typename... Tail>
auto makeNdVector(const N& n, const Tail&... tail) {
auto vec = makeNdVector<T>(tail...);
vector<decltype(vec)> vecs(n, vec);
return vecs;
}
LL dfs(int n, int k) {
if (n < k) return 0;
if (dp[n][k] >= 0) return dp[n][k];
LL a = dfs(n-1, k-1);
LL b = dfs(n, 2 * k);
dp[n][k] = (a + b) % kMod;
return dp[n][k];
}
int main() {
int N, K; cin >> N >> K;
dp = makeNdVector<LL>(N + 1, N + 1, -1LL);
for (int i = 0; i <= N; ++i) { dp[0][i] = 0, dp[i][0] = 0; }
for (int i = 0; i <= N; ++i) dp[i][i] = 1;
LL ans = dfs(N, K);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rrep(i,n) for (int i = 1; i <= (n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define vi vector<int>
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;}
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
const long long INF = 1LL << 60;
const int dx[4] = {1,-1,0,0};
const int dy[4] = {0,0,1,-1};
const int dx8[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
const int dy8[8]={ 1, 0,-1, 0, 1,-1, 1,-1};
const int MOD = 1e9 + 7;
void add(ll &a, ll b) {a = (a+b) % MOD;}
#define fast \
cin.tie(0); \
ios::sync_with_stdio(false);
int main() {
ll N,M,T; cin >> N >> M >> T;
vector<ll> A(M),B(M);
rep(i,M) cin >> A.at(i) >> B.at(i);
bool ok = true;
ll start = 0;
ll total = N;
rep(i,M) {
total -= A[i] - start;
if (total <= 0) ok = false;
start = B[i];
total += B[i] - A[i];
if (total > N) total = N;
}
total -= T - B[B.size()-1];
if (total > 0 && ok) cout << "Yes" << endl;
else cout << "No" << endl;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n,m,t;
cin>>n>>m>>t;
ll batt=n;
ll a[1001]={0},b[1001]={0};
for(int i=1;i<=m;i++)
{
cin>>a[i]>>b[i];
}
a[0]=0;
b[0]=0;
batt-=(a[1]);
if(batt<=0)
{
cout<<"No"<<endl;
return 0;
}
for(int i=1;i<m;i++)
{
batt+=(b[i]-a[i]);
if(batt>n)
{
batt=n;
}
batt-=(a[i+1]-b[i]);
if(batt<=0)
{
cout<<"No"<<endl;
return 0;
}
}
batt+=(b[m]-a[m]);
if(batt>n)
{
batt=n;
}
batt-=(t-b[m]);
if(batt<=0)
{
cout<<"No"<<endl;
return 0;
}
cout<<"Yes"<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define pb push_back
#define sz size()
#define all(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const int maxn = 5e5 + 7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> cnt(7, 0);
for(int i = 0; i < 3; i++){
int x;
cin >> x;
cnt[x]++;
}
bool ok = true;
for(int i = 0; i < 7; i++){
if(cnt[i] == 3){
ok = true;
cout << i;
return 0;
}
if(cnt[i] == 2){
for(int j = 0; j < 7; j++){
if(cnt[j] == 1)cout << j;
}
return 0;
}
}
cout << 0;
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cmath>
#include<iomanip>
#define pi 3.14159265358979323846
#define mod 1000000007
#define int long long
#define elif else if
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
signed main(){
int n, a, b;
cin >> n >> a >> b;
cout << n - a + b << "\n";
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int i,j,k,m,t,n,a[10],b[10],p10[10]={1,10,100,1000,10000,100000,1000000,10000000};
double p,res,r[15];
string sb;
void chk(int x,int y){
int tmp1=0,tmp2=0,i,j,k,c[15]={0},d[15]={0};
for(i=1;i<=5;i++){
c[a[i]]++;
d[b[i]]++;
}
for(i=1;i<=9;i++){
tmp1+=i*p10[c[i]];
tmp2+=i*p10[d[i]];
}
//printf("%d %d %d %d\n",x,y,tmp1,tmp2);
if(tmp1>tmp2){
if(x==y){
res+=r[x]*(r[x]-1)/2;
}
else{
res+=r[x]*r[y]/2;
}
}
}
int main(){
cin>>n;
for(i=1;i<=9;i++){
r[i]=n;
}
p=n;p=(p*9-8)*(p*9-9)/2;
cin>>sb;
for(i=0;i<4;i++){
a[i+1]=sb[i]-'0';
r[a[i+1]]--;
}
cin>>sb;
for(i=0;i<4;i++){
b[i+1]=sb[i]-'0';
r[b[i+1]]--;
}
for(i=1;i<=9;i++){
for(j=1;j<=9;j++){
a[5]=i;
b[5]=j;
chk(i,j);
}
}
printf("%.20lf",res/p);
} | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#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)
using namespace std;
class DLetsPlayNim {
public:
void solve(std::istream& cin, std::ostream& cout) {
int T;
cin >> T;
while (T--) {
int N;
cin >> N;
vector<int> a(N);
REP(i, N) cin >> a[i];
int res = 0;
REP(i, N) res ^= a[i];
if (res != 0) {
if (N % 2 == 0) {
cout << "First" << endl;
} else {
cout << "Second" << endl;
}
} else {
map<int, int> cnt;
for (auto n : a) {
cnt[n]++;
}
bool ok = true;
for (auto kv : cnt) {
if (kv.second % 2 == 1) {
ok = false;
break;
}
}
if (ok) {
cout << "Second" << endl;
continue;
}
if (N % 2 == 0) {
cout << "First" << endl;
} else {
cout << "Second" << endl;
}
}
}
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
std::istream& in(std::cin);
std::ostream& out(std::cout);
DLetsPlayNim solver;
solver.solve(in, out);
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
typedef long long ll;
const int INF = 1000000000;
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
ll a, b, c;
cin >> a >> b >> c;
a %= 10;
if(a == 0) {
cout << 0 << endl;
return 0;
}
int x = a, y = 0;
REP(i, 10){
x *= a;
x %= 10;
if(a == x) {
y = i+1;
break;
}
}
int res = modpow(b, c, y);
int ans = 1;
if(res == 0) res = y;
REP(i, res){
//cout << "U" << endl;
ans *= a;
ans %= 10;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define T third
#define endl '\n'
#define f0(i,n) for(int i=0;i<n;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<long long> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvll;
const int C=1e9+7;
void yes(){
cout<<"YES\n";
}
void no(){
cout<<"NO\n";
}
long long binpow(long long a, long long b, long long m=C) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
//Variables********************************************
bool p[200001];
//Functions********************************************
ll f(int k){
vll v;
for(int i=2;i<=k;i++){
int cnt{};
if(!p[i]) continue;
while(k%i==0){
k/=i;
cnt++;
}
v.pb(cnt);
}
ll req=1;
for(auto x:v){
req*=(x+2)*(x+1)/2;
}
return req;
}
//*****************************************************
void solve(){
int a,b,c; cin>>a>>b>>c;
int la=a%10,lb=b%10;
if(la==1||la==5||la==6||la==0){
cout<<la<<endl;
return;
}
if(la==9){
if(lb%2){
cout<<9<<endl;
}
else{
cout<<1<<endl;
}
return;
}
if(la==4){
if(lb%2){
cout<<4<<endl;
}
else{
cout<<6<<endl;
}
return;
}
int x=binpow(b,c,4);
if(la==2){
if(x==0){
cout<<6<<endl;
}
if(x==1){
cout<<2<<endl;
}
if(x==2){
cout<<4<<endl;
}
if(x==3){
cout<<8<<endl;
}
}
if(la==3){
if(x==0){
cout<<1<<endl;
}
if(x==1){
cout<<3<<endl;
}
if(x==2){
cout<<9<<endl;
}
if(x==3){
cout<<7<<endl;
}
}
if(la==7){
if(x==0){
cout<<1<<endl;
}
if(x==1){
cout<<7<<endl;
}
if(x==2){
cout<<9<<endl;
}
if(x==3){
cout<<3<<endl;
}
}
if(la==8){
if(x==0){
cout<<6<<endl;
}
if(x==1){
cout<<8<<endl;
}
if(x==2){
cout<<4<<endl;
}
if(x==3){
cout<<2<<endl;
}
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t=1; //cin>>t;
while(t--){
solve();
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
using namespace std;
using vi = vector<int>;
vi pf(int x) {
vi r;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) {
r.push_back(i);
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1) {
r.push_back(x);
}
return r;
}
long long f(vi const& a) {
if (a.empty())
return 1;
long long r = 9e18;
for (int p : pf(a.front())) {
vi b;
copy_if(begin(a), end(a), back_inserter(b), [p](int x) { return x % p; });
r = min(r, p * f(b));
}
return r;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vi a(n);
for (int& x : a) {
cin >> x;
}
cout << f(a) << '\n';
return 0;
}
| #include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
#define V vector
#define P pair<int,int>
#define rep(i,s,n) for(int i=(s);i<(int)(n);i++)
#define rev(i,s,n) for(int i=(s);i>=(int)(n);i--)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define ci(x) cin >> x
#define cii(x) int x;cin >> x
#define cci(x,y) int x,y;cin >> x >> y
#define co(x) cout << x << endl
template<class T>void chmax(T &x,T y){x=max(x,y);}
template<class T>void chmin(T &x,T y){x=min(x,y);}
ll mod=998244353;
int ma=310;
ll f(ll x,ll n){
if(n==0)return 1;
if(n==1)return x;
if(n%2)return x*f(x,n-1)%mod;
ll res=f(x,n/2);
return res*res%mod;
}
vll fac(ma,1),inv(ma,1),vac(ma,1);
void ready(){
rep(i,2,ma){
fac[i]=fac[i-1]*i%mod;
inv[i]=mod-inv[mod%i]*(mod/i)%mod;
vac[i]=vac[i-1]*inv[i]%mod;
}
}
ll nck(ll n,ll k){
if(n<k || n<0||k<0)return 0;
return fac[n]*vac[n-k]%mod*vac[k]%mod;
}
int main(){
cci(n,k);
vi v(n);
k++;
rep(i,0,n)ci(v[i]);
vll All(k+1,n);
V<vll> num(k+1,vll(n,1));
rep(x,1,k+1){
ll now=0;
rep(i,0,n)(now+=num[x][i]=num[x-1][i]*v[i]%mod)%=mod;
All[x]=now;
}
ready();
rep(x,1,k){
ll ans=(mod+n-f(2,x-1))*All[x]%mod;
ll now=0;
rep(i,1,x){
now+=nck(x,i)*All[i]%mod*All[x-i]%mod;
now%=mod;
}
ans+=now*inv[2]%mod;
co(ans%mod);
}
} |
#include "bits/stdc++.h"
using namespace std;
// 定義
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(x) (x).begin(),(x).end()
#define REP(i, n) for(ll i = 0 ; i < (ll)n ; ++i)
#define REPN(i, m, n) for(ll i = m ; i < (ll)n ; ++i)
#define VL vector<ll>
#define VVL vector<vector<ll>>
#define VVVL vector<vector<vector<ll>>>
#define INF (ll)2e9
#define INF_LL 1LL<<60
//#define MOD 998244353
#define MOD 1000000007
ll Ceil(ll val, ll div) { return (val + div - 1) / div; }
ll CeilN(ll val, ll div) { return Ceil(val, div) * div; }
ll FloorN(ll x, ll n) { return (x - x % n); }
bool IsOdd(ll x) { return ((x & 1) == 1); }
bool IsEven(ll x) { return ((x & 1) == 0); }
// 枝定義
struct Edge
{
ll to;
ll dist;
ll rash;
Edge(){}
Edge(int to, ll dist, ll rash) : to(to), dist(dist), rash(rash){}
};
// グラフ定義(二次元配列)
template <class E>
using Graph = vector<vector<E>>;
// ダイクストラ
class Dijkstra
{
public:
// res[i] = sからiまでの最短距離
vector<ll> res;
// 復元パス
// vector<int> pathList;
vector<ll> pathRev;
const ll inf = 1e15;
ll getVal(ll stTime, ll D) {
ll low = floor((sqrt(D)) - 1) - 2;
low = max(low, stTime);
ll ans = inf;
REPN(t, low, low + 10) {
ll rashTime = t + D / (t + 1);
ans = min(ans, rashTime);
}
return ans;
}
public:
template<class E>
Dijkstra(const Graph<E> &G, int startFrom)
{
int V = (int)G.size();
res = vector<ll>(V, inf);
pathRev.resize(V, -1);
using P = pair<ll, int>;
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0, startFrom));
res[startFrom] = 0;
while (!que.empty()) {
P p = que.top(); que.pop();
int egdeFrom = p.second;
// 違う最短距離がキューにあるのでスキップ
if (res[egdeFrom] < p.first) {
continue;
}
// 最短距離を更新
for (const E &edge : G[egdeFrom]) {
ll rashCost = getVal(p.first, edge.rash);
ll nextDist = edge.dist + rashCost;
if (nextDist < res[edge.to]) {
res[edge.to] = nextDist;
pathRev[edge.to] = egdeFrom;
que.push(P(nextDist, edge.to));
}
}
}
}
// 経路を取得する
vector<ll> getPath(ll dstPos)
{
vector<ll> pathList;
while (dstPos != -1) {
pathList.push_back(dstPos);
dstPos = pathRev[dstPos];
}
reverse(pathList.begin(), pathList.end());
return pathList;
}
};
// 処理
void Solve()
{
int N, M;
cin >> N >> M;
Graph<Edge> G(N);
REP(i, M) {
int a, b, c, d;
cin >> a >> b >> c >> d;
a--, b--;
G[a].emplace_back(Edge(b, c, d));
G[b].emplace_back(Edge(a, c, d));
}
Dijkstra dijk(G, 0);
ll ans = dijk.res[N - 1];
if (ans == 1e15) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
}
// メイン
int main()
{
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Solve();
return 0;
}
| #include<bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define MP make_pair
#define PB emplace_back
using namespace std;
const int MAX_N = 100001;
int C[MAX_N], D[MAX_N];
vector<pair<int, int>> e[MAX_N];
long long dis[MAX_N];
long long f(long long v, int eid) {
int sq = sqrt(D[eid]+(long double)0.1);
while(sq * sq < D[eid]) { sq++; }
if((v + 1) <= sq) {
return sq - 1 + C[eid] + D[eid] / sq;
} else {
return v + C[eid] + D[eid] / (v + 1);
}
}
void solve() {
int N, M;
scanf("%d%d", &N, &M);
for(int i = 0; i < M; i++) {
int A, B;
scanf("%d%d%d%d", &A, &B, &C[i], &D[i]);
e[A].PB(MP(B,i));
e[B].PB(MP(A,i));
}
priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>>pq;
pq.push(MP(0, 1));
for(int i = 2; i <= N; i++) {
dis[i] = 1e18;
}
while(!pq.empty()) {
auto x = pq.top();
pq.pop();
if(x.second == N) {
printf("%lld\n", x.first);
return;
}
if(dis[x.second] < x.first) {
continue;
}
for(auto ee: e[x.second]) {
int y, eid;
tie(y, eid) = ee;
long long nxt_v = f(x.first, eid);
if(dis[y] > nxt_v) {
dis[y] = nxt_v;
pq.push(MP(nxt_v, y));
}
}
}
puts("-1");
}
int main() {
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int adj[30][30];
int main() {
cout.tie(nullptr)->sync_with_stdio(false);
int N; cin >> N;
vector<tuple<int, int, int>> points(N);
for (int i = 0; i < N; ++i) {
int a, b, c; cin >> a >> b >> c;
--a, --b, --c;
points[i] = make_tuple(a, b, c);
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
//if (i == j) continue;
int ai, bi, ci, aj, bj, cj;
tie(ai, bi, ci) = points[i];
tie(aj, bj, cj) = points[j];
adj[i][j] = abs(ai - aj) + abs(bi - bj) + max(0, cj - ci);
}
}
vector<vector<int>> dp(1<<N, vector<int>(N, INT_MAX/2));
for (int a = 1; a < N; ++a)
dp[1 << a][a] = adj[0][a];
for (int s = 0; s < (1<<N); s++) //iterating through all subsets in lexicographical order
for (int a = 0; a < N; a++) {
int r = dp[s][a];
for (int v = 0; v < N; v++) { //looking through all transitions (cities to visit next)
if (s & (1<<v)) continue; //we cannot visit cities that are already visited
int ns = s | (1<<v); //perform transition
int nr = r + adj[a][v]; //by adding edge (a - v) distance
dp[ns][v] = min(dp[ns][v], nr); //relax result for state (ns,na) with nr
}
}
cout << dp[(1 << N) - 1][0] << '\n';
}
| //@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
int dp[1 << 17][17];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vi x(n), y(n), z(n);
rep(i, n) cin >> x[i] >> y[i] >> z[i];
auto dist = [&](int i, int j) {
return abs(x[i] - x[j]) + abs(y[i] - y[j]) + max(0, z[j] - z[i]);
};
rep(i, 1 << n) rep(j, n) dp[i][j] = inf;
dp[1][0] = 0;
int ans = inf;
rep2(bit, 1, 1 << n) rep(j, n) {
if (bit == (1 << n) - 1) {
chmin(ans, dp[bit][j] + dist(j, 0));
}
rep(k, n) {
if (bit >> k & 1) continue;
chmin(dp[bit | 1 << k][k], dp[bit][j] + dist(j, k));
}
}
cout << ans << endl;
} |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include <chrono>
/* #include <atcoder/all> */
/* using namespace atcoder; */
using namespace std;
void debug_out(){ cout << "\n"; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#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 IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = 1000000007;
/* const ll MOD = 998244353; */
const ll INF = (1<<30)-1;
const ll INFLL = 1ll<<60;
const double PI = acos(-1);
struct INIT { INIT(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}}INIT;
signed main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
vector<int> vec = A;
vector<int> MAX = A;
REP(i, N-1) vec[i+1] += vec[i];
int now = 0;
int p = 0;
REP(i, N-1){
now += A[i];
chmax(p, now);
MAX[i+1] = p;
}
int ans = 0;
now = 0;
REP(i, N){
chmax(ans, now+MAX[i]);
now += vec[i];
chmax(ans, now);
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fs first
#define sc second
#define ll long long
// svarið er bara hversu mörg mismunandi gcd getum við búið til sem eru minni en
// eða jöfn minnstu tölunni í upprunalega listanum.
// generally hversu mörg mismunandi gcd er hægt að búa til?
// loop down from min to 2 and find if there are two numbers who are both multiples of this number
// then it is a valid gcd
// gcd(a, b) <= min(a, b)
// ef ég fer út fyrir sqrt(10^9) þá get ég bara returnað stærðinni af listanum
// fyrst að ég veit að það er það eina sem er eftir og það er aðeins eitt eintak af því
// max í einhverri af tölunum. Eða ég tölunum eins oft og ég get með prime factornum
// og þá get ég checkað hversu mörg duplicates
vector<int> primes;
void sieve(int n) {
vector<bool> vis(n + 1, false);
for(int i = 2; i <= n; i++) {
for(int j = i + i; j <= n; j += i) {
vis[j] = true;
}
}
for(int i = 2; i <= n; i++) {
if(!vis[i]) {
primes.pb(i);
}
}
}
int n;
vector<int> A;
void getDivisors(int at, int cur, vector<pair<int, int>>& divs, vector<int>& res) {
if(at == divs.size()) return;
int a = cur;
for(int i = 0; i <= divs[at].sc; i++) {
if(a != 1) res.pb(a);
getDivisors(at + 1, a, divs, res);
a *= divs[at].fs;
}
}
vector<ll> find_divisors(ll n){ // finds unique divisors, a divisor occurs only once in the result
vector<pair<int,int>> pf;
for(int p : primes) {
if(p > n || n == 1) {
break;
}
if(n % p == 0) {
int cnt = 0;
while(n % p == 0) {
cnt++;
n /= p;
}
pf.pb({p, cnt});
}
}
if(n != 1) {
pf.pb({n, 1});
}
vector<int> res = {1};
getDivisors(0, 1, pf, res);
return res;
}
signed main() {
cin.sync_with_stdio(false);
cin >> n;
A = vector<int>(n);
for(int i = 0; i < n; i++) {
cin >> A[i];
}
sieve(sqrt(1e9) + 10);
int mn = *min_element(A.begin(), A.end());
unordered_map<int, int> t;
for(int i = 0; i < n; i++) {
for(int j = 1; j * j <= A[i] && j < mn; j++) {
if(A[i] % j == 0) {
if(!t.count(j)) {
t[j] = A[i];
}else {
t[j] = __gcd(t[j], A[i]);
}
if(A[i] / j < mn) {
if(!t.count(A[i] / j)) {
t[A[i] / j] = A[i];
}else {
t[A[i] / j] = __gcd(t[A[i] / j], A[i]);
}
}
}
}
}
int ans = 1;
for(auto [a, b] : t) {
if(a == b) ans++;
}
cout << ans << endl;
} |
#include"bits/stdc++.h"
using namespace std;
using ll=long long;
template<class T=ll>inline T in(istream&is=cin){T ret;is>>ret;return ret;}
template<class T,class Size=typename vector<T>::size_type>inline auto vector_2d(Size h,Size w,T v){return vector<vector<T>>(h,vector<T>(w,v));}
template<class P>struct comp_pair_by_second{bool operator()(const P&p1,const P&p2){return p1.second<p2.second||(p1.second==p2.second&&p1.first<p2.first);}};
int main()
{
ll h=in(),w=in(),a=in(),b=in();
stack<ll>states;
states.push(0);
ll ans=0;
while(!states.empty()){
ll s=states.top();states.pop();
if(__builtin_popcountll(s)==2*a){
++ans;
}else{
for(ll i=0;i<h;++i){
for(ll j=0;j<w;++j){
if((s&(1<<(i*w+j)))==0){
if(i!=h-1&&(s&(1<<((i+1)*w+j)))==0){
states.push(s|(1<<(i*w+j))|(1<<((i+1)*w+j)));
}
if(j!=w-1&&(s&(1<<(i*w+j+1)))==0){
states.push(s|(1<<(i*w+j))|(1<<(i*w+j+1)));
}
}
}
}
}
}
cout<<ans/[](ll n){ll ret=1;for(ll i=1;i<=n;++i)ret*=i;return ret;}(a)<<endl;
}
| #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 2100005
ll fact[SIZE],inv_fact[SIZE];
ll mod_pow(ll x,ll count, ll mod){
if(count == 0)return 1;
ll ret = mod_pow((x*x)%mod,count/2,mod);
if(count%2 == 1){
ret = (ret*x)%mod;
}
return ret;
}
ll extgcd(ll a,ll b,ll &x,ll &y){
ll d = a;
if(b != 0){
d = extgcd(b,a%b,y,x);
y -= (a/b)*x;
}else{
x = 1;
y = 0;
}
return d;
}
ll mod_inverse(ll a,ll m){
ll x,y;
extgcd(a,m,x,y);
return (m+x%m)%m;
}
ll nCk(ll n,ll k){
if(k > n)return 0;
ll ret = fact[n]*inv_fact[k];
ret %= MOD;
ret *= inv_fact[n-k];
return ret%MOD;
}
ll nPk(ll n,ll k){
if(k > n)return 0;
ll ret = fact[n]*inv_fact[n-k];
return ret%MOD;
}
int main(){
fact[0] = 1;
for(ll i = 1; i < SIZE; i++){
fact[i] = i*fact[i-1];
fact[i] %= MOD;
}
inv_fact[SIZE-1] = mod_inverse(fact[SIZE-1],MOD);
for(ll i = SIZE-1; i >= 1; i--){
inv_fact[i-1] = inv_fact[i]*i;
inv_fact[i-1] %= MOD;
}
ll N,M,K;
scanf("%lld %lld %lld",&N,&M,&K);
if(N > M+K){
printf("0\n");
}else{
ll base = nCk(N+M,N);
ll minus = nCk(N+M,M+K+1);
printf("%lld\n",(base-minus+MOD)%MOD);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define vi vector<int>
const int kMod = 1e9 + 7;
const int kInf = (~(1 << 31)) / 2 - 500;
const ll kInfL = (~(1LL << 63)) / 2 - 2000;
int main() {
vector<int> A(3);
for (int i = 0; i < 3; ++i) {
cin >> A[i];
}
sort(A.begin(), A.end());
if (A[0] == A[1]) {
cout << A[2] << endl;
return 0;
} else if (A[1] == A[2]) {
cout << A[0] << endl;
return 0;
}
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#ifdef TRACE
#include "../trace.h"
#else
#define trace(args...)
#endif
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl; typedef vector<int> vi;
typedef vector<vl> vvl; typedef vector<vi> vvi;
typedef pair<ll, ll> pll; typedef pair<int, int> pii;
typedef vector<pll> vpl; typedef vector<pii> vpi;
typedef vector<vpl> vvpl; typedef vector<vpi> vvpi;
#define s second
#define F first
#define v vector
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define sz(x) (int)x.size()
#define f(i,j,k,l) for(int i =(int)j; i!=(int)k; i = i + l)
#define inp(v,n) f(i,0,n,1) cin>>v[i];
#define out(v,n) f(i,0,n,1){ cout<<v[i]<<" ";}cout<<endl;
#define endl '\n'
#define all(v) v.begin(), v.end()
const ll mod = 998244353;
bool isPrime(int x) {
for (int d = 2; d * d <= x; d++) {
if (x % d == 0)
return false;
}
return true;
}
void solve(){
int a,b,c;
cin>>a>>b>>c;
if(a==b) cout<<c;
else if(b==c) cout<<a;
else if(a==c) cout<<b;
else cout<<0;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
} |
/* Author : Rohan Tirkey */
/* IIITA */
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fl(i,l,r) for(int i=l ; i<=r ; i++)
#define flr(i,r,l) for(int i=r;i>=l;i--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int mod = 1e9+7;
#define pi 3.14159265358979323846
#define vi vector<int>
#define vip vector< pair<int,int> >
#define test int t; cin>>t; while(t--)
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) < (b) ? (b) : (a))
#define trav(x) for(auto &it:x)
inline int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
inline int lcm(int a, int b) { return a * b / gcd(a, b); }
inline int ceil(int a, int b){ return (a%b==0) ? a/b : a/b +1 ;}
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define debug2(x, y) cout << '>' << #x << ':' << x << " | " << #y << ':' << y << "\n";
#define debug3(x, y, z) cout << '>' << #x << ':' << x << " | " << #y << ':' << y << " | " << #z << ':' << z << "\n";
#define debug4(x, y, z, w) cout << '>' << #x << ':' << x << " | " << #y << ':' << y << " | " << #z << ':' << z << " | " << #w << ':' << w << "\n";
clock_t time_p=clock();
void time(){time_p=clock()-time_p;cerr<<"Time Taken : "<<(float)(time_p)/CLOCKS_PER_SEC<<"sec\n";}
/*-------------------------------------------------------------------------------------------------------------------------------------------------*/
void solve()
{
int n; cin>>n;
int sum=0;
fl(i,1,n)
{
int a; cin>>a;
if(a>10)
{
sum+=(a-10);
}
}
cout<<sum<<"\n";
}
signed main()
{
fastio
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
//test {
solve();
//}
time();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<long double> vd;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<pair<ll,ll>> vp;
#define int ll
#define PB push_back
#define pb pop_back
#define in insert
#define endl "\n"
#define MP make_pair
#define f first
#define PI 3.141592653589
#define nd second
#define Trav(a,x) for(auto &a: x)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(), x.rend()
const int MOD = 998244353;
const int maxn = 2e6+1;
int a,b,c,d,e,k,n,m,t,s,q,x,y,ans;
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin>>n;
ans = 0;
for(int i = 0; i < n; i++){
cin>>a;
if(a > 10)ans += (a-10);
}
cout<<ans;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ll = long long;
using vl = vector<long long>;
using vi = vector<int>;
int main(){
ll n; cin >> n;
ll ans = 0;
if(n > 999) ans += (n-999);
if(n > 999999) ans += (n-999999);
if(n > 999999999) ans += (n-999999999);
if(n > 999999999999) ans += (n-999999999999);
if(n > 999999999999999) ans += (n-999999999999999);
cout << ans << endl;
} | #include<bits/stdc++.h>
#define fio ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
int main()
{
fio;
long long n;
cin>>n;
long long sum=0;
long long i=0;
while(sum<n)
{
i++;
sum=sum+i;
}
cout<<i;
} |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <queue>
#define LL long long
#define PII pair<int,int>
#define x first
#define y second
using namespace std;
constexpr const int N = 2e5 + 10;
int n, w;
int a[N], b[N];
LL s[N], ss[N], ans = 0x7fffffffffffffff;
int main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cin >> n >> w;
for(int i = 1; i <= n; ++i) cin >> a[i];
for(int i = 1; i <= w; ++i) cin >> b[i];
sort(a + 1, a + 1 + n);
for(int i = 3; i <= n; i += 2) s[i] = s[i - 2] + abs(a[i - 1] - a[i - 2]);
for(int i = n - 2; i >= 1; i -= 2) ss[i] = ss[i + 2] + abs(a[i + 1] - a[i + 2]);
for(int i = 1; i <= w; i++)
{
int pos = lower_bound(a + 1, a + 1 + n, b[i]) - a;
if(pos % 2 == 0) pos--;
ans = min(ans, s[pos] + ss[pos] + abs(b[i] - a[pos]));
}
cout << ans;
return 0;
} | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 100005
struct Info{
Info(){
len = value = 0;
}
Info(ll arg_len,ll arg_value){
len = arg_len;
value = arg_value;
}
bool operator<(const struct Info& arg) const{
return len < arg.len;
}
ll len,value;
};
ll W[10];
Info info[SIZE];
int main(){
ll N,M;
scanf("%lld %lld",&N,&M);
ll max_W = 0;
for(ll i = 0; i < N; i++){
scanf("%lld",&W[i]);
max_W = max(max_W,W[i]);
}
for(ll i = 0; i < M; i++){
scanf("%lld %lld",&info[i].len,&info[i].value);
if(max_W > info[i].value){
printf("-1\n");
return 0;
}
}
/*
* 自分以下の耐荷重で、より長い橋があったら不可
* →長さの降順に見て、過去最少の耐荷重ならOK
* */
sort(info,info+M);
vector<Info> V;
ll mini = HUGE_NUM;
for(ll i = M-1; i >= 0; i--){
if(info[i].value < mini){
mini = info[i].value;
V.push_back(info[i]);
}
}
reverse(V.begin(),V.end());
vector<int> vec;
for(int i = 0; i < N; i++){
vec.push_back(i);
}
ll ans = HUGE_NUM;
do{ //ラクダの並び順を全探索
ll work[N];
ll rui[N];
for(ll i = 0; i < N; i++){
rui[i] = W[vec[i]];
if(i > 0){
rui[i] += rui[i-1];
}
work[i] = -1;
}
work[0] = 0;
for(int i = 1; i < N; i++){
for(int head = 0; head <= i-1; head++){ //一団となる先頭のラクダ
ll tmp_W;
if(head == 0){
tmp_W = rui[i];
}else{
tmp_W = rui[i]-rui[head-1];
}
//tmp_Wで崩壊する、最長の長さの橋を二分探索
int left = 0,right = V.size()-1,mid = (left+right)/2;
int max_len = -1;
while(left <= right){
if(V[mid].value < tmp_W){
max_len = V[mid].len;
left = mid+1;
}else{
right = mid-1;
}
mid = (left+right)/2;
}
if(max_len == -1){ //崩落しない
work[i] = max(work[i],work[head]);
}else{
work[i] = max(work[i],work[head]+max_len);
}
}
}
ans = min(ans,work[N-1]);
}while(next_permutation(vec.begin(),vec.end()));
printf("%lld\n",ans);
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;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
int x, y, z; cin >> x >> y;
if(x == 0) {
if(y == 0) z = 0;
if(y == 1) z = 2;
if(y == 2) z = 1;
}
if(x == 1) {
if(y == 0) z = 2;
if(y == 1) z = 1;
if(y == 2) z = 0;
}
if(x == 2) {
if(y == 0) z = 1;
if(y == 1) z = 0;
if(y == 2) z = 2;
}
cout << z << endl;
} |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
cout<<N-1;
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all> // g++ main.cpp -std=c++17 -I .
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
template<class T,class U> inline bool chmin(T&x,U y){if(x>y){x=y;return true;}return false;}
template<class T,class U> inline bool chmax(T&x,U y){if(x<y){x=y;return true;}return false;}
using ll=long long;
const int inf = INT_MAX / 2; const ll INF = 1LL << 60;
const ll MOD = 1000000007;
// const int MOD = 998244353;
// cout << fixed << setprecision(15) << ans << endl;
// using mint = modint1000000007;
////////////////////////////////////////////////////////////////////////////////////////////
int main() {
ll n;cin>>n;
ll k = 0;
while(k*(k+1)<=2*(n+1)) k++;
cout << n - (k-2) << endl;
} |
#include<bits/stdc++.h>
const int maxn=65536+5;
using namespace std;
int p[maxn];
int al(int n){
int ans=1;
while(n--){
ans=ans*2;
}
return ans;
}
int main(){
int n;
cin>>n;
int nn=al(n);
int a,aa=0,b,bb=0;
for(int i=1;i<=nn/2;i++){
cin>>p[i];
if(p[i]>aa){
a=i;
aa=p[i];
}
}
for(int i=nn/2+1;i<=nn;i++){
cin>>p[i];
if(p[i]>bb){
b=i;
bb=p[i];
}
}
if(p[a]>p[b]) cout<<b;
else cout<<a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int FindIndex(vector<int> v, int val)
{
int index = 0;
int i = 0;
bool found = false;
while(!found && i < v.size())
{
if (v[i] == val)
{
index = i;
found = true;
}
i++;
}
return index + 1;
}
int main ()
{
int n; cin >> n;
vector<int> p;
vector<int> indexes;
vector<int> storage;
for (int i = 0; i < pow(2, n); i++)
{
int x; cin >> x;
p.push_back(x);
storage.push_back(x);
}
while(p.size() != 2)
{
for (int i = 0; i < p.size(); i += 2)
{
if (p[i] < p[i + 1])
{
indexes.push_back(p[i + 1]);
}
else
{
indexes.push_back(p[i]);
}
}
p = indexes;
indexes.clear();
}
if (p[0] > p[1])
cout << FindIndex(storage, p[1]);
else
cout << FindIndex(storage, p[0]);
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
string s;
cin >> s;
int q;
cin >> q;
vector<vector<int>> queries(q, vector<int>(3));
rep(i,q){
int t, a, b;
cin >> t >> a >> b;
a--;b--;
queries[i] = {t, a, b};
}
bool flip=false;
for(auto query : queries){
if(query[0]==2){
flip = !flip;
}
if(query[0]==1){
if(flip){
query[1]+=n;
query[1]%=2*n;
query[2]+=n;
query[2]%=2*n;
}
char tmp;
tmp = s[query[1]];
s[query[1]] = s[query[2]];
s[query[2]] = tmp;
}
}
if(flip){
s = s.substr(n) + s.substr(0, n);
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
//#define kk
#define int long long
#define mat vector<vector<int>>
#define vi vector<int>
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define pi pair<int, int>
#define inf 1000000000
#define mod 998244353
#define endl "\n"
const ll INF=1e18+5;
const int naxN=55;
int fact[naxN], inv_fact[naxN];
int power(int a, int n){
int res=1;
while(n){
if(n%2) res=(res*a)%mod, n--;
else a=(a*a)%mod, n/=2;
}
return res;
}
void init(){
fact[0]=inv_fact[0]=1;
for(int i=1; i<naxN; i++){
fact[i]=(i*fact[i-1])%mod;
inv_fact[i]=power(fact[i], mod-2)%mod;
}
}
int ncr(int a, int b){
if(a<0 || b<0 || a<b) return 0;
return (fact[a]%mod*inv_fact[b]%mod*inv_fact[a-b]%mod)%mod;
}
int dx[8]={-1, -1, -1, 0, 1, 1, 1, 0};
int dy[8]={-1, 0, 1, 1, 1, 0, -1, -1};
//****DO NOT TOUCH ABOVE THIS LINE****//
const int maxN=2e5+5;
#define M 998244353
int arr[55][55];
int par[55];
int R[55];
int find(int a){
if(par[a]<0) return a;
return par[a]=find(par[a]);
}
void merge(int a, int b){
a=find(a);
b=find(b);
if(a==b) return;
if(R[a]>=R[b]){
par[b]=a;
R[a]+=R[b];
}
else{
par[a]=b;
R[b]+=R[a];
}
}
void solve(){
int n, K;
cin>>n>>K;
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
cin>>arr[i][j];
}
}
for(int i=1; i<=n; i++){
par[i]=-1;
R[i]=1;
}
for(int i=1; i<=n; i++){
for(int j=i+1; j<=n; j++){
int can=1;
for(int k=1; k<=n; k++){
if(arr[i][k]+arr[j][k]>K){
can=0;
break;
}
}
if(can) merge(i, j);
}
}
init();
int ans1=1;
for(int i=1; i<=n; i++){
if(par[i]==-1) ans1*=fact[R[i]]%=M;
}
for(int i=1; i<=n; i++){
par[i]=-1;
R[i]=1;
}
for(int i=1; i<=n; i++){
for(int j=i+1; j<=n; j++){
int can=1;
for(int k=1; k<=n; k++){
if(arr[k][i]+arr[k][j]>K){
can=0;
break;
}
}
if(can) merge(i, j);
}
}
int ans2=1;
for(int i=1; i<=n; i++){
if(par[i]==-1) ans2*=fact[R[i]]%=M;
}
int ans=(ans1*ans2)%M;
cout<<ans<<endl;
}
//****DO NOT TOUCH BELOW THIS LINE****//
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout<<fixed<<setprecision(6);
#ifdef kk
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
int T=1;
//cin>>T;
while(T--){
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int L;
cin >> L;
unordered_map<int, int> mp;
for (int i = 0; i < 11; i++) {
int n = L - 12 + 11 - i;
for (int k = 2; k * k <= n; k++) {
while (n % k == 0) {
mp[k]++;
n /= k;
}
}
if (n != 1) mp[n]++;
}
mp[2] -= 8;
mp[3] -= 4;
mp[5] -= 2;
mp[7] -= 1;
mp[11] -= 1;
long long ans = 1;
for (auto kv : mp) {
while (kv.second) {
ans *= kv.first;
kv.second--;
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
const int N = 300, R = 20;
long long com[N][R];
long long combi(int n, int r) {
if(com[n][r]!=0) return com[n][r];
if(n==r) return com[n][r] = 1;
if(r==0) return com[n][r] = 1;
return com[n][r] = combi(n-1,r) + combi(n-1,r-1);
}
int main() {
int l;
cin>>l;
long long ans;
ans = combi(l-1,11);
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define sz(x) ((int)(x.size()))
#define all(x) (x).begin(), (x).end()
#define rep(i, l, r) for(int i = (l); i < (r); ++i)
#define dd(x) cout << #x << " = " << x << ", "
#define de(x) cout << #x << " = " << x << endl
//-------
int n, m;
vector<array<int, 2>> black;
bool qry(int x, int y, int l, int r) {
array<int, 2> target = {x, y};
int it = lower_bound(black.begin() + l, black.begin() + r, target) - black.begin();
if (it < r && black[it] == target)
return 1;
return 0;
}
void pb(vector<array<int, 2>> & tmp, int l, int r) {
array<int, 2> it = {l, r};
while(sz(tmp) && it[0] <= tmp.back()[1]) {
it[0] = min(tmp.back()[0], it[0]);
tmp.pop_back();
}
tmp.pb(it);
}
int main() {
scanf("%d%d", &n, &m);
black.resize(m);
for(auto &it : black) scanf("%d%d", &it[0], &it[1]);
sort(all(black));
set<int> point; point.insert(n);
for(int l = 0, r = 0; l < m; l = r) {
while(r < m && black[r][0] == black[l][0]) r++;
vi diff;
rep(i, l, r) {
int blk = black[i][1];
if (point.count(blk)) {
if (!point.count(blk - 1) && !point.count(blk + 1)) {
diff.pb(blk);
}
} else {
if (point.count(blk - 1) || point.count(blk + 1)) {
diff.pb(blk);
}
}
}
for(auto &p : diff) {
if (point.count(p)) point.erase(p);
else point.insert(p);
}
}
printf("%d\n", sz(point));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y);}
template<class T, class U> void umax(T& x, const U& y){ x = max(x, (T)y);}
template<class T> void print(T& v){ for(auto it : v) cout << it << " "; cout << endl; }
template<class T, class U> void init(vector<T> &v, U x, size_t n) { v=vector<T>(n, (T)x); }
template<class T, class U, typename... W> void init(vector<T> &v, U x, size_t n, W... m) { v=vector<T>(n); for(auto& a : v) init(a, x, m...); }
int main(int argc, char** argv) {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(15);
if (argc == 2 && atoi(argv[1]) == 123456789) freopen("d:\\code\\cpp\\contests\\stdin", "r", stdin);
int n, m;
cin >> n >> m;
vector<pii> v(m);
FOR(i, m) cin >> v[i].first >> v[i].second;
map<int, vi> H;
FOR(i, v.size())
H[v[i].first].push_back(v[i].second);
set<int> S;
S.insert(n);
for(auto it : H){
vi& tocheck = it.second;
vi torem, toadd;
for(auto it : tocheck)
if (!S.count(it-1) && !S.count(it+1))
torem.push_back(it);
else
toadd.push_back(it);
for(auto it : torem)
S.erase(it);
for(auto it : toadd)
S.insert(it);
}
cout << S.size() << endl;
if (argc == 2 && atoi(argv[1]) == 123456789) cout << clock()*1.0/CLOCKS_PER_SEC << " sec\n";
return 0;
}
|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se second
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)
#define rep2(i, a, b) for (int i = (int)(a), i##_len=(b); i < i##_len; i++)
#define rep3(i, a, b) for (int i = (int)(a), i##_len=(b); i >= i##_len; i--)
#define FOR(i, a) for (auto &i: a)
#define ALL(obj) begin(obj), end(obj)
#define _max(x) *max_element(ALL(x))
#define _min(x) *min_element(ALL(x))
#define _sum(x) accumulate(ALL(x), 0LL)
const int MOD = 998244353;
const int INF = (int)(1e13 + 7);
const double EPS = 1e-8;
const double PI = 3.14159265358979;
template <class T> using V = vector<T>;
template <class T> using VV = vector<vector<T>>;
template <class T> using VVV = vector<vector<vector<T>>>;
template <class T, class S> using P = pair<T, S>;
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}
template<class T> bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}
int _ceil(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }
int _mod(int a) {return a >= 0 ? a % MOD : a - (MOD * _ceil(a, MOD));}
int _pow(int a, int b) {int res = 1;for (a %= MOD; b; a = a * a % MOD, b >>= 1)if (b & 1) res = res * a % MOD;return res;}
struct mint {long long x;mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}mint operator-() const { return mint(-x); }mint &operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint &operator-=(const mint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}mint &operator*=(const mint a) { (x *= a.x) %= MOD;return *this; }mint operator+(const mint a) const { return mint(*this) += a; }mint operator-(const mint a) const { return mint(*this) -= a; } mint operator*(const mint a) const { return mint(*this) *= a; }mint pow(long long t) const {if (!t) return 1;mint a = pow(t >> 1);a *= a;if (t & 1) a *= *this;return a;}mint inv() const { return pow(MOD - 2); }mint &operator/=(const mint a) { return *this *= a.inv(); }mint operator/(const mint a) const { return mint(*this) /= a; }};istream &operator>>(istream &is, mint &a) { return is >> a.x; }ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// clang-format on
int x, y;
int ext_gcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return 0;
}
int d = ext_gcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
int inv(int n) {
ext_gcd(n, MOD, x, y);
return x;
}
class CRobotOnGrid {
public:
static void solve(istream &cin, ostream &cout) {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int H, W, K;
cin >> H >> W >> K;
int INV = inv(3);
VV<char> grid2(H + 2, V<char>(W + 2));
rep(i, K) {
int h, w;
char c;
cin >> h >> w >> c;
grid2[h][w] = c;
}
VV<mint> grid(H + 2, V<mint>(W + 2));
grid[1][1] = _pow(3, H * W - K);
rep2(i, 1, H + 1) {
rep2(j, 1, W + 1) {
if (grid2[i][j]) {
if (grid2[i][j] == 'R') {
grid[i][j + 1] += grid[i][j];
} else if (grid2[i][j] == 'D') {
grid[i + 1][j] += grid[i][j];
} else {
grid[i][j + 1] += grid[i][j];
grid[i + 1][j] += grid[i][j];
}
} else {
grid[i + 1][j] += grid[i][j] * INV;
grid[i + 1][j] += grid[i][j] * INV;
grid[i][j + 1] += grid[i][j] * INV;
grid[i][j + 1] += grid[i][j] * INV;
}
}
}
cout << grid[H][W] << endl;
}
};
signed main() {
CRobotOnGrid solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define Rep(i,j,n) for(int i = j; i < (int)(n); i++)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
ll a,b,c;
cin >> a >> b >> c;
if(a == 0 && b == 0) {
cout << '=' << endl;
}else if(a == b){
cout << '=' << endl;
}else if(a >= 0 && b >= 0){
if(a > b) cout << '>' << endl;
else if(a == b) cout << '=' << endl;
else cout << '<' << endl;
}else if(a >= 0 && b < 0){
if(c%2 == 0){
b *= -1;
if(a == b) cout << '=' << endl;
else if(a > b) cout << '>' << endl;
else cout << '<' << endl;
}else{
cout << '>' << endl;
}
}else if(a < 0 && b >= 0){
if(c%2 == 0){
a *= -1;
if(a > b) cout << '>' << endl;
else if(a == b) cout << '=' << endl;
else cout << '<' << endl;
}else{
cout << '<' << endl;
}
}else{
if(c%2 == 0){
a *= -1;
b *= -1;
if(a > b) cout << '>' << endl;
else if(a == b) cout << '=' << endl;
else cout << '<' << endl;
}else{
if(a > b) cout << '>' << endl;
else if(a == b) cout << '=' << endl;
else cout << '<' << endl;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using P = pair<int,int>;
const int INF=1001001001;
const int mod =1e9+7;
vector<bool>seen;
vector<int>ans;
int N,M;
vector<vector<pair<int,int>>>G;
void dfs(int v){
seen[v]=true;
for(auto c:G[v]){
if(seen[c.first]){continue;}
else if(ans[v]==c.second){ans[c.first]=ans[v]%N+1;}
else{ans[c.first]=c.second;}
dfs(c.first);
}
}
int main() {
cin>>N>>M;
ans.resize(N);
G.resize(N);
seen.resize(N,false);
rep(i,M){
int u,v,c;cin>>u>>v>>c;u--;v--;
G[u].push_back({v,c});
G[v].push_back({u,c});
}
ans[0]=1;
dfs(0);
rep(i,N){cout<<ans[i]<<endl;}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
vector<int> siz;
UnionFind(int N) : par(N),siz(N) {
for (int i=0; i<N; i++) {
par[i]=i,siz[i]=1;
}
}
int root(int x) {
if (par[x]==x) return x;
return par[x]=root(par[x]);
}
void unite(int x, int y) {
int rx=root(x);
int ry=root(y);
if (rx==ry) return;
par[rx]=ry;
siz[ry]+=siz[rx];
}
bool same(int x,int y) {
int rx=root(x);
int ry=root(y);
return rx==ry;
}
int size (int x) {
return siz[root(x)];
}
};
int main() {
int N,M;
cin >> N >> M;
vector<vector<pair<int,int>>> G(N);
UnionFind tree(N);
int A[N];
memset(A,0,sizeof(A));
for (int i=0; i<M; i++) {
int u,v,c;
cin >> u >> v >> c;
if (tree.same(u-1,v-1)) continue;
tree.unite(u-1,v-1);
G[u-1].push_back({v-1,c});
G[v-1].push_back({u-1,c});
}
queue<tuple<int,int,int>> q;
for (int i=0; i<N; i++) {
if (G[i].size()==1) {
q.push(make_tuple(i,G[i][0].first,G[i][0].second));//position,position,distance
A[i]=1;
break;
}
}
while (!q.empty()) {
tuple<int,int,int> p=q.front();
q.pop();
int a=get<0>(p),b=get<1>(p),d=get<2>(p);
if (d==A[a]) {
if (d==1) A[b]=2;
else A[b]=1;
}
else A[b]=d;
for (auto x:G[b]) {
int a=x.first;
if (A[a]==0) {
q.push(make_tuple(b,x.first,x.second));
}
}
}
for (int i=0; i<N; i++) cout << A[i] << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H;
int W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
}
}
int a = 0;
int b = 0;
for (int i = 0; i < H-1; i++) {
for (int j = 0; j < W; j++) {
if (data.at(i).at(j) == '.' && data.at(i+1).at(j) == '.'){
a++;
}
}
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W-1; j++) {
if (data.at(i).at(j) == '.' && data.at(i).at(j+1) == '.'){
b++;
}
}
}
cout << a+b << endl;
} | #include<bits/stdc++.h>
using namespace std;
long long int n,k,cnt=0;
struct name
{
long long int bianhao;
long long int x;
}num[200005];
bool cmp(name a,name b)
{
return a.bianhao<b.bianhao;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>n>>k;
for(int i=0;i<n;i++)
{
cin>>num[i].bianhao>>num[i].x;
}
sort(num,num+n,cmp);
long long int index=0;
long long int res=0;
for(long long int i=0;i<n;i++)
{
if(index!=num[i].bianhao)
{
index=num[i].bianhao;
res=i;
}else{
num[res].x+=num[i].x;
num[i].x=0;
}
}
// for(int i=0;i<n;i++)
// {
// cout<<num[i].bianhao<<" "<<num[i].x<<endl;
// }
long long int l=0;
while(1)
{
if(k-(num[cnt].bianhao-l)>=0&&cnt<n)
{
k=k-(num[cnt].bianhao-l);
l=num[cnt].bianhao;
k+=num[cnt].x;
cnt++;
}else{
l+=k;
k=0;
}
if(k<=0)
{
cout<<l;
break;
}
}
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
if(s == "Y") transform(t.begin(), t.end(), t.begin(), ::toupper);
cout << t << "\n";
return 0;
} | #include<iostream>
#include<vector>
#include<chrono>
#include<iomanip>
#include<set>
#include<algorithm>
#include<bitset>
#define int long long
#define fi first
#define se second
using namespace std;
const int MAXN = 205;
const int MOD = 1e9 + 7;
//const int INF = 1e18;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
signed main() {
cin.tie(0);
cout.tie(0);
ios_base :: sync_with_stdio(0);
int n;
string s;
cin >> n >> s;
if (s[0] != s.back()) {
cout << 1;
return 0;
}
for (int i = 1; i < n - 2; i++) {
if (s[i] != s[0] && s[i + 1] != s[0]) {
cout << 2;
return 0;
}
}
cout << -1;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end
int main(){
int n,q;
cin>>n>>q;
vector<ll> a(n+1,0);
rep(i,1,n+1)cin>>a[i];
vector<ll> rui(n+1,0);
rep(i,0,n){
rui[i+1]=rui[i]+(a[i+1]-a[i]-1);
}
while(q--){
ll x;
cin>>x;
int idx=lower_bound(ALL(rui),x)-rui.begin()-1;
x-=rui[idx];
cout<<a[idx]+x<<'\n';
}
return 0;
} | #include<stdio.h>
int main(){
long int n, q, a[100005], k[100005];
scanf("%ld %ld", &n, &q);
for(int i = 0; i < n; i++){
scanf("%ld", &a[i]);
a[i] -= i;
}
for(int i = 0; i < q; i++){
scanf("%ld", &k[i]);
}
long int mid, left, right;
for(int i = 0; i < q; i++){
left = -1;
right = n;
mid = (left + right) / 2;
while((right - left) > 1){
if(k[i] < a[mid]){
right = mid;
}else{
left = mid;
}
mid = (right + left) / 2;
}
printf("%ld\n", k[i] + right);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> tree, depths;
vector<pair<int,int>> times;
int t = 0;
void dfs(int root, int depth) {
times[root].first = t;
depths[depth].push_back(t++);
for (auto v: tree[root]) {
dfs(v, depth + 1);
}
times[root].second = t++;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
tree.resize(n);
depths.resize(n);
times.resize(n);
fill(times.begin(), times.end(), make_pair(0,0));
for (int i = 1; i < n; i++) {
int u; cin >> u; u--;
tree[u].push_back(i);
}
dfs(0, 0);
int q; cin >> q;
while (q--) {
int u,d; cin >> u >> d; u--;
int l = lower_bound(depths[d].begin(), depths[d].end(), times[u].first) - depths[d].begin();
int r = upper_bound(depths[d].begin(), depths[d].end(), times[u].second) - depths[d].begin() - 1;
int ans = max(0, r - l + 1);
cout << ans << '\n';
}
} | #include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define vll vector<int>
#define pii pair<int,int>
#define pb push_back
#define sz(v) (int)(v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(),(v).end()
#define rep(i,a,b) for(int i=a;i<b;++i)
using namespace std;
const int M = 2e5 + 10;
vll g[M];
int n,t,m;
int sz[M],son[M],h[M];
void run(int u,int pa=0){
sz[u]=1;
for(auto v:g[u])if(v!=pa){
h[v]=h[u]+1;
run(v,u),sz[u]+=sz[v];
if(sz[v]>sz[son[u]])son[u]=v;
}
}
int ans[M],sum;
int mx,ch;
vector<pii> q[M];
int cnt[M];
void up(int u,int pa,int y){
// add
cnt[h[u]]+=y?1:-1;
for(auto v:g[u])if(v!=pa and v!=ch) up(v,u,y);
}
void dfs(int u,int pa=0,bool ok=1){
for(auto v:g[u])if(v!=pa and v!=son[u]) dfs(v,u);
if(son[u]) dfs(son[u],u,0),ch=son[u];
up(u,pa,1),ch=0;
// cal answer
for(auto p:q[u]) {
if(p.fi<h[u]) continue;
ans[p.se]=cnt[p.fi];
}
if(ok) up(u,pa,0);
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
rep(i,2,n+1){
int p;
cin>>p;
g[p].pb(i);
}
run(1);
int t;
cin>>t;
rep(i,0,t) {
int u,d;
cin>>u>>d;
q[u].pb({d,i});
}
dfs(1);
rep(i,0,t) cout<<ans[i]<<"\n";
return 0;
} |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstring>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
const int INF=0x7fffffff;
const int eps=1e-7;
const long long mod=1e9+7;
const int maxn=210000;
int n,m,x[maxn],y[maxn];
int main(void)
{
cin>>n>>m;
map<int,set<int>>mp;
for(int i=0;i<m;++i)cin>>x[i]>>y[i],mp[x[i]].insert(y[i]);
set<int>ans;
ans.insert(n);
for(auto it=mp.begin();it!=mp.end();++it)
{
set<int>temp;
for(auto pos:it->second)
{
temp.insert(pos-1);
temp.insert(pos+1);
temp.insert(pos);
}
set<int>pass;
for(auto pos:temp)
{
if(ans.count(pos-1)&&it->second.count(pos)||ans.count(pos)&&!it->second.count(pos)||ans.count(pos+1)&&it->second.count(pos))pass.insert(pos);
}
for(auto pos:temp)
{
if(ans.count(pos))ans.erase(pos);
}
for(auto pos:pass)
{
ans.insert(pos);
}
}
cout<<ans.size()<<endl;
return 0;
}
| #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;
char cn[cm], * ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) { fread_unlocked(cn, 1, cm, stdin); ci = cn; }
return *ci++;
}
inline int getint() {
int A = 0;
int pn = 1;
if (ci - cn + 16 > cm) {
if ((ct = getcha()) == '-') { pn = -1; ct = getcha(); }
A = ct - '0';
while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';;
return pn * A;
}
else {
if ((ct = *ci++) == '-') { pn = -1; ct = *ci++; }
A = ct - '0';
while ((ct = *ci++) >= '0') A = A * 10 + ct - '0';;
return pn * A;
}
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
int N = getint();
int kei = 0;
ll kei2 = 0;
rep(i, N) {
int a = getint();
kei += a;
kei2 += a * a;
}
printf("%lld", kei2 * N - (ll)kei * kei);
Would you please return 0;
} |
//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <string.h>
#include <assert.h>
#include <math.h>
#include <numeric>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <limits>
#include <limits.h>
#include <iomanip>
#include <algorithm>
using namespace std;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define ll long long
#define ull unsigned long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
// Returns factorial of n
long long fact(int n) {
long long res = 1;
for (int i = 2; i <= n; i++)
res *= i;
return res;
}
long long nCr(int n, int r) {
return fact(n) / (fact(r) * fact(n - r));
}
void solve() {
int N, M;
cin >> N >> M;
vector<string> arr(N);
for(auto &x : arr)
cin >> x;
long long cnt1_even = 0, cnt1_odd = 0;
for(int i = 0; i < N; i++) {
int cnt = 0;
for(auto &x : arr[i]) {
if(x == '1')
cnt++;
}
if(cnt%2==1)
cnt1_odd++;
else
cnt1_even++;
}
long long ans = cnt1_even * cnt1_odd;
cout << ans;
}
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
IOS;
int t = 1;
//cin >> t;
while(t--) {
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;
}
void Main(){
I(ll, N, M);
vl P(2);
ll cnt = 0;
REP(i, N){
I(string, _S);
ll X = stoi(_S, nullptr, 2);
ll parity = __builtin_parity(X);
cnt += P[!parity];
P[parity]++;
}
cout << cnt << el;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define db double
#define pb push_back
#define all(x) begin(x), end(x)
#define SZ(x) (int)(x).size()
#define cps(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define cps2(x, y) sort(all(x), y), (x).erase(unique(all(x)), end(x))
#define mem(x, y) memset(& x, y, sizeof(x))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int n0 = 2e5 + 123;
ll a[n0], b[n0];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n; cin >> n; for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
//cerr << a[i] << ' ';
}
ll res = 0, mx = 0;
for (int i = 1; i <= n; i++) {
mx = max(mx, a[i]);
ll tmp = b[i - 1] + mx;
b[i] = b[i - 1] + a[i];
res = max(res, max(b[i], tmp));
}
cout << res;
}
| #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <unordered_map>
#include <vector>
#include <queue>
#include<deque>
using namespace std;
const int mod = 1e9 + 7;
typedef long long LL;
int ans[110] = {1,2,3,3,1,3,2,2,1,2,1,1,1,3,1,1};
int f[1010];
int b[1010];
int n;
void solve()
{
scanf("%d",&n);
int state = 0;
for(int i = 0;i < 4;i ++)
{
int a;
scanf("%s",&a);
state |= (a - 'A') << i;
}
f[2] = 1;
b[0] = 1;
for(int i = 3;i <= n;i ++) f[i] = ((LL)f[i] + f[i - 1] + f[i - 2]) % mod;
for(int i = 1;i <= n - 3;i ++) b[i] = (LL)b[i - 1] * 2 % mod;
if(n < 3) printf("1\n");
else if(ans[state] == 1) printf("1\n");
else if(ans[state] == 2) printf("%d\n",f[n]);
else if(ans[state] == 3) printf("%d\n",b[n - 3]);
}
int main()
{
int T = 1;
//scanf("%d",&T);
while(T --)
{
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int p[20]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47},cnt=15;
int n,pos[50],a;
long long ans=2e18;
int main()
{
scanf("%d",&n);
for(int t=1;t<=n;++t) {
scanf("%d",&a);
for(int i=0;i<cnt;++i) if(a%p[i]==0) pos[t]|=(1<<i);
}
for(int i=0;i<(1<<cnt);++i) {
int flag=1;
for(int j=1;j<=n;++j) {
if((i&pos[j])==0) {flag=0;break;}
}
if(flag) {
long long tmp=1;
for(int j=0;j<cnt;++j) if((i>>j)&1) tmp*=p[j];
ans=min(ans,tmp);
}
}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;
vector<ll> sieve(ll n) {
vector<ll> p(n);p[2]=2;
for(ll i=3;i<n;i+=2)p[i]=i;
for(ll i=3;i*i<n;i+=2)if(p[i])for(ll j=i*i;j<n;j+=i)p[j]=0;
p.erase(remove(p.begin(), p.end(), 0), p.end());
return p;
}
void Main() {
vector<ll> p=sieve(50);
ll n;
cin >> n;
ll a[n];
rep(i,n) R a[i];
ll ans=MAXL;
rep(t,1<<p.size()) {
ll x=1;
rep(i,p.size()) {
if(t&(1<<i)) x*=p[i];
}
rep(i,n) {
ll d=__gcd(x,a[i]);
if(d==1) goto next;
}
ans=min(ans,x);
next:;
}
pr(ans);
}
int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
|
#include<bits/stdc++.h>
using namespace std;
int ans = 0;
int H,W;
char field[100][100];
void cal(int x, int y){
//上
if(x >= 0 && y-1>=0 && x<W && y-1<H){
if(field[y-1][x] == '.'){
ans++;
}
}
//右
if(x+1 >= 0 && y>=0 && x+1<W && y<H){
if(field[y][x+1] == '.'){
ans++;
}
}
//左
if(x-1 >= 0 && y>=0 && x-1<W && y<H){
if(field[y][x-1] == '.'){
ans++;
}
}
//下
if(x >= 0 && y+1>=0 && x<W && y+1<H){
if(field[y+1][x] == '.'){
ans++;
}
}
}
int main(){
cin >> H >> W;
for(int i = 0;i<H;i++){
for(int j = 0;j<W;j++){
cin >> field[i][j];
}
}
for(int i = 0;i<H;i++){
for(int j = 0;j<W;j++){
if(field[i][j] == '.'){
field[i][j] = '#';
cal(j,i);
}
}
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#define ordered_set tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
//#define int long long int
#define pb push_back
#define vec vector<int>
#define fo(i, n) for (int i = 0; i < n; i++)
#define foo(i, a, b) for (int i = a; i < b; i++)
#define mp make_pair
#define mod 1000000007
//#define mod 998244353
#define so(v) sort(v.begin(), v.end())
#define fi first
#define se second
void __print(int x)
{
cerr << x;
}
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float 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...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
int power(int x, unsigned int y, int p)
{
int res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int mI(int a, int m)
{
return power(a, m - 2, m);
}
//__builtin_popcount
vector<vector<int>>
dir = {{0, 1}, {1, 0}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
#define double long double
void solve()
{
int n, m;
cin >> n >> m;
vector<string> v(n);
int ans = 0;
fo(i,n){
cin >> v[i];
}
fo(i,n){
fo(j,m){
fo(k,2){
int i1 = i + dir[k][0];
int j1 = j + dir[k][1];
if(i1>=0&&i1<n&&j1>=0&&j1<m&&v[i][j]=='.'&&v[i1][j1]=='.'){
ans++;
}
}
}
}
cout << ans << "\n";
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
srand(time(0));
// FILE *fin = freopen("ip.txt","r",stdin);
// FILE *fout = freopen("op.txt","w",stdout);
int t = 1, nn = 1;
//cin >> t;
while (t--)
{
// cout << "Case #" << nn << ":"
// << " ";
// nn++;
solve();
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end());reverse(v.begin(),v.end());}
template<class T> void print(vector<T> v) {rep(i,v.size()) cout<<v[i]<<endl;}
using F=long long;
F e=0;
int MAX_N=131072*4;
std::vector<F> segment(MAX_N*2-1,e);
F segment_function(F a,F b){
return a^b;
}
void pu_fanction(F &a,F b){
a^=b;
}
namespace po167{
F get(int k){return segment[k+MAX_N-1];}
F qu_sub(int a,int b,int l,int r,int k){
if(b<=l||r<=a) return e;
if(a<=l&&r<=b) return segment[k];
else{
F X=qu_sub(a,b,l,(r+l)/2,k*2+1);
F Y=qu_sub(a,b,(l+r)/2,r,k*2+2);
return segment_function(X,Y);
}
}
F qu(int a,int b){return qu_sub(a,b,0,MAX_N,0);}
// get(k)=a
void replace(int k,F a){
k+=(MAX_N-1);
segment[k]=a;
while(k>0){
k--;
k/=2;
segment[k]=segment_function(segment[k*2+1],segment[k*2+2]);
}
}
//get(k) ◯ a
void pu(int k,F a){
k+=(MAX_N-1);
pu_fanction(segment[k],a);
while(k>0){
k--;
k/=2;
segment[k]=segment_function(segment[k*2+1],segment[k*2+2]);
}
}
};
using namespace po167;
//main関数だよーーー
int main(){
ll N,q;
cin>>N>>q;
rep(i,N){
ll a;
cin>>a;
replace(i,a);
}
vector<F> ans;
rep(i,q){
ll t,x,y;
cin>>t>>x>>y;
x--;
if(t==1) pu(x,y);
else ans.push_back(qu(x,y));
}
print(ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef signed char i8;
typedef signed short i16;
typedef signed int i32;
typedef signed long long i64;
typedef unsigned char u8;
typedef unsigned short u16;
typedef unsigned int u32;
typedef unsigned long long u64;
typedef float f32;
typedef double f64;
u32 XOR(u32 a,u32 b) {
return a ^ b;
}
template <typename T>
struct seg {
vector<T> tree;
u64 B;
T (*fn)(T,T);
seg(u64 n,T (*func)(T,T)) {
fn = func;
B = 1;
while (B < n)
B *= 2;
tree.resize(2 * B, (T)0);
}
void add(u64 k, T x) {
u64 p = B + k;
tree[p] = fn(tree[p], x);
while (p > 1) {
p = p / 2, tree[p] = fn(tree[2 * p], tree[2 * p + 1]);
}
}
T query(u64 l, u64 r) {
l += B, r += B;
T res = (T)0;
while (l <= r) {
if (l % 2 == 1)
res = fn(res, tree[l++]);
if (r % 2 == 0)
res = fn(res, tree[r--]);
l /= 2, r /= 2;
}
return res;
}
};
i32 main() {
#ifdef LOCAL
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
u32 n, q;
cin >> n >> q;
seg<u32> a(n, &XOR);
for (u32 i = 0; i < n; i++) {
u32 e;
cin >> e;
a.add(i, e);
}
for (u32 i = 0; i < q; i++) {
u32 ty, x, y;
cin >> ty >> x >> y;
if(ty == 1) {
a.add(x -1, y);
}
else
cout << a.query(x - 1, y - 1) << "\n";
}
return 0;
}
|
#include<cstdio>
#include<cstring>
#define N 300001
#define mod 1000000007
using namespace std;
char ch1[N],ch[N];
int k,cnt[N],lim[N];
long long pre[N],answer[N],qz[17][N],c[17][17];
bool bo[N];
long long C(int n,int m)
{
return c[n][m];
}
int main()
{
scanf("%s",ch1+1);
scanf("%d",&k);
int p=strlen(ch1+1);
c[0][0]=1;
for (int i=1;i<=16;i++)
{
c[i][0]=1;
for (int j=1;j<=i;j++) c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
}
for (int i=1;i<=p;i++)
{
lim[i]=ch1[i]-'0';
if (!(0<=lim[i]&&lim[i]<=9)) lim[i]=ch1[i]-'A'+10;
}
for (int i=1;i<=16;i++)
{
qz[i][0]=1;
for (int j=1;j<=p;j++)
qz[i][j]=qz[i][j-1]*i%mod;
}
memset(bo,false,sizeof(bo));
long long ans=0;
int cnt=0;
for (int i=1;i<p;i++)
{
for (int j=1;j<=15;j++)
{
for (int s=1;s<=k;s++)
pre[s]=qz[s][i-1];
for (int s=1;s<=k;s++)
{
answer[s]=pre[s];
for (int s1=1;s1<s;s1++)
answer[s]=(answer[s]-answer[s1]*C(s-1,s1-1)%mod)%mod;
}
ans=(ans+answer[k]*C(15,k-1)%mod)%mod;
}
}
for (int i=1;i<=p;i++)
{
if (cnt>k) break;
for (int j=0;j<lim[i];j++)
{
if (i==1&&j==0) continue;
int newcnt=cnt;
if (!bo[j]) newcnt++;
// if (i==1&&j==0&&bo[j]) newcnt--;
for (int s=k;s>=newcnt;s--)
pre[s]=qz[s][p-i];
for (int s=newcnt;s<=k;s++)
{
answer[s]=pre[s];
for (int s1=newcnt;s1<s;s1++)
answer[s]=(answer[s]-answer[s1]*C(s-newcnt,s1-newcnt)%mod)%mod;
}
ans=(ans+answer[k]*C(16-newcnt,k-newcnt)%mod)%mod;
}
if (!bo[lim[i]])
bo[lim[i]]=true,cnt++;
}
if (cnt==k) ans++;
printf("%lld\n",ans);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Pint pair<int,int>
#define Pll pair<ll,ll>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000;
constexpr ll llINF=1000000000000000000;
constexpr int mod=1000000007;
constexpr double eps=1e-8;
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
random_device rnd;
mt19937 mt(rnd());//32bit
//[mi,ma]
uniform_int_distribution<int>engine(mi,ma);
return engine(mt);
}
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;
}
bool prime(int a){
if(a==1)return false;
for(int i=2;i*i<=a;i++){
if(a%i==0)return false;
}
return true;
}
ll modpow(ll a,ll b){
if(b==0)return 1;
if(b%2)return modpow(a,b-1)*a%mod;
ll memo=modpow(a,b/2);
return memo*memo%mod;
}
vector<ll>kaijo,invkaijo;
void init_fact(int n){
kaijo.resize(n+1);
invkaijo.resize(n+1);
kaijo[0]=1;
for(ll i=1;i<=n;i++){
kaijo[i]=kaijo[i-1]*i;
kaijo[i]%=mod;
}
rep(i,n+1)invkaijo[i]=modpow(kaijo[i],mod-2);
}
vector<vector<ll>>C,sC;
void init_comb(int n,int m){
C.resize(n+1,vector<ll>(m+1,0));
sC.resize(n+1,vector<ll>(m+1,0));
C[0][0]=1;
for(int i=1;i<=n;i++){
C[i][0]=1;
for(int j=1;j<=m;j++){
C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
}
}
rep(i,n+1){
rep(j,m){
sC[i][j+1]=(sC[i][j]+C[i][j])%mod;
}
}
}
ll comb(int a,int b){
if(a<b)return 0;
if(a<0||b<0)return 0;
return kaijo[a]*invkaijo[a-b]%mod*invkaijo[b]%mod;
}
ll inv(ll x){
x=modpow(x,mod-2);
return x;
}
double dp[111][111][111];
int main(){
int a,b,c;
cin>>a>>b>>c;
dp[a][b][c]=1;
for(int i=a;i<100;i++){
for(int j=b;j<100;j++){
for(int k=c;k<100;k++){
dp[i+1][j][k]+=dp[i][j][k]*i/(i+j+k);
dp[i][j+1][k]+=dp[i][j][k]*j/(i+j+k);
dp[i][j][k+1]+=dp[i][j][k]*k/(i+j+k);
}
}
}
double ans=0;
rep(i,101){
rep(j,101){
rep(k,101){
if(i==100||j==100||k==100){
ans+=dp[i][j][k]*(i+j+k-a-b-c);
}
}
}
}
printf("%.12lf\n",ans);
return 0;
} |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
#endif
ll b, c;
cin>>b>>c;
pll ara[4];
if(b > 0){
ara[0] = {-b - (c - 1) / 2, -b};
ara[1] = {b, max(b, - (- b - c / 2) - 1)};
ara[2] = {b - c / 2, b};
ara[3] = {-b, -(b - (c - 1) / 2)};
}else if(b < 0){
ara[0] = {b - c / 2, b};
ara[1] = {-b, -b + (c - 1) / 2};
ara[2] = {-b - (c - 1) / 2, -b};
ara[3] = {b, - (-b - c / 2 + 1)};
}else if(b == 0){
ara[0] = {-c / 2, 0};
ara[1] = {0, (c - 1) / 2};
ara[2] = {0, 0};
ara[3] = {0, 0};
}
sort(ara, ara + 4);
ll cur = -3e18;
ll ans = 0;
for(pll u: ara){
//cerr<<u.ff<<" "<<u.ss<<endl;
if(u.ff > cur){
ans += u.ss - u.ff + 1;
cur = u.ss;
}else{
ans += max(0LL, u.ss - cur);
cur = max(cur, u.ss);
}
}
cout<<ans<<endl;
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++);
using i64=int64_t ;
int main() {
i64 b, c;
cin >> b >> c;
i64 ans;
if(c==0) {
ans=1;
}
if(c!=0 && b==0) {
ans=c;
}
if(0<c && c<=2 && b!=0) {
ans=c+1;
}
if(3<=c && b!=0 && 2*abs(b)>=c) {
ans=3+(c-2)*2;
}
if(3<=c && b!=0 && 2*abs(b)<c) {
if(b<0) {
ans=c-2*b;
} else if(b>0) {
ans=c+2*b-1;
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using lp = pair<ll, ll>;
using lmap = map<int, int>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
#define debug(x) cerr << #x << ": " << x << '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (ll i = (ll)(n); i < (ll)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define eb emplace_back
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1 << 30;
constexpr ll LINF = 1LL << 62;
inline int mod(ll a, int m = MOD) { return (a % m + m) % m; }
inline bool bit(ll b, ll i) { return b & (1 << i); }
inline ll ceiv(ll a, ll b) { return (a + b - 1) / b; }
inline void ans_exit(string msg) { cout << msg << endl; exit(0); }
template<class T> bool chmin(T &a, T b) {if(a > b){a = b; return 1;} return 0;}
template<class T> bool chmax(T &a, T b) {if(a < b){a = b; return 1;} return 0;}
int main() {
ll n; cin >> n;
vector<ll> p(n);
rep(i, n) {
cin >> p[i];
p[i]--;
}
vl pos(n);
rep(i, n) pos[p[i]] = i;
set<ll> swapped; vl ans;
rep(i, n) {
while(pos[i] != i) {
pos[p[pos[i] - 1]]++;
swap(p[pos[i]], p[pos[i] - 1]);
pos[i]--;
if(swapped.count(pos[i])) ans_exit("-1");
swapped.insert(pos[i]);
ans.pb(pos[i]);
}
}
if((int)ans.size() != n - 1) ans_exit("-1");
rep(i, n - 1) cout << ans[i] + 1 << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define sf(x) scanf("%d",&x)
#define sfl(x) scanf("%lld",&x)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define endl '\n'
#define pii pair<int,int>
#define mapii map<int,int>
#define mapll map<ll,ll>
#define mapci map<char,int>
#define mapcl map<char,ll>
#define mapsi map<string,int>
#define mapsl map<string,ll>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define vd vector<double,double>
#define all(c) c.begin(),c.end()
#define F first
#define S second
#define mp make_pair
#define PI acos(-1)
#define lcm(a,b) ((a*b)/__gcd(a,b))
#define optimize ios_base::sync_with_stdio(false);cin.tie(NULL);
#define sqr(a) ((a)*(a))
#define max5 100000
#define max6 1000000
#define mod 1000000
vi pt;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
int n,k,i,a,j;
cin >> n;
int ar[n+10];
int po[n+10];
int vis[n+10]={0};
int ok = 1;
for(i=1; i<=n; i++)
{
cin >> ar[i];
po[ar[i]] = i;
}
for(i=1;i<=n;i++)
{
if(vis[i])
{
if(i!=ar[i])return cout<<-1<<endl,0;
continue;
}
int st = po[i];
for(j=st-1;j>=i;j--)
{
swap(ar[j],ar[j+1]);
pt.pb(j);
vis[j]=1;
}
}
if(pt.size()!=n-1)return cout << -1 << endl,0;
for(auto x : pt)cout << x << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define M1 1000000007
#define M2 998244353
#define INF 1e18
#define ll long long
#define pll pair<ll,ll>
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define REPR(i,a,b) for(ll i=b-1;i>=a;i--)
#define forr(i,n) for(ll i=0;i<n;i++)
#define F first
#define S second
#define pb push_back
#define DB pop_back
#define mp make_pair
#define MT make_tuple
#define V(a) vector<a>
#define vi vector<int>
#define vlli vector <long long>
#define endl '\n'
#define ce(ele) cout<<ele<<' '
#define cs(ele) cout<<ele<<'\n'
#define CASE(t) ll t; cin>>t; while(t--)
/********************************************************************/
const double pi = 3.1415926535;
/********************************************************************/
//FAST IO//
void FAST() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
/********************************************************************/
int main()
{
FAST();
ll int s,p; cin>>s>>p;
int flag=0;
for (ll int i=1; i*i<=p; i++)
{
if (p%i==0)
{
if (i+p/i == s){flag=1; }
}
}
if (flag==1){cout<<"Yes"<<endl; }
else {cout<<"No"<<endl; }
} | #include"bits/stdc++.h"
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define i64 int64_t
#define deb(x) cout<<"["<<#x<<"="<<x<<"]"<<"\n"
#define pb push_back
int main()
{
fast;
i64 a,b;
cin>>a>>b;
for(i64 i = 1;i<=(sqrt(b));++i)
{
// deb(i)// deb(j);
i64 j = (b/i);
if((i*j)==b&&(i+j)==a)
{
cout<<"Yes";
goto next;
}
}
cout<<"No";
next:cout<<"\n";
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.