code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
// CPP
// Mind_flayer404
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define pb push_back
#define F first
#define S second
#define ub u... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void run(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int karp(int n){
int f[11]={};
int z=1,y=1;
while(n>0){
f[n%10]++;
n/=10;
}
for(int i=9;i>=0;i--){
for(int j=0;j<f[i];j++){
... |
#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,s... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, w, q, r;
cin >> a >> b >> w;
w *= 1000;
r = w / a;
if(w % b == 0) q = w / b;
else q = w / b + 1;
if(q > r) cout << "UNSATISFIABLE" << endl;
else{
cout << q << " " << r << endl;
}
} |
#include<cstdio>
int n,f,l;
struct node{
int rating,id;
}a[65537];
inline int read() {
int ln=0;
char ch=getchar();
while(ch<'0'||ch>'9') ch=getchar();
while(ch>='0'&&ch<='9') {
ln=(ln<<3)+(ln<<1)+ch-'0';
ch=getchar();
}
return ln;
}
int main() {
l=1,f=2;
n=(1<<read());
for(int i=1;i<=n;i++) {
a[i].rati... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<t... |
#include <bits/stdc++.h>
#define ll long long int
#define w(t) int t; cin>>t; while(t--)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define mii map<int,int>
#defin... | /*{{{*/
#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... |
// Jai Shree Ram
#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;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ook order_of_key
#define fb... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 1<<19;
int N, M, Q;
ll a[200005], b[200005];
vector<ll> v;
vector<pair<int, ll>> tree_a(MAXN), tree_b(MAXN); // cnt, sum
int qt[200005], qx[200005], qy[200005];
void update(vector<pair<int, ll>> &tree, int node, int s, int e, int idx, ... |
#include<bits/stdc++.h>
using namespace std;
#define forr(i,a,n) for(long long int i=a; i<n; i++)
#define loop(i,a,n) for(long long int i=a; i>=n; i--)
int main()
{
ios_base :: sync_with_stdio(false),cin.tie(NULL);
int a;
cin>>a;
vector<pair<double,double>> v;
forr(i, 0, a)
{
int x, y;
cin>>x>>y;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> x(n), y(n);
for(int i=0; i<n; i++){
cin >> x[i] >> y[i];
}
int ans = 0;
for(int i=0; i<n; i++){
for(int j=0; j<i; j++){
int dx = abs(x[i] - x[j]);
int dy = abs(y[... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int nCr(int i,int j){
int sum=1;
for(int X=1;X<=j;X++){
sum*=(i-X+1);sum/=X;
}
return sum;
}
signed main(){
int A,B,K;cin>>A>>B>>K;
int now=K;
int NA=A,NB=B;
string S="";
for(int X=0;X<A+B;X++){
if(now>nCr(NA+NB-1,NB)){
n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)n; ++i)
using ll=long long;
vector<vector<ll>> c;
string kth(int a,int b,ll k) {
if(a==0) return string(b, 'b');
if(b==0) return string(a, 'a');
if(k<=c[a-1][b]) return string("a")+kth(a-1,b,k);
else return string("b")+... |
#include<bits/stdc++.h>
#define PI 3.141592653589793238462
#define eps 1e-20
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll a[105],d[100005];
int main(){
ll n,sum=0;cin>>n;
f... | #include <bits/stdc++.h>
using namespace std;
using Table = vector<vector<int>>;
template<typename T>
bool chmin(T &a, T b)
{
if (a > b) {
a = b;
return true;
}
return false;
}
int main()
{
int N;
cin >> N;
vector<int> T(N);
for (auto &Ti : T)
cin >> Ti;
constex... |
#include<cstdio>
int n;
int cnt[500];
int main(){
for(int i = 1; i <= 255; ++i) cnt[i] = cnt[i >> 1] + (i & 1);
scanf("%d", &n);
printf("%d\n", (1 << n) - 1);
for(int i = 1; i < (1 << n); ++i){
for(int t = 1; t <= (1 << n); ++t)
printf("%c", (cnt[t & i] & 1) ? 'A' : 'B');
puts("... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
ll rd(){
int f = 1;
ll x = 0;
char ch = getchar();
while(ch < '0' || ch > '9') {
if(ch == '-') f = -1;
ch = getchar();
}
while(ch >= '0' && ch <= '9'){
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}... |
#include <bits/stdc++.h>
int main(){
int N;
std::cin >> N;
std::vector< int > A(N);
for(int i=0; i<N; i++){
std::cin >> A[i];
}
int max = 0;
for(int i=0; i<N; i++){
int cur_min = 1e9;
int cur = 0;
for(int j=i; j<N; j++){
cur_min = std::min(cu... | // #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 998244353
str... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const bool ready = [](){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
using ld=long double;
const ld PI = acos((ld)-1);
using ll= ... |
#include<bits/stdc++.h>
#include<queue>
using namespace std;
int main () {
int N;
cin >> N;
string S, T;
cin >> S >> T;
int s = 0;
int t = 0;
for (int i = N - 1; i >= 0; i --) {
if (S[i] == '1') s ++;
if (T[i] == '1') t ++;
if (s < t) {
cout << -1 << endl;
return 0;
}
}
if ... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
void no(){
cout << "-1";
exit(0);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
string S, T;
cin >> N >> S >> T;
vector<int> s, t;
for(int i = 0; i < N; i += 1) if(S[i] == ... |
#include <iostream>
using namespace std;
int main()
{
int X;
cin >> X;
if (X % 100 == 0) {
X = 100;
} else {
X = 100 - X%100;
}
cout << X;
return 0;
}
| #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... |
#include <iostream>
#include<stdio.h>
using namespace std;
int a[1010];
int main()
{
int b;
int n,c=0;
scanf("%d",&n);
for(int i=1; i<=n; i++)
{
scanf("%d",&b);
if(b>n)
{
c=-1;
break;
}
a[b]++;
}
for(int i=1; i<=n; i++)
{
... | #include<bits/stdc++.h>
using namespace std;
const int N=2e5+6;
char c[N];
char l[N];
int len,top;
int main()
{
cin>>len;
scanf("%s",c+1);
int p=len;
int tot=1;
tot=0;
for(int i=1;i<=len;i++)
{
tot++;
l[tot]=c[i];
if(tot>=3&&l[tot]=='x'&&l[tot-1]=='o'&&l[tot-2]=='f')
p-=3,tot-=3;
}
cout<<p;
return 0;
... |
#include<functional>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<utility>
#include<string>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
using namesp... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = ... |
#include <bits/stdc++.h>
using namespace std;
/* ループ処理 0からnまで*/
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int x, y;
cin >> x >> y;
if (x == y)
{
cout << x << endl;
return 0;
}
cout << 3 - (x + y) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define vi vector <int>
#define vll vector <long long int>
#define pb push_back
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define time cerr << "Time taken : "<<(float)clock()/CLOCKS_PER_SEC<<... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, x;
cin >> n >> x;
string s;
cin >> s;
for(int i=0; i<s.size();++i){
if(s.at(i)=='o') x++;
else if(x > 0) x--;
}
cout << x << endl;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define re return
#define all(a) a.begin(),a.end()
#define int long long
#define rept(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) rept(i,0,a)
#define vi vector<int>
#define vvi(_Name,_Height,_Width) vector<vi>_Name(_He... |
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#define fs(i,x,y) for(int i=(x),_=(y);i<=_;++i)
#define fn(i,x,y) for(int i=(x),_=(y);i>=_;--i)
#define tor(i,v,x) for(int i=head[x],v=to[i];i;i=nxt[i],v=to[i])
#define Li inline
#define R regist... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int N, M;
int a[MAXN][2];
vector <pair <int, int>> adj[MAXN];
int bio[MAXN], ans[MAXN];
int c[MAXN];
void load() {
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++)
for (int j = 0; j < 2; j++)
scanf("%d", a[i] + j);
for (int 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;
// #define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define For... | #pragma GCC optimize("Ofast")
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define mod (int)(1e9+7)
#define mod2 998244353
#define PI 3.1415926535897932384626433832795
void... |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
//#define MOD 1000000007
#define MOD 998244353
#define INF 1000000000000000000
#define VE vector
#define VL vector<LL>
#define VVL VE<VL>
#define VVVL VE<VVL>
#define LD long double
#define PB push_back
#define POB pop_back
#define FOR(i,a,k) for(LL i=a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<int,int,int>
using Graph = vector<vector<int>>;
int main(){
int N; cin >> N;
string S; cin >> S; int a[N+3];
rep(i,N+1){
cin >> a[i+1];
}
... |
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define P... | #include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
int N;
vector<int> g[2020];
int dist[2020];
int main()
{
scanf("%d", &N);
for(int i=0; i<N/2; i++)
{
g[i].push_back(i*2);
g[i].push_back(i*2+1);
}
for(int i=N/2; i<N; i++)
{
g[i].push_back((i*2)%N);
g[i].push_back... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define P pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
int main(){
ll n;
cin >> n;
v... | #include<bits/stdc++.h>
#define inf 999999999
using namespace std;
const int maxn=1e5+10;
int n,sz[maxn],h[maxn],tot,f[maxn];
struct edge{int t,n;}e[maxn<<1];
void ins(int u,int v){e[++tot]=edge{v,h[u]};h[u]=tot;}
void dfs(int v,int fa)
{
int sum=0;
vector<int>seq;
for(int i=h[v];i;i=e[i].n)
{
if(e[i].t==fa)conti... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int A[n];
int B[n];
for (int i = 0; i < n; i++)
{
cin >> A[i] >> B[i];
}
int ans = 1000000;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#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 ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
set<char> s;
for(char c : s1) s.insert(c);
for(char c : s2) s.insert(c);
for(char c : s3) s.insert(c);
if(s.size() > ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define F first
#define S second
#define YES(n)cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
int main(){
vector<st... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LL long long
#define int long long
#define ull unsigned long long
#define fi first
#define s... | #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 <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(Array) sort(A... | #include <iostream>
#include <vector>
using namespace std;
int n, ans = -1;
vector<int> nums, lst;
void dfs(int pos, int s) {
if (pos == n) {
if (lst.size() > 0 && s % 3 == 0) ans = max(ans, (int)lst.size());
return ;
}
lst.push_back(nums[pos]);
dfs(pos + 1, s + nums[pos]);
lst.pop_... |
#include <iostream>
using namespace std;
typedef long long ll;
int main(){
string S;
ll a;
scanf("%lld",&a);
cin >> S;
for (ll i=0; i<a-2; i++) {
if (S[i]=='f' && S[i+1]=='o' && S[i+2]=='x') {
S.erase(i, 3);
i-=3;
}
}
cout << S.size() << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#include<string.h>
#define pi 3.1415926535897932384626433832795028841971
#define fastttt std::ios::sync_with_stdio(false);std::cin.tie(NULL);std::cout.tie(NULL);
#define str_max_len 4294967295
#define mod 1000000007
#define max_ll LLONG_MAX
#define... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << "["; for... | #include<bits/stdc++.h>
using namespace std;
int n,a[105][105],b[105][105];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
string s;
cin>>s;
b[i][i]=1;
for(int j=1;j<=n;j++)
if(s[j-1]=='1')
a[i][j]=b[j][i]=1;
}
for(int t=1;t<=n;t++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
b[i][j]=b[i][... |
#include "bits/stdc++.h"
using namespace std;
#define int long long int
int32_t main()
{
int n,m;
cin>>n>>m;
vector<int> a(n+1),b(m+1);
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=m;i++)
{
cin>>b[i];
}
vector<vector<int> > dp(n+1,vector<int>(m+1));
... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define pb push_back
#define all(_obj) _obj.begin(),_obj.end()
#define F first
#define S second
#define pll pair<ll, ll>
#define vll vector<ll>
ll n,m,a,b,c,k,temp,x,y,INF=1e18;
const int MAXN=1e5+11,mod=1e9+7;
ll max(ll a,ll b) {return ((a>b)?a:b);}
l... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_... | #include <bits/stdc++.h>
#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 ll long long
#define pb push_back
using namespace std;
inline void rd(int &x){scanf("%d", &x);}
inline void rd(ll &x){scanf("%lld", &x);}
int n, m, k;
const int maxn = 1145;
int par[maxn <<... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main()
{
int v, t, s, d;
cin >> v >> t >> s >> d;
if (t * v <= d && d <= s * v)
{
cout << "No" << endl;
}
else
{
cout << "Yes" << endl;
}
return... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define get(a) ll a ; cin >> a ;
#define show(a) cout << a << endl;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
get(v);
get(t);
get(s);
get(d);
float time = d/float(v);
if ( time < t or time > s)
cout << "Yes"<< e... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD=998244353;
LL n,a[105],sum,p[105],fac[105],dp[105][10005];
int main(){
scanf("%lld",&n);
for(LL i=1;i<=n;++i) scanf("%lld",&a[i]),sum+=a[i];
if(sum&1) return puts("0")&0;
for(LL i=1;i<=n;++i) ++p[a[i]];
fac[0]=1;
for(LL i=1;i<=100;++i... | //Date -> 27-06-2021
//Atcoder Grand Contest
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define all(x) (x).begin(),(x).end()
#define rep(i,a,b) for(ll i = a; i<b ; i++)
#define sz(x) (int)((x).size())... |
#include<cstdio>
#include<queue>
#define LL long long
using namespace std;
int read() {
int x=0,f=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
priority_queue<LL>q;
const int N=4e5+5;
int n;
LL v[N],ans;
main() {
n=read();
for(i... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#inc... |
// CODING BEAST
/*******************************************************************************************************************************************************/
#include<bits/stdc++.h>
using namespace std;
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a).begin... | #include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef... |
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define... | #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 ... |
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <tuple>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <bitset>
#include <list>
#include<iomanip>
using namespace std;
using ll = long long;
using UL... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n;
vector <int> num, used, tin, tout, add, dist, num1;
vector <vector <int> > graph, up;
vector <pair <int, int> > smth;
map <int, int> kek;
int timer = 0, res = 0;
const int l = 27;
int dfs(int v, int par) {
used[v] = 1;
int size_of_now... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define m_p make_pair
#define sz(x) (int)x.size()
#define line cerr<<"-----------------... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N, K, M; cin >> N >> K >> M;
vector<vector<int>> dp;
dp.push_back(vector<int>(1, 1));
for(int i=1;i<=N;i++){
int n = dp.back().size();
int m = min(n + i*K, 122501);
vector<int> v(m, 0);
for(int j... |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... | // D - increment of coins
#include <bits/stdc++.h>
using namespace std;
#define N 100
double dp[N][N][N];
bool vis[N][N][N];
double f(int g, int s, int b){ // g=gold, s=silver, b=bronze
if(g==N || s==N || b==N) return 1;
if(vis[g][s][b]) return dp[g][s][b] + 1;
vis[g][s][b] = true;
int t = g + s + b;
dp[g][s][b]... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i;
cin>>n;
long long a[n];
for(i=0;i<n;i++){cin>>a[i];}
unsigned long long int s=0,t=0;
sort(a,a+n);
for(i=1;i<n;i++)
{
t=t+(a[i]-a[i-1])*i;
s+=t;
}
cout<<s;
} | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
unsigned long long int t,n,i,x,mx,mn,f,j,s,r,y;
cin>>x;
s=0;
n=999000000000;
if(x>999)s+=(x-999);
if(x>999999)s+=(x-999999);
if(x>999999999)s+=(x-999999999)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long N;
cin >> N;
int x = (int)log10(N) + 1;
long long res = 0;
if (x >= 4) {
int y = x - 3;
rep(i, y) {
int z = i + 3;
if (i < y - 1)
... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
int x=0,y=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')y=-1;c=getchar();}
while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+c-'0';c=getchar();}
return x*y;
}
int n,a[200010],b[200010],c[10][2000010],cnt[10];
int ans;
bool cmp(int x,int y)
{
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < ... |
#include<cstdio>
bool vis[15];
int a[15][15], ans, n, k;
void dfs(int now, int tot, int cs) {
vis[now] = 1;
// printf("%d %d %d\n", now, tot, cs);
if(cs == n + 1) {
if(tot == k) {
ans ++;
} return;
}
if(cs == n) dfs(1, tot + a[now][1], cs + 1);
else {
for(int i = 1; i <= n; i ++) {
if(i == now) cont... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios::sync_with_stdio(false); cin.tie(nullptr)
#define TC(t) int t; cin >> t; for(int i = 1; i <= t; i++)
#define deb(x) cerr << #x << " = " << x << e... |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 100005
#define lowbit(x) (x&-x)
#define reg register
#define mkpr make_pair
#define fir first
#define sec second
typedef long long LL;
typedef unsigned long long uLL;
const LL INF=0x7f7f7f7f7f7f7f7f;
const int mo=998244353;
const int zero=500;
const LL jzm=2333;... | #include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vect... |
#include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define P pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define mp make_pair
#define rep(i, n) for (int i = 0, i##_le... | //clear adj and visited vector declared globally after each test case
//check for long long overflow
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Incase of close mle change language to c++17 or c++14
/**#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("u... |
#include <bits/stdc++.h>
//#include <chrono>
#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using vec ... | #include<bits/stdc++.h>
using namespace std;
int n, x[50];
int prime[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
int gcd(long long a, long long b) {
return b ? gcd(b, a % b) : a;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> x[i];
long long ans = 0x3f3f3f3f3f3f3f3f;
for (int i = 0; i < (1<<15); ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0; i < (n);i++)
#define _GLIBCXX_DEBUG
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int>x(n);
ll man = 0;
ll euc = 0;
int a = 0;
rep(i,n){
cin >> x[i];
x[i] = abs(x[i]);
man += x[i... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
long long n, m=0; cin >> n; double e=0;
vector<long long> x(n), c(n);
for(long long i=0;i<n;i++) cin >> x[i];
for(long long i=0;i<n;i++) m += abs(x[i]);
for(long long i=0;i<n;i++) e += pow(abs(x[i]), 2);
for(lo... |
#include <bits/stdc++.h>
const int mu=1e9+7,N=100005;
int n,a[N];
int main(){
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%d",&a[i]);
std::sort(a+1,a+n+1);
n=std::unique(a+1,a+n+1)-a-1;
int p=1;
for (int i=1;i<=n;i++) p=(long long)p*(a[i]-a[i-1]+1)%mu;
printf("%d\n",p);
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
//問題文を理解できなかった
// しきりを入れて区間に分ける
// 区間内はor演算、区間をまたぐときはxor演算を全ての要素同士で先頭から順に
// しきりを入れるパターンは、2^n-1(しきりを入れるか入れないか)
// 計算する場所としきりの場所がずれている!!
// 区間をor演算し終わったもの同士でxor演算する
// A={5,3,7,2,8}のとき
// 0 1 2 3 4
// 0 5|3 7|2 8|
// i=0 0とA[0](5)をor演算... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... | #include <iostream>
#include <climits>
#include <set>
#include <string>
#include <algorithm>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if(0)
#define ISRANGE(val,lo,hi) ((lo<=val)&&(val<hi))
int main(){
ll ans,a,b,c,d;
cin>>a>>b>>c>>d;
if(d*c-b>0){
... |
#line 1 "Contests/AtCoder_abc200/abc200_b/main.cpp"
using namespace std;
#line 2 "library/bits/stdc++.h"
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include ... | #include <iostream>
#include <string>
#define mod 3
using namespace std;
int n;
string s;
int dp[400000] = { 0 };
int f[400000] = { 0 };
int g[400000] = { 0 };
void compute()
{
dp[0] = 1;
f[0] = 0;
g[0] = 1;
for (int i = 1; i < n; ++i) {
f[i] += f[i - 1];
int j = i;
while (j % mo... |
#include <bits/stdc++.h>
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
const double PI = acos(-1.0);
int main() {
int H, W;
cin >> H >> W;
vector<string> mass(H);
int top, bottom;
top = -1, bottom = -1;
for (int i = 0; i < H; i++) {
cin >> mas... | //This Code was made by Chinese_zjc_.
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <ct... |
#include <bits/stdc++.h>
using namespace std;
#define INF (int)1e9
#define EPS (int)1e-9
#define ll long long
#define ld long double
#define FOR(i,m,n) for(int i=m; i<n; i++)
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
//#define endl "\n"
void solve(){
... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = int64_t; using ull = uint64_t; const ll INF = 9e18;
void print() { cout << endl; }
template<typename Head,typename... Tail> void print(Head head,Tail... tail){cout<<head;if(sizeof...(Tail)>0)cout<<" ";print(tail...);}
void print0() {}
template... |
#include <iostream>
using namespace std;
int main()
{
int a,b,sumA=0,sumB=0;
cin>>a>>b;
while(a!=0)
{
sumA+= a%10;
a/=10;
sumB+= b%10;
b/=10;
}
if(sumA>=sumB)
cout<<sumA;
else
cout<<sumB;
}
| #include <bits/stdc++.h>
#include <cctype>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template<typename key, typename val>
//using ordered_tree =
// tree<key, val, std::less<>, rb_tree_tag, tree_order_statistics_node_update>;
using namespace std;
t... |
//remove #define int long long in critical cases to avoid TLE
//always use ll with constants like (1ll)<<59 otherwise ans will be zero at higher cases
//while doing question on comparing, sort elements according to the difference they produce
//when elements are unique sorting elements after inserting in vector sometim... | #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" : "fa... |
#line 1 "/home/anqooqie/.proconlib/tools/util.hpp"
#include <bits/stdc++.h>
using i64 = ::std::int_fast64_t;
using u64 = ::std::uint_fast64_t;
using i32 = ::std::int_fast32_t;
using u32 = ::std::uint_fast32_t;
#define all(x) ::std::begin((x)), ::std::end((x))
namespace tools {
template <typename T>
void read(... | #include <bits/stdc++.h>
//#include <atcoder/modint>
//using namespace atcoder;
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.en... |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <numeric>
#in... | //#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,sse,sse2")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (ll i = j; i <= n; i++)
#define per(i, j, n) for (ll i = j; i >= n; i--)
#define ll long long
#define ld long double
#define ld long double
#define ii pair<ll, ll... |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
ll INF = 1000000000000000;
struct segment_tree{
int n; vector<ll> seg;
segment_tree(vector<ll> v){
n = v.size(); seg.resize(2*n);
for(int i=0;i<n;i++) seg[i + n] = v[i];
for(int i=n - 1;i>0;i... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(i,a,b) for(int i = a; i<b ; i++)
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define M 1000000007
int mod(int x){
return ((x%M + M)%M);
}
int add(int a,int b){
return mod(mod(a)+mod(b)... |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
constexpr int INF = 1001001001... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll n;
int main(void){
scanf("%lld",&n);
ll ans=0;
ll rest=n;
int dig=1;
ll now=9;
ll su=0;
while(rest>0LL){
if(rest>=now){
ans+=now*((dig-1)/3LL);
rest-=now;
}else{
ans+=rest*((dig... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_map>
t... | #include<bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
typedef long long ll;
cs int N = 4e5 + 5;
int n, a[N], p[N], c[N];
ll ans;
#define mid ((l + r) >> 1)
cs int M = N << 2;
int mn[M], ta[M];
void up(int x) {
mn[x] = min(mn[x << 1], mn[x << 1 | 1]) + ta[x];
}
void build(int x, int l, i... |
#include<bits/stdc++.h>
#include<cmath>
#define SZ(x) ((int)x.size())
#include<vector>
#include<set>
#include<map>
#define ll long long
#define lli long long int
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#include<string>
#include<cctype>
#define F first
#define S second
#include<queue>
#define ii pair... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int,int> P;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a ... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... | #include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define bo... |
#include <iostream>
#include <bits/stdc++.h>
#include <bitset>
#define ll long long int
#define pi pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vll vector<vl>
#define vpi vector<pi>
#define vpll vector<pll>
#define vb vector<bool>
#define vii vector<... | #include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#define LL long long
using namespace std;
LL maxx[400000], arr[400000];
int main (){
LL n;
cin >> n;
for (LL i = 1;i <= n; ++ i){
scanf("%lld", &arr[i]);
}
LL m... |
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <string>
#include <bitset>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
//infの設定
#define INF32 2147483647
#define INF6... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
#include <map>
#include <memory>
#include <list>
#include <deque>
#include <queue>
#include <iomanip>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_set>
#include <unordered_map>
#inc... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include <bits/stdc++.h>
using namespace std;
//.define
// #define FILE_IN_OUT
#define RET(_x) cout << (_x) << '\n'; return;
#define all(_obj) (_obj).begin(), (_obj).end()
#define loop(_n) for (int i = 0; i < (_n); ++i)
#define sz(_obj) static_cast<int>((_obj).size())
#ifdef SHJ_LOCAL
#define debug(_x) std::c... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template < typename T_cont... | #include <iostream>
#include <cstdlib>
#include <cstring>
#include <string>
#include <bitset>
#include <cmath>
#include <algorithm>
#include <climits>
using namespace std;
typedef long long ll;
//infの設定
#define INF32 2147483647
#define INF64 9223372036854775807
//repマクロ
#define rep(i, m, n) for (int i = (m); (i) < (in... |
#include <bits/stdc++.h>
signed main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int n;
std::string s;
std::cin >> n >> s;
int ans = 0;
for (int i = 0; i < n; i++) {
int at = 0, gc = 0;
for (int j = i; j < n; j++) {
if (s[j] == 'A') ++at;
... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<functional>
//#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3... |
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algor... | #include<bits/stdc++.h>
using namespace std;
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define ull unsigned long long
#define pb push_back
#define All(x) (x).begin(),(x).end()
#define mp make_pair
#define nl "\n"
typedef pair<int,int>ii;
typedef vector<int>vi;
typedef vector<ii>v... |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define ALL(a) (a).begin(),(a).end()
typedef long long int ll;
typedef string str;
typedef pair<ll, ll> P;
using Graph = vector<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int h,w,a,b;
ll ans = 0;
vector < vector <int> > arr;
unordered_map <string, ll > mp;
int cal(int x,int y,int a,int b,vector < vector <int> > &arr, ll mask)
{
string s=to_string(x)+" "+to_string(y)+" "+to_string(a)+... |
//khodaya khodet komak kon
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <pii, int> ppi... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>... |
//ABC_196_E_
//
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define reps(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,q;
cin >> n;
const ll INF = ll(1)<<60;
ll l = -INF, r = INF;
ll s = 0;
rep(i,n)
{
... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define cap(i) ((i-1)%500+1)
#define cp(i) ((i-... |
//#pragma GCC target("avx2")
//#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr)
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define lc(x) ((x)<<1)
#define rc(x) (((x)<<1)|1)
using namespace std;
type... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
#include <functional>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (ll)(n); i++)
#define ... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair <int, int>;
using pll = pair <ll, ll>;
#define FIO() ios_base::sync_with_stdio(0);cin.tie(NULL);
#define endl '\n'
int main() {
FIO();
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (r1 == r2 and c1 == c2) {
... | #include <bits/stdc++.h>
#include <cstdint>
using namespace std;
int main() {
long long A, B, C, D;
cin >> A >> B;
cin >> C >> D;
C -= A;
D -= B;
C = abs(C);
D = abs(D);
long long x = max(C,D);
long long y = min(C,D);
C = x;
D = y;
if(x == 0 && y == 0) {
cout << "0";
}
else if(x==y || x... |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n; cin >> n;
unordered_map<int, bool> mp;
int current = 0;
for(int i = 0; i < n; ++i) {
int tmp; cin >> tmp;
mp[tmp] = true;
while(mp[current]) ++current;
printf("%d\n", current);
}
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
using namespace std;
//#define MODE 1
#ifdef MODE
#d... |
#include <iostream>
using namespace std;
int main()
{
char s, t;
cin >> s >> t;
if(s == 'Y') cout << char(t - 32) << endl;
else cout << t << endl;
}
| /*#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("inline")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-f... |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
const int mod=1e9+7;
const int maxV=2e7+1;
const ll inf=1e18+1;
int main(){
// freopen("input.txt","r",stdin);
// f... | #include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main(){
ll N;
cin >> N;
for(ll i = 1; ; i++) if(stoll(to_string(i) + to_string(i)) > N){
cout << i - 1 << endl;
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vec... | #include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
int a[1001], b[1001], c[2001], p, k, j, n, m, i;
cin >> n >> m;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < m; i++)
cin >> b[i];
p = 0;
for (i = 0; i < n; i++)
{
k = 0;
for(j = 0; j < m; j... |
#include<bits/stdc++.h>
using namespace std;
// #define LOCAL
typedef long long ll;
#ifdef LOCAL
const int N = 105;
#else
const int N = 2e5 + 105;
#endif
#define mid (l + r >> 1)
#define ls (rt << 1)
#define rs (rt << 1 | 1)
const int M = N + N;
int a[N], b[N], n;
int tr[M << 2];
void init(){
set<int> se... | #include<iostream>
#include<list>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof..... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#ifndef LOCAL
#define dmp(...) ;
#else
#d... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int count = 0;
for (int i = 1; i <= n; i++)
{
int i10 = i, i8 = i;
bool flag = false;
while (i10 > 0)
{
if (i10 % 10 == 7)
{
flag = true;
}
... |
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define deb(...)
#endif
#define int long long int
#define endl '\n'
void solve() {
int n, k;
cin >> n >> k;
vector<pair<int, int>>v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
s... | #include<bits/stdc++.h>
using namespace std;
int main(void) {
int n;
long long k;
long long x, y;
vector<pair<long long, long long> >a;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x >> y;
a.push_back({ x,y }); //a[i].first=A_i, a[i].second=B_i
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++)... |
#include <bits/stdc++.h>
#define PB push_back
#define MP(x,y) make_pair(x,y)
#define F first
#define S second
#define loop(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rloop(i,m,n) for(int i=(int)(m) ; i > (int) (n) ; --i )
#define lp(i,n) loop(i,0,n)
#define rlp(i,n) rloop(i,n,0)
#define mod 1000000007
us... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debugger.h>
#else
#define dbg(x...) {}
#define dbg_t() {}
#endif
using ll = long long;
using ld = long double;
const ll INF = 1e18;
const ll MOD = 1e9+7;
namespace mod_op
{
ll madd(ll a, ll b)
{
return (a + b) % MOD;
}
ll mmul(l... |
#include <cstdio>
#define rep( i, a, b ) for( int (i) = (a) ; (i) <= (b) ; (i) ++ )
#define per( i, a, b ) for( int (i) = (a) ; (i) >= (b) ; (i) -- )
const int MAXN = 105;
template<typename _T>
void read( _T &x )
{
x = 0;char s = getchar();int f = 1;
while( s > '9' || s < '0' ){if( s == '-' ) f = -1; s = getchar()... | /*
JAI JAGANNATH!
*/
//@Author : zanj0
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main () {
std::ios::sync_with_stdio(false); std::cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<pair<int,int>>> g(n);
for (int i = 0; i < m; i++) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
g[a].emplace_bac... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
u... |
//Radhe Radhe
#include<bits/stdc++.h>
#define FASTIO_ ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define mod 1000000007
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define itr(i,n) for(ll i=0; i<n; i++)
#define itr_ab(i,a... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int arr[]={a,b,c};
int count=0;
sort(arr,arr+3);
if(arr[1]-arr[0]==arr[2]-arr[1])count++;
if(count==1)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n, q;
cin>>n>>q;
vector<ll> a(n+1, 0), c(n+1, 0);
for (int i = 1; i <= n; ++i)
{
cin>>a[i];
}
for (int i = 1; i <= n; ++i)
{
c[i] = a[i] - i... | #include <bits/stdc++.h>
//#define DEBUG
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define deb(x) std::cout << #x << " " << x << endl;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template<typename... T>
void read(T& ... a){
((cin >> a),...);
}
template<type... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(vector<bool>::reference b) { return to_string(int(b)); }
string to_stri... | /*pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define r... |
#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;
typedef long long ll;
int N;
int f(int x) {
while (x > N - 1) {
int a = 1;
while (a * 2 <= x) a *= 2;
x -= a;
}
return x + 1;
}
int main() {
cin >> N;
rep(i, 0, N) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... |
#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;
typedef long long ll;
int main() {
int N, M, maxw = 0, minv = 1e9, ans = 1e9;
cin >> N >> M;
vector<int> w(N), l(M), v(M), s(1 << N, 0), d(1 << N, 0), a(N);
rep(i, 0, N) {
cin >> w[i];
ma... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
# define drep(i,a,b) for(int i=(a); i>=(b); --i)
typedef __int128 int_;
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(; c<'0'||c>'9'; c... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
unordered_map<ll,ll>dp;
ll n,m;
ll fun(ll x){
if(n>=x) return n-x;
if(dp[x]) re... | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... |
#include<bits/stdc++.h>
#define LL long long
#define DB long double
using namespace std;
//#define P 998244353
//inline int ad(int x,int y){return (x+y>=P)?(x+y-P):(x+y);}
//inline int mt(int x,int y){return 1ll*x*y%P;}
//inline void mo(int &x){x=(x>=P)?(x-P):x; x=(x<0)?(x+P):x;}
template<typename T>inline void ckmx(T ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl "\n"
#define mod 1000000007
#define all(x) (x).begin(),(x).end()
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
int ddx[]={0,0,1,-1,1,-1,1,-1};
int ddy[]={1,-1,0,0,-1,1,1,-1};
#define IOS ios::sync_with_stdio(0); cin.tie(0);... |
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 2e5 + 5;
int n, a[MAXN];
int main() {
scanf("%d", &n);
for(int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
int ans = a[0];
for(int i = 0; i < n; ++i) {
ans = __gcd(ans, a[i]);
}
// while(true) {
// int minVal = 2e9;
// for(int i = 0; i < n;... |
//#pragma GCC target("avx2")
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
c... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long double LD;
typedef pair<int, int> II;
const LD EPS = 1e-8;
bool solve(int N, vector<i... | /*
Author: Nguyen Tan Bao
Status:
Idea:
*/
#include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(),a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORE(i,a,b) for (int i ... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3f;
int main()
{
ios... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF=1e9+7;
const ll INFF=1e18+7;
#define nl '\n'
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 <<... |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_poizcy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define mem(a,h) memset(a, (h), sizeof(a))
#define por(a,b) (((a%MOD) * (b%MOD))%M... | // #include<bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <ctime>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cassert>
#include <bitset>
using namespace std;
int main() {
long... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
void solve(long long N, long long K, std::vector<std::vector<long long>> A){
// 中央値を ll 以下にすることが可能か
int ok = 1e9;
int ng = -1;
auto... | #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 <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; ... |
//It is good to start with zero//
// kyu @Aryabhatta//
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define repA(i, a, n) for(ll i = a; i <= (n); ++i)
#define repD(i, a, n) for(ll i = a... |
#include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;
const int max_n = 1e5+100;
const int max_sum = 1e7+100;
const int max_len = 1e6+110;
const int offset = 1e5+10;
const int inf = 1e18;
int n;
vector<int> adj[... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define debug(x) cout << #x << ": " << x << std::endl
#else
#define debug(x)
#pragma GCC target("avx")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC ... |
/*
author: Kamal Kant Bhardwaj
date:
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define N 20000006
#define F first
#define S second
#define test(x) int x; ci... | #include<cstdio>
#include<cstring>
using namespace std;
int main()
{
int t;scanf("%d",&t);
while(t--)
{
int n;scanf("%d%*s%*s%*s",&n);
for(int i=1;i<=n;i++)putchar('0');
for(int i=1;i<=n;i++)putchar('1');
puts("0");
}
return 0;
} |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
int main(){
int n,m; cin >> n >> m;
cout << n/m << endl;
} | #include<bits/stdc++.h>
#define for_int(i,a,b) for(int i=(a);i<=(b);++i)
#define rep_int(i,a,b) for(int i=(a);i>=(b);--i)
#define for_ll(i,a,b) for(ll i=(a);i<=(b);++i)
#define rep_ll(i,a,b) for(ll i=(a);i>=(b);--i)
#define Ios ios::sync_with_stdio(false),cin.tie(0)
#define ull unsigned long long
#define ll long long
#... |
/*
-------------- | /
| | /
| | /
| * |/ | | ------ *
| | | | / \
| | |\ | | | |\ |
\ ... | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... |
#include <iostream>
#include <unordered_map>
int main()
{
int n;
std::cin >> n;
std::unordered_map<int, int> table;
for (int i = 0; i < n; ++i)
{
int a;
std::cin >> a;
table[a] += 1;
}
int64_t total = 0;
int consumed = 0;
for (const auto &e : table)
{
... | #include<bits/stdc++.h>
using namespace std;
// ---------- Debugger
#define TRACE
string to_string(string s) {
return '"' + s + '"';
}
string to_string(char c) {
return '\'' + string(1, c) + '\'';
}
string to_string(char * s) {
return to_string((string) s);
}
string to_string(const char * s) {
ret... |
//@Author: KeinYukiyoshi
// 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... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.