code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int a,b,k;
int gcd(int x,int y)
{
if(y==0) return x;
else return gcd(y,x%y);
}
void dfs(int n,int m,int x)
{
if(n==0)
{
while(m--) cout<<'b';
return ;
}
if(m==0)
{
while(n--) cout<<'a';
return ;
}
int q=1,w,ci=n+m-1,hh=1,yue=max(n... |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
//マクロ
#define all(v) v.begin(), v.end()
#define rep(i, n) for (double i = 0; i < (int)(n); i++)
#define BIT(i, n) for (int i = 0; i < (1 << n); i++)
typedef long long ll;
//const ll INF = 10000000010;
int main() {
int N;
vector<double> x(100), y(100)... | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define mod 1000000007
#define ull unsigned long long
#define vll vector<ll>
#define uom unordered_map
#define uo... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,i,x;
ll c=0,d=0,p=0,q=0;
cin>>n;
n=(ll)pow(2,n);
ll a[n];
for(i=0;i<n;i++){
cin>>x;
a[i]=x;
if(i<(n/2)){
if(x>c){
p=i+1;
... | #include <iostream>
#include <algorithm>
#include <string>
#include <complex>
#include <vector>
#include <set>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <numeric> //lcm
#include <iomanip> //double精度 setprecision
#include <chrono>
#include <random>
#include <cassert>
... |
#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;
typedef long long ll;
const int mod=1e9+7;
int n;
char aa,ab,ba,bb;
int main() {
scanf("%d",&n);
scanf(" %c",&aa);
scanf(" %c",&ab);
scanf(" %c",&ba);
scanf(" %c",&bb);
if(n==1 || n==2 || (aa=='A' && bb=='B') || (aa=='A' && ab=='A') || (ab=='B' && bb=='B')) {
print... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair <int, int>;
using pll = pair <ll, ll>;
#define FIO() ios_base::sync_with_stdio(0);cin.tie(NULL);
const ll inf = 9e18;
int main() {
FIO();
string atc = "atcoder";
int tc; cin >> tc;
while (tc--) {
string s... | #include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
s... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<int> X(M), Y(M), Z(M);
for (int i = 0; i < M; i++){
cin >> X[i] >> Y[i] >> Z[i];
}
vector<long long> dp(1 << N, 0);
dp[0] = 1;
for (int i = 0; i < (1 << N); i++){
int c = __builtin_popcount(i);
for (int... |
//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... | #include<bits/stdc++.h>
#define rep(i,a,b) for(ll i=(a);i<=(b);i++)
#define per(i,a,b) for(ll i=(a);i>=(b);i--)
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define Max(a,b) (a>b?a:b)
#define Min(a,b) (a<b?a:b)
#define next Cry_For_theMoon
#define il inline
#define pb(x) push_back(x)
#define ma... |
#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<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
struct Ed... |
#include <bits/stdc++.h>
#define E (edges[i])
using namespace std;
const int MAXN = 1e5 + 10;
struct Edge{ int to, next; } edges[MAXN << 1]; int head[MAXN], ecnt = 0;
void add_edge(int x, int y) { ecnt++; edges[ecnt].to = y, edges[ecnt].next = head[x]; head[x] = ecnt; }
int n, col[MAXN]; bool m[MAXN];
priority_que... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
vector<int>c;
vector<vector<int>>to;
vector<int>cnt;
vector<int>ans;
void dfs(int v, int p = -1) {//デフォルト引数-1
if (cnt[c[v]] == 0) ans.push_back(v+1);
cnt[c[v]]++;
for (int u : to[v]) {
if (u == p) continue;//親を探索対象にしないようにする
dfs(... |
#include <iostream>
#include <string>
using namespace std;
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#define MOD1 1000000007
#define MOD2 998244353
#define LIMIT1 200010
#define LIMI... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace __gnu_pbds;
using namespace std;
using ld = long double;
using ll = long long;
using indexed_set = tree<int, null_type, greater<int>, rb... |
#include <bits/stdc++.h>
#define INF 1000000007
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef long double ld;
typedef vector<int> vi;
typedef unordered_map<int,i... | #include<bits/stdc++.h>
using namespace std;
const int maxn=6010,mod=998244353;
int dp[maxn][maxn];
int n,K;
int main(){
cin>>n>>K;
dp[0][0]=1;
for(int i=1;i<=n;++i)
for(int j=i;j>0;--j){
dp[i][j]=(dp[i-1][j-1]+dp[i][2*j])%mod;
}
printf("%d\n",dp[n][K]);
} |
#include <math.h>
#include <iostream>
#include <string>
#include <iomanip>
#include <algorithm>
#include <tuple>
#include <vector>
#include <cmath>
#include<set>
#include <sstream>
#include <bitset>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()//配列を全部参照
using namespace std;... | #include<bits/stdc++.h>
#define int long long
#define vll vector<long long>
#define forn(i,n) for(int i=0;i<n;i++)
#define rforn(i,n) for(int i=n-1;i>=0;i--)
#define rep(i,s,n) for(int i=s;i<n;i++)
#define sa(v) sort(v.begin(), v.end())
#define sd(v) sort(v.begin(),v.end(), greater<int>())
#define ff first
#define ss s... |
#include <iostream>
typedef long long ll;
using namespace std;
int main()
{
int n,s,d,i;
cin>>n>>s>>d;
int f=0;
for(i=1;i<=n;i++)
{
int x,y;
cin>>x>>y;
if(!(x>=s||y<=d))
f=1;
}
if(f)
cout<<"Yes";
else
cout<<"No";
return 0;
}
| #include <bits/stdc++.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++)
#define _GLIBCXX_DEBUG
int tasty[4];
int main(){
for(int i=0; i<4; i++) cin >> tasty[i];
for(int bit = 1; bit < (1<<4); bit++){
int x=0, y=0;... |
#include <bits/stdc++.h>
using namespace std;
#define rep(dsa,kajo) for (int dsa = 0; dsa < (kajo); ++dsa)
using ll = long long;
using P = pair<int,int>;
void chmin(int& w, int z){w = min(w,z);}
void chmax(int& w, int z){w = max(w,z);}
int main() {
int kajo;
cin >> kajo;
vector<ll> a(410,0);
rep(dsa,kajo) {
... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <map> //http://vivi.dyndns.org/tech/cpp/map.html
#include <set> //http://vivi.dyndns.org/tech/cpp/set.html
#include <vector>
#include <deque>
#include <queue>
#include <numeric> //gcd,lcm c++17
#include <tuple>
#include <iomanip> //set... |
#line 1 "main.cpp"
/**
* @title Template
*/
#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"
#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/ot... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define ff(i,n) for(i=0;i<n;i++)
#define pb push_back
#define mp make_pair
int main() {
ll t;
t = 1;
while(t--){
ll i,j,n,m,t;
cin>>n>>m>>t;
ll charge = n;
ll prev = 0;
string an... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define vi vector<int>
#define vvi vector<vector<int>>
#define pb push_back
#define pii pair<ll,ll>
#define tii tuple<ll,ll,ll>
#define all(v) (v).begin(),(v).end()
#define ll long long
#define ull unsigned long long
... | #include <bits/stdc++.h>
using namespace std;
#define M1 1000000007
#define M3 1000000009
#define M2 998244353
#define ll long long
#define ld long double
#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
#def... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int A = 0, B = 0, result = 0;
int C1, C2, C3, C4;
cin >> S;
for (int i = 0; i < 10; i++) {
if (S[i] == 'o') {
A++;
} else if (S[i] == '?') {
B++;
}
}
C1 = 1;
C2 = 14;
C3 = 36;
C4 = 24;
if (A == 0) {... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
const int M = 1e9 + 7;
ll mod(ll x) { return (x % M + M) % M; }
ll mul(ll a, ll b) { return mod((mod(a) * mod(b))); }
ll add(ll a, ll b) { return mod(mod(a) + mod(b)); }
void solve() {
string s;
cin >> s;
int ok = 0;
int ... |
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz(a) int(a.size())
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) { out << "(" << a.first << "," << a.second << ")"; return out; }
template <typename T, size_t N> ostream& operator <<(ostream& out, con... |
#include <bits/stdc++.h>
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 *max_elemen... | #include<bits/stdc++.h>
#define LL long long
#define DB double
#define pb push_back
#define mkp make_pair
#define LB lower_bound
#define UB upper_bound
#define rint register int
#define MS(x,y) memset(x,y,sizeof(x))
#define rep(i,a,b) for(rint i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(rint i=a,i##end=b;i>=i##... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
string a = "atcoder";
signed main() {
int number_of_testcases;... | #include<bits/stdc++.h>
#define endl '\n'
using namespace std;
string s;
int solve(){
if(s>"atcoder")return 0;
int id = -1;
for(int i=0;i<s.size();++i){
if(s[i]!='a'){
id = i;
break;
}
}
if(id==-1)return id;
if(s[id]>'t')return id - 1;
return id;
}
int... |
#include <bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define pb push_back
#define si second
#define int long long
#define mod 998244353 //1000000007
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define double long double
#define all(o) o.begin(),o.end()
using namespace s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vec... |
#include<bits/stdc++.h>
using namespace std ;
#define int long long int
signed main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n; cin >> n;
int x, cnt = 0;
for(int i = 1; i < 1e7; i++){
x = i * pow(10, to_string(i).size()) + i;
if(x > n) break;
cnt++;
}
cout ... | #include <iostream>
#include <string>
long long kaijou_ten(int sisuu) {
long long ret = 1;
for ( int i = 0; i < sisuu; ++i ) {
ret *= 10;
}
return ret;
}
int main() {
std::string str;
std::cin >> str;
long long n = str.size();
//std::cout << n << std::endl;
long long ... |
#include<bits/stdc++.h>
#define all(k) k.begin(),k.end()
#define INF 1e9
#define repk(i,a, n) for(int i=a;i<=n;i++)
#define rep(i,a, n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define ll long long
#define ull unsigned long long... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,x,a;
cin>>n>>x;
for(int i=0;i<n;i++)
{
cin>>a;
if(a!=x)
{
cout<<a<<" ";
}
}
return 0;
} |
#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... | /*
* Author - Abhas Jain
* Code is inside the solve function
*/
#include <bits/stdc++.h>
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define endl '\n'
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rang(chrono::high_resolution_clock::now()... |
#include <stdio.h>
#include <iostream>
#include <cmath>
#include <iomanip>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <list>
#include <set>
#include <ctime>
#include <queue>
#include <cstring>
#include <bitset>
... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
#define DEBUG
#ifdef DEBUG
templ... |
#include <iostream>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <utility>
#include <random>
#include <chrono>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int N;
cin >> N;
int ans = N;
while(true){
++ans;
if(ans % 100 == 0) break;
}
cout << ans-N << endl;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <time.h>
#include <queue>
#include <stdarg.h>
#include <map>
#include <vector>
#include <algorithm>
#include <stack>
#include <iostream>
#include <numeric>
#include <set>
#define ll long long
u... | #include <bits/stdc++.h>
#define rei register int
using namespace std;
int main(){
int n,m;
int ans=0;
scanf("%d%d",&n,&m);
for(rei i=1;i<=n;++i){
char tmp[22];
int tmpn=0;
scanf("%s",tmp);
for(rei j=0;j<m;++j)
if(tmp[j]-'0') tmpn++;
if(tmpn%2) ans++;... |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <unistd.h>
#include <stdlib.h>
#include <cassert>
using namespace std;
// using namespace atcoder;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef... | #include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPP(i, n) for(int i = 1; i <= n;... |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
// Input
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define in4(a,b,c,d) scanf("%d%d%d%d"... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
... |
#include<bits/stdc++.h>
#define int long long
#define ld long double
#define all(X) (X).begin(), (X).end()
#define reset(X) memset(X, 0, sizeof(X))
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define endl '\n'
#define ff first
#define ss second
using namespace std;
const int mod=1e9+7;
// const int mod=99... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <string.h>
#include <map>
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++)
#define all(A) A.begin(... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,mod;
ll qpow(ll a,ll n){
ll res=1;
while(n){
if(n&1)res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
mo... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
typedef long long ll;
#define FOR(i, a, b) for(int i=(a); i<(b);i++)
#define REP(i, n) for(int i=0; i<(n);i++)
#define ROF(i, a, b) for(int i=(b-1); i>=(a);i--)
#define PER(i, n) for(int i=n-... |
#include<iostream>
#include<utility>
#include<algorithm>
#include<set>
#include<vector>
#include<cmath>
#define forn(i, x, n) for(int i = x; i < n; i++)
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const bool DEBUG = 0;
void solve(){
int n;
cin>>n;
int a[n];
forn(i, 0, n) cin>>a[... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define endl "\n"
#define fi first
#define se second
#define Alkborough ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
const ll MOD = 1e9 + 7;
const ll INF = 2e18;
const ll MAX = 5e4 + 3;
int ... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
#include<vector>
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)... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
#define sf(x) scanf("%d",&x)
#define sfl(x) scanf("%lld",&x)
#define lli long long int
#define ll64 int64_t
#define pb push_back
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define frr(i,a) for(int i=0;i<a;i++)
#define... |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return ... | #include <iostream>
using namespace std;
int main()
{
int n,k,m,zbir=0;
cin>>n>>k>>m;
int a[n];
for(int i=0;i<n-1;i++) {
cin>>a[i];
zbir+=a[i];
}
int average=m*n;
int rezultat=average-zbir;
if(rezultat<0) {
cout<<"0";
rezultat=2000000;
}
if(rezul... |
//Bulbul khan-420...
#include <bits/stdc++.h>
#include <cstring>
#define ll long long int
#define pb() push_back()
#define f(i,n) for(i=0;i<n;i++)
using namespace std;
int main()
{
ll t,a,b,c,d,i,j,k,l,n,m,x,y,z;
cin>>n>>k;
l=0;
map<ll,ll>h;
ll s[n+6];
m=0;
for(i=0;i<n;i+... | #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.at(i) >> b.at(i);
}
double grad = 0;
int ans = 0;
for (int i = 0; i <= N-2; i++) {
for (int j = N - 1; j > i; j--) {
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
template <class T>
bool chmax(T& a, const T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T& a, const T b) {
if (b < a) {
... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<math.h>
#include<iostream>
#include<cmath>
#include<queue>
#include<vector>
#define IOS ios::sync_with_stdio(false);cin.tie();cout.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pll;
c... | // author: Halit
#include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int& el : a) {
std::cin >> el;
}
constexpr double eps = 0.0000001;
auto check = [&](double x) {
long double compute = 0;
for (int a_i : a) {
compute += x + a_i - std::min(double(a_... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
ll power(ll N,ll P)
{
if(N == 0)
return(0);
ll res = 1;
while(P)
{
if(P%2)
res = (res * N) % MOD;
P = P/2;
N = (N * N) % MOD;
}
return(res);
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXSIZE = 1e3+5;
#define PI 3.1415927
double ans[MAXSIZE][MAXSIZE];
typedef struct Point {
int x, y;
} point;
int main() {
int N;
cin>>N;
int cnt = 0;
Point point[MAXSIZE];
for(int i = 0; i < N; i++) {
cin>>point[i].x>>point[i].y;
... |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000 //1e4
#define base10_5 100000 //1e5
#define base10_6 1000000 //1e... |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define X first
#define Y second
#define nl '\n'
#define AC return 0
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#de... | #include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
long long mod_pow(long long x,long long y){//x^yを返す//計算量は0(log(y))
long long tmp=x,res=1;
while(y){
if(y%2){res=res*tmp%MOD;}
y>>=1;
tmp=tmp*tmp%MOD;
}
return res;
}
int main(){
#define int long long
int H,W;
cin>>H>... |
#include <bits/stdc++.h>
using i64 = int64_t;
using u64 = uint64_t;
using u32 = uint32_t;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n;
std::cin >> n;
std::vector<std::vector<int>> e(n);
for (int i = 0; i < n - 1; i++) {
int u, v;
std::cin >> u >> v... | #include<bits/stdc++.h>
using namespace std;
#define Mod(x) (x>=P)&&(x-=P)
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(int i=hd[a];i;i=nxt[i])
typedef long long ll;
void Max(int &x,int y){(x<y)&&(x=y);}
void Min(int &x,int y){(x>... |
#include<bits/stdc++.h>
#define rep(i,a) for(int (i)=0; (i)<(a); (i)++)
#define rep2(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define m0(x) memset(x,0,sizeof(x))
#define chmax(a,b) if(b>a) a = b
#define chmin(a,b) if(b<a) a = b
typedef long long ll;
using namespac... | //a.9
#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define CASE(t) cout<<"Case #"<<(t)<<": ";
#define endll endl
#define endl '\n'
#define INF 1e18
#define deb(x) cout << "[" << (#x) << "=" << x << "]" << '\n'
#define deb2(x,y) cout << "[" << (#x) << ... |
#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <math.h>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
ull gcd (ull a, ull b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ull lcm (ull a, ull b){
// バ... | #include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
#include <math.h>
using namespace std;
#define nl <<endl
#define cy cout<<"Yes" nl
#define cn cout<<"No" nl
#define co(x) cout<<x nl
#define lp(i,a,b) for(i=a;i<b;i++)
#define lpe(i,a,b) for(i=a;i<=b;i++)
int main() {
int i;
unsigne... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
int counter = 0;
for(int i=0;i<9;i++)
{
if(S.at(i)=='Z')
{
if(S.at(i+1) == 'O')
{
if(S.at(i+2) == 'N')
{
if(S.at(i+3) == 'e') co... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n=0,ans=0;
while(s.find("ZONe",n)!=string::npos){
n=s.find("ZONe",n)+4;
ans++;
}
cout << ans << endl;
} |
#include<iostream>
#include<algorithm>
#include<map>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<vector>
#include<set>
#define ll long long
#define pb push_back
#define forn(i,x,n) for(int i=x;i<=n;++i)
#define forr(i,x,n) for(int i=n;i>=x;--i)
#define lson (rt<< 1)
#define rson (rt<< 1 ... | #include <bits/stdc++.h>
#define No return puts("-1"), 0
using namespace std;
typedef long long i64;
const int N = 2e5+10;
int n, m, a[N], b[N], c[N], to[N], bt[N];
vector<int> da[N], db[N];
void add(int x, int v=1) { for(; x <= n; x += x&-x) bt[x] += v; }
int ask(int x) { int y = 0; for(; x; x -= x&-x) y += bt[x]; re... |
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... | #include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
using namespace std;
int n,m,e[2005][2005],Dis[2005][2005],vis[2005],dis[2005];
vector <pii > g[2005];
const int inf=0x3f3f3f3f;
void dij(int x)
{
memset(vis,0,sizeof(vis));
memset(dis,0x3f,sizeof(dis));
dis[x]... |
// ╔═══╗░░╔═══╗░░╔╗░╔╗╔═══╗╔═══╗╔╗░╔╗░
// ║╔═╗║░░║╔══╝░░║║░║║║╔═╗║║╔═╗║║║░║║░
// ║║░║║░░║╚══╗░░║╚═╝║║╚═╝║╚╝╔╝║║╚═╝║░
// ║╚═╝║░░║╔══╝░░║╔═╗║║╔═╗║╔═╝╔╝╚══╗║░
// ║╔═╗║╔╗║╚══╗╔╗║║░║║║╚═╝║║║╚═╗░░░║║░
// ╚╝░╚╝╚╝╚═══╝╚╝╚╝░╚╝╚═══╝╚═══╝░░░╚╝░
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define l... | #include <bits/stdc++.h>
using namespace std;
int A[200005], P[200005], F[200005];
vector<int> X;
int main()
{
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int n;
cin >> n;
for (int i=1; i<=n; i++) {
cin >> A[i];
P[ A[i] ] = i;
}
for (int i=n; i>=1... |
#include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define p... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
typedef long long ll;
template<typename T> inline void read(T &x) {
x = 0; char c = getchar(); bool flag = false;
while (!isdigit(c)) { if (c == '-') flag = true; c = getchar(); }
while (isdigit(c)) x = x * 10 + (c ^ 48),... |
#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 int
#define ld long double
#define ll long long
#define INF 1000000000000000000
#define pb ... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <tuple>
using namespace std;
#define INFL 100000000000000000
int main() {
int n;
cin >> n;
int ans = 1;
while(2*n > (ans+1)*ans) ans++;
cout << ans << endl;
retu... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
long double pi = 2 * acos(0.0);
const ll mod = 998244353;
void solve() {
ll x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
ld x = (x2 - x1) * y1 * 1.0;
x = (ld)x / (y2 + y1);
cout << fixed << setprecision(10) <... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int b = 7;
int n;
string s, x;
cin >> n >> s >> x;
vector<vector<int>> g(n, vector<int>(b)), h(n, vector<int>(b));
for (int i = 0; i < n; i++) {
for (int j = 0; j < b; j++) {
g[i][j]... |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#in... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... |
# include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll n,q;
cin>>n>>q;
ll arr[n];
for(ll i=0;i<n;i++) cin>>arr[i];
sort(arr,arr+n);
vector <ll> total_elements(n,0);
total_elements[0]=arr[0]-1;
ll sum = total_elements[0];
for(ll i=1;i<n;i++){
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n , q;
cin >> n >> q;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
while (q--) {
long long k;
cin >> k;
long long ok = (long long)(2e18);
long long ng = 0;
while (... |
#include <iostream>
using namespace std;
void countPair(long long int arr[], long int n, int k)
{
long int cnt = 0;
for (long int i = 0; i < n; i++) {
arr[i] = (arr[i] + k) % k;
}
long long int hash[k] = { 0 };
for (long int i = 0; i < n; i++) {
hash[arr[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
#define F first
#define S second
#define sz(x) (int)x.size()
#define db(x) cout << #x << ": " << x << "\n";
bool mycomp (pair<ll,ll> a, pair<ll,ll> b) {
return a.F * 2 + ... |
#include <iostream>
using namespace std;
int main() {
int n,k;
cin>>n>>k;
cout<<(k*(k+1)/2)*n+k*100*n*(n+1)/2;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=k;j++){
cnt+=(i*100+j);
}
}
cout<<cnt;
return 0;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //Policy Based Data Structure
using namespace __gnu_pbds; //Policy Based Data Structure
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; //Policy Based Data Structure
#define p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n){
cin >> a[i];
}
ll ans=0;
/*
rep(i,n){
for(ll j=i;j<n;j++){
ll minimum=a[i];
for(ll k=i;k<=j;k++){
mini... |
#include <bits/stdc++.h>
using namespace std;
int read(){
int sum=0,f=1;
char s=getchar();
while (s<'0' or s>'9'){
if (s=='-')f=-1;
s=getchar();
}
while (s>='0' and s<='9'){
sum=sum*10+s-'0';
s=getchar();
}
return sum*f;
}
stack<char>s;
int main(){
int n=read();
string s1;
cin>>s1;
int ans=n;
for (i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
string s; cin >> s;
vector<char>v;
for(ll i = 0; i < n; i++) {
v.push_back(s[i]);
if(v.size() >= 3) {
if(v[v.size() - 1] == 'x' && v[v.size() - 2] == 'o' && v[v.size() - 3] == 'f')... |
#include <bits/stdc++.h>
#define ms(a,b) memset(a, b, sizeof(a))
#define rep(a,b,c) for(int a = (int)(b); a < (int)(c); a++)
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define m_p(a,b) make_pair(a, b)
#define lson l,mid,o << 1
#define rson mid + 1,r,o << 1 | 1
#define ls o << 1
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) ... |
#include <stdint.h>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);//cout.precision(dbl::max_digits10);
#define pb(x) push_back(x)
#define mod 1000000007ll //998244353ll
#define vi vector<int>
#define v... | #include<bits/stdc++.h>
using namespace std;
long long a,b,c,d[100001],v[100001],an[100001];
struct p
{
long long q,w;
}m[100001];
bool cmp(p qq,p ww)
{
return qq.q<ww.q;
}
int main()
{
scanf("%lld%lld",&a,&b);
for(int i=1;i<=a;i++)
{
scanf("%lld",&d[i]);
}
d[a+1]=2000000000000000000;
for(int i=1;i<=b;i++)
{... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <math.h>
#include <fstream>
#include <complex>
#include <functional>
using namespace std;
#define rep(i, x) for (int i = 0; ... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<fixed<<setprecision(15)<<h;print0(t...);}
void print(){print0("\n");}; template<... |
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define MAXN 1000005
#define INF 100000000000000000... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define PRECISION cout << fixed << setprecision(20);
using namespace std;
void solve() {
int n;
cin >> n;
string s;
string x;
cin >> s >> x;
... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define MAX_HEIGHT 10000
#define MAX_WIDTH 10000
struct Ad {
int x, y, r;
int a, b, c, d, area;
Ad(int x, int y, int r) : x(x), y(y), r(r) {
a = x;
b = y;
c = x + 1;
d = y + 1;
area = 1; // (c - a) * (d - b)
}
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) v.begin(), v.end()
template<class T>bool chmax(T& a, const T& b) { if (a<b) { a=b; return 1;} return 0;}
template<class T>bool chmin(T& a, const T& b) { if (b<a)... |
#include <bits/stdc++.h>
using namespace std;
#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 FOR(i, n, m) for (int i=(n); i<=(int)(m); i++)
#define ll long long
const ll INF=1LL<<60;
const double pi=3.1415926535;
int main() {
vector<vector<int>> dp(900, v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl '\n'
#define SZ(x) ll(x.size())
const ll MAXN = 1e6 + 10;
const... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bo... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main()
{
int n, ans = 0;
cin >> n;
vector<int> p(n), s(20... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i=x;i<=n;++i)
typedef pair<int,int> pii;
#define x first
#define y second
const int N=3,_N=2e5+7;
struct mat
{
ll m[N][N];
};
pii a[_N];
mat op[_N];
mat mul(mat A,mat B,int len)
{
mat c;memset(c.m,0,sizeof c.m);
... | #include<bits/stdc++.h>
using namespace std;
#define light ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define pb push_back
#define cases() ll t;cin>>t;while(t--)
#define all(c) c.begin(),c.end()
#define PI 3.14159265358979323846
const ll MAX = 2e5+5;
const ll INF = 1e18;
const l... |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define ll long long
#define rep(i,a,n) for(ll i=a;i<=n;i++)
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll N;
cin>>N;
vector<ll>v;
rep(i,1,sqrt(N))
{
if(N%i==0)
{
if(N/i==i)
v.push_back(i);
else
... | #include <iostream>
#include<bits/stdc++.h>
#include<vector>
#define fo(i,n) for(long long i=0;i<n;i++)
#define ll long long int
#define inf 999999999999999999
#define pb push_back
#define fi first
#define se second
#define vi vector<ll>
#define vii vector<vector<ll>>
#define pi pair<ll,ll>
#define mp make_pair
#define... |
#include<iostream>
using namespace std;
using ll = long long;
ll sum_comb(ll n) {
if (n <= 2) return 0;
return (n - 1) * (n - 2) / 2;
}
ll sum_comb2(ll n, ll N) {
return (sum_comb(n) - sum_comb(n - 3 * N)) - 3 * (sum_comb(n - N) - sum_comb(n - 2 * N));
}
int main() {
int N; ll K;
cin >> N >> K;
ll cnt = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i,a,n) for(int i=a;i<n;++i)
#define eFOR(i,a,n) for(int i=a;i<=n;++i)
constexpr int INF = 1000000000;
int main() {
ll n, k; cin >> n >> k;
VL cnt2(n * 2 + 1);
eFOR(i, 1, n) {
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_N = 200005;
const ll MOD = 1e9+7;
//int eo[64][MAX_N];
bool vis[64][MAX_N];
map<P, ll> mp;
struct edge
{
int to;
ll cost;
};
vector<edge> G[MAX_N];
int cntEO[2] = {0... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define pow(n,m) powl(n,m)
#define sqrt(n) sqrtl(n)
const ll MAX = 5000000000000000000;
const ll MOD = 1000000007;
//998244353;
void randinit(){srand((unsigned)time(NULL));}
ll modpow(ll A,ll B,ll M){
ll r = 1,p = A;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
const int mod = 1e9+7;
template< int mod >
struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}... | #include<bits/stdc++.h>
#define fl(i,a,n) for(int i=a;i<=n;i++)
#define pb push_back
#define int long long int
#define ump unordered_map
#define pii pair<int,int>
#define ff first
#define ss second
#define PI 3.1415926535898
#define i... |
//#include <atcoder/all>
#include <bits/stdc++.h>
#include <cassert>
#include <numeric>
using namespace std;
//using namespace atcoder;
typedef long long LONG;
const int MOD = 1000000007;
int gcd(int x, int y) {
if (x % y == 0) {
return y;
}
else {
return gcd(y, x % y);
//x%y==0でないときはユーグリットの互除法を使って再帰的に関数を呼... | #include <algorithm>
#include <iostream>
#include <vector>
#include <string.h>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b)... |
#include <bits/stdc++.h>
/* #include <atcoder/lazysegtree> */
using namespace std;
/* using namespace atcoder; */
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vint = vector<int>;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (lo... | /*
Author: Alam Khan
AUST CSE 40th Batch
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef tree<ll,null_type,less_equal<ll>,r... |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int mod=1000000007;
char str[200010];
LL ans,f[200010][20];
int Len,K,cnt[20],app,tran[123];
int main()
{
scanf("%s%d",str+1,&K);
Len=strlen(str+1);
tran['0']=0;tran['1']=1;tran['2']=2;tran['3']=3;
tran['4']=4;tran['5']=5;tran['6']=6;tran['7']=... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int prime[N], mu[N], cnt;
bool st[N];
void init() {
mu[1] = 1;
for (int i = 2; i < N; i++) {
if (!st[i]) {
prime[++cnt] = i;
mu[i] = -1;
}
for (int j = 1; j <= cnt && 1ll * i * prime[j] < N; j++) {
st[i * prime[... |
#include<bits/stdc++.h>
using ll = long long int;
using namespace std;
#define sync ios_base::sync_with_stdio(false); cin.tie(NULL)
using ld = long double;
#define input(arr,n) for(ll i1=0;i1<n;i1++ )cin>>arr[i1]
#define mod 1000000007
#define F first
#define S second
#include <ext/pb_ds/assoc_container.hpp>
#include... | #include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ve... |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
#define STRINGIFY(n) #n
#define TOSTRING(n) STRINGIFY(n)
#define PREFIX "#" TOSTRING(__LINE__) "| "
#define debug(x) \
{ \
std::cout << PREFIX << #x << " = " << x... | #pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
struct node{
int x, y;
bool isLine;
node() {}
node(int x, int y) : x(x), y(y), isLine(false) {}
node(int y) : x(0), y(y), isLine(true) {}
};
double dist(node n1, node n2){
if (n1.isLine || n2.isL... |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define repr(i, n, s) for (int i = (int)n... |
//#define local
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define rep(i,n); for(long long i = 0;i < (n);i++)
using ll = long long;
using P = pair<long long,long long>;
template <class T> using vec = vector<T>;
#ifdef local
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main(){
... | #include<bits/stdc++.h>
#define int long long
#define pb push_back
#define INF 0x3f3f3f3f
#define f first
#define s second
#define pii pair<int, int>
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define mem(x, a) memset(x, a, sizeof(x))
#define loli ios_base::sync_with_stdio(0), cin.tie(0)
using namespace s... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
//#define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 100 - (n % 100) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define for0(i, n) for (int i = 0; i < (int)(n); i++)
#define for1(i, n) for (int i = 1; i <= (int)(n); i++)
#define forc(i, l, r) for (int i = (int)(l); i <= (int)(r); ++i)
#define forr0(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define forr1(i, n) for (int i = (int)(... | // author : sharad12arse
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define INF LONG_LONG_MAX
#define gcd __gcd
void solve(){
ll n,w;
cin>>n>>w;
cout<<n/w<<"\n";
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
long t=1;
//cin>>t;
while(t--)
sol... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
template<class T> using V = vector<T>;
template<typename T> using posteriority_queue = priority_queue<T,vector<T>,greater<T>>;
#define rep(i,n) for (int i = 0; i < (int)(n) ; i++)
#define rep2(i,a,b) for... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dbg.h"
#else
#define out(...)
#endif
void solve () {
int n;
string s, t;
cin >> n >> s >> t;
vector<int> idxs, idxt;
for (int i = 0; i < n; ++i) {
if (s[i] == '0') idxs.push_back (i);
if (t[i] == '0') idxt.pu... |
#include <iostream>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
struct Modint {
ll val;
Modint (ll _val = 0)
: val(_val % MOD) {}
Modint operator+ (Modint other) const {
return Modint(val + other.val);
}
void operator+= (Modint other) {
val += other.val;
val %... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <deque>
#include <bitset>
#include <climits>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
#include <cmath>
#define ll long long
#define mod 10... |
#include <bits/stdc++.h>
#include <unordered_set>
#include <algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i,n) fo... | #include <bits/stdc++.h>
using namespace std;
int32_t main()
{
int t = 1;
while(t--)
{
int n, ans;
cin>>n;
for( int i = 1; i < 1e5; i++ )
{
n -= i;
if( n <= 0 )
{
ans = i;
break;
}
}
... |
#include<bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
#define ll long long int
#define ld double
#define pb push_back
#define eb emplace_back
#define rep(i , j , n) for(ll i = j ; i < n ; i++)
#define pre(i , j , n) for(ll i = j ; i >= n ; i--)
#define all(x) x.begin(), x.end()
typedef pair<int, ... | #include <cstdio>
#include <algorithm>
typedef long long ll;
const int N = 200005;
int n, m, q;
ll x[N], y[N];
struct Option
{
int ty;
ll p;
}op[N];
struct Query
{
int a, b, id;
}p[N];
int np;
inline bool cmp(Query a, Query b)
{
return a.a < b.a;
}
ll ansx[N], ansy[N];
ll flx, flxa, fly, flya, rot;
void get(ll x, l... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define STRING(str) #str
#define ll long long
#define ld long double
template <typename T>
void print(T x, string name) {
cout << name+": " << x << endl;
}
template <typ... | #include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const int mod=998244353;
const int mex=5002;
#define ll long long
#define test int t;cin>>t;while(t--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,n) for(int i=a;i<n;i++)
#define rfo(i,a,b) for(int i=a;i>=b;i--)... |
#include <bits/stdc++.h>
#define F first
#define S second
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define per(i, a, b) for(int i = (b)-1; i >= (a); --i)
#define bck(i, a, b) if ((i) >= (a) && (i) < (b))
#define trav(x, a) for (auto &x : (a))
#define sz(a) (int)(a).size()
#define all(x) (x).begin(), (x).end(... | #include<bits/stdc++.h>
#define ll long long
#define mod 998244353
using namespace std;
int n,m;
int mul[5009][5009];
int sm[5009][5009];
void init()
{
for(int i=0;i<=m;i++)
{
mul[i][0]=1;
for(int j=1;j<=n;j++)
{
mul[i][j]=(ll)mul[i][j-1]*i%mod;
// printf("i:%d j:%d mul:%d\n",i,j,mul[i][j]);
}
}
memcp... |
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
// #include "atcoder/all"
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return tr... | #include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <climits>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <bits/stdc++.h>
using namespace std;
#define lson 2*i
#def... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ff first
//#define ss second
#define ll long long int
#define PB push_back
#define MP make_pair
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int x0, y0, xhalf, yhalf;
cin >> n >> x0 >> y0 >> xhalf >> yhalf;
double cx = (xhalf + x0) / 2.0, cy = (yhalf + y0) / 2.0;
double rad = 2 * M_PI / (double)n;
double ansx = cos(rad) * x0 - sin(rad) * y0 + cx - cx * cos(rad) + cy * sin(rad);
... |
#include<bits/stdc++.h>
#define int long long
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define puts(x) cout << (x) << "\n"
using namespace std;
set<int>s; map<int, int>m; int n, CK, a[234567], b[234567], c[234567], dp[456789];
signed main() {
cin >> n >> CK;
for1(i, n) {
cin >> a[i] >> b[i] >> c[i];
s.inse... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef ve... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
int main(){
int n;
cin >> n;
ll a[n];
rep(i,n) cin >> a[i];
sort(a,a+n);
unordered_map<ll,ll> mp;
rep(i,n) {
for(ll x = 1; x*x <= a[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define Sort(a) sort(a.begin(),s.end())
int main(){
int n;
int m=5;
cin >> n;
vector<vector<int>> s(n,vector<int>(m));
rep(i,n)rep(j,m) cin >> s[i][j];
int l=0; int r=10010010... |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <set>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (int i = l; i < r; i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin>>x;
x%2?printf("Black"):printf("White");
} |
/***
Description: Simulation
* author: Diego Briaares
* date: 24.01.2021 18:11:37
***/
#include <bits/stdc++.h>
using namespace std;
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
string a, b;
cin >> a >> b;
int sa = 0, sb = 0;
for (int i = 0; i < a.size(); i++) {
sa += a[i] - ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// to read the input from file
// freopen("cpp_input.txt", "r", stdin);
int num1, num2, rem1, rem2, sum1 = 0, sum2 = 0;
cin >> num1 >> num2;
while (num1 > 0 and num2 > 0)
{
rem1 = nu... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
unsigned long long n;
cin >> n;
unsigned long long sa = 3, sb = 5, a, b;
for(a = 1;sa <= n;a++){
sb = 5;
for(b = 1;sb <= n;b++){
if(sa == n - sb){
cout << a << " " << b;
... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i = int(l); i < int(r); i+... |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
const ll MODA=998244353;
ll vx[4]={0,1,0,-1};
ll vy[4]={1,0,-1,0};
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
whi... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i, n) for(int i = 0, i##_len=(n); i < i##_len; ++i)
#define per(i, n) for(int i = (n)-1; i >= 0 ; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((int)(x).si... |
#include <bits/stdc++.h>
using namespace std;
int fa[200005];
int a[200005];
int rk[200005];
int vis[200005];
map<int,int> s[200005];
int finds(int x)
{
if(fa[x]==x)
{
return x;
}
else
{
return fa[x]=finds(fa[x]);
}
}
void join(int u,int v)
{
int fu=finds(u);
int fv=finds(v);
if(fu!=fv)
{
if(rk[fu]<rk[... | //伟大的导师，伟大的领袖，伟大的统帅，伟大的舵手
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
char __buf[1<<20],*__p1,*__p2;
//#define getchar() (__p1==__p2?(__p2=__buf+fread(__p1... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
int main()
{
double n, D, H;
cin >> n >> D >> H;
double mx = 0.0;
while (n--)
{
int d, h;
cin >> d >> h;
double temp = H - ((H - h) / (D - d)) * D;
mx = max(mx, temp);
}
... | #define _GIBCXX_DEBUG
#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()
using namespace std;
using ll = long long;
int main(void) {
int N, S, D;
cin >> N >> S >> D;
bool ok = false;
rep(i, N) {
int x, y;
cin ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define REP(i, n) for(ll i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
const long long MOD = 10... | #include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define f(x, m) for(auto x : m)
#define cpu() ios::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#d... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <cmath>
using ll=long long;
using namespace std;
const int mod = 1000000007;
//const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint ... |
/*----- || Hare Krishna || -----*/
/* "WHY DO WE FALL, BRUCE?" */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define ll long long
#define endl '\n'
#define precision(n) fixed<< showpoint << setprecision(n)
#define elif else if
#define pb push_back
#define pf push_fr... | #include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(),a.end()
#define SET(a,b) memset(a,b,sizeof(a))
#define off ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef pair<int,int> II;
typ... |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Rep(i,n) for(ll i=0; i<int(n); ++i)
#define read(v) for (auto &it : v) cin >> it;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sz(s) s.size()
#define ff ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;
typedef long long LL;
signed main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
double a, b, c, d;
cin >> a >> b >> c >> d;
if (a > c) {
swap(a, c);
swap(b, d);
}
cout << fixed << ... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s sec... |
#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;
const int maxn = 1e5 + 2;
int subtree[maxn];
vector < int > adj[maxn];
int dfs(int v,int p){
int ans = 1;
subtree[v] = 1;
if(adj[v].size() == 1 and p)
return 1;
vector < int > odd_maxcoins,even_maxcoins;
for(auto child : adj[v]){
if(child == p)
co... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.