code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define N 100007
#define mod 19260817
#define mid ((l + r) >> 1)
using namespace std;
typedef long long ll;
inline ll rd() {
ll x = 0;
bool f = 0;
char c = getchar();
for(; !isdigit(c); c = g... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<math.h>
#include<iostream>
#include<cmath>
#include<queue>
#include<vector>
#define INF 0x7fffffff
#define IOS ios::sync_with_stdio(false);cin.tie();cout.tie(0)
using namespace std;
typedef long long ll;
const int N=1e5+100;
//const int mod... |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPE(i, l, n) for (ll i = l; i <= ll(n); i++)
#define FORA(i, I) for (const auto& i : I)
#define ALL(v) v.begin(), v.end()
#define UQ(v) v.erase(unique(ALL(v)), v.end())
#define ACM(v) accumulate... |
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#pragma GCC target("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef pair<long ... | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define endl "\n"
using namespace std;
vector<pair<int,int>>adj[205]; //wt vertex;
int32_t main() {
fast
int a, b, x, y;
cin >> a >> b >> x >> y;
// 100 200
// 1 101
for(... |
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define MOD (int)1e9+7
#define INF (int)1e9
#define endll "\n"
#define input(n, a) for (int i=0;i<n;++i) {cin>>a[i];}
#define Laylo cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
typedef long long ll;
typedef pair... | #include <bits/stdc++.h>
using namespace std;
int main(){
string C;
cin >> C;
if(C[0]==C[1] && C[1]==C[2]) cout << "Won" << endl;
else cout << "Lost" << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
#define repeat(i, n) for (int i = 0; i < (int)(n); i++)
using int64 = long long;
namespace {
void solve() {
int n;
int64 X;
cin >> n >> X;
vector<int64> as(n), ubs(n), xs(n);
repeat (i, n) cin >> as[i];
repeat (i, n - 1) ubs[i] = as... | #include <iostream>
#include <string>
using namespace std;
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#define MOD1 1000000007
#define MOD2 998244353
#define LIMIT1 200010
#define LIMI... |
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include<bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> p2;
#define sz(a) ll(a.size())
ll p[4000005],cnt[2005][2005],hell=pow(10,9)+7;
ll mul(ll x,ll y){
x=(x*y)%hell;
return x;
}
ll add(ll x,ll ... |
#include<bits/stdc++.h>
using namespace std;
struct fastio{fastio(){cin.tie(nullptr);ios_base::sync_with_stdio(false);std::cout<<std::fixed<<setprecision(10);}}oitsaf;
#define rep(i,n) for(int i=0;i<int(n);++i)
constexpr char newl = '\n';
template<class T>std::istream&operator>>(std::istream&is,std::vector<T>&v){for(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, s, k;
ll extgcd(ll a, ll b, ll &x, ll &y)
{
if (b == 0)
{
x = 1;
y = 0;
return a;
}
ll d = extgcd(b, a % b, x, y);
ll t = x;
x = y;
y = t - (a / b) * y;
return d;
}
void solve()
{
cin >> n >> s >> k;
ll x, y, d;
if ((d = extgcd(k... |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define sortv(v) sort(v.begin(),v.end())
#define sorta(A,N) sort(A,A+N)
#define rep(i,a,N) for(ll i=a;i<N;i++)
#define test(T) ll T; cin>>T; while(T--)
#define f first
#define s s... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
int t;
cin>>t;
for (int i = 0; i < t; ++i)
{
int n;
cin>>n;
string s;
bool one = false, zero = false;
for (int i = 0; i < 3; ++i)
{
... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
int n;
cin >> n;
vector<ll> data(n);
rep(i,0,n){
cin >> data[i];
... | #include <cstdio>
#include <cstring>
#include <algorithm>
#define rep(a,b,c) for(int a=b;a<=c;a++)
const int p=3;
const int N=4e5+5;
int fac[4],inv[4];
inline int C(int n,int m) { return (n>=m)?(1ll*fac[n]*inv[m]*inv[n-m]%p):0; }
inline int lucas(int n,int m) {
if(!m) return 1;
return 1ll*C(n%p,m%p)*lucas(n/p,m/p)%p;... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int a = n;
int g1 = 0;
int g2 = 0;
for (int i = 0; i < k; i++) {
// 各桁の数値を取り出す
int num = a;
vector<int> v1, v2;
while (true) {
v1.push_back(num % 10);
if... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std; using ll = long long;
using ull = unsigned long long; using P = pair<int, int>;
const int INF = 1e9; const int MOD = 998244353;
// const int dx[] = {-1,0,1,0}; const int dy[] = {0,-1,0,1};
// const int dx[] = {-1,-1,-1, 0, 0, 1... |
#include <bits/stdc++.h>
#define F first
#define S second
#define prev azaza
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int max_n = 200111, inf = 1000111222;
vector<int> a, b;
int main()
{
//freopen("input.txt", "r", stdin);
int n;
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll inf=998244353;
int main(){
ll n;cin>>n;
vector<ll>a(n);
for(ll i=0;i<n;i++)cin>>a.at(i);
sort(a.begin(),a.end());
ll ans=0;
for(ll i=0;i<n;i++){ans+=a.at(i)%inf*a.at(i)%inf;ans%=inf;}
ll tmp=a.at(n-1);
for(ll i=n-2;i>=0;i--){
... |
#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
using namespace std;
unsigned long long L;
int main(){
cin >> L;
long long result = 1LL;
for(int i=1; i<12; i++){
result = result*(L-i)/i;
}
cout << result;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
// s.find_by_order(index);
// s.order_of_key(value);
#define int long long
#define all(a) a.begin(), a.end()
#define dl '\n'
#define why (int)1000000007
//#define why (int)998244353
typedef tree<int, nu... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t = 1,n,m,k,q,l,r,a[809][809],b[809][809],c[809][809],u,v,x,y,z,mod = 1e9 + 7;
string s;
struct st{ll x,y; /*bool operator < (const st &a) const{return x < a.x;};*/};
bool cmp(const st &a,const st &b){return a.x < b.x;}
inline ll read(){
ll s = 0,w ... | // Author: old_school
// Created: 20.02.2021 17:30:29
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
using namespace std;
#define lld long long int
#define ld long double
#define pb push_bac... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author NikuKyabe
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B, C;
while(scanf("%d%d%d", &A, &B, &C) > 0){
if(C%2 == 0){
A = abs(A);
B = abs(B);
}
if(A > B) printf(">");
if(A < B) printf("<");
if(A == B) printf("=");
printf("\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; cin >> N >> K;
cout << N * (N + 1) * 50 * K + K * (K + 1) / 2 * N << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int sum=0;
int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=k;j++)
{
sum=sum+(100*i)+j;
}
}
cout<<sum<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define form(i, n) for (int i = n-1; i >=0; i--)
#define forx(i,x,n) for (int i = x; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(a) int(a.size())
#define pb push_back
#define ll long long
#define srt(a) sort(a.begin(), a.end());
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0,endrep=(n); i<endrep; ++i)
#define rep1(i,n) for(ll i=1,endrep=(n); i<=endrep; ++i)
#define revrep(i,n) for(ll i=(ll)(n)-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 60) -123456789;
#define fastio cin.tie(0); ios_base::s... |
#include<bits/stdc++.h>
#define rep(i , a , b) for(int i = a ; i <= b ; i ++)
#define fi first
#define se second
using namespace std;
const int N = 1e3 + 10;
int mp[N][N] , vis[N][N];
vector<int>G[N][30];
signed main()
{
int n , m ;
cin >> n >> m ;
rep(i , 1 , m)
{
int u , v;
char ch;
cin >> u >> v >> ch;
... | #include<bits/stdc++.h>
using namespace std;
const int N=1e6+1e5,M=1e3+10;
int n,m;
vector<int>e[N];
vector<int>f[M][26];
int a,b;
char c[5];
int d[N];
int cal(int x,int y){
return x*1001+y;
}
queue<int>q;
int main(){
scanf("%d%d",&n,&m);
memset(d,-1,sizeof d);
for(int i=1;i<=n;++i){
d[cal(i,i)]=0;
q.push(cal(... |
#include <bits/stdc++.h>
using namespace std;
long long INF = 1LL<<60;
using ll = long long;
using vll = vector<ll>;
using mll = map<ll, ll>;
#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()
template<class T>bool chma... | #include <iostream>
#include <cmath>
#include <stdio.h>
#include <string.h>
#include <bits/stdc++.h>
#include <vector>
#include <array>
#include <tuple>
using namespace std;
int main(){
long long N;
cin >> N;
long long p, S;
S=N;
p=1;
for (int i=0; i<=60; i++){
S=min(N/p+i+N%p, S);
p=2*p;
}
c... |
#include<bits/stdc++.h>
using namespace::std;
long mat[10000][10000];
class Advertisement{
public:
void set_val(int x,int y,int inr);
long get_height();
long get_width();
long obtain_patch(long mode);
long a;
long b;
long c;
long d;
long s;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
int n;
int x[202],y[202],r[202];
struct A{
int a[202],b[202],c[202],d[202];
void out(){
for(int i=0;i<n;i++){
printf("%d %d %d %d\n",a[i],b[i],c[i],d[i])... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long ul;
int main() {
int n; //木の頂点の数
scanf("%d", &n);
vector<int> p(n, -1), c(n, 1), d(n, 0);
// p[i]: iの親
// c[i]: iを根とする部分木の濃度
// d[i]: iに進んだ時に獲得できる個数
vecto... | #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<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io(){
std::cin.tie(n... | #include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,res,ans;
cin >>a>>b;
ans=(2*a)+100;
if(b<=ans)
{
res=ans-b;
}
cout<<res<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void solve(){
int a,b;
cin>>a>>b;
cout<<2*a+100-b;
}
int main(){
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl '\n'
#define pb push_back
#define pob pop_back
#define pii pair<int,int>
// int mod = 3;
#define mod 1000000007
// #define mod 1000000009
// #define mod 163577857
// #define mod 998244353
#define rep(i,n) for (int... | #include <bits/stdc++.h>
using namespace std;
vector<long long> base_n(long long n, long long M){
vector<long long> basen;
while(M>0){
basen.push_back(M%n);
M/=n;
}
return basen;
}
int check(long long n, long long M, string X){
vector<long long> basen = base_n(n,M);
int ketasuu... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
ll getXOR(ll BITree[], ll index) {
l... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef long int li;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test ll t; cin >> t; while(t--)
const long long int cons = 300005;
const long long int N = 100005... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v)... | //#include <atcoder/all>
#include <bits/stdc++.h>
#include <cassert>
#include <numeric>
using namespace std;
//using namespace atcoder;
typedef long long LONG;
const int MOD = 1000000007;
int gcd(int x, int y) {
if (x % y == 0) {
return y;
}
else {
return gcd(y, x % y);
//x%y==0でないときはユーグリットの互除法を使って再帰的に関数を呼... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i< int (n); i++)
using namespace std;
typedef long long ll;
int main(){
vector<int> a(200100);
int n;
cin >> n;
int k=0;
for(int i=0; i<n; i++){
int p;
cin >> p;
a[p]++;
while(k<200010){
if(a[k]==0) {
cout << k << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 2e5+5;
typedef pair <int,int> pii;
#define x first
#define y second
int w[sz], b[sz], p[sz], g[sz];
bitset <sz> vis;
int main() {
int n;
cin >> n;
for(int i=1; i<=n; i++) scanf("%d", &w[i]);
for(int i=1; i<=n; i++) scanf("... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const lo... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c;
cin>>a;
if(a>=0)
{
printf("%d\n",a);
}
else
{
printf("0\n");
}
} |
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <climits>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define lson 2*i
#define rson 2*i+1
#define ... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define u unsigned
#define endl '\n'
#define mod 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
void solve(){
ll n;
cin>>n;
unordered_set<ll> s;
for(ll a=2;a*a<=n;a++){
... | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... |
#include <bits/stdc++.h>
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define all_of(v) (v).begin(), (v).end()
#define sort_unique(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define fi first
#define se second
const int MAXN = 101;
//const LL INF = (... | #include <bits/stdc++.h>
#define INF32 2147483647
#define INF64 9223372036854775807
#define rep(i, l, n) for(int i = l, i##_end = n; i < i##_end; ++i)
#define rrep(i, n, l) for(int i = ((int)(n)-1), i##_end = l; i >= i##_end; --i)
#define erep(i, n) for(auto &i : n)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
static const ll mod=998244353;
ll N,M;
ll sum[5005];
ll POW[5005];
ll POWM[5005];
void init(){
for(ll i=0;i<5005;i++)POW[i]=1;
for(ll i=0;i<5005;i++){
ll x=0;
for(ll j=0;j<M;j++){
x=(x+POW[j])%mod;POW[j]=(j*POW[j])%mod;
}sum[i]=x;
}
PO... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<climits>
#include<algorithm>
#include<queue>
#include<vector>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
#define mod 998244353
using namespace std;
inline int read(){
int f=1... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define endl "\n"
#define pb push_back
#define sq(a) ((a)*(a))
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(a) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
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; } ret... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
struct __INIT{__INIT(){cin.tie(0);ios::sy... | #include<iostream>
#include<vector>
using namespace std;
typedef long long li;
#define minimize(a,b) (a>(b)?a=(b),1:0)
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; i... |
#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... |
#include <iostream>
main(){int H,W,A,P,K=1e5;for(std::cin>>H>>W;std::cin>>A;P+=A)K=std::min(A,K);std::cout<<P-K*H*W;} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define nl '\n'
#define X first
#define Y second
#define nimble ios::sync_with_stdio(0);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#defi... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... |
#include <bits/stdc++.h>
using namespace std;
#define fo(i, x, y) for (int i = (x); i <= (y); ++i)
#define fd(i, x, y) for (int i = (x); i >= (y); --i)
typedef long long ll;
const int maxn = 2e5 + 5;
int n;
ll a[maxn], s[maxn];
int getint()
{
char ch;
int res = 0, p;
while (!isdigit(ch = getchar()) && (ch ^ '-'... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
template <class T>
bool chmax(T& a, const T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T& a, const T b) {
if(b < a) {
... |
#include <bits/stdc++.h>
#define clr(x) memset(x,0,sizeof(x))
#define For(i,a,b) for (int i=(a);i<=(b);i++)
#define Fod(i,b,a) for (int i=(b);i>=(a);i--)
#define fi first
#define se second
#define kill _z_kill
#define y0 _z_y0
#define y1 _z_y1
#define x0 _z_x0
#define x1 _z_x1
#define pb(x) push_back(x)
#define mp(x,y)... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0), cout.tie(0);
#define print(a) for(int i=0;i<(a.size());i++){cout<<a[i]<<"\n";}
#define sortt(a) sort(a.begin(),a.end())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define int ... |
#include<bits/stdc++.h>
#define pi 3.141592653897932384626
#define abs(x) ((x)>0?(x):(-(x)))
#define eps (double)(0.0000001)
#define fs first
#define se second
//freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
using namespace std;
int main()
{
int n,a[400005],mod=3;
int fex[400005],g[400005],m[3]={1,... | #include <iostream>
#include <algorithm>
#include <unordered_map>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <deque>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef tuple<ll, ll, ll> tplll;
typedef pair<ll, ll> pll;
#define rep(i, n) for (ll i = 0; i ... |
#include <string>
#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 <utility>
#include ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
vector<int>v;
v.push_back(a);
v.push_back(b);
v.push_back(c);
sort(v.begin(),v.end());
if(v[2]-v[1]==v[1]-v[0])
cout<<"Yes";
else
cout<<"No";
}
|
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x)... | #include<bits/stdc++.h>
#include<iostream>
#include<map>
#include<math.h>
#include<string>
#include<string.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
#define _GLIBCXX_DEBUG
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ... |
#include<bits/stdc++.h>
#define N 5000005
using namespace std;
int read() {
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while('0'<=c&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
int n,a[N],b[N],ans;
bool tag[2005];
int main() {
n = read();
for(int i=1; i<=n; ++i)a[i] = read... | #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
int lo = *min_element(a.begin(), a.end());
unordered_map<int, int> memo;
for (int ai : a) {
for (int ... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define ull unsigned long long
#define ll long long
#define M 998244353
#define pb push_back
#defin... | #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
ll GCD(ll a,ll b){ return b?GCD(b,a%b):a; }
ll A,B;
int E[73][73];
int pN;
int I[38];
ll G[38];
int dp1[1<<19], dp2[1<<19];
int dp3[1<<19];
ll solve(){
rep(i,pN) G[i]=0;
rep(... | #include <cstdio>
#include <cassert>
long long A,B,ans,tmp;
long long a[105];
long long g[105][105];
bool fp[105];
long long gcd(long long a,long long b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
void dfs(long long now,int p)
{
if(now==B+1)
{
ans++;
return;
}
dfs(now+1,p)... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll 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<... | #include <iostream>
using namespace std;
int main(){
int i,j,k,x,cnt = 0; cin >> x;
for(i=1;i<=x;i++){
for(j=1;j<=x;j++){
if(i*j>x) break;
for(k=1;k<=x;k++){
if(i*j*k>x) break;
cnt++;
}
}
}
cout << cnt << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define TEST int t; cin>>t; while(t--)
#define pb push_back
#define pii pair <int, int>
#define vi vector <int>
#define ff first
#define ss second
#define vpii vector <pair <int, int>>
#define vvi vector <vector <int> >
#define all(x) (x).begin(), (x).e... | #define nl "\n"
#define ll long long
#define ull unsigned long long
#define pb push_back
#define SIZE(a) (int)a.size()
#define SORT(v) sort(v.begin(),v.end())
#define RSORT(v) sort(v.rbegin(),v.rend())
#define REV(v) ... |
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<functional>
#include<map>
#include<cmath>
#include <iterator>
#include<algorithm>
#include<queue>
#include<cstdlib>
#include<stdio.h>
#include<assert.h>
#include<sstream>
#define ff first
#define ss second
#define rep(i,a,b) for(i=a;i<b;i++)
#d... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t = 1;
//cin>>t;
while(t--){
long long k;
cin>>k;
long long n;
cin>>n;
vector<long long> all;
long long cur =0;
for(long long i=1;i<=100;i++){
cur+=k;
if(cur>=100){
... |
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=1;i<=(n);++i)
#define rep3(i,i0,n) for(ll i=i0;i<(n);++i)
#define rrep(i,n) for(ll i=((n)-1); i>=0; --i)
#define rrep2(i,n) for(ll i=(n); i>0; --i)
#define pb push_back
#define mo... | #include <bits/stdc++.h>
#ifdef LOCAL
#include "prettyprint.hpp"
#else
#define deb(...)
#endif
using namespace std;
using ll = long long;
const int mod = 998244353;
int main()
{
cin.tie(0)->sync_with_stdio(0);
// cout << fixed << setprecision(15);
int h, w;
cin >> h >> w;
vector<vector<char>> g(h... |
#include <cstdio>
#include <algorithm>
int A[2001][2001];
int dp[2001][2001];
int main(){
int h, w;
scanf("%d%d", &h, &w);
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
char c;
do { scanf("%c", &c); } while(c != '+' && c != '-');
A[i][j] = c == '+' ? 1 : -1;
}
}
for(int ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl '\n'
llo aa[100001];
llo bb[100001];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
llo n,l;
cin>>n>>l;
llo ans=0;
for(llo i=0;i<n;i++){
... |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int g1(string s)
{
sort(s.begin(), s.end(), greater<char>());
return stoi(s);
}
int g2(string s)
{
sort(s.begin(), s.end());
return stoi(s);
}
int main()
{
string n;
int ak;
cin>>n>>ak;
int size = ak+1;
string dp[size]{};... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define PI (acos(-1.0))
#define EPS 1e-9
#define INF 0x3f3f3f
//#define int ll
//int：4e10 ll:9e18 ull:1e20 __int128:3e38
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef __int1... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x=0):x(x%mod){}
mint operator-() const {return mint(-x);}
mint& operator+=(const mint a) {
if((x += a.x) >= mod) x -= mod;
ret... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
int main(){
int t;
cin>>t;
while(t--){
ll a,b,c,ans=0;
cin>>a>>b>>c;
if(a>=b+c){
ll res=(a-b-c+1)*(a-b-c+2)%mod;
... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
vector<vector<int>> seen(n + 1, vector<int>(500, 0));
vector<ll> ans;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
//cin >> t;
while(t--)
{
int n;
cin >> n;
ll ans = 16ll * 25ll * 27ll * 7ll * 11ll * 13ll * 17ll * 19ll * 23ll * 29ll + 1;
cout << ans << "\... |
#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 <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
using namespace std;
#define PB push_back
#define MP make_pair
#defin... |
#include <iostream>
#include <bits/stdc++.h>
#define pb push_back
#define ll long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
ll n=s.length(),c=0,li=n;
char pri='0';
for(ll i=n-2;i>=0;i--)
{
if(s[i]==s[i+1] && s[i... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i, n) for(ll i=n-1;i>=0;--i)
#define rep1(i, n) for(ll i=1; i<=n; ++i)
#define repitr(itr,mp) for(auto itr=mp.begin();itr!=mp.end();++itr)
#define ALL(a) (a).begin(),(a).end()
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5+4;
ll seg[4*N], lazy[4*N];
vector<int> g[N];
int in[N], out[N], timer = 0;
void propagate(int node, int l, int r)
{
if(lazy[node]==0)
return;
seg[node] += lazy[node] * (r-l+1);
if(l != r)
{
lazy[node << ... | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vpi vector<pi>
#define fr(i, a, b) \
for (auto i = (a); i != (b); i++)
typedef long long l... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
// typedef tree<
// int,
// null_type,
// less<int>,
// rb_tree_tag,
//... | #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 ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define f... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long int ll;
typed... |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(3);
for (int i = 0; i < 3; ++i) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
if (vec.at(0) - vec.at(1) == vec.at(1) - vec.at(2)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
// Hi
const double eps = 0.0000001;
int main(){
ios::sync_with_stdio(0);cin.tie(0);
long double r,x,y;
cin>>r>>x>>y;
long double d = sqrt(x*x+y*y);
if(fabs(d-r) < eps){
cout<< 1 << '\n';
}else if(d <= r+r){
cout << 2 << '\n';
}el... |
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
#define ld long double;
#define REP(i,n) for(in... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(c==1){
if(b>a){
cout<<"Aoki";
}
else{
cout<<"Takahashi";
}
}
else{
if(a>b){
cout<<"Takahashi";
}
else{
cout<<"Aoki";
}
}
cout<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define M (L+R)/2
#define N 500009
#define inf 99999999999
#define ll long long
#define mod 1000000007
#define sz size();
using namespace std;
ll k,ans;
int main(){
ios::sync_with_stdio(0);
cin>>k;
for(ll a=1;a<=sqrt(k);a++){
for(... | #include<bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
// using namespace atcoder;
using lint = long long;
using graph = vector<vector<int>>;
#define endl '\n'
lint const mod = 1e9+7;
//long const mod = 998244353;
int main(){
int n;
cin >> n;
vector<pair<int,int>>ans(n);
for(int i=1;i<=... |
#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(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=1e18;
int main(){
ll n, m; cin >> n >> m;
VI a(m); RE... | #define _GLIBCXX_DEBUG
#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... |
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
#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 ... | #include<iostream>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (... |
#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 ... | #pragma GCC optimize(2)
//#include <bits/stdc++.h>
#include <iostream>
#include <set>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <utility>
#include <map>
#define rush() int T; while(cin>>T) while(T--)
#define ms(a,b) memset(a,b,sizeof ... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
using namespace std;
#define LL long long
#define DB double
#define MAXN 200
#define Pr pair<int,int>
#define X first
#define Y second
#define INF 1000000001
#define mem(x,v) memset(x,v,sizeof(x))
... | #include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) for (__typeof(... |
#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 ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define reset(x) memset(x... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,K;cin>>N>>K;
vector<ll> sum(3*N+1,0);
for(ll i=3;i<=3*N;i++) {
sum[i]=(i-1)*(i-2)/2;
if(i-3>=N) {
ll k=i-3-N;
sum[i]-=((k+2)*(k+1)/2)*3;
}
if(i-3>=2*N) {
ll k... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
#define ll long long
#define ld double
using namespace __gnu_pbds;
using namespace std;
template <typ... | #include <bits/stdc++.h>
#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 long
#define ull unsigned long long
#define pb push... |
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <tuple>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <bitset>
#include <list>
#include<iomanip>
using namespace std;
using ll = long long;
using UL... | // ＵＴＦ−８
#include<bits/stdc++.h>
/* #include<atcoder/all> */
/* using namespace atcoder; */
using namespace std;
using ll = long long int;
using lc = complex<double>;
template<class T>bool chmax(T &a, const T &b) { return (a<b ? (a=b,1) : 0); }
template<class T>bool chmin(T &a, const T &b) { return (a>b ? (a=b,1) : ... |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define nl "\n";
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define db long double
#define mod 1e9 + 7
#define lb lower_bound
#define ub upper_bound
#define vlli vector<lli>
#define mslli multiset<lli>
#define inf INT_M... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
N--;
cout << N << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
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 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
map<int, bool> m;
for (int i=0; i<N; i++) {
int p;
cin >> p;
m[p] = true;
for (int j=ans; j<=200000; j++) {
if (!m.count(j)) {
cout << j << endl;
ans = j;
break;
}
... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... | // KEEP CALM and Enjoy the Problem B-)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mod 1000000007 // 1e9+7
#define inf 1e18
#define watch(x) cout<<(#x)<<" is "<<(x)<<"\n"
#define watch2(x,y) cout<<(#x)<<" is "<<(x)<<" and "<<(#y)<< " is " <<(y)<<"\n"
struct custom... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a) a.resiz... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mod 1000000007
#define rep(i,n) for(int i=0; i<n; i++)
#define repa(i,start,end) for(int i=start; i<=end; i++)
#define repd(i,start,end) f... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define even(x) (x % 2 == 0 ? true : f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define M 1000000007
#define FOR(i, s, n) for (ll i = (s); i < (n); ++i)
#define FORALL(i, n) for (ll i = 0; i < (n); ++i)
#define MOD 1000000007
#define ff first
#define ss second
#define pll pair<long long, long long>
#define pii pair<int,int>
#defi... |
/* A */
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using pii = pair<int, int>;
const int N = 3;
int n, m, a[N][N];
signed main(int argc, char** argv)
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
for (int k = 1; k <= 2; ++k) {
fo... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A1,A2,A3; cin >> A1 >> A2 >> A3;
string ans = "No";
//(A1,A2,A3)
if(A3-A2 == A2-A1) ans = "Yes";
//(A1,A3,A2)
if(A2-A3 == A3-A1) ans = "Yes";
//(A2,A1,A3)
if(A3-A1 == A1-A2) ans = "Yes";
//(A2,A3,A1)
if(A1-A3 == A3-A2)... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF=1e17;
const int N=1e5+3,M=1e5+3;
template <typename T>
inline void read(T &x){
x=0;char ch=getchar();bool f=false;
while(!isdigit(ch)) f|=ch=='-',ch=getchar();
while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=f?-x:x;
}
tem... | #pragma warning(disable:4996)
//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <queue>
#define fastio ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ln '\n'
#define rp ' '
typedef long long ll;
typedef long double lf;
using namespace s... |
#include <iostream>
using namespace std;
int main()
{
int a,b,x,y,i,j,sum=1;
cin>>a>>b>>x>>y;
char str[a+1][b+1];
for(i=0;i<a;i++)
{
cin>>str[i];
}
i=x-1,j=y-1;
for(i=x;i<a;i++)
{
if(str[i][j]=='.')
{
sum++;
}
if(str[i][j]=='#')
break;
}
for(i=x-1,j=y;j<b;j++)
{
if(str[i][j]=='.')
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<vector<vector<long double> > > vvvld;
typedef vector<vector<long double> > vvld;
typedef vector<vector<vector<int> > > vvvi;
typedef vector<vector<int> > vvi;
#define rep(i,n) for (int i = 0; i< (int)(n); i++)
int kazu(int x, string s)... |
//1階から決めると色々決まるため、DPができる.
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int n;
int a[100], b[100];
int idA[200];
int idB[200];
bool dp[201];
bool check(int i, int j) {
int k;
//[i, i + j) -- [i + j, i + 2j)
for (k = 0; k < 2 * j; k++) {
... | // AUTHOR: Sumit Prajapati
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define mk ... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define st first
#define nd second
#define endl '\n' //toggle off for interactive problems
#define what_is(x) cerr << #x << " is " << x << endl;
#define what_is_v(x) cerr << #x << " is "; for(auto&e: (x)) cerr << e << '... | #include<bits/stdc++.h>
#include<tuple>
typedef long long ll;
#define INF 9999999999
#define mod 1000000007
#define eps 1e-12
using namespace std;
typedef pair<ll,ll>du;
ll n,m,a,b,c,d,dx[4]={1,-1,0,0},dy[4]={0,0,1,-1},ans=-1;
vector<du>edge[200];
queue<du>q;
ll dis[2005][2005],gone[2005][2005],done[205];
char s[2005][... |
#include <bits/stdc++.h>
using namespace std;
#define all(c) c.begin(), c.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, a, b) for (int i = a; i <= b; ++i)
#define rep3(i, a, b) for (int i = a; i >= b; --i)
#define endl '\n'
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define u... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define s(x, n) memset(x, n, sizeof(x));
#define pb(x) push_back(x)
#define NIL -1
#define MAXN 11
void solve()
{
ll n, a, b;
cin >> n >> a >> b;
if (a + b > n)
cout << "0\n";
else
{
ll temp = ... | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll t;
const ll MOD = 1e9+7;
std::cin >> t;
for (int i = 0; i < t; i++) {
ll n,a,b;
std::cin >> n>>a>>b;
if(a>b)swap(a,b);
ll ma = min(a-1,n-b);
ll mm = 0;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
void debug_out(){
cerr << endl;
}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef local
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARG... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int qmax(int a, int b){
return (a > b) ? a : b;
}
int n;
vector<int> v[200200];
vector<int> ord;
int ans[200200];
int nowans = 1;
int pos[200200];
int dept[200200];
int mx_dept[200200];
bool cmp(int a, int b){
return (mx_dept[a... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin(... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define P pair<int,int>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
template<class T> inline bool chmax(T &a, const T &b){ if(a<b){ a=b; r... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ld long double
#define sz size()
#define lala for(ll i=0;i<n;i++)
#define pll pair<ll,ll>
#define ed "\n"
#define ct cout
#define m_p make_pair
#define vi vector<ll>
#define vc vector<char>
#define ff first
#defin... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
//#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++... |
#include<bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int n;
cin >> n;
int ans = n / 100;
if ( n % 100 ) ans ++;
cout << ans;
}
| #include<iostream>
#include<cstdio>
using namespace std;
int n;
int main()
{
scanf("%d",&n);
if(n >= 0)
printf("%d\n",n);
else
printf("0\n");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define F(i, a, b) for (int i = a; i < b; ++i)
#define R(i, a, b) for (int i = a; i >= b; ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
ll divceil(ll x, ll y) { return(x % y ? x / y + 1 : x / y); }
ll invMOD(ll x) {
ll b = MOD, u = 1, v = 0;
while (b) {
ll t = x / b;
x -= t * b;
swap(x, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
i... |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... | #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
int n, m;
int a[105], b[105];
int k;
int c[20], d[20];
... |
#include <bits/stdc++.h>
using namespace std;
std::pair<int, std::vector<int>> tree_diameter(const std::vector<std::vector<int>>& G) {
std::vector<int> to(G.size());
auto dfs = [&](const auto& dfs, int v, int p) -> std::pair<int, int> {
std::pair<int, int> ret(0, v);
for (int c : G[v]) {
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = b; i >= a; i--)
using namespace std;
const int N = 200111;
int n, s, t, sub[N], ans[N], e = 1;
vector<int> g[N];
pair<int, int> dfs(int v, int p) {
pair<int, int> a = {0, v};
for (auto u : g[v]) {
if (... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 998244353;
ll power(ll a, ll x)
{
if(x == 0) return 1;
if(x == 1) return a;
if(x % 2 == 0)
return (power(a, x / 2) * power(a, x / 2)) %mod;
else
return (a * power(a, x - 1)) % mod;
}
int main()
{
c... | #include <bits/stdc++.h>
#include <climits>
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define srep(i, begin, end) for (__typeof(end) i = begin; i != end; i++)
#define si(x) int x = scanInt();
#define sll(x) LL x = scanL... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
// using namespace atcoder;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}e... |
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),i##z=(b);i<=i##z;i++)
#define ROF(i,a,b) for(int i=(a),i##z=(b);i>=i##z;i--)
#define temT template<typename T>
using namespace std;
typedef long long ll;
const int N=int(5e5)+10;
int n; ll res; char s[N],t[N]; bool flag=1;
char rd(){
char t=getchar();
while(!... | #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;
int main(){
//ll num = sqrt(HUGE_NUM/2+100);
//printf("num:%lld\n",num);
ll N;
... |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <chrono>
#include <random>
#define rep(... | #include <bits/stdc++.h>
#define INF 1e9
#define eps 1e-9
typedef long long ll;
using namespace std;
int n, a[1000010], pos;
ll sum[100010], ans = 4e18;
double L, R;
int main(){
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
if(n != 1){
for(int i = n; i >= 1; i--)
sum[i] = s... |
#include <iostream>
#include <vector>
using namespace std;
void chmin(int& a, int b){ if(a > b) a = b; }
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> idx(N, -1);
int ans = N;
for(int i = 0; i < N; i++){
int A;
cin >> A;
... | #include <cstdio>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <bitset>
using namespace std;
const int INF = 1000000001;
const int MAX_N = 200... |
#include<bits/stdc++.h>
using namespace std;
#define fur(i,n,m,k) for(int i = (n) ; i < (m) ; i += k)
#define fr(i,n,m,k) for(int i = (n - 1) ; i >= (m) ; i -= k)
#define pub push_back
#define pop pop_back
#define Sz size()
#define F first
#define lob lower_bound
#define S second
#define B begin()
#define E end()
typed... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod ... |
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i>=b;i--)
#define ll un... | #include<bits/stdc++.h>
#define vi vector<int>
#define vb vector<bool>
#define vs vector<string>
#define vvi vector<vector<int>>
#define vpi vector<pair<int,int>>
#define pb push_back
#define mp make_pair
#define int long long... |
/*
* author :Sadik Hassan(_sad_)
*
*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define nl "\n"
#define pb push_back
... | #include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Vll =vector<ll>;
using VVll =vector<vector<ll>>;
template <class T>
using Vec = vector<T>;
template <class T>
using VVec = vector<vector<T>>;
void Z(){ cout<<"Test"<<endl; }
int main(){
ll n,k;
cin>>n>>k;
cout<<100*k*(n+1)*n/2+... | #include <bits/stdc++.h>
using namespace std;
/*
Problem B: AtCoder Condominium
*/
typedef long long ll;
void solve(){
int n; int k;
scanf("%d%d", &n, &k);
ll answer = 0;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= k; ++j){
answer += (100*i+j);
}
}
printf("%lld\n", answer);
}
int main(){
solve(... |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M, K;
vector<int> A, B, C, D;
cin >> N >> M;
A.resize(M); B.resize(M);
rep(i, M) { cin >> ... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;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 chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ostream &operator<<(ostream &os, const... |
#include<bits/stdc++.h>
using namespace std;
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int> >
#define mk(arr,n,type) type *arr = new type[n]
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ld ... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define INF 0x3F3F3F3F
using namespace std;
struct point {
int x;
int y;
int z;
}Point[17];
int dis(point a, point b)
{
return abs(b.x - a.x) + abs(b.y - a.y) + max(0, b.z - a.z);
}
int d[18][18];
int dp[1<<18][18];//x下标为已访问点集，用二进制表示,y下标为当前点，... |
#include <iostream>
#include <string>
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie()
using namespace std;
signed main(){
//fio;
map<int,int>mp;
mp[0] = 0;
mp[1] = 1;
mp[9]= 6;
mp[6] = 9;
mp[8] = 8;
string s;
cin >> s;
reverse(s.be... | // Created by ...Rahul Chandra
#include <bits/stdc++.h>
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define ... |
#pragma GCC target ("avx2")
//#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define input(a,n) for(ll i1=0;i1<n;i1++)cin>>a[i1]
#define ll long long
#define pi 2 * acos(0.0)
#define usll unordered_set<ll>
#define sll set<ll>
#define vll v... | /*
* Created by : imay_10 (Ayush Mishra)
*
* " It won't happen, until you make it happen !!! "
*
* Template for CP contests
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mxn = 1e6;
const int mod1 = 1e9+7;
const int mod2 = 998244353;
const ll inf = 1e18;
const double pi = 3.14... |
#include <bits/stdc++.h>
using namespace std;
long long color3(const vector<vector<int>> G,vector<int> c){
bool ok;
long long ans=0;
if(c.size()==G.size()) return 1;
for(int i=0;i<3;i++){
ok=1;
for(int j:G.at(c.size())){
if(j<c.size()&&c.at(j)==i){
ok=0;
break;
}
}
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1e18+7;
const lint inf=1e9+7;
cons... |
#include<bits/stdc++.h>
using namespace std;
struct tree{
int l,r;
long long sum,add;
}tr[1200000];
long long a[1200000],n,m;
void pushup(int u){
tr[u].sum=tr[u*2].sum^tr[u*2+1].sum;
}
void build(int u,int l,int r){
tr[u].l=l,tr[u].r=r;
if(l==r){
tr[u].sum=a[l];
return;
}
int... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<ll,ll>
#define vi vector<ll>
#define mii map<ll,ll>
#define pqi ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.