code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
int main()
{
// input
long long t, N;
cin >> t >> N;
// for (int i = 1; i <= 100; i++)
// {
// cout << i << " " << (100 + t) / 100.0 * i << endl;
// }
cout << (long long)(100.0 / t *... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(n) for(int i=0;i<n;i++)
#define rep(i,j,n) for(int i=j;i<n;i++)
#define pb push_back
#define ppb pop_back()
#define mod 1000000007
#define all(v) v.begin(),v.end()
#define every(a,n) a,a+n
#define mp make_pair
#define F first
#define S sec... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 5e5 + 5;
int main() {
ios :: sync_with_stdio(0), cin.tie(0);
ll s, p;
cin >> s >> p;
for (ll i = 2; i * i <= p; ++i) {
if (p % i == 0) {
if (i + (p / i) == s) {
cout << "Yes";
return 0;
}
}
}
if (p + 1 == s) {
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,w;
cin>>n>>w;
cout<<n/w;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,x;
cin >> n>> x;
vector<char>s(n);
for(int i=0;i<n;i++){
cin >> s.at(i);
}
for(int i=0;i<n;i++){
if(s.at(i)=='o'){
x++;
}
else{
if(x>0)
x--;
}
}
cout<<x;
}
| #include <bits/stdc++.h>
using namespace std;
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); // __VA_ARGS__可変引数マクロ
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void... |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>; // <value, weight>
int main() {
bool box_state[50];
int n, m, q;
cin >> n >> m >> q;
vector<pii> ni;
vector<pii> ni_copy;
for (int i = 0; i < n; i++) {
int w, v;
cin >> w >> v;
ni.push_back(make_pair(v, w));
ni_cop... | #include <bits/stdc++.h>
#include <string>
#define MAX 100007
#define scn1(a) scanf("%d", &a);
#define scn2(a, b) scanf("%d %d", &a, &b);
#define scn3(a, b, c) scanf("%d %d %d", &a, &b, &c);
#define lscn1(a) scanf("%lli", &a);
#define lscn2(a, b) scanf("%lli %lli", &a, &b);
#define lscn3(a, b, c) scanf("%lli %lli %lli"... |
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
using namespace std;
const int mx=1e6+5;
inline int read() {
int x=0,f=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(x<<1)+(x<<3)+c-'0';c=getchar();}
return... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
//rep…「0からn-1まで」の繰り返し
#define rep2(i,s,n) for(long long i=s; i<=(long long)(n);i++)
//rep2…「sからnまで」の繰り返し
#define repr(i,s,n) for(long long i=s;i>=(long long)(n);i--)
//repr…「ｓからnまで」の降順の繰り返し
typedef long long ll;
c... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define ll long long
#define int ll
#define mod 1000000007
#define DEBUG cout<<"Hello1\n";
#define all(v) (v).begin(),(v).end()
#define deb(...) debug(#__VA_ARGS__, __VA_ARGS__);
const int N =... | #define _CRT_SECURE_NO_WARNINGS
#define fast ios::sync_with_stdio(false); cin.tie(0)
#define foru(i, k, n) for (ll i = k; i < n; i++)
#define ford(i, k, n) for (ll i = k; i >= n; i--)
#define pb push_back
#define ff first
#define ss second
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#i... |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define rf(i, a, b) for (ll i = a; i >= b; i--)
typedef std::vector<long long> vi;
#define F first
#define S second
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0)... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef __int128 ll;
string x;
ull m;
bool check(ull mid)
{
ll ans=0;
int flag=1;
for(int i=0;i<x.size();i++)
{
ans=ans*mid+ll(x[i]-'0');
if(ans>m)
{
flag=0;
break;
}
}
return flag;
}
int main()
{
char c='0';
cin>>x>>... |
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<long,long>
#define vi vector<int>
#define vl... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#ifdef LOCAL
#include "/media/brayand/BrayanD/debugger.h"
#else
#define db(...) false
#define dbl(...) false
#define dbg(...) false
#define dbm(...) false
#define dbs(...) false
#define dbas(...) false
#endif
int32_t main()
{
ios_base::sync_wi... |
#include<bits/stdc++.h> // 54 71 "Baklol, Take it easy"
using namespace std;
using ll = long long int;
using ld = long double;
#define rep(x, k, n) for(int x = (k); x <= (n); ++x)
#define rept(x, k, n) for(int x = (k); x < (n); ++x)
#define repr(x, k, n) for(int x = (k); x >= (n); --x)
#define pb ... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
int n;
int a[200000]... |
const bool isDebugMode = true;
int testcase = 1;
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long ... |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#def... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
int x,y;
string A[800];
int score[800]={0};
char dna[20][20];
cin >> N >> M;
for(int i=0; i<M; i++) {
string a;
cin >> a;
bool iscontain=false;
int conv=0;
int convj=0;
fo... | #include <iostream>
#include <cmath>
#include <vector>
int main(void)
{
size_t N, M;
std::cin >> N >> M;
std::vector<int> A(M);
std::vector<int> B(M);
for (size_t i = 0; i < M; i++) {
std::cin >> A[i] >> B[i];
}
size_t K;
std::cin >> K;
std::vector<int> C(K);
std::vector<int> D(K);
for (s... |
#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 mkp make_pair
#define ins insert
#define pqueue... | #include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <fstream>
using namespace std;
#define LL long long
LL a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, n = 0, m = 0, x = 0, y = 0;
string s;
vector<LL> v;
array<array<bool, 100... |
#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 15
int n;
ll k;
ll e[MA... | #include <iostream>
#include <algorithm>
#include <string>
#include <complex>
#include <vector>
#include <set>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <numeric> //lcm
#include <iomanip> //double精度 setprecision
//#include <atcoder/all>
using namespace std;
//using n... |
#include<bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long n , a [200005] , num , did [200005] , f = 1;
set < pair < int , int > > s;
vector < int > v;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//freopen(".in","r",stdin);
//freopen(".o... | #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;
void solve(long long*arr1 , long long*arr2 , long long n)
{
long long sum = 0;
for(int i = 0 ; i < n ; i++)
{
sum+=(arr1[i]*arr2[i]);
}
if(sum==0)
{cout << "Yes" << endl;}
else
{
cout << "No" << endl;
}
return;
}
int32_t main()
{
ios::sync_with_stdio(0);
cin.... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <deque>
#include <bitset>
#include <cassert>
#include <unordered_set>
#inclu... |
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int MOD=1000000007;
long long int fie[28][3][200007]={{{0}}};
int giri[19]={0};
int hen(char a){
if(a<='9')return a-'0';
else return a-'A'+10;
}
int main(){
string N;
cin>>N;
int K;
... | #include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
typedef long long ll;
string num;
int rn[200005];
int k;
int n;
int dp[200005][20];
ll dfs(int x,ll now,bool zero,bool flag)
{
int cnt=0;
for(int i=0;i<16;i++)
{
if(now&(1<<i))cnt++;
}
if(x>=n)return cnt==k;
if(cnt>k)retur... |
#include<bits/stdc++.h>
using namespace std;
int dist[1005][1005];
int A[1005],B[1005];
char C[1005];
vector<pair<int,int> > G[1005];
main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N,M;
cin>>N>>M;
for(int i=0;i<M;i++){
cin>>A[i]>>B[i]>>C[i];
G[A[i]].push_back(make_pair(B[i],C[i]));
G[B[... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<=b;i++)
inline ll rd() {
ll x=0,f=1;
char c=getchar();
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return x*f;
}
#define d rd()
ll a,b,k,aa,bb;
ll yh[65][65];
ll now,ans;
... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) u... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
template<typename T>
long long modpow(const T n,const T p,const T mod);
template<typename T>
long long modinv(const T n,const T mod);
template<typename T>
bool chmax(T &a,const T &b);
template<typename T>
bool chmin(T &a,const T &b);
long long inf=10000... |
#include <bits/stdc++.h>
using namespace std;
//# define M_PI 3.14159265358979323846
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x0, y0, xn, yn;
cin >> n >> x0 >> y0 >> xn >> yn;
pair<double, double> c = {((double)(x0+xn)) /2., ((double)(y0+yn)) /2.};
pair<double, double> v = {... | #include<stdio.h>
#include<math.h>
static inline int IN(void)
{
int x=0,f=1,c=getchar();while(c<48||c>57){if(c==45){f=-f;}c=getchar();}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f*x;
}
int main(void)
{
int N=IN(),p[2][2];p[0][0]=IN(),p[0][1]=IN(),p[1][0]=IN(),p[1][1]=IN();
return !printf("%f %f\n",
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll 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.at(i).at(j);
}
}
vector<int> perm(N - 1);
ll count = 0;
ll time;
for(int i = 0; i < N - 1; i++){
... |
// Username: WillTheBill
// Time of creation: 2020-11-22 13:51
// Original filename: m.cp.cpp
#include<bits/stdc++.h>
using namespace std;
// shortcuts
#define pb push_back
#define fi first
#define se second
#define all(_v) _v.begin(),_v.end()
#define ll long long
// IO
#define multitest signed __T; cin >> __T; whil... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
using P = pair<int,int>;
const char EOLN = '\n';
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define int long long
// DP
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
temp... |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
double PI = 3.141592653589793;
int main()
{
int A, B, X, Y;
cin >> A >> B >> X >> Y;
int N = 200;
vector<vector<pair<int, int>>> list(N);
for (int i = 0; i < 100; i++)
{
list[i].push_back({i + 100, X}), list[i + 10... | /*
Three things which are very important --
Violence - Speed - Momentum
*/
#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 oset tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_updat... |
#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 fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define PSET(x,y) fixed<<setprecision(y)<<x
#define pb push_back
#define pii pair<int,int>
#define... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
bool flag;
for (int i = 0; i < 10000; i++) {
flag = true;
vector<int> m(10);
int x = i;
for (int j = 0; j < 4; j++) {
m[x%10] = 1;
... |
/* by Hyperhydrochloric Acid */
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define loop(i, n) for(int i = 0; i < (n); ++i)
#define cont(i, n) for(int i = 1; i <= (n); ++i)
#define circ(i, a, b) fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
int N;
cin >> N;
ll m = 1e9 + 7;
char a, b, c, d;
cin >> a >> b >> c >> d;
if (b == 'A') {
if (a == 'A') {
cout << 1 << endl;
return 0;
}
if (c == 'B') {
ll ret = 1;
for (int i = 0; i < N - ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define MOD 1000000007
#define MAX 100010
#define aout(a) REP(i,sizeof(a)) cout << a[i] << " "; cout << endl;
#define vout(v) REP(i,v,size()) cout << v[i] << " "; cout << endl;
using namespace std;
usin... | #include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f first
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(a,... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[10][10],num[10];
int main()
{
ll n,k,res=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
for(int i=1;i<=n;i++)
num[i]=i;
do
{
ll last,now,sum=0;
for(int i=1;i<n;i++)
{
last=num[i];
now=num[i+1];
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define length size()
#define int long long
#define ll long long
#include <cstdint>
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
... |
#include<bits/stdc++.h>
#define int long long
#define ld long double
#define fi first
#define se second
#define vll vector<int>
#define pii pair<int,int>
#define pb push_back
#define sz(v) (int)(v).size()
#define inf (int)(1e18)
#define md (int)(1e9+7)
#define all(v) (v).begin(),(v).end()
#define rep(i,a,b) for(int i=a... | #include<bits/stdc++.h>
using namespace std;
const int N=5005,mod=998244353;
int n,m,ans,f[N][2],g[N][2];
inline int add(int a,int b){
a+=b;
return a<mod?a:a-mod;
}
inline int dec(int a,int b){
a-=b;
return a<0?a+mod:a;
}
inline int mul(int a,int b){
return 1LL*a*b%mod;
}
int main(){
scanf("%d%d",&n,&m);
for(int... |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned ll
#define uint unsigned int
#define db double
#define pint pair<int,int>
#define mk make_pair
#define pb push_back
#define eb emplace_back
#define ins insert
#define fi first
#define se second
#define Rep(x,y,z) for(int x=(y);x<=(... | #include <bits/stdc++.h>
using namespace std;
#define rep(type, val, n) for(type val = 0; val < n; ++val)
#define repi(type, val, init, end) for(type val = init; val < end; ++val)
using Int = long long;
using uInt = unsigned long long;
int main() {
uInt n, ans[100005] = { 0 };
cin >> n;
rep (int, i,... |
//Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#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 <tu... | //fake_name
#include<bits/stdc++.h>
using namespace std ;
#define int long long int
#define F first
#define S second
int MOD = 998244353 ;
int mod = 1e9 + 7 ;
int inf = 1e18 ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
signed main()
{
ios_base::sync_with_stdio(false) ;
cin.... |
#include <iostream>
using namespace std;
int main() {
int x,y;
cin >> x >> y;
if(x==y) {
cout << x << endl;
return 0;
}
else{
cout << 3-x-y << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all... |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
void solve() {
int n, m; cin >> n >> m;
int f[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
char c; cin >>... | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf =... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<ll, ll>>;
using ld = double;
#define sz(... | // doot diddly donger cuckerino Hahahahahah
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using vi = vect... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
const int maxn=1e5+5;
ll f[maxn][2],g[maxn];
int main()
{
ll ans=0,x;
int n;
scanf("%d",&n);
ll tot=2*n-3+(n-3)*(n-4)/2;
tot%=mod;
// 0 - 1 +
f[0][1]=1; g[0]=1;
for(int i=1;i<=n;i++)
{
f... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long int
#define umap unordered_map
#define mod 1000000007ll
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MN(a,b,c) min(a,min(b,c))
#define MX(a,b,c... |
// Problem : D - Let's Play Nim
// Contest : AtCoder - AtCoder Regular Contest 105
// URL : https://atcoder.jp/contests/arc105/tasks/arc105_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
int T;
int N;
i... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
map<int, int> mp;
vector<int> v(1 << n, 0);
for (int i = 0; i < 1 << n; i ++ )
{
int x; scanf("%d", &x);
v.push_back(x);
mp[x] = i;
}
for (int i = 0; i < n - 1; i ++ )
{
vector<int> a;
for (int j = 0; j < v.s... |
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#define Rint register int
#define INF 0x3f3f3f3f
using namespace std;
typedef long long lxl;
const int maxn=1e5+5;
template <typename T>
inline void read(T &x)
{
x=0;T f=1;char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) ::std::begin(x), :... |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template<class T> bool chmax(T& a, T b){ if (a < b) { a = b; r... |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FastIO() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define read() freopen("... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type,less<int>, rb_tre... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define MOD 1000000007
#define INF LLONG_MAX
#define MINF LLONG_MIN
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#def... | //#pragma GCC optimize ("Ofast")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define pb push_back
#define all(_obj) _obj.begin(),_obj.end()
#define F first
#define S second
#define INF 1e18
#define pll pair<ll, ll>
... |
/*
author : aryan57
created : 29-May-2021 18:09:38 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_... | //#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define SZ(x) ((int)x.size())
#define uni(x) sort(all(x)),x.resize(unique(all(x))-x.begin());
#define GETPOS(c,x) (lower_bound(all(c),x)-c.begin())
#define lown1(x,val) low(in(x),val)-x
#define lowm1(x,val) low(im(x),val)-x
#define low1(x,nums,val) low(x+1,x+nums+1,val)... |
#include<bits/stdc++.h>
using namespace std;
# define ll long long
# define read read1<ll>()
# define Type template<typename T>
Type T read1(){
T t=0;
char k;
bool vis=0;
do (k=getchar())=='-'&&(vis=1);while('0'>k||k>'9');
while('0'<=k&&k<='9')t=(t<<3)+(t<<1)+(k^'0'),k=getchar();
return vis?-t:t;
}
# define fre(k... | #include <bits/stdc++.h>
using namespace std;
const int N = 101;
int dp[N][N * N * N], cnt[N];
int n, k, mod;
void upd(int & var, int val) {
var += val;
if (var >= mod)
var -= mod;
}
int main() {
scanf("%d %d %d", &n, &k, &mod);
dp[0][0] = 1;
int sum = 0;
for (int x = 1; x <= n; ++x) {
memset(c... |
#include <cstdio>
const int maxn=100+10;
struct E{
int to;
int next;
}ed[maxn*maxn*2];
int head[maxn];
int tot;
void J(int a,int b){
ed[++tot].to=b;
ed[tot].next=head[a];
head[a]=tot;
}
int en;
int vis[maxn];
int ans;
void Dfs(int x){
if(x==en+1){
ans++;
return;
}
if(!head[x]){
Dfs(x+1);
return;
}
for... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int const MAXN = 1 << 21;
int n, m, T;
int p[30], cnt;
int dp[MAXN];
void init() {
for (int i = 2; i < 72; i++) {
int f = 1;
for (int j = 2; j * j <= i; j++) {
if (i % j == 0) {
f = 0;
b... |
# include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define int long long
# define float long double
# define fi first
# define se second
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i,n) for(int i=((int)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main()
{
int n, cnt = 0;
cin >> n;
string t;
cin >> t;
... |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
typedef long long ll;
using namespace std;
ll n;
void solve()
{
cin >> n;
int cnt = 0;
while(n%2==0)
{
n/=2;
cnt++;
}
if(cnt==1) cout << "Same" << endl;
else if(c... | #include <bits/stdc++.h>
using namespace std;
long long n, t;
int main()
{
ios_base::sync_with_stdio(false);
cin>>t;
while (t--)
{
cin>>n;
if (n%2==1) cout<<"Odd"<<"\n";
else if ((n/2)%2==1) cout<<"Same"<<"\n";
else cout<<"Even"<<"\n";
}
} |
#include<iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <cstring>
#include <cassert>
using namespace std;
using LL = long long;
#define FOR(i, x, y) for (decay<decltype(y)>::type i = ... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<cstdint>
#include<cstddef>
#include<vector>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
using usize = uint_fast64_t;
#def... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef unsigned long long ull;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define ep emplace_back
#define EL printf("\n")
#define sz(A) (int) A.size()
#define FOR(i,l,r) for (int i=l;i<=r;i+... |
#include <algorithm>
#include <array>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <string>
#include... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MAXN = 25;
int G[MAXN][MAXN];
int n, m;
int dp[(1 << 18) + 10];
int solve(int x) {
if (dp[x]) return dp[x];
bool flag = 1;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
#define Rep(i,s,n) for(int i = n; i >= (int)(s); i--)
int main() {
int n;
double d, h;
cin >> n >> d >> h;
double mk = h / d;
rep(i, 0, n) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N=150;
int n,D,H,x[N],y[N];
bool ok(double mid){
double slop=(double)(H-mid)/(double)(D-0);
for(int i=0;i<n;i++){
double val=slop*x[i]+mid;
if(val<y[i])return false;
}
return true;
}
int main()
{
#ifndef... |
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef unsigned long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define mem1(a) memset(a,-1,sizeo... |
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define s... |
#include<iostream>
#include<iomanip>
#include<cassert>
#include<math.h>
#include<complex>
#include<algorithm>
#include<utility>
#include<queue>
#include<stack>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
#include<bitset>
using namespace s... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_... |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... | #include <bits/stdc++.h>
#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;
using ll = long long;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, t;
cin >> n >> t;
vector<ll> a(n);
rep(i, n) cin >> a[i];
... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
us... | #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;
//Arr.find_by_order(k-1):kth smallest
//Arr.order_of_key(X):no. of elements less than x
#define int long long
#define ld long double
#define dob double
#define ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define pb push_back
#define mk make_pair
const ll siz = 3e5 + 7;
ll t[4 * siz];
int n, q;
void built(int a[], int tl , int tr, int v) {
if (tl == tr) {
t[v] = a[tl];
... | #include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <functional>
#include <queue>
#include <unordered_set>
#include <climits>
#include <set>
#include <list>
#include <cma... |
#include <bits/stdc++.h>
#define gc() getchar()
using namespace std;
typedef long long ll;
template <typename T> void rd(T &x){
ll f=1;x=0;char c=gc();
for(;!isdigit(c);c=gc())if(c=='-')f=-1;
for(;isdigit(c);c=gc())x=(x<<1)+(x<<3)+(c^48);
x*=f;
}
ll n,q,h[100010],ans;
inline void bsh(ll k){
ll l=0,r=h[n]+k+1,mi... | #include "bits/stdc++.h"
typedef long long int ll;
using namespace std;
int64_t n, q;
void solve() {
cin >> n >> q;
vector<int64_t> a;
for(int i=0;i<n;++i) {
int64_t t; cin >> t;
a.push_back(t);
}
sort(a.begin(), a.end());
for(int i=0;i<q;++i) {
int64_t k; cin >> k;
... |
#include<bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
const int inf = 1e18;
const int max_n = 3010;
const int Mod = 998244353;
int n,k;
int dp[max_n][max_n];
int f(int n,int k){
if(n>k) return 0;
if(k==0){
if(n==0) return 1;
else return 0;
}
if(n==0){
return 0;
}
if(dp[n][k... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll a,b;
cin >> a >> b;
cout << (a+b)/2 << " " << (a-b)/2 << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int N, M, Q;
long long int X[200005], Y[200005];
int op[200005],A[200005], B[200005];
long long int p[200005];
vector<int> V[200005];
map<pair<int, int>, int> MAP;
long long int a[4], b[4];
long long int tmp[4];
void QUERY(int k, int p_val) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using matrix = vector<vector<ll>>;
#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--)
#defi... |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define sz 1600008
#define mod 998244353
#define f first
#define s second
ll arr[sz+10],brr[sz+10];
ll num=1;
char c[sz];
std::vector<ll> v[34];
long long binpow(long long a, long long b,long long mod1) {
a %= mod1;
long long res = 1;
wh... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
typedef long long ll;
const double pi = acos(-1.0);
#define debug puts("*****************")
#define memset(a,b) memset(a,b,sizeof(a))
const int mod = (1 ? 1000000007 : 998244353);
const int inf = (1 ? 0x3f3f3f3f : 0x7fffffff);
const int... |
#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) -= 1)
#define w... | #include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;
const int max_n = 2e5+100;
const int off_set = 1e5+5;
const int max_A = 55;
const int Mod = 1e9+7;
const int inf = 2e18;
int n;
vector<int> adj[max_n];
int... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <typename T>bool chmin(T &a, c... | /*
AtCoder Regular Contest 111 - A - Simple Math 2
https://atcoder.jp/contests/arc111/tasks/arc111_a
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef ve... |
#include <bits/stdc++.h>
using namespace std;
/*
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
*/
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-lo... | #include <bits/stdc++.h>
using namespace std ;
int N, ans=0;
string S, T;
vector<int> a, b;
int main(){
cin >> N >> S >> T;
bool f=true;
int x=-1;
for(int i=0;i<N;i++){
if(S[i]=='0')a.push_back(i);
if(T[i]=='0')b.push_back(i);
}
if(a.size()!=b.size())puts("-1");
else{
for(int i=0;i<a.size();... |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#define Q 400005
using namespace std;
#define gc() getchar()
inline bool ig(char c){return c>='0'&&c<='9';}
inline void read(int &oi){char c;int f=1,rs=0;while(c=gc(),(!ig(c))&&c!='-');c^'-'?rs=(c^48):f=-1;while(c=gc(),ig(c))rs=rs*10+(c^48);oi=rs... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const double eps = 1e-8;
const int NINF = 0xc0c0c0c0;
const int INF = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const ll N = 1e6 + 5;
int main(){
ios::sync_with_stdio(f... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<N;i++)
#define rep2(i,N) for(int i=1;i<=N;i++)
using namespace std;
long long INF=1e18;
long long mod=1e9+7;
//status unsolved
int main(){
long long n;
cin>>n;
long long a[n];
rep(i,n){
cin>>a[i];
}
long long s[n+1];
s[0]=0;
... |
//help others........
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lli long long int
#define pb push_back
#define F first
#define S second
#define pii pair<long long,int>
#define all(a) a.begin(),a.end()
#define read(n,a) for(int i = 0;i<n;i++){cin>>a[i];}
ll ncr(l... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a+b>=15&&b>=8){
cout<<"1\n";
}else if(a+b>=10&&b>=3){
cout<<"2\n";
}else if(a+b>=3){
cout<<"3\n";
}else{
cout<<"4\n";
}
} |
//コンパイラ最適化用
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, int> pii;
typedef pair<ll, ld> pld;
type... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#include<climits>
#include<complex>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A,... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vt vector
#define all(x) x.begin(), x.end()
#define trav(i, x) for(auto &i : x)
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define top front
void solve() {
int n, m; scanf("%d%d", &n, &m);... | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> bool cmin(A& a, B b) { return a > b && (a = b, true); }
template <class A, class B> bool cmax(A& a, B b) { return a < b && (a = b, true); }
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int N, X;
cin >> N >> X;
vector<int> ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) begin(v), end(v)
#define sz(v) v.size()
#define INF 1e18+9
#define EPSILON 1e-14
template <typename T>
bool chmax(T &a, const T& ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int si, sj;
vector<vector<int>> t(50, vector<int>(50,0));
vector<vector<int>> p(50, vector<int>(50,0));
vector<vector<bool>> used(50, vector<... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define _for(i,a,b) for(int i = (a); i < (b); i++)
#define _rep(i,a,b) for(int i = (a); i <= (b); i++)
#define all(v) (v).begin(), (v).end()
int ans1 = 0;
int A, B, H, W;
int vis[20][20];
void dfs1(int x, int y, int a1, int b1) {
if(a1 < 0 o... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
#define DEBUG
#ifdef DEBUG
templ... |
#include <iostream>
namespace wxy{
void main(){
int a,b,x,y;
std::cin >> a >> b;
x = (a + b) / 2;
y = a - x;
std::cout << x << " " << y;
}
}signed main(){wxy::main();return 0;} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>b)return 0; a=b; return 1;}
#define bitUP(x,a) ((x>>a)&1)
int dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0... |
#include <bits/stdc++.h>
#define INF 1e9
#define LINF (1LL << 63 - 1)
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define ALL(a) (a).begin(),(a).end()
// #define chmax(a, b) a = max(a, b)
// #define chmin(a, b) a = min(a, b)
#define pb push_back
#define fi fir... | #include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <random>
#include <stack>
#include <set>
#include <list>
#include <unordered_set>
#define bug(x) cout<<"zdongdebug1: "<<x<<endl;
#define bug... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
const int maxN = 1e6 + 10;
int n;
int a[maxN];
int main()
{
long long v, t, s, d;
cin>>v>>t>>s>>d;
long long l = v*t;
long long r = v*s;
if (d>r || d<l) printf("Yes\n"); else printf("No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b;
cin >> c >> d;
cout << a * d - b * c;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
#define DEBUG_ON
int main(){
ll n;
cin>>n;
vector <ll> a(n);
ll sum=0;
ll ind=0;
ll yoko=0;
ll ind_y=999;
ll yokom=0;
ll MAX;
ll robo=0;
ll hasi=0;
vect... | //Code by @Luckyniu (<Luogu uid>=142548)
#include<bits/stdc++.h>
#define int long long
#define in long double
#define inf 0x3f3f3f3f3f3f
#define ie inline
#define rg register
#define debug fprintf(stderr,"passed [%s] in line %d\n",__FUNCTION__,__LINE__);
using namespace std;
ie int power(int b, int k){
if(k==1) return... |
// Copyright © 2020 Diego Garcia Rodriguez del Campo. All rights reserved.
#include<bits/stdc++.h>
#define MAX 105
#define optimiza_io cin.tie(0); ios_base::sync_with_stdio(0);
#define what_is(x) cerr << #x << " is " << x << endl;
#define pii pair <ll, ll>
#define fi first
#define se second
using namespace std;
typede... | #include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while(!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void deb... |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<tuple>
#include<cstring>
#include<bitset>
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 998244353
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __pri... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main()
{
int n;
cin >> n;
vector<long long> ref(200, 0);
vector<int> arr(n);
rep(i, n) {
cin >> arr[i];
ref[arr[i] % 200]++;
}
long long ans = 0;
rep(i, 200) ans += ref[i]*(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,ans;
int main(){
cin>>n;
for(ll i=1;i*i<=n+n;i++){
ll S=n+n-i*(i-1);
if(S%(i+i)!=0)continue;
ll l=S/(i+i);
if(l<=0)continue;
ans++;
}
ans<<=1;
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<long long> Vll;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
struct UnionFind{
vector<int> par; // par[自分]=親
UnionFind(ll N) :par(N){... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(x) x.begin(),x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main(){
int n;
cin >> n;
vector<int> a(n),b(n),c(n),d(n),e(n);
rep(i,n) ci... | #include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
template <long long mod>
struct modular {
long long value;
modular(long long x = 0LL) {
value = x % mod;
if (value < 0LL) value += mod;
}
modular& operator+=(modular ot... |
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
ll mymin(ll x,ll y) {return x<y?x:y;}
int main()
{
ll n;scanf("%lld",&n);
ll Ans=n;
for(int i=0;i<=62;i++){
ll t=(1ll<<i);
Ans=mymin(Ans,n/t+n%t+i);
}
printf("%lld\n",Ans);
return 0;
} | #ifndef AUTO_UTIL_HEADER_HPP
#define AUTO_UTIL_HEADER_HPP
#include <bits/stdc++.h>
#include <cassert>
using std::cin, std::cout, std::bitset, std::complex;
using std::vector, std::array, std::string, std::pair, std::list, std::queue, std::deque;
using std::priority_queue, std::set, std::map, std::unordered_map;
using... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T>
void view_1d(vector<T> V, string sep) {
for (ll i=0; i<V.size(); i++) {
cout << V[i];
if (i == V.size() - 1) {
cout << endl;
} else {
cout << sep;
}
}
}
template<typ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
A >= 0;
B <= 2 * A + 100;
B <= 1000;
cout << 2 * A + 100 - B << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__);
#else
#define DEBUG(...) 6;
#endif
template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typ... | #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 reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
class Mint {
private:
int val;
public:
Mint () {val = 0;}
Mint(int _val) : val(_val) {}
Mint& operator += (const Mint &o) {val = (val + o.val < mod ? val + o.val : val + o.val - mod); return *this;}
template <typenam... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<pair<int,int>> x;
vector<pair<int,int>> y;
for(int i = 0; i < n; i++){
int xi, yi;
cin >> xi >> yi;
x.push_back(make_pair(xi,i));
y.push_back(make_pair(yi,i));
}
sort(x.begin(),x.en... | #include<iostream>
#include<vector>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<string.h>
#include<math.h>
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define F first
#define S second
#define MAX 500005
#define MOD (ll)(1e9+7)
#define IN... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int get() {
int x = 0, f = 1; char c = getchar();
while(!isdigit(c)) { if(c == '-') f = -1; c = getchar(); }
while(isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); }
return x * f;
}
const int N = 2e5 + 5;
int n, m, q, a[N], b[N], ans, len, bin[N... | #include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b... |
#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>
#define ll long long
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
#define pb push_back
using namespace std;
pair<int,int> fun(int a, int b){
return {min(a,b),max(a,b)};
}
bool comp(pair<pair<ll,ll> ,int > a ,pair<pair<ll,ll> ,int > b ){
ret... |
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll ... | #include <iostream>
#include <cmath>
#include <utility>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
#define mp make_pair
#define x first
#define y second
int main () {
int a,b;
cin>>a>>b;
cout<<(a+b)/2<<" ";
cout<<(a-b)/2;
return 0;
} |
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
using ll = long long;
int h, w, n, m, vis[1510][1510];
struct pos{
int x, y;
};
pos p[500005];
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
void dfs(int x, int y, int k) {
if (x < 0 || y < 0 |... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef map<int, int> mii;
typedef pair<int, int> ii;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3... |
#include <bits/stdc++.h>
using namespace std;
// #define LOCAL // 提出時はコメントアウト
#define DEBUG_
typedef long long ll;
const double EPS = 1e-9;
const ll INF = ((1LL<<62)-(1LL<<31));
typedef vector<ll> vecl;
typedef pair<ll, ll> pairl;
template<typename T> using uset = unordered_set<T>;
template<typename T, typename U> usi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
ll arr[n][3];
for(int i=0;i<n;i++){
cin>>arr[i][0]>>arr[i][1]>>arr[i][2];
}
ll ans=INT_MAX;
for(int i=0;i<n;i++){
ll dif=a... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
void solve() {
}
int main() {
// input
int N;
cin >> N;
vector<int> A(N, 0);
rep(i, N) cin >> A[i];
sort(A.begin(), A.end());
int k = 0;
int ans = 0;
for (int i = 2; i <= A... | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
using namespace std;
typedef long long ll;
ll mod(ll a);
int main(){
int n;
cin >> n;
vector<int> p(n);
vector<int> a(200000,0);
for(int i=0;i<n;++i) cin >> p[i];
int min=0;
for(int i=0;i<n;++i){
a[p[i]]++;
//cout<<"input "<<p[i... |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint2 = modint998244353;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 5e18;
const int inf = 1e9;
const Int mod = 1e9+... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rep3(i, a, b) for(ll i = a; i ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... |
/*
Author : Xinyuan
*/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef long long int ll;
const int INF... | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <algorithm>
#include <climits>
#include <iomanip>
#define endl "\n"
#define debug(x) cout << #x << " : " << x << endl;
#define debug2(x, y) cout << #x << " : " << x << ", " <<... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
typedef pair<pi,ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(int i = a; i < b; i++)
int H, W;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> H >> W;
vector<vector<ll>> a(H, vector<ll>(W));
ll mmin = 101;
for(int i = 0; i < H; i++) ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
const int INF=1<<29;
int h,w;
vector<string> B;
bool vis[2000][2000][2];
int memo[2000][2000][2];
int dfs(int i,int j,int turn){
if(i==h-1 && j==w-1) return 0;
int& res=memo[i][j][turn];
if(vis[i][j][turn]) return res;
vis[... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <climits>
#include <utility>
typedef long long ll;
using namespace std;
int main(void){
int h, w, i, j;
string buff;
vector<vector<int> > field, score;
c... |
// Create your own template by modifying this file!
#include <string>
#include <vector>
#include <climits>
#include <cstring>
#include <map>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cassert>
#i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
vector<long long> dp(N + 1, 1);
for (int i = 1; i <= N; i++) {
if (s[i - 1] == "AND") {
dp[i] = dp[i - 1];
}
... |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
string S;
bool flag = true;
cin >> S;
for(int i = 1; i <= S.length(); i++) {
if(i % 2 == 1) {
if('A' <= S[i - 1] && S[i - 1] <= 'Z') {
cout << "No" << endl;
flag = false;
... | #include <iostream>
int main()
{
int N;
std::cin >> N;
int r = N%100;
if (r) std::cout << N/100 + 1 << std::endl;
else std::cout << N/100 << std::endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define mod 998244353
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
// aのn乗を求める(modp)
int modPow(ll a, ll n, ll p) {
if (n == 0) return 1; // 0乗にも対応する場合
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modPow(a, n - 1,... | #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>
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define repk(i,a,n) for(int i=a;i<=(n);i++)
#define pb push_back
#define ppb pop_back
#define all(k) k.begin(),k.end()
#define eb emplace_back
#define mp make_pair
#define ll long long
#define pl pair<ll,ll>
#d... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define x first
#define y second
typedef pair<int, int> PII;
const int N = 70010;
int n;
PII a[N];
int main()
{
cin >> n;
n = pow(2, n);
for(int i = 1; i <= n; i ++ )
{
cin >> a[i].x;
a[i].y = i;
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin >> n;
long long sum = 0;
long long cnt = 0;
long long i = 0;
while (sum <= n + 1)
{
i++;
sum += i;
cnt++;
}
cnt--;
cout << n - cnt + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll b,c;
ll cnt(ll a){
if(c<a) return 0;
else return (c-a)/2+1;
}
int main(){
cin>>b>>c;
ll ans=0;
if(b==0){
ans=cnt(0)+cnt(3);
}else if(b>0){
ans=cnt(1)+cnt(4);
if(c>=2*b) ans+=2*b;
else ans+=cnt... |
#include <bits/stdc++.h>
#define int long long int
using namespace std;
signed main(){
ios::sync_with_stdio(0);
cin.tie(NULL); cout.tie(NULL);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
map<int , int> mp;
bool ae = true;
for(int i = 1;i<= n;i++){
int z;
... | #include <bits/stdc++.h>
#define vi vector<int>
#define tests int t; cin>>t; while(t--)
#define ll long long
#define vll vector<long long>
#define srt(v) sort(v.begin(), v.end())
#define srtg(v) sort(v.begin(), v.end(), greater<int> ())
#define FOR(k, n) for(int k=0; k<n; k++)
#define pb push_back
#define yes cout<<"Y... |
/*
problem :
algorithm :
created : Programmer_juruo
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 2000005
#define M 2005
#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++)... | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define fo(a,b,c) for(int a=b;a<c;a++)
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int mod = 1e9 + 7;
const int cmod = 998244353;
const... |
#include <iostream>
using namespace std;
int main() {
char a, b, c;
cin>>a>>b>>c;
if (a == b && b==c){
cout<<"Won";
}
else{
cout<<"Lost";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++){
if (S.substr(i, 4) == "ZONe")
ans++;
}
cout << ans << endl;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.