code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define fo(i, x, y) for (int i = (x); i <= (y); ++i)
#define fd(i, x, y) for (int i = (x); i >= (y); --i)
typedef long long ll;
ll n;
ll f[100];
vector<int> ans;
int getint()
{
char ch;
int res = 0, p;
while (!isdigit(ch = getchar()) && (ch ^ '-'));
p = ch == '-'? c... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <sta... |
#include<bits/stdc++.h>
using namespace std;
int a[4];
int main() {
cin>>a[1]>>a[2]>>a[3];
sort(a+1,a+4);
if(a[2]-a[1]==a[3]-a[2]) {
puts("Yes");
} else {
puts("No");
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int A1,A2,A3,A4;
cin >>A1>>A2>>A3>>A4;
if (A1<=A2 &&A1<=A3&&A1<=A4)
{
cout<<A1;
}
else if (A2<=A1 &&A2<=A3&&A2<=A4)
{
cout<<A2;
}
else if (A3<=A1 &&A3<=A2&&A3<=A4)
{
cout<<A3;
}
else if (A4<=A1... |
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << '=' << x << endl
#define rep(i, b, e) for (int i = b; i <= e; i++)
char ss1[512345], ss2[512345];
char s1[512345], s2[512345];
int work(char *s1, char *s2, int n) {
vector<int> a(1), b(1);
int ans = 0;
rep (i, 1, n) {
if... | #include <iostream>
#include <vector>
#include <algorithm>
int n;
std::string s, t;
std::vector<int> a, b;
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
std::cin >> n >> s >> t;
for (int i = 0; i < s.length(); ++i)
if (s[i] == '0')
a.push_back(i);
for (int i... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
using PL = pair<ll,ll>;
using PPL = pair<pair<ll,ll>,ll>;
#define INF 1000000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i =... | /**
* author : cuber_coder
* created : 09/05/2021 19:43:08
**/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
void Solve() {
int k, n, m;
cin >> k >> n >> m;
vector<int> a(k);
for (auto &i : a) {
cin >> i;
}
set<pair<long double, int>> b;
fo... |
#include <bits/stdc++.h>
#define ar array
using namespace std;
const int mxN = 2e5;
vector<int> kids[mxN], starts[mxN], inTs[mxN];
int inT[mxN], outT[mxN];
void dfs(int &T, int cur, int d) {
inTs[d].push_back(T);
inT[cur] = T++;
for (int nxt : kids[cur])
dfs(T, nxt, d+1);
outT[cur] = T++;
}
int main() {... | #include <cstdio>
#include <vector>
#include <iostream>
#include <map>
using namespace std;
const int M = 200005;
#define pii pair<int,int>
#define make make_pair
int read()
{
int x=0,f=1;char c;
while((c=getchar())<'0' || c>'9') {if(c=='-') f=-1;}
while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+(c^48);c=getchar();}
retur... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
long long inversion_number(vector<int> &A){
int N = A.size();
vector<int> B = A;
sort(B.begin(), B.end());
map<int, int> mp;
for (int i = 0; i < N; i++) mp[B[i]] = i + 1;
for (int i... | #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 =... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
const int MOD = 1000000007;
void solve(){
int n,m;
cin>>n>>m;
int **arr = new int*[n];
int s = INT_MAX;
for(int i=0;i<n;i++){
arr[i] = new int[m]();
for(int j=0;j<m;j++){
cin>>arr[i][j];
s = min(s,arr[i][j]);
}
}
int ans... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sys/types.h>
#include <unistd.h>
#include <vector>
#pragma region macros
#define _overload(_1, ... |
#line 2 "/home/defineprogram/Desktop/Library/template/template.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define REV(i, n) for (int i = n - 1; i > ... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bo... |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N, Q; cin >> N;
vector<int> A(N), T(N);
REP(i, 0, N) cin >> A[i] >> T[i];
cin >> Q;
vector<ll> X(Q);... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n], t[n];
for (int i = 0; i < n; i++) cin >> a[i] >> t[i];
int q;
cin >> q;
int x[q];
for (int i = 0; i < q; i++) cin >> x[i];
... |
// Created by ash_98
#include<bits/stdc++.h>
using namespace std;
#define mx 200005
#define ll long long
#define mod 1000000007
int ar[mx];
char ch[mx];
int n,m,ii,k;
pair<ll,int> chk(vector<ll>c,vector<ll>b,int bat)
{
vector<ll>a;
int sz=c.size();
for(int i=0;i<sz;i++)
{
if(i!=bat)a.push... | #include<bits/stdc++.h>
#define For(a,b,c) for(int a=b;a<=c;++a)
#define Dor(a,b,c) for(int a=b;a>=c;--a)
#define CC(_...) fprintf(stderr,_)
using namespace std;
typedef long long LL;
enum{N=400007};
int n,S[3];
LL ans;
struct O {
LL a; int c;
bool operator < (const O &_) const {
return a<_.a;
}
}A[N];
int main() {
s... |
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
inline void MAX(int &a,const int &b) {if(b>a) a=b;}
inline void MIN(int &a,const int &b) {if(b<a) a=b;}
inline int max(const int &a,const int &b) {return a>b?a:b;}
inline int min(const int &a,const int &b)... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long (i)=1;(i)<(n+1);(i)++)
#define mod 998244353
int main(){
int N;
long long S;
S = 2329089562801;
cout << S << endl;
} | #include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <cmath>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200015
#define ten53 300005
#... |
#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 ALL(a) a.begin(),a.end()
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) ((x).begin()), ((x).end())
#define READ(x) (cin >> (x))
#define WRITE_N(x) (cout << (x) << endl)
#define WRITE(x) (cout << (x))
#define WRITE_Y... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
typedef long long int ll;
int main() {
string n; cin >> n;
int numbers[n.length()];
int i = 0;
int sum = 0;
for (auto c : n) {
numbers[i] = c - '0';
sum += numbe... | #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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int n;
const int maxn = 5e5 + 10;
char s[maxn], t[maxn];
queue<int> q;
int main() {
while(~scanf("%d%*c", &n)) {
while(!q.empty()) q.pop();
int cnt1 = 0, cnt2 = 0; ll ans = 0;
for(int i = 1; i <= n; i++) scanf("%1d", &s[i... | #include<iostream>
#include<assert.h>
#define int long long
#define endl '\n'
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define infi INT_MAX
#define rinfi INT_MIN
#define inf LLONG_MAX
#define rinf LLONG_MIN
#define ff first
#define ss second
#ifndef ONLINE_JUDGE
#define line cout<<"he... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co... | #include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
ll a[400005];
for(int i = 0; i < n * 2; i++) cin >> a[i];
priority_queue<ll> que;
ll ans = 0;
for(int i = 0; i < n; i++){
que.push(a[i]);
que.push(a[n * 2 - i - 1]);... |
#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 fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define FordE(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,w,x,y;
cin >> a >> b >> w;
w *= 1000;
if((w + b -1) / b * a <= w){
cout << (w + b - 1) / b << endl;;
}
if((w / a) * b >= w){
cout << w / a << endl;
}
else{
cout << "UNSATISFIABLE" << endl;
}
} |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i,0,n)
#define BFOR(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define BREP(bit,n) BFOR(bit,0,n)
using namespace std;
using ll = long long;
int main() {
ll n;
string t;
cin >>... |
#include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#d... |
/*
* @Author: zhl
* @Date: 2020-10-18 20:56:45
*/
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int A[N], B[N], n;
int ans;
void dfs(int now, stack<int> s, int sum) {
if (now == n) {
if (s.empty()) {
ans = max(ans, sum);
return;
}
}
if (!s.empty()) {
int tp = s.top();
int d =... |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define pii pair<int, int>
#define rep(i, a, b) for(int i = (a); i < (b); i++)
using namespace std;
template<typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
#include <functional>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <unordered_set>
using namespace std;
typedef long long ll;
#define rep(i,n) f... | #include <iostream>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<a*d-c*b<<'\n';
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
cout << (A+B)/2 << " " << (A-B)/2 << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main(){
ios::sync_with_stdio(0); cin.tie(0);
int n; cin>>n;
string s; cin>>s;
string t;
while((int)t.size() < n+4) t+="110";
int ans=0;
for(int i=0;i<3;i++){
if(s!=t.substr(i,n)) continue;
ans+=(i... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll i,j,n;
n = 4;
vector<ll> a(n);
ll s = 0;
for(i=0;i<n;i++) cin>>a[i], s+=a[i];
for(i=0;i<n;i++)
{
if(s-a[i] == a[i])
{
cout<<"Yes";
return 0;
}
}
for(i=0... | #include "bits/stdc++.h"
using namespace std;
#define dracarys ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC... |
#include<bits/stdc++.h>
using namespace std;
int main () {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T = 1;
//~ cin >> T;
for (int t = 1; t <= T; ++t) {
int n;
cin >> n;
int input[n + 1];
for (int i = 1; i <= n; ++i) {
cin >> input[i];
}
set<int> nums;
n... | #include "bits/stdc++.h"
// #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0;... |
/*#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);
typedef pair<ll , pair<ll, ll> > pi;
int pow(int x,... | #include <algorithm>
#include <vector>
#include <cstdio>
#include <cmath>
#define int long long
const int N = 100005, INF = 0x3f3f3f3f3f3f3f3fll;
int n, x, ans = INF, cnt, tot;
std::vector<int> R, G, B, a[3], b[2];
char c[5];
int find(std::vector<int> a, std::vector<int> b) {
int an = INF;
if(a.size() == 0 || b... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll = long long;
struct Edge
{
ll to;
ll cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
#define mp make_pair
#define REP(i, n) for (int i = 0; i < (n);... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using namespace std;
using ll = long long;
using ull = unsigned lo... |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main()
{
int H,W,count;
char a;
count = 0;
cin >> H >> W;
vector<vector<char>> S(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> S[i][j];
}
}
for (int i = 0; i <= H-2; i++) {
for (i... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<bitset>
#include<functional>
#include <fstream>
//#include<bits/stdc++.h>... |
#include <iostream>
#include <stack>
#include <string>
#include <vector>
#pragma warning(disable:4996)
using namespace std;
#define int long long
stack<int>way;
int N,M,K;
double ex[200100];
double ep[200100];
double epex[200100];
vector<pair<int, int>>x;
signed main()
{
ios_base::sync_with_stdio(false);
cin >> N>>M ... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//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 bit(n,k) ((n>>k)&1) //nのk bit目
#define vec(T) vector<T>
#define vvec(T) vector<vector<T>>
using ll = long long;
using ... |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
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 ... | #include<bits/stdc++.h>
#define int long long
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,abm,mmx,avx,avx2")
#pragma GCC optimize("unroll-loops")
#define ri register signed
#define rd(x) x=read()
using namespace std;
const int N=2e5+5;
const int maxn=5e6+5;
const int mod=998244353;
inline... |
#pragma GCC optimize("Ofast")
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <set>
#include <map>
#incl... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin >>n;
vector <long long> a(n), b(n);
for (int i = 0; i < n; ++i) {
cin >>a[i];
}
for (int i = 0; i < n; ++i) {
cin >>b[i];
}
long long res = 0;
for (int i = 0; i < n; ++i) {
long long... |
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io(){
std::cin.tie(n... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, t;
ll a[M... |
/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);... | /* Hardwork allways pays off */
//You never know how close to the solution you are ,so keep practicing
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#include <iostream>
using namespace __gn... |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(int)(n);i++)
using namespace std;
using P=pair<int,int>;
int main(){
double x,y,z;
cin>>x>>y>>z;
cout<<floor((y*z-1)/x)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
double X, Y, Z, v, a, b;
cin >> X >> Y >> Z;
v = Y / X;
a = Z * v;
long long int d = a;
if(d == a){
cout << d-1 << endl;
}else{
cout << d << endl;
}
return 0;
} |
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T>
void view_1d(vector<T> V, string sep) {
for (ll i=0; i<V.size(); i++) {
cout << V[i];
if (i == V.size() - 1) {
cout << endl;
} else {
cout << sep;
}
}
}
template<typ... |
#include<bits/stdc++.h>
using namespace std;
#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"
ll mod=1e9+7;
template<class T>
void printArr(T arr,int n){
cout<<"\n[";f(i,0,n) cout<<arr[i]<<", ";
cout<<"]\n";
}
ll gcd(ll a,ll b){
if(b... | // This code wrote by chtholly_micromaker(MicroMaker)
#include <bits/stdc++.h>
#define reg register
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define mem(x,y) memset(x,y,sizeof x)
#define sz(x) (int)(x).size()
#define ln std::puts("")
#define lsp std::putchar(32)
#define pb push_back
#define MP std::ma... |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <cctype>
#include <cmath>
#include<deque>
#include<map>
#include<algorithm>
#include<iomanip>
#include<numeric>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep1(i,begin,end) fo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define fast std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define endl "\n"
const ll INF = 1e18;
const ll NEGINF = -1 * INF;
/*NOTES: Take care of ll vs int
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N;cin>>N;
vector<ll> A(N);
for(ll i=0;i<N;i++){
cin>>A[i];
}
ll ans=0;
sort(A.rbegin(), A.rend());
for(ll i=0; i<N; i++){
ans += A[i]*(N-1-i) - A[i]*i;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N),B(N),C(N);
for (int i = 1; i <= N; ++i) cin >> A[i];
for (int i = 1; i <= N; ++i) cin >> B[i];
for (int i = 1; i <= N; ++i) cin >> C[i];
vector<int> count(N);
for(int j = 1; j <= N; +... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long int X;
cin >> N >> X;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
long long int ans = 2000000000000000000;
for (int C = 1; C <= N; C++) {
int MOD = X % C;
vector<vector<vector<long long int>>> DP(N + ... | //#define _DEBUG
#include "bits/stdc++.h"
//#include <atcoder/all>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,a5,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<",... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int inf = 1e9;
int a[maxn], b[maxn];
int main(){
ios_base::sync_with_stdio(false);
int n, L;
cin >> n >> L;
for (int i = 1; i <= n; i++)
cin >> a[i];
a[0] = 0, a[n+1] = L+1;
for (int i = 1; i <= n; i++)
cin ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... |
#include<bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#define endl "\n"
#define pb push_back
#define ll long long
#define d1(x) cerr << #x << "--> " <... | #include <bits/stdc++.h>
using namespace std;
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define drep(i, x) for (int i = ((int... |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (... | //~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unroll-loops")
#include <bits/st... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
struct Graph{
int n;
vector<vector<pair<int,int>>> G;
Graph(int n_){ init(n_); }
Graph(){}
virtual void init(int n_){
n=n_;
G=vector<vector<pair<int,int... | #include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); ... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
using std::cout;
using std::cin;
using std::string;
using std::vector;
using std::endl;
int main()
{
const long long mod = 998244353;
int h, w;
cin >> h >> w;
vector<string> graph(h);
for ... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
//gouravrj code:P
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz... |
#include <cstdio>
const double eps=1e-6;
int n;
double a[100005];
inline double min(double a,double b) {
return a<b?a:b;
}
double calc(double x) {
double ans=0;
for(int i=1;i<=n;i++) {
ans+=x+a[i]-min(a[i],x*2.0);
}
//printf("%.6lf %.6lf\n",x,ans);
return ans;
}
int main() {
scanf("%d",&n);
for(int i=1;i... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
ll x[100005],y[100005];
int main() {
int n;
cin >... |
#include <bits/stdc++.h>
#define LL long long
const int maxn=1e5+5;
using namespace std;
LL ans=0;
int op[80];
LL ans1[80];
LL ans2[80];
int main()
{
LL n;
cin>>n;
for(int i=1;i<=n;i++)
{
string s;
cin>>s;
if(s=="AND")
op[i]=1;
else
op[i]=0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<ll> dp(2, 1);
vector<ll> ndp(2, 0);
rep(i,n) {
string s;
cin >> s;
rep(xi,2) {
rep(xi1,2) {
int yi1;
... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Pine1999
*/
#include <bits/stdc++.h>
using namespace std;
void CNeqMin(std::istream& in, std::ostream& out) {
int n;
in >> n;
vector<int> p(n);
vector<bool> exist(400050);
int ans = 0;
for (in... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define mod 1000... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... | #include<bits/stdc++.h>
using namespace std;
const int N=400005;
int n,a[N],f[]={1,1,2},sum;
char s[N];
int c(int n,int m)
{
if(n<m) return 0;
if(n<3) return f[n]*f[m]*f[n-m]%3;
return c(n%3,m%3)*c(n/3,m/3)%3;
}
int main()
{
scanf("%d%s",&n,s+1);
for(int i=1;i<=n;i++)
if(s[i]=='W') a[i]=1;
else if(s[i]=='R') a... |
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <set>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
string input;
cin >> input;
auto sub = input;
size_t itr = 0;
int co... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef pair<int,int> pi... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int l;
cin >> l;
ll ans = 1;
for (int i = 1; i <= 11; i++) {
ans*= l - i;
ans/= i;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
//constexpr ll MOD = 1e9 + 7;
constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<cla... |
#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 <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int c[100010], cnt[100010], good[100010];
vector<int> e[100010];
void dfs(int now, int p = -1) {
if (cnt[c[now]] == 0)
good[now] = true;
cnt[c[now]]++;
for (auto to : e[now]) if (to != p)
dfs(to, now);
cnt[c[now]]--;... | #include<bits/stdc++.h>
#define pb push_back
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define SORT(v) sort(all(v))
#define int long long
#define ff first
#define ss second
#define mod 1000000007
#define endl "\n"
using namespace std;
void oj()
{
ios::sync_with_stdio(0);cin.tie(0);cout.ti... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
void contest()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main()
{
contest();
fast
///// CODE BELOW //////////
lon... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utilit... |
#include<cstdio>
#define F(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
using namespace std;
template<typename T>void read(T &x)
{
bool neg=false;
unsigned char c=getchar();
for(;(c^48)>9;c=getchar())if(c=='-')neg=true;
for(x=0;(c^48)<10;c=getchar())x=(x<<3)+(x<<1)+(c^48);
if(neg)x=-x;
}
int a,b,c;
int main()
{
re... | #define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#pragma GCC target(... |
#include<bits/stdc++.h>
using namespace std;
int main() {
int sum = 0;
int day = 1;
int n;
cin >> n;
for(int i = 1; i < n; i++) {
sum += i;
if(sum >= n) {
break;
}
day++;
}
cout << day << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a, v) memset((a), v, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
void INX(){}
template<typename Head, typename... Tail>
void INX(Head&& head, Tail&&... tail)
{
cin >> head;
INX(forward<Tail>(tail)...... |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #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;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#... |
//#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#include <cmath>
#include <cassert>
#include <algorithm>
using namespace std;
bool
check(int a, int b, int w, int& min, int& max)
{
int imin = int(w / b);
int imax = int(w / a);
auto diff = float(b - a);
min = i... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; (i) < n;i++)
using namespace std;
using ll = long long;
vector<int> g[200000];
ll A[200000];
ll Max_cost[200000];
ll Find_Max(int u){
if(Max_cost[u] != -1) return Max_cost[u];
ll v = 0;
for(int x:g[u]){
v = max({v,A[x],Find_Max(x)});
... |
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll phi[1010000];
void EULERinit()
{
ll top=1000000;
for(int i=2;i<=top;++i)phi[i]=i;
for(int i=2;i<=top;++i)
{
if(phi[i]==i)for(int j=i;j<=top;j+=i)phi[j]-=phi[j]/i;
phi[i]+=phi[i-1];
}
}
ll f1(ll l,ll r){
ll a... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using ull = unsigned long long;
using pii = pair<int, int>; using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using pll = pair<ll, ll>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector... | #include <bits/stdc++.h>
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
using namespace std;
const int maxn = 2e5+10;
int n, a[maxn], b[maxn], p[maxn];
int pre[maxn];
vector<pair<int,int> > ans;
void debug() {
printf("p: ");
REP(i,1,n) printf("%d%c", p[i], " \n"[i==n]);
printf("pre: ");
REP(i,1,n) printf("%... |
#line 1 "/workspaces/compro/lib/template.hpp"
#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>
#ifndef IO_VECTOR
#define IO_VECTOR
template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
int size = v.size();
for (int i = 0; i < size; i++) {
... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sys/types.h>
#include <unistd.h>
#include <vector>
#pragma region macros
#define _overload(_1, _2, _3, name, ...)... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define pq priority_queue
#define ff first
#define ss second
#define pb push_back
#... |
#include <cstdio>
#include <map>
typedef long long LL;
LL x, y;
std::map<LL, LL> mp;
inline LL abs_(LL x) { return x < 0 ? -x : x; }
inline LL min_(LL a, LL b, LL c) { return a > b ? (b > c ? c : b) : (a > c ? c : a); }
inline LL min_(LL a, LL b) { return a > b ? b : a; }
LL solve(LL t) {
if(mp[t]) return mp[t];
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin >> x >> y;
int ans=0;
if(x==y){
ans=x;
}else{
ans=3-x-y;
}
cout << ans <<endl;
} |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dbl(k, x) fixed << setprecision(k) << (x)
template <typename _T>
inline void _DBG(const char *s, _T x) {
cerr << s << " = " << x << "\n";
}
template <typename _T, typename... args>
void _DBG(const c... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define int long long int
#define pii pair<int,int>
const int INF= 1e12;
const int MAX=5e6+5;
const int MAXK=105;
const int mod = 1e9+7;
int gcd(int a, int b)
{
while(b!=0)
{
a=a%b;
swap(a,b);
... |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cmath>
#include<iomanip>
#define pi 3.14159265358979323846
#define mod 1000000007
#define int long long
#define elif else if
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
signed main(){... | /*#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned l... |
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e6 + 1;
long long pre[N],a[N];
int n;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) a[i] = a[i - 1] + a[i];
for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];
long long ... | /*
Solved by sid2104
on 11/11/2020 22:32
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define float long double
#define pb push_back
#define ld long double
#define f(i,a,b) for(int i=a;i<b;i++)
#define mp make_pair
#define pii pair<int,int>... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define pii pair<
#define fi first
#define se second
#define pb push_back
const int N = 2002;
const ll mod = 1e12+7;
ll m, n, t, k, a[N], ans, b[N], d[N], tong, idx, mn, c[N];
vector< pll > adj[N], adt[N];
vector<ll> kq, v;
st... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (int i=0; i<N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (int i=1; i<N; i++) {
if ((A[0] == 1) && (A[i-1] + 1 == A[i])) {
// Do nothing
} else {
cout <... |
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 505555, inf = 1000111222;
char buf[max_n];
string read() {
scanf("%s", buf);
return buf;
}
int n;
string s, t;
void wa() {
puts("-1");
exit(0);
}
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", s... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
#include <cstring>
//ceil(a/b) (a + (b - 1))/ b
usin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
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 (a>b) { a=b; return 1; } return 0; }
bool check(vector<char> v){
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = (m); i < (int)(n); i++)
int solve(string S) {
if ("atcoder" < S) {
return 0;
}
rep(i, S.size()) {
if (S[i] > ... | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#include<queue>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<string>
#define rep(i,n) for (int i=0;i<(n);++i)
using ll = long long;
using namespace std;
using P = pair<int,int>;
#define INF 110000
int main(){
ll a,b,c,d;
cin>>a>>b>>c... | #define MOD_TYPE 2
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target(... |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a*a+b*b<c*c) printf("Yes\n");
else printf("No\n");
return 0;
}
| #include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int mod=1e9+7;
//Note:
// 1.Perform binary search on sorted array only.
// 2.For ceil caculations we can use something like ceil(10/(double)3)-->>4
#define ff first
#define ss second
#define pb push_back
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
double a, b;
cin >> a >> b;
double c = 100*b/a;
cout << 100-c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define repA(i, a, n) for(ll i = a; i < (n); ++i)
#define repD(i, a, n) for(ll i = a; i > (n); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (long long) (x).size()
#define fill(a) memse... |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;i++)
#define REPA(i,j) for(int i=1;i<=j;i++)
#define FORN(i,j,k) for(int i=j;i<k;i++)
#define vi vector<int>
#define vvi vector<vi >
#define p... | /*
______________________ _______ _______ _______ _______
( ____ \__ __( __ \ ( ____ | ___ | ____ ( ___ )
| ( \/ ) ( | ( \ ) | ( )| ( ) | ( \/ ( ) |
| (_____ | | | | ) | | (____)| (___) | (_____| (___) |
(_____ ) | | | | | | | __) ___ (_____ ) ___ |
) | |... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && a != c) cout << c << endl;
else if (a == c && a != b) cout << b << endl;
else if (b == c && b != a) cout << a << endl;
else if (a != b && b != c) cout << "... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
// Your code here!
int A,B,W;
vector<int> candi;
scanf("%d %d %d",&A,&B,&W);
W = W * 1000;
if(W%B == 0 && W/B<=W/A)
printf("%d %d\n", W/B, W/A);
else if(W/B+1<=W/A)
printf("%d %d\n", W/B+1,W/A);
... |
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
if(N%2==0)cout << "White" << endl;
if(N%2==1)cout << "Black" << endl;
return 0;
} | // --------------------------------------------------<C++ TEMPLATE>------------------------------------------------
/**
* Nitin Gangwar
* @wargang (codechef,codeforces,spoj,gfg)
* MNNIT allahabad
* CSE'23
* iamnitingangwar2000@gmail.com
**/
#include <bits//stdc++.h>
using namespace std;
// MA... |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n;
string s,t;
int main(){
cin>>n>>s>>t;
reverse(s.begin(),s.end());
reverse(t.begin(),t.end());
s=" "+s;t=" "+t;
int base=1;
bool con[10],tmp[10];
for(int i=0;i<10;i++)con[i]=0,tmp[i]=0;
... | #include<bits/stdc++.h>
using namespace std;
void __print(int x){cout<<x;}void __print(long x){cout<<x;}
void __print(long long x){cout<<x;}void __print(unsigned x){cout<<x;}
void __print(unsigned long x){cout<<x;}void __print(unsigned long long x){cout<<x;}
void __print(float x){cout<<x;}void __print(double x){cout<<x... |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) ... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n),... |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a,b,c;
cin>>a>>b>>c;
if(a==b&&b==c){
cout<<"Won"<<endl;
}else{
cout<<"Lost"<<endl;
}
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll INF=1e18;
const int MOD=1e9+7;
ll dp[1<<18][18];
int main(){
int N; cin >> N;
int x[N],y[N],z[N];
for(int i=0;i<N;i++){
cin >> x[i] >> y[i] >> z[i];
}
for(int i=0;i<(1<<18);i++){
... | #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) { a = b; return 1; } return 0; }
#define ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef long double ld;
const int inf = 1e9 + 7;
const int mod = 998244353;
const int maxn = 1e6 + 3;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#de... | #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define un_map unordered_map
#define rep(i,a,n) for (int i = a; i < n; ++i)
#define rrep(i,a,n) for (int i = a; i >= n; --i)
#d... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LL long long
#define int long long
#define ull unsigned long long
#define fi first
#define s... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
double N; cin >> N;
double ans = 0;
for(int i=1; i<N; i++){
ans += N/i;
}
printf("%.10f",ans);
} | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+10;
double dp[maxn];
int main()
{
int n;scanf("%d",&n);
dp[0]=0;
for(int i=1;i<=n;i++){
dp[i]=(dp[i-1]*(n-i+1)+n)/(n-i+1);
}
printf("%.10lf\n",dp[n]-1);
} |
//AUTHOR: RAVAN_2070
//PUNE INSTITUTE OF COMPUTER TECHNOLOGY
/*
I ♥ CLARICE STARLING...
EXPLAINATION BELOW->
*/
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull... | #include <bits/stdc++.h>
using namespace std;
// function to count the no of removal of digits
// to make a very large number divisible by 3
int divisible(string num)
{
int n = num.length();
// add up all the digits of num
int sum = accumulate(begin(num), end(num), 0) - '0' * 1;
// if ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using P=pair<int,int>;
using ll=long long;
using ld=long double;
int main(){
ll n,m,x,y,inf=1e18;
cin >> n >> m >> x >> y;
x--; y--;
vector<vector<vector<ll>>> a(n,vector<vector<ll>>(0,vector<ll>(3)));
rep(i,m){
ll c,d,t,... | #pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
#define fi first
#define se second
#define ins insert
#define sz(x) (int)x.size()
#define dbg(x) cout << x << "\n";
const int N = 1e5 + 5;
con... |
#include <bits/stdc++.h>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 1e18;
const ll fact_table = 320000;
priority_queue<ll> p... | /*
One more time, one more time
“Please just lemme roll for another day”
That’s what she said, What she said
Don’t you know the meanings are hidden under cover?
“One more time? Stop it’s fine.”
“Are’nt you getting tired of doing this?”
“I’ll stop your breath from rolling out… for now.”
*/
/*
... - "How many times wil... |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
const int MAX = 550;
const int MAXM = 1e8+50;
struct Edge{
int v, w, next;
}es[MAXM];
int head[MAX*MAX], k, n, m;
int A[MAX][MAX], B[MAX][MAX];
int id[MAX][MAX], idx;
int d[MAX*MAX];
bool vis[MAX*MAX];
void add(int u, int v, int w) {
es[+... | #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<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp ... | #pragma GCC optimize(2)
#include <cstdio>
#include <vector>
#include <iostream>
using namespace std;
#define int long long
#define maxn 1000005
vector < int > d[maxn];
int cnt;
bool vis[maxn];
int prime[maxn], mu[maxn], pre[maxn];
void init( int n ) {
mu[1] = 1;
for( int i = 2;i <= n;i ++ ) {
if( ! vis[i] ) prime... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int h , w;
cin >> h >> w;
int n = h * w;
vector<int> v(n);
rep(i,n){
cin >> v[i];
}
int Min = *min_e... | //Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#include <iostream> // cout, endl, cin
// string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, mak... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define bs binary_search
#define fi first
#define se second
#define int long long
using pii = pair<int,int>;
using ll = long long;
const int maxn = 2e5;
const int inf = 1e18;
const int mod = 1e9+7;
void o... | #include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define pb push_back
#define pr pair<int,int>
#define fi first
#define se second
#define LL long long
#define mk(a,b) make_pair(a,b)
using namespace std;
int read(){
char x=getchar(); int u=0,fg=0;
while(!isdigit(x)){ if(x=='-') fg=1; x=get... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e2+5;
int x[N],y[N];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x[i]>>y[i];
}
int flag=0;
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{
for(int k=j+1;k<=n... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll N;
cin >> N;
vector<ll> x(N);
vector<ll> y(N);
rep(i, N) {
cin >> x.at(i) >> y.at(i);
}
for (int i = 0; i < N - 2; ++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)... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LL long long
#define int long long
#define ull unsigned long long
#define fi first
#define s... |
#include<bits/stdc++.h>
#define fs first
#define se second
#define pb push_back
#define cppio ios::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
const int maxn=2e5+5;
const ll inf=0x3f3f3f3f;
const ll mod=1e9+7;
int a[maxn],b[maxn];
i... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define l long
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define ld long double
... |
#include <iostream>
#include <algorithm>
using namespace std;
int a, b, n, ans, ans2;
struct A {
int a, b, num;
}Ans[10001];
bool C (A a, A b) {
return a.a < b.a;
}
bool D (A a, A b) {
return a.b < b.b;
}
int main () {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> Ans[i].a >> Ans[i].b;
Ans[i].n... | #include <bits/stdc++.h>
using namespace std;
const int N=1e6+5;
long long arr[N];
int solve()
{
long long n, mn=LLONG_MAX;
cin>>n;
set<long long>st;
for(int i=0;i<n;i++) {
cin >> arr[i];
st.insert(arr[i]);
mn = min(mn, arr[i]);
}
long long ans=mn*n;
for(auto j=st.be... |
// code by lynmisakura. wish to be accepted!
#include<bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i = 0;i < N;i++)
#define rng(i,a,b) for(int i = a;i < b;i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define lmd(func) auto func = [&]
#define mp make_pair
#defin... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long n,x,a[110],f[110][110][110],ans=1145141919810233454;
int main()
{
scanf("%lld %lld",&n,&x);
for(int i=1;i<=n;++i) scanf("%lld",&a[i]);
for(int s=1;s<=n;++s)
{
memset(f,-0x3f,sizeof(f));
f[0][0][0]=0;
for(int i=1;i<=n;++i)
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
int64_t M,z=0;
cin>>S>>M;
int64_t N=S.size(),K=*max_element(S.begin(),S.end())-'0';
if(N<2){
cout<<(M<K?0:1);
return 0;
}
int64_t ok=0,ng=M+10;
while(ng-ok>1){
__int128 m=(ok+ng)/2,sum=0,temp=1,l=0;
for(int j=N-1;j>=0;te... | #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>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll dp[... | #include <bits/stdc++.h>
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define all_of(v) (v).begin(), (v).end()
#define sort_unique(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define fi first
#define se second
const int MAXN = 101;
//const LL INF = (... |
#include <bits/stdc++.h>
//#include <atcoder/all>
typedef long long ll;
using namespace std;
//using namespace atcoder;
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) for(ll i = 0; i < (ll)n; i++)
#define _reps(i, s, n) for(ll i = (ll)(s); i < (ll)n; i++)
#define REP(...) _overload(__VA_ARGS__, _rep... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<ctime>
#include<map>
#define ll long long
#define MAXN 200005
#define uns unsigned
#define INF 0x3f3f3f3f
#define lowbit(x) ((x)&(-(x)))
using namespace std;
inline ll rea... |
#include <bits/stdc++.h>
#include <bits/stdint-intn.h>
#include <algorithm>
#include <cstdint>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s == "AND") {
A[i] = 0;
} else {
A[i] = 1;
}
}
int64_t... | //D
#include <bits/stdc++.h>
using namespace std;
#define sc scanf
#define pr printf
#define ll long long
#define int long long
#define mst(x) memset(x, 0 ,sizeof x)
#define FILE_OUT freopen("out", "w", stdout);
#define FILE_IN freopen("in", "r", stdin);
#define debug(a,b) cout<<a<<" : "<<b<<endl;
#define INF 0x3f3f3f3... |
#include <bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define vecp vector<pair<ll,ll> >
#define mapp map<ll,ll>
#define mapit map<ll,ll>::iterator
#define mapr map<pair<ll,ll>,ll>
#define maprit map<pair<ll,ll>,ll>::iterator
#define fs first
#define sc second
#define bg begin()
#define en end()
#defi... | /**
* author: shu8Cream
* created: 02.05.2021 10:37:54
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<double>;
using vvi = vector<vi>;
int n;
double D,H;
bool chec... |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int MOD=1000000007;
//~ const int MOD=998244353;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
int c[300000];
unordered_map<int,int>mp[300000];
vector<int>v[300000];
... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s,t) for(ll i = (ll)(s); i < (ll)(t); i++)
#define rrep(i,s,t) for(ll i = (ll)(s-1);(ll)(t) <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> Pll;
typede... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.