code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,D,H;
cin >> N >> D >> H;
vector <float> dnum(N);
vector <float> hnum(N);
for(int i=0;i<N;i++){
cin >> dnum[i] >> hnum[i];
}
float lean = 1000;
for(int i=0;i<N;i++){
hnum[i] = H-hnum[i];
dnum[i] = D-dnum[i];
if((hnum[i]/dnum[i]) < lean)
lean = hnum[i]/dnum[i];
}
float b = 0;
b = H - lean*D;
if(b < 0)
b = 0;
cout << b << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define LLA(v) (v).rbegin(), (v).rend()
#define SZ(v) (v).size()
#define INT(...) \
int __VA_ARGS__; \
read(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
read(__VA_ARGS__)
#define DOUBLE(...) \
double __VA_ARGS__; \
read(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
read(__VA_ARGS__)
#define STRING(...) \
string __VA_ARGS__; \
read(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
read(name)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
int to;
T cost;
edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
template <class T> inline vector<T> make_vec(size_t a, T val) {
return vector<T>(a, val);
}
template <class... Ts> inline auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
void read() {}
template <class T> inline void read(T &a) { cin >> a; }
template <class T, class S> inline void read(pair<T, S> &p) {
read(p.first), read(p.second);
}
template <class T> inline void read(vector<T> &v) {
for(auto &a : v)
read(a);
}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
read(head), read(tail...);
}
template <class T> inline void chmax(T &a, T b) { (a < b ? a = b : a); }
template <class T> inline void chmin(T &a, T b) { (a > b ? a = b : a); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
INT(n, m, k);
VEC(int, a, k);
vector<bool> trap(n + 1);
rep(i, k) { trap[a[i]] = 1; }
int len = 0;
rep(i, n + 1) {
if(trap[i] == 1)
len++;
else {
len = 0;
}
if(len >= m) {
cout << -1 << endl;
return 0;
}
}
auto dp = make_vec(n + 1, make_pair(0.0, 0.0));
dp[n] = {0, 0};
double x = 0, y = 0;
for(int i = n - 1; i >= 0; i--) {
if(!trap[i])
dp[i] = {x / m, y / m + 1};
else
dp[i] = {1, 0};
x += dp[i].first;
y += dp[i].second;
if(i + m <= n) {
x -= dp[i + m].first;
y -= dp[i + m].second;
}
}
double b = dp[0].first, c = dp[0].second;
cout << fixed << setprecision(10) << c / (1 - b) << endl;
} |
/**
* author: tourist
* created: 15.12.2020 16:15:36
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
string t;
cin >> s;
cin >> t;
vector<int> p;
int ptr = 0;
int last = -1;
long long ans = 0;
for (int i = 0; i < n; i++) {
if (t[i] == '1') {
p.push_back(i);
}
if (s[i] == '1') {
if (last != -1) {
ans += i - last;
last = -1;
} else {
if (ptr < (int) p.size()) {
ans += i - p[ptr++];
} else {
last = i;
}
}
}
}
if (last != -1 || ptr < (int) p.size()) {
ans = -1;
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ll mod2 = 998244353;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> X(n), Y(n);
rep(i, n) cin >> X[i] >> Y[i];
int ans = 0;
rep(i, n) REP(j, i+1, n) {
if(-abs(X[j]-X[i]) <= (Y[j]-Y[i]) && (Y[j]-Y[i]) <= abs(X[j]-X[i])) ans++;
}
cout << ans << endk;
return 0;
}
|
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vpii vector<pii>
#define V vector
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F first
#define S second
#define sqr(x) (x)*(x)
#define mp make_pair
#define mtp make_tuple
#define tpii tuple<int,int,int>
#define ckmax(a,b) a=max(a,b)
#define ckmin(a,b) a=min(a,b)
#define rep(n) for(int i=0;i<n;i++)
#define inf INT_MAX
#define debug(x) cerr<<x<<'\n';
#define quick ios_base::sync_with_stdio(0),cin.tie(0);long double nownow=clock();
#define total_time cerr<<(clock()-nownow)/CLOCKS_PER_SEC*1000<<" (ms)\n";
using namespace std;
template<typename T>void in(vector<T> &a){for(auto &i:a)cin>>i;}
template<typename T>void in(vector<T> &a,int n){for(auto i=0;i<n;i++)cin>>a[i];}
template<typename T>void out(vector<T> &a){for(auto &i:a)cout<<i<<' ';cout<<'\n';}
#define int long long
#define input freopen("/Users/wangkaiyu/Downloads/Q_6_24_3.in","r",stdin);
signed main(){
quick
int n,k;
cin>>n>>k;
cout<<(n*n+n)*k*50+(k*k+k)/2*n;
cout<<'\n';
total_time
return 0;
}
| #include<bits/stdc++.h>
#define lli long long
#define lld double
#define test int t;cin>>t;while(t--)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define mod 1000000007
#define ff first
#define ss second
#define ppl pair<lli , lli>
#define ppi pair<int , int>
#define large 1000000000000000000
using namespace std;
bool comp(const ppl &a,const ppl &b)
{
return (a.ss < b.ss);
}
void solve()
{
int n , k , ans = 0;
cin >> n >> k;
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= k ; j++)
{
int x = 100*i + j;
ans += x;
}
}
cout << ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r" , stdin);
freopen("output.txt", "w" , stdout);
#endif
fast_io;
//test
{
solve();
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;
#define fi first
#define se second
#define pb push_back
#define nn "\n"
#define all(p) p.begin(),p.end()
#define zz(v) (ll)v.size()
#define S(a) scanf("%lld",&a)
#define SS(a,b) scanf("%lld %lld",&a,&b)
#define SSS(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define ss ' '
#define pii pair<ll,ll>
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
ll a,b,c;
cin>>a>>b>>c;
cout<<(7-a)+(7-b)+(7-c)<<nn;
}
/* Final check before submit :
1. array size or integer overflow,like uninitialised 0 index.
2. Think twice,code once.check all possible counter test case.
3. Be careful about corner case! n=1?k=1? something about 0?
4. avoid stupid mistake!complexity(t/m)?precision error?submit same code twice?
5. if got WA than remember that you are missing something common.
*** Be confident!!! who knows? may be your one step back to AC ***
4. minus mod ans=(ans-k+mod)%mod;
*/
/* IF WA???
1. corner case! n=1?k=1? something about 0?
2. check code(avoid stupid mistake)
3. read the statement again(if there any missing point???)
4. check the idea(check all possible counter test case again!!!)
5. be calm,don't be panic!!!.(***this problem not going to decide your future***)
6. don't waste too much time. move to next problem
*/
| //#include <atcoder/all>
#include <bits/stdc++.h>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 最大公約数
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
// mod m におけるa の逆元
ll modinv(ll a, ll m) {
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;
}
// 素因数分解
vector<pair<ll, ll>> prim;
void pf(ll n)
{
ll s = sqrt(n);
ll r = 0;
for(ll i = 2; i <= s; i++) {
if((n % i) == 0) {
r = 0;
do {
r++;
n = n / i;
} while((n % i) == 0);
prim.push_back({i, r});
}
}
if(n > s) {
prim.push_back({n, 1});
}
}
// ２項係数
/*
ll ncrmod(ll n, ll r)
{
ll ans;
return ans;
}
*/
// 繰り返し二乗法
ll powmod(int a, int n){//aのn乗を計算します(MOD)。
ll x = 1;
while(n > 0){//全てのbitが捨てられるまで。
if(n&1){//1番右のbitが1のとき。
x = (x*a) % MOD;
}
a = (a*a) % MOD;
n >>= 1;//bit全体を右に1つシフトして一番右を捨てる。
}
return x;
}
void solve()
{
ll N; cin >> N;
string s; cin >> s;
string t; cin >> t;
vector<int> s0, t0;
rep(i, N) {
if(s[i] == '0') s0.push_back(i);
if(t[i] == '0') t0.push_back(i);
}
if(s0.size() != t0.size()) {
cout << -1 << endl;
return ;
}
ll ans = 0;
rep(i, s0.size()) {
if(s0[i] != t0[i]) ans ++;
}
cout << ans << endl;
}
int main(void)
{
// ll t; cin >> t; rep(i, t)
solve();
}
|
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
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; }
constexpr int dy[4]={-1,0,1,0};
constexpr int dx[4]={0,-1,0,1};
struct UnionFind{
private:
vector<int> par;
vector<int> siz;
public:
UnionFind(int N=0){
init(N);
}
void init(int N){
par.resize(N);
siz.resize(N);
for(int i=0; i<N; i++) par[i] = i;
for(int i=0; i<N; i++) siz[i] = 1;
}
void unite(int a, int b){
int rootA = root(a);
int rootB = root(b);
if(rootA == rootB) return;
if(siz[rootA] < siz[rootB]) swap(rootA, rootB);
par[rootB] = rootA;
siz[rootA] += siz[rootB];
}
int root(int a){
if(par[a] == a) return a;
return par[a] = root(par[a]);
}
bool same(int a, int b){
return root(a) == root(b);
}
int size(int a){
return siz[root(a)];
}
};
int H, W;
string S[1000];
UnionFind uf;
bool ok[1000][1000];
signed main(){
cin >> H >> W;
rep(i, H) cin >> S[i];
uf.init(H*W);
rep(i, H) ok[i][0] = ok[i][W-1] = true;
rep(i, W) ok[0][i] = ok[H-1][i] = true;
rep(i, H){
int bef = -1;
rep(j, W){
if(S[i][j] == '#'){
if(bef != -1){
int a = uf.root(i*W+j);
int b = uf.root(i*W+bef);
uf.unite(i*W+j, i*W+bef);
int r = uf.root(i*W+j);
ok[r/W][r%W] |= ok[a/W][a%W];
ok[r/W][r%W] |= ok[b/W][b%W];
}
bef = j;
}
}
}
rep(i, W){
int bef = -1;
rep(j, H){
if(S[j][i] == '#'){
if(bef != -1){
int a = uf.root(j*W+i);
int b = uf.root(bef*W+i);
uf.unite(j*W+i, bef*W+i);
int r = uf.root(j*W+i);
ok[r/W][r%W] |= ok[a/W][a%W];
ok[r/W][r%W] |= ok[b/W][b%W];
}
bef = j;
}
}
}
int base = 0;
rep(i, H){
rep(j, W){
if(S[i][j] == '#' && uf.root(i*W+j) == i*W+j && !ok[i][j]){
base++;
}
}
}
// 横
int ans1 = 0;
rep(i, H){
if(i == 0 || i == H-1) continue;
bool ex = false;
rep(j, W){
if(S[i][j] == '#') ex = true;
}
if(!ex) ans1++;
}
// 縦
int ans2 = 0;
rep(j, W){
if(j == 0 || j == W-1) continue;
bool ex = false;
rep(i, H){
if(S[i][j] == '#') ex = true;
}
if(!ex) ans2++;
}
cout << base + min(ans1, ans2) << endl;
} | #include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t){
while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef DEBUG
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr<<#x<<": "; for(auto i:x) cerr<<i<<" "; cerr<<endl;}}
#define debugr(l, r, x) {{cerr<<#x<<": "; for(int i=l;i<=r;i++) cerr<<x<<" "; cerr<<endl;}}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define debugr(l, r, x)
#define cerr while(0) cerr
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define priority_queue std::priority_queue
#define F first
#define S second
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
char a[1005][1005];
bool vis[3005];
vi adj[3005];
void dfs(int x){
vis[x]=true;
for(int y:adj[x]){
if(!vis[y]) dfs(y);
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int h, w;
cin>>h>>w;
set<int> row, col;
auto add=[&](int x, int y){
adj[x].push_back(h+y);
adj[h+y].push_back(x);
row.insert(x);
col.insert(h+y);
};
add(1, 1);
add(1, w);
add(h, 1);
add(h, w);
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cin>>a[i][j];
if(a[i][j]=='#'){
add(i, j);
}
}
}
int ccs=0;
for(int i:row){
if(!vis[i]){
dfs(i);
ccs++;
}
}
for(int i:col){
if(!vis[i]){
dfs(i);
ccs++;
}
}
debug(row.size(), col.size());
cout<<ccs+min(h-row.size(), w-col.size())-1<<endl;
} |
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
ll H, W;
cin >> H >> W;
vector<string> S(H);
vector<vector<int> > cnt(H);
for (int i = 0; i < H; i++) cin >> S[i];
ll K = 0;
for (int i = 0; i < H; i++) {
cnt[i].resize(W);
int l = 0;
for (int j = 0; j <= W; j++) {
if (j == W || S[i][j] == '#') {
for (int k = j - 1; k >= max(0, j - l); k--) {
cnt[i][k] += l;
}
l = 0;
} else { // if (S[i][j] == '.') {
l++;
K++;
}
}
}
for (int j = 0; j < W; j++) {
int l = 0;
for (int i = 0; i <= H; i++) {
if (i == H || S[i][j] == '#') {
for (int k = i - 1; k >= max(0, i - l); k--) {
cnt[k][j] += l;
}
l = 0;
} else {
l++; // if (S[i][j] == '.') l++;
}
}
}
vector<ll> p2ma;
ll v = 1;
for (int x = 0; x <= 4000000; x++) {
p2ma.push_back(v);
v *= 2;
v %= 1000000007;
}
ll tot = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (cnt[i][j] > 0) {
cnt[i][j]--;
ll ij = ((p2ma[cnt[i][j]] - 1) * (p2ma[K - cnt[i][j]])) % 1000000007;
tot += ij;
tot = tot % 1000000007;
}
}
}
cout << tot << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define PI 3.14159265359
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll mod = 1000000007;
bool field[2000][2000];
int ltor[2000][2000];
int rtol[2000][2000];
int ttob[2000][2000];
int btot[2000][2000];
ll pow2[4000001];
int main() {
int h, w;
cin >> h >> w;
ll maxLight = 0;
rep(i, h) {
string s;
cin >> s;
rep(j, w) {
if (s[j] == '.') { field[i][j] = true; maxLight++; }
else field[i][j] = false;
}
}
rep(i, h) {
int cnt = 0;
rep(j, w) {
if (field[i][j]) {
cnt++;
} else {
cnt = 0;
}
ltor[i][j] = cnt;
}
cnt = 0;
for (int j = w - 1; j >= 0; j--) {
if (field[i][j]) {
cnt++;
} else {
cnt = 0;
}
rtol[i][j] = cnt;
}
}
rep(i, w) {
int cnt = 0;
rep(j, h) {
if (field[j][i]) {
cnt++;
} else {
cnt = 0;
}
ttob[j][i] = cnt;
}
cnt = 0;
for (int j = h - 1; j >= 0; j--) {
if (field[j][i]) {
cnt++;
} else {
cnt = 0;
}
btot[j][i] = cnt;
}
}
/*rep(i, h) {
rep(j, w) cout << ltor[i][j] << " ";
cout << endl;
}
rep(i, h) {
rep(j, w) cout << rtol[i][j] << " ";
cout << endl;
}*/
ll total = 1;
rep(i, maxLight) total = (2 * total) % mod;
ll pow = 1;
rep(i, h * w + 1) {
pow2[i] = pow;
pow = (pow * 2) % mod;
}
//cout << "total " << total << endl;
ll ans = 0;
rep(i, h) rep(j, w) {
if (field[i][j]) {
int cnt = ltor[i][j] + (j + 1 < w ? rtol[i][j + 1] : 0)
+ (i > 0 ? ttob[i - 1][j] : 0) + (i + 1 < h ? btot[i + 1][j] : 0);
//cout << i << " " << j << " " << cnt << endl;
ans = (ans + total - pow2[maxLight - cnt] + mod) % mod;
}
}
cout << ans << endl;
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 out(x) cout<<setprecision(15)<<x<<endl,exit(0)
#define pii pair<int,int>
#define pb push_back
#define all(v) v.begin(),v.end()
#define I first
#define S second
#define ld long double
ld pi=3.14159265359;
const int N=1e5+9;
int n,m,vis[N],ans[N];
vector <pii> v[N];
int slv(int x){
x++;
if(x>n) x=1;
return x;
}
void dfs(int x,int prv){
ans[x]=prv;
vis[x]=1;
for(auto it:v[x]){
if(vis[it.I]) continue;
if(it.S==prv) dfs(it.I,slv(prv));
else dfs(it.I,it.S);
}
}
int32_t main(){
ios;
cin>>n>>m;
F(i,1,m){
int x,y,w;
cin>>x>>y>>w;
v[x].pb({y,w});
v[y].pb({x,w});
}
dfs(1,1);
F(i,1,n) cout<<ans[i]<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define pi 2*acos(0.0)
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
// debug templates
#define debug(x) cerr<< #x <<" : "<< x << endl;
#define debuga(A,N) cerr<< #A <<" : [";for(int i = 0; i<N;i++) cerr<<A[i]<<" "; cerr<<"]\n";
#define debuga2(A,N,M) cerr<< #A << " : \n"; for(int i=0;i<N;i++){cerr<<"[";for(int j=0;j<M;++j) cerr<<A[i][j]<<" ";cerr<<"]\n";}
#define debugp(p) cerr<< #p <<" : "<<"("<<(p).first<<","<<(p).second<<")\n";
#define debugv(v) cerr<< #v <<" : "<<"[";for(int i = 0; i< (v).size(); i++) cerr<<v[i]<<" "; cerr<<"]\n";
#define debugv2(v) cerr<< #v << " : \n"; for(int i=0;i<v.size();i++){cerr<<"[";for(int j=0;j<(v[0].size());++j) cerr<<v[i][j]<<" ";cerr<<"]\n";}
#define debugs(m) cerr<< #m <<" : [ "; for(auto itr = m.begin(); itr!=m.end();itr++) cerr<<*itr<<" "; cerr<<"]\n";
#define debugm(m) cerr<< #m <<" : [ "; for(auto itr = m.begin();itr!=m.end(); itr++) cerr<<"("<<itr->first<<","<<itr->second<<") ";cerr<<"]\n";
const int mxN = 107;
double dp[mxN][mxN][mxN];
double prob(int a, int b, int c){
if(a>99 || b>99 || c>99) return 0;
if(dp[a][b][c]>=0) return dp[a][b][c];
double s=a+b+c;
dp[a][b][c] = 1+prob(a+1,b,c)*a/s+prob(a,b+1,c)*b/s+prob(a,b,c+1)*c/s;
return dp[a][b][c];
}
// solve case for 2 then do 3
void solve(){
int a,b,c; cin >> a >> b >> c;
memset(dp,-1,sizeof(dp));
double ans = prob(a,b,c);
cout << fixed << setprecision(9) << ans;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve_sub(ll N, string S, vector<ll>& A) {
ll d_min = 1e5;
for ( int i = 0; i < N; i++ ) {
d_min = min(d_min, abs(A[i]-A[i+1]));
}
vector<ll> mn(N+1,0);
for ( int i = 1; i <= N; i++ ) {
if ( S[i-1] == '<' ) {
mn[i] = max(mn[i],mn[i-1]+1);
}
}
for ( int i = N-1; i >= 0; i-- ) {
if ( S[i] == '>' ) {
mn[i] = max(mn[i],mn[i+1]+1);
}
}
ll k = d_min;
vector<vector<ll>> ans(k, vector<ll>(N+1));
for ( int j = 0; j < k; j++ ) {
for ( int i = 0; i < N+1; i++ ) {
ans[j][i] = A[i] / k + (j < A[i]%k ? 1 : 0) ;
}
}
cout << k << "\n";
for ( int j = 0; j < k; j++ ) {
for ( int i = 0; i <= N; i++ ) {
cout << ( i != 0 ? " " : "") << ans[j][i];
}
cout << "\n";
}
// debug
vector<ll> b(N+1);
for ( int i = 0; i <= N; i++ ) {
b[i] = ans[k-1][i];
}
for ( int i = 0; i <= N; i++ ) {
bool ok = true;
if ( i > 0 ) {
if ( b[i-1] < b[i] && S[i-1] == '>' ) ok = false;
if ( b[i-1] > b[i] && S[i-1] == '<' ) ok = false;
if ( b[i-1] == b[i] ) ok = false;
if ( !ok ) {
int z = 1;
}
}
}
for ( int i = 0; i <= N; i++ ) {
b[i] = ans[0][i];
}
for ( int i = 0; i <= N; i++ ) {
bool ok = true;
if ( i > 0 ) {
if ( b[i-1] < b[i] && S[i-1] == '>' ) ok = false;
if ( b[i-1] > b[i] && S[i-1] == '<' ) ok = false;
if ( b[i-1] == b[i] ) ok = false;
if ( !ok ) {
int z = 1;
}
}
}
return 0;
}
ll solve() {
ll N;
string S;
cin >> N >> S;
vector<ll> A(N+1);
for ( int i = 0; i < N+1; i++ ) cin >> A[i];
ll ans = solve_sub(N,S,A);
return ans;
}
struct Data {
int id;
ll N;
string S;
vector<ll> A;
};
void test() {
mt19937_64 mt64(0);
uniform_int_distribution<ll> rnd_n(3, 3);
uniform_int_distribution<ll> rnd_v(2, 20);
int id = 0;
vector<Data> ts;
ts.push_back({++id,3,"<><",{3,8,6,10}});
ts.push_back({++id,3,"<<>",{0,2,4,2}});
for ( int i = 0; i < 100; i++ ) {
int n = rnd_n(mt64);
vector<ll> a;
for ( int j = 0; j < n+1; j++ ) {
a.push_back(rnd_v(mt64));
}
string s;
for ( int j = 0; j < n; j++ ) {
if ( a[j] == a[j+1] ) a[j+1]++;
char c = a[j] < a[j+1] ? '<' : '>';
s.push_back(c);
}
ts.push_back({++id,n,s,a});
}
for ( Data& t : ts ) {
auto ans0 = solve_sub(t.N, t.S, t.A);
if ( ans0 >= 0 ) {
int z = 1;
}
// auto ans1 = solve_small_1(t.N,t.S,t.A);
// if ( ans0 != ans1 ) {
// cout << t.id << " " << ans0 << " " << ans1 << "\n";
// }
}
cout << "end" << "\n";
}
int main() {
// test();
solve();
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define P pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define mp make_pair
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rev(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define revs(i, n) for (int i = ((int)(n)); i > 0; --i)
// template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
// template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
// template <class T> void plus_mod(T &a, const T &b) {a = (a + b) % MOD;}
vector<P> warps[30];
ll warp_points[2010][2010];
ll maze[2010][2010];
vector<P> get_warp(ll y, ll x) {
ll wid = warp_points[y][x];
return warps[wid];
// auto point1 = warps[wid][0];
// auto point2 = warps[wid][1];
// if (point1.first == y && point1.second == x) {
// return point2;
// } else {
// return point1;
// }
}
int main() {
// std::cout << std::fixed << std::setprecision(10);
ll H, W;
scanf("%lld %lld", &H, &W);
fill(maze[0], maze[2005], -1);
ll sy, sx, gy, gx;
// インデックス1開始なので注意
reps(y, H) {
string line;
cin >> line;
reps(x, line.size()) {
char ch = line[x - 1];
if (ch == '#') {
maze[y][x] = -1;
} else if (ch == '.') {
maze[y][x] = INF;
} else if (ch == 'S') {
sy = y;
sx = x;
maze[y][x] = 0;
} else if (ch == 'G') {
gy = y;
gx = x;
maze[y][x] = INF;
} else {
// ワープ
ll wid = ch - 'a' + 1;
warps[wid].emplace_back(mp(y, x));
warp_points[y][x] = wid;
maze[y][x] = INF;
}
}
}
//--------------------------------------------------
deque<l_l> que;
que.emplace_back(mp(sy, sx));
maze[sy][sx] = 0;
for (;;) {
if (que.empty()) {
break;
}
auto pos = que.front();
que.pop_front();
ll y = pos.first;
ll x = pos.second;
// cout << "y:" << (y) << ",x:" << (x) << endl;
ll c = maze[y][x];
for (auto e : {mp(y - 1, x), mp(y, x - 1), mp(y + 1, x), mp(y, x + 1)}) {
if (maze[e.first][e.second] == -1) {
continue;
}
if (maze[e.first][e.second] <= c + 1) {
continue;
}
maze[e.first][e.second] = c + 1;
que.emplace_back(make_pair(e.first, e.second));
}
if (warp_points[y][x]) {
ll wid = warp_points[y][x];
auto warp_list = get_warp(y, x);
rep(i, warp_list.size()) {
auto next = warp_list[i];
warp_points[next.first][next.second] = 0;
if (maze[next.first][next.second] > c + 1) {
// cout << "WARP!:"
// << "next.first:" << (next.first) << ",next.second:" << (next.second) << endl;
maze[next.first][next.second] = c + 1;
que.emplace_front(make_pair(next.first, next.second));
}
warp_points[next.first][next.second] = 0;
}
}
}
ll ans = maze[gy][gx];
if (ans == INF) {
cout << (-1) << endl;
return 0;
}
cout << ans << endl;
}
|
#include <iostream>
#include <string.h>
#include <algorithm>
#include <cmath>
using ll = long long;
const ll INF = __LONG_LONG_MAX__;
using namespace std;
int main() {
ll N;
cin >> N;
int count[3] = {0};
while(N) {
count[N % 10 % 3]++;
N /= 10;
}
int total = count[1] + count[2] * 2;
int count_total = count[0] + count[1] + count[2];
int ans;
if(total % 3 == 0) {
ans = 0;
} else if (total % 3 == 1) {
if(count[1] >= 1 && count_total > 1) {
ans = 1;
} else {
if(count[2] >= 2 && count_total > 2) {
ans = 2;
} else {
ans = -1;
}
}
} else if (total % 3 == 2) {
if(count[2] >= 1 && count_total > 1) {
ans = 1;
} else {
if(count[1] >= 2 && count_total > 2) {
ans = 2;
} else {
ans = -1;
}
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin>>n;
int k = n%100;
cout<<100-k;
return 0;
} |
#include<bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s[3];
cin>>s[0]>>s[1]>>s[2];
map<char , ll> pos;
ll idx = 0;
for(int i = 0; i < 3; i++){
for(int j = 0; j < sz(s[i]); j++){
if(pos.find(s[i][j]) == pos.end()){
pos[s[i][j]] = idx;
idx++;
}
}
}
if(idx > 10){
cout<<"UNSOLVABLE\n";
return 0;
}
vector<ll> d(10);
iota(all(d) , 0);
do {
vector<ll> ans(3);
bool flag = 1;
for(int i = 0; i < 3; i++){
for(int j = 0; j < sz(s[i]); j++){
ans[i] *= 10;
ans[i] += d[pos[s[i][j]]];
}
if(d[pos[s[i][0]]] == 0){
flag = 0;
break;
}
}
if(flag && ans[0] + ans[1] == ans[2]){
for(int k = 0; k < 3; k++){
cout<<ans[k]<<"\n";
}
return 0;
}
}while(next_permutation(all(d)));
cout<<"UNSOLVABLE\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define lowbit(x) x&-x
#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define UNI(x) sort(ALL(x)),x.resize(unique(ALL(x))-x.begin())
#define GETPOS(c,x) (lower_bound(ALL(c),x)-c.begin())
#define LEN(x) strlen(x)
#define MS0(x) memset((x),0,sizeof((x)))
#define Rint register int
#define ls (u<<1)
#define rs (u<<1|1)
typedef unsigned int unit;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<pii> Vpii;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(ll &x) { scanf("%lld", &x); }
void _R(ull &x) { scanf("%llu", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const ll &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.fi);putchar(' '); _W(x.se);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
const int MOD=998244353,mod=998244353;
ll qpow(ll a,ll b) {ll res=1;a%=MOD; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;}
const int MAXN=2e6+10,MAXM=3e6+10;
const int INF=INT_MAX,SINF=0x3f3f3f3f;
const ll llINF=LLONG_MAX;
const int inv2=(MOD+1)/2;
const int Lim=1<<20;
void solve()
{
ll n,k,ans=0;
R(n,k);
for(ll i=2;i<=n*2;i++)
{
if(i>k+1)
{
ans=(ans+min(i-1,n*2-i+1)*max(min(i-k-1,n*2-(i-k)+1),0ll));
//W(i,i-1,n*2-i+1,i-k-1,n*2-(i-k)+1);
}
}
W(ans);
}
int main()
{
int T=1;
//scanf("%d",&T);
for(int kase=1;kase<=T;kase++)
{
//printf("Case #%d: ",kase);
solve();
}
return 0;
}
|
#include <iostream>
#include <cstring>
using namespace std;
const int N = 200010, M = 2 * N, INF = 0x3f3f3f3f;
int h[N], e[M], ne[M], idx, n, m, k;
int f[N], g[N], cnt; //f[u]:u的子孙结点中，最近的特殊点距离u点的距离
//g[u]:u的子孙结点中，最远的没被特殊点覆盖的点距离u点的最远的距离
bool st[N];
void add(int a, int b) {
e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}
void dfs(int u, int father, int mid) {
f[u] = INF, g[u] = 0;
for (int i = h[u]; i != -1; i = ne[i]) {
int j = e[i];
if (j == father) continue;
dfs(j, u, mid);
f[u] = min(f[j] + 1, f[u]);
g[u] = max(g[j] + 1, g[u]);
}
if (f[u] + g[u] <= mid) g[u] = -INF;
else if (g[u] == mid) g[u] = -INF, f[u] = 0, cnt ++;
}
int check(int mid) {
cnt = 0;
dfs(1, -1, mid);
if (g[1] >= 0) cnt ++; //g[1] = 0说明1虽然被覆盖但是它的子节点还有没被覆盖的，且没被覆盖的点距离u的最远距离<mid
return cnt;
}
int main() {
memset(h, -1, sizeof h);
cin >> n >> k;
for (int i = 1; i < n; i ++) {
int a, b;
cin >> a >> b;
add(a, b), add(b, a);
}
int l = 1, r = n;
int ans = 1e9;
while (l < r) {
int mid = l + r >> 1;
if (check(mid) <= k) r = mid;
else l = mid + 1;
}
cout << l;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int h,w;
cin>>h>>w;
int ans=0;
vector<vector<char>>s(h,vector<char>(w));
rep(i,h){
rep(j,w)
cin>>s[i][j];
}
for(int i=0;i<h;i++){
for(int j=0;j<w-1;j++){
if(s[i][j]=='.' && s[i][j+1]=='.')
ans++;
}
}
for(int i=0;i<w;i++){
for(int j=0;j<h-1;j++){
if(s[j][i]=='.' && s[j+1][i]=='.')
ans++;
}
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxN = 1e5 + 5;
vector <tuple<int, int, int>> adj[maxN];
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int n, m;
cin >> n >> m;
for(int i = 0; i < m; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
adj[a].emplace_back(b, c, d);
adj[b].emplace_back(a, c, d);
}
priority_queue <pair<ll, int>, vector <pair<ll, int>>, greater<pair<ll, int>>> pq;
vector <ll> dist(n + 1, 1e18);
pq.emplace(0, 1);
dist[1] = 0;
while(!pq.empty()) {
auto [val, x] = pq.top();
pq.pop();
if(dist[x] < val) continue;
for(auto &[v, c, d] : adj[x]) {
ll new_dist = 0;
ll sq = sqrt(d);
if(sq * sq != d) sq++;
sq--;
if(val < sq) {
new_dist = sq - val + c + d / (sq + 1);
}
else {
new_dist = c + d / (val + 1);
}
if(dist[v] > val + new_dist) {
dist[v] = val + new_dist;
pq.emplace(dist[v], v);
}
}
}
cout << (dist[n] == 1e18 ? -1 : dist[n]);
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>
// AtCoder
// #include <atcoder/all>
// using namespace atcoder;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...)
#endif
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b)-1, i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fls(x) (64 - __builtin_clzll(x))
#define pcnt(x) __builtin_popcountll(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <ll,int> P;
typedef long double ld;
ll find_bottom (ll d) {
if (d <= 1) return 0;
if (d == 2) return 1;
ll l = 0, r = d + 1;
while (r - l > 1) {
ll m = (r + l) >> 1;
(m * (m + 1) <= d ? l : r) = m;
}
--l;
if (l + d / (l + 1) >= l + 1 + d / (l + 2)) ++l;
if (l + d / (l + 1) >= l + 1 + d / (l + 2)) ++l;
return l;
}
struct edge {
ll to, c, d, bottom;
edge (ll to, ll c, ll d) : to(to), c(c), d(d), bottom(find_bottom(d)) {};
};
constexpr ll INF = 1e18;
int main (void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m; cin >> n >> m;
vector<vector<edge>> g(n);
rep (_, m) {
int a, b, c, d;
cin >> a >> b >> c >> d;
--a; --b;
g[a].emplace_back(b, c, d);
g[b].emplace_back(a, c, d);
}
rep (i, 21) eprintf("%lld ", find_bottom(i));
vector<ll> d(n, INF); d[0] = 0;
priority_queue<P, vector<P>, greater<P>> pq; pq.emplace(0, 0);
while (!pq.empty()) {
auto [dist, u] = pq.top(); pq.pop();
if (dist > d[u]) continue;
for (auto &e : g[u]) {
ll t = max((ll)e.bottom, d[u]);
if (chmin(d[e.to], e.c + t + e.d / (t + 1))) {
pq.emplace(d[e.to], e.to);
}
}
}
cout << (d.back() >= INF ? -1 : d.back()) << '\n';
return 0;
} |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<math.h>
#include<unordered_set>
#include<unordered_map>
#include<cassert>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rrep(i,l,r) for(int i=l;i<=r;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define all(x) x.begin(),x.end()
#define unq(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define mod 1000000007
//#define mod 998244353
#define ad(a,b) a=(a+b)%mod;
#define mul(a,b) a=a*b%mod;
void readv(vector<ll> &a,ll n){
rep(i,n){
ll x;
cin>>x;
a.push_back(x);
}
}
void outv(vector<ll> &a,ll n){
rep(i,n){
if(i>0)cout<<" ";
cout<<a[i];
}
cout<<"\n";
}
ll po(ll x,ll y){
ll res=1;
for(;y;y>>=1){
if(y&1)res=res*x%mod;
x=x*x%mod;
}
return res;
}
ll gcd(ll a,ll b){
return (b?gcd(b,a%b):a);
}
#define FACMAX 200010
ll fac[FACMAX],inv[FACMAX],ivf[FACMAX];
void initfac(){
fac[0]=ivf[0]=inv[1]=1;
for(ll i=1;i<FACMAX;i++)fac[i]=fac[i-1]*i%mod;
for(ll i=1;i<FACMAX;i++){
if(i>1)inv[i]=(mod-mod/i*inv[mod%i]%mod)%mod;
ivf[i]=po(fac[i],mod-2);
}
}
ll P(ll n,ll k){
if(n<0||n<k)return 0;
return fac[n]*ivf[n-k]%mod;
}
ll C(ll n,ll k){
if(n<0||n<k)return 0;
return fac[n]*ivf[n-k]%mod*ivf[k]%mod;
}
ll H(ll n,ll k){
return C(n+k-1,k);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
ll n;
cin>>n;
for(int i=0;i<n;i++){
ll a=(i*2+1)%n,b=(i*2+2)%n;
cout<<a+1<<" "<<b+1<<endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
for(int i = 1; i <= n; i++)
{
int a = i * 2;
int b = i * 2 + 1;
while(a > n)
{
a = a - n;
}
while(b > n)
{
b = b - n;
}
cout << a << " " << b << "\n";
}
return 0;
}
|
// 2021-03-14 08:00-08:
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
for (int i = 0; i < t; i++) {
long long l, r;
cin >> l >> r;
long long count = 0;
if(r < 2 * l){
cout << count << endl;
continue;
}
count = ((r - l + 1) * (r - 3 * l + 2) + (l - 1) * l) / 2;
cout << count << endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define MOD 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(var) (var).begin(), (var).end()
#define sz(x) (int)x.size()
#define MAXX 9000000000000000000
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vector<int> >
#define vpi vector<pair<int,int> >
#define vvpi vector<vector<pair<int,int> > >
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,d,h;
cout << fixed << setprecision(15);
double ans = 0.0;
cin >> n >> d >> h;
for(int i=0;i<n;i++)
{
int x, y;
cin >> x >> y;
double m = (1.0 * (y - h)) / (1.0 * (x - d));
double c = 1.0 * y - m * (1.0 * x);
ans = max(ans, c);
}
cout << ans;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int tdmckmlklgnjdnmclnbjhn;
long long a,b,c,d;
cin>>a>>b>>c>>d;
if(a==c && b==d)
cout<<"0"<<endl;
else if(a+b==c+d || a-b==c-d || abs(a-c)+abs(b-d)<=3)
cout<<1<<endl;
else if((a+b+c+d)%2==0 || abs(a-c)+abs(b-d)<=6 ||
abs(a+b-c-d)<=3 || abs(a-b-c+d)<=3)
cout<<2<<endl;
else
cout<<3<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD=1000000007;
const long double PI=3.14159265358979;
const ll MAX=0;
int main() {
ll N,M,T;
cin>>N>>M>>T;
ll a[M];
ll b[M+1];
rep(i,M){
cin>>a[i]>>b[i+1];
}
b[0]=0;
ll bat=N,ans=0;
rep(i,M){
bat-=a[i]-b[i];
if(bat<=0){
ans=1;
}
bat+=b[i+1]-a[i];
bat=min(bat,N);
}
bat-=T-b[M];
if(bat<=0){
ans=1;
}
if(ans){
cout<<"No";
}
else{
cout<<"Yes";
}
} |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define rep(i,n) for (int i=0; i<n;++i)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
using namespace std;
const ll MOD = 1e9+7LL;
const int INF = 2e9;
int k;
unordered_map<int, int> s,t, rest;
int winTaka(int taka, int aoki, unordered_map<int, int> s, unordered_map<int, int> t) {
s[taka]++;
t[aoki]++;
int total = 0;
for (int i=1; i<10; i++) {
int e = int(pow(10, s[i]))-int(pow(10, t[i]));
total+= i*e;
}
return total>0.0;
}
int main() {
INCANT;
cin >> k;
char c;
rep(i, 5) {
cin >> c;
if (i==4) continue;
s[c-'0']++;
}
rep(i, 5) {
cin >> c;
if (i==4) continue;
t[c-'0']++;
}
rep(i, 9) {
int num = i+1;
rest[num] = k-s[num]-t[num];
}
double denominator = 9*k-8;
double coeffient;
double ans = 0.0;
for(int i=1; i<10; i++) {
for (int j=1; j<10; j++) {
if (i==j && rest[i]-2<0) continue;
if (rest[i]-1<0) continue;
if (rest[j]-1<0) continue;
if (i==j) {
coeffient = double(rest[i]) * double(rest[i]-1);
} else {
coeffient = double(rest[i]) * double(rest[j]);
}
coeffient/=denominator;
coeffient/=(denominator-1);
ans+=coeffient * winTaka(i, j, s,t);
}
}
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <limits>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <numeric>
#include <math.h>
#include <string.h>
#include <stdlib.h>
using namespace std;
#if __cplusplus >= 201103L
#include <unordered_set>
#include <unordered_map>
#include <chrono>
#include <random>
#include <bits/stdc++.h>
struct pairhash {
template<class T, class U>
size_t operator() (const pair<T,U> &p) const {
static const uint64_t FIXED_RANDOM = (uint64_t)chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(p.first + FIXED_RANDOM) ^ splitmix64(p.second+ FIXED_RANDOM);
}
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
inline int randint(int l, int r) {
return uniform_int_distribution<int>(l,r)(rng);
}
inline double randdouble(double l, double r) {
return uniform_real_distribution<double>(l,r)(rng);
}
#endif
#define fastio ios::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define ll128 __int128_t
#define PI 3.14159265358979323846
#define min(a,b) ((a<b)?(a):(b))
#define max(a,b) ((a<b)?(b):(a))
#define abs(a) ((a>0)?a:-(a))
#define pii pair<int,int>
#define pll pair<ll,ll>
template <typename T>
inline void read(T& x) {
x = 0;
bool f = 0;
char ch = (char)getchar();
while (ch < '0' || ch > '9') { // ch 不是数字时
if (ch == '-') f = 1; // 判断是否为负
ch = (char)getchar(); // 继续读入
}
while (ch >= '0' && ch <= '9') { // ch 是数字时
x = x*10 + (ch&15); // 将新读入的数字’加’在 x 的后面, ch&15等同于ch-'0'
ch = (char)getchar(); // 继续读入
}
if (f) x = -x;
}
template <typename T>
inline void write(T x) {
static int st[35];
int top = 0;
do {
st[top++] = x % 10; x /= 10;
} while (x);
while (top) putchar(st[--top] + '0');
}
const double pi = acos(-1.0);
const double eps = (double)1e-4;
const int mod = 1e9+7;
const int maxn = 1e5+5;
const int maxm = 2e5+10;
int cnt[10];
int a[10], b[10];
int pow10[7];
bool check() {
int s1 = 0, s2 = 0;
for (int i = 1; i <= 9; i++) s1 += i * pow10[a[i]];
for (int i = 1; i <= 9; i++) s2 += i * pow10[b[i]];
return s1 > s2;
}
int main() {
int k;
string s,t; cin >> k >> s >> t;
for (int i = 1; i <= 9; i++) cnt[i] = k;
for (char c : s) {
if (c != '#') cnt[c-'0']--, a[c-'0']++;
}
for (char c : t) {
if (c != '#') cnt[c-'0']--, b[c-'0']++;
}
pow10[0] = 1;
for (int i = 1; i <= 6; i++) pow10[i] = pow10[i-1] * 10;
double all = 0.0;
double win = 0.0;
for (int i = 1; i <= 9; i++) {
if (cnt[i] == 0) continue;
cnt[i]--; a[i]++;
for (int j = 1; j <= 9; j++) {
if (cnt[j] == 0) continue;
all += (double)(cnt[i]+1.0) * (double)(cnt[j]);
b[j]++;
if (check()) {
win += (double)(cnt[i] + 1.0) * (double)(cnt[j]);
}
b[j]--;
}
cnt[i]++; a[i]--;
}
double ans = win / all;
printf("%.10f\n",ans);
} |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=200005;
int n,a[N],b[N],c[N],t[N];
map<int,priority_queue<int,vector<int>,greater<int> > > pq;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]),a[i]+=i;
for(int i=1;i<=n;i++) scanf("%d",&b[i]),b[i]+=i;
for(int i=1;i<=n;i++) pq[a[i]].push(i);
for(int i=1;i<=n;i++){
if(pq[b[i]].empty()){
cout<<"-1\n";
return 0;
}
int pv=pq[b[i]].top();
pq[b[i]].pop();
c[i]=pv;
}
LL ans=0LL;
for(int i=n;i;i--){
for(int j=c[i];j;j-=(j&-j)) ans+=1LL*t[j];
for(int j=c[i];j<=n;j+=(j&-j)) t[j]++;
}
cout<<ans<<'\n';
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#include<map>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
#define rprintf(fmt, begin, end) do { const auto end_rp = (end); auto it_rp = (begin); for (bool sp_rp=0; it_rp!=end_rp; ++it_rp) { if (sp_rp) putchar(' '); else sp_rp = true; printf(fmt, *it_rp); } putchar('\n'); } while(0)
template<class T> struct Fenwick {
int n;
T* d;
Fenwick() : n(0), d(NULL) {}
Fenwick(int n_) : n(n_) {
d = new T[n_]();
}
Fenwick(const Fenwick &y) : n(y.n) {
d = new T[n];
memcpy(d, y.d, sizeof (T) * n);
}
~Fenwick() {
delete[] d; d = NULL;
n = 0;
}
friend void swap(Fenwick &x, Fenwick &y) {
swap(x.n, y.n); swap(x.d, y.d);
}
Fenwick& operator=(Fenwick y) {
swap(*this, y);
return *this;
}
inline void add(int i, const T &x) {
for (; i<n; i|=i+1) d[i] += x;
}
inline T sum(int r) const {
T s = T();
for (; r; r&=r-1) s += d[r-1];
return s;
}
T sum(int l, int r) const {
return sum(r) - sum(l);
}
};
int N;
LL A[200011];
LL B[200011];
bool valid() {
vector<LL> X(A, A+N);
vector<LL> Y(B, B+N);
sort(X.begin(), X.end());
sort(Y.begin(), Y.end());
return X == Y;
}
void MAIN() {
scanf("%d", &N);
REP (i, N) scanf("%lld", A+i);
REP (i, N) scanf("%lld", B+i);
REP (i, N) {
A[i] += i;
B[i] += i;
}
if (valid()) {
map<LL, int> cnt;
map<pair<LL, int>, int> mp;
REP (i, N) {
int k = cnt[A[i]];
mp[make_pair(A[i], k)] = i;
cnt[A[i]]++;
}
cnt.clear();
LL ans = 0;
Fenwick<int> F(N);
REP (i, N) {
int k = cnt[B[i]];
int pos = mp[make_pair(B[i], k)];
cnt[B[i]]++;
ans += F.sum(pos, N);
F.add(pos, 1);
}
printf("%lld\n", ans);
} else {
puts("-1");
}
}
int main() {
int TC = 1;
// scanf("%d", &TC);
REP (tc, TC) MAIN();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.end()
#define vprint(v) for(auto e:v){cout<<e<<" ";};cout<<endl;
#define vvprint(vv) for(auto v:vv){vprint(v)};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20);
char c1, c2, c3;
cin >> c1 >> c2 >> c3;
if(c1==c2 && c2==c3) cout << "Won" << endl;
else cout << "Lost" << endl;
}
| #include <cstdio>
#include <algorithm>
using namespace std;
int a[100000];
void solve() {
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
if (n % 2 == 0) {
for (i = 0; i < n; i += 2) {
if (a[i] != a[i + 1]) break;
}
if (i < n) {
puts("First");
} else {
puts("Second");
}
} else {
puts("Second");
}
}
int main() {
int t, i;
scanf("%d", &t);
for (i = 0; i < t; i++) solve();
return 0;
}
|
#include <memory.h>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
typedef long long ll;
ll n, minv[200111], maxv[200111];
ll reachMinv[200111], reachMaxv[200111];
vector<ll> ids;
int main(void) {
scanf("%lld", &n);
for (ll i = 0; i <= n + 1; i++) {
minv[i] = 9e18;
maxv[i] = -9e18;
}
ll lastV = -1;
ids.push_back(0);
for (ll i = 1; i <= n; i++) {
ll a, b; scanf("%lld %lld", &a, &b);
ids.push_back(b);
minv[b] = min(minv[b], a);
maxv[b] = max(maxv[b], a);
}
ids.push_back(n + 1);
sort(ids.begin(), ids.end());
ids.erase(unique(ids.begin(), ids.end()), ids.end());
minv[0] = maxv[0] = minv[ids.back()] = maxv[ids.back()] = 0;
reachMinv[0] = reachMaxv[0] = 0;
for (ll i = 1; i < ids.size(); i++) {
ll curi = ids[i];
ll prei = ids[i - 1];
ll minToMax = reachMinv[prei] + (maxv[prei] - minv[prei]);
ll maxToMin = reachMaxv[prei] + (maxv[prei] - minv[prei]);
reachMinv[curi] = min(
minToMax + abs(maxv[prei] - minv[curi]),
maxToMin + abs(minv[prei] - minv[curi])
);
reachMaxv[curi] = min(
minToMax + abs(maxv[prei] - maxv[curi]),
maxToMin + abs(minv[prei] - maxv[curi])
);
}
printf("%lld\n", reachMinv[ids.back()]);
} | #include <bits/stdc++.h>
using namespace std;
#define ffor(i, a, b) for (int i = a ; i <= (int) b ; i++)
#define rfor(i, a, b) for (int i = (int) a ; i >= b ; i--)
#define vec vector
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
using ll = long long int; // watch out for overflows in your code
using pii = pair<int,int>;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void debug() { cout << "\n"; };
template <typename T, typename... Targs>
void debug(T t, Targs... args) {
cout << t << " ";
debug(args...);
}
template <typename T1, typename T2>
inline ostream& operator << (ostream& os, const pair<T1,T2>& p) {
return os << "(" << p.F << ", " << p.S << ")";
}
template <typename T>
inline ostream& operator << (ostream& os, const vec<T>& v) {
for(auto& t : v) {
os << t << " ";
}
return os;
}
template <typename T>
inline ostream& operator << (ostream& os, const vec<vec<T>>& m) {
for(auto& v : m) {
for(auto& t : v) {
os << t << " ";
}
os << "\n";
}
return os;
}
template <typename T>
inline ostream& operator << (ostream& os, const set<T>& v) {
for(auto& t : v) {
os << t << " ";
}
return os;
}
template <typename K, typename V>
inline ostream& operator << (ostream& os, const map<K,V>& m) {
for(auto& p : m) {
os << p.F << " -> " << p.S << "\n";
}
return os;
}
const ll INF = 9 * 1e18;
int N;
vec<ll> lo, hi;
ll dist(ll st, ll fn, ll x) {
return abs(x-st) + abs(st-fn);
}
vec<vec<ll>> dp;
void compute_dp() {
dp.assign(N+1, vec<ll>(2,0));
ffor(c, 1, N) {
if(lo[c] == lo[c-1] && hi[c] == hi[c-1]) {
dp[c][0] = dp[c-1][0];
dp[c][1] = dp[c-1][1];
}
else {
dp[c][0] = min(dp[c-1][0] + dist(hi[c], lo[c], lo[c-1]), dp[c-1][1] + dist(hi[c], lo[c], hi[c-1]));
dp[c][1] = min(dp[c-1][0] + dist(lo[c], hi[c], lo[c-1]), dp[c-1][1] + dist(lo[c], hi[c], hi[c-1]));
}
}
}
////////////////////////////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
lo.assign(N+1, INF);
hi.assign(N+1, -INF);
lo[0] = hi[0] = 0;
ffor(i, 1, N) {
ll x; int c;
cin >> x >> c;
lo[c] = min(lo[c], x);
hi[c] = max(hi[c], x);
}
ffor(c, 1, N) {
if(lo[c] == INF) lo[c] = lo[c-1];
if(hi[c] == -INF) hi[c] = hi[c-1];
}
compute_dp();
cout << min(dp[N][0] + abs(lo[N]), dp[N][1] + abs(hi[N])) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
struct ios
{
inline char read()
{
static const int IN_LEN = 1e6 + 10;
static char buf[IN_LEN], *s, *t;
return (s == t) && (t = (s = buf) + fread(buf, 1, IN_LEN, stdin)), s == t ? -1 : *s++;
}
template <typename _Tp>
inline ios &operator>>(_Tp &x)
{
static char c11, boo;
for (c11 = read(), boo = 0; !isdigit(c11); c11 = read())
{
if (c11 == -1)
return *this;
boo |= c11 == '-';
}
for (x = 0; isdigit(c11); c11 = read())
x = x * 10 + (c11 ^ '0');
boo && (x = -x);
return *this;
}
} io;
namespace IO
{
template <typename T>
inline void w(T x)
{
if (x > 9)
w(x / 10);
putchar(x % 10 + 48);
}
template <typename T>
inline void write(T x, char c)
{
if (x < 0)
putchar('-'), x = -x;
w(x);
putchar(c);
}
template <typename T>
inline void read(T &x)
{
x = 0;
T f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); c = getchar())
x = (x << 1) + (x << 3) + (c ^ 48);
x *= f;
}
} // namespace IO
#define int long long
#define x first
#define y second
#define PII pair<int,int>
#define LL long long
#define pb push_back
#define pqp priority_queue<PII,vector<PII>,greater<PII>>
#define pqi priority_queue<int,vector<int>,greater<int>>
#define PSS pair<string,string>
#define in insert
#define line inline
// #define sort(s) sort(s.begin(),s.end());
#define reverse(s) reverse(s.begin(),s.end());
#define max_(s) *max_element(s.begin(), s.end())
#define V vector<int>
#define VV vector<V>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int dx[]= {0,-1,0,1,0,0},dy[]= {-1,0,1,0,0,0},dz[] = {0,0,0,0,-1,1};
int n;
bool check(int a,int b,int c)
{
return a * b * c <= n;
}
void solve()
{
cin >> n;
int sum = 0;
for(int i = 1; i <= n; i ++){
int k = n / i;
for(int j = 1; j <= k; j++){
sum += (k/j);
}
}
printf("%lld\n",sum);
}
signed main()
{
// IOS
// int _; cin >> _; while(_ --)
solve();
}
| #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy cout<<"Yes"<<endl
#define con cout<<"No"<<endl
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
#define LINF 1e18+10
using ll = long long;
using P = pair<ll, ll>;
using fP = pair<double, double>;
using PPI = pair<P, int>;
using PIP = pair<int, P>;
using Ps = pair<int, string>;
using vi = vector<int>;
using vl = vector<ll>;
using vc = vector<char>;
using vd = vector<double>;
using vs = vector<string>;
using vp = vector<P>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<double>>;
using vvc = vector<vector<char>>;
using vvp = vector<vector<P>>;
using vvb = vector<vector<bool>>;
template <typename T>
bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; }
template <typename T>
bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; }
//const ll mod=998244353;
const ll mod = 1e9 + 7;
const ll MAX = 300000;
template <typename T>
T abs(T a) { if (a < 0)return -a; else return a; }//2020/09/30 stdlib has abs(long) abs(long long) error
//////////////////////////////////////
int main() {
int n;
cin >> n;
vp ab(n);
vp tmp(n);
rep(i, n) {
cin >> ab[i].fs >> ab[i].sc;
tmp[i].fs = 2 * ab[i].fs + ab[i].sc;
tmp[i].sc = i;
}
sort(rall(tmp));
vl ad(n), iad(n + 1);
ad[0] = (ll)ab[tmp[0].sc].fs + ab[tmp[0].sc].sc;
rep(i, n - 1) {
P p = ab[tmp[i + 1].sc];
ad[i + 1] = ad[i] + p.fs + p.sc;
}
iad[n - 1] = ab[tmp[n - 1].sc].fs;
rep(i, n - 1) {
P p = ab[tmp[n - 1 - (i + 1)].sc];
iad[n - 1 - (i + 1)] = iad[n - (i + 1)] + p.fs;
}
rep(i, n) {
ll a = ad[i];
ll b = iad[i + 1];
if (a > b) {
cout << i + 1 << endl;
return 0;
}
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)
template<class T> inline bool chmax(T &a, const T &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, const T &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}init_;
#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << "\n" << flush; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif
const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
int main() {
ll N;
string S;
cin >> N >> S;
vvc<ll> A(N + 1, vl(4));
rep(i, N){
rep(j, 4) A[i + 1][j] += A[i][j];
if (S[i] == 'A')
A[i + 1][0]++;
else if(S[i] == 'T')
A[i + 1][1]++;
else if(S[i] == 'C')
A[i + 1][2]++;
else
A[i + 1][3]++;
}
ll ans = 0;
rep(i, N) repe(j, i + 1, N + 1){
vl cnt(4);
rep(k, 4) cnt[k] = A[j][k] - A[i][k];
if (cnt[0] == cnt[1] and cnt[2] == cnt[3]) ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define dump_4(x1, x2, x3, x4) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define dump_5(x1, x2, x3, x4, x5) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#define dump(...) \
CHOOSE((__VA_ARGS__, dump_5, dump_4, dump_3, dump_2, dump_1, ~))(__VA_ARGS__)
#define check(s) cerr << s << endl
#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 all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
vector<int> dx = {0, 1, 0, -1};
vector<int> dy = {1, 0, -1, 0};
const ll LINF = 2e18;
const int INF = 1e9;
vector<bool> s(200001, false);
void solve(ll N, std::vector<ll> p) {
vector<ll> ans(N);
int mj = 0;
rep(i, N) {
s.at(p.at(i)) = true;
int j = mj;
while (j < N) {
if (!s.at(j)) break;
j++;
}
mj = j;
ans.at(i) = j;
}
rep(i, N) cout << ans.at(i) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll N;
scanf("%lld", &N);
std::vector<ll> p(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &p[i]);
}
solve(N, std::move(p));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1e18+7;
const lint inf=1e9+7;
const int MOD=1000000007;
struct UnionFind {
int n;
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<int> group,sm;
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for(int i = 0; i < N; i++) par[i] = i;
n=N;
sm.resize(n,1);
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
int size(int x){
return sm[root(x)];
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); //xの根をrx
int ry = root(y); //yの根をry
if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
sm[ry]+=sm[rx];
sm[rx]=0;
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
signed main(){
int h,w;cin>>h>>w;
UnionFind tree(h+w+10);
vector<string> s(h);
rep(i,h)cin>>s[i];
s[0][0]='#';
s[h-1][0]='#';
s[0][w-1]='#';
s[h-1][w-1]='#';
rep(i,h)rep(j,w)if(s[i][j]=='#')tree.unite(i,h+j);
int res=inf;
int sm=0;
set<int> st;
rep(i,h){
if(!tree.same(0,i)){
if(st.find(tree.root(i))==st.end()){
st.insert(tree.root(i));
++sm;
}
}
}
res=min(res,sm);
sm=0;
set<int> st2;
rep(i,w){
if(!tree.same(0,h+i)){
if(st2.find(tree.root(h+i))==st2.end()){
st2.insert(tree.root(h+i));
++sm;
}
}
}
res=min(res,sm);
cout<<res<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (ll i=(ll)N-1; i>=0; i--)
#define popcount __builtin_popcount
const ll LLINF = pow(2,61)-1;
const ll INF = pow(2,30)-1;
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
// ----------------------------------------------------------------------
// ----------------------------------------------------------------------
const ll MOD = 998244353;
struct MLL {
ll x, mod;
MLL(ll y=0, ll m=MOD) { x = y; mod = m; }
MLL &operator+= (const MLL &p) { x = (x+p.x)%mod; return *this; }
MLL &operator-= (const MLL &p) { x = (x-p.x+mod)%mod; return *this; }
MLL &operator*= (const MLL &p) { x = (x*p.x)%mod; return *this; }
MLL &operator/= (const MLL &p) { x = (x*p.inv().x)%mod; return *this; }
MLL operator+ (const MLL &p) const { return MLL(*this)+=p; }
MLL operator- (const MLL &p) const { return MLL(*this)-=p; }
MLL operator* (const MLL &p) const { return MLL(*this)*=p; }
MLL operator/ (const MLL &p) const { return MLL(*this)/=p; }
bool operator== (const MLL &p) const { return x==p.x; }
bool operator!= (const MLL &p) const { return x!=p.x; }
bool operator< (const MLL &p) const { return x< p.x; }
bool operator<= (const MLL &p) const { return x<=p.x; }
bool operator> (const MLL &p) const { return x> p.x; }
bool operator>= (const MLL &p) const { return x>=p.x; }
MLL pow(MLL n) const { MLL result(1), p(x); ll tn = n.x; while(tn){ if (tn&1) result*=p; p*=p; tn>>=1; } return result; }
MLL inv() const { return pow(MOD-2); }
};
MLL operator+ (ll x, MLL p) { return (MLL)x+p; }
MLL operator- (ll x, MLL p) { return (MLL)x-p; }
MLL operator* (ll x, MLL p) { return (MLL)x*p; }
MLL operator/ (ll x, MLL p) { return (MLL)x/p; }
vector<MLL> fac;
void c_fac(ll x=pow(10,7)+10) { fac.resize(x); rep(i,x) fac[i] = i ? fac[i-1]*i : 1; }
MLL nck(MLL n, MLL k) { return fac[n.x]/(fac[k.x]*fac[(n-k).x]); };
ostream &operator<< (ostream &ost, const MLL &p) { return ost << p.x; }
istream &operator>> (istream &ist, MLL &p) { return ist >> p.x; }
// ----------------------------------------------------------------------
// ----------------------------------------------------------------------
int main() {
ll H, W, K; cin >> H >> W >> K;
ll pos[H][W] = {};
rep(i,K) {
ll h, w; cin >> h >> w; h--; w--;
char c; cin >> c;
if (c=='R') pos[h][w] = 1;
if (c=='D') pos[h][w] = 2;
if (c=='X') pos[h][w] = 3;
}
// rep(i,H) debug(pos[i],pos[i]+W);
MLL dp[H][W] = {}; dp[0][0] = 1;
MLL m3 = 3, inv3 = m3.inv();
rep(i,H) rep(j,W) {
if (i!=H-1) {
if (pos[i][j]==0) dp[i+1][j] += dp[i][j]*2*inv3;
if (pos[i][j]==1) dp[i+1][j] += dp[i][j]*0;
if (pos[i][j]==2) dp[i+1][j] += dp[i][j]*1;
if (pos[i][j]==3) dp[i+1][j] += dp[i][j]*1;
}
if (j!=W-1) {
if (pos[i][j]==0) dp[i][j+1] += dp[i][j]*2*inv3;
if (pos[i][j]==1) dp[i][j+1] += dp[i][j]*1;
if (pos[i][j]==2) dp[i][j+1] += dp[i][j]*0;
if (pos[i][j]==3) dp[i][j+1] += dp[i][j]*1;
}
}
// rep(i,H) debug(dp[i],dp[i]+W);
MLL result = dp[H-1][W-1]*m3.pow(H*W-K);
cout << result << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n; cin >> n;
vector<long long> d_s, d_l;
long long i = 1;
while(i*i < n)
{
if (n % i == 0)
{
d_s.push_back(i);
d_l.push_back(n / i);
}
i++;
}
if (i * i == n) d_s.push_back(i);
reverse(d_l.begin(), d_l.end());
for (auto d: d_s) cout << d << endl;
for (auto d: d_l) cout << d << endl;
return 0;
}
| // author: xay5421
// created: Sat Dec 26 19:58:52 2020
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
int n;
int main(){
scanf("%d",&n);
rep(i,1,n){
printf("%d %d\n",(i*2-1)%n+1,i*2%n+1);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int h[30][29], v[29][30], hc[30][29], vc[29][30];
int si, sj, ti, tj, prev_si, prev_sj, prev_ti, prev_tj;
int prev_result;
int i=0, j=0;
int border=1;
int repeat_count=1000;
string query(int si, int sj, int ti, int tj){
string path;
while(si!=ti || sj!=tj){
if(si==ti){
if(sj<tj){
path=path+"R";
sj++;
}
else{
path=path+"L";
sj--;
}
}
else if(sj==tj){
if(si<ti){
path=path+"D";
si++;
}
else{
path=path+"U";
si--;
}
}
//左上
else if(si<ti && sj<tj){
if(hc[si][sj]<border || vc[si][sj]<border){
if(hc[si][sj]<vc[si][sj]){
path=path+"R";
sj++;
}
else{
path=path+"D";
si++;
}
}
else if(h[si][sj]<v[si][sj]){
path=path+"R";
sj++;
}
else{
path=path+"D";
si++;
}
}
//左下
else if(si>ti && sj<tj){
if(hc[si][sj]<border || vc[si-1][sj]<border){
if(hc[si][sj]<vc[si-1][sj]){
path=path+"R";
sj++;
}
else{
path=path+"U";
si--;
}
}
else if(h[si][sj]<v[si-1][sj]){
path=path+"R";
sj++;
}
else{
path=path+"U";
si--;
}
}
//右下
else if(si>ti&& sj>tj){
if(hc[si][sj-1]<border || vc[si-1][sj]<border){
if(hc[si][sj-1]<vc[si-1][sj]){
path=path+"L";
sj--;
}
else{
path=path+"U";
si--;
}
}
else if(h[si][sj-1]<v[si-1][sj]){
path=path+"L";
sj--;
}
else{
path=path+"U";
si--;
}
}
//右上
else{
if(hc[si][sj-1]<border || vc[si][sj]<border){
if(hc[si][sj-1]<vc[si][sj]){
path=path+"L";
sj--;
}
else{
path=path+"D";
si++;
}
}
else if(h[si][sj-1]<v[si][sj]){
path=path+"L";
sj--;
}
else{
path=path+"D";
si++;
}
}
}
return path;
}
void sethv(int prev_si, int prev_sj, string prev_path, int prev_result){
int delta=(int)round(prev_result/prev_path.length())-5000;
while(prev_path.empty()==0){
if(prev_path[0]=='R'){
h[prev_si][prev_sj]=(int)round((h[prev_si][prev_sj]*hc[prev_si][prev_sj]+delta)/(hc[prev_si][prev_sj]+1));
hc[prev_si][prev_sj]++;
prev_sj++;
}
else if(prev_path[0]=='D'){
v[prev_si][prev_sj]=(int)round((v[prev_si][prev_sj]*vc[prev_si][prev_sj]+delta)/(vc[prev_si][prev_sj]+1));
vc[prev_si][prev_sj]++;
prev_si++;
}
else if(prev_path[0]=='L'){
h[prev_si][prev_sj-1]=(int)round((h[prev_si][prev_sj-1]*hc[prev_si][prev_sj-1]+delta)/(hc[prev_si][prev_sj-1]+1));
hc[prev_si][prev_sj-1]++;
prev_sj--;
}
else{
v[prev_si-1][prev_sj]=(int)round((v[prev_si-1][prev_sj]*vc[prev_si-1][prev_sj]+delta)/(vc[prev_si-1][prev_sj]+1));
vc[prev_si-1][prev_sj]++;
prev_si--;
}
prev_path.erase(0, 1);
}
}
void read_s_t(){
cin>>si;
cin>>sj;
cin>>ti;
cin>>tj;
}
void set_prev_s_t(){
prev_si=si;
prev_sj=sj;
prev_ti=ti;
prev_tj=tj;
}
void read_result(){
cin>>prev_result;
}
int main(){
//h初期化
for(i=0; i<=29; i++){
for(j=0; j<=28; j++){
h[i][j]=0;
hc[i][j]=0;
}
}
//v初期化
for(i=0; i<=28; i++){
for(j=0; j<=29; j++){
v[i][j]=0;
vc[i][j]=0;
}
}
for(i=0; i<repeat_count; i++){
read_s_t();
set_prev_s_t();
string path=query(si, sj, ti, tj);
cout<<path<<"\n"<<flush;
read_result();
sethv(prev_si, prev_sj, path, prev_result);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define sc(x) scanf("%lld",&(x));
#define pb push_back
#define fi first
#define se second
#define P pair<int,int>
int qp(int x,int n,int mod){
int ans = 1;
while(n){
if(n&1){
ans = (ans * x)%mod;
}
n >>= 1;
x = (x*x)%mod;
}
return ans;
}
int n;
int A[34][34];
void init(){
A[0][1] = 1;
A[1][0] = 1;
for(int i = 0; i <= 30; i++){
A[i][0] = 1;
A[0][i] = 1;
}
A[0][0] = 0;
for(int i = 1; i <= 30; i++){
for(int j = 1; j <= 30; j++){
A[i][j] = A[i-1][j] + A[i][j-1];
}
}
}
signed main() {
int a,b,k;
init();
sc(a)sc(b)sc(k)
while(a > 0 || b > 0){
if(a == 0){
cout << 'b';
b--;
}else if(b == 0){
cout << 'a';
a--;
}else if(A[a-1][b] >= k){
cout << 'a';
a --;
}else{
k -= A[a-1][b];
cout << 'b';
b--;
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define LL long long
#define rint register int
#define LB lower_bound
#define UB upper_bound
#define MS(x,y) memset(x,y,sizeof(x))
#define rep(i,a,b) for(rint i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(rint i=a,i##end=b;i>=i##end;--i)
#define cms printf("%.2lf\n",(&o2-&o1)/1024.0/1024);
using namespace std;bool o1;
char IO;
inline int Rd(){
int _s_=0;bool _f_=0;
while(!isdigit(IO=getchar()))
(IO=='-')&&(_f_=1);
do _s_=(_s_<<1)+(_s_<<3)+(IO^48);
while(isdigit(IO=getchar()));
return _f_?-_s_:_s_;
}
const int P=1e9+7,n2=5e8+4;
int n,m,k,n2m,a1,b1,in[104];
void cmod(int &x){
x>=P&&(x-=P);
}
int ksm(int x){
int rst=1;
for(rint y=P-2;y;y>>=1,x=1ll*x*x%P)
(y&1)&&(rst=1ll*rst*x%P);
return rst;
}
struct node{
int a[105][105];
node(){MS(a,0);}
node operator * (const node &_) const{
node rst;
rep(i,1,n)
rep(j,1,n)
rep(l,1,n)
cmod(rst.a[i][j]+=1ll*a[i][l]*_.a[l][j]%P);
return rst;
}
}st,nw;
bool o2;int main(){
n=Rd(),m=Rd(),k=Rd();
n2m=1ll*ksm(m)*n2%P;
rep(i,1,n)
st.a[1][i]=Rd();
rep(i,1,m){
in[a1=Rd()]++,in[b1=Rd()]++;
nw.a[a1][b1]=nw.a[b1][a1]=n2m;
}
rep(i,1,n)
cmod(nw.a[i][i]=P+1-1ll*in[i]*n2m%P);
rep(i,0,29){
if(k&(1<<i))
st=st*nw;
nw=nw*nw;
}
rep(i,1,n)
printf("%d\n",st.a[1][i]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endll "\n"
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#define ull unsigned long long
#define rep(i,b) for(int i=0;i<b;i++)
#define For(i, a, b) for(int i=a;i<=b;i++)
#define Rof(i, a, b) for(int i=a;i>=b;i--)
#define rest(a, b) memset(a,b, sizeof(a));
#define recopy(a, b) memcpy(b, a, sizeof(a));
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
int gcd(int a, int b) {while (b ^= a ^= b ^= a %= b);return a;}//最大公约数
ll gcd(ll a, ll b) {while (b ^= a ^= b ^= a %= b);return a;}
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
const int N=1e5+50;
const int maxx=1e7;
int main(){
int x,y,z;
cin>>x>>y>>z;
int d=y*z/x;
if((y*z)%x==0) d--;
cout<<d<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if(a == b) {
cout << c << endl;
}
else if(b == c) {
cout << a << endl;
}
else if(c == a) {
cout << b << endl;
}
else {
cout << 0 << endl;
}
}
| #include <iostream>
using namespace std;
int a, b, c, d, resta_max;
int main()
{
cin>>a>>b>>c>>d;
resta_max=max(max(a-c, max(a-d, b-c)), b-d);
cout<<resta_max;
return 0;
}
|
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
string s,x;
cin>>s>>x;
int curr=1;
set<int> nope;
nope.insert(0);
for (int i=n;i>=1;i--)
{
if (i!=n)
{
curr=(curr*10)%7;
}
int dig=s[i-1]-'0';
dig=(dig*curr)%7;
if (x[i-1]=='T')
{
set<int> cnt;
for (auto el:nope)
{
cnt.insert(el);
if (el<dig)
el+=7;
el=el-dig;
cnt.insert(el);
}
nope.clear();
nope=cnt;
}
else
{
set<int> cnt;
for (int i=0;i<=6;i++)
{
int nx=i+dig;
nx=nx%7;
if (nope.find(i)!=nope.end()&&nope.find(nx)!=nope.end())
cnt.insert(i);
}
nope.clear();
nope=cnt;
}
}
if (nope.find(0)!=nope.end())
cout<<"Takahashi";
else cout<<"Aoki";
return 0;
} | #pragma GCC optimize("Ofast")
//#ifndef ONLINE_JUDGE
//#define _GLIBCXX_DEBUG
//#endif
#ifdef ONLINE_JUDGE
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#include <math.h>
#include <complex>
using namespace std;
#ifdef ONLINE_JUDGE
using namespace atcoder;
#endif
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = int;
#ifdef ONLINE_JUDGE
//using mint = modint998244353;
//using mint = modint;
using mint = modint1000000007;
#endif
const ll MOD=1000000007;
//const ll MOD=998244353;
const long long INF = 1 << 25;
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; }
int uf[1<<18];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
// cout << fixed << setprecision(15);
ll N,M; cin>>N>>M;
vector<ll> graph(N,0);
rep(_,M) {
int a,b; cin>>a>>b; a--; b--;
graph[a]|=1<<b;
graph[b]|=1<<a;
}
vector<ll> dp(1<<N,INF);
dp[0]=1;
rep(i,N) rep(S,1<<N) {
if(dp[S]==1&&(graph[i]&S)==S) dp[S|1<<i]=1;
}
rep(S,1<<N) for(ll T=S;;T=(T-1)&S) {
chmin(dp[S],dp[T]+dp[S&~T]);
if(!T) break;
}
cout<<dp[(1<<N)-1]<<'\n';
return 0;
} |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
int f(string s){
vector<int> a(10);
for(char c : s) a[c - '0']++;
int res = 0;
for(int i = 1; i <= 9; i++){
int x = 1;
for(int j = 0; j < a[i]; j++){
x *= 10;
}
res += x * i;
}
return res;
}
signed main(void){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int k;
cin >> k;
string s, t;
cin >> s >> t;
vector<int> c(10, k);
c[0] = 0;
for(int i = 0; i < 4; i++){
c[s[i] - '0']--;
c[t[i] - '0']--;
}
int cnt = 0;
for(int a = 1; a <= 9; a++){
for(int b = 1; b <= 9; b++){
s[4] = '0' + a;
t[4] = '0' + b;
if(f(s) > f(t)){
if(a == b) cnt += c[a] * (c[a] - 1);
else cnt += c[a] * c[b];
}
}
}
int C = 0;
for(int i = 0; i < 10; i++){
C += c[i];
}
int tot = C * (C - 1);
double ans = (double) cnt / tot;
printf("%.10f\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t LL;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define F first
#define S second
#define pb push_back
mt19937 rnd;
const int N = 1e5 + 10;
vector<ll> a[3];
bool is_even(int x) {
return !(x & 1);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
n *= 2;
for (int i = 1; i <= n; i++) {
ll val;
char ch;
cin >> val >> ch;
if (ch == 'R') a[0].pb(val);
else if (ch == 'G') a[1].pb(val);
else a[2].pb(val);
}
for (int i = 0; i < 3; i++) {
sort(a[i].begin(), a[i].end());
}
ll ans = 1e18;
if (is_even(a[0].size()) && is_even(a[1].size()) && is_even(a[2].size())) {
ans = 0;
}
for (int x = 0; x < 3; x++) {
for (int y = x + 1; y < 3; y++) {
int z = 3 - x - y;
if (!is_even(a[x].size()) && !is_even(a[y].size())) {
assert(is_even(a[z].size()));
for (int i = 0, j = 0; i < a[x].size(); i++) {
while (j + 1 < a[y].size() && a[y][j] < a[x][i]) {
j++;
}
ll cur = 1e18;
for (int k = max(0, j - 5); k <= min(int(a[y].size() - 1), j + 5); k++) {
cur = min(cur, abs(a[x][i] - a[y][k]));
}
ans = min(ans, cur);
}
if (!a[z].empty()) {
vector<pair<ll, int>> lef, rig;
for (int i = 0, j = 0; i < a[z].size(); i++) {
while (j + 1 < a[x].size() && a[x][j] < a[z][i]) {
j++;
}
ll cur = 1e18;
for (int k = max(0, j - 5); k <= min(int(a[x].size() - 1), j + 5); k++) {
cur = min(cur, abs(a[z][i] - a[x][k]));
}
lef.pb({cur, i});
}
for (int i = 0, j = 0; i < a[z].size(); i++) {
while (j + 1 < a[y].size() && a[y][j] < a[z][i]) {
j++;
}
ll cur = 1e18;
for (int k = max(0, j - 5); k <= min(int(a[y].size() - 1), j + 5); k++) {
cur = min(cur, abs(a[z][i] - a[y][k]));
}
rig.pb({cur, i});
}
sort(lef.begin(), lef.end());
sort(rig.begin(), rig.end());
for (int i = 0; i < lef.size() && i < 10; i++) {
for (int j = 0; j < rig.size() && j < 10; j++) {
if (lef[i].S != rig[j].S) {
ans = min(ans, lef[i].F + rig[j].F);
}
}
}
}
}
}
}
cout << ans << "\n";
#ifdef LOCAL
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef vector<pi> vp;
typedef set<ll> si;
typedef map<string, ll> msi;
#define REP(i,a,b) \
for(ll i=ll(a);i<=ll(b);i++)
#define DEP(i,a,b) \
for(ll i=ll(a);i>=ll(b);i--)
#define TR(c, it) \
for (auto it = (c).begin(); it != (c).end(); it++)
#define mp make_pair
#define pb push_back
#define F first
#define S second
ll mod = 1e9+7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T;
T=1;
while(T--)
{
ll n,i,j,k,l,m;
cin>>n;
ll x,y;
ll a[n],b[n];
REP(i,0,n-1)cin>>a[i];
REP(i,0,n-1)cin>>b[i];
x=a[0];
y=b[0];
int flag=0;
REP(i,1,n-1){
k=a[i];
m=b[i];
x=max(k,x);
y=min(y,m);
if(x>y)flag=1;
//cout<<x<<" "<<y<<endl;
}
if(flag)cout<<"0";
else cout<<y-x+1;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define ff first
#define ss second
#define vll vector<ll>
#define pii pair<ll,ll>
#define sz(v) (v).size()
#define srt(v) sort(v.begin(),v.end())
#define ull unsigned long long
#define tell(a) cout<<a<<" "
#define el cout<<endl
#define rev(v) reverse(v.begin(),v.end())
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ld long double
#define mem(a,b) memset(a,b,sizeof(a) )
#define M 4000010
#define md 1000000007
ll power(ll x, ll y, ll p){ll res = 1;x = x % p;while (y > 0){ if (y & 1)res = (res*x) % p;y = y>>1;
x = (x*x) % p;}return res;}
/*inline ll add(ll a,ll b){return (a+b)%md;}
inline ll mul(ll a,ll b){return (a*b)%md;}
ll f[M],iv[M];
ll C(ll n,ll r){return mul(f[n],mul(iv[r],iv[n-r]));}
void prep_fac(){
f[0]=1;
rep(i,1,M)f[i]=mul(i,f[i-1]);
iv[M-1]=power(f[M-1],md-2,md);
for(ll i=M-2;i>=0;--i)iv[i]=mul(i+1,iv[i+1]);
}*/
int main()
{
IOS;
ll n;
cin>>n;
set<ll>s;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
ll x=n/i;
ll y=i;
s.insert(x);
s.insert(y);
}
}
for(auto it=s.begin();it!=s.end();it++){
cout<<*it<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define n_l '\n'
#ifndef ONLINE_JUDGE
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
#endif
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define forn(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef double db;
typedef vector<vi> vvi;
const ll mod=1000000007;
const ll N=200005; //check this
int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll powb(ll a,ll b) {ll res=1;a ; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a;a=a*a;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("inputf.in", "r", stdin);
freopen("outputf.in", "w", stdout);
#endif
int t=1;
//cin>>t;
while(t--){
int n, k;cin >> n >> k;
vi ct(n + 1, 0);
vl a(n);
forn(i,n){
cin >> a[i];
ct[a[i]] = min(ct[a[i]] + 1, k);
}
vi pre(n+1,0);
int cur = 1e6;
for(int i = 0; i <= n; i++){
cur = min(cur, ct[i]);
pre[1]++;
pre[cur+1]--;
}
int ans = 0;
for(int i = 1 ;i <= n; i++){
pre[i] += pre[i-1];
ans += pre[i];
}
cout << ans;
}
}
| #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#define int long long
#define endl "\n"
typedef pair<int,int> PII;
typedef pair<int,string> PIS;
typedef pair<string,int> PSI;
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k;
cin>>n>>k;
deque<int> a;
int num;
rep(i,n){
cin>>num;
a.push_back(num);
}
sort(a.begin(),a.end());
int nex=0;
int ans=0;
int cnt=0;
while(!a.empty()){
//cout<<a[0]<<" "<<nex<<" "<<k<<endl;
//if(nex==6) break;
cnt=0;
while(a[0]==nex){
cnt++;
a.pop_front();
}
ans+=max( (int)0,k-cnt)*nex;
k=min(k,cnt);
nex++;
}
if(k!=0){
ans+=nex*k;
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n ;
cin>>n;
int ans = n/100;
if( n % 100 ) ans ++;
cout<<ans<<endl;
}
int main(){
solve();
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < (int)s.length(); i++) {
if (s[i] == '.') {
break;
}
cout << s[i];
}
cout << endl;
return 0;
} |
// #pragma comment(linker, "/stack:200000000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using i128 = __int128_t;
using u128 = __uint128_t;
using u64 = uint64_t;
//define
#define int long long
#define ll int
#define trav(i,v) for(auto i: v)
#define rep(i,n) for(int i=0;i<n;i++)
#define repu(i,k,n) for(int i=k;i<=n;i++)
#define repd(i,k,n) for(int i=k;i>=n;i--)
#define se second
#define fi first
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define itn int
#define sz(x) (int)x.size()
//typedef
typedef unsigned long long ull;
typedef long double ld;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
typedef std::vector< pii > vii;
typedef std::vector< std::vector<int> > vvi;
typedef std::vector< std::pair < pii, int > > vpp;
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long double PI = 3.141592653589793238;
const long long pi = 31415926;
const long long inf = 1000000000000000000;
const long long small_inf = INT_MAX;
const int N = 500;
int modpow(int x, int n, int mod = MOD){ int res=1; while(n>0){ if(n&1) res=res*x%mod; x=x*x%MOD; n>>=1;} return res;}
int power(int x, int n){ int res=1; while(n>0){ if(n&1) res=res*x; x=x*x; n>>=1; } return res;}
void init(){
}
void solve()
{
/*Don't hurry, nothing good comes if you rush*/
int n, q;
cin>>n>>q;
vi v(n,0);
rep(i,n){
cin>>v[i];
}
while(q--){
itn k;
cin>>k;
int l = k, r = k+100005;
while(l<r){
int m = (l+r)/2;
int pos = upper_bound(all(v), m) - v.begin();
int m1 = m-pos;
if(m1>=k)
r = m;
else
l = m+1;
}
cout<<l<<endl;
}
}
signed main(){
// #ifndef ONLINE_JUDGE
// freopen("./input.txt", "r", stdin);
// freopen("./output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int t23 = 1, tt23 = 1;
// cin>>t23;
init();
while(tt23<=t23)
{
// cout<<"Case #"<<tt23<<": ";
solve();
tt23++;
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
#ifdef INPUT_FILE
auto fre = freopen(INPUT_FILE, "r", stdin);
if (fre == nullptr) {
cout << "invalid input file path: " << INPUT_FILE << endl;
return 0;
}
#endif
solve();
#ifdef INPUT_FILE
fclose(fre);
#endif
return 0;
}
long a[100001];
// index of larget number <= target
int binary_search(int i, int j, long target) {
while (i <= j) {
int mid = (j - i) / 2 + i;
if (target == a[mid]) {
return mid;
}
if (target < a[mid]) {
j = mid - 1;
} else {
i = mid + 1;
}
}
return j;
}
void solve() {
int n, q;
while (cin >> n >> q) {
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
for (int i = 0; i < q; ++i) {
long k;
cin >> k;
int left = 1, right = n;
do {
int index = binary_search(left, n, k);
if (index == left - 1) {
break;
}
k += index - left + 1;
left = index + 1;
} while (true);
cout << k << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define FOR(i, a, b, s) for(int i = (a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR(i, a, b, s) for(int i = (a); (s)>0?i<=(b):i>=(b); i+=(s))
#define EACH(x, a) for(auto& x: a)
#define vt vector
#define pb push_back
#define rev reverse
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define getchar_unlocked getchar
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define inputtxt freopen("input.txt", "r", stdin);
#define outputtxt freopen("output.txt", "w", stdout);
#define sf scanf
#define pf printf
#define endl '\n'
#define inf32 2000000000
#define inf64 2000000000000000000
#define mod17 1000000007
#define mod93 998244353
#define mx 1000000
#define eps 1e-9
template <typename T> T max(T& x, T& y){
return x<y?y:x;
}
template <typename T> T min(T& x, T& y){
return x>y?y:x;
}
/*
ll modexp(ll b, ll e, ll m){
ll r = 1;
while(e > 0){
if(e & 1) r = (r*b)%m;
b = (b*b)%m;
e >>= 1;
}
}
*/
/*
void GetStr(char* res){
char c;
for(;;){
c=getchar_unlocked();
if(c==' ' || c=='\n') continue;
else break;
}
*res=c; res++;
for(;;){
c=getchar_unlocked();
if (c==' ' || c=='\n' || c==EOF) break;
*res=c; res++;
}
*res='\0';
}
*/
/*
void Getll(ll &val){
char ch;bool bo=0;val=0;
for (ch=getchar_unlocked();ch<'0'||ch>'9';ch=getchar_unlocked())if (ch=='-')bo=1;
for (;ch>='0'&&ch<='9';val=(val<<1)+(val<<3)+ch-48,ch=getchar_unlocked());
if (bo)val=-val;
}
*/
void Getint(int &val){
char ch;bool bo=0;val=0;
for (ch=getchar_unlocked();ch<'0'||ch>'9';ch=getchar_unlocked())if (ch=='-')bo=1;
for (;ch>='0'&&ch<='9';val=(val<<1)+(val<<3)+ch-48,ch=getchar_unlocked());
if (bo)val=-val;
}
int k;
ll ans, tambah;
int main(){
Getint(k);
int b1 = cbrt(k);
F_OR(i,1,b1,1){
int b2 = sqrt(k/i);
F_OR(j,i,b2,1){
if(i == j) tambah = 1;
else tambah = 3;
int b3 = k/(i*j);
if(b3 < j) break;
tambah = tambah + (b3-j)*(tambah == 1?3:6);
ans += tambah;
//printf("%d %d: %lld\n", i, j, tambah);
}
}
printf("%lld\n",ans);
return 0;
}
| #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define mp make_pair
const int p = 1e9 + 7;
int mul(int a, int b) {
return (1LL * a * b) % p;
}
int add(int a, int b) {
int s = (a+b);
if (s>=p) s-=p;
return s;
}
int sub(int a, int b) {
int s = (a+p-b);
if (s>=p) s-=p;
return s;
}
int po(int a, ll deg)
{
if (deg==0) return 1;
if (deg%2==1) return mul(a, po(a, deg-1));
int t = po(a, deg/2);
return mul(t, t);
}
int inv(int n)
{
return po(n, p-2);
}
mt19937 rnd(time(0));
/*
const int N = 1e6 + 5;
vector<int> facs(N), invfacs(N);
void init()
{
facs[0] = 1;
for (int i = 1; i<N; i++) facs[i] = mul(facs[i-1], i);
invfacs[N-1] = inv(facs[N-1]);
for (int i = N-2; i>=0; i--) invfacs[i] = mul(invfacs[i+1], i+1);
}
int C(int n, int k)
{
if (n<k) return 0;
if (n<0 || k<0) return 0;
return mul(facs[n], mul(invfacs[k], invfacs[n-k]));
}*/
/*struct DSU
{
vector<int> sz;
vector<int> parent;
vector<int> value;
void make_set(int v) {
parent[v] = v;
sz[v] = 1;
value[v] = 0;
}
int find_set(int v) {
if (v == parent[v])
return v;
else
{
auto par = find_set(parent[v]);
value[v]^=value[parent[v]];
parent[v] = par;
return par;
}
}
void union_sets(int a, int b, int w) {
find_set(a);
find_set(b);
w^=value[a]; w^=value[b];
a = find_set(a);
b = find_set(b);
if (a != b) {
if (sz[a] < sz[b])
swap(a, b);
parent[b] = a;
value[b] = w;
sz[a] += sz[b];
}
}
int val(int v)
{
find_set(v); return value[v];
}
DSU (int n)
{
parent.resize(n);
sz.resize(n);
value.resize(n);
for (int i = 0; i<n; i++) make_set(i);
}
};*/
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
int k; cin>>k;
int ans = 0;
for (int a = 1; a<=k; a++)
for (int b = 1; a*b<=k; b++)
for (int c = 1; a*b*c<=k; c++) ans++;
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const uint64_t seed = std::chrono::system_clock::now().time_since_epoch().count();
mt19937_64 rnd(seed);
const int MOD = 998244353;
#ifdef VIPJML_LOCAL
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
os << "{";
for (typename vector<T>::const_iterator vi = v.begin(); vi != v.end(); ++vi)
{
if (vi != v.begin())
os << ", ";
os << *vi;
}
os << "}";
return os;
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const vector<pair<A, B>> &v)
{
os << "{";
for (typename vector<pair<A, B>>::const_iterator vi = v.begin(); vi != v.end(); ++vi)
{
if (vi != v.begin())
os << ", ";
os << '(' << vi->first << " " << vi->second << ")";
}
os << "}";
return os;
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p)
{
os << '(' << p.first << ", " << p.second << ')';
return os;
}
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T)
{
cerr << ' ' << H;
dbg_out(T...);
}
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
using LL = long long;
void solve(int caseNum)
{
int N;
cin >> N;
vector<int> P(N);
vector<int> idx(N);
for (int i = 0; i < N; i++)
{
cin >> P[i];
P[i]--;
idx[P[i]] = i;
}
vector<int> res;
bool f = true;
int cur = 0;
while (cur + 1 < N && f)
{
if (idx[cur] == cur)
{
f = false;
break;
}
else
{
int ncur = idx[cur];
for (int j = ncur - 1; j >= cur; j--)
{
swap(idx[P[j]], idx[P[j + 1]]);
swap(P[j], P[j + 1]);
res.push_back(j);
}
for (int j = cur; j < ncur; j++)
{
if (j != P[j])
{
f = false;
break;
}
}
cur = ncur;
}
}
if (f)
{
for (int i = 0; i < N - 1; i++)
cout << res[i] + 1 << "\n";
}
else
cout << -1 << endl;
}
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int T = 1;
// cin >> T;
for (int i = 1; i <= T; i++)
{
solve(i);
}
cout.flush();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> struct BIT {
int mxn;
vector<T> data;
const bool zi;
const T un;
BIT<T>(int max_n, bool zero_indexed = false, T unit = T(0)) : mxn(max_n), zi(zero_indexed), un(unit) {
if ( zi ) mxn++;
data.assign(mxn + 1, unit);
}
void add(int i, T x) {
if ( zi ) i++;
assert( i > 0 );
while ( i <= mxn ) {
data[i] += x;
i += i & -i;
}
}
T sum(int i) {
if ( zi ) i++;
assert( i > 0 );
T s = un;
while ( i > 0 ) {
s += data[i];
i -= i & -i;
}
return s;
}
vector<T> get_sum_list(int l, int r) {
vector<T> a;
for ( int i = l; i <= r; i++ ) {
a.push_back(sum(i));
}
return a;
}
};
ll inversion(vector<ll>& v, ll v_max = -1) {
if ( v_max < 0 ) {
v_max = *max_element(v.begin(), v.end());
}
int nv = v.size();
BIT<ll> b(v_max, true);
ll ans = 0;
for ( int i = 0; i < nv; i++ ) {
ans += (ll)(i - b.sum(v[i]));
b.add(v[i], 1);
}
return ans;
}
ll solve() {
ll N;
cin >> N;
vector<ll> P(N);
for ( int i = 0; i < N; i++ ) cin >> P[i];
ll v = inversion(P, N);
if ( v != N-1 ) return -1;
queue<int> q;
for ( int i = 0; i < N-1; i++ ) {
if ( P[i] > P[i+1] ) q.push(i);
}
vector<int> ans;
while ( !q.empty() ) {
int i = q.front();
q.pop();
if ( P[i] > P[i+1] ) {
ans.push_back(i);
swap(P[i],P[i+1]);
}
if ( i > 0 ) {
if ( P[i-1] > P[i] ) q.push(i-1);
}
if ( i+2 < N ) {
if ( P[i+1] > P[i+2] ) q.push(i+1);
}
}
for ( int i = 0; i < ans.size(); i++ ) {
cout << ans[i]+1 << "\n";
}
return 0;
}
int main() {
auto ans = solve();
if ( ans < 0 ) {
cout << ans << "\n";
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define M_PI 3.1415926535
#define ll long long
#define ld long double
#define all(a) a.begin(),a.end()
#define Summon_Tourist ios::sync_with_stdio(false);cin.tie(0);
ll gcd(ll a , ll b) { return b==0?a: gcd( b, a%b); }
ll lcm(ll a , ll b) { return a/gcd(a,b) * b ; }
ll inf = 998244353;
ll modexp( ll base ,ll power)
{
if( power == 0 ) return 1;
if( power & 1) return base*modexp( base , power-1 )%inf;
return modexp(base*base%inf,power/2);
}
int main()
{
Summon_Tourist
//freopen("input.txt" , "r" , stdin ) ;
ll t = 1;
//cin>>t;
while(t--)
{
ll n,k; cin>>n>>k;
vector<ll> a(2*n+1,0);
for( ll i = 2 ; i<=2*n ; i++ ){
if( i<=n ) a[i] = i - 1 ;
else{
a[i] = ( i-1 ) - 2*(i - n - 1) ;
}
}
if ( k<0 ) k *= -1 ;
ll ans = 0 ;
for( ll i = k+2 ; i<=2*n ; i++ ){
ans += ( a[i] * a[i-k] ) ;
}
cout<<ans;
}
return 0;
}
| #include <iostream>
#include <cstdio>
using namespace std;
const int N=5010,mod=998244353;
int fp[N][N],res[N];
int main()
{
int n,m,ans=0;
scanf("%d%d",&n,&m);
for(int i=0;i<=m;i++)
{
fp[i][0]=1;
for(int j=1;j<=n;j++)
fp[i][j]=1ll*fp[i][j-1]*i%mod;
}
for(int d=1;d<=n-1;d++)
{
for(int x=1;x<=m;x++)
res[d]=(res[d]+fp[m-x][d-1])%mod;
res[d]=1ll*res[d]*fp[m][n-d-1]%mod;
}
ans=1ll*n*fp[m][n]%mod;
for(int i=1;i<=n;i++)
for(int j=1;j<i;j++)
ans=(ans-res[i-j])%mod;
printf("%d\n",(ans+mod)%mod);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,sum=0;cin>>n;int a[n],b[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
//sum+=a[i]+b[i];
}
for(int i=0;i<n;i++)
{
cin>>b[i];
}
for(int i=0;i<n;i++)
{
long long m=0;
m=a[i]*b[i];
sum+=m;
}
if(sum==0)
{
cout<<"Yes"<<endl;
}
else
cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (ll i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
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; }
typedef long long ll;
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
typedef pair<int, int> P;
int main()
{
int T;
cin >> T;
string cp = "atcoder";
while (T--) {
string S;
cin >> S;
if (S > cp) {
cout << 0 << endl;
continue;
}
ll ans = INF;
repd(i, 1, S.size()) {
if (S[i] > 'a') {
chmin(ans, i);
break;
}
}
repd(i, 2, S.size()) {
if (S[i] > 't') {
chmin(ans, i - 1);
break;
}
}
if (ans == INF) ans = -1;
cout << ans << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)
template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}
const char newl = '\n';
int main() {
int q;
cin >> q;
while (q-- ) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0;i < n;++i) cin >> a[i];
bool fi = false;
if (n%2 == 0) {
sort(a.begin(),a.end());
for (int i = 0;i < n/2;++i) if (a[i*2] != a[i*2+1]) {
fi = true;
break;
}
}
cout << (fi ? "First" : "Second") << newl;
}
} | // 解き直し.
// https://atcoder.jp/contests/arc105/editorial/171
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define a first
#define b second
int main(){
// 1. 入力情報.
int T;
scanf("%d", &T);
// 2. 各テストケースを確認.
rep(i, T){
// 2-1. テストパターン.
int N;
scanf("%d", &N);
LL a;
map<LL, int> m;
rep(j, N){
scanf("%lld", &a);
m[a]++;
}
// 2-2. N が 奇数.
if(N & 1) puts("Second");
// 2-3. N が 偶数.
if(!(N & 1)){
// 任意の整数 n について n 個のコインが入った袋の偶奇をチェック.
LL e = 0;
for(auto &p : m) if(!(p.b & 1)) e++;
// 任意の整数 n について n 個のコインが入った袋が偶数個ある場合(後手必勝).
if(m.size() == e) puts("Second");
// それ以外.
if(m.size() != e) puts("First");
}
}
return 0;
} |
#include<bits/stdc++.h>
#include "cmath"
#define ll long long int
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define inf (1<<30)
#define linf 1e18
#define ninf -1e9
#define fore(i, r) for(int i = 1; i <= int(r); i++)
#define loop(i,r) for(int i = 0; i < int(r) ; i++)
#define loop1(i,r) for(int i=1;i<=r;i++)
#define looplr(i,l,r) for(int i=l;i<=r;i++)
#define rloop(i,r) for(int i=r-1;i>=0;i--)
#define min3(x1, x2, x3) (x3 > min(x1, x2) ? min(x2, x1) : x3)
#define max3(x1, x2, x3) (x3 < max(x1, x2) ? max(x1, x2) : x3)
#define sz(a) int((a).size())
#define vi vector< int >
#define vl vector<long long int>
#define vpi vector<pair<int, int> >
#define vpl vector<pair<long long int, long long int> >
#define pb push_back
#define umi unordered_map<int , int>
#define umc unordered_map<char , int>
#define uml unordered_map<long long int , long long int>
#define mpi map<int, int>
#define sti set<int>
#define stl set<long long int>
#define ff first
#define ss second
#define len(x) (int)x.length()
#define ctn continue
#define brk break
#define ub(i,x) upper_bound(i.begin(), i.end(),x)
#define lb(i,x) lower_bound(i.begin(), i.end(),x)
#define ump unordered_map
#define str string
#define memn1(x) memset(x,-1,sizeof(x))
#define mem1(x) memset(x,1,sizeof(x))
#define mem0(x) memset(x,0,sizeof(x))
#define rtn return
#define srt(x) sort(all(x))
#define srtgi(x) sort(all(x), greater<int>())
#define srtgl(x) sort(all(x), greater<ll>())
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define nline cout<< "\n"
#define chngl "\n"
#define takei(input) scanf("%d",&input)
#define takel(input) scanf("%lld",&input)
#define pll pair<long long int, long long int>
#define putyes printf("Yes\n")
#define putno printf("No\n")
#define sid int
const int mod = 1e9 + 7;
using namespace std;
const int N = 1e6 + 5;
int prime[N];
void calPrime() {
for (int i = 1; i <= 1000000; i++) prime[i] = 1;
for (int i = 2; i * i <= 1e6 + 1; i++) {
if (prime[i] == -1) ctn;
prime[i] = 1;
for (int j = 2 * i; j <= 1e6 + 1; j += i) {
prime[j] = -1;
}
}
}
int pow2(int expo) {
int val = 1;
int pp = 1;
while (pp <= expo) {
val = ((val % 1000003 ) * 2) % 1000003 ;
pp++;
}
return val % 1000003;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
//calPrime();
int tme = 1;
//cin >> tme;
while (tme--) {
int n; cin >> n;
vi a(n);
loop(i, n) cin >> a[i];
int ans = inf;
//cout << inf << endl;
loop(mask, 1 << (n - 1)) {
int xored = 0;
int ored = 0;
loop(i, n ) {
ored |= a[i];
if (i == n - 1 || mask & (1 << i)) {
xored ^= ored;
ored = 0;
}
}
ans = min(ans, xored);
}
cout << ans;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int fpow(int a,int b){
int ans=1;
while(b){
if(b&1) ans=1ll*ans*a%mod;
a=1ll*a*a%mod;
b>>=1;
}
return ans;
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
int a=0,b=n,c=m+n;
for(int i=1;i<=n;i++){
scanf("%d",&a);
b=(b+a);
}
int ans=1;
for(int i=1;i<=b;i++){
ans=1ll*ans*(c-i+1)%mod;
ans=1ll*ans*fpow(i,mod-2)%mod;
}
printf("%d",ans);
} |
#include "bits/stdc++.h"
#include <random>
#include <chrono>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
for (T& in : v) is >> in;
return is;
}
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>
T div_floor(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
F f;
rec(F&& f_) : f(std::forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&... args) const {
return f(*this, std::forward<Args>(args)...);
}
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e18;
lint dx[8] = { 0, -1, 0, 1, 1, -1, 1, -1 }, dy[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
lint from, to;
lint cost, color;
Edge() {
}
Edge(lint u, lint v, lint c, lint col) {
cost = c;
color = col;
from = u;
to = v;
}
bool operator<(const Edge& e) const {
return cost < e.cost;
}
};
struct WeightedEdge {
lint to;
lint cost, color;
WeightedEdge(lint v, lint c, lint _color) {
to = v;
cost = c;
color = _color;
}
bool operator<(const WeightedEdge& e) const {
return cost < e.cost;
}
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<plint, lint> tlint;
typedef pair<plint, plint> qlint;
typedef pair<lint, string> valstr;
typedef pair<ld, plint> _pld;
typedef pair<ld, lint> pidx;
lint N;
int main() {
cin >> N;
V<valstr> arr(N);
REP(i, N) {
lint T;
string S;
cin >> S >> T;
arr[i] = { T, S };
}
sort(RALL(arr));
cout << arr[1].second << endk;
} | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<endl
#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<string> rotate(vector<string> s) {
int n=s.size(),m=s[0].size();
vector<string> t(m);
rep(i,m)rrep(j,n) t[i]+=s[j][i];
return t;
}
ll n,m;
string s[1000];
ll calc(vector<string> t) {
ll cnt=0;
rep(k,m) {
ll f=0;
rep(l,2) {
rep(i,n) {
rep(j,n) {
if(t[i].substr(0,s[k].size())==s[k]) f=1;
rotate(t[i].begin(),t[i].begin()+1,t[i].end());
}
}
t=rotate(t);
}
cnt+=f;
}
return cnt;
}
vector<string> ans;
ll MM;
void solve(vector<string> t) {
ll d=calc(t);
if(MM<d) {
MM=d;
ans=t;
}
rep(k,5) {
random_shuffle(all(t));
rep(i,n) rotate(t[i].begin(),t[i].begin()+rand()%n,t[i].end());
ll d=calc(t);
if(MM<d) {
MM=d;
ans=t;
}
}
}
void Main() {
srand((unsigned)time(NULL));
cin >> n >> m;
rep(i,m) R s[i];
vector<string> v[15];
rep(i,m) v[s[i].size()].pb(s[i]);
rep(e,30) {
vector<string> t(n);
rrep(i,15) {
random_shuffle(all(v[i]));
rep(j,v[i].size()) {
ll M=MAX,x=0;
string rr;
rep(k,n) {
rep(l,t[k].size()+1) {
string r1=t[k].substr(l);
if(r1.size()<=v[i][j].size()) {
string r2=v[i][j].substr(0,r1.size());
if(r1==r2) {
ll d=t[k].size()+v[i][j].size()-r1.size();
if(d<=n&&M>d) {
M=d;
x=k;
rr=t[k]+v[i][j].substr(r1.size());
}
}
}
}
}
if(rand()%6==0) M=MAX;
if(M!=MAX) t[x]=rr;
}
}
rep(i,n) {
while(t[i].size()<n) {
//t[i]+='.';
t[i]+=(char)(rand()%8+'A');
}
}
solve(t);
}
rep(i,n) pr(ans[i]);
}
int main(){Main();return 0;}
|
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
const ll linf = 2e18 + 100;
const int inf = 1e9 + 100;
const ll mod = 1e9 + 7;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
cout << b - c << endl;
return 0;
} | /****************##### بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم #####********************/
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define EPS 1e-6
#define F first
#define sf scanf
#define pf printf
#define S second
#define MP make_pair
#define pb push_back
#define PI acos(-1.0)
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define sz(x) int(x.size())
#define all(a) a.begin(),a.end()
#define srt(x) sort(x.begin(),x.end())
#define clock_start clock_t tStart = clock()
#define MEM(a, b) memset(a, (b), sizeof(a))
#define dbg(x) cout << (#x) << " = " << (x) << endl
#define Fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define dbg2(x, y) cout << #x << " = " << x << " " << #y << " = " << y << endl
#define dbg3(x, y, z) cout << #x << " = " << x << " " << #y << " = " << y << " " << #z << " = " << z << endl
#define show_time cout<<"\n\nTime Taken: "<<fixed<<setprecision(3)<<(double)(clock() - tStart) / CLOCKS_PER_SEC<<"s"
/******------- Some bit operations ------*****/
long long SetBit (long long n, long long X) { return n | (1LL << X); }//X-1 tomo bit 0 hole 1 korbe, 1 hole unchange
long long ClearBit (long long n, long long X) { return n & ~(1LL << X); }//X-1 tomo bit 1 hole 0 korbe, 0 hole unchange
long long ToggleBit (long long n, long long X) { return n ^ (1LL << X); }//X-1 tomo bit 1 hole 0 korbe r 0 hole 1
bool CheckBit (long long n, long long X) { return (bool)(n & (1LL << X)); }//X-1 tomo bit 1 naki 0 bolbe
/*******-----------Graph Moves------------*****/
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
const int kx[] = {-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
const int ky[] = {-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
const int Kx[] = {0, 0, 1, -1, -1, 1, -1, 1}; // Kings Move
const int Ky[] = {-1, 1, 0, 0, 1, 1, -1, -1}; // Kings Move
/*--------------------------------------------*/
///////////////////////////////////////////////////////////////////////////
///////////////////////// DO NOT TOUCH BEFORE THIS LINE //////////////////////////
//////////////////////////////////////////////////////////////////////////
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pll;
const int MAX = 1e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
void Test_Case();
void File();
void solve()
{
int a,b,c,d,x,y;
cin>>a>>b>>c>>d;
x=max(a,b);
y=min(c,d);
cout<<x-y<<endl;
}
int main()
{
Fast;
File();
//Test_Case();
solve();
return 0;
}
void Test_Case()
{
int tc;
cin>>tc;
for(int R=1;R<=tc;R++)
{
//cout << "Case " << R << ": ";
solve();
}
}
void File()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
|
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define eps (double)(1e-9)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
int n;
vector<vector<int>> G(100010);
//ret = First - Second
//rに動かした人がplayer == 0, player == 1なら交代
P solve(int r){
int ret = 1;
int player = 1, cnt = 0;
priority_queue<int> que;
for(auto v : G[r]){
P now = solve(v);
if(!now.second && now.first < 0)ret += now.first;
if(!now.second && now.first > 0)cnt += now.first;
if(now.second)que.push(-now.first);
}
while(!que.empty()){
int t = -que.top();
que.pop();
if(player)ret += t;
else ret -= t;
player ^= 1;
}
if(player)ret += cnt;
else ret -= cnt;
return {ret, player};
}
int main() {
cin >> n;
rep(i, n-1){
int p;
cin >> p;
G[p-1].push_back(i+1);
}
cout << (n+solve(0).first)/2 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int sum=0,n;
int dp[101][100001],a[101];
int f(int i, int t){
if(i==n) return max(t,sum-t);
if(dp[i][t]!=-1) return dp[i][t];
int ret=f(i+1,t);
ret=min(ret,f(i+1,t+a[i]));
dp[i][t]=ret;
return ret;
}
int main(){
ios_base::sync_with_stdio(false);
memset(dp,-1,sizeof(dp));
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
cout<<f(0,0)<<"\n";
return 0;
} |
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#include <stack>
using namespace std;
#define enviar {ios_base::sync_with_stdio(false);}
#define aiuda {cin.tie(NULL); cout.tie(NULL);}
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) ;F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
#define exacto(v) cout << setprecision(v) << fixed;
#define ll long long
#define lld long double
#define eb emplace_back
#define em emplace
#define ef emplace_front
#define f first
#define s second
#define big greater<ll>()
#define bpc(x) __builtin_popcount(x)
#define bpc2(x) __builtin_clz(x)
#define bpc3(x) __builtin_ctz(x)
#define DIE(args...) {print(args); return;}
#define lb lower_bound
#define ub upper_bound
#define ar(v) array<int,v>
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x).size()
#define meminf(v) memset(v, 0x3f , sizeof(v))
#define mem(v,x) memset(v , x , sizeof v);
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int n1, n2; cin >> n1 >> n2; n1--; n2--; list[n1].eb(n2); list[n2].eb(n1);}
template <typename T> struct combinator { T t_; combinator(T&& t) : t_(std::forward<T>(t)) {} template <typename... Args> auto operator () (Args&&... args) const { return t_(*this, std::forward<Args>(args)...); } };
template<class T> bool umin(T& a, const T& b) { return b<a?a=b, 1:0; }
template<class T> bool umax(T& a, const T& b) { return a<b?a=b, 1:0; }
string to_string(bool b) {return b?"true":"false"; }
string to_string(char c) { return string(1, c);}
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
template<class T> string to_string(T v) { bool f=1; string res; EACH(x, v) { if(!f) res+=' '; f=0; res+=to_string(x); } return res; }
template<class A> void write(A x) { cout << to_string(x); }
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if(sizeof...(t)) write(' '); print(t...); }
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pair<ll, ll>> vpll;
typedef map<ll, ll> mll;
typedef priority_queue<int, std::vector<int>, std::greater<int>> priomin;
const ll mod = 998244353;
//const ll mod = 1e9 + 7;
const ll maxsize =3e5 + 5;
const ll inf = 0x3f3f3f3f3f3f3f3f ;
// size, caracter
ll a[maxsize];
//vll adj[maxsize];
//ll l[maxsize];
ll l[maxsize][2];
ll dp[maxsize][2];
void solve()
{
ll n;
cin >> n;
ai(a, n);
FOR(i , n)
{
if (i%2) a[i]*=-1;
}
partial_sum(a , a+ n , a);
mll cnt;
ll ans = 0;
cnt[0]++;
FOR(i , n)
{
ans += cnt[a[i]]++;
}
print(ans);
}
int main(){
enviar aiuda
int tc = 1;
//cin >> tc;
while(tc--) solve();
return 0;
}
| //Utkarsh.25dec
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
#define loop(i,a,b) for(ll i=a;i<=b;i++)
#define vi vector <int>
#define vs vector <string>
#define vc vector <char>
#define vl vector <ll>
#define all(c) (c).begin(),(c).end()
#define max3(a,b,c) max(max(a,b),c)
#define min3(a,b,c) min(min(a,b),c)
#define deb(x) cerr<<#x<<' '<<'='<<' '<<x<<'\n'
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// ordered_set s ; s.order_of_key(val) no. of elements strictly less than val
// s.find_by_order(i) itertor to ith element (0 indexed)
typedef vector<vector<ll>> matrix;
ll power(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll modInverse(ll a){return power(a,mod-2);}
const int N=5005;
bool vis[N];
string ans[N];
vector <string> recurse(int n)
{
int x=(1<<(n-1))-1;
int y=x+1;
int rounds=(1<<n)-1;
vs ans;
if(n==1)
{
ans.pb("AB");
return ans;
}
vs fun=recurse(n-1);
for(auto s:fun)
{
string temp="";
temp=s+s;
ans.pb(temp);
temp=s;
for(auto ch:s)
{
if(ch=='A')
temp+='B';
else
temp+='A';
}
ans.pb(temp);
}
string temp="";
temp+='A';
for(int i=1;i<(1<<n);i++)
{
int cnt=0;
for(auto s:ans)
{
if(s[i]=='A')
cnt++;
}
if(cnt==x)
temp+='B';
else
temp+='A';
}
ans.pb(temp);
return ans;
}
void solve()
{
ll n;
cin>>n;
cout<<((1<<n)-1)<<'\n';
vs fun=recurse(n);
for(auto it:fun)
cout<<it<<'\n';
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T=1;
//cin>>T;
int t=0;
while(t++<T)
{
//cout<<"Case #"<<t<<":"<<' ';
solve();
//cout<<'\n';
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2.1e5;
int n, m, tkn[N], ans[N];
vector<pair<int, int>> e[N];
queue<int> q;
void fn(int v) {
tkn[v] = 1;
for (auto [u, c] : e[v]) {
if (!tkn[u]) q.push(u);
}
}
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v, c;
cin >> u >> v >> c;
u--;
v--;
c--;
e[u].push_back({v, c});
e[v].push_back({u, c});
}
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
if (tkn[v]) continue;
if (v == 0) ans[v] = 0; else {
for (auto [u, c] : e[v]) {
if (tkn[u]) {
ans[v] = c == ans[u] ? (c + 1) % n : c;
break;
}
}
}
fn(v);
}
for (int i = 0; i < n; i++) cout << ans[i] + 1 << '\n';
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define F first //pairの一つ目の要素
#define S second //pairの二つ目の要素
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
//V,Pは大文字i,l,bは小文字
using ll = long long;
using Vi = vector<int>;
using VVi = vector<Vi>;
using Vl = vector<ll>;
using VVl = vector<Vl>;
using Vb = vector<bool>;
using VVb = vector<Vb>;
using P = pair<int,int>;
using Pl = pair<ll, ll>;
using Vs = vector<string>;
const ll mod = 1000000007;
const ll inf = 1000000000000;//10の12乗
#define yn {puts("Yes");}else{puts("No");}
#define dame { puts("-1"); return 0;}
int n,m;
vector<vector<P>> v(200005);
vector<bool> seen(200005);
vector<long long> ans(200005,0);
void dfs(int k){
if(!seen[k]){
seen[k]=true;
for(auto next:v[k]){
if(seen[next.F]) continue;
if(ans[k]!=next.S&&ans[next.F]==0){
ans[next.F]=next.S;
}
dfs(next.F);
}
}
}
int main() {
cin >> n >> m;
VVl ng(n);
map<P,int> mp;
rep(i,m){
int x,y,z;
cin >> x >> y >> z;
x--;y--;
if(mp[MP(x,y)]) continue;
mp[MP(x,y)]++;
v[x].push_back(MP(y,z));
v[y].push_back(MP(x,z));
ng[x].PB(z);
ng[y].PB(z);
}
int now=0;
rrep(j,1,n+1){
if(ng[0][now]==j)now++;
else{
ans[0]=j;
break;
}
if(j==n) ans[0]=n;
}
dfs(0);
rep(i,n){
sort(all(ng[i]));
ng[i].PB(-1);
}
rep(i,n){
if(ans[i]==0){
now=0;
rrep(j,1,n+1){
if(ng[i][now]==j)now++;
else{
ans[i]=j;
break;
}
if(j==n) ans[i]=n;
}
}
}
rep(i,n) cout << ans[i] << endl;
} |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <random>
#include <vector>
using namespace std;
constexpr int N = 30; // width and height
constexpr int MED_DISTANCE = (1000 + 9000) / 2;
using P = pair<int, int>;
using VPATH = array<array<int, N>, N - 1>;
using HPATH = array<array<int, N - 1>, N>;
mt19937 rng{random_device{}()};
// 上下移動、左右移動の回数を渡すとそこに移動するUDLRパスを返す
// 1,2→DRR
// -2,3→UULLL
string getUDLRpath(int vmove, int hmove) {
string path;
path += string(abs(vmove), vmove > 0 ? 'D' : 'U');
path += string(abs(hmove), hmove > 0 ? 'R' : 'L');
return path;
}
class Solver {
private:
VPATH h{};
HPATH w{};
string prev_path;
P prev_s, prev_t;
int evaluate(const string &path, P s) {
int length = 0;
for (auto &&i : path) {
switch (i) {
case 'U':
length += h[s.first - 1][s.second];
s.first--;
break;
case 'D':
length += h[s.first][s.second];
s.first++;
break;
case 'L':
length += w[s.first][s.second - 1];
s.second--;
break;
case 'R':
length += w[s.first][s.second + 1];
s.second++;
break;
default:
break;
}
}
return length;
}
void reflectResult(const string &path, P s, int prev_result) {
if (path.size() == 0) return;
const int inc = prev_result / path.size() - MED_DISTANCE;
for (auto &&i : path) {
switch (i) {
case 'U':
h[s.first - 1][s.second] += inc;
s.first--;
break;
case 'D':
h[s.first][s.second] += inc;
s.first++;
break;
case 'L':
w[s.first][s.second - 1] += inc;
s.second--;
break;
case 'R':
w[s.first][s.second] += inc;
s.second++;
break;
default:
break;
}
}
}
public:
string query(P s, P t, int prev_result) {
if (prev_path.size() > 0) reflectResult(prev_path, prev_s, prev_result);
const int vmove = t.first - s.first, hmove = t.second - s.second;
const string init_path = getUDLRpath(vmove, hmove);
vector<string> choices;
string tmp_path = init_path;
for (int i = 0; i < 2000; i++) {
shuffle(tmp_path.begin(), tmp_path.end(), rng);
choices.emplace_back(tmp_path);
}
string path = choices.front();
for (auto &&c : choices) {
if (evaluate(c, s) < evaluate(path, s)) {
path = c;
}
}
prev_s = s, prev_t = t;
prev_path = path;
return path;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int prev_result = 0;
Solver sol; // ソルバー
// 各クエリを処理
for (int k = 0; k < 1000; k++) {
// s, t受け取り
P s, t;
cin >> s.first >> s.second >> t.first >> t.second;
// パス計算 出力
const string path = sol.query(s, t, prev_result);
cout << path << endl;
// 結果受け取り
cin >> prev_result;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(int (i) = 0; (i) < (n); ++(i))
#define pf(x) cout << (x) << endl
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
const char mc[4]={'U','L','D','R'};
const int max_e = 9000;
const int inf = 1000000000;
int mh[29][29],mv[29][29];
int dijkstra(vector<vector<int> > &m, pair<int, int> s){
priority_queue<pair<int,pair<int,int> >, vector<pair<int,pair<int,int> > >, greater<pair<int,pair<int,int> > > > next;
next.push(make_pair(0,s));
while (!next.empty()) {
int x = next.top().second.first,y = next.top().second.second;
int p = next.top().first;
next.pop();
if(x > 0){
if(chmin(m[x - 1][y], p + mv[x - 1][y])){
next.push(make_pair(p + mv[x - 1][y], make_pair(x - 1, y)));
}
}
if(x < 29){
if(chmin(m[x + 1][y], p + mv[x][y])){
next.push(make_pair(p + mv[x][y], make_pair(x + 1, y)));
}
}
if(y > 0){
if(chmin(m[x][y - 1], p + mv[x][y - 1])){
next.push(make_pair(p + mv[x][y - 1], make_pair(x, y - 1)));
}
}
if(y < 29){
if(chmin(m[x][y + 1], p + mv[x][y])){
next.push(make_pair(p + mv[x][y], make_pair(x, y + 1)));
}
}
}
return 0;
}
string restore(vector<vector<int> > &m, int x, int y){
string root = "";
int s = 0;
while (m[x][y] != 0) {
++s;
int next_x = x,next_y = y,p = m[x][y];
rep0(i, 4)if(chmin(p, m[min(max(0,x + dx[i]),29)][min(max(0,y + dy[i]),29)])){
next_x = x + dx[i];
next_y = y + dy[i];
if(s != root.size())root.push_back(mc[i]);
else root[s - 1] = mc[i];
}
x = next_x;
y = next_y;
}
reverse(all(root));
return root;
}
int update(string s, int p, int x, int y){
rep0(i, s.size()){
if(s[i] == 'U'){
mv[x - 1][y] = (mv[x - 1][y] + p + 1) / 2;
x--;
}else if(s[i] == 'D'){
mv[x][y] = (mv[x][y] + p + 1) / 2;
x++;
}else if(s[i] == 'R'){
mh[x][y] = (mh[x][y] + p + 1) / 2;
y++;
}else{
mh[x][y - 1] = (mh[x][y - 1] + p + 1) / 2;
y--;
}
}
return 0;
}
//modを確認すること
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
rep0(i, 30)rep0(j, 30){
mh[i][j] = max_e;
mv[i][j] = max_e;
}
rep0(i, 1000){
vector<vector<int> > m(30,vector<int>(30,inf));
int sx,sy,gx,gy,p;
string s = "";
cin >> sx >> sy >> gx >> gy;
m[sx][sy] = 0;
dijkstra(m, make_pair(sx, sy));
string ans = restore(m, gx, gy);
pf(ans);
cin >> p;
update(ans, int((p + ans.size() - 1) / ans.size()), sx, sy);
}
return 0;
}
|
#ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_ }
#define MY_DEBUG(s) s
#else
#define MY_NAMESPACE(ns)
#define MY_NAMESPACE_
#define MY_DEBUG(s)
#endif
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define EPS (1e-7)
constexpr int IMIN = numeric_limits<int>::min();
constexpr int IMAX = numeric_limits<int>::max();
constexpr ll LLMIN = numeric_limits<ll>::min();
constexpr ll LLMAX = numeric_limits<ll>::max();
MY_NAMESPACE(testbed)
int count_query(vector<int>& dishes, int current_k, vector<int> const& a, vector<int> const& b, vector<int> const& queried, vector<int> const& c, vector<int> const& d)
{
if (current_k == c.size())
{
int ans = 0;
for (int i = 0; i < (int)a.size(); i++)
{
if (dishes[a[i]] == 1 && dishes[b[i]] == 1)
ans++;
}
return ans;
}
int this_c = c[current_k];
int this_d = d[current_k];
bool either_called = false;
int ans_c = 0, ans_d = 0, ans_0 = 0;
if (queried[this_c] == 1)
{
if (dishes[this_c] == 0)
{
vector<int> this_dishes = dishes;
this_dishes[this_c] = 1;
ans_c = count_query(this_dishes, current_k + 1, a, b, queried, c, d);
either_called = true;
}
}
if (queried[this_d] == 1)
{
if (dishes[this_d] == 0)
{
vector<int> this_dishes = dishes;
this_dishes[this_d] = 1;
ans_d = count_query(this_dishes, current_k + 1, a, b, queried, c, d);
either_called = true;
}
}
if (!either_called)
ans_0 = count_query(dishes, current_k + 1, a, b, queried, c, d);
int retval = ans_0;
retval = max(retval, ans_c);
retval = max(retval, ans_d);
return retval;
}
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<int> b(m);
vector<int> queried(n);
for (int i = 0; i < m; i++)
{
cin >> a[i] >> b[i];
a[i]--;
b[i]--;
queried[a[i]] = 1;
queried[b[i]] = 1;
}
int k;
cin >> k;
vector<int> c(k);
vector<int> d(k);
for (int j = 0; j < k; j++)
{
cin >> c[j] >> d[j];
c[j]--;
d[j]--;
}
vector<int> dishes(n);
int ans = count_query(dishes, 0, a, b, queried, c, d);
cout << ans << "\n";
return 0;
}
MY_NAMESPACE_ | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const ul mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, m;
cin >> n >> m;
vector<ll> a(m), b(m);
rep(i, m) {
cin >> a[i] >> b[i];
a[i]--;
b[i]--;
}
ll k;
cin >> k;
vector<ll> c(k), d(k);
rep(i, k) {
cin >> c[i] >> d[i];
c[i]--;
d[i]--;
}
ll ans = 0;
rep(i, (1 << k)) {
vector<ll> table(n);
rep(j, k) {
if (i & (1 << j)) {
table[c[j]]++;
} else {
table[d[j]]++;
}
}
ll temp = 0;
rep(j, m) {
if (table[a[j]] > 0 && table[b[j]] > 0) {
temp++;
}
}
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pushb push_back
#define popb pop_back
#define min_ min_element
#define max_ max_element
#define mp make_pair
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int)(x).size()
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vli vector<long long>
#define vvi vector<vector<int>>
#define pi pair<int,int>
#define vpi vector<pair<int,int>>
#define vs vector<string>
#define mem(name,val) memset(name,val,sizeof(name))
#define precise fixed<<setprecision(9)
using namespace std;
#define fast ios::sync_with_stdio(false);cin.tie(0);
const ll int INF= 1e18;
const ll int MOD= 1000000007;
const int MX= 100005;
const long double pie= 2*acos(0.0);
vector<ll int> dp(MX,0);
// check the limits Chutiye
// read the question correctly ( ll int vs int )
int main()
{
fast
//for fast i/o for cp remember "\n" does for next line but it do not flush out the stream
int test_c=1;
//cin>>test_c;
while(test_c--)
{
int i,j;
int n;
cin>>n;
string s;
cin>>s;
if(s[0]!=s[n-1])
{
cout<<1;
continue;
}
int flag=0;
char a=s[0];
for(i=2;i<n;i++)
{
if(s[i]!=a && s[i-1]!=a)
{
flag++;
break;
}
}
if(flag)
cout<<2;
else
cout<<-1;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep( i, a, b ) for( int i = (a) ; i <= (b) ; i ++ )
#define per( i, a, b ) for( int i = (a) ; i >= (b) ; i -- )
typedef long long LL;
template<typename _T>
void read( _T &x )
{
x = 0; char s = getchar(); int f = 1;
while( s < '0' || '9' < s ) { f = 1; if( s == '-' ) f = -1; s = getchar(); }
while( '0' <= s && s <= '9' ) { x = ( x << 3 ) + ( x << 1 ) + ( s - '0' ), s = getchar(); }
x *= f;
}
template<typename _T>
void write( _T x )
{
if( x < 0 ) putchar( '-' ), x = -x;
if( 9 < x ) write( x / 10 );
putchar( x % 10 + '0' );
}
template<typename _T>
inline _T MAX( const _T a, const _T b )
{
return a > b ? a : b;
}
template<typename _T>
inline _T MIN( const _T a, const _T b )
{
return a < b ? a : b;
}
template<typename _T>
inline _T ABS( const _T a )
{
return a < 0 ? -a : a;
}
const int MAXN = 1e5 + 5;
char str[MAXN];
int N;
bool app[30];
int main()
{
read( N );
scanf( "%s", str + 1 );
if( str[1] ^ str[N] ) return puts( "1" ), 0;
bool flg = false;
rep( i, 2, N - 2 )
if( str[i] != str[1] && str[i + 1] != str[1] )
{ flg = true; break; }
puts( flg ? "2" : "-1" );
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define ALL(v) v.begin(),v.end()
#define sz(v) (ll)v.size()
const ll INF = 1e18;
const ll MOD = 998244353;
// const ll MOD = 1000000007;
ll dx[] = {1, 0, -1, 0};
ll dy[] = {0, 1, 0, -1};
const double PI = acos(-1.0);
//--------------------------------------------------
//--------------------------------------------------
struct UnionFind{
vector<int> rank, p;
UnionFind(int N){
rank.resize(N, 0);
p.resize(N, 0);
for(int i=0; i < N; i++) makeSet(i);
}
void makeSet(int x){
p[x] = x;
rank[x] = 0;
}
bool same(int x, int y){
return findSet(x) == findSet(y);
}
void unite(int x, int y){
link(findSet(x), findSet(y));
}
void link(int x, int y){
if(rank[x] > rank[y]){
p[y] = x;
}else{
p[x] = y;
if(rank[x] == rank[y]){
rank[y]++;
}
}
}
int findSet(int x){
if(x != p[x]){
p[x] = findSet(p[x]);
}
return p[x];
}
};
int main() {
ll n; cin >> n;
UnionFind uf = UnionFind(n);
for(ll i = 0; i < n; i++){
ll f; cin >> f; f--;
uf.unite(i, f);
}
set<ll> st;
for(ll i = 0; i < n; i++) st.insert(uf.findSet(i));
ll ans = 1;
for(ll i = 0; i < sz(st); i++) ans = (ans * 2) % MOD;
cout << ans-1 << endl;
return 0;
}
| #include<stdio.h>
#include<math.h>
#define ni(n) ((n) * (n))
#define rep(i,n) for(i=0;i<n;i++)
#define X(a,n) (a<=n)?a+n:a-n
#define N
int main(void){
char str[6] = "ZONe";
char s[100];
int ans = 0;
int count = 0;
scanf("%s",s);
int i;
rep(i,12){
if(s[i] == str[0]){
int j;
rep(j,4){
if(s[i+j] == str[j]) count++;
}
if(count == 4) ans++;
}
count = 0;
}
printf("%d",ans);
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <complex>
#include <cassert>
#include <set>
using namespace std;
const long long MOD = 1e9 + 7;
vector<long long> fact, fact_inv, inv;
void init_nCk(long long SIZE) {
fact.resize(SIZE + 5);
fact_inv.resize(SIZE + 5);
inv.resize(SIZE + 5);
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (long long i = 2; i < SIZE + 5; i++) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD;
}
}
long long nCk(long long n, long long k) {
assert(!(n < k));
assert(!(n < 0 || k < 0));
return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}
int main()
{
long long a, b, c;
cin >> a >> b >> c;
if (a * a + b * b < c * c) {
printf("Yes");
}else {
printf("No");
}
return 0;
}
| #include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
// #define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("")
/*By Citrus*/
char buf[1<<23],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=gc();
for (;!isdigit(c);c=gc()) f^=c=='-';
for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
return f?x:-x;
}
template <typename mitsuha>
inline bool read(mitsuha &x){
x=0;int f=1;char c=gc();
for (;!isdigit(c)&&~c;c=gc()) f^=c=='-';
if (!~c) return 0;
for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
return x=f?x:-x,1;
}
template <typename mitsuha>
inline int write(mitsuha x){
if (!x) return 0&pc(48);
if (x<0) pc('-'),x=-x;
int bit[20],i,p=0;
for (;x;x/=10) bit[++p]=x%10;
for (i=p;i;--i) pc(bit[i]+48);
return 0;
}
inline char fuhao(){
char c=gc();
for (;isspace(c);c=gc());
return c;
}
}using namespace chtholly;
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
printf("%d\n",int(1.0*b/a*c-0.01));
} |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define f first
#define s second
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)((v).size())
#define f0(a) memset(a, 0, sizeof(a))
#define ll long long
struct Point {
void read() {
cin >> x >> y >> z;
}
int dist(const Point &o) const {
return abs(x - o.x) + abs(y - o.y) + max(0, o.z - z);
}
int x = 0, y = 0, z = 0;
};
int dist[18][1<<18];
int main() {
int n;
cin >> n;
vector<Point> points(n);
for (int i = 0; i < n; ++i) {
points[i].read();
}
using state = tuple<int, int, int>;
priority_queue<state, vector<state>, greater<state>> pq;
for (int i = 0; i < n; ++i) {
fill(dist[i], dist[i] + (1 << 18), (int)1e9);
}
dist[0][1] = 0;
pq.emplace(0, 0, 1);
while (!pq.empty()) {
auto [cost, v, mask] = pq.top();
pq.pop();
if (dist[v][mask] != cost) continue;
for (int u = 0; u < n; ++u) {
int w = points[v].dist(points[u]);
int nmask = (mask | (1 << u));
if (dist[u][nmask] > dist[v][mask] + w) {
dist[u][nmask] = dist[v][mask] + w;
pq.emplace(dist[u][nmask], u, nmask);
}
}
}
int ans = dist[0][(1 << n) - 1];
for (int u = 0; u < n; ++u) {
ans = min(ans, dist[u][(1 << n) - 1] + points[u].dist(points[0]));
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loop(i, a, n) for (int i = a; i < n; i++)
#define loope(i, b, n) for (int i = b; i <= n; i++)
#define loopit(a) for (auto it = a.begin(); it != a.end(); it++)
#define ms(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define pi pair<int, int>
#define ff first
#define ss second
#define bloop(i, a, b) for (int i = a; i > b; i--)
#define bloope(i, a, b) for (int i = a; i >= b; i--)
#define PQ priority_queue<int> pq;
#define vi vector<int>
#define vii vector<vector<int>>
#define si set<int>
#define NO cout<<"NO\n";
#define YES cout<<"YES\n";
#define MPQ priority_queue<pi, vector<int>, greater<pi>> mpq;
#define io \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
// #include < ext / pb_ds / assoc_container.hpp >
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update>
// ordered_set;
ll ceil(ll a, ll b) {
return (a + b - 1) / b;
}
//graph theory
vector<vi> adj;
vi vis;
int dfs(int cur) {
int ret = 1;
vis[cur] = 1;
// cout << cur << ",";
for (const auto &v : adj[cur]) {
if (vis[v])continue;
ret += dfs(v);
}
return ret;
}
const int maxm = 2 * 1e5 + 1;
void solve()
{
int n; cin >> n;
vi a(n);
loop(i, 0, n)cin >> a[i];
adj = vector<vi>(maxm + 1);
vis = vi(maxm + 1);
int ans = 0;
loop(i, 0, n / 2) {
if (a[i] == a[n - i - 1])continue;
adj[a[i]].pb(a[n - i - 1]);
adj[a[n - i - 1]].pb(a[i]);
}
loop(i, 0, n) {
if (vis[a[i]])continue;
ans += dfs(a[i]) - 1;
// cout << "\n";
// cout << a[i] << " " << ans << "\n";
}
cout << ans << "\n";
}
int main()
{
io;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int test = 1, i = 0;
// cin >> test;
while (i++ != test)
{
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define ssort(a) sort(a.begin(), a.end())
#define INF 1001001001
#define INFll 100100100100100100
// debug用
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main(){
int x;
cin >> x;
if(x<0){
x=0;
}
cout << x << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin>>n;
vector<int> a(2*n);
rep(i, 2*n) cin>>a[i];
vector<P> b;
rep(i, 2*n) b.push_back(P(a[i], i));
sort(b.begin(), b.end());
P mid=b[n];
vector<P> st;
string ans;
auto push=[&](P p){
st.push_back(p);
ans+='(';
};
auto pop=[&](){
st.pop_back();
ans+=')';
};
rep(i, 2*n){
if(st.empty()) push(P(a[i], i));
else{
if(st.back()<mid==P(a[i], i)<mid) push(P(a[i], i));
else pop();
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i, n) for(int i = 0, i##_len=(n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())
void _cin() {} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail) { cin >> head; _cin(forward<Tail>(tail)...); }
#define cin(Type, ...) Type __VA_ARGS__; _cin(__VA_ARGS__)
#define cinv(Type, xs, n) vector<Type> xs(n); rep(i, n) cin >> xs[i]
#define cinv2(Type, xs, ys, n) vector<Type> xs(n), ys(n); rep(i, n) cin >> xs[i] >> ys[i]
#define cinv3(Type, xs, ys, zs, n) vector<Type> xs(n), ys(n), zs(n); rep(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define cinvv(Type, xs, h, w) vector<vector<Type>> xs(h, vector<Type>(w)); rep(i, h) rep(j, w) cin >> xs[i][j]
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { cout << head; if (sizeof...(tail) != 0) cout << " "; print(forward<Tail>(tail)...); }
template <class Type> void print(vector<Type> &vec) { for (auto& a : vec) { cout << a; if (&a != &vec.back()) cout << " "; } cout << endl; }
template <class Type> void print(vector<vector<Type>> &df) { for (auto& vec : df) { print(vec); } }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void yesno(bool b) { cout << (b ? "yes" : "no") << endl; }
template<class Integer>bool chmax(Integer &a, const Integer &b) { if (a < b) { a = b; return 1; } return 0; }
template<class Integer>bool chmin(Integer &a, const Integer &b) { if (b < a) { a = b; return 1; } return 0; }
using ll = long long;
void Main() {
cin(int, n,w);
print(n/w);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(16);
Main();
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i < (b);++i)
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
const int MAX_N = 1000001;
int n;
ll k;
int main(){
cin.tie(0)->sync_with_stdio(false);
cin.exceptions(cin.failbit);
cin>>n>>k;
int i = 3;
ll cur = 1;
ll sum = 1;
while(sum < k){
int ans1,ans2;
if(i<n+2){
ans1 = 0;
}else if(i>= n+2 && i<= 2*n+1){
ans1 = i-(n+1);
}else{
ans1 = 3*n-i+1;
}
if(i>2*n){
ans2 = 0;
}else if(i>= n+1 && i<= 2*n){
ans2 = 2*n-i+1;
}else{
ans2 = i-1;
}
cur = cur - ans1 + ans2;
sum +=cur;
i++;
}
ll k2 = k - (sum - cur);
int t = i;
i = 1;
sum = 0;
while(sum<k2){
if(t-i > 2*n){
cur = 0;
}else if(t-i <= 2*n && t-i>= n+1){
cur = 2*n -(t-i) +1;
}else{
cur = t - i -1;
}
sum+=cur;
i++;
}
i--;
int k3 = k2 - (sum - cur);
int j;
if((t-i) >= n+1){
j = k3 + (t-i-n)-1;
}else{
j = k3;
}
cout << i <<" "<< j <<" "<<t-(i+j)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
scanf("%d%d", &a, &b);
int c = (a - b) * 100;
double d = c * 1.0 / a;
printf("%.20lf", d);
return 0;
} | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define drep(i, l, r) for(int i=(l), i##_end_=(r); i>=i##_end_; --i)
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define Endl putchar('\n')
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<class T>inline T fab(T x){ return x<0? -x: x; }
template<class T>inline T readin(T x){
x=0; int f=0; char c;
while((c=getchar())<'0' || '9'<c) if(c=='-') f=1;
for(x=(c^48); '0'<=(c=getchar()) && c<='9'; x=(x<<1)+(x<<3)+(c^48));
return f? -x: x;
}
int a, b;
signed main(){
a=readin(1), b=readin(1);
b=a-b;
printf("%.15f\n", b*100.0/a);
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
#define r(i,a,b) for(register int i=a;i<=b;i++)
#define mem(d) memset(d,0,sizeof(d))
#define ul unsigned long long
#define IsDigit(c) ('0' <= (c) && (c) <= '9')
const int N=500000;
const ll p=1e9+7;
using namespace std;
inline ll qr()
{
int x = 0; bool f = true;char c = getchar();
for (; ! IsDigit(c); c = getchar()) if (c == '-') f = false;
for (; IsDigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
return f ? x : -x;
}
ll res,num,n,a,b,ans;
int main()
{
int T;
T=qr();
while(T--)
{
ans=0;n=qr(),a=qr(),b=qr();
if(n>=a+b)
{
res=((n-a-b+1) * (n-a-b+2) )%p;
num=(2*(n-a+1) * (n-b + 1))%p-res;
if(num<0)
num=(p-(-num) )%p;//处理负数
ans=res*num%p;
}
printf("%lld\n",ans);
}
} | #include<iostream>
using namespace std;
typedef long long li;
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
struct modint{
li num;
modint(li a=0){
num=(a%MOD+MOD)%MOD;
}
modint operator+(modint a) {return{(num+a.num)%MOD};}
modint operator-(modint a) {return{(num+MOD-a.num)%MOD};}
modint operator*(modint a) {return{num*a.num%MOD};}
modint inv(const modint& a);
modint operator/(modint a) {return (*this)*inv(a);}
modint& operator+=(modint a) {
(num += a.num)%=MOD;
return *this;
}
modint& operator-=(modint a) {
(num += MOD-a.num)%=MOD;
return *this;
}
modint& operator*=(modint a) {
(num*=a.num)%=MOD;
return *this;
}
};
std::ostream& operator<<(std::ostream& os, const modint& m){
// ここでストリームに obj を書き込みます。
li a=m.num;
cout << a;
return os;
}
std::istream& operator>>(std::istream& os,modint& m){
// ここでストリームに obj を書き込みます。
li a; cin >>a;
m=a;
return os;
}
int main(){
int q; cin >>q;
rep(_,q){
modint n,a,b; cin >>n >>a >>b;
if(a.num+b.num>n.num){
print(0); continue;
}
if(a.num>b.num){
a+=b; b=a-b; a-=b;
}
modint ans=(n-b+1)*(a+b-1)-(a-1)*a;
ans=ans*ans;
ans*=-1;
ans+=(n-a+1)*(n-b+1)*(n-a+1)*(n-b+1);
print(ans);
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n; --i)
#define pb push_back
#define mp make_pair
#define all(arr) arr.begin(),arr.end()
#define ff first
#define ss second
const double pi=3.1415926535897932384626433832795;
const int inf=1e9;
const ll inf2=1e18;
const int mod=998244353;
void boost(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const int N=2e5+5;
vi nxt(N,0),vis(N,0);
bool found=false;
void dfs(int u){
vis[u]=1;
int v=nxt[u];
if((!found) && vis[v]==0){
dfs(v);
}
else if(vis[v]==1){
found=true;
}
vis[u]=2;
}
inline ll exp(ll x, ll n, ll m = mod) {
ll r = 1;
while(n) {
if(n & 1) r = r * x % m;
x = x * x % m, n >>= 1;
}
return r;
}
void solve(){
int n;
cin>>n;
int cnt=0;
for(int i=1;i<=n;i++){
cin>>nxt[i];
}
for(int i=1;i<=n;i++){
if(!vis[i]){
found=false;
dfs(i);
if(found)
cnt++;
}
}
ll ans=exp(2,cnt);
ans=(ans-1LL +mod)%mod;
cout<<ans<<endl;
return;
}
int main()
{
boost();
int tc=1;
//cin>>tc;
while(tc--)
solve();
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
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; }
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define ins insert
#define debug(a) cerr<<(a)<<endl
#define dbrep(a,n) rep(_i,n) cerr<<(a[_i])<<" "; cerr<<endl
#define dbrep2(a,n,m) rep(_i,n){rep(_j,m) cerr<<(a[_i][_j])<<" "; cerr<<endl;}
using namespace std;
template<class A, class B>
ostream &operator<<(ostream &os, const pair<A,B> &p){return os<<"("<<p.fi<<","<<p.se<<")";}
template<class A, class B>
istream &operator>>(istream &is, pair<A,B> &p){return is>>p.fi>>p.se;}
/* Some Libraries */
//-------------------------------------------------
const int N_MAX = 2e5;
vi G[N_MAX];
bool seen[N_MAX];
void dfs(int v)
{
seen[v]=true;
for(auto u:G[v]){
if (seen[u]) continue;
dfs(u);
}
}
const ll mod = 998244353;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin>>N;
vi f(N);
rep(i,N) cin>>f[i], f[i]--;
rep(i,N){
G[i].pb(f[i]);
G[f[i]].pb(i);
}
ll ans=1;
rep(v,N){
if (!seen[v]){
dfs(v);
(ans*=2)%=mod;
}
}
ans = (ans-1+mod)%mod;
cout<<ans<<"\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b,c) for(ll i=a;i<b;i+=c)
#define r(i,a,b,c) for(ll i=a;i>=b;i-=c)
#define mod 1000000007
int main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
ll n; cin >> n;
vector<ll> ar;
ll s = sqrt(n);
// cout << s << "\n";
f(i,1,s+1,1){
if(n%i==0){
ar.push_back(i);
if(i!=(n/i)) ar.push_back(n/i);
}
}
sort(ar.begin(),ar.end());
f(i,0,ar.size(),1){
cout << ar[i] << "\n";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long n,i;
cin>>n;
set<long, less<long>> mySet;
for(i=1;i*i<=n;i++){
if(n%i == 0){
mySet.insert(i);
mySet.insert(n/i);
}
}
for(long j:mySet){
cout<<j<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vp> vvp;
const ll MOD = 1e9 + 7;
// input
ll N, M;
vi A;
void input() {
cin >> N >> M;
A = vi(N);
rep(i, N) cin >> A[i];
}
int main() {
input();
ll s = accumulate(A.begin(), A.end(), 0LL);
ll a = 1;
rep(i, s + N) a = a * (M + N - i) % MOD;
vl inv(s + N + 1), finv(s + N + 1);
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i <= s + N; i++){
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
ll b = finv[s + N];
ll ans = a * b % MOD;
cout << ans << endl;
}
| #include <stdio.h>
long long p = 1000000007;
long long n, m, s;
long long x, y, z;
long long a[2000];
long long inv[5000000];
void makeinv(void) {
long long arraynumber = sizeof inv / sizeof inv[0];
inv[1] = 1;
for (int invcount = 2; invcount < arraynumber; invcount++) {
inv[invcount] = p - inv[p % invcount] * (p / invcount) % p;
}
}
int main() {
makeinv();
scanf("%lld%lld", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
s += a[i];
}
if (m < s) {
printf("0\n");
return 0;
}
x = m + n;
y = s + n;
z = 1;
for (long long i = 0; i < y; i++) {
z *= (x - i);
z %= p;
}
for (long long i = 1; i <= y; i++) {
z *= inv[i];
z %= p;
}
printf("%lld\n", z);
} |
#include<bits/stdc++.h>
#include<stdlib.h>
using namespace std;
typedef long long int ll;
int main()
{
string s;
cin>>s;
int ans=0;
for(int i=0;i<=9999;i++){
vector<bool>flag(10,false);
int x=i;
for(int j=0;j<4;j++){
flag[x%10]=true;
x/=10;
}
bool flag1=true;
for(int j=0;j<10;j++){
if(s[j]=='o'&&!flag[j]) flag1=false;
if(s[j]=='x'&&flag[j]) flag1=false;
}
ans+=flag1;
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
//ofstream cout("output.out");
#define fast() {ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define mii map<int, int>
#define pii pair<int, int>
#define qii priority_que<int, vector<int>, greater<int>>
#define For(i, n) for(int i = 0; i < n; ++i)
#define For1(i, n) for(int i = 1; i <= n; ++i)
#define Forlr(i, l, r) for(int i = l; i <= r; ++i)
#define Forrl(i, r, l) for(int i = r; i >= l; --i)
#define o(a) { cout << #a << ":" << (a) <<" ";}
#define ov(a) {For(i, a.size()) cout << a[i] <<" ";}
#define ovv(a) {For(i, a.size()) {For(j, a[i].size()) cout << a[i][j] <<" ";cout <<"\n";}}
using ll = long long;
int n, m, k, q;
void solve(){
string s;
cin >> s;
n = s.length();
ll rs = 0;
For(i1, 10) For(i2, 10) For(i3, 10) For(i4, 10){
if(s[i1] == 'x' || s[i2] == 'x'
|| s[i3] == 'x' || s[i4] == 'x'){
continue;
}
bool check = 0;
For(i, n) if(s[i] == 'o' && i1 != i &&
i2 != i && i3 != i && i4 != i) check = 1;
rs += check == 0 ? 1 : 0;
}
cout << rs <<"\n";
}
int main ()
{
fast();
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
} |
/* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long int ull;
typedef long double ldb;
#define PB push_back
#define For(i, n) for (ll i = 0; i < n; i++)
#define PYES cout<<"YES\n"
#define PNO cout<<"NO\n"
#define PYes cout<<"Yes\n"
#define PNo cout<<"No\n"
#define sq(x) (x*x)
#define vll vector<ll>
#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<int>())
#define mnv(v) *min_element(v.begin(),v.end())
#define mxv(v) *max_element(v.begin(),v.end())
#define all(v) v.begin(),v.end()
#define Fas ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const ll M= 1e8;
//--------------------------------------------functions-------------------------------------------------//
ll power(ll a,ll b){ll result=1;while(b>0){if(b%2 == 1){result *= a;} a *= a;b /= 2;}return result;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
ll countSetBits(ll x){ll Count=0;while(x>0){if(x&1) Count++;x=x>>1;}return Count;}
bool isPerfectSquare(ll n){ll sr = sqrt(n);if (sr * sr == n)return true;else return false;}
ll mod(ll x){return ((x%M + M)%M);}
ll add(ll a, ll b){return mod(mod(a)+mod(b));}
ll mul(ll a, ll b){return mod(mod(a)*mod(b));}
ll powerM(ll a,ll b){ll res=1;while(b){if(b%2==1){res=mul(a,res);}a=mul(a,a);b/=2;}return res;}
//------------------------------------sieve of erantothenes-----------------------------------------------//
ll MAXN=100000;
vector<ll> fact(MAXN);
void sieve_of_erantothenes()
{
fact[1] = 1;
for (ll i = 2; i <= MAXN; i++)
fact[i] = i;
for (ll i = 4; i <= MAXN; i += 2)
fact[i] = 2;
for (ll i = 3; i * i <= MAXN; i++){
if (fact[i] == i){
for (ll j = i * i; j <= MAXN; j += i)
if (fact[j] == j)
fact[j] = i;
}
}
}
//----------------------------------------nCr mod------------------------------------------------------//
ll modInverse(ll n){
return powerM(n,M-2);
}
ll nCrM(ll n,ll r){
if(n<r) return 0;
if(r==0) return 1;
vector<ll> fact(n+1);
fact[0]=1;
for(ll i=1;i<=n;i++){
fact[i]=mul(fact[i-1],i);
}
return mul(mul(fact[n],modInverse(fact[r])),modInverse(fact[n-r]));
}
//-----------------------------------------------solve-----------------------------------------------------//
void solve(){
ll n;cin>>n;
for(ll i=1;i<=n;i++){
cout<<floor(log2(i))+1<<" ";
}
cout<<endl;
}
int main(){
Fas;
// ll t=0;
// cin>>t;
// while(t--)
solve();
return 0;
}
| #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __builtin_popcountll(x)
#define autoit(x,it) for(auto it = x.begin(); it != x.end(); it++)
#define autoitr(x,it) for(auto it = x.rbegin(); it != x.rend(); it++)
#define rep(n) for(ll i = 0; i < n; i++)
#define repi(i,n) for(ll i = 0; i < n; i++)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
ll icnt(vector<ll> &arr)
{
ll n = arr.size();
ordered_set os;
ll ans = 0;
for(ll i=n-1;i>-1;i--)
{
ans+=os.order_of_key(arr[i]);
os.insert(arr[i]);
}
return ans;
}
int main()
{
FAST/**/
ll n;
cin>>n;
vector<ll> arr(n);
rep(n)
cin>>arr[i], arr[i]--;
if(icnt(arr) != n-1)
{
cout<<-1;
return 0;
}
set<pii> op;
vector<ll> ins;
bool pos = 1;
for(ll i=0;i<n;i++)
{
if(arr[i]<i)
{
for(ll j=i;j>arr[j];j--)
{
if(op.find(mp(j-1,j)) != op.end())
{
pos = 0;
break;
}
op.insert(mp(j-1,j));
ins.pb(j);
swap(arr[j],arr[j-1]);
}
if(pos == 0)
break;
}
}
rep(n)
if(arr[i] != i)
pos = 0;
//cout<<op.size()<<'\n';
if(op.size() != n-1 || pos == 0)
cout<<-1<<'\n';
else
{
rep(n-1)
cout<<ins[i]<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();
template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <std::ostream& os = std::cout>
class Prints {
private:
class __Prints {
public:
__Prints(const char* sep, const char* term) : sep(sep), term(term) {}
template <class... Args>
auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) { print(args...); }
template <typename T>
auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {
for (size_t i = 0; i < sz; i++)
os << vec[i] << (i == sz - 1 ? term : sep);
}
template <typename T>
auto pmat(const T& mat, size_t h, size_t w) -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {
for (size_t i = 0; i < h; i++)
for (size_t j = 0; j < w; j++)
os << mat[i][j] << (j == w - 1 ? term : sep);
}
private:
const char *sep, *term;
void print() const { os << term; }
void print_rest() const { os << term; }
template <class T, class... Tail>
void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }
template <class T, class... Tail>
void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }
};
public:
Prints() {}
__Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};
Prints<> prints;
Prints<std::cerr> prints_err;
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
void solve() {
int H, W;
cin >> H >> W;
vector<string> grid(H);
for (ll i = 0; i < H; i++) {
cin >> grid[i];
}
int ans = 0;
for (ll i = 0; i < H - 1; i++) {
for (ll j = 0; j < W - 1; j++) {
int cntW = 0;
if (grid[i][j] == '.') ++cntW;
if (grid[i + 1][j] == '.') ++cntW;
if (grid[i][j + 1] == '.') ++cntW;
if (grid[i + 1][j + 1] == '.') ++cntW;
if (cntW == 1 || cntW == 3) ++ans;
}
}
prints()(ans);
}
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
int main() {
#ifdef FASTIO
std::cin.tie(nullptr), std::cout.tie(nullptr);
std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
std::ifstream ifs("./in_out/input.txt");
std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
std::ofstream ofs("./in_out/output.txt");
std::cout.rdbuf(ofs.rdbuf());
#endif
std::cout << std::setprecision(18) << std::fixed;
solve();
std::cout << std::flush;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> v(H,vector<char>(W));
for(int i = 0;i < H;i++){
for(int j = 0;j < W;j++)
cin >> v.at(i).at(j);
}
int ans = 0;
for(int i = 1;i< H;i++){
for(int j = 1;j < W;j++){
int ij = 0;
if(v.at(i).at(j) == '#')
ij = 1;
int hu = 0;
if(v.at(i - 1).at(j - 1) == '#')
hu = 1;
int un = 0;
if(v.at(i - 1).at(j) == '#')
un = 1;
int hn = 0;
if(v.at(i).at(j - 1) == '#')
hn = 1;
if((hu + hn + un + ij) % 2 == 1)
ans += 1;
}
}
cout << ans << endl;
} |
/* Author : Aaryan Srivastava ^__^ */
#include <bits/stdc++.h>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i,n) for(int i = 0 ; i < (n) ; i++)
#define repA(i,x,y) for(int i = (x) ; i <= (y) ; i++)
#define repD(i,x,y) for(int i = (x) ; i >= (y) ; i--)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define setval(a,val) memset(a,val,sizeof(a))
#define Randomize mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define trav(x , a) for(auto &x : a)
#define sz(a) ((int)a.size())
typedef long long ll ;
#define int ll
using namespace std;
const int N = 3e5 +5 ;
const int mod = 998244353;
const ll inf = 1e18 ;
const int SZ = 101 ;
const double eps = 1e-9 ;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ;
typedef pair<int, int> pii;
typedef pair<int , pii> ipii ;
typedef pair<pii , int> piii ;
typedef unsigned long long ull ;
typedef long double ld;
ll po(ll x,ll y,ll p = mod) {ll res=1;x%=p;while(y>0){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}
// [x][i] => (M - x)^i
int M_minus_x[5001][5001];
int M_pow[5001];
void solve()
{
int n , m ;
cin >> n >> m ;
for(int x = 1 ; x <= m ; ++x){
int mul = m - x;
int res = 1;
for(int i = 0 ; i <= n ; ++i){
M_minus_x[x][i] = res;
res = (1LL * res * mul) % mod;
}
}
ll res = 1;
for(int i = 0 ; i <= n ; ++i){
M_pow[i] = res;
res = (1LL * res * m) % mod;
}
int ans = (n * po(m , n)) % mod;
rep(d , n){
if(!d) continue;
int cnt = n - d;
ll res = (cnt * M_pow[n - 1 - d]) % mod;
repA(x , 1 , m){
int tmp = (1LL * res * M_minus_x[x][d - 1]) % mod;
ans = (ans + mod - tmp) % mod;
}
}
cout << ans;
}
int32_t main(int32_t argc, char *argv[])
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int TC = 1, t = 0;
//cin >> TC ;
while(t++ < TC)
{
//cout << "Case #" << t << ": " ;
solve();
cout << "\n" ;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define MAXN 200005
#define lowbit(x) (x&-x)
#define reg register
#define mkpr make_pair
typedef long long LL;
typedef unsigned long long uLL;
const int INF=0x3f3f3f3f;
const int mo=1e9+7;
const int iv2=5e8+4;
const int lim=1000000;
const int jzm=1e6+7;
const int orG=3,invG=332748118;
const double Pi=acos(-1.0);
typedef pair<int,int> pii;
const double PI=acos(-1.0);
template<typename _T>
_T Fabs(_T x){return x<0?-x:x;}
template<typename _T>
void read(_T &x){
_T f=1;x=0;char s=getchar();
while(s>'9'||s<'0'){if(s=='-')f=-1;s=getchar();}
while('0'<=s&&s<='9'){x=(x<<3)+(x<<1)+(s^48);s=getchar();}
x*=f;
}
template<typename _T>
void print(_T x){if(x<0){x=(~x)+1;putchar('-');}if(x>9)print(x/10);putchar(x%10+'0');}
int gcd(int x,int y){return !y?x:gcd(y,x%y);}
int add(int x,int y){return x+y<mo?x+y:x+y-mo;}
int n,a[MAXN],f[MAXN][2],ans;
signed main(){
read(n);for(int i=1;i<=n;i++)read(a[i]);int sum=0;f[0][1]=1;
for(int i=1;i<=n;i++)f[i][0]=f[i-1][1],f[i][1]=add(f[i-1][0],f[i-1][1]);
for(int i=1;i<=n;i++){
//printf("%d:%d %d\n",i,f[i][0],f[i][1]);
ans=add(1ll*a[i]*f[i-1][1]%mo*add(f[n-i][0],f[n-i][1])%mo,ans);
if(n-i>0)ans=add(1ll*(mo-a[i])*f[i-1][0]%mo*add(f[n-i-1][0],f[n-i-1][1])%mo,ans);
else ans=add(1ll*(mo-a[i])*f[i-1][0]%mo,ans);
}
printf("%d\n",ans);
return 0;
}
|
/*
Miles Morales : When will I know I'm ready?
Peter B. Parker : You won't. It's a leap of faith. That's all it is, Miles. A leap of faith.
*/
//KEEP IT SIMPLE STUPID
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define MP make_pair
#define ERR cout << "================================================\n"
#define fi first
#define se second
#define PB push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define ford(i, n) for (ll i = (ll)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define print(v) \
for (auto x : v) \
{ \
cout << x << " "; \
}
#define umin(...) min({__VA_ARGS__})
#define umax(...) max({__VA_ARGS__})
#define MAX(v) *max_element(all(v))
#define MIN(v) *min_element(all(v))
#define SP << " " <<
#define W(t) \
ll t; \
cin >> t; \
while (t--)
#define FIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define FAST \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
const ll INF = 1e18;
const ll NEG_INF = -1 * (1e18);
using namespace std;
void usaco(string prob)
{
freopen((prob + ".in").c_str(), "r", stdin);
freopen((prob + ".out").c_str(), "w", stdout);
}
/* Function to check primality in O(sqrt(n)) */
bool prime(int n)
{
if (n < 2)
return false;
for (int x = 2; x * x <= n; x++)
{
if (n % x == 0)
return false;
}
return true;
}
/* Function to get prime factorization of n */
vector<int> getFactors(int n)
{
vector<int> f;
for (int x = 2; x * x <= n; x++)
{
while (n % x == 0)
{
f.push_back(x);
n /= x;
}
}
if (n > 1)
f.push_back(n);
return f;
}
void solve()
{
string x;
cin >> x;
ll pt = 0;
reverse(all(x));
while (pt < x.length() && x[pt] != '.')
{
++pt;
}
if (pt >= x.length())
{
reverse(all(x));
cout << x << "\n";
}
else
{
string ans = "";
for (ll i = pt + 1; i < x.length(); i++)
{
ans += x[i];
}
reverse(all(ans));
cout << ans << "\n";
}
}
int main()
{
//FIO
FAST
//usaco("cowlands");
ll TC = 1;
/*
Uncomment when multiple test cases
*/
//cin >> TC;
for1(tt, TC)
{
solve();
}
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
*/
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
deque<char> d;
bool to_front = true;
for(const auto &c: s){
if(c == 'R'){
to_front = !to_front;
}else if(to_front){
d.emplace_front(c);
}else{
d.emplace_back(c);
}
}
deque<char> st;
while(!d.empty()){
if(st.empty() || st.back() != d.front()){
st.push_back(d.front());
d.pop_front();
}else{
st.pop_back();
d.pop_front();
}
}
while(!st.empty()){
if(to_front){
cout << st.back();
st.pop_back();
}else{
cout << st.front();
st.pop_front();
}
}
return 0;
} |
#define MOD_TYPE 2
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr ld PI = acos(-1.0);
constexpr ld EPS = 1e-7;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
struct io_init
{
io_init()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(30) << setiosflags(ios::fixed);
};
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
inline ll CEIL(ll a, ll b)
{
return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
is >> p.first >> p.second;
return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
os << p.first << " " << p.second;
return os;
}
#pragma endregion
// --------------------------------------
void solve()
{
ll a, b, c;
cin >> a >> b >> c;
cout << 21-a-b-c << "\n";
}
int main()
{
solve();
}
| #include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll mod=1000000007;
int main(){
int A,B,C,S=0;
cin >> A >> B >> C;
S=21-(A+B+C);
cout << S << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> pd;
void solve(){
int n;
cin>>n;
ull a[n];
for(int i=0;i<n;i++)cin>>a[i];
ull pre[n];
ull mx[n];
ull sum = a[0];
ull mxn = a[0];
pre[0] = a[0];
mx[0] = a[0];
for(int i=1;i<n;i++){
sum += a[i];
mxn = max(mxn, a[i]);
pre[i] = sum;
mx[i] = mxn;
}
ull ans[n];
ans[0] = pre[0] + mx[0];
sum = ans[0];
for(int i=1;i<n;i++){
sum -= (i)*(mx[i-1]);
ull maxcur = mx[i];
sum += pre[i-1];
sum += maxcur*(i+1);
sum += a[i];
ans[i] = sum;
}
for(int i=0;i<n;i++)cout<<ans[i]<<"\n";
}
int32_t main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
//cin.tie(NULL);
int t;
//cin>>t;
t = 1;
//cout<<"t: "<<t<<"\n";
while(t--){
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc second
#define pii pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define mii map<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repe(i,a,b) for(int i=a;i<=b;i++)
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define ppc __builtin_popcount
#define ppcll __builtin_popcountll
#define INF 100000000000000000
#define mod 1000000007
#define esp 10e-7
const int mx=200+7;
int a[mx];
map<int,set<string>>mp;
void solve()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
int cnt=min(n,9LL);
for(int i=1;i<(1<<cnt);i++)
{
int sum=0;
string s="";
for(int j=0;j<cnt;j++)
{
if((1<<j)&i)
{
sum+=a[j];
s.pb('0'+j);
}
}
sum=sum%200;
mp[sum].insert(s);
}
for(auto it:mp)
{
if(it.sc.size()>1)
{
string s=*(it.sc).begin();
string k=*(it.sc).rbegin();
cout<<"Yes"<<endl;
cout<<s.size()<<" ";
for(int i=0;i<s.size();i++)
cout<<(s[i]-'0'+1)<<" ";
cout<<endl;
cout<<k.size()<<" ";
for(int i=0;i<k.size();i++)
cout<<(k[i]-'0'+1)<<" ";
return;
}
}
cout<<"No"<<endl;
}
signed main()
{
//#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//freopen("error.txt" , "w" , stderr);
//#endif
IOS
int t=1,n;
// cin>>t;
while(t--)
{
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
string a;
random_device rnd;
cin >> N >> M;
for(int i=0; i<M; i++) {
cin >> a;
}
for(int y=0; y<N; y++) {
for(int x=0; x<N; x++){
char a = rnd()%8 + 'A';
cout << a;
}
cout << endl;
}
};
| #include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i++)
#define per(i, r, l) for(int i = (r); i >= (l); i--)
#define mem(a, b) memset(a, b, sizeof a)
#define For(i, l, r) for(int i = (l), i##e = (r); i < i##e; i++)
using namespace std;
int T; long long n;
int main() {
#ifdef local
// freopen(".in", "r", stdin);
#endif
for(cin >> T; T--;) {
scanf("%lld", &n);
if(n % 2) puts("Odd");
else if(n % 4) puts("Same");
else puts("Even");
}
return 0;
} |
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
using namespace std;
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
using lli = long long;
using vi = vc<int>;
using ii = pair<int,int>;
lli gcd(lli a, lli b){return (b?gcd(b,a%b):a);}
lli lcm(lli a, lli b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
int popcount(lli x) { return __builtin_popcountll(x); }
lli poww(lli a, lli b){
lli res = 1;
while(b){ if(b&1) res = res*a; a=a*a; b>>=1;}
return res;
}
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// int rnd(int n){return uniform_int_distribution<int>(0, n-1)(rng);}
template<class t,class u>bool mmax(t&a,u b){if(a<b)a=b;return a<b;}
template<class t,class u>bool mmin(t&a,u b){if(b<a)a=b;return b<a;}
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
// ---- しゃけ ツナマヨ ('-')7
int main(){_
auto solve=[&](){
lli a,b,c; cin>>a>>b>>c;
lli d = a*a;
lli u = b*b+c*c;
if(u<d){
cout<<2<<ENDL;
return;
}
lli l = 0, r = u/d+5;
auto f=[&](lli mid){
return mid*mid*d>=u;
};
while(l+1<r){
lli mid = (l+r)/2;
if(f(mid))r = mid;
else l = mid;
}
cout<<r<<ENDL;
};
//int t; cin>>t; while(t--)
solve();
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
long double x,y,r;
scanf("%Lf%Lf%Lf",&r,&x,&y);
long double dis=sqrt(x*x+y*y);
if (dis<r){
puts("2");
return 0;
}
printf("%d\n",(int)ceil(dis/r));
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mod 1000000007
#define rep(i,n) for(int i=0; i<n; i++)
#define repa(i,start,end) for(int i=start; i<=end; i++)
#define repd(i,start,end) for(int i=start; i>=end; i--)
#define all(x) x.begin(),x.end()
#define debug(x) cout << "(" << #x << ": " << x << ")" << endl;
void solve() {
int x;
cin >> x;
cout << 100 - (x%100) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t=1;
// cin >> t;
while (t--)
{
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
using ll = long long;
int main(){
ll n;
cin >> n;
ll rtn = sqrt(n);
set<ll> is;
ll sum = 1;//1 is include
for(ll i = 2; i*i <= n; i++){
ll cnt = 0;
ll j = i;
while(j*i <= n){
j *= i;
cnt++;
if(is.count(j)) cnt--;
else is.insert(j);
// cout << j << endl;
}
sum += cnt;
}
cout << n - sum + 1 << endl;
}
|
#include <iostream>
#include <string>
#include <complex>
#include <cstdio>
#include<functional>
#include<cmath>
#include<string>
#include<ctime>
#include<cstring>
#include<algorithm>
using namespace std;
typedef complex<double> cp;
#define ll long long
#define sci(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define scf(x) scanf("%lf",&x)
#define fo(a,b,c)for(int a=b;a<=c;a++)
#define getname(x) #x
template<typename T>
inline void printT(T *arr,int n)
{
for(int i=0;i<n;i++)
cout<<arr[i]<<' ';
cout<<endl;
}
inline void printcarr(cp *arr,int n,string d)
{
for(int i=0;i<n;i++)
{
cout<<(int)arr[i].real()<<' ';
}
cout<<d<<endl;
}
inline void printBit(int x)
{
for(int i=0;i<20;i++)
cout<<bool(x&(1<<i));
cout<<endl;
}
inline void copyarr(int *arr1,int *arr2,int n)
{
for(int i=0;i<n;i++)*(arr1+i)=*(arr2+i);
}
inline void randarr(int *arr,int n)
{
srand(time(0));
for(int i=0;i<n;i++)*(arr+i)=rand()%100;
}
inline void qsctr(char *a,int &len)
{
len=0;
char c;
while(c=getchar(),!isdigit(c));
while(isdigit(c)){a[len++]=c;c=getchar();}
a[len]='\0';
}
inline void showint(int *arr,int n)
{
for(int i=0;i<n;i++)
cout<<arr[i]<<' ';
cout<<endl;
}
inline ll read(ll mod)//快速输入（取模)
{
char ch;
ll ans=0;bool isN=false;
while(ch=getchar(),!isdigit(ch)&&ch!='-');
if(ch=='-')isN=true;
else ans=(ch^48);
while(ch=getchar(),isdigit(ch)){ans=(ans<<3)+(ans<<1)+(ch^48);ans%=mod;}
if(isN)ans*=-1;
return ans;
}
inline ll QJY(ll *a,ll n,ll x,ll mod)//秦九韶算法 快速计算多项式的和(02n)取模
{
ll ans=0;
for(int i=n;i>0;i--)
ans=(ans*x%mod+a[i-1])%mod;
return ans;
}
inline void init(ll* eular,ll maxn)//埃氏筛 不能用欧拉 欧拉不全面 而且从 j=i开始
{
for(int i=0;i<1e5+5;i++)eular[i]=i;
for(int i=2;i<1e5+5;i++)
{
if(eular[i]==i)
for(int j=i;j<=maxn;j+=i)
eular[j]=eular[j]/i*(i-1);
}
}
inline void elp(ll *jug,ll *pri,ll maxn)//欧拉筛 jug为最小质因子 maxn为数据范围
{
for(ll i=2;i<maxn;i++)
{
if(!jug[i])
{
pri[++pri[0]]=i;
jug[i]=i;
}
for(ll j=1;j<=pri[0];j++)
{
if(1LL*i*pri[j]>maxn)break;
jug[i*pri[j]]=pri[j];
if(i%pri[j]==0)break;//放后面
}
}
}
inline void dispose(ll x,ll *pri,ll *ert,ll *stp)//分解质因子 数据 质因子集合 质因子个数集合 分解后质因子集合
{
for(ll j=1;j<=pri[0]&&x>=pri[j]*pri[j];j++)
{
if(x%pri[j]==0)
{
stp[++stp[0]]=pri[j];++ert[0];
while(x%pri[j]==0){x/=pri[j];ert[ert[0]]++;}
}
}
if(x>1)
{ert[++ert[0]]++;stp[++stp[0]]=x;}
}
inline void disposefact(ll x,ll *p,ll *ans)//分解阶乘的质因子 p为x的质因子集合 ans为答案集合
{
for(int i=1;i<=p[0];i++)//阶乘分解的原理 x的幂在(1~n)自身的倍数中，出现总次数恰好等于幂次。
{
ll now=p[i];
ans[i]=0;
while(now<=x)
{
ans[i]+=x/now;
now*=p[i];
}
}
}
inline ll ext_gcd(ll a,ll b,ll &x,ll &y)
{
if(b==0)
{
x=1;y=0;
return a;
}
ll r=ext_gcd(b,a%b,y,x);//x=y' y=x'-(a/b)*y' -> y=x' x=y'
y-=(a/b)*x;
return r;
}
int n;
string s;
const int maxn=200;
int st[maxn];
bool judge(int mid)
{
for(int i=1;i<n;i++){
if(st[i]/mid==st[i+1]/mid)
return false;
}
return true;
}
int main()
{
cin>>n;
n++;
cin>>s;for(int i=1;i<=n;i++)sci(st[i]);
int l=10001;
for(int i=1;i<n;i++){
l=min(l,abs(st[i+1]-st[i]));
}
cout<<l<<endl;
for(int i=1;i<=l;i++){
for(int j=1;j<=n;j++)
cout<<(st[j]+i-1)/l<<' ';
cout<<endl;
}
}
| #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, m;
vector<int> adj[MAXN];
int c[MAXN];
int d[18][MAXN];
int dp[MAXN][20];
void djk(int src, int idx){
d[idx][src] = 0;
queue<int> q;
q.push(src);
while(!q.empty()){
int cur = q.front();
q.pop();
for(int j: adj[cur]){
if(d[idx][j] <= d[idx][cur] + 1)
continue;
d[idx][j] = d[idx][cur] + 1;
q.push(j);
}
}
}
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
memset(d, 0x7f, sizeof(d));
memset(dp, 0x7f, sizeof(dp));
cin>>n>>m;
for(int i = 0; i < m; i++){
int a, b;
cin>>a>>b;
adj[a].push_back(b);
adj[b].push_back(a);
}
int k;
cin>>k;
for(int i = 0; i < k; i++){
cin>>c[i];
djk(c[i], i);
dp[(1<<i)][i] = 1;
}
for(int i = 0; i < (1<<k); i++){
for(int j = 0; j < k; j++){
if((1<<j) & i){
for(int l = 0; l < k; l++){
if((1<<l) & i)
continue;
if(dp[i][j] < mod)
dp[i^(1<<l)][l] = min(dp[i^(1<<l)][l], dp[i][j] + d[j][c[l]]);
}
}
}
}
int ans = mod;
for(int i = 0; i < k; i++){
ans = min(ans, dp[(1<<k) - 1][i]);
}
if(ans >= mod) ans = -1;
cout<<ans<<endl;
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
} |
#include <iostream>
using namespace std;
int main() {
double x;
double y;
double z;
cin>>x;
cin>>y;
cin>>z;
double a=z/x;
double d=y/x;
int b=y*a;
double c=b/z;
int i=0;
while(i!=1){
if(c<d){
i=1;
}else{
b--;
c=b/z;
}
}
cout<<b;
} | #include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
//#include <random>
#include <map>
//#include <unordered_map>
#include <cstdlib>
#include <functional>
#include <time.h>
//#include <chrono>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream> // std::stringstream
#include <bitset> // std::bitset<N>
//#include <type_traits>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define RFOR(i,a,b) for(int i=b-1;i>=a;i--)
#define ll long long
#define INF 1000000001
#define MOD 1000000007
#define SORT(s) sort(s.begin(), s.end());
#define REVERSE(s) reverse(s.begin(), s.end());
#define SUM(s) accumulate(s.begin(), s.end(), 0LL);
#define P pair<int,int>
#define mp make_pair
#define valid(x,y,h,w) (0<=x&&x<h&&0<=y&&y<w)
//#define int ll
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
int ndx[8] = { 0,1,0,-1, 1,1,-1,-1 };
int ndy[8] = { 1,0,-1,0, 1,-1,-1,1 };
double pi = 3.141592653589793;
using namespace std;
int POW(int x, int y) { return int(pow(double(x), double(y))); }
double log(double a, double b) { return log(b) / log(a); }
ll m;
string x;
int s;
ll binary_search_f(ll n) {
ll res = 0;
ll a = 1;;
rrep(i, s) {
if (i != s - 1) a *= n;
if (a > 1000000000000000001 || res > 1000000000000000001) {
return 1000000000000000001;
}
if (x[i] - '0' == 0) {
continue;
}
if (a > 1000000000000000001 / (x[i] - '0')) {
return 1000000000000000001;
}
ll res0 = res;
res += (x[i] - '0') * a;
if (res < 0 || res - (x[i] - '0') * a != res0) {
return 1000000000000000001;
}
}
return res;
}
int main() {
int x, y, z;
cin >> x >> y >> z;
y *= z;
if (y % x == 0) {
cout << y / x - 1 << endl;
}
else {
cout << y / x << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
char s[520][520];
int r[1020],b[1020];
int main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>s[i][j];
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(s[i][j]=='R')
{
r[i+j]=1;
}
if(s[i][j]=='B')
{
b[i+j]=1;
}
}
}
int z=1;
for(int i=0;i<n+m-1;i++)
{
z=z*(2-r[i]-b[i])%998244353;
}
cout<<z;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
const int N=2e3+5;
const int M=65;
const int inf=1e9;
const int mod=998244353;;
const double eps=1e-8;
const long double pi=acos(-1.0L);
#define ls (i<<1)
#define rs (i<<1|1)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define mem(a,b) memset(a,b,sizeof(a))
LL read()
{
LL x=0,t=1;
char ch;
while((ch=getchar())<'0'||ch>'9') if(ch=='-') t=-1;
while(ch>='0'&&ch<='9'){ x=(x<<3)+(x<<1)+ch-'0'; ch=getchar(); }
return x*t;
}
char s[N][N];
vector<char> e[N<<1];
int n,m,vis[N][N];
void dfs(int x,int y,int step)
{
vis[x][y]=1;
e[step].eb(s[x][y]);
if(x<n&&!vis[x+1][y]) dfs(x+1,y,step+1);
if(y<m&&!vis[x][y+1]) dfs(x,y+1,step+1);
}
int main()
{
n=read(),m=read();
for(int i=1;i<=n;i++) scanf("%s",s[i]+1);
dfs(1,1,1);
int flag=1;
LL ans=1;
for(int i=1;i<=n+m-1;i++)
{
int t1=0,t2=0;
for(auto x:e[i])
if(x=='R') t1++;
else if(x=='B') t2++;
if(t1&&t2) flag=0;
if(!flag) break;
if(t1==0&&t2==0) ans=ans*2%mod;
}
if(!flag) printf("0\n");
else printf("%lld\n",ans);
return 0;
}
/*
4
4
0 1
0 2
2 3
2
1 0
4
0 1
0 2
2 3
2
1 0
*/
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 2e5 + 5;
const int MAXM = 4e5 + 5;
int p[MAXN][2];
bool del[MAXN];
vector<int> poss[MAXM];
int cnt[MAXM];
inline int get_pos(vector<int> &vec)
{
for(int i=0; i<(int)vec.size(); ++i)
if(!del[vec[i]]) return vec[i];
return -1;
}
int main(void)
{
int n;
scanf("%d",&n);
for(int i=1; i<=n; ++i)
scanf("%d%d",&p[i][0],&p[i][1]);
for(int i=1; i<=n; ++i)
for(int j=0; j<=1; ++j)
++cnt[p[i][j]], poss[p[i][j]].push_back(i);
queue<int> q;
for(int i=1; i<MAXM; ++i)
if(cnt[i] == 1) q.push(i);
int ans = 0;
while(q.size())
{
int u = q.front(); q.pop();
int pos = get_pos(poss[u]);
if(pos == -1) continue;
++ans; del[pos] = 1;
int v = p[pos][0] + p[pos][1] - u;
if(--cnt[v] == 1) q.push(v);
}
set<int> t;
for(int i=1; i<=n; ++i)
if(!del[i]) t.insert(p[i][0]), t.insert(p[i][1]);
printf("%d",ans + (int)t.size());
return 0;
} | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <iomanip> //setprecision
#include <map> // map
#include <unordered_map> //unordered_map
#include <queue> // queue, priority_queue
#include <set> // set,multiset
#include <stack> // stack
#include <deque> // deque
#include <math.h>//pow,,,
#include <cmath>//abs,,,
#include <bitset> // bitset
#include <numeric> //accumulate,,,
#include <sstream>
#define endl "\n";
using namespace std;
using PLL = pair<long long,long long>;
typedef tuple<int,int,int> TUP;
using P = pair<int,int>;
const long long INF = 4000000000000000001;
const int inf = 1001001001;
const long long MOD = 1000000007;
//Solve N^M. This, mod_pow use Iterative Square Method.
long long mod_pow(long long N, long long M, long long mod) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % mod, M / 2,mod);
//When end-of-a bit is 1, times simple N.
if (M & 1) res = (res * N) % mod;
return res %= mod;
}
long long gcd(long long a, long long b) {
if (b == 0) return a; else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b ;
}
long long get_mod(long long res){
if(res < 0) res += MOD;
return res % MOD;
}
int parent[514514];
int connectSize[514514];
int connectEdge[514514];
void dsu(){
for(int i = 0;i<514514;i++) parent[i] = i,connectSize[i] = 1 , connectEdge[i] = 0;
}
int searchRoot(int V){
//頂点Vの親==頂点Vということは頂点Vはその木の根である。
if(parent[V] == V){
return V;
}
else{
//一回ごとにparent[V]を更新する。辺の縮約
return parent[V] = searchRoot(parent[V]);
}
}
bool same(int X,int Y){
if(searchRoot(X) == searchRoot(Y)) return true;
else return false;
}
void unite(int X,int Y){
//X,Yの高さが高い方の木の「高さ0の根」に高さが低い方の根を付ける
int Xroot = searchRoot(X); int Yroot = searchRoot(Y);
if(connectSize[Xroot] > connectSize[Yroot]) swap(Xroot,Yroot);
//同じ根を持つ木を併合することはしなくてよい
if(Xroot == Yroot){
connectEdge[Yroot]++;
connectEdge[Xroot] = connectEdge[Yroot];
return;
}
//Xrootがサイズが小さい方にする→XrootをYroot側にくっつける
parent[Xroot] = Yroot;
connectEdge[Yroot]++;
connectSize[Yroot] += connectSize[Xroot];
connectSize[Xroot] = connectSize[Yroot];
connectEdge[Yroot] += connectEdge[Xroot];
connectEdge[Xroot] = connectEdge[Yroot];
}
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;cin >> N;
dsu();
vector<int> loopmyself(400005);
for(int i = 0;i<N;i++){
int a,b;cin >> a >> b;a--;b--;
if(a > b) swap(a,b);
unite(a,b);
}
int ans = 0;
vector<bool> already(400005);
int edgecnt = 0;
for(int i = 0;i<400005;i++){
if(searchRoot(i) != i) continue;
if(connectEdge[searchRoot(i)] >= connectSize[searchRoot(i)]){
ans += connectSize[searchRoot(i)];
}
else{
ans += connectSize[searchRoot(i)] - 1;
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
using namespace std;
ll mod=1000000000000000000;
long long modpow(long long a, long long n){
long long r = 1;
while (n) {
r = r * ( (n%2)?a:1 ) %mod;
a = a * a % mod;
n >>= 1;
}
return r;
}
int main(void){
sp(10);
ll k;cin>>k;
string s,t;cin>>s>>t;
long double res=0;
map<ll,ll> mp1,mp2,mp3;
for(ll i=1;i<=9;i++){
mp1[i]=mp2[i]=0;
}
rep(i,s.size()){
mp1[s[i]-'0']++;
mp2[t[i]-'0']++;
mp3[s[i]-'0']++;
mp3[t[i]-'0']++;
}
//手札は多くても5枚まで
for(ll a=1;a<=9;a++){
for(ll b=1;b<=9;b++){
if(mp3[a]==k||mp3[b]==k||(a==b&&mp3[a]==k-1))continue;
ll buf1=0,buf2=0;
for(auto& p:mp1){
ll buf=p.first;
ll c=p.second,d=mp2[buf];
if(buf==a)c++;
if(buf==b)d++;
buf1+=buf*modpow(10,c);
buf2+=buf*modpow(10,d);
}
//cout<<a<<" "<<b<<" ";
//cout<<buf1<<" "<<buf2<<endl;
//cout<<k-mp3[a]<<" "<<k-mp3[b]<<endl;
long double buf=9*k-8;
buf=(a==b)? ((k-mp3[a])/buf)*((k-mp3[b]-1)/(buf-1)) : ((k-mp3[a])/buf)*((k-mp3[b])/(buf-1));
//cout<<buf<<endl;
if(buf1>buf2){
res+=buf;
}
}
}
cout<<res<<endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define FordE(i, l, r) for (int i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <pii> vpii;
typedef vector <vi> vvi;
const int N = 3e5 + 5;
int n, k;
int a[N];
void readTest(){
cin >> n >> k;
ForE(i, 1, n){
cin >> a[i];
}
}
ll ans, cur;
ll cnt[N];
void resetTest(){
cur = k;
ForE(i, 1, n){
cnt[a[i]]++;
}
}
void solveTest(){
For(i, 0, n){
cur = min(cur, cnt[i]);
ans += cur;
}
cout << ans << endl;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
// freopen("B.inp", "r", stdin);
// freopen("B.out", "w", stdout);
// int q; cin >> q; while (q--){
readTest();
resetTest();
solveTest();
// }
}
/*
==================================================+
INPUT: |
--------------------------------------------------|
--------------------------------------------------|
==================================================+
OUTPUT: |
--------------------------------------------------|
--------------------------------------------------|
==================================================+
*/ |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
int main()
{
int h, w;
cin >> h >> w;
vector<char> bbb(w);
rep(i, w){
cin >> bbb[i];
}
int ans = 0;
for(int i = 0;i < h; i++){
vector<char> ccc(w);
rep(k, w){;
cin >> ccc[k];
}
for(int j = 0; j < w - 1; j++){
if(bbb[j] != bbb[j + 1] && ccc[j] == ccc[j + 1]){
ans++;
}
if(bbb[j] == bbb[j + 1] && ccc[j] != ccc[j + 1]){
ans++;
}
int a;
a = ccc[j];
bbb[j] = a;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,sum,maxn=-0x3f3f3f3f3f3f3f3f,minn=0x3f3f3f3f3f3f3f3f,n,a,t,q;
int main()
{
cin>>n;
while(n--)
{
cin>>a>>t;
if(t==1)
{
sum+=a;
maxn+=a;
minn+=a;
}
if(t==2)
{
maxn=max(a,maxn);
minn=max(minn,a);
}
if(t==3)
{
minn=min(a,minn);
maxn=min(a,maxn);
}
}
cin>>q;
while(q--)
{
cin>>x;
cout<<min(max(x+sum,maxn),minn)<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define D(a) cerr << #a << " = " << a << endl
#else
#define D(a) 8
#endif
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define dforsn(i,s,n) for(int i=int(n-1);i>=int(s);i--)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define all(a) (a).begin(),(a).end()
#define dforn(i,n) dforsn(i,0,n)
#define forn(i,n) forsn(i,0,n)
#define si(a) int((a).size())
#define pb emplace_back
#define mp make_pair
#define snd second
#define fst first
#define endl '\n'
using pii = pair<int,int>;
using vi = vector<int>;
using ll = long long;
int n, m, k, ans;
vector<pii> c, o;
vi b;
void f(int l = 0) {
if (l == k) {
int cur = 0;
for (auto [x, y] : c) if (b[x] && b[y]) cur++;
ans = max(ans, cur);
return;
}
auto [x, y] = o[l];
b[x]++, f(l + 1), b[x]--;
b[y]++, f(l + 1), b[y]--;
}
int main() {
fastio;
cin >> n >> m;
b.resize(n), c.resize(m);
for (auto &[x, y] : c) cin >> x >> y, x--, y--;
cin >> k;
o.resize(k);
for (auto &[x, y] : o) cin >> x >> y, x--, y--;
f();
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const ll mod = 998244353;
ll qp(ll a,ll b = mod - 2)
{
ll ret = 1;
while (b)
{
if (b & 1)
ret = ret * a % mod;
b >>= 1;
a = a * a % mod;
}
return ret;
}
ll js[400000 + 110];
ll ijs[400000 + 110];
ll d[400000 + 110];
void show(ll n,ll m)
{
static vector<ll> v;
if (n == 0)
{
for (ll i = 1;i < v.size();i++)
if (v[i - 1] > v[i] or v[i] % v[i - 1] != 0)
return;
static ll cnt = 0;
cout << ++cnt << " : ";
for (auto it : v)
cout << it << " ";cout << endl;
return;
}
for (ll i = 1;i <= m;i++)
{
v.push_back(i);
show(n - 1,m);
v.pop_back();
}
}
ll c(ll n,ll m)
{
if (n < m)
return 0;
ll ret = js[n] * ijs[m] % mod * ijs[n - m] % mod;
return ret;
}
map<ll,ll> tong[400000 + 110];
int main()
{
static bool vis[400000 + 110];
for (ll i = 2;i <= 400000;i++)
if (vis[i] == 0){
for (ll k = i;k <= 400000;k += i)
{
vis[k] = 1;
ll now = k;
while (now % i == 0)
tong[k][i]++,
now /= i;
}
}
js[0] = 1;
for (ll i = 1;i <= 400000;i++)
js[i] = js[i - 1] * i % mod;
ijs[400000] = qp(js[400000]);
for (ll i = 400000;i >= 1;i--)
ijs[i - 1] = ijs[i] * i % mod;
for (ll i = 1;i <= 400000;i++)
for (ll k = i;k <= 400000;k += i)
d[k]++;
ll n,m;
cin >> n >> m;
ll ret = 0;
for (ll i = 1;i <= m;i++)
{
ll t = 1;
for (auto it : tong[i])
//cout << "+ " << i << " " << it.first << " " << it.second << endl,
t *= c(n + it.second - 1,it.second),
t %= mod;
///cout << endl;
ret += t % mod;
ret %= mod;
}
cout << (ret % mod + mod) % mod;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define mp make_pair
#define mt make_tuple
#define ld long double
#define VNAME(name) (#name)
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int> > small_heap;
typedef priority_queue<int> big_heap;
typedef tuple<int, int, int> mkgroups;
void debug_out() { cout << '\n'; }
template<typename T, typename... R>
void debug_out(const T &f, const R &... r) {
cout << f << " ";
debug_out(r...);
}
template<typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template<typename Tuple, size_t N>
struct tuple_print {
static void print(const Tuple &t, std::ostream &os) {
tuple_print<Tuple, N - 1>::print(t, os);
os << ", " << std::get<N - 1>(t);
}
};
template<typename Tuple>
struct tuple_print<Tuple, 1> {
static void print(const Tuple &t, std::ostream &os) { os << "(" << std::get<0>(t); }
};
template<typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
tuple_print<decltype(t), sizeof...(Args)>::print(t, os);
return os << ")";
}
template<typename T>
ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template<typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template<typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ", ");
out << p.first << ":" << p.second;
first = 0;
}
out << "}";
return out;
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) { cerr << name << ": " << arg1 << endl; }
template<typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
const int N = 1e6 + 100;
int T;
ll mod, m, n;
ll ksm(ll a, ll b) {
ll c = 1;
for (; b; b >>= 1) {
if (b & 1) c = (ll) c * a % mod;
a = (ll) a * a % mod;
}
return c;
}
int main() {
cin >> n >> m;
mod = m * m;
ll ans = ksm(10ll, n);
cout << ans / m;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
#define lin(x) ll x; cin>>x;
#define stin(x) string x; cin>>x;
#define yn(x) if(x) { cout<<"Yes"<<endl; } else { cout<<"No"<<endl; }
#define YN(x) if(x) { cout<<"YES"<<endl; } else { cout<<"NO"<<endl; }
#define co(x) cout<<x<<endl;
using ll=long long;
using ld=long double;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll mod=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
return ((a > b) ? (a = b, true) : (false));
}
ll powmod(ll n, ll k, ll m) {
ll r=1;
for(; k>0; k >>=1) {
if(k&1) r=(r*n)%m;
n=(n*n)%m;
}
return r;
}
ll fact(ll n) {
ll a=1;
rep(i,n) {
a=a*(n-i);
}
return a;
}
ll pow(ll a, ll b) {
ll x=1;
rep(i,b) {
x=x*a;
}
return x;
}
int main() {
lin(N);
lin(M);
ll x=powmod(10,N,M*M);
ll y=(x/M)%M;
co(y);
}
|
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
using namespace std;
ll power(ll n, ll k, ll mod){
ll res = 1;
while(k > 0){
if (k & 1)
res = res * n % mod;
n = n * n % mod;
k >>= 1;
}
return res;
}
ll tf(char c){
switch (c) {
case 'R' : return 0;
case 'P' : return 1;
case 'S' : return 2;
}
}
char inv(ll a){
switch (a) {
case 0 : return 'R';
case 1 : return 'P';
case 2 : return 'S';
}
}
int main(void){
ll n, k;
cin >> n >> k;
string t;
cin >> t;
vector<ll> s(n);
for (ll i = 0; i < n; i++){
s[i] = tf(t[i]);
}
vector<vector<ll>> memo(n, vector<ll>(k+1, -1));
function<ll(ll, ll)> rec = [&](ll a, ll j){
if (memo[a][j] != -1)
return memo[a][j];
if (j == 0){
memo[a][j] = s[a];
return memo[a][j];
}
ll x = rec(a, j-1);
ll y = rec((a + power(2, j-1, n)) % n, j-1);
if ((x + 1) % 3 == y)
memo[a][j] = y;
else
memo[a][j] = x;
return memo[a][j];
};
cout << inv(rec(0, k)) << endl;
return 0;
}
| #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 rep(i,n) for(int i=0;i<(n);i++)
#define drep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr << #x << " = " << (x) << endl;
constexpr ll mod = 998244353;
struct mint {
ll x;
mint(ll x=0):x((x%mod+mod)%mod){}
friend ostream &operator<<(ostream& os,const mint& a){
return os << a.x;
}
friend istream &operator>>(istream& is,mint& a){
ll t;
is >> t;
a = mint(t);
return (is);
}
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;
}
bool operator==(const mint a)const{
return x==a.x;
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vec<int> A(N);
rep(i,N) cin >> A[i];
sort(all(A));
mint ans = 0;
mint val = 0;
vec<mint> p2(N+1,1);
rep(i,N) p2[i+1] = p2[i]*2;
for(int i=1;i<N;i++) val += p2[i-1]*A[i];
rep(i,N){
ans += (val+A[i])*A[i];
if(i+1!=N){
val -= A[i+1];
val /= 2;
}
}
cout << ans << "\n";
} |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
string at="atcoder";
void solve()
{
string s;
cin>>s;
if(at<s) return puts("0"),(void)0;
int pos=-1;
for(int i=1;i<s.length();i++)
{
if(s[i]!='a')
{
pos=i;
break;
}
}
if(pos==-1) puts("-1");
else if(s[pos]>'t') printf("%d\n",pos-1);
else printf("%d\n",pos);
}
int main()
{
int T;
scanf("%d",&T);
while(T--) solve();
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t; cin >> t;
string b = "atcoder";
while (t--) {
string s;
cin >> s;
if (s > b) cout << "0\n";
else {
vector<char> ch;
for (auto c : s)
ch.push_back(c);
sort(ch.begin(), ch.end(), greater<char>());
string a;
for (auto c : ch)
a.push_back(c);
if (a <= b) cout << "-1\n";
else {
if (s[1] == 'a') {
int ans = INT_MAX;
for (int i = 2; i < s.length(); i++) {
if (s[i] != 'a') ans = min(ans, i);
if (s[i] > 't') ans = min(ans, i - 1);
}
cout << ans << '\n';
}
else cout << "1\n";
}
}
}
return 0;
} |
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define bit(n, k) ((n >> k) & 1)
#define len(s) (int)s.size()
#define range(a) a.begin(), a.end()
#define rrange(a) a.rbegin(), a.rend()
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int find_gt(const string& s, char tgt, int pos = 0) {
int n = s.length();
for (int i = pos; i < n; i++) {
if (s[i] > tgt) return i;
}
return 1e6;
}
void solve() {
string s;
cin >> s;
int n = s.length();
if (s > "atcoder") {
cout << 0 << endl;
return;
} else if (count(s.begin(), s.end(), 'a') == n) { // 全部a
cout << -1 << endl;
return;
}
int ans = n;
const string atc = "atcoder";
rep(i, 7) {
auto tmp = s;
int can = find_gt(s, atc[i], i);
if (can >= n) continue;
swap(tmp[i], tmp[can]);
if (tmp > atc) ans = min(ans, can - i);
}
cout << ans << endl;
}
int main() {
int t;
cin >> t;
rep(i, t) solve();
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << (a) << endl
#define prld(a) cout << setprecision(15)<< (a) << endl
#define allrange(a) a.begin(),a.end()
bool solve_translated(vector<pair<int,int>> &S,vector<pair<int,int>> &T){
int N = S.size();
int dx = S[0].first-T[0].first;
int dy = S[0].second-T[0].second;
bool flg = true;
reps(i,1,N){
if(!((S[i].first==T[i].first+dx) && (S[i].second==T[i].second+dy))){flg = false; break;}
}
return flg;
}
/*ピタゴラ三角形
5 12 13
8 15 17
3 4 5
*/
vector<pair<int,int>> Pitagora_rot(vector<pair<int,int>> &S,int a, int b , int c){
int N = S.size();
vector<pair<int,int>> PS(N);
auto pt0 = S[0];
PS[0] = pt0;
bool flg = true;
reps(i,1,N){
int dx = S[i].first - pt0.first;
int dy = S[i].second - pt0.second;
int x=dx*a-dy*b;
int y=dx*b+dy*a;
if(((x%c)!=0) || ((y%c)!=0)) {flg = false; break;}
PS[i] = make_pair(x/c+pt0.first, y/c+pt0.second);
}
if(flg) return PS;
else return vector<pair<int,int>>();
}
int main(){
std::cin.tie(0); // cinとcoutの同期を解除
std::ios::sync_with_stdio(false);
int N;cin >> N;
vector<pair<int,int>> S(N),T(N);
rep(i,N)
{
int x,y;
cin >> x >> y;
S[i].first = x;S[i].second = y;
}
rep(i,N)
{
int x,y;
cin >> x >> y;
T[i].first = x;
T[i].second = y;
}
sort(allrange(T));
/*ピタゴラ三角形
5 12 13
8 15 17
3 4 5
*/
/* vector<vector<int>> tri(12);
tri[0]={0,1,1};
tri[1]={-1,0,1};
tri[2]={0,-1,1};
tri[3]={1,0,1};
tri[4]={3,4,5};
tri[5]={4,3,5};
tri[6]={-3,4,5};
tri[7]={-4,3,5};
tri[8]={-3,-4,5};
tri[9]={-4,-3,5};
tri[10]={3,-4,5};
tri[11]={4,-3,5};*/
vector<vector<int>> tri(0);
tri.push_back(vector<int>({3,4,5}));
tri.push_back(vector<int>({4,3,5}));
tri.push_back(vector<int>({-3,4,5}));
tri.push_back(vector<int>({-4,3,5}));
tri.push_back(vector<int>({0,1,1}));
tri.push_back(vector<int>({-1,0,1}));
tri.push_back(vector<int>({0,-1,1}));
tri.push_back(vector<int>({1,0,1}));
tri.push_back(vector<int>({-3,-4,5}));
tri.push_back(vector<int>({-4,-3,5}));
tri.push_back(vector<int>({3,-4,5}));
tri.push_back(vector<int>({4,-3,5}));
// tri.push_back(vector<int>({-5, -12, 13}));
// tri.push_back(vector<int>({-12, -5, 13}));
// tri.push_back(vector<int>({-8,-15,17}));
// tri.push_back(vector<int>({-15,-8,17}));
// tri.push_back(vector<int>({5, 12, 13}));
// tri.push_back(vector<int>({12, 5, 13}));
// tri.push_back(vector<int>({8,15,17}));
// tri.push_back(vector<int>({15,8,17}));
// tri.push_back(vector<int>({-5, 12, 13}));
// tri.push_back(vector<int>({-12, 5, 13}));
// tri.push_back(vector<int>({-8,15,17}));
// tri.push_back(vector<int>({-15,8,17}));
// tri.push_back(vector<int>({5, -12, 13}));
// tri.push_back(vector<int>({12, -5, 13}));
// tri.push_back(vector<int>({8,-15,17}));
// tri.push_back(vector<int>({15,-8,17}));
bool flg;
if(S.size()==2 && T.size()==2){
auto sx = S[0].first-S[1].first;
auto sy = S[0].second-S[1].second;
auto tx = T[0].first-T[1].first;
auto ty = T[0].second-T[1].second;
flg= (sx*sx+sy*sy==tx*tx+ty*ty);
} else {
rep(j,tri.size()){
auto S2 = Pitagora_rot(S,tri[j][0],tri[j][1],tri[j][2]);
if(S2.empty()) continue;
sort(allrange(S2));
flg = solve_translated(S2,T);
if(flg) break;
}
}
if(flg) prl("Yes"); else prl("No");
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
long long gcd_vec(vector<long long> const &A) { // N個の要素に対する最大公約数
int size = (int)A.size();
long long ret = A[0];
for (int i = 1; i < size; i++) {
ret = gcd(ret, A[i]);
}
return ret;
}
long long lcm2(long long a, long long b) {
long long d = gcd(a, b);
return a / d * b;
}
long long lcm(const vector<long long> &vec) {
long long l = vec[0];
for (int i = 0; i < vec.size() - 1; i++) {
l = lcm2(l, vec[i + 1]);
}
return l;
}
long long int mypow(long long int a,long long int b){
long long int i=0,ans;
for(i=0;i<b;i++)
{
if(i==0)
{
ans=a;
}
else
{
ans*=a;
}
}
return ans;
}
struct UnionFind{
int n;
vector<int> par; // 親の番号
vector<int> siz; // サイズを表している。
// 初期化する。parは自身を指す（iotaは 0 ~ nまでの数字を順に入れていく）
// size(siz) は最初はすべて１
UnionFind(int n) : n(n){
par.resize(n);
iota(par.begin(),par.end(),0);
siz.assign(n,1);
}
// 頂点の親を求める。
// 再帰関数を使っており、経路圧縮もしている。
int root(int x){
// ここは親の処理。
if (par[x] == x){
return x;
}
//経路圧縮をしながら値を返す。
// par[x] = root(par[x]);
// return par[x];
// と同じ意味。
return par[x] = root(par[x]);
}
// unite :: a と bを同じグループに入れる。
// もし初めから同じなら何もしない。
void unite(int a,int b){
int ra = root(a);
int rb = root(b);
if(ra == rb){
return;
}
// サイズの大きい方にサイズの小さいほうを合成するので、swapしている。
if (siz[ra] < siz[rb]){
swap(ra,rb);
}
// サイズが大きい方に小さいのを合体
// 小さいほうの親は大きい方の親になる。
siz[ra] += siz[rb];
par[rb] = ra;
}
// 同じグループかどうか判定するには、親が一緒かどうかをみたらよい
bool same(int x,int y){
return root(x) == root(y);
}
// 頂点が含まれるグループの頂点を求める。
int get_size(int x){
return siz[root(x)];
}
};
long long int facctorialMethod(int k){
long long int sum = 1;
for (int i = 1; i <= k; ++i)
{
sum *= i;
}
return sum;
}
#define PI 3.14159265359
int main()
{
[[maybe_unused]]long long int i=0,j=0,k,n,a[22],h[22],b=0,b1=0,saisyo=9999999999999999;
set<long long int>st;
[[maybe_unused]]double qw;
string s,s1;
cin >> n;
if(n%100==0)
{
cout << n/100;
}
else
{
cout << n/100+1;
}
} | #include<iostream>
#include<cstdio>
using namespace std;
int n;
void solve()
{
double ans = 0;
for (int i = 1; i < n; i++) {
ans += (double)n / i;
}
printf("%.10lf\n", ans);
}
int main()
{
cin >> n;
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
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 P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
const int MOD = 998244353;
const double pi = acos(-1);
ll gcd(ll a, ll b) {if(b == 0) return a; else return gcd(b,a%b);}
ll lcm(ll a, ll b) {return a*b/gcd(a,b);}
template<int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {if (val < 0) val += MOD;}
constexpr int getmod() { return MOD; }
constexpr Fp operator - () const noexcept {return val ? MOD - val : 0;}
constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
constexpr Fp& operator += (const Fp& r) noexcept {val += r.val;if (val >= MOD) val -= MOD;return *this;}
constexpr Fp& operator -= (const Fp& r) noexcept {val -= r.val;if (val < 0) val += MOD;return *this;}
constexpr Fp& operator *= (const Fp& r) noexcept {val = val * r.val % MOD;return *this;}
constexpr Fp& operator /= (const Fp& r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}val = val * u % MOD;if (val < 0) val += MOD;return *this;}
constexpr bool operator == (const Fp& r) const noexcept {return this->val == r.val;}
constexpr bool operator != (const Fp& r) const noexcept {return this->val != r.val;}
friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {return os << x.val;}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {if (n == 0) return 1;auto t = modpow(a, n / 2);t = t * t;if (n & 1) t = t * a;return t;}};
using mint = Fp<MOD>;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
int N,K; cin >> N >> K;
vector<mint> A(N);
REP(i,N) {
int a; cin >> a;
A[i] = a;
}
vector<vector<mint>> f(310,vector<mint>(N,1)),p(310,vector<mint>(N,1));
vector<mint> T(310), S(310);
for(int k = 0; k <= K; k++) {
for(int i = 0; i < N; i++) {
if(k > 0) f[k][i] = f[k-1][i] * A[i], p[k][i] = p[k-1][i] * (A[i]+A[i]);
//cout << f[k][i] << " ";
T[k] += f[k][i];
S[k] += p[k][i];
}
//cout << endl;
}
for(int k = 1; k <= K; k++) {
mint ans = 0;
for(int i = 0; i <= k; i++) {
ans += (mint)COM(k,i) * T[i] * T[k-i];
}
cout << (ans-S[k])/(mint)2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)
#define forr(i,x,n) for(int i = n;i >= x;--i)
#define Angel_Dust ios::sync_with_stdio(0);cin.tie(0)
const int N = 805;
int a[N][N],b[N][N],sum[N][N];
int n,k;
bool check(int limit)
{
forn(i,1,n) forn(j,1,n) b[i][j] = (a[i][j] <= limit);
forn(i,1,n) forn(j,1,n) sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + b[i][j];
forn(i,1,n - k + 1) forn(j,1,n - k + 1) if(sum[i + k - 1][j + k - 1] - sum[i + k - 1][j - 1] - sum[i - 1][j + k - 1] + sum[i - 1][j - 1] >= k * k - k * k / 2) return 1;
return 0;
}
int main()
{
scanf("%d%d",&n,&k);
forn(i,1,n) forn(j,1,n) scanf("%d",&a[i][j]);
int l = 0,r = 1e9;
while(l < r)
{
int mid = l + r >> 1;
if(check(mid)) r = mid;
else l = mid + 1;
}
printf("%d\n",l);
return 0;
}
|
#include <math.h>
#include <iostream>
#include <string>
#include <iomanip>
#include <algorithm>
#include <tuple>
#include <vector>
#include <cmath>
#include<set>
#include <sstream>
#include <bitset>
#include <queue>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()//配列を全部参照
using namespace std;
using ll = long long int;
using Graph = vector<vector<int>>; // グラフ型
//vector<vector<int>> hako(n, vector<int>(2));
//sort(hako.begin(), hako.end(), [](const vector<int>& alpha, const vector<int>& beta) {return alpha[0] < beta[0]; });
int main() {
cin.tie(nullptr);
ll n, m,k;
string s, t;
ll ans = 0, sum = 0;
cin >> n;
vector<int> hako(n);
rep(i, n) cin >> hako[i];
rep(i, n) {
if (hako[i] > 10) {
ans += hako[i] - 10;
}
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1.0), g = 9.80665;
ll t, tc = 0, i, j, k, n, m, cnt;
bool is;
vector<ll> divisors;
void genDivs(ll n)
{
for(i=1; i*i<=n; i++) {
if(n % i == 0) {
divisors.push_back(i);
if(i*i != n) divisors.push_back(n/i);
}
}
}
void run_cases(void)
{
tc++;
cin >> n;
genDivs(n);
cnt = 1;
for(i = 1; i < divisors.size(); i++) {
if((divisors[i]-1)%2 == 0) cnt++;
}
cout << 2*cnt;
}
int main(void)
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// cin >> t;
t = 1;
// getchar();
while(t--) {
run_cases();
}
return 0;
} |
#include<bits/stdc++.h>
#include<math.h>
#define ll long long
using namespace std;
const int maxn=2e5+5;
#define INF 1e18+5
int n,m;
ll a[maxn];
ll sum1[maxn],sum2[maxn];
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
sort(a+1,a+1+n);
for(int i=2;i<=n;i+=2)
sum1[i]=sum1[i-2]+abs(a[i]-a[i-1]);
for(int i=n-1;i>=1;i-=2)
sum2[i]=sum2[i+2]+abs(a[i+1]-a[i]);
ll ans=INF;
for(int i=1;i<=m;i++){
ll x;
scanf("%lld",&x);
int p=lower_bound(a+1,a+1+n,x)-a;
if(p%2==0)//插入偶数位置
p--;
ans=min(ans,sum1[p-1]+sum2[p+1]+abs(a[p]-x));
}
printf("%lld\n",ans);
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pi pair<int,int>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define ln(x) ((int)x.length())
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define dbg(x) cout << #x << ": " << x << endl
#define clr(x,v) memset(x, v, sizeof(x))
#define dblout(x) cout << setprecision(x) << fixed;
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
const double eps = 1e-9;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
const int MAXN = 1e6 + 5;
void cp()
{
int n, m;
cin >> n >> m;
vector<ll> arr(n), w(m);
for(ll &x : arr)
cin >> x;
for(ll &x : w)
cin >> x;
sort(all(arr));
vector<ll> odd(n), even(n);
for(int i = 0; i < n; i++)
{
if(i & 1)
odd[i] += arr[i];
else
even[i] += arr[i];
odd[i] += (i ? odd[i - 1] : 0);
even[i] += (i ? even[i - 1] : 0);
}
ll ans = LLONG_MAX;
for(int i = 0; i < m; i++)
{
int lo = 0, hi = n - 1;
int pos = -1;
while(lo <= hi)
{
int mid = (lo + hi) >> 1;
if(arr[mid] <= w[i])
pos = mid, lo = mid + 1;
else
hi = mid - 1;
}
ll o = (~pos ? odd[pos] : 0);
ll e = (~pos ? even[pos] : 0);
pos++;
if(pos < n)
o += even[n - 1] - (pos ? even[pos - 1] : 0);
if(pos < n)
e += odd[n - 1] - (pos ? odd[pos - 1] : 0);
if(pos & 1)
o += w[i];
else
e += w[i];
ans = min(ans, o - e);
}
cout << ans << endl;
}
int main()
{
FASTIO;
int t;
t = 1;
// cin >> t;
while(t--)
{
cp();
}
return 0;
} |
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
const double PI = acos(-1);
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);
}
/*-------------------------------------------*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<vector<int>> c(n, vector<int>(n));
vector<int> x;
rep(i, n) {
rep(j, n) cin >> c[i][j];
if(x.empty()) {
rep(j, n - 1) x.push_back(c[i][j + 1] - c[i][j]);
} else {
rep(j, n - 1) {
if(c[i][j + 1] - c[i][j] != x[j]) {
cout << "No\n";
return 0;
}
}
}
}
int mn = 1e9 + 1, ii, y;
rep(i, n) rep(j, n) if(chmin(mn, c[i][j])) {
ii = i;
y = j;
}
vector<int> a(n), b(n);
rep(i, n) a[i] = c[i][y] - mn;
rep(j, n) b[j] = c[ii][j];
cout << "Yes\n";
rep(i, n) cout << a[i] << " \n"[i == n - 1];
rep(i, n) cout << b[i] << " \n"[i == n - 1];
return 0;
} | /* HAVE PATIENCE YOU CAN SOLVE EVERY QUESTION
JUST THINK*/
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
//#include <unordered_set>
//#include <unordered_map>
using namespace std;
int mod = 1000000007;
const double pi = 3.141592653689793238460;
const int inf = 0x3f3f3f3f;
const int N = 2e5 + 5;
const int pr = 31;
#define ll long long
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define MEM(x) memset(x,inf,sizeof(x))
#define fi first
#define se second
#define forn(i, n) for (int i = 0; i< n; i++)
#define forl(i,l,u) for(int i=(int)l;i<=(int)u;++i)
#define all(v) (v).begin(), (v).end()
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int f(int x, int y, string a[]) {
int l;
if (a[x][y] == '+')l = 1;
else l = -1;
return l;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
string s;
cin >> s;
int ans = 0;
forn(i, 10000) {
int x = i;
vector<bool> v(10,false);
forn(i, 4) {
int m = x % 10;
v[m] = true;
x /= 10;
}
bool ok = true;
forn(i, 10) {
if (s[i] == 'o' && v[i] == false) ok = false;
if (s[i] == 'x' && v[i] == true) ok = false;
}
if (ok)ans += 1ll;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int nax=105;
int a[nax];
int32_t main()
{
int n,res=2e9;
cin>>n;
n++;
string s;
cin>>s;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<n;i++)
res=min(res,abs(a[i]-a[i+1]));
cout<<res<<'\n';
for(int i=0;i<res;i++)
{
for(int j=1;j<=n;j++)
cout<<(a[j]+i)/res<<' ';
cout<<'\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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 N;
string S;
int A[10101];
int L[101],R[101],B[101];
pair<int,int> P[101];
int ret[101][10101];
int hoge(int v) {
int i,j;
int lef[101];
if(v>=10001) return 0;
FOR(j,N+1) {
int sum=0;
FOR(i,v) {
ret[j][i]=A[j]/v+(i<A[j]%v);
sum+=ret[j][i];
}
assert(sum==A[j]);
}
FOR(i,N) {
FOR(j,v) {
if(S[i]=='<' && ret[i][j]>=ret[i+1][j]) return 0;
if(S[i]=='>' && ret[i][j]<=ret[i+1][j]) return 0;
}
}
return 1;
}
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>N>>S;
FOR(i,N+1) cin>>A[i];
int re=1;
for(i=15;i>=0;i--) if(hoge(re+(1<<i))) re+=1<<i;
assert(hoge(re));
cout<<re<<endl;
FOR(i,re) {
FOR(j,N+1) cout<<ret[j][i]<<" ";
FOR(j,N) {
if(S[j]=='<') assert(ret[j][i]<ret[j+1][i]);
if(S[j]=='>') assert(ret[j][i]>ret[j+1][i]);
}
cout<<endl;
}
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
cout.tie(0); solve(); return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define forn(i,m,n) for(int i=m;i<n;i++)
#define vv vector
#define vi vv<int>
#define ii pair<int,int>
#define vii vv<ii>
#define mp make_pair
#define pb push_back
#define PI 3.141592653589
#define ll long long
#define pll pair<ll,ll>
#define vl vv<ll>
#define ff first
#define ss second
#define MOD 1000000007
bool is_prime[1000001];
vi prime;
void sieve(int n)
{
memset(is_prime,true,sizeof(is_prime));
for(int i=2;i*i<=n;i++)
{
if(is_prime[i])
{
for(int j=i*i;j<=n;j+=i)
{
is_prime[j]=false;
}
}
}
forn(i,2,n+1)
{
if(is_prime[i])
prime.pb(i);
}
}
ll ex(ll a,ll b)
{
ll res=1;
a=a%MOD;
while(b)
{
if(b%2){res=(res*a)%MOD;b--;}
b/=2;
a=(a*a)%MOD;
}
return res;
}
ll fermat_inv(ll a){ return ex(a,MOD-2); }
ll max(ll a,ll b){ return a>b?a:b; }
ll min(ll a,ll b){ return a<b?a:b; }
int gcd(int a,int b) { return (a%b==0)?b:gcd(b,a%b); }
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
//sieve(1000000);
int te=1;
//cin>>te;
while(te--)
{
char s,t;
cin>>s>>t;
if(t>='A'&&t<='C')
cout<<t;
else
{ if(s=='Y')
cout<<(char)(t-'a'+'A');
else
cout<<t;
}
}
}
| #include <bits/stdc++.h>
#include <iostream>
#include <stack>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
cout << 2*A + 100 - B;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) for(ll i=0; i<(ll)in.size(); i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<" "
#define rep(i, n) for(ll i=0; i<(n); i++)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>
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 all(v) v.begin(), v.end()
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>
constexpr ll INF = (1ll << 60);
constexpr ll mod = 1000000007;
int main() {
string s1, s2, s3;
vll p = {0,1,2,3,4,5,6,7,8,9};
set<char> s;
map<char,int> m;
vector<char> v;
cin >> s1 >> s2 >> s3;
rep(i,s1.size()) s.insert(s1[i]);
rep(i,s2.size()) s.insert(s2[i]);
rep(i,s3.size()) s.insert(s3[i]);
for(auto a:s) v.push_back(a);
int N = v.size();
do{
if(N >= 11) break;
rep(i,N) {
m[v[i]] = p[i];
//cout << v[i] << ":" << p[i] << endl;
}
//cout << "------------------" << endl;
if(m[s1[0]] == 0||m[s2[0]] == 0||m[s3[0]] == 0) continue;
ll n1 = 0, n2 = 0, n3 = 0;
rep(i,s1.size()) {
n1 *= 10;
n1 += m[s1[i]];
}
rep(i,s2.size()) {
n2 *= 10;
n2 += m[s2[i]];
}
rep(i,s3.size()) {
n3 *= 10;
n3 += m[s3[i]];
}
if(n1 + n2 == n3) {
cout << n1 << endl;
cout << n2 << endl;
cout << n3 << endl;
return 0;
}
}while(next_permutation(all(p)));
cout << "UNSOLVABLE" << endl;
} | #include<bits/stdc++.h>
#define err() cout<<"UNSOLVABLE"<<endl,exit(0)
#define N 15
using namespace std;
int tot,a[N],A[N],B[N],C[N];
char t[N];
string s1,s2,s3;
map<char,bool> mp;
map<char,int> rpc;
int main(){
cin>>s1>>s2>>s3;
if(s3.size()<max(s1.size(),s2.size()))err();
for(int i=0;i<s1.size();i++)mp[s1[i]]=1;
for(int i=0;i<s2.size();i++)mp[s2[i]]=1;
for(int i=0;i<s3.size();i++)mp[s3[i]]=1;
if(mp.size()>10)err();
else{
for(char i='a';i<='z';i++)
if(mp[i])t[++tot]=i;
for(int i=1;i<=10;i++)a[i]=i-1;
do{
for(int i=1;i<=tot;i++)rpc[t[i]]=a[i];
for(int i=0;i<s1.size();i++)A[s1.size()-i]=rpc[s1[i]];
for(int i=0;i<s2.size();i++)B[s2.size()-i]=rpc[s2[i]];
for(int i=0;i<s3.size();i++)C[s3.size()-i]=rpc[s3[i]];
if(!A[s1.size()]||!B[s2.size()]||!C[s3.size()])continue;
for(int i=1;i<=s3.size()+1;i++)A[i]+=B[i],A[i+1]+=A[i]/10,A[i]%=10;
bool flag=0;
for(int i=1;i<=s3.size()+1;i++)if(C[i]!=A[i]){flag=1;break;}
if(!flag){
for(int i=0;i<s1.size();i++)cout<<rpc[s1[i]];cout<<endl;
for(int i=0;i<s2.size();i++)cout<<rpc[s2[i]];cout<<endl;
for(int i=0;i<s3.size();i++)cout<<rpc[s3[i]];cout<<endl;
exit(0);
}
for(int i=1;i<=s3.size()+1;i++)A[i]=B[i]=C[i]=0;
}while(next_permutation(a+1,a+1+10));
err();
}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<string>
#include<cmath>
#define SYNC ios::sync_with_stdio(0),cin.tie(0)
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define MOD 998244353
#define EPS 1e-6
#define endl '\n'
using namespace std;
const int MAXN = 214514;
int n;
int f[MAXN];
int visted[MAXN], step;
long long pw;
bool find(int x){
while(!visted[x]){
visted[x] = step;
x = f[x];
}
return visted[x] == step;
}
int ksm(long long a, long long p){
long long res = 1;
while(p){
if(p & 1)
res = res * a % MOD;
a = a * a % MOD;
p >>= 1;
}
return res % MOD;
}
void solve(){
cin >> n;
for(int i = 1; i <= n; ++i)
cin >> f[i];
for(int i = 1; i <= n; ++i){
++step;
if(!visted[i] && find(i))
++pw;
}
cout << ksm(2, pw) - 1<< endl;
}
int main(){
SYNC;
solve();
}
|
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#define LOG(FMT...) fprintf(stderr, FMT);
#define rep(i, j, k) for(int i = j; i <= k; ++ i)
#define per(i, j, k) for(int i = j; i >= k; -- i)
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
typedef double db;
typedef long long ll;
typedef long double ldb;
typedef unsigned int uint;
typedef unsigned long long ull;
mt19937 mt(std::chrono::system_clock::now().time_since_epoch().count());
uniform_int_distribution<ll> ran(0, 1ll << 62);
void ucin() { ios::sync_with_stdio(0); cin.tie(0); }
template<class T> inline void chkmax(T &x, const T &y) { if(x < y) x = y; }
template<class T> inline void chkmin(T &x, const T &y) { if(x > y) x = y; }
inline ll sqr(ll x) { return x * x; }
inline ll cub(ll x) { return x * x * x; }
const int N = 2e5 + 10;
const int mod = 998244353;
int n, out[N], f[N], sz[N];
bool cir[N];
int find(int x) {
return x == f[x] ? x : f[x] = find(f[x]);
}
int main() {
scanf("%d", &n);
rep(i, 1, n) {
scanf("%d", out + i);
}
rep(i, 1, n) {
f[i] = i; cir[i] = 0;
}
rep(i, 1, n) {
int x = find(i), y = find(out[i]);
if(x == y) cir[x] = 1;
else {
cir[x] |= cir[y];
f[y] = x;
}
}
rep(i, 1, n) sz[find(i)] ++;
int ans = 1;
rep(i, 1, n) if(find(i) == i) {
ans = 1ll * ans * (cir[i] ? 2 : sz[i] + 1) % mod;
}
ans = ans ? ans - 1 : mod - 1;
printf("%d\n", ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using db = double;
using vi = vector<int>;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define debug(x) cout << #x << ' ' << x <<endl
const int inf = 0x3f3f3f3f;
const db eps = 1e-8;
const int mod = 998244353;
ll qpow(ll a, ll b){
ll ret = 1;
while(b){
if(b&1)ret = ret*a%mod;
a = a*a%mod;
b>>=1;
}
return ret;
}
const int maxn = 3100;
int n, k;
int dp[maxn][maxn<<1];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
dp[0][0] = 1;
for(int i=1; i<=n; ++i){
for(int k=i; k>0; k--){
dp[i][k] = (dp[i-1][k-1]+dp[i][2*k])%mod;
}
}
cout << dp[n][k]%mod <<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using gg = long long;
// MAX
// constexpr gg MAX = 25;
constexpr gg MAX = 1e2 + 5;
constexpr gg mod = 1e9 + 7;
constexpr gg INF = LONG_LONG_MAX / 2;
constexpr double thre = 1e-7;
gg ti, ni, mi, ki, di, pi, xi, yi;
gg v[MAX];
gg dp[MAX][MAX][MAX];
gg dfs(gg p, gg m, gg k, gg s) {
if (k == 0) {
return m == 0 ? 0 : -INF;
}
if (p == ni) {
return -INF;
}
auto& ans = dp[p][m][k];
if (ans != LONG_LONG_MIN) {
return ans;
}
return ans = max(dfs(p + 1, m, k, s),
dfs(p + 1, (m + s - v[p] % s) % s, k - 1, s) + v[p]);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> ni >> xi;
for (gg i = 1; i <= ni; ++i) {
cin >> v[i];
}
gg ans = INF;
for (gg s = 1; s <= ni; ++s) {
for (gg i = 0; i <= ni; ++i) {
for (gg j = 0; j <= s; ++j) {
for (gg k = 0; k <= s; ++k) {
dp[i][j][k] = -INF;
}
}
}
dp[0][0][0] = 0;
for (gg i = 1; i <= ni; ++i) {
for (gg j = 0; j <= s; ++j) {
for (gg k = 0; k < s; ++k) {
dp[i][j][k] = dp[i - 1][j][k];
if (j > 0 and
dp[i - 1][j - 1][(k - v[i] % s + s) % s] != -INF) {
dp[i][j][k] = max(
dp[i][j][k],
dp[i - 1][j - 1][(k - v[i] % s + s) % s] + v[i]);
}
}
}
}
if (dp[ni][s][xi % s] != -INF)
ans = min(ans, (xi - dp[ni][s][xi % s]) / s);
}
cout << ans;
return 0;
} |
#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<string, int> psi;
typedef pair<char, int> pci;
typedef pair<int, char> pic;
const int MOD = 1e9 + 7;
const long double PI = 3.141592653589793238462643383279502884197;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll mp(ll a,ll b){ll ret=1;while(b){if(b&1)ret=ret*a%MOD;a=a*a%MOD;b>>=1;}return ret;}
// ll cmb(ll r, ll c) {return (c>r||c<0) ? 0:fac[r] * inv[c] % MOD * inv[r - c] % MOD;}
ll vec[100];
ll deg[100];
ll mat[100][100];
int cc[100][100];
ll e[100][100];
int n;
// (인접한 이웃들의 합 + 내 점수*이웃개수)/2 *p 의 확률.
// 어떤 점에서 오는 기여가,
// 내 점수 * (1 - 이웃*p)의 확률.
ll inv(ll x) {
return mp(x, MOD - 2);
}
void cal(ll a[100][100], ll b[100][100]) {
ll tmp[100][100] = {0};
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
for (int k = 0; k < n; k++)
tmp[i][j] += a[i][k] * b[k][j] % MOD;
tmp[i][j] %= MOD;
}
memcpy(a, tmp, sizeof(tmp));
}
int main() {
int m, k;
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < n; i++) scanf("%lld", &vec[i]);
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d %d", &a, &b);
a--; b--;
cc[a][b] = cc[b][a] = 1;
deg[a]++, deg[b]++;
}
ll p = inv(m);
for (int i = 0; i < n; i++) {
mat[i][i] = p * (m - deg[i]) % MOD;
mat[i][i] += deg[i] * p % MOD * inv(2) % MOD;
mat[i][i] %= MOD;
e[i][i] = 1;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (cc[i][j] == 0) continue;
mat[i][j] += inv(2) * p % MOD;
mat[i][j] %= MOD;
}
}
while (k) {
if (k & 1) cal(e, mat);
cal(mat, mat);
k >>= 1;
}
for (int i = 0; i < n; i++) {
ll sum = 0;
for (int j = 0; j < n; j++) {
sum += e[i][j] * vec[j] % MOD;
// printf("%lld ", e[i][j]);
}
printf("%lld\n", sum % MOD);
}
}
// author: rdd6584
| #include<bits/stdc++.h>
using namespace std;
template<typename T>inline bool read(T&x){
x=0;char c=getchar();int f=1;while(!isdigit(c)&&(c!='-')&&(c!=EOF))c=getchar();
if(c==EOF)return 0;if(c=='-')f=-1,c=getchar();
while(isdigit(c)){x=(x<<1)+(x<<3)+(c&15);c=getchar();}x*=f;return 1;
}template<typename T,typename...Args>inline bool read(T&x,Args&...args){bool res=1;res&=read(x);res&=read(args...);return res;}
typedef long long LL;typedef unsigned long long u64;typedef unsigned u32;typedef long double LD;
#define il inline
#define pln putchar('\n')
#define For(i,a,b) for(int i=(a),(i##i)=(b);i<=(i##i);++i)
#define Rep(i,n) for(int i=0,(i##i)=(n);i<(i##i);++i)
#define Fodn(i,a,b) for(int i=(a),(i##i)=(b);i>=(i##i);--i)
const int M=1000000007,INF=0x3f3f3f3f;const long long INFLL=0x3f3f3f3f3f3f3f3fLL;
const int N=111;
/*********************数论*********************/
inline LL mul(LL a,LL b,LL p){const LL res=a*b-((LL)((LD)a*b/p)*p);return res<0?res+p:(res<p?res:res-p);}
inline LL fp(LL a,LL b,LL Mod){LL res=(Mod!=1);for(;b;b>>=1,a=a*a%Mod)if(b&1)res=res*a%Mod;return res;}
inline LL fpl(LL a,LL b,LL Mod){LL res=(Mod!=1);for(;b;b>>=1,a=mul(a,a,Mod))if(b&1)res=mul(res,a,Mod);return res;}
template<typename T>inline T gcd(T a,T b){while(b){T t=b;b=a%b;a=t;}return a;}template<typename T>inline T lcm(T a,T b){return a/gcd(a,b)*b;}
template<typename T>inline T exgcd(T a,T b,T&x,T&y){T m=0,n=1,t;x=1,y=0;while(b){t=m,m=x-a/b*m,x=t;t=n,n=y-a/b*n,y=t;t=b,b=a%b,a=t;}return a;}
inline LL Crt(LL a1,LL a2,LL mod1,LL mod2){LL u,v;const LL g=exgcd(mod1,mod2,u,v);if((a2-a1)%g)return -1;
const LL m12=abs(lcm(mod1,mod2)),res=(mul(mod1,mul(u,((a2-a1)/g),m12),m12)+a1)%m12;return res<=0?res+m12:res;/*求最小正数解还是非负解*/}
/*********************数论*********************/
LL n,m,k,d[N];
struct Mat{
LL a[N][N];
Mat(){memset(a,0,sizeof a);}
void set(){for(int i=1;i<=n;++i)a[i][i]=1;}
Mat operator*(const Mat&b)const{
Mat res;
for(int i=1;i<=n;++i)for(int k=1;k<=n;++k)for(int j=1;j<=n;++j)res.a[i][j]=(res.a[i][j]+(a[i][k]*b.a[k][j])%M)%M;
return res;
}
Mat pow(LL b)const{
Mat a=(*this),res;
for(res.set();b;b>>=1,a=a*a)if(b&1)res=res*a;
return res;
}
};
LL a[N],mp[N][N];
LL im;
inline void init(){
read(n,m,k);im=fpl(2ll*m,M-2,M);
For(i,1,n)read(a[i]);
For(i,1,m){
int u,v;read(u,v);mp[u][v]=1;mp[v][u]=1;++d[u];++d[v];
}
For(i,1,n)mp[i][i]=mul((2ll*m-d[i]),im,M);
For(i,1,n)For(j,1,i-1){
if(mp[i][j]==0)continue;
mp[i][j]=mp[j][i]=im;
}
}
LL ans[N];
inline void solve(){
Mat f;
For(i,1,n)For(j,1,n)f.a[i][j]=mp[i][j];
f=f.pow(k);
For(i,1,n)For(j,1,n)ans[i]=(ans[i]+mul(a[j],f.a[j][i],M))%M;
For(i,1,n)ans[i]=(ans[i]+M)%M;
For(i,1,n)printf("%lld\n",ans[i]);
}
signed main(){
init();solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9)
#define LINF ll(1e18)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int n;
vector<int> to[410000];
int visited[410000];
int cnt;
bool tree;
void dfs(int v, int u=-1){
if(visited[v]!=0){
tree=0; return;
}
cnt++;
visited[v]=1;
for(auto x : to[v]){
if(x==u) continue;
dfs(x,v);
}
return;
}
int main(){
cin>>n;
rep(i,n){
int a,b; cin>>a>>b;
a--;b--;
to[a].push_back(b);
to[b].push_back(a);
}
int ans=0;
rep(i,410000){
if(visited[i]!=0) continue;
tree=1;
cnt=0;
dfs(i);
if(tree) ans+=cnt-1;
else ans+=cnt;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
const int N = 4e5+10;
int f[N],s[N];
int ff(int x){return f[x]?f[x]=ff(f[x]):x;}
int main(){
int n;
cin>>n;
int ans = 0;
for(int i = 1;i <= n;i++){
int a,b;
cin>>a>>b;
int u = ff(a), v = ff(b);
if(u!=v &&(!s[u]||!s[v]))
f[u] = v,s[v]|=s[u],ans++;
else if(!s[u])s[u]=1,ans++;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define reps(i,n) for (int i = 1; i <= (n); ++i)
#define rrep(i,n) for (int i = (n) - 1; i >= 0; --i)
#define rreps(i,n) for (int i = (n); i > 0; --i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c == 0) {
if (a <= b) cout << "Aoki" << endl;
else cout << "Takahashi" << endl;
} else {
if (a >= b) cout << "Takahashi" << endl;
else cout << "Aoki" << endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,e;
cin>>a>>b>>c;
if(c==0)
{
if(a==b) {cout<<"Aoki"<<endl;}
else if(a>b){cout<<"Takahashi"<<endl;}
else if(a<b){cout<<"Aoki"<<endl;}
}
else{
if(a==b){cout<<"Takahashi"<<endl;}
else if(a>b){cout<<"Takahashi"<<endl;}
else if(a<b){cout<<"Aoki"<<endl;}
}
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <deque>
#include <complex>
#include <bitset>
#include <functional>
#include <cassert>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using ld = long double;
using vld = vector<ld>;
using vb = vector<bool>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define dbg(x) true
#endif
template <class T> void chmin(T& a, T b) { a = min(a, b);}
template <class T> void chmax(T& a, T b) { a = max(a, b);}
template <class T> ostream& operator<<(ostream& s, const vector<T>& a) { for(auto i : a) s << i << ' '; return s; }
constexpr ll INFL = 1LL << 60;
constexpr ld EPS = 1e-12;
ld PI = acos(-1.0);
void solve() {
ll n, cp;
cin >> n >> cp;
vpll p;
rep(i, n) {
ll a, b, c;
cin >> a >> b >> c;
p.emplace_back(a, c);
p.emplace_back(b+1, -c);
}
sort(p.begin(), p.end());
vpll p2;
for(auto i : p) {
// cout << i.first << ' ' << i.second << endl;
ll sz = p2.size();
// rep(j, sz) cout << p2[j].first << ':' << p2[j].second << endl;
if(sz > 0 && p[sz-1].first == i.first) {
// cout << p[sz-1].second << endl;
p2[sz-1].second += i.second;
// cout << "a" << endl;
// cout << p[sz-1].second << endl;
}
else {
p2.push_back(i);
}
}
// cout << "end" << endl;
ll last = 0;
ll now = 0;
ll ans = 0;
for(auto i : p2) {
// cout << i.first << ' ' << i.second << endl;
ll span = i.first - last;
ans += min(now, cp) * span;
last = i.first;
now += i.second;
}
cout << ans << endl;
return;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
} | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
int main(){
int n;
cin>>n;
string s;
cin>>s;
n++;
V<ll> a(n);
for(int i=0;i<n;i++)cin>>a[i];
ll mi=inf;
for(int i=1;i<n;i++){
chmin(mi,abs(a[i-1]-a[i]));
}
V<ll> res(n);
for(int i=0;i<n;i++){
res[i]=a[i]/mi;
a[i]%=mi;
}
V<V<ll>> ans(mi,res);
int num=0;
while(*max_element(all(a))!=0){
for(int i=0;i<n;i++){
if(a[i]!=0){
ans[num][i]++;
a[i]--;
}
}
num++;
}
cout<<mi<<"\n";
for(int i=0;i<mi;i++)print(ans[i]);
} |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=1001000,maxm=0,mod=998244353;
int n;
//int a[maxn];
//vector <int> v;
//char s[maxn];
inline int read(){
int res=0;
char ch=getchar(),ch1=ch;
while(!isdigit(ch))ch1=ch,ch=getchar();
while(isdigit(ch))res=(res<<3)+(res<<1)+ch-'0',ch=getchar();
return ch1=='-'?-res:res;
}
void proc(){
int n=read();
int ans=0;
for(int i=1;i<=n;++i){
ans+=max(0,read()-10);
}
cout<<ans<<endl;
}
int main(){
int T=1;
while(T--)proc();
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define sum(v) accumulate(v.begin(), v.end(), 0)
#define $ cout<<"YES\n"
#define _$ cout<<"NO\n"
using namespace std;
int32_t main(){
int k,y,a,b,t; cin>>t;
int ans = 0;
while(t--){
cin>>a;
if (a>10)
{
ans=ans+(a-10);
}
}cout<<ans;
return 0;
}
|
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#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
int A[200200];
const int mod = 998244353;
constexpr ll modpow(ll A, ll B) {
ll kotae = 1;
while (B > 0) {
if (B & 1) kotae = kotae * A % mod;
A = A * A % mod;
B >>= 1;
}
return kotae;
}
const int CM = 1 << 17, CL = 12;
char cn[CM + CL], * ci = cn + CM + CL, * owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
ll tmp = *(ll*)ci;
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += 72 - dig >> 3;
return tmp;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N = getint();
rep1(i, N) A[i] = getint();
int kotae = 0;
rep1(i, N) {
if (A[i] < 0) continue;
int k = i;
while (A[k] > 0) {
int tmp = A[k];
A[k] = -i;
k = tmp;
}
kotae += (A[k] == -i);
}
co(modpow(2, kotae) - 1);
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (b) - 1; i >= (a); i--)
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i < (n); i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define ALL(i) (i).begin(),(i).end()
#define RALL(i) (i).begin(),(i).end(),greater<int>()
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
typedef long long ll;
#define TENNINE 1000000005
#define TENFIVE 100005
#define TENFIVE2 200005
// #define int long long
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double EPS = 1e9 + 7;
const double PI = acos(-1);
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
inline int in(){int x;std::cin>>x;return x;}
using lint = long long;
using pint = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int> >;
using vl = vector<long long>;
using vp = vector<pint>;
template <typename T> void print(T x) { std::cout << x << '\n'; }
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T*)array, (T*)(array + N), val);
}
signed main(){
string S;
string T;
cin>>S>>T;
if (S =="Y"){
// string newT ="";
if(T=="a")T="A";
if(T=="b")T="B";
if(T=="c")T="C";
}
print(T);
return 0;
} |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
vector<vector<vector<double>>> dp(
110, vector<vector<double>>(110, vector<double>(110, -1)));
double query(int x, int y, int z) {
// cout << x << " " << y << " " << z << endl;
if (x >= 100 || y >= 100 || z >= 100) {
return 0;
} else if (dp[x][y][z] >= 0) {
return dp[x][y][z];
} else {
double s = x + y + z;
dp[x][y][z] = double(x) / s * (query(x + 1, y, z) + 1) +
double(y) / s * (query(x, y + 1, z) + 1) +
double(z) / s * (query(x, y, z + 1) + 1);
return dp[x][y][z];
}
}
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << setprecision(12) << query(A, B, C) << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
#define fast
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
/* ll t;
cin >> t;
while (t--)
{*/
ll a,b,c;
cin>>a>>b>>c;
ll x,y,z;
x=a*a;
y=b*b;
z=c*c;
if(x+y<z){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
// }
return 0;
}
|
// Created by ...
#include <bits/stdc++.h>
#define vll vector< ll >
#define M 100000
#define MD 1000000007
#define pb push_back
#define sz(x) (int)(x).size()
#define rep(i,a,b) for(ll i = a; i <= b; ++i)
#define per(i,a,b) for(ll i = a; i >= b; --i)
#define pii pair<ll,ll>
#define vec(a) vector<a >
#define all(a) (a).begin(),(a).end()
#define EACH(x, a) for (auto& x:a)
#define se second
#define fi first
#define inf 0xffffffff
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
using ll = long long;
ll md=MD;
ll exp(ll a,ll b){ll r=1ll;while(b>0){if(b&1){r=r*(a%md);r=(r+md)%md;}b>>=1;a=(a%md)*(a%md);a=(a+md)%md;}return (r+md)%md;}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
template<class T> T Min(T a,T b){if(a<b)return a; return b;}
template<class T> T Max(T a,T b){if(a>b)return a; return b;}
int32_t main() {
IOS;
ll n;
cin>>n;
vll v(2*n);
rep(i,0,2*n-1) cin>>v[i];
vll o(2*n);
iota(all(o),0);
sort(all(o),[&](int i,int j){
return v[i]<v[j];
});
rep(i,0,n-1)v[o[i]]=0;
rep(i,n,2*n-1)v[o[i]]=1;
string ans;
stack<int> st;
rep(i,0,2*n-1){
if(st.empty()){
ans+='(';
st.push(v[i]);
}
else{
if(st.top()==v[i]){
st.push(v[i]);
ans+='(';
}
else{
ans+=')';
st.pop();
}
}
}
cout<<ans;
cout<<'\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
// long long mod = 998244353;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
long long modpow(long long m, long long n, long long modvalue) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2, modvalue);
return t * t % modvalue;
} else {
return modpow(m, n - 1, modvalue) * m % modvalue;
}
}
long long moddiv(long long a, long long b, ll modvalue) { return (a * modpow(b, mod - 2, modvalue)) % modvalue; }
const ll INF = 1LL << 60;
string change_binary(long long a) {
string ret;
for (int i = 31; i >= 0; i--) {
ret += (a >> i & 1) + '0';
}
return ret;
}
ll nCkmod(ll n, ll k, ll modvalue) {
ll numera = 1;
for (int i = n; i > n - k; i--) {
numera *= i;
numera %= modvalue;
}
ll denomi = 1;
REP(i, k) {
denomi *= (i + 1);
denomi %= modvalue;
}
return moddiv(numera, denomi, modvalue);
}
map<ll, ll> cnt;
void primeFactors(long long n) {
while (n % 2 == 0) {
cnt[2]++;
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
cnt[i]++;
n = n / i;
}
}
if (n > 2) {
cnt[n]++;
}
}
vector<ll> dijkstra(vector<vector<P>> graph, ll s) {
vector<ll> ans(graph.size(), -1);
priority_queue<P, vector<P>, greater<P>> pq;
pq.push({0, s});
while (pq.size() > 0) {
ll cur1 = 0;
ll cur2 = 0;
if (ans[pq.top().second] != -1) {
pq.pop();
} else {
cur1 = pq.top().first;
cur2 = pq.top().second;
pq.pop();
ans[cur2] = cur1;
for (ll i = 0; i < graph[cur2].size(); i++) {
pq.push({cur1 + graph[cur2][i].first, graph[cur2][i].second});
}
}
}
return ans;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
struct UnionFind {
vector<int> parent, size;
UnionFind(int n) {
parent.resize(n, -1);
size.resize(n, 1);
}
void unite(int x, int y) {
if (same(x, y)) {
return;
}
x = root(x);
y = root(y);
if (size[x] <= size[y]) {
swap(x, y);
}
parent[y] = x;
size[x] += size[y];
}
bool same(int x, int y) { return (root(x) == root(y)); }
int root(int x) {
while (parent[x] != -1) {
x = parent[x];
}
return x;
}
int getsize(int x) { return size[root(x)]; }
};
double dp[103][103][103];
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * d - b * c << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int str(string n) {
return (n[0] - '0') + (n[1]- '0') + (n[2]- '0');
}
int main()
{
string a,b;
cin>>a>>b;
printf("%d\n",max(str(a),str(b)));
return 0;
}
| #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <tuple>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <bitset>
#include <list>
#include<iomanip>
using namespace std;
using ll = long long;
using ULL = unsigned long long;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vl = std::vector<ll>;
using vb = std::vector<bool>;
using db = double;
using vdb = std::vector<db>;
using qlg= std::priority_queue<ll, vl, std::greater<ll> > ; //ascending
using qll= std::priority_queue<ll, vl, std::less<ll> > ; // descending
using qdg= std::priority_queue<db, vdb, std::greater<db> > ; //ascending
using qdl= std::priority_queue<db, vdb, std::less<db> > ; // descending
template<class T>
using vv = std::vector<std::vector<T> >;
#define REPL(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FORL(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define REP(i, n) FORL(i, 0, n)
#define MREP(i, n) for (ll i= (ll)(n)-1; i>=0; i-- )
#define MFOR(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(a); i--)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rreps(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bit(n) (1LL << (n))
#define INF pow(10, 10)
int main(void)
{
ll S, P, N, M, Q, a, b, c, x, y, K;
string Str;
cin >> a >> b;
ll d =0, e=0;
while(a>0)
{
d += a%10;
a/= 10;
}
while(b>0)
{
e += b%10;
b/= 10;
}
cout << max(d, e)<< endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
using namespace std;
int main() {
long long int t,n,i,j,k,l,m,max1=0,count=0;
long long int a[300001];
scanf("%lld",&n);
max1=n%100;
if(max1==0)
printf("100");
else
printf("%lld\n",100-max1);
return 0;
} | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
cout << ceil(n/100.0) ;
} |
//================code===================//
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define ci(t) cin>>t
#define co(t) cout<<t
#define LL long long
#define fa(i,a,b) for(int i=a;i<b;++i)
#define fd(i,a,b) for(int i=a;i>b;--i)
#define setp pair<pair<int,int>,int>
#define setl pair<LL,LL>
#define M_PI 3.14159265358979323846
#define micro 0.000001
#ifdef OHSOLUTION
#define ce(t) cerr<<t
#define AT cerr << "\n=================ANS=================\n"
#define AE cerr << "\n=====================================\n"
#else
#define AT
#define AE
#define ce(t)
#endif
using namespace std;
LL gcd(LL a, LL b) { return a % b ? gcd(b, a % b) : b; }
LL lcm(LL a, LL b) { return (a * b) / gcd(a, b); }
pair <int, int> vu[8] = { {0,1},{1,0},{0,-1} ,{-1,0},{-1,1}, {0,1} , {1,1},{1,-1} }; //RDLU EWSN
template<typename T, typename U>
void ckmax(T& a, U b) { a = a < b ? b : a; }
template<typename T, typename U>
void ckmin(T& a, U b) { a = a > b ? b : a; }
struct gcmp { bool operator()(LL a, LL b) { return a < b; } };
struct lcmp { bool operator()(LL a, LL b) { return a > b; } };
const int max_v = 4e5 + 7;
const int INF = 1e9 + 7;
const LL LNF = 1e18 + 7;
const LL mod = 123456789;
int p[max_v];
int np[max_v];
int vist[max_v];
bool check[max_v];
vector <int> vi;
int find(int idx,bool num=false)
{
if (num) return np[idx] < 0 ? idx : np[idx] = find(np[idx],num);
return p[idx] < 0 ? idx : p[idx] = find(p[idx],num);
}
void merge(int a, int b,bool num=false)
{
a = find(a,num);
b = find(b,num);
if (a == b) return;
if (num)
{
np[a] += np[b];
np[b] = a;
return;
}
merge(vi[a], vi[b],true);
p[a] += p[b];
p[b] = a;
}
int main()
{
#ifdef OHSOLUTION
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; ci(n);
memset(p, -1, sizeof(p));
memset(np, -1, sizeof(np));
vi.resize(n+1);
fa(i, 1, n + 1)
{
int x, y; ci(x >> y);
merge(x, y, true);
vi[i] = x;
if (vist[x]) merge(vist[x], i);
else { vist[x] = i; }
if (vist[y]) merge(vist[y], i);
else { vist[y] = i;}
}
LL ans = 0;
fa(i, 1, n + 1)
{
int x = find(i);
if (!check[x])
{
check[x] = true;
ce(p[x] * -1 << " " << np[find(vi[x])] * -1 << endl);
ans += min(p[x] * -1, np[find(vi[x],true)] *-1 );
}
}
AT;
co(ans);
AE;
return 0;
}
| #include<bits/stdc++.h>
#define maxn 100005
#define LL long long
using namespace std;
struct edge{
int nxt,to;
}e[maxn<<1];
int first[maxn],tot;
void add_edge(int x,int y){
tot++;
e[tot].nxt=first[x];
e[tot].to=y;
first[x]=tot;
}
LL sz[maxn];
LL dp[maxn];
int n;
bool pd(int x){
LL k=3*sz[x]-2;
if(k&1)return 1;else return 0;
}
void dfs(int x){
sz[x]=1;
for(int i=first[x];i!=-1;i=e[i].nxt){
int y=e[i].to;
dfs(y);
sz[x]+=sz[y];
}
}
void dfs2(int x){
dp[x]=1;
int cnt0=0,cnt1=0;
multiset<LL>s0,s1;
LL sum=0;
s0.clear(),s1.clear();
for(int i=first[x];i!=-1;i=e[i].nxt){
int y=e[i].to;
dfs2(y);
if(sz[y]&1){
cnt1++;
s1.insert(dp[y]);
}
else{
cnt0++;
s0.insert(dp[y]);
}
}
for(multiset<LL>::iterator it=s0.begin();it!=s0.end();it++){
if(*it<0)
dp[x]+=*it;
else
sum+=*it;
}
int f=0;
for(multiset<LL>::iterator it=s1.begin();it!=s1.end();it++){
f=1-f;
if(f)dp[x]+=*it;else dp[x]-=*it;
}
s0.clear(),s1.clear();
if(cnt1&1)dp[x]-=sum;else dp[x]+=sum;
}
int main(){
cin>>n;
memset(first,-1,sizeof(first));
for(int i=2;i<=n;i++){
int x;
cin>>x;
add_edge(x,i);
}
dfs(1);
dfs2(1);
cout<<(n+dp[1])/2<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin() ,(x).end()
const int N = 3e5 + 5;
const ll inf = 1e16;
int dx[] = {1 , 0 , -1 , -1 , 0 , 1};
int dy[] = {1 , 1 , 0 , -1 , -1 , 0};
void solve() {
string s;
cin >> s;
if (s > "atcoder") {
cout << "0\n";
return;
}
int n = s.size();
int pos = -1;
for (int i = 0 ; i < n ; i++) {
if (s[i] != 'a') {
pos = i;
break;
}
}
if (pos == -1)
cout << "-1\n";
else if (s[pos] > 't') cout << pos - 1 << "\n";
else cout << pos << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a,v) memset((a), v, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
const int N = (1<<16) + 5;
int n;
int dat[N];
vi players;
int main() {
scanf("%d", &n);
for (int i = 0; i < (1<<n); ++i) {
scanf("%d", &dat[i]);
players.push_back(i);
}
while (sz(players) > 2) {
vi newPlayers;
for (int i = 0; i < sz(players); i += 2) {
if (dat[players[i]] > dat[players[i+1]]) newPlayers.push_back(players[i]);
else newPlayers.push_back(players[i+1]);
}
players = newPlayers;
}
if (dat[players[0]] > dat[players[1]]) printf("%d\n", players[1]+1);
else printf("%d\n", players[0]+1);
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << (max(a,b)-min(a,b) < 3 ? "Yes" : "No") << endl;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
using namespace std;
//#define MODE 1
#ifdef MODE
#define DEB(X) cout<< #X <<": "<<X<<" ";
#define DEB2(X) cout<<X<<" ";
#define END cout<<endl;
#else
#define DEB(X) {}
#define DEB2(X) {}
#define END {}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
//typedef std::pair<int,int> P;
struct edge{int to,cost;};
const int INF=100000000000000000;
const int INF2=9223372036854775807;
const int MOD=1000000007;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define min(X,Y) (((int)(X)<(int)(Y))?(X):(Y))
#define max(X,Y) (((int)(X)>(int)(Y))?(X):(Y))
#define NP(X,Y) next_permutation(X,Y)
#define setdouble(X,Y) cout<<fixed<<setprecision(X)<<Y
int ceil2(int a,int b){if(a%b==0){return a/b;}else{return a/b+1;}}
int pow2(int a,int b){int r=1;for(int i=1;i<=b;i++){r*=a;}return r;}
int Log2(int a){int t=0;while(1){if(a==0||a==1){break;}a/=2;t++;}return t;}
int A,B;
signed main(){
cin>>A>>B;
if(A>B){
if(A<B+3){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
else{
if(A+3>B){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.