code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (... | #include "bits/stdc++.h" // Tomasz Nowak
using namespace std; // XIII LO Szczecin
using LL = long long; // Poland
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
template<class T> int size(T &&x) {
return int(x.size());
}
template<class A, class B> ostream& operator<<(o... |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <string>
#include <queue>
using namespace std;
int n, a[3009][5];
int vis[4][1 << 5];
int fu(int x) {
memset(vis, 0, sizeof(vis));
vis[0][0] = 1;
for(int i = 0; i < n; i ++) {
for(int j = 0; j < 3; j ++) {
for(int k ... | #include <bits/stdc++.h>
using namespace std;
bool join(int p, vector<vector<int>> a){
int n = a.size();
vector<uint> vec(32);
for(vector<int> ai : a){
uint bit = 0;
for(int j = 0; j < 5; j++){
if(ai[j] >= p) bit += (1<<j);
}
vec[bit] = bit;
}
//for(uint ... |
#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int N = 1e5+20;
const int M = 19;
int dis[M][N];
int vis[N];
vector<int> G[N];
int n,m,k,C[N],f[N*2][M];
priority_queue<pair<int,int> >q;
void dij(int *dis,int x)
{
for(int i=1;i<=n;i++)dis[i]=inf,vis[i]=0;
dis[x] = 0;
q.push(make_pair(0,x));
w... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
struct edge{int to; ll cost;};
using P = pair<ll,int>;
const ll INF = 1e17;
void dijkstra(int n, int s, vector<vector<edge>>& g, vector<ll>& d){
priority_queue<P,vector<P>,greater<P>> que;
rep(i,n) ... |
/**
* Author: Daniel
* Created Time: 2021-05-18 18:12:02
**/
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ER erase
#define IS insert
#define PI acos(-1)
#define PB pop_back
#define MP make_pair
#define MT make_tuple
#define LB lower_bound
#define UB upper_bound
#define EB... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long int ll;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c... |
#include<bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define dofloat cout<<fixed<<setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(),vec.end()
#define rall(vec) vec.rbegin(),vec... | #include <stdio.h>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include ... |
#include<bits/stdc++.h>
using namespace std;
long long int MOD = 1000000007;
void mult(vector<vector<long long int>> &a, vector<vector<long long int>> &b, int n) {
vector<vector<long long int>> c(n, vector<long long int>(n, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
f... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<list>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<cmath>
#include<cctype... |
#include <bits/stdc++.h>
using namespace std;
#define all(c) c.begin(),c.end()
#define sz(x) int(x.size())
#define ar array
typedef long long ll ;
typedef vector<int> vi;
#define mod 1000000007
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll exp(ll x,ll y){
x%=mod;
ll res=1;
while(y){... | #include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif
template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typen... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<... |
# include<iostream>
# include <algorithm>
# include <queue>
# include <vector>
using namespace std;
int n;
long long a[200010],b[200010];
long long c[200010];
int main(void)
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
scanf("%lld",&a[i]);
for (int i=1;i<=n;i++)
scanf("%lld",&b[i]);
long long ans =... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define int long long
#define sz(c) (int)c.size()
#define fr first
#define ll long long
#define sc second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define ... |
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while(!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return r... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#includ... |
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) i... | #include<bits/stdc++.h>
using namespace std;
#pragma region atcoder
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#pragma endregion
#pragma region macros
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<i... |
#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>;
#define _GLIBCXX_DEBUG
#define rep(j, m) for (ll j = 0; j < (ll)(m); j++)
#define rep2(i, l, n) for (ll i = l; i < (ll)(n); i++)
#... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <cmath>
#include <tuple>
#if defined _DEBUG
#include "TestCase.... |
#include<iostream>
using namespace std;
int main()
{
int a,n,b,c;
cin>>a>>n>>b;
c=a-n+b;
cout<<c;
return 0;
} | #include<bits/stdc++.h> // 76 87
using namespace std;
#define rep(x,k,n) for(int x=(k); x<(n); ++x)
#define repr(x,k,n) for(int x=(k); x>(n); --x)
#define tr(it,a) for(auto it = (a).begin(); it != (a).end(); ++it)
#define ll long long
#define siz(x) ((int)(x).size())
#define print... |
/*
Author: klmcoder
Date : 20210213 1834 hrs.
Info : atcoder [arc112-A]
*/
#include <iostream>
int main(void)
{
int t, a, b;
long v1;
unsigned long v2;
std::cin >> t;
while(t--)
{
std::cin >> a >> b;
v1 = b - 2*(long)a + 1;
if(v1<0)
std::cout << "0\n";
else
{
v2=(... | #include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll mod = 1e9 + 7;
void solve() {
ll l, r;
cin >> l >> r;
if (r < 2 * l) {
cout << 0 << endl;
return;
}
cout << (1 + r - 2*l + 1) * (r - 2*l + 1) / 2 << endl;
}
int main(void) {
int t;
cin >> t;
for(int i = 0;i < t;++i) {... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
list<char> l;
int mode=0;
for(int i=0;i<S.size();i++){
if(S[i]=='R') mode=1-mode;
else{
if(S.size()==0) l.emplace_back(S[i]);
else{
if(mode==0){
cha... | constexpr bool isDebugMode = false;
int testcase = 1;
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const ... |
/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int ,int > pii;
mt19937 rng(chrono::steady_clock::now().time_sinc... | #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 MOD = 998244353;
long long modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
... |
#include <cstdio>
#include <algorithm>
using namespace std;
int p[505];
int ans[250005];
int main()
{
int T,n,m;
bool f,ff;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&p[i]);
m=0;
f=true;
for(int i=1;i<=n;i++)
... | #include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
long long dp[60][2],i,j,n,a[61],x=0,y=0,k=1,l=0;
int main(void)
{
char s[60][60];
scanf("%lld",&n);
for(i=0;i<n;i++) scanf("%s",s[i]);
dp[0][0]=1; dp[0][1]=1;
for(i=0;i<n;i++){
for(j=0;j<2;j++){
if(s[i][0]=='O'){
x=max(j,k); y=max... |
#include <iostream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <set>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repp(i, s, n) for(int i = (int)s; i < (int)n; i++)
#define... | /**
* author: doublevgp
* Which can not destroy me will make me strong
**/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
const double PI = acos(-1.0);
const double... |
/*Lucky_Glass*/
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=2e5+10;
inline int Rint(int &r){
int b=1,c=getchar();r=0;
while(c<'0' || '9'<c) b=c=='-'? -1:b,c=getchar();
while('0'<=c && c<='9') r=(r<<1)+(r<<3)+(c^'0'),c=getchar();
return r*=b;
}
int n,... | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for(int i = (j); i < (int)(n); i++)
#define print(t) cout << t << endl
using ll = long long;
using Graph = vector<vector<int>>;
#define SIZE(s) ll(s.size())
int main(){
int N, X; cin >> N >> X;
string S; cin >> S;
rep(i, 0, N){
if(S.a... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
vector<int> arr(3);
cin >> arr[0] >> arr[1] >> arr[2];
sort(arr.begin(), arr.end());
if (arr[0] == arr[1]) {
cout << arr[2];
} else if (arr[1] == arr[2]) {
cout << arr[0];
} else {
cout ... |
#include <bits/stdc++.h>
using namespace std;
#define mod 998244353
typedef long long ll;
int n,m;
ll memo[5005][5005],pwr[5005];
ll exp(int pos,int val){
if(pos==0)return 1;
if(memo[pos][val]!=-1)return memo[pos][val];
return memo[pos][val]=((val-1)*pwr[pos-1]+(m-val)*exp(pos-1,val))%mod;
}
int main(){
scanf("%... | // #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>
#define ll long long int
using namespace std;
int main() {
int k,a,b,c;
cin>>k;
ll ans = 0;
for(int a=1;a<=k;a++){
for(int b=1;a*b<=k;b++){
ans += k/(a*b);
}
}
cout<<ans;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... |
#include <cmath>
#include <vector>
#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <set>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <climits>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <memory>
#include <functional... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_... | #include<iostream>
#include<vector>
#include<algorithm>
long long N,A,B,p=0LL;
using namespace std;
int main(){
cin>>N;
vector<long long>town(N);
for(int i=0;i<N;i++){cin>>A>>B;p-=A;town[i]=A*2+B;}
sort(town.rbegin(),town.rend());
for(int i=0;i<N;p+=town[i],i++)if(p>0LL){cout<<i<<endl;return 0;}
... |
#include <iostream>
#include <string>
#include <vector>
#include <unordered_set>
#include <cmath>
long long CalcPoints(std::string str)
{
int strlen = str.size();
int pointArray[10] = {0};
long long ret = 0;
for(int i = 0; i < strlen; i++){
if(str[i] == '#') continue;
int tmp = str[i] -... |
#include <bits/stdc++.h>
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;
const int ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int n;
cin>>n;
string s;
cin>>s;
vector<int> min_rem(n+1, n);
min_rem[n]=0;
vector<int> ending_with_char(26, -1);
for(int i=n-1;i>=0;i--){
if(i==n-1)... | #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;
const int maxn=2e5+1000;
int n,q,c[maxn],fa[maxn];
map<int,int> a[maxn];
void read(int &x)
{
char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar()) if(ch=='-') ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar()); if(ok) x=-x;
}
int getfa(int x)
{
if(fa[x]==x... | #include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <numeric>
#include <math.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < (long long int)(n); i++)
#define irep(i, n) for (long long int i = 1; i <= (long ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 998244353
#define maxn 1000007
int main()
{
ios::sync_with_stdio(0);
ll a,b,c;
cin>>a>>b>>c;
cout<<a*(a+1)/2%mod*(b*(b+1)/2%mod)%mod*(c*(c+1)/2%mod)%mod<<endl;
return 0;
}
| #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
#define N 200005
#define NN 1005000
#define PB push_back
#define M ll(1e9 + 7)
#define all(x) x.begin(), x.end... |
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <iostream>
#include <utility>
#include <algorithm>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>
#include <unordered_set>
#include <set>
#include <tuple>
#include <cassert>
#include <cmath>
us... | #include<iostream>
#include<vector>
#include<bits/stdc++.h>
// #define mod 1000000007
#define pi 3.14159265358979
#define PRE(x,p) cout<<setprecision(x)<<p;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define endl "\n"
#define high INT_MAX
#define low INT_MIN
#define ll ... |
#include <bits/stdc++.h>
#define int long long
#define mod 1000000007
#define i_max INT_MAX
#define i_min INT_MIN
#define s_i set<int>
#define v_i vector<int>
#define v_s vector<string>
#define v_c vector<char>
#define stk_i stack<int>
#define q_i queue<int>
#define qp_ii queue<pair<int, int>>
#define pqp_ii priority_q... | #include <iostream>
using namespace std;
int main (){
double a,b;
cin >> a>>b;
cout << 100-b*100/a << endl;
return 0;
} |
/*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
string char_to_string(char val) {
return string(1, val);
}
int ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
void rec(int *idx, int s, int baki, function<void(int *)> fun)
{
if (baki == 0) fun(idx);
else
{
if (s < 0) return;
re... | /**
* In The Name Of God
* author : Behradm
* Idvwhu wkdq idvw, Txlfnhu wkdq txlfn, L dp Oljkwqlqj, Vshhg, L dp Vshhg :D :D
**/
#include "bits/stdc++.h"
using namespace std;
const int N = 300;
int a[N];
vector<int> cnt[N];
int n;
vector<int> Recover(int mask) {
vector<int> res;
for (int i = 0; i < n; i++)... |
/* ** *** In the name of God *** ** */
// Only Haider is Amir al-Momenin
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define ij for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++)
const ll maxn = 810;
int a[maxn][maxn], b[maxn][maxn];
vector<int> v;
int n, k;
bool check(int ... | #include<iostream>
#include<climits>
#include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define mod 998244353
int main()
{
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
LL N ,K;
cin >> N >> K;
... |
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#inc... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace chrono;
typedef long long int ll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define pb push_back
#define odd(x) ((x)&1)
#define even(x) (!odd(x))
#define all(v) (v).begin(),(v).e... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<double> a(N),b(N),c(N),d(N);
for(int _=0; _<2; _++){
for(int i=0; i<N; i++) cin >> a[i] >> b[i];
int x = 0, y = 0;
for(int i=0; i<N; i++){
x += a[i];
y += b[i];
a[i] ... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
const int mod=1e9+7;
const int maxV=2e7+1;
const ll inf=1e18+1;
int main(){
int n;
cin>>n;
map<int, ll> mp1, mp... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define x first
#define y second
#define bg begin()
#define ed end()
#define pb push_back
#define mp make_pair
#define sz(a) int((a).size())
#define R(i,n) for(int i(0);i<(n);++i)
#define L(i,n) for(int i((n)-1);~i;--i)
const int iin... | #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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int sled0[500005];
int sled1[500005];
int mvs[500005];
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
string s, t;
cin >> s >> t;
... | #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>
#define rep(i, n) for(int i = 0; i < (int) (n); i++)
using namespace std;
#define INF 100000000
#define MAX_N 18
int N, ds0[MAX_N], ds1[MAX_N], d[MAX_N][MAX_N], dp[1<<MAX_N][MAX_N];
int rec(int bit, int v){
if(dp[bit][v] < INF) return dp[bit][v];
if(bit == (1<<v)) return dp[bit][v] = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const long long MOD = 998244353;
const long long INF = 9999999999999999;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
... |
#include<bits/stdc++.h>
#define ll long long
#define reg register
#define mp make_pair
#define ri register int
#define ld long double
using namespace std;
const int mxn=2e5+5;
vector<int>g[mxn];
int n,m;
int a[mxn];
int dp[111][5555][111];//i sum cnt
const ll md=998244353;
ll frac[mxn];
inline void solve(){
cin>>n;
f... | #include<bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> p2;
#define sz(a) ll(a.size())
char s[5005][5005];
ll dp[5005][5005][3],r[5005][5005],c[5005][5005],p[100005],hell=998244353;
map<char,ll> st... |
#include <cstdio>
#define ll long long
using namespace std;
int n,m;ll p[5010],g[5010][5010],ans;
const ll mod=998244353;
int main()
{
scanf("%d %d",&n,&m);
p[0]=1;
for(int i=1;i<=n;i++)
p[i]=p[i-1]*m%mod;
for(int i=0;i<=m;i++)
{
g[i][0]=1;
for(int j=1;j<=n;j++)
g[i][j]=g[i][j-1]*i%mod;
}
ans=p[n]*n%mod... | #include <bits/stdc++.h>
#define int long long
using namespace std;
// https://github.com/nweeks1/UltiSnips
template <const int32_t MOD> struct ModInt {
long long x;
ModInt() : x(0) {}
ModInt(long long u) : x(u) {
x %= MOD;
if (x < 0)
x += MOD;
}
friend bool operator==(const ModInt &a, const Mo... |
#include <iostream>
#include <cassert>
#include <numeric>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
#include <cmath>
using namespace std;
int main() {
long long int n;
cin>>n;
long long int ans=0;
long long int s=0;
for (int i = 1; i <= sqrt(2*n); i++)
{
if ((2*n... | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
const int maxn = 210;
int n;
ll dp[maxn][maxn];
ll read(){ ll s = 0, f = 1; char ch = getchar(); while(ch < '0' || ch > '9'){ if(ch == '-') f = -1; ch = getchar(); } while(ch >= '0' &&... |
#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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = unsigned long long;
struct Town
{
ll val = 0ULL;
ll a = 0ULL;
ll b = 0ULL;
};
bool operator<( const Town& lhs, const Town& rhs )
{
return lhs.val < rhs.val;
}
vector<Town> in;
int main()
{
int n;
cin >> n;
ll sumA = 0... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll arr[300005];
ll suffix[300005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
for(int i=1; i<=n; i++) cin>>arr[i];
for(int i=n; i>=1; i--) suffix[i] = suffix[i+1]+arr[i];
ll ans = 0;
for(int i=1; i<=n; i++){
ll... | #include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using... |
#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<utility>
#include<cassert>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
// #define _GLIBCXX_DEBUG
template <class T> using V = vector<T>;
#define ALL(v) (v).begin(),(v).end()
#... |
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <cassert>
#include <queue>
#include <random>
#include <unordered_set>
#incl... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<l... |
#include<iostream>
using namespace std;
int main(){
int n;
long long cnt=0;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n/i;j++){
for(int k=1;k<=n/i/j;k++){
cnt++;
}
}
}
cout<<cnt<<endl;
return(0);
}
| #include<iostream>
#include<utility>
#include<algorithm>
#include<set>
#include<vector>
#include<cmath>
#define forn(i, x, n) for(int i = x; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int mod = 998244353;
const bool DEBUG = 0;
vector<int> primes;
vector<int> lp(2e5+1);
void sieve(){
forn(... |
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#pragma GCC optimize(2)
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<string>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
using namespace std;
typedef long long ll;... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector... |
#include<bits/stdc++.h>
#define endl '\n'
#define ri register
#define QAQ(m,n) for(ri int i=m;i<=n;i++)
#define QWQ(m,n) for(ri int j=m;j<=n;j++)
typedef long long ll;
using namespace std;
int main ()
{
double a, b;
cin >> a >> b;
cout << (a - b) / a*100 << endl;
return 0;
} | #include <iostream>
using namespace std;
typedef long long ll;
int main () {
int H, W;
int min = 101;
int sum = 0;
cin >> H >> W;
for (int h=0; h<H; h++) {
for (int w=0; w<W; w++) {
int tmp;
cin >> tmp;
sum += tmp;
if (tmp < min)
min = tmp;
}
}
cout << sum - min*H*W << endl;
return 0;
} |
//g++ 7.4.0
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//A + k*B <= D*C*k
//A/(D*C - B) <= k;
ll A,B,C,D; cin>>A>>B>>C>>D;
ll num = A;
ll den = D*C - B;
if(den <= 0)
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD (ll)1000000007
#define pi 3.14159265358979323846264338327
#define pii pair<int,int>
#define pll pair<ll,ll>
#define UNIQUE(v) sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());
ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
ll p... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tt=1;
//cin >> tt;
while(tt--)
{
int n;
cin >> n;
int a[n],b[n];
for(int i=0;i<n;i++)
cin >> a[i];
for(int i=0;i<... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <list>
#include <algorithm>
#include <string.h>
#include <stack>
#include <map>
#include <set>
using namespace std;
int main(int argc, char *argv[])
{
int n;
cin >> n;
vector<long long> a(n);
long long cu = 0;
for (int i = 0; i < n;... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using std::cin;
using std::cout;
using std::endl;
using std::sort;
using std::string;
using std::vector;
// using namespace atcoder;
typedef long long ll;
#ifdef _DEBUG
#define DEBUG(x) cout << #x << ": " << x << endl;
#else
#define DEBUG(x)
#endif
#define ALL(obj) ... | #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 - 1; i >= b; i--)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ll long long
#define dbwt(x) std::cout... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #line 1 "main.cpp"
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const ll mod=998244353;
const int N=2e6+1;
ll n,m;
ll a[N],b[N];
void solve(){
cin >> n >> m;
for(int i=1; i<=n ;i++){
ll x;cin >> x;a[x]++;
}
ll ans=0;
for(int i=0; i<=n+10 ;i++){
m=min(m,a[i]);
ans+=m;
}
... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define... |
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
typedef pair <pii, int> ppi;
const int N = 1010;
const int M = 3200;
const int mod = 998244353;
int a[2];
void solve() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
int... | #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 <bits/stdc++.h>
using namespace std;
//ofstream cout("output.out");
#define fast() {ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define mii map<int, int>
#define pii pair<int, int>
#define qii prio... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<ll,ll>;
const ll INF = 1e18;
ll N, M, S, T;
vector<tuple<ll,ll,ll,ll>> edge;
//経路復元なしDijkstra法
vector<ll> dijkstra(ll start, const vector<vector<pair<ll,ll>>>& Hen){
ll N = Hen.size();
vector<ll> dist(N, INF);
dist[start] = 0;
... |
#include <cstring>
#include <cstdlib>
#include <map>
#include <unordered_map>
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <iostream>
#include <set>
#include <unordered_set>
using namespace std;
#define ABS(a) ((a)<0?(-(a)):(a))
#... | #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 pb push_back
#define ll long long
#define ld long double
#define sz(x) (ll)x.size()
#... |
#include <cassert>
#include <iostream>
using namespace std;
constexpr int M = 998244353;
long long modexp(int x, long long e, int m) {
long long ans = 1, p = x % m;
while (e > 0) {
if (e % 2 != 0) ans = (ans * p) % m;
p = (p * p) % m;
e >>= 1;
}
return ans;
}
long long modinv(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename A, typename B = A> using pr = pair<A, B>;
#define vec vector
#define ar array
#define len(a) ((int)((a).size()))
#define all(a) (a).begin(), (a).end()
const int mod = 998244353;
struct mint {
int val;
explicit mint() : val(... |
#include <stdio.h>
#include <math.h>
int main(){
long long int n, x[200], y[200], r[200], a[200], b[200], c[200], d[200];
scanf( "%lld", &n );
for( int i = 0 ; i < n ; i++ ){
scanf( "%lld%lld%lld", &x[i], &y[i], &r[i] );
}
for (int i = 0; i < n ; i++){
a[i] = floor( 10000 / n ) * i ... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
using ull = unsigned long long;
#define loop(n) for(ull i=0;i<n;i++)
int main(){
int n;
cin >> n;
loop(n){
ull x,y,r;
cin >> x >> y >> r;
cout << x << " " << y << " " << x+1 << " " << y+1 << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef int ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __builti... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
int n;
cin >> n;
vector< int > p(n+1);
vector< vector< int > > p2c(n+1, vector< int >());
for(int i = 2; i <= n; i++){
cin >> p[i];
p2c[p[i]].push_back(i);
}
vector< int > dp(n+1,... |
#include <iostream>
using namespace std;
int main()
{
double x,y;
cin >> x >> y;
long double z = ((x-y)/x)*100;
cout << z << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define sz(v) ((int)(v).size())
#define endl '\n'
#define IO ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define sortA(v) sort(v.begin(), v.end())
#define sortD(v) ... |
#include <bits/stdc++.h>
using namespace std;
template <int64_t mod>
class modint {
int64_t x;
public:
modint(int64_t x = 0) : x((x % mod + mod) % mod) {}
modint operator-() const { return modint(-x); }
modint& operator+=(const modint& a) {
if ((x += a.x) >= mod) x -= mod;
return *this... | #include<bits/stdc++.h>
#define fasterthanlight ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define endl "\n"
#define int long long
#define vi vector<int>
#define pb push_back
#define p 1000000007
#define MAX 1e9
#define MIN -1e9
#define hi "visited\n" //sasta debugging
using namespace std;
//autho... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll inf=1e18,mod=1e9+7;
ll fun(ll n){
ll res=0;
while(n){
res++;
n/=10;
}
return res;
}
bool comp( pair<ll,ll> a, pair<ll,ll> b){
if(a.second!=b.second)
return a.second>b.second;
return a.first>b.first;
}
... | #include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x... |
/**
／＞ フ
| _ _|
／`ミ _x 彡
/ |
/ ヽ ﾉ
／￣| | | |
| (￣ヽ＿_ヽ_)_)
＼二つ
**/
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <iostream>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, mx = -1e18;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
vector<int> graph[n], cost(n);
for (int i = 0; i < n; i++) {
cin >> cost[i];
}
for (int i = 0; i < m; i... |
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int c1[10], c2[10], cnt[10];
long double fav, tot;
int qpow(int x, int e){
if(!e) return 1;
if(e&1) return qpow(x,e-1)*x;
return qpow(x*x,e>>1);
}
main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
... |
#include <bits/stdc++.h>
using namespace std;
template<int M>
struct static_mint {
static_assert(0 < M, "Module must be positive");
int val;
static_mint(): val() {}
static_mint(long long x) : val(x % M) { if (val < 0) val += M; }
static_mint pow(long long n) const { static_mint ans = 1, x(*this); while (n) { if ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a>b)
cout<<"Takahashi";
else if(a<b)
cout<<"Aoki";
else
if(c==1)
cout<<"Takahashi";
else
cout<<"Aoki";
return 0;
}
|
#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y... | #include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <tuple>
#include <numeric>
using namespace std;
int main(int argc, char* argv[]){
int n;
cin>>n;
vector<pair<long long, long long>>a(n);
vector<pair<long l... |
// 問題の URL を書いておく
//
#include <bits/stdc++.h>
using namespace std;
//#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: "... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = l... |
#include<bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define sz(v) ((int)((v).size()))
#define ll long long
#define pb push_back
#define fIO ios_base::sync_with_stdio(0);cin.tie(0);
const ll oo = 1e8;
const double pi = 3.1415... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define br "\n"
#define sp " "
#define pie 3.141592653589793238462643383279
#define fo(i, n) for(int i=0;i<n;i++)
#define rfo(i, n) for(int i=n-1;i>=0;i--)
#define forl(i,a,n) for(int i=a;i<n;i++)
#define forr(i,a,n) for(int i=n-1;i>=a;i--)
#define tr(it... |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
s.push_back(s[0]);
s.erase(s.begin());
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a ... |
#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i++)
#define per(i, r, l) for(int i = (r); i >= (l); i--)
#define mem(a, b) memset(a, b, sizeof a)
#define For(i, l, r) for(int i = (l), i##e = (r); i < i##e; i++)
#define pb push_back
#define eb emplace_back
#define upd(a, b) (a = min(a, b))
usi... | #include <bits/stdc++.h>
#define int int64_t
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
int n; cin >> n >> s;
if(s[0] != s[n - 1])
return cout << "1", 0;
for(int i = 1; i < n - 2; i++) {
if(s[i] != s[0] and s[i + 1] != s[0])
... |
#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;
template<typename T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// #pragma GCC target ("avx2")
// #pragma GCC opti... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
const long long INFLL = 1e18;
using ll = long long;
char RSP(char i, char j){
if(i == 'S' && j == 'P') return 'S';
if(i == 'R' && j == 'S') return 'R';
if(i == 'P' && j == 'R') return 'P';
if(i == 'S' && j == 'R') r... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
long powerm(long long a, long long n, long long m)
{
if (n==1) return a%m;
if (n==0) return 1;
if (n%2) return (a*powerm((a*a)%m,n/2,m))%m;
return powerm((a*a)%m,n/2,m);
}
void amain()
{
long long n; cin >> n;
long long m; cin... | // Artur Kraska, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,P... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#define all(x) x.begin(), x.end()
#ifdef _DEBUG
#define disp(x) cout << #x << " : " << x << endl
#else
#define disp(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
int n; cin ... |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <climits>
#inclu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,max=0,max2=0,t,idx=1,idx2=1;
cin>>n;
vector<ll> a(1<<n);
for(ll i=0; i<(1<<(n-1)); i++){
cin>>t;
if(t>max){
max=t;
idx=i+1;
// cout << max << " "<< idx << endl;
}
}
for(ll i=0; i<(1<<(n-1)); i... |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
const int maxn=(4e5)+10;
int n,fa[maxn],dis[maxn],dep[maxn];
vecto... | //#pragma GCC target("avx,avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define co cout
#define ci cin
#define sf1(n) scanf("%lld",&n)
#define sf2(n,m)... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
int main() {
int N;
long K;
cin >> N >> K;
vector<vector<long long>> dp(4,vector<long long>(3*N+4));
dp.at(0).at(0) = 1;
rep(i,3) {
rep(j,i*N+1) {
dp.at(i+1).at(j+1) += dp.at(i).at... | //by szh
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pai... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int read()
{
int a=0,f=1,c=getchar();
while(!isdigit(c))
{
if(c=='-')f=-1;
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
return a*f;
}
const int N=1e5+10;
const int P=1e9+7;
ll mod(ll x){return (x%P+P)%P;}
int n;
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... |
#include<bits/stdc++.h>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e18
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
const int inf = (int)1e9;
using P = pair<int,int>;
ll gcd(ll a, ll b) {
if (b > a) {
ll tmp = b;
b = a;
a = tmp;
}
if(b==0... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author NikuKyabe
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define vs vector<string>
#define vc vector<char>
#de... | #include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f first
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 5e5+5;
const int INF = 0x3f3f3f3f;
int a[N],b[N];
inline int check1(int n){
int A0 = 0,B0 = 0;
vector <int> s,t;
for(int i = 1;i <= n;++i){
if(a[i] == 0) A0++,s.push_back(i);
if(b[i] == 0) B0++,t.p... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x) cerr << "[" << #x << "]: " << x << "\n";
using ll = long long;
using ld = long double;
using ii = pair<int, in... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,N) for(ll i = 0; i < N; i++)
#define ld long double
int main(){
int n;
scanf("%d",&n);
vector<pair<pair<int,int>,int>> v(n);
rep(i,n) scanf("%d%d%d",&v.at(i).first.first,&v.at(i).first.second,&v.at(i).second);
vector<bool> ans(10002);
... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 110;
int n;
ll X, dp[N][N][N], ans = 1e18, a[N];
int main(){
cin >> n >> X;
for(int i = 1; i <= n; ++ i) cin >> a[i];
for(int t = 1; t <= n; ++ t){ //一共选t个
memset(dp, 0xcf, sizeof dp);
dp[0][0][0] = 0;
for(int i = 1; i <= n; +... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_s... |
#include<iostream>
#include<iomanip>
#include<cassert>
#include<math.h>
#include<complex>
#include<algorithm>
#include<utility>
#include<queue>
#include<stack>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
#include<bitset>
using namespace s... | #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... |
#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... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl '\n'
void testCase()
{
//ll t; cin>>t; while(t--)
{
ll n,k;
cin>>n>>k;
ll s=101;
ll e=n*100+k;
ll ans=0;
for(int i=e;i>=s;i--)
{
if(i==(n*100))
{
i=(n-1)*... |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define... | #include <bits/stdc++.h>
using namespace std;
#define all(c) c.begin(),c.end()
#define sz(x) int(x.size())
#define ar array
typedef long long ll ;
typedef vector<int> vi;
#define mod 1000000007
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll exp(ll x,ll y){
x%=mod;
ll res=1;
while(y){... |
#include <bits/stdc++.h>
using namespace std;
#define w(t) int t; cin>>t; while(t--)
#define mod1 1000000007
#define mod2 998244353
#define ll long long int
#define ull unsigned long long int
#define fast... | /*
* Created on: 20 / 2 / 2021
* Author: Eslam Waheed
*/
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
clock_t T;
#define ctime cerr << "Time : " << double(clock() - T) / CLOCKS_PER_SEC << '\n'
#define Eslam__Waheed ios_base::sync_with_stdio(false);cout.tie(NULL);cin.t... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define STRING(str) #str
#define ll long long
template <typename T >
void print_vec_1d(vector<T> x, string name) {
cout << name << endl;
cout << "[ ";
for (int i=0;i<x.size();i++) {
cout << x[i];
if (i != x.size... | /**
* author:
* created: 15.11.2020 00:24:55
**/
#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
using ll = long long;
const int INF = 1001001001;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1};
typedef vector<int> vi;
typedef vector<vi> v... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll =long long;
using vi = vector<ll>;
using vc = vector<char>;
using vs = vector<string>;
using P = pair<ll , ll>;
using vp = vector<P>;
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define rep2(i, s, n) f... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#... |
#include <stdio.h>
#include <iostream>
#include <vector>
// #include <bits/stdc++.h>
#include <queue>
#include <algorithm>
#include <string>
#include <iomanip>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i,k,n) for(ll i=k; i<(ll)(n); i++)
int main() {
ll n; cin >> n;
vector<ll> ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define N 100005
#define MOD 1000000007
#define dd double
#define vi vector<int>
#define vll vector<ll>
#define forr(i,n) for(ll i=0;i<n;i++)
#define revf(i,n) for(ll i=n-1;i>=0;i--)
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define rep1(i,b) for(ll i=... |
/// HuDzG - NHDanDz "Elderwood" (DangCuto Dep Trai vcl)
#include <bits/stdc++.h>
#define reset(a) memset(a,0,sizeof(a))
#define ll long long
#define ld long double
#define endl '\n'
#define AutoAC int main()
#define OO 1000000000000000000
#define F first
#define S second
#define pii pair <ll, ll>
#define pb push_back
#... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e18;
const ... |
#import<bits/stdc++.h>
#define endl '\n'
using namespace std;
int i,j,k,m,n,p,x,y,a[1005][1005],b[1005][1005],c[1005][1005],d[1005][1005],z[1005][1005];
char s[1005][1005];
void f(int i,int j)
{
if(z[i][j])return;
z[i][j]=k;
if(~a[i][j])f(a[i][j],j);
if(~b[i][j])f(i,b[i][j]);
if(c[i][j]<n)f(c[i][j],j);
if(d[i][j]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
const double pi = 3.14159265358979;
const ll inf = 1e17;
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
#define pii pair<int,int>
#define pll pair<ll,ll>
#define endl "\n"
#define dtor(deg) (((deg)/360)*2... |
#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()
typedef pair<int,int> P;
signed main(){
int n,m,q;cin>>n>>m>>q;
vector<P> v(n);
REP(i,n)cin>>v[i].first>>v[i].second;
sort(ALL(v));
vector<int> x(m);
REP(i,m)cin>>x[i];
auto solve=[&](... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using VI = vector<int>;
#define fst first
#define snd second
void solve(istrea... |
#include "bits/stdc++.h"
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
using namespace std;
using ll = long long;
void A()
{
string s; cin >> s;
if (s[0] == s[1] && s[1] == s[2]) cout << "Won\n";
else cout << "Lost\n";
}
void B()
{
int... | #include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
#define int long long
int safe_mod(int x, int m) {
x %= m;
if (x < 0) x += m;
return x;
}
pair<int,int> inv_gcd(int a, int b) {
a = safe_mod(a, b);
if (a == 0) return {b, 0};
int s = b, t = a;
i... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long template_array_size = 1e6+100;
long long a[template_array_size];
long long b[template_array_size];
ll ans = 21;
void solve(){
ll a,b,c;
cin>>a>>b>>c;
ans = ans - (a+b+c);
cout<<ans<<"\n";
}
int main(){
solve();
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int X, Y, Z;
cin >> X >> Y >> Z;
double a = (double)Z * Y / X;
int b = (int)a;
if(a == b) {
cout << b-1 << endl;
} else {
cout << b << endl;
}
return 0;
} |
#line 1 "/home/siro53/kyo-pro/compro_library/template/template.cpp"
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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>
#inc... |
#include <bits/stdc++.h>
#define REP(i, n) for(i64 i = 0; i < n; ++i)
#define RREP(i, n) for(i64 i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(auto i = a; i != b; ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using i64 = int_fast64_t;
using u64 = uint_fast64_t;
using f64 = double;
using p64 = pa... | #include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
double a,b,c,d;
double x,k;
double s,e;
scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
x=-d*(c-a)/(d+b)+c;
printf("%lf",x);
} |
#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>;
const ll INF = 1001001001;
int main() {
ll N; cin >> N;
vector<vector<ll>> C(N, vector<ll>(N));
vector<ll> A(N), B(N);
// (最小値, 最小値が含まれる行数) を表す Pair
P min... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define pow(n,m) powl(n,m);
#define sqrt(n) sqrtl(n);
const ll MAX = 5000000000000000000;
const ll MOD = 1000000007;
//998244353;
void randinit(){srand((unsigned)time(NULL));}
int main(){
ll N;
cin >> N;
vector<ve... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main()
{
int N, X; cin >> N >>... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define ll long long int
#define ld long double
const int dx8[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dx4[4] = {1,0,-1,0};
const int dy4[4]... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> b(N),M(N);
long long A;
cin >> A;
b.at(0) = A;
for(int i=1; i<N; i++){
long long a;
cin >> a;
b.at(i) = b.at(i-1) + a;
}
M.at(0) = A;
for(int i=1; i<N; i++){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define VI vector<ll>
#define PB push_back
#define MM multimap
#define M map
#define MOD 100000007
#define PRII pair<ll,ll>
#define REP(i,n) for(ll i = 0;i<n;++i)
#... |
#include<iostream>
#include<vector>
#include<string>
#include<queue>
using ll = long long;
ll n;
std::vector<ll> p;
std::queue<std::pair<ll, ll>> que; // end index, size
// return inversion number
ll merge_sort(std::vector<ll> &a, ll pos = 0){
ll size = a.size();
if(size <= 1) return 0LL;
ll cnt = 0LL;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#pragma GCC optimize("O2")
#define CLR(s) memset(&s, 0, sizeof(s))
#define sz(x) ((long long)(x).size())
#define all(x) x.begin(),x.end()
#define rall(x) (x).rbegin(), (x).rend()
#define trav(a,x) for (auto& a : x)
#define ff fir... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.