code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include <bits/stdc++.h>
#define fi first
#define se second
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define V vector
#define TP template <class o>
#define TPP template <typename t1, typename t2>
#define SZ(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define REP(i, a, b) for (int i = b; i >= a; i--)
#define FOR(i, n) rep(i, 1, n)
#define debug(x) cerr << #x << ' ' << '=' << ' ' << x << endl
using namespace std;
typedef double db;
typedef unsigned ui;
typedef long long ll;
typedef long double ld;
// char buf[1 << 20],*p1=buf,*p2=buf;
TP void qr(o& x) {
char c = gc;
x = 0;
int f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = gc;
}
while (isdigit(c))
x = x * 10 + c - '0', c = gc;
x *= f;
}
template <class o, class... O> void qr(o& x, O&... y) { qr(x), qr(y...); }
TP void qw(o x) {
if (x < 0)
putchar('-'), x = -x;
if (x / 10)
qw(x / 10);
putchar(x % 10 + '0');
}
TP void pr1(o x) { qw(x), putchar(' '); }
template <class o, class... O> void pr1(o x, O... y) { pr1(x), pr1(y...); }
TP void pr2(o x) { qw(x), putchar(10); }
template <class o, class... O> void pr2(o x, O... y) { pr2(x), pr2(y...); }
TP bool cmax(o& x, o y) { return (x < y ? x = y, 1 : 0); }
TP bool cmin(o& x, o y) { return (x > y ? x = y, 1 : 0); }
const int mod = (int)1e9 + 7;
TPP void ad(t1& x, t2 y) { (x += y) >= mod && (x -= mod); }
TPP void dl(t1& x, t2 y) { (x -= y) < 0 && (x += mod); }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll power(ll a, ll b = mod - 2, ll p = mod) {
ll c = 1;
while (b) {
if (b & 1)
c = c * a % p;
b /= 2;
a = a * a % p;
}
return c;
}
ll exgcd(ll a, ll b, ll& x, ll& y) {
if (!a) {
x = 0;
y = 1;
return b;
}
ll d = exgcd(b % a, a, y, x);
x -= b / a * y;
return d;
}
ll INV(ll n, ll p = mod) {
ll x, y;
exgcd(n, p, x, y);
return (x % p + p) % p;
}
const int N = 110;
const ll INF = 1e15;
int n, m, k, val[N];
struct rec {
int a[N][N];
rec() { memset(a, 0, sizeof a); }
rec operator*(rec b) const {
rec c;
FOR(i, n) FOR(j, n) FOR(k, n) ad(c.a[i][k], 1ll * a[i][j] * b.a[j][k] % mod);
return c;
}
} a, c;
void solve() {
qr(n, m, k);
FOR(i, n) a.a[i][i] = c.a[i][i] = 1, qr(val[i]);
ll inv = power(2 * m);
while (m--) {
int x, y;
qr(x, y);
dl(a.a[x][x], inv);
ad(a.a[x][y], inv);
dl(a.a[y][y], inv);
ad(a.a[y][x], inv);
}
while (k) {
if (k & 1)
c = c * a;
k /= 2;
a = a * a;
}
FOR(i, n) {
ll ans = 0;
FOR(j, n) ad(ans, 1ll * c.a[j][i] * val[j] % mod);
pr2(ans);
}
}
int main() {
#ifndef ONLINE_JUDGE
clock_t start_time = clock();
#endif
int T = 1;
// qr(T);
while (T--)
solve();
#ifndef ONLINE_JUDGE
cerr << 1.0 * (clock() - start_time) / CLOCKS_PER_SEC << ' ' << 's' << endl;
#endif
return 0;
}
| #include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <unordered_map>
#include <memory.h>
#include <unordered_set>
#include <fstream>
#include <random>
using namespace std;
const long long int MOD = 1e9 + 7;
vector <vector<long long int>> mul(vector <vector<long long int>> a, vector<vector<long long int>> b)
{
int n = a.size();
int m = a[0].size();
int k = b[0].size();
vector <vector<long long int>>c(n, vector<long long int>(k, 0));
for (int i = 0; i < n; i++)
{
for (int j = 0; j < k; j++)
{
for (int k = 0; k < m; k++)
{
c[i][j] += ((a[i][k] % MOD) * (b[k][j] % MOD) % MOD);
c[i][j] %= MOD;
}
}
}
return c;
}
long long int mypow(long long int x, long long int n)
{
long long int res = 1;
while (n > 0)
{
if (n % 2 == 1)
{
res = ((res % MOD) * (x % MOD) % MOD);
res %= MOD;
}
x = ((x % MOD) * (x % MOD) % MOD);
x %= MOD;
n /= 2;
}
return res;
}
int A[101];
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, K;
cin >> N >> M >> K;
vector <vector<long long int>> a(N, vector<long long int>(N, 0));
vector <vector<long long int>> b(N, vector<long long int>(N, 0));
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
long long int val = mypow(2, MOD - 2);
long long int val2 = mypow(M, MOD - 2);
for (int i = 0; i < M; i++)
{
int X, Y;
cin >> X >> Y;
X -= 1;
Y -= 1;
vector <vector<long long int>> c(N, vector<long long int>(N, 0));
for (int j = 0; j < N; j++)
{
c[j][j] = val2;
}
long long int temp = val;
temp = ((temp % MOD) * (val2 % MOD) % MOD);
temp %= MOD;
c[X][X] = temp;
c[X][Y] = temp;
c[Y][X] = temp;
c[Y][Y] = temp;
for (int j = 0; j < N; j++)
{
for (int k = 0; k < N; k++)
{
a[j][k] = ((a[j][k] % MOD) + (c[j][k] % MOD) % MOD);
a[j][k] %= MOD;
}
}
}
for (int i = 0; i < N; i++)
{
b[i][i] = 1;
}
while (K > 0)
{
if (K % 2 == 1)
{
b = mul(a, b);
}
a = mul(a, a);
K /= 2;
}
for (int i = 0; i < N; i++)
{
long long int val = 0;
for (int j = 0; j < N; j++)
{
long long int temp = ((b[i][j] % MOD) * (A[j] % MOD) % MOD);
temp %= MOD;
val = ((val % MOD) + (temp % MOD) % MOD);
val %= MOD;
}
cout << val << '\n';
}
return 0;
}
|
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
void test_case(){
int n,k;
cin>>n>>k;
k=abs(k);
int a=2+k,b=2;
ll ans=0;
while(a<=2*n){
int A=min(n,a-1), B=a-A;
int C=min(n,b-1), D=b-C;
int cnt_a=1+(min(A-1, n-B));
int cnt_b=1+min(C-1, n-D);
ans+=((ll)cnt_a*cnt_b);
a++;b++;
}
cout<<ans<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
// cin>>t;
while(t--){
test_case();
}
return 0;
} | #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
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;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
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...);
}
typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
};
} fast_ios_;
int64 solve(int X, int n) {
int ll = 1, rr = min(n, X - 1);
ll = max(ll, X - min(X - ll, n));
return max(0, rr - ll + 1);
}
int main() {
int n, m;
cin >> n >> m;
int64 ret = 0;
for (int X = 2; X <= 2 * n; ++X) {
int Y = m + X;
ret += solve(X, n) * solve(Y, n);
}
cout << ret << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define asll unsigned long long
#define ULL unsigned long long
#define ll long long
#define LL long long
#define ld long double
#define imt long long
#define pii pair<long long,long long>
#define x first
#define fi first
#define y second
#define se second
#define psbk(x) push_back(x);
#define pb push_back
#define For(x,a,b) if(a!=b){icdc=(b-a)/abs(b-a))}else{icdc=1};for(long long x=(a);x!=(b+icdc);x+=icdc)
#define forp(x,a,b) if(b-a!=0){icdc=(b-a)/abs(b-a))}else{icdc=1};for(long long x=(a);x!=(b);x+=icdc)
#define FOR(x,n) for(long long x=0;x<(n);x++)
#define m_p make_pair
long long icdc;
#define kj <<" "<<
#define kjb <<" ";
#define dg <<","<<
#define ml <<'\n';
#define co cout<<
#define ter cout<<endl;
#define sibi cout<<"TES"<<endl;
#define tes(x) cout<<"TES"<<x<<endl;
#define kpr(a) cout<<"("<<a.x dg a.y <<")" ml
#define vvi vector< vector<long long> >
ULL M=1e9+7;
LL b,m,k,tc;
LL p,q,r,t;
LL a[100005];
string s;
vvi aku={{1,0,0},{0,1,0},{0,0,1}};
vvi op1=
{{0,1,0},
{-1,0,0},
{0,0,1}};
vvi op2={
{0,-1,0},
{1,0,0},
{0,0,1}};
vvi op3={
{-1,0,0},
{0,1,0},
{0,0,1}};
vvi op4={
{1,0,0},
{0,-1,0},
{0,0,1}};
vvi pm[200005];//prefix matrix
vvi hsl;
void show(vvi x,string s){
co "Show" kj s ml
FOR(i,x.size()){
FOR(j,x[i].size()){
co x[i][j] kjb
}
ter
}
}
vvi kali(vvi a,vvi b){
//sibi
long long r1,c1,r2,c2;
vvi ret;
vector<long long> ret2;
LL ret3;
//show(a,"A dalem fungsi");
//show(b,"B dalem fungsi");
r1=a.size();
c1=a[0].size();
r2=b.size();
c2=b[0].size();
//co "rc" kj r1 kj c1 kj r2 kj c2 ml
//tes(0);
if(r2!=c1){
cout<<"ERROR"<<endl;
return ret;
}
//tes(1)
for(long long i=0;i<r1;i++){
//co "i=" kj i ml
//tes(2)
ret2.clear();
for(long long j=0;j<c2;j++){//ngebug ternyata tadi i++
//co "j=" kj j ml
//tes(3)
ret3=0;
for(long long k=0;k<r2;k++){
///co "k=" kj k ml
//tes(4);
ret3+=a[i][k]*b[k][j];
}
ret2.pb(ret3);
}
ret.pb(ret2);
}
/*
FOR(i,ret.size()){
FOR(j,ret[i].size()){
co ret[i][j] kjb
}ter
}
*/
return ret;
}
pii titik[200005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//srand(time(0));
cin>>b;
FOR(i,b){
cin>>titik[i].x>>titik[i].y;
}
//sibi
cin>>m;
//sibi
FOR(i,m){
//sibi
//co i ml
cin>>p;
//sibi
//co "p=" kj p ml
///sibi
if(p<=2){
//co "masukif" ml
//sibi
if(p==1){
//sibi
aku=kali(op1,aku);
}
else{
aku=kali(op2,aku);
}
}
else{
//co "masukelse" ml
cin>>q;
//co "q=" kj q ml
if(p==3){
op3[0][2]=2*q;
aku=kali(op3,aku);
op3[0][2]=0;
}
else{
op4[1][2]=2*q;
aku=kali(op4,aku);
}
}
//sibi
pm[i]=aku;
//co "pm[i]" ml
//show(pm[i],"pm[i]");
}
cin>>k;
//co "ka=" kj k ml
FOR(i,k){
cin>>p>>q;
p--;
q--;
if(p<0){
//co "HASIL" kjb
co titik[q].x kj titik[q].y ml
continue;
}
hsl={{titik[q].x},{titik[q].y},{1}};
//co "tepat setelah operasi ke" kj p kj "pada titik ke " kj q kj "yaitu" kjb; kpr(titik[q]);
hsl=kali(pm[p],hsl);
//co "HASIL" kjb
cout<<hsl[0][0] kj hsl[1][0] ml
}
/*
operasi nomer 1 :
0 1
-1 0
operasi nomer 2 :
0 -1
1 0
operasi nomer 3 : cermin sumbu x=p
x' = 2p-x
y' = y
operasi nomer 4 :
*/
}
/*
*/
| #include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <random>
#include <stack>
#include <set>
#include <list>
#include <unordered_set>
#define bug(x) cout<<"zdongdebug1: "<<x<<endl;
#define bug2(x, y) cout<<"zdongdebug2: "<<x<<" "<<y<<endl;
#define bug3(x, y, z) cout<<"zdongdebug3: "<<x<<" "<<y<<" "<<z<<endl;
using namespace std;
typedef long long ll;
void ex_gcd(ll a,ll b, ll& d,ll& x,ll& y){
if(!b) {d=a;x=1;y=0;}
else { ex_gcd(b,a%b,d,y,x); y-=a/b*x;}
}
ll inv(ll a,ll n) {
ll d,x,y; ex_gcd(a,n,d,x,y);
return d==1?(x%n+n)%(n/d):-1;
}
ll gcd(ll x, ll y){
if(y==0)return x;
return gcd(y, x%y);
}
const int maxn = 200005;
const int mod = 998244353;
ll x[maxn], y[maxn];
ll a1[maxn], b1[maxn], a2[maxn], b2[maxn];
bool c1[maxn], c2[maxn];
int main() {
#ifdef suiyuan2009
freopen("/Users/suiyuan2009/CLionProjects/icpc/input.txt", "r", stdin);
//freopen("/Users/suiyuan2009/CLionProjects/icpc/output.txt", "w", stdout);
#endif
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>x[i]>>y[i];
}
int m;
cin>>m;
a1[0] = 1, b1[0] = 0, a2[0] = 1, b2[0] = 0;
c1[0] = 0, c2[0] = 1;
for(int i=1;i<=m;i++){
string s;
cin>>s;
a1[i] = a1[i-1],b1[i] = b1[i-1], a2[i] = a2[i-1], b2[i] = b2[i-1];
c1[i] = c1[i-1],c2[i] = c2[i-1];
if(s[0]=='3'){
ll tt;
cin>>tt;
a1[i] = -a1[i-1];
b1[i] = 2*tt - b1[i-1];
} else if(s[0]=='4'){
ll tt;
cin>>tt;
a2[i] = -a2[i-1];
b2[i] = 2*tt - b2[i-1];
} else if(s[0]=='1'){
swap(c1[i], c2[i]);
swap(a1[i], a2[i]);
swap(b1[i], b2[i]);
a2[i] = -a2[i];
b2[i] = -b2[i];
} else {
swap(c1[i], c2[i]);
swap(a1[i], a2[i]);
swap(b1[i], b2[i]);
a1[i] = -a1[i];
b1[i] = -b1[i];
}
}
int Q;
cin>>Q;
while(Q--){
int a,b;
cin>>a>>b;
ll tx=x[b], ty = y[b];
if(c1[a]){
swap(tx,ty);
}
ll rx = tx * a1[a] + b1[a];
ll ry = ty * a2[a] + b2[a];
cout<<rx<<" "<<ry<<endl;
}
return 0;
} |
/*
written by Pankaj Kumar.
country:-INDIA
*/
#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;
typedef long long ll ;
typedef vector<ll> vl;
#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
/* Abbrevations */
#define ff first
#define ss second
#define mp make_pair
#define line cout<<endl;
#define pb push_back
#define Endl "\n"
// loops
#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
// Some print
#define no cout<<"NO"<<endl;
#define yes cout<<"YES"<<endl;
// sort
#define all(V) (V).begin(),(V).end()
#define srt(V) sort(all(V))
#define srtGreat(V) sort(all(V),greater<ll>())
// some extra
#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} line;
#define sz(V) ll(V.size())
// template
template <typename T>
T mymax(T x,T y)
{
return (x>y)?x:y;
}
// function
ll power(ll x,ll y,ll mod)
{
ll res=1;
// x=x%mod;
while(y>0)
{
if(y%2==1)
{
res*=x;
// res=res%mod;
}
y/=2; x*=x; // x=x%mod;
}
return res;
}
ll str_to_num(string s)
{
return stoi(s);
}
string num_to_str(ll num)
{
return to_string(num);
}
// datatype definination
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
class Point
{
public:
ll x;
ll y;
ll z;
ll getsum()
{
return x+y+z;
}
};
/* ascii value
A=65,Z=90,a=97,z=122
*/
/* -----------------------------------------------------------------------------------*/
// to run ctrl+b
ll solve()
{
ll n;
cin>>n;
vl v(n),v2(n);
forin(v,n);
forin(v2,n);
ll sum=0;
for(ll i=0;i<n;i++)
{
sum+=(v[i]*v2[i]);
}
if(sum==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
int main()
{
speed;
/* #ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif */
ll TestCase=1;
// cin>>TestCase;
while(TestCase--)
{
solve();
}
}
/* stuff you should look before submission
* int overflow
* special test case (n=0||n=1||n=2)
* don't get stuck on one approach if you get wrong answer
*/ | #include <bits/stdc++.h>
using namespace std;
#define double long double
#define int long long
const int mod = 1e9 + 7;
const int N = 1e5 + 50;
int a[N];
int n;
double getSum(double x) {
double ret = 0;
for (int i = 0; i < n; i++) {
ret += x + (double) a[i] - min((double) a[i], (double) 2.0 * x);
}
return ret;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
double l = 0;
double r = 1e9+1;
int iter = 100;
while (iter--) {
double m1 = l + (r - l) / 3.0;
double m2 = r - (r - l) / 3.0;
double f1 = getSum(m1);
double f2 = getSum(m2);
if (f1 > f2) {
l = m1;
} else {
r = m2;
}
}
cout << fixed << setprecision(6) << getSum(l) / n << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i=0; i < n; i++) // 0 ~ n-1
template<class T> inline bool chmax(T& a, T& b) { if (a < b) { int tmp=a; a=b; b=tmp; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T& b) { if (a > b) { int tmp=a; a=b; b=tmp; return 1; } return 0; }
const ll mod=1000000000+7;
int main() {
ll R, X, Y;
cin >> R >> X >> Y;
double d = sqrt(X * X + Y * Y);
ll l = floor(d);
if (floor(d) == ceil(d) && l % R == 0) {
cout << l / R << "\n";
} else if (d < R) {
cout << 2 << "\n";
} else {
cout << l / R + 1 << "\n";
}
return 0;
} | // Problem: A - Tax Included Price
// Contest: AtCoder - AtCoder Regular Contest 118
// URL: https://atcoder.jp/contests/arc118/tasks/arc118_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
const int p=998244353;
int qp(int x,int y)
{
int res=1;
for(int t=x; y; y>>=1,t=t*t%p) if(y&1) res=res*t%p;
return res;
}
signed main()
{
int n=read(),m=read();
int ans=(m*100-1)/n+1;
printf("%lld\n",(100+n)*ans/100-1);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FastIO ios_base::sync_with_stdio(false),cin.tie(0)
#define f(n) for(int i=0;i<n;i++)
#define endl "\n"
const double PI = 3.141592653589793238460;
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
int arr[]={1,1,4,4,2,1,1,4,4,2};
ll pow(ll a,ll b,ll m)
{
ll res=1;
for(;b>0;b>>=1)
{
if(b&1)res=(res*a)%m;
a=(a*a)%m;
}
return res;
}
void solve()
{
int n=3;
//cin>>n;
ll A[n];
f(n)cin>>A[i];
for(int i=n-2;i>0;i--)
{
ll x=A[i]%10,y=A[i+1];
A[i]=pow(A[i],A[i+1],arr[A[0]%10])+arr[A[0]%10];
}
A[0]=pow(A[0],A[1],10)%10;
cout<<(A[0]%10);
}
int main()
{
FastIO;
int t=1;
//cin>>t;
for(int i=1;i<=t;i++)
{
solve();
if(i!=t)cout<<endl;
}
return 0;
}
| #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#include <cassert>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
ll power(ll x, ll y, ll m)
{
ll ans = 1;
while (y)
{
if (y & 1)
ans = (ans * x) % m;
x = (x * x) % m;
y >>= 1;
}
return ans;
}
int main(void)
{
ll a, b, c;
cin >> a >> b >> c;
vector<ll> m;
ll tmp = a % 10;
m.push_back(tmp);
for (int i = 0; i < 100; i++)
{
tmp *= a;
tmp %= 10;
if (tmp == a % 10)
{
break;
}
m.push_back(tmp);
}
cout << m[(power(b, c, m.size()) - 1 + m.size()) % m.size()] << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector <int>
#define vl vector <ll>
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define ff first
#define ss second
#define MOD 1000000007
ll power(ll a, ll b) { //a^b
ll res = 1;
a = a % MOD;
while (b > 0) {
if (b & 1) {res = (res * a) % MOD; b--;}
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
ll gcd(ll a, ll b) {return (b == 0) ? a : gcd(b, a % b);}
vl p(200005);
vector <unordered_map<ll, ll>> pp(200005);
vl siz(200005, 1);
ll get(ll u) {
return p[u] = (p[u] == u) ? u : get(p[u]);
}
void unions(ll a, ll b) {
a = get(a);
b = get(b);
//cout << a << " " << b << "\n";
if (a == b)
return;
if (siz[a] > siz[b])
swap(a, b);
for (auto i : pp[a]) {
//cout << i.ff << " " << i.ss << "\n";
pp[b][i.ff] += i.ss;
}
p[a] = b;
siz[b] += siz[a];
}
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
t = 1;
//cin >> t;
while (t--) {
ll n;
cin >> n;
ll q;
cin >> q;
for (ll i = 1; i <= n; i++)
p[i] = i;
for (ll i = 1; i <= n; i++) {
ll d;
cin >> d;
pp[i][d] = 1;
}
while (q--) {
ll x, y, z;
cin >> z;
cin >> x >> y;
if (z == 1) {
unions(x, y);
}
else {
x = get(x);
cout << pp[x][y] << "\n";
}
}
}
}
| #include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define gmn(a,b) a=min(a,b)
#define gmx(a,b) a=max(a,b)
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const int infi=1e9;//infi较大，注意涉及inf相加时爆int
const ll infl=4e18;
inline ll ceil_div(ll a,ll b){ return (a+b-1)/b; }
inline ll pos_mod(ll a,ll b){ return (a%b+b)%b; }
//std::mt19937 rnd(time(0));//std::mt19937_64 rnd(time(0));
}
using namespace Sakurajima_Mai;
namespace Fast_Read{
inline int qi(){
int f=0,fu=1; char c=getchar();
while(c<'0'||c>'9'){ if(c=='-')fu=-1; c=getchar(); }
while(c>='0'&&c<='9'){ f=(f<<3)+(f<<1)+c-48; c=getchar(); }
return f*fu;
}
inline ll ql(){
ll f=0;int fu=1; char c=getchar();
while(c<'0'||c>'9'){ if(c=='-')fu=-1; c=getchar(); }
while(c>='0'&&c<='9'){ f=(f<<3)+(f<<1)+c-48; c=getchar(); }
return f*fu;
}
inline db qd(){
char c=getchar();int flag=1;double ans=0;
while((!(c>='0'&&c<='9'))&&c!='-') c=getchar();
if(c=='-') flag=-1,c=getchar();
while(c>='0'&&c<='9') ans=ans*10+(c^48),c=getchar();
if(c=='.'){c=getchar();for(int Bit=10;c>='0'&&c<='9';Bit=(Bit<<3)+(Bit<<1)) ans+=(double)(c^48)*1.0/Bit,c=getchar();}
return ans*flag;
}
}
namespace Read{
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define rai(x,a,b) repi(i,a,b) x[i]=qi()
#define ral(x,a,b) repi(i,a,b) x[i]=ql()
}
namespace Out{
#define pi(x) printf("%d",x)
#define pl(x) printf("%lld",x)
#define ps(x) printf("%s",x)
#define pc(x) printf("%c",x)
#define pe() puts("")
}
namespace DeBug{
#define MARK false
#define DB if(MARK)
#define pr(x) cout<<#x<<": "<<x<<endl
#define pra(x,a,b) cout<<#x<<": "<<endl; \
repi(i,a,b) cout<<x[i]<<" "; \
puts("");
#define FR(a) freopen(a,"r",stdin)
#define FO(a) freopen(a,"w",stdout)
}
using namespace Fast_Read;
using namespace Read;
using namespace Out;
using namespace DeBug;
const int MAX_N=1e2+5;
char g[MAX_N][MAX_N];
int main()
{
int h=qi(),w=qi(),x=qi(),y=qi();
repi(i,1,h) ss(g[i]+1);
int cnt=0;
if(g[x][y]!='#') cnt++;
repi(i,x+1,h){
if(g[i][y]=='#') break;
cnt++;
}
repd(i,x-1,1){
if(g[i][y]=='#') break;
cnt++;
}
repi(i,y+1,w){
if(g[x][i]=='#') break;
cnt++;
}
repd(i,y-1,1){
if(g[x][i]=='#') break;
cnt++;
}
pi(cnt),pe();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '['; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << ']'; }
template<typename T, size_t size> ostream& operator<<(ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '{' << p.first << ", " << p.second << '}'; }
template<typename T> ostream& operator<<(ostream &os, const set<T> &s) { os << '{'; string sep; for (const auto &x : s) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream& operator<<(ostream &os, const map<A, B> &mp) { os << '['; string sep; for (const auto &x : mp) os << sep << x, sep = ", "; return os << ']'; }
template<typename T> ostream& operator<<(ostream &os, const multiset<T> &s) { os << '{'; string sep; for (const auto &x : s) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifndef ONLINE_JUDGE
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "] =", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
#define int long long
#define mod 1000000007
#define inf 1e18
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)(x).size()
#define sb(x) __builtin_popcountll(x)
#define all(x) x.begin(),x.end()
#define rall(x) (x).rbegin(), (x).rend()
int sumPairs(vector<int> &arr, int n)
{
int sum = 0;
for (int i = n - 1; i >= 0; i--)
sum += i * arr[i] - (n - 1 - i) * arr[i];
return sum;
}
void solve()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//cout << fixed << setprecision(10);
int n; cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(all(v));
cout << sumPairs(v, n) << endl;
}
int32_t main()
{
solve();
return 0;
}
| //#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")
#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <stack>
#include <bitset>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cassert>
#include <random>
using namespace std;
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
solve();
return 0;
}
#define int long long
const int N = 2e5 + 100, K = 201, INF = 1e18, MOD = 1e9 + 7;
int n, a[N], pref[N], suf[N];
void solve() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
pref[i + 1] = pref[i] + a[i];
}
for (int i = n - 1; i > 0; i--) {
suf[i - 1] = suf[i] + a[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += (i * a[i]) - pref[i] + suf[i] - ((n - i - 1) * a[i]);
}
cout << ans / 2;
} |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#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 rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef long long int ll;
typedef pair<int, int> P;
// typedef modint1000000007 mint;
void speedUpIO() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
/*--------------------------------------------------*/
const int INF = 1e9;
const ll LINF = 1e18;
void solve() {
int n;
cin >> n;
rep(i, 3) {
string s;
cin >> s;
}
string ans = string(n, '0');
ans += string(n, '1');
ans += "0";
cout << ans << "\n";
}
int main() {
speedUpIO();
int t = 1;
cin >> t;
while (t--) {
solve();
// cout << solve() << "\n";
// cout << (solve() ? "Yes" : "No") << "\n";
// cout << fixed << setprecision(15) << solve() << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
#include"map"
#include"string"
#include"cmath"
#include"cstdio"
#include"iostream"
#include"cstring"
#include"algorithm"
#include"vector"
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#ifdef local
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define f(i, l, r) for (int i = l; i <= r; ++i)
#define rf(i, r, l) for (int i = r; i >= l; --i)
#define all(x) (x).begin(), (x).end()
#define l l
#define r r
#define lch (o << 1)
#define rch (o << 1 | 1)
#define mid ((l + r) >> 1)
const int inf = 2e9 + 7;
double eps = 1e-6;
const int mod = 998244353;
const int N = 2e5 + 10;
const double pi = acos(-1.0);
ll power(ll a, ll b) { ll res = 1; while (b) { if (b & 1)res = res * a % mod; a = a * a % mod; b >>= 1; }return res; }
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
/*int len, C[N], clen;
int id(int v) { return lower_bound(C + 1, C + len, v) - C; }
void initC() { sort(C + 1, C + clen+1); len = unique(C + 1, C + 1 + clen) - C - 1; }*/
struct Edge {
int v, w1, w2;
};
vector<Edge> g[N];
int cnt[N];
bool ok2 = 1;
bool get(int s, int x) {
return (s >> x) & 1;
}
void dfs(int u, int f) {
for (Edge e : g[u])if (e.v != f) {
dfs(e.v, u);
vector<bool> need(2);
f(i, 0, 29) {
// if(get(e.w1,i)^get(e.w2,i))
}
}
}
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef local
freopen("in.txt", "r", stdin);
#endif
int _; cin >> _;
while (_--) {
int n; cin >> n;
vector<string> s(3);
for (auto& i : s)cin >> i;
f(i, 1, n)cout << 0; f(i, 1, n)cout << 1;
cout << 0 << "\n";
}
return 0;
int n; cin >> n;
bool ok = 1;
f(i, 1, n - 1) {
int u, v, w1, w2; cin >> u >> v >> w1 >> w2;
g[u].push_back({ v,w1,w2 });
g[v].push_back({ u,w1,w2 });
if (w1 != w2)ok = 0;
}
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("cpp.in", "r", stdin);
#endif
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = 3;
if (abs(r1 - r2) + abs(c1 - c2) <= 6 || ((r1 + c1) & 1) == ((r2 + c2) & 1)) ans = 2;
for (int tx, ty, i = 3; i >= 0; i--)
for (int j = 3 - i; j >= 0; j--)
for (int x = -1; x <= 1; x += 2)
for (int y = -1; y <= 1; y += 2) {
tx = r2 + i * x, ty = c2 + j * y;
if (abs(r1 - tx) + abs(c1 - ty) <= 3 || r1 + c1 == tx + ty || r1 - c1 == tx - ty) ans = 2;
}
if (abs(r1 - r2) + abs(c1 - c2) <= 3 ||
r1 + c1 == r2 + c2 ||
r1 - c1 == r2 - c2) ans = 1;
if (r1 == r2 && c1 == c2) ans = 0;
printf("%d\n", ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T y){if(x > y) x = y;}
template<class T> void chmax(T& x, T y){if(x < y) x = y;}
int main(){
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll rd = abs(r2 - r1), cd = abs(c2 - c1);
if(rd == 0 && cd == 0){
cout << 0 << endl;
}else if(abs(rd) + abs(cd) <= 3 || abs(rd) == abs(cd)){
cout << 1 << endl;
}else if(abs(rd) % 2 == abs(cd) % 2 || abs(rd - cd) <= 3 || rd + cd <= 6){
cout << 2 << endl;
}else{
cout << 3 << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
long long int n,goal,t[9][9],ans;
bool used[9];
void dfs(int sum,int it,int step){
if(step==n-1){
if(sum+t[it][0]==goal){
++ans;
}
return;
}
for(int i=1;i<n;++i){
if(!used[i]&&t[it][i]+sum<=goal){
used[i]=1;
dfs(t[it][i]+sum,i,step+1);
used[i]=0;
}
}
}
int main(){
while(cin >> n >> goal){
for(int i=0;i<n;++i){
used[i]=0;
for(int j=0;j<n;++j)
cin >> t[i][j];
}
ans=0;
used[0]=1;
dfs(0,0,0);
cout << ans << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
double PI = 3.141592653589793;
int main()
{
int N, K;
cin >> N >> K;
vector<vector<int>> list(N, vector<int>(N));
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
cin >> list[i][j];
vector<int> route(N - 1);
for (int i = 0; i < N - 1; i++)
route[i] = i + 1;
int ans = 0;
do
{
int tmp = 0;
tmp += list[0][route[0]] + list[0][route[N - 2]];
for (int i = 0; i < N - 2; i++)
tmp += list[route[i]][route[i + 1]];
if (tmp == K)
ans++;
} while (next_permutation(route.begin(), route.end()));
cout << ans;
} |
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
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;
}
template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り
T ret = 1;
while (n > 0)
{
if (n & 1)
{
if (p != -1)
ret = (ret * x) % p;
else
ret *= x;
}
if (p != -1)
x = (x * x) % p;
else
x *= x;
n >>= 1;
}
return ret;
}
using namespace std;
// using namespace atcoder;
struct edge{
int to,cost;
edge(int a,int b):to(a),cost(b){}
};
vector<int> dijkstra(vector<vector<edge>> &g,int s){
constexpr int inf=5e5;
vector<int>dis(g.size(),inf);
dis[s]=0;
using P=pair<int,int>;
priority_queue<P,vector<P>,greater<P>>pq;
pq.emplace(0,s);
while(!pq.empty()){
auto p=pq.top();
pq.pop();
int d=p.first;
int v=p.second;
if(d>dis[v])continue;
for(auto x:g[v]){
if(chmin(dis[x.to],dis[v]+x.cost)){
pq.emplace(dis[x.to],x.to);
}
}
}
return dis;
}
void solve()
{
int n,m;
cin>>n>>m;
vector<vector<edge>>g(n);
rep(i,m){
int a,b;
cin>>a>>b;
a--;
b--;
g[a].eb(b,1);
g[b].eb(a,1);
}
int k;
cin>>k;
vector<int>c(k);
rep(i,k)cin>>c[i],c[i]--;
vector<vector<int>>dis(k);
rep(i,k){
dis[i]=dijkstra(g,c[i]);
}
constexpr int inf=5e5;
vector<vector<int>>dp((1<<k)+5,vector<int>(k,inf));
rep(i,k)dp[1<<i][i]=1;
rep(bit,1<<k){
rep(i,k){
if(dp[bit][i]==inf)continue;
rep(j,k){
if(bit&(1<<j))continue;
chmin(dp[bit|1<<j][j],dp[bit][i]+dis[i][c[j]]);
}
}
}
int ans=inf;
rep(i,k){
chmin(ans,dp[(1<<k)-1][i]);
}
if(ans==inf)cout<<-1;
else cout<<ans;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
solve();
return 0;
}
| #include<iostream>
#include<algorithm>
#include<math.h>
#include<cstring>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<stack>
using namespace std;
vector<int> g[100000];
int flag[100000];
int dis[17][100000];
int D[17][17];
int cost[17][131072];
int bin[18];
int DP(int v, int s);
int n, m, k;
int main() {
/*
int bin[17];
bin[0] = 1;
int i, j;
for (i = 1; i <= 16; i++)bin[i] = bin[i - 1] * 2;
int n, m, k;
cin >> n >> m;
int a[101], b[101], c[16], d[16];
for (i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}
cin >> k;
for (i = 0; i < k; i++) {
cin >> c[i] >> d[i];
}
int sara[101], MAX = 0, counter;
for (i = 0; i < bin[k]; i++) {
//cout << i << endl;
for (j = 0; j <= 100; j++)sara[j] = 0;
counter = 0;
for (j = 0; j < k; j++) {
if (i + bin[j] != (i ^ bin[j])) {
sara[c[j]] = 1;
}
else {
sara[d[j]] = 1;
}
}
for (j = 0; j < m; j++) {
if (sara[a[j]] == 1 && sara[b[j]] == 1) {
counter++;
}
}
MAX = max(counter, MAX);
}
cout << MAX << endl;
return 0;
*/
/*long long int n, i, x, y;
cin >> n;
long long int counter = 0;
for (i = 1; i * i <= 2 * n; i++) {
if ((2 * n) % i == 0) {
x = i;
y = 2 * n / i;
if (x % 2 != y % 2) {
counter++;
}
}
}
cout << counter * 2 << endl;
return 0;
*/
memset(cost, -1, sizeof(cost));
cin >> n >> m;
int a, b, i, j;
bin[0] = 1;
for (i = 1; i <= 17; i++)bin[i] = bin[i - 1] * 2;
for (i = 0; i < m ; i++) {
cin >> a >> b;
a--; b--;
g[a].push_back(b);
g[b].push_back(a);
}
cin >> k;
int c[20];
for (i = 0; i < k; i++) {
cin >> c[i];
c[i]--;
}
int p;
queue<int> que;
que.push(c[0]);
flag[c[0]] = 1;
while (que.size()) {
p = que.front(); que.pop();
for (i = 0;i < g[p].size(); i++) {
if (flag[g[p][i]] == 0) {
flag[g[p][i]] = 1;
que.push(g[p][i]);
}
}
}
for (i = 0; i < k; i++) {
if (flag[c[i]] == 0) {
cout << -1 << endl;
return 0;
}
}
for (i = 0; i < k; i++) {
dis[i][c[i]] = 0;
que.push(c[i]);
while (que.size()) {
p = que.front(); que.pop();
for (j = 0; j < g[p].size(); j++) {
if (dis[i][g[p][j]] == 0 && g[p][j] != c[i]) {
dis[i][g[p][j]] = dis[i][p] + 1;
que.push(g[p][j]);
//cout << dis[i][g[p][j]] << endl;
}
}
}
}
for (i = 0; i < k; i++) {
for (j = 0; j < k; j++) {
D[i][j] = dis[i][c[j]];
}
}
int MIN = 99999999;
for (i = 0; i < k; i++) {
//cout << i << endl;
MIN = min(MIN, DP(i, bin[k] - 1 - bin[i]));
}
cout << MIN + 1 << endl;
return 0;
}
int DP(int v, int s) {
//cout << s << endl;
if (cost[v][s] != -1) {
return cost[v][s];
}
if (s == 0) {
cost[v][s] = 0;
return 0;
}
int ii, MIN = 99999999;
for (ii = 0; ii < k; ii++) {
if ((s ^ bin[ii]) != (s + bin[ii])) {
//cout << s - bin[v] << endl;
MIN = min(MIN, DP(ii, s - bin[ii]) + D[v][ii]);
}
}
cost[v][s] = MIN;
return MIN;
} |
#include<bits/stdc++.h>
using namespace std ;
#define MOD 1e9 + 7
#define inf 1e18 + 1
#define int long long
#define LMAX LLONG_MAX
#define IMAX INT_MAX
#define LMIN LLONG_MIN
#define IMIN INT_MIN
#define sort_1(a) sort(a.begin(),a.end())
#define sort_2(a) sort(a.begin(),a.end(),greater<int>())
#define DEBUG_1(v,a) for(int i=0;i<a;i++) cout<<v[i]<<' ';
#define DEBUG_2(v,a) for(int i=a;i>=0;i--) cout<<v[i]<<' ';
void pranav()
{
string n;
int k;
cin >> n >> k;
int flg=0;
int tmp = stoi(n) ;
while(k--)
{
if(flg==1 || tmp%200==0)
{
tmp = tmp/200;
n = to_string(tmp);
if(tmp%200==0)
flg=1;
else
flg=0;
}
else
{
tmp = tmp*1000 + 200;
n.push_back('2');
n.push_back('0');
n.push_back('0');
flg=1;
}
}
cout << n << endl;
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
//cin >> t;
while(t--)
{
pranav();
}
return 0;
} | #include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define ull unsigned long long
ull n,m,k;
int a[75];
int main()
{
scanf("%lld%lld",&n,&k);
while(k)
{
if(n%200==0)n/=200,k--;
else
{
if(k>=2)
{
n=n*5+1;
k-=2;
}
else
{
n=n*1000+200;
printf("%lld",n);
return 0;
}
}
}
printf("%lld",n);
return 0;
} |
#include <cstdio>
using namespace std;
int main()
{
int n;
double ans = 0;
scanf("%d", &n);
for (int i = 1; i < n; i++)
ans += double(n) / (n - i);
printf("%.9lf\n", ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
int tt,f[100100],n,p=1e9+7;
void prepare(){
f[0]=1;
f[1]=1;
f[2]=2;
for(int i=3;i<=n;i++)f[i]=(f[i-1]+f[i-2])%p;
}
void solve(){
cin>>n;
prepare();
int a[n],ans=0;
for(int i=0;i<n;i++){cin>>a[i];}
ans+=(a[0]*f[n])%p;
for(int i=1;i<n;i++){
ans=ans+((f[i]*f[n-i]-f[i-1]*f[n-i-1])%p+p)*a[i];
ans%=p;
}
cout<<ans<<'\n';
}
signed main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//prepare();
//cin>>tt;
//while(tt--)
solve();
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; ++i)
int debug = 0;
const int N = 5000;
int n, x, d, a[N];
set <int> ds, s;
main() {
cin >> n;
rep(i, 0, n) {
cin >> a[i];
int d = 1;
while (d * d <= a[i]) {
if (a[i] % d == 0) {
ds.insert(d);
ds.insert(a[i] / d);
}
++d;
}
}
sort(a, a + n);
for (int d : ds) {
int x = 0, f = 0;
rep(i, 0, n) {
if (a[i] % d == 0) {
f = 1;
x = __gcd(x, a[i]);
if (x == d) break;
}
}
if (x == d && f == 1 && x <= a[0]) s.insert(d);
}
cout << s.size() << '\n';
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
const int MOD=1e9+7;
template <typename T>
vector<T> divisor(T n){
vector<T> res;
for (T i(1);i*i<=n;i++){
if (n%i==0){
res.push_back(i);
// if (i != n/i) res.push_back(n/i);
}
}
return res;
}
int main(){
ll N;
cin>>N;
vector<ll> di = divisor(2*N);
set<pair<ll,ll>> st;
for(ll x:di){
ll y = 2*N/x;
ll b = (y-x+1);
ll a = (y+x+1);
if(a%2==0 && b%2==0) st.insert({a,b});
// st.insert({a,b});
}
cout << st.size()*2 << endl;
return 0;
}
|
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
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
ll dph[2000], dphw[4000], *naname = dphw + 2000;
const int mod = 1e9 + 7;
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
int H = 0, W = 0;
char c;
while ((c = getchar_unlocked()) >= '0') H = H * 10 + c - '0';
while ((c = getchar_unlocked()) >= '0') W = W * 10 + c - '0';
getchar_unlocked();
dph[0] = 1;
naname[0] = 1;
ll w = 1;
ll tmp = 1;
rep1(i, W - 1) {
tmp = w;
if (getchar_unlocked() == '.') {
dph[i] = w;
naname[i] = w;
w = w * 2 % mod;
}
else {
dph[i] = 0;
naname[i] = 0;
w = 0;
}
}
getchar_unlocked();
rep1(i, H - 1) {
if (getchar_unlocked() == '.') {
tmp = dph[0];
w = tmp;
dph[0] = (tmp + dph[0]) % mod;
naname[-i] = (tmp + naname[-i]) % mod;
}
else {
w = 0;
dph[0] = 0;
naname[-i] = 0;
}
if (!(i & 7)) {
rep1(j, W - 1) {
if (getchar_unlocked() == '.') {
tmp = w + dph[j] + naname[j - i];
w += tmp - ll(double(w + tmp) / mod) * mod;
dph[j] += tmp - ll(double(dph[j] + tmp) / mod) * mod;
naname[j - i] += tmp - ll(double(tmp + naname[j - i]) / mod) * mod;
}
else {
w = 0;
dph[j] = 0;
naname[j - i] = 0;
}
}
}
else {
rep1(j, W - 1) {
if (!(j & 7)) {
if (getchar_unlocked() == '.') {
tmp = w + dph[j] + naname[j - i];
w += tmp - ll(double(w + tmp) / mod) * mod;
dph[j] += tmp - ll(double(dph[j] + tmp) / mod) * mod;
naname[j - i] += tmp - ll(double(tmp + naname[j - i]) / mod) * mod;
}
else {
w = 0;
dph[j] = 0;
naname[j - i] = 0;
}
}
else {
if (getchar_unlocked() == '.') {
tmp = w + dph[j] + naname[j - i];
w = w + tmp;
dph[j] = tmp + dph[j];
naname[j - i] = tmp + naname[j - i];
}
else {
w = 0;
dph[j] = 0;
naname[j - i] = 0;
}
}
}
}
getchar_unlocked();
}
printf("%lld\n", tmp % mod);
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int mod = 1e9+7;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
mint operator+(const mint a) const { return mint(*this) += a;}
mint operator-(const mint a) const { return mint(*this) -= a;}
mint operator*(const mint a) const { return mint(*this) *= a;}
mint pow(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 { return mint(*this) /= a;}
};
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
vector<vector<mint>> dp(h, vector<mint>(w, 0));
vector<vector<mint>> a(h + 1, vector<mint>(w + 1, 0)), b(h + 1, vector<mint>(w + 1, 0)), c(h + 1, vector<mint>(w + 1, 0));
dp[0][0] = 1;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (j - 1 >= 0 && s[i][j - 1] == '.') a[i][j] += dp[i][j - 1] + a[i][j - 1];
if (i - 1 >= 0 && s[i - 1][j] == '.') b[i][j] += dp[i - 1][j] + b[i - 1][j];
if (i - 1 >= 0 && j - 1 >= 0 && s[i - 1][j - 1] == '.') c[i][j] += dp[i - 1][j - 1] + c[i - 1][j - 1];
dp[i][j] += a[i][j] + b[i][j] + c[i][j];
}
}
cout << dp[h - 1][w - 1].x << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) { a = (a > b ? a : b); }
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) { a = (a < b ? a : b); }
template <typename T1, typename T2> ostream &operator<<(ostream &os,const pair<T1,T2> &p) { os<<p.first<<' '<<p.second; return os;}
template <typename T> ostream &operator<<(ostream &os,const vector<T> &v) { range(i,0,v.size()) {os<<(i?" ":"")<<v[i];} return os;}
using ull = unsigned long long;
using ll = long long;
using PL = pair<ll, ll>;
using P = pair<int, int>;
const ll INF64 = INT64_MAX / 2;
const int INF32 = INT32_MAX / 2;
const char newl = '\n';
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
range(i,0,3){
string s;
cin>>s;
}
cout<<string(n,'1')+string(n,'0')+"1"<<newl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
for (int i = 0; i < T; i++) {
int N;
cin >> N;
string S, T, U;
cin >> S >> T >> U;
for (int i = 0; i < N; i++) cout << '0';
for (int i = 0; i < N; i++) cout << '1';
cout << '0' << endl;
}
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string s;
bool cmp(char a, char b){
return a > b;
}
int main () {
int T; cin >> T;
string cp = "atcoder";
while (T --){
cin >> s;
string temp = s;
sort(temp.begin(), temp.end(), cmp);
if(temp < cp){
cout << -1 <<"\n";
continue;
}
int n = s.length();
if(s > cp){
cout << 0 << "\n";
continue;
}
int ans = 0;
int p = 0;
for(int i = 0; i < n; ++i){
if(s[i] > 'a'){
p = i;
break;
}
}
if(s[p] > 't') p --;
cout << p << "\n";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#define printg(...) ;
#define fprint(...) ;
#define fprintn(...) ;
#endif
#define rep(i, a, b) for(auto i = (a); i < (b); i++)
#define rrep(i, a, b) for(auto i = (a); i > (b); i--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
// #define mp make_pair
#define fi first
#define se second
#define maxi(x, y) x = max(x, y)
#define mini(x, y) x = min(x, y)
// long long fact(long long n) { if(!n) return 1; return n*fact(n-1); }
// #define endl '\n'
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int get_random() {
static uniform_int_distribution<int> dist(0, 1e9 + 6);
return dist(rng);
}
#define solve_testcase int T;cin>>T;for(int t=1;t<=T;t++){solve(t);}
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;
typedef vector<long long> vll;
#define bd(type,op,val) bind(op<type>(), std::placeholders::_1, val)
template<class T>
void make_unique(T & v) {
sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());
}
int geti() { int x; cin >> x; return x; }
long long getll() { long long x; cin >> x; return x; }
double getd() { double x; cin >> x; return x; }
// pair<int, int> a(geti(), geti()) does not work
// pair<int, int> a({geti(), geti()}) works, since it uses initializer.
const int MAXN = 3e5 + 100;
ll cal(const string & s1, string s2) {
if(s2.empty()) return 1e9;
if(s1.empty()) return 0;
if(s1[0]<s2[0]) return 0;
ll res=1e9;
if(s1[0]==s2[0])
res = cal(s1.substr(1, s1.size()-1), s2.substr(1, s2.size()-1));
rep(i,0,s2.size()){
if(s2[i]>s1[0]) {
res = min(res,ll(i));
break;
}
}
if(s1[0]==s2[0]) return res;
// print(s1,s2);
rep(i,1,s2.size()) {
if(i>res) break;
if(s2[i]==s1[0]) {
auto tmp = s2[i] + s2.substr(0, i) + s2.substr(i+1, int(s2.size()) - (i+1));
res = min(res, i + cal(s1.substr(1,s1.size()-1), tmp.substr(1,tmp.size()-1)));
break;
}
}
return res;
}
void solve(int tt) {
// cout<<"Case #"<<tt<<": ";
string s;
cin>>s;
ll res = cal("atcoder", s);
cout<<(res >= 1e9 ? -1 : res)<<endl;
}
int main(int argc, char * argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
solve_testcase;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
int main(){
int t = 1;
// cin >> t;
while(t--){
int n;
cin >> n;
if(n%2){
cout << "Black";
}
else{
cout << "White";
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int x=N*1.08;
if(x<206)
cout << "Yay!" << endl;
else if(x>206)
cout << ":(" << endl;
else
cout << "so-so" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define maxn 105
typedef long long ll;
ll n,a[maxn],b[maxn];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++) cin>>b[i];
ll counter=0;
for(int i=1;i<=1000;i++){
bool flag=false;
for(int j=1;j<=n;j++)
if(! (a[j]<=i && i<=b[j]))
flag=true;
if(!flag) counter++;
}
cout<<counter<<endl;
return 0;
} | /*
* Lang : C++ 17
* Author: Debajyoti Dasgupta
* Date : 10-04-2021 23:37 10
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef tree<int, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> oset;
const int mod = 1000'000'007;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
int mn = 0, mx = 1e9;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
mn = max(mn, x);
}
for (int i = 0; i < n; i++) {
int x;
cin >> x;
mx = min(mx, x);
}
cout << max(0, mx - mn + 1) << endl;
}
|
//Author: Xzirium
//Time and Date: 20:18:14 15 June 2021
//Optional FAST
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
//Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
//Required namespaces
using namespace std;
using namespace __gnu_pbds;
//Required defines
#define endl '\n'
#define READ(X) cin>>X;
#define READV(X) long long X; cin>>X;
#define READAR(A,N) long long A[N]; for(long long i=0;i<N;i++) {cin>>A[i];}
#define rz(A,N) A.resize(N);
#define sz(X) (long long)(X.size())
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define FORI(a,b,c) for(long long a=b;a<c;a++)
#define FORD(a,b,c) for(long long a=b;a>c;a--)
//Required typedefs
template <typename T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template <typename T> using ordered_set1 = tree<T,null_type,greater<T>,rb_tree_tag,tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
//Required Constants
const long long inf=(long long)1e18;
const long long MOD=(long long)(1e9+7);
const long long INIT=(long long)(1e6+1);
const long double PI=3.14159265358979;
// Required random number generators
// mt19937 gen_rand_int(chrono::steady_clock::now().time_since_epoch().count());
// mt19937_64 gen_rand_ll(chrono::steady_clock::now().time_since_epoch().count());
//Required Functions
ll power(ll b, ll e)
{
ll r = 1ll;
for(; e > 0; e /= 2, (b *= b) %= MOD)
if(e % 2) (r *= b) %= MOD;
return r;
}
ll modInverse(ll a)
{
return power(a,MOD-2);
}
//Work
int main()
{
#ifndef ONLINE_JUDGE
if (fopen("INPUT.txt", "r"))
{
freopen ("INPUT.txt" , "r" , stdin);
//freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
clock_t clk;
clk = clock();
//-----------------------------------------------------------------------------------------------------------//
READV(N);
READV(M);
READV(K);
if(N<=M+K)
{
ll tot=1;
ll ans=1;
FORI(i,1,N+M+1)
{
ans=(ans*i)%MOD;
}
tot=ans;
FORI(i,1,N-K-1+1)
{
ans=(ans*modInverse(i))%MOD;
}
FORI(i,1,M+K+1+1)
{
ans=(ans*modInverse(i))%MOD;
}
FORI(i,1,N+1)
{
tot=(tot*modInverse(i))%MOD;
}
FORI(i,1,M+1)
{
tot=(tot*modInverse(i))%MOD;
}
if(N<K+1)
{
ans=0;
}
cout<<(tot-ans+MOD)%MOD<<endl;
}
else
{
cout<<0<<endl;
}
//-----------------------------------------------------------------------------------------------------------//
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk)/CLOCKS_PER_SEC << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
int main(){
ll n,k;
cin>>n>>k;
rep(i,k){
ll g1=0,g2=0;
vector<int> num;
while(n>0){
num.push_back(n%10);
n/=10;
}
sort(num.begin(),num.end());
int sz=num.size();
ll p=1;
rep(j,sz){
g1 += p*num[j];
g2 += p*num[sz-j-1];
p *= 10;
}
n=g1-g2;
}
cout<<n<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define Mod(x) (x>=P)&&(x-=P)
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(int i=hd[a];i;i=nxt[i])
typedef long long ll;
void Max(int &x,int y){(x<y)&&(x=y);}
void Min(int &x,int y){(x>y)&&(x=y);}
bool vio;
char IO;
int rd(int res=0){
bool f=0;
while(IO=getchar(),IO<48||IO>57)
f=IO=='-';
do res=(res<<1)+(res<<3)+(IO^48);
while(IO=getchar(),isdigit(IO));
return f?-res:res;
}
const int M=1e6+10;
int nxt[M<<1],to[M<<1],hd[M],ecnt;
void Add(int a,int b){
nxt[++ecnt]=hd[a],to[hd[a]=ecnt]=b;
}
int Mx,tp,bot,L[M],R[M],n;
void dfs(int x,int f,int d){
static int tot;
if(d>Mx)tp=x,Mx=d;
L[x]=++tot;
erep(i,x){
int y=to[i];
if(y==f)continue;
dfs(y,x,d+1);
}
R[x]=tot;
}
bool FA(int a,int b){
return L[a]<=L[b]&&L[b]<=R[a];
}
int nw=1,ans[M];
void redfs(int x,int f){
ans[x]=nw;
erep(i,x){
int y=to[i];
if(y==f||FA(y,tp))continue;
nw++,redfs(y,x);
}
erep(i,x){
int y=to[i];
if(y!=f&&FA(y,tp))nw++,redfs(y,x);
}
nw++;
}
bool let;
int main(){
cerr<<(&vio-&let)/1024.0/1024<<endl;
rep(i,2,n=rd()){
int a=rd(),b=rd();
Add(a,b),Add(b,a);
}
Mx=0,dfs(1,0,0);
bot=tp,Mx=0,dfs(tp,0,0);
ans[1]=1;
redfs(bot,0);
rep(i,1,n)printf("%d ",ans[i]);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl '\n'
#define SZ(x) ll(x.size())
const ll MAXN = 1e6 + 10;
const ll LOG = 22;
const ll INF = 8e18;
const ll MOD = 1e9 + 7; //998244353; //1e9 + 9;
int n , timer , R[MAXN] , H[MAXN] , st[MAXN] , fn[MAXN];
vector<int> adj[MAXN];
int cmp(int i , int j){
return R[i] < R[j];
}
void DFS(int v , int p = -1){
st[v] = ++timer;
R[v] = H[v] = (p == -1 ? 0 : H[p] + 1);
sort(all(adj[v]) , cmp);
for(int u : adj[v]){
if(u == p) continue;
DFS(u , v);
R[v] = max(R[v] , R[u]);
}
fn[v] = ++timer;
}
int main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin >> n;
for(int i = 1 ; i < n ; i++){
int v , u;
cin >> v >> u;
adj[v].push_back(u);
adj[u].push_back(v);
}
DFS(1);
int v = max_element(H , H + MAXN) - H;
DFS(v);
timer = 0; DFS(v);
for(int i = 1 ; i <= n ; i++) cout << st[i] << sep;
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 T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);cerr<<fixed<<setprecision(15);}}init_;
#ifdef DEBUG
template <class T> void verr(const set<T> &st) { repa(a, st) cerr << a << " "; cerr << endl; }
template <class S, class T> void verr(const map<S, T> &mp) { repa(a, mp) cerr << "{" << a.first << ", " << a.second << "} "; cerr << endl; }
template <class S, class T, class N> void verr(const vector<pair<S,T>>& a, const N& n) { rep(i, n) cerr << "{" << a[i].first << ", " << a[i].second << "} "; cerr << endl; }
template <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << endl; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << endl; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif
const ll INF = 4e18;
const ld EPS = 1e-5;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
int main() {
ll N;
cin >> N;
vc<complex<ld>> S(N), T(N);
rep(i, N) {
ld a, b;
cin >> a >> b;
S[i] = {a, b};
}
rep(i, N) {
ld a, b;
cin >> a >> b;
T[i] = {a, b};
}
complex<ld> sc(0, 0), tc(0, 0);
rep(i, N) sc += S[i], tc += T[i];
sc /= N, tc /= N;
rep(i, N){
S[i] -= sc;
T[i] -= tc;
}
rep(i, N) rep(j, N){
vc<complex<ld>> ss(N), tt(N);
rep(si, N) ss[si] = S[si] * polar(1.0L, -arg(S[i]));
rep(ti, N) tt[ti] = T[ti] * polar(1.0L, -arg(T[j]));
bool ok = true;
rep(si, N) {
bool isok = false;
rep(ti, N){
if (abs(ss[si] - tt[ti]) < EPS) isok = true;
}
if(!isok){
ok = false;
break;
}
}
if(ok){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | //Author: Xzirium
//Time and Date: 17:59:04 11 April 2021
//Optional FAST
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
//Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
//Required namespaces
using namespace std;
using namespace __gnu_pbds;
//Required defines
#define endl '\n'
#define READ(X) cin>>X;
#define READV(X) long long X; cin>>X;
#define READAR(A,N) long long A[N]; for(long long i=0;i<N;i++) {cin>>A[i];}
#define rz(A,N) A.resize(N);
#define sz(X) (long long)(X.size())
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define FORI(a,b,c) for(long long a=b;a<c;a++)
#define FORD(a,b,c) for(long long a=b;a>c;a--)
//Required typedefs
template <typename T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template <typename T> using ordered_set1 = tree<T,null_type,greater<T>,rb_tree_tag,tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
//Required Constants
const long long inf=(long long)1e18;
const long long MOD=(long long)(1e9+7);
const long long INIT=(long long)(1e6+1);
const long double PI=3.14159265358979;
// Required random number generators
// mt19937 gen_rand_int(chrono::steady_clock::now().time_since_epoch().count());
// mt19937_64 gen_rand_ll(chrono::steady_clock::now().time_since_epoch().count());
//Required Functions
ll power(ll b, ll e)
{
ll r = 1ll;
for(; e > 0; e /= 2, (b *= b) %= MOD)
if(e % 2) (r *= b) %= MOD;
return r;
}
ll modInverse(ll a)
{
return power(a,MOD-2);
}
//Work
vector<vector<ll>> ADJ;
vector<ll> C;
multiset<ll> curr;
vector<ll> ans;
void dfs(ll u, ll p=-1)
{
if(curr.count(C[u])==0)
{
ans.pb(u);
}
curr.insert(C[u]);
for(auto v:ADJ[u])
{
if(v!=p)
{
dfs(v,u);
}
}
curr.erase(curr.find(C[u]));
}
int main()
{
#ifndef ONLINE_JUDGE
if (fopen("INPUT.txt", "r"))
{
freopen ("INPUT.txt" , "r" , stdin);
//freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
clock_t clk;
clk = clock();
//-----------------------------------------------------------------------------------------------------------//
READV(N);
ADJ.resize(N+1);
C.resize(N+1);
FORI(i,1,N+1)
{
cin>>C[i];
}
FORI(i,0,N-1)
{
READV(u);
READV(v);
ADJ[u].pb(v);
ADJ[v].pb(u);
}
dfs(1);
sort(ans.begin(),ans.end());
for(auto v:ans)
{
cout<<v<<endl;
}
//-----------------------------------------------------------------------------------------------------------//
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk)/CLOCKS_PER_SEC << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define stp(var, init, end) for (auto var = init; var < end; ++var)
#define ll long long
bool comp(pair<int, int> l, pair<int, int> r)
{
if (l.first < r.first)
return true;
else
return false;
}
int main(void)
{
int n;
cin >> n;
int a, b;
vector<pair<int, int>> aa(n);
vector<pair<int, int>> bb(n);
int abmin = 1000000;
stp(i, 0, n)
{
cin >> a >> b;
if (a + b < abmin)
abmin = a + b;
aa[i] = pair<int, int>{a, i};
bb[i] = pair<int, int>{b, i};
}
sort(aa.begin(), aa.end(), comp);
sort(bb.begin(), bb.end(), comp);
if (aa[0].second != bb[0].second)
{
cout << min(abmin, max(aa[0].first, bb[0].first));
}
else
{
int x = min(max(aa[0].first, bb[1].first), max(aa[1].first, bb[0].first));
cout << min(abmin, x);
}
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <utility>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;
using i32 = int32_t;
using pi64 = pair<i64, i64>;
constexpr i64 MAXN = 3*100*1000LL+5LL;
constexpr i64 MOD = 1000000007LL;
constexpr i64 INF64 = MOD * MOD;
#define vec vector
#define let const
#define DRi64(x) i64 x; cin >> x;
#define DRS(x) string x; cin >> x;
#define DRVi64(v, n) vec<i64> v(n); { for (i64 i = 0; i < n; ++i) { cin >> v[i]; }}
#ifdef DEBUG
#define P(x) cerr << x << "\n"
#else
#define P(x)
#endif
i64
gcd(const i64 a, const i64 b)
{
if (b == 0)
{
return a;
}
return gcd(b, a % b);
}
int
main()
{
ios_base::sync_with_stdio(false);
const unsigned seed =
chrono::system_clock::now().time_since_epoch().count();
mt19937 gen(seed);
DRi64(N);
i64 l = 1;
for (i64 i = 2; i <= N; ++i)
{
l = (l * i) / gcd(l, i);
}
cout << l + 1 << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
/////////////////////////////////////////////////////////////////////////////////////////////////////////////
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<pair<int, int>,null_type,less<pair<int, int>>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long int ll;
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ull unsigned long long
#define d1(x) cout<<#x<<" "<<x<<endl;
#define d2(x,y) cout<<#x<<" "<<x<<" "<<#y<<" "<<y<<endl;
#define d2i(x,y,i) cout<<#x<<i<<" "<<x<<" "<<#y<<i<<" "<<y<<endl;
#define fr(i,l,r) for(ll i=l;i<r;i++)
#define mems(a,x) memset(a,x,sizeof(a))
#define mod 1000000007
#define ff first
#define ss second
#define pb(x) push_back(x)
#define vll vector<ll>
#define pbp(x,y) push_back(make_pair(x,y))
#define all(v) v.begin(),v.end()
#define mat vector<vector<ll>>
#define el cout<<'\n';
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
void solve(){
char a,b;
cin>>a>>b;
if(a=='Y')
cout<<(char)(b&'_');
else cout<<b;
el
}
int main(){
boost
ll t=1;
//cin>>t;
while(t--){
solve();
el
}
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
int main(){
ll n,q;
cin >> n >> q;
vector<ll> arr(n);
for(ll i=0; i<n; i++) cin >> arr[i];
vector<ll> cnt(n);
for(ll i=0; i<n; i++){
cnt[i] = arr[i] - (i+1);
}
while(q--){
ll k;
ll l = 0;
ll r = n-1;
cin >> k;
if(k > cnt[n-1]){
cout << arr[n-1] + (k-cnt[n-1]) << "\n";
continue;
}
ll ans = -1;
while(l <= r){
ll m = l + (r - l)/2;
if(cnt[m] >= k){
ans = m;
r = m-1;
}
else if(cnt[m] < k){
l = m+1;
}
}
cout << arr[ans]-1 -(cnt[ans]-k) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const string target = "atcoder";
int T;
string a;
int calc(int k, char c) {
for (int i = 0; i + k < a.length(); i++) {
if (a[i + k] > c) { return i; }
}
return inf;
}
int move(int k, char c) {
for (int i = 0; i + k < a.length(); i++) {
if (a[i + k] == c) {
for (int j = 1; j <= i; j++) { a[j + k] = a[j + k - 1]; }
a[k] = c;
return i;
}
}
return -1;
}
int main() {
#ifdef local
freopen("1.in", "r", stdin);
#endif
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> T;
while (T--) {
cin >> a;
int ans = inf;
int sum = 0;
if (a > target) {
cout << 0 << endl;
goto next;
}
for (int i = 0; i < target.length() && i < a.length(); i++) {
ans = min(ans, sum + calc(i, target[i]));
int mov = move(i, target[i]);
if (mov == -1) {
break;
} else {
sum += mov;
}
}
cout << (ans >= inf ? -1 : ans) << endl;
next:
continue;
}
return 0;
} | #include <cstdio>
int main(){
int T;
int L, R;
long long Ans=0LL;
scanf("%d", &T);
while(T--){
scanf("%d%d", &L, &R);
if(R-L<L) puts("0");
else{
int Cnt=R-L-L+1;
Ans=0LL;
Ans=Cnt*(long long)(R-L+1)-((R*(long long)Cnt)>>1);
printf("%lld\n", Ans);
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N = 2e3+5;
vector<int>g[N];
bool vis[N];
int cnt = 0;
void dfs(int src)
{
vis[src] = true;
cnt++;
for(auto i :g[src]) if(!vis[i]) dfs(i);
}
int32_t main()
{
IOS;
int n,m;
cin>>n>>m;
for(int i = 0;i<m;i++)
{
int u,v;
cin>>u>>v;
g[u].push_back(v);
}
int ans = 0;
for(int i = 1;i<=n;i++)
{
dfs(i);
//cout<<i<<" "<<cnt<<endl;
ans += cnt;
cnt = 0;
memset(vis,0,sizeof(vis));
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
vector<vector<int>> G;
bool temp[2010];
void dfs(int v){
if(temp[v]) return;
temp[v]=true;
for(auto vv : G[v]) dfs(vv);
}
int main(){
int N,M;
cin>>N>>M;
G.resize(N);
rep(i,M){
int a,b;
cin>>a>>b;
G[a-1].push_back(b-1);
}
int ans=0;
rep(i,N){
rep(j,N) temp[j]=false;
dfs(i);
rep(j,N) if(temp[j]) ans++;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#include <unordered_set>
#include <algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i,n) for (ll i = 0; i < (ll)(n); i++)
#define fore(x,a) for(auto&(x) : (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 (b<a) { a=b; return 1; } return 0; }
#define ALL(a) (a).begin(), (a).end()
const ll INFL = 1e18;
const int INFI = 1e9;
const int MOD = 1e9 + 7;
int main(){
vi A(3);
rep(i,3) {
cin >> A[i];
}
sort(ALL(A));
if(A[0] == A[1]) {
cout << A[2] << endl;
}
else if(A[1] == A[2]) {
cout << A[0] << endl;
}
else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
// ---------------------------------------------------------Defines----------------------------------------------------------
#define fast_cin ios_base::sync_with_stdio(0); cin.tie(NULL); cerr.tie(NULL);
#define sz(a) (int)a.size()
#define pb(a) push_back(a)
#define all(a) a.begin(),a.end()
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define endl "\n"
//-----------------------------------------------------------Types-----------------------------------------------------------
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii>vii;
typedef vector<pll>vll;
#define dbg(x) cerr << #x << ": " << x << endl;
#define DBG cerr << __LINE__ << ": I GOT STUCK\n";
//---------------------------------------------------------------------------------------------------------------------------------------
void solve(){
int a,b,c;cin >> a>>b >>c;
if(a == b)cout << c << endl;
else if(a == c)cout << b << endl;
else if(b == c)cout << a << endl;
else cout << 0 << endl;
}
int main() {
// freopen("billboard.in","r", stdin);
// freopen("billboard.out","w", stdout);
fast_cin;
cout << fixed;
// int tc = 1;
// int test;cin >> test;
int test;test=1;
while (test--) {
// cout << "Case " << tc++ << ": ";
solve();
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vii = vector<int>;
using vvii = vector<vector<int>>;
using vvvii = vector<vector<vector<int>>>;
using vdd = vector<double>;
using vvdd = vector<vector<double>>;
using vvvdd = vector<vector<vector<double>>>;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define endl '\n'
#define stpr std::fixed << setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d)
#define rRep(i, a, b) for (ll i = a; i >= b; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define Crep(i) for (char i = 'A'; i <= 'Z'; ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD2 = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-10;
template <class T, class U>
inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &&x : v) is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << ' ' << p.second;
return os;
}
template <class T>
ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = begin(v); i != end(v); ++i) {
if (i != begin(v)) os << ' ';
os << *i;
}
return os;
}
int main(){
string n,n2;
cin >> n;
ll l;
l=n.size();
if(n=="0"){cYes;}
else{
while(n.substr(l-1,1)=="0"){
n=n.substr(0,l-1);
l-=1;
}
rep(i,l){
n2=n.substr(i,1) + n2;
}
if(n==n2){cYes;}
else{cNo;}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
string s;
cin>>s;
int len=s.length();
while(1){
if(s[len-1]=='0'){
s=s.substr(0,len-1);
len--;
continue;
}
break;
}
//cout<<s<<endl;
rep(i,len){
if(s[i]==s[len-1-i]) continue;
cout<<"No"<<endl;
return 0;
}
cout<<"Yes"<<endl;
return 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for (ll i = 0; i < (ll)n ;i++)
#define rept(i,k,n) for(ll i = (ll)(k);i < (ll)(n);i++)
#define all(vec) vec.begin(),vec.end()
#define ll int64_t
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
cout << a*d-b*c << endl;
} | #include<bits/stdc++.h>
#define N 1000005
#define LL long long
using namespace std;
int t,n,m;
char a,b,c;
inline int qr()
{
char a=0;int x=0,w=1;
while(a<'0'||a>'9'){if(a=='-')w=-1;a=getchar(); }
while(a<='9'&&a>='0'){x=(x<<3)+(x<<1)+(a^48);a=getchar();}
return x*w;
}
int main()
{
cin>>a>>b>>c;
if(a==b&&b==c)
cout<<"Won"<<endl;
else
cout<<"Lost"<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fr(i,n) for(int i=0;i<n;i++)
#define fro(i,j,n) for(int i=j;i<n;i++)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
int main() {
int n;
cin >> n;
cout <<"6 10 15 ";
int count=3;
fro(i,16,10001){
if(count==n)break;
if(i%6==0||i%10==0||i%15==0){
cout <<i<<" ";
count++;
}
}
} | #include<bits/stdc++.h>
#define pb push_back
#define eb emplace_back
using namespace std;
//#define DEBUG
#ifdef DEBUG
template<typename ...Args>
int debug(const Args &...args){
return fprintf(stderr,args...);
}
#else
#define debug(...) void()
#endif
typedef unsigned long long ull;
typedef unsigned uint;
typedef long long ll;
#define G getchar()
int read()
{
int x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return flg?-x:x;
}
#undef G
#define fi first
#define se second
const int mod=998244353;
inline int upd(const int &x){return x+(x>>31&mod);}
inline void add(int &x,const int &y){x=upd(x+y-mod);}
inline void iadd(int &x,const int &y){x=upd(x-y);}
int qpow(int x,int y){
int res=1;
for (;y;y>>=1,x=1LL*x*x%mod)
if (y&1) res=1LL*res*x%mod;
return res;
}
//typedef pair<int,int> P;
#define rep(i,l,r) for (int i(l),_##i(r);i<=_##i;i++)
#define per(i,l,r) for (int i(r),_##i(l);i>=_##i;i--)
#define all(x) (x).begin(),(x).end()
#define forall(x,y) for (const int &y: e[x])
int n,w[110];
int dp[110][10010];
void solve(){
n=read(); int S=0;
rep(i,1,n) w[i]=read(),S+=w[i];
if (S&1) return puts("0"),void();
auto F=dp;
F[0][0]=1;
rep(_,1,n){
const int &W=w[_];
per(i,0,n){
rep(j,0,n*100){
if (i<n&&j+W<=n*100);
else continue;
add(F[i+1][j+W],F[i][j]);
}
}
}
static int fac[110];
fac[0]=1; rep(i,1,n) fac[i]=1LL*fac[i-1]*i%mod;
int z=0;
rep(i,0,n) add(z,1LL*F[i][S>>1]*fac[i]%mod*fac[n-i]%mod);
printf("%d\n",z);
}
int main()
{
for (int T=1;T--;) solve();
return 0;
} |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}
const unsigned int mod = 1000000007;
//const unsigned int mod = 998244353;
struct mint {
unsigned int x;
mint():x(0) {}
mint(int64_t x_) {
int64_t v = int64_t(x_ % mod);
if(v < 0) v += mod;
x = (unsigned int)v;
}
static mint row(int v) {
mint v_;
v_.x = v;
return v_;
}
mint operator-() const { return mint(-int64_t(x));}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) {
uint64_t z = x;
z *= a.x;
x = (unsigned int)(z % mod);
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a;}
mint operator-(const mint a) const { return mint(*this) -= a;}
mint operator*(const mint a) const { return mint(*this) *= a;}
friend bool operator==(const mint &a, const mint &b) {return a.x == b.x;}
friend bool operator!=(const mint &a, const mint &b) {return a.x != b.x;}
mint &operator++() {
x++;
if(x == mod) x = 0;
return *this;
}
mint &operator--() {
if(x == 0) x = mod;
x--;
return *this;
}
mint operator++(int) {
mint result = *this;
++*this;
return result;
}
mint operator--(int) {
mint result = *this;
--*this;
return result;
}
mint pow(int64_t t) const {
mint x_ = *this, r = 1;
while(t) {
if(t&1) r *= x_;
x_ *= x_;
t >>= 1;
}
return r;
}
//for prime mod
mint inv() const { return pow(mod-2);}
mint& operator/=(const mint a) { return *this *= a.inv();}
mint operator/(const mint a) {return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
string to_string(mint a) {
return to_string(a.x);
}
mint inv[100];
mint c(int n, int k) {
if(n < k) return 0;
mint res(1);
rep(i, k) res *= inv[i+1] * (n-i);
return res;
}
//head
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
rep(i, 99) {
inv[i+1] = mint(1)/(i+1);
}
int t;
cin >> t;
while(t--) {
int n, a, b;
cin >> n >> a >> b;
mint z = c(n-a-b+2, 2);
mint u = z * (n-a+1) * (n-b+1);
u *= 4;
mint v = z * z;
v *= 4;
cout << u-v << '\n';
}
} | #include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <functional>
#include <queue>
#include <unordered_set>
#include <climits>
#include <set>
#include <list>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
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;
}
};
int Grid[5002][5002];
static mint DP[5002][5002];
int main() {
#ifdef DEBUG
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
ll H, W, K;
cin >> H >> W >> K;
for(int i = 0; i <= H; i++){
fill(Grid[i], Grid[i]+W+1, 'O');
fill(DP[i], DP[i]+W+1, 0);
}
for(int i = 0; i < K; i++){
int h, w;
string c;
cin >> h >> w >> c;
Grid[h][w] = c[0];
}
mint three = 3;
mint all = three.pow(H*W-K);
mint three_inv = three.inv();
int O = 'O';
int R = 'R';
int D = 'D';
DP[1][1] = all;
for(int p = 0; p < W*H; p++){
int i = p / W + 1;
int j = p % W + 1;
{
if(Grid[i][j] == O){
DP[i][j+1] += DP[i][j]*2*three_inv;
DP[i+1][j] += DP[i][j]*2*three_inv;
}
else if(Grid[i][j] == R){
DP[i][j+1] += DP[i][j];
}
else if(Grid[i][j] == D){
DP[i+1][j] += DP[i][j];
}else{
DP[i][j+1] += DP[i][j];
DP[i+1][j] += DP[i][j];
}
}
}
cout << DP[H][W].x << endl;
return 0;
}
|
// Created by vamsi
#define _CRT_SECURE_NO_DEPRECATE
#define _SECURE_SCL 0
#pragma comment(linker, "/STACK:200000000")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mset(mas,val) memset(mas,val,sizeof(mas))
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define forn(i,n) for (int i=0; i<int(n); ++i)
#define fornd(i,n) for (int i=int(n)-1; i>=0; --i)
#define forab(i,a,b) for (int i=int(a); i<int(b); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int INF = (int) 1e9;
const long long INF64 = (long long) 1e18;
long double eps = 1e-6;
const long double pi = 3.14159265358979323846;
const int N = 1e6 + 100;
long long fact[N], modulo = INF + 7;
long long binpow(long long val, long long deg, long long mod) {
if (!deg) return 1 % mod;
if (deg & 1) return binpow(val, deg - 1, mod) * val % mod;
long long res = binpow(val ,deg >> 1, mod);
return (res*res) % mod;
}
/////////////////////////////////template ends//////////////////////////////////////////
int n;
vector<int> a;
ll ans = 0;
ll countIt(int ind){
if( ind == 0){
return 1;
}
else{
ll ans = 0;
if( a[ind-1] == 2) ans = (1ll<< (ind)) + countIt(ind-1);
else ans = countIt(ind-1);
return ans;
}
}
void solve() {
cin >> n;
forn(i,n){
string s;
cin >> s;
if( s == "AND") a.push_back(1);
else a.push_back(2);
}
cout << countIt(n) << endl;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc = 1;
//cin >> tc;
while(tc--) solve();
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef long double ld;
#define syncboost ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)
#define mp make_pair
#define pb push_back
#define psy push
#define pp pop_back
#define pl pair<ll,ll>
#define vl vector<ll>
#define vvl vector<vector<ll> >
#define vpl vector<pair<ll,ll>>
#define all(x) x.begin(),x.end()
#define precise(n) cout << fixed; cout << setprecision(n)
#define forn(i, n) for (ll i = 0; i < ll(n); i++)
#define setbit(x) __builtin_popcount(x)
#define run(i, v) for(auto &i: v)
#define hike(i, v) for(const auto &i: v)
#define srt(v) sort(v.begin(),v.end())
#define mem(x,val) memset(x,val,sizeof(x))
#define rep(i,init,n) for(ll i = init;i<n;i++)
#define rrep(i,n,init) for(ll i = n;i>=init;i--)
#define fi first
#define se second
long double pi = 3.14159265;
#define show(x) cerr << x
#define deb1(x) cout<<x<<"\n";
#define deb(x) show(#x << ": " << (x) << endl);
#define debn(x) show((x) <<" ");
#define debv(x) for(auto it : x ) debn(it);deb("\n");
#define det(x) cout<<x<<"\n";
#define No cout<<"No\n";
#define Yes cout<<"Yes\n";
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";
#define sp " "
#define nl cout<<"\n";
#define ps(x,y) fixed<<setprecision(y)<<x
const ll mod = 1000000007;
//const ll mod =998244353;
ll power(ll a, ll b, ll m)
{
if(a == 0) return 0;
if(b == 0) return 1;
if(b == 1) return a % m;
ll temp = power( a , b / 2 , m );
temp = ( temp * temp ) % m;
if(b % 2)
temp = (a * temp) % m;
return temp;
}
ll modinv(ll x) {
return power(x,mod-2,mod);
}
ll dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
const ll N = 1e15;
#define ll long long
map<int,set<int>> mpp;
ll dp[105][10005];
ll n;
ll go(ll mask , ll id)
{
if(id>=101)
{
if(mask == ((1<<n)-1))
return dp[id][mask] = 1;
else
return dp[id][mask] = 0;
}
if(dp[id][mask] != -1)
return dp[id][mask];
ll ans = go(mask,id+1) %mod;
for(int i = 0;i<n;i++)
{
if(((mask&(1<<i)) == 0) && mpp[i].find(id) != mpp[i].end())
{
ans += go((mask| (1<<i)) ,id+1) %mod;
ans%= mod;
}
}
return dp[id][mask] = ans;
}
void solve() {
ll i, n, j, m, k, l, t;
cin >> n;
string s[n];
rep(i,0,n) cin >> s[i];
k=1;
rep(i,0,n)
if(s[i][0]=='O') k += (1LL<<(i+1));
cout << k;
return;
}
signed main()
{
ll test = 1;
//syncboost;
//cin>> test;
rep(testcase,1,test+1)
{
// cout<<"Case #"<<testcase<<": ";
solve();
//nl
}
//cerr<<"Time : "<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";
return 0;
}
|
#include "bits/stdc++.h"
#define FI first.first
#define SE first.second
#define TH second
#define fi first
#define se second
#define th second
using namespace std;
string to_string(const string& str) {
return str;
}
template<typename T>
string to_string(const set<T>& mys) {
if(mys.empty()) return "{}";
string ret = "{";
for(auto el: mys) ret += to_string(el) + ", ";
ret.pop_back(), ret.pop_back(); // Remove last space and comma
ret += "}";
return ret;
}
template<typename T>
string to_string(const pair<T, T>& pr) {
return "(" + to_string(pr.fi) + "," + to_string(pr.se) + ")";
}
template<typename T>
string to_string(const vector<T>& vc, int w) {
if(vc.empty()) return "";
if(w + 1 == vc.size()) return to_string(vc[w]);
return to_string(vc[w]) + "," + to_string(vc, w + 1);
}
template<typename T>
string to_string(const vector<T>& vc) {
return "{" + to_string(vc, 0) + "}";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef DEBUG
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
class DebugStream {}LOG;
template <typename T>DebugStream &operator<<(DebugStream &s, const T&) { return s; }
#ifdef DEBUG
#define LOG clog
#endif
typedef long long ll;
typedef pair<ll, ll> ii;
typedef long double ld;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e5 + 9, maxV = 1e6 + 9, MOD = 1e9 + 7, SQ = 335, lg = 20, bs = 29;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
vector<ll> arr(n);
for(auto& el: arr) cin >> el;
map<ll, ll> mp;
ll zer = 0, ans = 0;
for(int i = 0; i < n; i++) {
ll vl = arr[i];
if(i & 1) vl = -vl;
mp[zer]++;
zer -= vl;
ans += mp[zer];
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int N;
cin >> N;
string S, T;
cin >> S >> T;
int S_count_1 = 0; // Sに含まれる1の個数
int T_count_1 = 0;
deque <int> S_1; // 1がある位置 0-indexed
deque <int> T_1;
ll ans = 0; // 答えである、回数
rep(i,N){
if (S[i] == '1'){
S_count_1 ++;
S_1.push_back(i);
}
if (T[i] == '1'){
T_count_1 ++;
T_1.push_back(i);
}
}
if (S_count_1 < T_count_1 || ((S_count_1 - T_count_1) % 2 != 0) ){
cout << -1 << endl;
return 0;
}
rep(i,N){
if (S[i] == T[i]){
if (S[i] == '1') S_1.pop_front();
continue;
}
else if(S[i] == '0'){
if (S_1.empty()){
cout << -1 << endl;
return 0;
}
else{
ans += S_1.front() - i;
S[S_1.front()] = '0';
S[i] = '1';
S_1.pop_front();
}
}
else if(S[i] == '1'){
S_1.pop_front();
if (S_1.empty()){
cout << -1 << endl;
return 0;
}
else{
ans += S_1.front() - i;
S[S_1.front()] = '0';
S[i] = '0';
S_1.pop_front(); // 二回popする
}
}
// // デバッグ
// rep(j,N){
// cout << S[j];
// }
// cout << endl;
// cout << ans << endl;
// rep(j,S_1.size()){
// cout << S_1[j] << " ";
// }
// cout << endl;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using V = vector<int>;
int main()
{
int n, q;
string s;
cin >> n >> s >> q;
string sf = s.substr(0,n);
string sb = s.substr(n,2*n);
int flip = 0;
V t(q);
V a(q);
V b(q);
for (int i = 0; i < q; i++)
{
cin >> t[i] >> a[i] >> b[i];
}
for (int i = 0; i < q; i++)
{
if (t[i] == 2)
{
++flip;
}
else
{
if (flip%2==0)
{
if ((a[i]-1) / n == 1)
{
swap(sb[(a[i]-1)%n], sb[(b[i]-1)%n]);
}
else if ((b[i]-1) / n == 1)
{
swap(sf[(a[i]-1)%n], sb[(b[i]-1)%n]);
}
else
{
swap(sf[(a[i]-1)%n], sf[(b[i]-1)%n]);
}
}
else
{
if ((a[i]-1) / n == 1)
{
swap(sf[(a[i]-1)%n], sf[(b[i]-1)%n]);
}
else if ((b[i]-1) / n == 1)
{
swap(sb[(a[i]-1)%n], sf[(b[i]-1)%n]);
}
else
{
swap(sb[(a[i]-1)%n], sb[(b[i]-1)%n]);
}
}
}
}
string ans;
if (flip%2==0)
{
ans = sf + sb;
}
else
{
ans = sb + sf;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
/*-----------------------------------------------------------------------------------------*/
#define ll long long
#define ld long double
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define ub upper_bound
#define lb lower_bound
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define ff first
#define ss second
#define mp make_pair
#define pll pair<ll,ll>
#define fo(i,n) for(ll i=0;i<n;i++)
#define foa(i,s,e) for(ll i=(s);i<=e;i++)
#define fod(i,s,e) for(ll i= (s);i>=(e);i--)
#define deb(x) cerr<<#x<<' '<<'='<<' '<<x<<'\n'
#define sz(x) (ll)(x.size())
#define ANS cout<<ans<<'\n'
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define Yes cout<<"Yes\n"
#define No cout<<"No\n"
/*-----------------------------------------------------------------------------------------*/
#define fill(a,b) memset(a, b, sizeof(a))
#define setbits(x) __builtin_popcountll(x)
#define vout(v) for(auto &x : v){cout << x << " ";}
#define vin(v) for (auto &x : v){cin >> x;}
#define print2d(dp,n,m) fo(i, n){fo(j, m)cout<<dp[i][j]<<" ";cout<<"\n";}
/*-----------------------------------------------------------------------------------------*/
const ld pi = 3.14159265358979323846;
ll MOD = 1e9 + 7;
//ll MOD = 998244353;
const char nl = '\n';
const ll inf = 2000000000000000000;
/*-----------------------------------------------------------------------------------------*/
void kmax(ll &a, ll b){
if(b > a)a = b;
}
void kmin(ll &a, ll b){
if(b < a)a = b;
}
ll nxt(){ll x; cin >> x; return x;}
ll mul(ll x,ll y){
return (1ll* (x%MOD)*(y%MOD));
}
ll modpow(ll x,ll y){ll z=1;while(y>0){if(y%2)z=mul(z,x);x =mul(x,x) ;y/=2;}return z;}
ll power(ll x,ll y){ll z=1;while(y>0){if(y%2)z=z*x;x =x*x ;y/=2;}return z;}
ll gcd(ll a,ll b){if(a<b) return gcd(b,a);if(b==0) return a;return gcd(b,a%b);}
ll min(ll a,ll b){if(a<b)return a;return b;}
ll max(ll a,ll b){if(a>b)return a;return b;}
ll sq(ll a){
ll ans = (1ll*a*a);
return ans;
}
/*-----------------------------------------------------------------------------------------*/
// const ll N = 3e5 + 5;
// bitset<N> dp;
// void partition(vll &v){
// ll n = sz(v);
// fo(i, n){
// dp |= dp << v[i];
// }
// }
/*-----------------------------------------------------------------------------------------*/
void solve(){
ll n;
cin >> n;
string s;
cin >> s;
ll q;
cin >> q;
ll c = 0;
fo(i, q){
ll t, a, b;
cin >> t >> a >> b;
a--, b--;
if(t == 1){
if(c&1){
swap(s[(n+a)%(2*n)], s[(n+b)%(2*n)]);
} else {
swap(s[a], s[b]);
}
}
else{
c++;
}
}
fo(i, 2*n){
cout << s[((c&1)*n+i)%(2*n)];
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("inputf.txt" , "r" , stdin) ;
freopen("outputf.txt" , "w" , stdout) ;
freopen("error.txt" , "w" , stderr) ;
#endif
ll TC = 1;
//cin>>TC;
fo(TT, TC){
//cout << "Case #"<< TT + 1 << ": ";
solve();
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
}
|
#include <bits/stdc++.h>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll mod = pow(10, 9) + 7;
ll T;
cin >> T;
for (ll testcase = 0; testcase < T; ++testcase) {
ll N, A, B;
cin >> N >> A >> B;
if (A + B > N) {
cout << 0 << "\n";
continue;
}
if (A < B) {
swap(A, B);
}
ll num_a = (N - A + 1) * (N - A + 1) % mod;
ll num_b = (N - B + 1) * (N - B + 1) % mod;
ll ans = num_a * num_b % mod;
ll rev = ((((B - 1) * (B - 1) % mod) * (2 * A + B - 2 * N - 2) % mod) * (2 * A + B - 2 * N - 2)) % mod;
rev += ((B - 1) * (A - B + 1) % mod) * ((A - N - 1) * (2 * A + B - 2 * (N + 1)) % mod) * 2 % mod;
rev %= mod;
rev = (rev + ((N - A + 1) * (N - A + 1) % mod) * ((A - B + 1) * (A - B + 1) % mod) % mod) % mod;
ans -= rev;
if (ans < 0) {
ans += mod;
}
cout << ans << "\n";
}
}
| #include <iostream>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
const ll MAX = 2e5 + 1;
ll t;
ll power(ll x, ll p) {
ll ans = 1;
while (p) {
if (p & 1) {
ans = (ans * x) % mod;
p--;
}
x = (x * x) % mod;
p >>= 1;
}
return ans;
}
ll add(ll x, ll y) { return ((x % mod) + (y % mod)) % mod; }
ll mul(ll x, ll y) { return ((x % mod) * (y % mod)) % mod; }
ll sub(ll x, ll y) { return ((x % mod) - (y % mod) + mod) % mod; }
ll nC2(ll x) { return mul(mul(x, x - 1), power(2, mod - 2)); }
void Solve() {
ll n, a, b;
cin >> n >> a >> b;
if (a + b > n) {
cout << 0 << endl;
return;
}
ll tot = mul(mul(4, nC2(n - a - b + 2)), mul(n - a + 1, n - b + 1));
ll overlap = mul(4, mul(nC2(n - a - b + 2), nC2(n - a - b + 2)));
ll ans = sub(tot, overlap);
cout << ans << endl;
}
signed main() {
cin >> t;
while (t--) {
Solve();
}
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 3*1e5+2;
const int MOD = 998244353;
namespace numb{
vector<bool> isprime;
vector<int> fac,rfac,phi;
vector<vector<int>> prime_factors;
int add(int a,int b)
{
a+=b;
if(a>=MOD) a-=MOD;
return a;
}
int sub(int a,int b)
{
a-=b;
if(a<0) a+=MOD;
return a;
}
int mul(int a,int b)
{
return ((long long)a*b)%MOD;
}
int mpow(int a,int b)
{
int res=1;
while(b>0){
if(b&1)
res=mul(res,a);
a=mul(a,a);
b=b>>1LL;
}
return res;
}
int rev(int a)
{
return mpow(a,MOD-2);
}
void seive(int n)
{
isprime.resize(n+2,true);
isprime[0]=isprime[1]=false;
for(int i=2;i*i<=n;i++)
{
if(isprime[i])
{
for(int j=i*i;j<=n;j+=i)
{
isprime[j]=false;
}
}
}
}
void fact(int n)
{
fac.resize(n+2,0LL);
rfac.resize(n+2,0LL);
fac[0]=1;
for(int i=1;i<=n;i++)
{
fac[i]=mul(fac[i-1],i);
}
rfac[n]=rev(fac[n]);
for(int i=n-1;i>=0;i--)
{
rfac[i]=mul(rfac[i+1],i+1);
}
}
int ncr(int n,int r)
{
if(r>n) return 0;
int ans=mul(fac[n],mul(rfac[r],rfac[n-r]));
return ans;
}
int phii(int n) {
int result = n;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0)
n /= i;
result -= result / i;
}
}
if (n > 1)
result -= result / n;
return result;
}
void pre_phi(int n) {
phi.resize(n+2,0);
phi[0] = 0;
phi[1] = 1;
for (int i = 2; i <= n; i++)
phi[i] = i - 1;
for (int i = 2; i <= n; i++)
for (int j = 2 * i; j <= n; j += i)
phi[j] -= phi[i];
}
int gcd(int a,int b)
{
return b?gcd(b,a%b):a;
}
int gcd(int a, int b, int & x, int & y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
int x1, y1;
int d = gcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
bool find_any_solution(int a, int b, int c, int &x0, int &y0, int &g) {
g = gcd(abs(a), abs(b), x0, y0);
if (c % g) {
return false;
}
x0 *= c / g;
y0 *= c / g;
if (a < 0) x0 = -x0;
if (b < 0) y0 = -y0;
return true;
}
}
using namespace numb;
int fa[N];
int nck(int n,int k)
{
// cout<<n<<" "<<k<<" "<<fa[n]<<"\n";
// return 0;
return mul(fa[n],mul(rev(fa[k]),rev(fa[n-k])));
}
int32_t main(){
cin.tie(0)->sync_with_stdio(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n,k;
cin>>n>>k;
int a[n];
fa[0]=1;
for(int i=1;i<N;i++)
{
fa[i] = mul(fa[i-1],i);
}
for(int i=0;i<n;i++) cin>>a[i];
int ans[k+1],ans2[k+1];
for(int i=0;i<=k;i++){
int sum=0;
int sum2 =0 ;
for(int j=0;j<n;j++)
{
sum=add(sum,mpow(a[j],i));
sum2 = add(sum2,mpow(2*a[j],i));
}
ans2[i]=sum2;
ans[i] = sum;
// cout<<ans[i]<<" ";
}
// return 0;
int ann =0 ;
for(int x=1;x<=k;x++)
{
int an =0;
for(int o=0;o<=x;o++)
{
// cout<<nck(x,o)<<" "<<ans[o]<<" "<<ans[x-o]<<"\n";
// cout<<ans[o]<<"\n";
an=add(an,mul(nck(x,o),mul(ans[o],ans[x-o])));
}
an=sub(an,ans2[x]);
cout<<mul(an,rev(2))<<"\n";
// ann=add(ann,an);
}
// cout<<ann;
}
| #include <cstdio>
#include <cstring>
#include <algorithm>
const int p=998244353;
const int maxn=2e5+1;
#define int long long
#define rep(a,b,c) for(int a=b;a<=c;a++)
int n,k,a[maxn],sum[301],fac[301],inv[301],inv2=(1ll*p+1)/2,s[maxn],ans,tmp;
inline int ksm(int a,int b) { int ans=1,tmp=a; for(;b;b>>=1,(tmp*=tmp)%=p) if(b&1) (ans*=tmp)%=p; return ans; }
inline int C(int a,int b) {
return (((fac[a]*inv[b])%p)*inv[a-b])%p;
}
inline void solve() {
scanf("%lld %lld",&n,&k);
rep(i,1,n) scanf("%lld",&a[i]);
fac[0]=1; inv[0]=1;
rep(i,1,k) fac[i]=(fac[i-1]*i)%p,inv[i]=ksm(fac[i],p-2);
rep(x,0,k) {
if(!x) rep(i,1,n) s[i]=1;
else rep(i,1,n) (s[i]*=a[i])%=p;
sum[x]=0;
rep(i,1,n) (sum[x]+=s[i])%=p;
}
rep(x,1,k) {
ans=0;
rep(i,0,x) {
tmp=0; tmp+=(sum[i]*sum[x-i]); tmp%=p; tmp-=sum[x]; (tmp+=p)%=p; (tmp*=inv2)%=p;
(ans+=(tmp*C(x,i)))%=p;
}
printf("%lld\n",ans);
}
}
signed main() {
//int TEST; scanf("%d",&TEST); while(TEST--)
solve();
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve(){
int T; cin >> T;
while(T--){
ll N; cin >> N;
if(N & 1){
cout << "Odd\n";
} else{
if((N / 2) & 1) cout << "Same\n";
else cout << "Even\n";
}
}
}
int main(){
ios_base::sync_with_stdio(false), cin.tie(nullptr);
solve();
return 0;
}
| #include <stdio.h>
#include <algorithm>
#include <tuple>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int bits[400001];
void add(int index, int value) {
for (int i = index; i <= 400000; i += i & -i)
bits[i] += value;
}
int sum(int index) {
int res = 0;
for (int i = index; 0 < i; i -= i & -i)
res += bits[i];
return res;
}
int n, a[310000];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", a + i), a[i]++;
ll t = 0;
for (int i = 1; i <= n; i++) {
t += sum(n) - sum(a[i]);
add(a[i], 1);
}
for (int i = 1; i <= n; i++) {
printf("%lld\n", t);
t += (n - a[i]);
t -= (a[i] - 1);
}
} |
#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cout << x;}
void __print(long x) {cout << x;}
void __print(long long x) {cout << x;}
void __print(unsigned x) {cout << x;}
void __print(unsigned long x) {cout << x;}
void __print(unsigned long long x) {cout << x;}
void __print(float x) {cout << x;}
void __print(double x) {cout << x;}
void __print(long double x) {cout << x;}
void __print(char x) {cout << '\'' << x << '\'';}
void __print(const char *x) {cout << '\"' << x << '\"';}
void __print(const string &x) {cout << '\"' << x << '\"';}
void __print(bool x) {cout << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cout << '{'; for (auto &i: x) cout << (f++ ? "," : ""), __print(i); cout << "}";}
void _print() {cout << "\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cout << ", "; _print(v...);}
#define debug(x...) cout << #x << " = "; _print(x)
typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll;
#define rep(i,a,b) for (ll i = (a); i < (b); ++i)
#define per(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define all(x) begin(x), end(x)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define fast ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL)
const int mod = 1e9 + 7, mxn = 1e5 + 1;
int solve(){
ll n;
cin>> n;
ll l = 1, r = 1e10;
// <=
while(l < r){
ll mid = (l + r) / 2;
ll sum = (mid * (mid + 1ll)) / 2ll;
if(sum <= n + 1)
l = mid + 1;
else
r = mid;
}
cout<< n - (l - 1ll) + 1ll<< "\n";
return 0;
}
//Counting problems: Sometimes easier to find complement of the answer
int main()
{
fast;
int t = 1;
// cin>> t;
while(t--){
solve();
}
return 0;
}
//v.clear(), vis.clear(); vis.resize(n + 1, 0), v.resize(n + 1);
/* inv[1] = 1; // inv is ll
for(int i=2; i<=mxn; ++i)
inv[i]=mod-mod/i*inv[mod%i]%mod;*/
// lower bound >=
// upper bound >
// vector<int>().swap(vec); //free memory from vec
| // --------------------------------------------------<C++ TEMPLATE>------------------------------------------------
/**
* Nitin Gangwar
* @wargang (codechef,codeforces,spoj,atcoder)
* MNNIT allahabad
* CSE'23
* [email protected]
**/
#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;
// MACROS
#define int long long
#define mp make_pair
#define pb push_back
#define MAX 1e17
#define MIN -1e17
#define PI 3.1415926535897932384626433832795
#define mod 1000000007
#define set(x) memset(x, 0, sizeof(x))
#define clr(x) memset(x, -1, sizeof(x))
#define ff first
#define ss second
#define rep(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
#define sz(x) x.size()
#define endl "\n"
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define all(x) x.begin(), x.end()
#define lb(a,x) lower_bound(all(a),x)
#define ub(a,x) upper_bound(all(a),x)
typedef priority_queue<int> maxHeap;
typedef priority_queue<int, vector<int>, greater<int>> minHeap;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
template<typename T, typename T1>T amax(T &a, T1 b) {if (b > a)a = b; return a;}
template<typename T, typename T1>T amin(T &a, T1 b) {if (b < a)a = b; return a;}
// typedef long int ld;
// typedef unsigned long int lu;
// typedef long long int ll;
// typedef unsigned long long int llu;
// cout << fixed << setprecision(9) <<
int mpow(int base, int exp);
const int T2 = 105; const int T3 = 1005; const int T4 = 10005; const int T5 = 100005;
const int N = 3e5;
int arr[N], brr[N];
void solve() {
int n;
cin >> n;
int sum = 0;
rep(i, n) cin >> arr[i];
rep(i, n) cin >> brr[i];
rep(i, n) sum += arr[i] * brr[i];
if (sum == 0) cout << "Yes\n";
else
cout << "No\n";
}
/* TIPS
1. for interactive prob remove fastio and endl
2. for vector pass as reference
3.
*/
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((int)result * base) % mod;
base = ((int)base * base) % mod;
exp >>= 1;
}
return result;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
if (a == b)
ans = c;
if (a == c)
ans = b;
if (b == c)
ans = a;
cout << ans << "\n";
}
| #include <iostream>
#include <string.h>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <cmath>
#include <stdio.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define TEN5 100005
#define TEN6 1000005
#define PI 3.1415926
#define pb(x) push_back(x)
#define ALL(x) x.begin(),x.end()
#define mkpr(x1,x2) make_pair(x1,x2)
#define FOR(i,start,end) for(int i = (start);i < (end);i++)
#define FORE(i,start,end) for(int i = (start);i <= (end);i++)
#define IFOR(i,start,end) for(int i = (start);i > (end);i--)
#define IFORE(i,start,end) for(int i = (start);i >= (end);i--)
#define _debug 1
#if _debug
#endif // _debug
typedef long long int ll;
typedef unsigned long long int ull;
ll num[TEN5];
vector<pair<ll,ll>> vpll;
//__builtin_popcount() calculate 1's number in n
int main(void)
{
ll m,n,o;
cin>>m>>n>>o;
if(m==n) cout<<o;
else if(m==o) cout<<n;
else if(n==o) cout<<m;
else cout<<0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector< int64_t > divisor(int64_t n) {
vector< int64_t > ret;
for(int64_t i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main()
{
int a, b;
cin >> a >> b;
vector<int> c(b + 10, 0);
for (int i = a; i <= b; i++)
{
vector<int64_t> d = divisor(i);
for (int j = 0; j < d.size(); j++)
{
c[d[j]]++;
}
}
for (int i = b; i >= 0; i--)
{
if(c[i] >= 2)
{
cout << i << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using P=pair<ll,ll>;
const ll INF=1e18;
const int mod=998244353;
struct mint {
ll x;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
mint operator+(const mint a) const { return mint(*this) += a;}
mint operator-(const mint a) const { return mint(*this) -= a;}
mint operator*(const mint a) const { return mint(*this) *= a;}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
mint inv() const { return pow(mod-2);}
mint& operator/=(const mint a) { return *this *= a.inv();}
mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
struct combination {
vector<mint> fact, ifact;
combination(int n):fact(n+1),ifact(n+1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n) return 0;
return fact[n]*ifact[k]*ifact[n-k];
}
} c(200005);
int main(){
int n,m;
cin>>n>>m;
vector<mint>dp(m+1);
dp[0]=1;
for(int i=2;i<=m;i+=2){
for(int j=0;j*2<=n;j++){
if(i/2-j<0){continue;}
dp[i]+=c(n,2*j)*dp[i/2-j];
}
}
cout<<dp[m]<<endl;
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int k;
int i;
unsigned long n;
cin >> n >> k;
for (i = 1; i <= k; i++) {
if (n % 200 == 0) {
n = n / 200;
}
else {
if (i <= k - 2) {
n = n * (unsigned long)5 + (unsigned long)1;
i++;
}
else {
n = n * (unsigned long)1000 + (unsigned long)200;
}
}
}
cout << n << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;
//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
//const int mod = 998244353;
signed main(){
int N, K; cin >> N >> K;
REP(_, K){
if(N % 200 == 0) N /= 200;
else N = N * 1000 + 200;
}
Out(N);
return 0;
}
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
int const MOD=1000000007ll;
int n,a[233333],fp,fs,gp,gs;
signed main(){
ios::sync_with_stdio(0);
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
fs=a[1];gs=1;
for(int i=2;i<=n;i++){
int pgs=gs,pgp=gp,pfp=fp,pfs=fs;
gs=(pgs+pgp)%MOD;
gp=pgs;
fs=(pfs+pfp+gs*a[i]%MOD)%MOD;
fp=(pfs-gp*a[i]%MOD+MOD)%MOD;
}
cout<<(fp+fs)%MOD<<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 = 1e5+7,MOD = 1e9+7;
int a[N],f[N][2],c[N][2];
int main()
{
int n;scanf("%d",&n);
forn(i,1,n) scanf("%d",&a[i]);
f[1][0] = a[1];
c[2][0] = 1;c[2][1] = 1;
forn(i,3,n) c[i][0] = (c[i - 1][0] + c[i - 1][1]) % MOD,c[i][1] = c[i - 1][0];
forn(i,2,n)
{
f[i][0] = (1ll * f[i - 1][0] + f[i - 1][1] + 1ll * c[i][0] * a[i] % MOD) % MOD;
f[i][1] = ((f[i - 1][0] - 1ll * c[i][1] * a[i] % MOD) % MOD + MOD) % MOD;
}
printf("%d\n",((f[n][0] + f[n][1]) % MOD + MOD) % MOD);
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define For(i,k,j) for(int i=(k);i<=(j);i++)
#define Foe(i,u) for(int i=lst[u],v=e[i].v;i;i=e[i].nxt,v=e[i].v)
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define Fin(s) freopen(s,"r",stdin)
#define Fout(s) freopen(s,"w",stdout)
#define file(s) Fin(s".in"),Fout(s".out")
#define INF ((1<<30)-1)
#define int long long
const int P=1e9+7; //
using namespace std;
template<typename T>inline void ckmax(T &a,T b) {(a<b)&&(a=b);}
template<typename T>inline void ckmin(T &a,T b) {(a>b)&&(a=b);}
inline int mul(int a,int b) {return 1ull*a*b%P;}
inline int add(int a,int b) {return a+b>=P?a+b-P:a+b;}
inline int sub(int a,int b) {return a-b>=0?a-b:a-b+P;}
inline void mulmod(int &a,int b) {a=mul(a, b);}
inline void addmod(int &a,int b) {((a+=b)>=P)&&(a-=P);}
inline void submod(int &a,int b) {((a-=b)<0)&&(a+=P);}
inline int ksm(int a,int b) {int ans=1; for(;b;b>>=1) {if(b&1) ans=1ll*ans*a%P;a=1ll*a*a%P;}return ans;}
inline void fprint(const int &x,char c=' ') {fprintf(stderr,"%d%c",x,c);}
inline void fprint(const pii &x,char c='\n') {fprintf(stderr,"%d %d%c",x.first,x.second,c);}
inline void fprint(const int *f,const int &n,char c='\n') {for(int i=1;i<=n;i++) fprint(f[i]); fprintf(stderr,"%c",c);}
inline void fprint(const vector<int> &f,char c='\n') {for(int i=0;i<(int)f.size();i++) fprint(f[i]); fprintf(stderr,"%c",c);}
inline int inv(int a) {return ksm(a,P-2);}
namespace FastIO {
const int SIZE=1<<16; char buf[SIZE],obuf[SIZE],str[64]; int bi=SIZE,bn=SIZE,opt;
int read(char *s) {
while (bn) {for (;bi<bn&&buf[bi]<=' ';bi++);if (bi<bn) break; bn=fread(buf,1,SIZE,stdin),bi=0;}
int sn=0;while (bn) {for (;bi<bn&&buf[bi]>' ';bi++) s[sn++]=buf[bi];if (bi<bn) break; bn=fread(buf,1,SIZE,stdin),bi=0;}s[sn]=0;return sn;
}
bool read(int& x) {if(x)x=0;int bf=0,n=read(str); if(!n) return 0; int i=0; if (str[i]=='-') bf=1,i=1; for(x=0;i<n;i++) x=x*10+str[i]-'0'; if(bf) x=-x; return 1;}
void write(int x) {
if(!x) obuf[opt++]='0'; else {if(x<0) obuf[opt++]='-',x=-x;int sn=0; while(x)str[sn++]=x%10+'0',x/=10;for (int i=sn-1;i>=0;i--) obuf[opt++]=str[i];}
if (opt>=(SIZE>>1)){fwrite(obuf,1,opt,stdout); opt=0;}
}
void write(char x) {obuf[opt++]=x;if (opt>=(SIZE>>1)){fwrite(obuf,1,opt,stdout); opt=0;}}
void Fflush() {if (opt) fwrite(obuf,1,opt,stdout); opt=0;}
};
inline int read() {int x; FI(x); return x;}
const int MN=5e5+5;
int n,a[MN],sum[MN];
signed main() {
#ifndef ONLINE_JUDGE
freopen("pro.in","r",stdin);
freopen("pro.out","w",stdout);
#endif
n=read();
For(i,1,n) a[i]=read();
sort(a+1,a+1+n);
sum[n+1]=0; For(i,1,n) sum[i]=a[i]+sum[i-1];
int ans=1e18;
For(i,1,n) {
int now=(sum[n]-sum[i]-(n-i)*a[i])*2+n*a[i];
// cerr<<i<<' '<<now<<endl;
if(ans>now) ans=now;
}
printf("%.10lf\n",0.5*ans/n);
return FastIO::Fflush(),0;
}
| #include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
using i32 = int32_t;
using i64 = int64_t;
using f64 = double;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
//using namespace harudake;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
i64 n;
cin>>n;
vi64 a(n);
rep(i,n)cin>>a[i];
sort(all(a));
i64 sum = 0;
i64 h = (n+1)/2;
i64 x2 = a[h-1];
rep2(i,h,n) {
sum += a[i] - x2;
}
double ans = x2 / 2.0;
ans += sum / double(n);
cout<<fixed<<setprecision(10)<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
float V, T, S, D;
scanf("%f %f %f %f", &V, &T, &S, &D);
float s = D / V;
if ((T <= s) & (s <= S)) {
printf("No");
}
else {
printf("Yes");
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
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
int t=1;
//cin>>t;
while(t--)
{
int n;
cin>>n;
if(n%2) cout<<"Black";
else cout<<"White";
}
}
|
#include <bits/stdc++.h> // Tomasz Nowak
using namespace std; // University of Warsaw
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int((x).size())
template<class A, class B> auto& operator<<(ostream &o, pair<A, B> p) {
return o << '(' << p.first << ", " << p.second << ')';
}
template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
o << '{'; int i = 0; for(auto e : x) o << (", ")+2*!i++ << e; return o << '}';
}
#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#else
#define debug(...) {}
#endif
int main() {
cin.tie(0)->sync_with_stdio(0);
int n;
string s;
cin >> n >> s;
vector<int> a(n + 1);
for(int &ai : a)
cin >> ai;
auto good = [&](int i, int vali, int valip1) {
if(s[i] == '<')
return vali < valip1;
else
return vali > valip1;
};
auto get_b = [&](int k) {
vector<vector<int>> b;
REP(j, k) {
vector<int> row;
REP(i, n + 1) {
row.emplace_back(a[i] / k + bool((a[i] % k) > j));
if(i > 0 and not good(i - 1, row[i - 1], row[i]))
return vector<vector<int>>();
}
b.emplace_back(row);
}
REP(j, k)
debug(k, b[j]);
return b;
};
int mx = *max_element(a.begin(), a.end());
for(int j = mx; j >= 1; --j) {
auto b = get_b(j);
if(ssize(b) == 0)
continue;
cout << j << '\n';
#ifndef DEBUG
for(auto &v : b) {
for(int vi : v)
cout << vi << ' ';
cout << '\n';
}
#endif
return 0;
}
}
| #include <bits/stdc++.h>
#define Rep(i,n,m) for(int i=(int)(n);i<(int)(m);i++)
#define rep(i,n) Rep(i,0,n)
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define _GLIBCXX_DEBUG
int main(){
int N;cin>>N;
string S;cin>>S;S+="<<";
vector<int> a(N+1); rep(i,N+1) cin >> a[i];
int k=10010;
rep(i,N) k=min(abs(a[i]-a[i+1]),k);
cout << k << endl;
rep(j,k){
vi b(N+1);
rep(i,N+1){
b[i]=(a[i]+j)/k;
}
rep(i,N+1){
cout << b[i];
if(i<N+1-1) cout << ' ';
else cout << endl;
}
}
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using T = tuple<int,int,int>;
using P = pair<int,int>;
const ll SEG_LEN = (1 << 20);
ll seg[SEG_LEN * 2];
void update(ll ind, ll val){
ind += SEG_LEN;
bitset<30> VAL(val);
bitset<30> leaf(seg[ind]);
auto nleaf = VAL ^ leaf;
seg[ind] = nleaf.to_ullong();
while (1){
//cout << seg[ind] << " ";
ind /= 2;
if (ind == 0) break;
bitset<30> r(seg[ind * 2]);
bitset<30> l(seg[ind * 2 + 1]);
auto cur = r ^ l;
seg[ind] = cur.to_ullong();
}
// cout << endl;
}
ll XOR(int ql, int qr, int sl = 0, int sr = 1 << 20, int pos = 1){
//被らない
if (qr <= sl || sr <= ql) return 0;
//完全に包まれる
if (ql <= sl && sr <= qr) return seg[pos];
//部分的に被る
int sm = (sl + sr) / 2;
ll left = XOR(ql, qr, sl, sm, pos * 2);
ll right = XOR(ql, qr, sm, sr, pos * 2 + 1);
bitset<30> L(left);
bitset<30> R(right);
auto x = L ^ R;
return x.to_ullong();
}
int main(){
int n, q;
cin >> n >> q;
rep(i,n) {
ll ai;
cin >> ai;
update(i, ai);
}
// for (auto ele : seg){
// cout << ele << endl;
// }
rep(i,q){
int ti, xi, yi;
cin >> ti >> xi >> yi;
if (ti == 1) update(xi-1, yi);
if (ti == 2) {
ll ans = XOR(xi-1, yi);
cout << ans << endl;
}
}
// for (auto ele : seg){
// cout << ele << endl;
// }
}
| #include <bits/stdc++.h>
using namespace std;
int PREP = (cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12), 0);
//int SEGV = getenv("D") || (exit(system("D= SEGFAULT_SIGNALS=all catchsegv ./prog.exe") >> 8), 0);
using Int = long long;
struct SegTree {
int N;
vector<int> A;
SegTree(int n) {
N = 1;
while (N < n) N *= 2;
A.resize(2 * N);
}
void add(int idx, int val) {
idx += N;
A[idx] ^= val;
idx >>= 1;
while (idx > 0) {
A[idx] = A[2*idx+0] ^ A[2*idx+1];
idx >>= 1;
}
}
int get(int L, int R) {
int ans = 0;
L += N, R += N;
while (L < R) {
if (L & 1) ans ^= A[L++];
if (R & 1) ans ^= A[--R];
L >>= 1;
R >>= 1;
}
return ans;
}
};
int main() {
int N, Q; cin >> N >> Q;
vector<int> A(N); for (auto &a : A) cin >> a;
SegTree st(N);
for (int i = 0; i < N; i++) {
st.add(i, A[i]);
}
for (int i = 0; i < Q; i++) {
int T, X, Y; cin >> T >> X >> Y;
if (T == 1) {
st.add(X - 1, Y);
} else {
cout << st.get(X - 1, Y) << '\n';
}
}
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
const int IM = 2e9;
int dat[400004];
const int CM = 1 << 17, CL = 12;
char cn[CM + CL], * ci = cn + CM + CL, * owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
ll tmp = *(ll*)ci;
if ((tmp & ma0) ^ ma0) {
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += (72 - dig >> 3);
}
else {
tmp = tmp & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += 8;
if ((ct = *ci++) >= '0') {
tmp = tmp * 10 + ct - '0';
if (*ci++ == '0') {
tmp = tmp * 10;
ci++;
}
}
}
return tmp;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N = getint();
dat[0] = -IM;
ll kotae = -IM * ll(N);
for (int i = N + 1; i > 1; i--) {
dat[i] = getint();
kotae += dat[i];
}
for (int i = 2; i < N + 2; i++) {
int p = 2 + (dat[2] > dat[3]);
int v = dat[i] - IM;
while (v > dat[p]) {
dat[p >> 1] = dat[p];
p <<= 1;
p += dat[p] > dat[p + 1];
}
dat[p >> 1] = v;
int a = getint();
kotae += a;
p = i;
v = a - IM;
while (v < dat[p >> 1]) dat[p] = dat[p >> 1], p >>= 1;
dat[p] = v;
kotae -= dat[1];
}
co(kotae);
Would you please 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 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 rev(x) reverse(x);
using ll=long long;
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));
}
int main(){
ll n;cin >> n;
vl a(n),b(n);rep(i,n)cin >> a[i];rep(i,n)cin >> b[i];rev(all(a));
priority_queue<ll,vl,greater<ll>> que;
ll sum=accumulate(all(a),0LL)+accumulate(all(b),0LL);
ll ans=0;
rep(i,n){
que.push(a[i]);que.push(b[i]);
ans+=que.top();que.pop();
}
cout << sum-ans <<endl;
} |
#include <iostream>
#include <vector>
#include <unordered_map>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <bits/stdc++.h>
using namespace std;
using p = pair<int,int>;
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int32_t N;
cin >> N;
int64_t X = (1 << N);
N = X/2;
vector<p> A(N);
vector<p> B(N);
for (int i=0; i < N; i++) {
cin >> A[i].first;
A[i].second = i+1;
}
for (int i=0; i < N; i++) {
cin >> B[i].first;
B[i].second = i+N+1;
}
sort(A.begin(), A.end());
sort(B.begin(), B.end());
int res = 0;
if (A[N-1].first < B[N-1].first) {
res = A[N-1].second;
} else {
res = B[N-1].second;
}
cout << res << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define endl "\n"
#define int long long int
int number=1,number1;
void solve()
{
vector<pair<int,int>> vec;
int n;
cin>>n;
for(int i=1;i<=pow(2,n);i++)
{
cin>>number;
vec.push_back({number,i});
}
while(vec.size()>2)
{
vector<pair<int,int>> vec1;
for(int i=0;i<vec.size()-1;i=i+2)
{
if(vec[i].first>vec[i+1].first)
{
vec1.push_back(vec[i]);
}
else
{
vec1.push_back(vec[i+1]);
}
}
vec=vec1;
}
if(vec[0].first<vec[1].first)cout<<vec[0].second<<endl;
else cout<<vec[1].second<<endl;
vec.clear();
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("Input.txt", "r", stdin);
// for writing output to output.txt
freopen("Output.txt", "w", stdout);
#endif
int t=1;
//cin >> t;
while (t > 0)
{
solve();
--t;
}
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
int N; cin >> N;
ll K; cin >> K;
vector<pair<ll,ll>> A(N);
rep(i,N) cin >> A[i].first >> A[i].second;
sort(A.begin(),A.end());
for(auto a : A){
if(K < a.first) break;
K += a.second;
}
cout << K << "\n";
return 0;
}
struct ios_do_not_sync{
ios_do_not_sync(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
} ios_do_not_sync_instance;
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int n,k;
map<int,int>m;
int a[200005],b[200005];
set<int>s;
signed main()
{
scanf("%lld %lld",&n,&k);
for(int i=0;i<n;i++)
{
scanf("%lld %lld",&a[i],&b[i]);
m[a[i]]+=b[i];
s.insert(a[i]);
}
set<int>::iterator it=s.begin();
int t=0;
while(k)
{
if(it==s.end())
{
t+=k;
break;
}
k-=(*it-t);
if(k>=0)
{
k+=m[*it];
t=*it;
it++;
}
else
{
k+=(*it-t);
t+=k;
break;
}
}
printf("%lld\n",t);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
typedef long long int ll;
typedef long double ld;
const int inf = 1e8;
const ll llinf = 1e18;
const double PI = acos(-1);
#define yes "Yes"
#define no "No"
#define all(n) n.begin(), n.end()
using Graph = vector<vector<int>>;
vector<int> visited(false);
ll ans = 0;
void dfs(const Graph &G, int v) {
visited[v] = true;
for (auto next : G[v]) {
if (visited[next]) continue;
ans++;
dfs(G, next);
}
}
int main() {
int n, m;
cin >> n >> m;
Graph g(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
}
rep(i, n) {
visited.assign(n, 0);
dfs(g, i);
}
cout << ans + n << endl;
// cout << fixed << setprecision(9) << ans << endl;
}
| #include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
typedef struct edge{
int to;
int cost;
}Edge;
typedef pair<int,int> P;
long long INF=250000010;
int V;
vector<Edge> G[1000000];
long long d[1000000];
void dijkstra(int s){
priority_queue<P,vector<P>,greater<P>> que;
fill(d,d+V,INF);
d[s]=0;
que.push(P(0,s));
while(!que.empty()){
P p=que.top();que.pop();
int v=p.second;
if(d[v]<p.first)continue;
for(unsigned int i=0;i<G[v].size();i++){
Edge e=G[v][i];
if(d[e.to]>d[v]+e.cost){
d[e.to]=d[v]+e.cost;
que.push(P(d[e.to],e.to));
}
}
}
}
int main(){
int R,C;
cin>>R>>C;
V=R*C*2;
vector<vector<int>> A,B;
for(int i=0;i<R;i++){
vector<int>tmp(C-1);
for(int j=0;j<C-1;j++)cin>>tmp.at(j);
A.push_back(tmp);
}
for(int i=0;i<R-1;i++){
vector<int>tmp(C);
for(int j=0;j<C;j++)cin>>tmp.at(j);
B.push_back(tmp);
}
int q=R*C;
for(int i=0;i<R;i++){
for(int j=0;j<C;j++){
if(j<C-1){
G[C*i+j].push_back({C*i+j+1,A.at(i).at(j)});
}
if(j>0){
G[C*i+j].push_back({C*i+j-1,A.at(i).at(j-1)});
}
if(i<R-1){
G[C*i+j].push_back({C*(i+1)+j,B.at(i).at(j)});
}
G[C*i+j].push_back({q+C*i+j,1});
G[q+C*i+j].push_back({C*i+j,0});
if(i>0){
G[q+C*i+j].push_back({q+C*(i-1)+j,1});
}
}
}
dijkstra(0);
printf("%d\n",d[R*C-1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define debug(args...) (Debugger()), args
class Debugger {
public:
Debugger(const std::string &_separator = " => ") : first(true), separator(_separator) {}
template <typename ObjectType>
Debugger &operator,(const ObjectType &v) {
if (!first)
cerr << separator;
cerr << v;
first = false;
return *this;
}
~Debugger() {
cerr << endl;
}
private:
bool first;
string separator;
};
#define debug_var(x) debug(#x, x)
template <class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(container) container.begin(), container.end()
#define rall(container) container.rbegin(), container.rend()
#define forin(it, container) for (auto it = container.begin(); it != container.end(); it++)
#define rforin(it, container) for (auto it = container.rbegin(); it != container.rend(); it++)
typedef long l;
typedef long long ll;
typedef pair<int, int> ipi;
typedef pair<ll, ll> lpl;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
#define MOD 1'000'000'007
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll xpow(ll a, ll b, ll m) {
ll res = 1;
while (b > 0) {
if (b & 1) {
res = (res * a) % m;
}
a = (a * a) % m;
b /= 2;
}
return res;
}
ll xmul(ll a, ll b, ll m) {
ll res = 0;
ll v = 1, k;
while (b > 0) {
if (b & 1) {
k = (a * v) % m;
res = (res + k) % m;
}
v = (v * 2) % m;
b /= 2;
}
return res;
}
int main() {
int n;
ll ans = LONG_LONG_MAX;
ll a, p, x;
cin >> n;
rep(i, 0, n) {
cin >> a >> p >> x;
if (x > a) {
chmin(ans, p);
}
}
cout << (ans == LONG_LONG_MAX ? -1 : ans);
return 0;
}
| #include <bits/stdc++.h>
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>
*/
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define rrep(i,a,b) for(ll i=a;i>=b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define PI 3.14159265358979323846
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const ll INF = 1e18+10;
const ll mod = 1e9 + 7;
const ll MAXN = 6e6+100;
ll poww(ll a, ll b) {
if(b<0) return 0LL;
ll ans = 1;
while (b) {
if (b & 1)ans = ans * a;
a = a * a;
b >>= 1;
}
return ans;
}
ll binpow(ll a, ll b)
{
if (b < 0) return 0LL;
if (a <= 0)return 0LL;
a %= mod;
ll ans = 1LL;
while (b) {
if (b & 1)ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
ll modinv(ll n) {
return binpow(n, mod - 2);
}
const ll A = 30;
ll dp[A+10][A+10];
ll recur(ll a, ll b) {
if(dp[a][b]!=-1) return dp[a][b];
dp[a][b] = recur(a-1,b) + recur(a,b-1);
return dp[a][b];
}
void solve() {
ll a,b,k; cin>>a>>b>>k;
FOR(i,A+1) {
FOR(j,A+1) dp[i][j] = -1;
}
dp[0][0] = 1;
for(ll i=0; i<=A; i++) dp[i][0] = 1;
for(ll i=0; i<=A; i++) dp[0][i] = 1;
recur(A,A);
ll rem = k, ua = a, ub = b;
string s = "";
while(rem>0) {
for(ll i=ua; i>=0; i--) {
if(dp[i][ub]<rem) {
rem -= dp[i][ub];
FOR(j,ua-i-1) s += 'a';
s += 'b';
ua = i+1; ub--;
break;
}
else if(dp[i][ub]==rem) {
FOR(j,ua-i) s += 'a';
FOR(j,ub) s += 'b';
FOR(j,i) s += 'a';
rem = 0;
break;
}
}
}
cout<<s;
}
int main() {
IOS;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
//ll no_of_test_cases; cin>>no_of_test_cases;
ll no_of_test_cases = 1;
//cout<<fixed<<setprecision(10);
for(ll i=1; i<=no_of_test_cases; i++) {
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define pb push_back
#define fi first
#define se second
#define endl "\n"
#define all(v) v.begin(), v.end()
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPII;
typedef vector<VI> VVI;
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void yes(bool t = 1) { cout << yesno[t] << endl; }
const int mxN = 2e5 + 5;
int n,m;
int a[mxN],b[mxN];
string s;
void code()
{
cin>>n;
/*
1 2
o o nope
e e tick
e o if(hun>1 && hun%2==0)
o e nope
*/
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s; cin>>s;
for(int i=0;i<s.length();i++){
if(s[i]=='.'){
return 0;
}
cout<<s[i];
}
} | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// Policy based data structure
// template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long int
#define pii pair<ll,ll>
#define rep(i,st,en) for(ll i=st;i<en;i++)
#define vi vector<ll>
#define vii vector<pii>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define eb emplace_back
#define yes cout<<"YES"<<endl; return;
#define no cout<<"NO"<<endl; return;
#define flus fflush(stdout);
#define gin(x) cerr<<#x<<" : "<<x<<" ";
#define fin cerr<<endl;
#define F first
#define S second
#define np next_permutation
#define inf 1e18
#define mod 1000000007
#define N 200009
#define PI 3.14159265358979323846
#define minpq priority_queue <ll, vector<ll>, greater<ll>>
#define maxpq priority_queue<ll>
void sout(){
cout<<endl;
}
template <typename T,typename... Types>
void sout(T var1,Types... var2){
cout<<var1<<" ";
sout(var2...);
}
void solve(){
string x;
cin>>x;
string ans;
for(int i=0; i<x.length(); i++) {
if(x[i] == '.')
break;
ans += x[i];
}
cout<<ans;
return;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
clock_t t1=clock();
int t;
// cin>>t;
t=1;
while(t--){
solve();
}
cerr<<"Time elapsed: "<<(double)(clock()-t1)/1000<<" s"<<endl;
} |
#include<bits/stdc++.h>
const int N=200010,mod=1e9+7;
char s[N];
int c[N],fac[N],f[17][N],n,KK,a[17],cnt,g[N][17],C[17][17];
int qp(int x,int y)
{
int ans=1;
for(;y;y >>=1,x=1ll*x*x%mod)
if(y&1)ans=1ll*ans*x%mod;
return ans;
}
void ins(int x)
{
if(!a[x]++)cnt++;
}
void eras(int x)
{
if(!--a[x])
cnt--;
}
int main()
{
scanf("%s",s+1),n=strlen(s+1);
scanf("%d",&KK);
for(int i=0;i<=16;i++)
C[i][0]=C[i][i]=1;
for(int i=1;i<=16;i++)
for(int j=1;j<i;j++)
C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
for(int i=fac[0]=1;i<=16;i++)
fac[i]=1ll*fac[i-1]*i%mod;
g[0][0]=1;
for(int i=1;i<=n;i++)
for(int j=1;j<=i&&j<=16;j++)
g[i][j]=(1ll*j*g[i-1][j]+g[i-1][j-1])%mod;
f[KK][n+1]=1;
for(int j=0;j<=KK;j++)
for(int i=n;i;i--)
for(int k=0;k<=j;k++)
f[j][i]=(f[j][i]+1ll*C[16-j][KK-j]*C[j][k]%mod*g[n-i+1][KK-j+k]%mod*fac[KK-j+k])%mod;
for(int i=1;i<=n;i++)
c[i]=(isdigit(s[i])?s[i]-'0':s[i]-'A'+10);
int ans=0;
for(int i=1;i<=n;ins(c[i++]))
for(int j=i==1;j<=c[i]-(i!=n);j++)
ins(j),ans=(ans+f[cnt][i+1])%mod,eras(j);
for(int i=2;i<=n;i++)ans=(ans+1ll*f[1][i+1]*15)%mod;
printf("%d\n",ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+50;
const int mod=1e9+7;
char s[N];
int k;
int dig[N];
// 低i位满足有k个不同数位的数字个数
ll dp[N][22];
void print(int x){
if(x){
print(x/2);
}
printf("%d",x%2);
}
ll dfs(int idx,int sta,int dif,bool lead,bool limit){
if(idx==-1){
// 一个合法数字(这题要排除含前导零的数)，有时候要单独考虑0的情况
// 其实我觉得前导零的命名有点误导性，其实lead为true就是表示现在搜索的前缀是一串0
if(dif==k && !lead){
return 1;
}else{
return 0;
}
}
// 记忆化的都是无上限的
if(!limit && dp[idx][dif]!=-1){
return dp[idx][dif];
}
// 这一位的枚举上限
int up=limit?dig[idx]:15;
ll ans=0;
for(int i=0;i<=up;i++){
if(lead && i==0 || (sta>>i)&1){
ans+=dfs(idx-1,sta,dif,lead && i==0,limit && i==up);
}else{
ans+=dfs(idx-1,sta|(1<<i),dif+1,lead && i==0,limit && i==up);
}
ans%=mod;
}
if(!limit){
dp[idx][dif]=ans%mod;
}
return ans%mod;
}
int main(){
scanf("%s %d",s,&k);
int n=strlen(s);
for(int i=n-1;i>=0;i--){
if(s[i]>='A'){
dig[n-1-i]=s[i]-'A'+10;
}else{
dig[n-1-i]=s[i]-'0';
}
}
memset(dp,-1,sizeof(dp));
// 从高位搜索下去
ll ans=dfs(n-1,0,0,true,true);
printf("%lld\n",ans%mod);
return 0;
} |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <climits>
#include <bitset>
#include <chrono>
#include <random>
using namespace std;
#define PB push_back
#define MP make_pair
#define SZ(v) ((int)(v).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n) FORE(i,0,n)
#define FORSZ(i,a,v) FOR(i,a,SZ(v))
#define REPSZ(i,v) REP(i,SZ(v))
std::mt19937 rnd((int)std::chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 1000;
int n;
int e[MAXN][2];
int d[MAXN];
int q[MAXN], qhead, qtail;
void solve() {
REP(i, n) REP(j, 2) e[i][j] = (2 * i + j) % n;
int cur = 0;
REP(s, n) {
REP(i, n) d[i] = INT_MAX;
qhead = qtail = 0;
d[s] = 0, q[qhead++] = s;
while (qtail < qhead) {
int at = q[qtail++];
REP(j, 2) { int to = e[at][j]; if (d[to] == INT_MAX) d[to] = d[at] + 1, q[qhead++] = to; }
}
REP(i, n) cur = max(cur, d[i]);
}
assert(cur <= 10);
//if (cur != INT_MAX) printf("%d\n", cur);
}
void run() {
scanf("%d", &n);
solve();
REP(i, n) printf("%d %d\n", e[i][0] + 1, e[i][1] + 1);
}
void stress() {
for (n = 1; n <= MAXN; ++n) { printf("solving %d\n", n); solve(); }
}
int main() {
//stress();
run();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) begin(v), end(v)
#define sz(v) v.size()
#define INF 1e18+9
#define EPSILON 1e-14
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main()
{
ll N, M;
cin >> N >> M;
vector<pair<ll, ll>> pawn(M);
rep(i, M){
cin >> pawn.at(i).first >> pawn.at(i).second;
}
sort(all(pawn));
set<ll> movable;
movable.insert(N);
ll row = 0;
rep(i, M){
set<ll> A, B;
row = pawn.at(i).first;
while(i < M && row == pawn.at(i).first){
if(movable.count(pawn.at(i).second-1) || movable.count(pawn.at(i).second+1)){
A.insert(pawn.at(i).second);
}
if(movable.count(pawn.at(i).second)){
B.insert(pawn.at(i).second);
}
i++;
}
i--;
for(ll x : B){
movable.erase(x);
}
for(ll x : A){
movable.insert(x);
}
}
cout << sz(movable) << '\n';
} |
#include<cstdio>
using namespace std;
typedef long long ll;
ll n,sum1,sum2,i,j;
int main()
{
scanf("%lld",&n);
sum1=3;i=1;
while(sum1<n)
{
sum2=5;j=1;
while(sum1+sum2<n)
{
j++;
sum2=5ll*sum2;
}
if(sum1+sum2==n)
{
printf("%lld %lld\n",i,j);
return 0;
}
i++;
sum1=3ll*sum1;
}
printf("-1\n");
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
int main(){
ll N,z,x,y;
bool sw=0;
cin >> N;
ll a=0,b=0;
for(ll i=1;i<=25;i++){
for(ll j=1;j<=39;j++){
//cout << pow(5,i)+pow(3,j) << endl;
x=1;
y=1;
rep(ii,i){x*=5;}
rep(jj,j){y*=3;}
//cout << x+y << endl;
//z=pow(5,i)+pow(3,j);
z=x+y;
if(z==N){
sw=1;
a=j;
b=i;
break;
}
//cout << sw << endl;
//if(pow(5,i)+pow(3,j)==N){
// sw=1;
// a=j;
// b=i;
//}
}
}
if(sw){cout << a << " " << b << endl;}
else{cout << -1 << endl;}
return 0;
} |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<cstring>
#include<map>
#include<cmath>
#include<iomanip>
#include<set>
#include<fstream>
constexpr int Mod = 998244353;
using namespace std;
struct Node {
string name;
int h;
};
bool comp(Node a, Node b) {
return a.h > b.h;
}
int main() {
int N;
cin >> N;
string s;
int he;
vector<Node> q;
for (int i = 1; i <= N; i++) {
cin >> s >> he;
q.push_back(Node{ s,he });
}
sort(q.begin(), q.end(), comp);
cout << q[1].name << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <array>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define rd1(a) cin >> (a)
#define rd2(a, b) cin >> (a) >> (b)
#define rd3(a, b, c) cin >> (a) >> (b) >> (c)
#define rd4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define init1(a) int (a); rd1((a));
#define init2(a, b) int (a), (b); rd2((a), (b));
#define init3(a, b, c) int (a), (b), (c); rd3((a), (b), (c));
#define init4(a, b, c, d) int (a), (b), (c), (d); rd4((a), (b), (c), (d));
#define repa(i, a, b) for (auto i = (a); i <= (b); ++i)
#define repd(i, a, b) for (auto i = (a); i >= (b); --i)
#define forz(i, n) for (auto i = 0; i < n; ++i)
#define fori(i, n) for (auto i = 1; i <= n; ++i)
#define fore(i, t) for (auto &&i : t)
#define all(x) (x).begin(), (x).end()
#define repmin(x, y) x = min(x, y)
#define repmax(x, y) x = max(x, y)
#define ll long long
#define lll __int128
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(t) ((int)(t).size())
#define vi vector<int>
#define vs vector<string>
#define vd vector<ld>
#define inf 1000000100
#define neginf -1000000100
#define DBG(var) \
cerr << "[" << __LINE__ << "] " << #var << " = " << (var) << endl;
template <typename T1, typename T2>
ostream &operator<<(ostream &s, pair<T1, T2> &t) {
return s << "(" << t.first << "," << t.second << ")";
}
template <typename T>
void read_vec(T& v, size_t n) {
forz(i, n) { typename T::value_type t; cin >> t; v.pb(t); }
}
template <typename T>
void write_vec(T& v) {
forz(i, sz(v)) { cout << v[i] << " \n"[i == sz(v) - 1]; }
}
template <typename T> ostream &operator<<(ostream &s, vector<T> &t) {
s << "{ ";
fore(x, t) s << x << " ";
s << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, set<T> &t) {
s << "{ ";
fore(x, t) s << x << " ";
s << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, unordered_set<T> &t) {
s << "{ ";
fore(x, t) s << x << " ";
s << "}";
return s;
}
template <typename T, typename S>
ostream &operator<<(ostream &s, map<T, S> &m) {
s << "{ ";
for (auto i = m.begin(); i != m.end(); i++)
s << "(" << i->first << " -> " << i->second << ") ";
s << "}";
return s;
}
// globals
//
void preproc() {
// add any preprocessing valid for all tests here
//
}
void single(int testId) {
// add code here
//
init1(n);
vector<pair<int, string>> tt;
forz(i, n) {
string s; int t;
cin >> s >> t;
tt.pb({t, s});
}
sort(all(tt), greater<pair<int,string>>());
cout << tt[1].second << "\n";
}
void multiple() {
// multiple tests in single file
int T;
cin >> T;
for (auto t = 1u; t <= T; t++)
single(t);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
preproc();
single(0);
//multiple();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> S(N);
for(int i = 0; i < N; i++) {
cin >> S.at(i);
}
int god = 0;
int e = 0;
int ans = 2;
for(int i = 2; i < 1001; i++) {
for(int j = 0; j < N; j++) {
if(S.at(j) % i == 0) god++;
}
if(god > e){
ans = i; e = god;
}
god = 0;
}
cout << ans << endl;
} | /*Bismillahi-r-Rahmani-r-Rahim*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi acos(-1.0)
#define mod 1000000007
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define vi vector<int>
#define vl vector<ll int>
#define pb push_back
#define test cin>>t;while(t--)
#define lcm(a,b) a*b/__gcd(a,b)
#define sd second
#define ft first
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
ll int i,n,t,j=0,p,x,a=0,b,l=0,r=0,y,k,c,sum=0,m,d,cnts=0,w;
cin>>n;
ll int ara[n];
for(i=0;i<n;i++){
cin>>ara[i];
}
if(n==1){
cout<<ara[0]<<endl;return 0;
}
sort(ara,ara+n);
m=0;
p=ara[0];
for(i=0;i<n-1;i++){
l=0;r=ara[i];
for(j=i+1;j<n;j++){
if(__gcd(r,ara[j])>1){
l++;
r=__gcd(r,ara[j]);
}
}
if(l>m){
m=l;
p=r;
}
}
cout<<p<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1000000007;
map<ll, ll> factorize(ll n) {
map<ll, ll> m;
ll lim = (ll)sqrt(n) + 10;
while (n % 2 == 0) {
n >>= 1;
m[2]++;
}
for (int i = 3; i < lim; i += 2) {
while (n % i == 0) {
n /= i;
m[i]++;
}
}
if (n > 1) m[n]++;
return m;
}
int main() {
ll n;
cin >> n;
map<ll, ll> m;
for (ll i = 2; i <= n; ++i) {
map<ll, ll> f = factorize(i);
for (const auto [k, x]: f) {
m[k] = max(m[k], x);
}
}
ll result = 1;
for (const auto [k, x]: m) {
for (int i = 0; i < x; ++i) {
result *= k;
}
}
cout << result + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long
ll kpk(ll m, ll n){
ll a = m;
ll b = n;
ll r = m%n;
while(r != 0)
{
m = n;
n = r;
r = m % n;
}
return a*b/n;
}
int main(){
ll a;
cin >> a;
ll k = kpk(a,a-1);
for(int i=a-2;i>2;i--){
k = kpk(k,i);
}
cout << k+1;
} |
#include <bits/stdc++.h>
constexpr int DEBUG = 0;
using namespace std;
using int64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
cout << (n + 99) / 100 << endl;
} | #import<bits/stdc++.h>
using namespace std;
int n;
int main()
{
cin >> n;
for( int i=1;i<=n;++i ) cout << int(log2(i))+1 << " ";
cout << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair
typedef vector<int> vi;
typedef pair<int,int> pi;
#define REP(i,a,b) for (int i = a; i <= b; i++)
void solve(){
ll n;
cin>>n;
for (ll i = 0; i < n+5; i++)
{
if((i*(i+1))/2 >=n){
cout<<i;
return;
}
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n =1;
// cin>>n;
while(n--){
// cout<<n;
solve();
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) begin(v), end(v)
using namespace std;
using P = pair<int,int>;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using Graph = vector<vector<int>>;
ll ll_pow(ll a, ll n) {
ll ans = 1;
for(ll i = 0; i < n; i++) ans *= a;
return ans;
}
vector<vector<int>> G;
bool temp[100001];
void dfs(int v){
if(temp[v]) return;
temp[v] = true;
for(auto vv:G[v]) dfs(vv);
}
int main() {
int n,i;
cin >> n;
for(i=1;i<n;i++){
if(i*(i+1)/2 >= n) break;
}
cout << i <<endl;
return 0;
}
|
#include <iostream>
int a[100];
int b[100];
int used[200];
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> a[i] >> b[i];
if (a[i] != -1) ++used[a[i] - 1];
if (b[i] != -1) ++used[b[i] - 1];
if (a[i] != -1 and b[i] != -1 and a[i] >= b[i]) {
std::cout << "No\n";
return 0;
}
if (a[i] != -1 and used[a[i] - 1] == 2) {
std::cout << "No\n";
return 0;
}
if (b[i] != -1 and used[b[i] - 1] == 2) {
std::cout << "No\n";
return 0;
}
}
int ilen, jlen, idx;
for (int i = 0; i < n; ++i) {
for (int j = i - 4; j < n; ++j) {
if (i == j) continue;
if (j < 0) continue;
if (a[i] == -1 or b[i] == -1) continue;
if (a[i] <= a[j] and a[j] <= b[i] and a[i] <= b[j] and b[j] <= b[i]) {
std::cout << "No\n";
return 0;
}
if (b[j] != -1) {
if (a[i] <= a[j] and a[j] <= b[i]) {
ilen = b[i] - a[i] + 1;
jlen = b[j] - a[j] + 1;
if (ilen != jlen) {
std::cout << "No\n";
return 0;
}
}
} else {
if (a[i] <= a[j] and a[j] <= b[i]) {
ilen = b[i] - a[i];
idx = a[j] + ilen - 1;
if (idx < 0 or 2 * n <= idx or used[idx] == 1) {
std::cout << "No\n";
return 0;
}
}
}
if (a[j] != -1) {
if (a[i] <= b[j] and b[j] <= b[i]) {
ilen = b[i] - a[i] + 1;
jlen = b[j] - a[j] + 1;
if (ilen != jlen) {
std::cout << "No\n";
return 0;
}
}
} else {
if (a[i] <= b[j] and b[j] <= b[i]) {
ilen = b[i] - a[i];
idx = b[j] - ilen - 1;
if (idx < 0 or 2 * n <= idx or used[idx] == 1) {
std::cout << "No\n";
return 0;
}
}
}
}
}
std::cout << "Yes\n";
} | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<numeric>
#include<cstring>
#include<random>
#include<array>
#include<fstream>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<queue>
/*
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
*/
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,a,b) for(ll i = a; i < b; ++i)
#define PRI(s) std::cout << s << endl
#define PRIF(v, n) printf("%."#n"f\n", (double)v)
template<typename A, typename B>void mins(A& a, const B& b) { a = min(a, (A)b); };
template<typename A, typename B>void maxs(A& a, const B& b) { a = max(a, (A)b); };
int main() {
ll N; cin >> N;
vector<ll> A(N), B(N);
REP(i, 0, N) cin >> A[i] >> B[i];
vector<ll> T(2 * N + 1, 0);
REP(i, 0, N) {
if (A[i] != -1) {
if (T[A[i]] != 0) {
PRI("No");
return 0;
}
T[A[i]] = i+1;
}
if (B[i] != -1) {
if (T[B[i]] != 0) {
PRI("No");
return 0;
}
T[B[i]] = -(i+1);
}
if (A[i] != -1 && B[i] != -1 && B[i] <= A[i]) {
PRI("No");
return 0;
}
}
vector<ll> dp(2 * N + 1, false);
dp[0] = true;
REP(i, 0, 2 * N) {
if (!dp[i]) continue;
for (int k = i + 2; k <= 2 * N; k += 2) {
int d = (k - i) / 2;
bool ok = true;
for (int j = i + 1; j <= k; j++) {
if (T[j] > 0 && (j + d > 2 * N || (T[j + d] != 0 && T[j] != -T[j + d]))) {
ok = false;
break;
}
if (T[j] < 0 && (j - d <= i || (T[j - d] != 0 && T[j - d] != -T[j]))) {
ok = false;
break;
}
}
if (!ok) continue;
dp[k] = true;
}
}
if (dp[2 * N]) PRI("Yes");
else PRI("No");
return 0;
}
|
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#define itrout(x) for(int i=0;i<x.size();i++) {cout << x[i] << (i==x.size()-1 ? "\n" : " ");}
#ifdef LOCAL
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl
#define debugbit(x, n) cerr << #x << " = " << bitset<n>(x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl
#define itrdebug(x) cerr << #x << " "; for (auto & el : (x)) {cerr << (el) << " ";} cerr << endl
#define dassert(...) assert(__VA_ARGS__)
#else
#define debug(x)
#define debugbit(x, n)
#define itrdebug(x)
#define dassert(...)
#endif
//#define int long long
//using mint = atcoder::modint;
typedef long long ll;
const ll MOD = 1e9 + 7;
const long double EPS = 1e-8;
ll merge_cnt(vector<ll> &a) {
int n = a.size();
if (n <= 1) { return 0; }
ll cnt = 0;
vector<ll> b(a.begin(), a.begin()+n/2);
vector<ll> c(a.begin()+n/2, a.end());
cnt += merge_cnt(b);
cnt += merge_cnt(c);
int ai = 0, bi = 0, ci = 0;
// merge の処理
while (ai < n) {
if ( bi < b.size() && (ci == c.size() || b[bi] <= c[ci]) ) {
a[ai++] = b[bi++];
} else {
cnt += n / 2 - bi;
a[ai++] = c[ci++];
}
}
return cnt;
}
void solve(long long N, std::vector<long long> a){
auto A = a;
ll current = merge_cnt(A);
rep(i,0,N) {
cout << current << endl;
current -= a[i];
current += N - a[i] - 1;
}
}
signed main(){
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
long long N;
scanf("%lld",&N);
std::vector<long long> a(N-1-0+1);
for(int i = 0 ; i < N-1-0+1 ; i++){
scanf("%lld",&a[i]);
}
solve(N, std::move(a));
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<int>A(N);
vector<int>B(N);
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
cin >> B[i];
}
int ans = 100000000;
ans = min(ans, B[0]- A[0] + 1);
for(int i=1; i<N; i++){
if(A[i-1] < A[i] && B[i-1] < B[i] ){
B[i] = B[i-1];
ans = min(ans, B[i]-A[i]+1);
}else if(A[i-1] >= A[i] && B[i-1] < B[i]){
A[i] = A[i-1];
B[i] = B[i-1];
ans = min(ans, B[i]-A[i]+1);
}
else if(A[i-1] >= A[i] && B[i-1] >= B[i]){
A[i] = A[i-1];
ans = min(ans, B[i]-A[i]+1);
}else{
ans = min(ans, B[i]-A[i]+1);
}
}
if(ans>=1){
cout << ans << endl;
}
else{
cout << 0 << endl;
}
} |
/*
__ ___ __
/ |/ /____ / /_ ____ _____ ____ _ _____
/ /|_/ // __ \ / __// __ \ / ___// __ `// ___/
/ / / // /_/ // /_ / /_/ // / / /_/ /(__ )
/_/ /_/ \____/ \__/ \____//_/ \__,_//____/
*/
#ifndef __AHA__HEADER
#define __AHA__HEADER
#include <bits/stdc++.h>
using namespace std;
#define g0 get<0>
#define g1 get<1>
#define g2 get<2>
#define ft first
#define sd second
#define sz(x) (i6) x.size()
#define psb(x) push_back(x)
#define ppb() pop_back()
#define bg(x) x.begin()
#define ed(x) x.end()
#define col(x) x.begin(), x.end()
#define srt(x) sort(x.begin(), x.end())
#define vec vector
#define deq deque
#define hmap unordered_map
#define pq priority_queue
#define fn function
#ifdef LOCAL
#define git stauDBG_MACRO_NO_WARNING
#include <dbg.h>
#define dbgt dbg(dbg::time())
#else
#define dbg(...)
#define dbgt
#endif
typedef string str;
typedef int32_t i3;
typedef int64_t i6;
typedef int64_t i64;
typedef uint32_t u3;
typedef uint64_t u6;
typedef long double d6;
typedef pair<i6, i6> p6;
typedef vec<i6> vi6;
typedef vec<p6> vp6;
typedef vec<bool> vb;
typedef vec<vi6> vv;
typedef deq<p6> dp6;
typedef deq<i6> di6;
typedef map<i6, i6> mi6;
typedef map<p6, i6> mp6;
typedef set<i6> si6;
typedef hmap<i6, i6> hi6;
typedef vv graph;
typedef vv matrix;
const i6 INF = INT64_MAX / 4;
const i6 NINF = -INF;
const i6 ZERO = 0;
const i6 ONE = 1;
#endif
void build_prt(i6 p, i6 crt, vv& tree, vi6& prt) {
for (auto& c : tree[crt]) {
if (c != p) {
prt[c] = crt;
build_prt(crt, c, tree, prt);
}
}
}
void dfs(i6 p, i6 crt, i6 val, vv& tree, vi6& vals, vi6& ans) {
ans[crt] = val + vals[crt];
for (auto& c : tree[crt]) {
if (c != p) {
dfs(crt, c, ans[crt], tree, vals, ans);
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef LOCAL
ifstream cin{"input.txt"};
ofstream cout{"output.txt"};
#endif
i6 n;
cin >> n;
vp6 edges(n);
vv tree(n + 1, vi6());
for (i6 i = 0; i < n - 1; i++) {
i6 x, y;
cin >> x >> y;
edges[i] = {x, y};
tree[x].push_back(y);
tree[y].push_back(x);
}
vi6 prt(n + 1, -1);
build_prt(-1, 1, tree, prt);
prt[1] = 1;
i6 q;
cin >> q;
vi6 vals(n + 1, 0);
for (int i = 1; i <= q; i++) {
i6 t, e, x;
cin >> t >> e >> x;
auto crtp = edges[e - 1];
if (t == 1) {
if (prt[crtp.ft] != crtp.sd) {
vals[1] += x;
vals[crtp.sd] -= x;
} else {
vals[crtp.ft] += x;
}
} else {
if (prt[crtp.sd] != crtp.ft) {
vals[1] += x;
vals[crtp.ft] -= x;
} else {
vals[crtp.sd] += x;
}
}
}
vi6 ans(n + 1, 0);
dfs(-1, 1, 0, tree, vals, ans);
for (i6 i = 1; i <= n; i++) {
cout << ans[i] << endl;
}
return 0;
}
| #include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
typedef long long ll;
const ll INF = 1e18;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
int n; cin >> n;
vector<ll> x(n), c(n);
vector<ll> l(n+2, INF), r(n+2, -INF);
for(int i = 0; i < n; i++) {
cin >> x[i] >> c[i];
chmin(l[c[i]], x[i]);
chmax(r[c[i]], x[i]);
}
l[0] = 0, r[0] = 0;
l[n+1] = 0, r[n+1] = 0;
vector<vector<ll>> dp(n+2, vector<ll>(2, INF));
int pre = 0;
dp[0][0] = 0;
dp[0][1] = 0;
for(int i = 1; i <= n+1; i++){
if(l[i] == INF) continue;
chmin(dp[i][0], dp[pre][0]+abs(r[i]-l[pre])+abs(l[i]-r[i]));
chmin(dp[i][0], dp[pre][1]+abs(r[i]-r[pre])+abs(l[i]-r[i]));
chmin(dp[i][1], dp[pre][0]+abs(l[i]-l[pre])+abs(l[i]-r[i]));
chmin(dp[i][1], dp[pre][1]+abs(l[i]-r[pre])+abs(l[i]-r[i]));
pre = i;
}
cout << dp[n+1][0] << endl;
} |
#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;
cin>>s;
int n = sz(s);
for(int i = 104; i <= 1000; i += 8){
string t = to_string(i);
bool flag = 0;
vector<int> vis(n , 0);
for(int j = 0; j < sz(t); j++){
bool ok = 0;
for(int k = 0; k < n; k++){
if(t[j] == s[k] && !vis[k]){
ok = 1;
vis[k] = 1;
break;
}
}
if(!ok){
flag = 1;
}
}
if(!flag){
cout<<"Yes\n";
return 0;
}
}
if(n == 2){
for(int i = 16; i <= 100; i += 8){
string t = to_string(i);
bool flag = 0;
vector<int> vis(n , 0);
for(int j = 0; j < sz(t); j++){
bool ok = 0;
for(int k = 0; k < n; k++){
if(t[j] == s[k] && !vis[k]){
ok = 1;
vis[k] = 1;
break;
}
}
if(!ok){
flag = 1;
}
}
if(!flag){
cout<<"Yes\n";
return 0;
}
}
}
if(n == 1){
if(s[0] == '8'){
cout<<"Yes\n";
return 0;
}
}
cout<<"No\n";
return 0;
} | #include <iostream>
#include <math.h>
#include <algorithm>
#include <queue>
#include <map>
#include <list>
//#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
typedef long long ll;
bool solve(string s) {
if(s.size() == 1) return s == "8";
if(s.size() == 2){
if(stoi(s) % 8 == 0) return 1;
swap(s[0], s[1]);
return stoi(s) % 8 == 0;
}
vector<int> cnt(10);
FOR (i, 0, s.size()) {
int si = s[i] - '0';
cnt[si]++;
}
int lenofs = s.size();
FOR (i, 13, 125) {
vector<int> tmp = cnt;
int a = 8 * i;
string b = to_string(a);
for (auto bi : b) {
int bj = bi - '0';
tmp[bj]--;
}
int cnt_less_than0 = 0;
for (auto x : tmp) {
if (x < 0) cnt_less_than0++;
}
if (cnt_less_than0 > 0)continue;
else {
return true;
}
}
return false;
}
int main(){
string s;
cin >> s;
string ans = solve(s) ? "Yes" : "No";
cout << ans << endl;
return 0;
} |
/**
* Author: Oak_limy
* Created: 2020-11-15 01:26:42
* Wish you and me a better future.
**/
#include <bits/stdc++.h>
#define endl '\n'
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define zy -2147382637
#define bql 2147483647
#define ll long long
#define ull unsigned long long
#define ld long double
#define il inline
#define sz(x) x.size()
#define maxn 100010
#define rp(i, l, r) for (int i = l; i <= r; i++)
#define rb(i, r, l) for (int i = r; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
ll max(ll a,ll b){return a>b?a:b;}
ll min(ll a,ll b){return a<b?a:b;}
ll lowbit(ll x){return x&(-x);}
ll prime(ll x){
if(x<=1)return false;
for(int i=2;i<=int(sqrt(x));i++){
if(x%i==0)return false;
}return true;
}
bool cmp(ll a,ll b){return a>b;}
ll gcd(ll a,ll b){ll r;while(b>0){r=a%b;a=b;b=r;}return a;}
ll powmod(ll a,ll b,ll mod) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
inline int readint() {
int f=1,x=0; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1; ch=getchar();}
while(ch<='9'&&ch>='0') x=x*10+ch-'0',ch=getchar();
return f*x;
}
inline ll readll() {
ll f=1,x=0; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1; ch=getchar();}
while(ch<='9'&&ch>='0') x=x*10+ch-'0',ch=getchar();
return f*x;
}
void fl(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
const int dx[8] = {-1, 1, 0, 0, -1, 1, -1, 1},
dy[8] = {0, 0, -1, 1, -1, -1, 1, 1};
#define MAXN 110
ll n,dp[MAXN][MAXN];
double ans;
char s[MAXN];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>(s+1);
for(int j=1;j<=n;j++){
dp[i][j]=(s[j]=='1');
}
dp[i][i]=1;
}
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(dp[i][k]&&dp[k][j]){
dp[i][j]=1;
}
}
}
}
for(int i=1;i<=n;i++){
ll cnt=0;
for(int j=1;j<=n;j++){
if(dp[j][i])cnt++;
}
ans=ans+1.0/cnt*1.0;
}
printf("%.10lf\n",ans);
return 0;
}
/* stuff to remember
* int overflow, array bounds
* special cases (n=1? n=0?)
* do something instead of nothing and stay organized
* USE STATIC ARRAYS
* DEFINING ARRAYS BEFORE main()
* DO NOT DEFINE ARRAYS IN main()
* USE INT INSTEAD OF LL,NOTICE THE MLE
*/ | #include <bits/stdc++.h>
using namespace std;
// clang-format off
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint = modint998244353
using ll = int64_t;
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto& a : v) cin >> a;
return is;
}
template <class T>
istream& operator>>(istream& is, vector<pair<T, T>>& v) {
for (auto& a : v) cin >> a.first >> a.second;
return is;
}
template <class T>
istream& operator>>(istream& is, vector<tuple<T, T, T>>& v) {
for (auto& a : v) {
T a1, a2, a3;
cin >> a1 >> a2 >> a3;
a = {a1, a2, a3};
}
return is;
}
template<typename T>
istream& operator>>(istream &is, complex<T>& c) {
double x, y;
is >> x >> y;
c.real(x);
c.imag(y);
return is;
}
template <class T>
ostream& operator<<(ostream& os, vector<T>& v) {
for (auto& a : v) os << a << " ";
os << endl;
return os;
}
template<class T>
bool chmin(T &a, T b) {
if (a > b) { a = b; return true; }
return false;
}
template<class T>
bool chmax(T &a, T b) {
if (a < b) { a = b; return true; }
return false;
}
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define TRC1(a) cout << #a ":" << a
#define TRC2(a, b) TRC1(a); cout << " "; TRC1(b)
#define TRC3(a, b, c) TRC2(a, b); cout << " "; TRC1(c)
#define TRC4(a, b, c, d) TRC3(a, b, c); cout << " "; TRC1(d)
#define GET_NAME(_1,_2,_3,_4,NAME,...) NAME
#define TRC(...) GET_NAME(__VA_ARGS__, TRC4, TRC3, TRC2, TRC1) (__VA_ARGS__) << endl
using veci = vector<int>;
using vecll = vector<ll>;
using Pi = pair<int, int>;
using Ti = tuple<int, int, int>;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
const int IINF = INT32_MAX;
const ll LINF = INT64_MAX;
// cout << fixed << setprecision(15);
void solve();
int main() {
cin.tie(0); ios::sync_with_stdio(0);
cout << fixed << setprecision(15); solve(); return 0; }
// clang-format on
void solve() {
ll K;
cin >> K;
ll ans = 0;
for (ll a = 1; a <= K; ++a) {
for (ll b = 1; b <= K / a; ++b) {
ll c = K / (a * b);
ans += c;
}
}
cout << ans << endl;
}
|
# include <cstdio>
# define ef else if
namespace Main {
namespace Source {
typedef short unsigned int hu;
typedef unsigned int uint;
static inline const void swap(hu& a, hu& b) { hu c(a); a = b, b = c; }
}
using namespace Source;
namespace Testcase {
enum { N = 500 };
static hu n;
static hu p[N + 1];
static uint m, inv;
static hu a[N * N + 1];
static inline const void operate(const hu n)
{ p[n] < p[n + 1] ? ++inv : --inv, swap(p[n], p[n + 1]), a[++m] = n; }
static inline const void main() {
scanf("%hu", &n), m = 0, inv = 0;
for (hu i(1); i <= n; ++i) scanf("%hu", &p[i]);
for (hu i(1); i <= n; ++i) for (hu j(i + 1); j <= n; ++j) inv += p[j] < p[i];
while (inv) {
for (hu i(1); i <= n; ++i) {
hu c(0), a[2]{};
for (hu j(1); j < n; ++j) if (p[j + 1] < p[j]) ++c, a[j % 2] = j;
if (not a[(m + 1) % 2]) break;
else operate(a[(m + 1) % 2]);
}
if (not inv) break;
operate(m % 2 + 1);
}
printf("%u\n", m);
for (register uint i(1); i <= m; ++i) printf("%u ", a[i]);
putchar('\n');
}
}
static hu t;
static inline const void main() {
scanf("%hu", &t);
for (hu i(0); i < t; ++i) Testcase::main();
}
}
signed int main() { Main::main(); return 0; } | //Coded by Abhijay Mitra (AbJ)
#include "bits/stdc++.h"
#define double long double
#define int long long int
#define ibs ios_base::sync_with_stdio(false)
#define cti cin.tie(0)
#define mp make_pair
#define pb emplace_back
#define F first
#define S second
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using pii = std::pair<int, int>;
using vpii = std::vector<pii>;
using vvpii = std::vector<vpii>;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, b, a) for (int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
using namespace std;
const int inf = 1e18 + 10;
const int N = 2e6 + 10;
int n, a[N];
void solve(){
cin >> n;
rep(i, 1LL, n){
cin >> a[i];
}
vi v;
if(n == 1LL){
}
else if(n == 2LL){
if(a[1LL] == 2LL){
v.pb(1LL);
swap(a[1LL], a[2LL]);
}
}
else{
rep(i, 1LL, n - 3LL){
rep(j, i + 1, n){
if(a[j]==i){
if((((int)v.size() ) & 1) != (j & 1)){
if(((int)v.size() & 1) == (n & 1)){
v.pb(n - 1LL);
swap(a[n - 1LL], a[n]);
}
else{
v.pb(n - 2LL);
swap(a[n - 2LL], a[n - 1LL]);
}
}
per(pos, j - 1, i){
v.pb(pos);
swap(a[pos], a[pos + 1LL]);
}
}
}
}
}
while(a[n] != n or a[n - 1LL] != n - 1LL or a[n - 2LL] != n - 2LL){
if(((int)v.size() & 1LL) == (n & 1LL)){
v.pb(n - 1LL);
swap(a[n - 1LL], a[n]);
}
else{
v.pb(n - 2LL);
swap(a[n - 2LL], a[n - 1LL]);
}
}
assert((int)v.size() <= n * n);
assert(is_sorted(a + 1LL, a + 1LL + n));
cout << v.size() << "\n";
for(auto &i: v){
cout << i << " ";
}
}
int32_t main(){
ibs;cti;
// solve(); return 0;
int t; cin >> t;
while (t--){
solve(); cout << "\n";
}
return 0;
} |
#include<bits/stdc++.h>
typedef long long ll;
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void re(int &x){scanf("%d",&x);}
void re(int &x,int &y){scanf("%d %d",&x,&y);}
void re(ll &x){scanf("%lld",&x);}
void re(ll &x,ll &y){scanf("%lld %lld",&x,&y);}
void re(double &x){scanf("%lf",&x);}
void re(double &x,int &y){scanf("%lf %lf",&x,&y);}
using namespace std;
const int N=1e5+5;
const int mod=998244353;
string s[N];
char boom[N];
int main()
{
int n,m;re(n,m);
rep(i,0,n+m-2) boom[i]='.';
rep(i,0,n-1) cin>>s[i];
rep(i,0,n-1)
{
rep(j,0,m-1)
{
if(s[i][j]=='R'&&boom[i+j]!='B') boom[i+j]='R';
else if(s[i][j]=='B'&&boom[i+j]!='R') boom[i+j]='B';
else if(s[i][j]=='.') continue;
else
{
cout<<0<<endl;
return 0;
}
}
}
ll ans=1;
rep(i,0,n+m-2)
{
if(boom[i]=='.') ans=(ans*2)%mod;
}
cout<<ans<<endl;
return 0;
}
| // editorial
#include<iostream>
#include<vector>
#include<numeric>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
ll modpow(ll a, ll b, ll p = 1e9+7){
if(b == 0) return 1;
if(b % 2 == 0){
ll d = modpow(a, b/2, p);
return (d*d) % p;
}else{
return (a%p * modpow(a, b-1, p)) % p;
}
}
int main(){
int n, k;
cin >> n >> k;
vector<ll> v(n);
for(int i = 0; i < n; i++) cin >> v[i];
vector<ll> fact(k+1, 1);
for(int i = 1; i <= k; i++) fact[i] = fact[i-1]*i%mod;
vector<ll> invf(k+1, 1);
for(int i = 1; i <= k; i++) invf[i] = modpow(fact[i], mod-2, mod);
vector<ll> sum(k+1, 0);
sum[0] = n;
vector<ll> powers(n, 1);
for(int i = 1; i <= k; i++){
for(int j = 0; j < n; j++){
powers[j] = powers[j]*v[j]%mod;
(sum[i] += powers[j]*invf[i]%mod) %= mod;
}
}
const ll invtwo = modpow(2, mod-2, mod);
vector<ll> fpowers(n, 1);
for(int i = 1; i <= k; i++){
ll tmp = 0, sub = 0;
for(int j = 0; j <= i; j++){
(tmp += sum[j]*sum[i-j]%mod) %= mod;
}
(tmp *= fact[i]) %= mod;
for(int j = 0; j < n; j++){
fpowers[j] = fpowers[j]*2*v[j]%mod;
(sub += fpowers[j]) %= mod;
}
cout << (tmp-sub+mod)*invtwo%mod << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const long long MOD2 = 998244353LL;
const long long MOD = 1000000007LL;
const long long INF = 1LL<<60;
int main(){
double sx,sy,cx,cy;
cin >> sx >> sy >> cx >> cy;
cy *= -1;
if(sx == cx)cout << sx << endl;
else{
double a = (cy-sy)/(cx - sx);
double b = sy - a*sx;
printf("%.15lf\n", -1.0*b/a);
}
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<21-a-b-c<<endl;
return 0;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int long long
typedef unsigned long long lu;
typedef vector<ll> v;
typedef vector<vector<ll> > vv;
typedef vector<string> vs;
typedef vector<pair<ll,ll>> vpr;
typedef vector<bool>vb;
typedef vector<double>vd;
typedef long double ld;
#define f(i,n) for(ll i = 0; i < n; i++)
#define ff(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define endl "\n"
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define amax(x,y) if(y>x) x=y;
#define amin(x,y) if(y<x)x=y;
#define bg(x) x.begin()
#define sz(x) (ll)x.size()
#define in(x,n) for(ll i=0;i<n;i++)cin>>x[i]
#define out(x,n) for(ll i=0;i<n;i++)cout<<x[i]<<" "
#define mxt(a) *(max_element(a.begin(),a.end()))
#define mnt(a) *(min_element(a.begin(),a.end())
#define tc ll t;cin>>t;while(t--)
typedef pair<ll,ll> pi;
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define yesno(f) if(f) yes else no
const v dx = {1, -1, 0, 0};
const v dy = {0, 0, 1, -1};
const ld PI = 2 * acos(0.0);
ll cel(ll x1,ll y1){if((x1%y1)==0)return x1/y1;else return x1/y1+1;}
ll power(ll a,ll b,ll m)
{
if(b==0)
return 1;
ll d=power(a,b/2,m);
d=(d*d)%m;
if(b&1)
d=(d*a)%m;
return d;
}
const ll mod=1e9+7;
int MOD(int a)
{
if(a<0)
a+=mod;
if(a>=mod)
a%=mod;
return a;
}
// set_name.find_by_order(k) It returns to an iterator to the kth element (counting from zero) in the set in O(logn) time
// set_name.order_of_key(k) It returns to the number of items that are strictly smaller than our item k in O(logn) time.
/*string operations :
str.substr (x,y) : returns a substring str[x],str[x+1],...str[x+y-1]
str.substr (x) : returns a substring str[x],... end of string
str.find(qtr) : returns the first occurenece of qtr in str */
int32_t main()
{
ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;cin>>n;
const int N=4e5;
vector<unordered_set<int> > gr(N+1);
vpr vec;
for (int i = 0; i < n; ++i)
{
int a,b;cin>>a>>b;
vec.pb({a,b});
gr[a].insert(i);
gr[b].insert(i);
}
queue<int>que;
for (int i = 1; i <= N; ++i)
{
if(sz(gr[i])==1)
{
que.push(i);
}
}
int ans=0;
while(!que.empty())
{
int u=que.front();
que.pop();
if(sz(gr[u])!=1)
continue;
ans++;
int i=*gr[u].begin();
gr[u].erase(gr[u].begin());
int u1=vec[i].first^vec[i].second^u;
if(u1 !=u)
{
gr[u1].erase(i);
if(sz(gr[u1]) == 1)
que.push(u1);
}
}
for (int i = 1; i <= N; ++i)
{
if(sz(gr[i]))
ans++;
}
cout<<ans<<endl;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<bitset>
//#include<unordered_map>
#include<time.h>
#include<cstdlib>
typedef long long ll;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#define mm(a) memset(a,0,sizeof(a))
#define lr rt<<1
#define rr rt<<1|1
#define sync std::ios::sync_with_stdio(false);std::cin.tie(0);
#define inf 0x3f3f3f3f
//#define eqs 1e-8
#define lb(x) (x&(-x))
#define ch(a) (int(a-'a')+1)
#define rep(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef pair<int,int> pii;
//const double pi=acos(-1);
const int maxn=1000010;
//const ll Mod=1000000007;
const ll Mod=998244353;
int c[maxn];
vector<int>g[maxn];
int head[maxn],d[maxn];
int tot,n,m;
struct node
{
int v,nxt;
ll w;
}e[maxn<<1];
void add(int u,int v,ll c)
{
e[tot].v=v;
e[tot].w=c;
e[tot].nxt=head[u];
head[u]=tot++;
e[tot].v=u;
e[tot].w=0ll; //为0！！！
e[tot].nxt=head[v];
head[v]=tot++;
}
int bfs(int s,int t)
{
queue<int>q;
memset(d,-1,sizeof(d));
d[s]=0;
q.push(s);
while(!q.empty())
{
int u=q.front();
q.pop();
if(u==t)
return 1;
for(int i=head[u];i!=-1;i=e[i].nxt)
{
int v=e[i].v;
if(d[v]==-1&&e[i].w>0)
{
d[v]=d[u]+1;
q.push(v);
}
}
}
return 0;
}
ll dfs(int u,ll flow,int t)
{
if(u==t)
return flow;
ll sum=0;
for(int i=head[u];i!=-1;i=e[i].nxt)
{
int v=e[i].v;
ll w=e[i].w;
if(w>0&&d[v]==d[u]+1)
{
ll tmp=dfs(v,min(1ll*flow-sum,e[i].w),t);
e[i].w-=1ll*tmp;
e[i^1].w+=1ll*tmp;
sum+=1ll*tmp;
if(sum==flow)
return sum;
}
}
if(sum==0)
d[u]=0;
return sum;
}
ll dinic(int s,int t)
{
ll total=0;
while(bfs(s,t))
total+=1ll*dfs(s,2e14,t);
return total;
}
bool vvs[maxn];
int main()
{
sync;
memset(head,-1,sizeof(head));
int u,v;
int st,ed;
tot=0;
st=0,ed=400001;
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>u>>v;
vvs[u]=1;
vvs[v]=1;
add(st,i+ed,1);
add(i+ed,u,1);
add(i+ed,v,1);
}
for(int i=1;i<=400000;i++)
{
if(vvs[i])
add(i,ed,1);
}
cout<<dinic(st,ed)<<endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io(){
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
};
} fio;
signed main(){
cout<<fixed<<setprecision(10);
int N, K;
int ans = 0;
vector<int> a;
vector<int> con(400000);
cin>>N>>K;
a.resize(N);
for(int i = 0; i < N; i++){
cin>>a[i];
con[a[i]]++;
con[a[i]] = min(con[a[i]], K);
}
// sort(a.begin(), a.end());
for(int i = 0; i + 1 < con.size(); i++){
con[i+1] = min(con[i], con[i+1]);
ans += (con[i] - con[i+1]) * (i+1);
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
#define maxn 10005
using namespace std;
int n,m; string s[805];
int son[800*13][8],tot=1;
vector<int> has[800*13];
struct mat{
int v[20][20];
int score;
bool vis[800];
}arr[maxn];
int vis[800*13],col;
int dx[4]={0,1},dy[4]={1,0};
void getscore(mat &tt)
{
memset(tt.vis,0,sizeof(tt.vis));
tt.score=0;
col++;
for (int x=0;x<n;x++)
for (int y=0;y<n;y++)
for (int f=0;f<=1;f++)
{
int nx=x,ny=y,now=1,step=0;
while (step<n)
{
if (!son[now][tt.v[nx][ny]]) break;
now=son[now][tt.v[nx][ny]];
step++; nx=(nx+dx[f]+n)%n; ny=(ny+dy[f]+n)%n;
if (vis[now]!=col)
{
vis[now]=col;
int siz=has[now].size();
for (int j=0;j<siz;j++)
tt.vis[has[now][j]]=1;
}
}
}
for (int i=0;i<m;i++)
if (tt.vis[i])
tt.score++;
return;
}
void ins(int id,string s)
{
int now=1;
for (int i=0;i<s.size();i++)
{
int tt=s[i]-'A';
if (!son[now][tt]) son[now][tt]=++tot;
now=son[now][tt];
}
has[now].push_back(id);
return;
}
void out(mat now)
{
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
cout<<(char)(now.v[i][j]+'A');
cout<<endl;
}
// cout<<now.score<<endl;
return;
}
int father=10,sson=5,dai=300000,fir=10000;
int cmp(mat x,mat y) {return x.score>y.score;}
void init()
{
int tot=0;
for (int i=1;i<=fir;i++)
{
tot++; arr[tot]=arr[i];
for (int tt=1;tt<=100;tt++)
{
int j=rand()%(m-arr[tot].score)+1,x=rand()%n,y=rand()%n,now=0;
while (true)
{
if (arr[tot].vis[now]==0) j--;
if (j==0) break;
now++;
}
//构造第now个字符串
int f=rand()%2;
for (j=0;j<s[now].size();j++)
{
arr[tot].v[x][y]=s[now][j]-'A';
x=(x+dx[f]+n)%n; y=(y+dy[f]+n)%n;
}
}
getscore(arr[tot]);
}
sort(arr+1,arr+tot+1,cmp);
}
int main()
{
// freopen("0055.txt","r",stdin);
int ti=clock();
srand(time(0));
cin>>n>>m;
for (int i=0;i<m;i++) {cin>>s[i]; ins(i,s[i]);}
int limit=CLOCKS_PER_SEC*2.9;
// init();
for (int tim=1;tim<=dai;tim++)
{
if (clock()-ti>=limit) break;
// if (tim%50==0) cout<<tim<<" "<<arr[1].score<<endl;
// cout<<tim<<" "<<arr[1].score<<endl;
int tot=father;
for (int i=1;i<=father;i++)
{
int q=sson;
q=sson+(100-i*40>=0)?30-i*10:0;
for (int tt=1;tt<=q;tt++)
{
tot++; arr[tot]=arr[i];
int j=rand()%(m-arr[tot].score)+1,x=rand()%n,y=rand()%n,now=0;
while (true)
{
if (arr[tot].vis[now]==0) j--;
if (j==0) break;
now++;
}
//构造第now个字符串
int f=rand()%2;
for (j=0;j<s[now].size();j++)
{
arr[tot].v[x][y]=s[now][j]-'A';
x=(x+dx[f]+n)%n; y=(y+dy[f]+n)%n;
}
getscore(arr[tot]);
if (arr[tot].score==m) {out(arr[tot]); return 0;}
}
}
sort(arr+1,arr+tot+1,cmp);
}
sort(arr+1,arr+tot+1,cmp);
out(arr[1]);
return 0;
} |
#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;
cin >> n;
string s, t;
cin >> s >> t;
ll num = 0;
rep(i, n) {
if (s[i] == '1') {
num++;
}
if (t[i] == '1') {
num--;
}
}
if (num < 0) {
cout << -1 << endl;
return 0;
}
if (num % 2 == 1) {
cout << -1 << endl;
return 0;
}
ll ans = 0;
int s_del_num = -1;
queue<int> t_to_match;
rep(i, n) {
if (t[i] == '1') {
t_to_match.push(i);
}
if (s[i] == '0') {
continue;
}
if (s_del_num == -1) {
if (t_to_match.empty()) {
s_del_num = i;
} else {
int match = t_to_match.front();
t_to_match.pop();
ans += i - match;
// cout << "match:" << i << " " << match << endl;
}
} else {
ans += i - s_del_num;
// cout << "delete:" << i << " " << s_del_num << endl;
s_del_num = -1;
}
}
if (t_to_match.empty()) {
cout << ans << endl;
} else {
cout << -1 << endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
//to insert pair use eb or { }
#define int int64_t
typedef pair<int,int> pii;
const int X=1e9+7;
const int inf=1e18;
#define lld int
#define pqu priority_queue
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define endl "\n"
#define v vector
#define Y 998244353
#define EPS 1e-6
#define N 500005
#define pi 3.1415926535897932384626
#define ones(x) __builtin_popcount(x)
#define zero(a) memset(a,0,sizeof(a))
#define minus(a) memset(a,-1,sizeof(a))
#define all(a) (a).begin(),(a).end()
#define rec(i,s,e) for(int i=s ; (s<=e)?(i<e):(i>=e) ; (s<=e)?(i++):(i--) )
// rec(i,0,n)
// rec(i,n-1,0)
//for flush dont use endl (\n)
void google(int i)
{ cout<<"Case #"<<i<<": "; }
//use sort function even to sort a string of caharacters or numbers ...
// sort(s.begin(),s.end());
//floating precision functions
//floor() for low
//ceil() for above
// trunc() removes decimal digits
//round() used to round off
void prec(double n,int d)
{
cout<<fixed<<setprecision(d)<<n<<endl;
}
//prime[i]==1 if it is prime
int prime[1000001];
void sieve(int n)
{ rec(i,0,n+1)
prime[i]=1;
for(int i=2;i*i<=n;i++)
{ if(prime[i]!=1)
continue;
for(int j=i*i;j<=n;j=j+i)
if(prime[j]==1)
prime[j]=i;
}
}
int gcd(int a,int b)
{
if(a==0)
return b;
return gcd(b%a,a);
}
//fermat a^(m-2)%mod
int bin(int a,int n,int m)
{ int res=1;
while(n)
{ if(n%2)
{ res=(res*a)%m;
n--;
}
a=(a*a)%m;
n/=2;
}
return res;
}
void dijktra(v<pii> g[], int n)
{
pqu<pii, v<pii>, greater<pii>> pq;
v<int> dist(n, inf);
dist[0] = 0;
int parent[n];
minus(parent);
pq.push({0, 0});
while (!pq.empty())
{
pii x= pq.top();
pq.pop();
for(int i=0;i<(int)g[x.se].size();i++)
{
pii k = g[x.se][i];
if (dist[x.se] + k.fi < dist[k.se])
{
dist[k.se] = dist[x.se] + k.fi;
parent[k.se] = x.se;
pq.push({dist[k.se], k.se});
}
}
}
}
void bfs(int s,v<int> g[],int n)
{
bool vis[n];
rec(i,0,n)
vis[i]=false;
vis[s]=true;
deque<int> q;
q.pb(s);
while(!q.empty())
{
s=q.front();
q.pop_front();
for(int i=0;i<g[s].size();i++)
{
if(!vis[g[s][i]])
{ vis[g[s][i]]=true;
q.pb(g[s][i]);
}
}
}
}
void dfs(int u,v<int> g[],bool *vis)
{
vis[u]=true;
for(int i=0;i<g[u].size();i++)
if(!vis[g[u][i]])
dfs(g[u][i],g,vis);
}
void create_w(v<pii> *g, int n, int m)
{
rec(i,0, m)
{
int u,v,w;
cin>>u>>v>>w;
g[u-1].pb({w, v-1});
g[v-1].pb({w, u-1});
}
}
void create(v<int> *g,int n,int m)
{
rec(i,0,m)
{
int u,v;
cin>>u>>v;
g[u-1].pb(v-1);
g[v-1].pb(u-1);
}
}
//always use int
void contest(int t)
{
int s,p;
cin>>s>>p;
rec(i,1,sqrt(p)+1)
{
if(p%i!=0)
continue;
if((i + (p/i)) == s)
{
cout<<"Yes"<<endl;
return;
}
}
cout<<"No"<<endl;
}
//remember rec
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
#ifdef PUNEET_GOEL
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
//sieve(1e6);
int T=1;
//cin>>T;
rec(t,0,T)
{
contest(t);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
constexpr int inf=1000001000;
constexpr ll INF=2e18;
constexpr ll mod=1000000007;
// ll MOD=998244353;
ll MOD=998244353;
void Add(int &a, int b) {
a += b;
while (a >= MOD) a -= MOD;
while (a < 0) a += MOD;
}
void Mul(int &a, int b) {
a = 1LL * a * b % MOD;
}
int Pow(int b, int e) {
if (e < 0) e += MOD - 1;
int ret = 1;
while (e) {
if (e & 1) ret = 1LL * ret * b % MOD;
b = 1LL * b * b % MOD;
e >>= 1;
}
return ret;
}
int main() {
int n,k;
cin >> n >> k;
vector<ll> a(n);
rep(i,n) cin >> a[i];
// vector<vector<ll>> b(n,vector<ll>(k+1,1));
vector<ll> b(n,1);
vector<ll> e(k+5,0);
rep(i,k+1) e[i]=Pow(i,MOD-2);
vector<ll> c(k+1,0);
rep(i,n){
rep(j,k+1){
(c[j]+=b[i])%=MOD;
b[i]=(b[i]*a[i]%MOD*e[j+1])%MOD;
}
}
// rep(i,n){
// rep(j,k+1) (c[j]+=b[i][j])%=MOD;
// }
vector<ll> ans(k+1);
ans[1]=1;
rep(i,k){
ans[i+2]=(ans[i+1]*(i+2))%MOD;
}
vector<ll> o(k,0);
rep(i,k){
rep(j,k+1){
if (i+1-j<0) break;
(o[i]+=c[j]*c[i+1-j]%MOD)%=MOD;
}
}
vector<ll> p(k+2,0);
ll cc;
rep(i,n){
cc=a[i]*2;
rep(j,k) {
(p[j]+=cc)%=MOD;
(cc*=a[i]*2)%=MOD;
}
}
rep(i,k) cout << ((ans[i+1]*o[i]%MOD+MOD-p[i])%MOD)*Pow(2,MOD-2)%MOD << endl;
}
| #define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define MAXN 1000005
#define INF 1000000000000000000
#define MOD 998244353
#define eps (1e-9)
#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
using namespace std;
#ifdef wiwihorz
#define print(a...) kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) {
while(L < R) cerr << *L << " \n"[next(L) == R], ++L;
}
void kout() {cerr << endl;}
template<class T1, class ... T2> void kout(T1 a, T2 ... e) {
cerr << a << " ", kout(e...);
}
#else
#define print(...) 0
#define vprint(...) 0
#endif
int n, m, k;
int pow_(int a, int times) {
int ans = 1;
for(;times > 0; times >>= 1, a = (a * a) % MOD) {
if(times & 1) ans = (ans * a) % MOD;
}
return ans;
}
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n >> m >> k;
if(m == 1 || n == 1) {
if(n < m) swap(n, m);
int ans = 0;
ans = pow_(k, n);
cout << (ans % MOD + MOD) % MOD << "\n";
}
else {
int ans = 0;
rep(i, 1, k) {
ans += (pow_(i, n) - pow_(i - 1, n))
* pow_(k - i + 1, m) % MOD;
ans %= MOD;
}
cout << (ans % MOD + MOD) % MOD << "\n";
}
return 0;
} |
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const int mod = 998244353;
int mult(int a, int b) {
return (1LL * a * b) % mod;
}
int sum(int a, int b) {
int s = a + b;
if (s >= mod) s -= mod;
return s;
}
int sub(int a, int b) {
int s = a - b;
if (s < 0) s += mod;
return s;
}
const int maxN = 3005;
int dp[maxN][maxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("input.txt", "r", stdin);
int n, k;
cin >> n >> k;
dp[0][0] = 1;
for (int cnt = 1; cnt <= n; cnt++) {
for (int s = cnt; s >= 1; s--) {
dp[cnt][s] = dp[cnt - 1][s - 1];
if (cnt >= 2 * s) {
dp[cnt][s] = sum(dp[cnt][s], dp[cnt][2 * s]);
}
}
}
cout << dp[n][k];
return 0;
} | #include<bits/stdc++.h>
#define it register int
#define ct const int
#define il inline
using namespace std;
typedef long long ll;
#define rll register ll
#define cll const ll
const int N=5005;
#define P 998244353
int fac[N],sz[N],k,n,cnt,ans,f[N][N];
il void mo(it&p,ct q){p+=q,p=(p>=P?p-P:p);}
int main(){
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
scanf("%d%d",&n,&k);it i,j;
if(k==n) return puts("1"),0;
f[0][0]=1;
for(j=1;j<=n;++j)
for(i=1;i<=j;++i){
f[i][j]=f[i-1][j-1];
if((i<<1)<=j-i) mo(f[i][j],f[i<<1][j-i]);
if((i-1<<1|1)<=j-i) mo(f[i][j],f[i-1<<1|1][j-i]);
}
for(i=1;i<=k;++i) mo(ans,f[i][n-k]);
printf("%d",ans);
return 0;
}
|
#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
int d[101][2];
int main() {
int a, b, x, y, i, j;
priority_queue<pair<int, pair<int, int>>> q;
scanf("%d %d %d %d", &a, &b, &x, &y);
for (i = 1; i <= 100; i++) {
for (j = 0; j < 2; j++) {
d[i][j] = 1e9;
}
}
d[a][0] = 0;
q.push(make_pair(0, make_pair(a, 0)));
while (!q.empty()) {
int r = -q.top().first;
int s = q.top().second.first;
int t = q.top().second.second;
q.pop();
if (d[s][t] != r) continue;
if (s == b && t == 1) {
printf("%d\n", r);
return 0;
}
if (d[s][1 - t] > r + x) {
d[s][1 - t] = r + x;
q.push(make_pair(-d[s][1 - t], make_pair(s, 1 - t)));
}
if (t == 0 && s - 1 >= 1 && d[s - 1][1 - t] > r + x) {
d[s - 1][1 - t] = r + x;
q.push(make_pair(-d[s - 1][1 - t], make_pair(s - 1, 1 - t)));
}
if (t == 1 && s + 1 <= 100 && d[s + 1][1 - t] > r + x) {
d[s + 1][1 - t] = d[s][t] + x;
q.push(make_pair(-d[s + 1][1 - t], make_pair(s + 1, 1 - t)));
}
if (s + 1 <= 100 && d[s + 1][t] > r + y) {
d[s + 1][t] = d[s][t] + y;
q.push(make_pair(-d[s + 1][t], make_pair(s + 1, t)));
}
if (s - 1 >= 1 && d[s - 1][t] > r + y) {
d[s - 1][t] = d[s][t] + y;
q.push(make_pair(-d[s - 1][t], make_pair(s - 1, t)));
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
template <typename T>
vector<T> Dijkstra(int s, vector<vector<pair<int, T>>>& G,
/*vector<int> & prev,*/ const T INF = 1e9) {
using P = pair<T, int>;
int V = G.size();
vector<T> dist(V, INF);
priority_queue<P, vector<P>, greater<P>> que;
dist[s] = 0;
que.emplace(0, s);
// prev.assign(V, -1);
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (dist[v] < p.first) continue;
for (int i = 0; i < (int)G[v].size(); i++) {
int to = G[v][i].first;
T cost = G[v][i].second;
if (dist[to] > dist[v] + cost) {
dist[to] = dist[v] + cost;
// prev[to] = v;
que.emplace(dist[to], to);
}
}
}
return dist;
}
constexpr int n = 100;
signed main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
a--;
b--;
vector<vector<pair<int, int>>> G(2 * n);
for (int i = 0; i < n; i++) {
G[i].emplace_back(n + i, x);
G[n + i].emplace_back(i, x);
}
for (int i = 0; i < n - 1; i++) {
G[i + 1].emplace_back(n + i, x);
G[n + i].emplace_back(i + 1, x);
G[i].emplace_back(i + 1, y);
G[i + 1].emplace_back(i, y);
G[n + i].emplace_back(n + i + 1, y);
G[n + i + 1].emplace_back(n + i, y);
}
auto dist = Dijkstra(a, G);
cout << dist[b + n] << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
void output(vector<int> &a){
cout << a.size();
for(auto &nx : a){
cout << ' ' << nx;
}
cout << '\n';
}
int main(){
int n;
cin >> n;
vector<int> a(n);
for(auto &nx : a){cin >> nx;}
vector<vector<int>> bk(200,vector<int>(0));
int cnt=min(n,8);
for(int i=1;i<(1<<cnt);i++){
int sig=0;
vector<int> s;
for(int j=0;j<cnt;j++){
if(i&(1<<j)){
s.push_back(j+1);
sig+=a[j];sig%=200;
}
}
if(bk[sig].size()!=0){
cout << "Yes\n";
output(bk[sig]);
output(s);
return 0;
}
else{bk[sig]=s;}
}
cout << "No\n";
return 0;
} | /*
author:ujwalll
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define nx cout << "\n";
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
#define pp pair<ll, ll>
#define ppi pair<int, int>
typedef long long int ll;
#define pri(x) printf("%d ", x);
#define prl(x) printf("%lld ", x);
#define fi first;
#define se second;
#define pb push_back;
#define all(v) v.begin(), v.end()
#define minimum 1
#define maximum 1e5
#define random minimum + (rand() % static_cast<int>(maximum - minimum + 1))
bool isPowerOfTwo(ll x){
return x && (!(x & (x - 1)));
}
void fastio(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
long long binpow(long long a, long long b){
long long res = 1;
while (b > 0)
{
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
// int dfstimer(int node, int par){
// st[node]=timer;
// ft[timer]=node;
// timer++;
// for(auto i:adj[node]){
// if(i!=par)dfs(i,node);
// }
// et[node]=timer;
// ft[timer]=node;
// timer++;
// }
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
////////////////////////////////////////////////////////////////////
map<int,char> mp;
int main(){
fastio();
int tc = 1;
// cin>>tc;
while(tc--){
int n;
cin>>n;
string s;
cin>>s;
int q;
cin>>q;
rep(i,2*n){
mp[i]=s[i];
}
int bi = 0;
while(q--){
int t,a,b;
cin>>t>>a>>b;
if(t==2)bi^=1;
else{
a--;
b--;
if(bi){
if(a>=n)a-=n;
else a+=n;
if(b>=n)b-=n;
else b+=n;
}
char c = mp[a];
mp[a]=mp[b];
mp[b]=c;
}
}
for(auto i:mp){
s[i.first]=i.second;
}
// cout<<bi;
if(bi){
string ans = "";
for(int i=n;i<2*n;i++)ans+=s[i];
rep(i,n)ans+=s[i];
cout<<ans;
}
else cout<<s;
done:;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int H, W, A, B, Ans;
void dfs(int p, int bitdp, int rec, int squ) {
// 終端
if (p == H * W) {
Ans++;
return;
}
// すでに利用済み
if (bitdp & 1 << p) dfs(p + 1, bitdp, rec, squ);
// 半畳を利用
if (squ && ~bitdp & 1 << p) dfs(p + 1, bitdp | 1 << p, rec, squ - 1);
// 畳を利用
if (rec) {
// 右へ遷移
if (p % W != W - 1 && ~bitdp & 1 << (p + 1)) dfs(p + 1, bitdp | 3 << p, rec - 1, squ);
// 下へ遷移
if (p + W < H * W) dfs(p + 1, bitdp | 1 << p | 1 << (p + W), rec - 1, squ);
}
}
int main() {
cin >> H >> W >> A >> B;
dfs(0, 0, A, B);
cout << Ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod1 = 1000000007;
using ll = long long;
using pq = priority_queue<ll>;
vector<int> dx = {0,1,0,-1};
vector<int> dy = {-1,0,1,0};
long long pow(long long x,long long n){
long long ans = 1;
while(n != 0){
long long a = x;
long long z = 1;
while(z*2 <= n){
a *=a;
a=a%mod1;
z*=2;
}
ans*=a;
ans=ans%mod1;
n-=z;
}
return ans;
}//累乗 x^n
template<typename T>
void input_vec(vector<T> &A,long long N){
for(int i = 0; i < N; i++){
cin >> A.at(i);
}
return;
}//入力を配列で受け取る
template<typename T>
void output_vec(vector<T> &A,long long N){
for(int i = 0; i < N; i++){
if(i != 0){
cout << " ";
}
cout << A.at(i);
}
cout << endl;
return;
}//配列を出力
template<typename T>
long long count_vec(vector<T> &A,T x){
long long counter = 0;
for(int i = 0; i < (int)A.size(); i++){
if(A.at(i) == x){
counter++;
}
}
return counter;
}//配列内のxの個数をreturn
vector<char> change_vec(string s,int n){
vector<char> ans(n);
for(int i = 0; i < n; i++){
ans.at(i) = s.at(i);
}
return ans;
}//文字列を配列に変換
void derete(vector<ll> &a){
vector<ll> b = a;
ll size = a.size();
for(int i = 0; i < size; i++){
b.at(i) = a.at(size-i-1);
}
b.pop_back();
a.pop_back();
for(int i = 0; i < size-1; i++){
a.at(i) = b.at(size-i-2);
}
return;
}
int main(){
ll a,b,c; cin >> a >> b >> c;
if(a == b) cout << a << endl;
if(a != b) cout << 3-a-b << endl;
}
|
#include <bits/stdc++.h>
int main(){
std::string S;
std::cin >> S;
int st = 8, ed = 10;
if(S.size() == 2){
st = 16; ed = 100;
}else if(S.size() >= 3){
st = 104; ed = 1000;
}
std::vector< int > eight;
for(int i=st; i<ed; i+=8){
int tmp = i;
bool zero = false;
while(tmp != 0){
int tmp2 = tmp % 10;
if(tmp2 == 0){
zero = true;
break;
}
tmp /= 10;
}
if(!zero){
eight.push_back(i);
}
}
std::vector< int > cnt(10, 0);
for(int i=0;i<S.size(); i++){
cnt[S[i] - '0']++;
}
for(int i=0;i<eight.size(); i++){
std::vector< int > cnt2(10, 0);
int digit3 = (eight[i] % 1000) / 100;
int digit2 = (eight[i] % 100) / 10;
int digit1 = (eight[i] % 10) / 1;
cnt2[digit3]++;
cnt2[digit2]++;
cnt2[digit1]++;
bool ok = 1;
for(int j=1; j<10; j++){
if(cnt[j] < cnt2[j]){
ok = 0;
}
}
if(ok){
std::cout << "Yes" << std::endl;
return 0;
}
}
std::cout << "No" << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil = pair<int, long>;
using pll = pair<long, long>;
#define fix20 cout << fixed << setprecision(20)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i,n) for(long i=0; i<(long)(n);i++)
#define REP(i,s,t) for(long i=s; i<t; i++)
#define RNG(i,s,t,u) for(long i=s; i<t; i+=u)
#define MOD 1000000007
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main(){
string s;
cin >> s;
vl cnt(10,0);
rep(i,s.size()){
int p = s.at(i) - '0';
cnt.at(p)++;
}
if(s.size() <= 3){
sort(all(s));
do{
int p = atoi(s.c_str());
if(p % 8 == 0){
YES;
return 0;
}
}while(next_permutation(all(s)));
NO;
return 0;
}
rep(i,1000){
vl ref(10,0);
bool flag = true;
if(i % 8 != 0) continue;
int p = i / 100;
int q = i % 100 / 10;
int r = i % 10;
ref.at(p)++;
ref.at(q)++;
ref.at(r)++;
rep(j,10){
if(ref.at(j) <= cnt.at(j)) continue;
flag = false;
}
if(flag){
YES;
return 0;
}
}
NO;
} |
#include <bits/stdc++.h>
using namespace std;
string A, B, C;
long long x, y, z;
int func(vector<int> &V)
{
x = y = z = 0;
for (int i=0; i<A.size(); i++)
{
int dig = V[ A[i] - 'a' ];
if (i == 0 && dig == 0)
return 0;
x = x * 10 + dig;
}
for (int i=0; i<B.size(); i++)
{
int dig = V[ B[i] - 'a' ];
if (i == 0 && dig == 0)
return 0;
y = y * 10 + dig;
}
for (int i=0; i<C.size(); i++)
{
int dig = V[ C[i] - 'a' ];
if (i == 0 && dig == 0)
return 0;
z = z * 10 + dig;
}
return (x + y == z);
}
int solve(int mask, int maxx, vector<int> &V)
{
if (V.size() == maxx)
return func(V);
for (int i=0; i<10; i++)
{
if (mask & (1 << i))
continue;
V.push_back(i);
if (solve((mask | (1 << i)), maxx, V))
return 1;
V.pop_back();
}
return 0;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
cin >> A >> B >> C;
map<char, char> S;
for (auto a : A)
S[a];
for (auto b : B)
S[b];
for (auto c : C)
S[c];
if (S.size() > 10)
{
cout << "UNSOLVABLE\n";
return 0;
}
char ptr = 'a';
for (auto &it: S)
it.second = ptr++;
for (auto &a : A)
a = S[a];
for (auto &b : B)
b = S[b];
for (auto &c : C)
c = S[c];
vector<int> V;
if (!solve(0, S.size(), V))
cout << "UNSOLVABLE\n";
else
cout << x << "\n" << y << "\n" << z << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
char s1[15],s2[15],s3[15];
int a[15],b[15],c[15];
int n,m,k;
char dig[45];
int len;
void Discretize() {
for(int i=1;i<=n;i++) {
dig[++len]=s1[i];
}
for(int i=1;i<=m;i++) {
dig[++len]=s2[i];
}
for(int i=1;i<=k;i++) {
dig[++len]=s3[i];
}
sort(dig+1,dig+len+1);
len=unique(dig+1,dig+len+1)-dig-1;
for(int i=1;i<=n;i++) {
a[i]=(lower_bound(dig+1,dig+len+1,s1[i])-dig);
}
for(int i=1;i<=m;i++) {
b[i]=(lower_bound(dig+1,dig+len+1,s2[i])-dig);
}
for(int i=1;i<=k;i++) {
c[i]=(lower_bound(dig+1,dig+len+1,s3[i])-dig);
}
}
int match[11];//What i in the strings correspond to
bool vis[11];
bool hasLead[11];
bool check() {
ll x=0,y=0,z=0;
for(int i=1;i<=n;i++) {
x=x*10+match[a[i]];
}
for(int i=1;i<=m;i++) {
y=y*10+match[b[i]];
}
for(int i=1;i<=k;i++) {
z=z*10+match[c[i]];
}
if(x+y==z) {
printf("%lld\n%lld\n%lld",x,y,z);
return 1;
}
return 0;
}
bool dfs(int step) {
if(step==len+1) {
if(check()) {
return 1;
}
return 0;
}
for(int i=(hasLead[step]?1:0);i<=9;i++) {
if(!vis[i]) {
vis[i]=1;
match[step]=i;
if(dfs(step+1)) {
return 1;
}
vis[i]=0;
}
}
return 0;
}
int main() {
scanf("%s %s %s",s1+1,s2+1,s3+1);
n=strlen(s1+1),m=strlen(s2+1),k=strlen(s3+1);
Discretize();
if(len>10) {
printf("UNSOLVABLE");
return 0;
}
hasLead[a[1]]=hasLead[b[1]]=hasLead[c[1]]=1;
if(!dfs(1)) {
printf("UNSOLVABLE");
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0,endrep=(n); i<endrep; ++i)
#define rep1(i,n) for(ll i=1,endrep=(n); i<=endrep; ++i)
#define revrep(i,n) for(ll i=(n)-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 60) -123456789;
#define fastio cin.tie(0); ios_base::sync_with_stdio(false); cout<<fixed<<setprecision(10);
#define newl '\n'
#define YN(e) ((e)?"Yes":"No")
#define all(a) begin(a),end(a)
#define rall(a) rbegin(a),rend(a)
template <class T,class U> bool updmax(T& a, U b) { if(b>a){ a=b; return true;} return false;}
template <class T,class U> bool updmin(T& a, U b) { if(b<a){ a=b; return true;} return false;}
inline constexpr int Mod = 1000000007;
//inline constexpr int Mod = 998244353;
#define dbg(a) cout << #a << ": " << a << endl;
#define dbg1(a,n) cout<<#a<<": "; rep(i,n) cout<<a[i]<<" "; cout<<endl;
#define dbg2(m,h,w) cout<<#m<<":"<<endl; rep(i,h){ rep(j,w)cout<<m[i][j]<<" "; cout<<endl; }
int rng(int n) { return rand()/(RAND_MAX+1.0)*n; }
ll s(ll n) {
if (n <= 0) return 0;
return (n+1)*n/2;
}
template <ll Mod>
class modint {
public:
ll n=0;
modint(){}
modint(ll n):n(n){ clamp(); }
modint& operator = (modint const& a) = default;
modint& operator = (int a) { n = a; clamp(); return *this; }
modint operator - () { modint t = *this; t.n = -t.n; t.clamp(); return t; }
modint& operator *= (modint const& a) { n *= a.n; clamp(); return *this; }
modint& operator *= (ll a) { n *= a; clamp(); return *this; }
modint& operator /= (modint const& a) { *this *= a.inv(); return *this; }
modint& operator += (modint const& a) { n += a.n; if (n >= Mod) n -= Mod; return *this; }
modint& operator -= (modint const& a) { n -= a.n; if (n < 0) n += Mod; return *this; }
modint& operator %= (modint const& a) { n %= a.n; clamp(); return *this; }
friend modint operator * (modint a, modint b) { modint t(a); t.n *= b.n; t.clamp(); return t; }
friend modint operator + (modint a, modint b) { modint t(a); t.n += b.n; t.clamp(); return t; }
friend modint operator - (modint a, modint b) { modint t(a); t.n -= b.n; t.clamp(); return t; }
friend ostream& operator << (ostream& os, modint const& a) { os << a.n; return os; }
friend bool operator == (modint const& a, int b) { return a.n == b; }
void clamp() { n %= Mod; if (n < 0) n += Mod; }
modint inv() const { return this->pow(Mod-2); }
ll get() { return n; }
modint pow(ll p) const {
ll a=1, e=n;
while (p > 0) {
if (p&1) { a *= e; a %= Mod; }
e *= e; e %= Mod; p >>= 1;
}
return modint(a);
}
};
using mint = modint<Mod>;
int main() {
fastio;
ll T;
cin >> T;
while(T-- > 0) {
ll N,A,B;
cin >> N >> A >> B;
ll ad = N-A+1;
ll bd = N-B+1;
ll z = s(N-A)-s(B-1);
if (z < 0) z = 0;
mint xs = z;
ll t = N-A-B+1;
if (t < 0) t = 0;
mint bm = t;
mint p = xs+bm*(-B+1);
mint dup = p*p;
mint h = ad*bd * p;
mint ans = h*4 - dup*4;
cout << ans.get() << newl;
}
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se second
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)
#define rep2(i, a, b) for (int i = (int)(a), i##_len=(b); i < i##_len; i++)
#define rep3(i, a, b) for (int i = (int)(a), i##_len=(b); i >= i##_len; i--)
#define FOR(i, a) for (auto &i: a)
#define ALL(obj) begin(obj), end(obj)
#define _max(x) *max_element(ALL(x))
#define _min(x) *min_element(ALL(x))
#define _sum(x) accumulate(ALL(x), 0LL)
const int MOD = 998244353;
const int INF = 10000000000007; // 1e13 + 7
const int INF2 = LLONG_MAX; // 9.2e18
const double EPS = 1e-8;
const double PI = 3.14159265358979;
template <class T> using V = vector<T>;
template <class T> using VV = vector<vector<T>>;
template <class T> using VVV = vector<vector<vector<T>>>;
template <class T, class S> using P = pair<T, S>;
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}
template<class T> bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}
int _ceil(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }
template<class T> T chmod(T &a, T mod=MOD) {a = a >= 0 ? a % mod : a - (mod * _ceil(a, mod)); return a;};
int _mod(int a, int mod=MOD) {return a >= 0 ? a % mod : a - (mod * _ceil(a, mod));}
int _pow(int a, int b) {int res = 1;for (a %= MOD; b; a = a * a % MOD, b >>= 1)if (b & 1) res = res * a % MOD;return res;}
struct mint {long long x;mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}mint operator-() const { return mint(-x); }mint &operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint &operator-=(const mint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}mint &operator*=(const mint a) { (x *= a.x) %= MOD;return *this; }mint operator+(const mint a) const { return mint(*this) += a; }mint operator-(const mint a) const { return mint(*this) -= a; } mint operator*(const mint a) const { return mint(*this) *= a; }mint pow(long long t) const {if (!t) return 1;mint a = pow(t >> 1);a *= a;if (t & 1) a *= *this;return a;}mint inv() const { return pow(MOD - 2); }mint &operator/=(const mint a) { return *this *= a.inv(); }mint operator/(const mint a) const { return mint(*this) /= a; }};istream &operator>>(istream &is, mint &a) { return is >> a.x; }ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// clang-format on
struct UnionFind {
vector<int> d;
UnionFind(int n = 0) : d(n, -1) {} //0からn-1
int find(int x) { return (d[x] < 0 ? x : d[x] = find(d[x])); }
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return false;
if (d[x] > d[y]) swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) { return -d[find(x)]; }
};
class BSpecialSubsets {
public:
static void solve(istream &cin, ostream &cout) {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int N;
cin >> N;
V<int> f(N);
rep(i, N) cin >> f[i];
UnionFind uf(N + 1);
rep(i, N) uf.unite(i + 1, f[i]);
int ans = 1;
V<bool> already(N + 1);
rep(i, N) {
if (!already[uf.find(i + 1)]) {
ans *= 2;
ans %= MOD;
already[uf.find(i + 1)] = true;
}
}
cout << _mod(ans - 1) << endl;
}
};
signed main() {
BSpecialSubsets solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
double arr[105][105][105];
double f(int a, int b, int c) {
if (arr[a][b][c]) return arr[a][b][c];
if (a == 100 || b == 100 || c == 100) return 0.0;
double ans = 0.0;
ans += (f(a + 1, b, c) + 1) * a / (a + b + c);
ans += (f(a, b + 1, c) + 1) * b / (a + b + c);
ans += (f(a, b, c + 1) + 1) * c / (a + b + c);
arr[a][b][c] = ans;
return ans;
}
int main() {
double a, b, c;
cin >> a >> b >> c;
double res = f(a, b, c);
cout << fixed << setprecision(9) << res;
}
| #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 = 1000000007;
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);}
int main() {
int N; cin >> N;
ll X; cin >> X;
vecl A(N);
REP(i,N) {
ll v,p; cin >> v >> p;
A[i] = v*p;
}
ll total = 0;
REP(i,N) {
total += A[i];
if(total > X*100) {
cout << i+1 << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
#define INF 0x3f3f3f3f
const int N=600010,mod=1e9+7,P=19260817;
ll n,m,T,k,x,cnt,y,b[N],c[N],vis[N],ans,t,a[N],x2,y2;
string s;
int main()
{
scanf("%lld%lld",&n,&m);
if (n==1)
{
if (m==0) printf("%lld %lld\n",(ll)1,(ll)2); else printf("%lld\n",(ll)-1);
return 0;
}
if (m>n-2||m<0)
{
printf("%lld\n",(ll)-1);
return 0;
}
if (m>=0)
{
printf("1 %lld\n",2*n-1);
for (ll i=1;i<=m;i++) printf("%lld %lld\n",i*2,i*2+1);
printf("%lld %lld\n",n*2-2,n*2);
for (ll i=1;i<=n-m-2;i++) printf("%lld %lld\n",n*2+i*2-1,n*2+i*2);
}
else
{
//printf("%lld %lld\n",(ll)1,(ll)3);
//for (ll i=1;i<=-m;i++) printf("%lld %lld\n",i*2+2,i*2+3);
//printf("%lld %lld\n",(ll)2,n*2);
//for (ll i=1;i<=n+m-2;i++) printf("%lld %lld\n",n*2+i*2-1,n*2+i*2);
}
} | #include <bits/stdc++.h>
using namespace std;
long long qwq(long long a, long long b) {
long long ans = 1;
while (b) {
if (b & 1) {
ans = ans * a % 1000000007;
}
a *= a;
a %= 1000000007;
b >>= 1;
}
return ans;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
printf("%lld\n", qwq(m - 2, n - 1) * (m - 1) % 1000000007);
return 0;
} |
#include<stdio.h>
int main(void){
int n;
scanf("%d",&n);
printf("%d",n-1);
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a*d - b*c << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define fast ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> dsu,sz,rnk;
vector<vector<pair<int,int>>> g;
vector<int> color;
void init(int n,int x){
dsu = sz = rnk = vector<int> (n+x);
iota(dsu.begin()+x,dsu.end(),x);
fill(sz.begin(),sz.end(),1);
}
int find(int u){
return u == dsu[u] ? u : dsu[u] = find(dsu[u]);
}
void merge(int u,int v){
u = find(u);
v = find(v);
if(u == v)return;
if(sz[u] < sz[v])swap(u,v); // enable for fast dsu
// if(rnk[u] > rnk[v])swap(u,v);
sz[u] += sz[v];
rnk[v] = rnk[u] + 1;
dsu[v] = u;
}
set<int> st;
void dfs(int u,int p,int t){
if(t == -1){
for(pair<int,int> c : g[u])st.erase(c.second);
color[u] = *st.begin();
for(pair<int,int> c : g[u])st.insert(c.second);
}else{
color[u] = t;
}
// cerr << u << ' ' << p << ' ' << t << '\n';
for(pair<int,int> c : g[u]){
int v = c.first;
int w = c.second;
if(v == p)continue;
if(w == color[u])dfs(v,u,-1);
else dfs(v,u,w);
}
}
int main(){
fast
int n,m;
cin>>n>>m;
color.resize(n);
for(int i=1;i<=n;i++)st.insert(i);
g.resize(n);
init(n,0);
for(int i=0;i<m;i++){
int u,v,w;
cin>>u>>v>>w;
u--;v--;
if(find(u) != find(v)){
g[u].push_back({v,w});
g[v].push_back({u,w});
// cerr << u << ' ' << v << '\n';
merge(u,v);
}
}
dfs(0,-1,-1);
for(int c : color)
cout << c << '\n';
} | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+5;
const int LOGN=log2(N+10)+1;
int depth[N+1], a[N], b[N], delta[N], ans[N];
int parent[LOGN][N];
vector<int>edges[N];
int n;
void init(int n){
for(int bit=0;bit<LOGN;bit++){
for(int i=0;i<n;i++){
parent[bit][i]=-1;
}
}
}
void dfs(int s,int p,int dep){
depth[s]=dep;
parent[0][s]=p;
for(int bit=1;bit<LOGN;bit++){
if(parent[bit-1][s]!=-1){
parent[bit][s]=parent[bit-1][parent[bit-1][s]];
}
}
for(auto x:edges[s]){
if(x==p) continue;
dfs(x,s,dep+1);
}
}
int lca(int u,int v){
if(depth[u]<depth[v]) swap(u,v);
int diff=depth[u]-depth[v];
for(int bit=0;bit<LOGN;bit++) if((diff>>bit)&1) u=parent[bit][u];
if(u==v) return u;
for(int bit=LOGN-1;bit>=0;bit--)
if(parent[bit][u]!=parent[bit][v]) {
u=parent[bit][u];
v=parent[bit][v];
}
return parent[0][u];
}
int dist(int a,int b){
int c=lca(a,b);
return depth[a]+depth[b]-2*depth[c];
}
int getNode(int a,int dist){
for(int bit=0;bit<LOGN;bit++){
if(dist&(1ll<<bit)){
a=parent[bit][a];
}
}
return a;
}
void dfs2(int s,int p,int change){
ans[s]=delta[s]+change;
for(auto x:edges[s]){
if(x==p) continue;
dfs2(x,s,change+delta[s]);
}
}
void solve(){
cin>>n;
init(n);
for(int i=0;i+1<n;i++){
cin>>a[i]>>b[i];
a[i]--;b[i]--;
edges[a[i]].push_back(b[i]);
edges[b[i]].push_back(a[i]);
}
dfs(0,-1,0);
int q;cin>>q;
while(q--){
int t,e,x;cin>>t>>e>>x;
e--;
int A=a[e], B=b[e];
// cout<<A<<" "<<B<<"\n";
if(t==2) swap(A,B);
// cout<<A<<" "<<B<<"\n";
// Spcl Care
if(lca(A,B)==B){
// cout<<A<<" "<<B<<"\n";
// cout<<"Coming Here\n";
// delta[B]-=x;
int node=getNode(A, dist(A, B)-1);
delta[node]+=x;
continue;
}
delta[B]-=x;
// cout<<"B="<<B<<"\n";
delta[0]+=x;
}
// for(int i=0;i<n;i++) cout<<delta[i]<<" ";cout<<"\n";
dfs2(0,-1,0);
for(int i=0;i<n;i++) cout<<ans[i]<<"\n";
}
main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
solve();
} |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 200005
#define lowbit(x) (x&-x)
#define reg register
typedef long long LL;
typedef unsigned long long uLL;
typedef unsigned int uint;
const int INF=0x7f7f7f7f;
const int jzm=233;
const int mo=998244353;
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;
}
LL a,b,prime[100],cntp,val[100],tot,S[100],dp[(1<<20)+5],ans;
bool oula[100];
void init(){
for(LL i=2;i<=72;i++){
if(!oula[i])prime[++cntp]=i;
for(LL j=1;j<=cntp&&1ll*prime[j]*i<=72;j++){
oula[prime[j]*i]=1;
if(i%prime[j]==0)break;
}
}
}
int main(){
read(a);read(b);init();dp[0]=1;int lim=(1<<cntp)-1;
for(LL i=a;i<=b;i++)val[++tot]=i;
for(int i=1;i<=tot;i++){
for(int j=1;j<=cntp;j++)
if(val[i]%prime[j]==0)S[i]|=(1<<j-1);
}
for(int i=1;i<=tot;i++)
for(int j=lim;j>=0;j--)
if(!(j&S[i]))dp[j|S[i]]+=dp[j];
for(int j=0;j<=lim;j++)ans+=dp[j];
printf("%lld\n",ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
ll A, B;
cin >> A >> B;
vector<int> primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
int K = primes.size();
vector<ll> from(1<<K, 0), to(1<<K, 0);
from[0] = 1;
for (ll i = A; i <= B; i++) {
fill(to.begin(), to.end(), 0);
ll mask = 0;
for (int j = 0; j < K; j++) {
if (i%primes[j] == 0) mask |= (1<<j);
}
for (int j = 0; j < (1<<K); j++) {
to[j] += from[j];
if ((j&mask) == 0) to[j|mask] += from[j];
}
swap(from, to);
}
ll ans = 0;
for (ll n : from) ans += n;
cout << ans << endl;
return 0;
}
|
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using std::swap;
using std::reverse;
using std::priority_queue;
using std::nth_element;
using std::next_permutation;
using std::upper_bound;
using std::lower_bound;
using std::unique;
using std::sort;
using std::max;
using std::min;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::bitset;
using std::set;
using std::map;
using std::vector;
using std::queue;
using std::stack;
using std::pair;
using std::make_pair;
using std::complex;
using std::deque;
using std::list;
ll read() {
register ll x = 0, f = 0, ch = getchar();
for (; !isdigit(ch); f = (ch == 45), ch = getchar()) ;
for (; isdigit(ch); x = x * 10 + ch - 48, ch = getchar()) ;
return f ? -x : x;
}
void write(int x) {
if (x < 0) putchar(45), x = -x;
static int sta[35];
int top = 0;
do {
sta[top++] = x % 10, x /= 10;
} while (x);
while (top) putchar(sta[--top] + 48);
}
const int maxn = 2e5 + 9, maxm = 2e5 + 9, inf = 0x3f3f3f3f;
ll t, n, m;
ll a[maxn], b[maxn], res;
std::pair<ll, int> c[maxn];
ll myabs(ll x) { return x > 0 ? x : -x; }
int main() {
// freopen(".in", "r", stdin);
// freopen(".out", "w", stdout);
t = read(), n = read(), m = read();
for (int i = 1; i <= t; ++i)
a[i] = read(), b[i] = a[i] * m / n, res += b[i],
c[i] = std::make_pair(myabs(a[i] * m - (b[i] + 1) * n) - myabs(a[i] * m - b[i] * n), i);
res = m - res;
std::sort(c + 1, c + t + 1);
for (int i = 1; res && i <= n; ++i) b[c[i].second]++, res--;
for (int i = 1; i <= t; ++i) printf("%lld ", b[i]);
puts("");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define fi first
#define se second
#define ll long long
#define tp top()
#define fr front()
#define vi vector<int>
#define sz size()
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define mem(a, b) memset(a, (b), sizeof(a))
#define clr(a) memset(a, 0, sizeof(a))
#define sqr(x) ( (x) * (x) )
#define all(v) v.begin(), v.end()
typedef pair<int, int> pii;
typedef pair<int,pii> pip;
typedef pair<pii,int> ppi;
typedef pair<pii,pii> ppp;
void base(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
#define N 100020
vector<int> adj[N];
int a[100020];
int par[100020];
vector<int> ans;
void dfs(int cur, int pa){
if (par[a[cur]] == -1) {
par[a[cur]] = cur;
ans.pb(cur);
}
for(int to : adj[cur]){
if (pa == to) continue;
dfs(to,cur);
}
if (par[a[cur]] == cur) {
par[a[cur]] = -1;
}
}
void solve(){
mem(par,-1);
int n; cin>>n;
rep(i,1,n+1) cin>>a[i];
rep(i,0,n-1){
int u,v; cin>>u>>v;
adj[u].pb(v);
adj[v].pb(u);
}
dfs(1,1);
sort(all(ans));
for(int x : ans) cout<<x<<"\n";
}
int main()
{
base();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a) for(int i = 0; i < (int) a; i++)
#define PB push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int grid[2007][2007];
int n;
vector<pair<int,int>> graph[2007];
int dist[2007];
void dijsktra(int s){
for(int i = 0; i < n; i++) dist[i] = INT_MAX;
priority_queue<pair<int,int>,
vector<pair<int,int>>,
::greater<pair<int,int>> > q;
q.push({0, s});
bitset<2007> vis(0);
while(!q.empty()){
int now = q.top().second; q.pop();
if(vis[now]) continue;
vis[now] = 1;
for(auto v : graph[now]){
if(now == s){
dist[v.second] = v.first;
q.push({dist[v.second], v.second});
}else if(dist[v.second] > dist[now] + v.first){
dist[v.second] = dist[now] + v.first;
q.push({dist[v.second], v.second});
}
}
}
}
int main(){
ios::sync_with_stdio(false); cin.tie(0);
int m; cin >> n >> m;
FOR(i, n) FOR(j, n) grid[i][j] = 1e9;
FOR(i, m){
int a, b, c; cin >> a >> b >> c;
a--; b--;
grid[a][b] = min(grid[a][b], c);
}
FOR(i, n){
FOR(j, n){
if(grid[i][j] != 1e9){
graph[i].PB({grid[i][j], j});
}
}
}
FOR(i, n){
dijsktra(i);
if(dist[i] == INT_MAX) cout << "-1\n";
else cout << dist[i] << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
using llpair = pair<llong, lpair>;
#define ALL(x) x.begin(), x.end()
constexpr llong mod = 1e9+7;
constexpr llong inf = mod * mod;
struct union_find {
std::vector<int> par;
vector<unordered_map<int, int>> sum;
union_find() {}
union_find(int n) :
par(n+1, -1)
{}
int root(int x) {
if(par[x] < 0) return x;
return par[x] = root(par[x]);
}
int size(int x) {
return -par[root(x)];
}
bool same(int a, int b) {
return root(a) == root(b);
}
bool marge(int a, int b) {
a = root(a), b = root(b);
if(a == b) return false;
if(par[a] > par[b]) std::swap(a, b);
par[a] += par[b];
par[b] = a;
for (auto it: sum[b]) {
sum[a][it.first] += it.second;
}
return true;
}
int query(int x, int y) {
return sum[root(x)][y];
}
};
int main() {
llong N, Q;
vector<llong> C;
vector<llpair> query;
cin >> N >> Q;
C.resize(N);
for (auto &in: C) {
cin >> in;
in--;
}
query.resize(Q);
for (auto &in: query) {
cin >> in.first >> in.second.first >> in.second.second;
in.second.first--;
in.second.second--;
}
union_find uf(N);
uf.sum.resize(N);
for (int i = 0; i < N; i++) {
uf.sum[i][C[i]] = 1;
}
for (auto q: query) {
if (q.first == 1) {
llong a = q.second.first;
llong b = q.second.second;
uf.marge(a, b);
}
else {
llong x = q.second.first;
llong y = q.second.second;
cout << uf.query(x, y) << endl;
}
}
return 0;
} |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <tuple>
#include <cmath>
using namespace std;
#define _GLIBCXX_DEBUG
int main(void){
char S, T;
cin >> S >> T;
if(S == 'Y'){
if(T == 'a'){
cout << 'A' << endl;
}
else if(T == 'b'){
cout << 'B' << endl;
}
else{
cout << 'C' << endl;
}
}
else{
cout << T << endl;
}
} | #include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <random>
#include <stack>
#include <set>
#include <unordered_set>
#define bug(x) cout<<"zdongdebug1: "<<x<<endl;
#define bug2(x, y) cout<<"zdongdebug2: "<<x<<" "<<y<<endl;
#define bug3(x, y, z) cout<<"zdongdebug3: "<<x<<" "<<y<<" "<<z<<endl;
using namespace std;
typedef long long ll;
const int maxn = 105;
const int mod = 998244353;
int main() {
#ifdef suiyuan2009
freopen("/Users/suiyuan2009/CLionProjects/icpc/input.txt", "r", stdin);
//freopen("/Users/suiyuan2009/CLionProjects/icpc/output.txt", "w", stdout);
#endif
string s, t;
cin>>s>>t;
if(s[0]=='N')cout<<t<<endl;
else {
cout<<char(t[0] - 'a' + 'A')<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1e18;
//const ll mod = 1000000007;
ll ans = 0;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
vector<ll> A[2];
vector<ll> sum[2];
cin >> N;
ll T;
cin >> T;
for(int i = 0; i < N; i++) {
ll a;
cin >> a;
A[i%2].push_back(a);
}
for(int i = 0; i < 2; i++) {
for(int bits = 0; bits < (1 << A[i].size()); bits++) {
ll tmp = 0;
for(int j = 0; j < A[i].size(); j++) {
if(bits & (1 << j)) tmp += A[i][j];
}
sum[i].push_back(tmp);
}
sort(sum[i].begin(), sum[i].end());
}
for(auto tmp : sum[0]) {
auto itr = lower_bound(sum[1].begin(), sum[1].end(), T+1-tmp);
if(itr == sum[1].begin()) continue;
itr--;
chmax(ans, tmp + *itr);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fast_io cin.tie(0);ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"';}
string to_string(char s) { return string(1, s);}
string to_string(const char* s) { return to_string((string) s);}
string to_string(bool b) { return (b ? "true" : "false");}
template <typename A> string to_string(A);
template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}
template <typename A> string to_string(A v) {bool f = 1; string r = "{"; for (const auto &x : v) {if (!f)r += ", "; f = 0; r += to_string(x);} return r + "}";}
void debug_out() { cout << endl; }
void show() { cout << endl; }
void pret() { cout << endl; exit(0);}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {cout << " " << to_string(H); debug_out(T...);}
template <typename Head, typename... Tail> void show(Head H, Tail... T) {cout <<H<<" "; show(T...);}
template <typename Head, typename... Tail> void pret(Head H, Tail... T) {cout <<H<<" "; pret(T...);}
#define pr(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
#define disp(x) cout<<x<<" ";
#define rep(i,a,b) for(int i=a;i<(int)b;i++)
#define fo(i,a,b) for(int i=a;i<=(int)b;i++)
#define rf(i,a,b) for(int i=a;i>=(int)b;i--)
#define mp make_pair
#define pb emplace_back
#define F first
#define S second
#define endl '\n'
//cout.setf(ios::fixed);cout.precision(18)
const int MOD = 1e9+7;
int maxn = 100+1;
int dp[101][101][101];
int newdp[101][101][101];
int32_t main(){
fast_io;
int n;
ll x;
cin >> n >> x;
maxn = n + 1;
int a[n + 1];
for (int i = 0; i < n; ++i)
{
cin >> a[i + 1];
}
for (int i = 0; i < maxn; ++i)
{
for (int j = 0; j < maxn; ++j)
{
for (int k = 0; k < maxn; ++k)
{
dp[i][j][k] = -1;
}
}
}
for (int i = 1; i < maxn; ++i)
{
dp[0][i][0] = 0;
}
fo(id, 1, n){
// pr(dp);
for (int i = 0; i < maxn; ++i)
{
for (int j = 0; j < maxn; ++j)
{
for (int k = 0; k < maxn; ++k)
{
newdp[i][j][k] = dp[i][j][k];
}
}
}
// show("----- ", id);
fo(i, 1, id){
fo(dividend, 1, maxn){
for (int rem = 0; rem < maxn; ++rem)
{
if(dp[i - 1][dividend][rem] == -1) continue;
int curr = (dp[i - 1][dividend][rem] + a[id]) % dividend;
newdp[i][dividend][curr] = max(newdp[i][dividend][curr], dp[i - 1][dividend][rem] + a[id]);
}
}
// for (int rem = 0; rem < maxn; ++rem)
// {
// if(dp[i - 1][rem] == -1) continue;
// int curr = (dp[i - 1][rem] + a[id]) % i;
// pr(i, rem);
// show(newdp[i][curr], dp[i - 1][rem] + a[id]);
// newdp[i][curr] = max(newdp[i][curr], dp[i - 1][rem] + a[id]);
// }
}
for (int i = 0; i < maxn; ++i)
{
for (int j = 0; j < maxn; ++j)
{
for (int k = 0; k < maxn; ++k)
{
dp[i][j][k] = newdp[i][j][k];
}
// dp[i][j] = newdp[i][j];
}
}
}
ll ans = x;
for(ll i = 1; i <= n; i++){
int rem = x % i;
// show(i, rem, dp[i][i][rem]);
if(dp[i][i][rem] == -1) continue;
ll flag = dp[i][i][rem];
flag = x - flag;
// show(flag, flag / i);
ans = min(ans, flag / i);
}
show(ans);
return 0;
} |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pll pair<ll,ll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ub(v,val) upper_bound(v.begin(),v.end(),val)
#define np(str) next_permutation(str.begin(),str.end())
#define lb(v,val) lower_bound(v.begin(),v.end(),val)
#define sortv(vec) sort(vec.begin(),vec.end())
#define rev(p) reverse(p.begin(),p.end());
#define v vector
#define len length()
#define repc(i,s,e) for(ll i=s;i<e;i++)
#define fi first
#define se second
#define mset(a,val) memset(a,val,sizeof(a));
#define mt make_tuple
#define repr(i,n) for(i=n-1;i>=0;i--)
#define rep(i,n) for(i=0;i<n;i++)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define at(s,pos) *(s.find_by_order(pos))
#define set_ind(s,val) s.order_of_key(val)
long long int M = 1e9 + 7 ;
long long int inf = 9 * 1e18;
const double PI = acos(-1);
//CLOCK
ll begtime = clock();
#define time() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//CLOCK ENDED
ll n, m;
// modular exponentiation
ll binpow(ll val, ll deg)
{
if (deg < 0)
return 0;
if (!deg)
return 1 % M;
if (deg & 1)
return binpow(val, deg - 1) * val % M;
ll res = binpow(val, deg >> 1);
return (res * res) % M;
}
//binomial
ll modinv(ll n) {
return binpow(n, M - 2);
}
ll dp[3005][3005], ways[3005][3005];
int main() {
// your code goes here
IOS;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll i, j, t, k, x, y, z, N;
//dp[i][j] denotes ith index tak aur j groups
//ways[i][j] sum%i==j
mset(dp, 0);
mset(ways, 0);
dp[0][0] = 1;
ll sum = 0;
ways[1][0] = 1;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
rep(i, n) {
sum += a[i];
repr(j, n) {
ll rem = sum % (j + 1);
(dp[i + 1][j + 1] += ways[j + 1][rem]) %= M;
(ways[j + 2][sum % (j + 2)] += dp[i + 1][j + 1]) %= M;
}
}
// rep(i, n + 1) {
// rep(j, n + 1) {
// debug(i, j, dp[i][j]);
// }
// }
ll ans = 0;
for (i = 1; i <= n; i++) (ans += dp[n][i]) %= M;
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
template<class T> T T_INF(){ return 1000000000000000000; }
template<> int T_INF<int>(){ return 1000000000; }
template<int MOD> struct modint{
ull val;
modint(ull x){ val=x%MOD; }
modint(){}
friend modint modpow(modint x,ull k){
modint ret(1ULL);
while(k>0){
if(k&1ULL)ret*=x;
x*=x;
k>>=1;
}
return ret;
}
modint& operator +=(const modint& rhs){
this->val+=rhs.val;
if(this->val>=MOD)this->val-=MOD;
return *this;
}
friend modint operator+(modint lhs, const modint& rhs){
lhs+=rhs;
return lhs;
}
modint& operator -=(const modint& rhs){
this->val+=MOD-rhs.val;
if(this->val>=MOD)this->val-=MOD;
return *this;
}
friend modint operator-(modint lhs, const modint& rhs){
lhs-=rhs;
return lhs;
}
modint& operator *=(const modint& rhs){
this->val*=rhs.val;
this->val%=MOD;
return *this;
}
friend modint operator*(modint lhs, const modint& rhs){
lhs*=rhs;
return lhs;
}
static vector<modint> inv_;
static void precalc_inv_(int k){
int t=inv_.size();
inv_.resize(k);
for(int i=t;i<k;i++){
inv_[i]=modpow(modint(i),MOD-2);
}
}
modint& operator /=(const modint& rhs){
//if(rhs.val<inv_.size()){
// (*this)*=inv_[rhs.val];
//}
//else {
(*this)*=modpow(rhs,MOD-2);
//}
return *this;
}
friend modint operator/(modint lhs, const modint& rhs){
lhs/=rhs;
return lhs;
}
static vector<vector<modint>> C_;
static vector<modint> fac,inv_fac;
static void precalc_C_(int k){
C_.resize(k,vector<modint>(k));
for(int i=0;i<k;i++){
C_[i][0]=C_[i][i]=1;
for(int j=1;j<=i-1;j++){
C_[i][j]=C_[i-1][j-1]+C_[i-1][j];
}
}
}
static void precalc_fac(int k){
fac.resize(k);
inv_fac.resize(k);
fac[0]=inv_fac[0]=1;
for(int i=1;i<k;i++){
fac[i]=fac[i-1]*i;
inv_fac[i]=modpow(fac[i],MOD-2);
}
}
static modint C(ll n,ll k,int type=0){
if(k<0||k>n)return 0;
if(type==0){
return C_[n][k];
}
else {
return fac[n]*inv_fac[k]*inv_fac[n-k];
}
}
};
template<int MOD> vector<modint<MOD>> modint<MOD>::inv_;
template<int MOD> vector<vector<modint<MOD>>> modint<MOD>:: C_;
template<int MOD> vector<modint<MOD>> modint<MOD>::fac;
template<int MOD> vector<modint<MOD>> modint<MOD>::inv_fac;
const int MOD=1000000007;
typedef modint<MOD> mi;
int n;
ll a[3002];
ll s[3002];
mi dp[3002][3002];
mi temp[3002];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
s[0]=0;
for(int i=1;i<=n;i++)s[i]=s[i-1]+a[i];
mi ret=0;
dp[0][0]=1;
for(int i=1;i<=n;i++){
fill_n(temp,3002,0);
for(int j=0;j<=n;j++){
dp[i][j]=temp[s[j]%i];
temp[s[j]%i]+=dp[i-1][j];
}
ret+=dp[i][n];
}
cout<<ret.val<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
double EPS=1e-9;
int INF=1000000005;
long long INFF=1000000000000000005ll;
double PI=acos(-1);
int dirx[8]={ -1, 0, 0, 1, -1, -1, 1, 1 };
int diry[8]={ 0, 1, -1, 0, -1, 1, -1, 1 };
ll MOD = 1000000007;
#define DEBUG fprintf(stderr, "====TESTING====\n")
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
#define OUT(x) cout << x << "\n"
#define OUTH(x) cout << x << " "
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define READ(x) for(auto &(z):x) cin >> z;
#define FOR(a, b, c) for (int(a)=(b); (a) < (c); ++(a))
#define FORN(a, b, c) for (int(a)=(b); (a) <= (c); ++(a))
#define FORD(a, b, c) for (int(a)=(b); (a) >= (c); --(a))
#define FORSQ(a, b, c) for (int(a)=(b); (a) * (a) <= (c); ++(a))
#define FORC(a, b, c) for (char(a)=(b); (a) <= (c); ++(a))
#define EACH(a, b) for (auto&(a) : (b))
#define REP(i, n) FOR(i, 0, n)
#define REPN(i, n) FORN(i, 1, n)
#define MAX(a, b) a=max(a, b)
#define MIN(a, b) a=min(a, b)
#define SQR(x) ((ll)(x) * (x))
#define RESET(a, b) memset(a, b, sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
#define PERMUTE next_permutation
#define TC(t) while (t--)
#define FAST_INP ios_base::sync_with_stdio(false);cin.tie(NULL)
#define what_is(x) cerr << #x << " is " << x << endl
template<typename T_vector>
void output_vector(const T_vector &v, bool line_break = false, bool add_one = false, int start = -1, int end = -1) {
if (start < 0) start = 0;
if (end < 0) end = int(v.size());
for (int i = start; i < end; i++) {
cout << v[i] + (add_one ? 1 : 0) << (line_break ? '\n' : i < end - 1 ? ' ' : '\n');
}
}
const int mxN = 60;
int p[mxN];
void solve() {
int n; cin >> n;
// let x be root, k be LCA
// d(i, j) = d(k, i) ^ d(k, j)
// = d(k, i) ^ d(k, j) ^ d(x, k) ^ d(x, k)
// = (d(k, i) ^ d(x, k)) ^ (d(k, j) ^ d(x, k))
// = d(x, i) ^ d(x, j)
vector<vector<pll>> g(n), weight(n);
REP(i, n - 1) {
ll u, v, w; cin >> u >> v >> w;
--u, --v;
g[u].pb({v, w});
g[v].pb({u, w});
}
vl dist(n, -1);
dist[0] = 0;
queue<int> q;
q.push(0);
while(!q.empty()) {
int now = q.front(); q.pop();
EACH(x, g[now]) {
int next = x.fi;
ll sum = dist[now] ^ x.se;
if(dist[next] == -1) {
dist[next] = sum;
q.push(next);
}
}
}
ll ans = 0;
REP(i, mxN) {
vi cnt(2);
REP(j, n) cnt[dist[j] >> i & 1]++;
ans += (1LL << i) % MOD * cnt[0] % MOD * cnt[1];
ans %= MOD;
}
OUT(ans);
}
int main()
{
FAST_INP;
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r", stdin);
// freopen("output.txt","w", stdout);
// #endif
// int tc; cin >> tc;
// TC(tc) solve();
solve();
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
using LL = long long;
const int kMaxN = 2e5 + 1;
const int kMaxM = 101;
const int kM = 1e9 + 7;
LL n, ans, u, v, w;
LL c[kMaxN], d[kMaxM];
bool vis[kMaxN];
vector<LL> a[kMaxN], b[kMaxN];
void Dfs(LL x, LL y) {
if (vis[x]) {
return;
}
vis[x] = true;
c[x] = y;
for (LL i = 0; i < a[x].size(); i++) {
Dfs(a[x][i], y ^ b[x][i]);
}
}
int main() {
cin >> n;
for (LL i = 1; i < n; i++) {
cin >> u >> v >> w;
a[u].push_back(v), b[u].push_back(w);
a[v].push_back(u), b[v].push_back(w);
}
Dfs(1, 0);
for (LL i = 1; i <= n; i++) {
for (LL j = 0; j <= 61; j++) {
if (c[i] & (1ll << j)) {
d[j]++;
}
}
}
for (LL i = 0; i <= 61; i++) {
ans = (ans + 1ll * (n - d[i]) * d[i] % kM * ((1ll << i) % kM) % kM) % kM;
}
cout << ans;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
typedef vector<int> vi;
using ll = long long;
typedef pair<int, int> pii;
typedef unsigned long long ul;
const int mn = 3005;
const int mod = 998244353;
int n, K;
ll d[mn][mn];
ll dp(int remain_number, int need_cnt) {
ll &ans = d[remain_number][need_cnt];
if (remain_number < need_cnt) return 0;
if (ans != -1) return ans;
if (remain_number == 0 && need_cnt == 0) return ans = 1;
ans = 0;
if (need_cnt == 0 || remain_number == 0) return ans = 0;
// get_one
assert(remain_number >= 0 && need_cnt >= 0);
ans = dp(remain_number - 1, need_cnt - 1);
// get_small_one
ans += dp(remain_number, need_cnt * 2);
ans %= mod;
//printf("%d %d %lld\n", remain_number, need_cnt, ans);
return ans;
}
int main() {
//cin.sync_with_stdio(0);
#ifdef LOCAL
freopen("../1.txt", "r", stdin);
//freopen("../2.txt", "w", stdout);
auto st = chrono::system_clock::now();
#endif
memset(d, -1, sizeof d);
scanf("%d%d", &n, &K);
printf("%lld\n", dp(n, K));
#ifdef LOCAL
auto ed = chrono::system_clock::now();
auto diff = std::chrono::duration_cast<std::chrono::milliseconds>(ed - st);
std::cerr << "cost time " << diff.count() << "ms." << std::endl;
#endif
return 0;
}
| #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define show(x) cout << #x << " = " << x << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define YesNo {cout<<"Yes";}else{cout<<"No";}
#define YESNO {cout<<"YES";}else{cout<<"NO";}
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> bool lcmp(const pair<T, T>& l, const pair<T, T>& r) {
return l.first < r.first;
}
template<class T> istream& operator>>(istream& i, v(T)& v) {
F0R(j, sz(v)) i >> v[j];
return i;
}
template<class A, class B> istream& operator>>(istream& i, pair<A, B>& p) {
return i >> p.first >> p.second;
}
template<class A, class B, class C> istream& operator>>(istream& i, tuple<A, B, C>& t) {
return i >> get<0>(t) >> get<1>(t) >> get<2>(t);
}
template<class T> ostream& operator<<(ostream& o, const pair<T, T>& v) {
o << "(" << v.first << "," << v.second << ")";
return o;
}
template<class T> ostream& operator<<(ostream& o, const vector<T>& v) {
F0R(i, v.size()) {
o << v[i] << ' ';
}
o << newl;
return o;
}
template<class T> ostream& operator<<(ostream& o, const set<T>& v) {
for (auto e : v) {
o << e << ' ';
}
o << newl;
return o;
}
template<class T1, class T2> ostream& operator<<(ostream& o, const map<T1, T2>& m) {
for (auto& p : m) {
o << p.first << ": " << p.second << newl;
}
o << newl;
return o;
}
#if 1
struct E {
int l = INT32_MAX, h = INT32_MIN;
};
// INSERT ABOVE HERE
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N; cin >> N;
v(E) es(N);
F0R(i, N) {
int x, c; cin >> x >> c;
c--;
chmin(es[c].l, x);
chmax(es[c].h, x);
}
ll lx = 0, lt = 0;
ll rx = 0, rt = 0;
F0R(c, N) {
auto [l, r] = es[c];
if (l == INT32_MAX) continue;
ll rx2 = es[c].h, lx2 = es[c].l;
ll rt2 = min(lt + abs(lx - l) + abs(l - r), rt + abs(rx - l) + abs(l - r));
ll lt2 = min(lt + abs(lx - r) + abs(r - l), rt + abs(rx - r) + abs(r - l));
lx = lx2; rx = rx2;
lt = lt2; rt = rt2;
}
cout << min(lt+abs(lx), rt+abs(rx)) << newl;
}
#endif
|
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))//memset only use to initialize 0 or -1 no other number.
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mod 1000000007
//#define mod 998244353
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define vl vector<ll>
#define vi vector<int>
using namespace std;
ll power(ll x,ll n){ll res =1;while(n>0){if(n%2==1){res=res*x;}x=x*x;n=n/2;}return res;}
ll powm(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;}
void solve(){
ll n;cin>>n;
ll len=0,t=n;
vector<ll> v;
while(t){
len++;
v.pb(t%10);t/=10;
}
reverse(all(v));
ll ans=0;
for(int i=2;i<=len;i+=2){
ll cur=1;
if(i!=len){
for(int j=0;j<i/2;j++){
if(j==0) cur*=9;
else cur*=10;
}
}else{
for(int j=0;j<i/2;j++){
if(j==0) cur*=(v[j]-1);
else cur*=10;
}
ll end=1;
for(int k=1;k<i/2;k++){
end*=v[k];
for(int l=k+1;l<i/2;l++) end*=10;
cur+=end;
end=1;
}
ll num=0;
int j=len;
for(int l=1;l<=2;l++){
for(int k=0;k<i/2;k++){
num+=v[k]*pow(10,j-1);j--;
}
}
if(num<=n) cur++;
}
ans+=cur;
}
cout<<ans<<endl;
}
int main(){
fast;
int T;
T=1;
//cin>>T;
while(T--){
//for(int i=1;i<=T;i++){
//cout<<"Case #"<<i<<": ";
solve();
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
long long n;
long long x1;
int ans = 1;
string s;
int main()
{
cin >> n;
long long x = 1;
int count = 0;
long long x1 =0;
while(x1<=n){
s = to_string(x);
x1 = stoll(s+s);
x++;
}
cout << x-2;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) <<
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll n,j;
ll c=1;
cin >> n;
vec a(n);
REP(i,0,n){
cin >> a[i];
}
// std::unique(a.begin(), a.end());
std::sort(a.begin(), a.end());
// a.erase(std::unique(a.begin(), a.end()), a.end());
j = n * (n-1) /2;
REP(i,0,n-1){
// PR(a[i]);
if (a[i] == a[i+1]){
c++;
if (i + 2 == n){
j -= c * (c-1)/2;
}
} else if(a[i] != a[i+1]){
// PR("false");
// PR(i);
// PR("DEL");
// PR(c * (c-1)/2);
j -= c * (c-1)/2;
c = 1;
}
}
PR(j);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N/i != i) res.push_back(N/i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
}
int main()
{
ll N;
cin >> N;
vector<long long> div = enum_divisors(N*2);
//(m+n)(m-n+1) = 2N
ll cnt = 0;
for(const auto& i : div){
//cout << i << " " << (N*2/i) << " " << (i&1) << " " << ((N*2/i)&1) << "\n";
if(((N*2/i)&1) != (i&1)) cnt++;
}
cout << cnt;
return 0;
}
|
#include <iostream>
using namespace std;
using ll = long long;
constexpr ll INFll = (ll)1e18 + 1;
ll Power(int a, int b) {
ll ret = 1;
while(b--) {
if(INFll / ret < a) {
ret = INFll;
break;
}
ret *= a;
}
return ret;
}
int main() {
ll n; cin >> n;
for(int i = 1; i < 100; ++i) {
for(int j = 1; j < 100; ++j) {
if(Power(3, i) + Power(5, j) == n) {
cout << i << " " << j << endl;
return 0;
}
}
}
cout << -1 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
void __print(int x){cout<<x;}void __print(long x){cout<<x;}
void __print(long long x){cout<<x;}void __print(unsigned x){cout<<x;}
void __print(unsigned long x){cout<<x;}void __print(unsigned long long x){cout<<x;}
void __print(float x){cout<<x;}void __print(double x){cout<<x;}
void __print(long double x){cout<<x;}void __print(char x){cout<<'\''<<x<<'\'';}
void __print(const char *x){cout<<'\"'<<x<<'\"';}void __print(const string &x){cout<<'\"'<<x<<'\"';}
void __print(bool x) {cout<<(x?"true":"false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cout << '{'; for (auto &i: x) cout << (f++ ? "," : ""), __print(i); cout << "}";}
void _print() {cout << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cout << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define lp(i,a,b) for (int i=a;i<=b;i++)
#define rp(i,a,b) for (int i=a;i>=b;i--)
#define ms(a,x) memset(a,x,sizeof a)
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define nl cout<<"\n"
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/(gcd(a,b))
#define sq(a) ((a)*(a))
#define sz(a) (int) a.size()
#define mod 1000000007
#define PI (2*acos(0.0))
void solve()
{
int n;
cin>>n;
int cnt=3;
while(cnt--)
{
string s;
cin>>s;
}
cout<<string(n,'1')+string(n,'0')+'1';
nl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int T=1;
cin>>T;
while(T--) solve();
return 0;
}
|
#include<bits/stdc++.h>
using ll = int_fast64_t;
int main(){
ll b, c;
scanf("%ld %ld", &b, &c);
ll l1 = b-c/2, r1 = b + std::max(0l, c-2)/2;
ll l2 = -b-(c-1)/2, r2 = -b + (c-1)/2;
if(l1<=r2 && l2<=r1){
bool l = (l1<=l2 && l2<=r1);
bool r = (l1<=r2 && r2<=r1);
if(l && r) printf("%ld\n", r1-l1+1);
if(l && !r) printf("%ld\n", r2-l1+1);
if(!l && r) printf("%ld\n", r1-l2+1);
if(!l && !r) printf("%ld\n", r2-l2+1);
}else printf("%ld\n", r1-l1+1 + r2-l2+1);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define fore(i_in,a) for (auto& i_in: a)
#define forp(x,y,a) for(auto& [x, y]: a)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pq(T) priority_queue<T, vector<T>, greater<T>>
#define fio() cin.tie(nullptr);ios::sync_with_stdio(false);
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<(int)v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
template<class T> bool chmax(T &a, const T &b) {if (a<b) { a = b; return true; } return 0;}
template<class T> bool chmin(T &a, const T &b) {if (a>b) { a = b; return true; } return 0;}
template<class T> void print(const T &t) { cout << t << "\n"; }
ll a, b, ans;
int main() {
fio(); cin>>a>>b;
ll pos_min = a - b/2;
ll neg_min = -a - (b-1)/2;
ll pos_max = a + (b-2)/2;
ll neg_max = -a + (b-1)/2;
if(neg_max < pos_min or pos_max < neg_min) ans = (neg_max - neg_min + 1) + (pos_max - pos_min + 1);
else ans = max(neg_max, pos_max) - min(pos_min, neg_min) + 1;
print(ans);
}
|
/*
* @author: codancer
* @createTime: 2020-10-17, 21:33:55
*/
#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 <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9+7;
#define pb push_back
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define fep(i,a,b) for(int i=(a);i>=(b);i--)
#define deb(x) cerr<<#x<<" = "<<(x)<<"\n"
typedef vector<int> VI;
typedef vector<ll> VII;
typedef pair<int,int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll Rand(ll B) {
return (ull)rng() % B;
}
const int N = 20;
struct Point{
ll x,y,z;
}p[N];
ll dis(Point a,Point b){
return abs(a.x-b.x)+abs(a.y-b.y)+max(0LL,b.z-a.z);
}
ll dp[1<<17][17];//the ans of dp[status][last]
int main(){
for(int i=0;i<(1<<17);i++){
for(int j=0;j<17;j++) dp[i][j]=1e18;
}
dp[1][0]=0;
int n;
cin>>n;
rep(i,0,n-1){
cin>>p[i].x>>p[i].y>>p[i].z;
}
for(int i=1;i<(1<<n);i++){
for(int j=0;j<n;j++){
if((i>>j)&1){
for(int k=0;k<n;k++){
if(!((i>>k)&1)){
int nxt=(i|(1<<k));
dp[nxt][k]=min(dp[nxt][k],dp[i][j]-dis(p[j],p[0])+dis(p[j],p[k])+dis(p[k],p[0]));
}
}
}
}
}
ll ans=1e18;
for(int i=0;i<n;i++) ans=min(ans,dp[(1<<n)-1][i]);
cout<<ans<<endl;
return 0;
} | #pragma GCC optimize("Ofast")
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip> // setprecision
#include <complex> // complex
#include <math.h>
#include <functional>
#include <cassert>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
constexpr ll INF = 1e18;
constexpr ll LLMAX = 9223372036854775807;
constexpr int inf = 1e9;
constexpr ll mod = 1000000007;
// constexpr ll mod = 998244353;
const int dx[8] = {1, 0, -1, 0,1,1,-1,-1};
const int dy[8] = {0, 1, 0, -1,1,-1,1,-1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
// ---------------------------------------------------------------------------
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<int> x(N),y(N),z(N);
for(int i=0; i<N; i++){
cin >> x[i] >> y[i] >> z[i];
}
vector<vector<int>> dp(N,vector<int>(1LL<<N,inf));
dp[0][0] = 0;
for(int bit=0; bit<(1LL<<N); bit++){
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
chmin(dp[j][bit | (1LL<<j)],dp[i][bit] + abs(x[i]-x[j])+abs(y[i]-y[j])+max(0,z[j]-z[i]));
}
}
}
cout << dp[0][(1LL<<N)-1] << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A;
cin >> N;
vector<int> vec,vec2;
for(int i = 0;i<N;i++){
cin >> A;
vec.push_back(A);
vec2.push_back(A);
}
sort(vec2.begin(), vec2.end());
int min = vec2.at(0);
//cout << min << endl;
int max = min * N;
for(int i = 0;i < N;i++){
if(min < vec2.at(i)){
min = vec2.at(i);
//cout << min << endl;
}else{continue;}
int cnt=0,cntmax=0;
for(int j = 0;j < N;j++){
if(min <= vec.at(j)){
cnt++;
if(cntmax < cnt){
cntmax=cnt;
//cout << cnt << endl;
}
}else{
if(cntmax < cnt){
cntmax=cnt;
//cout << cnt << endl;
}
//cout << cnt << endl;
cnt = 0;
}
}
if(max < cntmax*min)
max = cntmax*min;
}
cout << max << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
using namespace std;
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define endl "\n"
#define maxpq priority_queue<ll>
#define minpq priority_queue<ll, vector<ll>, greater<ll> >
#define vi vector<ll>
#define pii pair<ll, ll>
#define vii vector<pii>
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define bloop(i,a,b) for (int i = a ; i>=b;i--)
#define MOD 1000000007
#define INT_MAXI 9000000000000000000
#define INT_MINI -9000000000000000000
ll max(ll a, ll b) {if (a > b) return a; else return b;}
ll min(ll a, ll b) {if (a < b) return a; else return b;}
const int dx[4] = { -1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
int XX[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
int YY[] = { -1, 0, 1, -1, 1, -1, 0, 1 };
int main()
{
fio;
ll t,n,i,j,d,x,a,b;
cin>>n;
ll arr[n];
for(i=0;i<n;i++)
{
cin>>arr[i];
}
ll pref1[n],pref2[n];
stack<ll>s;
for(i=0;i<n;i++)
{
while(!s.empty()&&arr[s.top()]>=arr[i])
s.pop();
if(s.empty())
{
pref1[i]=-1;
}
else
pref1[i]=s.top();
s.push(i);
}
while(!s.empty())
s.pop();
for(i=n-1;i>=0;i--)
{
while(!s.empty()&&arr[s.top()]>=arr[i])
s.pop();
if(s.empty())
{
pref2[i]=n;
}
else
pref2[i]=s.top();
s.push(i);
}
ll ans=0;
for(i=0;i<n;i++)
{
ll noe=(i-pref1[i])+(pref2[i]-i);
noe-=1;
ans=max(ans,arr[i]*noe);
}
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i,a,b) for (int i=(a); i<=(b); i++)
#define drep(i,a,b) for (int i=(b); i>=(a); i--)
#define erep(e,u) for (int e=Head[u]; e; e=Next[e])
#define arep(i,A) for (auto i : A)
#define push_back pb
#define print(x,c) printf ("%d%c", x, c);
typedef long long ll;
typedef pair <int, int> pii;
const int N = 2e5 + 5;
int K, n, F[233], cnt[N], dp[N][17], ans; char s[N]; bitset <16> f[N];
inline int PLUS(int x, int y) {
x += y;
return x >= MOD ? x - MOD : x;
}
inline void readseq(int n, int *a) {
rep (i, 1, n)
scanf ("%d", a + i);
}
int main() {
for (int i=0; i<=9; i++)
F['0'+i] = i;
for (int i='A'; i<='F'; i++)
F[i] = i - 'A' + 10;
scanf ("%s%d", s+1, &K), n = strlen(s + 1);
for (int i=1; i<=n; i++)
f[i] = f[i-1], f[i][F[s[i]]] = 1, cnt[i] = f[i]. count();
for (int i=1; i<=n; i++) {
for (int j=1; j<=16; j++)
dp[i][j] = (1ll * dp[i-1][j-1] * (16 - j + 1) + 1ll * dp[i-1][j] * j) % MOD;
for (int j=i==1?1:0; j<F[s[i]]; j++)
dp[i][cnt[i-1]+1-(bool)f[i-1][j]] = PLUS(dp[i][cnt[i-1]+1-(bool)f[i-1][j]], 1);
if (i > 1)
dp[i][1] = PLUS(dp[i][1], 15);
} ans = PLUS(dp[n][K], (cnt[n] == K));
return cout << ans << endl, 0;
} | #include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
typedef long long ll;
string num;
int rn[200005];
int k;
int n;
int dp[200005][20];
ll dfs(int x,ll now,bool zero,bool flag)
{
int cnt=0;
for(int i=0;i<16;i++)
{
if(now&(1<<i))cnt++;
}
if(x>=n)return cnt==k;
if(cnt>k)return 0;
if(!flag&&zero&&dp[x][cnt]!=-1)return dp[x][cnt];
ll ans=0;
int lim=flag?rn[x]:15;
for(int i=0;i<=lim;i++)
{
int tmp;
if(!zero&&i==0)tmp=now;
else tmp=now|(1<<i);
ans+=dfs(x+1,tmp,zero||(i!=0),flag&&(i==lim));
ans%=mod;
}
if(!flag&&zero)dp[x][cnt]=ans;
return ans;
}
int main()
{
cin>>num>>k;
n=num.size();
memset(dp,-1,sizeof dp);
for(int i=0;i<n;i++)
{
if(num[i]>='0'&&num[i]<='9')rn[i]=num[i]-'0';
else rn[i]=num[i]-'A'+10;
}
printf("%lld\n",dfs(0,0,0,1));
return 0;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC target("popcnt") //https://godbolt.org/z/yQv94Y
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
const ld pi = 4.0*atan(1.0);
#define xlr8 ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout.precision(10); cout<<fixed
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// T.insert(a), T.erase(a), T.size()
// T.order_of_key(a) -- number of elements strictly less than a
// *T.find_by_order(k) -- k-th element in increasing order
struct Timer
{ chrono::time_point<chrono::high_resolution_clock> start , end; chrono:: duration<float> dur;
Timer(){start = chrono::high_resolution_clock::now();}
~Timer(){ end = chrono::high_resolution_clock::now(); dur = end - start; cout<<"\nTime Elapsed : " <<dur.count() << " s\n"; }
};
template<typename T>
void getVec(vector<T>& a , int st, int en)
{
int dif = (en > st ? 1 : -1);
for(int i = st ; i!= en ; i+= dif)
cin>>a[i];
}
template<typename T>
void getVecPair(vector<pair<T , T > >& a , int st, int en)
{
int dif = (en > st ? 1 : -1);
for(int i = st ; i!= en ; i+= dif)
cin>>a[i].first>>a[i].second;
}
//76149
template<int D, typename T>
struct Vec : public vector<Vec<D - 1, T>> {
static_assert(D >= 1, "Vector dimension must be greater than zero!");
template<typename... Args>
Vec(int n = 0, Args... args) : vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) {
}
};
template<typename T>
struct Vec<1, T> : public vector<T> {
Vec(int n = 0, T val = T()) : vector<T>(n, val) {
}
};
// const int MAX = 1000;
// Vec<2 , int > dp(MAX + 1, MAX + 1, -1);
ll gcd(ll a, ll b, ll& x, ll& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll d = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
int main()
{
xlr8;
int testCases = 1;
cin>>testCases;
while (testCases--)
{
ll n , s , k;
cin>>n>>s>>k;
s = n -s;
ll d = __gcd(k , n);
k/=d;
n/=d;
if(s%d!= 0)
{
cout<<"-1\n";
}
else
{
s/=d;
ll x, y;
ll g = gcd(k, n, x, y);
if (g != 1)
{
cout << "-1\n";
}
else
{
x = (x % n + n) % n;
x = (x*s)%n;
cout << x <<"\n";
}
}
}
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <unordered_map>
#include <cstdio>
#include <climits>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)return x;
return gcd(y, x%y);
}
ll lcm(ll x, ll y) {
return x / gcd(x, y)*y;
}
ll kai(ll x, ll y, ll m) {
ll res = 1;
for (ll i = x - y + 1; i <= x; i++) {
res *= i; res %= m;
}
return res;
}
ll mod_pow(ll x, ll y, ll m) {
ll res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
ll comb(ll x, ll y, ll m) {
if (y > x)return 0;
return kai(x, y, m) * mod_pow(kai(y, y, m), m - 2, m) % m;
}
const int mod = 1000000007;
ll T, n, a, b;
signed main() {
std::random_device rnd;
std::mt19937_64 mt(rnd());
cin >> T;
while (T--) {
cin >> n >> a >> b;
if (n < a + b) {
cout << 0 << endl;
continue;
}
if (a < b)swap(a, b);
ll k = n - a + 1;
ll p = n - a - b + 1;
ll ans = (n - a + 1)*(n - a + 1) % mod*(n - b + 1) % mod*(n - b + 1) % mod;
ll x = (2 * (b*(b - 1) / 2 + (k - b)*(b - 1)) + k * (a - b + 1)) % mod;
ans = (ans - x * x%mod + mod) % mod;
cout << ans << endl;
}
} |
Subsets and Splits