code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef vector <int> vi;
typedef pair <int, int> pii;
typedef vector <long long> vll;
typedef pair <long long, long long> pll;
#define pb push_back
#define all(c) c.begin(), c.end()
#define For(i, a, b) for (long long i = a; i < b; ++i)
#define Forr(i, a, b) for (long ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define pb push_back
typedef long double ld;
#define fi first
#define se second
#define PI 3.14159265358979323846264338327950288419716939937510
#define mp make_pair
#define vvl vector<vector<ll>>
#define vll vector<ll>
#de... |
/* --------------------
| LOSER |
| ~NOOBOSS~ |
--------------------
*/
#include <bits/stdc++.h>
using namespace std;
#define mxx LLONG_MAX
#define mnn LLONG_MIN
#define Y() cout<< "YES" <<endl
#define N() ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, M; cin >> N >> M;
if(abs(M) == N){
cout << -1 << endl; return 0;
}
if(M == 0){
for(int i = 1; i <= N; i++){
cout << i * 2 << " " << i * 2 + 1 << "\n";
}
return 0;
}
if(abs(M) == N-1 || M < 0){
cout << -1 << endl; return 0;
}
else... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
int main(){
int N, A, B;
cin >> N >> A >> B;
cout << N-A+B << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); // __VA_ARGS__可変引数マクロ
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void... |
#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
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3... | #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define sz 200009
#define mod 998244353
#define inf 1e9
#define f first
#define s second
#define pa pair<ll,ll>
ll arr[sz],brr[sz];
long long binpow(long long a, long long b) {
a %= mod;
long long res = 1;
while (b > 0) {
if (b &... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
const int M=2e5+10;
const int inf=1<<30;
const ll mod=1e9+7;
const int bit=32;
const double pi=acos(-1.0);
double dp[M];
int main(){
int n;
scanf("%d",&n);
dp[n]=0;
for(int i=n-1;i>=1;i--){
dp[i]=dp[i+1]+1.0*n... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
cin.tie(nullptr)->sync_with_stdio(false);
string s;
cin >> s;
string t = "ZONe";
int ans = 0;
for(int i = 0; i<9; i++){
if(s.substr(i,4)==t)ans++;
}
cout << ans << "\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define ll long long
#define rll register long long
const int N=4e5+10;
int a[N],pos[N];
map<int,int> cnt;
int main(){
rint n;
scanf("%d",&n);n<<=1;
for(rint i=1;i<=n;i++)
scanf("%d",&a[i]),cnt[a[i]]++;
rint s=0;
for(auto &v:cnt){
v.second+... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=400005;
const ll mod=998244353;
ll n,tag[MAXN];
pair<ll,ll> p[MAXN];
int main(){
scanf("%lld",&n);
for(ll i=1;i<=2*n;i++){
scanf("%lld",&p[i].first);
p[i].second=i;
}
sort(p+1,p+2*n+1);
for(ll i=n+1;i<=2*n;i++){
tag[p[i].se... |
#include <iostream>
#include <vector>
#include <cstring>
#include <bits/stdc++.h>
#define IOS ios:: sync_with_stdio(false), cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vec... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define p... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define w(x) int x; cin>>x; while(x--)
#define mii map<int,int>
#define endl ("\n")
#define vi vector<int>
#define pqb p... | #include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define int long long
using namespace std;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)... |
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
te... | #include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## ... |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
string s, t;
cin >> s >> t;
int ans = 0;
int x = 0;
for (int i = 0; i < n; i++) {
int c = s[i] - '0' + (t[i] - '0') * 2;
switch (c) {
case 0: x != 0 && ans++; break;
case 1: ++x <= 0 && ans++; break;
case 2: --x ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
ll n;
cin >> n;
string s, t;
cin >> s >> t;
vector<ll> a, b;
rep(i,n){... |
/*
“The only way that we can live is if we grow.
The only way we can grow is if we change.
The only way we can change is if we learn.
The only way we can learn is if we are exposed.
And the only way that we are exposed is if we throw ourselves into the open.”
*************************************** *************... | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline long IN(void)
{
long x=0,f=0,c=getchar();while(c<48||c... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int ans = n%2;
if(ans==1)
cout << "Black" << endl;
else
cout << "White" << endl;
}
|
#include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#define ll long long
#define rep(i,n) for(int i = 0;i < (int)n;i ++)
using namespace std;
int main(void){
ll n;
cin >> n;
n = (n*108/100);
if(n < 206){
cout << "Yay!" << endl;
}else i... | /* In The Name Of ALLAH
Author:- Ibrahim adnan Tanim */
#include <bits/stdc++.h> // This will work only for g++ compiler.
#define for0(i, n) for (int i = 0; i < (int)(n); ++i) // 0 based indexing
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i) // 1 based indexing
#define forc(i, l, r) for (... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
#define vint2(v,n,m,init) vector<vector<int>> v(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1<<24;
const ll INFL = (1ll << 60);
//cout << setprecision(20) <<
int n;
int coord[17][3];
int dp[1 << 17][17];
int rec(int S, int v) {
if (dp[S][v] >= 0) {
return dp[S][v];
}
if (S ==... |
#include<bits/stdc++.h>
using namespace std ;
#define Next( i, x ) for( register int i = head[x]; i; i = e[i].next )
#define rep( i, s, t ) for( register int i = (s); i <= (t); ++ i )
#define drep( i, s, t ) for( register int i = (t); i >= (s); -- i )
#define re register
int gi() {
char cc = getchar() ; int cn = 0, fl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int>pi;
typedef pair<long long, long long>pl;
#define F first
#define S second
#define pb push_back
#define all(x) x.begin() , x.end()
#define m... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m;
map<ll,ll> p;
ll dfs(ll x,ll c)
{
if(p.find(x)!=p.end())return p[x];
if(x<=c)return c-x;
p[x]=x-c;
if(x&1)p[x]=min(p[x],min(dfs(x-1,c),dfs(x+1,c))+1);
else p[x]=min(p[x],dfs(x/2,c)+1);
return p[x];
}
int main()
{
cin>>n>>m;
cout<<dfs(m,n)... | //@ikung
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
#define f(i,k) for(int i=0;i<k;i++)
#define F first
#define dbg(x) cout<<#x<<" "<<x<<endl;
#define S second
#define endl "\n"
#define rep(i,n) for(int i=1;i<=n;i++)
#define rew(i,a,b) for(i... |
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define s... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define PI acos(-1)
#define pb push_back
#define int long long
#define ld long double
#define sp fixed<<setprecision
#define bp __builtin_popcountll
#define all(x) x.begin(),x.end()
#define pii pair<long long,long long>
#define FAST ios_ba... |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
#define G getchar()
int read()
{
int x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return flg?-x:x;
}
#undef G
#define fi first
#define se second
typedef long long ll;... | #include<bits/stdc++.h>
#define int long long
using namespace std;
vector<vector<bool>>se(50,vector<bool>(50));
vector<vector<int>>sc(50,vector<int>(50));
vector<vector<int>>pe(50,vector<int>(50));//タイプ
vector<bool>ty(2505);//色
int pmax=0;
string smax;
int kaisu=0;
int ti=clock();
void dfs(int nx,int ny,int P,string S)... |
#include<cstdio>
#include <algorithm>
#include <string>
#include <string.h>
#include <math.h>
#include <map>
#include<vector>
#include <iostream>
using namespace std;
#define ll long long
#define mod 998244353
ll a[200005];
ll mul(ll a,ll n)
{
ll sum=1;
while(n)
{
if(n%2) sum=sum*a%mod;
a=a*... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
#include <iomanip>
#include <time.h>
using namespace std;
int64_t mod = 998244353 ;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = (ll)1e9 + 7;
ll n, p;
ll pow_(ll high)
{
if (high==0)return 1;
ll val = pow_(high / 2);
if (high % 2==0)return val * val % MOD;
return val * val % MOD * (p-2)% MOD;
}
int main(void)
{
ios_base::sync_with_stdio(fal... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 all(v) begin(v), end(v)
#define sz(v) v.size()
#define INF 1e17
#define EPSILON 1e-14
template <typename T>
bool chmax(T &a, const T& b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;
int main(){
int n; cin >> n;
VI p[3];
ll ... |
#include<bits/stdc++.h>
#define pb push_back
#define pl pair<ll,ll>
#define pll pair<ll,pair<ll,ll>>
#define ll long long
#define vl vector<ll>
#define fastio ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 998244353
#define all(x) x.begin(), x.end()... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(s) s.begin(), s.end()
#define FOR0(i, a) for (int i = 0; i < a; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A[3];
for(int i = 0; i < 3; i++){
cin >> A[i];
}
for(int i = 0; i < 2; i++){
for(int j = 0; j < 2 - i; j++){
if(A[j] < A[j + 1]){
int tmp = A[j + 1];
A[j + 1] = ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
bool p=0;
for(int i=0;i<s.size();i+=2)
if(s[i]>'z'||s[i]<'a')
p=1;
for(int i=1;i<s.size();i+=2)
if(s[i]>'Z'||s[i]<'A')
p=1;
if(p==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long 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) __... |
#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;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c... |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
//const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10... | /**
* author: mahfuzz
* created: 24.06.2021
**/
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define all(p) p.begin(),p.end()
typedef long long ll;
int main(int argc, char* argv[]){
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
ll n; ... |
#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 ... | #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... |
// C - Duodecim Ferra
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define vec vector
#define rp(i,s,e) for(ll i=(s);i<(e);++i)
// 素数と個数を求める
vector<pair<ll,ll>> factorize(ll n){
vec<pair<ll,ll>> res;
for(ll i=2L; i*i<=n; ++i){
if (n%i) continue;
res.emplace_back(i,0);
while(n%i == 0){
n... | //#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tr... |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
long long lcm2(long long a, long long b) {
long long d = gcd(a, b);
return a / d * b;
}
long long lcm(const vector<long long> &vec) {
... | #include <cstdio>
#include <algorithm>
long long b, c;
int main() {
scanf("%lld%lld", &b, &c);
if(b == 0) printf("%lld", (c-1)/2 + 1 + c/2);
else if(b > 0) printf("%lld", std::min(c/2, b) + std::min((c-1)/2, b-1) + (c-1)/2 + 1 + std::max(c/2-1, 0ll) + 1);
else printf("%lld", std::min(std::max(c/2-1, 0ll... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ar array
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mx *max_element
#define mn *min_element
#define endl "\n"
#define fo(i,n) for(ll i=0;i... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... | #pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf push_front
#define F first
#define S second
#define SS stringstream
#define sqr(x) ((x)*(x))
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) m... |
#include <iostream>
#include <vector>
int main()
{
int h = 0, w = 0, futon_counter = 0;
std::string room = "";
std::cin >> h >> w;
for(int i = 0; i < h; ++i)
{
std::string tmp = "";
std::cin >> tmp;
room += tmp;
}
for(int i = 0; i < h * w; ++i)
{
if(room[i] == '#') continue;
if(room... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const long long mod = 1000000007;
int cnt[4][2000][2000];
int main(void){
int h, w;
string s[2000];
cin >> h >> w;
for(int i=0;i<h;i++) cin >> s[i];
vector< long long > p(h*w+1, 0);
p[0] = 1;
for(int i=1;i<=h*w;... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N; cin>>N;
ll ans=LLONG_MAX;
ll b=0;
ll pow2=1;
while(pow2<=N) {
ans=min(ans,N/pow2+N%pow2+b);
pow2*=2;
b++;
}
cout<<ans<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
string s;
int main(){
cin>>s;
for(int i=s.size()-1;i>=0;i--){
if(s[i]=='6')cout<<9;
else if(s[i]=='9')cout<<6;
else cout<<s[i];
}
} |
// author: Halit
#include <bits/stdc++.h>
int main() {
std::string str; int k;
std::cin >> str >> k;
auto is_multiple_of_200 = [&]() {
int size = str.size();
if (size < 3) {
return false;
} if (str[size-1] != '0' || str[size-2] != '0') {
return false;
} if ( int(str[size-3... | #include <iostream>
using namespace std;
long int N,K;
int main(){
cin>>N>>K;
for(int i=0; i<K;i++){
if(N%200==0){
N=N/200;
}
else{
N=N*1000+200;
}
}
cout<<N<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define getchar_unlocked getchar
int A[100005];
int B[100005];
int offset[100005];
int minLevel1[100005];
int minLevel2[100005];
int N, L;
inline int nextInt(){
... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... |
#include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(b... | #define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <unistd.h>
using namespace std;
// printf("%d\n", x); =>
// cout << x << "\n";
// scanf("%d", &x); =>
// cin >> x;
int main(int ... |
#include <bits/stdc++.h>
using namespace std;
#define gok ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define endl "\n"
# define int long long
#define pb push_back
const int N = 3005,mod = 1e9 + 7;
int n;
int a[20];
int help(int id,int orr,int xr)
{
if(id==n)
return (xr^orr);
int op1=1e... | #include <bits/stdc++.h>
using namespace std;
// #define LOCAL // 提出時はコメントアウト
#define DEBUG_
typedef long long ll;
const double EPS = 1e-9;
const ll INF = ((1LL<<62)-(1LL<<31));
typedef vector<ll> vecl;
typedef pair<ll, ll> pairl;
template<typename T> using uset = unordered_set<T>;
template<typename T, typename U> usi... |
#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:512000000")
#include<utility>
#include<iostream>
#include<fstream>
#include<vector>
#include<array>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<functional>
#include<random>
#include<climits>
#include<queu... | /******** All Required Header Files ********/
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
... |
#include<bits/stdc++.h>
using namespace std;
int fn(int ii)
{
int a=0;
for(int i=0;i<20;i++)
{
if(((1 << i) & ii)!=0)
a++;
}
return a;
}
int gn(map<int,int> mp,int i)
{
vector<int> vc;
for(int j=0;j<20;j++)
{
if(((1 << j) & i)!=0)
vc.push_back(j+1);
... | #pragma region
#ifdef LOCAL
#include "pch.h"
#else
#include <bits/stdc++.h>
#endif
// debug
template<typename ... Types>
void __read(Types& ... args) {
((std::cin >> args), ...);
}
#define read(type, ...) type __VA_ARGS__; __read(__VA_ARGS__)
template <typename Type, typename... Types>
auto print(Type const &arg, ... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define all(x) (x).begin(),(x).end()
ll power(ll x , ll n,ll mod){
if(n == 0) return 1ll;
ll cur = power(x, n >> 1,mod);
if(n & 1) return (cur % mod * cur % mod * x) % mod ;
return (cur % mod * cur % mod) % mod ;
}
const int maxx = 200... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a==b){
cout<<c<<endl;
}else if(a==c){
cout<<b<<endl;
}else if(b==c){
cout<<a<<endl;
}else{
cout<<0<<endl;
}
} | #include "bits/stdc++.h"
using namespace std;
using ll=int64_t;
using ld=long double;
using ull=unsigned long long;
template <class T>
using grid=vector<vector<T>>;
#define ALL(x) x.begin(),x.end()
#define rep(iter,from,to) for(ll iter=from;iter<to;++iter)
const ll MOD=1e9+7;
const ll INF=1e17;
//#####################... |
#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 ;
//mint
using ll = long long ;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
//const int mod = 998244353;
struct mint {
ll x; // typ... |
/*
これを入れて実行
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... | #pragma region my_template
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
... |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
//#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 5005
#define MOD 998244353
ll dp[SIZE][SIZE];
char base_map[SIZE][SIZE... | #include <bits/stdc++.h>
// #include <atcoder/all> // NOTE: AtCoderライブラリ
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr << #x << ": " << x << ", " << #y << ": " << y << endl;
#define dbg3(x, y, z) cerr << #x... |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ceil(x) static_cast<ll>(ceil(x))
#define floor(x) static_cast<ll>(floor(x))
#define pow(x, y) static_cast<ll>(pow(x, y))
#defi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
double a, b;
cin >> a >> b;
cout << a * (b / 100) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define __ <<" "<<
#define ___ <<" "
#define bash push_back
#define ALL(x) x.begin(),x.end()
// #define int long long
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(3);
cerr << fixed <<... | ///Code by: Luis Alejandro
///Handle: Sekai
///Country: Cuba
#include <bits/stdc++.h>
#define endl '\n'
///Pragmas:
/*
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
*/
using namespace std;
///Red-... |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <complex>
#include <ctime>
#include <bitset>
// #include <atcoder/all>
#include <fstream>
#include <random>
#include ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
#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,... | #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void)
{
int v, t, s, d; cin >> v >> t >> s... |
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(),a.end()
typedef pair<ll,ll> pi;
//__builtin_popcountll(2) (the number of ones in the binary represe... |
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin >> n;
vector<int> v(2*n);
for(int i = 0; i < 2*n; ++i){
cin >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<bool> vbl;
typedef vector<vector<bool>> vvbl;
void INX(){}
template<typenam... |
#include<bits/stdc++.h>
using namespace std;
int a[310000];
int main()
{
int n;
cin>>n;
long long s=0;
bool xiangtong=1;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s+=a[i];
if(a[i]!=a[i-1])
xiangtong=0;
}
if(xiangtong==1)
{
cout<<0;
return 0;
}
long long sum=0;
for(int i=1;i<=n;i++)
sum+=(a[... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
int sq=0 , sum=0;
int n = t;
while (t--){
int temp ;
cin >> temp;
sq += (temp*temp);
... |
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define fast std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NU... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vecto... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int N;
unsigned long long X;
unsigned long long A[50];
unsigned long long Amul[49];
long long base[50];
void A_to_Amul() {
Amul[0] = A[0];
for (int i = 0; i < N-1; i++) {
Amul[i] = A[i+1] / A[i];
}
}
void X_to_base(u... | #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 <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_nod... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
const double PI = acos(-1.0);
/*const double PI = atan2(0.0,-1.0)*/
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... |
#line 1 "main_a.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#i... | //#define MULTICASES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(i=(a);i<=(b);++i)
#define per(i,a,b) for(i=(a);i>=(b);--i)
#define REP(i,a,b) for(i=(a);i< (b);++i)
#define PER(i,a,b) for(i=(a);i> (b);--i)
#define ERR(...) fprintf(stderr,__VA_ARGS__)
inline void ac();
int m... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, m, n) for (ll i = m; i < n; i++)
#define rrep(i, m, n) for (ll i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main () {
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
int sol = 2e9;
for (int msk = 0; msk < (1<<n); msk++) {
vector<int> cur;
int a = 0;
for (int i = 0; i < n; i++) {
a |= ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
int n;
int x[20];
... | #include<bits/stdc++.h>
#define ll long long int
#define db long double
#define ull unsigned long long int
// #define mp make_pair
#define pii pair<ll,ll>
#define F first
#define S second
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
#define Nmax 1000005
#define INF 10... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pld = pair<ld,ld>;
using vi = vector<int>;
using vll = vector<ll>;
using vld = vector<ld>;
#define _GLIBCXX_DEBUG
#define rep(j, m) for (int j = 0; j < (int)(m); j++)
#de... | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <stack>
#define REP(i,N) for(int (i)=0;(i)<(N);(i)++)
#define REP2(i,a,N) for(int (i)=(a);(i)<(N);(i)++)
#define MAX(a,b) ((a)>(b)?(... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define FOR(i,a,b) for(int i = a;i<=b;i++)
using namespace std;
const double e = 1e-9;
int n;
typedef pair<int,int> ii ;
ii A[105] ;
vector<int> G[200] ;
int dd[200] ;
double dist(ii a,ii b){
return sqrt( (a.fi-b.fi)*(a.fi-b.fi) + (a.se-b.se)*(a.second-b.... | #include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
const int kMaxN = 101;
struct P {
double d;
int x, y;
bool b;
} p[kMaxN];
int n, s;
double ans = 1e9;
double D(int i, int j) {
return sqrt(pow(p[i].x - p[j].x, 2) + pow(p[i].y - p[j].y, 2));
}
int main() {
cin >> n;
for (int ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef map<int, int> mii;
typedef pair<int, int> ii;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define int long long
//UF
struct UnionFind {
vector<int> par, siz;
// 初期化
UnionFind(int n) : par(n, -1) , siz(n, 1) { }
int root(int x) {... |
#include <bits/stdc++.h>
#include <string>
#include <cmath>
using namespace std;
#define ll long long int
#define pb push_back
#define CR7 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pii pair<ll, ll>
#define mod 1000000007
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll>
//RRMMMMMMMMMRR... | #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 <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 <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <iomanip>
using namespace std;
using VI = vector <int>;
using VV... |
//Awwawa! Dis cold yis ratten buy tEMMIE!
#include <bits/stdc++.h>
#define ll long long
#define maxn 200005 /*rem*/
#define mod 998244353
#define db double
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define fi first
#define se second
template <typename T> bool chkmax(T &... | /** これを翻訳している間、あなたはあなたの人生のいくつかの貴重な瞬間を無駄にしました **/
#include<bits/stdc++.h>
using namespace std;
#ifdef Zoro
#include "headers/debug.h"
#else
#define debug(x...)
#define deb(x...)
#endif
#define rep(i,x,y) for(int i=x;i<y;i++)
#define repr(i,x,y) for(int i=x;i>=y;i--)
#define int long long
#define pb push_back
#de... |
#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... | /*
I love the sound you make when you shut up.
*/
#include <bits/stdc++.h>
using namespace std;
#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;
/*-------typedefs------*/
template<class T> using or... |
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>... | #include <bits/stdc++.h> //Header Files
#define ll long long int
#define endl "\n"
using namespace std;
ll dfs(vector<vector<int>> &gr, int v, ll a[], ll b[], vector<bool> &vis, ll past)
{
vis[v] = true;
a[v] += past;
ll val = a[v] - b[v];
a[v] = b[v];
for (int adj : gr[v])
{
if (!vi... |
#include <bits/stdc++.h>
#ifdef LILY
#include "Debug.h"
#else
#define var(...) (0)
#define dbg(...) (0)
#endif
using int32 = int;
using int64 = long long;
using namespace std;
class Solution
{
#define int int64
#define sfor(i, n) for (int i = 1; i <= (n); ++i)
#define tfor(i, n) for (int i = 0; i < (n); ++i)
#define I... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a/100.0*b << endl;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
/*
execution in cmd for windows: g++ p1.cpp -op1
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL ans, sum;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
LL a;
cin >> a;
ans += a * a * (n - 1);
ans -= 2 * a * sum;
sum += a;
}
cout << ans;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,m;
int sum[30];
char a[30];
int main()
{
cin>>n>>m;
long long ans=0;
for(int i=1;i<=n;i++)
{
scanf("%s",a+1);
int t=0;
for(int j=1;j<=m;j++)
{
if(a[j]=='1') t++;
}
if(t%2==1) ans+=sum[2],sum[1]++;
else ans+=sum[1],sum[2]++;
}
// puts("");
// fo... | #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 pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define rng(v) v.begin(),v.end()
#define rngr(v) v.rbegin(),v.rend()
const long long INF = 1LL << 60;
using name... |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | // Problem: E - White and Black Balls
// Contest: AtCoder - AtCoder Beginner Contest 205
// URL: https://atcoder.jp/contests/abc205/tasks/abc205_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sy... |
#include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
int result = 0;
if (a == b) {
result = c;
} else if (b == c) {
result = a;
} else if (c == a) {
result = b;
}
std::cout << result << std::endl;
return 0;
}
| #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;
#define ... |
#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 int long long int
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
//const int nax = 1e6+5;... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... |
#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
const long long MOD1 = 1000000007;
const long long MOD2 = 998244353;
#define logn long
#define lnog long
#define lgon long
#define itn int
typedef long long ll;
typedef pair<long double, long double> P;
const long long INF = 1e18;
int main(){
long lo... | #include<bits/stdc++.h>
using namespace std;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while (t--) {
int n, inf = 1e9 + 7;
string s;
cin >> n >> s;
vector<int> dp(26, inf);
dp[s[n - 1] - 'a'] = 0;
int ans = inf;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 4e2+5;
char s[N],t[N];
inline char get(char a,char b){
if(a == b) return a;
if(a == 'P' && b == 'R') return 'P';
if(a == 'R' && b == 'P') return 'P';
if(a == 'S' && b == 'P') return 'S';
if(a == 'P' && b == 'S') return 'S';
if(a =... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const double PI = 3.14159265358979;
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
ll modpow(ll base, ll pow){
ll ret = 1;
while(pow>0){
if(pow & 1) ret = ret * ba... |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define SZ(x) ((int)((x).size()))
#define LE(vec) vec[vec.size()-1]
#define TSTS int t; cin >... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll getmax(vector<int> box, vector<pair<int, int>> &bag, int n){
sort(box.begin(), box.end());
ll result=0;
vector<bool> visit (n, 0);
for(int i=0; i<box.size();i++){
for(int j=0; j<n; j++){
//cout<<bag[j].second<<" ... |
#include <bits/stdc++.h>
using namespace std ;
#define i64 int64_t // typecast using i64(x)
#define int int64_t
#define ld long double
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)
#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define... | #include<bits/stdc++.h>
#define int long long
#define mod 998244353
using namespace std;
inline int read(){
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);
ch=get... |
#include <bits/stdc++.h>
#define yy cout<<"YES"<<endl;
#define nn cout<<"NO"<<endl;
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forc(i, l, r) for (int i = (int)(l); i <= (int)(r); ++i)
#define forr0(i, n) for (int i = (int)(n) - 1; i >= 0; -... | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define double long double
#define rbtree __gnu_pbds::tree<int,__gnu_pbds::null_type,less<int>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>
#define int ll
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define pb push_back
#define ALL... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.... | /** Created by: Humberto Yusta
Codeforces User: humbertoyusta
Country: Cuba
Copyright�� */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas:
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
//#pragma GCC option... |
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mi map<int,int>
#define all(a) (a).begin(),(a).end()
#define F ... | #include <bits/stdc++.h>
using namespace std;
#ifdef BOI
#include "debug.h"
#else
#define debug(args...)
#endif
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair <int, int>;
using pli = pair <ll, int>;
using pll = pair <ll, ll>;
#define pb push... |
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int T, n, cnt, a[N], op[N * N];
int s[10][4] = {
{},
{0, 1, 2, 3},
{0, 1, 3, 2},
{0, 3, 1, 2},
{0, 3, 2, 1},
{0, 2, 3, 1},
{0, 2, 1, 3},
{0, 1, 2, 3}
};
int to[10] = {0, 2, 1, 2, 1, 2, 1};
void out() {
cout << cnt << '\n';
for(int i = 1; i <= ... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... |
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("O2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
////
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define allp(x) (x)->begin(), (x)->end()
#define pb push_... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
char win(char a,char b){
if (a == 'R' && b == 'P') return b;
if (a == 'P' && b == 'S') return b;
if (a == 'S' && b == 'R') return b;
else return a;
}
int main(){
int n,k;
cin... |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<cmath>
#include<vector>
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define per(i,a,b) for(ll i=a;i>=b;--i)
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(),x.end()
#define debug(x) cout<<#... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ll n,a;
cin>>n;
vector<ll> A(n),bit200(200,0);
vector<set<ll>> bit200s(200);
for(ll i=0;i<n;i++) {
cin>>a;
A.at(i)=(a%200);
}
ll N8=n>8?8:n;
set<ll> s1,s2;
bool boo=false;
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, m;
int total=0,ans=0;
cin >> n >> k >> m;
int ar[n];
int sum = 0;
for(int i = 0; i < n - 1; i++)
{
cin >> ar[i];
sum = sum+ar[i];
}
total = (n * m - sum);
if (total <= 0) ans = 0;
else if(t... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define t_times int t; cin >> t; while(t--)
#define _parr(a, n) for(int __i = 0; __i < (int )n; __i++) cout << a[__i] << ' '; cout << '\n'
#define fr(i, p, n) for(int i = (int )p; i < (int )n; i++)
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
vector<int> cnt(10);
for (char c : s) ++cnt[c - '0'];
bool ok = false;
for (int i = 8; i < 1000; i += 8) {
vector<int> cnt2(cnt);
for (char c : to... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define INF 1000000000000 //10^12:∞
#define MOD 1000000007 //10^9+7:合同式の法
sign... |
#include <bits/stdc++.h>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define P pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define mp make_pair
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vll = vector<long long>;
using vb = vector<bool>;
using vd = vector<double>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvc =... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
int32_t main()
{
string s;
cin>>s;
bool ok=true;
for(int i=0;i<s.length();i++)
{
if(i%2==1)
{
if(islower(s[i]))
ok=false;
}
else if(i%2==0)
{
if(isupper(s[i]))
ok=false;
}
}
if(ok)
cout<<"Yes"<<"\n";
else
cout<<"No"<<"\... | #include <bits/stdc++.h>
using namespace std;
void DBG() { cerr << endl; }
template<class Head, class... Tail>
void DBG(Head H, Tail... T) { cerr << ' ' << H; DBG(T...); }
#define dbg(...) cerr << "(" << (#__VA_ARGS__) << "):", DBG(__VA_ARGS__)
using ll = long long;
using ld = long double;
#define sqr(a) ll(a) * (a)... |
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
#define pb push_back
#define MAXN 500005
const ll N=60;
#defin... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define INF (int)2e9
#define mod 1000000007
#define PI 3.141592653589793238
#define all(a) (a).begin(),(a).end()
#define rep(i,a,b) for(int i=a; i<b; ++i)
#define repd(i,a,b) for(int i=a; i>=b; --i)
#define repz(i,b) for(int i=0; i<b; ++i)
#define repdz... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,arr[1006];
cin>>n;
for(int i=0; i<n; i++)
{
cin>>arr[i];
}
sort(arr,arr+n);
int x=0,c,max_c=0,flag=0;
for(int i=2;i<=1000;i++)
{
c=0;
for(int j=0;j<n;j++)
{
... |
#include <bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define mp make_pair
#define pb push_back
#define pll pair<ll,ll>
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define F(i,a,n) for(ll i=a;i<n;i++)
#define fil(ar, val) memset(ar, val, sizeof(ar))
using namespace std;
const in... | #include<bits/stdc++.h>
using namespace std;
#define oo 1000000000
typedef long long int lli;
typedef pair<int,int> pii;
typedef pair<char,int> pci;
int n;
string st,str;
int main(){
cin >> n;
cin >> str;
int cnt =0;
for(int tam = 2;tam<=n;tam++){
//cout << "\n" << tam << "\n";
int at=0,cg=0;
for(int i... |
#include <iostream>
#include <algorithm>
#include <string>
#include <complex>
#include <vector>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <numeric> //lcm
#include <iomanip> //double精度 setprecision
#include <chrono>
#include <random>
#inc... | #include<bits/stdc++.h>
using namespace std;
const int maxn = 2005;
const long long inf = 1e18+10;
int n, m;
vector<pair<long long,int> > g[maxn];
void dijkstra(int v) {
long long d[n+1];
for(int i=0; i<=n; i++) d[i] = inf;
long long ans = inf;
d[v] = 0;
priority_queue<pair<long long,int> > pq;
... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, a[maxn], b[maxn], perm[maxn], c[maxn];
long long ans;
map<int, vector<int>> mp;
map<int, int> id;
void add(int p, int v) {
for (; p <= n; p += p & -p) c[p] += v;
}
int query(int p) {
int s = 0;
for (; p; p -= p & -p) s += c[p];... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using pii = pair<int, int>;
int main() {
int N;
cin >> N;
vector<vector<int>> to(N);
vector<int> a(N-1), b(N-1);
rep(i,N-1) {
cin >> a[i] >> b[i];
a[i]--; b[i]--;
to[a[i]].push_back(b[i]); ... |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (__typeof(to) i = 0; i < to; ++i)
#define cont(i, to) for (__typeof(to) i = 1; i <= to; ++i)
#define circ(i, fm, to) for (__typeof(to) i = fm; i <= to; ++i)
#define foreac... |
// Problem: A - Health M Death
// Contest: AtCoder - Panasonic Programming Contest (AtCoder Beginner Contest 195)
// URL: https://atcoder.jp/contests/abc195/tasks/abc195_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/* Author : Atahar Islam Shihab
... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,n) for(int i=0;i<=(int)n;i++)
const ll mod = 1e9+7 ;
const ll INF = 1e18 ;
ll gcd(long long a,long long b){if(b==0) return a ; return gcd(b,a%b) ;}
ll lcm(long long a,long long b){return a/gcd(a,b... | #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 mp make_pair
#define pb(x) push_back(x)
#define vll vector<long long>
#define pll pair<long long, long long>
#define mll map<long long, long long>
#define sz(v)... |
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define pb push_back
using namespace std;
int main()
{
int n;
cin>>n;
int data[n];
for (int i=0;i<n;i++) {
cin>>data[i];
}
int ans = 2;
int maks = 0;
... | #include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
template <long long mod>
struct modular {
long long value;
modular(long long x = 0) {
value = x % mod;
if (value < 0) value += mod;
}
modular& operator+=(const modular&... |
/*
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
*/
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<ll mod>
struct Mint {
ll x;
Mint(ll x = 0) : x((x %= mod) < 0 ? x + mod : x) { }
Mint& operator+=(Mint rhs) { return (x += rhs.x) >= mod ? x -= mod : 0, *this; }
Mint& operator-=(Mint rhs) { return (x -= rhs.x) < 0 ? x += mod :... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | #include <bits/stdc++.h>
//#pragma GCC optimize(2)
using namespace std;
#define int long long
typedef long long LL;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int inf = 1e18;
const int mod = 998244353;
//const int mod = 1e9 + 7;
const int maxn = 2e5 + 10;
const int N = 25e5 + 100;
int dp[1<<20];
int p[20... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int T;cin>>T;
for(int X=0;X<T;X++){
int L,R;cin>>L>>R;
if(L*2>R)cout<<0<<endl;
else cout<<(R-L*2+1)*(R-L*2+2)/2<<endl;
}
} | #include <bits/stdc++.h>
#define ll long long int
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define vi vector<int>
#define vvi vector<vector<int> >
#define mii map<int,int>
#define pb push_back
#define pii pair<int,int>
#define mkp make_pair
#define scan(a,n) for(int i =0 ; i<n ; i++) cin>... |
#include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const ul mod = 1000000007;
struct edge {
ll to, cost;... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
using namespace std;
const int nax = 105;
int n;
char s[nax];
int a[nax];
vector<vector<int> > cols;
void solve(){
cin >>... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double a, b, c;
cin >> a >> b >> c;
double x = ceil((b * c) / a);
cout << (int)x - 1;
}
| #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long lon... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long l... |
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+2;
int n,m,cn[2];
long long ans;
int main()
{
scanf("%d%d",&n,&m);
for(int x;n;--n)
{
int val=0;
for(int j=m-1;~j;--j)
{
scanf("%1d",&x);
val^=x;
}
ans+=cn[!val];
++cn[val];
}
printf("%lld",ans);
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rrep(i,n) for (ll i = n - 1; i >= 0;i--)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// int num = atoi(string.c_str()); 文字列の整数変... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.