code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n; cin >> n;
vector<P> xy(n);
for (int i = 0; i < n; i++) cin >> xy[i].first >> xy[i].second;
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
... | #include <bits/stdc++.h>
#include <unordered_set>
#include <cmath>
#include <algorithm>
// #include <atcoder/all>
// URL:
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ss second
#define ff first
#define ub upper_bound
#define lb lower_bound
const ll m=1000000007;
#define inf 1000000000000000000
#define infn -1000000000000000000
ll ncr(int n,int r){if(r>n)return 0;if(r > n - r) r = n -... | /*Rabbi Zidni Ilma*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define scl(n) scanf("%lld",&n)
#define scll(n,m) scanf("%lld %lld",&n,&m)
#define pb push_back
#define mp make_pair
#define frs first
#define scn second
#define mod 1000000... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(... | #include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define ll long long int
#define fo(i,a,n) for(ll i=a;i<n;i++)
#define rfo(i,a,n) for(ll i=n-1;i>=a;i--)
#define ... |
//------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
#define int long long
using namespace std;
//type
//------------------------------------------
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define manytests int TT;cin >> TT; while (TT--)
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define FORd(i,a,b) ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vint vector<int>
#define vll vector<ll>
#define vstr vector<string>
#define vvint vector<vector<int> >
#define vvll vector<vector<ll> >
#define vip vector<pair<int,int> >
#define v... |
#define debug(...)
#include <bits/stdc++.h>
using namespace std;
void solve();
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
//cin >> t;
for (int i = 0; i < t; ++i) {
solve();
cout << "\n";
}
cerr << "time taken : " << (float)clock()/CLOCKS_PER_SEC << " sec... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define Rep(i,j,n) for (ll i=(ll)(j);i<=(ll)(n);++i)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.si... |
#include <bits/stdc++.h>
using namespace std;
#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))
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define drep(i, x) for (int i = ((int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
typedef pair<int,int> pp;
bool com(pp x,pp y){
if(x.ff==y.ff) return x.ss<y.ss;
return x.ff<y.ff;
}
ll power(ll x,ll y){
ll prod=1;
while(y){
if(y... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define ff first
#define ss second
#define endl "\n"
#define MOD 100... | #include<bits/stdc++.h>
using namespace std;
typedef long long D;
D n,k,ans;
D f(D x){
return x<2||x>2*n?0:min(n-(x-n)+1,x-1);
}
int main(){
cin>>n>>k;
for(D i=2;i<=n*2;i++)ans+=f(i)*f(i-k);
printf("%lld\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e18;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main(){
double sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
double x1 = (sy*gx+gy*sx)/(gy+sy);
double x2 = (-sy*... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
cout<<fixed<<setprecision(10)<<(double)((x1*y2)+(x2*y1))/(y1+y2);
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 200010, mod = 1e9 + 7;
ll dp[N][20], k, num[N];
char s[N];
ll dfs(int pos, bool limit, bool lead, int cnt, ll state){
if(!pos) return cnt == k;
if(cnt > k) return 0;
if(!limit && !lead && ~dp[pos][cnt]) return dp[pos][cnt];
ll ans =... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define INF LONG_MAX/3
#define DIV 1000000007
//#define DIV 998244353
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const... |
#include <bits/stdc++.h>
// #include <atcoder/all>
#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;
// using namespace atcoder;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}e... | #include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
template<typename T>
bool vector_match(T t, vector<T> vec) {
for (T v : vec) {
if (v == t)return true;
}
return false;
}
vector<char> getUsedChar(string str) {
vector<char> used;
for (char c : str) {
... |
#include<bits/stdc++.h>
#include<vector>
#define ll long long
#define ld long double
#define F first
#define S second
#define MAXN 1000005
#define Tsetso ios_base::sync_with_stdio(0) ; cin.tie(0) ;
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
... | #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;
cin>>n;
vector<vector<ll>> c(n, vector<ll>(n));
vector<ll> a(n, 1LL<<60), b(n);
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
... |
#include<bits/stdc++.h>
typedef long long int lli;
typedef long double lld;
typedef long long ll;
#define int long long
//Fast Input I/O
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL);
//Datatype
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define vvlli vector... | #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 <iostream>
#include <queue>
using namespace std;
using ll = long long;
int n;
priority_queue<ll> q;
void solve()
{
q.push(0);
ll res = 1, before = q.top(), now;
q.pop();
while (q.size() > 0)
{
now = q.top();
q.pop();
if (before > now)
{
res = re... | /*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>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fr first
#define sc second
void solve() {
int N;
cin >> N;
string S, T;
cin >> S >> T;
int ... | #include <iostream>
#include <cstdio>
#define maxn 105
using namespace std;
int n, k;
int f[maxn][maxn];//2^i以j开始
char s[maxn];
int cf[maxn];
int match(int x, int y)
{
if(x < y) swap(x, y);
if(x == 2 && y == 0) return y;
else return x;
}
int main()
{
scanf("%d%d%s", &n, &k, s);
cf[0] = 1;
for (int i = 1; i < max... |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0;i<n;++i)
using namespace std;
typedef long long ll;
int main() {
int n, q;
string s;
cin >> n >> s >> q;
string str[2];
str[0] = s.substr(0, n);
str[1] = s.substr(n, n);
rep(i, q) {
int t, a, b;
cin >> t >> a >> b;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define readlist(a, n) for(int _i=0; _i<(n); _i++) {cin >> (a)[_i];}
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n; cin >> n; string s; cin >> s;
// cout << "s: " << s << endl;
int q; cin >> q;
// cout << "Q" << q << endl;
... |
/*
* author :Sadik Hassan(_sad_)
*
*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define nl "\n"
#define pb push_back
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
const int mod = 998244353;
const int inf = INT_MAX;
int main() {
int a, b; cin >> a >> b;
cout << 2*a+100-b;
system("pause");
return 0;
} |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ll long long
using namespace std;
int main(){
ll n;cin>>n;
vector<ll> vec(n), vecmax, vecall, vecminus;
ll kaka=0, ka=0, choudoii=0;
for(int i=0;i<n;i++){cin>>vec.at(i);kaka=max(vec.at(i), ka... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
long long l, res = 0, cval = 0, mod = 998244353;
vector<long long> v;
cin >> n;
for(int i = 0; i < n; ++i) {
cin >> l;
v.push_back(l);
}
sort(v.begin(), v.end());
for(auto l = v.begin(); l != v.end(); ++l... |
#include <cmath>
#include <vector>
#include <iostream>
#include <algorithm>
#include <set>
#include <iomanip>
#include <queue>
#include <string>
#include <map>
#include <fstream>
#include <cassert>
#include <stack>
#include <climits>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <memory>
#... | #ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, ll>;
#define rep(i, a, b) for(int i = (int)(a); i <= (int)(b); i++)
#define rrep(i, a, b) for(int i =... |
#include <bits/stdc++.h>
using namespace std;
struct FastIO {FastIO() { cin.tie(0); ios::sync_with_stdio(0); }}fastiofastio;
int main()
{
int n, m, t; cin >> n >> m >> t;
int latest = 0;
int a, b;
int now_battery = n;
while (m--)
{
cin >> a >> b;
now_battery -= a - latest;
if (now_battery <= 0)
break ;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (ll i = s; i < e; i++)
#define rrep(i, s, e) for (ll i = s; i > e; i--)
int main() {
ll t;
cin >> t;
rep(i, 0, t) {
ll l, r;
cin >> l >> r;
if (2 * l > r) cout << 0 << endl;
else cout << ((r - 2 * l + 2) ... |
////=====BIsmillahir Rahmanir Rahim =====////
/* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include<bits/stdc++.h>
// #in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int n,m;
int a[N],b[N];
int main(){
int i,j;
cin>>n;
for(i=1;i<=n;i++){
for(j=i;j<=n;j+=i) b[j]++;
}
ll ans=0;
for(i=1;i<=n;i++)
ans+=b[i]*ll(n/i);
cout<<ans;
return 0;
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1000005;
struct node{
int c,id,val;
}s[N];
bool cmp1(node a,node b){return a.val<b.val;}
bool cmp2(node a,node b){return a.id<b.id;}
int st[N],top;
int main(){
int n;
scanf("%d",&n);n<<=1;
for(int i=1;i<=n;i++) scanf("%d",&s[i]... | //#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::s... |
#include<bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main()
{
int ans = INF;
int n;
cin >> n;
for(int i = 0; i < n; i++) {
int a, p, x;
cin >> a >> p >> x;
if(a < x) ans = min(ans, p);
}
if(ans == INF) ans = -1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mem(a) memset(a, 0, sizeof(a))
#define dbg(x) cout << #x << " = " << x << endl
#define fi(i, l, r) for (int i = l; i < r; i++)
#define cd(a) scanf("%d", &a)
typedef long long ll;
int main()
{
int N;
cin >> N;
bool ifCan = false;
int m = 1e9 + 1;
... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
int x=0;
bool flag=1;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
flag=0;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return (flag?x:~(x-1));
... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int cnt[2];
int main() {
scanf("%d %d", &n, &m);
while (n--) {
char s[30], sum = 0; scanf("%s", s);
for (int j = 0; j < m; ++j)
sum ^= s[j] ^ '0';
++cnt[sum];
}
printf("%lld\n", 1ll * cnt[0] * cnt[1]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin(... | #include<bits/stdc++.h>
using namespace std;
const int N=105;
typedef long long ll;
int f[N][N*N*N],sum[N][N],p,lit[N],ans[N];
int main()
{
int n,m;
cin>>n>>m>>p;
for(int i=1;i<=n;i++) lit[i]=lit[i-1]+m*i;
f[0][0]=1;
for(int i=1;i<=n;i++)
for(int j=0;j<=lit[i];j++)
{
sum[i-1][j%i]=(s... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
int n, m = 0; cin >> n;
for(; m < n; m=m*2+1);
rep(i,n){
int t = i*2, u = t+1;
while(t >= n) t -= 1 << (31 - __builtin_clz(t));
while(u >= n) u -= 1 << (31 - __builtin_clz(u));
cout << t+1 << " " << u+1 << "\n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
auto f = [&n](int x) {
return (x - 1) % n + 1;
};
cout << f(i * 2) << " " << f(i * 2 + 1) << endl;
}
} |
#include <bits/stdc++.h>
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
using ll = long long;
int mod = (ll)1e9 + 7;
#define PI ... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
map<string , pair<int , int> > mp;
int n;
cin>>n;
for(int x = 0;x<n;x++){
string s;
cin>>s;
if(s[0] == '!' ){
string a ... |
#include<bits/stdc++.h>
using namespace std;
class graph{
public:
map<int,vector<int>> map1;
void edges(int a,int b){
map1[a].push_back(b);
}
void tour_helper(int n,map<int,bool> &visited,int &count){
visited[n]=true;
for(auto it:map1[n]){
if(visited[it]==false... | #include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
long long N, K;
long long A[1 << 18], B[1 << 18];
bool used[1 << 18];
bool forced[1 << 18];
long long dp[1 << 18];
vector<int> X[1 << ... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define f... |
// In the name of god
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define debug(x) cerr << #x << " :" << x << "\n"
#define use_file freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
using namespace st... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define endl "\n"
void dfs(vector<vector<ll>> &adj , vector<bool> &vis ,ll &edges , ll &root , ll start , ll &nov){
vis[start]=true;
nov++;
if(start==root){
edges += adj[start].size();
}
else{
edges += adj[start].siz... |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
long long A, B;
cin>>A>>B;
vector<int> F;
for (int f=2; f<=72; f++)
{
bool ok = true;
for (int i=2; i<f; i++)
if (f%i==0)
ok = false;
if (ok)
F.push_back(f);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll x,ll y) {
return x==0 ? y : gcd(y%x,x);
}
const int M = 19;
const int BIT = (1<<M);
int cc[BIT],op[BIT],cc2[BIT],dp[BIT];
void solve2() {
ll x,y;
cin>>x>>y;
ll ret = 0;
if(y-x+1<=10) {
ll v[10];
for(ll i=x;i<=y;++i) {
... |
#include <bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define watch(x) cout << (#x) << " is " << (x) << endl
#define f(t) for(ll i=0;i<t;i++)
#define ll long long int
#define ld long double
#define umpl unordered_map<ll,ll... | #include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#define Debug(in) cout<<#in<<"="<<(in)<<endl
#define mm(a,x) memset(a,x,sizeof(a))
#define mkp(a,b) make_pair(a,b)
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define sync std::ios::sync_with_stdi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pi = acos(-1);
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const ull base = 131;
const ull mod1 = 1e9 + 9;
const ull mod2 = 1610612741;
const int maxn = 1e3 + 10;
int a[100][100];
int n, t;
const ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... |
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <numeric>
#include <math.h>
#include <complex>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < (long long int)(n); i++)
#define irep(i, n) for (long long int... | #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;
}
inline void write(int x){if (x > 9) write(x/10); putchar(x%... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using LL = long long;
using LD = long double;
using ordered_set = tree<LL,null_type,less<LL>,rb_tree_tag,tree_order_statistics_node_update>;
void fastio() {
cin.tie... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define scan(a,n) for(long long int index=0;index<n;index++) cin>>a[index];
#define print(a,n) for(long long int index=0;index<n;index++) cout<<a[index]<<" ";cout<<... | /*{{{*/
#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... |
#pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##... | #include <bits/stdc++.h>
using namespace std;
map<int,int>vis;
bool judge(int n)
{
if(n&1) return false;
for(auto it=vis.begin();it!=vis.end();it++)
{
if(it->second&1) return true;
}
return false;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int T;cin>>T;
... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < 2 * n; i++) {
cout << i % n + 1;
if (i % 2 == 0) cout << " ";
else cout << '\n';
}
} |
#include <iostream>
#include <vector>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<deque>
#include<set>
#include<queue>
#include<map>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define req(i,n) for(int i = 1;i<=n;i++)
#define rrep(i,n) for(int i = n-1;i>=0;i--)
#define ALL(a) a.... | #include<bits/stdc++.h>
using namespace std;
const int N = 100005;
double ans;
int n,all,dkfjklasdhfklasdfklasdhfklasdh[15],dksfhjkasdfhasdhflasdhfkl[2][15],dsakfasdjkfhjklasdhf[15]={1};
char s[2][N];
bool Check(int x,int y){
++dksfhjkasdfhasdhflasdhfkl[0][x],++dksfhjkasdfhasdhflasdhfkl[1][y];
int X=0,Y=0;
for(int i... |
#include<bits/stdc++.h>
using namespace std;
int va[] = { 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47 };
int n;
long long x[55], ans = -1;
bool check(long long y) {
for (int i = 0; i < n; i ++) if (__gcd(x[i], y) == 1) return false;
return true;
}
void dfs(int d, long long val) {
// printf("dfs( %2d, %lld )\n"... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
int gcd(ll n, ll m) {
if (m == 0) return n;
else return gcd(m, n % m);
}
int main()
{
int n; cin >> n;
vector<ll> x(n);
for (int i = 0; i < n; ++i) cin >> x[i];
ll ans = INF;
... |
#include<bits/stdc++.h>
using namespace std;
#define reg register
typedef long long ll;
#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
static char buf[100000],*p1=buf,*p2=buf;
inline int read(void){
reg bool f=false;
reg char ch=getchar();
reg int res=0;
while(!isdigit(ch))f|=(c... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... |
#include <bits/stdc++.h>
using namespace std ;
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 MAX_N (ll)2e5
int N ;
ll W ;
int main(){
cin >> N >> W ;
ll pod[MAX_N... | //QwQcOrZ yyds!!!
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include... |
#line 1 "main.cpp"
#include <bits/stdc++.h>
using namespace std;
// template {{{
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)
#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i... | //#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a.size())
#define clr(a, b) memset(a, b, sizeof(a))
#define REP(i, a, b) for(int i=(int)(a); i<(int)(b); ++i)
#define REPD(i, a, b) for(int ... | #include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int... |
#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(; c<'0'||c>'9'; c=getchar())
if(c == '-') f = -f;
for(; '0'<=c&&c<='9'; c=getchar())
a = (a<<3)+(a<<1)+(c^48);
return a*f;
}
int main(){
int a = readint(), b = readint(... | #include <iostream>
main() {
int64_t n;
std::cin >> n;
for(int64_t i = 1; ; i++) {
if(std::stoll(std::to_string(i) + std::to_string(i)) > n) {
std::cout << i - 1;
break;
}
}
} |
#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
int main(){
int H, W;
cin >> H >> W;
vector<string> v(H);
for(int i = 0;i < H;i++)
cin >> v.at(i);
vector<int64_t> H_sum(H, 0);
vector<int64_t> W_sum(W, 0);
vector<int64_t> D_sum(H + W, 0);
int64_t dp[H][W];
for(int i = 0;i ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL),cout.sync_with_stdio(true)
//typedef long long int ll;
typedef unsigned long long int ull;
typedef vect... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define loop(i, start, end) for (int i = start; i <= end; i++)
#define rloop(i, start, end) for (int i = start; i >= end; i--)
#define vi vector<int>
#define vec(x) vector<x>
#define sz(v) (int)v.size()
#define UB upper_bound
#define LB lower_bound
#de... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
const long long INFLL = 1e18;
using ll = long long;
int main(){
int n, k;
cin >> n >> k;
vector<vector<int>> t(n, vector<int>(n));
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
cin >> t[i][j];
... |
#include<bits/stdc++.h>
using namespace std;
const int N=2007;
int a[N],b[N];
int main()
{
int A,B,C; scanf("%d%d",&A,&B);
C=max(A,B);
for(int i=1;i<=C;i++)a[i]=i,b[i]=-i;
for(int i=C;i>=A+1;i--)a[i-1]+=a[i];
for(int i=C;i>=B+1;i--)b[i-1]+=b[i];
for(int i=1;i<=A;i++)printf("%d ",a[i]);
for(int i=1;i<=B;i++)print... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<pair<int,int>> vpi;
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define pb push_back
#define mp make_pair... |
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
#include<map>
using namespace std;
#define int long long int
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#de... | /**
* Author: Daniel
* Created Time: 2021-04-03 10:23:06
**/
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ER erase
#define IS insert
#define PI acos(-1)
#define PB pop_back
#define MP make_pair
#define MT make_tuple
#define LB lower_bound
#define UB upper_bound
#define EB... |
#ifdef _LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
static const ld PI = 3.141592653589793;
pair<ld, ld> solve(int n, ld x, ld y, ld x2, ld y2) {
ld xm = (x + x2) / (ld)2, ym = (y + y2) / (ld)2;
ld vec_x = x - xm, vec_y = y - ... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <sta... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
const int MAXIOSIZE = 1 << 24 | 1;
unsigned char buf[MAXIOSIZE], *p1, *p2;
// #define gc (p1 == p2 && (p2 = (p1 =... | #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
int N, M;
int D[2010];
vector<pii> V[2010];
int unit(int s)
{
int ret = 1e18;
memset(D, -1, sizeof(D));
priority_queue<pii, vector<pii>, greater<pii>> que;
que.push({0, s... | //Inshallah , Boys played well..!!
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pb push_back
#define pf push_front
#define mk make_pair
#define f(i,j,n) for(ll i=j;i<n;i++)
#define r(i,n,j) for(ll i=n-1;i>=j;i--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NUL... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define mset(a,b) memset(a, b, sizeof(a))
#define dbg(x) cout << "[" << #x << "]: " << x << endl;
#define forn(i,n) for(int i=0; i < n;i++)
#define forab(i,a,b) for(int i = ... | //
// Created by mihai145 on 23.02.2021.
//
#include <iostream>
#include <vector>
#include <string>
using namespace std;
const int NMAX = 1000;
int N, M;
vector<int> g[2 * NMAX + 5];
bool vis[2 * NMAX + 5];
void dfs(int node) {
vis[node] = true;
for(auto it : g[node]) {
if(!vis[it]) {
... |
#include <bits/stdc++.h>
using namespace std;
int char2int(char c) {
assert(c >= '0' && c <= '9');
return c - '0';
}
int getscore(int a[]) {
int ans = 0;
for (int i = 1; i < 10; i++) {
ans += i * pow(10, count(a, a + 5, i));
}
return ans;
}
int main() {
int k;
cin >> k;
st... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int64_t i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int64_t i=(a),_b=(b);i>=_b;--i)
using... |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
i... | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
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... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
#define F first
#define S second
#define MOD 1e9+7
const int inf = 1e9;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, c;
cin >> a >> b >> ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<functional>
#include<set>
using namespace std;
typedef long long ll;
int N;
string S, X;
int dp[200000 + 100][7];//dp[i][j] := 1-idxでi桁目まで作ったときに、余りがjの時のgrundy数
//0なら高橋の勝ち
int memo(int digit, int mod) {... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define Rep(i,j,n) for(int i = j; i < (int)(n); i++)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
int n;
cin >> n;
map<i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a.begin(),a.end())
#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 ret return
//cout << fixed << setprecision(15)
//ASCIIコード 0==48 A==65 Z==90, a==97 z==122
int mai... |
//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... | /* thisiscaau's code
What’s happened happened. Which is an expression of faith
in the mechanics of the world. It’s not an excuse to do nothing.
*/
/* shortcuts */
/*#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")*/
// for emergency cases
#include<bits/stdc+... |
#include<bits/stdc++.h>
using namespace std;
int m,h;
int main(){
cin>>m>>h;
if(h%m==0)cout<<"Yes";
else cout<<"No";
} | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x)... |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <fstream>
#include <iomanip>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Output
template<class T, class S>... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i,n) for(LL i=0;i<(n);i++)
int main()
{
LL a, b, c;
string output = "No";
cin >> a >> b >> c;
a *=a;
b *= b;
c *= c;
if(a+b < c)
output = "Yes";
cout << output << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define FOR(i, a, b) for(ll i=(a); i < (ll)(b); ++i)
template<class T> inline bool chmax(T& a, T b) { if(a < b){ a=b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if(a > b){ a=... | #include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
int x,y,z;
cin>>x>>y>>z;
for(int i=1000000;i>=0;i--){
if(i*x < y*z){
cout<<i;
return;
}
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typenam... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
int n, m;
cin >> n >> m;
vector<pair<in... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e6+7;
const int inf=2e9;
const ll inff=1e18;
const ll mod=1e9+7;
#define pii pair<int,int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end(... | #include <bits/stdc++.h>
#define fi first
#define se second
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define V vector
#define TP template <class o>
#define TPP... |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,n) for(ll i=a;i<n;i++)
#define ll long long
#define PB push_back
#define vi vector<int>
#define vl vector<ll>
#define pi pair<int,int>
#define vp vector<pi>
#define modulo (1e9+7)
int power(long long x, ll y, ll p) // modular exponentiation
{
ll res ... | #include <iostream>
#include <iomanip>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
// std::fixed -> 固定小数点で出力することを指定
// std::setprecision(int n) -> 小数点以下 n 桁で出力することを指定
cout << scientific << setprecision(7);
cout << A * B / 100.0 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define ZERO(c) memset(c, 0, sizeof(c))
using ll = long long;
// using P = pair<int,int>;
const int INF = 1e9 + 5;
const ll INFL = 1e18 + 5;
int A[... | // #include <bits/stdc++.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n;
cin>>n;
ll sum=0;
while(n--)
{
ll x,y;
cin>>x>>y;
sum+=(y*(y+1)/2)-(x*(x-1)/2);
}
cout<<sum;
} | #include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
ll C;
cin >> N >> C;
vector<int> a(N), b(N), c(N);
set<int> s;
map<int, vector<int>> starts, ends;
for (int i = 0; i < N; ++i) {
cin >> a[i] >> b[i] >> c[i];
// We ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define M 1000000000
int main()
{
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
int n;
cin>>n;
strin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >>s ;
int ans=0;
for (int i=0;i<n;i++){
int f=0,se=0;
for (int j=i;j<n;j++){
if (s... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=105;
bool vis[N][N][N];
long double dp[N][N][N];
long double func(ll a,ll b,ll c){
if(a==100 || b==100 || c==100)return 0;
if(vis[a][b][c])return dp[a][b][c];
vis[a][b][c]=1;
dp[a][b][c]+=((func(a+1,b,c)+1)*a*1.0)/(a+b+c+0.0)... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define pb push_back
typedef long double ld;
#define fi first
#define se second
#define PI 3.14159265358979323846264338327950288419716939937510
#define mp make_pair
#define vvl vector<vector<ll>>
#define vll vector<ll>
#def... | #include <bits/stdc++.h>
#include <fstream>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF=2147483647;
// 9,223,372,036,854,775,807
const ll INFL = 9223372036854775807;
int main(){
// 入力ファイル使うとき
ll ans;
ll n,m,t;
ci... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int arr[n] , brr[n];
for(int i=0 ; i<n ; i++)
{
cin >> arr[i];
cin >> brr[i];
}
int count=0;
for(int i=0 ; i<n-1 ; i++)
{
int x=arr[i] , y=brr[i];
for(int j=i+1 ; j<n ; j++)
... | #pragma GCC optimize("O3")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define re return
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define make_unique(x) sort(all(x)),x.resize(unique(all(x))-x.begin())
#define fi first
#define se second
#define ss second.second
#define sf ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if (a==c&&b==d){
cout<<0;
return 0;
}
if (a+b==c+d){
cout<<1;
return 0;
}
if (a-b==c-d){
cout<<1;
return 0;
}
if (abs(a-c)+abs(b-d)<=3){
cout... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define rep(i, n) FOR(i,0,n)
#define irep(i, n) IFOR(i,0,n)
#define all(v) begin(v), end(v)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define len(x) int((x).size())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define randint(n) uniform_int_distribution<int>(1, (n))(rng)
int main()... | #include<bits/stdc++.h>
using namespace std;
namespace IO
{
const int buffer_size=1e5+5;
char buf[buffer_size],*S,*T;
bool flag_EOF;
inline char read_char()
{
if(S==T)
T=(S=buf)+fread(buf,1,buffer_size,stdin);
return S!=T?*(S++):EOF;
}
inline int read_int()
{
int flag=1;
char c=read_char(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vint> vvint;
typedef vector<bool> vbool;
typedef vector<vbool> vvbool;
typedef pair<ll, ll> iPair;
#define ff first
#define ss second
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, x;
cin >> n >> x;
rep(i,n){
char s;
cin >> s;
if(s=='o'){
x++;
}
else if(s=='x' && x>0){
x--;
}
}
cout << x << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cn = min(n, 8);
vector<long long> a(cn);
for (int i = 0; i < cn; i++) {
cin >> a.at(i);
}
int tmp_1 = 0, tmp_2;
vector<int> r(200, 0);
for (int tmp = 1; tmp < (1 << cn); tmp++) {
long long sum = 0;
for (int... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
vector<string> dfs(int n){
if(n==1) return {"AB"};
vector<string> res;
for(string s:dfs(n-1)){
string t1,t2;
for(char c:s){
if(c=='A') t1+="AA", t2+="AB";
else t1+="BB", t2+="BA";
}
res.emplace_back(t1);
r... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | //Work should be challenging and challange should be fun
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i,n)... |
#include<bits/stdc++.h>
using namespace std;
#define sc(x) scanf("%d",&x)
#define scll(x) scanf("%lld",&x)
#define pb push_back
#define mp make_pair
#define nl endl
#define all(v) v.begin(), v.end()
#define show(v) for(int x:v) cout<<x<<" "
#define input(v) for(auto &x:v) cin>>x;
#define send return
... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define int long long
#define fi(i,n) for(int i=0;i<n;i++)
#define f(i, a, b) for(int i=a;i<b;i++)
#define vi vector<int>
#define pb push_back
#define MOD 1000000007
#define pii pair<int, int>
#define ff first
#d... |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int si,sj,score[50][50],id[50][50];
bool ok_id[2500];
cin >> si >> sj;
for(int i=0;i<50;i++)
{
for(int j=0;j<50;j++)
{
cin >> id[i][j];
ok_id[i*50+j]=true;
}
}
for(int i=0;... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>
using namespace std ;
void ABC203_C(){
long long int N,K;
cin >> N >> K;
// 単純に記憶するだけではだめ。
// vector<int> fri... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<vector<pair<int, int>>> E(N);
for (int i = 0; i < M; i++){
int A, B, C;
cin >> A >> B >> C;
A--;
B--;
E[A].push_back(make_pair(C, B));
}
for (int i = 0; i < N; i++){
vector<int> d(N, -1);
pr... | #include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
ll C;
cin >> N >> C;
vector<int> a(N), b(N), c(N);
set<int> s;
map<int, ll> changes;
for (int i = 0; i < N; ++i) {
cin >> a[i] >> b[i] >> c[i];
// We only need a[i] an... |
#include <bits/stdc++.h>
#define ll long long
#define all(v) v.begin(),v.end()
#define sz(s) s.size()
#define PI acos(-1)
using namespace std;
void fast()
{
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main()
{
fast();
int n; cin >> n;
cout << n - 1 << endl;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n<=1)
cout<<"0";
else
cout<<n-1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
if(N%2==0) cout << "White" << endl;
else cout << "Black" << endl;
} | #include <iostream>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin>>n;
if(n%2==0){
cout<<"White"<<endl;
}
else{
cout<<"Black"<<endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl "\n"
#define mod 1000000007
//const ld PI = 3.141592653589793;
bool isPrime(int n)
{
// Corner cases
if(n<=3){
return true;
}
if... | #include <bits/stdc++.h>
#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)
using namespace std;
using ll = long long;
using vll = vector<... |
#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 X first
#define Y second
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define mp make... |
#include<iostream>
#include<bits/stdc++.h>
#include<cmath>
#include<vector>
#include<iterator>
#include<set>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<list>
#include<algorithm>
#include<sstream>
#define PI acos(-1)
typedef long long ll;
#define V(dt) vector<dt>
#define S(dt) set<dt>
#defin... |
//#define DEBUG
//#define OPTIMIZE
//#define INTERACTIVE
#include <bits/stdc++.h>
using namespace std;
#include <bits/extc++.h>
using namespace __gnu_pbds;
const int MAXN = 100;
const int INF = 0x3f3f3f3f, MOD = 1000000007;
const long long LINF = LONG_LONG_MAX;
#define INIT(arr, val) fill(arr, arr+(int)(sizeof(arr)/... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#... | #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... |
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#includ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
ll inf = 1ll << 60;
int main(){
ll n;
cin >> n;
ll ans = inf;
for (int i = 0; i < 61; i++){
ll p = 1ll << i;
ll a = n / p, b = n % p;
ans = min(ans, a + b + i);
}
... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<... | #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
int main(){
long long A,B,C,D;
cin>>A>>B>>C>>D;
long long sum=A+B+C+D;
if(A==sum-A||B==sum-B||C==sum-C||D==sum-D||A+B==C+D||A+C==B+D||A+D==B+C){
cout<<"Yes"<<endl;
}
else cout<<"No"<<endl;
return 0;... |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <set>
#include <time.h>
#include <sstream>
#include <queue>
using namespace std;
using ll=long long;
void print(int *some_list,int many){
cout << "[";
for (int i=0;i<many;i++){
cout << some_list[i] << ", ";
... | #include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fr(i,a,n) for(i=a;i<n;i... |
#include <iostream>
using namespace std;
int main()
{
float N;
cin >> N;
if ((int)(N * 1.08) < 206)
cout << "Yay!";
else if ((int)(N * 1.08) == 206)
cout << "so-so";
else
cout << ":(";
} | /*
* @author: 0x404
* @Date: 2021-02-20 19:56:33
* @LastEditTime: 2021-02-20 20:02:58
* @Description:
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
int x;
int main(){
cin >> x;
if(x % 100 == 0) cout << 100 << endl;
else {
for(int i = ... |
#include<bits/stdc++.h>
#define M 1005
typedef long long ll;
using namespace std;
int stp[M][M][27];
int n,m;
vector<int> E[M][26];
struct node{int x,y,c;};
queue<node> Q;
int BFS(){
int x,y,c;
while(!Q.empty()){
x=Q.front().x;
y=Q.front().y;
c=Q.front().c;
if((c==26)&&((x==1&&y==n)||(x==n&&y==1)))return stp[... | //
// Created by yamunaku on 2021/03/27.
//
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) f... |
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
using LL = uint64_t;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N,M;
cin >> N;
long long n3 = 1;
long long n5;
for (int i=1; i<100; i++) {
n3 *= 3ll;
M = N-n3;
n5 = 1;
if (M <= 1) {
cout << -1 << endl;
return 0;
}
for (int j=1; j<100; j++) {
n5 *= 5;
... |
#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
int main() {
long long N;
cin>>N;
long long A[N];
long long B[N];
for(int i=0;i<N;i++){
cin>>A[i];
}
for(int i=0;i<N;i++){
cin>>B[i];
}
long long AB[N];
for(int i=0;i<... | #include<bits/stdc++.h>
using namespace std;
template<typename T>inline T read(){
T x=0,f=0;char c=getchar();
while(!isdigit(c)) f=c=='-',c=getchar();
while(isdigit(c)) x=x*10+c-48,c=getchar();
return f?-x:x;
}
#define int long long
namespace run{
const int N=1e5+9;
int n,a[N],b[N],ans;
priority_queue<int> pq[2]... |
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n; long long C;
cin >> n >> C;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) cin >> a[i] >> b[i] >> c[i];
map<int, vector<int>> mp;
for (int i = 0; i < n; i++) {
mp[a[i]].push_back(c[i... |
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
//vector string deque break continue
#define forn(i, s, f) for (int i = (int)s; i < (int)f; i++)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define fs first
#define sc second
#defi... | //
#include <bits/stdc++.h>
#include <math.h>
#include <algorithm>
using namespace std;
int main()
{
int A, B, C, ans = 0;
cin >> A >> B >> C;
if(A > B)
{
if(B > C)
{
ans += B + A;
}
else
{
ans += C + A;
}
}
else
{
... |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using PP = pair<int, P>;
const int N = 30;
int T = 0;
int cost[N][N][N][N];
int updated_time[N][N][N][N];
int updates[N][N][N][N];
int visited[N][N][N][N];
char dir(int dx, int dy) {
if (dx == 0) {
if (dy > 0) return 'R';
else... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vz;
typedef vector<vz> vvz;
typedef pair<ll, ll> pll;
#define sz(x) ll((x).size())
#define fo(i,n) for(ll i=0; i<(n); i++)
#define FO(i,a,b) for(ll i=(a); i!=(b); i+=(b)>(a)?1:-1)
#define pb push_back
#defin... |
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <arr... | #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;
using namespace chrono;
typedef int64_t ll;
typedef long double ld;
typedef unsigned long long ULL;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
void read(vector<int> &a) {for (auto &x : a)cin >> x;}
void read... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define f... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
long long p=998244353;
long long BinaryExpo(long long a,long long b)
{
a=a%p;
long long res=1;
while(b>0)
{
if(b&1) res=(res*a)%p;
b=b>>1;
a=(a*a)%p;
}
return res;
}
int main()
{
ios::sync_with_stdio(false... |
#include<bits/stdc++.h>
#define For(i,l,r) for(int i=(l);i<=(r);i++)
#define ReFor(i,r,l) for(int i=(r);i>=(l);i--)
const int MAXN=1010;
using namespace std;
int n,ans;
struct llz
{
int x,y;
}a[MAXN];
inline int read()
{
int f=1,x=0;
char ch=getchar();
while(ch<'0' || ch>'9')
{
if(ch=='-')
f=-1;
ch=getchar(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define yes cout <<"YES"<<endl
#define no cout <<"NO"<<endl
#define sortv(a) sort(a.begin(), a.end())
typedef vector <long long> vi;
typedef string str;
typedef vector <pair<long long, long long>> vip;
typedef pair <int, int> pi;
... |
#include<iostream>
#include<iomanip>
#include<bitset>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
#include<set>
using namespace std;
using ll=long long;
int main(){
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if(r1 == r2 && c1 ==... | #include <bits/stdc++.h>
#define fi first
#define se second
#define o2(x) (x) * (x)
#define mk make_pair
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset((a), (b), sizeof((a)))
#define rep(i, s, t) for(register int i = (s), LIM=(t); i < LIM; ++i)
#de... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "YES" : "NO")
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
const int siz = 1e2 + 10;
const int SIZ = 1e6 + 10;
con... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define F first
#define S second
#define PB push_back
#define forn(i,a,b) for(i=a;i<=b;i++)
#define nfor(i,a,b) for(i=a;i>=b;i--)
#define all(x) x... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.