code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,D,H;
cin >> N >> D >> H;
vector <float> dnum(N);
vector <float> hnum(N);
for(int i=0;i<N;i++){
cin >> dnum[i] >> hnum[i];
}
float lean = 1000;
for(int i=0;i<N;i++){
hnum[i] = H-hnum[i];
dnum[i] = D-dnum[i];
if((hnum[i]/... | #include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define LLA(v) (v).rbegin(), (v).rend()
#define SZ(v) (v).size()
#define INT(...) \
... |
/**
* author: tourist
* created: 15.12.2020 16:15:36
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
string t;
cin >> s;
cin >> t;
vector<int> p;
int ptr = 0;
int last = -1;
long long ans = 0;
... | #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 <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vpii vector<pii>
#define V vector
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F first
#define S second
#define sqr(x) (x)*(x)
#define mp make_pair
#define mtp ma... | #include<bits/stdc++.h>
#define lli long long
#define lld double
#define test int t;cin>>t;while(t--)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define mod 1000000007
#define ff first
#define ss second
#define ppl pair<lli , lli>
#define ppi pair<int , int>
#define large 1000000000000000000
using ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;
#define fi first
#define se second
#define pb push_back
#define nn "\n"
#define all(p) p.begin(... | //#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... |
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#de... | #include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t){
while(*sdbg != ',') { ce... |
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
ll H, W;
cin >> H >> W;
vector<string> S(H);
vector<vector<int> > cnt(H);
for (int i = 0; i < H; i++) cin >> S[i];
ll K = 0;
for (int i ... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define PI 3.14159265359
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll mod = 1000000007;
bool field[2000][2000];
int ltor[2000][2000];
int rtol[2000][2000];
int ttob[2000][2000];
int btot[2000][2000];
l... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define F(i,a,b) for(int i=(int)(a);i<=(int)(b);i++)
#define R(i,b,a) for(int i=(int)(b);i>=(int)(a);i--)
#define endl "\n"
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define out(x) cout<<setprecision(15)<<x<<endl,exit(0)
#define pii pa... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define pi 2*acos(0.0)
#define F_OR(i, a, b, s) for (int i=(a); (... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve_sub(ll N, string S, vector<ll>& A) {
ll d_min = 1e5;
for ( int i = 0; i < N; i++ ) {
d_min = min(d_min, abs(A[i]-A[i+1]));
}
vector<ll> mn(N+1,0);
for ( int i = 1; i <= N; i++ ) {
if ( S[i-1] == '<' ) {
... | #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 <iostream>
#include <string.h>
#include <algorithm>
#include <cmath>
using ll = long long;
const ll INF = __LONG_LONG_MAX__;
using namespace std;
int main() {
ll N;
cin >> N;
int count[3] = {0};
while(N) {
count[N % 10 % 3]++;
N /= 10;
}
int total = count[1] + coun... | #include<bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin>>n;
int k = n%100;
cout<<100-k;
return 0;
} |
#include<bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
int main() {
io... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define lowbit(x) x&-x
#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define UNI(x) sort(ALL(x)),x.resize(unique(ALL(x))-x.begin())
#define GETPOS(c,x) (lower_bound(ALL(c),x)-c.begin())
#define LEN(... |
#include <iostream>
#include <cstring>
using namespace std;
const int N = 200010, M = 2 * N, INF = 0x3f3f3f3f;
int h[N], e[M], ne[M], idx, n, m, k;
int f[N], g[N], cnt; //f[u]:u的子孙结点中，最近的特殊点距离u点的距离
//g[u]:u的子孙结点中，最远的没被特殊点覆盖的点距离u点的最远的距离
bool st[N];
void add(int a, int b) {
e[idx] = b, ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int h,w;
cin>>h>>w;
int ans=0;
vector<vector<char>>s(h,vector<char>(w));
rep(i,h){
rep(j,w)
cin>>s[i][j];
}
for(int i=0;i<h;i++){
for(int j=0;j<w-1;j++){
if(s[i][j]=='.'... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxN = 1e5 + 5;
vector <tuple<int, int, int>> adj[maxN];
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int n, m;
cin >> n >> m;
for(int i = 0; i < m; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
adj[a].emplace_back(b... | #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<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>
using namespace std;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
for(int i = 1; i <= n; i++)
{
int a = i * 2;
int b = i * 2 + 1;
while(a > n)
{
a = a - n;
}
... |
// 2021-03-14 08:00-08:
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
for (int i = 0; i < t; i++) {
long long l, r;
cin >> l >> r;
long long count = 0;
if(r < 2 * l){
cout << count << endl;
continue;
}
count = ((r - l + 1) * (r - 3 * l + 2) + (l - 1) * l) / 2;
cout <... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define MOD 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(var) (var).begin(), (var).end()
#define sz(x) (int)x.size()
#define MAXX 9000000000000000000
#de... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int tdmckmlklgnjdnmclnbjhn;
long long a,b,c,d;
cin>>a>>b>>c>>d;
if(a==c && b==d)
cout<<"0"<<endl;
else if(a+b==c+d || a-b==c-d || abs(a-c)+abs(b-d)<=3)
cout<<1<<endl;
else if((a+b+c+d)%2==0 || abs(a-c)+abs(b-d)<=6 ||
abs(a+b-c-d)<=3 || abs(a-b-c+d)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD=1000000007;
const long double PI=3.14159265358979;
const ll MAX=0;
int main() {
ll N,M,T;
cin>>N>>M>>T;
ll a[M];
ll b[M+1];
rep(i,M){
cin>>a[i]>>b[i+1];
}
b[0]=0;
ll bat=N,ans=0;
... |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <limits>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <numeric>
#include <math.h>
#include <string.h>
#include <stdlib.... |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=200005;
int n,a[N],b[N],c[N],t[N];
map<int,priority_queue<int,vector<int>,greater<int> > > pq;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]),a[i]+=i;
for(int i=1;i<=n;i++) scanf("%d",&b[i]),b[i]+=i;
for(int i=1;i<=n... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#include<map>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<ca... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v)... | #include <cstdio>
#include <algorithm>
using namespace std;
int a[100000];
void solve() {
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
if (n % 2 == 0) {
for (i = 0; i < n; i += 2) {
if (a[i] != a[i + 1]) break;
... |
#include <memory.h>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
typedef long long ll;
ll n, minv[200111], maxv[200111];
ll reachMinv[200111], reachMaxv[200111];
vector<ll> ids;
int main(void) {
scanf("%lld", &n);
for (ll i = 0; i <= n + 1; i++) {
minv[i] = 9e18;
... | #include <bits/stdc++.h>
using namespace std;
#define ffor(i, a, b) for (int i = a ; i <= (int) b ; i++)
#define rfor(i, a, b) for (int i = (int) a ; i >= b ; i--)
#define vec vector
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
using ll = long long int;... |
#include <bits/stdc++.h>
using namespace std;
struct ios
{
inline char read()
{
static const int IN_LEN = 1e6 + 10;
static char buf[IN_LEN], *s, *t;
return (s == t) && (t = (s = buf) + fread(buf, 1, IN_LEN, stdin)), s == t ? -1 : *s++;
}
template <typename _Tp>
inline ios &o... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy c... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1e18+7;
const lint inf=1e9+7;
cons... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n; cin >> n;
vector<long long> d_s, d_l;
long long i = 1;
while(i*i < n)
{
if (n % i == 0)
{
d_s.push_back(i);
d_l.push_back(n / i);
}
i++;
}
if (i * i == n) d_s.push... | // author: xay5421
// created: Sat Dec 26 19:58:52 2020
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
int n;
int main(){
scanf("%d",&n);
rep(i,1,n){
printf("%d %d\n",(i*2-1)%n+1,i*2%n+1);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int h[30][29], v[29][30], hc[30][29], vc[29][30];
int si, sj, ti, tj, prev_si, prev_sj, prev_ti, prev_tj;
int prev_result;
int i=0, j=0;
int border=1;
int repeat_count=1000;
string query(int si, int sj, int ti, int tj){
string path;
while(si!=ti || sj!=tj){
if(si==ti)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define sc(x) scanf("%lld",&(x));
#define pb push_back
#define fi first
#define se second
#define P pair<int,int>
int qp(int x,int n,int mod){
int ans = 1;
while(n){
if(n&1){
ans = (ans * x)%mod;
}
n >>= 1;
... |
#include<bits/stdc++.h>
#define LL long long
#define rint register int
#define LB lower_bound
#define UB upper_bound
#define MS(x,y) memset(x,y,sizeof(x))
#define rep(i,a,b) for(rint i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(rint i=a,i##end=b;i>=i##end;--i)
#define cms printf("%.2lf\n",(&o2-&o1)/1024.0/1024);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endll "\n"
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#define ull unsigned long long
#define rep(i,b) for(int i=0;i<b;i++)
#define For(i, a, b) for(int i=a;i<=b;i++)
#define Rof(i, a, b) for(int i=a;i>=b;i--)
#define rest(a, b) memset(a,b,... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if(a == b) {
cout << c << endl;
}
else if(b == c) {
cout << a << endl;
}
else if(c == a) {
cout << b << endl;
}
else {
cout << 0 << endl;
}
}
| #include <iostream>
using namespace std;
int a, b, c, d, resta_max;
int main()
{
cin>>a>>b>>c>>d;
resta_max=max(max(a-c, max(a-d, b-c)), b-d);
cout<<resta_max;
return 0;
}
|
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
string s,x;
cin>>s>>x;
int curr=1;
set<int> nope;
nope.insert(0);
for (int i=n;i>=1;i--)
{
if (i!=n)
{
... | #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>
#include <stdio.h>
using namespace std;
#define int long long
int f(string s){
vector<int> a(10);
for(char c : s) a[c - '0']++;
int res = 0;
for(int i = 1; i <= 9; i++){
int x = 1;
for(int j = 0; j < a[i]; j++){
x *= 10;
}
res += x * i;
}
return res;
}
signed main(void)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t LL;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define F first
#define S second
#define pb push_back
mt19937 rnd;
const int N = 1e5 + 10;
vector<ll> a[3];
bool is_even(int x) {
return !(x & 1)... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef vector<pi> vp;
typedef set<ll> si;
typedef map<string, ll> msi;
#define REP(i,a,b) \
for(ll i=ll(a);i<=ll(b);i++)
#define DEP(i,a,b) \
for(ll i=ll(a);i>=ll(b);i--)
#define TR(c, it) \
for (auto it =... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define ff first
#define ss second
#define vll vector<ll>
#define pii pair<ll,ll>
#define sz(v) (v).size()
#define srt(v) sort(v.begin(),v.end... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define n_l '\n'
#ifndef ONLINE_JUDGE
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return ... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(in... |
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n ;
cin>>n;
int ans = n/100;
if( n % 100 ) ans ++;
cout<<ans<<endl;
}
int main(){
solve();
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < (int)s.length(); i++) {
if (s[i] == '.') {
break;
}
cout << s[i];
}
cout << endl;
return 0;
} |
// #pragma comment(linker, "/stack:200000000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using i128 = __int128_t;
using u128 = __uint128_t;
using u64 = uint64_t;
//define
#define int long long
#d... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
#ifdef INPUT_FILE
auto fre = freopen(INPUT_FILE, "r", stdin);
if (fre == nullptr) {
cout << "invalid input file path: " << INPUT_FILE << endl;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define FOR(i, a, b, s) for(int i = (a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR(i, a, b, s) for(int i = (a); (s)>0?i<=(b):i>=(b); i+=(s))
#define EACH(x, a) for(auto& x: a)
#define vt vector
#define pb push_back
#define rev rever... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_nod... |
#include <bits/stdc++.h>
using namespace std;
const uint64_t seed = std::chrono::system_clock::now().time_since_epoch().count();
mt19937_64 rnd(seed);
const int MOD = 998244353;
#ifdef VIPJML_LOCAL
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
os << "{";
for (typename vector<T>::... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> struct BIT {
int mxn;
vector<T> data;
const bool zi;
const T un;
BIT<T>(int max_n, bool zero_indexed = false, T unit = T(0)) : mxn(max_n), zi(zero_indexed), un(unit) {
if ( zi ) mxn++;
data.assi... |
#include<bits/stdc++.h>
using namespace std;
#define M_PI 3.1415926535
#define ll long long
#define ld long double
#define all(a) a.begin(),a.end()
#define Summon_Tourist ios::sync_with_stdio(false);cin.tie(0);
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 ; }
ll inf ... | #include <iostream>
#include <cstdio>
using namespace std;
const int N=5010,mod=998244353;
int fp[N][N],res[N];
int main()
{
int n,m,ans=0;
scanf("%d%d",&n,&m);
for(int i=0;i<=m;i++)
{
fp[i][0]=1;
for(int j=1;j<=n;j++)
fp[i][j]=1ll*fp[i][j-1]*i%mod;
}
for(int d=1;d<=n-1;d++)
{
for(int x=1;x<=m;x++)
... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,sum=0;cin>>n;int a[n],b[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
//sum+=a[i]+b[i];
}
for(int i=0;i<n;i++)
{
cin>>b[i];
}
for(int i=0;i<n;i++)
{
long long m=0;
m=a[i]*b[i];
... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (ll i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chma... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin(... | // 解き直し.
// https://atcoder.jp/contests/arc105/editorial/171
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; ... |
#include<bits/stdc++.h>
#include "cmath"
#define ll long long int
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define inf (1<<30)
#define linf 1e18
#define ninf -1e9
#define fore(i, r) for(int i = 1; i <= int(r); i++)
#define loop(i,r) for(int i = 0; i < int(r) ; i++)
#define loop1(i,... | #include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int fpow(int a,int b){
int ans=1;
while(b){
if(b&1) ans=1ll*ans*a%mod;
a=1ll*a*a%mod;
b>>=1;
}
return ans;
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
int a=0,b=n,c=m+n;
for(int i=1;i<=n;i++){
scanf("%d",&a);
b=(b+a);
}
int ans=1;
... |
#include "bits/stdc++.h"
#include <random>
#include <chrono>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<endl
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
const ll linf = 2e18 + 100;
const int inf = 1e9 + 1... | /****************##### بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم #####********************/
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define EPS 1e-6
#define F first
#define sf ... |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int sum=0,n;
int dp[101][100001],a[101];
int f(int i, int t){
if(i==n) return max(t,sum-t);
if(dp[i][t]!=-1) return dp[i][t];
int ret=f(i+1,t);
ret=min(ret,f(i+1,t+a[i]));
dp[i][t]=ret;
return ret;
}
int main(){
ios_base::sync... |
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#include <stack>
using namespace std;
#def... | //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;
#define ll long long
const int N = 2.1e5;
int n, m, tkn[N], ans[N];
vector<pair<int, int>> e[N];
queue<int> q;
void fn(int v) {
tkn[v] = 1;
for (auto [u, c] : e[v]) {
if (!tkn[u]) q.push(u);
}
}
int main() {
#ifdef LOCAL
freopen("input.txt", "r",... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <random>
#include <vector>
using namespace std;
constexpr int N = 30; // width and height
constexpr int MED_DISTANCE = (1000 + 9000) / 2;
using P = pair<int, int>;
using VPATH = array<array<int, N>, N - 1>;
using HPATH = array<array<i... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(int (i) = 0; (i) < (n); ++(i))
#define pf(x) cout << (x) << endl
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... |
#ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_ }
#define MY_DEBUG(s) s
#else
#define MY_NAMESPACE(ns)
#define MY_NAMESPACE_
#define MY_DEBUG(s)
#endif
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#inclu... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const ul mod = 1000000007;
int main() {
ios_base::syn... |
#include <bits/stdc++.h>
#define ll long long
#define pushb push_back
#define popb pop_back
#define min_ min_element
#define max_ max_element
#define mp make_pair
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int)(x).size()
#define all(x) x.beg... | #include <bits/stdc++.h>
using namespace std;
#define rep( i, a, b ) for( int i = (a) ; i <= (b) ; i ++ )
#define per( i, a, b ) for( int i = (a) ; i >= (b) ; i -- )
typedef long long LL;
template<typename _T>
void read( _T &x )
{
x = 0; char s = getchar(); int f = 1;
while( s < '0' || '9' < s ) { f = 1; if(... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define ALL(v) v.begin(),v.end()
#define sz(v) (ll)v.size()
const ll INF = 1e18;
const ll MOD = 998244353;
// const ll MOD = 1000000007;
ll dx[] = {1, 0, -1, 0};
ll dy[] = {0, 1, 0, -1... | #include<stdio.h>
#include<math.h>
#define ni(n) ((n) * (n))
#define rep(i,n) for(i=0;i<n;i++)
#define X(a,n) (a<=n)?a+n:a-n
#define N
int main(void){
char str[6] = "ZONe";
char s[100];
int ans = 0;
int count = 0;
scanf("%s",s);
int i;
rep(i,12){
if(s[i] == str[0]){
int j;
rep(j,4){
if(s[i+j] == s... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <complex>
#include <cassert>
#include <set>
using namespace std;
const long long MOD = 1e9 + 7;
vector<long long> fact, fact_inv, inv;
void init_nCk(long long SIZE) {
fact.resize(SIZE + 5);
fact_inv.resize(SIZE + 5);
inv... | #include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
// #define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts(... |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace st... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loop(i, a, n) for (int i = a; i < n; i++)
#define loope(i, b, n) for (int i = b; i <= n; i++)
#define loopit(a) for (auto it = a.begin(); it != a.end(); it++)
#define ms(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_p... |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define ssort(a) sort(a.begin(), a.end())
#define INF 1001001001
#define INFll 100100100100100100
// debug用
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
usi... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin>>n;
vector<int> a(2*n);
rep(i, 2*n) cin>>a[i];
vector<P> b;
rep(i, 2*n) b.push_back(P(a[i], i));
sort(b.begin(), b.end());
P mid=b[n];
vector<P> ... |
#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 all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())
void _cin() {} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i < (b);++i)
#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 MAX_N = 1000001;
int n;
ll k;
int main(){
cin.tie(0)->sync_with_stdio(fal... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
scanf("%d%d", &a, &b);
int c = (a - b) * 100;
double d = c * 1.0 / a;
printf("%.20lf", d);
return 0;
} | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
#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##_end_=(r); i>=i##_end_; --i)
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define Endl putchar... |
#include<bits/stdc++.h>
#define ll long long
#define r(i,a,b) for(register int i=a;i<=b;i++)
#define mem(d) memset(d,0,sizeof(d))
#define ul unsigned long long
#define IsDigit(c) ('0' <= (c) && (c) <= '9')
const int N=500000;
const ll p=1e9+7;
using namespace std;
inline ll qr()
{
int x = 0; bool f = true;char c = get... | #include<iostream>
using namespace std;
typedef long long li;
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; pri... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b,c) for(ll i=a;i<b;i+=c)
#define r(i,a,b,c) for(ll i=a;i>=b;i-=c)
#define mod 1000000007
int main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
ll n; cin >> n;
vector<ll> ar;
ll s = sqrt(n);
// cout << s << ... | #include<bits/stdc++.h>
using namespace std;
int main(){
long n,i;
cin>>n;
set<long, less<long>> mySet;
for(i=1;i*i<=n;i++){
if(n%i == 0){
mySet.insert(i);
mySet.insert(n/i);
}
}
for(long j:mySet){
cout<<j<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vp> vvp;
const ... | #include <stdio.h>
long long p = 1000000007;
long long n, m, s;
long long x, y, z;
long long a[2000];
long long inv[5000000];
void makeinv(void) {
long long arraynumber = sizeof inv / sizeof inv[0];
inv[1] = 1;
for (int invcount = 2; invcount < arraynumber; invcount++) {
inv[invcount] = p - inv[p % invcount] * (p ... |
#include<bits/stdc++.h>
#include<stdlib.h>
using namespace std;
typedef long long int ll;
int main()
{
string s;
cin>>s;
int ans=0;
for(int i=0;i<=9999;i++){
vector<bool>flag(10,false);
int x=i;
for(int j=0;j<4;j++){
flag[x%10]=true;
x/=10;
}
... | #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... |
/* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
#include <chrono>
using namespa... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();
templ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> v(H,vector<char>(W));
for(int i = 0;i < H;i++){
for(int j = 0;j < W;j++)
cin >> v.at(i).at(j);
}
int ans = 0;
for(int i = 1;i< H;i++){
for(int j = 1;j < W;j++){
int ij = 0;
... |
/* Author : Aaryan Srivastava ^__^ */
#include <bits/stdc++.h>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i,n) for(int i = 0 ; i < (n) ; i++)
#define repA(... | #include<bits/stdc++.h>
using namespace std;
#define MAXN 200005
#define lowbit(x) (x&-x)
#define reg register
#define mkpr make_pair
typedef long long LL;
typedef unsigned long long uLL;
const int INF=0x3f3f3f3f;
const int mo=1e9+7;
const int iv2=5e8+4;
const int lim=1000000;
const int jzm=1e6+7;
const int orG=3,invG=... |
/*
Miles Morales : When will I know I'm ready?
Peter B. Parker : You won't. It's a leap of faith. That's all it is, Miles. A leap of faith.
*/
//KEEP IT SIMPLE STUPID
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragm... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
deque<char> d;
bool to_front = true;
for(const auto &c: s){
if(c == 'R'){
to_front = !to_front;
}else if(to_front){
d.emplace_front(c);
}else{
... |
#define MOD_TYPE 2
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target(... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll mod=1000000007;
int main(){
int A,B,C,S=0;
cin >> A >> B >> C;
S=21-(A+B+C);
cout << S << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> pd;
void solve(){
int n;
cin>>n;
ull a[n];
for(int i=0;i<n;i++)cin>>a[i];
ull pre[n];
ull mx[n];
ull sum = a[0];
ull mxn = a[0];
pre[0] = a[0];
mx[... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
string a;
random_device rnd;
cin >> N >> M;
for(int i=0; i<M; i++) {
cin >> a;
}
for(int y=0; y<N; y++) {
for(int x=0; x<N; x++){
char a = rnd()%8 + 'A';
cout << a;
}
... | #include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i++)
#define per(i, r, l) for(int i = (r); i >= (l); i--)
#define mem(a, b) memset(a, b, sizeof a)
#define For(i, l, r) for(int i = (l), i##e = (r); i < i##e; i++)
using namespace std;
int T; long long n;
int main() {
#ifdef local
// freopen(".... |
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vec... | #include<bits/stdc++.h>
using namespace std;
int main(){
long double x,y,r;
scanf("%Lf%Lf%Lf",&r,&x,&y);
long double dis=sqrt(x*x+y*y);
if (dis<r){
puts("2");
return 0;
}
printf("%d\n",(int)ceil(dis/r));
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mod 1000000007
#define rep(i,n) for(int i=0; i<n; i++)
#define repa(i,start,end) for(int i=start; i<=end; i++)
#define repd(i,start,end) f... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
using ll = long long;
int main(){
ll n;
cin >> n;
ll rtn = sqrt(n);
set<ll> is;
ll sum = 1;//1 is include
for(ll i = 2; i*i <= n; i++){
ll cnt = 0;
ll j = i;
while(j*i <= n){
j *= i;
... |
#include <iostream>
#include <string>
#include <complex>
#include <cstdio>
#include<functional>
#include<cmath>
#include<string>
#include<ctime>
#include<cstring>
#include<algorithm>
using namespace std;
typedef complex<double> cp;
#define ll long long
#define sci(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#def... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, m;
vector... |
#include <iostream>
using namespace std;
int main() {
double x;
double y;
double z;
cin>>x;
cin>>y;
cin>>z;
double a=z/x;
double d=y/x;
int b=y*a;
double c=b/z;
int i=0;
while(i!=1){
if(c<d){
i=1;
}else{
b--;
c=b/z;
}
}
cout<<b;
} | #include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
//#include <random>
#include <map>
//#include <unordered_map>
#include <cstdl... |
#include<bits/stdc++.h>
using namespace std;
char s[520][520];
int r[1020],b[1020];
int main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>s[i][j];
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(s[i][j]=='R')
{
r[i+j]=1;
}
if(s[i][j]=='B')
{
... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
const int N=2e3+5;
const int M=65;
const int inf=1e9;
const int mod=998244353;;
const double eps=1e-8;
const long double pi=acos(-1.0L);
#define ls (i<<1)
#defin... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 2e5 + 5;
const int MAXM = 4e5 + 5;
int p[MAXN][2];
bool del[MAXN];
vector<int> poss[MAXM];
int cnt[MAXM];
inline int get_pos(vector<int> &vec)
{
for(int i=0; i<(int)vec.size(); ++i)
if(!del[vec[i]]) retur... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorit... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define FordE(... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
int main()
{
int h, w;
cin >> h >> w;
vector<char> bbb(w);
rep(i, w){
cin >> bbb[i];
}
int ans = 0;
for(int i = 0;i < h; i++){
vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,sum,maxn=-0x3f3f3f3f3f3f3f3f,minn=0x3f3f3f3f3f3f3f3f,n,a,t,q;
int main()
{
cin>>n;
while(n--)
{
cin>>a>>t;
if(t==1)
{
sum+=a;
maxn+=a;
minn+=a;
}
if(t==2)
... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define D(a) cerr << #a << " = " << a << endl
#else
#define D(a) 8
#endif
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define dforsn(i,s,n) for(int i=int(n-1);i>=int(s);i--)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define all(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const ll mod = 998244353;
ll qp(ll a,ll b = mod - 2)
{
ll ret = 1;
while (b)
{
if (b & 1)
ret = ret * a % mod;
b >>= 1;
a = a * a % mod;
}
return ret;
}
ll js[400000 + 110];
ll ijs[400000 + 110];
ll d[400000 + 11... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define mp make_pair
#define mt make_tuple
#define ld long double
#define VNAME(name) (#name)
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int> > small_heap;
typedef pr... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins insert
#define pqueue... |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
using namespace std;
ll power(ll n, ll k, ll mod){
ll res = 1;
while(k > 0){
if (k & 1)
res = res * n % mod;
n = n * n % mod;
k >>= 1;
}
return res;
}
ll tf(char... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template<class T> bool chmin(T& a,T b){if(a>b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b){if(a<b) {a = b; return true;} return fa... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
string at="atcoder";
void solve()
{
string s;
cin>>s;
if(at<s) return puts("0"),(void)0;
int pos=-1;
for(int i=1;i<s.length();i++)
{
if(s[i]!='a')
{
pos=i;
... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t; cin >> t;
string b = "atcoder";
while (t--) {
string s;
cin >> s;
if (s > b) cout << "0\n";
else {
vector<char> ch;
for (auto c : s)
... |
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define bit(n, k) ((n >> k) & 1)
#define len(s) (int)s.size()
#define range(a) a.begin(), a.end()
#define rrange(a) a.rbegin(), a.rend()
using namespace std;
using ll... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << ... |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
long long gcd_vec(vector<long long> const &A) { // N個の要素に対する最大公約数
int size = (int)A.size();
long long ret = A[0];
for (int i = 1; i <... | #include<iostream>
#include<cstdio>
using namespace std;
int n;
void solve()
{
double ans = 0;
for (int i = 1; i < n; i++) {
ans += (double)n / i;
}
printf("%.10lf\n", ans);
}
int main()
{
cin >> n;
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)
#define forr(i,x,n) for(int i = n;i >= x;--i)
#define Angel_Dust ios::sync_with_stdio(0);cin.tie(0)
const int N = 805;
int a[N][N],b[N][N],sum[N][N];
int n,k;
bool check(int limit)
{
forn(i,1,n) forn(... |
#include <math.h>
#include <iostream>
#include <string>
#include <iomanip>
#include <algorithm>
#include <tuple>
#include <vector>
#include <cmath>
#include<set>
#include <sstream>
#include <bitset>
#include <queue>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()//配列を全部参照
usi... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1.0), g = 9.80665;
ll t, tc = 0, i, j, k, n, m, cnt;
bool is;
vector<ll> divisors;
void genDivs(ll n)
{
for(i=1; i*i<=n; i++) {
if(n % i == 0) {
divisors.push_back(i);
... |
#include<bits/stdc++.h>
#include<math.h>
#define ll long long
using namespace std;
const int maxn=2e5+5;
#define INF 1e18+5
int n,m;
ll a[maxn];
ll sum1[maxn],sum2[maxn];
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
sort(a+1,a+1+n);
for(int i=2;i<=n;i+=2)
sum1... | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pi pair<int,int>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define ln(x) ((int)x.length())
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define endl ... |
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf =... | /* HAVE PATIENCE YOU CAN SOLVE EVERY QUESTION
JUST THINK*/
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
//#include <unordered_set>
//#include <unordered_map>
using namespace std;
int mod = 1000000007;
const double pi = 3.141592653689793238460;
const int inf =... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int nax=105;
int a[nax];
int32_t main()
{
int n,res=2e9;
cin>>n;
n++;
string s;
cin>>s;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<n;i++)
res=min(res,abs(a[i]-a[i+1]));
cout<<res<<'\n';
for(int i=0;... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... |
#include <bits/stdc++.h>
using namespace std;
#define forn(i,m,n) for(int i=m;i<n;i++)
#define vv vector
#define vi vv<int>
#define ii pair<int,int>
#define vii vv<ii>
#define mp make_pair
#define pb push_back
#define PI 3.141592653589
#define ll long long
#define pll pair<ll,ll>
#define vl vv<ll>
#define ff first
#de... | #include <bits/stdc++.h>
#include <iostream>
#include <stack>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
cout << 2*A + 100 - B;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) for(ll i=0; i<(ll)in.size(); i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<" "
#define rep(i, n) for(ll i=0; i<(n); i++)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n... | #include<bits/stdc++.h>
#define err() cout<<"UNSOLVABLE"<<endl,exit(0)
#define N 15
using namespace std;
int tot,a[N],A[N],B[N],C[N];
char t[N];
string s1,s2,s3;
map<char,bool> mp;
map<char,int> rpc;
int main(){
cin>>s1>>s2>>s3;
if(s3.size()<max(s1.size(),s2.size()))err();
for(int i=0;i<s1.size();i++)mp[s1[i]]=1;
f... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<string>
#include<cmath>
#define SYNC ios::sync_with_stdio(0),cin.tie(0)
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define MOD 998244353
#define EPS 1e-6
#define endl '\n'
us... |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#inclu... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using db = double;
using vi = vector<int>;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#... | #include <bits/stdc++.h>
using namespace std;
using gg = long long;
// MAX
// constexpr gg MAX = 25;
constexpr gg MAX = 1e2 + 5;
constexpr gg mod = 1e9 + 7;
constexpr gg INF = LONG_LONG_MAX / 2;
constexpr double thre = 1e-7;
gg ti, ni, mi, ki, di, pi, xi, yi;
gg v[MAX];
gg dp[MAX][MAX][MAX];
gg dfs(gg p, gg m, gg k, gg... |
#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef... | #include<bits/stdc++.h>
using namespace std;
template<typename T>inline bool read(T&x){
x=0;char c=getchar();int f=1;while(!isdigit(c)&&(c!='-')&&(c!=EOF))c=getchar();
if(c==EOF)return 0;if(c=='-')f=-1,c=getchar();
while(isdigit(c)){x=(x<<1)+(x<<3)+(c&15);c=getchar();}x*=f;return 1;
}template<typename T,typename...Args... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9)
#define LINF ll(1e18)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int n;
vector<int> to[410000];
int visited[410000];
int cnt;
bool tree;
void dfs(int v, int u=-1){
if(visit... | #include<bits/stdc++.h>
using namespace std;
const int N = 4e5+10;
int f[N],s[N];
int ff(int x){return f[x]?f[x]=ff(f[x]):x;}
int main(){
int n;
cin>>n;
int ans = 0;
for(int i = 1;i <= n;i++){
int a,b;
cin>>a>>b;
int u = ff(a), v = ff(b);
if(u!=v &&(!s[u]||!s[v]))
... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define reps(i,n) for (int i = 1; i <= (n); ++i)
#define rrep(i,n) for (int i = (n) - 1; i >= 0; --i)
#define rreps(i,n) for (int i = (n); i > 0; --i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define PB push_back
#defin... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,e;
cin>>a>>b>>c;
if(c==0)
{
if(a==b) {cout<<"Aoki"<<endl;}
else if(a>b){cout<<"Takahashi"<<endl;}
else if(a<b){cout<<"Aoki"<<endl;}
}
else{
if(a==b){cout<<"Takahashi"<<endl;}
else if(a>b... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <deque>
#include <complex>... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=1001000,maxm=0,mod=998244353;
int n;
//int a[maxn];
//vector <int> v;
//char s[maxn];
inline int read(){
int res=0;
char ch=g... | #include <bits/stdc++.h>
#define int long long
#define sum(v) accumulate(v.begin(), v.end(), 0)
#define $ cout<<"YES\n"
#define _$ cout<<"NO\n"
using namespace std;
int32_t main(){
int k,y,a,b,t; cin>>t;
int ans = 0;
while(t--){
cin>>a;
if (a>10)
{
ans=ans+(a-10);
}
}cout<<ans;
return 0;
}
|
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
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... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (b) - 1; i >= (a); i--)
#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>
#include <iostream>
using namespace std;
vector<vector<vector<double>>> dp(
110, vector<vector<double>>(110, vector<double>(110, -1)));
double query(int x, int y, int z) {
// cout << x << " " << y << " " << z << endl;
if (x >= 100 || y >= 100 || z >= 100) {
return 0;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
#define fast
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
/* ll t;
cin >> t;
while (t--)
{*/
ll a,b,c;
cin>>a>>b>>c;
ll x,y,z;
x=a*a;
... |
// Created by ...
#include <bits/stdc++.h>
#define vll vector< ll >
#define M 100000
#define MD 1000000007
#define pb push_back
#define sz(x) (int)(x).size()
#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 pii pair<ll,ll>
#define vec(a) vector<a >
#define all(a) (a)... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... |
#include <bits/stdc++.h>
using namespace std;
int str(string n) {
return (n[0] - '0') + (n[1]- '0') + (n[2]- '0');
}
int main()
{
string a,b;
cin>>a>>b;
printf("%d\n",max(str(a),str(b)));
return 0;
}
| #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <tuple>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <bitset>
#include <list>
#include<iomanip>
using namespace std;
using ll = long long;
using UL... |
#include <bits/stdc++.h>
#include <iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
using namespace std;
int main() {
long long int t,n,i,j,k,l,m,max1=0,count=0;
long long int a[300001];
scanf("%lld",&n);
max1=n%100;
if(max1==0)
printf("100");
else
printf("%lld\n",100-max1);
... | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
cout << ceil(n/100.0) ;
} |
//================code===================//
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define ci(t) cin>>t
#define co(t) cout<<t
#define LL long long
#define fa(i,a,b) for(int i=a;i<b;++i)
#define fd(i,a,b) for(int i=a;i>b;--i)
#define setp pair<pair<int,int>,int>
#define setl pair<L... | #include<bits/stdc++.h>
#define maxn 100005
#define LL long long
using namespace std;
struct edge{
int nxt,to;
}e[maxn<<1];
int first[maxn],tot;
void add_edge(int x,int y){
tot++;
e[tot].nxt=first[x];
e[tot].to=y;
first[x]=tot;
}
LL sz[maxn];
LL dp[maxn];
int n;
bool pd(int x){
LL k=3*sz[x]-2;
if(k&1)return 1;e... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin() ,(x).end()
const int N = 3e5 + 5;
const ll inf = 1e16;
int dx[] = {1 , 0 , -1 , -1 , 0 , 1};
int dy[] = {1 , 1 , 0 , -1 , -1 , 0};
void solve() {
string s;
cin >> s;
if (s >... | #include <bits/stdc++.h>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a,v) memset((a), v, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
co... |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << (max(a,b)-min(a,b) < 3 ? "Yes" : "No") << endl;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
using namespace std;
//#define MODE 1
#ifdef MODE
#d... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.