code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
int main(){
int i,n; cin >> n;
ll s = 0;
vector<ll> v;
for(i=0;i<n;i++){
ll a,b; cin >> a >> b;
s -= a;
v.push_back(2*a + b);
}
sort(v.rbegin(),v.rend(... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> A(N),B(N),get(N);
ll a = 0,b = 0;
rep(i,N){
cin >> A[i] >> B[i];
a += A[i];
b += B[i];
... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 5005;
const int mod = 998244353;
int h, w, k;
char grid[maxn][maxn];
int dp[maxn][maxn], d[maxn][maxn], r[maxn][maxn], p[maxn];
int recur(int i, int j) {
if (dp[i][j] != -1) return dp[i][j];
if (i == h && j == w) {
... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<stdio.h>
#include<vector>
#include<algorithm>
constexpr unsigned long long MOD = 998244353;
constexpr unsigned long long IM = 18479187003;
constexpr unsigned long long MOD32 = 665496236;
unsigned long long dp[500... |
#include<bits/stdc++.h>
using namespace std;
#define dbg(x) cerr << #x << " = " << x << endl
#define rep(i, a, b) for(int i = (a); i <= (b); ++ i)
#define MP make_pair
#define pb push_back
#define fi first
#define se second
typedef long long LL;
typedef unsigned long long u64;
typedef unsigned int u32;
template <typena... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <initializer_list>
#include <cmath>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, a, b) for(int i = (a); i <= (b); i++)
#define REPR(i, n) for(int i = (n) - 1; i >= 0; i--)
#define REPRS(i, b, a) for(in... |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <numeric>
/* debug macros */
#ifdef WAFDAYO
#define DBG_LINE() {std::cerr<<"\e[2m[L"<<__LINE__<<... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vpii=vector<pair<int,int>>;
using vpll=vector<pair<ll,ll>>;
using vs=vector<string>;
using vvc=vector<vector<char>>;
const int inf=1e9;
const ll INF=1e18;
cons... |
#include <iostream>
#include <string>
using namespace std;
int main(){
int V, T, S, D;
cin >> V >> T >> S >> D;
if (D >= V * T && D <= V * S) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
void solve()
{
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(),v.end());
if(v[2]-v[1] == v[1]-v[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
return;
}
int main()
{
ios_base... |
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define ll long long
int main(){
#ifndef ONLINE_JUDGE
freopen("C:\\Users\\User\\Documents\\input.txt","r",stdin);
#endif
int T;
cin>>T;
while(T--){
int n,x;
cin>>n;
map<int,int> mp;
for(int i=0;i<n;++i){
scanf("%d",&x);... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[... |
#include<bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define READ freopen("out.txt","r",stdin)
#define WRITE freopen("out.txt","w",stdout);
#define pb push_back
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define sf(x) scanf("%d",&x)
#define sf2(x,y) s... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se seco... |
// Problem: A - kcal
// Contest: AtCoder - AtCoder Beginner Contest 205
// URL: https://atcoder.jp/contests/abc205/tasks/abc205_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
#define int ll
#defi... | #include <bits/stdc++.h>
using namespace std;
int cnt[200005];
int main()
{
int a,b;
cin>>a>>b;
for(int i=a;i<=b;i++)
{
for(int j=1;j*j<=i;j++)
{
if(i%j==0)
{
//j, i/j
cnt[j]++;
if(j*j!=i) cnt[i/j]++;
}
}
}
for(int i=200000;i>=1;i--)
{
if(cnt[i... |
//----AUTHOR:kkdrummer----/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
type... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define pll pair<ll,ll>
#define ld long double
const int INF = 1e9 + 7;
void solve(){
set<int> possible;
ll B , C;
cin >> B >> C;
if(C == 1){
if(B == 0) cout << 1 << endl;
else cout << 2 << endl;
return;
}
ll l1 ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
using namespace std;
const int N=2e5+5;
ll mn[N],mx[N];
int main()
{
int n;
cin>>n;
for (int i=1;i<=n;++i)
mn[i]=2e9,mx[i]=-2e9;
for (int i=0;i<n;++i){
ll x,c;
cin >> x >> c;
mn[c]=min(mn[c],x);
m... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int nax=32,mod=1e9+7;
int mul(int x,int y)
{
return x*y%mod;
}
int expo(int a,int b)
{
int res=1;
while(b)
{
if(b&1)
res=mul(res,a);
a=mul(a,a);
b>>=1;
}
return res;
}
int32_t main()
{
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
for(int i = 0; i < K; i++){
if(N % 200 == 0)
N = N / 200;
else
N = N * 1000 + 200;
}
cout << N << endl;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) fo... | /**
* author: souravrax
* created: 22.05.2021 17:50:47
**/
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define len(x) int((x).size())
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M, K, i, j;
scanf("%d%d%d", &N, &M, &K);
vector<int> is_hazure(N + 1, 0);
for(i = 0; i < K; i++){
int A;
scanf("%d", &A);
is_hazure[A] = 1;
}
int now = 0;
for(i = 0; i <= N; i++){
if(is_hazure[i] == 1){
now++;
}
else{
now = 0;
... | #include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N, M, K;
cin >> N >> M >> K;
const auto unavailable{[&N, &M, &K]{
vector<unsigned long> unavailable(N + 1);
vector<unsigned long> ban;
for(unsigned long i{0}, a; i < K; ++i){
cin >> a;
... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<utility>
using namespace std;
int N, ans, a[100006];
vector<pair<int, int>> s;
int main() {
scanf("%d", &N);
s.push_back(make_pair(0, 0));
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i <= N; i++) {
if (a[... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
using namespace std;
const int SIZE = 1e4 + 1;
struct range{
int l, r;
}R[SIZE];
int a[SIZE], n;
stack<int> stk;
int main()
{
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < n; i++){
i... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
//int arr[500000]
int make_tuple(int l,int r)
{ int y= r-2*l+1;
if(y<0) return 0;
return (y*(y+1))/2;
}
int find_ans()
{ int l,r,ans;
cin>>l>>r;
ans= make_tuple(l,r);
return ans;
}
int32_t main()
{
int t;
cin>>t;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
int A,B;
cin >> A >> B;
if (A+B>=15 && B>=8) {
cout << 1 << endl;
}
else if (A+B>=10 && B>=3) {
cout << 2 << endl;
}
else if (A+B>=3) {
cout <<3 <<endl;
}
else {
cout << 4 << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
int ans = 0;
for (int i=1; i<=N; ++i){
for (int j=1; j<=K; ++j){
ans += stoi(to_string(i)+"0"+to_string(j));
... |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
const int MOD=1000000007;
vector<int>E[300000];
ll sum[300000];
int par[300000];
int dep[300000];
void dfs1(int v,int p){
par... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5+69;
int entry[N];
long long scores[N], toAdd[N], tot;
vector<int> tree[N];
void dfs(int c, int p) {
scores[c] = scores[p] + toAdd[c];
entry[c] = entry[p] + 1;
for (int i : tree[c])
if (i != p)
dfs(i, c);
}
void query(int ... |
#include <bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int GCD(int a,int b){ return b?GCD(b,a%b):a; }
bool sieve[32768]={};
vector<int> P;
vector<pair<int,int>> factorize(int N){
vector<pair<int,int>> res;
for(int p:P){
if(N%p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORe(i,a,b) for(int i=a;i<=b;i++)
#define FORr(i,a,b) for(int i=a;i>b;i--)
#define FORre(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define imie(...) " [" <<... |
#include <bits/stdc++.h>
typedef long long ll;
typedef std::vector<int> vi;
typedef std::vector<std::vector<int>> vii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define rep(i, n) for(int... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using str = string;
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
#define sz(x) (int)(x).size()
#define all(x) begin(x), ... | #include<iostream>
using namespace std;
int main(){
int N,S,D;
cin >> N >> S >> D;
for(int i=0;i<N;i++)
{
int a,b;
cin >> a >> b;
if(a < S && b > D){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} |
#include <bits/stdc++.h>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define P pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define mp make_pair
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MO... |
#include "bits/stdc++.h"
// Nagpur ki public bole to taklif
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define ... | #include <cstdio>
#include <cstring>
#include <algorithm>
#define rep(a,b,c) for(int a=b;a<=c;a++)
#define per(a,b,c) for(int a=b;a>=c;a--)
const int N=105;
const int p=1e9+7;
#define int long long
template<class T>inline void read(T &x) {
T f=1;x=0;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
... |
#include <bits/stdc++.h>
#include <vector>
#include<math.h>
#include<string.h>
using namespace std;
#define MAX 200005
#define MOD 998244353
#define SMOD 998244353
#define ROOT 512
#define GMAX 20
#define INF 2000000000
#define EPS 0.000000001
#define NIL 0
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL)
... | #include<bits/stdc++.h>
#define FastRead \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define endl "\n"
#define f for
#define ml ll t,g; cin>>t; f(g=0;g<t;g++)
#define pi acos(-1)
using namespace std;
... |
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
typedef int64_t ll;
typedef long double ld;
typedef unsigned long long ULL;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
void read(vector<int> &a) {for (auto &x : a)cin >> x;}
void read... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B, C;
cin>>A>>B>>C;
if(A>=0 && B>=0){
if(A>B) cout<<">";
else if(B>A) cout<<"<";
else cout<<"=";
}
else if(A<0 && B>=0 && C%2==0){
A = -A;
if(A>B) cout<<">";
else if(B>A) cout<<"<";
else cout<<"=";
}
... |
#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;
typedef long long ll;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_cloc... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define rep(i,a,b) for( i=a;i<b;++i)
#define repr(i,a,b) for( i=a;i>=b;i--)
#define up upper_bound
#define lb lower_bound
#define t() ... |
#include <bits/stdc++.h>
//#include <atcoder/all.hpp>
using namespace std;
//using namespace atcoder;
#define all(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define PA pair<int, int>
typedef long long ll;
#define rep(i, z, n) for(int i = z; i < n; i++)
//const ll INF = 1e9;
const ll IN... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int k;
cin>>k;
long long int s(0);
for(int i=1;i<=n; ++i)
{
for(int j=1;j<=k; ++j)
{
s+=100*i+j;
}
}
cout<... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_N = 300005;
int cnt[MAX_N];
int main()
{
ll N,K;
cin >> N >> K;
//N = 300000;
rep(i,N)
{
int a;
//a = 0;
cin >> a;
cnt[a]++;
}
ll ans = 0;
while(K > ll... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_... | #include<iostream>
#define val first
#define type second
using namespace std;
typedef pair<int, int> Filter;
const int FILTER = 200005;
const int QUERY = 200005;
const long long INF = 1LL << 60;
int nFilter;
Filter filter[FILTER];
int nQuery;
int query[QUERY];
void read() {
cin >> nFilter;
for (int i = 0; i... |
#include<bits/stdc++.h>
using namespace std;
const int p = 31;
const int m = 998244353;
typedef long long ll;
typedef long double d;
typedef unsigned long long ull;
typedef int in;
#define ar array
#define ff first
#define ss second
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using names... | #ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#else
#define D(...) ((void)0)
//#define NDEBUG
#endif
#include<bits/stdc++.h>
#define int long long
#define LL long long
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=(a);... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 100000000000000000
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265
#define pb push_back
#define LLMX LONG_LONG_MAX
#define LLMN LONG_LONG_MIN
#define double long double
int n , m , k;
signed main()
{... | #include<iostream>
using namespace std;
long A,B,C;
char f(long A,long B,long C)
{
return A>B?'>':A<B?'<':'=';
}
main()
{
cin>>A>>B>>C;
if(A==0)
{
if(B==0)
{
cout<<"="<<endl;
}
else if(B>0)
{
cout<<"<"<<endl;
}
else
{
if(C%2==0)cout<<"<"<<endl;
else cout<<">"<<endl;
}
}
else if(A>0)
... |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define float double
#define pb emplace_back
#define mp make_pair
#define pii ... | //praise the lord
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma region
#define int long long
#define ll long long
#define ld long double
#define mod 1000000007
#define mod2 998244353
#define ff first
#define ss second
#define pb push_back
#define endl "... |
#include<cstdio>
#include<cctype>
#include<cstring>
#include<cmath>
#include<algorithm>
#define LL long long
using namespace std;
template <class I>
inline void read(I &z)
{
z=0;
char c=getchar();int base=1;
while (!isdigit(c) && c!='-') c=getchar();
if (c=='-') c=getchar(),base=-1;
while (isdigit(... | #include<bits/stdc++.h>
#define st first
#define nd second
#define pb(x) push_back(x)
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
using namespace std;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
static const int MAX_N = 16;
static const int MAX_M = 16;
static const int INF = 10001;
int d[MAX_M][MAX_N];
int h, w, a, b;
ll bfs(vector<vector<int>> input, int a, int b, int cnt, int i, int... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define... |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
string s;
cin >> s;
int a[10]={0};
for(int i=0; i<s.size(); ++i)
{
a[s[i]-'0']++;
}
if(s.size()==1)
{
if(s=="8")
{
cout << "Yes" << endl;
return 0;
}
}
else if(s.size()==2)
{
if(((s[0]-'0')*10+(s[1]-'0'))%8==0 || ((s... | #include "bits/stdc++.h"
#include "random"
#include <unistd.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vi>
#define pi pair<int,int>
#define mp make_pair
#define pb push_back
#define MOD int(1e9) + 7
#define PAI 3.1415926535
#define all(x) (x... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define fs first
#define sc second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define MP make_pair
mt19937 rng(chrono::steady_clock::now().time_... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define deb(...)
#endif
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define all(c) c.begin(),c.end()
#define read(v) for(auto &it:v) cin>>i... |
//#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <functional>
#include <utility>
#include <tuple>
#include <vector>
#include <string>
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e5 + 9;
const int mod = 1e9 + 7;
int n, res = -1;
char a[20];
void solve(int idx, int sum, int cnt) {
if (idx == n) {
if (sum && sum%3 == 0)
res = max(res, cnt);
return;
}
solve(idx + 1, sum + ... |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const double ESP = 1e-11;
double X, Y, R;
double dist(double u1, double v1, double u2, double v2) {
return (u1 - u2) * (u1 - u2) + (v1 - v2) * (v1 - v2);
}
int bsl(int x) {
int rs = ceil(Y), l = -1e9, r = floor(Y)... | #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... |
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vect... | #include <stdio.h>
int main()
{
int i, N, A[2][100001];
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][100001];
for (i = 0; i <= N; i++) {
dp[0][i] = inf;
dp[1][i] = ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
int N,W;
cin >> N >> W;
cout << N/W << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int32_t X{},Y{};
cin >> X >> Y;
if(X-Y<3 && Y-X <3){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll MOD = 998244353;
const double PI = 3.141592653589793238;
int main() {
ll N;
cin >> N;
vector<ll> A(N), sum(N, 0), sumsum(N, 0), maxi(N, 0);
for (ll i = 0; i < N; ++i) {
cin >> A[i];
sum[i] = A[i];
if (i != 0) sum[i] += sum[... | #include <iostream>
long sum(const long &a, const long &b) {
return (a + b) * (b - a + 1) / 2;
}
int main() {
int t;
std::cin >> t;
while(t--) {
long l, r;
std::cin >> l >> r;
long minc = l, maxc = r - l;
if (minc > maxc) std::cout << 0 << '\n'; //if minimum of c > r - l, there is no such pair
else std... |
#include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define All(a) (a).begin(),(a).end()
#define INF 2e18;
#define MOD 1000000007
int main(){
ll n,m,ans,a,M=0;
cin >> n>>m;
vector<vector<ll>> v(n+1);
for(ll i=0;i<n;i++){
cin >> a;
M=max(M,a);
v[a].push_back(i);
}
for(ll i=0;i<=n;i++){
... | #include <bits/stdc++.h>
using namespace std;
constexpr int N = 800;
int dp[N + 1][N + 1];
int a[N + 1][N + 1];
int n, k;
int query(int xi, int yi, int xf, int yf) {
return dp[xf][yf] - dp[xi - 1][yf] - dp[xf][yi - 1] + dp[xi - 1][yi - 1];
}
bool check(int x) {
int i, j;
for (i = 1; i <= n; i++) {
for (j = 1... |
#include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boo... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin >> n;
vector<pair<int, string> > v(n);
for (int i = 0; i < n; ++i)
{
cin >> v[i].second >> v[i].first;
}
sort(v.begin(), v.end());
cout << v[n - 2].second;
return 0;
} |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
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) <<... | // Author : heyuhhh
// Created Time : 2021/03/07 19:18:55
#include<bits/stdc++.h>
#define MP make_pair
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;... |
#ifdef _LOCAL
#include "local_include.hpp"
#else
#include <bits/stdc++.h>
using namespace std;
#endif
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define fto(i, s, e) for (int i = (s); i <= (e); ++i)
#define fto1(i, s, e) for (int i = (s); i < (e); ++i)
#define fdto(i, s, e) for (... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rrep(i,n) for(ll i=n-1; i>=0; i--)
#define fi first
#define se second
#define pcnt __builtin_popcountll
typedef long long ll;
typedef unsigned long lon... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<complex>
#include<cstdio>
#define initdp(a,b) for(int i=0;i<=a;i++)for(int j=0;j<=b;j++)dp[i][j]=-1;
#define fi first
#define se second
#define pb push_back
#d... | #include <bits/stdc++.h>
using namespace std;
//const long nPrime = 1000000007;
//const long nPrime = 998244353;
int main() {
long r,x,y;
cin >> r >> x >> y;
if(x*x+y*y == r*r){
cout << "1" << endl;
return 0;
}
long nSq = (x*x+y*y+r*r-1) / (r*r);
long nAns = long(sqrt(double(nSq)... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000030;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
typedef pair<int,P> PP;
template<class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | /*ver 7*/
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0,endrep=(n); i<endrep; ++i)
#define rep1(i,n) for(ll i=1,endrep=(n); i<=endrep; ++i)
#define revrep(i,n) for(ll i=(ll)(n)-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 60) -123456789;
#define fastio cin.tie(0); ios_base::s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<bool>> vvb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef pair<int,int> pii;
typedef pair<ll... |
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cout << (int)log2(2 * i) << ' ';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const double pi = acos(-1.0);
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = 0;
for(int i = 1; i <= n; i++) {
int a = i;
bool ok = true;
... |
#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
const int N = 1e3 + 10;
int n,m;
vector<int>v[N][30];
int mp[N][N];
int dist[N][N];
struct node{
int x,y,sum;
bool operator < (const node &p)const{
return sum > p.sum;
}
};
int flag[N][N],ans = 0x3f3f3f... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i, n) for(int i = 0, i##_len=(n); i < i##_len; ++i)
#define per(i, n) for(int i = (n)-1; i >= 0 ; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((int)(x).si... |
#include <bits/stdc++.h>
using namespace std;
bool check(string s) {
int n = s.length();
for (int i = 0, j = n - 1; i < n; ++i, --j)
if (s[i] ^ s[j])
return false;
return true;
}
signed main() {
string s;
cin >> s;
for (int i = 0; i < 20; ++i) {
if (check(s)) {
cout << "Yes" << '\n';
system("pa... | //#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const double eps = 1e-7;
const ll LINF = ll(1e18);... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
using namespace std;
int main() {
char S, T;
cin >> S;
cin >> T;
if(S=='Y') cout << char(T-32) << endl;
else cout << T << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<vector>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
typedef long long ll;
int main(){
int a,b; cin>>a>>b;
cout << (a+b)/2 << " " << (a-b)/2 << endl;
} |
#include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 1e5 + 10;
int n, m;
int a[MAXN], b[MAXN];
int main() {
scanf("%d", &n), m = n >> 1;
for (int i = 1; i <= n; ++i) scanf("%d", a + i);
for (int i = 1, x; i <= n; ++i) {
scanf("%d", &x);
if (i & 1) b[i / 2 + 1] = x - a[i];
else b[i / 2 + m] = x -... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
string s;
int n, m;
ll odd, even;
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
odd = 0, even = ... |
//oct 10,2020
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI ... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define PB push_back
#define MP make_pair
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
... |
/*
* Author: Moon-light
* 并查集的启发式合并优化
* 因为这里使用的是按集合大小合并，所以可以加上路径压缩
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#de... | #include<cstdio>
#include<cctype>
#define maxn 202202
inline int read(){
int r=0,f=0;
char c;
while(!isdigit(c=getchar()))f|=(c=='-');
while(isdigit(c))r=(r<<1)+(r<<3)+(c^48),c=getchar();
return f?-r:r;
}
inline char get_c(){
char c;
while(!isalpha(c=getchar()));
return c;
}
int n,m,f[maxn],rt[maxn];
int f... |
#include <bits/stdc++.h>
using namespace std;
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define nl '\n'
///Library
#define mem(a,b) memset(a,b,sizeof(a))
#define all(a) a.begin(),a.end()
#define Sort(x) sort(x.begin(),x.end())
#define ... | //Pradeep_7
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#define IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define tc(x) int x; cin >> x; for(int tt=1;tt<=x;tt++)
#define int long long int
using namespace std;
class Input
{
public:
Input()
{
IO;
}
};
Input set... |
#include<fstream>
#include<iostream>
#include<sstream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<iomanip>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
long long m;
string x;
cin >> x >> m;
if(x.size() == 1){
if(stoi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(void){
int N;
string S;
cin >> N;
cin >> S;
int sum{0};
vector<vector<int>> nums(4,vector<int>(N+1, 0));
for(int i{0}; i<N; ++i){
nums[0][i+1] = nums[0][i];
nums[... |
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#include <set>
#include <limits.h>
#include <math.h>
int main(){
long long n;
cin>>n;
long long a=0;
for(long long i=0;i<n;i++){
long long s;
cin>>s;
if(s>10){
s=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr ll INFLL = 1e18;
constexpr int MOD = 1e9 + 7;
const ld PI = acosl(-1);
#define rep(i,n) for(int i=0; i<(n); ++i)
#de... |
#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 <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <sstream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, s, n) for (int i = s; i ... |
#include <iostream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <deque>
#include <bitset>
#include <list>
using namespace std;
#define pp pair<long long,long long>
#define f first
#define s second
... | #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)
#define MAX 100000
#define inf 1000000007
using namespace std;
using... |
#include <iostream>
#include <cmath>
using namespace::std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int a, b, x, y;
cin >> a >> b >> x >> y;
int dif = a - b;
int t = 0;
if (dif > 0) {
t += x;
t += min(y, 2*x) * (dif - 1);
}
else if (dif < 0) {
t += x;
t += min(y, 2... | #include <algorithm>
// #include <atcoder/all>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered... |
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define pll pair<ll , ll >
#define all(x) (x).begin(),(x).end()
#define SZ(x) (ll)(x).size()
#define X first
#define Y second
#define mp make_pair
#define pii pair<int , int>
#define vec vector
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
#define repc(i,f,n) for(char i=(f); (i) <= (n); i++)
#define PI 3.14159265358979323846264338327950L
#define debug(x) cout<<#x<<" :: "<<x<... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){
return b==0?a:gcd(b,a%b);
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
int n;
ll dp[40];
int main(){
scanf("%d",&n);
dp[1]=1;
for(int i=2;i<=n;i++)
dp[i]=lcm(dp[i-1],i);
printf("%lld",dp[n]+1);
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define pll pai... |
/** (buri nazar wale tera muh kala 😑)
*
* @Author : rudraksh
* @Created : Thursday, November 26th 2020, 8:30:41 pm
* @Email : rudrakshk@iitbhilai.ac.in
*
* “Think twice, code once.”
*/
#include<bits/stdc++.h>
#include<unistd.h>
using namespace std;
typedef long long int ll;
typedef unsigned l... | #include<iostream>
#include<climits>
#define int long long
#define endl '\n'
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define infi INT_MAX
#define rinfi INT_MIN
#define inf LLONG_MAX
#define rinf LLONG_MIN
#define ff first
#define ss second
#ifndef ONLINE_JUDGE
#define line cout<<"her... |
#include <bits/stdc++.h>
#define pb push_back
#define vii vector<int>
#define task "poetry"
#define pll pair<ll, ll>
#define pii pair< ll, pair< ll, ll > >
#define fi first
#define se second
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int N = 5e3+5;
const ll mod = 1e9+7;
const ll m... | #include<bits/stdc++.h>
using namespace std;
const int buffer_size=1e5+5;
char buf[buffer_size],*S,*T;
bool flag_EOF;
inline char read_char()
{
if(S==T)
T=(S=buf)+fread(buf,1,buffer_size,stdin);
return S!=T?*(S++):EOF;
}
inline int read_int()
{
int flag=1;
char c=read_char();
while(c<'0'||c>... |
#include<iostream>
#include<array>
#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<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for(int i=0; i<(n); i++)
#define readVec(v) forn(i, v.size()){cin >> v[i];}
#define printArr(arr, n) forn(i, n){if (i) cout << " "; cout << arr[i];} cout << endl;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define f first
#define s ... |
#pragma clang optimize on
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
#define shift 30
inline int get_digit() {
int x = 0, f = 1;
char c = getchar();
while(c > '9' || c < '0') {
if(c == '-... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 555;
vector<int>G[22];
int ban[maxn];
int n, m;
set<int>se;
void dfs(int nowid, int sta) {
if (nowid == n + 1) {
se.insert(sta);
return;
}
if (ban[nowid]) {
dfs(nowid + 1, sta);
return;
}... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define STRING(str) #str
#define ll long long
#define ld long double
template <typename T>
void print(T x, string name) {
cout << name+": " << x << endl;
}
template <typ... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... |
#include<cstdio>
#include<iostream>
#include<vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
// #define NDEBUG
#include<cassert>
namespace Elaina{
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define drep(i, l, r) for(int i=(l), i##_e... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cinttypes>
static const int N = 200005;
int n;
static std::pair<int, int> a[N], b[N];
static int p[N];
static int f[N];
void add(int i, int d) {
for (++i; i < N; i += i & -i) {
f[i] += d;
}
}
int get(int i) {
int s = 0;
for (; i > 0; i -= i ... |
#include<bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std ;
int main(){
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int n ;
cin >> n ;
ll ans = 0 ;
int t = 0 ;
while( ans < n ) {
t ++ ;
ans = ans + t ;
}
cout << t <<... | #include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define fo(i0, n) for(i=0;i<n;i++)
#define fo(i1, n) for(i=1;i<=n;i++)
typedef long long ll;
typedef unsigned long long ull;
ull GCD(ull x,ull y){if(y==0) return x;else return GCD(y,x%y);}
ull LCM(ull a,ull b){return (a*b/(GCD(a,b)));}
bool PRIME(int... |
// Problem: C - Squared Error
// Contest: AtCoder - AtCoder Beginner Contest 194
// URL: https://atcoder.jp/contests/abc194/tasks/abc194_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Date: 2021-03-09 12:52:00
// --------by Herio--------
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#ifdef NO_PROBLEM_MAIN
#define DPRINTF(x) printf x
#else
static inline void nop() { return; }
#define DPRINTF(x) nop()
#endif
#define SOLVER(x) solve_D x
static void s_shuffle( string &s, int r )
{
int l = s.length();
for ( int i = 0; i < r; i++ )
{
i... |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long n,w,count=0;
cin>>n>>w;
long long a=w;
for(int i=0;i<n;i++){
if(n>=a){
count++;
}else if(n<a){
break;
}
a+=w;
}
cout<<count<<endl;
}
| #include <iostream>
using namespace std;
int main()
{
int a,b,sum;
cin>>a>>b;
sum=a/b;
cout <<sum;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
#define x first
#define y second
const int N = 2e5 + 10;
int a[N], res[N], pos[N];
void Swap(int p, int &idx) {
swap(pos[a[p]], pos[a[p + 1]]);
swap(a[p], a[p + 1]);
res[idx++] = p;
}
void solve() {
int n;
scanf("%d"... | #include<bits/stdc++.h>
using namespace std;
# define ll long long
# define read read1<ll>()
# define Type template<typename T>
Type T read1(){
T t=0;
char k;
bool vis=0;
do (k=getchar())=='-'&&(vis=1);while('0'>k||k>'9');
while('0'<=k&&k<='9')t=(t<<3)+(t<<1)+(k^'0'),k=getchar();
return vis?-t:t;
}
# define fre(k... |
#include <bits/stdc++.h> // clang-format off
using namespace std;
using i64 = int64_t;
using pii = pair<i64, i64>;
#define rep(i, n) for (i64 i = 0; i < i64(n); i++)
#define per(i, n) for (i64 i = n - 1; i >= 0; i--)
#define REP(i, a, b) for (i64 i = a; i < i64(b); i++)
#define all(x) (x).begin(), (x).end()
#define ra... | #include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define co(n) cout<<n<<endl
using namespace std;
int main(){
int n,x=0,y=0,ans=100000,c=0;
cin>>n>>x>>y;
y*=n;
rep(i,0,n-1){
cin>>ans;
c+=ans;
}
if(y-c<=x){
if(y-c<0) co(0);
else co(y-c);
}
else co(-1);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rng(x) x.begin(), x.end()
#define maxi(x, y) x = max(x, (y))
#define mini(x, y) x = min(x, (y))
#define pb push_back
#define F first
#define S second
#define el '\n'
#define ll long long
#define SZ(x) ((int)(x).size())
template<typename T>
istream&operator>>(istr... | #include <bits/stdc++.h>
#include <cmath>
#include <vector>
#include <numeric>
using namespace std;
using ll= long long;
#define rep(i,n) for (int i=0; i<(n); ++i)
int main(void)
{
int A;
int B;
int count=0;
cin >> A >>B;
vector<int> E;
E = vector<int>(A+B);
vector<int> E_A;
E_A = vec... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
int64_t solve(int64_t L, int64_t R) {
vector<int64_t> cnt(R + 1);
for (int64_t g = R; g >= 2; --g) {
cnt[g] = (R / g - (L - 1... | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef pair<int,int> P ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
int l , r ;
int A[1000007] ;
int ans[1000007] ;
int prime_factor[1000007] ;
void ertstns(){
memset(prime_factor,-1,sizeof(... |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int T, N;
int A[100010];
signed main()
{
cin >> T;
while(T--)
{
cin >> N;
rep(i, N)cin >> A[i];
if(N % 2) cout << "Second" << endl;
else
{
map<int,... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll pow_m(ll a ,ll b,ll m){
ll ans = 1;
while(b){
if(b&1) ans = ans * a %m;
a = a *a % m;
b >>= 1;
}
return ans;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll ... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vpll = vector<pair<ll, ll>>;
#define rep(i,n... |
#include<cstdio>
int abs(int u){
return u>0?u:-u;
}
int getDis(int a,int b,int c,int d){
if(a==c && b==d) return 0;
else if((a+b)==(c+d) || (a-b)==(c-d) || abs(a-c)+abs(b-d)<=3) return 1;
else{
int x = (a+b)%2, y = (c+d)%2, z = (a-b)%2, w = (c-d)%2;
if(z<0) z += 2;
if(w<0) w +=... | #include<iostream>
#include<array>
#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<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#incl... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#define ll long long
int a[200010], b[200010];
ll d[200010];
int main() {
int n;
scanf("%d", &n);
for(int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
for(int i = 0; i < n; ++i) {
scanf("%... | // Created by Pratik
// NIT PATNA
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define M 1000000007
#define pi 3.14159265358979323846
#define ll ... |
//#include <bits/stdc++.h>
//using namespace std;
#include <set>
#include <cstdio>
#include <iostream>
using namespace std;
#define rep(i,_l,_r) for(signed i=(_l),_end=(_r);i<=_end;++i)
#define fep(i,_l,_r) for(signed i=(_l),_end=(_r);i>=_end;--i)
#define erep(i,u) for(signed i=head[u],v=to[i];i;i=nxt[i],v=to[i])
#def... | #include<bits/stdc++.h>
using namespace std;
int bit[300010];
int N;
void add(int a, int b){
int x = a;
while(x <= N){
bit[x] += b; x += x & -x;
}
}
int sum(int a){
int res = 0;
int x = a;
while(x > 0){
res += bit[x]; x -= x & -x;
}
return res;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cou... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long LL;
int a, b, c;
double f[105][105][105];
double dp(int nowa, int nowb, int nowc) {
if (nowa >= 100 || nowb >= 100 || nowc >= 100) return 0;
if (f[nowa][nowb][nowc]) return f[nowa][nowb][nowc];
//cout << 1 << endl;
... | #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <map>
#include <queue>
#include <limits.h>
#include <stack>
using namespace std;
typedef long long ll;
const int maxn = 110;
int H, W, A, B, ans = 0;
int nx, ny;
bool vis[20][20];
void solve(int ... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
cout<<n/m;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long(i)=0;(i)<(n);(i)++)
#define kiriage(a,b) ((a)+(b)-1)/(b)
int main(){
long long s,p;
cin >> s >> p;
for(long long i = 1; i * i <= p; i++){
if(p % i == 0){
if(i + p / i == s){
cout << "Y... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
// #define vb vector<bool>
// #define vc vector<char>
#define vii vector<pii>
//#define mi ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
string s;
cin>>s;
if((s[0]==s[1])&&(s[1]==s[2])){
cout<<"Won\n";
}else{
cout<<"Lost\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
float satisfaction(float x, float y, float a,
float b, float c, float d, float r){
if(a <= x+0.5 && x+0.5 <= c && b <= y+0.5 && y+0.5 <= d){
float s = (c-a)*(d-b);
return 1 - std::pow(1-min(r,s)/max(r,s), 2.0);
}else{
return 0;
}
}
boo... | /**
* author: shu8Cream
* created: 06.03.2021 11:57:11
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
cin.tie(nullp... |
//#include <atcoder/all>
#include <bits/stdc++.h>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begi... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<... | //Utkarsh.25dec
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
#define loop(i,a,b) for(ll i=a;i<=b;i++)
#define vi vector <int>
#define vs vecto... |
#include <bits/stdc++.h>
using namespace std;
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); // __VA_ARGS__可変引数マクロ
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void... | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(){
long long X, Y, A, B;
std::cin >> X >> Y >> A >> B;
long long exp = 0;
int flg_A = 0, flg_B = 0;
while(flg_A == 0){
if(X*(A - 1) < B && (double)X*A < 2e18){
if(X*A < Y){
X = X*... |
#include <iostream>
#include <cctype>
using namespace std;
int main() {
char S, T;
cin >> S >> T;
cout << (S == 'Y' ? (char)toupper(T) : T) << endl;
}
| #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>
using namespace std;
using LL = long long;
using vi = vector<int>;
using pii = pair<int, int>;
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#define debug(x...)
#define debug_arr(x...)
#ifdef LOCAL
#include "prettyprint.hp... | #include <bits/stdc++.h>
using namespace std;
const int M = 2e5;
vector<int> adj[M];
long long c[18], k, memo[18][(1 << 18)];
map<long long, map<long long, long long>> dist;
long long solve(int i, int mask) {
if (mask == (1 << k) - 1)
return 0;
long long &res = memo[i][mask];
if (res == -1) {
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//constexpr ll MOD = 1e9 + 7;
constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return tru... | //Har Har Mahadev
using namespace std;
#include <bits/stdc++.h>
#define booga cerr << "booga" << endl
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define safai(...) Clearing_out(__VA_ARGS__)
temp... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fo(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define tr(it,a) for(auto it=a.begin();it!=a.end();it++)
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<int> vi;
typ... | /*Allah Vorosha*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define n_p next_permutation
#define p_p prev_permutation
#define in insert
#define rev reverse
#define pf push_front
#define pob pop_back
#define uniq(v) v.resize(distance(v... |
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int x, y;
cin >> x >> y;
if (y > x) swap(x, y);
if (y + 3 > x)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<map>
#include<bitset>
#include<iomanip> //setprecision
#include<stack>
#include<set>
#include<deque>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll mod = 1000000007... |
#include<bits/stdc++.h>
#define mod 998244353
#define int long long
using namespace std;
inline int read() {
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);
ch=getc... | #include<bits/stdc++.h>
using namespace std;
int n,a[101010];
int main()
{
cin>>n;
a[1]=1;
for(int i=2;i<=n;i++)
{
for(int j=1;j*j<=i;j++)
{
if(i%j!=0)
{
continue;
}
a[i]=max(a[i],a[j]+1);
if(j!=1)
{
a[i]=max(a[i],a[i/j]+1);
}
}
}
for(int i=1;i<=n;i++)
{
cout<<a[i]<<' ';
}
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
vector<pair<double, double>> v;
double l, r;
for (int i = 0; i < n; ++i) {
cin >> t >> l >> r;
if (t == 2) {
r -= 0.1;
} else if (t == 3) {
l += 0.1;
} else if (t =... | #include <bits/stdc++.h>
long long extGCD(long long a, long long b, long long c, long long &x, long long &y){
long long a_gcd = a;
long long b_gcd = b;
std::vector< long long > A, B;
A.push_back(a_gcd);
B.push_back(b_gcd);
while(b_gcd != 0){
long long tmp = a_gcd % b_gcd;
a... |
#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 sz(x) (int)x.... | #include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <nume... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) (int)x.size()
int lcm(int A,int B){ return A * B / (__gcd(A, B));}
const int mod=1e9+7;
const int mxN=2e5;
//=======================
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; pri(x); cerr << endl;
#else
#define debug... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define A... | //
// Created by mihai145 on 23.02.2021.
//
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int NMAX = 1e5;
int N, w[NMAX + 5];
vector<int> g[NMAX + 5];
int dfs(int node, int parent = -1) {
int ans = 1;
w[node] = 1;
vector<int> v;
int evenLeft = 0;
for (... |
#include<bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
long long N,M,K;
long long h,w;
long long X,Y,Z;
long long B;
const int MOD=1e9+7;
const int MAXN=5e5+5;
const int NAX=1005;
//vector<int> adj[MAXN];
vector<array<int,3>> adj[MAXN];
vector<Int> A;
Int ceilS(Int x,Int y){
re... | #include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
#define int long long
const int N = 2e5+10;
typedef pair<int, int> pii;
struct E{
int v,t,k;
};
vector<E> e[N];
int n, m;
int dis[N];
bool vis[N];
void dijkstra(int s) {
memset(dis,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.