code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
#include<unordered_map>
#in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)
typedef pair<int,int> pii;
#define forr(i,x,n) for(int i = n;i >= x;--i)
#define Angel_Dust ios::sync_with_stdio(0);cin.tie(0)
#define x first
#define y second
const int N = 105,MOD = 1e9+7;
pii edges[N * ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template<class T> bool chmin(T& a,T b){if(a>b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b){if(a<b) {a = b; return true;} return fa... | #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;
typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> oset;
#define sim template < class c
#define ris return * this... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=105;
int n,m,k;
ll f[N][N*N*N];
ll pre[N*N*N];
int main() {
cin>>n>>k>>m;
const int mod=m;
f[0][0]=1;
int sum=0;
for(int i=1;i<=n;i++) {
sum+=i*k;
for(int s=0;s<=sum;s++) {
/*
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k,n,m,i,j,cur;
cin >> k >> n >> m;
vector<long long> a(k),b(k);
set<pair<long long,long long>> s;
pair<long long,long long> p;
cur=0;
for(i=0; i<k; i++){
cin >> a[i];
b[i]=((a[i]*m+(n-1))/n);
cur+=b[i];
p.first=b[i]*n-a[i]*m; p.second=... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N,M;
cin >> N >> M;
vector<int>A(N);
vector<int>B(M);
for(int i = 0; i < N; i++){
cin >> A.at(i);
}
for(int i = 0; i < M; i++){
cin >> B.at(i);
}
vector<int>cnt(1001);
for(int i ... | #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 INF 1001001001
#define MOD 1000000007
using ll = int64_t;
using ... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... | #include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
typedef long long int ll;
using namespace std;
#define maxn 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
const int mm=2e5+100;
ll d[mm];
ll vis[100000];
int main()
{
ll n,m,i,j,t,a,... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
#define iter(it, s) for (auto it = s.begin(); it != s.end(); it++)
... | /**
* @author : xnyuq
* @created : 24/05/2021 19:56:30 +07
* @filename : abc202d
*/
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#includ... |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <sstream>
#include <queue>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, s, n) for... |
#include<bits/stdc++.h>
using namespace std;
struct node{long long x,y;}f[200002];
long long n,a=0,b=0,cnt=0;
bool cmp(node x,node y){return 2*x.x+x.y>2*y.x+y.y;}
int main(){
scanf("%lld",&n);
for(int i=0;i<n;++i)scanf("%lld%lld",&f[i].x,&f[i].y),a+=f[i].x;
sort(f,f+n,cmp);
while(b<=a){b+=f[cnt].x+f[cnt... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define F(i,a,b) for(int i=(int)(a);i<=(int)(b);i++)
#define R(i,b,a) for(int i=(int)(b);i>=(int)(a);i--)
#define endl "\n"
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define out(x) cout<<x<<endl,exit(0)
#define pii pair<int,int>
#defin... |
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define mod 1000000007
#define Fast ios_base::sync_with_stdio(false);cin.tie(0);
#define rep(i, x, y) for (lol i = x; i <= y; i++)
#define repi(i, x, y) for (lol i = x; i >= y; i--)
#define TC(x) sci(x); while (x--)
#define sc... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
string S;
cin >> S;
for(int i=0; i<S.length(); i+=2) { if(isupper(S[i])) { cout << "No"; return 0; } }
for(int i=1; i<S.length(); i+=2) { if(islower(S[i])) { cou... | #include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
cout << n-1;
} |
#include <iostream>
#include <tuple>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<std::tuple<int, int>> intervals;
for (int i = 0; i < N; ++i) {
int t, l, r;
std::cin >> t >> l >> r;
l = 2 * l + (t >= 3);
r = 2 * r - (t % 2 == 0);
intervals.emplace_back(l, r);
}
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
template <class T>
bool chmax(T& a, const T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T& a, const T b) {
if (b < a) {
... |
#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
int a, b, c;
void print()
{
a < b ? cout << "<" : a == b ? cout << "="
: cout << ">";
}
int main()
{
cin >> a >> b >> c;
if (c%2==0)
{
a = abs(a);
b = abs(b);
print(... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(i, j, n) for (ll i = j; i < (n); i++)
#define Repr(i, j, n) for (ll i = j; i >= (n); i--)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
template<cl... |
#include<bits/stdc++.h>
using namespace std;
#define _ 0
const long long maxn=1e5+5;
const long long inf=0x7fffffff;
long long n,a[maxn],minv=inf;
void dfs(long long k,long long s1,long long s2)
{
if(k==n+1)
{
minv=min(minv,s1^s2);
return ;
}
dfs(k+1,s1|a[k],s2);
dfs(k+1,a[k],s1^s2);
}
int main(){
ios::syn... | /**
* author: MKutayBozkurt
* created: 01.04.2021 08:26:08
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int N; cin >> N;
vector<long long> A(N); for (auto &x : A) cin >> x;
long long ans = 1e18;
for (int i = 0; i < (1 << N); i++) {
long long ored... |
#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define eps 1e-9
#define rep(i,l,r) for(int i=l;i<r;i++)
#define rrep(i,r,l) for(int i=r-1;i>=l;i--)
typedef long long ll;
const int maxn=3e5+5;
int n,q,b[maxn];
struct Node{
int l,r,val,mid;
void update(int x){
val^=x;
}
}a[maxn<<2];
void push_up... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
vector<vector<int>> cyancheck(51, vector<int>(51));
cyancheck.at(x).at(y) = 1;
int k = 2;
vector<vector<int>> cyanmond(51, vector<int>(51));
for (int i = 0; i < 50; i++) {
for (int j = 0; j < 50; j++) {
cin >> c... |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<int> va(n);
for (int i = 0; i < n; ++i) {
cin >> va[i];
}
int max_p = 3 * pow(10, 5);
vector<int> cnts(max_p, 0);
int cur = 0;
vector<int> ans;
for (int i = 0; i < n; ++i) {
cn... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; typedef long double ld; typedef vector <int> vi; typedef vector <ll> vll; typedef vector <string> vS; typedef vector <vector <int>> vv; typedef map<int, int> mi; typedef map<string, int> ms; typedef map<char, int> mc; ty... |
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int a[105];
long long E[105][105],A[105][105],B[105][105],C[105][105];
long long qpow(long long x,int n){
long long ans=1;
for(;n;n>>=1,x=x*x%mod)if(n&1)ans=ans*x%mod;
return ans;
}
void mul(long long a[105][105],int n){
for(int i=1;i<=n;i++){
for(... | #include<bits/stdc++.h>
// #pragma optimize("-O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,avx,mmx,tune=native")
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define INF 1e9
//#def... |
//#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define pb push_back
#define INF 2e9
using namespace st... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)... |
#include "bits/stdc++.h"
#include<sstream>
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const long long inf = 1e18;
const ll INFL = 1e18;
const ll MOD = 1e9 + 7;
int digit(ll x) {
int digits = 0;
... |
#include<bits/stdc++.h>
// 数値型
using ll= long long;
using ull= unsigned long long;
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
//イテレーション
#define REP(i,n) ... |
#include<bits/stdc++.h>
using namespace std;
///******************************** C o n t a i n e r ********************************///
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vii;
typed... | #include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
const ll N=1000006, INF=1e18, MOD=998244353;
int n, k;
ll ans;
int main(){ios_base::sync_with_stdio(false), cin.tie(0);
cin>>n>>k;
for (int... |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); +... | #include <bits/stdc++.h>
using namespace std;
// For Policy Based DS
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
// ---------------------------------------
#define endl "\n"
#define ff first
#define ss second
#define int... |
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<int,int>
int main() {
ll N; cin >> N;
int cnt = 0;
for(ll i=1;i*(i-1)<2*N;i++){
ll a = N-i*(i-1)/2;
if(a%i==0) cnt++;
}
cout << 2*cnt << endl;
} |
#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>
using namespace std;
using ll = int64_t;
using P = pair<int,int>;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define INF 1e9
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<max(a,b)-min(c,d)<<endl;
}
|
#include <bits/stdc++.h>
#define Rep(i,n) for(int i=0;i<n;i++)
#define Repr(i,n) for(int i=n;i>=0;i--)
#define For(i,m,n) for(int i=m;i<n;i++)
#define All(v) v.begin(),v.end()
#define Mod (ll)(1e9+7)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<long long> vl;
const int Inf = INT_MAX... | #include<iostream>
#include<sstream>
#include<iomanip>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<numeric>
#include<queue>
#define rep(i,p) for(long long int i=0;i<p;i++)
#define reep(i,p) for(long long int i=1;i<=p;i++)
#define ll long long
#define ... |
#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<ve... | #include <bits/stdc++.h>
#include <chrono>
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_... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#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(x... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#inc... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vt vector
#define all(x) x.begin(), x.end()
#define trav(i, x) for(auto &i : x)
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
void solve() {
int n; scanf("%d", &n);
vector<int> a(n), b(n... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
cout << a*d-b*c;
return 0;
} |
#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 ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define reset(x) memset(x... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
//xd
int main(){
long long int n;
cin>>n;
map<long long int,long long int> frecuencias;
vector<int> actualnum;
int actual_size=-1;
while(n--)
{
long long int temp;
cin>>temp;
if(!(frecuencias.find(temp... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main(){
fastio
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll sum = a+b+c+d;
if(sum%2){
cout<<"No\n";
}
else{
bool done = false;
for... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<set>
#include<cstdlib>
#include<cmath>
#include<numeric>//fill
#include<iomanip>
#include<functional>//https://cpprefjp.github.io/reference/functional/function.html
#include<cstdlib>//https://cpprefjp.githu... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... | #pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,sse4.1,sse4.2,popcnt")
#include<bits/extc++.h>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
const int maxn = 1<<11, mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll n; cin>> n;
for(int i=1; ; ++i){
if(stoll(to_string(i)+to_string(i))>n){
cout<<i-1<<endl;
break;
}
}
return 0;
}
| #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 all(nums) nums.begin(), nums.end()
#define allr(nums) nums.rbegin(), nums.rend()
#define len(a) int((a).size())
typedef long long int ll;
typedef tree<ll, null_ty... |
#include<bits/stdc++.h>
#define ll long long int
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpii vector< pii >
#define vpll vector< pll >
#define mpii map<int,int>
#define mpll map<ll,ll>
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define s(v) v.size()
#define test ll t;cin>>t;while(t--)
#de... | //g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#inclu... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | using namespace std;
#include <bits/stdc++.h>
typedef long long ll;
map<int64_t, int> prime_factor(int64_t n)
{
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++)
{
while (n % i == 0)
{
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
... |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <bits/stdc++.h>
using namespace std;
#define rep2(i,j,n) for (int i=j; i <=(int)(n); i++)
int a[100010];
int main() {
int n,m,p,q;
cin >> n;
rep2(i,1,n)a[i]=1;
if(n==1){
cout << 1 << endl;
return 0;
}
m=n/2+1;
rep2(i,1,m){
p=i+i;
q=a[i];
while (p<=n) {
if (a[p]==q)a[p]++;
p+=i;
}
... |
#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;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... |
#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;
long long b,c,ans;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>b>>c;
if(b<0){
ans+=min((c-1)/2,-b-1);
if(c>=2)
ans+=min((c-2)/2,-b-1);
ans+=c/2+1;
ans+=(c-1)/2+1;
if(b<=(c-1)/2)ans++;
}else{
ans+=min(c/2+1,b);
if(b>0)
... |
#include <bits/stdc++.h>
using namespace std;
int main () {
int a;
cin >> a;
if (a < 100) cout << 1 << endl;
else if (a % 100 == 0) {
a /= 100;
cout << a << endl;
}
else {
a /= 100;
a++;
cout << a << endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int k; scanf("%d",&k);
int ans=0;
for(int a=1;a<=k;a++){
for(int b=1;b<=k/a;b++){
ans+=k/a/b;
}
}
printf("%d\n",ans);
return 0;
}
|
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios_base::sync_with_stdio(false); cin.tie(0);
#define trav(x,a) for (auto& x: a)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1000000007;
int main() {
ll n;
cin >> n;
ll a = 0, b = 0, c = 0;
ll result = LONG_LONG_MAX;
while (n > (1ll << b)) {
a = n / (1ll << b);
c = n % (1ll << b);
result = mi... |
//clear adj and visited vector declared globally after each test case
//check for long long overflow
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Incase of close mle change language to c++17 or c++14
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include "debug.hpp"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
ll MOD = 1e9 + 7;
ll kai(ll n) {
if (n == 0) return 1;
ll ans = 1;
for (ll i = 1; i <= n; i++) {
... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long; using ull = unsigned long long;
// #define int ll
// #define DEBUG 42
inline void nprint(){}
template <class Head, class... Tail>
inline void nprint(Head &&head, Tail &&... tail) {
cout << head ... | #include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
#include <string>
#include <numeric>
#include <iterator>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
template <class T>
ostream &operator<<(ostream &o, const vector<T> &v)
{
o << "{";
for (int i = 0; i <... |
#include "bits/stdc++.h"
using namespace std;
#ifdef LOCAL
#include "debug.h"
#define input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#else
#define debug(...) 4
#define input 4
#endif
using ll = long long;
const int mod = 1e9 + 7;
const int N = 2e6 + 5;
int dp[12][12];
/... |
// C++ (GCC9.2.1) AtCoder
/*
Ctrl+Option+N で 実行
*/
#include <bits/stdc++.h>
#define INF 100000000000
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl;
typedef long long ll;
using namespace std;
int main() {
ios... |
#include <map>
#include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long ll;
int n;
int o[300111];
map<ll, ll> mp;
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &o[i]);
}
for (int i = 1; i <= n; i += 2) {
o[i] *= -1;
}
ll s = 0;
for (int i = 0; i <= n; i++... | #include <bits/stdc++.h>
//#include <atcoder/modint>
//using namespace atcoder;
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a... |
#include <bits/stdc++.h>
using namespace std;
const int N=2e6+50;
int n,m;
int a[N],b[N];
int mex;
void add(int i){
b[a[i]]++;
// 变大根本没意义啊
// if(a[i]==mex){
// mex=a[i]+1;
// TODO tle了
// while(b[mex]){
// mex++;
// }
// }
}
void del(int i){
b[a[i]]--;
if(b[... | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define ld long double
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define mkpr make_pair
#define fi(i,a,b) for ... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n,m,k,ans=0;
cin>>n>>m;
vector<vector<ll>> a(m,vector<ll>(2));
vector<ll> c(n+1,0);
for(ll i=0;i<m;i++) cin>>a[i][0]>>a[i][1];
cin>>k;
vector<vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll LINF = 1e18;
template <class T>
void get_uni... |
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.cle... | #include<bits/stdc++.h>
#define db double
#define reg register
#define LL long long
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define ull unsigned long long
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(int i... |
#include <iostream>
using namespace std;
int hantei(long long n);
int main(){
long long t, n;
cin >> t;
for (int i = 0; i < t; i++){
cin >> n;
if (hantei(n) == -1) cout << "Odd" << endl;
else if (hantei(n) == 0) cout << "Same" << endl;
else if (hantei(n) == 1) cout << "Even" << endl;
}
retur... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll N;
scanf("%lld",&N);
vector<ll> x(N);
ll man = 0;
ll you = 0;
ll che = 0;
for(ll i = 0; i < N; i++) {
scanf("%lld",&x.at(i));
man += abs(x.at(i));
you += pow(x.at(i),2);
if(che < abs(x.at(i))) che = abs(x.at(i... |
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define setval(arr,v) memset(arr,v,sizeof(arr));
#define int long long int
#define mod 1000000007
#define v vector
#define umap unordered_map
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define fi first
#define se second
#define INF 1000... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const int inf = 1 << 30;
const ll infll = 1LL << 60;
const int mod = 1000000007;
const int mod9 = 998244353;
int main(){
int x, y;
cin >> x >> y;
if((x + y)%3 == 0){
cout << 0 << endl;
}
... |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
typedef long long int ll;
using ii= pair<ll,ll>;
#define fr(i,a,b) for(ll i=a;i<b;i++)
#define all(o) (o).begin(),(o).end()
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define ld long double
#define eps 0.00000000... | #include <bits/stdc++.h>
using namespace std;
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 i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
const ll INF = 1000000000000; //10^12:∞
const ll MOD = 1000000007; //10^9+7:合同式... |
#include <iostream>
using namespace std;
typedef long long ll;
const int MOD = 998244353;
struct Modint {
ll val;
Modint (ll _val = 0)
: val(_val % MOD) {}
Modint operator+ (Modint other) const {
return Modint(val + other.val);
}
void operator+= (Modint other) {
val += other.val;
val ... | //g++ 7.4.0
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N,M; cin>>N>>M;
string s[N];
ll ans = 1;
for(ll i=0;i<N;++i)
cin>>s[i];
for(ll ... |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
string s;
cin >> n >> s;
int ans = 0;
for (int i = 0; i < n; ++i) {
int c1 = 0, c2 = 0;
for (int j = i; j < n; ++j) {
if (s[j] == 'A')
c1++;
else if (s[j] == 'T')
c1--;
else if (s[j] == 'C')
c2++;
else
c2--;
if ... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
#define F first
#define S second
#de... |
#include<bits/stdc++.h>
using namespace std;
//#include <atcoder/lazysegtree>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#pragma region template
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
template <class T> using V = vector<T>;
template <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll mod=1e9+7;
#define rep(i,n) for (int i = 0; i < (n); i++)
int n,m,a[1100],b[1100];
vector <pair<int,char>> g[1100];
ll dp[1100][1100];
int main(){
cin >> n >> m;
rep(i,n)rep(j,n) dp[i][j]=mod;
rep(i,m){
... |
// 解き直し.
// https://atcoder.jp/contests/arc105/editorial/170
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b)... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll mod = 1e... |
#include <iostream>
#include <string>
int main()
{
std::string S, sub, bs = "";
std::cin >> S;
int i = 0;
while (!(S.substr(i, 1).empty()))
{
//std::cout << "a" << std::endl;
sub = S.substr(i, 1);
if (sub == "6")
{
sub = "9";
}
else if (sub... | #include<bits/stdc++.h>
#define N
using namespace std;
typedef long long ll;
string s;
int main(){
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]=='.')break;
cout<<s[i];
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <utility>
using ll = long long;
//#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
using namespace std;
ll n;
ll sum = 0;
ll m;
ll k;
ll minV;
int main() {
vector<ll> v;
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1e9+7;
const int MAXN = 2e5 + 7;
int k;
ll dp[MAXN][17];
// dp[i][j] = number of possibilities up to digit i
//smaller than n, nonzero, with j distinct digits
string n;
map<char,int> mp;
int mask = 0;
int main(){
for(char c='0'; c<='9... | #include <iostream>
#include <vector>
#define rep(i,n) for(int i=0;i<(int)(n); i++)
using namespace std;
using ll = long long;
const ll mod = 1e9+7;
const int N_MAX = 2e5+1;
const int K_MAX = 17;
ll dp[N_MAX][K_MAX][2];
int main()
{
string S; cin>>S;
int N = S.size();
int K; cin>>K;
vector<int... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll> ;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const ll inf=1LL<<60;
ll min(ll a,ll b){return a>=b ? b:a;}
ll max(ll a,ll b){return a>=b ? a:b;}
ll dist[20][20];
ll k;
... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
#include <assert.h>
using namespace std ;
using... |
#include<bits/stdc++.h>
using namespace std;
#define make_it_fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define ll long long
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1000000007;
// TODO: solve without editorial
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
a[1] = 6;
a[2] = 10;
a[3] = 15;
set<ll> s;
for (int i = 2; i * a[1] <= 10000; ++i) {... |
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int n, m;
vector<pair<int, char>> edges[1000];
int main()
{
cin >> n >> m;
for (int i = 0; i < n; ++i)
edges[i].clear();
for (int i = 0; i < m; ++i) {
int from, to;
char c;
cin >> fr... | #include<bits/stdc++.h>
#define fox(i,a,b) for(int i=a;i<=b;++i)
#define ll long long
using namespace std;
int _x, _f; char _c;
inline int rd() {
_x = 0, _f = 1, _c = getchar();
for (; !isdigit(_c); _c = getchar()) if (_c == '-') _f = 0;
for (; isdigit(_c); _c = getchar()) _x = _x * 10 + _c - '0';
return _f ? _x... |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i,n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout<... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
const int N = 2000 + 5, mod = 1e9 + 7;
int n, m, a[N][N], vis_r[N][N], vis_c[N][N];
void solve(int r, int c){
int cc = c;
while(cc <= m && vis_r[r][cc] == 0 && a[r][cc] != -1){
vis_r[r][cc] = 1;
cc++;
... |
#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//using namespace boost::multiprecision;
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, i... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
if(s3.size() < s1.size() || s3.size() < s2.size()){
cout << "UNSOLVABLE" << '\n';
return 0;
}
vector<int> v(10);
... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main (){
int n,k;
cin >> n >> k;
vector<vector<int>>T(n,vector<int>(n));
for(int i=0;i<n;i++)for(int j=0;j<n;j++){
cin >> T[i][j];
}
vector<int>index;
for(int i=0;i<n;i++)index.push_back(i);
int ans=0;
do{
int time=0;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,a,n) for(ll i=a;i<n;i++)
#define w(x) ll _t;cin>>_t;f(x,1,_t+1)
#define br cout<<"\n"
#define N 10000000
ll md=1e9+7,n;
ll h,w,m,k;
//l,d,r,u
ll x[]={0,1,0,-1};
ll y[]={1,0,-1,0};
ll mat[15][15];
bool isSafe(ll i,ll j){
return i>=0 &&... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
const int INF=1e8;
void chmin(int& x, int y){ x=min(x,y);}
int main(){
int n;
cin >... | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define PI (2*acos(0.0))
#define eps 1e-9
#define pb push_back
#define endl "\n"
#define watch(x) cout << (#x) << " is ... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#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 deb(x) cout << #x << " is " << x <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
float D,H;
cin >> N >> D >> H;
float d[N],h[N];
for (int i=0;i<N;i++){
cin >> d[i] >> h[i];
}
float ka,high,max=0;
for (int i=0;i<N;i++){
ka=abs(H-h[i])/abs(D-d[i]);
high=H-ka*D;
if (high>m... |
#include <iostream>
#include <vector>
#include <map>
#include <tuple>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
const int mod = 998244353;
int n;
int a[maxn];
int inv[maxn];
int f[maxn][maxn][maxn * maxn];
int binpow(int x, int y) {
int ans = 1;
while(y) {
if (y & 1) ans = 1ll * ans * x % mod;
y >>= 1;
x = 1ll * x * x % mod;
... |
#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;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://x...content-available-to-author-only...i.it/splitmix... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
int n = h*w;
vector<int> a(n);
for(int i = 0;i < n;i++){
cin >> a.at(i);
}
sort(a.begin(),a.end());
int ans = 0;
for(int i = 0;i < n;i++){
ans += a.at(i)-a.at(0);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
using namespace std;
void solve()
{
int N; cin>>N;
int a[N];
for(int i = 0; i<N; i++)
cin>>a[i];
int res = INT_MAX;
for(int i = 0; i<1<<(N-1); i++){
int ored = 0;
int xored = 0;
... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int N;
cin >> N;
int n = 0;
for (int i = 0; i < N; i++){
int ai;
cin >> ai;
if (ai > 10){
n += ai - 10;
}
}
cout << n << endl;
} |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
#define endl "\n"
#define INF 0x3f3f3f3f
#define eb emplace_back
#define mem(a, b) memset(a , b , sizeof(... | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
int main() {
const long long mod = 1e9+7;
int N;
cin >> N;
vector<vector<long long>> edge(N), weight(N);
for(int i = 1; i < N; i++) {
long long u, v, w;
cin >> u >> v >> w;
edge[--u].push_back(--v);
... |
#include <bits/stdc++.h>
#define int long long int
#define ll long long int
#define ld long double
#define getFaster ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define rep(i, init, n) for (int i = init; i < (int)n; i++)
#define rev(i, n, init) for (int i = (int)n; i >= init; i--)
#define MOD1 1e9 + 7
#define MO... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <cfloat>
#include <iomanip>
using namespace std;
long long X[200000];
long long Y[200000];
long ... |
#include <bits/stdc++.h>
#include <algorithm>
#include <unordered_map>
#define ull unsigned long long
#define int long long
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define frf(i, j, n) for (int i = j; i <= n; i++)
#define frd(i, n) for (int i = n; i >= 0; i--)
#define mp(i, j) make_pair(i, j)
... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unro... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<int,char>
#define Tp tuple<int,int,int>
using Graph = vector<vector<P>>;
int main(){
int N; cin >> N;
vector<ll> a; ll A;
rep(i,N){
cin >> A; a.push_back(A);
}
sor... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define int long long
#define sz(x) ((int)(x).size())
#define fill(x, value) memset(x, value, sizeof(x))
#define debug(x) cout << #x << " ------> " << x << "\n"
typedef pair<int, int> PII;
const int N = 3e3 + 3;
int arr[N], n, mod = 1e... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair <int, int>;
using pll = pair <ll, ll>;
#define FIO() ios_base::sync_with_stdio(0);cin.tie(NULL);
#define lson (node<<1)
#define rson ((node<<1)|1)
const int mx = 2e5 + 9;
ll t[4 * mx];
vector <int> min_row[mx];
void turn_on(int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define F0R(i, a, b) for (int i=a; i<(b); i++)
#define F0Rd(i,a,b) for (int i = (... |
#include <bits/stdc++.h>
#define N (int) 3005
#define MOD 998244353
using namespace std;
int n, k;
int dp[N][N];
int main () {
cin >> n >> k;
dp[0][0] = 1;
for (int i = 1; i <= n; i ++) {
for (int j = i; j >= 1; j --) {
dp[i][j] = (dp[i-1][j-1] + ((j<<1) <= i ? dp[i][j<<1] : 0)) % MO... | #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>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(int i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(int i=(r)-1;i>=(l);i--)
#define pb... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef pair <int,int> Pii;
#define reg register
#define mp make_pair
#define pb push_back
#define Mod1(x) ((x>=P)&&(x-=P))
#define Mod2(x) ((x<0)&&(x+=P))
#define rep(i,a,b) for(int i=a,i##end=b;i<=i#... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
const int nax = 2e5+5;
vector<int> edges[nax];
vector<int> value , d , par;
int cp = 1;
void dfs(int u , int p = -1 , int _d = 0){
par[u] = p;
d[u] = _d;
for(auto x : edges[u]){
if(x != p){
dfs(x,u,_d+1);
}
}
}
void d... |
#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;
int main(){
int n;
string s;
cin>>n>>s;
bool ng=false;
for(int i=0;i<n-1;i++){
if(i<n-2&&s[i]=='1'&&s[i+1]=='1'&&s[i+2]=='1')ng=true;
if(i<n-2&&s[i]=='0'&&s[i+1]=='1'&&s[i+2]=='0')ng=true;
if(i<n-1&&s[i]=='0'&&s[i+1]=='0')ng=true;
}
if(ng){
co... |
#include <bits/stdc++.h>
using namespace std;
template<class T, class U> T &ctmax(T &x, const U &y){ return x = max<T>(x, y); }
template<class T, class U> T &ctmin(T &x, const U &y){ return x = min<T>(x, y); }
constexpr pair<long long, long long> inv_gcd(long long a, long long b) {
a = a % b;
if(a < 0) a += b;
if... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <string>
#include <cassert>
using namespace std;
typedef long long llint;
const int INF = 0x3f3f3f3f;
const llint INFLL = 0x... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpi = vector<pii>;
using vpl = vector<pll>;
#define fi first
#define se second
#define pb push_... | #include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <numeric>
#include <map>
#include <queue>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for(int i = (k); i < (int)(n); i++)
using namespace std;
using ll = long long;
int mai... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); (i)++)
#define per(i, n) for (ll i = n - 1; i >= 0; (i)--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define ROF(i, a, b) for (ll i = (b) - 1; i >= (a); i--)
#define ALL(x) std::begin(x), std... | #include "bits/stdc++.h"
#pragma GCC optimize "trapv"
#define int long long int
#define For(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define endl "\n"
#define drink_boost ios_base::sync_with_stdio(false);cin.tie(NULL)
#define all(v) v.begin(),v.end()
#define TEST_CASE int t;cin>>t;while(t--)
#define debu... |
#include<iostream>
#include<iomanip>
using namespace std;
int sx,sy,gx,gy;
int main()
{
cin >> sx >> sy >> gx >> gy;
double d = (gx-sx)/(double)(-gy-sy);
cout << fixed << setprecision(10) << - d * sy + sx << endl;
return 0;
} | #include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::min;
int f[102][2];
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
f[a][1] = x;
for (int i = a + 1; i <= 100; ++i) {
f[i][0] = min(f[i - 1][0] + y, f[i-1][1] + x);
f[i][1] = min(f[i - 1][1] + y, f[i][0] + x);
}
f... |
#include <bits/stdc++.h>
int mod = 998244353;
long long modinv(long long dividend, long long divisor, long long modnum){
long long b = mod, u = 1, v = 0;
while (b) {
long long t = divisor / b;
divisor -= t * b; std::swap(divisor, b);
u -= t * v; std::swap(u, v);
}
u %= mod;
... | #include<iostream>
#include<vector>
using i64 = int64_t;
template<i64 MOD>
struct modint{
i64 val;
modint():val(0){}
modint(i64 v):val(v<0?(-v)%MOD:v%MOD){}
operator i64(){return val;}
constexpr modint &operator += (modint other){this->val+=other.val;if(this->val>=MOD)this->val-=MOD;return *this;}
constexp... |
#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(register int i=(a);i<=(b);i++)
#define per(i,a,b) for(register int i=(a);i>=(b);i--)
using namespace std;
const double eps=1e-14;
inline int read() {
register int x=0, f=1; register char c=getchar();
while(c<'0'||c>'9') {if(c=='-') f=-1; c=ge... | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <array>
#include <unordered_map>
#include<unordered_set>
#include <numeric... |
/*
Saturday 13 March 2021 05:35:07 PM IST
@uthor::astrainL3gi0N
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef std::vector<int> vi;
typedef std::vector<ll> vll;
typedef std::pair<int,int> ii;
#define debg(x) std::cerr<<(#x)<<" => "<<x<<'\n';
#define debgg(x,y) std::cerr<<(#... | #include <iostream>
using namespace std;
int main() {
int m;
while(cin>>m){
int h;
cin>>h;
if(h%m){
cout<<"No"<<endl;
}
else{
cout<<"Yes"<<endl;
}
}
} |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulflo... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
double a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a,a+n);
double x = a[n / 2] / 2;
double exp=0;
for(int i=0;i<n;i++){
exp += a[i] - min(a[i], 2*x);
}
exp /= n;
exp += x;
cout << fixed << setprecision(10) ... |
#include <bits/stdc++.h>
using namespace std;
////////////////////////////////////////////////////////////////////////////<editor-fold desc="macros">
//#define mod 9999991
long mod=9999991;
#define endl "\n"
#define long long long
#define all(v) (v).begin(),(v).end()
#define makeset(v) (v).resize(unique((v).begin(),(v... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const ul mod = 1000000007;
int main() {
ios_base::syn... |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... | #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 __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long u... |
#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
#define mod 1000000007
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define T(a) l... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define int ll
#define ld long double
#define reps(i,s,n) for(int i=(s);i<(int)(n);i++)
#define rep(i,n) reps(i,0,n)
#define rreps(i,s,n) for(int i=(int)(s-1);i>=n;i--)
#define rrep(i,n) rreps(i,n,0)
#defin... |
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << "[" << H << "]";
debug_out(T...);
}
#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", de... | #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>;
ll INF = 1e18;
int main() {
int n;
cin >> n;
vector<string> a;
set<string> b;
int count = 0;
rep(i,n){
string s;
cin >> s;
if(s[0] == '!'){
b.i... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i:x){cout << i << " ";} cout << endl;}
#define isin(x,l,r) ((l)<=(x) && (x)<(r))
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<typename T>bool chm... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long long N,ans;
string yn;
cin >> N;
ans = 0;
vector<int> A(N);
vector<int> B(N);
rep(i,N) cin >> A.at(i);
rep(i,N) cin >> B.at(i);
for(int j = 0; j < N; j++){
ans... |
#include<bits/stdc++.h>
using namespace std;
#define N 2005
#define db double
const db eps=1e-3,pi=3.14159265358979323846264337328451;
int n,t,j,i,cnt,tot,a[N],b[N],ans,c[N],d[N];
db alp,ang,dis;
struct dot{db x,y;}dt[N],R[N];
inline bool eq(db aa,db bb){
return aa<bb+eps&&bb<aa+eps;
}
inline bool cmp(dot aa,dot bb){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = b - 1; a <= i; i--)
ll MOD = 1000000007;
ll MOD2 = 998244353;
ll N;
vector<pair<ll, ll>> S, T;
vector<vector<vector<ll>>> rotation;
int main () {
cin >> N;
rep (i, ... |
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const long long MOD = 1000000007;
long ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ls rt<<1
#define rs rt<<1|1
const int N=1e2+5;
const int INF=0x3f3f3f3f;
const int mod=1e4+7;
const double eps=1e-9;
const double pi=acos(-1);
bool chk[N];
int cnt,p[N];
void prework(ll &ans){
chk[1]=1;
fo... |
#include <iostream>
#include <cstring>
using namespace std;
int main (){
string s;
cin >> s;
char c = s.front();
s.erase(0,1);
s.insert(s.end(), c);
cout << s;
return 0;
} | #include<bits/stdc++.h>
#define fox(i,a,b) for(int i=a;i<=b;++i)
#define ll long long
using namespace std;
int _x, _f; char _c;
inline int rd() {
_x = 0, _f = 1, _c = getchar();
for (; !isdigit(_c); _c = getchar()) if (_c == '-') _f = 0;
for (; isdigit(_c); _c = getchar()) _x = _x * 10 + _c - '0';
return _f ? _x... |
#include<bits/stdc++.h>
using namespace std;
using P = pair<int64_t,int64_t>;
const int MAX = (1<<19);
int64_t dp[MAX];
int main(){
int N, M;
cin >> N >> M;
vector<vector<P>> vec(N,vector<P>(0));
for(int i=0; i<M; i++){
int X, Y, Z;
cin >> X >> Y >> Z;
X--;
vec[X].push_back(P(Y,Z));
}
dp[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;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<(a)<<endl
#define dumparr(a,n) cerr<<#a<<"["<<(n)<<"]="<<(a[n])<<endl
#else
#define dump(a)
#define dumparr(a,n)
#e... |
#include <bits/stdc++.h>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define P pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define mp make_pair
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##... |
//Bismillahir Rahmanir Raheem
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#define sf(x) scanf("%d",&x)
#define sfl(x) scanf("%... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m,obs_n;
const int N=2e5+5;
set<int>row[N],col[N];
int seg[4*N],a[N];
void update(int index,int data,int segindex,int l,int r)
{
if(l==r){
seg[segindex]=data;
return ;
}
int mid=(l+r)/2;
if(index<=mid){
upd... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
#define INF LONG_MAX/3
#define bit(n) (1LL<<(n))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, c, n) for (ll i = c; i < (n); ++i)
#define yn(ok, True, False) if (ok) { p(True) } else {p(False)};
//以下debug用
#define d(x) cout << #x << "; " << x << endl;
#define p... | #include <iostream>
int main()
{
long long int N;
int K;
std::cin >> N >> K;
for (int i = 0; i < K; i++)
{
if (N % 200 == 0)
{
N /= 200;
}
else
{
N *= 1000;
N += 200;
}
}
std::cout << N << std::endl;
} |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 18;
int connect[N],f[1 << N];
int main()
{
int n,m;scanf("%d%d",&n,&m);
for(int i = 0;i < n;++i) connect[i] |= (1 << i);
for(int i = 0;i < m;++i)
{
int u,v;scanf("%d%d",&u,&v);
--u;--v;
connec... | #include<iostream>
#include<cstdio>
#include<algorithm>
#define re register
#define ri register int
#define For(i,a,b) for(ri i=a;i<=b;++i)
#define iFor(i,a,b) for(ri i=a;i>=b;--i)
#define File(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout);
#define gtch() (_p1==_p2&&(_p2=(_p1=buf)+fread(buf,1,1<<22,stdi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
string S, T;
int main()
{
ios_base::sync_with_stdio(0);
cin >> N >> S >> T;
ll ans = 0;
int pneed = 0;
int par = (S[0] - '0') ^ (T[0] - '0');
for (int i = 1; i < N; i++)
{
int ds = S[i] - '0', dt = T[i] ... | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define start ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define int ll
#define ls st<<1
#define rs st<<1|1
#define pii pair<int,int>
#define rep(z, x, y) for(int z=x;z<=y;++z)
#define repd(z, x, y) for(int z=x;z>=y;--z)... |
//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <string.h>
#include <assert.h>
#include <math.h>
#include <numeric>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <lim... | #include <bits/stdc++.h>
#define ll long long
#define int ll
#define count_one(a) __builtin_popcountll(a)
#define is_power_of_2(a) (a) & (a - 1) == 0
#define exit return 0
const double eps = 1e-10;
const double pi = acos(-1.0);
#define endl "\n"
#define flush() cout << flush
#define IOS ... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long double n;
cin >> n;
long double a, b, ansA = -1, ansB = -1;
for (long double i = 1;; i++) {
a = powl(3, i);
if (a > n) break;
for (long double j = 1;; j++) {
b = powl(5, j);
if (b > n) break;
if (a + b == n) {
... | #include <bits/stdc++.h>
#include<random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i... |
#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... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<... |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<vector>
#include<queue>
#include<algorithm>
#include<string>
#include<sstream>
#include<cctype>
#include<cmath>
#include<iomanip>
#include<map>
#include<stack>
#include<set>
#include<functional>
#define in(x) x=read()
#defi... | #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <set>
#include <limits>
#include <string>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <numeric>
#include <bitset>
using namespace std;
using ll = long l... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.