code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int32_t main()
{
int t;
//cin>>t;
t=1;
while(t--)
{
int n;cin>>n;
map<string,int> one;
map<string,int> two;
while(n--){
string s;
cin>>s;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int T;
int extGCD(int a, int b, int &x, int &y)
{
if(b == 0)
{
x = 1;
y = 0;
return a;
}
int ret = extGCD(b, a % b, y, x);
y -= a / b * x;
return ret;
}
int unit(... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define ve vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define all(v) (v).begin(), (v).end()
#define sortve(v) sort(all(v))
#defi... | // ABC196C
// 幾何
// 各色ごとの最終位置は二択.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N;
cin >> N;
map<int, vector<int>> m;
for (int i = 0; i < N; i++) {
int x, c;
cin >> x >> c;
m[c].pus... |
#include<bits/stdc++.h>
int main(){
using namespace std;
const auto scan{[]{unsigned long r; cin >> r; return r;}};
const auto N{scan()}, M{scan()};
const auto [h, dif]{[&N]{
vector<unsigned long> h(N);
for(auto&& i : h)cin >> i;
sort(begin(h), end(h));
vector<unsigned l... | #pragma region Region_1
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
using ll = long long;
using ... |
#include <bits/stdc++.h>
using namespace std;
int t[200005];
long long a[200005];
long long sum[200005];
pair<long long, long long> tree[1000000];
void update(int n, int s, int e, int i, int t, long long v){
if(s == e){
if(t == 2) tree[n].first = v;
else tree[n].second = v;
}
else{
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... |
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#... | #include <iostream>
#include <vector>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
using namespace std;
long long pow_mod(long long x, long long y, long long MOD) {
long long ret = 1;
while (y) {
if (y & 1)
ret = ret * x % MOD;
x = x * x % MOD;
y >>=... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
#define f first
#define s second
#define ub upper_bound
#define lb lower_bound
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(2*N);
vector<pair<int,int>>B(2*N);
vector<int>C(2*N);
for(int i = 0; i < 2*N; i++) {
cin >> A[i];
B[i] = {A[i],i};
}
sort(B.rbegin(),B.rend());
for(int i = 0; i < N; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
# define Z 1000000007
# define el "\n"
# define vt vector
# define pb push_back
# define all(v) (v).begin(),(v).end()
# define ll long long int
int main()
{
ll l;
cin>>l;
vt<ll>v(1<<l);
for(ll i=0;i<(1<<l);i++){
cin>>v[i];
}
auto k1 = max_element(v.begin(),v.begi... | #include <iostream>
#include <vector>
#include <numeric>
using namespace std;
int main() {
int n;
cin >> n;
vector <long long> a(1 << n);
for (auto &x : a) {
cin >> x;
}
vector <int> id(1 << n);
iota(id.begin(), id.end(), 0);
for (int i = 0; i < n - 1; ++i) {
int f = 1 << (i + 1);
for (... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(ll i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) ... | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#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... |
// D - Base n
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
string X;
ll M;
string f(ll n){
ll m = M;
string res = "";
while(m){
ll r = m % n; m = m / n;
res += r <= 9? to_string(r): "a";
}
reverse(res.begin(), res.end());
return res;
}
bool check(ll n){
string m = f(n);
if(X.size() >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n"
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void solve(){
int a,b;
cin>>a>>b;
int sum1 =0;
int sum2 =0;
while(a){
int r1 = a%10;
sum1+=r1;
a/=10;
}
while(b){
int r2 = b%... |
#include<bits/stdc++.h>
#define N 505
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
bool mmp1;
int n,m,K;
namespace P100 {
int C[N][N];
int A[N],B[N];
int D[N][N];
void solve() {
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&C[i][j]);
for(int i=1;i<=n;i++)
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define length size()
#define int long long
#define ll long long
#include <cstdint>
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
... |
#include<bits/stdc++.h>
using namespace std ;
#define ll long long int
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define DISPLAY(V) for(auto it : V) { cout<<it<<" " ;} cout<<endl;
#define DISPLAY2(V) for(auto it : V) { for (auto val : it) { cout<<val<<" ";} cout<<endl;}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int t;
cin>>t;
while(t--)
{
long long int n;
cin>>n;
if(n%2!=0)
cout<<"Odd"<<"\n";
else if(n%4==0)
{
cout<<"Even"<<"\n";
}
else
cout<<"Same"<<"\n";
}
return 0;
} |
//a.9
#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(),x.end()
#define CASE(t) cout<<"Case #"<<(t)<<": ";
#define endll endl
#define endl '\n'
#define mod 1000000007
#define INF 1e18
#define maxN 500005
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
ll ceill(ll a,l... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define FOR(i, a, b) for(ll i=(a); i < (ll)(b); ++i)
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=... |
#include <bits/stdc++.h>
using namespace std;
#define vll vector<long long>
#define mll map<long long,long long>
#define pll pair<long long,long long>
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 9... |
// Problem : D - KAIBUNsyo
// Contest : AtCoder - AtCoder Beginner Contest 206（Sponsored by Panasonic）
// URL : https://atcoder.jp/contests/abc206/tasks/abc206_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#pragma GCC optimize("Ofast")
#pragma GCC t... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<pair<ll, ll> > vii;
typedef pair<ll,ll> pii;
typedef multiset<pair<ll, ll> > msii;
typedef multiset<ll> msi;
typedef set<pair<ll, ll> > sii;
typedef set<ll> si;
typedef map<ll, ll> mii;
#define ... | #include "bits/stdc++.h"
using namespace std;
int main()
{
int N; cin >> N;
double l[N], r[N];
for (int i = 0; i < N; i++)
{
int t; cin >> t >> l[i] >> r[i];
t--;
if (t & 1) r[i] -= 0.5;
if (t & 2) l[i] += 0.5;
}
int ans = 0;
for (int i = 0; i < N; i++)
... |
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n; cin >> n;
vector<ll> r, g, b;
for (int i = 0; i < 2 * n; i++) {
ll a; char... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... |
#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... | /*
author:ryo3ihara
”継続は力なり、雨だれ石を穿つ”
”slow but steady wins the race”
*/
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
/*
// 多倍長テンプレ
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multi... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | #include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t){
while(*sdbg != ',') { ce... |
#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 int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).end(... | /**
* author: longvu
**/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
#define FASTIO std::ios::sync_with_stdio(false); std::cin.tie(NULL); std::cout.tie(NULL);
#define nax (int) (100001)
const int mod = 1e9 + 7;
int32_t main()
{
FASTIO
int n;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;cin>>s;
int i;
int an[10];rep(i,10)an[i]=0;
for (auto c: s) {
i = c - '0';
if (an[i]<3) an[i]++;
}
vi bn;
rep(i, 10) {
rep(j, ... | #include <bits/stdc++.h>
using namespace std;
int main(){
string k;
cin >> k;
if(k.length() == 1){
if(k[0] == '8'){
cout << "Yes";
return 0;
}
cout << "No";
return 0;
}
if(k.length() == 2){
if((k[0] * 10 + k[1]) % 8 == 0 || (k[1] * 10 + k[0]) % 8 == 0){
cout << "Yes";
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<vector<char>> tree(N, vector<char>(M));
int a, b;
//for (int i = 0; i < M; i++){
int seiki;
if (N % 100 == 0)
seiki = N / 100;
else
seiki = N / 100 + 1;
cout << seiki << endl;
}
| #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cctype>
#include <limits> // INT_MAX ...
using namespace std;
struct fast_ios {
fast_ios() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout << fixed << setprecision(10);
}
} fast_ios_;
int main... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> r(n);
r[0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 2 * i; j <= n; j += i) {
if (r[i - 1] + 1 > r[j - 1]) r[j - 1] = r[i - 1] + 1;
}
}
for (auto e : r) cout << e << ' ';
cout << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
int n; cin>>n;
cout << 1 << " \n"[n == 1];
int num = 1;
int dex = 2;
int ind = 2;
int i = 0;
while (num < n)
{
if (i == dex)
{
i = 0;
de... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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)
typedef vector<int> vi;
typedef vector<string> vs;
const int mod = 1000000007;
const int inf = 1061109567;
int gcd(int a,int b){return... | #define _GLIBCXX_DEBUG//これが最後の手段だ!
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<numeric>
#include<climits>
#include<limits>//
#include <stdio.h>//
#include<cmath>
#include<iomanip>
//#include <atcoder/all>
using namespa... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define pqueue priority_queue
#define umap unordered_map
#define uset unordered_set
#define bit(s, i) ((1 << i) & s ? 1 : 0)
#define bits... | #include<iostream>
using namespace std;
long n,a[200020],rui[200020];
main()
{
cin>>n;
for(int i=0;i<n;i++)cin>>a[i],rui[i]=i==0?a[i]:a[i]+rui[i-1];
long ans=0,M=0;
for(int i=0;i<n;i++)M=max(M,a[i]),ans+=rui[i],cout<<(ans+M*(i+1))<<'\n';
} |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<... | #include<bits/stdc++.h>
#define SZ(x) ((int)x.size())
#define pb push_back
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>voi... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <iomanip>
#include <math.h>
#include <limits.h>
#include <string>
#include <bitset>
using namespace std;
#define pb push_back
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define MOD(a, m) ((a % m + m) % m)
template<class T>bool chm... |
#include<bits/stdc++.h>
#define int long long
#define rep(a,b,c) for(register int a=(b);a<=(c);++a)
#define dow(a,b,c) for(register int a=(b);a>=(c);--a)
using namespace std;
const int MaxN=200000+5;
int arr[MaxN],dif[MaxN],Sum[MaxN];
signed main()
{
register int n,q;
scanf("%lld%lld",&n,&q);
rep(i,1,n)
{
scanf("... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define dep(i, r, l) for (int i = r; i >= l; --i)
void read (int &x) {
x = 0; char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - 48, c = ge... |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int i,j;
while (cin>>i){
int arr[200]={0};
long ans = 0;
for (int a=0;a<i;a++){
cin>>j;
ans+=arr[j%200];
arr[j%200]+=1;
}
cout<<ans<<'\n';
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <climits>
#include <map>
#include <set>
#include <iomanip>
#include <unordered_set>
#include <functional>
#inc... |
#include <iostream>
#define DENOM 998244353
using namespace std;
int main(){
long long a, b, c;
cin >> a >> b >> c;
cout << ((((a*(a+1)/2)%DENOM) * ((b*(b+1)/2)%DENOM))%DENOM * ((c*(c+1)/2)%DENOM))%DENOM << endl;
return 0;
} | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
void solve(){
long long x,y,a,b,tot=0;cin>>x>>y>>a>>b;
while(x<y){
if(1e18-b<=x){
while(x<y){
if(1e18/a<=x) break;
x*=a;
tot++;
}
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define trace(...) debug(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void debug(const char* name, Arg1&& arg1){
cerr <<fixed<<setprecision(6)<< name << ": ... |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... | #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//uniform_int_distribution<int>(1000,10000)(rng)
ll binpow(ll a, ll b)
{
ll res = 1;
while (b > 0)
{
if (b & 1)
res = r... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int A[N];
int B[M];
int dp[N][M];
for(int i = 0; i < N; i++) cin >> A[i];
for(int i = 0; i < M; i++) cin >> B[i];
if(A[0] == B[0]) dp[0][0] = 0;
else dp[0][0] = 1;
for(int i = 1; i < N; i++){
if... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for (int i = (n)-1; i >= 0; --i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const l... | #include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
using namespace std;
using VI = vector <int>;
using VVI = vector <VI>;
using VLL = vector <long long>;
int main() {
int K... |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>
typedef long long LL;
const int N = 505;
const LL MOD = 998244353;
int a[N][N];
inline int read() {
char ch = getchar();
while (ch != 'B' && ch != 'R' && ch != '.') ch = getchar();
if (ch == 'B') return 0;
if (ch == 'R') retu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i < i##end; ++i)
#define per(i, a, b) for (int i = (a) - 1, i##end = (b); i >= i##end; --i)
#define REP(i, a) rep(i, 0, a)
#define PER(i, a) per(i, a, 0)
namespace IO {
const int MAXIOSIZE = 1 << 24 | 1;
unsigned char... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,w;
cin>>n>>w;
cout<<n/w;
}
| // Author:- Pratik Kinger
// Birla Institute of Technology
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using namespace std;
int main() {
int N, K, M;
cin >> N >> K >> M;
vector<int> A(N-1);
int sum = 0;
rep(i, N-1) {
cin >> A[i];
sum += A[i];
}
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N,K,M; cin >> N >> K >> M;
ll sum = 0;
for (int i = 0;i < N-1;i++){
ll a; cin >> a;
sum += a;
}
ll goal = M*N;
if(go... |
#include <bits/stdc++.h>
using namespace std;
#ifdef _MSC_VER
# include <intrin.h>
# define __builtin_popcount __popcnt
#endif
int main() {
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n;
cin >> n;
n = min(n, 8);
vector<int> a(n);
for (auto& ai : a) {
cin >> ai;
}
vector<int> f(200, -1);
... | #include <bits/stdc++.h>
#include <unordered_set>
#include <cmath>
#include <algorithm>
// URL:
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define dump(x) cout << #x << " = " << (x) << e... |
#include<bits/stdc++.h>
using namespace std;
int main() {
long n;
cin>>n;
set<long> ans;
for(long d=1;d*d<=n;d++) {
if(n%d==0) {
ans.insert(d);
ans.insert(n/d);
}
}
for(auto x:ans) cout<<x<<endl;
} | #include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, a, b) for (ll i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v... |
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, x) for(ll i = 0; i < x; i++)
#define rep2(i, x) for(ll i = 1; i <= x; i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll IN... | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define LOG(...) cerr << "[" << #__VA_ARGS__ << "]: " << repr(__VA_ARGS__) << endl;
#define MSG(args) cerr << args << "\n";
#define debug(x) x
#else
#define LOG(...)
#define MSG(args)
#define debug(x)
#endif
#define mp make_pair
#define pb push_back
#define ... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll N;
cin>>N;
vector<pair<ll,char> > vp(2*N);
ll n;
char c;
map<char,ll> mp;
for(int i=0;i<2*N;i++){
cin>>n;
cin>>c;
vp[i]=make_pair(n,c);
mp[c]++;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... |
#include <bits/stdc++.h>
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define REPS(i, ss, nn ) for(int i = ss ; i < (int) nn; i++)
#define REV(i, ss, nn ) for(int i = ss ; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
#define all(x) x.beg... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main( )
{
ll n,a,b,c;
cin>>n;
ll ans = INT_MAX,cnt=0;
while(n--)
{
cin>>a>>b>>c;
if(c-a > 0){ans=min(ans,b);++cnt;}
}
if(cnt)cout<<ans<<endl;
else cout<<-1<<endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
const int kMaxN = 2e5 + 1;
const int kM = 1e9 + 7;
const int kA = 16;
string s;
long long f[kMaxN][kA + 1], g[kMaxN][kA + 1];
int k, n, t, ans, c[kA];
void C1() {
f[1][1] = kA - 1;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxl=2e5+10;
const int mod=1e9+7;
int n,k;
int a[maxl];
ll dp[maxl][17][2][2];
char s[maxl];
inline ll dfs(int pos,int st,bool up,bool lead)
{
int cnt=__builtin_popcount(st);
if(cnt>k) return 0;
if(pos>n) return cnt==k;
ll &ret=dp[po... |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 3005, p = 1e9 + 7;
int n, trans[Maxn][Maxn], maxi[Maxn][Maxn];
long long ans, a[Maxn], sum[Maxn], f[Maxn][Maxn];
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
scanf("%lld", &a[i]), sum[i] = sum[i - 1] + a[i];
for (int j = 1; j <= n; j... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); // Do not flush "cout" when processing "cin".
int n, k;
cin >> n >> k;
vector<vector<int>> t(8, vector<int>(8));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> t.at(i).at(j);
... | const bool isDebugMode = true;
int testcase = 1;
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long ... |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9+7; // 998244353
const ll LINF = LLONG_MAX; // ~ 10^18 ~ 1<<60
const int INF = INT_MAX;
const doub... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define lowbit(x) (x & (-x))
const ll inf = 1e17+9;
const ll mod = 1e9+7;
const ll maxn = 2e5+8;
int n,m;
int h[maxn],w[maxn];
ll L[maxn],R[maxn];
ll ans=1e18;
int main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n>>m;
... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
int dx[4] = { 1, 0, -1,0 }, dy[4] = { 0, 1, 0, -1 };
int si, sj;
int N = 50;
int t[50][50];
int p[50][50];
map<pair<int, int>, pair<int, int>>mp;
bool seen[50][50];
int f(string ... | #include <bits/stdc++.h>
//#include "atcoder/all"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
//using namespace atcoder;
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> P;
constexpr ll inf=1ll<<61;
constexpr ll mod=998244353;
int a[1005],b[1005];
ll dp[10... |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
bool solve(ll x){
while(x>0){
if(x%10==7) return true;
x/=10;
}
return false;
}
bool solve2(ll x){
while(x>0){
if(x%8==7) return true;
x/=8;
}
return false;
}
int main() {
ll n;
cin >... |
#include<iostream>
using namespace std;
double a, b;
int main() {
cin >> a >> b;
cout << 100.0l - b * 100 / a;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <set>
using namespace std;
using ll = long long;
//ループ
#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for(int... |
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define li long long int
#define ld long double
#define all(v) v.begin(),v.end()
#define rev(a) reverse(all(a))
#define sort(a) sort(all(a))
#define pb push_back
#define INF 1e18+10
#define MINF -1e18-10
#define rep(i,a,b) f... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
const long double PI = (acos(-1));
const long long MOD = pow(10, 9) + 7;
int main()
{
int N;
cin >> N;
int *x = new int[N];
int *y = new int[N];
double dt[100][100];... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#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++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
const double pi = 2.0 * asin(1.0);
ll dx[4] = {1, 0, -1, 0};
ll dy[4]... | #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 ... |
//Bulbul khan-420...
#include <bits/stdc++.h>
#include <cstring>
#define ll long long int
#define pb() push_back()
#define f(i,n) for(i=0;i<n;i++)
using namespace std;
int main()
{
ll t,a,b,c,d,i,j,k,l,n,m,x,y,z;
cin>>n>>m>>x>>y;
string s[n+6];
for(i=0;i<n;i++)
cin>>s[i];
x--;
y--... | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(){
long long x, y, a, b;
cin >> x >> y >> a >> b;
long long ans = 0;
while((long double)a * x <= 9e18 and a * x <= b + x and a * x < y){
x *= a;
ans++;
}
long long diff = (y - x - 1)/b;
if(diff > 0ll) ans += d... |
#include<bits/stdc++.h>
using namespace std;
int a[5];
int ans=99999999;
int main()
{
for(int i=1;i<=4;i++)
{
cin>>a[i];
ans=min(ans,a[i]);
}
cout<<ans;
return 0;
} | /***
Bismillahir Rahmanir Rahim
Rabbi Zidni Ilma
Author : Saidur Rahman
Department of CSE, City University, Bangladesh.
***/
#include<bits/stdc++.h>
using namespace std;
#define ... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(it, ar) for(auto &it: ar)
#define loop(i, start, end) for(auto i = (start); i <= (end); i++)
#define loopSkip(i, start, end, skip) for(auto i = (start); i <= (end); i += skip)
#define loopRev(i, start, end) for(int i = (start); i >= (end); i--)
#define FLASH i... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... |
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr LL mod = 1000000007;
string c[4];
LL power(LL a, LL r){
LL res = 1;
for(; r; r >>= 1, a = a * a % mod)
if(r & 1) res = res * a % mod;
return res;
}
LL Fib(int n){
if(n <= 2) return 1;
LL a = 1, b = 1;
for(int i ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = 0; i <= (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
int main() {
int n;
cin >> n;
int m = 0, day = 1;
do {
m = m + day;
day += 1;
} while(... |
#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;
// typedef tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define ll long long
#define scn(n)... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
using ld = long double;
const int N = 2e5 + 7;
const ld eps = 1e-9;
ld a[N], b[N], csum_a[N], csum_b[N];
int mrkd[N];
int32_t main() {
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m, k; cin >> n >> m >> k;
vec... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7;
ll pow_mod(ll a, ll n, ll p)
{
ll res = 1;
while(n > 0){
if(n & 1) res = res*a%p;
a = a*a%p;
n >>= 1;
}
return res;... | #include <bits/stdc++.h>
using namespace std;
#define SZ(a) ((int)(a).size())
typedef long long int64;
int main() {
#ifdef LOCAL
freopen(".a.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<string> S(n);
vector<vector<int>> A(n, vector<i... |
#include <iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
const int maxn = 5005;
int main()
{
char s[5005];
int a[maxn], g[maxn], c[maxn], t[maxn];
int n;
int cnt = 0;
cin >> n;
a[0] = 0;
g[0] = 0;
c[0] = 0;
t[0] = 0;
int a1, g1, c1, t1;
for(int i = 1; i ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
rep(i, N) {
int c1 = 0, c2 = 0;
for (int j = i; j < N; j++) {
if (S[j] == 'A')
c1++;
else if (S[j] == 'T')
... |
// Problem: D - Base n
// Contest: AtCoder - AtCoder Beginner Contest 192
// URL: https://atcoder.jp/contests/abc192/tasks/abc192_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
// Disclaimer: Don't copy my template, it may lead to plagiarism.
/* Author:... | #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;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... |
#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 ordered_set tree<int, null_type , less<int> , rb_tree_tag , tree_order_statistics_node_update>
#define int long long int
#define ull unsigned long long
#de... | #include<bits/stdc++.h>
using namespace std;
#define fast {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
typedef long long int ll;
typedef string S;
#define M 1e18
#define AS 250005
#define sp cout<<' '
#define nw cout<<endl
#define rt return
#define __ template<typename T, typename... Types>
void in() {rt;... |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<n+1;++i)
int main(){
int N,K,sum=0;
cin >> N >> K;
rep(i,N){
rep(j,K){
sum+=100*i +j;
}
}
cout << sum <<endl;
return 0;
} |
#include<bits/stdc++.h>
#define ll long long int
#define M 1000000007
#define mod 998244353
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define pi pair<ll,ll>
#define endl "\n"
using namespace std;
const ll N=100010;
vector<pi> adj[N];
vector<vector<ll> > dis;
void func(ll start)
{
set<pi> s;
s... | #include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using... |
// Never gonna give you up
// Never gonna let you down
// Never gonna run around and desert you
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e18;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main(){
int h, w, n, m;
cin >> h >> w >> n >> m;
vector<vector<int>> v(h, vector<int>(w,0));
rep(i,n){
int a,b;... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int> P;
typedef tuple<int,int,int> tii;
typedef vector<int> vec;
typedef vector<vec> mat;
typedef pair<pll,pll> ppll;
#define rep(i,s,n) for(int i=(int)(s);i<(i... | // raggarwalg01
#include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(false);cin.tie(NULL);typedef int MyCustomType;
string s{};
cin>>s;
for(int i=0... |
#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.... | #include <cstdio>
#include <cctype>
#define FOR(i,j,k) for(int i=j; i<=k; ++i)
inline int read (void) {
int x = 0, f = 1, ch = getchar();
while(!isdigit(ch)) { if(ch == '-') f = -f; ch = getchar(); }
while(isdigit(ch)) { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f;
}
const int maxn = 20;
int h, w, ans, to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t X;
cin >> N >> X;
X *= 100;
int64_t ans = 0;
for (int i = 0; i < N; i++) {
int64_t V,P;
cin >> V >> P;
ans += V*P;
if(ans > X){
cout << i+1 << endl;
return 0;
}
}
cout << -1 <<... | #include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boo... |
#include<bits/stdc++.h>
using namespace std;
const int N=2e+5+10;
pair<long double,long double> dp[N];
int A[11],n,m,k;
bool isp[N];
bool ispos()
{
int cnt=0;
for(int i=1;i<=n;i++)
{
if(isp[i]==1)
cnt++;
else
cnt=0;
if(cnt==m)
return false;
}
return true;
}
int main()
{
cin>>n>>m>>k;
for(int i=... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for(int i = (a); i <= (b); i++)
#define PER(i, a, b) for(int i = (a); i >= (b); i--)
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pb push_back
#define mk make_pair
#define S second
#define F first
t... |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
const int N = 2e5 + 20;
typedef long long LL;
typedef pair<LL, LL> PLL;
int n, m, q;
struct Node
{
int l, r;
LL sum, cnt;
}tra[N << 2], trb[N << 2];
int a[N], b[N];
int t[N], x[N], y[N];
vector<int> nums;
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#includ... |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORX(i, a, b, x) for (ll i = (a); i <= (b); i+=x)
#define debug(x) cout <<" || "<< #x << " is= " << x<<endl; //use for debug
#define read(a) ll a; cin >> a;
#... | #include <bits/stdc++.h>
#define INF 1000000007
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef long double ld;
typedef vector<int> vi;
typedef unordered_map<int,i... |
#include <bits/stdc++.h>
using namespace std;
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define REVERSE(v) reverse((v).begin(), (v).end())
#define MAX(v) (*max_element((v).begin(), (v).end()))
#define MIN(v) (*min_element((v).begin(), (v).end()))
#define pb push_back
... | #include<bits/stdc++.h>
#define MAXN 100005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,m;
string str[MAXN];
int main()
{
scanf("%d%d",&n,&m);
int cnt=0;
for(int i=0;i<n;i++)
{
cin>>str[... |
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);
using ll = long long;
#define endl "\n";
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x);
#define pvector(x) for(auto i : x)cout << i << " ";cout << "\n";
#define ivector(x) for(auto &i : x)cin >> i;
const in... | /*
solution and tut used...
credits : @yash_daga
author : Aryan Agarwal, IIT KGP
created : 13-December-2020 19:44:17 IST
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxn = 1e5;
const long long INF = 2e18;
const int32_t M = 1000000007; /*more than (10)^9*/ /*7 + 1e9*... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n + 1; i++)
#def... | #include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> po, ne;
int a, b;
int main(void) {
scanf("%d %d", &a, &b);
for (int i = 1; i <= a; i++) {
po.push_back(i);
}
for (int i = 1; i <= b; i++) {
ne.push_back(-i);
}
if (po.size() < ne.size()) {
for (int i = po.size(); i... |
#include <algorithm>
#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) (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = s; i < (ll)(n); i++)
ll dis(vector<ll> r, vector<ll> g) {
ll mi = 1000100100100100100;
ll gn = g.size();
ll rn = r.size();
if (gn == 0 || rn == 0)
return mi;
for (auto a : r) {
ll i = lower_bound(g.be... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ll modpower(ll a, ll r, ll mod){ //a^r
ll x = 1;
if (r < 0) r = r%(mod-1)+mod-1;
a %= mod;
while (r > 0) {
if (r & 1) x = x * a % mod;
r >>= 1;
a = a * a % mod;
}
return x;
}
ll mo... | #include <bits/stdc++.h>
using namespace std;
#define int long long
void read (int &x) {
char ch = getchar(); x = 0; int f = 0;
while (!isdigit(ch)) { if (ch == '-') f = 1; ch = getchar(); }
while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
if (f) x = -x;
} const int N = 2e5 + 5, mod = 998244353... |
#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REP... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
string s;
int main()
{
int n,x;
cin>>n>>x>>... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<float.h>
#include<tuple>
#include<string.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<map>
#include<deque>
#include<math.h>
using namespace std;
#define ll long long
... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb empla... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define ft first
#define sec second
#define pr pair<int,int>
#define ISCC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
int t ,n ,m ,a ,sum;
string s;
int main()
{
cin >> n;
for(int i=0 ;i<n ;i++)
{
cin... | /*** -God give me the power − ***/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void test()
{
int n;
cin>>n;
vector <ll> arr(n);
map <ll,int> mp;
ll ans=0;
for(int i=0;i<n;i++)
{
cin>>arr[i];
mp[arr[i]]++;
}
for(int i=0;i<n;i++)
{
... |
#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 <iostream>
using namespace std;
int main()
{
int A, B, W;
cin >> A >> B >> W;
W *= 1000;
int most = 0;
int least = 0;
// most = W / A + (W % A == 0 ? 1 : 0);
// least = W / B + (W % B == 0 ? 0 : 1);
if (W % A == 0)
most = W / A;
else
{
int n = W / A;
float avg = float(W) / n;
if (avg > A && ... |
#define _USE_MAT_DEFINES
#include<iostream>
#include <iomanip>
#include<stdio.h>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include <queue>
#include <utility>
#include <map>
#include <set>
#include <stack>
#include <deque>
#include <numeric>
#include <functional>
using namespace std;
typede... | #include<bits/stdc++.h>
typedef long long int lli;
typedef long double lld;
typedef long long ll;
//Fast Input I/O
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL);
//Datatype
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define vvlli vector<vector<long long int... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define ff(i,n) for(i=0;i<n;i++)
//ncr(n,r) = ncr(n-1,r-1) + ncr(n-1,r)
const ll bg = 1e9+7;
void solve(){
ll i,n,x;
cin>>n>>x;
x = x*100;
ll ans = -1,sum=0;
ll v[n],p[n];
ff(i,n){
cin>>v[i]>>p[i];
}... | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define VVI vector<vector<int>>... |
#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
ll n,k;
cin>>n>>k;
ll arr[n][2];
ll sum=0;
ll x,y;
for(ll i=0;i<n;i++){
cin>>x>>y;
arr[i]... | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long lli;
const lli M = 1000000007;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin>>t;
while(t--)
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
pi operator - (pi a, pi b) { return { a.first - b.first, a.second - b.second }; }
pi operator + (pi a, pi b) { return { a.first + b.first, a.second + b.second }; }
ll operator * (pi a, pi b) { return a.first * 1LL * b.firs... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#define rep(i,begin, end) for (ll i = begin; i < (ll)(end); i++)
using namespace std;
using ll = long long;
template<typename T>
using vec2 = vector<vector<T>>;
template<typename T>
using vec3 = ... |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#in... | #include<bits/stdc++.h>
using namespace std;
string ss="",str;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
long long n;
cin>>n;
cin>>str;
for(int i=0;i<=n+100;i++)
if(i%3==0)ss+="1";
else if(i%3==1)ss+="1";
else ss+="0";
if(str=="1")cout<<20000000000<<"\n";
e... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> II;
inline II make_key(int... | #include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,i;
char x[1000];
cin>>x;
char *dot_pos = strchr(x, '.');
if (dot_pos) *dot_pos = '\0';
puts(x);
cout<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
const long long INFll = 8223372036854775807;
const int INFii = 1147483647;
const long long mod = (long long) 1e9 + 7;
typedef long long ll;
typedef int ii;
typedef double dbl;
#define endl '\n'
#define S second
#define F first
#define MP make_pair
#define PB push_back
#... |
#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 gcd(int x,int y){
if(y==0)return x;
return gcd(y,x%y);
}
int main(){
int n,ret=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
int a;
scanf("%d",&a);
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.14159265358979
#define EPS 1e-8
#define mod 1000000007
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define endl "\n"
#define NEG_INF -2e18
const ll INF=1e15;
const int N=4e5+50;
ll... |
/* -*- coding: utf-8 -*-
*
* f.cc: F - GCD or MIN
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<unordered_map>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#incl... | #include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
#include<iostream>
#include<string>
#include<map>
#include<cmath>
using namespace std;
const int INF=0x3f3f3f3f,maxn=60,MOD=998244353;
#define ll long long
//vector<int>v[maxn];
//map<int,string>mp[maxn];
//queue<int>q[maxn];
int a[maxn][maxn],n,K,s... |
#define taskname "test"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 105;
const int mod = 1e9 + 7;
int powmod(int x, int k) {
if(k == 0) return 1;
int t = powmod(x, k / 2);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se ... |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> edges[26];
vector<pair<int, int>> states[1024][1024];
int d[1024][1024];
int main()
{
int N, M;
scanf("%d %d", &N, &M);
queue<pair<int, int>> q;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
d[i][j] = 1'000'0... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,m;
int vdnmcjdkmkh;
cin>>n>>m;
vector<pair<int,int>>a(m);
for(int i=0;i<m;i++)
{
cin>>a[i].first>>a[i].second;
}
int k;
cin>>k;
vector<pair<int,int>>b(k);
for(int j=0;j<k;j++)
{
... |
#include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
using i32 = int32_t... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmd... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n=1; cin >> n ;
int ans = 0 ;
if (n%100) {
ans++ ;
n -= n%100 ;
}
n /= 100 ;
ans += n%10 ;
n /= 10 ;
ans += n*10 ;
c... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#de... | #include<bits/stdc++.h>
using namespace std;
int T,n,ans=1e9;
bitset<100004>f;
int main(){
cin>>n;
f[0]=1;
for(int i=0;i<n;i++){
int x;cin>>x;
f|=f<<x;T+=x;
}
for(int i=0;i<=1e5;i++)if(f[i])ans=min(ans,max(i,T-i));
cout<<ans;
} |
//Saptak_Roy_Turja
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n,i,x;
cin>>n;
for(i=1;;i++){
x=(i*(i+1))/2;
if(x>=n){
cout<<i<<'\n';
return 0;
}
}
}
| // Jai Shree Ram
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ll long long
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define endl "\n"
#define x first
#define y ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
char s, t;
cin >> s >> t;
t = (s == 'Y' ? t - 32 : t);
cout << t << endl;
return 0;
} | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vec... |
#include "bits/stdc++.h"
//#include <boost/multi_array.hpp>
//#include <boost/optional.hpp>
//#include <boost/range/irange.hpp>
//#include <boost/range/algorithm.hpp>
//#include <boost/range/adaptors.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
#define rep(i, n) for ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define pll pai... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) (r).begin(),(r).end()
#define rall(r) (r).rbegin(),(r).ren... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5+8, inf = 1e18+9, mod = 998244353;
struct edge { int v, w; };
int n, m, ans[maxn], vs[maxn];
vector<edge> G[maxn];
void dfs(int u, int p) {
for (auto [v, w] : G[u]) if (v != p && !vs[v]) {
if (w == ans[u]) ans[v] = ... |
#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... | // MOHIT KUMAR
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pin;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
#define ff(i, a, b) for ( ll i=a; i<(b); i++)
#def... |
#include <bits/stdc++.h>
using namespace std;
const auto mod = 1000000007;
auto fp(long long x, long long e) -> long long {
auto ans = 1ll;
while (e > 0) {
if (e & 1) ans = ans * x % mod;
e >>= 1;
x = x * x % mod;
}
return ans;
}
auto fib(int n) -> long long {
if (n < 2) r... | #include <bits/stdc++.h>
#define rep(i,l,r) for (int i=l;i<=r;++i)
#define per(i,r,l) for (int i=r;i>=l;--i)
#define ll long long
using namespace std;
const int N=1e6+6,P=1e9+7; int dp[N];
int main(){
int n; scanf("%d",&n);
char str[4][5],s[4];
rep(i,0,3) scanf("%s",str[i]),s[i]=str[i][0];
if (s[1]=='A'&&s[0]=='A'|... |
#include <iostream>
#include<algorithm>
using namespace std;
int main()
{
long long int n,j=0,sum=0,i=0,s=0;
cin>>n;
int a[n];
while(i<n)
{
cin>>a[i];
i++;
}
sort(a,a+n);
while(j<n)
{
sum =sum+a[j]*j;
sum =sum- s;
s =s+ a[j];
j++;
}... | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
using namespace __gnu_pbds;
struct chash {
const int RANDOM = (long long)(make_unique<char>().get()) ^ chrono::high_resolution_clock::now().time_since... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
int n, a[maxn], b[maxn], c[maxn][maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
scanf("%d", &c[i][j]);
}
}
int mn = min_element(c[1] + 1, c[1] + n + 1) - ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define fast std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define endl "\n"
#define all(x) (x).begin(), (x).end()
#define rall(v) v.rbegin(), v.rend()
#define ... |
#include <iostream>
#include <algorithm>
#include <list>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <chrono>
#include <cstdio>
#include <cstring>
#include <cmath>
#include... | #line 1 "main.cpp"
/**
* @title Template
*/
#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"
#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/ot... |
#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T>... | #include<bits/stdc++.h>
using namespace std;
long long x,y,n,m,k,ans,mm[200002],nn[200002],ff[200002],nm;
vector<int>sz[200002];
void add(int a){while(a<=nm)ff[a]++,a+=a&(-a);}
int ask(int a){int ans=0;while(a)ans+=ff[a],a-=a&(-a);return ans;}
int main(){
scanf("%lld%lld%lld",&n,&m,&k);nm=max(n, m);
for(int i=1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.