code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#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 fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define fp(i,a,b) for(ll i=a ; i<b ; i++)
#define fn(i,a,b) for(int i=a ; i>=b ; i--)
#define ones(x) __built... | #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 ordered_set tree<int, null_type , less<int> , rb_tree_tag , tree_order_statistics_node_update>
#define int long long int
#define ull unsigned long long
#de... |
#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k,m,a,x;
cin >> n >> k >> m;
int sum = 0;
for(int i = 0; i < (n -1); i++){
cin >> a;
sum += a;
}
x = m * n - sum;
x = 0 > x ? 0 : x;
x = k >= x ? x : -1 ;
cout << x << endl;
} |
#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>
using namespace std;
#define ll long long
#define debug(x) cout << #x << ":\t" << x << endl;
const int N = 2e6 + 10;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1e9 + 7;
int n;
int a[N], b[N];
int dp[1010][1010], vis[1010];
int main() {
scanf("%d", &n);
for (... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> x(n);
vector<int> y(n);
for(int i=0;i<n;i++){
cin>>x.at(i)>>y.at(i);
}
bool ans=false;
int re_up,re_down,im_up,im_down;
for(int i=0;i<n-2;i++... | #include "bits/stdc++.h"
#define ll long long
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FOR(i, a, b) for (int i=a; i<(b); i++)
using namespace std;
bool collinear(int x1, int y1, int x2, int y2, int x3, int y3) {
return (y1 - y2) * (x1 - x3) == (y1 - y3) * (x1 - x2);
}
int main(){
ios::sync_with_stdio... |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <iterator>
#include <cmath>
#include <set>
#include <deque>
#include <string>
using namespace std;
int n;
char s[200010];
long long totalCount;
long long getStartPos() {
if ((s[0] == '1') && (s[1]... |
#include <bits/stdc++.h>
using namespace std;
const int c=5002;
long long n, m, sum, mod=998244353;
long long po[c][c];
int main()
{
ios_base::sync_with_stdio(false);
cin >> n >> m;
for (int i=0; i<=m; i++) {
po[i][0]=1;
}
for (int i=0; i<=m; i++) {
for (int j=1; j<=n; j++) {
... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n... |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <numeric>
/* debug macros */
#ifdef WAFDAYO
#define DBG_LINE() {std::cerr<<"\e[2m[L"<<__LINE__<<... | /*
* author: cyclexit
* start from: 2021-01-25 16:23
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
struct Point {
T x, y;
};
template<typename T>
struct Plane {
array<T, 3> unitx{1, 0, 0};
array<T, 3> unity{0, 1, 0};
};
template<typename T>
inline Plane<T> rot... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using VP = vector<pair<long long, long long>>;
ll A,B;
int main(){
cin >> A >> B;
ll E[A+B];
ll sum1 = 0,sum2 = 0;
if(A >= B) {
for(int i = 1; i <= A; ++i) {
E[i] = i;
... | //xhxh
//LYC_music yyds!
#include<bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
int pos=1,num=0;
char ch=getchar();
while (!isdigit(ch))
{
if (ch=='-') pos=-1;
ch=getchar();
}
while (isdigit(ch))
{
num=num*10+(int)(ch-'0');
ch=getchar();
}
return pos*num;
}
void write(int x)
{
... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll... | #include<bits/stdc++.h>
#define ll long long int
#define nl '\n'
#define pi acos(-1)
#define GCD(a, b) __gcd(a, b)
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define inout freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)
#define mo... |
#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
#include <bitset>
using namespace std;
#define rep(i,s,N) for(int i=s;i<N;i++)
typedef long long int lli;
//#define MOD 100000000
//#define MOD 998244353
i... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repp(i,k, n) for(int i = (int)(k); i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
if(n%2 == 0) cout << "White" << endl;
else cout << "Black" << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int euclidExt(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int x1, y1;
int d = euclidExt(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
void shiftAnswer(i... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void read(T&x){
x=0;
int f=1;
char ch=getchar();
while(!isdigit(ch)){
if(ch=='-')f*=-1;
ch=getchar();
}
while(isdigit(ch)){
x=x*10+(ch-'0');
ch=getchar();
}x*=f;
}
template<typename T>
void write(T x){
if(x<0)putchar('-'),x=-x;
if(x>9)w... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
const ll MAXN = 5e6;
ll n, m, k;
ll fac[MAXN];
void init_fac() {
fac[0] = 1;
for (ll i = 1; i < MAXN; i++)
fac[i] = fac[i-1] * i % MOD;
}
ll modpow(ll n, ll x) {
ll res = 1;
while (x) {
if (x &... | // #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define int long long int
#define vi vector<int>
#define ff first
#define ss second
#define ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll md = 998244353;
const ll OO = 1e16;
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(NULL)
int ad(ll a, ll b) {
return (a+b+md) % md;
}
int ml(ll a, ll b) {
return ((a%md) * (... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pob pop_back
#define S second
#define F first
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vll vector<long long int>
#define pll pair<long long int,long long int>
#define mod 1000000007
#define mod2 998244353
#def... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define vec vector
#define rip return 0
type... |
#include<cstdio>
long long n,a,b;
int main(){
scanf("%lld%lld%lld",&n,&a,&b);
printf("%lld\n",n-a+b);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll a,b,c,d;
cin>>a>>b;
cin>>c>>d;
cout<<a*d-c*b<<endl;
}
|
#pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#includ... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cos... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... | #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int prime=1000000007;
int N;
cin>>N;
vector <int> arr(N,0);
for(int i=0;i<N;i++){
int k;
cin>>k;
arr[i]=k;
}
sort(arr.begin(),arr.end());
int dif[N];
dif[0]=arr[0];
for(int i... |
/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);... | #include <bits/stdc++.h>
#include <cstring>
using namespace std;
typedef long long ll;
#define F0R(i, x, y) for (int i = x; i < y; i++)
#define FOR(i, n) F0R(i, 0, n)
#define F0RD(i, x, y) for (int i = y - 1; i >= x; i--)
#define FORD(i, n) F0RD(i, 0, n)
#define F first
#define S second
int mp(int x, int c) {
... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main(){
char s,t; cin >>s >>t;
if(s=='Y') t-=32;
cout << t << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI 3.141592653589793238462
/*########################################### DEBUG ###############################################################################################*/
#ifndef ONLINE_JUDGE
#define debug(x) \
cerr << #x << ... |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
const char newl = '\n';
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
te... | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const ll mod = 1e9 + 7;
int main() {
ll t, n, a, b;
scanf("%lld", &t);
while(t--) {
scanf("%lld%lld%lld", &n, &a, &b);
if(a + b > n) {
printf("0\n");
continue;
}
ll tmp = (n - a - b) % mod;
ll ans = (tmp + 1) % mod * (tmp + ... |
#include"iostream"
#include"cstdio"
#include"cmath"
#include"cstring"
#include"algorithm"
#include"stack"
#include"queue"
using namespace std;
#define read(x) scanf("%d",&x)
#define readl(x) scanf("%lld",&x)
#define ll long long
#define ull unsigned long long
#define MOD 998244353
#define MAXN 200005
int n,k;
ll su... | #include<bits/stdc++.h>
using namespace std;
const int MN = 2e5 + 5, MK = 305, MOD = 998244353;
int a[MN], sum[MK], c[MK][MK];
int main () {
int n,k;
scanf ("%d %d",&n,&k);
for (int i = 1; i <= n; i++) {
int a,pw=1; scanf ("%d",&a);
for (int i = 0; i <= k; i++) {
sum[i] += pw;
if (sum[i] >= MOD) sum[i] -= ... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <queue>
#include <numeric>
using namespace std;
using ll = long long;
#define For(i,a,b) for(ll i=(a);i<(ll)(b);i++)
#define rFor(i,a,b) for(ll i=(a);i>=(ll)(b);i--)
#define co(a) cout<<a<<endl
#define Sort(a) sort... | #include<bits/stdc++.h>
#define FULL(x,y) memset(x,y,sizeof(x))
#define ll long long
#define SZ(x) (int)x.size()
#define pb push_back
using namespace std;
const int N=300005;
int n;
ll a[N],pre[N],pre2[N];
int main() {
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) pre[i]=pre[i-1]+a[i];
for(int i=... |
/*
problem :
algorithm :
created : Programmer_juruo
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100005
#define lowbit(x) x & (-x)
#define F1(i, n) for(int i = 1; i <= n; i++)
#define F(i, a, n) for(int i = a; i <= n; i++)
#define F0(i, n) for(int i = 0; i < n; i++)
#define dbg(x) ... | #include <bits/stdc++.h>
#include <cmath>
#include <regex>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ll long long
#define all(x) (x).begin(),(x).end()
#define vll vector<long long int>
#define FAST ios_base :: sync_with_stdio (false); cin.tie (NULL)
using namespace std;
#defin... |
#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 1000000007
//... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cerr << #x << " = " << x << endl;
main(){
ios::sync_with_stdio(false); cin.tie(0);
int n, k;
cin >> n >> k;
while(k > 0){
if(n % 200 == 0) n /= 200;
else n = n * 1000 + 200;
k--;
}
cout << n;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf
#define INF64 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf
#define MOD 1000000007
ll myceil(ll a,ll b){return (a + (b - 1)) / b;}
ll myfloor(ll a,ll b){return a / b;}
int ReLU... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
ll ans=0;
vector<ll>data;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
ll x=n/i;
data.push_back(i);
if(x!=i) data.push_back(x);
}
}
... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using llu = unsigned long long;
using ld = long double;
#define CEIL(x, y) (ll)ceil((ld)(x) / (ld)(y))
#define dbgPR(ds) cout << ds.first << ' ' << ds.second;
#define dbgLST(ds) for(auto it : ds) cout << it << ' ';
#define dbgMP(ds) for(auto it : ds)... | // I've had my share of sand kicked in my face but I've come through
#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)
v... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+10;
struct BIT{
int n,tr[N];
void init(int _n){
n=_n;
memset(tr,0,sizeof tr);
}
void add(int x,int v){
for(int i=x;i<=n;i+=i&-i)
tr[i]+=v;
}
int sum(int x){
int ans=0;
for(int i=x;i;i-=i&-i)
ans+=tr[i];
return ans... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <random>
#include <chrono>
#include <queue>
#include <utility>
#include <string>
#include <set>
#include <map>
#include <cmath>
#include <limits>
#include <stack>
#define faster ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);... | #include <bits/stdc++.h>
#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)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("First");}else{puts("Second");}
#define MAX_N 200005
int main(... |
/*
__
/\ \
_ __ ___ ___\ \ \/'\ ___ __ ___ ___ __
/\`'__\/ __`\ /'___\ \ , < / __`\ /'__`\ /' _ `\ /' _ `\ /'__`\
\ \ \//\ \L\ \/\ \__/\ \ \\`\ /\ \L\ \/\ \L\.\_/\ \/\ \/\ \/\ \/\ \L\.\_
\ \_\\ \____/\ \____\\ \_\ \_\ \____/\ \__/.\_\ \_\ \_\ ... | #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>
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
// #include <unordered_map>
#include <set>
// #include <unordered_set>
#define debug(var) do{std::cout << #var << " :";std::c... | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_... |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll=long long;
typedef pair<ll,ll> P;
ll n,q;
vector<vector<ll>> G;
vector<P> edge;
int main(){
cin>>n;
G.resize(n);
edge.resize(n-1);
rep(i,n-1){
ll a,b;
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 17;
const int mod = 1e9+ 7;
int dp[(1<<N)][N];
int fx(vector<array<int,3>>&v, int mask , int last ){
if(dp[mask][last] != -1){
return dp[mask][last];
}
int n = v.size();
if(mask == ((1<<n) -1)){
... |
#include <bits/stdc++.h>
#define LL long long
#define ull unsigned long long
#define F(i, j, k) for(int i = j; i <= k; i++)
#define DF(i, j, k) for(int i = j; i >= k; i--)
using namespace std;
template <typename T> inline void read(T &n) {
T w = 1;
n = 0;
char ch = getchar();
while (!isdigit(ch) && ch != EOF)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N; cin >> N;
string S; cin >> S;
vector<vector<ll>> cnt(N + 1, vector<ll>(4, 0));
for (ll i = 0; i < S.size(); i++) {
for (ll j = 0; j < 4; j++) {
cnt[i + 1][j] = cnt[i][... |
#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>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define u... |
#include <iostream>
#include <vector>
#include <utility>
#include<algorithm>
#include <string>
#include <map>
#include <cmath>
#include <random>
#include <tuple>
#include <set>
#include <queue>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mod % 1000000007
using namespace std;
... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x)... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=(a); i<(n); i++)
#define rrep(i,a,n) for(int i=(a); i>=(n); i--)
#define all(n) begin(n),end(n)
#define rall(n) rbegin(n),rend(n)
//#define yn(bool) if(bool){cout<<Yes<<endl;}else{cout<<No<<endl;}
#define fore(i,a) for(auto &i:a)
using ll = long... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int A, B;
cin >> A >> B;
long long a = 0;
if(A > B){
for(int i = 1; i <= A; i++){
cout << i << " ";
a += i;
}
for(int i = 1; i < B; i++){
cout << -i << " ";
a -= i;... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using pii = pair<int,int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,... | #include <bits/stdc++.h>
using namespace std;
#define dbg(v) cout << __LINE__ << ": " << #v << " = " << v << endl
const int N = 1e5 + 5;
int main() {
int n, m;
scanf("%d %d", &n, &m);
vector <int> h(n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
sort(h.begin(), h.end());
... |
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;
const int BUF = 200005;
const int INF = 1 << 30;
class SegTree{
public:
vector<long long> v;
vector<long long> cnt;
SegTree(){
v = vector<long long>(BUF * 4, 0);
cnt = vector<long long>(BUF * 4, ... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const long long N=2e6+6;
ll a[N],b[N];
long long n,m,q,ans;
struct segment {
long long siz[N<<2],sum[N],ls[N<<2],rs[N<<2],cnt=0,root=0;
void change(ll l,ll r,ll &p,ll x,ll k) {
if(!p) p=++cnt;
if(l==r) {
sum[p]+=k*x;
siz[p]+=k;
return;
}... |
#include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
#include<complex>
#include<functional>
#include<stack>
#include<queue>
#include<set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i++)
#define rr... | #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... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int mod=1e9+7;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int k;
cin>>k;
int ans=0;
for(int i=1;i<=k;i++){
for(int j=1;j<=k;j++){
int... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RREP(i, n) for(int i=(n);i>=0;--i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define DUMP(x) c... |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using vb = vector<bool>;
using ll = long long; //約9.0*10^18
using vll = vector<ll>;
us... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
printf("%d %d\n",(i*2-1)%n+1,(i*2)%n+1);
return 0;
} |
/*
author : aryan57
created : 16-May-2021 18:55:19 IST
*/
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353... |
#include<bits/stdc++.h>
using namespace std;
#define M 500000
typedef long long ll;
typedef unsigned long long ull;
inline ll read() {
char ch;
ll f = 1, res = 0;
while ((ch = getchar()) < '0' || ch > '9')
if (ch == '-') f = -1;
while (ch >= '0' && ch <= '9') {
res = (res << 1) + (res << 3) + (ch ^ 48);
ch = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a... |
#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
usi... | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
#define maxn 3e5+50
using namespace std;
typedef long long ll;
typedef long long LL;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long ,long long>pll;
const ll mod = 1e9+7;
const... |
//Author- Vaibhav Singh
#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset tree<long long , null_type,less_equal<long long >, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set tree<long long , n... | /*
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 ll long long
ll a[2000005], b[2000005], tree[4*300000];
void build(ll node, ll lo, ll hi)
{
if(lo==hi)
{
tree[node] =a[lo];
return;
}
ll left = node*2, right = left+1;
ll mid = (lo+hi)/2;
build(left, lo, mid);
build(right... | #include<bits/stdc++.h>
using namespace std;
#define il inline
#define ri register int
#define ll long long
#define ui unsigned int
il ll read(){
bool f=true;ll x=0;
register char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=false;ch=getchar();}
while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=g... |
#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<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<map>
#include<set>
#include<random>
#include<algorithm>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<cstdio>
#include<cassert>
#include<sstream>
#in... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> L(N),R(N);
for(int i=0;i<N;i++) cin >> L[i];
for(int i=N-1;i>=0;i--) cin >> R[i];
long long ans = 0;
vector<long long> V1(N),V2(N);
for(int i=0;i<N;i++){
V1[i] = max(L[i],R[i]);
V2[i] = min(L[i... | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long N; cin >> N;
vector<long long> V(2 * N);
for (int i = 0; i < 2 * N; i++) cin >> V[i];
multi... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rev_rep(i, a, b) for (int i = a; i >= b; i--)
#define vi vector<int>
#define pb push_back
#define pi pair<int, int>
#define mod = 1e9 + 7
void __print(int x)
{
cerr << x;
}
void __print(... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
int main() {
ll N; cin >> N;
bitset<200001> flag;
ll Ans=0;
REP(i,N){
ll p; cin >> p;
flag.set(p,1);
while(flag.test(Ans)==true){
Ans++;
}
cout << Ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int m, n;
int main() {
cin >> m >> n;
cout << (n % m ? "No" : "Yes");
return 0;
} | #include <bits/stdc++.h>
#include <time.h>
#include <math.h>
using namespace std;
// English Motherfucker, Do you speak it?
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define nl "\n"
#define l long
#define ll long long
#define dou ... |
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> tile(50,vector<int>(50));
vector<vector<int>> pile(50,vector<int>(50));
vector<vector<char>> board(50,vector<char>(50,'-'));
string route;
long long score;
void print(vector<vector<int>> t){
for (int i=0;i<50;i++){
for (int j... | #include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
using namespace std;
template <typename T>
inline void read(T&x){
x=0; char temp=getchar(); bool f=false;
while(!isdigit(temp)){if(temp=='-') f=true; temp=getchar();}
while(isdigit(temp)){x=(x<<1)+(x<<3)+temp-'0'; temp... |
#include<iostream>
#include<stdio.h>
#include<iomanip>
#include<vector>
#include<string>
#include<string.h>
#include<queue>
#include<math.h>
#include<utility>
#include<stack>
#include<unordered_map>
#include<map>
#include<set>
#include<unordered_set>
#include<algorithm>
#include<sstream>
#include<stdlib.h>
#include<bit... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int H, W, N, M;
bool l[1600][1600], f[1600][1600], r[1600][1600];
cin >> H >> W >> N >> M;
for (int h = 0; h < H; ++h){
for (int w = 0; w < W; ++w){
l[h][w] = false;... |
/*
Sunday 16 May 2021 05:35:27 PM IST
@uthor::astrainL3gi0N
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef std::vector<int> vi;
typedef std::pair<int,int> ii;
typedef std::vector<ii> vii;
typedef std::vector<ll> vl;
#define pb push_back
#define mp make_pair
#define debg(x)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
int main()
{
ll n;
cin >> n;
ll m = n;
ll b2 = 1;
ll ans = 1e18+1;
for(int b = 0;b2<=n;b++){
ll a = n/b2;
ll c = n%b2;
ans = min(ans,a... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=4e3+9;
const int MAX=1e2+9;
const double ep=1e-10;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;
const double inf=1e20;
const double pi=acos(-1);
#define debug1 puts("?");
#define debug(x) cout<<"##"<<(x)<<endl;
#define mk make_pair
#def... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Pine1999
*/
#include <bits/stdc++.h>
using namespace std;
template<int mod>
class Modular {
public:
int x;
Modular() : x(0) {}
Modular(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
M... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template<typename A, size_t N, typename T>
void... | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
/*------------------------------------------------------------------*/
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 998244353
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, ai;
cin >> n;
ll s = 0, s2 = 0;
for (int i = 0; i < n; i++) {
cin >> ai;
s += ai;
s2 += ai * ai;
}
cout << n * s2 - s * s << '\n';
}
| // ConsoleApplication1.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
#include<vector>
using namespace std;
using ll = long long;
void solve() {
int N;
cin >> N;
vector<int> A(N);
for (size_t i = 0; i < N; i++)
{
cin >> A[i];
}
int s = 0;
vector<ll> as(N);
ll ans = 0;
for... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstring>
#include <math.h>
using namespace std;
#define int long long
const int N = 200005;
int h, w, m, seg[4 * N];
vector<int> row[N], col[N];
void upd(int idx, ... | #include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <functional>
#include <cmath>
using namespace std;
using pos = pair<size_t, size_t>;
template<typename T, typename F>
class SegTree {
size_t size;
T zero;
F f;
vector<T> elms;
static size_t calcSize(size_t size) {
size... |
#include<bits/stdc++.h>
using namespace std;
#define M 400005
char dr[M];
int a[M],pd[10],ls[M],fc[M],inv[M];
int C(int n,int m){
if(m==0||m==n)return 1;
if(ls[n]!=ls[n-m]+ls[m])return 0;
// cout<<fc[n]<<" "<<inv[m]<<"!!"<<inv[n-m]<<endl;
return 1ll*fc[n]%3*inv[m]%3*inv[n-m]%3;
}
int main(){
// freopen("data.in","r"... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... |
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <bitset>
#include <vector>
#include <algorithm>
#include <string>
#include <random>
#include <unordered_set>
#include <iterator>
// 20210422
// ABC 191以前のを解いていく
using namespace std;
using ll = long long;
void digi()
{
int H, W;
cin >> H ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define ub upper_bound
#define lb lower_bound
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define... |
#include <iostream>
#include <string>
#include <vector>
// true : l winner, false : r winner
bool winnerRPS(char l, char r)
{
return
l == r ||
l == 'R' && r == 'S' ||
l == 'P' && r == 'R' ||
l == 'S' && r == 'P';
}
int main()
{
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
f... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
string now,tmp;
cin>>now;
while(k--)
{
now=now+now;tmp.clear();
for(int i=0;i<now.size();i+=2)
{
if(now[i]=='R'&&now[i+1]=='P')tmp.push_back('P');
else if(now[i... |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
const ld PI = 4*atan((ld)1);
const ll mod = 998244353;
const ... | #include<vector>
#include<iostream>
#include<fstream>
#include<string>
#include<cassert>
#include<algorithm>
#include<random>
#include<map>
#include<set>
#include <bitset>
using namespace std;
//int mod = 998244353;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e+9+7;
int main(){
int n;
cin >> n;
vector<vector<int>> arr(n,vector<int>(5));
for(int i = 0; i < n; i++){
for(i... | // 200c.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
#include <vector>
#include <set>
using namespace std;
void solve() {
int N;
cin >> N;
int m = 5;
vector<vector<int>> A(N, vector<int>(m, 0));
for (auto& l : A)for (auto& op : l) cin >> op;
auto check = [&... |
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
temp... | #include <bits/stdc++.h>
using namespace std;
vector<int64_t> enum_divisors(int64_t N) {
vector<int64_t> res;
for (int64_t i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N/i != i) res.push_back(N/i);
}
}
... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i < (n); i++)
using ll = long long;
using P = pair<int,int>;
int main(){
int a,b,x,y;
int ans;
cin >> a >> b >> x >> y;
int less = x;
if(x > y) less = y;
int trueless = y;
if(2*x < y) trueless = 2*x;
int lastles... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
int total=a+b+c+d;
if(total%2==1){
cout<<"No";
}
else{
total=total/2;
if(a+b==total || a+c==total || a+d==total ||a+b+c==total ||a+b+d==total ||a+c+d==total){
cout<<"Yes";
}
else{
cout<<... |
/*
( _
) /=>
( +____________________/\/\___ / /|
.''._____________'._____ / /|/\
: () : :\ ----\| \ )
'..'______________.'0|----| \
0_0/____/ \
|---- /----\
... | #include <bits/stdc++.h>
using namespace std;
#define fill(a, b) memset(a, b, sizeof(a))
typedef long long ll;
typedef long double lld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<ii> vii;
typedef vector<pll> vll;
typedef ... |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld... | #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 < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.14159265358979
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9+7LL;
int main() {
ll N; cin >> N;
... |
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int main() {
vector<long long> a;
queue<long long> q;
long long n, m = 1;
cin >> n;
for (int i = 1; i <= n; ++i)
m *= 2;
n = m;
for (int i = 0; i < n; ++i) {
cin >> ... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define vec vector
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef LOCAL
// freopen("in1.txt", "r", stdin);
// freopen("in1.txt", "w", stdout);
#endif
int n;
cin >> n;
int m = 1<<n;
vec<... |
/*input
2
4 1
2 4
*/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> in(n*2), out(n*2), c(n*2);
bool ok = true;
rep(i, n) {
int a, b;
cin >> a >> b;
if (a == 2*... | #include <bits/stdc++.h>
using namespace std;
const int maxN=100;
int n;
int arr[2*maxN+1];
int type[2*maxN+1]={0};
int main() {
// your code goes here
int n;
cin>>n;
memset(arr,-1,sizeof(arr));
int a,b;
int rem=0;
for(int i=0;i<n;i++)
{
cin>>a>>b;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
void update(lli index,lli value,lli BIT[],lli n)
{
for(;index<=n;index+=(index&(-index)))
{
BIT[index]^=value;
}
}
lli query(lli index,lli BIT[])
{
lli sum=0;
for(;index>0;index-=(index&(-index)))
{
sum^=BIT[... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#ifdef DEBUG
#define line() cout << "[... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL M;
map<LL, LL> memo;
LL solve(LL N) {
if (N == M) return 0;
if (N-M<M-(N/2)+1) return abs(N-M);
if (memo.count(N)) return memo[N];
if (N < M) return M - N;
LL l2 = (N/2)*2;
LL r2 = ((N+1)/2)*2;
LL res = 1e18;
if (N < r... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<list>
#include<string.h>
#include<math.h>
#include<set>
#include<string>
#include<queue>
#include<map>
#include<unordered_map>
#include<stack>
//#include<unordered_set>
//#pragma GCC optimize (3)
//#define segmenttree true
#ifdef seg... |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
int n;
ld res;
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n - 1; i++)
res += ld(n) / (n - i);
cout << fixed << setprecision(10) << res << endl;
return 0;
}
| #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
/* [💭] [💡] [🎈] */
int main() {
cin.tie(nullptr), cout.tie(nullptr), ios::sync_with_stdio(false);
#ifdef _SHIFTPSH
freopen("_ru... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
std::vector<std::vector<int> > hen;
std::vector<int> dist;
std::vector<int> stack;
std::vector<int> stack_res;
void dfs0(int i, int prev, int goal = -1) {
stack.push_back(i);
if (i == goal) stack_res = stack;
for (auto j : hen[i]) if (j != ... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define FOR(i,f,n) for(int i=f;i<n;i++)
#define FORI(i,f,n) for(int i=f;i>=n;i--)
#define sz(a) ((int)(a).size())
#define ff first
#define ss second
#define all(a) (a).begin(),(a).end()
#define alli(a) (a).rbegin(),(a).rend()
#define approx(a) fixed<<... | #include <iostream>
#include <cassert>
#include <numeric>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
using Graph = vector<vector<int>>;
using ll=long long;
using pa=pair<ll,ll>;
using... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e18;
const ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll x,y,a,b;
cin>>x>>y;
cin>>a>>b;
ll ans=0;
while(x<b)
{
x=x*a;
if(x>=y)
break;
ans++;
}
if(x>=y)
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
double n;
cin>>n;
n=sqrt(8*n+1);
n=(n-1)/2;
int x=n;
if(n>x)
x++;
cout<<x<<endl;
}
| #include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <map>
#include <math.h>
#include <vector>
#include <set>
using namespace std;
int main(){
int n;
cin >> n;
int pb = 1;
int add = 2;
for(int i = 1; i <= n; i++){
if(pb >= n){
cout << i;
break;
}else {
pb = pb + add;
add++;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL INF = 1e18 + 7;
const LL N = 2e5 + 7;
LL x, y, ans;
map<LL, LL> dp;
LL dfs(LL v) {
LL &res = dp[v];
if (res) return res;
if (v <= x) return res = x - v;
res = v - x;
if (v % 2 == 0) {
res = min(res, dfs(v / 2) + ... | #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 <iostream>
#include<algorithm>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
string s, t, r;
cin >> s;
string::size_type i = 0;
for(string::size_type j; (j = s.find('R', i)) != string::npos; i = j + 1) {
t.append(s, i, j - i);
sw... | #include<bits/stdc++.h>
using namespace std;
typedef vector<long long int> vi;
typedef long long ll;
int main(){
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
float n;cin>>n;
if(floor(n*1.08)<206)cout<<"Yay!";
else if(floor(n*1.08... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
string x;
cin >> x;
ll m;
cin >> m;
if (x.size() == 1){
if(stoi(x) <= m) cout << 1 << endl;
else cout << 0 << endl;
... | #include <bits/stdc++.h>
using namespace std;
template <typename T>
bool chmax(T& a, const T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
template <typename T>
bool chmin(T& a, const T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
void solve... |
#include <iostream>
#include"bits/stdc++.h"
using namespace std;
int dx[] ={0,0,1,-1};
int dy[]={1,-1,0,0};
int cost[2001][2001];
char g[2001][2001];
int H,W;
vector<vector<pair<int,int>>>v(26);
bool valid(int x , int y ){
return x<H && y<W && x>=0 && y>=0 && g[x][y] != '#' && cost[x][y] == -1;
}
void bfs(int bx, ... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
int N,M;
ll A[SIZE];
vector<int> G[SIZE];
int main(){
scanf(... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
#define bit(n,k) ((n>>k)&1) //nのk bit目
#define vec(T) vector<T>
#define vvec(T) vector<vector<T>>
using ll = long long;
using ... |
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//typedef tree <int,null_type,less <int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// #include <ext/rope>
// using namespace __gnu_cxx;
typedef long long int ll;
typedef long double... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int h,w,cnt=0;
cin>>h>>w;
char wi[101][101];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>wi[i][j];
}
}
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(wi[i][j]=='.' && wi[i+1][j]=='.')
cnt+... |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <... | #include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll T;
cin >> T;
for (ll testcase = 0; testcase < T... |
//By Whisper_Rain
#include <iostream>
#include <cstdio>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<=(y);i++)
#define per(i,x,y) for(int i=(x);i>=(y);i--)
int n;
signed main(){
scanf("%d",&n);
rep(i,1,n)
{
int link1=(i<<1)%n+1,link2=((i<<1)|1)%n+1;
printf("%d %d\n",link1,link... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();
templ... |
#define LOCAL
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out ... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//#include "atcoder/all"
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
... |
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
// #define MOD 998'244'353
// #define MOD 1'000'000'007
#define INF 100'000'000'000'000'000
using namespace std;
// using namespace atcoder;
typedef long long ll;
int main(){... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using ll = long long;
int mod = 1000000007;
const int INF = 1001001001;
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) a = ... |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vec... | #include <bits/stdc++.h>
using namespace std;
template <typename T>
class SegmentTree
{
std::vector<T> arr;
const std::size_t size;
const std::function<T(const T, const T)> operation;
const T initial_value;
std::size_t calc_size(const std::size_t N) const
{
std::size_t n = 1;
w... |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define ii pair<int,int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll,ll>
#define vv vector
#define al... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
template <typename T>
class Seg_Tree{
public: // 0-index
vector<T> dat;
T initial,M;
int n;
T unite(T a,T b){//
return a + b;
}
void initsize(int n0,T initial_,T M_){
M = M_;
initial = i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
vector<vector<long long>> a(n, vector<long long>(n));
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (long long i = ... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,abm,mmx,avx,avx2")
#pragma GCC optimize("unroll-loops")
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define req(i,a,b) for(int i=(a);i>=(b);--i)
#define rep_(i,a,b) for(int i=(a);i<(b).size();++i)
#define F(a) rep(a,1,n)... |
#include <bits/stdc++.h>
#define ll long long
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define vi vector<int>
#define vvi vector<vector<int> >
#define mii map<int,int>
#define pb push_back
#define pii pair<int,int>
#define mkp make_pair
#define scan(a,n) for(int i =0 ; i<n ; i++) cin>>a[... | // 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(){
string str;
cin>>str;
int arr[26] = {0};
ll n = str.length(), ... |
#include <bits/stdc++.h>
using namespace std;
int n;
set<int> have;
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
have.insert(i);
for (int i = 1; i <= n; i++) {
int nr;
cin >> nr;
have.erase(nr);
cout << *have.begin() << '\n';
}
}
| /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map... |
#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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define N 25
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp ... |
#include<bits/stdc++.h>
#define rep(i, x) for(ll i = 0; i < x; i++)
#define rep2(i, x) for(ll i = 1; i <= x; i++)
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
if (a % b == 0)return b;
return gcd(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
//ma... | #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;
ll po(ll x,ll y){
ll res=1;
for(;y;y>>=1){
if(y&1)r... |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int ri(){
int n;
scanf("%d", &n);
return n;
}
int main(){
int h = ri();
int w = ri();
int x = ri() - 1;
int y = ri() - 1;
string s[h];
for(auto &i : s) cin >> i;
int cnt = -3;
for(int i = x; i < h && s[i][y] != '#';... | /**
* author: Takeda Takumi
* created: 27.03.2021 21:02:59
**/
#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 h, w;
ll find(int x, int y, int map[][101])
{
ll res = 1;
int i, j;
i = x - 1;
j = y... |
#include<bits/stdc++.h>
#include<cstring>
//#define Mfc_Tanzim
#define ll long long
#define ull unsigned long long
#define pb push_back
#define ff first
#define ss second
#define all(v) (v.begin(), v.end())
#define rall(v) (v.rbegin(), v.rend())
#define pi ... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int MOD = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
// #define ALL(obj) (obj).begin(),(obj).end()
struct edge{
ll to, cost;
};
template<class T>
inline b... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mpi map<ll,ll>
#define vl vector<ll>
#define vi vector<int>
#define pl pair<ll,ll>
#define pi pair<int,int>
#define forn(i,n) for(ll i=0;i<n;i++)
#define ff first
#define ss second
#define fast ios::sy... |
// Problem: B - Reversible Cards
// Contest: AtCoder - AtCoder Regular Contest 111
// URL: https://atcoder.jp/contests/arc111/tasks/arc111_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = (m); i < (int)(n); i++)
using ll = long long;
using vl = vector<ll>;
using P = pair<ll, int>;
ll solve(vl& A, map<P, ll>& m, ll x, int i) {
if (i == int(A.size()) - 1) return 1;
... | #include <bits/stdc++.h>
using namespace std;
char grid[15][15];
int numOfV(int x, int y){
if(grid[x][y] != '#') return 0;
int vertexs = 0;
if(grid[x][y-1] != '#' && grid[x+1][y] != '#' && grid[x-1][y] != '#'){ vertexs += 2; /*cout<<"1"<<endl;*/}
if(grid[x][y-1] != '#' && grid[x][y+1] != '#' && grid[x-1][y] != '#'... |
#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
#define M 100005
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define syosu setprecision(10)
#define inf (ll)1e15
int n , m ;
int main(){
cin >> n >> m ;
ll A[n] ;
map... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define re... |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
const int N = 5005;
const int mod = 998244353;
using namespace std;
int n, m, f[N], ans, pw[N];
template < typename T >
inline T read()
{
T x = 0, w = 1; char ... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
//#define MOD 1000000007LL
#define MOD 998244353LL
#define doublecout(a) cout<<setprecision(16)<<a<<endl;
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
usi... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
reverse(s.begin(),s.end());
int s_s=s.size();
for(int i=0;i<s_s;i++){
if(s.at(i)=='6'){
s.at(i)='9';
}else if(s.at(i)=='9'){
s.at(i)='6';
}
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include <numeric>
usin... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.