code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <numeric>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<int>> ability(N, vector<int>(5));
vector<int> max_ability(5);
for (int i=0; i<N; i++){
for (int j=0; j<5; j++){
cin >> ... | #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <iterator>
#include <math.h>
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define MOD 1000000007;
#include <algorithm>
#include <cmath>
using n... |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
set <int> s;
for (int i = 1; i <= 10000; i++)
{
if (i % 6 == 0 || i % 10 == 0 || i % 15 == 0)
{
s.insert(i);
}
}
int n;
cin >> n;
if... | #include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
int n;
cin>>n;
double ans=0;
for(int i=1;i<n;i++){
ans+=(double)(n)/(double)(n-i);
}
cout<<ans;
}
int main(){
ios::sync_with_stdio(0);
cin... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << b - c;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("Error.txt", "w", stderr);
freopen("Input.txt","r",stdin);
freopen("Output.txt","w",stdout);
#endif
long long A,B,C,D; cin >> A >> B >> C >> D;
long long blue = A, red = 0;
for(int i = 1; ... |
//Bismillahir-Rahmanir-Rahim
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int llu;
#define f1(i,n) for(i=1;i<=n;i++)
#define f(i,n) for(i=0;i<n;i++)
#define Max 100009
#define pb push_back
#define mp make_pair
using namespace std;
int main()
{
ll n,i,t,l,r,j,p,x,m;
cin>>n;
... | /**
* Author: dhruv_gheewala
* Problem: __________
* Date: 19.12.2020
* Time: 17:40:04
**/
#if __has_include("debug.h")
#include "debug.h"
#else
#include<bits/stdc++.h>
using namespace std;
#define fundri 108
#define debug(...) 1729
#endif
#define endl '\n'
#define int int64_t... |
#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
usi... | #include <bits/stdc++.h>
#define endl '\n'
#define SZ(x) ((int)x.size())
#define ALL(V) V.begin(), V.end()
#define L_B lower_bound
#define U_B upper_bound
#define pb push_back
using namespace std;
template<class T, class T1> int chkmin(T &x, const T1 &y) { return x > y ? x = y, 1 : 0; }
template<class T, class T1> in... |
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namesp... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MN LLONG_MIN
#define MX LLONG_MAX
#define UL ULLONG_MAX
#define pb push_back
#define e "\n"
#define iff(u,v) if(abs(u-v)<1e-9)
#define vi vector<long long>v,v1,v2;
#define pi 3.1415926536
#define fix cout<<fixed; cout<<setprecision(10);
#define ... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... |
typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
std::cin >> n;
vector<ll> a(n),b(n),p(n);
priority_queue<pair<ll,ll>,vector<pair<ll,ll>>> pq;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) ... | #include <bits/stdc++.h>
#define fir first
#define sec second
#define PB push_back
#define MP make_pair
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define foreach(itr, c) for (__typeof((c).begin()) itr = (c).begin(); itr != (c).end()... |
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
const int maxn=20;
typedef long long ll;
ll f[1<<maxn][maxn],dis[maxn][maxn];
int n,x[maxn],y[maxn],z[maxn],mmax;
int main(){
memset(f,0x3f,sizeof(f));
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
for(int i=1;i<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bo... |
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
/******** Utility ***************/
int bsize(int bits, int _max){
int c = 0;
for(int ix=0; ix!=_max; ++ix)
if((bits&(1<<ix)) !=0){
++c;
}
return c;
}
long factrial(long n){
assert(n >= 0);
if(n <= 1)
return 1;
long _... | #include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<set>
#include<map>
#include<cmath>
#define rep(i ,n) for(int i = 1; i <= n; ++i)
#define Rep(i ,n) for(int i = n; i >= 1; --i)
using namespace std;
typedef long long ll;
... |
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <string>
#include <iostream>
#include <sstream>
#include <ostream>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <iomanip>
#include <set>
#include <bitset>
#include<unordered_map>
#define... | #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 < (n); ++i)
#define io ios::sync_with_stdio(false); cin.tie(0)
const int mod = 998244353;
struct UnionFind {
vector<int> d;
UnionFind(int n=0): d(n,-1) {}
int find(int x) {
if (d[... |
#include<bits/stdc++.h>
using namespace std;
const int N=55;
typedef long long ll;
int n;
ll x,k[N],a[N],b[N],f[N][2];
int main()
{
cin>>n>>x;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<n;i++) b[i]=a[i+1]/a[i];
for(int i=n;i>=1;i--)
{
k[i]=x/a[i];
x%=a[i];
}
if(n==1)
... | #include<iostream>
#include<cstdio>
#define ll long long
using namespace std;
int H,W;
char s[10005];
int numa[10005],numb[10005],numd[100005];
int main(){
scanf("%d%d",&H,&W);
for(int i=1;i<=H;i++){
cin>>s+1;
for(int j=1;j<=W;j++){
if(s[j]=='R') numa[i+j]++;
if(s[j]=='.') numd[i+j]++;
if(s[j]=='B') numb... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <set>
#include <map>
typedef long long ll;
typedef long double ld;
using namespace std;
const int maxn = 2079;
vector<int> f(maxn, 0);
ll gcd(ll a, ll b)
{
if (a < b) swap(a, b);
while (b)
{
ll c ... | #include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
usi... |
#include <bits/stdc++.h>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define int long long
#define ft first
#define sc second
#define ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN = 18;
int n, m, dp[1 << mxN];
bool e[mxN][mxN], trans[1 << mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int a, b; cin >> a >> b, --a, --b;
e[a][b] = e[b][a... |
#include <iostream>
using namespace std;
int absfunc(int a) {
if (a > 0) return a;
else return -a;
}
int main() {
int N;
cin >> N;
pair<int,int> arr[1001];
for (int i=0; i<N; i++) {
int A,B;
cin >> A >> B;
arr[i] = {A,B};
}
int ans = 0;
for (int i=0; i<N-1; i++) for (int j=i+1; j<N; j++... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
using namespace __gnu_pbds;
using namespace std;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) r... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<string> s(h);
for(int i=0;i < h;i++){
cin >> s.at(i);
}
long long ans = 0;
for(int i=0;i < h;i ++){
int mae = 0;
for(int j = 0;j < w;j++){
if(s.at(i).at(j) == '.'){
if(mae == 1){
... | // どこが間違っているか分からない時は,簡単なミス(型,スペル,入力or出力など)をしていたり問題文の見落としがあったりする. 一度落ち着いて頭をリセットしよう.
// 計算途中のオーバーフローに注意しよう
#include "bits/stdc++.h"
#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)
#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a... |
#include <bits/stdc++.h>
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll N, A, B;
cin >> N >> A >> B;
cout << N - A + B << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
double dp[101][101][101];
double f(int x, int y, int z) {
if (dp[x][y][z] > 0) return dp[x][y][z];
if (x == 100 || y == 100 || z == 100) return 0;
double ret = 0;
ret += x * (f(x + 1, y, z) + 1);
ret += y * (f(x, y + 1, z) + 1);
ret += z * (f(x, ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::nu... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
void co... | #include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back;
#define ll long long
using namespace std;
typedef pair<int,int> pii;
///const int maxn=;
int main(){
///freopen("test.txt","r",stdin);
///freopen("moj.txt","w",stdout);
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
printf... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int t,N,ans;
cin >> t >> N;
ans = ceil(N * 100 + t - 1) / t + N - 1;
cout << ans << endl;
}
| #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <iostream>
#include <fstream>
#include <chrono>
using namespace std;
void solve(int test, istream &in) {
int64_t t, n;
i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const int inf = 1 << 30;
const ll infll = 1LL << 60;
const int mod = 1000000007;
const int mod9 = 998244353;
template<class T> bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
else ... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define prl(a) cout << (a) << endl
#define allrange(a) a.begin(),a.end()
bool solve_translated(vector<pair<i... |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
template <typename Arg1>
void prn(Arg1&& arg1) { cout<<arg1<<"\n";}
temp... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 810;
int a[N][N], sum[N][N];
int n, k, ju;
bool check(int mid) {
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= n; j ++) {
int t = (a[i][j] >... |
#include<bits/stdc++.h>
#include<iomanip>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define RNG(i, s, n) for(int i = s;i <= n;i++)
#define _RNG(i, e, s) for(int i = e;i >= s;i--)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define dup(x, y) (x + y - 1) / (y)
#define all(x) (x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
const ll MOD = 1e9+7;
ll modpow(ll a, ll n, ll p) {
ll res = 1;
while (n) {
if (n & 1) res = res * a % p;
a = a * a % p;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a,b,c;
cin >> a >> b >> c;
if((c*b)%a==0) cout << c*b/a-1 <<endl;
else cout << c*b/a << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<... |
// Template
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <tuple>
#include <utility>
#include <queue>
#include <set>
#include <map>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (i... | #include<bits/stdc++.h>
using namespace std;
struct edge {
int to;
int c;
edge(int to, int c) : to(to), c(c) {}
};
const int INF = 1001001001;
int main()
{
int n, m;
cin >> n >> m;
vector<vector<edge>> g(n);
for(int i = 0; i < m; i++) {
int a, b;
char c;
cin >> a >> b >> c;
a--;
b--;
g[a].emplace_... |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N;
cin >> N;
int A[N];
for(int i = 0; i < N; i++){
cin >> A[i];
}
sort(A, A + N);
for(int i = 1; i <= N; i++){
if(i != A[i - 1]){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | ////JAI SHREE RAM////
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
const long long int INF = (long long)1e15;
const long long int mod = 1e9+7;
#define ll long long
#define f(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define all(c) c.begin(),c.end()
#define rall(c... |
#include <bits/stdc++.h>
using namespace std;
//.define
// #define FILE_IN_OUT
#define RET(_x) return cout << (_x) << '\n', 0;
#define all(_obj) (_obj).begin(), (_obj).end()
#define loop(_n) for (int i = 0; i < (_n); ++i)
#define sz(_obj) static_cast<int>((_obj).size())
#ifdef SHJ_LOCAL
#define debug(_x) std:... | #include <iostream>
#include <vector>
#include <math.h>
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1... |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 10000000... |
#include<bits/stdc++.h>
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>void read(_Tp &t,Args &...args){read(t);read(args...);... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
int main(){
int n,m; cin>>n>>m;
ll a{},b{};
for(int i=0; i<n; i++){
string s; cin>>s;
int cnt{};
for(auto i:s)if(i=='1')cnt++;
if(cnt%2) a++;
else b++;
}
cout<<a*b<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/debug.h"
#else
#define db(...)
#endif
#define all(v) v.begin(), v.end()
#define pb push_back
using ll = long long;
const int NAX = 2e5 + 5, MOD = 1000000007;
class UnionFind
{ // OOP style
private:
vector<int> p, rank, setSize; // remember: vi... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> G[100010];
int A[100010];
void bfs(int s){
queue<int> q;
A[s]=1;
q.push(s);
while(!q.empty()){
int t=q.front();
q.pop();
... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
int n;
cin >>n;
int a[n];
int b[n];
for(int i=0; i<n; i++)
{
cin>>a[i];
}
for(int j=0; j<n; j++)
{
cin >>b[j];
}
int s=0;
for(int i=0; i<n ;i++)
{
s=s+(a[i]*b[i])... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
const int N =3e5+5;
const int MOD = 1e9+7;
ll qpow(ll a, ll b, ll m)
{
ll ans=1;
while(b)
{
if(b&1)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,y;
map<ll,ll>f;
ll dfs(ll u)
{
if(!u) return x;
if(f[u]) return f[u];
ll &ans=f[u];
ans=abs(x-u);
if(u%2==0) ans=min(ans,1+dfs(u/2));
else ans=min(ans,min(1+dfs(u-1),1+dfs(u+1)));
return ans;
}
int main()
{
cin>>x>>y;
printf("%lld\n",df... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define sz(x) ((int) x.size())
#define all(x) x.begin(), x.end()
#define debug if (true) cerr
using ll = long long;
ll N;
void solve() {
cin >> N;
ll answer = N;
rep(b, 0, 60) {
ll B = 1LL << b;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n;
void into(){
scanf("%lld",&n);
LL a=(1LL<<60)-1,b=0,c=0;
for (LL y=0;1LL<<y<=n;++y){
LL x=n>>y,z=n&(1LL<<y)-1;
if (x+y+z<a+b+c) a=x,b=y,c=z;
}
//printf("%lld %lld %lld\n",a,b,c);
printf("%lld\n",a+b+c);
}
void work(){
}
void out... |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
LL Num;
LL Cnt[3],Loc;
int main() {
cin>>Num;
LL Temp=Num%3;
while(Num) {
Loc++;
Cnt[Num%10%3]++;
Num/=10;
}
if(Temp==0) printf("0\n");
else if(Temp==1) {
if(Cnt[1] >= 1 && 1 < Loc) printf("1\n");
el... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <bitset>
#include <cmath>
#include <set>
#include <map>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf = 10111111;
int main() ... |
#include <iostream>
using namespace std;
int main(void){
int A, B;
cin >> A >> B;
int sum = 0;
int i, j;
for (i = 1; i < A; i++) {
cout << i << " ";
sum += i;
}
for (j = 1; j < B; j++) {
cout << -j << " ";
sum -= j;
}
if(sum > 0){
cout << i << ... | /*
Author : DEBAPRIYA CHANDRA
[JGEC]
*/
#include<bits/stdc++.h>
#define ll long long int
#define dbl long double
#define loop(i,n) for(int i=0;i<n;i++)
#define test(t) int t;cin>>t;while(t--)
#define debo ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define vi vector<ll>
#define sz size()
#de... |
#include<iostream>
#include<cmath>
using namespace std;
#define ll long long
ll k,ans,cnt[10],s[10],t[10],cntt[10],cnts[10];
string S,T;
ll che(int x,int y) {
int st=0,ss=0;
cnts[x]++,cntt[y]++;
for(int i=1; i<10; i++) {
ss+=i*pow(10,cnts[i]);
st+=i*pow(10,cntt[i]);
}
cnts[x]--,cntt[y]--;
if(ss<=st)return 0;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define lowbit(x) x&(-x)
int tr[N],h,w,m,r[N],c[N];
void upd(int x,int v){
while... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define INP "solve"
#define OUT "solve"
const long long INF_LL = 4e18;
const int INF = 1e9 + 100;
const int MOD = 1e9 + 7;
const long double EPS = 1e-10;
const int BLOCK = 550;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
mt... | #include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define pii pair <int , int>
#define mp make_pair
#define fs first
#define sc second
using namespace std;
typedef long long LL;
template <typename T>
void read(T &x) {
T f=1;x=0;char s=getchar();
while(s<'0'||s>'9') {if(s=... |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | //#include <atcoder/maxflow.hpp>
#include <memory>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <u... |
#include "bits/stdc++.h"
using namespace std;
#define pi acos(-1)
#define inc(a) a.begin(), a.end()
#define dec(a) a.rbegin(), a.rend()
#define Unique(n) (n).erase(unique(inc(n)), (n).end())
#define what_is(x) cerr << #x << " is " << x << '\n';
#define to(i, a, n) f... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define fst ios_base::sync_with_stdio(false);cin.tie(0), cout.tie(0);
#define pb push_back
#define mp make_pair
#define gcd ... |
#include<bits/stdc++.h>
#define fastcall __attribute__((optimize("-O3")))
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC op... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int const MAXN = 2e6 + 10;
int n, m, T;
int a[MAXN];
int num[MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) num[a[i]]++;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i ++ )
int n, m;
vector<int> v[1500005];
int main(void)
{
cin >> n >> m;
rep(i, 0, n)
{
int x; scanf("%d", &x);
if (x < m) v[x].push_back(i);
}
rep(i, 0, m + 1)
{
// cout << v[i].size() << endl;
if (v[i... |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ss second
#define ar array
#define int long long
#define ld long double
#define pb push_back
#define mp make_pa... | #include <bits/stdc++.h>
using namespace std;
// clang-format off
/* accelration */
// 高速バイナリ生成
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
// cin cout の結びつけ解除, stdioと同期しない(入出力非同期化)
// cとstdの入出力を混在させるとバグるので注意
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(fals... |
#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 mod 1000000007
#define MAX 1e9
#define MIN -1e9
#define hi "visited\n" //sasta debugging
using namespace std;
//aut... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1e9
typedef long long ll;
t... |
#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 <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n], y[n], r[n];
for (int i = 0;i < n;i++)
cin >> x[i] >> y[i] >> r[i];
for (int i = 0;i < n;i++){
bool dup = false;
for (int k = 0;k < n;k++){
if (i == k) continue;
if (y[i] == y[k]) {
dup ... |
#include <iostream>
using namespace std;
inline int ksm(int x,int y,int mod)
{
int rtn=1;
while(y)
{
if(y&1) rtn=(long long)rtn*x%mod;
x=(long long)x*x%mod,y>>=1;
}
return rtn%mod;
}
int main(int argc, char** argv) {
int a,b,c;
cin >> a >> b >> c;
if(b<=5&&c<=5||b==1)
cout << ksm(a,ksm(b,c,1000000000),10)... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rng(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(ob... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using ld = long double;
using vld = vector<ld>;
using vb = vector<bool>;
#define rep(i, n) for ... | /*ver 7*/
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... |
#include<iostream>
#include<bits/stdc++.h>
#define m_p make_pair
#define fi first
#define se second
#define pb push_back
typedef long long ll;
#define f(i,n) for(ll i=0;i<n;i++)
#define f1(i,n) for(ll i=1;i<=n;i++)
#define crap ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0)
using namespace std;
#define INF 1000... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int ll
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
template<typename T, typename U>
ostream& operator<<(ostream& o, const pair<T,U>& p... |
#include <bits/stdc++.h>
#define int long long
#define float double
#define vi vector<int>
#define pb push_back
#define mod 1000000007
using namespace std;
// int N;
// char mat[1000][1000];
// int vis[1000][1000];
// int dist[1000][1000];
// int dx[]={-1,0,0,1};
// int dy[]={0,1,-1,0};
// bool isValid(int x, int y)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll m = n;
int s = 0;
vector<int> c(3, 0);
while (m != 0) {
int d = m % 10;
s += d;
++c[d % 3];
m /= 10;
}
int r = s % 3;
if (r == 0) {
cout << 0;
return 0;
}
if (c[r] >= 1 && n > 9) {
cout << ... |
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define memset(v, h) memset((v), h, sizeof(v))
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
t... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
typedef long double ld;
int n,m;
ll k;
string s,t;
int c[10];
int p[6]={1,10,100,1000,10000,100000};
inline bool calc(int x,int y){
int i,j;
for(i=0;i<4;i++) c[s[i]-'0']++;
c[x]++;
int a1=0,a2=0;
for(i=1;i<=9;i++) a1+=i*p[c[i]];
... |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <cmath>
#include <set>
#define ll long long
using P = std::pair<int, int>;
int main()
{
int N;
std::string S;
std::cin >> N >> S;
int ans = 0;
for(int i=0; i < N; i++) {
int na=0, nt=0, nc... | #include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
#define V vector
#de... |
#include<bits/stdc++.h>
using namespace std;
long long INF = 1000000000000;
std::vector<long long> AA;
std::vector<long long> visited;
bool comp(int a, int b) {
return AA[a] < AA[b];
}
long long bfs(long long now, std::vector<long long> &A, vector<vector<long long>> &edges){
long long m = -INF;
queue<lo... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(vr) vr.begin(),vr.end()
#define vi vector<int>
#define vll vector<ll>
const int N = 1e5 + ... |
#include <bits/stdc++.h>
#define st first
#define nd second
#define PQ priority_queue
#define MP make_pair
using ll = long long ;
using namespace std;
using pii = pair<int,int>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
const int N = 105;
const int MAXN = 1e5 + 10;
const int MOD =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
typedef long long ll;
typedef ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define Sort(a) sort(a.begin(), a.end())
using ll = long long;
#define DEBUG_ON
int main()
{
ll n;
cin>>n;
vector<ll>a(n);
vector<ll> _a(n);
vector<ll> _b(n);
vector<ll> b(n);
rep(i,n){
cin>... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N),B(N);
vector<vector<long long>> C(N,vector<long long> (N));
for (long long i=0;i<N;i++) {
cin >> A.at(i) >> B.at(i);
}
long long X=A.at(0)+B.at(0);
for (long long i=0;i<N;i++) {
for (long l... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using iPair = pair<int,int>;
using lPair = pair<ll, ll>;
using ivector = vector<int>;
using lvector = vector<long>;
using ivv = vector<vector<int>>;
using lvv = vector<vector<ll>>;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
#de... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#define amax(a, b) a = max(a, b)
#define amin(a, b) a = min(a, b)
using ll = long long;
int main() {
int n, m;
std::cin >> n >> m;
if (n == 1 && m == 0) {
std::cout << 1 << ' ' << 2 << '\n';
retu... |
#include<bits/stdc++.h>
using namespace std;
const int maxN = 1e6 + 10;
#define pb push_back
int a[maxN];
string s;
int n;
vector<int> v[maxN];
int bit[maxN];
void update(int x, int poz)
{
for (int i = poz;i<maxN;i+=i&-i)
bit[i]+=x;
}
int get(int poz)
{
int ans = 0;
for (int i = poz;i>0;i-=i&-i)
... | #include<bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(A,val) memset(A,val,sizeof(A))
#define fi(a,b) for(int i=a;i<=b;++i)
#define fj(a,b) for(int j=a;j<=b;++j)
#define all(x) x.begin(),x.end()
#define vi vector<int>... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define deb(...)
#endif
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define all(c) c.begin(),c.end()
#define read(v) for(auto &it:v) cin>>i... | #pragma GCC optimize("O3")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef pair<int, int> pi;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define pb push_back
#define ... |
//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountll((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
#define DEBUG
#ifdef DEBUG
templ... |
//全力以赴
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
const int dx[4] = {+1, 0, -1, 0};
const int dy[4]... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {... |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
int main() {
ll... | #include<iostream>
using namespace std;
int main()
{
int i,num=0;
char s[12];
for(i=0;i<12;i++)
{
cin>>s[i];
}
for(i=3;i<12;i++)
{
if(s[i-3]=='Z'&&s[i-2]=='O'&&s[i-1]=='N'&&s[i]=='e')
num++;
}
cout<<num;
return 0;
}
|
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n=4;
vector<int> arr(n);
int sum=0;
for(int i=0;i<=n-1;i++)
{
cin >> arr[i];
sum+=arr[i];
}
string ans="No";
for(int i=0;i<=n-1;i++)
{
if(arr[i]==sum-arr[i])
{
ans="Yes";
... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=5005,mod=998244353;
int h,w,k;
int dp[N][N];
char a[N][N];
int qpow(int x,int k) {
int res=1;
while(k) {
if(k&1)res=1ll*res*x%mod;
x=1ll*x*x%mod;
k>>=1;
}
return res;
}
signed main() {
scanf("%lld... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<stdio.h>
#include<algorithm>
constexpr unsigned long long MOD = 998244353;
constexpr unsigned long long IM = 18479187003;
constexpr unsigned long long MOD32 = 665496236;
char f[5000][5000];
unsigned long long... |
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#endif
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef std::vecto... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,s,d,c=0;
cin>>n>>s>>d;
for(int i=0;i<n;i++){
int x,y;
cin>>x>>y;
if(x<s&&y>d){
c+=1;
}
}
if(c>0)cout<<"Yes";
else cout<<"No";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
// Consecutive additon/subtraction is bad
// if x < y /4 , then its optimal to
long long int do_brute(long long int x, long long int y){
if(x == y)
return 0;
if(y%2 == 0){
if(y >= 2*x)
return 1 + do_brute(x,y/2);
else
return min(y-x,1+x-y/2);
... | #include<bits/stdc++.h>
#define ll long long
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define per(i, m, n) for (int i = m; i >= n; i--)
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define INF 0x3f3f3f3f
using namespace std;
ll x, y;
unordered_map<ll, ll> M;
ll solve(ll num) {
if ... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n), w(m);
rep(i, n) cin >> h[i];
rep(i, m) cin >> w[i];
sort(h.begin(), h.end());
vector<int> l(n / 2 + 1), r(n / 2 +... | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const double pi = acos(-1.0);
const int inf = INT_MAX;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> a(n), b(m... |
#include <bits/stdc++.h>
#include <vector>
#include<math.h>
#include<string.h>
using namespace std;
#define MAX 300005
#define MOD 1000000007
#define INF 1000000000000000000
#define EPS 0.0000000001
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; ++i)
const ll INF=1000000010;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main(){
... |
#pragma GCC optimize(2)
#include<unordered_map>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<map>
#include<set>
#define Buff ios::sync_with_stdio(false)
#define rush() int Case = 0; int T; cin >> T; ... | #include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#d... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define pll pair <long long,long long>
#define ss second
#define ff first
#define inf (ll)2e18
#define mod 1000000007
//#define mod 998244353
#define ld long double
#define fast ios_base::sync_with_... |
#include<bits/stdc++.h>
using namespace std;
#define author "Sihare0riginals"
#define ss string
#define lli long long int
#define ld long double
#define f first
#define s second
#define all(v) v.begin(),v.en... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define ll long long
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define RF(type, i, a, b, decr) for (type i = a; i >= (type)(b); i -= (type)(decr))
#define sz(a) sizeof(a)
#define deb(a) cerr ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vc = vector<T>;
template<class T> using vvc = vc<vc<T>>;
template<class T> using vvvc = vc<vvc<T>>;
template<class T> using vvvvc = vvc<vvc<T>>;
template<class T> using PQ = priority_queue<T>;
template<class T> using invPQ = pri... | #ifndef DEBUG
#define NDEBUG
#endif
#include <bits/stdc++.h>
#define def(v) int &v = e[i].v
#define cls(a) memset (a, 0, sizeof (a))
#define mset(a, b) memset (a, b, sizeof (a))
#define go(i,e,u,...) for (int i = (u), ##__VA_ARGS__; i; i = e[i].nt)
#define fir(i,a,b,...) for (int i = (a), ##__VA_ARGS__; i <= (b); +... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define hackcyborg shresth_walia
#define all(a) a.begin(), a.end()
#define ll long long
#define ld long double
#define pb push_back
#define mod 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NU... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int long long
#include <map>
#include <queue>
#include <set>
int fact[200001]; //https://atcoder.jp/contests/dp/tasks/dp_t
int inv[200001];
int de[200001];
ll mod=1000000007;
ll power(ll x,ll y){ll res = 1;while(y){if(y&1) res = (res*x)%mod;y=y/... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
//rep…「0からn-1まで」の繰り返し
#define rep2(i,s,n) for(long long i=s; i<=(long long)(n);i++)
//rep2…「sからnまで」の繰り返し
#define repr(i,s,n) for(long long i=s;i>=(long long)(n);i--)
//repr…「ｓからnまで」の降順の繰り返し
typedef long long ll;
ty... | #include<cstdio>
#define lli long long
lli n,a;
int main()
{
scanf("%lld",&n),++n,a=n;
for(register int i=1;;++i)
if(n<i)return printf("%lld",a),0;
else n-=i,--a;
printf("%lld",a);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define PB push_back
#define MP make_pair
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(... |
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
//using namespace atcoder;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
temp... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
//srand (time(NULL));
//rand()%10 //random 1-9
int arr[200005] = {0};
//queue<pair<int,int> pq;
//bool done = false;
//bool vis[105][1... |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
if(n%2 == 1){
cout<<"Black\n";
}
else{
cout<<"White\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int ri() {
int n;
scanf("%d", &n);
return n;
}
bool poss(string s, int x) {
int len = s.size();
if(to_string(x).size() > len)
return false;
vector<int> cnt(10, 0);
for(char c : s) {
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 0) {
cout << "Yes\n";
return 0;
}
while (!(n % 10)) n /= 10;
vector<int> f, b;
while (n) {
f.emplace_back (n % 10);
n /= 10;
}
b = f;
reverse (b.begin(), b.end());
if (b == f) cout << "Yes\n";
else cout << "N... | #include<bits/stdc++.h>
using namespace std;
bool palindromeasis(string s,int low,int high)
{
int flag=1;
while(low<=high)
{
if(s[low]==s[high])
{
low++;
high--;
}
else
{
flag=0;
break;
}
}
if(flag==... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
int N, M;
const int MOD = 998244353;
const int D = 20;
int f[200010][D + 1];
int fac[200010], ifac[200010];
vector<int> dv[200010];
int quick_pow(int a,int x) {
int ret = 1;
while(x) {
if (x & 1) ret = 1LL... | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define P... |
#include<bits/stdc++.h>
#define pb push_back
#define fo(i,n) for(int i=0;i<n;i++)
#define ll long long
#define int long long
#define Mod 1000000007
#define maxn 200005
#define MAX 4294967296 // 2^32
const int M=1e9+7;
#define ip pair<int,int>
#define test(t) ll t;cin>>t;while(t--)
using namespace std;
long lo... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#def... |
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main()
{
int N,X,i;
char S[200005];
scanf("%d%d",&N,&X);
scanf("%s",S);
for(i=0;S[i]!='\0';i++){
if(S[i]=='x'){
if(X==0)X=0;
else --X;
}
if(S[i]=='o')++X;
}
pr... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S; cin >> S;
int ans = 0;
for(int i=0; i<=9999; i++){
vector<bool> flag(10);
int X = i;
for(int j=0; j<4; j++){
flag[X%10] = true;
X /= 10;
}
bool flag2 = true;
for(int j=0... |
//W4P3R
#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
#define pb push_back
#define re register int
#define fr first
#define sd second
#define pa pair<int,int>
#define FOR(i,a,b) for(re i=a;i<=b;i++)
#define REP(i,a,b) for(re i=a;i>=b;i--)
#define MEM(a) memset(a,0,sizeof(a))
#define N 20... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void*wmem;
char memarr[96000000];
template<class S, class T> inline S max_L(S a,T b){
return a>=b?a:b;
}
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, ... |
/**
* created: 18/04/2021, 15:08:05
**/
#include <bits/stdc++.h>
using namespace std;
const int max_n = 100111, mod = 1000000007;
int n, a[max_n], ans = 1;
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#define pa pair<long long, int>
const int mod = 998244353, i2 = mod + 1 >> 1;
int n, a[200010];
long long pow2[200010], inv2[200010], ans = 0;
vector<pa> s;
int main()
{
scanf("%d", &n);
pow2[0] =inv2[0] = 1;
for (int i = 1; i <= n; i++)
{
pow2[i] ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d",&N);
int A[N];
int sum = 0;
for(int i=0;i<N;i++){
scanf("%d",&A[i]);
if(A[i]>10){
sum += A[i]-10;
}
}
printf("%d",sum);
return 0;
} | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <iterator>
#include <cmath>
#include <set>
#include <deque>
#include <string>
using namespace std;
int n;
int a[100010];
set<int> numSet;
int main()
{
scanf("%d", &n);
for (int i = 0 ; i < n ; i+... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
inline int read() {
int x=0,f=1;char c=getchar();
while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
while(c>=48&&c<=57)x=(x<<1)+(x<<3)+(c^48),c=getchar();
return x*f;
}
using namespac... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define pqueue priority_queue
#define umap unordered_map
#define uset unordered_set
#define bits(x) __builtin_popcount((x))
#define gcd(x... |
#include <bits/stdc++.h>
#define ll long long
#define fori(n) for( int i = 0; i < n; i++)
#define all(x) x.begin(),x.end()
#define pll pair < ll,ll >
using namespace std;
int main()
{
int n,m;
cin >> n >> m;
if(m%n==0)
{
cout << "Yes";
... | #include <math.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
#define mod
using ll = long long;
using P = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
... |
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vect... | #include "bits/stdc++.h"
using namespace std;
//#include "testlib.h"
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define ll int
#define M 1000000007
#define MM 998244353
#define inputarr(a,n) for(int i=0;i<n;++i) cin>>a[i]
#define GCD(m,n) __gcd(m,n)
#define LCM(m,n) m*(n/GCD(m,n))
#define mii ... |
#include<bits/stdc++.h>
using namespace std;
#define il inline
#define rg register
il int read()
{
int re=0,k=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')k=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){re=re*10+ch-48;ch=getchar();}
return re*k;
}
il void write(int x)
{
if(x<0) return putchar('-'),write(-x),v... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')w=-1;ch=getchar();
}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
inline bool read(int& a){
int s=0,w=1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n), b(n);
for(int i = 0; i < n; i++)
scanf("%d", &a[i]);
for(int i = 0; i < n; i++)
scanf("%d", &b[i]);
int ans = 0;
for(int i = 0; i < n; i++) {
ans += (a[i] * b[i]);
}
if(ans == 0)
cout << "Yes" << end... |
#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 =... | //Template Made By: Ojassvi Kumar
#include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define fo(i,a,b) for(long long int i=a; i<b; i++)
#define endl "\n"
#define max3(a,b,c) max(max((a),(b)),(c))
#define max4(a,b,c,d) max(max((a),(b)),max((... |
#include<iostream>
#include<string>
using namespace std;
int main() {
long int n, x;
string s;
cin>>n>>x;
cin>>s;
for(int i = 0; i < s.size(); i++) {
if(s[i] == 'x' && x != 0)
x--;
else if(s[i] == 'o')
x++;
}
cout<<x<<endl;
return 0;
} | /*
मनस्वी म्रियते कामं कार्पण्यं न तु गच्छति ।
अपि निर्वाणमायाति नानलो याति शीतताम् ॥
*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define mod 1000000007
#define pb push_back
#define ll long long i... |
#include <bits/stdc++.h>
using namespace std;
int n;
main()
{
cin>>n;
cout<<(n+99)/100<<endl;
}
| #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
// Your code here!
long N;
long ans = 1000;
for(int i = 1; i <= 4; i++)
{
scanf("%ld",&N);
ans = (ans>N)? N:ans;
}
printf("%ld\n",ans);
}
|
#include<bits/stdc++.h>
//=====================START-MACRO=====================
namespace gengar
{
#pragma GCC optimize("Ofast")
using namespace std;
namespace TypeDef
{
#define int long long
#define itn int
#define uint unsigned long long
using Int=int64_t;
using uInt=uint64_t;
#define ld long double
... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define RI register int
typedef long long LL;
#define FILEIO(name) freopen(name".in", "r", stdin), freopen(name".out", "w", stdout);
using namespace std;
namespace IO {
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc() {
if (p1 ... |
#include <iostream>
using namespace std;
const int N = 1000010;
typedef long long LL;
LL f[N];
LL ans = 0;
int main() {
int l, r;
cin >> l >> r;
for (int i = r; i >= 2; i --) {
LL tem = r / i - (l - 1) / i;
f[i] = tem * tem;
for (int j = i * 2; j <= r; j += i)
f[i] -... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using indexed_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
template <typename T> using indexed_multiset = tree... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define fi first
#define se second
#define UP(a,b,c) for(ll (a)=(b);(a)<(c);(a)++)
#define UU(a,b,c) for(ll (a)=(b);(a)<=(c);(a)++)
#define DN(a,b,c) ... | #include<bits/stdc++.h>
using namespace std ;
const long long INF =1001001001 ;
//巡回セールスマン問題
//要解き直し
int main(){
int N , M ;
cin >> N >> M ;
vector<vector<int > > to(N) ;
for(int i = 0 ; i < M ; i++){
int a , b ;
cin >> a >> b ;
a-- ;
b-- ;
to.at(a).push_back(b) ;... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int x,y;
void solve()
{
cin>>x>>y;
int low=min(x,y);
int high=max(x,y);
low+=3;
if(low<=high)
cout<<"No";
else
cout<<"Yes";
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
solve();
retu... | #include<bits/stdc++.h>
using namespace std;
signed main()
{
int a,b,x,y; cin >> a >> b;
x = (a+b)/2;
y = a-x;
cout << x << " " << y;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ll long long
#define M 998244353
#define pb push_back
#define p_q priority_queue
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii ... | #include<bits/stdc++.h>
#define int long long
#define inf 999999999999
#define N 100000
using namespace std;
int n,dp[N+1],g[27];
string s;
signed main(){
// freopen("optimize0.in","r",stdin);
// freopen("optimize.out","w",stdout);
cin>>n;
cin>>s;
for(int i=1;i<=n;i++)dp[i]=inf;
for(int i=0;i<26;i++)g[i]=inf;
for(... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
//ios_base::sync_with_stdio(0);
//cin.tie(0);
string s;
cin >> s;
int e = 0;
for (int i = s.size()-1; i >= 0; --i) {
if (s[i] != '0') {
e = i;
break;
}
}
bool ans = true;
for (int i = 0; i < (e+1)/2 && ans; ++i) {
... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
#include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
template <class T>
void chmin(T& a, T b) {
if (a > b) a = b;
}
template <class T>
void chmax(T& a, T b) {... | #include<iostream>
#include<string>
#include<algorithm>
#include<unordered_set>
using namespace std;
long long hasht[26];
void toZ(){
for(int i=0;i<26;i++)
hasht[i]=0;
}
long long getC(char c){
long long cnt=0;
for(int i=0;i<26;i++){
if('a'+i!=c)cnt+=hasht[i];
}
toZ();
return cnt... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mat vector<vector<int>>
#define vi vector<int>
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define pi pair<int, int>
#define inf 1000000000
#define mod 1000000007
//#define endl "\n"
const ll INF=1e18+5;
con... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
#define pint pair<int, int>
#define pll pair<ll, ll>
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int n;
c... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,w,a,b,num=0,id1,id2;
cin>>h>>w>>a>>b;
int s=(h*(w-1))+(w*(h-1));
for (int i=0;i<(1<<s);i++){
set<int> m;
bool e=false;
int t_num=0;
for (int j=0;j<s;j++){
if(i&(1<<j))t_num++;
}
if (t_num!=a)continue;
for (int ... | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include<bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
//using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//ordered_set 重複不可
#include <ext/pb_ds/assoc_con... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include <bits/stdc++.h>
using namespace std;
#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 <iostream>
using namespace std;
typedef long long ll;
#define min(x,y) ((x)<(y)?(x):(y))
#define max(x,y) ((x)<(y)?(y):(x))
ll comb(ll n, ll k){
if (k == 0 || k == n) return 1;
if (k == 1 || k == n-1) return n;
return comb(n-1,k)+comb(n-1,k-1);
}
int main(){
ll n,k;cin >> n >> k;--k;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define MOD(a, m) ((a % m + m) % m)
template<class T>bool chm... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.