code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<t... | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define bug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i... |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpl = vector<pair<ll, ll>>;
using pll = pair<ll, ll>;
#define rep(i, k, n) for(ll i = k; i < n; i++)
#define pb push_back
#define mp make_pair
int main(){
ll n; cin >> n;
... |
#include<bits/stdc++.h>
using namespace std;
#define ar array<ll, 2>
#define ll long long
#define in insert
#define pb push_back
#define pii pair<ll,ll>
#define vt vector
#define P_Q(x) priority_queue<x>
#define p_q(x) priority_queue<x, vector<x>, greater<x>>
#define For(i, n) for(ll i = 0; i < n; i++)
#define R... |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
int i,f=0,p=0;
string s,s1;
cin>>s;
for(i=s.size()-1;i>=0;i--)
{
if(s[i]!='0')break;
else if(s[i]=='0')p++;
}
for(i=1;i<=p;i++)
{
s1+='0';
}
for(i=0;i<s.size();i++)
{
s1+=s[i];
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,f=0,b,c=0,d;
cin>>a;
while(a%10==0&&a!=0){
a/=10;
}
d=a;
while(a>0){
b=a%10;
a/=10;
c=c*10+b;
}
if(d==c) f=1;
if(f==1) cout<<"Yes";
else cout<<"No";
return 0;
} |
/*Bismillahi-r-Rahmani-r-Rahim*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi acos(-1.0)
#define mod 1000000007
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define vi vector<int>
#define vl vector<ll int>
#define ... | #define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#define boost {ios_base::sync_with_stdio(false); cin.tie(); cout.tie();}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long... |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int N;
string S;
string T;
cin >> N >> S >> T ;
int n1 = ... | #include <bits/stdc++.h>
#define ll long long int
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define io ios_base::sync_with_stdio(false); cin.tie(NULL);
#define N 200005
using namespace std;
void great(){
cout<<">";
}
void same(){
cout<<"=";
}
void small(){
cout<<"<";
}
int main()
{
ll a... |
/*
* * * * * * * * * * * * * * * * * *
*
* @author: Xingjian Bai
* @date: 2021-04-10 13:21:51
* @description:
*
*
* @notes:
* g++ -fsanitize=address -ftrapv
* * * * * * * * * * * * * * * * * */
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#defi... | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_b... |
#include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define debug(x) cout<<#x<<" = "<<x<<" \n"
typedef long long ll;
typedef unsigned long long ull;
void xin(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define inf 2147483647
#define range(x,a,b) (a)<... |
#ifdef LOCAL
cout<<"\nTime Elapsed: " << 1.0*clock() / CLOCKS_PER_SEC << " sec\n";
#endif
#include "bits/stdc++.h"
using namespace std;
using namespace std::chrono;
#define ll long long
#define vll vector<ll>
#define pii pair<ll,ll>
#define un_mp unordered_map<ll,ll,modified_hash>
#define endl "\n"
#define pb... | // E - Divide Both
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
int L, R; cin>>L>>R;
auto x = [&](int k){ return R/k - (L-1)/k; };
ll ans = 0;
vector<ll> F(R+1);
for(int k=R; k>=2; --k){
ll c = x(k);
F[k] = c * c;
for(int g=2*k; g<=R; g+=k) F[k] -= F[g];
ans += F[k];
}
... |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include <cmath>
using namespace std;
int cd(long long int i){
int j=0;
while(i){
j++;
i=i/10;
}
return j;
}
int main(){
int N;
cin>>N;
vector<int> V1(N);
vector<int> V2(N);
int max=0, min=I... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,sum=0,c;
cin>>n;
int a[n+1],b[n+1];
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
cin>>b[i];
for(int i=1;i<=1000;i++)
{
c=1;
for(int j=1;j<=n;j++)
if(i<a[j]||i>b[j])
c=0;
if(c==1)
sum++;
}
cout<<sum;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
long long ans = 0;
vector<int> a(2 * n);
for (auto &i : a) cin >> i;
priority_queue<int, vector<int>, greater<int>> pq;
pq.emplace(max(a[n - 1], a[n]));
for (int i = 1; i < n; i++) {
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N; cin >> N;
vector<pair<ll, ll>> range(N);
for(int i = 0; i < N; i++){
int t; ll l, r; cin >> t >> l >> r;
l *= 2LL; r *= 2LL;
if(t == 2 || t == 4)r--;
if(t == 3 || t == 4)l++;
range[... |
#include<bits/stdc++.h>
#define PI 3.141592653589793238462
#define eps 1e-20
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdd;
ll mod=1e9+7;
ll qpow(ll a,ll b){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll a, b;
cin>>a>>b;
cout<<a*b/(double)100<<endl;
return 0;
}
|
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline int read()
{
int x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
ll H,W;
ll A,B;
vector<vector<bool>> note;
ll dfs(ll h,ll w,ll count) {
if(h==H-1&w==W-1) {
if(count==A) {
return 1;
}
else return 0;
}
ll s=0;
if(!note[h][w]) {
if(h<... |
/*
may God of speed-forces be with us !!
--problem isnt, life is empty;
--problem is, life is full of emptiness;
a non-strugling pupil coder !!
*/
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
//#define biGinf 9e+18
#define all(v) v.begin(),v.end()
#define ra... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i);
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> x(n), y(n);
for (int i = 0; i < n; i++) {
cin >> x.at(i) >> y.at(i);
}
string ans = "No";
for (int i = 0; i < n; i++) {
for (int j = i+1;... |
#include<bits/stdc++.h>
using namespace std;
int n,m,ans;
int now[2008],to[20000],pre[20000],tot;
void add(int x,int y) {
to[++tot]=y;
pre[tot]=now[x];
now[x]=tot;
}
bool vis[20000];
void dfs(int u) {
vis[u]=1;
ans++;
for(int i=now[u]; i; i=pre[i]) {
int v=to[i];
if(!vis[v]) dfs(v);
}
}
int main() {
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
vector<vector<int>> g;
vector<int> visited;
int dfs(int v) {
int res = 1;
visited[v] = 1;
for (auto nv : g[v]) {
if (visited[nv]) continue;
res += dfs(nv);
}
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define f(a,b,c,d) for(ll a=b; a<c; a+=d)
#define MOD 1000000007
#define pb push_back
#define umap unordered_map
#define uset unordered_set
#define pq priority_queue
void solve()
{
ll a, b, c;
cin >> a >> b >> c;
cout << 21 - a - b - c;
}
... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pii std::pair<int, int>
#define pdd std::pair<double, double>
#define I... |
#include <bits/stdc++.h>
using Int = long long; // clang-format off
using pii = std::pair<Int, Int>;
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define RREP_(i, a_, b_, a, b, ...) for (Int i = Int(b) - 1, low... | #include <bits/stdc++.h>
using namespace std;
using I64 = int64_t;
template <typename T> T gcd(T x, T y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }
const char NL = '\n';
int main() {
int N, M;
cin >> N >> M;
v... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N;
ll X;
vector<ll> A;
map<pair<int, ll>, ll> memo;
ll dfs(int i, ll x) {
if (x == 0) return 1;
if (i == -1) return 0;
if (i < N - 1 && A[i + 1] <= x) return 0;
if (x % A[i] == 0) return 1;
if (memo.count({i, x})) return memo[... | #include<bits/stdc++.h>
using namespace std;
char s[101][101];
int ans;
int main() {
int n,m;
scanf("%d%d",&n,&m);
for(int i=1; i<=n; i++)
scanf("%s",s[i]+1);
for(int i=1; i<n; i++) {
bool ok=false;
for(int j=1; j<=m; j++) {
if(s[i][j]!=s[i+1][j]) {
if(!ok) {
ans++;
ok=true;
}
} else o... |
#include <vector>
#include <array>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#inc... | #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 int long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define pll pair<int,int>
#define MOD 1000000007
#define M2 998244353
#define INF 2e18
#define EPS 1e-9
#define ... | // clang-format off
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define fst first
#define snd second
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forn1(i,n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcount... |
#ifdef _DEBUG
#include "../../../library/src/debug_template.cpp"
#define DMP(...) dump(#__VA_ARGS__, __VA_ARGS__)
#else
#define DMP(...) ((void)0)
#endif
#include <cassert>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#incl... | #include <bits/stdc++.h>
using namespace std;
bool solve(long long s, long long p) {
p = 4 * p;
long long up = min(p, (long long)sqrt(p) + 5);
for (long long p1 = 1; p1 <= up; p1++) {
if (p % p1 == 0 && 2 * s == p1 + p / p1) return true;
}
return false;
}
int main() {
ios_base::sync_wi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define All(a) (a).begin(),(a).end()
#define INF numeric_limits<ll>::max()
#define MOD 1000000007
ll n;
vector<ll> v;
bool check(ll md){
vector<ll> y;
ll N=n;
while(N>0){
y.push_back(N%md);
N/=md;
}
reverse(All(y));
if(v.size()>y.size()... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int ans = 1;
for(int i = b - a; i ; i--)
{
if(b / i != (a + i - 1) / i)
{
cout << i;
break;
}
}
}
|
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
#define tp make_tuple
typedef pa... | #include <iostream>
#include <algorithm>
#define MOD 998244353
int N, K;
int A[50][50];
int row_ok[50][50];
int col_ok[50][50];
long long num[51];
using namespace std;
long long calc(int line_ok[][50]) {
long long ans = 1;
int group[50];
int groupN[50];
for (int i=0; i<N; i++) group[i] = i;
for (in... |
#include <iomanip>
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
long long m = 0, c = 0;
double e = 0;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
m += abs(x);
c = max(c, abs(x));
e += (x * x);
}
e = sqrt(e);
cout << m << endl;
cout << setprecision(... | #include <bits/stdc++.h>
#define fi first
#define se second
#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 srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... |
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb(i) push_back(i)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=b;i>=a;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define VI vector<int>
#define VLL vector<ll>
#define MPII map<pair<int,int>,int>
#define mp make_pair
#define PQ... | #include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i,a,b) for(int i=int(a... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using pld = pair<ld,ld>;
using vll = vector<ll>;
using vld = vector<ld>;
using vstr = vector<string>;
#define _GLIBCXX_DEBUG
#define rep(j, m) for (ll j = 0; j < (ll)(m); j++)
#define rep2(i, l, n) for (... | #include <bits/stdc++.h>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 1e5 + 7;
int main(){
int d; scanf("%d", &d);
printf("%d\n", 100 - d % 100);
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
string s;
bool ans = true;
bool flag = true;
int point = 0;
int main()
{
cin >> s;
reverse(s.begin(), s.end());
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
continue;
} else {
point = i;... | //kyoprosaikoooooooooooo!!
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
//素数判定 O(√N)
ll prime (ll abc) {
if (abc < 2) {
return 0;
}
else if (abc == 2) {
return 1;
}
else if (abc % 2 == 0) {
return 0;
}
double sqrtabc = sqrt(abc);
for (int i = 3; i... |
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io(){
std::cin.tie(n... | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define ll long long
#define ld long double
#define ALL(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
vector<pair<ll,ll>> a;
rep(i,n){
ll t, l, r;
cin >> t >> l >> r;
l *= 2;
r *= 2;
... | // ＵＴＦ−８
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using lc = complex<double>;
template <class T>
bool complex_comparator(const complex<T> &a, const complex<T> &b) {
return real(a) == real(b) ? imag(a) < imag(b) : real(a) < real(b);
}
/* #include<atcoder/all> */
/* using namespace at... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define mydeb(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
//#define mydeb(fmt, ...)
int main()
{
int64_t... | #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<ll,int> ;
const int mod=1000000007;
const int N=1e5 ;
const ll INF=1e18;
struct Edge
{
int to,t,k ;
Edge(int to, int t ,int k):to(to),t(t),k(k){}
};
void solve(){
int n,m,s,d ;
cin>>n>... |
#include <bits/stdc++.h>
using namespace std;
/* * * * * * * * * * */
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
/* * * * * * * * * * */
/* *
*
* I love Ylva Eriksson
*
* */
int main(){
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//freopen("input.txt", "r", stdi... | #include <bits/stdc++.h>
using namespace std;
long long mod=1e9+7,ans,n;
int main ()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
long long a[n+1],f[n+1];
for(int i=1;i<=n;i++) cin >> a[i];
f[0]=1,f[1]=1;
for(int i=2;i<=n;i++) f[i]=(f[i-1]+f[i-2])%mod;
ans=(f[n]*a[1])%mod;
f... |
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define BIT(i) (1LL << (i))
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const long l... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxl=3e5+10;
int n,m,k,tot,cas,ans;
int a[maxl];ll fac[maxl];
int cnt[maxl][20];
ll dp[20][maxl];
int x[maxl],y[maxl],z[maxl];
bool vis[maxl];
char s[maxl];
inline void prework()
{
fac[0]=1;
for(int i=1;i<=18;i++)
fac[i]=fac[i-1]*i;
sc... |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
//#include<atcoder/all>
//using namespace atcoder;
using ll = long long;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
const int MAX_N = 18;
vector... |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
type... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
#include <chrono>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<ll, ll> pii;
typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order... |
#include <iostream>
using namespace std;
int H, W, A, B, ans = 0;
void dfs(int i, int bit, int A, int B){
if(i == H * W) return (void)ans++;
if(bit & 1 << i) return dfs(i + 1, bit, A, B);
if(B) dfs(i + 1, bit | 1 << i, A, B - 1);
if(A){
if(i % W != W - 1 && ~bit & 1 << (i + 1)) dfs(i + 1, bit | ... | #include<bits/stdc++.h>
using namespace std;
main()
{
float v,t,s,d;
cin>>v>>t>>s>>d;
float app=d/v;
if(app<t||app>s)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
} |
#include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
int a[110];
int b[110];
int c[110];
int d[110];
int n,m,k;
int ans=0;
int s[110];
int p[110];
void f(int x)
{
if(x==k)
{
for(int i=1;i<=n;i++) p[i]=0;
for(int i=1;i<=k;i++)
{
if(s[i-1]==0) p[c[i... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #define int long long
template <class T>
bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T... |
#include<iostream>
#include<utility>
#include<algorithm>
#include<map>
#include<vector>
#include<cmath>
#define forn(i, x, n) for(int i = x; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const bool DEBUG = 0;
void solve(){
int n;
cin>>n;
int sz = (1 << n);
int a... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<min(min(a,b),min(c,d));
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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; ll x;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
const int MAXIOSIZE = 1 << 24 | 1;
unsigned char buf[MAXIOSIZE], *p1, *p2;
#define gc (p1 == p2 && (p2 = (p1 = b... |
#include <iostream>
using namespace std;
int main() {
int c,a,b;
cin >> a >> b>> c;
cout << a-b+c;
// your code goes here
return 0;
} | #include<bits/stdc++.h>
#define rep(i, m, n) for(int i = m; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> m(3);
m[0] = a;
m[1] = b;
m[2] = c;
sort(m.rbegin(), m.rend());
int ans = 0;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,x;
double now;
int main() {
cin>>n>>x;
x*=100;
for(int i=1,v,p;i<=n;i++) {
cin>>v>>p;
x-=v*p;
if(x<0) {cout<<i<<endl;return 0;}
}
cout<<-1;
return 0;
}
| //-----------------------------------------------MACROS----------------------------------------------------------------------
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define ull unsigned long long
#define lld long double
#define a... |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::vector;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> cnt(200);
rep(i, n) cnt[a[i] % 200]++;
ll ans = 0;
rep(i, 200) ans += (ll)... |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P... | #include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
typedef long long int ll;
using namespace std;
#define maxn 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
const int mm=2e5+100;
ll d[mm];
int main()
{
ll n,m,i,j,t,a,b,c,p,k,kk;
... |
#include <bits/stdc++.h>
using namespace std;
#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 rep2(i, n, m) for(int i=(int)n; i<=(int)m; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
const ll inf=1LL<<60;
const ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define d(x) cout<<x<<" "
#define nl cout<<endl
#define rep(var,init_val,final_val) for(int var = init_val; var < final_val; ++var)
#define show(a,b) rep(i,0,b) d(a[i]);nl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
if (fopen("input.in", "r"))
freopen("input.in", "r", stdin), freopen("output.out", "w", stdout);
int n;
cin>>n;
vector<int> a(n); for(int& i : a) cin>>i, i--;
vector<int> loc(n);
for(... |
#include <iostream>
#include <vector>
using namespace std;
vector<int> v[1500010];
int main(){
int i,j,n,m; cin >> n >> m;
for(i=0;i<n;i++) v[i].push_back(-1);
for(i=0;i<n;i++){
int a; cin >> a;
v[a].push_back(i);
}
for(i=0;i<n;i++) v[i].push_back(n);
for(i=0;i<=n;i++){
i... | #include<bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> p2;
#define sz(a) ll(a.size())
ll a[2000005];
void solve(){
ll n,m;
cin>>n>>m;
for(ll i=0;i<n;i++)
cin>>a[i];
ll l0=0,r0=n;
while(l0<=r0){
ll ... |
#include <cmath>
#include <iostream>
int main() {
long long n;
std::cin >> n;
long long ans {0};
long long k {1};
while (n >= pow(10, k*3)) {
ans += n - pow(10, k*3) + 1;
++k;
}
std::cout << ans << std::endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
string s;cin>>s;int cnt=0;
for(int i=3;i<s.size();i++){
if(s[i]=='e' && s[i-1]=='N' && s[i-2]=='O' && s[i-3]=='Z')cnt++,i+=2;
}
cout<<cnt<<e... |
// arc110_a
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=200010; //check the limits, dummy
int a[N];
int n, m;
int main(){
// int t;
// while()... |
#include <cstdio>
int main() {
long long s, p;
scanf("%lld%lld", &s, &p);
for (long long i = 1; i * i <= p; ++i)
if (p % i == 0) {
if (i + p / i == s) return puts("Yes"), 0;
}
puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define io ios::sync_with_stdio(false); cin.tie(0)
int main()
{
io;
int n, m; cin >> n >> m;
ll a = 0, b = 0;
rep(i, n) {
string s;
cin >> s;
... | #include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
using i32 = int32_t... |
#include <bits/stdc++.h>
using namespace std;
//#include "testlib.h"
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define int long long
#define ll long long
#define M 1000000007
#define MM 998244353
#define inputarr(a,n) for(int i=0;i<n;++i) cin>>a[i]
#define GCD(m,n) __gcd(m,n)
#define LCM(m,n) ... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class c, class cmp = less<c> > using ordered_set = tree<c, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NUL... |
#include"bits/stdc++.h"
using namespace std;
#define pb push_back
#define eb emplace_back
#define ins insert
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define repr(i,a,b) for(int i=a;i>=b;i--)
#define lb lower_bound
#define ub upper_bound
#define sz(x... | #include<bits/stdc++.h>
#define For(a,b,c) for(int a=b;a<=c;++a)
#define Dor(a,b,c) for(int a=b;a>=c;--a)
#define CC(_...) fprintf(stderr,_)
using namespace std;
typedef long long LL;
enum{N=800007};
int n,A[N],B[N],I[N],S[N];
bool cmp(int x,int y) {
return A[x]<A[y];
}
int main() {
scanf("%d",&n);
For(i,1,2*n) scan... |
#include<bits/stdc++.h>
using namespace std;
#define Mod(x) (x>=P)&&(x-=P)
#define rep(i,a,b) for(ll i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(ll i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(ll i=hd[a];i;i=nxt[i])
typedef long long ll;
void Max(ll &x,ll y){x<y&&(x=y);}
void Min(ll &x,ll y){x>y&&(x=y);}... | #include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<utility>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5;
ll A[MAXN], N, M, K, mx[MAXN], mn[MAXN];
bool check(ll x) {
ll MX = 0, MN = 0;
for(int i = 1; i <= K; i++) {
MX += (x + M... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bo... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
#include <assert.h>
using namespace std ;
using... |
#pragma GCC optimize("Ofast") //Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define fastio ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(1... | #include<bits/stdc++.h>
using namespace std;
namespace IO
{
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()
{
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return ... | #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
using namespace std;
typedef long long LL;
typede... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
void solve()
{
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
int max_gcd = 1;
int max_count = 0;
for (int gcd = 1000; gcd > 1; --gcd) {
int coun... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
using P=pair<ll, ll>;
int gcd(int a, int b)
{
if (b == 0) return a;
return (gcd(b, a % b));
}
signed main(void)
{
int n;
int ans, out, tmp, g, g_tmp;
cin >> n;
vector<int> a(n);
rep(i, n) cin>>a... |
#pragma GCC optimize(2)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#include<bitset>
#include<climits>
using namespace std;
//#define int long long
typedef long long ll;
//template<typename T = int>
inline int rea... | #include <bits/stdc++.h>
using namespace std;
using vi = vector <int>;using vl = vector <long long>;
using vs = vector <string>;using vc = vector <char>;
using ll= long long;using vvl = vector<vector<ll> >;
using vvc = vector<vector<char> >;using vd = vector <double>;
using vpl = vector <pair<ll,ll> >;using vb = vector... |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vl;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
const int mod = 1e9+7;
const int N = 1e5+2;
#pragma region Debugger
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void ... |
//Iamskk//
#include <iostream>
#include <iosfwd>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cassert>
#include <cctype>
#include <climits>
#include <vector>
#include <bitset>
#include <set>
#include <queue>
#include <stack>
#include <map>
#inclu... | #include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
#define INF ((1LL << 62) - (1LL << 31))
#define MOD 1000000007
using namespace std;
using ll = long long;
int main(void)
{
std::cin.tie(0);
std::ios::... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,P;
cin >> N >> M;
P=N+M;
vector<int> A(P);
for (int i=0;i<P;i++) {
cin >> A.at(i);
}
sort(A.begin(),A.end());
for (int i=0;i<P;i++) {
if (i==0) {
int a,b;
a=A.at(0);
b=A.at(1);
if (a!=b) {
... | ///********************** Bismillahir Rahmanir Rahim *****************///
#include<bits/stdc++.h>
using namespace std;
///*********************** Template Start Here ***********************///
///************************ C o n t a i n e r ************************///
typedef long long ll;
typedef unsigned long long ull... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
#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 ms memset
#define pb push_back
#define F first
#... | // #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//All indexing is 0-based
template<class key, class... |
/* بِسْمِ اللَّـهِ الرَّحْمَـٰنِ الرَّحِيمِ
( إِنِ الْحُكْمُ إِلَّا لِلَّهِ )
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const long double pi=acos(-1);
#define x fir... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define MOD 1000000007
int main() {
int n, x;
cin >> n >> x;
// vector<int> v(n), p(n);
int sum = 0;
rep(i, n) {
... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
const int maxn=2e5+5;
struct node{
int l,r,x;
}p[maxn];
ll a[maxn*2];
int b[maxn*2];
map<int,int>pos;
int main(){
int n,c;
scanf("%d%d",&n,&c);
int cnt=0;
for(int i=1;i<=n;i++){
int l,r,x;
scanf(... | #include <iostream>
#include <vector>
#include <algorithm>
template<class Tp>
void chmax (Tp &a, const Tp &b) {
if (a < b) a = b;
}
int main() {
int n;
long long t;
std::cin >> n >> t;
std::vector<long long> a(n);
for (auto &e : a) std::cin >> e;
int n1 = (n >> 1), n2 = n - n1;
long long time = 0;
std::vec... |
#include <iostream>
#include <vector>
#include <array>
#include <cmath>
#include <string>
#include <algorithm>
#include <functional>
#include <map>
#include <tuple>
#include <queue>
#include <bitset>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long int;
int cnt = 0;
using Graph = v... | //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FI... |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define sz(s) (int)s.size()
#define vi vector<int>
#define ii pair<int,int>
#define vii vector<ii>
const int MOD = 1e9 + 7;
const double pi = acos(-1);
const double EPS = 1e-9;
ll binpowmod(ll a, ll... |
/*/ Author : Abhishek Chauhan /*/
#include<bits/stdc++.h>
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std::chrono;
using namespace __gnu_pbds;
using namespace std;
// a+b = a^b + 2*(a&b)
// whenever using a comparator return true only if a<b
#define rep(i,n) ... |
#include <bits/stdc++.h>
using namespace std;
const int MX = 2000005;
vector<vector<int>> g(MX);
vector<int> a;
int ans = 0;
vector<bool> used(MX , false);
void dfs(int v , int &depth) {
if (used[v]) {
return;
}
used[v] = true;
for (int v2 : g[v]) {
if (!used[v2]) {
depth++;
dfs(v2 , depth... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define put(i) cout << i << endl
#define rep(i, s, n) for (long long i = s; i < (long long)(n); i++)
using namespace std;
using ll = long long;
ll n;
vector<ll> a;
struct UnionFind {
vector<int> r;
UnionFind(int N) { r = vector<int>(N + 1, -1); }
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N, X;
cin >> N >> X;
vector<int> V(N);
vector<int> P(N);
int flag = 0;
ll now = 0;
ll total = 0;
for(ll i = 0; i < N; i++){
cin >> V.at(i) >> P.at(i);
}
for(ll i = 0; i < N; i++){
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=n... |
#include<bits/stdc++.h>
using namespace std;
int n,a[1001],t[1001];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
t[a[i]]++;
}
for(int i=1;i<=n;i++){
if(t[i]!=1){
puts("No");
return 0;
}
}
puts("Yes");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if ( N%2 == 1 ) {
cout << "Black" << endl;
}
else {
cout << "White" << endl;
}
} | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_lr(i, f, n) for (int i = f; i < (int)(n); i++)
#define sum(v) accumulate(arr.begin(),arr.end(),0)
#define sumll(v) accumulate(arr.begin(),arr.end(),0LL)
#def... |
#include<bits/stdc++.h>
using namespace std;
#define int long long //delete if causing problems
#define F first
#define dbg(x) cout<<#x<<" "<<x<<endl;
#define S second
#define setbit(n) __builtin_popcount(n)
#define all(x) x.begin() , x.end()
#define clr(x) memset(x,0,sizeof(x))
#define fast ios_base::sync_with_stdio... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (long long i = (s); i < (long long)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
int main() {
... |
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define PI acos(-1.0)
#define No cout<<"No\n"
#define Yes cout<<"Yes\n"
#define no ... | #include <bits/stdc++.h>
//#include <atcoder/modint.hpp>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
const int mod2=998244353;
using P = pair<int,int>;
using Pl= pair<ll,ll>;
using ld=long double;
using V=vector<int>... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,a[200005],c[200005],c2[200005],d[200005];
vector<int> g[200005];
void U(int x,int k){
if(!x)return ;
while(x<=n)c[x]+=k,x+=x&-x;
}
int Q(int x){
int r=0;
while(x)r+=c[x],x-=x&-x;
return r;
}
void U2(int x,int k){
if(!x)return ;
while(x<=n)c... | #include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<(int)(n);i++)
#define si(c) ((int)(c).size())
#define forsn(i,s,n) for(int i = (int)(s); i<((int)n); i++)
#define dforsn(i,s,n) for(int i = (int)(n)-1; i>=((int)s); i--)
#define all(c) (c).begin(), (c).end()
#define D(a) cerr << #a << "=" <... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string sa, sb;
cin>>sa>>sb;
cout<<max(((sa[0]-'0')+(sa[1]-'0')+(sa[2]-'0')), ((sb[0]-'0')+(sb[1]-'0')+(sb[2]-'0')));
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll LINF = 1e18;
template <class T>
void get_uni... |
//#include "test.hpp"
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define pre(a,b) cout<<fixed<<setprecision(a)<<b<<"\n";//a for precision b for answer
#define mp make_pair
#define pb push_back
#define forn(... | #include <iostream>
#include <algorithm>
using namespace std;
main()
{
string tak = "Takahashi";
string aok = "Aoki";
int a, b, c;
cin >> a >> b >> c;
if(c == 0){
while(true)
{
if(a <= 0){cout << aok;return 0;}
a--;
if(b <= 0){cout << tak; retu... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... |
#include <bits/stdc++.h>
//#define rep(i,a,n) for (int i=a;i<n;i++)
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(ll i = 0; i < (n); ++i)
#define rep2(i, n) for(ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for(ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for(ll i = (a); i < (b); i += (c))... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
void solve(){
int n,C;cin>>n>>C;
vector<int>a(n),b(n),c(n);
for(int i=0;i<n;i++) cin>>a[i]>>b[i]>>c[i];
map<int,int>mp;
for(int i=0;i<n;i++){
mp[a[i]]+=c[i];
mp[b[i]+1]-=c[i];
}
int curr=0... |
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size()
#define int long long int
#define loop(i,a,b) for(int i=a;i<b;i++)
#define scan(arr,n) for (int i = 0; i < n; ++i) cin >> arr[i]
#define vi vector<int>
#define si set<int>
#define pii pair <int, int>
#define sii set<pii>
#define vii vector<pii>... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false);}} fast;
using ull = unsigned long long;
using ll = long long;
using vi = vector<int>;
using vl = vector<long>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvll = ve... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cmath>
#include <climits>
#include <map>
#include <queue>
#include <functional>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int) n; i++)
#def... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int main(){
cin >> n;
for(int i=0; i<n ;i++){
cout << i*2%n+1 << ' ' << (i*2+1)%n+1 << '\n';
}
} |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=int;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typename T1, ... | #pragma GCC optimize("Ofast")
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // ... |
# include<bits/stdc++.h>
using namespace std;
# define l long long
# define db long double
# define rep(i,a,b) for(l i=a;i<b;i++)
# define vi vector<l>
# define vvi vector<vi>
# define vsi vector<set<l> >
# define pb push_back
# define mp make_pair
# define ss second
# define ff first
# define pii pair<l,l>
# define... | #include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int n;
char p[201000], st[201000];
int main(){
int i;
scanf("%d",&n);
scanf("%s",p);
int top = 0;
int res = 0;
for(i=0;i<n;i++){
if(p[i]!='f' && p[i]!='o' && p[i]!='x'){
res += top;
res++;
... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
const lld N = 200043;
const lld MOD = 1000000007;
lld add(lld x, lld y)
{
x =((x%MOD)+(y%MOD))%MOD;
while(x >= MOD) x -= MOD;
while(x < 0) x += MOD;
return x;
}
ll... | #define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<climits>
#include<bitset>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<list>
#include<fun... |
#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 H, W;
cin >> H >> W;
char map[H][W];
rep(i, H) rep(j, W) {
char c;
cin >> c;
map[i][j] = c;
}
int count = 0;
rep(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
constexpr int inf=1000001000;
constexpr ll INF=2e18;
constexpr ll mod=1000000007;
// ll MOD=998244353;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
set<int64_t> check;
int64_t ans = 0;
for (int i = 2; i <= log2(N); i++){
int a = 2;
while(true){
if(pow(a, i) > N){
break;
}
check.insert(pow(a,i));
a++;
}
}
ans = N - check.s... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define qi queue<int>
#define sti stack<int>
#define pqi priority_queue<int>
#define pqii priority_queue<pair<int, int>>
#define pb push_back
#define mp make_pair
#def... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<int,int>
ll cnt(ll y,ll x,map<ll,ll> &data){
if(data.count(y)){
return data[y];
}
if(x>=y){
data[y] = x-y;
return (ll) x-y;
}
if(y%2==0){
ll z = min(cnt(y/2,x,data)+... | #include <bits/stdc++.h>
#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
signed main(){
fastio
int x,y;
cin >> x >> y;
int ans = 1e18;
for(int i = 0;i <= 63;i++){
if(x > LLONG_MAX/2) break;
int sum = i;
int diff = abs(x-y);
sum += diff/(1L... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
ll x,y,a... | #include<bits/stdc++.h>
#include<chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define ll long long int
#define ull unsigned long long int
#define FOR(I,a,b) for(int I=a;I<b;I++)
#define FORit(it,a) for... |
#include <cstdio>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_se... | #include <bits/stdc++.h>
#include <string.h>
#include <math.h>
using namespace std;
#define loop(i, x, y) for (i = x; i < y; i++)
#define loopr(i, x, y) for (i = x; i > y; i--)
//use *it instead of it
#define vloop(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define vloopr(it, x) for (auto it = x.end() - 1;... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define Mp make_pair
#define pb push_back
using ll = long long;
using db = double;
using pii = pair<int, int>;
using vi = vector<int>;
mt19937 mrand(time(0));
ll get(ll r) { return ((ll)mrand() * mrand() % r + r) % r; }
ll get(ll l, ll r)... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(),(x).end
#define rall(x) (x).rbegin(),(x).rend
const int MOD=(int)1e9+7;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
//freopen("teamwork.in","r",stdin);
//freopen("teamwork.out","w",stdout);
int n... | #pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
// include
#include <bits/stdc++.h>
using namespace std;
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T>
inline string toString(T x) {
ostringstream sou... |
//デバッグ用オプション：-fsanitize=undefined,address
//コンパイラ最適化
#pragma GCC optimize("Ofast")
//インクルードなど
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vint = vector<int>;
using vll = vector<ll>;
using vbool = vector<bool>;
template <class T>
using arr = vector<vector<T>>;
//マクロ
//forループ
//引数は、(ループ内変... | #include <iostream>
using namespace std;
using ll = int64_t;
int main(){
ll n;
cin >> n;
ll ans = 0;
for(ll i = 0; i < n; i++){
ll a, b;
cin >> a >> b;
ans += b * (b + 1) / 2 - a * (a - 1) / 2;
}
cout << ans << endl;
} |
// Artur Kraska, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,P... | #include<bits/stdc++.h>
#define ll long long int
#define pll pair<ll,ll>
#define vpll vector< pll >
#define mpll map<ll,ll>
#define MOD 998244353
#define all(v) v.begin(),v.end()
#define s(v) v.size()
#define test ll t;cin>>t;while(t--)
#define vec vector<ll>
#define read0(v,n) for(int i=0;i<n;i++)cin>>v[i];
#define re... |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<map>
#include<vector>
#include<set>
//const int MOD = int(1e9) + 7;
using namespace std;
int main(){
long long int s,p;
cin >> s >> p;
int flag = 0;
for(int i =1; i< 10000000;i++){
long long int t = pow(i,2);
t = t - (s... | #include<bits/stdc++.h>
using namespace std;
long const mod = 1e9+7;
int main(){
long s,p;
cin >> s >> p;
for(long i = 1;i<=sqrt(p);i++){
if(p % i != 0)continue;
if(i + p/i == s){
cout << "Yes";
return 0;
}
}
cout << "No";
} |
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
using namespace std;
template <typename T>
inline void read(T&x){
x=0; char temp=getchar(); bool f=false;
while(!isdigit(temp)){if(temp=='-') f=true; temp=getchar();}
while(isdigit(temp)){x=(x<<1)+(x<<3)+temp-'0'; temp... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
ll a, b, k;
const int n = 35;
vector<vector<ll>> dp(n + 2, vector<ll>(n + 2));
string findkth(int i, int j, ll x) {
if (i == 0) return string(j, 'b');
if (j == 0) return string(i, 'a');
if (x <= d... |
//#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<time.h>
#include<stdio.h>
#include<string.h>
#define un unsigned
#define srd srand(time(0))
#define ll long long
#define con continue
#define gtc getchar()
#define ptc putchar
#define dou double
#define eps 0.00000000001
#define opr operator
#define cl(... | #include<bits/stdc++.h>
#define fore(i,n) for(int i=0;i<(n);i++)
#define foree(i,a,n) for(int i=(a);i<=(n);i++)
#define mp make_pair
#define pb push_back
#define endl "\n"
#define pii pair<int,int>
#define pll pair<long long,long long>
#define ll long long
#define inp(n) int n;cin>>n;
#define fastio ios_base::sync_with... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n, a, b, i, sum = 0;
cin>>n;
vector<ll> arr(n);
for(i=0;i<n;i+=1)
{
cin>>a>>b;
arr[i] = 2*a+b;
sum+=a;
}
sum = -sum;
sort(arr.begin(), arr.end(), greater<ll>());
i = 0;
... | #include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
ll c,x;vector<ll>v;
int main(){
ll n;cin>>n;vector<vector<ll>>s(n,vector<ll>(2));
for(int i=0;i<n;i++){
for(int j=0;j<2;j++)cin>>s[i][j];
x+=s[i][0];
v.push_back(2*s[i][0]+s[i][1]);
}
sort(v.begin(),v.end());reverse(v... |
/*
2021-04-15 03:44:57.635786
Category: cumsum
Rating: x
*/
/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
#include<bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repr(i, n) for(int i = (n-1); i >= 0; --i)
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; ... |
#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>;
ll X, Y;
unordered_map<ll, ll> mp;
ll solve(ll y) {
if(mp.find(y) != mp.end()) return mp[y];
if (y == 1) return mp[y] = abs(X-y);
else if (y % 2 == 1) return mp[y] =... | #include<bits/stdc++.h>
#define faster ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long
#define pb push_back
const double PI = acos(-1.0);
using namespace std;
int main()
{
faster
ll n,m;
cin>>n>>m;
if(m==0)
{
cout<<1<<endl;
... |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstdlib>
#include <string.h>
using namespace std;
int main()
{
long long n, k;
cin >> n >> k;
for (int i = 0; i < k; i++)
{
if (n % 200 == 0)
... | #include <bits/stdc++.h>
using namespace std;
int main(){
double a, b;
cin >> a >> b;
cout << a * b / 100 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll mod=1e9+7;
#define rep(i,n) for (int i = 0; i < (n); i++)
ll b,c,ans;
int main(){
cin >> b >> c;
ll k=c/2;
if(c==1){
if(b==0)ans=1;
else ans=2;
}
else if(c%2==1) ans=(k*4+1)-max(0LL,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t B,C;
cin >> B >> C;
int64_t ans = 0;
if(B == 0){
cout << C << endl;
return 0;
}
if(C < 3){
cout << C+1 << endl;
return 0;
}
if(abs(B) >= C){
cout << (C-2)*2+3 << endl;
return 0;
}else{
if(C <= abs(B)*2... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
#define eb(t) emplace_back(t)
typedef long long ll;
typedef long double ld;
typedef long long unsigned int llu;
ll INF = 1000000009;
ll MOD = 1000000007;
ll result[9];
ll p[9];
ll q[9];
ll all[9];
void product(){
result[0] = p[0]... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using vll = vector<LL>;
const vector<vll> CW = {{0, 1, 0}, {-1, 0, 0}, {0, 0, 1}};
const vector<vll> CCW = {{0, -1, 0}, {1, 0, 0}, {0, 0, 1}};
vector<vll> multiply(vector<vll>& A, vector<vll>& B){
int m = A.size(), n = B.size(), p = B[0].size();
... |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
double r, x, y;
cin >> r >> x >> y;
double w = sqrt(x * x + y * y);
int ans = ceil(w / r);
if (ans == 1 && w != r) ans++;
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
char f(char a, char b) {
if (a == b) return a;
if (a == 'R' && b == 'S') return a;
if (a == 'S' && b == 'R') return b;
if (a == 'P' && b == 'R') return a;
if (a == 'R' && b == 'P') return b;
if (a == 'S' && b == 'P') return a;
return b;
}
string yo(string ... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define dsrep(i,t,s) for(int i = (t)-1; i >= (s); --i)
#define rng... | #include<cstdio>
#include<iostream>
const int MAXN = 3e5 + 10, INF = 0x3f3f3f3f;
int f1[MAXN], f2[MAXN], is_key[MAXN], h[MAXN] = {0};
int N, M, tot, cnt;
struct E{
int t, nxt;
}Ed[2 * MAXN];
void Add(int f, int t){Ed[++tot].t = t, Ed[tot].nxt = h[f]; h[f] = tot;}
void dfs(int u, int fa, int mid)
{
f1[u] = -INF, f2... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.