code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
long long int N, C_SUNUKE;
scanf("%lld %lld", &N, &C_SUNUKE);
getchar();
vector<pair<int,int>> events;
for (int i=0; i < N; i++) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
events.emplace_back(a-1, c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool ll_sqrt(ll x, ll& lower_bound, ll& upper_bound)
{
constexpr ll ll_max = numeric_limits<ll>::max();
bool first_boost = true;
lower_bound = 0;
upper_bound = x;
while (upper_bound - lower_bound > 1)
{
if (first_boost)
{
ll guess = ... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
//reverse(s.begin(),s.end())
ll gcd(ll a,ll b){
ll s=1,c;
while(a&&b){
if((~a&1)&&(~b&1))
a>>=1,b>>=1,s<<=1;
else if(~a&1)a>>=1;
else if(~b&1)b>>=1;
else if(a>b)a=a-b;
else c=b-a,b=a,a=c;
}... | /* Basic Inclusion */
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
/* definition */
#define rep(i, N) for (ll i = 0; i < (ll)(N); i++)
#define repp(i, N) for (ll i = 1; i <= (ll)(N); i++)
#define per(i, N) for (ll i = (ll)(N)-1; i >= 0; i--)
#define pper(i, N) for (ll i = (ll)(N); i > 0; i--)
#d... |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
typedef long long LL;
const int N = 200010;
int n;
char a[N], player[N];
int w[N];
int f[N][7];
int dfs(int u, int k)
{
if(f[u][k] != -1) return f[u][k];
if(u == n)
{
if(player[u] == 'T'... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
template <typename Arg1>
void prn(Arg1&& arg1) { cout<<arg1<<"\n";}
temp... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define mo... | #include<iostream>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<cstring>
#include<tuple>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
const int INF = 1 << 30;
int main(){
int a... |
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
#define MOD 1000000007
int main() {
int n = ri();
int a[n];
for (auto &i : a) i = ri();
std::sort(a, a + n);
int prev = 0;
int res = 1;
for (auto i : a) {
res = (int64_t) res * (1 + i - prev) % MOD;
prev = i;
}
printf("%d\n", r... | /*
author: madhav_1999 aka orthodoxparadox
18 April 2021 at 5:38 PM
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define dbl long double
#define int ll
#defin... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long N, A, P, X, s=0, a[100000];
cin>>N;
for(int i=0; i<N; i++)
{
cin>>A>>P>>X;
if(X>A)
{
a[i]=P;
}
else
{
a[i]=0;
}
}
for(int i=0; i<N; i++)
{
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int n;
cin>>n;
ll a[n];
ll p[n];
ll x[n];
for(int i=0;i<n;i++){
cin>>a[i]>>p[i]>>x[i];
}
ll ans = INT_MAX;
for(int i=0;i<n;i++){
int diff = x[i]-a[i];
if(diff>0){
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define ... | /*
* @date:2021-04-24 20:37:33
* @source:https://atcoder.jp/contests/abc199/tasks/abc199_f
*/
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 + 5;
const int MOD = 1e9 + 7;
int N, M, K;
long long A[MAXN];
int Num[MAXN];
struct Matrix {
long long A[MAXN][MAXN];
Matrix() {
memset(A... |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int N;
cin >> N;
int x0, y0, xn, yn;
cin >> x0 >> y0;
cin >> xn >> yn;
double pi_n = 2.0 * M_PI / static_cast<double>(N);
double cx = static_cast<double>(x0 + xn) / 2.0;
double cy = static_cast<double>(y0 + yn) / ... | #include <math.h>
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() { int N;
cin >> N ;
vector<int> X(N);
long long M=0, C=0;
long double U = 0.0;
for (int i = 0; i < N; i++){
int temp;
cin >> temp;
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define sp " "
void solve()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int arr1[n]={0};
for(int i=0;i<n;i++)
{
arr1[arr[i]-1]++;
}
for(int i=0;i<n;i++)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;
using vi = vector<int>;
using vl = vector<ll>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<typename T> using pqg = priority_queue<T, vector<T>, greater<T> >;
#define FOR(i, a, n) for(int i=(a); i<(n); ++i)
#d... |
#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()
using ll=long long;
ll d[1234567];
signed main(){
ll ans=0;
ll l,r;cin>>l>>r;
for(ll g=2;g<=r;g++){
d[g]++;
if(d[g]){
ll A=(r/g-(l-1)/g)*(r/g-(l-1)/g);
ans+=d[g]*A;
f... | //header{{{
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<complex>
#include<cstdio>
#define initdp(a,b) for(int i=0;i<=a;i++)for(int j=0;j<=b;j++)dp[i][j]=-1;
#define fi first
#define se second
#define pb push_back
#d... | #include <bits/stdc++.h>
#define INF LLONG_MAX/2
#define rep(i,n) for(int i = 0; i <(n) ; i++)
using namespace std;
typedef long long ll;
typedef __int128_t LL; //入出力では使えないことに注意が必要. 計算過程で途中64bitを超える可能性があるときに使う
typedef pair<ll,ll> pll;
#define all(x) (x).begin(), (x).end()
template<class T> inline bool chmax(T& a, T b)... |
//By Vasu Agrawal
#include<iostream>
#include<bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define pob pop_back
#define mk make_pair
#define fr first
#define sc second
#define pu push
#define ins insert
#define mod 1000000007
#define mem(a,val) memset(a,val,sizeof(a))
#define V(a) vector<a>
#define pp... | #include <cstdio>
using namespace std;
const int MAX_N = 5010;
int A[MAX_N], Prefix[4][MAX_N];
int N;
char GetChar()
{
char c;
do
c = getchar();
while (c == ' ' || c == '\n' || c == '\r');
return c;
}
void ReadA()
{
const char *s = "ATCG";
for (int i = 1; i <= N; i++)
{
char c = GetChar();
for (int j = ... |
#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>;
const int inf = 100100101;
const ll ll_inf = 1e9+7;
const int mod = 1000000007;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<... | #include <bits/stdc++.h>
#include <time.h>
#include <queue>
#define ll long long int
#define mp make_pair
#define ff first
#define ss second
#define forr(i,a,n) for(ll i=a;i<n;i++)
#define ford(i,a,n) for(ll i=n-1;i>=a;i--)
#define all(v) v.begin(),v.end()
#define testc ll ts;\
cin>>ts;\
... |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60; // 十分大きな値に
typedef long long ll;
typedef long double ld;
int main() {
ll N, K;
cin >> N >> K;
for (ll i=0; i<K; i++) {
if (N%200==0) {
N /= 200;
}
else {
N *= 1000;
N ... | #include "bits/stdc++.h"
using namespace std;
// 定義
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(x) (x).begin(),(x).end()
#define REP(i, n) for(ll i = 0 ; i < (ll)n ; ++i)
#define REPN(i, m, n) for(ll i = m ; i < (ll)n ; ++i)
#define VL vector<ll>
#define... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<endl
#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>
#include<map>
#include<queue>
#include<time.h>
#include<limits.h>
#include<cmath>
#include<ostream>
#include<iterator>
#include<set>
#include<stack>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define endl '\n'
#define rep(i,m,n) for(int i=m;i... |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define float double
#define pb emplace_back
#define mp make_pair
#define pii ... | // FIRST THINK THEN CODE.
#include<iostream>
#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<pll, null_type,less<>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#de... |
//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
/**#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unro... | #include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
#define endl "\n"
int main() {
int N;
cin >> N;
string S;
cin >> S;
string s = "110";
//べつしょりしたいね。
if (1 == N) {
if ('1' == S[0]) {
long long ans = (long long)2 * 10000000000;
... |
#include <cstdio>
int a,b;
int main() {
scanf("%d %d",&a,&b);
printf("%d",a/b);
return 0;
} | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<(2*a+100-b);
return 0;
} |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... | #pragma warning(disable: 4996)
#include <string>
#include <vector>
#include <iostream>
#include <cstdio>
#include <sstream>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <map>
#include <bitset>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i+... |
#include <bits/stdc++.h>
using namespace std;
bool palindrome (string s) {
string t = s;
reverse(t.begin(), t.end());
return t == s;
}
int main() {
string S, T, s;
cin >> S;
T = S;
reverse(T.begin(), T.end());
int n = stoi(T);
string t = to_string(n);
if (palindrome(t)) cout <<... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
string S; cin>>S;
if(S=="0"){
cout<<"Yes\n";
}
else{
string SS = S;
while(SS.back()=='0') SS.pop_back();
string rS = SS;
reverse(rS.begin(),... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | #include<bits/stdc++.h>
using namespace std;
const int maxN = 5009;
int N, M, p[maxN], pM[maxN];
const int mod = 998244353;
int add (int x, int y) {int ans = x + y; if (ans >= mod) ans -= mod; return ans;}
int subtract (int x, int y) {if (x >= y) return x - y; return x - y + mod;}
int mul (int x, int y) {return 1LL ... |
#include<bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
template <class T> bo... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <string> vs;
typedef vector <vector <int>> vvi;
typedef vector <vll> vvll;
typede... |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (int)(x); i < (int)(y); ++i)
#define MP make_pair
#define fst first
#define snd second
typedef pair<int, int> pii;
const int maxn = 4e5 + 5;
int n, top = 0;
int a[maxn], ord[maxn], rev[maxn], stk[maxn];
char s[maxn];
inline bool cmp(cons... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a,q,ans,cnt;
string s;
map<ll,ll> mp;
vector<ll> v,v1;
int main(void){
cin>>n;
for(int i=0;i<2*n;i++){
cin>>a;
v.push_back(a);
v1.push_back(a);
}
sort(v1.begin(),v1.end());
for(int i=0;i<n;i++){
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v)... | #include<bits/stdc++.h>
using namespace std;
template<typename T>inline bool read(T&x){
x=0;char c=getchar();int f=1;while(!isdigit(c)&&(c!='-')&&(c!=EOF))c=getchar();
if(c==EOF)return 0;if(c=='-')f=-1,c=getchar();
while(isdigit(c)){x=(x<<1)+(x<<3)+(c&15);c=getchar();}x*=f;return 1;
}template<typename T,typename...Args... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)((x).size())
#define GCD(m,n) __gcd(m,n)
#define LCM(m,n) ((m*n)/GCD(m,n))
#define PI 3.141592653589793238462
//max element of ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 998244353
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end(... |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
vector<set<ll>> st(200);
vector... | #ifdef LOGX
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
/*---------macro---------*/
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define unless(x) if(!(x))
#define until(... |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
int n;
char s[100010];
int main() {
scanf("%s", s+1);
n = strlen(s+1);
int i;
for (i=n; i>=1; i--) {
if (s[i]=='0') printf("0");
else if (s[i]=='1') printf("1");
else if (s[i]=='6') printf("9");
else i... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rep3(i, a, b) for(ll i = a; i >= b; --i)
#define all(c) begin(c), end(c)
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
using name... |
#include <iostream>
#include <string>
int n;
std::string s;
int C(int n, int k) {
if (!k) return 1;
else return C(n / 3, k / 3) * (n % 3 < k % 3 ? 0 : n % 3 == 2 && k % 3 == 1 ? 2 : 1) % 3;
}
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
std::cin >> n >> s;
int ans = 0;
... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i,n) for(int i=1;i<=(int)(n);i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using ll = l... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/modint>
//#include <atcoder/dsu>
#define inc(i, n) for (int i = 0; i < (n); ++i)
#define incs(i, st, nd) for (int i = (st); i < (nd); ++i)
#define yes printf("Yes\n")
#define no printf("No\n")
//using pii = pair<int, int>;
using ll = long long;
//usi... | #pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define... |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b;
cin >> a >> b;
int s1 = 0 , s2 = 0;
for (int i = 0; i <3; i++) {
s1 += a%10;
s2 += b%10;
a /= 10;
b /= 10;
}
... | #include<bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int mod = 1000000007;
#define all(a) (a).begin(),(a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string a, b;
cin >> a >> b;
int asum = 0, bsum = 0;
rep(i,... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define all(x... | // YATIN KWATRA
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize ("Ofast")
#define ll long long
#define ar array
#define sz(v) (int)(v.size())
#define inf ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repb(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define all(A) A.begin(),A.end()
#define allr(A) A.rbegin(),A.rend()
#define precise(i) fixed << setpr... | #include<bits/stdc++.h>
#define ints long long
#define fo(i, a, n) for (ints i = a; i < n; i++)
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ints t;
t = 1;
while (t--)
{
string s;
cin >> s;
for (ints i = 0; s[i] != '\0'; i++)
{
if (s[i] == '.')
{
... |
#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 p(x,y) pair<x,y>
#define oset(x) tree<x, null_type, less<x>, rb_tree_tag, tree_order_statistics_node_update>
#define all(x) (x).begin(),(x).end()
#define ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<pll> vll;
typedef vector<vl> vvl;
#define fori(i, n) for (in... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
//#include<atcoder/all>
//using namespace atcoder;
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 <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define ll128 __uint128_t
#define ld long double
#define pll pair <ll, ll>
#define vll vector <ll>
#define vld vector<ld>
#define vpll vector<pll>
#define vvll vector <vl... |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#include<unordered_set>
#define INF 0x3f3f3f3f
#define mod 1000000007
#define G 3
#define MAX_N 300005
using namespace std;
typedef long long ll;
typedef pair<ll,ll>P;
int n,dp[200005][10];
char s[200005],t[200005... |
#include<iostream>
#include <string>
#include <algorithm>
int n;
int q;
std::string s;
int t,a,b;
int main()
{
std::cin >> n >> s >> q;
std::string sh[2];
sh[0] = s.substr(0,n);
sh[1] = s.substr(n,s.size());
for(int i=0;i<q;++i){
std::cin >> t >> a >> b;
if(t == 1){
... | //IQ134高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<... |
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <limits>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
// < でBの方が大
int main() {
ll N;
cin >> N;
vector<ll> T(N);
... | #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 pair<ll,ll> pll;
#define ordered_pair_multiset tree<pair<ll,ll>, null_type,less<pair<ll,ll>>, rb_tree_tag,tree_order_statistics_node_updat... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long S;
long long P;
cin>>S>>P;
int a=0;
long long sum=sqrt(P);
for(long long i=0;i<sum;i++){
if(S*(i+1)-(i+1)*(i+1)==P){
cout<<"Yes"<<endl;
a=1;
break;
}
}
if(a==0){
cout<<"No"<<endl;
}
} | #include "bits/stdc++.h"
using namespace std;
int main()
{
long long int n, k;
cin >> n >> k;
for(int i = 0;i < k;i++){
if(n % 200 == 0){
n /= 200;
}
else{
n = n * 1000 + 200;
}
}
cout << n << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; (i) >= (int)(a); (i)--)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> using V = vector<T>;
template <class T> using VV = vector... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
//const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10)... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
cout<<100-n%100<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0);
#define ch(a) (int(a-'a')+1)
#define mm(a) memset(a,0,sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define repp(i,a,b) for(int i=(a);i<(b);i++)
typedef long long ll;
int main(){
int x;
scanf("%d",&x);
if(x... |
#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 endl "\n"
#define ll long long
#define ld long double
#define pb(a) push_back(a)
#define arr(a) new ll int[a]
#define INF 4000000000000000000
#define MOD 100... | #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 fast { ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#define pb push_back
#define ll long long
#define v... |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
double aa, bb;
int main()
{
scanf("%lf%lf", &aa, &bb);;
printf("%.5f", (aa - bb) / aa * 100);;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0), cout.tie(0);
#define print(a) for(int i=0;i<(a.size());i++){cout<<a[i]<<"\n";}
#define sortt(a) sort(a.begin(),a.end())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define int ... |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int N, M;
cin>>N>>M;
long long MOD = 998244353;
vector<vector<long long>> C(N+1, vector<long long>(N+1));
for (int i=0; i<=N; i++)
{
C[i][0] = 1;
for (int j=1; j<i; j++)
C[i][j] = (C[i-1][j-1]+C... | #include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
usi... |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define endl "\n"
int main() {
i64 N;
cin >> N;
vector<i64> A(N);
for (i64 i = 0; i < N; i++) {
cin >> A[i];
}
N = min(N, 8LL);
vector<i64> p(200, -1);
for (i64 bit = 1; bit < (1LL << N); bit++) {
i64 ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin>>n;
vector<long long> A(n);
for(int i=0;i<n;i++) cin>>A[i];
long long ans = 10e17;
for(int i=0;i<(1<<n);i++){
long long xorv = 0;
long long orv = 0;
for(int j=0;j<=n;j++){
if(j < n) orv = orv | A[j];
if(((... |
#include <cmath>
#include <bits/stdc++.h>
using namespace std;
int main(){
long r, x, y;
cin >> r >> x >> y;
double f=sqrt(x*x+y*y);
if(f<r){
cout << ceil(f/(double)r)+1 << endl;
}else{
cout << ceil(f/(double)r) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define endl "\n"
#define rep(i, n) for(int i = 0; i < int(n); i++)
#define rep2(i, s, n) for(int i = (s); i < int(n); i++)
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ipair;
typedef pair... |
#include<bits/stdc++.h>
using namespace std;
#define fast {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
typedef long long int ll;
typedef string S;
#define M 1e18
#define AS 250005
#define sp cout<<' '
#define nw cout<<endl
#define rt return
#define __ template<typename T, typename... Types>
void in() {rt;... | #include<bits/stdc++.h>
using namespace std;
int t;
long long ans;
long long l,r;
int main()
{
cin>>t;
for(int o=1;o<=t;o++)
{
cin>>l>>r;
if(r<2*l)
{
printf("0\n");
continue;
}
ans=(r-l+1ll)*(r-2ll*l+1ll);
ans-=r*(r-2ll*l+1ll)/2ll;
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n; cin>>n;
vector<int> a(n),b(n);
for(int i = 0;i<n;++i){
cin>>a[i];
}
for(int i = 0;i<n;++i){
cin>>b[i];
}
int left = INT_MIN;
int right = INT_MAX;
f... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int nem[1000]={0};
int N;
cin >> N;
int a[N], b[N];
for (int i = 0; i < N; i++)
{
cin >> a[i];
}
for (int i = 0; i < N; i++)
{
cin >> b[i];
}
for (int i = 0; i < N; i++)
{
for (int j = 0;... |
// Author : heyuhhh
// Created Time : 2021/03/26 09:30:22
#include<bits/stdc++.h>
#define MP make_pair
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... |
#include <bits/stdc++.h>
using namespace std;
int n, a[200010], b[200010];
long long ans = 0;
priority_queue <int, vector <int>, greater <int> > q;
int main() {
scanf("%d", &n);
for (int i = n - 1; i >= 0; --i) {
scanf("%d", &a[i]);
ans += a[i];
}
for (int i = 0; i < n; ++i) {
int b; scanf("%d", &b);
q.pu... | /**
* author: mahfuzz
* created: 01.11.2020
**/
#include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
typedef long long ll;
int main(int argc, char* argv[]){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n; cin >> n;
ll man = 0, cheb = 0;
double euclid;
fo... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MO... | #include<bits/stdc++.h>
using namespace std;
#define N 500050
typedef long long ll;
inline ll read(){
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,a[N],b[N],ans;
char s[N],t[N];
int main(... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < n; i++)
#define 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 >= 1; i--)
#define all(x) x.begin(),... | //#define _GLIBCXX_DEBUG
//#include <atcoder/all>
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#ifndef ATCODER_DSU_HPP
#define ATCODER_DSU_HPP 1
#include <algorithm>
#include <cassert>
#include <vector>
namespace atcoder {
// Implement (union by size) + (path compression)
// Reference:
// Zvi Galil ... |
#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
const int MAXN = 5e2 + 50;
int diffa[MAXN], diffb[MAXN];
int a[MAXN], b[MAXN], c[MAXN][MAXN];
bool check(int n) {
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (a[i] + b[j] != c[i][j] || a[i] < 0 || b[j] < 0)
... |
#include<iostream>
#include<vector>
#include<iomanip>
using namespace std;
int score(string S){
int res=0;
vector<int> a(10);
for(char c: S)a[c-'0']++;
for(int i=1; i<=9; i++){
int x=1;
for(int j=0; j<a[i]; j++)x*=10;
res+=i*x;
}
return res;
}
int main(){
int K;
... | #include<bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i <= b ; ++i)
#define per(i, a, b) for(int i = b ; i >= a ; --i)
#define int long long
using namespace std;
double card[10];
int S[6],T[6];
bool bigger()
{
int sums=0,sumt=0;
for(int i=1;i<=9;i++)
{
int x=i;
for(int j=1;j<=5;j++)if(S[j]==i)x*=10;
... |
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <numeric>
#include <cassert>
using namespace std;
void setIO(const string &name = "") {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
if (name.leng... |
#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 <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <utility>
#include <tuple>
#include <cmath>
#include <numeric>
#include <set>
#include <map>
#include <array>
#include <complex>
#include <iomanip>
#include <cassert>
using ll = long long;
using std::cin;
using std::c... |
#include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#in... | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ii pair<int, int>
#define OK (cerr << "OK" << endl)
#define debug(x) cerr << #x " = " << (x) << endl
#define ff first
#define ss second
#define int long long
#define tt tuple<int, int, int>
#define all(x) x.begin(), x.end()
#define vi vecto... |
#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#inclu... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int x1,y1,x2,y2; scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
if(x1==x2 && y1==y2){
puts("0");
}
else if(x1+y1==x2+y2 || x1-y1==x2-y2 || abs(x1-x2)+abs(y1-y2)<=3){
puts("1");
}
else if((x1+y1)%2==(x2+y2)%2){
puts("2"... |
#include<bits/stdc++.h>
using namespace std;
const int N=1e4+10;
int a[N],b[N],pre[N];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
pre[a[i]]++;
}
for(int i=0;i<n;i++)
{
cin>>b[i];
pre[b[i]+1]--;
}
int ans=0;
for(int i=0;i<N;i++)
pre[i]+=pre[i-1];
for(int i=0;i<N;i++)
{
if(pre[i... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n; cin>>n;
vector<int> a;
for (int i = 0; i < n; ++i)
{
int k; cin>>k; a.push_back(k);
}
int ans=0;
for (int i = 0; i < a.size(); ++i)
{
int min=a[i];
for (int j = i; j <a.size() ;... |
#include<bits/stdc++.h>
using namespace std;
///******************************** C o n t a i n e r ********************************///
typedef unsigned long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
//... | //#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
#define infll 0x3f3f3f3f3f3f3f3f
#define il inline
#define re register
#define pb push_back
#define db double
#define ll long long
#define ull unsig... |
// Parasparopagraho Jīvānām
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace __gnu_pbds ;
using namespace __gnu_cxx ;
using namespace std ;
typedef long long ll ;
t... | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define pb push_back
#define mp make_pair
#define ll long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define testcase ll T; cin >> T; for (ll tc = 1; tc <= T; tc++)
#define M 1000000007
#define MM 998244353
#define eps 1e... |
#include <bits/stdc++.h>
using namespace std;
template<typename T = int> vector<T> create(size_t n){ return vector<T>(n); }
template<typename T, typename... Args> auto create(size_t n, Args... args){ return vector<decltype(create<T>(args...))>(n, create<T>(args...)); }
int main(){
ios::sync_with_stdio(false);
cin.tie... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int gcd(int, int);
int main(void){
//init val
int n, kosuu = 0;
cin >> n;
int *a;int *b;int *c;
a = new int[n];
b = new int[n];
c = new int[1000];
for (int i = 0; i < n; i++){
cin >> a... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define T \
int t; \
cin >> t; \
while (t--)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define PI 3.141592653589793238462643383
#define pb push_back
#define all(s) s.begin(),... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int n; int D; int H;
cin >> n >> D >> H;
vector<int> d(n), h(n);
for(int i=0; i<n; ++i) cin >> d[i] >> h[i];
double ans = 0;
for(int i=0; i<n; ++i) {
double b = double(D * h[i] - d[i] * H) / (D - d[i]);
ans = max(ans, b)... |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | #include"bits/stdc++.h"
using namespace std;
typedef long long ll;
int main(){
ll n;
cin>>n;
ll count=1;
ll p=2;
vector<ll>a(n);
for(ll i=0;i<n;i++){
a[i]=count;
if(i+2==p){
count++;
p=p*2;
}
}
for(ll i=0;i<n;i++){
cout<<a[i]... |
//BY: YASH JAIN, CF: BitSane
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define May_the_fork_be_with_... | /*
بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ
لَا إِلَٰهَ إِلَّا ٱللَّٰهُ مُحَمَّدٌ رَسُولُ ٱللَّٰهِ
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sort(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define pb push_back
ll mod= 1000000007;
vector<ll>sv... |
#include <bits/stdc++.h>
#define FLASH ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define int long long int
#define MAX 1e9
#define MIN -1e9
#define mod 1000000007
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define output(x) cout << ( x ?... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
if(x<0)
{
cout<<0<<"\n";
}
else
{
cout<<x<<"\n";
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair<ll,ll>
#define vi vector<ll>
#define mii ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T,class U> using P = pair<T,U>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vec<T>>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
int n;
cin >> n;
vec<ll> a(n);
rep(i, n) ... |
#include <iostream>
#include <string>
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int>> v (n, vector<int>(3));
for (int i = 0; i < n; i++) {
cin >> v[i][0] >> v[i][1] >> v[i][2];
}
vector<int> a(n), p(n), x(n);
int counter = 0, min_price = 100000... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... |
#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;
#define int long long
#define F first
#define S second
#define pii pair<int,int>
#define pb push_back
#define vi vector<int>
#define endl "\n"
#define all(a) a.begin(),a.end()
void solve() {
int n; int m; cin >> n >> m;
vector<int> v;
for (int i = 0; i < n; i++) {
int... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n)
using namespace std;
using ll = long long;
using vll = vector<... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x).size()
#define S second
#define F first
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
void setIO(string name = "") {
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
if (sz... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define REP(i,a,b) for(int i = (a); i < (b); i++)
#define MOD 1000000007
int main(void) {
int n;
cin >> n;
int res;
// 1/2 res (res... | #include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <bitset>
#include <stack>
#include <deque>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
... |
#include <iostream>
#include <map>
using namespace std;
using lint = long long;
void solve() {
lint x, y;
cin >> x >> y;
map<lint, lint> dp;
auto dfs = [&](auto&& f, lint p) -> lint {
if (dp.count(p)) return dp[p];
auto& ret = dp[p];
// 2で割らない場合
ret = abs(p -... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RREP(i, n) for(int i=(n);i>=0;--i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define DUMP(x) c... |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define pb push_back
#define pi pair<int, int>
#define l first
#define r second
#define all(x) x.begin(), x.end()
using namespace std;
const int maxn = 2e3 + 1;
int v[maxn];
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0); cou... | #include<iostream>
#include<vector>
#include<stack>
#include<tuple>
using namespace std;
int main(int argc, char* argv[]) {
int A, B, W;
cin >> A >> B >> W;
W *= 1000;
auto D = B - A;
const auto k = W / A;
int maxCount = 0;
int minCount = 2147483647;
bool flag = false;
for (auto i = 1; i <= k; i... |
#include <bits/stdc++.h>
#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()
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF=1<<30;
//const ll INF=1LL<<60;
int ma... | // 解き直し.
// https://atcoder.jp/contests/agc052/editorial/880
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
#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) for(int i = a; i >= b; i--)
#define pb push_b... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int tc,o;
scanf("%d",&tc);
for(o=1;o<=tc;o++)
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz=0,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=0,cnt=0,res=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<lo... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int T,ans;
scanf("%lld",&T);
long long int L[T],R[T];
for(int i=0;i<T;i++){
ans = 0;
scanf("%lld %lld",&L[i],&R[i]);
if(R[i]-2*L[i]>=0){
ans=(R[i]-2*L[i]+2)*(R[i]-2*L[i]+1)/2;
}
printf("%lld\n",ans);
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pdd;
#define lc u << 1
#define rc u << 1 | 1
#define mid (t[u].l + t[u].r) / 2
#define INF 0x3f3f3f3f
#define lowbit(x) x & (-x)
#define mem(a, b) memset(a , b , sizeof(a))
#define FOR(i, x, n) for(int... | // I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdi... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include "../../../cp/lib/debug.hpp"
#else
#define debug(...)
#endif
int main() {
cin.tie(0)->sync_with_stdio(0);
ll n, c;
cin >> n >> c;
multiset<pair<ll, ll>> st;
for (int i = 0; i < n; i++) {
int a, b, x;
cin >> a >> b >> x;
... | #include <bits/stdc++.h>
using namespace std;
const int N=1050;
const int INF=0x3f3f3f3f;
// dp[i][j]表示点i到点j的最短回文串路径
int dp[N][N];
int n,m,u,v;
char c[2];
vector<int> g[N][30];
int main(){
// freopen("in.txt","r",stdin);
scanf("%d%d",&n,&m);
queue<pair<int,int>> q;
for(int i=1;i<=n;i++){
for(int ... |
#pragma GCC optimize("-Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
// #include <atcoder/all>
// #include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <... | #include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define LL long long
#define mod 998244353
using namespace std;
int n;
char s[110000];
int f[11010][110];
int a[110];
long long fac[110];
int main()
{
fac[0]=1;
for(int i=1;i<=100;i++)fac[i]=fac[i-1]*i%mod;
cin>>n;
for(int i=1;i<=n;i++)s... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#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 namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... | #include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i <= n; i++)
#define FORR(i, m, n) for(ll i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n)
#define MAX 100000
#define inf 1000000007
using namespace std;
using ll ... |
#include <iostream>
#include <string>
using namespace std;
int main()
{
char c1, c2, c3;
cin >> c1 >> c2 >> c3;
if (c1 == c2 && c1 == c3 && c2 == c3)
{
cout << "Won" << "\n";
}
else
{
cout << "Lost" << "\n";
}
} | #include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
static const LL INF = 1LL << 60;
struct Dijkstra {
vector<vector<pair<long ... |
//================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>
#define ci(t) cin>>t
#define co(t) cout<<t
#define LL long long
#defin... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a[1000];
long long sum=0;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]>=10) sum+=a[i]-10;
}
cout<<sum<<endl;
return 0;
} | /* “A man wrapped up in himself makes a very small bundle.” */
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#defin... | #include <bits/stdc++.h>
#define Mod 1000000007
using namespace std;
typedef long long ll;
inline int read() {
int out = 0;
bool flag = false;
register char cc = getchar();
while (cc < '0' || cc > '9') {
if (cc == '-') flag = true;
cc = getchar();
}
while (cc >= '0' && cc <= '9') {
out = (out << 3... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<ll, ll>;
template<class T>
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}
template<class T>
bool chmin(T &a, T b) {if (a > b) {a = b;return true;}else retu... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define rep(n) for (ll i = 0; i < n; i++)
#define repc(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, x, y) for (ll i = x; i < y; i++)
#define DEC(i, x, y)... |
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fr(i,a,n) for(i=a;i<n;i... | #include <iostream>
#include <set>
#define int long long
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int ans = 0;
std::set<std::pair<int, int> > chosen;
int n;
std::cin >> n;
int m = 2*n-1;
int a[2*n];
for(int i = 0; i < 2*n; i++)
std::cin >> a[i];
for(int i = n-1; i... |
#include <bits/stdc++.h>
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int,int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int> ;
using vvi = std::vector<vi> ;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double... | #include <bits/stdc++.h>
#define rep2(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) rep2(i,0,n)
#define rep1(i,n) rep2(i,1,n+1)
#define FOR(i) for(cin>>i;i>0;i--)
#define elif else if
#define pb push_back
#define ll long long
#define mp make_pair
#define all(x) x.begin(),x.end()
#define re(x) {cout<<x<<end... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<bitset>
#include<vector>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
ll read() {
ll x=0,f=1;char ch=getchar()... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vec... |
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
return (zf?-res:res);
}
inline bool check(int x){
int tmp=x;
while(x){
if(x%... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,tmp;
int amax=-1;
int bmin=10000;
cin>>n;
for(int i=0;i<n;i++){
cin>>tmp;
if(tmp>amax){
amax=tmp;
}
}
for(int i=0;i<n;i++){
cin>>tmp;
if(tmp<bmin){
bmin=tmp;
}
}
if(bmin<amax){
cout<<0;
}else{
... |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
vector<ll> rui(1000001);
ll sum = ... | #include<cstdio>
#include<algorithm>
using namespace std;
#define fi first
#define se second
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define fep(i, l, r) for(int i=(l), i##_end_=(r); i>=i##_end_; --i)
typedef long long ll;
template<class T>inline T fab(T x){ return x<0? -x: x; }
template<cl... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007 //10e9+7
#define pb push_back
#define mod1 998244353
// want to become a good coder :p
void chalega()
{
ll a,b;
cin>>a>>b;
ll sum1=0,sum2=0;
ll x=0,y=0;
while(a>0)
{
x=a%10;
sum1+=x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using pld = pair<ld,ld>;
using vll = vector<ll>;
using vld = vector<ld>;
using vstr = vector<string>;
#define _GLIBCXX_DEBUG
#define rep(j, m) for (ll j = 0; j < (ll)(m); j++)
#define rep2(i, l, n) for (... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define len(x) int((x).size())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define randint(n) uniform_int_distribution<int>(1, (n))(rng)
const int ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define dump(a) cerr << #a " = " << (a) << endl
us... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <iomanip>
using namespace std;
using ll = long long int;
vector<string> myspliter(const string &s, const char delimiter){
vector<string> res;
string part = "";
for(auto &p:... | #include<iostream>
#include<math.h>
using namespace std;
int main()
{
long double x,y,r;
cin>>x>>y>>r;
r+=1e-14;
long long ans=0;
long long ll=ceil(x-r);
long long rr=floor(x+r);
//cout<<ll<<" "<<rr<<endl;
for(int i=ll;i<=rr;i++){
if(r*r-(1.0*i-x)*(1.0*i-x)<0)
continue;
long double yy=sqrt(r*r-(1.0*i-x... |
#include<bits/stdc++.h>
using namespace std;
const long long N=1e6+10;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;
}
long long n,a[N],tot;
signed main(){
cin>>n;
for(int i=1;i<=sqr... | /*** I came, I saw, I conquered. ***/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;typedef unsigned long long ull;
#define sc(a) cin >> a
#define pf(a) cout << a << endl
#define forIn(arr, num) for(ll i = 0; i < num; i++) cin >> arr[i];
#define vpnt(ans) for(ll i = 0; i < ans.size(); i++) cout << ... |
//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;
#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> ... | //#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#define X first
#define Y second
#define L (u<<1)
#define... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll INF = 1e15;
ll n, m, k;
ll dp[1 << 17][20];
ll helper(vector<vector<ll>>& adj, ll from, ll to)
{
queue<ll> q;
q.push(from);
ll ret = 0;
vector<bool> visited(n + 1, false);
visited[from] = true;
while(!q.empty())
{
... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define int long long
signed main(){
// cout << fixed << setprecision(10) << flush;
int n, m;
cin >> n >> m;
vector<int> a(m), b(m);
vector<vector<int>> e(n), er(n);
for(int i=0; i<m; i++){
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if(N%100==0){
cout << N/100 << endl;
}
else{
cout << N/100+1 << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
#define rreps(i, n) for(int i=((int)(n)); i>0; --i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = l... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll int
#define ld long double
#define For(i,x,y) for(ll i = (ll)(x);i <= (ll)(y);++i)
#define FOr(i,x,y) for(ll i = (ll)(x);i >= (ll)(y);--i)
#define rep(i,x,y) for(ll i = (ll)(x);i < (ll)(y);++i)
#define fi first
#define se second
#defi... | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define inf LLONG_MAX>>2
#define MAX 1000000
#define mod 1000000007
#define pb push_back
#define f(i,a,n,x) for ((i)=(a);(i)<(n);(i)+=(x))
#define fd(i,a,n,x) for ((i)=(a);(i)>=(n);(i)-=(x))
#define fi first
#define se second
#define mk make_pair
#... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef vector<vi> vii;
#define fi first
#define se second
#define pb push_back
#define forn(i,n) for(int i=0;i<(n);i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forr(i,n) for(int i=n;i>=0;i--)
#define all(x) x.begin(), x.... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dbl;
typedef float flt;
#define for0(i, n) for(ll i=0; i<n; i++)
#define for1(i, n) for(ll i=1; i<=n; i++)
#define forab(i, a, b) for(ll i=a; i<=b; i++)
#define clr0(a) memset(a, 0, sizeof(a))
void solv... | #include<bits/stdc++.h>
using namespace std;
int n;
int main()
{
cin >> n; vector<vector<int> > C( n,vector<int>( n ) );
vector<int> A( n ), B( n );
for( auto &i:C ) for( auto &j:i ) cin >> j;
int minval=numeric_limits<int>::max(),mini=0,minj=0;
for( int i=0;i<n;++i )
{
for( int j=0;j<n;++j )
{
if( C[i][j]... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int parent[N], color[N];
vector<int> adj[N];
map<int, int> cnt_color;
set<int> ans;
void defineParents()
{
memset(parent, -1, sizeof(parent));
parent[0] = 0;
queue<int> fila;
fila.push(0);
while(!fila.empty())
{
int v ... | #include <stdio.h>
#include <set>
#include <utility>
typedef long long ll;
int main(void) {
ll i, j, k, n, q;
scanf("%lld", &n);
ll a, t, b[2] = {(ll)-1e16, (ll)1e16}, s = 0, x;
for(i = 0; i < n; ++i) {
scanf("%lld%lld", &a, &t);
if(t == 1) s += a;
else if(t == 2) {
if(b[1] + s < a) b[0] = b[... |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#include<functional>
#include<iomanip>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <iomanip>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tre... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.