code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
string s;
int cnt = 0;
char a[4];
set<char> o, x;
void dfs(int depth)
{
if (depth > 3)
{
bool flag = true;
for (char c : o)
{
if (0 == count(a, a + 4, c))
{
flag = false;
break;
}
}
if (flag)
{
for (char c : x)
{
if (count(a, a + 4, ... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
typedef long long ll;
int INF =1001001001;
int main()
{
string s;
cin>>s;
int n=s.size();
vector<int>c(3);
rep(i,n)c[(s[i]-'0'... |
#include <bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ll long long
void solve(){
int a,b,c;
cin >> a >> b >> c;
int sum;
sum=((7-a)+(7-b)+(7-c));
cout << sum;
}
int main()
{
ios;
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long int bpow(long long int a,long long int b)
{
if(b==0)
return 1;
long long int res=bpow(a,b/2);
if(b%2)
return res*res*a;
else
return res*res;
}
long long int bpowm(long long int x,long long int y,long long int m)
{
long long int re... |
// Author: HarshKumar
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const ll N = 1e6 + 6, M = 1e9 + 7;
const ll INF = (1LL << 62) - 1;
vector<ll> dijkstra(vector<vector<pair<ll, pair<ll, ll>>>> &G, ll v)
{
vector<ll> ans(G.size(), INF);
ans[v] = 0;
priority_queue<pair<ll, ll>> que;
q... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
using namespace std;
#define LL long long
#define DB double
#define MAXN 400000
#define Pr pair<int,int>
#define X first
#define Y second
#define INF 1000000001
#define MOD 1000000007
#define eps 1e... |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse4")
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define SZ(a) (int)((a).size())
#define ALL(a) a.begin(), a.end()
typedef long long LL;
typedef pai... | #line 1 "main.cpp"
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <queue>
using namespace std;
using lint = long long;
void solve() {
int n;
cin >> n;
vector<vector<int>> graph(n);
for (int i = n - 1; i--;) {
int u, v;
cin >> u... |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) for (__typeof(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin(... |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using ordered_set=tree<T,n... | // Created by ash_98
#include<bits/stdc++.h>
using namespace std;
#define mx 200005
#define ll long long
#define mod 1000000007
int ar[mx];
char ch[mx];
int n,m,ii,k;
int cnt1[mx],cnt3[mx];
vector<int>g[mx];
void solve()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
cnt1[x]++;
}
fo... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define mp make_pair
using namespace std;
typedef long long ll;
int main() {
int v[3];
scanf("%d%d%d", &v[0], &v[1], &v[2]);
sort(v, v+3);
printf("%d\n", v[1]+v[2]);
return 0;
} | #include <iostream>
using namespace std;
int main (){
int a,b,c;
cin >> a >> b >> c;
int cont = 0;
if(a>=b){
cont +=a;
if(b>=c){
cont +=b;
}
else{
cont +=c;
}
}
else {
if(b>=c){
cont +=b;
if(c... |
#include <bits/stdc++.h>
using namespace std;
char s[2000][2000];
int dd[2000][2000], sumx[2000][2000], sumy[2000][2000], sumxy[2000][2000];
const int N = 1000000007;
int h, w;
int main() {
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> s[i][j];
}
}
dd[0][0] = 1;... | /**
* author: otera
**/
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
#define rep(i, n) for(int i = 0; i < n; ++ i)
#define per(i,n) for(int i=n-1;i>=0;i--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
... |
#include<iostream>
using namespace std;
int main()
{
int n,k;
cin >> n >> k;
cout << (n+1)*n/2 * k * 100 + n * (k+1)*k/2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
int sum = 0;
for(int i=1;i<=n;i++){
for(int j=1;j<=k;j++){
sum += i*100+j;
}
}
cout<<sum;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
cout << (n - 1) / 100 + 1 << endl;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
int n;
cin >> n;
for(int i = 1; i < 2888; i++){
if(100 * i >= n){
cout << i;
exit(0);
}
}
return 0;
} |
//Saptak_Roy_Turja
#include<bits/stdc++.h>
#define ll long long int
#define d double
using namespace std;
int main()
{
ll n,x,y;
cin>>n>>x>>y;
d ans=0.0;
while(n--){
d a,b;
cin>>a>>b;
d c=(y-b)/(x-a);
ans=max(ans,y-x*c);
}
printf("%0.20lf\n",ans);
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define loop1(i,a,b) for(ll i=a;i<=b;i++)
#define rloop(i,b,a) for(ll i=b;i>=a;i--)
#define test() int t;cin>>t;while(t-->0)
#define speed ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#defi... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using P = pair<ll, ll>;
using P3 = pair<int,P>;
using PP = pair<P, P>;
constexpr int INF32 = 1 << 30;
constexpr ll INF64 = 1LL << 60;
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
constexpr in... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ld rr = 1.618033988;
vector<int> ans, ans_tmp;
ll last = -1;
int flag = -1;
ll cnt_tmp = 1e18;
void func(ll x, ll y) {
if (x == 0) {
last = y;
flag = 0;
for (ll i=0;i<y;i++) {
ans_tmp.pus... |
#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
std::mt19937 rnd(233);
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pLL;
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define ls (i<<1)
#define rs (i<<1|1)
#define mem(a,b) memset(a,b,sizeof(a))
... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
//*********************************************0123456789****************************************************************
#include<bits/stdc++.h>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first ... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
int main()
{
cin.tie(0);cout.tie(0);
int sx,sy,gx,gy;
cin>>sx>>sy>>gx>>gy;
cout<<fixed<<setprecision(8);
if(sx>gx)
{
swap(sx,gx);
swap(sy... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> x(n), y(n);
rep(i,n) cin >> x[i] >> y[i];
int ans = 0;
rep(i,n)rep(j,n){
double ka;
ka = (double)(y[j] - y[i]) / (x[j] - x[i]);
if (ka >= ... |
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using... | #include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define unvisited -1
#define visited 1
#define eps 1e-9
#define mp make_pair
#define pb push_back
#define pi acos(-1.0)
#define uint64 unsigned long long
#define FastSlowInput ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define d... |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define fp(x, a, b) for(int x = a; x < b; x++)
#define fn(x, a, b) for(int x = a; x > b; x--)
#define f(x, m) for(auto x : m)
#define cpu() ios::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#def... | /*** keep hungry and calm CoolGuang! ***/
//#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<hash_map>
#include<iostream>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
typedef ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,i,ans;
cin >> N;
ans = 0;
for (i = 1; i <= N; i++) {
if (i % 10 == 7 || i / 10 % 10 == 7 || i / 100 % 10 == 7 || i / 1000 % 10 == 7 || i / 10000 % 10 == 7) {
continue;
} else if (i % 8 == 7 || i / 8 % 8 == 7 ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);++i)
#define fixed(n)fixedb<<setprecision(n)
#define ll long long
#define ALL(a)a.begin(),a.end()
template<class T>void chmin(T& a,T b){
if(a>b){
a=b;
}
}
template<class T>void chmax(T& a,T b){
if(a<b){
... |
#include <cstdio>
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ch <= '9') data = data * 10 + (ch ^ 48), ch = getchar();
return data * w;
}
const int N(105);
int n, K, M, f[N][N ... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
tuple<ll,ll,ll> extgcd(ll a, ll b) {
if (b == 0) return {a, 1, 0};
ll g, x... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
struct edge {
int to;
int cost;
};
using P = pair<ll, ll>;
vector<vector<edge>> G;
vector<ll> d;
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(d.begin(), d.end()... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define UniqueVector(vec) sort(vec.begin(), vec.end());vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define rep(i,n) for(ll i=0;i<n;i++)
int main(){
int a,b;
cin>>a>>b;
for(int c=b;c>=1;c--){
if(b/c-(a-1)/c>=2){
c... |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <complex>
#include <iomanip>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#define ll long long
#define ld long double
#define HS ios_base::sync_with_stdio(0);c... | #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, tre... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
vector<ll> primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71 };
void Main() {
ll A, B;
cin >> A >> B;
vector<ll> AtoB(B - A + 1, 0);
for (ll i = 0; i < B - A + 1; ++i) {
AtoB[i] = A + i;
... | #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;
template <typename T> using vt = vector<T>;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb p... |
#include<bits/stdc++.h>
using namespace std;
#define superfastboy ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define mp make_pair
#define int long long
#define ll long long
#define ull unsigned long long
ll const inf=1e9+7,mod=1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int t, N;
cin >> t >> N;
int P = 100 + t;
vector<int> A(P,1);
rep(i, 100) {
A.at(P * i / 100) = 0;
}
vector<int> B;
rep(i, P) {
if (A.at(i)) {
B.push_back(i);
}
}
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
auto go = [&](int x) -> long long {
return 1LL * x * (x + 1) / 2;
};
long long ans = 0;
while (n--) {
int a, b;
cin >> a >> b;
ans += go(b) - go(a - 1);
}
cout << ans << "\n";
... | // AtCoder template
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < n; ++i)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll ans = 0;
int n; cin >> n;
rep(i,n){
ll a,b; cin >> a >> b;
ans += (a+b)*(b-a+1)/2;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
ll n;cin>>n;
vector<ll> A(n),B(n+1,0),C(n+1,0),D(n+1,0);
rep(i,n)cin>>A[i];
B[0]=0;
rep(i,n)B[i+1]=B[i]+A[i];
C[0]=0;
rep(i,n)C[i+1]=max(C[i],B[i+1]... | #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
#define pb push_back
using namespace std;
void test(){
ll n;
cin>>n;
ll a[n],b[n],c[n];
f(i,n)cin>>a[i];
f(i,n)cin>>b[i];
f(i,n)cin>>c[i];
ll freq[n+1];
f(i,n+1)freq[i... |
/*
* @Author: AsilenceBTF
* @LastEditTime: 2020-12-15 13:39:37
*/
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 1e3 + 105;
int a[N], b[N], dp[N][N];
int main(){
int n, m; scanf("%d%d", &n, &m);
for(int i = 1; ... | #include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#endif
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef std::vector<vector<int> > vv... |
#include <bits/stdc++.h>
using namespace std;
#define deb(k) cerr << #k << ": " << k << "\n";
#define size(a) (int)a.size()
#define fastcin cin.tie(0)->sync_with_stdio(0);
#define st first
#define nd second
#define pb push_back
#define mk make_pair
#define int long long
typedef long double ldbl;
typedef double dbl;
typ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int maxn=222222,mod=998244353;
#define MP make_pair
#define PB push_back
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#defi... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
#define CHECK(a) cout << #a << " " << a << endl;
const int INF = 1e9;
const ll MOD = (ll)1e9 + 7LL;
const vector<int> dx = {1, 0, -1, 0, ... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main(){
int N;
cin >> N;
ll sum1 = 0;
long double sum2 = 0;
ll m = -1;
rep(i, N) {
ll x;
cin >> x;
x = abs(x);
m = max(m, x);
sum1 += x;
sum2 += ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a,b,c;
cin>>a>>b>>c;
cout<<b<<c<<a<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define M 1000000007
ll powll(ll x, ll y) {
ll re=1;
rep(i, y) {
re = re * x % M;
}
return re;
}
ll gcd(ll a, ll b)
{
if (a%b == 0)
{
... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
template <class T>
void chmax(T& a, T b) {
a = max(a,b);
}
template <class T>
void chmin(T& a, T b) {
a = min(a,b);
}
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define all(container) container.begin(), c... | #include <algorithm>
#include <iostream>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cmath>
#include <climits>
#include <queue>
#include <bitset>
#include <set>
#include <assert.h>
using namespace std;
typedef vector<vector<long> > dim2vec... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
long long int n,p,x,a,i,mn=INT_MAX;
cin>>n;
float time=0.5;
for(i=0;i<n;++i)
{
cin>>a>>p>>x;
if(((float)x)>ceil(((float)a-0.5)))... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ul;
typedef long long ll;
#define printV(v) for(int i = 0;i < v.size();++i)cout << v[i] << endl
#define print(x) cout << x << endl
int main() {
int N,M,T;
cin >> N;
cin >> M;
cin >> T;
int n = N;
int t = 0;
bool ok = true;
for(int ... |
#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
using namespace std;
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a; i > -1; --i)
#define REP(i, a, b) for (int i = (int)a; i ... | #include <algorithm>
#include <iostream>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cmath>
#include <climits>
#include <queue>
#include <bitset>
#include <set>
#include <assert.h>
#include <map>
using namespace std;
typedef vector<vector<... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<ll, int>> a(n);
for (auto& e : a) cin >> e.first >> e.second;
reverse(a.begin(), a.end());
ll s = 0, bot = -1e18, top = 1e18;
for (auto e : a) {
switch (e.second) {
case 1: {
s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i < i##end; ++i)
#define per(i, a, b) for (int i = (a) - 1, i##end = (b); i >= i##end; --i)
#define REP(i, a) rep(i, 0, a)
#define PER(i, a) per(i, a, 0)
namespace IO {
const int MAXIOSIZE = 1 << 24 | 1;
unsigned char... |
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <string>
#include <iostream>
#include <sstream>
#include <ostream>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <iomanip>
#include <set>
#include <bitset>
//#include<unordered_map>
#defi... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
vector<int> x,y,z;
int dist(int a,int b){
return abs(x[b]-x[a])+abs(y[b]-y[a])+max(0,z[b]-z[a]);
}
void... |
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline int read()
{
int x=0,w=1; char c=getchar();
while(c<'0'||c>'9')... | #include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(register int i=(a);i<=(b);i++)
#define per(i,a,b) for(register int i=(a);i>=(b);i--)
using namespace std;
const int N=59;
inline long long read() {
register long long x=0, f=1; register char c=getchar();
while(c<'0'||c>'9') {if(c=='-') f=-1; ... |
#include <iostream>
using namespace std;
int main()
{
double x, y, z;
cin >> x >> y >> z;
double a = y / x;
for (double b = 1;; b++) {
if (b / z >= a) {
cout << int(b) - 1 << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
#define max(p,q) ((p)>(q)?(p):(q))
#define min(p,q) ((p)<(q)?(p):(q))
#define rep(i,n) for... |
// 2020-12-27 15:59:19
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i =... | //IQ134高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#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++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll t;
cin >> t;
rep(i, t)
{
ll n... | // Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
using namespa... |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define pb push_back
#define f first
#define s second
#define nl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef vec... | #include<bits/stdc++.h>
#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 ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#defin... |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<map>
#include<cstring>
using namespace std;
int a[100][100];
const int N=1e6;
int L[N],dp[N];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++){
int x,y;
scanf("%d%d",&x,&y);
a[x][y]=1;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
set<int> a, b, ans;
rep(i, n) {
int v;
cin >> v;
a.insert(v);
}
rep(i, m) {
int v;
cin >> v;
b.insert(v);
}
for (auto v : a) {
bool which =... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<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 fore(i_in,a) for (auto& i_in: a)
#define sz(x) (int)x.... |
// Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
//
//
void solve(){
int n;
cin>>n;
vector<ll> vec(n);
for(int i = 0; i < n; i++)
... | #include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define PIL pair<int,LL>
#define PLI pair<LL,int>
#define PIII pair<int,PII>
#define PLL pair<LL,LL>
#define PLII pair<LL,PII>
#define VI vector<int>
#define VVI vector<VI>
#define VL vector<LL>
#define VVL vector<VL>
#define VPII vector<PII>
#defi... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) {a = b; return true;} else return false;}
template<class T> inline bool chmax(T& a... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pii>
#define pqi priority_queue<int>
#define test int tcase; cin>>tcase; for(int tc = 1; tc <=... |
#include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
#define vall(x) (x).begin(), (x).end()
using namespace std;
namespace atcoder {}
using namespace atcoder;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2> b... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<ll,ll>
#define vi vector<ll>
#define mii map<ll,ll>
#define pqi ... |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[200001];
int main() {
cin >> n;
int prev = 0;
int oPrev = 0;
vector<int> ans;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (i > a[i]) {
if (a[i] < prev) {
cout << "-1\n";
return... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 100010
const int MOD = 1000000007;
struct fenwick {
int n;
vector<int> bit;
fenwick(int _n) : bit(_n), n(_n) {}
void add(int idx, int val) {
for (; idx <= n; idx += idx & (-idx))
b... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll R,X,Y;
cin >> R >> X >> Y;
long double d = sqrt(X*X+Y*Y);
ll i = 1;
while(true){
if(i*R >= d){
if(i == 1 && i*R != d) cout << i+1 << endl;
else cout << i << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solver1(ll R, ll X, ll Y, ll &ans){
ll dist_sq = X*X + Y*Y;
double dist = sqrt(dist_sq);
// ll move_sq = R*R;
// ll div = 0, mod = 0;
double div = 0;
div = dist/R;
// mod = dist_sq%R;
if (floor(div) == div) ans = d... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> con(m, {0, 0});
rep(i, m) cin >> con[i][0] >> con[i][1];
int k;
cin >> k;
vector<vector<int>> k_s(k, {0, 0});
vecto... | #include <algorithm>
#include <iomanip>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sstream>
#include <unordered_map>
#in... |
// Username: WillTheBill
// Time of creation: 2020-11-08 15:24
// Original filename: m.cp.cpp
#include<bits/stdc++.h>
using namespace std;
// shortcuts
#define pb push_back
#define fi first
#define se second
#define all(_v) _v.begin(),_v.end()
#define ll long long
// IO
#define multitest signed __T; cin >> __T; whil... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W,N,M;
cin >> H >> W >> N >> M;
vector<vector<int>> G(H,vector<int>(W,0));
for(int i=0;i<N;i++){
int a,b;
cin >> a >> b;
a--;b--;
G[a][b] = 1;
}
for(int i=0;i<M;i++){
int c,d;
cin >> c >> d;
c--;d--;
G[c][d] = -... |
#include <bits/stdc++.h>
using namespace std;
double r, x, y;
int main()
{
cin >> r >> x >> y;
double d = hypot(x, y);
cout << (d < r ? 2 : ceil(d / r)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i,n) for(LL i=0;i<(n);i++)
int main()
{
LL r, x, y;
LL output = 0;
long double distance;
cin >> r >> x >> y;
distance = sqrt(x*x + y*y);
if(r <= distance){
output = distance/r;
long double temp = distance/r;... |
#include<bits/stdc++.h>
using namespace std;
long long dp[31][31] = {};
long long acolyte(int a, int b)
{
long long cost = 0;
if(dp[a][b])
{return dp[a][b];}
if(a + b <= 1)
{return 1;}
if(a)
{cost += acolyte(a - 1, b);}
if(b)
{cost += acolyte(a, b - 1);}
dp[a][b] = cost;
return cost;
}
void soluti... | #include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#endif
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef std::vector<vector<int> > vv... |
// #include <bits/stdc++.h>
// string s;
// getline(cin, s);
// g++ -std=c++11 -O2 -Wall test.cpp -o test
// printf("%.9f\n", x); PRECISION
#include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define S second
#define F first
#define f(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int,int>
const int N = 105;
int n;
pair<double,doub... |
// E - Rush Hour 2
#include "bits/stdc++.h"
using namespace std;
#ifndef DEBUG
#define fundri 108
#define debug(...) 1729
#define endl '\n'
#endif
#define int int64_t
typedef pair<int, int> pii;
typedef vector<int> vi;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int rnd(int l = 0, ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... |
#include <iostream>
#include <string>
using namespace std;
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <set>
#include <map>
#define MOD1 1000000007
#define MOD2 998244353
#define LIMIT1 200010
#define LIMIT2 500010
#define L... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rng(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(ob... |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N; cin >> N;
int C[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> C[i][j];
}
}
int A[N], B[N];
A[0] = B[0] = 0;
int mi... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define llrep(i,n) for(ll i=0; i<(ll)n; i++)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //sortしてから使う
#define INF 2147483647
#define LLINF 9223372036854775807LL
#... |
#include <bits/stdc++.h>
using namespace std;
int n;
mt19937 mt;
const int TRIES = 750;
const int SHUFFLES = 0;
bool check(string s, vector<vector<char>>& a, int i, int j) {
bool isOk = true;
for (int k = 0; k < s.size() && isOk; ++k) {
if (s[k] != a[i][(j + k) % n]) {
isOk = false;
... | #include<bits/stdc++.h>
using namespace std;
template<class T>
using V = vector<T>;
using ll = long long;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for(int i=m; i<n; i++)
vector<int> par;
void init(int n){
for(int i=0; i<n; i++) par.at(i) = i;
}
int root(int x){
if(par.at(x) == x){
ret... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define DREP(i,s,n) for(int i = (s); 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;}ret... |
#include<bits/stdc++.h>
#define int long long
#define ri register signed
#define rd(x) x=read()
#define endl '\n'
using namespace std;
const int N=2e6+5;
const int M=1e6+5;
const int maxn=5e6+5;
const int mod=998244353;
const int inf=0x3f3f3f3f;
inline int read(){int x=0,f=1;char ch=getchar();while(ch>'9'||ch<'0'){if... |
#include <iostream>
using namespace std;
int main()
{
int N,M;
cin>>N>>M;
cout<<N/M;
} | #include <bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define lop ios; ll t; cin>>t; while(t--)
#define pb push_back
#define vi vector<ll>
#define vivi vector<vector<ll>>
#define vipa vector<pair<ll,ll>>
#define F first
#define S second
#define M 10000... |
/*ver 7*/
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... | #include <iostream>
#include <iomanip>
double dp[101][101][101];
double dfs(int a, int b, int c){
if(dp[a][b][c]) return dp[a][b][c];
if(a==100 || b==100 || c==100) return 0;
double ret = (dfs(a+1, b, c) + 1) * a / (a+b+c);
ret += (dfs(a, b+1, c) + 1) * b / (a+b+c);
ret += (dfs(a, b, c+1) + 1) * c / (... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define PI (2*acos(0.0))
#define eps 1e-9
#define pb push_back
#define endl "\n"
#define watch(x) cout << (#x) << " is ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,x,n) for(int i = x; i<=n; i++)
#define FORO(i,n) for(int i = 0; i<n; i++)
#define nl "\n"
#define sp " "
#define MOD 1000000007
#define INF 1000000000000000000
#define pb push_back
#define pob pop_back
#define puf push_front
#define pof po... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.size();
int i = 0, j = n-1;
while(s[i] == '0')
i++;
while(s[j] == '0')
j--;
while(i < j){
if(s[i] != s[j]){
cout << "No";
exit(0);
}
i++, j--... | /*************************************************************************
> File Name: solve.cpp
> Author: liupo
> Mail: lanzongwei@gmail.com
> Created Time: 2021-02-28 21:37:24
************************************************************************/
#define GOODOJ
#define SYNC 0
#ifdef GOODOJ
#include <bi... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
#define all(c) ((c).begin()), ((c).end())
#define sz(x) ((int)(x).size())
#define ld long double
template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
os<<"("<<p.fir... | #include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int m = 5;
vector<vector<int>> men((n), vector<int>(m));
rep(i, n) rep(j, m) cin >> ... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <cassert>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
using namespace std;
using l... |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <iterator>
#include <algorithm>
constexpr int N = 100005;
int n;
std::vector<long long> a[3];
std::string s;
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
std::cin >> n;
for (int i = 1; i <= n << 1; ... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
#include<algorithm>
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 <= (... |
#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++)
#defin... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define mod 1000000007
#define ad(a,b) a=(a+b)%mod;
#define X 5010
ll po(ll x,ll y){
ll res=1;
for(;y;y>>... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long int ll;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c... |
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
int n,m;scanf("%d%d",&n,&m);
if(m==0){
for(int i=1;i<=n;i++) printf("%d %d\n",2*i-1,2*i);
return 0;
}
if(m<0){
printf("-1\n");
return 0;
}
if(m>=n-1){
printf("-1\n");
return 0;
}
m++;
printf("1 %d\n",2*(m+1));
for(int i=1;i<=m;i+... | /** Created by: Humberto Yusta
Codeforces User: humbertoyusta
Country: Cuba
Copyright�� */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas:
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
//#pragma GCC option... |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define f... | #include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
#include<cmath>
#include<stack>
#include <map>
#include <vector>
using namespace std;
int main(){
int n,m,p=0,mp[10][10],ad=0,k=0;
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>mp[i][j];
}
}
int a[10]={0,... |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <cstring>
#include <map>
#include <string>
#define inf 0x3f3f3f3f
#define _for(i,a,b) for( int i=(a); i<(b); ++i)
#define __for(i,a,b) for( int i=(b); i>=(a); --i)
using namespace std;
typedef pair<int,int>pii;
type... |
//================code===================//
#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#define ci(t) cin>>t
#define co(t) co... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long ll;
int main(){
cout << fixed << setprecision(15);
int N; cin >> N;
vector<ll> X; ll x; for (int i=0; i<N; i++) { cin >> x; X.push_back(x)... | #include <bits/stdc++.h>
/* #include <atcoder/all> */
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
/* using namespace atcoder; */
using ll = long long;
usin... |
#include <bits/stdc++.h> //yaad rkhne layak baatein
#include <bits/stdc++.h> // bool found = false use it to find some number after the given number with some cond.
// while (!found)
#include <iostream> // freq.table-> int freq[26] = {0}; for (ll i = 0; i < s1.length(); i++) freq[s1[i] - '... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... |
#include<bits/stdc++.h>
using namespace std;
const int N = 2005;
const int oo = 0x3f3f3f3f;
int Gcd(int a, int b) {
return (b ? Gcd(b, a % b) : a);
}
int a[N], ans = 0, mn, f = 1;
map<int,int> mp;
void get(int a, int b) {
if (!mp.count(a)) {
mp[a] = b;
return;
}
if (mp[a] == a) return;
int x = mp[a];
... | #include <bits/stdc++.h>
using namespace std;
#define closeSync ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long ll;
typedef long double ld;
const int MAXN = 3005;
typedef pair<ld,ld> pll;
ll a[MAXN][7];
int flag[MAXN];
int n;
inline bool check(ll x)
{
set<int> s;
for (int i=1;i<=n;i+... |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) \
do \
{ \
} while (0)
#endif
#include <cassert>
using n... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <iomanip>
using namespace std;
using VI = vector <int>;
using VV... |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
const int m = 1e9+7;
int main() {
int n;
cin >> n... | /*input
2
A
B
A
A
*/
#include <bits/stdc++.h>
using namespace std;
namespace my_template {
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef ... |
//#pragma GCC optimize(2)
//#include <bits/stdc++.h>
#include <iostream>
#include <set>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <utility>
#include <map>
#define rush() int T; while(cin>>T) while(T--)
#define ms(a,b) memset(a,b,sizeo... | #include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> A(2 * N);
for(auto&& i : A)cin >> i;
vector<pair<unsigned long, unsigned long>> B;
B.reserve(2 * N);
transform(begin(A), end(A), back_inserter(B), [cnt{0UL}](unsigned long a) mutabl... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
signed main(){
int n;
string s,t;
cin>>n>>s>>t;
int ans=0;
vector<int>s1;
for(int i=n-1;i>=0;i--)
if(s[i]=='1')
s1.push_back(-i);
for(int i=0;i<n;i++){
if(s[i]==t[i])
... | #include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using si = set<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
template<typename T> using minpq = priority_queue <T,vector... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
// Acknowledgement: Special thanks to kyomukyomupurin, who developed this
// template.
template <class T, class U>
std::os... | #include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
struct Data
{
int cnt, value;
Data operator+(const Data &other)
{
if (cnt == 0 && other.cnt == 0)
return value < other.value ? *this: other;
if (cnt == 0)
return *this;
... |
#include <bits/stdc++.h>
#define f(i,j,k) for(long long i=j;i<k;i++)
#define f2(i,j,k) for(long long i=j;i>=k;i--)
#define ll long long
#define ld long double
using namespace std;
const long long mod=1e9+7;
const long long mod2=998244353;
const long long INF = (1 << 29);
void chmin(int& a, int b){ if(a > b) a = b; }
... | #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;
void output(ll a, ll b, ll c, ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int t;
/* cin>>t;
while(t--)
{*/
ll n;
vector<ll>v,v1;
string s,s1;
ll a,k,rem,b,x,y,coun=0,new_coun=0,sum=0,flag=0,ans=0,c_0=0,c_1=0,c_2=0;
cin>>n>>k;
ans=n;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define MV 200001
#define LMV 21
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define emp emplace
#define mp make_pair
#define ins in... |
#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 mod = 1e... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define Next(i, u) for (int i = h[u]; i; i = e[i].next)
const int N = 2e3 + 5;
const int M = 3e7 + 5;
const int inf = 1e9;
struct edge { int v, next, w;} e[M];
queue <int> Q;
char s[N][N]; int n, m, S, T, tot, h[N * N], dis[... |
#include <bits/stdc++.h>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(v) std::begin(v), std::end(v)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> ws(n);
for (int i = 0; i < n; i++) {
cin >> ws[i];
}
vector<int> ls(m), vs(m), indices(m);
for (int i = 0; i < m; i++... |
/*
f[n][k] = f[n - 1][k - 1] + f[n][2k]
*/
#include <cstdio>
#include <algorithm>
const int N = 3000 + 10;
const int MOD = 998244353;
int n, m;
int f[N][N << 1];
inline int qmod(int x) { return (x>=MOD)?(x-MOD):x; }
int main() {
int i, j;
scanf("%d %d", &n, &m);
f[0][0] = 1;
for(i=1; i<=n; i++)
for(j=i;... | #include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb push_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define F... |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include ... | /**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long r, x, y;
cin >> r >> x >> y;
long long cnt = 0;
long long rad = 0;
while (rad * rad < x * x + y * y) {
cnt = cnt + 1;
rad = rad + r;
}
if (cnt == 1) {
if (rad * rad > x * x ... | #include<bits/stdc++.h>
using namespace std;
int n,a,b;
int main()
{
scanf("%d%d%d",&n,&a,&b);
printf("%d\n",n-a+b);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}template<typename T,typename...Ts>void _(const char*s,T h,Ts...t... | #pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
#define io_init cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20)
#include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
con... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
#define MOD 1000000007
//#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define N 2114514
const ll mod = 998244353;
const ll inf = 1000000000000000000;
ll a[N],b[N];
int main() {
ll n;
cin >> n;
ll sum = 0;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
for(in... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
// #define ll unsigned long long
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define vl vector<ll>
#def... |
#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 lo... | #include <bits/stdc++.h>
#define lli long long int
using namespace std;
#define mod 1000000007
#define MOD 1000000037
#define mod1 998244353
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define INF 2147483607
#define common cout << "Case #" << w+1 << ": "
int main()
{
int n;
... |
//:::: Alien :::://
// Muhammad Eid //
#include <bits/stdc++.h>
using namespace std;
void Mo35() {
// ios_base::sync_with_stdio(false);
// cin.tie(nullptr);
// cout.tie(nullptr);
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
}
int main() { Mo3... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define dup(x, y) (((x) + (y)-1) / (y))
#define PI 3.14159265359
typedef long long LL;
const LL MOD = 1e9 + 7;
cons... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int ... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("unroll-loops")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while... |
#define _GLIBCXX_DEBUG
#include<iostream>
#include<iomanip>
#include<string>
#include<cstdlib>
#include<vector>
#include<algorithm>
#include<queue>
#include<ctime>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(n);i++)
constexpr double et = 1.8;
int N = 30;
int Si, Sj, Ti, Tj;
int main() ... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long n, m, mod = 998244353, ans = 0, mans, a, k, h = 200001;
cin >> n >> m;
long dp[19][h];
bool s[h] = {};
vector<long> v;
for(int i = 2; i < h; i++){
if(s[i] == 0){
v.push_back(i);
for(int j = 2 * i; j ... | #include<bits/stdc++.h>
typedef int64_t i64;
typedef long double f128;
using namespace std;
template<typename T>
void scan(T& n)
{
cin>>n;
return;
}
void scan()
{
return;
}
template<typename T,class... Args>
void scan(T& n,Args&... args)
{
scan(n);
scan(args...);
return;
}
template<typename T>
void scan... |
//*****************************************************************************
//* __ ________ __________ __________ __ __ *
//* | | | | ||_________| ||________| || || *
//* | | | | || || || || *... | #include <bits/stdc++.h>
#define fi first
#define se second
#define sz(v) ((int)v.size())
#define all(v) (v).begin(), (v).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
template<int mod>
struct modint{
int v;
modint(ll vv=0){s(vv%mod+mod);}
mo... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<int,int>
ll cnt(ll y,ll x,map<ll,ll> &data){
if(data.count(y)){
return data[y];
}
if(x>=y){
data[y] = x-y;
return (ll) x-y;
}
if(y%2==0){
ll z = min(cnt(y/2,x,data)+... | /*
Nguyen Duc Anh Phuc_Jacke
*/
#include <limits.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <unordered_set>
#include <set>
#include <fstream>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
#define fi... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> ii;
int main() {
int t, n;
scanf("%d %d", &t, &n);
ll l = 0, r = 1e14, ans;
while (l <= r) {
ll mid = (l+r)/2, nex = (100*mid... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define all(x) x.begin(), x.end()
using namespace std;
//using namespace atcoder;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define FORL(i,x) for(int i=head[x];i;i=nxt[i])
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(... | #include<bits/stdc++.h>
#include<chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define ll long long int
#define ull unsigned long long int
#define FOR(I,a,b) for(ll I=a;I<b;I++)
#define FORit(it,a) for(... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char arr[3];
for (int i=0; i<3; i++) {
cin >> arr[i];
}
char temp = arr[0];
for (int i=0; i<2; i++) {
arr[i] = arr[i+1];
}
arr[2] = temp;
for (int i=0; i<3; i++) {
cout << arr[i];
}
ret... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int MOD=1e9+7;
void test_case(){
int n;cin>>n;
vector<ll> arr(n),brr(n),ans(n);
for(ll &x:arr)cin>>x;
for(ll &x:brr)cin>>x;
ll amax=-1;
ll mx=-1;
for(int i=0;i<n;i++){
amax=max(amax,arr[... |
//git pull --rebase origin master
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using P = pair<int, int>;
using P3 = pair<int,P>;
using PP = pair<P, P>;
constexpr ll INF = 1LL << 60;
constexpr ll MOD = ll(1e9+7);
constexpr int di[] = {0, 1, 0, -1};
constexpr int dj[] = {1, 0, -1, 0};
conste... |
#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef pair<int, long long> P;
long long n;
long long qq[200001];
vector<P> vc[200001];
void dfs(int pt, int par){
for(auto i : vc[pt]){
if(i.first==par) continue;
qq[i.first]=qq[pt]^i.second;
dfs(i.first, pt);
}
}
int main(){
long lon... | //Bismillahirrahmanirrahim
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(fa... |
#include <iostream>
using namespace std;
int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }
int main() {
int n;
cin >> n;
int x = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
x = gcd(x, a);
}
cout << x;
} | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define ppb pop_back()
#define ppf pop_front()
#define all(vec) vec.begin(), vec.end()
#define fol(i,a,b) for (int i = (a), _b = (b); i < _b; i++)
#define loop(i,a,b) for (int i = (a), _b = (b); ... |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | #include<bits/stdc++.h>
using namespace std;
const int N=100005;
const long long MOD=998244353;
const long long INV=499122177;
int n,k;
long long p[N],s[N],f[N],inv[N];
long long ksm(long long a,int b)
{
long long res=1;
while(b)
{
if(b&1) res=res*a%MOD;
a=a*a%MOD,b/=2;
}
return res;
}
long long C(int a,int... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.