code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bo... | #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<bits/stdc++.h>
using namespace std;
# define l long long
# define db long double
# define rep(i,a,b) for(l i=a;i<b;i++)
# define vi vector<l>
# define vvi vector<vi>
# define vsi vector<set<l> >
# define pb push_back
# define mp make_pair
# define ss second
# define ff first
# define pii pair<l,l>
# define... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << " , " << #y << "=" << y << endl
#define _ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
void solve()
{
ll n,... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#include <set>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
const long double PI = 3.141592653589793;
int main(){
int n;
cin >> n;
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... |
//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
stru... | //include
//------------------------------------------
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <ss... |
#include <iostream>
#include <climits>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define MOD 1000000007LL
ll N;
ll i3[100];
ll i5[100];
bool res(ll r, ll &b) {
while(i5[b] > r) b--;
if... | #include<iostream>
#include<cmath>
using namespace std;
long long power(long long a,long long x){
return x?x%2?power(a,x-1)*a:(long long)power(a,x/2)*power(a,x/2):1;
}
long long N,A,B;
int main(){
cin>>N;
for(B=1LL;power(5LL,B)<=N;B++){
//cout<<B<<" : "<<power(5LL,B)<<endl;
long long t=N-... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int fa[N], a[N], sz[N], n;
int find(int rt) {
return rt == fa[rt] ? rt : fa[rt] = find(fa[rt]);
}
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
sc... | #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<iostream>
#include<cstring>
#include<cstdio>
#define maxn 205
using namespace std;
int n,a[maxn],c[maxn][maxn],bj[maxn],tot;
void dfs(int x,int sum,int ct,int last,int num)
{
if(sum==num)
{
++tot;
cout<<endl<<ct<<" ";
for(int i=1;i<=last;i++)if(bj[i])printf("%d ",i);
return ;
}
if(x==last+1)return ... | #include "bits/stdc++.h"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m = 0, n = 0, p = 0, q = 0, mod = 1000000007, pi = 3.1415926535;
string s1, s2;
char moji;
cin >> a;
vector<long long> v(a);
vector<vec... |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1000005;
struct node{
int c,id,val;
}s[N];
bool cmp1(node a,node b){return a.val<b.val;}
bool cmp2(node a,node b){return a.id<b.id;}
int st[N],top;
int main(){
int n;
scanf("%d",&n);n<<=1;
for(int i=1;i<=n;i++) scanf("%d",&s[i]... |
//================code===================//
//#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#define ci(t) cin>>t
#define co(t)... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
int main(){
int n;
cin >> n;
vector<ll> a(n),b(n);
vector<pair<ll,ll>> v;
ll a_value =0;
rep(i,n){
cin >> a[i] >> b[i];
a_value+=a[i];
v.push... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <array>
#include <algorithm>
#include <utility>
#include <numeric>
#include <functional>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class ...Args>
void Input... |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <bitset>
#include <math.h>
#include <queue>
#include <map>
#include <set>
#include <limits.h>
#include <limits>
#include <stdio.h>
#include <stdlib.h>
#include <cstring>
#include <sstream>
using namespace std;
const i... | // omae wa mou shindeiru
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define float double
#define ll long long
#define int long long
#define pb ... |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int n, x[20], y[20], z[20]; LL dp[(1<<17)+1][20];
int dis(int i, int j) {return abs(x[i]-x[j]) + abs(y[i]-y[j]) + max(0, z[j]-z[i]);}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n;
for(int i = 0; i <= (1<<17); i++) for(au... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template<typename A, size_t N, typename T>
void... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a[4];
for(int i=0;i<4;i++)
cin>>a[i];
sort(a, a + 4);
if (a[0] + a[3] == a[1] + a[2] || a[0] + a[1] + a[2] == a[3])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int v,t,s,d;
cin >> v >> t >> s >> d;
cout << ((d < v * t || d > v * s)?"Yes":"No");
} |
#line 1 "main.cpp"
#include <bits/stdc++.h>
using namespace std;
// template {{{
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)
#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<long long int> vlli;
#define pb push_back
#define pi 3.1415
const lli MOD= 1e9+7;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
in... |
#include <iostream>
using namespace std;
#include <vector>
#include <set>
#include<string>
#include <algorithm>
#include <cmath>
#include <climits>
typedef long long ll;
typedef unsigned long long ull;
//AtCoder Begginer Contest 201 C
int main(void)
{
int n;
cin >> n;
vector<ll> a(n);
for (auto& x : a)
{
ci... | #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define RALL(X) (X).rbegin(), (X).rend()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%... |
// g++ cpp.cpp && ./a.out
#define mod 1000000007
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int max = 0;
vector<int> a(n);
for (int i = 0; i < n; i++){
cin >> a[i];
if (a[i] > max)
max = a[i];
}
int ans;
int cmax = 0;
for (int i... | #include <bits/stdc++.h>
using namespace std;
signed main(){
int N, i, ans = 0;
scanf("%d", &N);
for(i = 0; i < N; i++){
int A;
scanf("%d", &A);
ans += max(A - 10, 0);
}
printf("%d\n", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
void solve(){
int n;
cin>>n;
string s;
cin>>s;
int l=0;
string a,b;
a = s.substr(0,n);
b = s.substr(n,n);
int q;
cin>>q;
while(q--){
int t,x,y;
cin>>t>>x>>y;
x--;
y--;
if(t==1){
if(l==0){
char t;
if(x<n) ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "talltree"
#define pll pair<ll, ll>
#define pii pair<pll, pll>
#define fi first
#define se second
#define ull unsigned long long
using namespace std;
const ll mod = 1e9+7;
const ll N = 2e5+5;
ll n, m, t, ans, k, a[N], b[N], tong, cnt, q,... |
// #include<iostream>
// #include<bits/stdc++.h>
// #include<vector>
// #include<algorithm>
// #include<string>
// #include<cmath>
// #include<iomanip>
// #include<numeric>
// #include<set>
// // #include<pair>
// #include<cctype>
/**** BE SPECIFIC WITH YOUR GOAL ******/
/**** TRY TO DRY RUN YOUR CODE AS YOU CAN ... | #include<bits/stdc++.h>
using namespace std;
// @author: sharad_sharma
#define ll long long
#define ld long double
#define mod 1000000007
#define inf 1e18
#define pb push_back
#define all(n) n.begin(),n.end()
#define loop(i,a,b) ... |
#include<bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
typedef long long int lli;
lli n,k,m,t,a,b,l,r,h,u,temp1,temp2,x,y,temp,q,d,mod=1e9+7,w,p,c,z;
lli MOD =998244353;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>a>>b>>c;
lli sigA = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define f(i,n) for(i=0;i<n;i++)
#define f1(i,n) for(i=1;i<n;i++)
#d... |
#include <bits/stdc++.h>
#define rei register int
#define ll long long
using namespace std;
char standard[3]={'1','1','0'};
const ll N=1e10,M=2e5+100;
int n,t;
string s;
char a[M];
bool check(){
int pos1=a[1],pos2=a[2];
if(pos1=='1'){
if(pos2=='1'){
for(rei i=3;i<=n;++i)
if(a[i]!=standard[(i-1)%3]) ret... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
signed main() {
int n;
string s = "110";
string t;
cin >> n >> t;
int ans = 1e10;
if (t == "1") {
cout << ans * 2 << '\n';
return 0;
} else if (t == "11" || t == "10") {
cout << ans << '\n';
return 0;
}
... |
#include <iostream>//cout<<right ใงๅณๆใ
#include <iomanip>//cout<<setw(ๆฐๅญ) ใง็ฉบ็ฝใซใใๆกๆใ
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <cstdlib>//abs()ใงๆดๆฐ็ตถๅฏพๅค
#include <cmath>//abs()ใfabs()ใงๅฐๆฐ็ตถๅฏพๅค
#include <functional>//sort็ฌฌไธๅผๆฐgreater<>()ใง้้
#include <map>
#define rep(i, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for(int i = 0; i < n; ++i)
cin >> vec[i];
int ans = -1;
for(int left = 0; left < n; ++left) {
int min_app = vec[left];
for(int right = left; right < n; ++right) {
min_app = min(min_app, vec[right]);
ans ... |
#include<iostream>
#include<vector>
using namespace std;
void f(const int& a,const int& b) {
if (a>b) {
cout << ">";
}
else if(a<b){
cout << "<";
}
else {
cout << "=";
}
}
int main(void) {
int A,B,C;
cin >> A >> B >> C;
C = C % 2;
if (A < 0) { //A-
if (B < 0) { //B-
if (C == 0) {
f(A*(-1)... | #include <stdint.h>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);//cout.precision(dbl::max_digits10);
#define pb(x) push_back(x)
#define mod 1000000007ll //998244353ll
#define vi vector<int>
#define v... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define pii pair <int,int>
#define pll pair <ll,ll>
#define testcase() int t; cin>>t; while(t--)
#define forn(i,n) for(int i=0;i<n;i++)
#define forn1(i,n)... | #include<bits/stdc++.h>
using namespace std;
ostream& operator<<(ostream&o,const pair<auto,auto>&p){return o<<"<"<<p.first<<", "<<p.second<<">";}
ostream& operator<<(ostream&o,const vector<auto>&v){o<<'[';int f=0;for(auto&x:v)(f?o<<", ":o)<<x,f=1;return o<<']';}
#ifdef BIZON
#define rr(...) [](const auto&...x){ cha... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int i,a,b;
double x;
scanf("%d %d",&a,&b);
x=1.0*b*a/100;
printf("%f\n",x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define rep(a, b, c) for (int a = b; a < c; a++)
#define db cout << "db: "
#define trav(a, x) for (auto &a : x)
#define all(con) con.begin(), con.end()
#define boost \
ios_base::sync_with_stdio(fal... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll A[2005];
ll gcd(ll a, ll b) {
if (a < b)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
map<int, int> mp;
void add(int a, int b)
{
if (!mp.count(a)) mp[a] = b;
else mp[a] = __gcd(mp[a], b);
}
int main()
{
int n; scanf("%d", &n);
vector<int> a(n);
for (auto &x: a) scanf("%d", &x);
sort(a.begin(), a.en... |
#include <bits/stdc++.h>
using namespace std;
int main() {
char S, T;
cin >> S >> T;
if(S == 'N') {
cout << T << endl;
}
else {
if(T == 'a') {
cout << "A" << endl;
}
else if(T == 'b') {
cout << "B" << endl;
}
else {
cout << "C" << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double gx,gy,sx,sy;
cin>>sx>>sy>>gx>>gy;
double res=(sy*gx+sx*gy)/(sy+gy);
cout<<setprecision(10)<<res<<endl;
}
| #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... |
#include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
//using namespace ha... | #include <bits/stdc++.h>
#define DEBUG if(0)
#define lli __int128
#define ldouble long double
using namespace std;
/*
(2x + 2y)n + x <= t < (2x + 2y)n + x + y
range = y (max 500)
(p + q)n + p <= t < (p + q)(n + 1)
range = q (max 500)
try all combinations of mod (500^2)
t - (2x + 2y)n - x == remY
t - (2x + 2y)n =... |
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if (c%2==0){
a = abs(a);
b = abs(b);
}
if ( a < b ){
cout << "<" << endl;
} else if ( a > b ){
cout << ">" << endl;
} else {cout << "=" << endl;}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define eb emplace_back
#define mk make_pair
using namespace std;
void vec(vector<int> & v){
for(int i = 0;i<v.size() ; i++){
cout<<v[i]<< " ";
}
cout<<endl;
}
void vec_ll(vector<long long int> & v){
for(int i... |
#include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define ll long long
#define rep(i,n) for(int i = 0;i < (int)n;i ++)
#define mod % 1000000007
using namespace std;
int main(void){
ll n;
cin >> n;
vector<ll> a(n+1,0);
ve... | /******************************
Author: jhnah917(Justice_Hui)
g++ -std=c++17 -DLOCAL
******************************/
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define IDX(v, x) (lower_bound(all(v), x) -... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size()-3; i++) {
if (s.at(i) == 'Z'){
if (s.at(i+1) =='O'){
if (s.at(i+2) =='N'){
if (s.at(i+3) =='e'){
count++;
}
}
}
... | // YATIN KWATRA
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ar array
#define sz(v) (int)(v.size())
#define inf 1e18
#define int... |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define mo 1000000007
#define ll long long
#define maxn 1005
using namespace std;
int n,i,j,k,f[2][2];
ll ans;
ll ksm(ll x,ll y){
ll s=1;
for(;y;y/=2,x=x*x%mo) if (y&1)
s=s*x%mo;
return s;
}
void reverse(){
static int g[2][2];
for(i=0;i<2;... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define repl(i,l,r) for(int i=l;i<r;i++)
#define rrepl(i,l,r) for(int i=r-1;i>=l;i--)
const int inf=1e9+10;
const ll INF=2e18+10;
const int dx[4]={1,0,-1,0};
const int dy[4... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<int> A(N,0);
vector<int> B(N,0);
for(int i=0;i<N;i++){
cin>>A.at(i);
}
for(int i=0;i<N;i++){
cin>>B.at(i);
}
int sum=0;
for(int k=1;k<1001;k++){
for(int i=0;i<N;i++){
if(k<A.at(i)||B.at(i)<k)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto& x : A) cin >> x;
ll res = 0;
map<ll, int> a;
ll s = 0;
++ a[0];
for (int i = 0; i < N; ++ i) {
if (i % 2) {
s += A[i];
res += a[s];
++ a[s];
} else {
s -= A[i];
res ... |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const long double phi = 0.618033988749894848204586834365;
vector<int> calc(long long x, long long y) {
vector<int> a;
while (x > 0 || y > 0) {
if (a.size() > 130) {
break;
}
if (x == 0) {
a.push_back(2);
y -= 1;
continu... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll t;cin >> t;
while(t--){
ll L, R;cin >> L >> R;
if(2 * L > R){
cout<<0<<endl;
}else{
cout<<(R - 2 * L + 2) * ((R - 2 * L) + 1) / 2<<endl;
}
}
return 0;
}
| #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++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
int n; cin >> n;
vector<P> v(n);
rep(i, n)
cin >> v[i].first >> v[i... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
#define rep(i,n) for(long long int i=0;i<(n);i++)
typedef long long ll;
typedef pair<int, int> P;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
}
else {
return gcd(b, a % b);
}
}
ll l... | #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;
//defines...
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp mak... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll cnt(ll X, ll Y, ll R, ll lim) {
ll a = 0;
ll b = 10000;
ll res = 0;
for (ll i = (Y + R) - (Y + R) % 10000; i >= lim; i -= 10000) {
while ((b - X) * (b - X) + (i - Y) * (i - Y) <= R * R) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l,r;
cin>>l>>r;
long long ans = 0;
vector<long long> dp(r+1,0);
for(int g = r; g>=2;g--){
long long cnt = (r/g - (l-1)/g);
dp[g] = (cnt * (cnt-1))/2;
//Currently dp[g] contains g,2g,3g,4g,... as gcd
//we... |
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#define ll long long
#define ld long double
#define mod 1000000007
#define pb push_back
#define inf 1000000000000000000
#define ff firs... | //#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#include<set>
#include <array>
using namespace std;
#define ll long long
#define endl '\n'
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define con continue
#define ub upper_bound
#define lb lower_... |
//Think simple yet elegant.
#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 all(v) v.begin(),v.end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int,int>
#define REP(i,n) for(int i... | #include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << s[1] << s[2] << s[0] << endl;
return 0;
} |
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define ll long long int
#define all(x) begin(x), end(x)
bool isPowerOfTwo (int x) {
return x && (!(x&(x-1)));
}
int main(){
//std::ios_base::sync_with_stdio(0);
//std::cin.tie(0);
//freopen("king2.in", "r", stdin);
//freopen("ki... | #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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
... | #include <stdio.h>
int main(){
bool rev=false;
char dq[1101000],c;
int l=501000,r=501000;//ไธ้ไธ้
while((c=getchar())!='\n'){
if(c=='R')rev=!rev;
else{
if(rev){
if(l!=r&&dq[l]==c)l++;
else dq[--l]=c;}
else{
if(l!=r&&dq[r-1]==c)r--;
else dq[r++]=c;}}}
if(rev)for(... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define chmin(a,b) a = min(a,b)
#define chmax(a,b) a = max(a,b)
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vv = vector<vi>;
using P = pair<ll,int>;//(cost,to)
using vP = vector<P>;
using vvP= vector<vP>;
const int INF = 10... | #include <bits/stdc++.h>
template <typename T>
T next() {
T temp; std::cin >> temp;
return temp;
}
template <>
int next() {
int temp; scanf("%d", &temp);
return temp;
}
template <>
long long next() {
long long temp; scanf("%lld", &temp);
return temp;
}
template <>
double next() {
double te... |
#include<bits/stdc++.h>
using namespace std;typedef long long ll;
int T=1;void eo();int main(){//cin>>T;
while(T--)eo();}
void eo(){
string s;cin>>s;
for(char x:s){
if(x=='.') break;
cout<<x;
}
cout<<'\n';}
| ///bismillahir rahmanir rahim
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll p=0, d=0, c=0;
string s;
cin>>s;
for(int i=0; i<s.size(); i++){
if(s[i]=='.') d++;
}
if(d==1){
for(int i=0; s[i]!='.'; i++){
if(s[i]>'0'){
... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define reps(i,n) for (int i = 1; i <= (n); ++i)
#define rrep(i,n) for (int i = (n) - 1; i >= 0; --i)
#define rreps(i,n) for (int i = (n); i > 0; --i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define PB push_back
#defin... | #include<bits/stdc++.h>
using namespace std;
long long x,y;
map<long long,long long>dp;
long long rec(long long now){
if(x>=now)return x-now;
if(dp[now])return dp[now];
long long res=now-x;
if(res>rec(now/2)+now%2+1)res=rec(now/2)+now%2+1;
if(res>rec((now+1)/2)+now%2+1)res=rec((now+1)/2)+now%2+1;
return dp[... |
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define rsrt(v) sort(v.begin(), v.end(), greater<int>())
#define rsrtl(v) sort(v.begin(), v.end(), greater<ll>())
#define fi(i, a, b) for (int i = a; i < b; i++)
#define fll(i, a, b) for (ll i = a; i < b; i++)
#define srt(v... | #include <cstdio>
long long mod[3005][3005];
long long a[3005];
long long dp[3005][3005];
long long sum[3005][3005];
const long long Mod = 1e9+7;
int main(){
int n;
scanf("%d",&n);
for(int i = 1; i <= n; i++) scanf("%lld",&a[i]);
for(int i = 1; i <= n; i++){
mod[0][i] = 0;
for(int j = 1; j <= n; j++){
mod[j... |
#include<bits/stdc++.h>
#define HohleFeuerwerke using namespace std
#pragma GCC optimize(3,"Ofast","-funroll-loops","-fdelete-null-pointer-checks")
#pragma GCC target("ssse3","sse3","sse2","sse","avx2","avx")
#define int long long
HohleFeuerwerke;
inline int read(){
int s=0,f=1;char c=getchar();
for(;!isdigit(c);c=ge... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin >> N >> S;
stack<char> st;
int ans = N;
for(int i = 0;i < N;i++){
char c = S.at(i);
if(c == 'f' || c == 'o')
st.push(c);
else if(c == 'x' && st.size() >= 2){
char two = st.top();
st.pop();
cha... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ls (p << 1)
#define rs (ls | 1)
#define tm ((tl + tr) >> 1)
#define lowbit(x) ((x) & -(x))
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
constexpr dou... | #include<iostream>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define int long long
using namespace std;
int c[502][502],a[502],b[502];
signed main(){
ios::sync_with_stdio(false);
int n; cin>>n;
rep(i,1,n)rep(j,1,n)cin>>c[i][j];
bool flag=true;
rep(i,1,n){rep(j,2,n){
if(i==1)a[j]=c[i][j]-c... |
#include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) vector <int> a(n); rr(i, n) cin >> a[i]
#define pvec(a) rr(i, a.size()) cout << a[i] << " "; cout << endl
#define bug(x) cout << #x << " " << x << endl
#define ll long long
#define vii vector <int>
using namespace std;
voi... | #include<bits/stdc++.h>
using namespace std;
long long N,INF = 1e18;
int main() {
scanf("%lld",&N);
long long k = 1,d = 1,s = 1;
int i=1,j=1;
for(;k<=N;++i) {
k*=5;
d = N-k,s = 3,j=2;
for(;s<d;++j) {
s*=3;
}
if(d == s) {
return 0*printf("%d %d\n",j-1,i);
}
}
puts("-1");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define quickread \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define hii cout << "Hii there Sparky! \n"
#define endl '... | #include <bits/stdc++.h>
using namespace std;
const int maxn=1e2+5;
double dp[maxn][maxn][maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a,b,c;
cin>>a>>b>>c;
for (int i=99; i>=a; i--) {
for (int j=99; j>=b; j--) {
for (int k=99; k>=c; k--) {
... |
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define test int t;cin>>t;while(t--)
#define REP(i,n) for (int i = 0; i < n; i++)
#define RREP(i,n) for (int i = n; i >= 0; i--)
#define MOD 1000000007
#define MOD2 998244353
#define ll long long
#define ... | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define FOR(x,st,n) for(int x = (st); x < (n); ++ x)
#define mem0(a) memset(a,0,sizeof(a))
#define mem_1(a) memset(a,-1,sizeof(a))
#define mem0x(a) memset(a,0x3f,sizeof(a))
#define MAX(a,b) (a)>(b)?(a):(b)
#define MIN(a,b) (a)<(b)?(a):(b)
... |
#include <string>
#include <iostream>
#include <stack>
#include <queue> // priority_queue ใๅ
ฅใฃใฆใ
#include <set> // ่ฆ็ด ๆฐใฏ size() ใงๅๅพ multisetใใใ
#include <map>
#include <array> // sizeใฏใณใณใใคใซๆๅฎๆฐใงๅบๅฎ
#include <vector>
#include <numeric> // accumulate, gcd
#include <algorithm> // count_ifใซๅฟ
่ฆ
#include <iomanip> // cout <... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
/*
*/
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <assert.h>
#include <math.h>
#include <memory.h>
#include <stdio.h>
#include <algorithm>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
... | #include<bits/stdc++.h>
using namespace std;
struct fastio{fastio(){cin.tie(nullptr);ios_base::sync_with_stdio(false);std::cout<<std::fixed<<setprecision(10);}}oitsaf;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define repr(i,n) for(int i{n};i-->0;)
using i64 = int64_t;
template<class T>std::istream&operator>>(std::is... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int H, W, N, M;
cin >> H >> W >> N >> M;
int mat[H][W];
rep(i, H) rep(j, W) {
mat[i][j] = 0;
}
vector<P> light;
rep(i, N) {
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repto(i, n) for(int i = 1; i < (n); i++)
#define all(c) (c).begin(), (c).... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> pii;
int main(){
int n; cin >> n;
vector<int> m(200, 0);
vector<ll> a(n);
rep(i, n){
cin >> a[i];
m[a[i]%200]++;
}
ll ans = 0;
rep(... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typename T1, typename T2>
bool ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,x;
string s;
cin>>n>>x;
cin>>s;
for(ll i=0;i<n;i++)
{
if(s[i]=='x')
{
if(x!=0)
{
x--;
}
}
else
{
x++;
... |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
const double Pi=3.141592653589793;
int main(){
int n;
cin>>n;
double x[2],y[2];
for(int i=0;i<2;i++){
cin>>x[i]>>y[i];
}
double mx=(x[0]+x[1])/2;
double my=(y[0]+y[1])/2;
x[0]-=mx,y[0]-=my;
double ... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<LL,LL> pii;
typedef pair<LL,pii> ppi;
typedef pair<pii,pii> ppp;
#define FOR(i, n) for(int i = 1; i<=n; i++)
#define F0R(i, n) for(int i = 0; i<n; i++)
#define mp make_pair
#define pb push_back
#define f first
#defin... |
#include <stdio.h>
#include <vector>
#define cm (1 << 17)
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread(cn, 1, cm, stdin);
ci = cn;
}
return *ci++;
}
inline int getint() {
int A = 0;
while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
return A;
}
int main()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0 ; i < (n) ; i++)
#define rep1(i,n) for(int i = 1 ; i <= (n) ; i++)
#define rrep(i,n) for(int i = (n) - 1 ; i >= 0 ; i--)
#define rrep1(i,n) for(int i = (n) ; i > 0 ; i--)
#define MOD 1000000007
using ll = int64_t;
using P = pair<int, int>;
usi... |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using T = tuple<int,int,int>;
using P = pair<int,int>;
const ll SEG_LEN = (1 << 20);
ll seg[SEG_LEN * 2];
void update(... | #include<bits/stdc++.h>
using namespace std;
// #pragma GCC target ("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC target("fpmath=387") //ex... |
#include<iostream>
using namespace std;
main(){int T;cin>>T;for(int i=0;i<T;i++){int N;cin>>N;char ch;for(int j=0;j<3;j++){for(int k=0;k<2*N;k++)cin>>ch;}cout<<0;for(int k=0;k<N;k++){cout<<1;}for(int k=0;k<N;k++){cout<<0;}cout<<endl;}} | #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<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define M1 1000000007
#define M2 998244353
#define INF 1e18
#defin... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include... |
#include <bits/stdc++.h>
using namespace std;
int ans;
int A[25];
void solve(int pos, int currOr, int currXor)
{
if (pos < 0)
{
ans = min(ans, (currOr ^ currXor));
return;
}
solve(pos-1, (currOr | A[pos]), currXor);
solve(pos-1, A[pos], (currXor ^ currOr));
}
int main() {
... | #include <iostream>
#include <vector>
#include <climits>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
int res = INT_MAX;
rep(bit, (1<<(n-1))){
vector<int> buf(n, 0);
int count = 0;
... |
#include <bits/stdc++.h>
using namespace std;typedef long long ll;typedef long double ld;typedef pair<int, int> pii;typedef vector<int> vec;typedef vector<pii> vecp;typedef vector<string> vecs;
#define dbg(a) cerr << '[' << a << ']' << '\n'
#define pb(item) push_back(item);
#define rep(i,l,n) for(int i = l; i < n; i++)... | #include<iostream>
#include<iomanip>
#include<fstream>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<cstdio>
#include<map>
#include<queue>
#include<vector>
#include<utility>
#include<ostream>
#include<istream>
#include<stack>
typedef long long ll;
using namespace std;... |
#include<iostream>
#include<iomanip>
#include<limits>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<tuple>
#include<cmath>
#include<unordered_set>
#include<iterator>
#include<sstream>
#include<set>
#include<cstring>
using namespace std;
#define endl "\n"
typedef long long ll;
typedef s... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(a) (a).begin(), (a).end()
using namespace std;
int main(void) {
vector<int> v(4);
rep(i, 4)
cin >> v[i];
sort(all(v));
cout << v[0] << endl;
return 0;
} |
#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 <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;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define fi first
#define se second
#define endl '\n'
// #define... | #include <iostream>
using namespace std;
bool used[200500];
int m,n,i;
int main() {
cin>>n;
while (n--) {
cin>>i;
used[i]=true;
while(used[m]) m++;
cout<<m<<endl;
}
return 0;
} |
#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 int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).end(... | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define forn(i, n) for(int i = 0 ; (i) < (n) ; ++i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(),a.end()
#define pw(x) (1LL<<(x))
using namespace std;
typed... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_sta... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
std::vector<std::vector<int> > hen;
std::vector<int> dist;
std::vector<int> stack;
std::vector<int> stack_res;
void dfs0(int i, int prev, int goal = -1) {
stack.push_back(i);
if (i == goal) stack_res = stack;
for (auto j : hen[i]) if (j != ... |
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
class UnionFind {
public:
explicit UnionFind(int N) : root(N, -1), size(N, 1) {}
int getRoot(int u){ return root[u] == -1 ? u : root[u] = getRoot(root[u]); }
int getSize(int u){ return size[getRoot(u)]; }
bool same(int a, int... | #include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vect... |
#include "bits/stdc++.h"
#pragma GCC optimize "trapv"
#define int long long
#define For(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define endl "\n"
#define F first
#define S second
#define drink_boost ios_base::sync_with_stdio(false);cin.tie(NULL)
#define all(v) v.begin(),v.end()
#define TEST_CASE int t;c... | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#in... |
#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 ll long long
#define pb push_back
#define ff first
#define ss second
#define MO 1000000007
#define mem(a,s) memset(a,s,sizeof(a))
#define IOS ios_base::sync_with_stdio(0); cin.tie(NULL);
#define lop(i,s,e) for(int i=s;i<e;i++)
#define lopi(i,s,e) for(int i=s;i>=e;i--)
#define prina(a,n) ... |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n, p;
cin >> n;
vector<long long int>v, somme, somme2;
somme2.push_back(0);
while(cin >> p){
v.push_back(p);
somme.push_back(v.back()+ (somme.size()!=0? somme.back(): 0));
}
long long int mx = 0;
long long int ans = 0;
fo... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
const int MaxA = 200;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> d(MaxA* 2 + 1);
ll ans = 0;
f... |
#include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, a, b) for (ll i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<... |
#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 ll int
#define ull unsigned long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
const ll maxn =7e5+100;
const ll mod=1e9+7 ;
const ll base=2e18;
vector<ll> adj[maxn];
ll col[23];
ll n;
bool dd[23];
namespac... |
// g++ A.cpp -std=c++14 -I . && ./a.out
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint = modint998244353;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < (int)(b); i++)
#de... | #include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#define MAXN 200005
#define max_num 1000000
#define LL long long
using namespace std;
int n, m;
int l[MAXN], r[MAXN];
int main()
{
while(cin >> n >> m)
{
if(m < 0 || m == n || (m == n - 1 && n - 1 > 0))
{
... |
#ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_ }
#define MY_DEBUG(s) s
#define MY_IS_DEBUG (true)
#else
#define MY_NAMESPACE(ns)
#define MY_NAMESPACE_
#define MY_DEBUG(s)
#define MY_IS_DEBUG (false)
#endif
#include <algorithm>
#include <bitset>
#include <cmath>
#in... | /* in the name of Anton */
/*
Compete against Yourself.
Author - Aryan (@aryanc403)
Atcoder library - https://atcoder.github.io/ac-library/production/document_en/
*/
#ifdef ARYANC403
#include <header.h>
#else
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx... |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 18;
const int inf = 1e9;
int n, m;
bool g[maxn][maxn];
bool f[1<<maxn]; //true if mask is a clique
int dp[1<<maxn]; //min CC'... | /*________________________________Author : mr_robot101_________________________________*/
#include <bits/stdc++.h>
using namespace std;
/*_____________________________________________________________________________________*/
#define gc getchar_unlocked
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n... |
#include <iomanip>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#define rep(i,n) for (int i=0;i<n;i++)
#define DENOM 1000000007
using namespace std;
using ll = long long;
int main(){
int n ;
double x = 0;
cin >> n ;
for (int i=1;i<n;i++) {
double p =... | #include <bits/stdc++.h>
#define rep(i, start, end) for(int i = start; i < end; i++)
using namespace std;
typedef long long ll;
int main(void){
ll n, m;
int c = 0;
string s;
cin >> n;
rep(i, 1, 1e6){
s = to_string(i);
m = stoll(s + s);
if(m <= n)
c++;
else
break;
}
c... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
// Your code here!
std::vector<int> a(3);
rep(i,a.size()) {
std::cin >> a.at(i);
}
int tmp=0;
rep(i,a.size()) {
for(int j=i+1;j<a.size();j++) {
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n;
char s[maxn];
int main()
{
scanf("%d", &n);
scanf("%s", s + 1);
if(s[1] != s[n])
{
puts("1");
return 0;
}
int l = 1, r = n;
while(l <= n && s[l] == s[1]) ++l;
while(r >= 1 && s[r] == s[n]) --r;
if(l == n + 1) { puts("-1"); retu... |
#include<bits/stdc++.h>
using namespace std;
int a,b;
unordered_map<int,int> mp;
int main(){
cin>>a>>b;
for(int i=a;i<=b;i++){
for(int j=1;j*j<=i;j++){
if(i%j==0){
mp[j]++;
mp[i/j]++;
}
}
}
int m = (b-a)+1;
while(m--){
... | #include <iostream>
#include <algorithm>
bool check(int p, int a, int b)
{
int under = (a - 1) / p;
int top = b / p;
if (top - under >= 2)
return (true);
return (false);
}
int main(void)
{
int a, b;
int ans = 0;
std::cin >> a >> b;
for (int p = 1; p <= b; p++)
{
if (check(p, a, b))
ans = std::max(ans... |
/*
Created by : imay_10
" It won't be EASY, but I'll make it "
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
// Utility for fast exponentiation
ll mpow(ll a,ll b,ll m){
ll res=1;
//a%=m;
... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(... |
#include <bits/stdc++.h>
using namespace std;
typedef long double LD;
typedef pair<LD, LD> PDD;
const LD eps = 1e-6;
int main()
{
int n, m, k; scanf("%d %d %d", &n, &m, &k);
vector<int> a(k + 1), vis(n + 1);
for (int i = 1; i <= k; i++)
scanf("%d", &a[i]), vis[a[i]] = 1;
vector<PDD> suf(n + m + 1, {0.0, 0.... | #include <iostream>
#include <stack>
#include <string>
#include <vector>
#pragma warning(disable:4996)
using namespace std;
#define int long long
stack<int>way;
int N,M,K;
double ex[200100];
double ep[200100];
double epex[200100];
vector<pair<int, int>>x;
signed main()
{
ios_base::sync_with_stdio(false);
cin >> N>>M ... |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rrep(i,n) for(int i=((n)-1);i>=0;--i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define mod 1000000007
using namespace std;
typede... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(... |
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
#include<ctime>
#include<cstdlib>
#include<fstream>
#define INF long long (int)1e18+1
#define MAX 50000001
#define rep(i,n,m) for(int ... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int ans=0;
for(int i=0; i<9; i++){
if(S.at(i)=='Z' && S.at(i+1)=='O' && S.at(i+2)=='N' && S.at(i+3)=='e'){
ans++;
}
}
cout << ans;
} |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
const long long MAX_B = log2(n);
long long min_abc = n;
for(long long b = 0; b <= MAX_B; ++b) {
long long... | #include<bits/stdc++.h>
using namespace std;
int main(){
string a;
cin>>a;
int index=0;
int flag=0;
for(int i=0;a[i]!='\0';i++){
if(a.at(i) == '.'){
index=i;
flag=1;
}
}
if(!flag)cout<<a<<endl;
else{
for(int i=0;i<index;i++){
c... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
t... | #include <bits/stdc++.h>
using namespace std;
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)
#define REP(i, n) rep(i, 0, n)
#d... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
const int N =3e5+5;
const int MOD = 1e9+7;
const ll M = 1e18;
ll qpow(ll a, ll b, ll m)
{
ll ans=1;
whi... | #include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define inf 9223372036854775807
#define F first
#define S second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll,ll>
#define vll vector<ll>
#define umap unordered_map<ll,ll>
#define lpq priority... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
int main() {
int a, b;
scanf("%d %d", &a, &b);
int ans;
if (a+b>=15 && b>=8) {
ans = 1;
}
else if (a+b>=10 && b>=3) {
ans = 2;
}
else if (a+b>=3) {
ans = 3;
}
else {
ans = 4;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0; i<ll(n); i++)
#define FOR(i,m,n) for(ll i=ll(m); i<ll(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VP vector<pair<ll,ll>>
#define VPP vector<pair<int,pair<int,int>>>
#define VLL vecto... | /*
AUTHOR: nit1n
CREATED: 12.04.2021 22:51:16
*/
#include<bits/stdc++.h>
#define int long long
using namespace std ;
const int N = 1e5 +5 ;
vector<int> gr[N] ;
vector<int> a(N) , ans;
void dfs(int i , int prev , map<int,int>& mp){
if(mp[a[i]] == 0){
ans.push_back(i) ;
}
mp[a[i]]++ ;
for(auto & j... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 998244353;
long long modpow(long long a, long long x) {
long long tmp = x;
long long val = a;
long long ret = 1LL;
while (tmp>0) {
if (tmp%2 == 1) ret = ret*val%mod;
val = val*val%mod;
tmp /= 2;
... | #include<cstdio>
#include<algorithm>
using namespace std;
#define ll long long
const int maxn=2e5+5;
const ll mod=998244353;
int f[maxn],sz[maxn];
int find(int x)
{
return f[x]==x?x:f[x]=find(f[x]);
}
bool merge(int u,int v)
{
int u_=find(u),v_=find(v);
if(u_==v_) return false;
if(sz[u_]>sz[v_]) swap(u_... |
#include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 61;
const int NIL = -1;
const int MAX = 10000;
const int MOD = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | /*ver 7*/
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
template <typename T>
class BIT {
public:
BIT(int n) : N(n), A(n + 1, 0) {}
T sum(int i) {
T res = 0;
while (i... | #include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + strin... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <unordered_set>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <climits>
#include <random>
#include <queue>
#include <array>
//#include <fstream>
/*#include <cstdio>
#include <ctime... | #include <iostream>
#include <cmath>
#include <stdio.h>
using namespace std;
int main()
{
int N;
cin >> N;
unsigned long long chebyshev_distance = 0;
unsigned long long sum = 0;
unsigned long long sum2 = 0;
for(int i = 0; i < N; i++) {
long long x;
cin >> x;
if(x < 0) {... |
///* ***Bismillahir Rahmanir Rahim*** */
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dl;
typedef unsigned long long ull;
#define pb push_back
#define PB pop_back
#define nn "\n"
#define O_O ... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <list>
#include <cassert>
#include <numeric>
#include <cstdint>
#include <queue>
#include <deque>
using ll = long long;
using ld = long double;
using namespace std;
using Graph = ve... |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <stack>
#include <queue>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
#d... | #include "bits/stdc++.h"
using namespace std;
#define int long long int
int32_t main()
{
int a,b,c;
cin>>a>>b>>c;
if(c==1)
swap(a,b);
if(a>b)
{
if(c==1)
{
cout<<"Aoki"<<endl;
}
else
{
cout<<"Takahashi"<<endl;
}
}
el... |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = v... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
#define MAX_N 10000
using namespace std;
long long MOD = 1000000007*1000000007;
long long fact[MA... |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define... | #include<bits/stdc++.h>
using namespace std;
int n,maxn,res,a[105];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=2;i<=1000;i++){
int tmp=0;
for(int j=1;j<=n;j++){
if(a[j]%i==0){
tmp++;
}
}
if(tmp>maxn){
maxn=tmp;
res=i;
}
}
cout<<res;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
int a, b;
cin >> a >> b;
int ans = a + b;
if (ans >= 15 && b >= 8) {
cout << 1 << endl;
}
else if (ans >= 10 && b >= 3) {
cout << 2 << endl;
}
else if (ans >= 3) {
cout << 3 << endl... | #include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define po pop_back
#define mp make_pair
#define fi first
#define se second
#define LLM LONG_LONG_MAX
#define LLm LONG_LONG_MIN
#define hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
using namespace std;
bool comp(... |
#include <sys/time.h>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)... | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...)name
#define _rep(i,n)repi(i,0,n)
#define repi(i,a,b)for(int i=int(a),i##_len=(b);i<i##_len;++i)
#define MSVC_UNKO(x)x
#define rep(...)MSVC_UNKO(_overload3(__VA_ARGS__,repi,_rep,_rep)(__VA_ARGS__))
#define all(c)c.begin(),c.end()
#define write(x)cout<<(x)<<'... |
/**
* โโโโโโ โโโโโโโ โโโโโโโ โโโ โโโโโโโโ
* โโโโโโโโโโโโโโโโ โโโโโโโโโโโ โโโโโโโโ
* โโโโโโโโโโโ โโโโโโโโโโโ โโโโโ
* โโโโโโโโโโโ โโโโโโโ โโโ โโโโโ
* โโโ โโโโโโโโโโโโโโ โโโ โโโโโโโโโโโโโโโโ
* โโโ โโโ โโโโโโโโโโ โโโ โโโโโโโโโโโโ... | //Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i,n) for (ll i = 0; i < n; ++i)
#def... | #include<bits/stdc++.h>
using namespace std;
#define MAXN 5005
#define MOD 998244353
#define LL long long int
LL fac[MAXN],rec[MAXN];
LL ans;
int n,m,bitw[MAXN],col[MAXN],bitcnt;
LL dp[5005];
LL qpow(LL a,LL b)
{
LL res=1;
while(b)
{
if(b&1)res=res*a%MOD;
a=a*a%MOD;
b>>=1;
}
... |
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
// using namespace atcoder;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}e... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
LL n,t;
LL calc(LL sum)
{
LL lb=sum-n,ub=su... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.