code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <cstdio>
#include <cstring>
#define N 110
#define mo 998244353
using namespace std;
int f[N][5010];
int n, w[N];
int sum;
int jc[N];
int ans;
int main(){
// freopen("funny.in", "r", stdin);
scanf("%d", &n);
for (int i=1; i<=n; i++) scanf("%d", &w[i]), sum+=w[i];
jc[0]=1;
for (int i=1; i<=n; i++) jc[i]=1... | #include<map>
#include<set>
#include<list>
#include<ctime>
#include<cmath>
#include<deque>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<bitset>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<iostream>
#include<algorithm>
#define rep(i,s,t) for(register int ... |
#include<bits/stdc++.h>
using namespace std;
int n,val[100005][10],init[10];
bool life[35][6];
bool ok(int x)
{
for(int i=1;i<init[5];i++)
for(int j=1;j<=3;j++)
life[i][j]=0;
int now;
for(int i=1;i<=n;i++)
{
now=0;
for(int j=0;j<5;j++)
{
if(val[i][j]>=x)
now+=init[j];
}
life[now][1]=1;
for... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in: a)
#define sz(x) (int)x.... |
#include <bits/stdc++.h>
#define lc (o<<1)
#define rc ((o<<1)|1)
#define PB push_back
#define MK make_pair
using namespace std;
#define DebugP(x) cout << "Line" << __LINE__ << " " << #x << "=" << x << endl
const int maxn = 5000 + 5;
const int modu = 998244353; // 1e9 + 7
const int inf = 0x3f3f3f3f;
const double eps = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mxN = 2e5 + 5;
const int INF = 1e18 + 7;
int N;
int stringtointeger(string x)
{
int ans = 0, j = 1;
for (int i = x.size() - 1; i >= 0; i--)
{
ans += (x[i] - '0') * j;
j *= 10;
}
return ans;
}
string i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... |
#include<bits/stdc++.h>
#define For(i,j,k) for(int i=j;i<=k;++i)
#define Dow(i,j,k) for(int i=k;i>=j;--i)
#define ll long long
#define pb push_back
#define fir first
#define sec second
#define pb push_back
#define pa pair<int,int>
#define mk make_pair
using namespace std;
inline ll read()
{
ll t=0,dp=1;char c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> t(n);
vector<ll> l(n);
vector<ll> r(n);
rep(i,n) cin >> t[i] >> l[i] >> r[i];
... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
struct edge{
long long v, t, k;
};
const long long N = 1e5 + 10;
const long long INF = 1e18;
vector<edge> node[N];
long long n, m, x, y, st[N];
long long d[N];
long long dijkstra() {
for (long long i... | /**
* author : UshanGhosh
* created : 2021-06-27 12:02:50
**/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define vii vector<int>
#define vcc vector<char>
#define pll pair<long long, long long>
#define mem memset
#define ... |
#include <bits/stdc++.h>
#include <ctime>
#include <cstdlib>
#define int long long
#define ii pair<int, int>
#define pb push_back
#define mp make_pair
#define MOD 1000000009
#define E13 10000000000000
#define DUMP(a) \
do { std::cout << "[" << #a " = " << (a) << "]" << std::endl; } while(false)
#define d0(x) cout... | #include<bits/stdc++.h>
#define fastIO std::ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define F first
#define S second
const int N = 100001;
vector<int> primes;
int isprime[N] = {0};
void sieve()
{
isprime[0] = 1;
isprime[1] = 1;
primes.push_back(2);
for(int i=4 ; i<N ; i+=2)
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define absdiff(a,b) (a>b)?a-b:b-a
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define fast ios_base::sync_with_stdio(false);cin.tie(0);
#define MOD 1000000007
#define ll_MAX 1922337203685912
#define endl "\n"
ll... | #include<queue>
#include<iostream>
#include<math.h>
#include<stdlib.h>
#include<string>
#include<limits.h>
#include<utility>
#include<vector>
#include<tuple>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll i=0;i<n;i++)
#define ALL(A) A.begin(),A.end()
stru... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
//ๅ
ฅๅ
int n,m;
cin >> n >> m;
vector<int> a(m), b(m);
rep(i,m) cin >> a[i] >> b[i];
int k;
cin >> k;
vector<int> c(k), d(k);
rep(i,... |
#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>
using namespace std;
int main()
{
int N;
cin>>N;
vector<int> A(N);
vector<int> B(N);
for(int i=0;i<N;i++){
cin>>A[i];
}
for(int i=0;i<N;i++){
cin>>B[i];
}
sort(A.begin(),A.end());
sort(B.begin(),B.end());
int x=A[N-1],y=B[0];
//cout<<x<<","<<y<<endl;
if(y-x+1<0)... |
// Problem C
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string.h>
#include <cassert>
#include <algorithm>
#include <set>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#define MAXN 1000
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long int l... | #include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> A(N), B(N);
for(auto&& i : A)cin >> i;
for(auto&& i : B)cin >> i;
priority_queue<unsigned long> pq;
reverse(begin(A), end(A));
unsigned long ans{0};
for(unsigned long i{0}; ... |
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long ll;
int gcd(int a, int b)
{
return b == 0 ? a : gcd(b, a % b);
}
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int a, b, i, x, y;
cin >> a >> b;
for (i = b - a; i > 0; i--) {
... | #include <bits/stdc++.h>
#define DB double
#define LL long long
#define MST(a,b) memset((a),(b),sizeof(a))
#ifdef _DEBUG_
#define MRK() cout<<"Mark"<<endl;
#define WRT(x) cout<<#x<<" = "<<(x)<<endl;
#else
#define MRK() ;
#define WRT(x) ;
#endif
#define MAXN 1010000
#define MAXM 2010000
#define MOD 998244353 //10000... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
string S1,S2,S3;
vector<char> chars;
char used[10];
bool check() {
map<char, char> mp;
rep(i,10) if (used[i] != 0) mp[used[i]] = char('0' + i);
string s1,s2,s3;
for(auto &c: S1) s1 += mp[c];
... | // give up
#include <bitset>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
// alias, using declaration
using llint = long long; using ldouble = long double;
template <class T = llint> using ... |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
ll n, k;
cin >> n >> k;
vector<P> a(n);
rep(i, n) cin >> a[i].first >> a[i].second;
sort(a.begin(), a.end());
ll now = 0;
rep(i, n) {
if (now + k >= ... | #include <bits/stdc++.h>
#define setIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979
#define f first
#define s second
#define ar array
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<long long, long long> pll;
typedef pai... |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<ll> a(n), b(n);
rep(i, 0, n) cin >> a[i] >> b[i];
ll sum = 0;
rep(i, 0, n) sum += b[i]*(b[i] + 1)/2 - a[i]*(a[i] - 1... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
ll a,b;ll sum=0LL;
for(int i=1;i<=n;i++){
cin>>a>>b;
sum+=(a+b)*(b-a+1)/2;
}
cout<<sum;
return 0;
}
|
#include<bits/stdc++.h>
#define int long long
#define rint regester int
const int maxn = 500 + 10;
const int mod = 998244353;
using std::ios;
using std::cin;
using std::cout;
using std::max;
using std::min;
using std::sort;
using std::unique;
using std::lower_bound;
using std::swap;
using std::abs;
using std::acos;
usi... | /*
ID: gurban1
LANG: C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 24;
const int maxn=2e5+5;
const int mod=998244353;
int n,m;
ll dp[maxn][N];
ll f[maxn],ans;
ll binmod(ll a,ll b) {if(b==0)return 1;ll x=binmod(a*a%mod,b>>1);return b&1?x*a%mod:x;}
ll inv(ll a){
retu... |
#include <bits/stdc++.h>
//#include <cmath>
typedef long long ll;
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
//#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#define pii pair<int, int>... | #include <iostream>
#include <vector>
#pragma GCC optimize ("-O3")
using namespace std;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n; cin >> n;
vector<double> l(n), r(n);
for (int i = 0; i < n; i++) {
int t; cin >> t >> l[i] >> r[i];
t--;
if (t & 1)... |
#include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
bool flag = false;
for (long long i = 1; i <= b / i; i ++) {
if (b % i == 0) {
if (b / i + i == a) {
flag = true;
break;
}
}
}
if (flag) cout << "Yes";
else cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MAX( a , b ) ( a > b ) ? a : b
#define MIN( a , b ) ( a < b ) ? a : b
using ull = unsigned long long;
using ll = long long;
using ul = unsigned long;
int main(){
ull A,B;
ull result = 0;
cin >> A >> B;
ull C = B - A;
for(ull i = C; i >... |
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define test int t;cin>>t;while(t--)
#define REP(i,n) for (int i = 1; i <= n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define ll long long
#define ld long double
#define int ll
#define pb push_... | #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
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=... |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
#include<unordered_map>
#include<iomanip>
#include<queue>
#include<bitset>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll MOD = 1000000007;
#de... | #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 pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz"; //26
const string ALP="ABCDEFG... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool ch... | /*#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/stack:200000000")*/
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <cstdio>
#in... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
long long sum=0;
if(a==6)
{
sum+=1;
}
else if(a==4){
sum+=3;
}
else if(a==5)
{
sum+=2;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double dp[101][101][101];
double funct(int a, int b, int c){
if(dp[a][b][c]) return dp[a][b][c];
if(a == 100 || b == 100 || c == 100) return 0;
double ans = 0;
ans += (funct(a + 1, b, c) + 1)*a/(a + b + c);
ans += (funct(a, b +... |
//bismillahir rahmanir rahim //Author:Fayed Anik
#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_n... | #include<iostream>
#include<cmath>
#include <vector>
using namespace std;
int main(){
int N = 0;
int K = 0;
int M = 0;
cin >> N >> K >> M;
int tar = N * M;
int sum = 0;
for (int i = 0; i < N - 1; i++) {
int A = 0;
cin >> A;
sum += A;
}
if (tar - sum <= 0) {
cout << 0 << endl;
}... |
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define ROF(i,a,b) for(int i=(a); i>=(b); --i)
#define pb push_back
#define eb emplace_back
#define SZ(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define make_unique(a) sort(all((a))), (a).erase(unique(all((a))),(a).end())
#define x fi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<ll,int> mp[2];
int main(){
int n; cin >> n;
vector<int> a(n);
ll pre=0;
mp[1][0]++;
ll ans = 0;
for(int i=0;i<n;i++){
cin >> a[i];
pre = a[i]-pre;
ans += mp[i&1][pre];
ans += mp[(i+1)&1][-... |
/*input
1
58
998244353
1
*/
#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;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize(... | // Artur Kraska, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,P... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A,B;
cin>>A>>B;
long long maxx=max(A,B);
long long minn=min(A,B);
//long long sa=maxx-minn;
long long are=((maxx*(1+maxx))/2)-((minn*(1+minn))/2);
if(A>B){
for(long long a=0;a<A;a++){
cout<<a+1<<' ';
}
for(long long a=... |
#include <bits/stdc++.h>
using namespace std;
void printmat(const vector<vector<int>>& mat) {
for (auto row : mat) {
for (int elem : row)
cout << elem << " ";
cout << endl;
}
}
void printv(const vector<int>& v) {
for (int elem : v)
cout << elem << " ";
cout << endl;
... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
#define sz(s) (int)(s.size())
#define INF 0x3f3f3f3f3f3f3f3fLL
#define all(v) v.begin(),v.end()
#define watch(x) cout<<(#x)<<" = "<<x<<endl
const int dr[] { -1, -1, 0, 1, 1, 1, 0, -1 };... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int n;cin >> n;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
}
sort(a.begin(),a.end());
for(int i=0;i<n;i++){
if(!(a.at(i)==i+1)){
cout << "No" << endl;
... | #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<class T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag, tree_order_statistics_node_update> ;
template <typename T>
using order... |
#include <bits/stdc++.h>
// 1. dp
typedef long double ld;
#define int long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...)... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
long long dp[2]{1ll,1ll};
for (int i=0; i<n; ++i) {
char s[10];
scanf("%s", s);
long long nxt[2];
if (s[0]=='A') {
nxt[1] = dp[1];
nxt[0] = dp[0]*2+dp[1];
}
else {
nxt[1] = dp[1]*2+dp[0];
nxt[0] = dp[0];
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bou... |
#include <cstdio>
#include <cstdlib>
using namespace std;
#define ll long long
const ll MAXN = 400011;
struct fhqTreap {
ll tot, rt;
ll val[MAXN], sum[MAXN], sz[MAXN], ls[MAXN], rs[MAXN], rd[MAXN];
void pushup(ll u) {sz[u] = sz[ls[u]] + sz[rs[u]] + 1; sum[u] = sum[ls[u]] + sum[rs[u]] + val[u];}
void split(ll u, ... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
using ll = long long;
int n, m, q, t[N], x[N], y[N], dic[N], L;
int a[N], b[N];
ll d[4][N];
void add(int idx, int x, int v) {
for(int i = x; i <= L; i += i & -i) d[idx][i] += v;
}
ll get(int idx, int x) {
ll res = 0;
for(int i = x; i; i -=... |
#include<bits/stdc++.h>
#define fr(i,a,b,step) for(rg int i=a;i<=b;i+=step)
#define rp(i,a,b,step) for(rg int i=a;i>=b;i-=step)
#define inf 0x3f3f3f3f3f3f
#define rs(a,b) memset(a,b,sizeof(a))
#define bug printf("debug");
#define ie inline
#define rg register
using namespace std;
typedef long long ll;
const int _=1e6+1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _... |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define Bs binary_search
#define In insert
#define Mp make_pair
#define All(x) x.begin(), x.end()
#defin... | // #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
#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;
//All indexing is 0-based
template<class key, class... |
#include<cstdio>
using namespace std;
int cf[1000010];
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
int l,r;
scanf("%d%d",&l,&r);
cf[l]++;
cf[r+1]--;
}
long long cnt=0,ans=0;
for(int i=1;i<=1000000;i++)
{
cnt+=cf[i];
ans+=cnt*i;
}
printf("%lld",ans);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template <class S, class T> inline bool chmax(S &a, T b) { if (a < b) { a = b; return 1; } return 0; }
... |
#include<bits/stdc++.h>
using namespace std;
namespace Ruri{
#define ms(a,b) memset(a,b,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
const ll INF = 1000000000000; //10^12:โ
const ll MOD = 1000000007; //10^9+7:ๅๅๅผ... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<(n); ++i)
using ll = long long;
const int INF = 1001001001;
int main(){
int n; cin >> n;
ll a, b;
ll ans = 0;
rep(i,n){
cin >> a >> b;
ll sum = (b-a+1)*(a+b) / 2;
ans += sum;
}
cout << ans << en... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long int a[n],b[n],ans=0;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i];
ans += ((b[i]*(b[i]+1)/2) - (a[i]*(a[i]+1))/2 + a[i]);
}
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main(){
int n;
cin >> n;
vector<ll> dp(2, 1);
rep(i, n){
string s;
cin >> s;
vector<ll> p(2); swap(dp, p);
rep(j, 2)rep(x, 2){
int nj = j;
if (s == "AND") nj &= x;
... | #include<bits/stdc++.h>
#define int ll
#define sz(x) int((x).size())
#define all(x) (x).begin(),(x).end()
#define x first
#define y second
using namespace std;
using ll = long long;
using pi = pair<int,int>;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int minf = 0xc0c0c0c0c0c0c0c0;
signed main() {
ios::sync_with_s... |
#include <vector>
#include <set>
#include <iostream>
#include <algorithm>
#define MAX 100000000
#define ll long long
using namespace std;
bool decide(int n,vector<vector<int>> g,vector<int> v){
int p = v.size();
for(int i = 0;i < p;i ++){
if(g[n][v[i]] == g[v[i]][n]){
return true;
}
}
return fals... | #include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
vector<vector<pair<int, int>>> v;
vector<bool> bl;
vector<int> depth, c;
vector<str> dir;
vector<pair<int, int>> edges;
void dfs(int nd, int h, int e_id){
if(bl[nd]) ret... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(),a.end()
typedef pair<ll,ll> pi;
//__builtin_popcountll(2) (the number of ones in the binary represe... |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
typedef long long ll;
int n,m;
ll a[N];
int main()
{
scanf("%d%d",&n,&m);
ll ans=0,s;
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
sort(a+1,a+n+1);
while(m--){
ll x,k=0;
scanf("%lld",&x);
if(x<a[1]){
p... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector... |
#include <bits/stdc++.h>
#include <map>
using namespace std;
#define ll long long
ll a[2000000],res[2000000];
int main()
{
ll n,m,minn;
cin>>n>>m;
for(ll i=0;i<n;i++)scanf("%lld",&a[i]);
for(ll i=0;i<m;i++)
{
res[a[i]]++;
}
for(ll i=0;;i++)
{
if(res[i]==0)
{
... | #include<bits/stdc++.h>
using namespace std;
int n, i, j, k, m;
vector<int>v[1500010];
main()
{
for(scanf("%d %d", &n, &m);i++<n;)scanf("%d", &k),v[k].push_back(i);
for(i=0;i<=n;i++)
{
if(v[i].size()==0||v[i][0]>m||v[i].back()+m-1<n)
{
printf("%d", i);return 0;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main(){
ll k;
cin >> k;
string s,t;
cin >> s >> t;
map <ll, ll> a;
map <ll, ll> b;
vector <ll> cnt(10,0);
for(ll i=1; i<=9; i++){
... | #include <bits/stdc++.h>
using namespace std;
// binary exponentiation
// O(log e)
template<class T, class U>
T binary_power(T b, U e){
T res = 1;
for(; e; e >>= 1, b *= b) if(e & 1) res *= b;
return res;
}
int main(){
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(ios::badbit | ios::failbit);
int k;
string s,... |
#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;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
#define pb push_back
#define MP make... | /*
LL JJ SSSS ii ssss SSSS BBBB
LL JJ S s S B B
LL JJ SSS ii sss SSS BBBB
LL JJ JJ S ii s S B B
LLLLLL JJJJ SSSS ii ssss SSSS BBBB
SSSS BBBB ii ssss LL JJ SSSS
S B B s LL ... |
#include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... | //int a = s - '0'; ๆๅญใใๆฐๅญ
//ๅฐๆๅญใใๅคงๆๅญ
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//map ๅ
จๆข็ดข
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapใฎใญใผ๏ผit->first mapใฎใใชใฅใผ๏ผit->second
//ๅคงๆๅญๅคๅฎ isupper(ๆๅญ) ๅฐๆๅญๅคๅฎ islower(ๆๅญ)
//do{}while(next_permutation(ALL(้
ๅ)))
//ๅฐๆๅญใซๅฏพๅฟใใๆๅญใณใผใ๏ผS... |
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
template <typename T> using V = vector<T>;
template <typen... | #include<bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
using ll=long long;
template<class T> using heapq = priority_queue<T,vector<T>,greater<T>>;
template<class T> bool chmax(T &a,const T b) {if (a<b) {a=b;return true;} else return false;}
template<class T> bool chmin(T &a,const T b) {if (a>b) {a=b;retur... |
/*
* @Author: Luisvacson
* @LastEditors: Luisvacson
* @Descriptions: None
* @Date: 2020-12-12 19:05:25
* @LastEditTime: 2020-12-12 19:45:19
* @FilePath: \VSC\C++\Practice\ARC107C.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define mod 998244353
#define int long long
int a[55][55];
int n, K;
int fr[105... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
#define y1 awefakhlrv
using pii = pair<int, int>; ... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
bool compair(pair<long long, long long> a, pair<long long, long long> b){
if(a.first + a.second != b.first + b.second){
return a.first + a.second > b.first + b.second;
}
else{
return a.first > ... |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_... |
#include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ?... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second
using namespace std;
typedef long long ll;
const string tmp = "atcoder";
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0); cin.tie(0);
int te... |
#include <bits/stdc++.h>
#ifdef mlocal
#include "./Competitive-Code-Library/snippets/prettyprint.h"
#endif
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
#define endl '... | #include <vector>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
template <class E> struct FenwickTree {
int _n;
std::vector<E> data;
FenwickTree(int n) : _n(n), data(n) { }
void add(int p, E x) {
++p;
while (p <= _n) {
data[p - 1] += x;
p +... |
# include<bits/stdc++.h>
using namespace std;
# define l long long
# define db double
# define rep(i,a,b) for(l i=a;i<b;i++)
# define vi vector<l>
# define pb push_back
# define mp make_pair
# define ss second
# define ff first
# define pii pair<l,l>
# define trvi(v,it) for(vi::iterator it=v.begin();it!=v.end();++it)... | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
int findMaxGCD(int arr[], int n)
{
// Calculating MAX in array
int high = 0;
for (int i = 0; i < n; i++)
high = max(high, arr[i]);
// M... |
#include <bits/stdc++.h>
#define eprintf(args...) fprintf(stderr, args)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
const int mxn = 1e5 + 5;
const int mod = 1e9 + 7;
int f[mxn];
int n, a[mxn];
int main() {
scanf("%d", &n);
rep(i, n) scanf("%d", &a[i]);
f[0] = 1; f[1] = 2;
for (int i = 1; i < n; ++ i) f... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll dp[100009][2];
vector<ll>vec;
ll M;
ll n;
ll call(ll pos,ll pev)
{
if(pos==0)
{
return 1;
}
if(dp[pos][pev]!=-1)
{
return dp[pos][pev];
}
ll x,y;
if(pev==0)
{
x=call(pos-1,0);
y=c... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <math.h>
#include <queue>
#include <list>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <iomanip>
#include <f... | #include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... |
#include<bits/stdc++.h>
typedef long long ll;
#define endl "\n"
#define optimize() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ff first
#define ss second
#define pb push_back
#define testcase ll t; cin>>t; while(t--)
using namespace std;
int main() {
optimize();
ll n;
cin>>n;
ll cnt = 0, a... | //ABC_197_C_
//
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define reps(i,s,n) for(int i=s;i<n;++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
ll ans = 1e18;
rep(i,1<<20)
{
... |
#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
using namespace std;
int main()
{
string str;
cin >> str;
vector<int> dig(10, 0);
for(int i=0; i < str.size(); i++)
dig[str[i]-'0']++;
for(int i=0; i < 10; i++) dig[i] = min(dig[i], 3);
vecto... | /* author:hellojim */
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#incl... |
#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
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC targe... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... |
// R SAI KRISHNA
#include <bits/stdc++.h>
#define for0(i, n) for (int i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (ll)(n); ++i)
#define forc(i, l, r) for (int i = (ll)(l); i <= (ll)(r); ++i)
#define forr0(i, n) for (int i = (ll)(n) - 1; i >= 0; --i)
#define forr1(i, n) for (int i = (ll)(n); i >= 1... | #define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include ... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#defin... | #include <bits/stdc++.h>
using namespace std;
#define N 1000001
#define int1 long long int
int1 lpf[N], mobius[N];
void least_prime_factor()
{
for (int1 i = 2; i < N; i++)
if (!lpf[i])
for (int1 j = i; j < N; j += i)
if (!lpf[j]) lpf[j] = i;
}
void Mobius()
{
for (int1 i = 1; i < N; i++) {
if (i == 1)... |
#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;
typedef long long ll;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937/*_64*/ rng(chrono::ste... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
/*
ALLAH IS ALMIGHTY ******BISMILLAHIR RAHMANIR RAHIM.****** ALLAH IS ALMIGHTY
```````````````````````````````
AUTHOR: ANISUR RAHAMAN
BSMRSTU(SHIICT)
... | #include<bits/stdc++.h>
#define inf 1e18
#define ll long long
#define endl "\n"
#define pb(a) push_back(a)
#define mp(x,y) make_pair(x,y)
#define instr(str) string str; cin>>str;
#define loop(i,x,y) for(int i = x; i < y ; i++ )
#define rev(i,x,y) for(int i = x; i >= y ; i--)
#define in(n) int n; cin>>n;
#define ... |
#include <bits/stdc++.h>
using namespace std;
// #include<atcoder/all>
// using namespace atcoder;
using ll = long long;
#define rep(i, e) for (ll i = (ll)0; i < (ll)e; i ++)
#define repd(i, s) for (ll i = (ll)s; i > (ll)0; i--)
#define reps(i, s, e, p) for (ll i = (ll)s; i < (ll)e; i += p)
#define repsd(i, s, e, p) fo... | #include <bits/stdc++.h>
using namespace std;
int main(){
float n, D, H; cin >> n >> D >> H;
float ans = 0;
for (int i = 0; i < n; i++){
float d, h; cin >> d >> h;
ans = max(ans, H - (D * (H - h) / (D - d)));
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pint pair<int, int>
#define pll pair<ll, ll>
const ll INF = 1LL << 60;
const int MOD = 1000000007;
// const int MOD = 998244353;
int main()
{
int n;
string s, t;
cin >> n;
cin >> s >> t;
int scnt = 0;
int tcnt = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
string s, t;
cin >> n >> s >> t;
long long int ans = 0;
queue<int> q;
for(int i=0; i<n; i++){
if(q.empty() == false && s[i] == '1'){
ans += i - q.front();
q.pop();
s[i] = '0';
}... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n,q;
cin>>n>>q;
unordered_map<ll,ll> m;
vector<ll> a(n);
for(ll i=0;i<n;i++)
{
cin>>a[i];
m[a[i]]++;
}
sort(a.begin(),a.end());
while(q--)
{
ll d;
cin>>d;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(... |
#include<bits/stdc++.h>
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>
using namespace std;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef long double ld;
const int inf = 1e9;
const ll inf64 = 1e18;
int main() {
#ifdef DEBUG
freopen("input.txt", "r"... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long sum =0;
for(int i=0;i<N;i++){
long long a,b;
cin >> a >> b;
sum += ((a+b)*(b-a+1))/2;
}
cout << sum << endl;
}
| #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
#define N 110
using na... |
#include <bits/stdc++.h>
using namespace std;
#define flush cout.flush
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll, ll>;
const ll INF = 1e9 + 7;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ld eps = 1e-9;
const ld PI = acos(-1);
int main() {
ios::... | #include <bits/stdc++.h>
using namespace std;
struct math {
__int128 Tgcd(__int128 a, __int128 b) {
if (b == 0) {
return a;
} else {
return Tgcd(b, a % b);
}
}
__int128 d = 0;
pair<__int128, __int128> gcd(__int128 a, __int128 b) {
if (b == 0) {
d = a;
return {1, 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() {
int h, w;
cin >> h >> w;
vector<string> a(h);
rep(i, h) {
cin >> a[i];
}
int ans = 0;
for (int i = 0; i < h - 1; ++i) {
for (int j = 0; j < w - 1; ++... | 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>
using namespace std;
long long n,k;
int main()
{
cin >> n >> k;
while(k--)
{
if(n % 200) n = n * 1000 + 200;
else n /= 200;
}
cout << n;
return 0;
} | #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 <cmath>
//#include <atcoder/al... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int mod = 998244353;
LL pw(LL n, int x) {
LL ret = 1;
LL t = n;
while (x) {
if (x & 1) ret = ret * t % mod;
t = t * t % mod;
x >>= 1;
}
return ret;
}
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
if (n == 1)
printf("%lld"... | #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;
... |
// Author: Pasindu Wijesena
#include <bits/stdc++.h>
using namespace std;
#define deb(x) cout<<#x<<": "<<x<<endl
#define rep(a,b) for(int a=0;a<b;a++)
#define rep2(a,b,c) for(int a=b;a<c;a++)
#define per2(a,b,c) for(int a=b;a>=c;a--)
#define gcd(a,b) __gcd(a,b) // gcd of two numbers
#define bitCount(a) __builtin_popc... | /*
written by Pankaj Kumar.
country:-INDIA
Institute: National Institute of Technology, Uttarakhand
*/
#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;
typedef long long ll ;
typedef unsigned long long ull... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int U;
template <typename T>
inline void read(T &x)
{
x = 0;bool b = 0;char c;
for (c = getchar();!isdigit(c);b |= (c == '-'), c = getchar());
for (;isdigit(c);x = (x << 1) + (x << 3) + (c ^ 48), c = ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int maxn=222222,mod=998244353;
#define MP make_pair
#define PB push_back
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#defi... |
#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;
const int N = 2e5 + 10, mod = 998244353;
int n, fa[N], ans = 1;
int find_(int x) {
return x == fa[x] ? x : fa[x] = find_(fa[x]);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
fa[i] = i;
for (int i = 1, x; i <= n; i++) {
scanf("%d", &x);
if (find... |
#include <iostream>
#include <vector>
using namespace std;
long mod = 1000000007;
long sqr(long a) {
return a * a % mod;
}
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
long n, a, b;
cin >> n >> a >> b;
if (n < a + b) {
cout << 0 << endl;
co... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace std;
#define int long long
#define pb push_back
#define mp ma... |
#include<bits/stdc++.h>
using namespace std;
# define line cout<<"\n";
# define fast ios_base::sync_with_stdio(false) ; cin.tie(0) ;
# define ll long long
# define C continue;
# define pb push_back
# define vi vector < int >
# define vll vector < ll >
# define I insert
# define pii pair < int , int >
# define pll ... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr... |
#include <bits/stdc++.h>
//#include <bits/extc++.h>
//#include <immintrin.h>
using namespace std;
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
template<typename T>
istream &operator>>(istream &in, vector<... | using namespace std;
#include<bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define double long double
const int N = 2e3+3;
pair<int,int>a[N];
bool intersect(int i, int j)
{
vector< pair<int,int> >v;
v.push_back( a[i] )... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(vector<bool>::reference b) { return to_string(int(b)); }
string to_stri... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, a , b;
cin >> n >> a >> b;
cout << (n - a) + b;
} |
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define all(v) v.begin(),v.end()
#pragma gcc optimize("O3")
#pragma gcc optimize("Ofast")
#pragma gcc optimize("unroll-loops")
using namespace std;
const int INF = 1e9;
const int TMX = 1 << 18;
const long long llINF = 5e18;
const long long ... | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...)name
#define _rep(i,n)repi(i,0,n)
#define repi(i,a,b)for(int i=int(a),i##_len=(b);i<i##_len;++i)
#define MSVC_UNKO(x)x
#define rep(...)MSVC_UNKO(_overload3(__VA_ARGS__,repi,_rep,_rep)(__VA_ARGS__))
#define all(c)c.begin(),c.end()
#define write(x)cout<<(x)<<'... |
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
const LL MOD = 1e9 + 7;
LL a[101010], f[101010], dp[1010... | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <string>
#include <utility>
#include <set>
#include <stack>
#include <deque>
#include <ctime>
#include <random>
#include <cassert>
#include <cmath>
#include <climits>
#include <queue>
#include <cstring>... |
/*
|| Shree Ganeshay Namah ||
|| Jai Shree Ram ||
|| Nabh Sparsham Diptam ||
*/
#include<bits/stdc++.h>
using namespace std;
//typedef long long int ll;
#define mod 1000000007
#define block 180
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define f1 first
#d... | #include<bits/stdc++.h>
#define loop(i, n) for(int i = 0; i < n; i++)
#define pb push_back
#define ll long long int
#define vi vector<int>
#define pi pair<int, int>
#define W(t) int t; cin >> t; while(t--)
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb emplace_back
#define pii pair<int , int>
#define F first
#define S second
const int mod = 1000000007;
const int MAXX = 1e6 +5;
int t , n;
string s;
int a[... | #include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("inline")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #define DEBUG
#ifdef DEBUG
#pragma region
#endif
using namespace std;
#define LL long long
#define PII pair<int, int>
#define rep(i, n) for (i... |
//
// Created by K R, Siva Kumar on 02/01/21 at 5:31 PM.
//
#include <bits/stdc++.h>
using namespace std;
const double pi = 2 * acos(0.0);
const int mod = 1e9 + 7;
class Solver {
string a, b;
public:
void solve() {
cin >> a >> b;
int aa = 0, bb = 0;
for (auto i : a) {
aa += (i - '0');
}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int sum_a = 0;
int sum_b = 0;
while(a){
sum_a += a%10;
a = a/10;
sum_b += b%10;
b = b/10;
}
cout<<max(sum_a,sum_b)<<endl;
return 0;
} |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<map>
#include<bitset>
#include<iomanip>
#include<stack>
#include<set>
#include<string>
#include<deque>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll mod = 1000000... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,k;
cin>>n>>k;
while(k){
if(n%200==0)
n/=200;
else
n=n*1000+200;
k--;
}
cout<<n<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
using namespace std;
using Graph = vector<vector<int>>;
struct UnionFind {
vector<int> par, siz;
UnionFind(int sz): par(sz), siz(sz, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n,k;
cin >> n >> k;
ll ans = 0;
vector<int> cnt(n);
for (int i = 0; i < n; i++) cnt[i] = 0;
for (int i = 0; i < n; i++) {
int a;
cin ... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
#include <sstream>
#include <set>
#include <functional>
#include <map>
#include <unordered_map>
#include <queue>
#include <iomanip>
#include <stack>
using namespace std;
typedef long long ll;
#define repi(i,a,b) for(ll i=a;i<b... | #include <stdio.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <vector>
#define ALL(obj) (obj).begin()(obj).end()
#define DEBUG(x) cerr << #x << " = " << x << endl
using namespace std;
int main() {
int n;
std::cin >> n;
std::string ... |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
cout << 2 * A + 100 - B << endl;
return 0;
} |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int MOD = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
#define ALL(obj) (obj).begin(),(obj).end()
struct edge{
ll to, cost;
};
template<class T>
inline bool... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int N; cin >> N;
vector<int> a(N);
rep(i,N) cin >> a[i];
int ans = 0;
for(int l = 0; l < N; l++){
int x = a[l];
... |
#include<bits/stdc++.h>
using namespace std;
int a,b,c;
int main(){
cin>>a>>b>>c;
if(a*a+b*b<c*c)cout<<"Yes";else cout<<"No";
} | #include<bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
int N,S,D; cin >> N >> S >> D;
vector<int> X(N,0);
vector<int> Y(N,0);
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i];
if (!(X[i] >= S or Y[i] <= D)) {
cout... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
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) << "\n"
#define cosp(x)... | /*
* @date:2021-04-24 20:37:33
* @source:
*/
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 + 5;
const int MOD = 1e9 + 7;
int N, M, K;
long long A[MAXN];
int Num[MAXN];
struct Matrix {
long long A[MAXN][MAXN];
Matrix() {
memset(A, 0, sizeof A);
}
} a, c;
Matrix mul(const M... |
/*
author : TAPAN SAVANI
codeforces : savanitapan2001
codechef : savanitapan17
*/
/*
------------------------------------------------------------------------
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโ... | #include <bits/stdc++.h>
using namespace std;
int g1(int x) {
priority_queue<int> q;
int ans = 0;
while (x > 0) {
q.push(x % 10);
x /= 10;
}
while (!q.empty()) {
ans *= 10;
ans += q.top();
q.pop();
}
return ans;
}
int g2(int x) {
priority_queue<int, vector<int>, greater<int>> q;
... |
#include <iostream>
#include <algorithm>
using namespace std;
long long N, K;
long long calc(long long x) {
if (x<2) return 0;
if (x > 2*N) return 0;
return min(x-1, N*2-x+1);
}
int main(void) {
cin >> N >> K;
unsigned long long ans = 0;
for (long long ab = 2; ab <= 2*N; ab++) {
long long cd = ab-K;... | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FastIO ios_base::sync_with_st... |
#include <iostream>
#define int long long
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a + b + c) - std::min(a, std::min(b, c)) << std::endl;
return 0;
}
| #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace __gnu_pbds;
using namespace std;
/* Written by Nishant Mittal aka nishantwrp */
#define FAST std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
/* Long Long Int */
#define int long long i... |
#include <bits/stdc++.h>
const long long MOD1 = 1000000007;
const long long MOD2 = 998244353;
#define logn long
#define lnog long
#define itn int
using namespace std;
int main() {
long long N; cin >> N;
string T; cin >> T;
for (long long i = 1; i < N; i++) {
if (T.at(i - 1) == '0' && T.at(i) == '0') {
cout << 0... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<LL, LL> II;
typedef pair<LL, II> III;
s... | #line 1 "main.cpp"
/**
* @title Template
*/
#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <map>
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp"
template <class T, class U>
constexpr bo... |
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
char a , b ,c ;
cin >>a >> b >>c;
cout<< b << c << a;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
#include <utility>
using ll=long long;
using namespace std;
int main(){
string S;
cin>>S;
int slen=S.size();
int big;
int ans=1;
for(int i=0;i<slen;i++){
if(S[i] >= 'a'){
big=0;
}else{
big=1;
... |
#include<bits/stdc++.h>
using namespace std;
#define N 10005
bitset<N>p[5],f[3];
int n,i,l,r,cnt,mid,a[N][10],c[10],fl,b[5][5],e[10];
bool check(){
int i;
for(i=1;i<=n;++i)f[0][i]=f[1][i]=f[2][i]=1;
for(i=0;i<5;++i){
f[e[i]]&=p[i];
}
if(f[0].count()&&f[1].count()&&f[2].count())return 1;
return 0;
}
void dfs(int... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#include <cstdlib>
#include <math.h>
#include<cstdio>
#include<cstring>
#include <math.h>
#define vi v(n) vector<ll> v(n);
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define fo(i,n) for(ll i=0;i<n;i++)
#define sz(a) ll((a).size())
#define pb pu... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vz;
typedef vector<vz> vvz;
typedef pair<ll, ll> pll;
#define sz(x) ll((x).size())
#define fo(i,n) for(ll i=0; i<(n); i++)
#define FO(i,a,b) for(ll i=(a); i!=(b); i+=(b)>(a)?1:-1)
#define pb push_back
#defin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
using namespace std;
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
using ll = lo... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
#define per(i,n) for(ll (i)=(n)-1;(i)>=0;--(i))
#ifdef LOCAL
#define debu... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll int n,a=0,b=0,c=0,d=0,e=0,f=0,g=0,x=0,y=0,z=0,c1=0,c2=0,k=0,l=0;
cin>>n;
string s,t;
cin>>s>>t;
for(ll int i=0;i<n;i++)
{
if(s[i]=='1'){a++;}
if(s[i]=='0'){b++;}
if(t[i]=='1'){c++;}
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,string>;
using vv = vector<vector<int>>;
const int INF = (int)1e9;
const LL LINF = (LL)1e18;
const LL sc = (int)1e8;
const double TL = 2.85;
const int Max_N = 20;
const int Max_K = ... | //GIVE ME AC!!!!!!!!!!!!!!!!!
//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define floatset() fixed<<setprecision(15)
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
#define rep(i,... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl "\n"
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = (int) 1e9;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll inf=1000000000000000000,mod=1000000007;
ll bit[300005];
ll update(ll idx,ll val,ll n=300005){
idx++;
while(idx<n){
bit[idx]^=val;
idx+=idx&-idx;
}
return 0;
}
ll getsum(ll idx){
ll sum=0;
if(idx<=0)
retur... |
#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <math.h>
using namespace std;
#define MOD 1000000007LL
#define LL long long
int n, L;
vector... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <climits>
#inclu... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.