code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<iostream>
#include <string> // std::string
#include <iostream> // std::cout
#include <sstream>
#include <algorithm> // std::sort
#include <vector>
#define ll long long
using namespace std;
ll conv(ll n)
{
std::stringstream ss;
ss << n;
string s,sc;
ss>>s;
sort(s.begin(), s.end());
sc=s;
... | //#include <bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<unordered_map>
#include<queue>
#define INF 0x3f3f... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define sc second
#define fr first
#define scl(n) scanf("%lld",&n)
#define scll(n,m) scanf("%lld%lld",&n,&m)
#define scs(ch) scanf("%s", ch)
char ch[200005],tmp[]="110";
ll ckr(ll i,ll j,ll n)
{
for(; i<n&... | //给你一个数x,然后要你找到两个数a,b使得b=x+a,且a,b位数不一样.要你求这样的a,b个数.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=55;
ll x,n,a[N];
ll span[N];//这一位假如进位可以到哪一位.
ll f[N];//到i的时候进位不进位可以有多少种方案数.
ll cnt[N];//记录每一位的大小.
ll possible[N];//可以进位的方案数
int main()
{
//a+x=b,且a,b位数不能相同,肯定是a存在进位.考虑每次a进位的情况即可?
ci... |
//Shrey Dubey
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<vector>
#include<set>
#include<list>
#include<iomanip>
#include<queue>
#include<stack>
#include <math.h>
#include<climits>
#include<bitset>
#include<cstring>
#include<numeric>
#include<array>
#includ... | #pragma GCC optimize ("O3")
#pragma GCC target("avx512f")
#pragma GCC optimize("unroll-loops")
#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++)
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) (int)x.size()
#define bit(n, k) (((n) >> (k)) & 1)
const int maxn = 1e2 + 10, mod = 1e9 + 7;
pair<int, int> arr[maxn];
bool mark[maxn];
vector<int> g[maxn];
int n;
void create(double d) {
memset(mark, 0, sizeof mark);
for (auto &i : ... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].... |
#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>;
using Graph = vector<vector<int>>;
template<class T> void chmax(T& a, T b){
if(a < b){
a = b;
}
}
template<class T> void chmin(T& a, T b){
if(a > b){
a ... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define ll long long
#define pi (3.141592653589)
#define mod 1000000007
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, m... |
#include<bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ifor(st,lim) for(int i=st;i<lim;i++)
#define jfor(stt,llim) for(int j=st... | #include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main(){
cin>>n>>s;
if(s[0]!=s[n-1]){
cout<<1<<endl;
return 0;
}
for(int i=1;i<n-2;i++){
if(s[0]!=s[i]&&s[i+1]!=s[n-1]){
cout<<2<<endl;
return 0;
}
}
cout<<-1<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll,ll> P;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define EFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i, n) FOR(i,0,n)
#define INF 1e12
int main(void){
ll n,m, ans_max = -INF;
cin >> n ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
vector<int> god(A + B);
if (A > B)
{
int sum = 0;
for (int i = 0; i < A; i++)
{
god.at(i) = i + 1;
sum += i + 1;
}
for (int i = 0; i < B; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll t,i,j,k;
ll a,b;
cin>>a>>b;
vector <ll> res;
if(a>b)
{
ll x=(a*(a+1))/2-(b*(b-1))/2;
for(i=1;i<=a;i++)
cout<<i<<" ";
for(i=1;i<b;i++)
cout<<-i<<" ";
cou... |
#include<bits/stdc++.h>
#include<stdlib.h>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<time.h>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long
#define int long long
#define inf 0x3f3f3f3f
#define mods 1000000007
#define modd 998244353
#define PI acos(-... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, N, sum=0;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (i = 0; i < N; i++) {
cin >> A.at(i);
}
for (i = 0; i < N; i++) {
cin >> B.at(i);
}
for(i = 0; i < N; i++) {
sum += A.at(i) * B.at(i);
}
if(sum == 0){
cout <... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string n; cin>>n;
int k; cin>>k;
string A=n;
int a=stoi(n);
sort(n.begin(),n.end());
string g2=n;
reverse(n.begin(),n.end());
string g1=n;
for(int i=1;i<=k;i++){
sort(A.begin(),A.end());
g2=A;
reverse(A.begin(),A.end());
g1=... | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
int n ;
double A[100007] , S[100007] ;
double calculation(double x){
auto it = upper_bound(A,A+n,2*x) ;
int i = it - A ;
return (S[n] + n * x... |
#include <bits/stdc++.h>
using namespace std;
int cnt[1000];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("file.inp","r",stdin);
string s;
cin >> s;
int n = s.size();
long long ans = 0;
for (int i = n - 1; i >= 2; i--)
{
cnt[s[i]]++;
if (s[i] !... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <variant>
#include <sstre... |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i, n) for(ll i=n-1;i>=0;--i)
#define rep1(i, n) for(ll i=1; i<=n; ++i)
#define repitr(itr,mp) for(auto itr=mp.begin();itr!=mp.end();++itr)
#define rrepitr(itr, mp) for(auto itr = mp.rbegin(); itr!=mp.rend(); ++itr)
#define ALL(a) (a).begin(),(... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define int long long
#pragma region Debugger
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
//void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;... |
#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>
using namespace std;
#define REPP(i,a,b,d) for(int i=(a);i<=(int)(b);i+=(d))
#define REP(i,a,b) REPP(i,a,b,1)
#define REVV(i,a,b,d) for(int i=(a);i>=(int)(b);i-=(d))
#define REV(i,a,b) REVV(i,a,b,1)
#define FOR(i,a) for(int i=0; i<(int)(a); i++)
#define FORD(i,a) for(int i=(int)(a)-1; i>=0; i--... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... | #include<bits/stdc++.h>
using namespace std;
string x;
int d;
long long m,sum,cnt,rt;
long long calc(long long base){
sum=0;
for(int i=0;i<x.size();i++){
if(sum>(m/base)) return m+1;
sum*=base;
sum+=(x[i]-'0');
if(sum>m) return m+1;
}
return sum;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(NULL);
cout... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define repd(i, a, b) for (int i = a; i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#... | #include <bits/stdc++.h>
int main(){
long long l, r;
std::cin >> l >> r;
if(l == r){
std::cout << "0\n";
return 0;
}
long long res = 0;
std::vector<long long> vec(r - l + 1);
for(long long i = r - l; i > 1; i--){
long long cnt = r / i - (l - 1) / i;
cnt = c... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
#define rep(i, a, b) for (int i = a; i < b; i++)
bool check7(int a, int base){
while(a > 0){
if (a % base == 7)
... | #include<bits/stdc++.h>
using namespace std;
#define fastrun ios_base::sync_with_stdio;cin.tie(nullptr);cin.tie(nullptr);
typedef long long int ll;
#define t int t;cin>>t;while(t--)
#define For(n) for(int i=0;i<n;i++)
#define INT(a) int a;scanf("%d",&a);
#define LLI(a) ll a;scanf("%lld",&a);
#define DOUBLE(a) double a;... |
#include<bits/stdc++.h>
using namespace std;
#ifdef local
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
r... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N;
vector<vector<int>> edges;
vector<bool> ondiameter;
vector<int> ans;
pii far(int u, int prev, int d) {
int node = u, dis = 0;
for (int v : edges[u]) {
if (v == prev)... |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define PB push_back
#define MP make_pair
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
... | #include <vector>
#include <set>
#include <iostream>
#include <algorithm>
#include <string>
#include <utility>
#define mod % 998244353
#define MAX 998244353
#define ll long long
using namespace std;
int main() {
int high,wide,k;
cin >> high;
cin >> wide;
cin >> k;
ll ans = 0;
if(high == wide and high == 1... |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#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++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define mod 1000000007
using namespace std;
int n,q;
int C[200005];
map<int,int> vec[200005];
int fa[200005];
int fnd(int x){
return fa[x]==x?fa[x]:fa[x]=fnd(fa[x]);
}
voi... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define type make_pair
#define F first
#define S second
#define... | #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>
using namespace std;
char mp[110][110];
int n, m;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%s", mp[i] + 1);
}
int ans = 0;
for (int i = 2; i <= n; i++) {
int pre = 0;
for (int j = 1; j <= m; j++) {
if (mp[i][j] != mp[i - 1][j]) {
int now;
... | #include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <algorithm>
// #include <stdio.h>
// #include <math.h>
// #include <string>
// #include <cctype>
// #include <map>
// #include <queue>
// #include <limits>
// #include <iomanip>
// #include <sstream>
// #include <cstdlib>
// #include <loc... |
/*
author : aryan57
created : 01-May-2021 18:08:02 IST
*/
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < 12; i++) {
if(i < 12 && S.at(i)=='Z') {
if(i < 11 && S.at(i + 1)=='O') {
i++;
if(i < 11 && S.at(i + 1)=='N') {
i++;
if(i < 11 && S.at(i + 1)=='e'... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
typedef long long ll;
#define For(i,a,b) for(ll i = a ; i <= b ; i ++)
#define FoR(i,a,b) for(ll i = a ; i >= b ; i --)
ll MAX(ll a , ll b) {
return (a > b ? a : b);
}
ll MIN(ll a , ll b) {
return (a < b... | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using pl = pair<ll, ll>;
constexpr int MX = 5005, MOD = 998244353;
pl DP[MX][2];
int main() {
if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
cin.tie(0)->sync... |
/*
मनस्वी म्रियते कामं कार्पण्यं न तु गच्छति ।
अपि निर्वाणमायाति नानलो याति शीतताम् ॥
*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define mod 1000000007
#define pb push_back
#define ll long long i... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... |
#line 2 "/home/snow/competitive-programming/competitive-programming-library/snow/template.hpp"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
constexpr long long INF = 1LL << 60;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for ... | #include<bits/stdc++.h>
#define PI 3.141592653589793238462
#define eps 1e-20
using namespace std;
using cd = complex<double>;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdd;
int main(){
db n,sx,sy,tx,ty;cin>>n>>sx>>sy>>tx>>ty;
db px=(sx+... |
#include <iostream>
using namespace std;
int main(void) {
int a[2][2];
int i, j;
for (i = 0;i < 2;++i) {
for (j = 0;j < 2;++j) {
cin >> a[i][j];
}
}
int ans = a[0][0] * a[1][1] - a[0][1] * a[1][0];
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define F first
#defin... |
// #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define int long long
#define all(a) a.begin(), a.end()
#define vi vector<int>
#define pii pair<int, int>
#define fe(i, a, b) for (int i = a; i <= (b); ++i)
#define fr(i, a, b) for (in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define ll long long
int main() {
int N, S, D;
cin >> N >> S >> D;
int X[N], Y[N];
rep(i, N) cin >> X[i] >> Y[i];
rep(i, N) {
if(X[i] < S && D < Y[i]) {
cout << "Yes" << endl;
... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int>... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long X, Y, A, B;
cin >> X >> Y >> A >> B;
long long exp = 0;
while (1) {
if ((double)X * A > 2e18 || X * A >= Y || X * A > X + B) {
break;
}
X *= A;
exp++;
}
long long re = ((Y - ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a=0,b=0,c=0;
long long i=1;
long long ans=9223372036854775807;
long long N;
cin >> N;
while(1){
if(i >= N)break;
b++;
i = i << 1;
a = N / i;
c = N % i;
if(a+b+c < ans){
ans = a+b+c;
}
}
if(b == 0){
... | #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... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define N 1000000000
#define inf 10000000000000
ll T,n,m,k,t,mi,mc=0;
ll a,b,c;
inline ll ksm(ll a,ll b,ll mod){ ll res=1;
for(;b;b>>=1,a=a*a%mod){... | #include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#define it register int
#define ct const int
#define il inline
template <class I>
il I M... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin >> n;
vector<int> ans(n);
ans[0] = 1;
for (int i = 1; i < n; i++)
{
ans[i] = ans[(i + 1) / 2 - ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define f first
#define s second
#define all(c) begin(c),end(c)
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef lo... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | // AtCoder.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE ///???
#endif ///????
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<... |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll a;
cin >> a;
ll b;
cin >> b;
cout << n-a+b << '\n';
return 0;
}
|
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define forn(i,x1,n) for(int i=x1;... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.ti... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SZ(x) ((int)(x).size())
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, leng... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int main(){
int a, b;
cin >> a >> b;
int sa, sb; sa=0; sb=0;
while(a >= 10){
//sa = 0;
sa += a % 10;
a /= 10;
}
sa += a;
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int cnt = 0;
int tmp1 = 0;
int tmp2 = 0;
int tmp3 = 0;
while(tmp1 <= 10000){
tmp1 += 6;
if((tmp1 % 5 != 0)&&(tmp1 <= 10000)){
cout << tmp1 << " ";
cnt++;
if(cnt == N) break;
}
tmp2 += 10;
if((... | #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... |
// kid_kb //
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define ull unsigned long long int
#define lower(str) transform(str.begin(),str.end(),str.begin(),::tolower);
#define upper(str) transform(str.begin(),str.end(),str.begin(),::toupper);
#define mod 1000000007
#define SORT(v... | #define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printA... |
#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 <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... |
/****************##### بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم #####********************
********************* Saidur Rahman *************************
********************* CityU--CSE--47 *************************
---------------------------------------------... | #include <bits/stdc++.h>
#define rep(i, l, r) for (int i = l; i < (int)(r); i++)
#define all(vec) vec.begin(), vec.end()
#define allr(vec) vec.rbegin(), vec.rend()
using namespace std;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,m,i,j,cur,res,mod=1000000007;
cin >> n;
vector<long long> fib(88);
fib[0]=1; fib[1]=1;
for(i=2; i<88; i++){
fib[i]=fib[i-1]+fib[i-2];
//cout << i << ' ' << fib[i] << endl;
}
cur=n; res=0;
vector<long long> ans(0);
for(i=87; i>=0; i--){... | /* --------------------
| LOSER |
| ~NOOBOSS~ |
--------------------
*/
#include <bits/stdc++.h>
using namespace std;
#define mxx LLONG_MAX
#define mnn LLONG_MIN
#define Y() cout<< "YES" <<endl
#define N() ... |
#include <bits/stdc++.h>
#include <string>
#include <cmath>
#include <sstream>
#include <unordered_map>
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for(ll i = (a-1); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ff first
#define ss second
#define spre cou... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define f(i,a,b) for(ll i = a; i < (ll) b ; i++ )
#define af(i,a,b) for(ll i = a; i >= (ll) b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < (ll) b ; i+= k )
#define arep(i,a,b,k) for(ll i = a; i >= (ll) b ; i-= k)
#define f... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... | #include <bits/stdc++.h>
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define fir first
#define sec second
#define pii pair<int, int>
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
using namespace std;
int dx[4]={0, ... |
#include<iostream>
#include<math.h>
#include<string>
#include<sstream>
#include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main()
{
int n;
cin>>n;
double value=n*1.08;
if(floor(value)<206)
{
cout<<"Yay!"<<"\n";
}
else if(floor(value)>206)
{
cout<<":("<<"\n";
}
else if(floor(value)==206... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll LINF = 1e18;
template <class T>
bool chmax(T... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,a[3]={-1,-1,-1};
cin>>x>>y;
a[x]++;
a[y]++;
if(x==y)
{
cout<<x;
return 0;
}
for(int i=0;i<3;i++)
{
if(a[i]==-1) cout<<i;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
template <class T = ll> using P = pair<T,T>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
#define rep(i,n) for(int i=0; i<(n);++i)
#define repp(i, l, r) for(int i = (l); i < (r); ++i)
#define pb push_back
#def... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
struct Sum {
ll a;
ll b;
ll s;
};
int main() {
int n;
cin >> n;
vector<Sum> s(n);
ll sumA = 0, sumT = 0;
for(int i=0; i<n; i++) {
ll a, b;
cin >> a >> b;
sumA += a;
sumT += b;
s[i] = Sum{a, b, 2*a + b};
}
s... | #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 all(x) x.begin(),x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main(){
int n;
cin >> n;
ll aoki=0,takahashi=0;
vector<ll> a(n),b(n);
... |
/**
* author:
* created: 15.11.2020 00:24:55
**/
#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
using ll = long long;
const int INF = 1001001001;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1};
typedef vector<int> vi;
typedef vector<vi> v... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... |
#include<bits/stdc++.h>
#define lld long long
#define pb push_back
#define mk make_pair
#define MAX (lld)1e18+7
#define lim (lld)1e9+7
#define MAX2 (lld)2e5+9
#define ff first
#define ss second
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const lld mod=lim;
lld power(lld x, lld ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n;
cin >> n;
double ret = 0;
for (int i = 1; i <= n - 1; i++) {
ret += (1.0 * n / i);
}
printf("%.12lf", ret);
}
int main() {
solve();
return 0;
} |
//Common Header Simple over C++11
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end(... | #include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_nod... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <map>
//#include <set>
using namespace std;
typedef long long LONG;
LONG gcd(LONG x, LONG y) {
if(x % y == 0) {
return y;
} else {
return gcd(y, x % y);
//x%y==0でないときはユーグリットの互除法を... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <random>
#include <bitset>
#include <numeric>
#include <cassert>
using namespace s... |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define rep(i,n) repi(i,0,n)
#define repi(i,a,n) for(ll i=a;i<(ll)n;++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
usin... | #include<bits/stdc++.h>
using namespace std;
int t;
long long ans;
long long l,r;
int main()
{
cin>>t;
for(int o=1;o<=t;o++)
{
cin>>l>>r;
if(r<2*l)
{
printf("0\n");
continue;
}
ans=(r-l+1ll)*(r-2ll*l+1ll);
ans-=r*(r-2ll*l+1ll)/2ll;
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define loop(i,a,b) for(int i=(a);i<(b);i++)
#define hunt(i,a,b) for(int i=(a);i<=(b);i++)
#de... | #include<bits/stdc++.h>
#define re register
using namespace std;
#define int long long
inline int read(){
re int t=0;re char v=getchar();
while(v<'0')v=getchar();
while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
return t;
}
int a,b,c;
signed main(){
a=read()*2;
for(re int i=1;i<=sqrt(a);++i){
if(a%i==0&&((i&1)!=(... |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " is " << x << "\n"
#define int long long
#define mod 1000000007
#define PI acos(-1)
template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <typename T... | //#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
#define eps 1e-8
#define eq(x,y) (fabs((x)-(y)) < eps)
using namespace std;
... |
#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>
#define MAXN 200000+10
using namespace std;
int n;
int l[MAXN],r[MAXN];
long long DP[MAXN][2];
int main()
{
memset(DP,0x3f,sizeof(DP));
scanf("%d",&n);
for(int i=1;i<=n;i++)
l[i] = r[i] = -1;
for(int i=1;i<=n;i++)
{
int x,y;
scanf("%d%d",&x,&y);
if(l[y] == -1) l[y] = r[y] = x;... |
/*
Snippets :-
1. Binomial (nCr) - nCr Modulo
2. (x^y)mod m - power
3. gcd & lcm - gcd
4. Djisktra - Djikstra
5. Priority Queue - priority
6. Disjoint Set Union - dsu
7. Compare Sort [sort pair with customisation] - compare
*/
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(... | #include<bits/stdc++.h>
#include <sstream> // for string streams
using namespace std;
int main()
{
long long N,K;
cin>>N>>K;
for(int b=0;b<K;b++)
{
ostringstream str1;
str1<<N;
string converted=str1.str();
int len_num=converted.size();
int a[len_num];
int i=0;
while(N!=0)
{
a[i]=N%10... |
//
#include <iostream>
using namespace std;
int main() {
short N; cin >> N;
short ans = 1.08f * N;
if (ans < 206)
cout << "Yay!\n";
else if (ans == 206)
cout << "so-so\n";
else
cout << ":(\n";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int a;
cin>>a;
cout<<(a+99)/100;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long int ll;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
void P... | #include <bits/stdc++.h>
using namespace std;
int main(void){
char a,b,c;
cin>>a>>b>>c;
if (a==b&&b==c&&a==c) {
cout<<"Won"<<endl;
} else {
cout<<"Lost"<<endl;
}
} |
#include <bits/stdc++.h>
#define ll long long int
#define db double
#define pb push_back
#define mpr make_pair
#define andl "\n"
#define f first
#define s second
#define mset(x,y) memset(x,y,sizeof(x))
#define fr(i,n) for(long long int i=0;i<n;i++)
#define trace(it,x) for(auto it = (x).begin(); it != (x).end(); it++)
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,q;
cin>>n>>m>>q;
vector<pair<int,int>>v;
vector<pair<int,int>>w;
int a,b;
for(int i=0;i<n;i++){
cin>>a>>b;
v.push_back(make_pair(b,a));
w.push_back(make_pair(b,a));
}
sort(v.rbegin(),v.rend());
sort(w.rbegin(),w.rend());
int ar... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define cs const
#define fr first
#define se second
//#define ls (now<<1)
//#define rs (now<<1|1)
#define mid ((l+r)>>1)
#define Mid ((l + r) / 2)
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define low(i) (i&(-... | #include<bits/stdc++.h>
#define ll long long
#define inf 0x7fffffff
#define infll 0x7fffffffffffffff
#define clr(c) memset(c,0,sizeof(c))
using namespace std;
int mod=998244353;
const int M=2e5+10;
const int N=1e6+10;
inline ll read(){
ll b=1,sum=0; char c=getchar();
while(!isdigit(c)){if(c=='-') b=-1; c=getch... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fl(i,n) for(int i=0;i<n;i++)
#define v(i) vector<int>
#define um unordered_map<int,int>
#define pb push_back
#define pr pair<int,int>
#define NO cout<<"NO";
#define all(a) a.begin(),a.end()
#define YES cout<<"YES";
#define sortn(a) sort(a.be... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 998244353
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __b... |
#include<bits/stdc++.h>
#define fio ios_base::sync_with_stdio(0);cin.tie(NULL);
#define ll long long
#define ld long double
#define tc int t; cin>>t; while(t--)
using namespace std;
const int MAX=1e5+1;
const int mod=1e9+7;
int main(){
fio
int n,m,tmp=0,res=0... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define Mod 1000000007
#define Infinity (ll)1e18
#define Append(a) push_back(a)
#define Pair(a,b) make_pair(a,b)
#define Clear(a) for(ll &x : a){x=0;}
#define Point(x) std::fixed<<setpreci... |
#include<bits/stdc++.h>
using namespace std;
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pt;
typedef pair<ll,ll... | //高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i+... |
#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, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long r1, c1, r2, c2;
cin >> r1 >> c1;
cin >> r2 >> c2;
if (r1 == r2 && c1 == c2) {
// その場にいる
cout << 0 << endl;
return 0;
} else if (abs(r1 - r2) + abs(c1 - c2) <= 3) {
// ３マス以内にいる
... |
//
// Created by yamunaku on 2020/10/31.
//
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) f... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 7;
const double PI = 3.14159265358979;
#define ALL(x) x.begin(),x.end()
int main(){
const ll MOD = 998244353;
vector<ll> n(3);
for(int i = 0; i < 3; i++) cin >> n[i];
ll ans = 1;
for(... |
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ull unsigned long long
#define int long long
#define pre(a,b) cout<<fixed<<setprecision(a)<<b<<"\n";//a for precision b for answer
//#define mp make_pair
#define max3(x,y,z) max(x,max(y,z))
#define ... | /* header file */
#include <bits/stdc++.h>
/* config */
namespace config {
__attribute__((constructor)) void _setup_ () noexcept {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout << std::fixed << std::setprecision(10);
}
} // namespace setup
/* iostream */
template<class Tp> std::istream &operator... |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
if(abs(x - y) < 3){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | //Radhe Radhe
#include<bits/stdc++.h>
#define FASTIO_ ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define en '\n'
#define itr(i,n) for(ll i=0; i<n; i++)
#define itr_ab(i,a,b) ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
#define Graph vector<vector<ll>>
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
#define inf 10... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef double dd;
#define tst int tttt;cin>>tttt;for(int TTTT=1;TTTT<=tttt;TTTT++)
#define nl cout<<"\n";
#define forn(a,b) for(int ii=a;ii<b;ii++)
const ll MOD1=1e9+7;
const ll MOD2=998244353;
#define mp(a,b) make_pair(a,b)
#define pb(a) push_bac... |
#include <sstream>
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <array>
#include <deque>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <list>
#include <cassert>
#include <cmath>
#include <climits>
#include <map>
#include <queue>
... | #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 _roverload(_a1,_a2,_a3,name,...) name
... |
#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 rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) &&... | #include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, h, w, a, b, ansa = -1, ansb = -1;
scanf("%lld%lld", &h, &w);
ll uf[h + w], r[h + w];
char s[w + 10];
bool f[h + w];
for(i = 0; i < h + w; ++i) uf[i] = i, r[i] = 0, f[i] = false;
uf[h] = uf[h + w - 1] = uf[h - 1] = 0, r[0] = 1;
for(i ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define ld long double
#define sor(c) sort((c).begin(),(c).end())
#define rsor(c) sort((c).rbegin(),(c).rend())
#define rev(c) reverse((c).begin(),(c).end())
#define ... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int SIZEN = 100010;
typedef long long LL;
int K;
int main(){
LL ans = 0;
scanf("%d",&K);
for(int i = 1;i <= K;i++){
for(int j = 1;j*i <= K;j++){
for(int k = 1;i*j*k <= K;k++)ans++;
}
}
... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1e9
typedef long long ll;
t... | #include <iostream>
#include <queue>
using namespace std;
template <typename T>
struct Edge
{
int to;
T cost;
};
template <typename T>
struct WeightedGraph
{
int n;
std::vector<std::vector<Edge<T>>> g;
WeightedGraph(){}
WeightedGraph(int n) : n(n){
g.resize(n);
}
... |
#include <iostream>
#include <vector>
#include <string>
#include <unordered_set>
int main()
{
int N;
std::cin >> N;
std::vector<std::string>S(N);
for (std::string& s : S)
std::cin >> s;
std::unordered_set<std::string>h(S.begin(), S.end());
for (std::string &s:S)
if (h.count('!' + s))
{
std::cout << s <<... | #include <bits/stdc++.h>
using namespace std;
//#define FOR_CODEFORCES
//#define MOD 998244353LL
#if 1 //テンプレ折り畳み//テンプレ折り畳み//テンプレ折り畳み
#ifdef _DEBUG
#define debug() if(true)
#define dout cout
#define dvout(v) __vout(v)
#define dvvout(v) __vvout(v)
#else
#define debug() if (false)
#define dout if (false)cout
#define dv... |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define itn int
#define make_unique(x) sort((x).begin(), (x).end()); (x).erase(unique((x).begin(), (x).end()), (x).end())
using namespace std;
inline int nxt() {
int x;
scanf("%d", &x);
return x;
}
void solve() {
int n = nxt();
vector<int> a(n), b(... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n,m,i,j,ans,cur,res,mod=1000000007;
cin >> n;
vector<long long> a(n);
vector<vector<long long>> dp(n,vector<long long>(2,0));
for(i=0; i<n; i++){
cin >> a[i];
}
sort(a.begin(),a.end());
cur=a[n/2];
for(i=0; i<n; i++){
a[i]*=2;
}
ans=0;... |
#include<bits/stdc++.h>
using namespace std;
long long n,p,ans,bs;
long long MOD=1000000007;
int main()
{
cin>>n>>p;
if(p==2)
{
if(n==1)cout<<"1";
else cout<<"0";
}
else if(p==3)cout<<"2";
else
{
ans=(p-1)%MOD;
bs=(p-2)%MOD;
n--;
while(n)
{
if(n&1==1)ans=(ans*bs)%MOD;
bs=(bs*bs)%MOD;
n>>=1... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define ndl '\n'
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin... |
#include<bits/stdc++.h>
#define mod 1000000007
#define INF 10000000000000001
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define vc vector
#define vll vector<long long>
#define pll pair<long long,long long>
#define pb push_back
#define all(v) v.begin(),v.end()
#define T ll test;cin>>t... | /* Har Har Mahadev */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef priority_queue<ll> pqll;
int INF = 1000000005;
#define lab(i,a,b) for(i=a;i<=b;i++)
#define bal(i,a,b) for(i=b;i>=a;i--)
#define yep cout<<"Yes... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
// 2の27乗＝１億３千万
#define rep(i, n, N) for (int i = n; i < (int)(N); i++)
#define ascending(array) sort(array.begin(), array.end())
#define descending(array) sort(array.rbegin(), array.rend())
#define log(name, message) cout << name << " = " << message ... | #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;
using ll = long long;
using ldb = long double;
using pa = pair < ll, ll >;
using vec = vector < ll >;
template < typename T > using index_set = tree < T, null_typ... |
#include <bits/stdc++.h>
using i64 = long long;
#define REP(i, n) for (int i = 0, REP_N_ = int(n); i < REP_N_; ++i)
#define ALL(x) std::begin(x), std::end(x)
template <class T>
inline bool chmax(T &a, T b) {
return a < b and ((a = std::move(b)), true);
}
template <class T>
inline bool chmin(T &a, T b) {
return a >... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
#define repc(i,f,n) for(char i=(f); (i) <= (n); i++)
#define PI 3.14159265359
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<"... |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (long long i = (s); i < (long long)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
int main() {
i... | #include<bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define all(x) (x.begin(),x.end())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL)
#define pb push_back
#define deb(x)... |
// C
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[])
{
int n;
cin >> n;
vector<char> p(n + 1, 1); p[0] = p[1] = 0;
for (long long i = 2; i * i < n + 1; i += 1 + (i & 1))
if (p[i]) for (long long j = i * i; j < n + 1; j += i) p[j] = 0;
vector<int> ans(n);
ans[0] = 1;
map<int, ... | #include <iostream>
int main()
{
unsigned long long N;
std::cin >> N;
unsigned long long ans = 0;
unsigned long long t = 1;
for (auto i = 0ull; i < 5; ++i)
{
t *= 1000;
if (N >= t)
{
ans += N;
ans -= (t - 1);
}
}
std::cout << ans <... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
template<typename T>void ckmn(T&a,T b){a=min(a,b);}
template<typename T>void ckmx(T&a,T b)... | #include <stdio.h>
constexpr unsigned char H[16] = {0, 1, 0, 3, 1, 1, 1, 1, 0, 1, 2, 2, 3, 1, 2, 3};
int main() {
unsigned char n, k;
scanf("%hhd %hhd", &n, &k);
getchar_unlocked();
unsigned char hh[200];
for (unsigned char i = 0; i < n; i++) hh[i] = getchar_unlocked() - 80;
for (unsigned char i = 0; i < ... |
#include "bits/stdc++.h"
using namespace std;
//shorthands
#define ll long long
#define ld long double
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define mkp make_pair
#defin... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#include<functional>
#include<iomanip>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,... |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define pb(a) push_back(a)
#define vll vector<ll>
#define loop(i, n) for(ll i=1;i<=n;i++)
#define loop0(i, n) for(ll i=0;i<n;i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%lld", i)
#define pll pair<ll, ll>
#define vpll vector<pair<l... | #include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int n = 1;
for (int i = 0; i < N; i++) {
n *= 2;
}
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
vector<pair<int, int>> v(n);
for (int i = 0; i < n; i++) {
v[i].first = A[i];
v[i].second = i;
}
for (int i = ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<... | #include<bits/stdc++.h>
using namespace std;
long long res=0;
int main(){
long double x,y,r;
cin>>x>>y>>r;
long long L=ceil(x-r),R=floor(x+r);
r+=1e-14;
for(int i=L;i<=R;i++){
if(r*r-(1.0*i-x)*(1.0*i-x)>=0){
long double yy=sqrt(r*r-(1.0*i-x)*(1.0*i-x));
long long tmp=floor(y+yy)-ceil(... |
#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
// #define fisier 1
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const double dancila = 3.14159265359; // PI
const double eps = 1e-9;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... |
/*
Date-Time: 27-03-2021 21:01:15
author: Pratik Jain
*/
#include <bits/stdc++.h>
using namespace std;
/***********************competetive programming setup*******************************/
#define INF 1e9
#define all(v) v.begin() , v.end()
#define pb push_back
#define ll long long
#define vi vector<int>
#define ... | #include<bits/stdc++.h>
using namespace std;
char a[105][105];
int main(){
int h,w,x,y,sum=0;
cin>>h>>w>>x>>y;
getchar();
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
scanf("%c",&a[i][j]);
}
getchar();
}
for(int i=x-1;i>=1;i--){
if(a[i][y]=='#')break;... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll> ;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define inf 1LL<<60;
ll min(ll a,ll b){return a>=b ? b:a;}
ll max(ll a,ll b){return a>=b ? a:b;}
ll dist[1<<18];
typedef... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int INF = 2e9;
int dx[] = {0, 1, 0, -1};
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
vector<vector<... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
f... |
//Aditya_14
#include <bits/stdc++.h>
#define int long long
#define loop(a, b, c) for(int a=b; a<c; a++)
#define rev(a, b) for(int a=b-1; a>=0; a--)
#define fo(a, b) for(int a=0; a<b; a++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pair<in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n), y(n);
for (int i = 0; i < n; i++) cin >> x.at(i) >> y.at(i);
if (n == 3) {
vector<int> ans;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ans.emplace_back(max(abs(x[i] -... |
#include <iostream>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> xs, ys;
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
if (c == '0') xs.push_back(i);
}
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
if (c... | #include<bits/stdc++.h>
using namespace std;
namespace Tzh{
typedef long long ll;
const int maxn=1000010;
int pos[maxn];
void work(){
int n,ans=0;
cin>>n;
string a,b;
cin>>a>>b;
int cnt=0,tmp=0;
for(int i=1;i<=n;i++) if(a[i-1]=='0') pos[++cnt]=i;
for(int i=1;i<=n;i++) if(b[i-1]=='0'){
tmp++; ... |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0;i < (n);i++)
using namespace std;
int main() {
int k;
string n;
cin >> n >> k;
string s = n;
rep(i,k) {
string s1,s2;
sort(s.begin(), s.end());
s1 = s;
sort(s.begin(), s.end(), greater<char>());
... | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
int c;
c = 2 * a + 100 - b;
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int cnt;
string S;
string buf,zone = "ZONe";
cin >> S;
for(int i=0;i<9;i++){
buf = S.substr(i,4);
if(buf==zone){
cnt++;
}
}
cout << cnt << endl;
}
| #include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<map>
#include<algorithm>
#include<set>
#define fs(i,x,y) for(int i=(x),_=(y);i<=_;++i)
#define fn(i,x,y) for(int i=(x),_=(y);i>=_;--i)
#define tor(i,v,x) for(int i=head[x],v=to[i];i;i=nxt[i],v=to[i])
#defin... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,k,m;
cin >> n >> k >>m;
int i,j;
ll yotei = m*n;
for(i=0;i<n-1;i++){
ll ten;
cin >> ten;
yotei-=ten;
}
if(yotei<=0)cout << 0 <<endl;
else if(yotei>k)cout << -1 << endl;
else cou... | #include <bits/stdc++.h>
typedef long long int LL;
typedef long double LD;
#define nl '\n'
#define ff first
#define ss second
#define inf INT_MAX
#define SQR(a) (a) * (a)
#define pb push_back
#define GCD(a, b) __gcd(a, b)
#define PI ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << (7-a) + (7-b) + (7-c);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define M1 1000000007
#define M2 998244353
#define INF 1e18
#define ll long long
#define pll pair<ll,ll>
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define REPR(i,a,b) for(ll i=b-1;i>=a;i--)
#define forr(i,n) for(ll i=0;i<n;i++)
#define F first
#define S second
#define pb push_... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define endl "\n"
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
int powmod(int a,int l, int md){a%=md; int res=1;while(l){if(l&1)res=res*a%md;l/=2;a=a*a%md;}return res;}
int binpow(int a,int l){... | #include <bits/stdc++.h>
using namespace std;
int digitnum(long long int n) {
int ans = 0;
while (1) {
n /= 10;
ans++;
if (n == 0) return ans;
}
}
int main() {
long long int n;
long long int a = 0, b = 0, c = 0, ans=0;
cin >> n;
long long int m = n;
while (m > 0... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
bool solve(vector<ll> &A) {
ll N = A.size();
... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[73][(1ll<<20)+5];
int prime[73];vector<ll>req_prime;
vector<ll>bit_mask;
void init(){
prime[0]=prime[1]=1;
for(int i=2;i<=72;i++){
if(prime[i]==0){
for(int j=i*i;j<=72;j+=i)
prime[j]=1;
}
}
for... |
#include <bits/stdc++.h>
#define rep(i,n) for ((i)=1;(i)<=(n);(i)++)
using namespace std;
int n,m,i,j,f[200005],s[200005];
vector<int> g[200005];
int l,r,mid,ans;
void dfs(int x,int fa){
int i,mx=0,mi=0;s[x]=0;
for(i=0;i<g[x].size();i++){
if(g[x][i]==fa) continue;
dfs(g[x][i],x);
mx=max(mx,f[g[x][i]]);
mi=min... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin(... |
//clear adj and visited vector declared globally after each test case
//check for long long overflow
//while adding and subs check if mod becomes -ve
//while using an integer directly in a builtin function add ll
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Dont keep array name as size or any o... | //#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
#define eps 1e-8
//#define eq(x,y) (fabs((x)-(y)) < eps)
using namespace std... |
using namespace std;
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<set>
int aa[210000];
int n,m;
int f(int x,int y)
{
if(x%y)
return x/y+1;
else
return x/y;
}
int main()
{
cin>>n>>m;
if(m==n)
{
cout<<0<<endl;
return 0;
}
if(m==0)
{
cout<<1<<endl;
return 0;
}
aa[0... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define ll long long
#define T() long long t;cin>>t;for(long long o=1;o<=t;o++)
#define INF INT_MAX
#define INFS INT_MIN
#define mod 1000000007
#define FOR(a, b, n) for(int a = b; a < n; a++)
#define REP(a,c, b) for(int a = c; a < b;... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(i,a,b) for(int i = a; i<b ; i++)
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define M 1000000007
int mod(int x){
return ((x%M + M)%M);
}
int add(int a,int b){
return mod(mod(a)+mod(b)... | #include <bits/stdc++.h>
using namespace std;
#define DBG cerr << __LINE__ << ' ' << __FUNCTION__ << endl
#define CLOSE ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mem(t, v) memset ((t) , v, sizeof(t))
#define pb push_back
#define mk make_pair
#define sz(x) (int)(x).size()
#define PI acos(-1.0)
#define I... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
char S[100'100];
int dp[100'100];
int mn[222];
signed main()
{
cin.tie(0)->sync_with_stdio(false);
memset(dp, 0x3F, sizeof dp);
memset(mn, 0x3F, sizeof mn);
dp[0] = 0;
cin>>N;
cin >>(S + 1);
for (int i = 1; i <= N; ++... | #include <bits/stdc++.h>
const int N = 1e5 + 5;
int n; char str[N];
int main() {
scanf("%d%s", &n, str + 1);
if (str[1] != str[n]) puts("1");
else {
for (int i = 1; i < n; i++)
if (str[i] != str[1] && str[i + 1] != str[n]) { puts("2"); return 0; }
puts("-1");
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<... | #include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define in insert
#define ff first
#define ss second
#define int long long
#define rep(i,x,m) for(int i=x;i<m;i++)
#define MOD 1000000007
#define endl "\n"
#define all(v) ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.