code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#def... |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
//const lint MOD =1000000007;
const lint ... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int A,B,follow;
cin>>A>>B;
follow=2*A+100;
cout<< follow - B<<"\n";
} |
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int h = ri();
int w = ri();
int x = ri() - 1;
int y = ri() - 1;
std::string s[h];
for (auto &i : s) std::cin >> i;
int cnt = -3;
for (int i = x; i < h && s[i][y] != '#'; i++) cnt++;
for (int i = x; i >= 0 && s[i][y] != '#... | #define ALL(x) (x).begin(), (x).end()
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}... |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
vector<vector<int>> G(N);
vector<bool> vis(N);
void dfs(int u) {
vis[u] = true;
for (int v : G[u]) {
if (vis[v] == true)
continue;
dfs(v);
}
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
#include<tuple>
#include<deque>
using namespace std;
const int mod = 1000000007;
const int INF = 1001001001;
const long long LINF = 1001002003004005006;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define f(i,n) for(i=0;i<n;i++)
#define f1(i,n) for(i=1;i<n;i++)
#define fr(i,n) for(i=n-1;i>=0;i--)
#define em empla... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+10;
ll mn,mx,a,t,v,add;
int n,q;
int main(){
scanf("%d",&n);
mn=1e18,mx=-1e18;
for(int i=1;i<=n;++i){
scanf("%lld%lld",&a,&t);
if(t==1)add+=a,mn+=a,mx+=a;
else if(t==2)mn=max(mn,a),mx=max(mx,a);
... |
#define nl "\n"
#define ll long long
#define ull unsigned long long
#define pb push_back
#define SIZE(a) (int)a.size()
#define SORT(v) sort(v.begin(),v.end())
#define RSORT(v) sort(v.rbegin(),v.rend())
#define REV(v) ... | //By: Luogu@rui_er(122461)
#include <bits/stdc++.h>
#define rep(x,y,z) for(ll x=y;x<=z;x++)
#define per(x,y,z) for(ll x=y;x>=z;x--)
#define debug printf("Running %s on line %d...\n",__FUNCTION__,__LINE__)
using namespace std;
typedef long long ll;
const ll N = 1e5+5, mod = 1e9+7;
ll n, a[N], dp[N][2], ans;
template<t... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T>
void update_max(T& a, T b) {
if (b > a) a = b;
}
template <... |
#include<bits/stdc++.h>
#define Woody
#ifdef Woody
#define quick ios::sync_with_stdio(0);cin.tie(0);
#else
#define quick
#endif
#define int long long
#define rep(n) for(int i=0;i<n;i++)
#define max3(a,b,c) max(max(a,b),c)
#define min3(a,b,c) min(min(a,b),c)
#define mp make_pair
#define vi vector<int>
#define eb emplace... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin>>n;
set<ll> st;
for(ll a = 2; a * a <= n; a++) {
for(ll b = a * a; b <= n; b *= a) {
st.insert(b);
}
}
cout<<n - (ll)st.size();
} |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... | #include<bits/stdc++.h>
using namespace std;
tuple<long long, long long, long long> ext_gcd(long long a, long long b) {
if (b == 0) return {a, 1, 0};
auto [gcd, y, x] = ext_gcd(b, a%b);
y -= a/b * x;
return {gcd, x, y}; // a*x + b*y = gcd
}
pair<long long,long long> crt(const vector<long long> &r, const vecto... |
#include<bits/stdc++.h>
using namespace std;
int mod = 998244353;
long long dp[30][5005];
long long fac[5005],finv[5005],inv[5005];
void COMinit() {
fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
for(int i = 2; i <= 5000; i++) {
fac[i] = fac[i-1]*i%mod;
inv[i] = mod-inv[mod%i]*(mod/i)%mod;... | #include<cstdio>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define ll long long
#define I int
#define R read()
#define V void
using namespace std;
const I N=5005,mo=998244353;
I i,j,k,n,m,mc,num;
I dl[13];
ll f[14][N];
I jc[13];
I jc2[N],ny[N];
ll ch;
I R
{
I x=0,ef=1;char s=getchar();
w... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
set<long long> st;
for (long long i = 2; i * i <= N; i++){
long long c = i;
while (true){
c *= i;
if (c > N){
break;
}
st.insert(c);
}
}
cout << N - st.size() << endl;
} | #include<bits/stdc++.h>
#include<iostream>
#include<set>
#include<map>
#include<iterator>
#define ll long long
#define lli long long int
#define pb push_back
#define mp make_pair
#define RIP(i,n) for(int i=0; i<n; i++)
#define F(i,a,b) for(int i=a; i<b; i... |
#include"bits/stdc++.h"
using namespace std;
vector<string> split(const string & s, char c=' ') {
vector<string> v; stringstream ss(s); string x;
while (getline(ss, x, c)) v.emplace_back(x); return move(v);
}
template<typename T, typename... Args>
inline string arrStr(T arr, int n) {
stringstream s; s << "[";... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair <int, int> ii;
typedef pair <ll, int> lli;
#define ar array
#define pb push_back
#define fi first
#define se second
#define sz size
#define mp make_pair
#define nl '\n'
#define all(x) (x).begin(), (x).end()
#define int_max numeric_limits<i... |
#include <bits/stdc++.h>
#include <chrono>
#include <ctime>
using namespace std;
using namespace std::chrono;
using i64 = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"... | #include <bits/stdc++.h>
#define CIT_MARK ios_base::sync_with_stdio(false);cin.tie(nullptr);
#define ll long long
#define pll pair<ll,ll>
#define pb push_back
#define M 1000000007
#define lc '\n'
using namespace std;
int main()
{
CIT_MARK
ll n;
cin>>n;
ll a[n][5];
for(ll i=0;i<n;i++)
{
... |
#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(){
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n){
cin >> a.at(i);
}
ll ans=0,maxi=0;
rep(i,n){
ll mini=1e8;
for(ll j=i;j<n;j++){
mini=min(mini,a.at(j));
maxi=... | #include <bits/stdc++.h>
using namespace std;
long long arr[100005];
int s[100005], top=0;
int l[100005], r[100005];
int main(){
int n;
cin >> n;
arr[0] = arr[n+1] = -1;
for (int i=1; i<=n; i++) cin >> arr[i];
for (int i=1; i<=n; i++){
while (arr[s[top]]>=arr[i]) top--;
l[i] = i-s[top];
s[++top]=i;
}
top... |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long int ll;
#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... | /*
Author : MatsuTaku
Date : 03/27/21
Certificate:
ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAAAgQDF9T447OEo8XSQ6O1AznN5tKC8mzvYc4Zs3+oOKfMqgLXfOwQnpfcoxKs4MAP1eICBD13PkcIezJ9IlV6nKQZKs1BQmvjSXJ+zKK8YCKvAueNPuNO0Bim43IBaNHNFWcMvcmUvHgRb6hUSO0V8I7OsjiFo20KDBj3gAznu9tir0Q== CompetitiveProgrammingCertification:tk... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<l... | #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>;
vector<vector<int>> es;
vector<int> depth;
void depth_dfs(int v, int pv=-1, int d=0) {
depth[v] = d;
for (int nv : es[v]) {
if (nv == pv) continue;
depth_dfs(nv, v, d+1... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define F first
#define S second
#define um map <ll,ll>
#define rep(i,z,n) for(int i=z;i<n;i++)
#define repi(i,z,n) for(int i=z;i<=n;i++)... |
#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define mod 1000000007
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x,ll y) {return x/gcd(x,y)*y;}
struct mint {
ll x;
mint(ll x=0):x((x%... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using n... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define v(a, n) vector<int> a(n, 0)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define print(v) rep(i, (int)v.size()) cout << v[i] << (i+1 == (int)v.size()... | #include <bits/stdc++.h>
using namespace std;
#define int long long
//#define int unsigned int
#define mod 1000000007
#define double long double
//int d;
int p[200005];
vector <int> adj[200005];
int val[200005];
vector <int> vis(200005);
//vector <vector <int>> v(200005);
/*int fun(int a,int b){
if(b==0)return... |
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long i,j,k,l,m,n,t;
cin>>n;
k=0;
m=0;
l=0;
for(i=0;i<n;i++) {
cin>>j;
k+=j;
l+=k;
if (m<j) m=j;
cout<<l+m*(i+1)<<' ';
}
return 0;
} |
#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 pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define rng(v) v.begin(),v.end()
#define rngr(v) v.rbegin(),v.rend()
const long long INF = 1LL << 60;
using name... | #include <bits/stdc++.h>
#define db(a) cout << a << endl
#define db2(a,b) cout << a << " " << b << endl
#define dbd(a) cout << #a << ": " << a << endl
#define dbd2(a,b) cout << #a << ": " << a << ", " << #b << ": " << b << endl
#define dbp(a) cout << a.first << " " << a.second << endl
#define adb(a) for(auto _i:a) cou... |
//#include <atcoder/maxflow.hpp>
#include <memory>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <u... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// nam... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define rep(i,a,n) for(int i=a ; i<n ; i++)
#define pb push_back
int main()
{
int T=1;
// cin >> T ;
while(T--)
{
int x,y ;
cin>>x>>y ;
if(abs(x-y)<=2) cout<<"Yes\n" ;
else cout<<"No\n" ;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define fixed_setprecision(n) fixed << setprecision((n))
#define execution_time(ti) printf("Execution Time: %.4lf sec\n", 1.0 * (clock() - ti) / CLOCKS_PER_SEC);
#define pai 3.1415926535897932384
#define NUM_MAX 2e18
#define NUM_MIN -1e9
using namespa... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int X;
cin >> X;
int a;
a = X%100;
int ans;
ans = 100 - a;
cout << ans << endl;
} | //Author:RingweEH
#include <cstdio>
#include <algorithm>
#include <cstring>
#define ll long long
#define db double
using namespace std;
int min( int a,int b ) { return (a<b) ? a : b; }
int max( int a,int b ) { return (a>b) ? a : b; }
void bmin( int &a,int b ) { a=(a<b) ? a : b; }
void bmax( int &a,int b ) { a=(a>b) ? a... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<endl
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include<iostream>
#include<cstring>
using namespace std;
const int BUF = 73;
int nPrime;
int prime[BUF];
void makePrime() {
bool isPrime[BUF] = {};
for (int i = 0; i < BUF; ++i) isPrime[i] = true;
for (int i = 2; i * i < BUF; ++i) {
if (isPrime[i]) {
for (int j = i * 2; j < BUF; j +... |
#include<bits/stdc++.h>
#define SORT(v) sort(v.begin(),v.end())
#define si(n) scanf("%d",&n)
#define sii(n,m) scanf("%d %d",&n,&m)
#define sl(n) scanf("%lld",&n)
#define sll(n,m) scanf("%lld %lld",&n,&m)
#define ss(cad) scanf("%s",cad)
#define all(v) (v).begin(), (v).end()
#define PB push_back
#define fst first
#defin... | #include<iostream>
#include<vector>
#include<map>
#include<math.h>
#include<algorithm>
#include<set>
#include<queue>
#include<cstring>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define fi first
#define se second
using namespace std;
using ll = ... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cstdint>
#include <cmath>
using namespace std;
using ll = long long ;
#define LINF (1LL<<60)
#define rep(i,n) for (int i=0; i < (n); ++i)
//#define LLONG_MAX 9223372036854775807i64
int ctoi(char c){
return int(c)... |
#include <cmath>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define LOOP(n) for (int _i = 0; _i < (n); _i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, r, n) for (int i = (r); i < (n); ++i)
using namespace std;
using ll... |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
typedef vector<int> vi;
typedef pair<int, int> pii;
#define PI 3.14159265
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for... | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <climits>
constexpr int SINT_MAX = std::numeric_limits<int>::max();
constexpr int SINT_MIN = std::numeric_limits<int>::min();
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = ve... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
int n,m;
char s[1009];
int mat[1009][1009];
int f[1000009];
int br[1000009],bc[1000009];
int vr[1009],vc[1009];
vector<int> sr[1009],sc[1009],sf[1000009];
int fnd(int x)
{
return x==f[x]?x:f[x]=fnd(f[x]);
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Vll =vector<ll>;
using VVll =vector<vector<ll>>;
template <class T>
using Vec = vector<T>;
template <class T>
using VVec = vector<vector<T>>;
void Z(){ cout<<"Test"<<endl; }
template <class T> void VVcout(VVec<T> A){ for(auto Vi:A) { for(auto i:V... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
// #include <atcoder/all>
// using namespace atcoder;
int main(){
int n;
double D, H;
cin >... | #include <bits/stdc++.h>
using namespace std;
int main(){
double n, d, h;
cin >> n >> d >> h;
vector<int> D(n), H(n);
for(int i=0;i<n;i++)cin >> D.at(i) >> H.at(i);
double minlen = 1000000000;
for(int i=0;i<n;i++){
if(d * (h - H.at(i)) / (d - D.at(i)) < minlen){
minlen = d * (h - H.at(i)) / (d - ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rrep(i,n) for(int i=((n)-1);i>=0;--i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define mod 1000000007
using namespace std;
typede... |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
using ll = long long int;
#define F first
#define S second
#define fast_io ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
const int N=2e5+10,LN=20,SQ=550,M=5e4+10;
const ll INF=1e18;
const int MOD=1000000007 /*998244353*/;
#includ... | /*
Author: Arjan Singh Bal, IIIT Gwalior
"Everything in this world is magic, except to the magician"
*/
#include <bits/stdc++.h>
#ifdef LOCAL
#include "pprint.hpp"
#else
#define trace //
#endif
using namespace std;
template <typename Arg1>
void prn(Arg1&& arg1)
{ cout << arg1 << "\n"; }
templa... |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
string s; cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n - 3; i++) {
if(s.substr(i, 4) == "ZONe") ans++;
}
cout << ans << endl;
return ... | #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace... |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
int dp[100001][2], dp1[100001][2], n, arr[100001];
int fun1(int ind, int sign) {
if ( ind == n ) return 1;
if ( dp1[ind][sign] != - 1 ) return dp1[ind][sign];
int res = 0;
if ( sign ) {
res = (fun1(ind ... | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll a[200010],sum[200010];
int main(){
ll i,n; cin >> n;
for(i=0;i<n;i++) cin >> a[i];
sort(a,a + n);
sum[0] = 0;
for(i=1;i<=n;i++) sum[i] = sum[i - 1] + a[i - 1];
ll ans = 0;
for(i=0;i<n;i++){
ans -= ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ALL(x) x.begin(),x.end()
#define SORT(x) sort(ALL(x))
#define FOR(a,b,c) for(ll (a)= (b);(a)<(c);++(a))
#define REP(a,b) FOR(a,0,b)
#define mp make_pa... | /* -*- coding: utf-8 -*-
*
* e.cc: E - White Pawn
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<ut... |
#include<bits/stdc++.h>
using namespace std;
int main()
{double n,x,p=0;
cin>>n>>x;
for(int i=0;i<n;i++)
{
double a,b;
cin>>a>>b;
p=p+(a*b);
if(p>x*100)
{cout<<i+1;
break;
}
}
if(x*100>=p)
cout<<"-1";
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef struct x
{
string a;
long long b;
}x;
long long n;
bool cmp(x tmp1,x tmp2)
{
return tmp1.b>tmp2.b;
}
void solve()
{
vector < x > a(n);
long long i;
for (i=0;i<n;i++)
cin>>a[i].a>>a[i].b;
sort(a.be... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,x) for(ll i = 0; i < x; i++)
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) { if (a > b) { a = b; return true; } return false; }
ll f(ll x... | #include <bits/stdc++.h>
using namespace std;
#define MOD (long long int)(998244353)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define FOR(i,a,b) for(int i=a... |
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int sum=0;
for (int i=1;i<=100005;i++)
{
sum+=i;
if (sum>=n)
{
cout<<i;
return 0;
}
... | #include <bits/stdc++.h>
#define reps(i, a, n) for(int i = a; i < (int)n; i++)
#define rep(i, n) reps(i, 0, n)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INF 1 << 29
template<class T>bool chmax(T &a, const T &b){
... |
#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()
const... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s... |
#include<iostream>
#include<string>
#include<vector>
#include<iterator>
using namespace std;
int main()
{
int a,b,c,d,m,x,y;
cin>> a >> b >> c >> d ;
if(a>=b)
{
x=a;
}
else
{
x=b;
}
if(c<=d)
{
y=c;
}
else
{
y=d;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for(int i = (int)(n); i < (int)(m); i++)
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << b-c << endl;
} |
#include<bits/stdc++.h>
using namespace std;
const int MAX = 101;
int64_t dp[MAX][MAX][MAX];
void clean(int K){
for(int i=0; i<MAX; i++){
for(int j=0; j<MAX; j++){
for(int k=0; k<K; k++){
dp[i][j][k] = -1;
}
}
}
}
int main(){
int64_t N, X;
cin >> N >> X;
vector<int64_t> vec(N);
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
const int N = 2e6;
using namespace std;
int n,a[N + 5],ans,lim,c[N + 5],cnt,t;
void dfs1(int x,int ti)
{
if (ti > t)
return;
if (x == lim + 1)
{
c[++cnt] = ti;
return;
}
dfs1(x + 1,ti + a[x]);
d... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> ar(n);
for (auto& v: ar) {
cin >> v;
v--;
}
... | #include<bits/stdc++.h>
typedef uint32_t uint;
typedef uint64_t u64;
typedef int64_t i64;
typedef long double f128;
using namespace std;
void scan(){}
template<typename T,class... Args>
void scan(T& n,Args&... args){
cin>>n;
scan(args...);
}
template<typename T>
void scan_vec(T start,T end){
T now=start;
for... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
int f=0,x=0;
char ch=getchar();
while(!isdigit(ch)){f|=(ch=='-');ch=getchar();}
while(isdigit(ch)){x=x*10+ch-'0';ch=getchar();}
return f?-x:x;
}
int a[1000];
int sta[1000],top;
int pre[1000][1000];
int dp[1000][1000];
int cnt[100... | #include<bits/stdc++.h>
using namespace std;
void output(vector<int> &a){
cout << a.size();
for(auto &nx : a){
cout << ' ' << nx;
}
cout << '\n';
}
int main(){
int n;
cin >> n;
vector<int> a(n);
for(auto &nx : a){cin >> nx;}
vector<vector<int>> bk(200,vector<int>(0));
int cnt=min(n,8);
f... |
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define mp make_pair
#define for0(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define w(x) int x;cin>>x;wh... | #include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define sz(x) (int)x.size()
#define p... |
#include <stdio.h>
#include <limits.h>
#include <iostream>
using namespace std;
int main(){
long long a,b,c;
cin >> a >> b>>c;
long long sum =0;
a= a%998244353;
b = b%998244353;
c = c%998244353;
long long mod = 998244353;
// for(int i = 1 ; i <= a ; i++){
// for(int j = 1 ; j <= b... |
//a
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#include <regex>
#include <initializer_list>
#include <numeric>
using namespace std;
... |
#include <bits/stdc++.h>
//#include <atcoder/lazysegtree>
//#include <atcoder/segtree>
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(ll i = 0; i < (n); ++i)
#define rep2(i, n) for(ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for(ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for(ll i = (a);... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
int h,w;
const int maxn=2005;
char a[maxn][maxn];
vector<pair<int,int> > e[maxn*maxn];
int dis[maxn*maxn];
bool vis[maxn*maxn];
int dr[4]={0,0,1,-1};
int dc[4]={1,-1,0,0};
int common[26];
int trans(int r,int c)
{
return r*w+c;
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int64_t i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int64_t i=(a),_b=(b);i>=_b;--i)
using ull = uint64_t;
using... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n,i,j,x=1,y=1;
cin>>n;
for(i=1;;i++){
x*=3;
if(x>n){
break;
}
for(j=1;;j++){
y*=5;
if(x+y==n){
cout<<i<<" "<<j<<endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
if(n%2==0){
cout << "White" <<endl;
}else{
cout << "Black" <<endl;
}
return 0;
} |
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-variable"
#pragma GCC diagnostic ignored "-Wfloat-conversion"
#include <iostream> // IO
#include <cmath> // sqrt, trig, ceil, log
#include <utility> // swap, pair
// #include <chrono> // non c style time
// #include <algorithm> // sort, binary sear... | #include <bits/stdc++.h>
#pragma GCC optimize(2)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<cstring>
#include<bitset>
#include<stack>
#include<time.h>
#define X first
#define Y second
#define PB push_b... |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
/******... | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
int gcd(int x,int y){
if(x<y) swap(x,y);
if(y==0) return x;
return gcd(x%y,y);
}
set<int> s;
vector<int> a;
int main(){
int i,j,n; cin >> n;
a.resize(n);
for(i=0;i<n;i++) cin >> a[i];
sort(a.begin... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define FILL0(x) memset(x,0,sizeof(x))
#define FILL1(x) memset(x,-1,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<... | #include<iostream>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
int i,j;
int a,MIN = 1000,sum = 0;
for(i=0;i<H;i++)for(j=0;j<W;j++) {
cin >> a;
MIN = min(a,MIN);
sum += a;
}
cout << sum-MIN*H*W << endl;
} |
/*{{{ #include */
#include <iostream>
#include <cstdio>
#include <istream>
#include <ostream>
#include <string>
#include <type_traits>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <tuple>
#include <algorithm>
#include <utility>
#include <cmath>/*}}}*/
/*{{{ namespace R2357 ... | #include <bits/stdc++.h>
#define rep(i,b) for(int i=0;i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) {a = b; return true;} else return false;}
t... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define endl '\n'
#define ff first
#define ss sec... | #include <bits/stdc++.h>
#define rep(X, N) for (ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(), (V).end()
#define endl "\n"
#define pb push_back
#define mp make_pair
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
const double PI = 3.1415926535897932384626;... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define ll long long
#define ld long double
#define ALL(a) (a).begin(), (a).end()
#define Mod 1000000007
int main() {
int n;
cin >> n;
ll ans;
cin >> ans;
vector<vector<ll>> a(2, vector<ll>(n));
a[0][0] = ans;
... | #include <bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long
#define pb push_back
long long dp[100010], a[100010];
ll mod = 1e9+7;
int main()
{
int n, prvi;
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
dp[0]=1;
dp[1]=2;
for(int i=2;i<=n-1;i++) dp[i] = (dp[i-1]+dp[i-2])%mod;
... |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
#define ll long long
void solve(){
int n;
cin>>n;
string s;
cin>>s;
int count[26]{0};
for(int i=0;i<n;i++)
count[s[i]-'a']=1;
for(int i=0;i<26;i++)
{
if(count[... | #include <bits/stdc++.h> //yaad rkhne layak baatein
#include <bits/stdc++.h> // bool found = false use it to find some number after the given number with some cond.
// while (!found)
#include <iostream> // freq.table-> int freq[26] = {0}; for (ll i = 0; i < s1.length(); i++) freq[s1[i] - '... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans = (n - 1);
cout << ans;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n,count=0;
cin>>n;
for(int i=1;i<n;i++)
{
for(int j=1;j<n;j++)
{
if(i+j==n) count++;
}
}
cout<<count;
return 0;
} |
// <-- Coded by Pasindu_Piumal -->
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef pair<db,db> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef... | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long int
#define pii pair<int,int>
#define pll pair<long long int,long long int>
#define pci pair<char,int
#define mii map<int,int>
#define mll map<long long int,long long int>
#define mci map<char,int>
#define umi... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using pll = pair<ll, ll>;
#define sz(x) (int)(x).size()
template <typename T> bool ckmin (T& a, T b) { return (b < a) ? a = b, 1 : 0; }
template <typename T> bool ckmax (T& a, T b) { return (b > a) ? a = b, 1 : 0; }
#ifde... | #include <bits/stdc++.h>
using namespace std;
#define boostIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, b, a) for (int i = b; i >= a; i--)
#define int long long
#define fi first
#define se second
#... |
#include<bits/stdc++.h>
using namespace std;
#define A(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define int int64_t
void _read();
int mod;
inline int inv(int a) {
a %= mod;
if (a < 0) a += mod;
int b = mod, u = 0, v = 1;
while (a) {
int t = b / a;
b -= t * a; swap(a, b);
u -= t *... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
const lld N = 200043;
const lld MOD = 1000000007;
lld add(lld x, lld y)
{
x =((x%MOD)+(y%MOD))%MOD;
while(x >= MOD) x -= MOD;
while(x < 0) x += MOD;
return x;
}
ll... | #include <bits/stdc++.h>
using namespace std;
// 型
#define ll int64_t // ll -> int64_t
using graph = vector<vector<int>>; // グラフ型
// for文
#define lp(i,n) for(int i=0;i<n;i++) // 変数 i をおいて n 回繰り返し
#define lp_(i,n) for(int i=0;i<=n;i++) // 条件に＝つき
#define lpp(i,n,m) for(int i=n;i<m;i++) // 開始と終... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
N *= 2;
int ans = 0;
for (ll i = 1; i * i <= N; ++i) {
if (N % i == 0) {
if ((i + N / i) % 2 == 1) {
ans += 2;
... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*............................................................................*/
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
priority_queue<long long> max;
vector<long long> sum(N);
long long ans = 0;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
max.push(a);
if (i == 0) {
sum.at(0) = a;
}
else {
sum.at(i) = sum... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(lint i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
///#pragma GCC optimize ("-O3")
ll input(){
... |
/*
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
Date:13/06/2020
*/
#include<bits/stdc++.h>
#include<string>
#include<algorithm>
using namespace std;
#define ll long long
#define int long long
#define ld long double
#define ff first
#define clr(a,x) memset(a,x,sizeof(a))
#d... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int n;
int arr[100010];
bool judge(int k) {
for(int i=1; i<=n; i++)
if(arr[i] % k != 0)
return false;
return true;
}
int main() {
int ans = 1;
cin >> n;
for(int i=1; i<=n; i++)
cin >> arr[i... |
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N = 1e5+5;
const ll mod = 1e9+7;
ll n, m, t, k, ans, tong, a[N], b[N];
void sol()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++)cin >> a[i];
vector<ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
ll fa[200005];
ll p[200005];
ll gf(ll v){
if(fa[v]==v){
return v;
}
fa[v]=gf(fa[v]);
return fa[v];
}
void merge(ll i,ll j){
i=gf(i);
j=gf(j);
if(i!=j){
fa[j]=i;
}
}
int main()
{
ll t,n,i,j;
cin>>n;
for(i=1;i<=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T>
void view_1d(vector<T> V, string sep) {
for (ll i=0; i<V.size(); i++) {
cout << V[i];
if (i == V.size() - 1) {
cout << endl;
} else {
cout << sep;
}
}
}
template<typ... |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int mod = 1e9 + 7;
int32_t main() {
int t, n;
t = 1;
while(t--) {
string a, b;
cin >> a >> b;
int suma = 0, sumb = 0;
for(int i = 0; i < a.length(); i+... | // MUJHSE BILKUL BHI NAHI HO RHA.....still i am TRYING
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define m... |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#define int long long
#define ri register
#define mk make_pair
#define fi first
#define se second
#define pb push_b... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
const ld PI = 4*atan((ld)1);
const ll mod = 1e9 + 7;
const ll... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 5005, inf = 1e9;
#define fi first
#define se second
int mod = 1e9 + 7;
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
a.push_back(0);
... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define f(i,j,n) for(long long i = j ; i < n ; ++i)
#define fr(i,j,n) for(long long i = j ; i >= n ; --i)
#define ones(x) __builtin_popcount(x)... |
#include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) { a = (a > b ? a : b); }
template <typename T1, typename T2> in... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
us... |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ks std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define fr(i,a,b) for(int i=a;i<b;i++)
#define pb(a) push_back(a)
#define fi ... |
/// Solution No.:
/// Approach:
/// Complexity: space: O()
/// time: O()
/// Comment:
/// Verdict:
/// Report:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <string>
#include <sstream>
#include <cstdio>
#include <vector>
#include <string>
#include <map>
#inc... | #include<bits/stdc++.h>
#include <iomanip>
using namespace std;
#define pb push_back
#define ll long long int
#define pll pair<ll,ll>
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a,b,x,y;
cin>>a>>b>>x>>y;
int ans = x+min(abs(b+1-a)*y,abs(b-a)*y);
if(a>b){... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
long long sum = 0;
long long sum2 = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum += (long long)(N - 1) * A.at(i) * A.at(i);
sum2 += A.at(i);
}
for (int i = 0; i < N - 1; i++) {
sum2 -= ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define hell 1000000007
const int nax=1e5+20;
int main(){
// int t; cin >> t;
int t = 1;
while(t--){
int n; cin >> n;
map<ll, ll> cnt;
ll ans = 0;
for(int i = 0; i < n; i+... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main(){
int n;
cin >> n;
double ans = 0;
rep(i, n){
if (i==n-1) break;
double i_ans = n / double(n-i-1);
ans += i_ans;
}
printf("%.10f\n", ans);
} | #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<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a=1;
while(n--)
a*=2;
queue<pair<int,int>>q;
for(int i=0;i<a;i++)
{
int x;
cin>>x;
q.push({x,i+1});
}
while(q.size()>2)
{
int k=q.si... | #include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
scanf("%d",&n);
int size = 2<<(n-1);
vector<int> a(size);
for(int i=0;i<size;i++){
scanf("%d",&a[i]);
}
int index1, index2;
int max1 = 0;
int max2 = 0;
for(int i=0;i<(size/2);i++){
if(max1<a[i]){
max1 = a... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main(){
ll N;
cin >> N;
ll M = N, cnt = 0;
vector<ll> A(10,0);
while(M > 0){
A[cnt] = M % 10;
M /= 10;
cnt++;
}
ll rev = 0, cnt2 = 0;
while(true){
if(A[cnt2] == 0... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;string s="";cin>>S;
for(int i=S.size()-1;i>=0;i--){
if(S.at(i)=='6')s+="9";
else{
if(S.at(i)=='9')s+="6";
else {s+=S.at(i);}}}
cout<<s;
}
|
/*
///// ///// //////////////////
///// ///// //////////////////
///// ///// /////
///// ///// /////
////////// o /////
/////\\\\\ /////
///// \\\\\ /////
///// \\\\\ //... | #include<bits/stdc++.h>
#define x first
#define y second
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mem(x,val) memset(x,val,sizeof x)
#define pii pair<int,int>
#define pb emplace_back
#define ar array
#define int long long
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define F0R(i, n)... |
#include<bits/stdc++.h>
#define LL long long
#define pll pair<LL,LL>
#define mp make_pair
#define fi first
#define se second
using namespace std;
int read(){
char ch=getchar(); int x=0,fl=1;
for(;!isdigit(ch);ch=getchar()) if(ch=='-') fl=-1;
for(;isdigit(ch);ch=getchar()) x=(x<<3)+(x<<1)+(ch-'0');
return x*fl;
}
c... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e18;
const int MOD = 1... |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<set>
#include<algorithm>
#include<string.h>
#include<map>
#define LL long long
#define INF 0x3f3f3f3f
#define mod 100000007
using namespace std;
int k,cnt1[100],cnt2[100];
string s, t;
int main() {
cin >> k >> s >> t;
for (... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Max = 1 << 17;
int n;
ll dp[20][20][Max + 10];
ll s[20][20];
ll pos[20][3];
ll p2[20];
int pr[Max + 10];
void pre() {
for (int i = 0; i < Max; ++i) {
int n = i;
while (n) {
pr[i] += n % 2;
n /= 2;
}
}
p2[1] = 1;
for (int i = 2;... | #include<bits/stdc++.h>
using namespace std;
typedef struct Point {
int x,y,z;
}Point;
int f(Point a ,Point b){
int v1 = abs(a.x - b.x);
int v2 = abs(a.y - b.y);
int v3 = max(0,b.z - a.z);
return v1+v2+v3;
}
int main(){
int n; cin>>n;
Point a[n];
int x,y,z;
for(int i=0;i<n;i++) { cin>>x>>y>>z; a[i]={x,y,z}; ... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
string a;
random_device rnd;
cin >> N >> M;
for(int i=0; i<M; i++) {
cin >> a;
}
for(int y=0; y<N; y++) {
for(int x=0; x<N; x++){
char a = rnd()%8 + 'A';
cout << a;
}
... | #include <bits/stdc++.h>
using namespace std;
int n;
mt19937 mt;
const int TRIES = 500;
const int SHUFFLES = 0;
bool check(string s, vector<vector<char>>& a, int i, int j) {
bool isOk = true;
for (int k = 0; k < s.size() && isOk; ++k) {
if (s[k] != a[i][(j + k) % n]) {
isOk = false;
... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<unsigned char>s(19,'a');
for(int i=0;;i++){
cin>>s.at(i);
if(s.at(i)=='a') break;
}
for(int i=18;;i--){
if(s.at(i)=='a') s.pop_back();
else break;
}
vector<int>v(s.size());
for(int i=0;i<s.size();i++) v.at(i)=(int)s.at(i)-48;... |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
constexpr char newl = '\n';
constexpr double eps =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxN = 4e2 + 10;
ll n, a[maxN], ans;
int read();
int main(){
n = read();
for(int i = 0; i < n; i++){
ll x = read() + 200;
a[x]++;
for(int j = 0; j <= 400; j++) ans += (x - j) * (x - j) * a[j];
}
cout << ans;
return 0;
}
int read(){... |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define rep(i, n) for (int i=0; i < n; i++)
using namespace std;
int main() {
int n, k, num; cin >> n >> k;
num = (n*k*(100*n + k + 101))/2;
cout << num << endl;
} | //{{
/*
* Created at: 06/21/21 22:14:44
*
* FB: https://facebook.com/tgbaodeeptry
* From Viet Nam with Love :D
*
*/
#include <bits/stdc++.h>
using namespace std;
#define fast_io() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i... |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
//#include<at... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2005;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin >> n;
ll cnt = 0;
vector<ll>v(n);
for(int i = 0; i < n; i++)
{
ll x, y;
cin >> x >> y;
cnt -= x;
... |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_set>
using namespace std;
long long ipow(long long x, long long y) {
long long ans = 1;
for (long long i = 0; i < y; i++) {
ans *= x;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll i = 0; i < N; i++)
int main()
{
ll n,q; cin >> n >> q;
vector<ll> a(n);
rep(i,n) cin >> a[i];
pair<ll,ll> k[q];
rep(i,q){
cin >> k[i].first;
k[i].second=i;
}
sort(k,k+q);
vector<ll> ans(q);
ll num=0;
rep(i,q){
whi... |
///Bismillahir Rahmanir Raheem
#include <bits/stdc++.h>
#include <algorithm>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define PI 2 * acos(0.0)
#define NFS \
ios::sync_with_stdio(false); \
cin.tie(0)
#define f first... | #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 ... |
//AnkitCode99 here....
//every ups and downs matter!
#include<bits/stdc++.h>
#define endl "\n"
#define IOS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr)
typedef long long int ll;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
using namespace std;
const ll sz=1e5+5;
const ll szz=1e6+6;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
int N, C;
cin >> N >> C;
map<int, ll> mp;
rep(i, N) {
int a, b, c;
cin >> a >> b >> c;
mp[a] += c;
mp[b + 1] -= c;
}
ll ans = 0;
... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>... | #include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(b... |
#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
#define ff first
#define ss second
#define pi acos(-1.0)
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(m),b(m);
rep(i,m) cin >> a[i] >> b[i];
int k;
cin >> k;
vector<int> c(k),d(k);
rep(i,k) cin >> c[i] >> d[i];
int ans = 0... |
#pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll z = 0, mod = 1000000007, MAX = 10000000000;
int main(){
ll N;
cin >> N;
vector<ll> data(1, 0);
ll now = 0;
for (ll i = 0; i < N; i++){
ll a;
cin >> a;
now = a - now;
if (i % 2 == 1){
data.push_back(now);
... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type , less<ll> , rb_tree_tag , tree_order_statistics_node_update>
#define ll long long
#define ull unsigned long long
#define pb... | #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>;
struct UnionFind {
// それ自身の場合はsize の-1 掛けたもの
// それ以外は自分の親のid
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int root(int x) {
if (r[x] < 0) return x;
re... |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... |
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using ld = long double;
using P = pair<int, int>;
#define rep(i, a, b) for(int i = (int)(a); i <= (int)(b); i++)
#define rr... | #include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#include <stack>
#include <algorithm>
#include <cmath>
typedef long long ll;
using namespace std;
ll Atoi(string s, ll radix, ll m)
{
ll ans = 0;
for (ll i = 0; i < s.size(); i++)
{
char t = s[i];
if (ans > m/radix)
... |
#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
scanf("%lld",&n);
ll ans=0;
for(int i=1;n%2==0;i++)
{
n=n/2;
}
if(n==1)
{
printf("2\n");
return 0;
}
for(int i=1; i<sqrt(n); i=i+2)
{
if(n%i==0&&(n/i)%2!=0)
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
ll ans = 0;
for(int i = 2; i <= 2*n; i++){
if(i + k > 2*n) conti... | #include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<bitset>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i... |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline")
#include<bits/stdc++.h>
using namespace std;
template<class T> struct cLtraits_identity{
using type = T;
}
;
template<class T> using cLtraits_try_make_signed =
typename conditional<
is_integral<T>::value,
make_... | #include <bits/stdc++.h>
using namespace std;
struct binary_indexed_tree{
int N;
vector<int> BIT;
binary_indexed_tree(int N): N(N), BIT(N + 1, 0){
}
void add(int i, int x){
i++;
while (i <= N){
BIT[i] += x;
i += i & -i;
}
}
int sum(int i){
int ans = 0;
while (i > 0){
... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define INF 1e+9
#define mp make_pair
#define pb push_back
#define fi first
#defi... |
//================code===================//
//#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#define ci(t) cin>>t
#define co(t)... |
#include "bits/stdc++.h"
#pragma region header
using i32 = int;
using i64 = long long int;
using u32 = unsigned int;
using u64 = unsigned long long int;
using isize = ptrdiff_t;
using usize = size_t;
constexpr size_t operator"" _uz(unsigned long long v) { return size_t(v); }
inline u64 popcount(const u64 v) {
#ifdef ... | #include <bits/stdc++.h>
using namespace std;
int last[120000],a[120000];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=2*i;j<=n;j+=i){
last[j]=i;
}
}
for(int i=1;i<=n;i++) {
a[i]=a[last[i]]+1;
printf("%d ",a[i]);
}
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <... | #include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define precision \
cout.precision(30); \
cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn... |
#include <cstdio>
#include <algorithm>
#include <cmath>
const int N = 100 + 5;
const double eps = 1e-8;
struct Vertice {
double x, y;
void set_point(double x_, double y_) { x = x_, y = y_; }
void set_line(int y_) { x = 205, y = y_; }
bool line() const { return x > 204; }
};
double distance(const Vertice &lhs, con... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef pair<double, ll> pdl;
#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;
ll N;
pll A[105];
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.