code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
const int INF = 1e9 + 9;
const int MX = 1e5 + 5;
int gcd(int a, int b) {
if(b == 0) return a;
return gcd(b, a%b);
}
int32_t main()
{
int l;
cin >> l;
int den = 39916800;
int num = 1;
for(int i=1;... | #include <stdio.h>
int main()
{
int n;
scanf("%d",&n);
if(n<0)
printf("0");
else
printf("%d",n);
} |
#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
long long N;
long long X[1 << 18], C[1 << 18];
long long dp[1 << 18][3];
vector<long long> G[1 << 18];
vector<long long> J;
int main()... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
std::mt19937 rnd(time(0));
inline int sj(int n)
{
unsigned int x=rnd();
return x%n+1;
}
#define rand fst
template<typename typC> void read(register t... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll T; cin >> T;
for (ll i = 0; i < T; i++) {
string S; cin >> S;
if (S > "atcoder") {
cout << 0 << '\n';
continue;
}
ll ans = -1;
for (ll j = 0; j < S.size(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vp> vvp;
// inp... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int total = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= k; j++){
int room = i * 100 + j;
total += room;
}
}
cout << total << endl;
return 0;
} | #include <iostream>
#include <string.h>
#include <limits.h>
#include <time.h>
#include <algorithm>
#include <vector>
#define rep(i, a,b) for (int i = a; (int)i < b; i++)
#define repe(i,a,b) for(int i=a;(int)i<=b;i++)
#define per(i,a,b) for(int i=a;(int)i>b;i--)
#define fi(i,a) for(int i=0;(int)i<a;i++)
#define FS(i,a) ... |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> A;
const int MAX = 200010;
int main()
{
ll N,W;
cin >> N >> W;
vector<ll> num(MAX + 1, 0);
for(int i = 0; i < N; i++)
{
ll s,t,w;
cin >> s >> t >> w;
num[s] += w;
num[t] -= w;
}
for(int i = 0; i < MAX; i++)
{
num[i + 1] +... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef long long ll;
const ll MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define coutALL(x) for(auto i=x.begin();i!=--x.end();i++) cout<<*i<<" ";cout<<*--x.end()<<endl;
#define coutVEC2(x) rep(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const int maxn=1e6+5;
int main() {
ll k,n,m;cin>>k>>n>>m;
vector<ll> a(maxn),b(maxn);
vector<pii> lg,sm;
for(int i=1;i<=k;i++) cin>>a[i];
int left=m;
for(int i=1;i<=k;i++) {
b[i]=a[i]*m/n;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef unordered_map<int, int> umii;
typedef unordered_map<ll, ll> umll;
typedef map<ll, ll> mll;
#define fastio ... | #include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
using namespace std;
typedef unsigned int u32;
typedef int i32;
typedef unsigned long long int u64;
//typ... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in: a)
#define all(x) x.begi... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
# define drep(i,a,b) for(int i=(a); i>=(b); --i)
typedef long long int_;
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(;... |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define frfr freopen("input.text","r",stdin); //freopen("output.txt","w",stdout)
#define LL long long int
#define ull unsigned long long int
#define wh int T;cin >> T;while(T--)
#define foro(i,n... | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test int tt; cin>>tt; while(tt--)
#define ff first
#define ss second
#define pb push_back
#define mkp make_pair
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
strin... |
#include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 1000000007LL
//#define MOD 998244353LL
#define doublecout(a) cout<<setprecision(16)<<a<<endl;
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
usi... | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
#include<time.h>
#include<deque>
#include<cstring>
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define F first
#define S second
#define mp make_pair... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a ,b;
double ans = 0.0;
cin >> a >> b;
ans = (double) (a - b) /(double) a * 100;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
constexpr long long mod=998244353;
long long fpow(long long a,long long b){
long long z=1;
while(b){
if(b&1)z=z*a%mod;
a=a*a%mod;
b>>=1;
}
return z;
}
long long inv(long long x){
return fpow(x,mod-2);
}
main(){
ios::sync_wi... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<long long > printDivisors(ll int n)
{ vector<long long > v;
for (ll int i = 1; i <= sqrt(n); i++)
{ if (n % i == 0) {
if (n / i == i)
v.push_back(i);
else {
v.push_back(i);
v.push_back(n / i);
}
}
}
return v;
}
int main()
{
... | #include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma comment(linker, "/stack:200000000")
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define MP make_pair... |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
string a = to_string(N);
int B = a.size();
if (B <= 3) {
cout << 0 << endl;
}
else if (B <= 6) {
cout << N - 999 << endl;
}
else if (B <= 9) {
cout << (N - 999999) * 2 + 999000 << endl;
}
else if (B <= ... |
#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++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=998244353, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
///////// c... |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
c... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LL long long
#define int long long
#define ull unsigned long long
#define fi first
#define s... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, a[maxn], b[maxn], c[maxn], p[maxn];
bool vis[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) {
scanf("%d", &b[i]);
}
for (int i =... |
// God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug p... | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class T> using ordere... |
// Problem : A - A*B*C
// Contest : AtCoder - AtCoder Regular Contest 113
// URL : https://atcoder.jp/contests/arc113/tasks/arc113_a
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*ヽ｀、ヽ｀｀、ヽ｀ヽ｀、、ヽ ｀ヽ 、ヽ｀🌙｀ヽヽ｀ヽ、ヽ｀
ヽ｀、ヽ｀｀、ヽ 、｀｀、 ｀、ヽ｀ 、｀ ヽ｀ヽ、ヽ ｀、ヽ｀｀、
ヽ、... | #include <stdio.h>
#include <string.h>
#include <vector>
#include <set>
#include <queue>
#include <string>
#include <map>
#include <stdlib.h>
#include <time.h>
#include <algorithm>
#include <iostream>
#include <memory>
//防掉rating提示：想好正确的算法，错误的算法是不能通过的。任何题目都有可能难倒你，所以如果你短时间内想不到算法，放弃这题。
#include <cstdio>
const int MAXN = ... |
#include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;
const int max_n = 105;
const int max_k = 22;
const int off_set = 1e5+5;
const int max_A = 55;
const int Mod = 1e9+7;
const long long inf = 1e18;
vector<vec... | #include <bits/stdc++.h>
#include <iostream>
#include <limits>
#include <numeric>
#include <type_traits>
#include <bitset>
#include <list>
using namespace std;
#define rep(i,n,m) for(ll (i)=(n);(i)<(m);(i)++)
#define rrep(i,n,m) for(ll (i)=(n);(i)>(m);(i)--)
using ll = long long;
const ll mod = 1000000007;
const ll i... |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10... |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb push_back
#define nl cout<<"\n"
#define all(x) x.begin(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define MP make_pair
using P = pair<int, int>;
const... |
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#define ordered_set tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
#define int long long int
using namespace std;
#define pb push_bac... | #include<bits/stdc++.h>
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define task "nondec"
#define pii pair<pll, ll>
using namespace std;
using ll = long long;
const int N = 1e5+5;
const ll mod = 1e9 + 7;
const ll base = 350;
const ll cs = 331;
ll m, n, t, k, tong, ans, a[N], b[N], ... |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5;
const double eps = 1e-6;
int send[maxn];
double k[maxn], b[maxn], sumk = 0.0, sumb = 0.0;
int main() {
int N, M, K;
scanf("%d %d %d", &N, &M, &K);
int x;
for (int i = 0; i < K; i++) {
scanf("%d", &x);
send[x] = 1;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
double n, D, H;
double slope(int d, int h) { return (H - h) / (D - d); }
double solve() {
cin >> n >> D >> H;
double min_slope = 1e18;
while (n--) {
int h, d;
cin >> d >> h;
min_slope = min(min_slope, slope(d, h));... | //@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long double A, B;
cin >> A >> B;
cout << fixed << setprecision(5) << 100.0 * (1.0 - B / A);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
ll b,c;
cin>>b>>c;
ll l1,r1,l2,r2;
l1=b-c/2;
r1=b+(c-2)/2;
l2=-b-(c-1)/2;
r2=-b+(c-1)/2;
ll ans=0;
... |
#include <bits/stdc++.h>
using namespace std;
#define mp(a, b) make_pair(a, b)
typedef pair<int, int> pii;
typedef long long ll;
const int maxn = 2e5 + 10;
const ll INF = 1e18;
ll sum;
ll g[2], f[maxn];
int n, a[maxn], b[maxn];
vector<ll> o, e;
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
{
scanf("%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 <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(200,0);
for(int i = 0; i < n; i++){
int tmp;
cin >> tmp;
a[tmp%200] += 1;
}
ll ans = 0;
for(int i = 0; i < 200; i++){
ans += ((ll)a[i]... | #include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define pie 3.14159265
#define ll long long int
#define fr(i,a,n) for(ll i=a;i<n;i++)
#define vi vector<int>
#define vlli vector<ll>
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fv(i,a) for(auto i:a)
#define sz(a) int((a).si... |
//Think simple yet elegant.
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define pi pair<int,int>
#define REP(i,n) for(int i=0... | //2021.6.19 by ljz
//email 573902690@qq.com
//if you find any bug in my code
//please tell me
#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;
//using namespace __gnu_cxx;
#define res int
#define LL long long
#defi... |
#include<bits/stdc++.h>
using namespace std;
long long ara[2000006],tra[2000006];
int main()
{
int n,m,a,b,c,d,e,p,q,l,r,s,fr,sc,tr,sz=0,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
int x=0,y=0,cnt=0,res=0,ans=0,sum=0; int flg=0,flag=1,na=0,as=1;
vector<int>u,v,w; vector< pair<int,int> >vct; vector<s... | #include<bits/stdc++.h>
using namespace std;
void __print(int x){cout<<x;}void __print(long x){cout<<x;}
void __print(long long x){cout<<x;}void __print(unsigned x){cout<<x;}
void __print(unsigned long x){cout<<x;}void __print(unsigned long long x){cout<<x;}
void __print(float x){cout<<x;}void __print(double x){cout<<x... |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(ll i = 0;i < (ll)n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy cout... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n , m;
cin >> n >> m;
double ans;
ans = 1.0*m / 100 *n;
cout << ans << endl ;
}
|
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
template<class T> using indexed_set=tree<T,null_type,less<T>,rb_tree_tag,... | #include <iostream>
#include <cmath>
using namespace std;
const double EPS = (double)(1e-9);
double R, X, Y;
int main(void) {
cin >> R >> X >> Y;
double d = sqrt(X * X + Y * Y);
double m = d / R;
int n = (int)m;
double diff = d - (R * n);
int ans = 2;
if (d >= R) {
ans = n;
if (diff > EPS)
++ans;
}
... |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
#include<stack>
#include<set>
#define iss ios::sync_with_stdio(false)
using namespace std;
typedef long long ll;
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
const int mod = 99... | #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<iostream>
using namespace std;
#include<vector>
#include <algorithm>
#include <bits/stdc++.h>
#define re(i,n) for(int i = 0; i < n; i++)
const int MOD = 998244353;
int main(){
int n, k;
cin >> n >> k;
int array[n-1];
re(i, n - 1) array[i] = i+ 1;
vector<vector<int>> t(n, vector<int>(n));
... | #include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define printara(ara, n) for(int i = 0; i < n; i++) cout << ara[i] << ' '; cout << endl;
#define printvec(vec) for(auto it : vec) cout << it << ' '; cout << endl;
#define debug(x) cout << #x << "--> " << x << endl;
#define int... |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const long long inf = 1100000000000000000;
#define maxn 1000005
#define mod 1000000007 //998244353
#define int long long
#define PB push_back
#define eb emplace_back
#define all(c) (c).begin(),(c).end()
#define pii pair <int,int>
#define v... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,s,d ,x,y,m=0;
cin >> n >> s >> d;
while(n--)
{
cin >> x >> y;
if(x<s && y >d)
{
m=1;
break;
}
}
if(m==1)
{
cout << "Yes" << endl;
}
else
cout << "No" << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 10;
char s[maxn];
int num[256];
int main(){
cin >> (s + 1);
int n = strlen(s + 1);
num[s[n]]++;
long long ans = 0;
for(int i = n - 1; i; i--){
num[s[i]]++;
if(s[i] == s[i + 1]){
ans -= num[s[i]];
for(int j = 'a'; j <= 'z'; j++) ans +... | #include <bits/stdc++.h>
#define LL long long
#define ft first
#define sd second
#define mp(x,y) make_pair(x,y)
#define int LL
using namespace std;
//const int N = ;
//const int mod = ;
const int INF =numeric_limits<int >::max();
#define For(n) for (int i=1;i<=n;++i)
#define rep(i,n) for (int i=1;i<=n;++i)
#define re... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << ... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 200;
int a[N], b[N], c[N], d[N];
int main()
{
int n;
cin >> n;
for (int _ = 0; _ < 2; _ ++)
{
for (int i = 0; i < n; i ++) cin >> a[i] >> b[i];
int x = 0, y = 0;
fo... |
#include<iostream>
using namespace std;
int t;
long long n;
int main()
{
cin>>t;
while(t--)
{
cin>>n;
if(n%2==0)
{
if(n%4==0)
cout<<"Even"<<endl;
else
cout<<"Same"<<endl;
}
else cout<<"Odd"<<endl;
}
r... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 5e2 + 50;
vector<int>vc;
bool isp(int x){
for(int i = 2;i*i <= x;i++){
if(x%i==0)return false;
}
return true;
}
int calc(int x){
int tx = x;
int cnt = 0;
for(int i = 0;i < vc.size();i++){
while(x%vc[i] == 0){
x/=vc[i];
cnt++;
}
}
return ... |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pi pair<int,int>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define ln(x) ((int)x.length())
#define mp make_pair
#define pb push_back... | #include <bits/stdc++.h>
using namespace std;
// #define endl '\n'
#define int long long int
#define rep(i, a, b) for (int i = a; i < b; i++)
#define revrep(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define min3(a, b, c) min(a,... |
#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>;
const int MaxA =200;
int main(){
//
int n;
cin>>n;
vector<int> a(n);
rep(i,n) cin>>a[i];
//
vector<int> d(MaxA*2+1,0);
rep(i,n) d[MaxA+a[i]]++;
ll ans = 0;
rep(ai,d.s... | #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... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i =0; i<(n); ++i)
using ll = long long;
using P =pair<int, int>;
int main(){
int n;
cin >>n;
vector<int> v(n);
int m=0;
rep(i,n){
cin >> v[i];
m=max(m,v[i]);
}
int ma=0;
int ... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
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 ... |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define dcml(x) cout<<fixed<<setprecision(x)
#define F first
#define S second
#define mine(a) *min_element(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int mx = 0;
int mn = 1e9 + 10;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
++mp[a[i]];
mx = max(mx, a[i]);
mn = min(mn, a[i]);
}
// cout <... |
/**
* Author: Daniel
* Created Time: 2021-04-12 12:44:39
**/
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ER erase
#define IS insert
#define PI acos(-1)
#define PB pop_back
#define MP make_pair
#define MT make_tuple
#define LB lower_bound
#define UB upper_bound
#define EB... | //noob
#include<bits/stdc++.h>
using namespace std;
#define f0(i,a,n) for(int i=a;i<n;i++)
#define f1(i,a,n) for(int i=a;i<=n;i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long int
#define ld long double
#define ull unsigned long long int
#define pi acos(-1)
#define ... |
#include<iostream>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<deque>
#include <algorithm>
using namespace std;
#define mem(a,b) memset(a,b,sizeof a)
#define PII pair<int,int>
#define ll long long
#define ull unsigned long long
#define ft fir... | #include <bits/stdc++.h>
using namespace std;
const int kN = 1e5 + 10;
int k, N, M;
int a[kN];
int main() {
scanf("%d%d%d", &k, &N, &M);
for(int i = 0; i < k; i++) scanf("%d", &a[i]);
long long l = -1, r = 1LL * M * N;
vector<pair<long long, long long>> tmp;
auto Check = [&](long long v) {
tmp.clear()... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<min(a,min(b,min(c,d)));
return 0;
}
| #include<iostream>
using namespace std;
int main() {
int a[4],i;
for(i=0;i<4;i++)
cin>>a[i];
int min=a[0];
for(i=1;i<4;i++) {
if(a[i]<min) min = a[i];
}
cout<<min;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define INF 0x3f3f3f3f
#define pi M_PI
typedef pair<ll, ll> llPair;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef priority_queue<ll> pqll;
ll MOD = 1000000007;
/*
So much for summer love and sayin... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n,m;
cin >> n >> m;
vector<ll> h(n);
vector<ll> w(m);
for(int i... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
ll N;
bool judge[400005];
ll ans[400005];
ll sum[400005];
ll A[400005];
void solve(){
vector<P>AA(2*N);
for(ll i=0;i<2*N;i++)AA[i]=P(A[i],i);
sort(AA.begin(),AA.end());
for(ll i=0;i<N;i++)judge[AA[i].second]=true;
for(... | // Problem: E - Unique Color
// Contest: AtCoder - AtCoder Beginner Contest 198
// URL: https://atcoder.jp/contests/abc198/tasks/abc198_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define pb push_back
#define sz(a) int(a.size())
using na... |
#include <bits/stdc++.h>
#ifdef DEBUG
#define D(x...) printf(x)
#else
#define D(x...)
#endif
using namespace std;
typedef long long ll;
int a[4];
int main() {
scanf("%d%d%d%d", &a[0], &a[1], &a[2], &a[3]);
for (int i = 0; i < (1 << 4); i++) {
int sum = 0;
for (int j = 0; j < 4; j++) {
if (i & (1 << j)) sum +... | #include <bits/stdc++.h>
//#include "debugger.h"
#define int long long
#define pb push_back
#define pp pop_back
#define f first
#define s second
#define all(x) x.begin(), x.end()
using namespace std;
const int nax = 1e6 + 5;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d; cin >> a >> b >> c >> d;
if(c*d - b <= 0){
cout << -1 << endl;
return 0;
}
cout << (a+c*d-b-1)/(c*d-b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps... |
//sometimes assume final ans and then approach prblm downward accordingly
#include <bits/stdc++.h>
// #include <boost/math/common_factor.hpp>
using namespace std;
#define ll long long
#define MOD 1000000007
#define init ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define test ll t; cin>>t; while(t... | #include<iostream>
#include<vector>
using namespace std;
typedef long long li;
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts))... |
#include<bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
signed main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
//MessageBox(GetForegroundWindow(),"标题","内容",MB_YESNO);
int n,i;
cin>>n;
int sum=0;
for(i=1;i<=n;i++){
sum+=i;
if(sum>=n){
break;
}
}
cout<<i;... | ///131111129..........
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi acos(-1)
#define pb push_back
#define mp make_pair
#define rip() for(ll i=0;i<n;i++)
#define rip1() for(ll i=n-1;i>=0;i--)
#define cin(a) cin>>a
#define cout(a) cout<<a
#define nl '\n'
///Chess moves.........
// in... |
#include <bits/stdc++.h>
using namespace std;
long long INF = 1LL<<60;
using ll = long long;
using vll = vector<ll>;
using mll = map<ll, ll>;
#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()
template<class T>bool chma... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... |
#include<stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a < b) {
if (a + 3 > b)
printf("Yes\n");
else
printf("No\n");
}
else
if (a > b) {
if (b + 3 > a)
printf("Yes\n");
else
printf("No\n");
}
} | #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;
#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
//mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,T y){if(x<y)x=y;}
template<typename T>v... | //g++ -std=c++14 test.cpp -o test.out
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include ... |
#include<bits/stdc++.h>
using namespace std ;
using ll = long long ;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if(c * d <= b) cout << -1 ;
else {
cout << (a + c * d - b - 1) / (c * d - b) ;
}
return 0 ;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#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()
#define PI 3.14159265358979323846264338327950L
#define RADIAN PI/180.0
typede... |
/*
author : aryan57
created : 06-June-2021 18:04:35 IST
*/
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template <typename T_container, typename T = typename enab... | // abc181_f
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(... |
#include <bits/stdc++.h>
void check_and_add(std::map< long long, long long >& mp, long long num, long long add){
auto itr = mp.find(num);
if(itr == mp.end()){
mp[num] = add;
}else{
mp[num] += add;
}
}
int main(){
int N;
long long X;
std::cin >> N >> X;
std::vector< long... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
map<pair<int, int>, int> ans;
int solve(vector<int> & a, int x, int st)
{
if (ans[{x, st}])
{
return ans[{x, st}];
}
if (st == n - 1)
{
return 1;
}
if (x % (a[st + 1] / a[st]) == 0)
{
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define all(v) v.begin(), v.end()
#define rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define sz(li) (int) (li).size()
#define sum(a) (accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a... |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define pb push_back
#define all(_obj) _obj.begin(),_obj.end()
#define F first
#define S second
#define INF 1e18
#define pll pair<ll, ll>
#define vll vector<ll>
ll n,m,a,b,c,k,temp,x,y;
const int MAXN=1e5+11,mod=1e9+7;
ll max(ll a,ll b) {return ((a>b)?... |
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
//#include <bits/stdc++.h>
# include <iostream>
# include <array>
# include <string>
# include <vector>
# include <algorithm>
# include <functional>
# include <cmath>
# include <iomanip>
# include <stack>
# include <queue>
# include <numeric>
# include <map>
# in... | #include <bits/stdc++.h>
#define ll int64_t
using namespace std;
int dfs(vector<vector<bool>>& used, int a, int b, int r, int c) {
int h = used.size();
int w = used[0].size();
if(r == h) return 1;
int r2, c2;
if(c == w-1) r2=r+1, c2=0;
else r2=r, c2=c+1;
assert(0<=c && c<w && 0<=r && r<h);
if(used[r][c]) re... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
bool cmp(pair<int,int> &a,pair<int,int> &b)
{
return 2*a.first+a.second>2*b.first+b.second;
}
int32_t main()
{
int n;
cin>>n;
vector< pair<int,int> > v(n);
int a=0,b=0;
for(int i=0;i<n;i++)
{
cin>>v[i].first >>v[i]... | #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>;
// aoki = sum(not go)ai
// takahashi = sum(go)(ai+bi)
//takahashi>aoki => sum(go)bi+sum(go)(ai)> sum(not go)(ai)
//takahashi>aoki => sum(go)bi + 2sum(go)(ai) > sum(all)(ai)
bool OK... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(vector<bool>::reference b) { return to_string(int(b)); }
string to_stri... | // E - 潜入
#include <bits/stdc++.h>
using namespace std;
#define vec vector
using vi = vec<int>;
using PR = pair<int,int>;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
int V; // 頂点数
vec<vec<PR>> G; // [from]<to, cost> 隣接リスト
int INF = 1e9;
vi dijkstra(int s){
vi dist(V, INF);
dist[s] = 0;
priority_queue<PR, vec<PR>,... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a==b+c+d)return puts("Yes"),0;
if(b==a+c+d)return puts("Yes"),0;
if(c==b+a+d)return puts("Yes"),0;
if(d==b+c+a)return puts("Yes"),0;
if(b+a==c+d)return puts("Yes"),0;
if(a+c==b+d)return puts("Yes"),0;
if(b+c==a+d)return p... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define RI register int
typedef long long LL;
#define int LL
#define FILEIO(name) freopen(name".in", "r", stdin), freopen(name".out", "w", stdout);
using namespace std;
namespace IO {
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc... |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
ll n, m;
bool v[1005][1005];
ll cp[2005];
bool v1[2005], v2[2005];
ll cnt1, cnt2;
ll fnd(ll p)
{
if(cp[p] == p) return p;
return cp[p] = fnd(cp[p]);
}
void uni(ll p, ll q)
{
if(fnd(p) == fnd(q)) return;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,m,ans=0;
string s[1010];
bool visr[1010]... |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<long long> a;
int main() {
cin >> n;
a.resize(n);
long long sum = 0, num = 0, res = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
num = max(a[i], num);
res += a[i];
res += sum;
sum += a[i];
cout << num * (i + 1) + res << endl;... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define reg register
#define For(i,a,b) for(reg int i=a;i<=b;++i)
#define Down(i,a,b) for(reg int i=a;i>=b;--i)
#define ull unsigned long long
#define ll long long
inline int max(int x,int y){return x>y?x:y;}
inline int min(int x,int y){return x<y?x:y;... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("O3")
#pragma GCC target ("avx,avx2,fma")
#ifdef LOCAL
#define D(a) cerr << #a << " = " << a << endl
#else
#define D(a) 8
#endif
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define dforsn(i,s,n) for(int i=int(n-1);i>=int(s);i... | #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;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long int
#define double long double
#define ff first
#define ss seco... | // C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
LL a[101010], aCum[101010];
int main(){
// 1. ... |
//#undef DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll llinf = (1ll<<61)-1;
#define sz(a) int(a.size())
#define all(x) begin(x), end(x)
#ifdef DEBUG
const int DEBUG_END = 26;
#define DOS cout
#include <debug.h>
#else
#define bug(args...) void()
#define cbug(a, args...)
#endif
#defin... | #include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<iomanip>
#include<regex>
using namespace std;
#define int long long
const int mod=1e9+7;
signed main(){
int t,n,p[500];
cin>>t;
while(cin>>n)... |
/***
⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀⠀⠀⠹⣿⣷⣄⠀⣿⣿⣿⣿⠀⣠⣾⣿⠏⠀⠀⠀⠀... | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
int main(){
... | #include <bits/stdc++.h>
using namespace std;
#define present(container, element) (container.find(element) != container.end())
#define cpresent(container, element) (find(all(container), element) != container.end())
#define INF 0x3f3f3f3f
#define f1(i, n) for (int i = 0; i < n; ++i)
#define f2(i, n) for (int i = 1; i ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(void){
int n,s,d;
bool ok = false;
cin >> n >> s >> d;
vector<int> x(n),y(n);
rep(i,n) cin >> x[i] >> y[i];
rep(i,n){
if(x[i] < s && y[i] > d) ok = true;
}
if(ok) cout << "Y... |
//#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 <... | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N = 1e6 + 50;
int k;
ll ans;
bool vis[105], is[10];
int qpow(int x, int k){
int ans = 1;
while(k){
if(k & 1) ans = 1LL * ans * x % 4;
x = 1LL * x * x % 4, k >>= 1;
}
return ans;
}
int main(){
int a, b, c;
scanf... |
//#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define SZ(x) ((int)x.size())
#define uni(x) sort(all(x)),x.resize(unique(all(x))-x.begin());
#define GETPOS(c,x) (lower_bound(all(c),x)-c.begin())
#define lown1(x,val) low(in(x),val)-x
#define lowm1(x,val) low(im(x),val)-x
#define low1(x,nums,val) low(x+1,x+nums+1,val)... | #include <bits/stdc++.h>
#include <random>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n; cin >> n;
vector<string> s(n);
vector<vector<int>> vis(n, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
cin >> s[i];
for ... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n)
using namespace std;
using ll = long long;
using vll = vector<... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define N 200100
#define MOD 1000000007 //998244353
#define ll long long
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = a; i <= b; ++i)
#define rep3(i, a, b) for(int i = a; i >= b; --i)
#define eb emplace_back
#defi... |
#include<bits/stdc++.h>
using namespace std;
#include <iostream>
#include <sstream>
#define ll long long
int main()
{
ll i,j,k,n,m,a,b;
string st;
cin>>st;
n=st.size();
if(n==1){
cout<<0<<endl;
return 0;
}
string st1="",st2="";
if(n%2==1){
for(i=0;i<n/2;i++){
... | #include <cstdio>
#include <cmath>
using namespace std;
typedef long long LL;
inline bool check(const LL& x, const LL& n)
{
LL p = 1LL;
while(p <= x) p *= 10LL;
return x * p + x <= n;
}
int main()
{
LL n;
scanf("%lld", &n);
LL l = 0LL, r = sqrt(n);
while(l < r)
{
LL mid = l + r + 1LL >> 1LL;
if(check(mid... |
#include <bits/stdc++.h>
using namespace std;
uint64_t FindSum(const uint64_t a, const uint64_t b, const uint64_t c) {
uint64_t k = (c * (c + 1) / 2);
k %= 998244353;
uint64_t j = (b * (b + 1) / 2);
j %= 998244353;
j = j * k;
j %= 998244353;
uint64_t i = (a * (a + 1) / 2);
i %= 9982... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... |
#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>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#inc... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif
template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typen... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll mod=1000000007;
int main(){
int N,M;
cin >> N >> M;
vector<vector<int>> P(N);
for(int i=0;i<N;i++){
int A;
cin >> A;
P[A].push_back(i);
}
for(int i=0;i<N;i++){
int prev=-1;
P[i].push_bac... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6;
typedef long long ll;
template<class T> T read()
{
T f = 1, k = 0;
char c = getchar();
while (c < '0' || c > '9')
{
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
{
k = k * 10 + c - '0';
c = getchar();
}
return ... |
#include <cstdio>
#include <cstring>
#define mo 998244353
#define N 200010
using namespace std;
int f[N], jl, n;
bool bz1[N], bz2[N];
void dfs(int x){
bz2[x]=1;
if (!bz2[f[x]]) dfs(f[x]);
else if (!bz1[f[x]]) jl++;
bz1[x]=1;
}
int ksm(int x, int y){
int ans=1;
while (y){
if (y&1) ans=1ll*ans*x%mo;
x=1ll*x... | #include <bits/stdc++.h>
using namespace std;
const int MAXX = 2e5 + 10, MOD = 998244353;
long long n, tmp, ans = 1;
vector <int> adj[MAXX];
bool vis[MAXX];
void dfs(int v) {
vis[v] = 1;
for(auto x : adj[v])
if(!vis[x])
dfs(x);
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
... |
#include <bits/stdc++.h>
#define li long int
#define lli long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define si size()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define lb lower_bound
#define ub upper_bound
#define BS binary_search
#define... | #include <iostream>
void solve() {
int a, b, c, d;
std::cin >> a >> b >> c >> d;
std::cout << a * d - b * c << "\n";
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
solve();
return 0;
}
|
// Problem: C - Many Segments
// Contest: AtCoder - AtCoder Beginner Contest 207
// URL: https://atcoder.jp/contests/abc207/tasks/abc207_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define int long long
#define max3(a,b,c) max(a,max(b,c)... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
template<class G>
class Fenwick_tree{
vector<G> a;
public:
Fenwick_tree(){}
Fenwick_tree(int n){ build(n); }
Fenwick_tree(const vector<G>& a){ build(a); }
void build(int n){
a.assign(n,G{});
}
void bu... |
#include<bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i) < (n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i) < (n);(i)++)
using namespace std;
using ll = long long;
using ld = long double;
template<typename T>
bool chmax(T &a,const T &b) {if(a < b) {a = b;return true;}return false;}
template<typename T>
bool chmi... | #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>
... |
#include<bits/stdc++.h>
#define ll long long int
#define pll pair<ll,ll>
#define vpll vector< pll >
#define mpll map<ll,ll>
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define s(v) v.size()
#define test ll t;cin>>t;while(t--)
#define vec vector<ll>
#define read0(v,n) for(int i=0;i<n;i++)cin>>v[i];
#define r... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typenam... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n, sum = 0;
cin >> n;
vector< int > a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
sort(a.begin(), a.end());
vector< bool > dp(sum+1, false);
dp[0] = true;
... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <typename T>bool chmin(T &a, c... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define itn int
#define ll long long
using namespace std;
ll read(){
ll a=0,b=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')b=-1;c=getchar();}
while(c>='0'&&c<='9')a=a*10+c-48,c=getchar();
return a*b;
}
ll n,m,k,a[300005... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0; i<(n); ++i)
#define rep1(i,n) for(ll i=1; i<=(n); ++i)
#define revrep(i,n) for(ll i=(n)-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 62) -1;
#define fastio cin.tie(nullptr); ios_base::sync_with_stdio(false);
#define new... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int> ... | #include<iostream>
#include<cstring>
#include<cassert>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<vector>
#include<time.h>
#include<bitset>
#include<cstdio>
#include<algorithm>
using namespace std;
#define REP(i,x,y) for(int i=x;i<=y;i++)
#define rep(i,n) REP(i,1,n)
#define rep... |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
int n,q;
ll a[200005];
int t[200005];
P p[200005];
ll ans[200005];
int main(void){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%lld%d",&a[i],&t[i]);
}
scanf("%d",&q);
for(int i=0;i<q;i++){
ll... |
#include<bits/stdc++.h>
using namespace std;
long long int BIT[300001],N;
long long int sum(int i){
long long int s = 0;
while(i > 0){
s += BIT[i];
i -= i & -i;
}
return s;
}
void add(int i,long long int x){
while(i <= N){
BIT[i] += x;
i += i & -i;
}
}
int main(){
cin >> N;
long lo... |
//In the Name of Allah Most Gracious, Most Merciful//
/*If you want something you've never had, you have to do something you never did.*/
#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 pb push_back
#de... |
// C - Bowls and Dishes
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i=0; i < n; i++) // 0 ~ n-1
template<class T> inline bool chmax(T& a, T& b) { if (a < b) { int tmp=a; a=b; b=tmp; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T& b) { if (a > b) {... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(all(x)),x.end())
typedef long long ll;
typedef pair<int,int> P;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll fpow(ll ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
constexpr ll MAX = 61;
int main(){
ll a, b, k;
cin >> a >> b >> k;
vector<vector<ll>> comb(MAX,vector<ll>(MAX));
rep(i,MAX) comb[i][0] = 1;
for(int i = 1; i < MAX; i++) {
for(int j = 1; j ... | #include<bits/stdc++.h>
using namespace std;
#define gc c=getchar()
#define r(x) read(x)
#define ll long long
#define db double
template<typename T>
inline void read(T&x){
x=0;T k=1;char gc;
while(!isdigit(c)){if(c=='-')k=-1;gc;}
while(isdigit(c)){x=x*10+c-'0';gc;}x*=k;
}
const int p=998244353;
const in... |
//To debug : g++ -g file.cpp -o code
//to flush output : fflush(stdout) or cout.flush()
//cout<<setprecision(p)<<fixed<<var
//use 1LL<<i to for 64 bit shifting , (ll)2 because by default 2 is ll
//take care of precedence rule of operators
//do not forget to change the sizes of arrays and value of contants and other t... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,ans,len,sum;
int main(){
cin>>n;
if(n>=1000) ans+=n-999;
if(n>=1000000) ans+=n-999999;
if(n>=1000000000) ans+=n-999999999;
if(n>=1000000000000) ans+=n-999999999999;
if(n>=1000000000000000) ans+=n-999999999999999;
cout<<ans... |
#pragma GCC optimize ("O3")
#pragma GCC target("avx512f")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#defi... | #include <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 ;
int main ()
{
int t, n, i, j, x, y ;
char c ;
string s, s1, s2 ;
cin>>x>>y>>n ;
if( ((x*x) + (y*y)) < (n*n) ) cout<<"Yes" ;
else cout<<"No" ;
return 0 ;
} | #include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<regex>
#include<utility>
#include<queue>
#include<map>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
vec... |
//GIVE ME AC!!!!!!!!!!!!!!!!!
//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define floatset() fixed<<setprecision(15)
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
#define rep(i,... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
template<class T> inline bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
t... |
//做题头
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define _PI acos(-1.0)
#define INF 0x3f3f3f3f
#define esp 1e-9
#define IOS std::ios::sync_with_stdio(0);cin.tie(0);
#define FRE freopen("abc.in", "r", stdin)
#define MEM(X,Y) memset(X,Y,sizeof(X))
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rep1(i,a,b) for(int ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf=0x3f,INF=0x3f3f3... | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define int long long
#define double long double
#define PI 3.14159265
//=======================
//created by shail
const int mod = ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 REP(i,a,b) for(int i = (a); i < (b); i++)
#define MOD 1000000007
int main(void) {
int t;
ll n;
cin >> t >> n;
ll a;
if(n*... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int n... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n... | #include<bits/stdc++.h>
template<class T>
using pq_inv = std::priority_queue<T, std::vector<T>, std::greater<>>;
int main(){
using namespace std;
unsigned long N;
cin >> N;
vector<pair<unsigned long, unsigned long>> house(N);
for(auto&& [x, y] : house){
cin >> x >> y;
x += 10000000... |
#include <bits/stdc++.h>
const int maxn=100000;
using namespace std;
int a[1000000]={0,1,2,2,3};
int isprime[maxn+100];
int prime[maxn+100];
int num=0;
void init(){
for(int i=0;i<=maxn;i++)isprime[i]=1;
isprime[1]=0;
for(int i=2;i<=maxn;i++){
if(isprime[i]==1){
prime[num++]=i;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define pb push_back
#define mod 1000000007
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define PI 3.1415926535
#define INF INT_MAX
#define SPEED \
ios_base::sync_with_stdio(false)... |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int a, x;
cin>>a;
if(a%100)
{
x=a/100 + 1;
}
else
{
x=a/100;
}
cout<< x << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define mem1(a) memset (a,-1,sizeof(a))
#define mem0(a) memset (a,0,sizeof(a))
#... |
#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma comment(linker, "/stack:200000000")
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define MP make_pair... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int a[N],b[N],n;
int main() {
ios::sync_with_stdio(0);
cin >> n;
for(int i=1;i<=n;++i){
cin >> a[i];
a[i]=max(a[i],a[i-1]);
}
for(int i=1,j=0;i<=n;++i){
cin >> b[i];
if(1LL*b[i]*a[i]>1LL*b[j]*a[j])j=i;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.