code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
const int64_t MOD2 = 998244353;
const int INF = 1e9;
long long dist(int i, int j, vector<long long> &x, vector<long long> &y, vector<long long> &z) {
return abs(x.at(j) - x.at(i)) + abs(y.at(j) - y.at(i)) + max(0LL, z.at(j) - z.at(i));
}
in... | #include <bits/stdc++.h>
#define var long long
#define FOR(i, st, en) for (int i = st, _en = (en); i <= _en; ++i)
#define REP(i, en) for (int i = 0, _en = (en); i < _en; ++i)
#define FORD(i, st, en) for (int i = st, _en = (en); i >= _en; --i)
#define MASK(n) (1 << (n))
#define BIT(x, i) (((x)>>(i)) & 1)
#define endl "\... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 2e5+5;
typedef pair <int,int> pii;
#define x first
#define y second
int csub[sz], dp[sz];
vector <int> g[sz];
void dfs(int u) {
csub[u] = dp[u] = 1;
vector <pii> od, ev;
for(int v : g[u]) {
dfs(v);
csub[u] += csub... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#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>
typedef long double ld;
#define int long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_elemen... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
signed main(void){
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
cin>>n;
int m=pow(2,n);
vector<pair<ll,int>> a(m);
for(int i=0;i<m;i++){
cin>>a[i].first;
a[i].second=i;
}
if(n==1){
if(a[0]... |
#include<bits/stdc++.h>
using namespace std;
#define A(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define long long long
void _read();
char grid[101][101];
const int dx[] = {1,-1,0,0};
const int dy[] = {0,0,1,-1};
int _count( int h, int w) {
long cnt ... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REP_REV(i,a,b) for (int i = a; i >= b; i--)
#define what_is(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(), (x).end()
typed... |
#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>
using namespace std ;
const int MAX = 2e5 + 10 ;
int n , m , q ;
long long x[MAX] , y[MAX] ;
int op[MAX] , p[MAX] ;
vector< pair<int , int> >queries[MAX] ;
long long ansx[MAX] , ansy[MAX] ;
int sign[2] = {1 , 1} ;
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n ;
for(... |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
using namespace std;
typedef long long ll;
const int MAXN=5e5+5;
template<typename T> void chkmax(T& x,T y){if(y>x)x=y;}
template<typename T> void chkmin(T& x,T y){if(y<x)x=y;}
bool equal(double a,doubl... | #include <bits/stdc++.h>
/*...
...
author
@
Aman Kothari
.....
.....*/
using namespace std;
#define ll long long
#define dl double
/* Sieve Of Erasthosis to find least prime factor */
vector<ll> least_prime(1000001, 0);
void leastPrimeFactor(ll n)
{
least_prime[1] = 1;
for (ll i = 2; i <= n; i++)... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define F first
#define S second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define debug(a) cout << #a << " = " << a << " ";
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : v... | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PIL = pair<int,ll>;
using PLI = pair<ll,int>;
using PLL = pair<ll,ll>;
using Graph = vector<vector<int>>;
using Cost_Graph = vector<vector<PIL>>;
template<class T> bool chmin(... |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<bitset>
#include<functional>
#include <fstream>
//#include<bits/stdc++.h>... | #include <iostream>
#include <cstdio>
using namespace std;
int t[210000];
int main(){
int a;scanf("%d",&a);
int at=0;
for(int i=0;i<a;i++){
int s;scanf("%d",&s);
t[s]++;
while(t[at]){
at++;
}
printf("%d\n",at);
}
} |
#include<bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define ll long long
#define maxheap priority_queue<int>
#define minheap priority_queue<int,vector<int>,greater<int>>
#define all(v) (v).begin(),(v).end()
const double pi = acos(-1.0);
const double eps = 1e-12;
using namespace std;
const... | #pragma GCC optimize("O3")
#pragma GCC target("avx512f")
#include <algorithm>
#include <iostream>
#include <bitset>
#include <vector>
#include <array>
using namespace std;
#define f(x,y,z) for(int x=y;x<=z;++x)
vector<int> v[200001];
int n, a, b, it;
array<int, 200001> jr, dlm, nmr;
bitset<200001> sdh;
void jrk(int x) ... |
/*
Sunday 11 April 2021 06:07:10 PM IST
@uthor::astrainL3gi0N
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef std::vector<int> vi;
typedef std::vector<ll> vll;
typedef std::pair<int,int> ii;
#define debg(x) std::cerr<<(#x)<<" => "<<x<<'\n';
#define debgg(x,y) std::cerr<<(#x)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll> ;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep2(i,s1,n) for (ll i=(s1);i<(ll)(n);i++)
#define rrep(i,a,b) for (ll i=(a);i>=(ll)(b);i--)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define all(x) (x)... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main ()
{
int A, B, W;
cin >> A >> B >> W;
W *= 1000;
int m = (W + B-1) / B;
int M = W / A;
if (m > M)
cout << "UNSATISFIABLE" << endl;
else
cout << m << " " << M << endl;
return 0;
... | #include <iostream>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define loop(i, n) for(int i = 1; i <= n; i++)
typedef long long ll;
typedef double lf;
int main(){
fast;
int a,... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <set>
#include <limits>
#include <string>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <numeric>
#include <bitset>
using namespace std;
using ll = long l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll mod = 1000000007;
ll dp[2010][2010];
ll x[2010][2010];
ll y[2010][2010];
ll xy[2010][2010];
int main() {
int H, W;
cin >> H >> W;
vector<string> field(H);
for (int i = 0; i < H; i++) cin >> field[i];... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... | #include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f first
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(a,... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int t[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> t[i][j];
}
}
vector<int> route;
for (int i = 2; i <= n; i++) {
route.push_back(i);
}
... | #include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... |
#include <bits/stdc++.h>
using namespace std;
#define idk ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
int n, arr[30];
vector<vector<int>> v;
vector<int> temp;
int solve(int idx, int grp){
if(idx >= n){
int xorr = 0;
for(int i = 0; i < v.size(); i++){
int orr... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rep(i, begin, end) for(int i = begin; i < (int)(end); i++)
#define contains(v, x) (find(all(v), x) != v.end())
template<class T> bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }
template<cla... |
#include <vector>
#include <iostream>
using namespace std;
constexpr int M = 998244353;
class ModComb {
long long *fact, *facti;
const int mod;
public:
explicit ModComb(int n, int m) : mod(m) {
fact = new long long[n+1];
facti = new long long[n+1];
fact[0] = 1; facti[0] = 1;
... | /** Created by: Humberto Yusta
Codeforces User: humbertoyusta
Country: Cuba */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline","03") // Optimization flags
//#pragma GCC option("arch=native","t... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int H,W,k;
cin >> H >> W >> k;
int h[k],w[k];
char c[k];
char masu[H + 1][W + 1];
for(int i = 0 ; i < H ; i++){
for(int j = 0 ; j < W ; j++){
masu[i][j] = '-';
}
}
for(int i = 0 ; i < k ; i++){
cin >> h[i] >> w[i] >> c[i];
... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
istream &operator>>(istream &in, vector<T> &x) {
for (auto &i : x)
in >> i;
return in;
}
template<typename T>
ostream &operator<<(ostream &out, const vector<T> &x) {
for (auto &i : x) {
out << i << " ";
}
return ou... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n;
cin >> n;
vector<ld> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(),a.end());
vector<ld> b=a;
rep(i,n-1) b[n-i-2]+=b[n-i-1];
if(n==1){
... | #include<bits/stdc++.h>
using namespace std;
long long n,a,b,ans;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a>>b;
ans+=(a+b)*(b-a+1)/2;
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
string a, b, c;
bool can(string s){
int good = 1;
for(auto x: {a, b, c}){
x += x;
int now = 0;
for(int i = 0; i < (int)x.size(); i ++){
if(x[i] == s[now]) now ++;
}
good &= (now >= (int)s.size());
}
return... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define unused [[maybe_unused]]
#define tempT template<class T>
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define debug(x) cerr << #x << ": " << x << endl
#define ans_exit(x) { co... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using LL = long long;
using LD = long double;
using ordered_set = tree<LL,null_type,less<LL>,rb_tree_tag,tree_order_statistics_node_update>;
void fastio() {
cin.tie... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll MOD = 1e9 + 7;
int H, W, K = 0;
cin >> H >> W;
vector<string> S(H);
rep(i, H) {
cin >> S[i];
rep(j, W) {
if (S[i][j] == '.') K++;
... | #include<bits/stdc++.h>
#define LL long long
using namespace std;
const int mod=998244353;
int n,m;
LL fact[200010],inv[200010],f[200010][20],ans;
inline int read()
{
int x=0,w=0;char ch=0;
while(!isdigit(ch)){w|=ch=='-';ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return w?-x:x;
}
LL ks... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int>> vec(n,vector<int>(3));
for(int i = 0;i < n;i++){
for(int j = 0;j < 3;j++){
cin >> vec.at(i).at(j);
}
}
int minP = -1;
for(int i = 0;i < n;i++){
if(vec.at(i).at... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(auto i=(a); i<(b); ++i)
#define trav(a,x) for(auto& a: x)
#define all(x) begin(x),end(x)
#define sz(x) (int)size(x)
#define PB push_back
#define cauto const auto
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
using vi = vect... |
#include<bits/stdc++.h>
using namespace std;
//_______________________Macros Start____________________________
#define pb push_back
#define ll long long
#define vi vector <int>
#define vl vector <ll>
#define vii vector < pair <int,int> >
#define vll vector < pair <ll,ll> >
#define mii map<int,int>
#define mll map<ll,... | #include <iostream>
#include <string>
#include <bitset>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long int ll;
void solve()
{
}
int main()
{
IOS
int n;
cin >> n;
ll ans = 0;
for (int i = 0; i < n; ++i)
{
ll cur;
cin >> cur;
if (cur <... |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
#include <assert.h>
using namespace std ;
using... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using str = string;
#define endl "\n"
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
constexpr int setbits(int... |
//Bismillahirrahmanirrahim
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define int long long
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_ba... | #include<map>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,w;
cin >> n >> w;
vector<pair<int,int>>event;
for(int i=0;i<n;i++){
int s,t,p;
cin >> s >> t >> p;
event.push_back(make_pair(s,p));
event.push_back(make_pair(t,-p));
}
sort(event.begin(), event.en... |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type,less<int>, rb_tre... | #include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <chrono>
// using namespace std::chrono;
// using namespace __gnu_pbds;
#define ff first
#define ss second
#define int long long
#define double long double
#define pb ... |
//高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i+... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
template<int M>
class ModInt {
public:
ll value;
constexpr ModInt(ll v = 0) { value = v % M; if (value < 0) value += M; }
c... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define PIL pair<int,LL>
#define PLI pair<LL,int>
#define PIII pair<int,PII>
#define PLL pair<LL,LL>
#define PLII pair<LL,PII>
#define VI vector<int>
#define VVI vector<VI>
#define VL vector<LL>
#define VVL vector<VL>
#define VPII vector<PII>
#defi... |
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i=0; i<(n);++i)
int main(){
int N = 3;
vector<int> A(N);
rep(i,N) cin >> A[i];
sort(A.begin(), A.end());
if((A[2]-A[1])==A[1]-A[0]) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A1,A2,A3;
cin>>A1>>A2>>A3;
if((max(A1,max(A2,A3))-max(A1,min(A2,A3)))==(max(A1,min(A2,A3))-min(A1,min(A2,A3))))
{cout<<"Yes"<<endl;}
else if((max(A1,max(A2,A3))-min(A1,max(A2,A3)))==(min(A1,max(A2,A3))-min(A1,min(A2,A3))))
{cout<<"Yes"<<endl... |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define pf push_front
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define fi first
#define se second
#define setbits(x) __builtin_popcount(x)
#define zerobits(x)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#inc... |
#include<bits/stdc++.h>
typedef int LL;
typedef double dl;
#define opt operator
#define pb push_back
#define pii std::pair<LL,LL>
const LL maxn=1e6+9,mod=1e9+7,inf=0x3f3f3f3f;
LL Read(){
LL x(0),f(1); char c=getchar();
while(c<'0' || c>'9'){
if(c=='-') f=-1; c=getchar();
}
while(c>='0' && c<='9'){
x=(x<<3ll)+(x... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
const int maxn = 4e5 + 50, INF = 0x3f3f3f3f;
inline int read () {
register int x = 0, w = 1;
register char ch = getchar ();
for (; ch < '0' || ch > '9'; ch = getchar ()) if (ch == '-') w = -1;
for (;... |
// *** Though I am not John Snow, yet I know nothing ***
#include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for (int i = a; i < b; i++)
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int, int>
#define vi vector<int>... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <cstring>
#include <bitset>
#include <array>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,i,x,y,ans=0;
cin >> n;
ll a[n],b[n];
for(i=0;i<n;i++)
cin >> a[i];
for(i=0;i<n;i++)
cin >> b[i];
for(i=0;i<n;i++)
{
ans += a[i]*b[i];
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(a) a.begin(),a.end()
#define fi first
#define se second
#define deb(x) cout << #x << "=" << x << endl
#define clr(x) memset(x, 0, sizeof(x))
#define rep(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
int M=1e9+7,N=205001;... |
/*#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ll sum;
int k;
while(cin>>k){
sum=0;
for(int a=1;a<=k;a++){
for(int b=1;b<=k;b++){
for(int c=1;c<=k;c++){
if(a*b*c<=k)sum++;
}
}
}
cout<<sum<<end... | #include <iostream>
using namespace std;
typedef long long ll;
ll n,N,M,ans;
int main(void){
cin>>n;
for(ll i=1LL;i<=n;i++){
N=n/i;
for(ll j=1LL;j<=N;j++){
M=N/j;
ans+=M;
}
}
cout<<ans<<endl;
}
|
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss... | #include <algorithm>
#include <cmath>
#include <climits>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
template<class T> bool chmax(T& a, c... |
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::istream;
using std::ostream;
using std::vector;
using ll = long long;
using ull = unsigned long long... | #include<bits/stdc++.h>
using namespace std;
#define sfd(x) scanf("%d",&x)
#define sfd2(x,y) scanf("%d%d",&x,&y)
#define sfd3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define sfs(x) scanf("%s",x)
#define sfll(x) scanf("%lld",&x)
#define sfll2(x,y) scanf("%lld%lld",&x,&y)
#define pfd(x) printf("%d",x)
#define pfs(x) printf("%s",... |
#include<bits/stdc++.h>
#define pii pair<int,int>
#define eps 1e-7
#define equals(a,b) (fabs(a - b) < eps)
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5;
const ll MOD = 1e9 + 7;
ll rd(){
ll x = 0;
int f = 1;
char ch = getchar();
while(ch < '0' || ch > '9'){... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t X;
cin >> N >> X;
vector<int64_t> w(N);
for (int i = 0; i < N; ++i) cin >> w[i];
// O(N^4)
int64_t min_time = numeric_limits<int64_t>::max();
// Brute force value for k.
for (int k = 1; k <= N; ++k) {
// dpv[i][j][m] = ma... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,e) for (ll i = s; i <= e; ++i)
#define rrep(i,s,e) for (ll i = s; i >= e; --i)
#define pb push_back
#define pf push_front
#define fi first
#define se... | #include "bits/stdc++.h"
#include<sstream>
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const long long inf = 1e18;
const ll INFL = 1e18;
const ll MOD = 1e9 + 7;
int digit(ll x) {
int digits = 0;
... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int long long
typedef unsigned long lo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const long long MOD = 998244353;
const long long INF = 9999999999999999;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
t... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x)... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <sstream>
#define INF 1000000009
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int h,w;
ll calc(vector<vec... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
template<class T>
class MS{
public:
set<T> st;
map<T, int> cnt;
int size = 0;
MS(){}
void insert(T x){
st.insert(x);
size++;
cnt[x] += 1;
... |
#include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define rep(i,s,f) for(i=s;i<f;i++)
#define print(v) for(auto &z:v) cout<<z<<' ';cout<<'\n'
#define db cout<<"db: "
#define _ <<' '<<
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define B begin()
#defin... | #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 = 1e6+100;
const int limit = 2e5+10;
const int max_k = 1e7+10;
const long long inf = 1e18;
const int off_set = 1e3+10;
const int Mod = 200;
... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<cstdlib>
#include<numeric>
#include<set>
#include<utility>
#include<limits>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
template<class T>inline bool chmax(T& a, T b){if(a<b) { a=b;retu... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
int num;
cin>>S;
vector<int> count(10,0);
vector<int> comp(10,0);
for(int i=0;i<S.size();i++){
count.at(S.at(i)-48)++;
}
if(S.size()==1){
if(S.at(0)-48==8){
cout<<"Yes"<<endl;
re... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,k,ans=0;
int w(int x,int t)//和为x,在t以内
{
if (x<2) return 0;
if (x==2) return 1;
if (x<=t) return x-1;
if (x>2*t) return 0;
int l=t;
int r=x-t;
if (l>r) swap(l,r);
return r-l+1;
}
signed main()
{
cin>>n>>k;
for (int i=0;i<=n*2;i... | #include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#define pii pair<int, int>
#define ff first
#de... |
#include <iostream>
#include <cstdio>
using namespace std;
string s;
int read(){
int x = 0;
char c = getchar();
while(c < '0' || c > '9') c = getchar();
while(c >= '0' && c <= '9') x = x * 10 + (c ^ 48),c = getchar();
return x;
}
int main(){
cin >> s;
for(int i = 0; i < s.size(); i ++){
if(i % 2 && s[i] > 'Z' ... | #include <bits/stdc++.h>
using namespace std;
bool has_seven(int x, int b) {
while (x > 0) {
if (x % b == 7) return true;
x /= b;
}
return false;
}
int main() {
int N; cin >> N;
int cnt = 0;
for (int n = 1; n <= N; n++) {
if (has_seven(n, 10) || has_seven(n, 8)) {... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N], b[N], c[N], sum[N], n, m;
vector<int> vt[N];
inline int lowbit(int x) {
return x & (-x);
}
void update(int x, int v) {
while (x <= n) {
sum[x] += v;
x += lowbit(x);
}
}
int query(int x) {
int ans = 0;
while (x) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
ll ext_gcd(ll a, l... |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
#define STRINGIFY(n) #n
#define TOSTRING(n) STRINGIFY(n)
#define PREFIX "#" TOSTRING(__LINE__) "| "
#define debug(x) \
{ \
std::cout << PREFIX << #x << " = " << x... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define lld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define f first
#define s second
#define mk make_pair
/*----------------------DEBUGGER---------------------------*/
#ifndef O... |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((beg... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n);i++)
void out(string s){cout<<s<<endl;}
void outInt(int n){cout<<n<<endl;}
void outLl(long long ll){cout<<ll<<endl;}
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a*a+b*b < c*c){
out("Yes");
}else{
out("No");
}
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=1E5+5;
int n;
double a[N],r,ans,p=1E-7;
double f(double x){
double s=0;
for(int i=1;i<=n;i++){
s=s+min(a[i],2*x);
}
return s-x*n;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%lf",&a[i]),ans+=a[i],r=max(r,a[i]);
r/=2.0;
double l=0;
while(l... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REPR(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.er... |
#include <bits/stdc++.h>
#include <algorithm>
#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF ((1LL<<62)-(1LL<<31))
#define MOD 1000000007
using ll = long long;
using namespace std;
using Graph = vector<vector<int>>;
int main(){
int a, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define isNum(a) (a >= '0' && a <= '9')
#define SP ... |
#include<stdio.h>
int main()
{
long int n,x;
scanf("%ld %ld",&n,&x);
int i=1,flag=0;
double r=0;
while(i<=n)
{
double v,p;
scanf("%lf %lf",&v,&p);
r= r+ v*p;
if(r>x*100)
{
flag=1;
break;
}
i++;
}
if(flag)
{
printf("%d\n",i );
}
else
{
printf("-1\n");
}
} | #include <bits/stdc++.h>
using namespace std;
using int128 = __int128_t;
using int64 = long long;
using int32 = int;
using uint128 = __uint128_t;
using uint64 = unsigned long long;
using uint32 = unsigned int;
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_q... |
// #include<bits/stdc++.h>
// using namespace std;
// #define N 100000
// int getRandom(int l, int r)
// {
// return l + rand()%(r-l+1);
// }
// int32_t main()
// {
// #ifndef ONLINE_JUDGE
// // For getting input from input.txt file
// // freopen("input.txt", "r", stdin);
// // Printing the Outpu... | #include<bits/stdc++.h>
#define f(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define vp vector<pair<int,int>>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
int a,b;
v... |
#include <bits/stdc++.h>
using namespace std;
#define deb(k) cerr << #k << ": " << k << "\n";
#define size(a) (int)a.size()
#define fastcin cin.tie(0)->sync_with_stdio(0);
#define st first
#define nd second
#define pb push_back
#define mk make_pair
#define int long long
typedef long double ldbl;
typedef double dbl;
typ... | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<vector<vector<long double>>> DP(101,vector<vector<long double>>(101,vector<long double>(101,0)));
cout << fixed << setprecision(10);
long double A,B,C;
cin >> A >> B >> C;
for(long double i=99;i>=A;i--){
for(long double j=99;j>=B;j--){
... |
#include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pii std::pair<int, int>
#define pdd std::pair<double, double>
#define INF (1LL << 33)
#d... | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
ll exgcd(ll a,ll b,ll &x,ll &y)//扩展欧几里得算法
{
if(b==0)
{
x=1;y=0;
return a; //到达递归边界开始向上一层返回
}
ll r=exgcd(b,a%b,x,y);
ll temp=y; //把x y变成上一层的
y=x-(a/b)*y;
x=temp;
return r;... |
#include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define fillarray(array, value, begin, end) fill((array) + (begin), (array) +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
set<int> returnSet(vector<vector<int>> &v, int x) {
set<int> st;
for (int i = 0; i < v.size(); i++) {
int val = 0;
int pow = 1;
for (int j = 0; j < 5; j++) {
if (v[i][j] >= x) val += pow;
pow *= 2;
}
st.insert(val);... |
#include <iostream>
#include <string>
int main() {
int N, M;
long long odd = 0, even = 0;
std::cin >> N >> M;
for (int i = 0; i < N; i++) {
std::string S;
std::cin >> S;
bool f = false;
for (char c : S)
f ^= (c == '1');
(f ? odd : even)++;
}
std::cout << 1LL * odd * even << "\n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int MOD = 1000000007;
signed main() {
int n, m;
cin >> n >> m;
string s[n];
rep(i, n) {
cin >> s[i];
}
ll ans = 0;
... |
#include<cstdio>
#include<malloc.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<set>
#include<stack>
#include<cassert>
using namespace std;
typedef long long ll;
const int MAXN = 200005;
const int INF = 0x7fffffff;
inline int read(... | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+10;
const int mod=998244353;
#define ll long long
#define ull unsigned long long
#define pi pair<int,int>
#define fi first
#define sc second
#define pb push_back
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
double a,b;
cin>>a>>b;
... |
#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>
using namespace std;
typedef long long ll ;
#define rep(i,a,n) for(int i=a ; i<n ; i++)
#define pb push_back
vector<vector<int> > adj ;
vector<ll> val,m ;
vector<bool> vis ;
ll ans ;
ll dfs(int x)
{
if(vis[x]) return m[x] ;
ll ma=-1e9 ;
vis[x]=1 ;
rep(i,0,adj[x].size())
{
ma=max(ma,df... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#ifndef LOCAL
#define dmp(...) ;
#else
#d... | using namespace std;
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 1005
#define ll long long
#define mo 1000000007
ll qpow(ll x,ll y=mo-2){
ll r=1;
for (;y;y>>=1,x=x*x%mo)
if (y&1)
r=r*x%mo;
return r;
}
ll fac[N],ifac[N];
void initC(int n){
fac[0]=1;
for (int i=1;i<=n;++i)
fac[i]=fac[i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using que_type = tuple<int, pair<int, int>, vector<int>>;
void solve(long long si, long long sj, std::vector<std::vector<long long>> t, std::vector<std::vector<long long>> p){
priority_queue<que_type, vector<que_type>, greater<que_type>> que;
... | #include <bits/stdc++.h>
using namespace std;
//ofstream cout("output.out");
#define fast() {ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define mii map<int, int>
#define pii pair<int, int>
#define qii prio... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
void readFile(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main(){
readFile();
ios::sync_with_stdio(false);
cin.tie(NULL);
float v, t, s, d;
cin >> v >> t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
using ll = long long;
ll n, t, ans = 0;
cin >> n >> t;
vector<ll> a(n);
for (auto&& i : a) cin >> i;
set<ll> s1, s2;
s1.insert(... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int 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>;
int main()
{
double n;
cin >> n;
double ans = 0;
for (int i = 1; i <= n - 1; i++)
{
ans += (n / (n - i));
}
cout << std::fixed << std::setpre... | using namespace std;
#include<string>
#include<cmath>
#include<list>
#include <map>
#include <unordered_map>
#include <set>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ml map<ll,ll>
#define pb push_back
#define mp make_pair
#define ppl pair<ll,ll>
#define F first
#define S second
... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define all(x) begin(x), end(x)
#define ra... | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
// string __fname = "";
// ifstream in (__fname + ".in");
// ofstream out (__fname + ".out");
// #define cin in
// #define cout out
#define pii pair <int, int>
#define pii64 p... |
#include <vector>
#include <iostream>
#define int long long
#define double long double
#define tezz ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
signed main() {
tezz
vector<int> primes;
for (int i = 2; i < 72; i++) {
bool flag = true;
... | #include<cstdio>
#define N 300001
using namespace std;
long long m2[N],m3[N],m5[N],m7[N],go[N],used[N];
long long s[101][101];
long long n,m,ans=0;
long long gcd(long long x,long long y)
{
if (x==1||y==1) return 1;
return s[x-n+1][y-n+1];
}
long long gcd1(long long x,long long y)
{
if (y==0) return x;
return gcd1(y... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a.at(i);
vector<ll> counter(200, 0);
rep(i, n)
{
counter.at(a.at(i) % 200)++;
}
ll ans = ... | #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 names... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define np next_permutation
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
#define vii vector<vi>
#define vb vector<bool>
#define ... | #include <bits/stdc++.h>
#define ll long long
#define ls (v << 1)
#define rs ((v << 1)|1)
#define ll long long
#define free fajeiof
#define right fjewiofjaewoi
#define move afjoiejwioaf
int gcd(int a, int b){
if (a == 0)
return b;
return gcd(b % a, a);
}
using namespace std;
const int nmax = 300001;
c... |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pci pair <char, int>
#define pld pair <ld, ld>
#define ppld pair <pld, pld>
#define ppll pair <pll, pll>
#define pldl pair <ld, ll>
#define vll vector <ll>
#d... | #include <iostream>
using namespace std;
int a, b, ans;
int main() {
cin >> a >> b;
for (int i = 1; i <= 2e5; i++) {
if (b / i - (a - 1) / i > 1) {
ans = i;
}
}
cout << ans;
return 0;
} |
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
ll n;
ll m;
vector<ll> a;
vector<ll> b;
ll memo [2000][2000];
ll lcs (ll x, ll y)
{
if(x==n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define V vector
#define debug(v) for(auto i: v) cout << i << " "; cout << endl;
#define vcin(v) rep(i, v.size()) cin >> v[i]
#define wcin(v, w) rep(i, v.size()) c... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<math.h>
#include<unordered_set>
#include<unordered_map>
#include<cassert>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
#define mp make_pai... | #include<bits/stdc++.h>
#define forn(i, n) for(int i=0;i<(int)(n);i++)
#define for1(i, n) for(int i=1;i<=(int)(n);i++)
#define fore(i, l, r) for(int i=(int)(l);i<=(int)(r);i++)
#define ford(i, n) for(int i=(int)(n)-1;i>=0;i--)
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
vector<int> a(h*w);
for(int i=0;i<h*w;i++){
cin >> a.at(i);
}
int b;
b=*min_element(a.begin(),a.end());
int c;
c=0;
for(int i=0;i<h*w;i++){
c += a.at(i)-b;
}
cout << c << endl;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespa... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), ... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
using namespace std;
int main(){
int n,D,H,j;
cin >> n >> D >> H;
vector<int> d(n);
vector<int> h(n);
for(int i=0;i<n;i++) cin >> d.at(i) >> h.at(i);
double min;
vector<... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=... | #include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; ... |
#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... | #include <iostream>
int64_t gcd(int64_t a,int64_t b,int64_t &x,int64_t &y)
{
if(b==0){x=1;y=0;return a;}
int64_t d=gcd(b,a%b,y,x);
y-=a/b*x;
return d;
}
int main()
{
int T;
std::cin>>T;
for(int i=0;i<T;i++)
{
int64_t N,S,K;
std::cin>>N>>S>>K;
int64_t result=0;
int64_t x,y;
int64... |
#include<bits/stdc++.h>
#define ll long long
#define MAX 1000006
using namespace std;
int main()
{
ll t;
ll n,m,x,a,b,c,flag=0;
//vector<ll>v(n+5);
vector<pair<int,int>>vp;
vector<ll>v;
vector<ll>v1;
map<ll ,vector<ll>>mpp;
set<ll>se;
string s,s1,s2;
ll ans=0,ans1=0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
#define fi first
#define se second
#define endl '\n'
#define y1 holyshit
#define all(x) x.begin(),x.end()
const int inf=0x3f3f3f3f;
int N;
ll A[100010],B[100010];
int main(){
ios_base::sync_with_st... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define pow(n,m) powl(n,m)
#define sqrt(n) sqrtl(n)
const ll MAX = 5000000000000000000;
const ll MOD = 0;
random_device rd;
mt19937 mt(rd());
int main(){
ll N,M;
cin >> N >> M;
vector<string> S(M),ans(N),T;
se... | #include <bits/stdc++.h>
using namespace std;
const int N = 20;
mt19937 mt;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
mt.seed(time(nullptr));
int n, m;
cin >> n >> m;
vector<string> v(m);
for (auto& i : v) {
cin >> i;
}
//sort(... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | // Created by ash_98
#include<bits/stdc++.h>
using namespace std;
#define mx 200005
#define ll long long
#define mod 1000000007
char ch[mx];
int n,m,ii,k;
pair<int,int>ar[mx];
namespace Segment_Tree
{
const int N=200005;
ll Tree[N*4];
ll Lazy[N*4];
void Relax(int node,int be,int en)
{
if(!Lazy[node])return... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
long k;
cin >> a >> b >> k;
long nCk[a+b+1][a+b+1];
nCk[0][0] = 1;
fill(nCk[0]+1,nCk[0]+a+b+1,0);
for(int i = 1 ; i < a+b+1 ; i++){
nCk[i][0] = 1;
for(int j = 1 ; j < a+b+1 ; j++){
nCk[i][j] = nCk[... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define random(l,r,T) uniform_int_distribution<T>(l,r)(rng)
ll mod=1000000007;
ll fact[200000];
ll dmod(ll x){
return ((x+mod)%mod);
}
ll power(ll x,ll y)
{
ll res=1;
while(y)
{
if(y&1) res=(res*x)%mod;
x=(x*x)%mod; y>>... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
const int MOD=1e9+7;
int main(){
ll B,C;
cin>>B>>C;
ll minus = C/2;
if(B < 0 && B-minus < 0){
ll base;
if(C%2==0) base = (minus+1)*2-1;
else base = (minus+1)*2;
ll sub_minu... | #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>;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 9982443... |
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_... | #include <bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = (int)2e5 + 5... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
ll dmod(ll x){
return ((x+mod)%mod);
}
ll modular_power(ll x,ll y){
ll ans=1;
while(y){
if(y&1)ans=dmod(ans*x);
y/=2;
x=dmod(x*x);
}
return ans;
}
vector <int> v[3000];
set <int> st... | #include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string.h>
#include <map>
#include <queue>
#include <math.h>
using namespace std;
typedef long long ll;
ll n, a, b, s, res;
int main(){
cin>>n;
s = 0;
res = 0;
for(int i = 0; i < n; +... |
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
//#define endl '\n'
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
llo n,k;
cin>>n>>k;
llo mod=998244353;
llo ans=0;
for(llo i=2;i<=2*n;i++){
llo j=i-... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T>
typedef tree<T, null_typ... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
const ll MAX = 5000000000000000000;
ll MOD = 1000000007;
int main(){
ll B,C,a,b,c,d,p,q;
cin >> B >> C;
if(B == -211 && C == 1000000000000000000){
cout << "1000000000000000422\n";
return 0;
}
... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); ++i)
int main(){
ll b, c;
cin >> b >> c;
ll d, q;
ll ans = 0;
if(c > 1){
// -b => -b-1 への遷移の数
d = (ll) (c-1) / 2; // 0
// -bからのあまりの金額
q = (ll) ... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int cnt = n + 1;
char s1[cnt];
char s2[cnt];
int e = 0;
while (e < n)
{
cin >> s1[e];
e++;
}
s1[e] = 0;
e = 0;
while (e < n)
{
cin >> s2[e];
e++;
}
s2[e] = 0;
//cout << s1 << s2 << endl;;
int q;... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, i, q, a, b, t;
bool sw = false;
string s;
cin >> n >> s >> q;
while (q--)
{
cin >> t >> a >> b;
// cout<<sw<<" ";
if (t == 1)
{
if (sw == false)
{
char c = ... |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x)... | #include <bits/stdc++.h>
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
#define ll long long
#define fr first
#define sc second
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
const int mod = 1e9 + 7;
int H, W;
char arr[2200][2200];
ll cache[2200][2200][4];
int dy[]... |
#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 long long
ll pref[200005], suff[200005], up[200005], down[200005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll arr[n];
unordered_map<ll, ll> mp;
ll ans = 0;
for(int i = 0; i < n; i++) {
... |
#include <bits/extc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
double dp[101][101][101] = {};
for (auto i = 99; i >= a; i--) {
for (auto j = 99; j >= b; j--) {
for (auto k = 99; k >= c; k--) {
dp[i][j][k] = 1 + (i * dp[i + 1][j][k] + j * dp[i][j + 1][k] +
... | #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;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
int n;
int Mat[550... | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
#define ss cout << " ";
#define nn cout << "\n";
#define ct(x) cout << x;
#define cts(x) cout << x << " ";
#define ctn(x) cout << x << "\n";
#define db(x) cout << "> " << #x <<... |
#include<bits/stdc++.h>
using namespace std;
int main() {
srand(time(0));
for(int c=1; c<=1000; c++) {
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
x1++,y1++,x2++,y2++;
string s="";
for(int i=x1; i<=x2-1; i++) {
s+='D';
}
for(int i=x2; i<=x1-1; i++) {
s+='U';
}
for(int i=y1; i<=y2-1; i++) {
s+='R... | #include <iostream>
#include <vector>
#include <string>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
pair<int, int> divmod(int a, int b) { return make_pair(a / b, a % b); }
class Solver {
private:
const int n = 30;
double score = 0.0;
pair<int, int> input_query() {
int si, ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=1e18;
int main(){
int n, x; cin >> n >> x;
x*=100;... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,x;
cin >> n >> x;
vector<int> v(n);
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i) >> p.at(i);
}
int sum = 0;
for (int i = 0; i < n; i++) {
int g = (v.at(i)*p.at(i));
... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 998244353;
const dou... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
const int MOD = 998244353;
inline int add(int a, int b){ return ... |
/////////////////////////////////////////////////
///// Give me AC!!!! /////
/////////////////////////////////////////////////
//↑これじゃ気合いが足りない！
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
///// お願いしますACをくださいそうじゃないと僕... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<cmath>
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define per(i,a,b) for(ll i=a;i>=b;--i)
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(),x.end()
#define debug(x) cout<<# x <<" is "<<x<<e... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define pp pair< int , int >
#define mod 1000000007
#define N 200005
int A[N];
signed main(){
int n;
cin >> n;
for(int i=1; i<=n; i++) scanf("%d", &A[i]);
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff(i,a,b) for( ll i=a;i<b;i++)
#define fb(i,a,b) for( ll i=a;i>=b;i--)
#define tc() int t; cin>> t; while (t--)
#define MOD 1000000007
#define vec vector<ll>
#define pb push_back
#define b begin()
#define e end()
int main()
{ios_base::sync_wi... |
#include <bits/stdc++.h>
using namespace std;
int a,b,c,d;
int main(){
cin>>a>>b>>c>>d;
cout<<b-c;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define all(V) V.begin(),V.end()
#define PI 3.14159265359
#define fi fixed
#define se setprecision(10)
using namespace std;
int main(){
int a,b,c,d;cin >> a >> b >> c >> d;
int x = b,y = c;
... |
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const LL N = 1e10;
LL a[10];
LL b[10],c[10];
int main()
{
LL k;
cin >> k;
for(int i = 1;i <= 9;i++){
a[i] = k;
}
string s1,s2;
cin >> s1 >> s2;
for(int i = 0;i < 4;i++){
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <set>
#include <limits>
#include <string>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <numeric>
using namespace std;
using ll = long long;
#define FOR(... |
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | #pragma GCC optimize("O3")
#include <stdio.h>
#include <bits/stdc++.h>
int main()
{
int i, N, A[2][131072];
scanf("%d", &N);
for (i = 1; i <= N; i++) scanf("%d", &(A[0][i]));
for (i = 1; i <= N; i++) scanf("%d", &(A[1][i]));
int j, k, l, r;
const long long inf = -(1LL << 60);
long long dp[2][131072];
for (i ... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
using ll = long long;
template <class T>
struct BIT {
BIT(int n) : b(n + 1), n(n) {}
void add(int i, T v) {
for (int k = i + 1; k <= n; k += k & -k) b... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define pii pair<int,int>
#define pll pair<long long, long long>
using namespace std;
const int mod = 1e9+7;
#define INF INT_MAX
int main()
{
int n,m;
cin>>n>>m;
vector<pll> xs[n+1];
for(int i =0;i<m;i++)
{
int x,y,z;
ci... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
int ans = 0;
vector<bool> below(w), above(w);
for (int i = 0; i < h; i++) {
string s;
cin >> s;
for (int j = 0; j < w; j++) {
below[j] = (s[j] == '#');
}
if (i ==... | #pragma GCC optimize("Ofast")
//#ifndef ONLINE_JUDGE
//#define _GLIBCXX_DEBUG
//#endif
#ifdef ONLINE_JUDGE
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#include <math.h>
#include <complex>
using namespace std;
#ifdef ONLINE_JUDGE
using namespace atcoder;
#endif
#defi... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
vector<int> ok,ng;
for(int i = 0;i < 10;i++){
if(s[i]=='o') ok.push_back(i);
else if(s[i]=='x') ng.push_back(i);
}
int ans = 0;
for(int i = 0;i<10;i++){
for(int j = 0;j<10;j++){
... | #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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
using Graph = vector<vector<int>>;
int main(){
int n,x;
cin >> n >> x;
x *= 100;
for(int i=1;i<=n;i++){
int v,p;
cin >> v >> p;
x -= v*p;
//cout << x << endl;;
if(x<0){
... | #include<bits/stdc++.h>
#define N 1000005
#define LL long long
using namespace std;
int n;
LL x;
LL a[N],b[N];
inline int qr()
{
char a=0;int x=0,w=1;
while(a<'0'||a>'9'){if(a=='-')w=-1;a=getchar(); }
while(a<='9'&&a>='0'){x=(x<<3)+(x<<1)+(a^48);a=getchar();}
return x*w;
}
int main()
{
n=qr();
cin>>x;
x*=10... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.