code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define INF 0x3f3f3f3f
#define pi M_PI
typedef pair<ll, ll> llPair;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef priority_queue<ll> pqll;
ll MOD = 1000000007;
/*
Really doe, like really doe
Reall... | // time-limit: 2000
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e9 + 7;
void solve(){
int n;
cin >> n;
vector<int> xi(n+1), yi(n+1);
for(int i=1; i<=n; i++){
cin >> xi[i] >> yi[i];
}
int m;
cin >> m;
typedef array<int, 3> arr;
// 0:x... |
#include<bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef long double f128;
using namespace std;
template<typename T>
void scan(T& n){
cin>>n;
}
template<typename T,typename U>
void scan(pair<T,U>& p){
cin>>p.first>>p.second;
}
void scan(){}
template<typename T,class... Args>
void scan(T& n,Arg... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define pll pair <long long,long long>
#define ss second
#define ff first
#define inf (ll)1e18
#define mod 1000000007
#define ld long double
#define fast ios_base::sync_with_stdio(false);cin.tie(NUL... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N;
cin >> N;
vector<ll> P(N);
for ( int i = 1; i < N; i++ ) {
cin >> P[i];
P[i]--;
}
P[0] = -1;
vector<vector<int>> G(N); // ch
for ( int i = 1; i < N; i++ ) {
G[P[i]].push_back(i... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> vec(n);
for (int i = 0; i < n; ++i) {
if (i == 0) {
cin >> vec[i];
}
else {
ll tmp;
cin >> tmp;
vec[i] = vec[i-1] + tmp;
}
}
ll cur = 0;
ll a... |
// E - White Pawn
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M; cin>>N>>M;
int C = min(N, M), L = C*2 + 1;
auto ixOk = [&](int y){ return 0 <= y && y < L; };
vector<pair<int,int>> D;
while(M--){
int x, y; cin>>x>>y;
y -= N - C;
if(ixOk(y)) D.emplace_back(x, y);
}
sort(D.begin(), D.... | #include <bits/stdc++.h>
#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 2e5+5;
int bit[N], row[N], col[N];
vector<int> tt[N];
void update(int pos, int val){
while(pos < N){
bit[pos] += val;
pos += pos&-pos;
}
}
int query(int pos)... |
#include <bits/stdc++.h>
#define spd ios::sync_with_stdio(false),cin.tie(0)
using namespace std;
using ll = long long;
#define N 1000005
#define MAX 1e18
vector<ll> powers;
set<ll> squares;
set<ll> s;
void powersPrecomputation()
{
for (ll i = 2; i < N; i++) {
squares.insert(i * i);
if (squares.fi... | #include <bits/stdc++.h>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define RREP_(i, a_, b_, a, b, ...) for (Int i = Int(b) - 1, low##i = (a); i >= low##i; i--)
#def... |
#include<iostream>
#include<vector>
using namespace std;
const int BUF = 100005;
const int BIT = 25;
int N, M;
int val[BUF];
void read() {
cin >> N >> M;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
val[i] = 0;
for (int j = 0; j < M; ++j) {
val[i] <<= 1;
... | #include<bits/stdc++.h>
#define FOR(i,s,t) for(int i=s;i<=t;++i)
#define REP(i,t,s) for(int i=t;i>=s;--i)
#define RESET(a) memset(a,0,sizeof a)
using namespace std;
typedef long long ll;
const ll M=3e10;
char s[200005];
int n,vi[3];
int main() {
scanf("%d%s",&n,s);
FOR(i,0,n-1) {
s[i]-='0';
if((s[i]==0)^(i%3==0))... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
template<class T> using V = vector<T>;
template<typename T> using posteriority_queue = priority_queue<T,vector<T>,greater<T>>;
#define rep(i,n) for (int i = 0; i < (int)(n) ; i++)
#define rep2(i,a,b) for... | #include<bits/stdc++.h>
using namespace std;
vector<int>f(200009),sz(200009,0);
inline int getf(int x) {
if(x!=f[x]) return f[x]=getf(f[x]);
else return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
long long ans=0;
cin>>n;
vector<int>a(n);
for(int i=1;i<=200008;i++) f[i]=i;
for(int i... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fo(i,s,e) for( i=s;i<e;i++)
#define rfo(i,s,e) for(i=s;i>e;i--)
#define ll long long int
#define pb push_back
#define pob pop_back()
#define sp " "
#define ff first
#define ss second
const ll MOD=1e9+7;
const ll INF = (1LL << 60) - 1;
ll power(l... | //#include<cstdio>
//#include<cassert>
//#include<iostream>
//#include<cstring>
//#include<algorithm>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define MAX ((int)2e9 + 5)
#define MAXP ((int)1e5 + 5)
#define MAXL ((ll)1e18 + 5)
#define MAX_X ((int)2001)
#define M... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-12;
static const double PI = acos(-1.0);
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// allマクロの定義
#define all(v) v.begin(), v.end()
using ll = long long;
int main() {
ll N;
cin >> N;
if (1 <= N && N < pow(10, 3))
{
cout << 0 << endl;
return 0;
}else if (pow(10, 3) <= N && N < pow(10,... |
#include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
using ll = long long;
using P = pair<int,int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline bool chmax(T& a, T b) { if (a < b... | #include <bits/stdc++.h>
using namespace std ;
const int MAX = 18 ;
int mark[MAX][MAX] ;
int n , m ;
int can[1 << MAX] , dp[1 << MAX] ;
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n>>m ;
for(int i = 0 ; i < m ; ++i)
{
int a , b ;
cin>>a>>b ;
a-- , b-- ;
mark[a][b] = mark[b][a] = 1 ;
... |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int N;
int A[2020];
bool ok(int X)
{
int g=0;
for(int i=0;i<N;i++)
{
int t=gcd(g,A[i]);
if(t%X==0)g=t;
}
return g==X;
}
main()
{
cin>>N;
vector<pair<int,int> >X;
int mA=1e9;
for(int i=0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n);
for (auto &it: a) cin >> it;
vector<ll> pre(n+1);
ll pre_mx = 0, an = 0, pos = 0;
for (int i = 0; i < n; ++i) {
pre[i+... |
#include<iostream>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<deque>
#include <algorithm>
using namespace std;
#define mem(a,b) memset(a,b,sizeof a)
#define PII pair<int,int>
#define ll long long
#define ull unsigned long long
#define ft fir... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
#define FOR(i, a, b) for (int i =... |
#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;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define F first
#define S second
#define pss pair<string,string>
#define pcc pair<char,char>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define piii pair<int,pii>
#define vi vector<int>
#define vii vector<pii>
#define pb push_back
#defin... | #include <iostream>
#include <cstring>
using namespace std;
using ll = long long;
const int N = 200005, P = 1e9 + 7;
char s[N];
int n, k;
ll f[N][17];
int to_num(char c)
{
if ('0' <= c && c <= '9')
return c ^ '0';
return 10 + c - 'A';
}
void init()
{
f[0][k] = 1;
for (int i = 1; i < n; ++i)
... |
//abc185_a.cpp
//Thu Dec 17 12:35:08 2020
#include <bits/stdc++.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
int a[4];
rep(i,4) cin >> a[i];
int ans = a[... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<array>
#include<fstream>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_se... |
# include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <pii, int> ppi;
typedef ... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <fstream>
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vect... |
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <memory.h>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <iostream>
#include <functional>
#include <complex>
#include <stdlib.h>
#include <fstream>
#include <random>
using na... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;i++)
#define REPA(i,j) for(int i=1;i<=j;i++)
#define FORN(i,j,k) for(int i=j;i<k;i++)
#define vi vector<int>
#define vvi vector<vi >
#define p... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
cout<<max((a+b),max((b+c),(c+a)));
return 0;
} | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
double sx,sy,gx,gy,i,j;
double ans = 0.0;
std::cin >> sx>>sy>>gx>>gy;
ans = ((gx-sx)*sy)/(gy+sy);
ans += sx;
cout << fixed << setprecision(12) << ans <<endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cc... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0; i<ll(n); i++)
#define FOR(i,m,n) for(ll i=ll(m); i<ll(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
#define MOD 1000000007
//#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... | //c
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#in... |
#include <bits/stdc++.h>
#define DeltaCube23 ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define minimum(a) *min_element(a.begin(), a.end())
#define maximum(a) *max_element(a.begin(), a.end())
#define MOD 998244353
#define forf(i,a,b) for(int i = (a); i < ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
const int mod = 1000000007;
const int N = 2e5 + 7;
int vis[N] = {0};
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--)
{
int n;
cin >> n;
... |
#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
///--->>> CONTAINERS <<<---///
using i64 = int64_t;
using ll = long long;
using ld = long double;
using vi = vector<ll>;
using vvi = vector<vector< ll > >;
using vpi = ve... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... |
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#inc... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define RI register int
typedef long long LL;
#define int LL
#define FILEIO(name) freopen(name".in", "r", stdin), freopen(name".out", "w", stdout);
using namespace std;
namespace IO {
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc(... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
ll rd(){
ll x = 0;
int f =1;
char ch = getchar();
while(ch < '0' || ch > '9') {
if(ch == '-') f = -1;
ch = getchar();
}
while(ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... |
#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<ll,ll> P;
#define mod 1000000007
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x,ll y) {return x/gcd(x,y)*y;}
int main(){
ll ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp(a) setprecision(a)<<fixed
#define ss second
#define fori(v) for(ll i=0; i<v; i++)
#define forj(v) for(ll j=0; j<v; j++)
#define fork(v) for(ll k=0; k<v; k++)
#define forl(v... |
#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
usi... | #include <vector>
#include <array>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#inc... |
// ＵＴＦ−８
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using lc = complex<double>;
/* #include<atcoder/all> */
/* using namespace atcoder; */
template<class T>bool chmax(T &a, const T &b) { return (a<b ? (a=b,1) : 0); }
template<class T>bool chmin(T &a, const T &b) { return (a>b ? (a=b,1) :... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define ll long long
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;
}
const int N=2e5+5;
struct ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b; cin >> a >> b;
int ret = 4;
if (a+b >= 15 && b >= 8) ret = 1;
else if (a+b >= 10 && b >= 3) ret = 2;
else if (a+b >= 3) ret = 3;
cout << ret << '\n';
return 0;
}
| #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <cstring>
#include <functional>
#include <map>
#define LL long long
#define lson(rt) (rt << 1)
#define rson(rt) (rt << 1 | 1)
using namespace std;
const int N = 1e6 + 10;
map<LL, L... |
//In the name of Allah :)
#include <bits/stdc++.h>
using namespace std;
string to_string(char c) { return string(1,c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return (string)s; }
string to_string(string s) { return s; }
template<class A> string to_string(complex<A> ... | #include<bits/stdc++.h>
#define HAS_TEST_CASE 0
namespace rG{
typedef long long ll;
const int N=2e3;
int a[N+10][N+10];
int n,m;
bool can[N+10][N+10];
void main(){
int T1,T2;
scanf("%d%d%d%d",&n,&m,&T1,&T2);
for(int i=1;i<=T1;i++){
int x,y;scanf("%d%d",&x,&y);
a[x][y]=1;
}
for(int i=1;i<=T2;i++){
int x... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
ll a[210000];
int... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
//定数
//円周率
const double pi = 3.141592653589793238462643383279;
//天井
const int INF = 1000000000; // = 10^9
const ll LINF = 100000000000000000; // = 10^17
//ABC文字列
const string ABC = "ABCDEFGHIJKLMNOPQRS... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < n; i++)
const int mod = 1000000007;
int main()
{
int n;
cin >> n;
ll x1,x2,x3,x4,y1,y2,y3,y4;
x1 = x2 = y1 = y2 = -1e9-1;
x3 = x4 = y3 = y4 = 1e9+1;
int x11,x22,x33,... | //Don't act like a loser.
//This code is written by huayucaiji
//You can only use the code for studying or finding mistakes
//Or,you'll be punished by Sakyamuni!!!
#include<bits/stdc++.h>
#define int long long
using namespace std;
int read() {
char ch=getchar();
int f=1,x=0;
while(ch<'0'||ch>'9') {
if(ch=='-')
... |
/**
* Author : Tanbin_Hasan
* Created : 22.02.2021
**/
#include <bits/stdc++.h>
using namespace std ;
int main(void) {
ios::sync_with_stdio(false) ; cin.tie(0) ;
int n ;
cin >> n ;
long long ans = 0 ;
for (int i = 1 ; i < n + 1 ; ++i) {
for (int j = 1 ; j < n + 1 ; ++j) {
if (i * j > n) {
... | #include<bits/stdc++.h>
using namespace std;
const int N=2e5+100;
#define ll long long
char str[N]; int n, b[N], c[N], sum[N], cnt;
ll ans;
int main() {
scanf("%s",str+1), n=strlen(str+1);
for(int i=1;i<=n;++i) {
if(i != 1 && str[i] == str[i-1])
++b[cnt];
else c[++cnt]=str[i]-'a', b[cnt]=1;
}
for(int i=1;i<... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void*wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned ... | #include<cstdio>
#define p() *p3++='\n'
#define P() *p3++=' '
#define N 1010
using namespace std;
static char obuf[1<<23],*p3=obuf;
template<typename T>
inline void read(T&x) {
T s=0,w=1;char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') {s=(s<<1)+(s<<3)+(ch^48),ch=... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
int ans = 0;
int n, k;
long t[8][8];
void saiki(int count, int go, long dist, int now) {
if (count == n-1) {
if (dist + t[now][0] == k) {
ans++;
}
}
else {
for (int i = 1; i < n; i++) {
if... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define mod 1000000007
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define trace(x) cerr<<#x<<" : "<<x<<endl;
int cnt = 0;
bool vis[2002];
void dfs(int idx, vector<int> v[])
{
vis[idx] = true;
... |
#include <cstdio>
#include <algorithm>
using namespace std;
using ll = long long int;
const ll MOD=1e9+7;
const int MAXN=1e3+5;
ll factorial[MAXN];
int N;
char cAA,cAB,cBA,cBB;
ll fast_power(ll base,ll exp){
if (exp==0) return 1ll;
auto temp=fast_power(base,exp/2);
if (exp%2) return temp*temp%MOD*base%... | #include <bits/stdc++.h>
#include <map>
#include <iostream>
using namespace std;
typedef long long ll;
typedef long double ld;
#define BIG 200005
ll M = 1000000000+7;
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % M;
x = x*x % M;
n = n >> 1;
}
return ans;... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=(a); i<(n); i++)
#define rep2(i,a,n) for (int i=(a); i<=(n); i++)
using ll = long long;
using dl = double long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main() {
vector<int> l(3);
rep(i,0,3) cin >> l[i];
sort(l.begi... | #include<iostream>
using namespace std;
int main(){
int A[4];
for(int i = 0; i < 4; i++){
cin >> A[i];
}
cout << A[0] * A[3] - A[1] * A[2] << endl;
} |
/*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorit... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
constexpr int kN = 73;
bitset<kN> bs[kN];
int n;
ll ans;
unordered_map<__int128, ll> ma;
void solve(bitset<kN> cur) {
int id = cur._Find_first();
__int128 val = 0;
for (int i = n - 1; i >= id; i--) if (cur[i]) val ... |
#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
using namespace std;
typedef long long LL;
const int N=500500;
int read(int &n)
{
bool q=0;n=0;char ch=' ';
for(;ch!='-'&&(ch<'0'||ch>'9');ch=getchar());
if(ch=='-')ch=getchar(),q=1;
for(;ch>='0'&&ch<='9';ch=ge... | #include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vec... |
#include<iostream>
#include<vector>
#include<map>
#include<stack>
#include<stdlib.h>
#include<math.h>
#include<string>
#include<string.h>
#include<set>
#include<algorithm>
#define Doura() ios_base::sync_with_stdio(false),cin.tie(NULL), cout.tie(NULL)
#define ll long long
using namespace std;
int main()
{
Doura();
... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all> // g++ main.cpp -std=c++17 -I .
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
template<class T,class U> inline bool chmin(T&x,U y){if(x>y){x=y;return... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
using namespace std;
//-------------------------------------------------------//
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define MOD 1000000007
#define INF 1e18
#def... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
n*=2;
int res = sqrt(n);
while(res*(res+1)<n){
res++;
}
cout<<res<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n][2];
for(int i=0;i<n;i++) cin >> a[i][0] >> a[i][1];
int count=0;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
if(abs(a[i][1]-a[j][1])<=abs(a[i][0]-a[j][0])) count++;
}
}
cout << count << endl;
} | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ull signed long long int
#define lli long long int
#define ll long long
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(),v.rend() //reverse
#define vl vector<lli>
#define fro(i,a,b) for(int i=a;i<b;i++)
#define mii unordered_map<... |
// ダイクストラ法 非負距離のみ
// O((N+M)log M)
// https://www.youtube.com/watch?v=iEfDi7wagfE&feature=youtu.be
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll ... | #include <bits/stdc++.h>
using namespace std;
#define dbg(...) dbs(#__VA_ARGS__, __VA_ARGS__)
template <class T>
void dbs(string str, T t) {
cerr << str << " : " << t << "\n";
}
template <class T, class... S>
void dbs(string str, T t, S... s) {
int idx = str.find(',');
cerr << str.substr(0, idx) << " : " ... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,k;
scanf("%d%d%d",&n,&m,&k);
k=k*1000;
int r,l;
if(k%m==0)
r=k/m;
else
r=k/m+1;
l=k/n;
if(r>l)puts("UNSATISFIABLE");
else printf("%d %d",r,l);
return 0;
} | /// In the name of ALLAH
/// I'm THEOVE46
#include<bits/stdc++.h>
using namespace std;
#define gap " "
#define nn "\n"
#define pi 2*acos(0.0)
#define db double
#define ft float
#define ll long long int
#define ull unsigned long lo... |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using ll = long long;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
int main(){
int n; cin >> n;
vl a(n),m(n,0),ans(n,0),sum(n,0),sum2(n,0);
ll tmpmax = 0;
for(int ix=0;ix<n;i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n{};
cin>>n;
vector <long long int> a(n+1),sum(n+1);
for (int i{1};i<=n;i++){
cin>>a.at(i);
sum.at(i) = sum.at(i-1) + a.at(i);
}
long long int max{a.at(0)},sum1{};
for (int i{1};i<=n;i++){
if (max < a.at(i)... |
// includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
... | #include<bits/stdc++.h>
#define int long long
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define puts(x) cout << (x) << "\n"
using namespace std;
int input() { int t; cin >> t; return t; }
int n, x[300], y[300], R[300], xe[300], ye[300];
bool fb(... |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b >> c;
int n = 101;
double e[n][n][n];
for(int i = 0; i < n; ++i){
for(int j = 0; j < n; ++j){
e[i][j][100] = 0;
e[100][i][j] = 0;
e[j][100][i] = 0;
}
}
for(int i = n-2; i >= a; --i)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define drep(i,b,a) for(int i = (b)-1; i >= (a); i--)
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(v) sort(v.begin(),v.end());
#define RSORT(v) sort(v.rbegin()... |
// atcoder/arc113/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ... | #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x... |
#include<bits/stdc++.h>
#define int long long int
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fastm_fast ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL)
#define pb push_b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=1e6+5;
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<b-c<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std ;
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(a) (int)a.size()
#define F first
#define S second
#define INF 2000000000000000000
#define popcoun... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, a[1000], b[1000];
cin>>n;
for (int j = 0; j < n; j++)
cin>>a[j]>>b[j];
int min = a[0], mini = 0;
for (int i = 1; i < n; i++)
{
if(a[i]<min)
{
min = a[i];
mini = i;
... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const long long INF=1e9+7;
int main(){
IOS;
long long n;
cin>>n;
long long i=1;
while(i*(i+1)<2*n){
i++;
}
cout<<i<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return ((a * b) / gcd(a, b)); }
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ld n;
cin >> n;
cout << c... |
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
int bitmask[18];
int bits[20];
int dp[2000000];
bool chMap[2000000];
bool check(int state){
for (int i=0;i<18;++i)
if ((bits[i]&state) && (bitmask[i]&state)!=state) return false;
return true;
}
int solve(int n){
chMap[0]=true;
for ... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
int main() {
int n;
ll x;
cin >> n >> x;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ... |
#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 rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... | #include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
string s;
cin>>s;int c1=0,c2=0,n=s.length();
for(int i=0;i<n;i++)
{
if(i%2==0)
{
if(s[i]>=97&&s[i]<=122)
{
++c1;
}
}
if(i%2==1)
{
if(s[i]>=65&&s[i]<=90)
{
++c2... | #include <bits/stdc++.h>
using namespace std;
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;
int tax = N * 1.08;
if (tax < 206) {
cout << "Yay!" << endl... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod =1000000007;
#define rep(i,n) for(ll i=0; i<n; i++)
int main(){
double a,b;
cin>>a>>b;
cout<<fixed<<setprecision(10);
cout<<(1-b/a)*100<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int n, w;
cin >> n >> w;
cout << n/w << endl;
return 0;
} |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
int ans = 0;
for(int l = 2; l <= n; l = l + 2){
int anum = 0, tnum = 0, cnum = 0, gnum =0;
string t = s.substr(0, l);
for(int i = 0, size = t.size(); i < size; ++i){
switch (t[i]){
case 'A': ++... | /*
"An anomaly, I'm Muhammad Ali
Cause I know one day I'm gonna be the"
- Greatest, Eminem
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#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;
typ... |
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0)
//#define MULTI_TEST
//#define GOOGLE
#ifdef LOCAL
#include "debugger.h"
#else
#define db(...)
#endif
#define ll long long
#define v32 vector<int>
#define v64 vector<ll>
#define s32 set<i... | /*
Author: rafa45
Date: 28 Sep 2020
*/
#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
#define mod 1000000007
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int i=0, j=0, n=0;
int c1=0, c2=0, cnt=0;
string s, sub;
cin >> n >> s;
for... |
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main(void)
{
int n;
cin >> n;
long a;
long sum = 0;
long sum1 = 0;
for (long i = 0; i < n; i++)
{
cin >> a;
sum += a;
sum1 += a * a;
}
cout << n * sum1 - sum * sum << endl;
ret... | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<cstdlib>
#include<bitset>
using namespace std;
#define FAST ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
typedef long long ll;
ll a[402]={0};
in... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define loops(i, s, n) for (ll i = s; i < (ll)n; i++)
#define loop(i, n) loops(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define pub push_back
#define pob pop_back
#define mp make_pair
#define dump(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T,class U> using P = pair<T,U>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vec<T>>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
ll M = 998244353;
vector<ll> fac(300001); //n!(mod M)
vector<ll> ifac... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
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, const T& b) {if (a > b) {a = b; return true;}return false;}
const in... | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b;
cin >> a >> b;
int c = a * 2 + 100;
int d = c - b;
cout << d;
} |
// ██████ ██ ██ ██████ ██ ██ ██ ██████
// ██ ██ ██ ██ ██ ██ ██ ██ ██ ██
// ██ ███ ██ ██ ██████ ██ █████ ██ ██
// ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██
// ██████ ██████ ██ ██ ██ ██ ██ ██████
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if (2 * a[1] == a[0] + a[2])
cout << "Yes";
else
cout << "No";
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
const int INF = 1000000000;
const int MOD = 1000000007;
const ll llINF = 1000000000000000000;
void solve() {
vector<int> a(3);
rep(... | #include<bits/stdc++.h>
#include<math.h>
#define str string
#define sz size()
#define bgn begin()
#define ll long long int
#define li long int
#define con continue
#define rt return 0
#define fr first
#define sec second
#define pf push_front
... |
#include <bits/stdc++.h>
#ifdef LILY
#include "./Debug.h"
#else
#define var(...) (0)
#define dbg(...) (0)
#endif
using int32 = int;
using int64 = long long;
using namespace std;
class Solution
{
#define int int64
#define sfor(i, n) for (int i = 1; i <= (n); ++i)
#define tfor(i, n) for (int i = 0; i < (n); ++i)
in... |
// Problem: B - Reversible Cards
// Contest: AtCoder - AtCoder Regular Contest 111
// URL: https://atcoder.jp/contests/arc111/tasks/arc111_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> ... |
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#def... | #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 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>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
const int INF = 1e9;
int n,k;
int a[805][805], s[805][805];
int binary_search(int key) {
auto check = [&](int mid) {
REP(i,n) REP(j,n) s[i+1][j+1] = a[i][j] > mid ? 1 : 0;
REP(i,n+1) REP(j,n) s[i][j+1] += s[i][j];
REP(i,... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long count[200] = {};
cin >> N;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
count[A % 200]++;
}
long long result = 0;
for (int i = 0; i < 200; i++) {
result += (count[i] - 1) * count[i] / 2;
}
cout << result... | #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 ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
*/
typedef long long ll;
typedef long double ld;
typedef un... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const ll mod = 1000 * 1000 * 1000 + 7;
vector<ll> v; ll res = 0;
struct edge {
int u, v; ll w; edge() {}
edge(int _u, int _v, ll _w) :
u(_u), v(_v), w(_w) {}
};
s... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(long long int i=a;i<b;i++)
typedef long long int lli;
using namespace std;
void solve(){
lli n;
cin>>n;
if(n%2 != 0){
cout<<"Odd\n";
}
else{
n=n/2;
if(n%2 != 0){
cout<<"Same\n";
... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string S;
cin >> S;
auto ans = "Yes";
for (size_t i = 0; i < S.length(); i++)
{
if (i % 2 == 0 && !islower(S[i]))
ans = "No";
else if (i % 2 == 1 && islower(S[i]))
ans = "No";
}
c... |
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T>
using ordere... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb(x) push_back(x);
#define mp(x, y) make_pair(x, y)
#define mem(dp, a) memset(dp, a, sizeof dp);
#define all(a) a.begin(), a.end()
#define sall(a) sort(all(a))
#define X first
#define Y second
typedef long long int ll;
typ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a =0 , b=0 , c =0 , d=0;
cin >> a>> b >> c >> d;
cout << (a*d) - (b*c) <<endl;
return 0;}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,k,n) for(int i=k;i<=(n);++i)
#define repD(i,k,n) for(int i=k;i>=(n);--i)
#define endl '\n'
#define print(b) for(auto a:b) cout<<a<<' ';
#define printN(b) for(auto a:b) cout<<a<<endl;
#define fin freopen("C:\\Users\\Nazmul Rahul\\D... |
#include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
ll n;
while(cin>>n){
ll ans=0, tmp1 = 3, tmp2 = 1, ans1 = -1, ans2 = -1;
for(ll i = 1; tmp1<=n; tmp1*=3, ++i){
tmp2 = 5;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N; cin >> N;
for(ll i = 1; i <= 37; i++){
for(ll j = 1; j <= 37; j++){
if(powl(3,i)+powl(5,j)==N){cout<<i<<" "<<j<<endl;return 0;};
if(powl(5,i)+powl(3,j)==N==N){cout<<j<<" "<<i<<endl;return 0;};
}
}
cout << "-1" ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
constexpr ll INF = ... | /* --------------------
| LOSER |
| ~NOOBOSS~ |
--------------------
*/
#include <bits/stdc++.h>
using namespace std;
#define mxx LLONG_MAX
#define mnn LLONG_MIN
#define Y() cout<< "YES" <<endl
#define N() ... |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i, n) for(ll i=n-1;i>=0;--i)
#define rep1(i, n) for(ll i=1; i<=n; ++i)
#define repitr(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
... | #include <cstdio>
using namespace std;
int n;
int main(){
scanf("%d",&n);
if(n%2){
printf("Black\n");
}else{
printf("White\n");
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <regex>
using namespace std;
int main() {
int N; cin >> N;
string S; cin >> S;
int Q; cin >> Q;
string pre = S.substr(0, N);
string post = S.substr(N);
for (int i = 0; i < Q; ++i) {
int t, a, b;
cin >> t >> a >> ... | #include <bits/stdc++.h>
using namespace std;
const int M=18;
const int INF=0x3f3f3f3f;
int x[M],y[M],z[M];
int d[M][M];
inline int dis(int i,int j)
{
return abs(x[i]-x[j])+abs(y[i]-y[j])+max(0,z[j]-z[i]);
}
int dp[1<<M][M];
int main()
{
int n; cin>>n;
for(int i=0;i<n;i++)
{
cin>>x[i]>>y[i]>>z[i];
}
for(int ... |
#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()
#defin... | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
string s[100010];
ll cnt[1<<20] = {};
int main(){
int i,j,n,m; cin >> n >> m;
ll od = 0,ev = 0;
for(i=0;i<n;i++){
cin >> s[i];
int cnt = 0;
for(j=0;j<m;j++) cnt += s[i][j] - '0';
if(cnt&1) od++;
... |
// author: xay5421
// created: Sun Jun 13 00:10:43 2021
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#else
#define D(...) ((void)0)
//#define NDEBUG
#endif
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> ans;
bool gcd(ll a, ll b, int c) {
if (c < 0) return false;
if (a == 0) {
if (b > c) return false;
for (int i = 0; i < b; ++i) {
ans.push_back(2);
}
return true;
}
if (b == 0) {
if (a > c) return false;
for (int i = 0;... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
inline ull Hash(const string& s){
ull ans=0;
for(auto c : s)
ans=ans*26+c-'a';
return ans;
}
string s;
int N;
set<ull> s1,s2;
inline void work(){
for(int i=1;i<=N;i++){
cin>>s;
set<ull> &t1=(s[0]=='!'?s1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//const ll INF = numeric_limits<ll>::max() / 4;
//const int INF = numeric_limits<int>::max() / 4;
int main() {
// ll N;
string S;
cin >> S;
vector<int> A(10,-1); // -1:x, 0:? 1:o
for(int i = 0; i < 10; i++){
if(... |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define int long long
#define FOR(i, size) for (int i = 0; i < size; i++)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define MOD 1000000007
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void logger(string vars, ... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int inf=1e9+7;
const ll INF=1e18+7;
int n,t;
long double a[2001],b[2001];
bool intersect(int i,int j){
if(a[i]<=b[j]&&b[i]>=a[j]) return 1;
return 0;
}
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>t>>a[i]>>b[i];
if(t>2) a[i]+=0.5;
if(t%... |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long int
#define sd(x) scanf("%lld",&x)
#define sdi(x) scanf("%d",&x)
#define sdc(c) scanf("%c",&c)
#define inf 1000000000000000000ll
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fastio ios_base::sync_w... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <cstring>
#include <string>
#include <queue>
#include <cstdio>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bit... |
//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<numeric> // __GCD()
#include<stack>
#include<string.h>
#include<math.h>
#include<set>
using namespace std;
#define ll long long
#define all(v) v.begin(),v.end()
int main(){
ll r;
double x,y; cin>>r>>x>... | #include <bits/stdc++.h>
int main() {
int a, b;
std::cin >> a >> b;
for (int i = b - a; i > 0; i--) {
int l = a / i * i; if (l < a) l += i;
int r = b / i * i; if (r + i <= b) r += i;
if (l < r) {
std::cout << i << '\n';
break;
}
}
} |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
in... | #include <bits/stdc++.h>
using namespace std;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using isize = ptrdiff_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using usize = size_t;
using f32 = float_t;
using f64 = double_t;
i32 n;
vect... |
#include <bits/stdc++.h>
using namespace std;
#define ls n << 1
#define rs n << 1 | 1
#define PB push_back
#define MP make_pair
#define LD double
#define int long long
#define LL long long
#define pii pair<int, int>
#define fi first
#define se second
const int N = 1e5;
const int M = 300;
const int mod = 1e9 + 7;
const... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
... |
#include"bits/stdc++.h"
using namespace std;
#define ll long long
#define ul unsigned long long
#define ui unsigned int
#define ri register int
#define pb push_back
#define mp make_pair
char p[30]={'0','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
inline ll rd... | #include <iostream>
#define int long long
using namespace std;
const int N = 100000 + 7;
int pd[N], prime[N];
int cnt;
inline void diprime()
{
pd[0] = pd[1] = 1;
for(int i=2; i<=N-7; i++)
{
if(!pd[i]) prime[++cnt]=i;
for(int j=1; j<=cnt; j++)
{
if(prime[j] * i > N-7) br... |
#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 int long long
using namespace std;
const int MOD=1e9+7;
typedef pair<pair<int,int>,pair<int,int>> pii;
const int N = 200005;
int n,q,root=1,dis[N];
vector<int> G[N];
vector<pii> Ques;
int L[N],R[N],TIME=0;
int calc_QUAI(int x){
return x/sqrt(n);
}
bool cmp(pii a, pii b){
if(calc_... |
// @Date : 2021-06-05 19:00:19
// @Author : raj lath (oorja.halt@gmail.com)
// @Link : link
// @Version : 1.0.0
#include <bits/stdc++.h>
using namespace std;
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define mod 9982444353
#define rep... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin>>A>>B>>C;
if(C==0){
A=A-1;
if(A<B){
cout<<"Aoki"<<endl;
}
else{
cout<<"Takahashi"<<endl;
}
}
else{
B=B-1;
if(B<A){
cout<<"Takahashi"<<endl;
}
else{
cout<<"Aoki"<<endl;
}... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll h, w, a, b;
ll count(vector<ll> mas, ll aed, ll bed, ll now){
/*
cout << now << endl;
for(int i=0;i<w*h;i++) cout << mas[i] << " ";
cout << endl;
*/
if(aed<0 || bed<0) return 0;
if(now == h*w) return 1;
if(mas[now]!=0) return cou... | #include <bits/stdc++.h>
#define LL long long
#define db double
#define mp make_pair
#define x first
#define y second
#define vi vector<int>
#define SZ(a) (int)((a).size())
using namespace std;
const int N = 1e5 + 10;
int k, n, m, id[N];
LL a[N], b[N], c[N];
int cmp(int x, int y) { return abs(c[x] - a[x]) < abs(c[y] ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define MOD 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(var) (var).begin(), (var).end()
#define sz(x) (int)x.size()
#define MAXX 9000000000000000000
#de... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <st... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using PLL = pair<LL,LL>;
using VPI = vector<PII>;
using VPL = vector<PLL>;
us... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
#define MOD 1000000007
//#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... |
#include <iostream>
#include <string>
constexpr int MAX = 30;
long long dp[MAX + 1][MAX + 1];
std::string find_kth(int A, int B, long long K) {
if (A == 0) {
return std::string(B, 'b');
}
if (B == 0) {
return std::string(A, 'a');
}
if (K <= dp[A - 1][B]) {
return std::string(... | #include <iostream>
#include <algorithm>
#include <string>
// nCr
static long long Combination(int n, int r)
{
if (n < r) return 0;
if ((r * 2) > n) r = n - r;
long long ans = 1;
for (int up = 1, down = n; up <= r; up++, down--) {
ans = ans * down / up;
}
return ans;
}
using namespace std;
int main(v... |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#pragma comment(linker, "/stack:200000000")
#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 int long long
#define pb push_... | /*
the vast starry sky,
bright for those who chase the light.
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define mk make_pair
const int inf=(int)1e9;
const ll INF=(ll)5e18;
const int MOD=998244353;
int _abs(int x){return x<0 ? -x : x;}
int add(int x,int y){x+=y; ret... |
#include <bits/stdc++.h>
using namespace std;
string rev(string a){//aのAとBを反転させたやつを返す
for(auto &p:a)p^='A'^'B';
return a;
}
int main(){
int n;cin>>n;
vector<vector<string>> s(n+1);//s[i]:n=iの時の答え
for(int i=0;i<n;i++){
for(string p:s[i]){
s[i+1].push_back(p+p);
s[i+1].push_back(p+rev(p));
... | //#include <atcoder/math>
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
#define INF_LL 100000000000000000LL
#define INF 2000000000
#define MOD 998244353
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
// typ... |
#include<cstdio>
#include<iostream>
using namespace std;
int n;
int x[101],y[101];
//int t[1001];
int t;
int maxn,minn=9999;
int main()
{
scanf("%d",&n);
for(int a=1;a<=n;a++)
scanf("%d",&t),maxn=max(maxn,t);
for(int a=1;a<=n;a++)
scanf("%d",&t),minn=min(minn,t);
/*for(int a=1;a<=n;a++)
{
t[x[a]]--;
t[y[a]]+... | #include <bits/stdc++.h>
#define maxn 100086
using namespace std;
int a, b;
int main(){
scanf("%d%d", &a, &b);
if(a > b){
int sum = 0;
for(int i = 1;i <= a;i++) sum += i, printf("%d ", i);
for(int i = 1;i < b;i++) sum -= i, printf("%d ", -i);
printf("%d", -sum);
}else{
int sum = 0;
for(int i = 1;i <= ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include <bits/stdc++.h>
using namespace std;
#define int long long
namespace math{
const int MOD = 1e9+7;
const int MN = 10'100;
int fact[MN], inv_fact[MN];
int power(int a, int n) {
int res = 1;
for (;n; n >>= 1, a = (a * a) % MOD) if (n & 1) res = (res * a) % MOD;
return res;
... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
int main(void){
int a, b, c, d;
std::cin >> a >> b >> c >> d;
std::cout << a * d - b * c << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B; cin >> A >> B;
cout << (2 * A + 100) - B << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std; using ll = long long;
using ull = unsigned long long; using P = pair<int, int>;
const int INF = 1e9; const int MOD = 1000000007;
const int dx[] = {-1,0,1,0}; const int dy[] = {0,-1,0,1};
//const int dx[] = {-1,-1,-1, 0, 0, 1, 1... | #include <bits/stdc++.h>
using namespace std;
int main()
{
// int t {0};
// cin >> t;
// while (t--)
// {
int l {0};
cin >> l;
// long long int ans = C((long long int) l - 1, (long long int) 11);
// cout << ans << endl;
vector < vector <long long int> > C (l, ve... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 998244353;
const int maxn = 400005;
ll fac[55];
int d[55];
in... | //un_coder
#include<bits/stdc++.h>
typedef long long ll;
#define all(a) a.begin(),a.end()
#define MOD 1000000007
#define inf 1e18
using namespace std;
void solve();
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r"... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type , less<ll> , rb_tree_tag , tree_order_statistics_node_update>
#define int long long int
#define ull unsigned long long
#defi... | #include<bits/stdc++.h>
#define FORz(i,t,n) for(int i=t;i<=n;i++)
#define FORf(i,n,t) for(int i=n;i>=t;i--)
#define SCC(x) scanf("%d",&x)
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long ll;
using namespace std;
const int N=1e5+5;
const ll MOD=1e9+7;
// inline int read(){int x=0,f=1;char... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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 repi(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (... | #include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
typedef int64_t ll;
typedef uint64_t ull;
using namespace std;
void one_case() {
int n;
cin >> n;
vector<ll> a(n), b(n);
for (auto& el : a) cin >> el;
for (auto& el : b) cin >> el;
l... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF = 1001001001;
int main() {
ll n;
cin >> n;
ll x = 1000;
ll ans = 0;
while(n+1 >= x){
ans += n-(x-1);
... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
#def... |
/*
* @Author: FuTianyu
* @Date: 2021-01-30 20:04:16
* @Last Modified by: FuTianyu
* @Last Modified time: 2021-01-30 20:10:50
*/
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
inline int read(){
int sum=0,ff=1; char ch=getchar();
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 300010
const int MOD = 1000000007;
int ar[maxn], tree[4 * maxn];
int doit(int a, int b) {
return a ^ b;
}
void build(int start, int end, int index = 1) {
if (start == end) {
tree[index] = ar[start];
... |
#include<bits/stdc++.h>
using namespace std;
typedef double db;
const int N = 1e5 + 5;
int n, m, k;
db ans = 0;
db a[N];
db b[N];
bool vis[N];
int main() {
cin >> n >> m >> k;
for (int i = 1; i <= k; ++i) {
int t;
cin >> t;
vis[n-t] = 1;
}
db ans1 = 0, ans2 = 0;
for (int i = 1; i <= n; ++i) {
if (vis[i]) {... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.