code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
#define inf INT_MAX
#define sc(a) scanf("%d",&a)
#define scc(a,b) scanf("%d %d",&a,&b)
#define sccc(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define pf(a) printf("%d",a)
#define pff(a,b) printf("%d %d",a,b)
#define pfff(a,b,c) printf("%d %d %d",a,b,c)
#define pb(a) push_back(a)
#define em empty()
#defi... | #pragma region Template
#pragma region Includes
#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#pragma endregion Includes
#pragma region Setting
#pragma GCC optimize("Ofast")
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
#pragma endregion Setting
#pragma r... |
#include<bits/stdc++.h>
#include<string>
#define FIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long
#define mod (ll)(1e9+7)
#define nax (ll)(1e5 + 10)
#define INFL LLONG_MAX
#define NINFL LLONG_MIN
#define INF INT_MAX
#define disp(a,n,arr) for(int i=a;i<(ll)n;i++) cout << arr[i] <<... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.en... |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include<iostream>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x;
vector<int> a(3);
for(int i=0; i<3; i++) {
cin>>x;
a[i]=x;
}
sort(a.begin(),a.end());
if(a[0] == a[1])
cout<<a[2]<<endl;
else if(a[1] == a[2])
cout<<a[0]<<endl;
else if(... |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) x.begin(),x.end()
#define pb push_back
#define po pop_back
#define pi(i, v) v[i]=v.back(); v.pop_back()
#define li long long
#define INF INT_MAX
// #define TEST_CASES
const int mod... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626
#define mod 1000000007
#define mod1 998244353
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define fo1(i,a,b... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
#define F(index,start,end) for(ll index=start;index<end;++index)
#define IA(array,size) F(index,0,size) cin >> array[index]
#define IA2(array,height,widt... | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define Test(tt) cout << "Case #" << tt << ": "
using namespace std;
const int MOD = 998244353;
int main() {
#ifdef HOME
ifstream cin("A.in");
ofstream cout("A.out");
#endif
int n, k;
ios::sync... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll cnt[2][200009];
ll vec[200009];
ll val[200009];
ll par[200009],lev[200009];
vector<pair<ll,ll> >tmp;
ll pp[70];
vector<pair<ll,ll>>ad[200009];
ll n;
ll M;
void dfs(ll a,ll p, ll t)
{
val[a]+=t;
ll b,i,l=ad[a].size();
for(i=0; i<l; i++)... | #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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r)
{
uniform_int_distribution<int> uid(l, r);
return uid(rng);... |
#include <bits/stdc++.h>
using namespace std;
#define MS(a, b) memset(a, b, sizeof(a))
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define EREP(a, b) for (reg... | #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 ins insert
#define pqueue(x) priority_queue<x... |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pr;
typedef vector<int> vec;
typedef long long int lli;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define TEST int T; cin >> T; while(T--)
#define rep(i,n) for (auto i = 0; i < n; ++i)
#define repk(i,k,n) for (a... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... |
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll mod=1000000007;
const char nl='\n';
void solve(){
ll i,j,k,l,n,r,m,u,v,x,y;
cin>>n>>x>>y>>k;
if(x>y) swap(x,y);
cout<< ((k>=n*x and k<=n*y)?"No":"Yes")<<nl;
}
int main(){
ios_base::sync_with_stdio(fal... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int t;
cin >> t;
wh... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
const ll MM = 1000000007;
const ll INF = 1e18;
const long double PI = acos(-1.0);
//------------------------------------------//
int main(){
int M,H;cin >> M >> H;
if(H%... |
#line 1 "Contests/AtCoder_abc200/abc200_b/main.cpp"
using namespace std;
#line 2 "library/bits/stdc++.h"
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c;
cin >> a >> b;
cout << (1 - (b / a)) * 100 << endl;
} |
#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<queue>
#include<bitset>
#include<cstdlib>
#include<set>
#include<unordered_map>
#define l(x) (x<<1)
#define r(x) ((x<<1)|1)
#define low(x) (x&(-x))
#define IL inline
#define reg register
#de... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main(){
int A, B, C, D;
cin >> A >> B >> C >> D;
ll n = 0;
if( B >= C*D ) n = -1;
else{
double m = C*D - B;
double r = A / m;
n = ceil(r);
}
cout << n;
return 0;
} |
#include <iostream>
#include<string>
using namespace std;
int main()
{
int a;
cin >> a;
if (a % 2 == 1)cout << "Black"<<endl;
else cout << "White" << endl;
} | #include <bits/stdc++.h>
using namespace std;
//関数定義
int main() {
//ここに中身
string S;
cin >> S;
char x = S.at(0);
S.at(0) = S.at(1);
S.at(1) = S.at(2);
S.at(2) = x;
cout << S;
} |
#include <bits/stdc++.h>
#include <cassert>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define nl '\n'
#define endl '\n'
#define all(c)... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define PRECISION std::cout << std::fixed << std::setprecision(20);
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (... |
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int main()
{
int n;
cin>>n;
string aa,ab,ba,bb;
cin>>aa>>ab>>ba>>bb;
int ans=1;
for(int i=0;i<n-3;i++) ans=ans*2%mod;
if((ab=="A"&&aa=="B"&&ba=="B")||(ab=="B"&&bb=="A"&&ba=="A"))
cout<<ans<<'\n';
else if((ab=="A"&&... | #include <bits/stdc++.h>
#define fileio \
freopen("C:\\Users\\PRISM17\\Desktop\\in.txt", "r", stdin); \
freopen("C:\\Users\\PRISM17\\Desktop\\out.txt", "w", stdout);
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); ... |
#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 h, w;
int min_n = 100000;
int ans = 0;
cin >> h >> w;
vecto... | #pragma region template
// clang-format off
#if __has_include(<src.hpp>)
#include <src.hpp> // precompiled header
#endif
#ifdef __INTELLISENSE__
#define NDEBUG
namespace std {
#endif
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#i... |
#include<cstdio>
#define N 100002
int n, pri[N], bz[N], ans[N], tot;
int main(){
scanf("%d", &n);
for (int i = 2; i <= n; i ++){
if (!bz[i]){
pri[++ tot] = i;
ans[i] = 1;
}
for (int j = 1; j <= tot && i * pri[j] <= n; j ++){
bz[i * pri[j]] = 1;
ans[i * pri[j]] = ans[i] + 1;
if (i % pri[j] == 0) b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
/*freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);*/
int n;
cin >> n;
int curr = 1;
for (int i = 1; i <= n; i++) {
if (i == (1 << curr)) {
curr++;
}
cout << curr << ' ';
}
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,sn;
cin >> n >> sn;
vector<ll> a(n);
vector<ll> b(n);
vector<ll> c(n);
map<ll,ll> day;
for(int i = 0;i < n;i++){
cin >> a[i] >> b[i] >> c[i];
a[i]--,b[i]--;
day[a[i]]++,day[b[i]]++;
... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#define ll long long
#define MAXN 200005
#define uns unsigned
#define INF 0x3f3f3f3f
using namespace std;
inline ll read(){
ll x=0;bool f=1;char s=getchar();
while((s<'0'||s>'9')&... |
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
static const ll INF=1000000000000000;
ll K;
ll sum0[10];
ll sum1[10];
ll Sum0[10];
ll Sum1[10];
string S,T;
int main(){
cin>>K>>S>>T;
for(ll i=0;i<4;i++){
ll x=S[i]-'0';sum0[x]++;
}for(ll i=0;i<4;i++){
ll x=T[i]-'0';sum1[x]... |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
int main () {
int N, X;
cin >> N >> X;
int t = 0;
for (int i = 0; i < N; i++) {
int v, p;
cin >> v >> p;
t += v * p;
if (t > X * 100) {
cout << i+1 << endl;
... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all> // g++ main.cpp -std=c++17 -I .
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
template<class T,class U> inline bool chmin(T&x,U y){if(x>y){x=y;return... |
#include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
s... | #include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <chrono>
#include <complex>
using namespace std;
#define ll long long
#define ld long double
#define ui unsigned int
#define ull unsigned ll
#define mp make_pair
#define eb emplac... |
// 2021-03-28 11:22:37
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i =... | //12252024832524
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
#define TT template<typename T>
using namespace std;
typedef long long LL;
const int MAXN = 1005;
int n,m;
int vis[MAXN][MAXN],woc[MAXN][MAXN];
LL Read()
{
LL x = 0,f = 1;char c = getchar();
while(c > '9' |... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1 << 19;
int n, m;
long long dp[maxn]; bool ok[maxn];
int x[110], y[110], z[110];
int main()
{
scanf ("%d %d", &n, &m);
for (int i = 1; i <= m; i++)
scanf ("%d %d %d", x + i, y + i, z + i);
int upp = 1 << n;
dp[0] = 1;
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug puts("WHAP")
const int N = 101;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int n; cin >> n;
vector<pair<int,int> > a;
int ans = 0;
for(int i = 0; i < n; ++i){
int t,x,y; cin >> t >> x >> y;
... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define ALL(x) x.b... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
constexpr bool typetest = 0;
constexpr int N = 2e5 + 5;
constexpr ll mod = 1e9 + 7;
int n, dp[N][65][2];
vector<pair<int, ll>> adj[N];
ll ans(0);
void Read()
{
cin >> n;
for (int i = 2;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) (a).begin(), (a).end()
#define mp make_pair
template<typename T1, typename T2>
inline void chkmin(T1& x, const T2& y) {
if (y < x) x = y;
}
template<typename T1, typename ... |
#include<bits/stdc++.h>
using namespace std;
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define fo(i,n) for(int i=0;i<n;++i)
#define fn(i,n) for(int i=1;i<=n;++i)
#define Fo(i,k,n) for(int i=k;i<=n;++i)
typedef long long int lli;
int32_t main(){
FIO
lli n, m; cin >... | //Don't act like a loser.
//This code is written by huayucaiji
//You can only use the code for studying or finding mistakes
//Or,you'll be punished by Sakyamuni!!!
//#pragma GCC optimize("Ofast","-funroll-loops","-fdelete-null-pointer-checks")
//#pragma GCC target("ssse3","sse3","sse2","sse","avx2","avx")
#include<bits... |
#include <bits/stdc++.h>
#define F first
#define S second
#define MAX 10000003
using namespace std;
#define ll long long int
#include<fstream>
#define MOD 1000000007
#define fast ios_base::sync_with_stdio(false);
#define io cin.tie(NULL);
#define inp(arr,n) for(ll i=0;i<n;i++){cin>>arr[i];}
#define print(arr,n) ... | #include<iostream>
#include<math.h>
using namespace std;
int main()
{
float X, Y, Z;
cin >> X >> Y >> Z;
float a, b;
a = Y / X;
b = a * Z;
if (b - floor(b) == 0)
{
cout << floor(b) - 1;
}
else
{
cout << floor(b);
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define BE(x) x.begin(), x.end()
int main() {
int a, b;
cin >> a >> b;
int ans = 1;
for (int i = 2; i <= b; i++) {
if (b/i - (a-1)/i >= 2) ans = i;
}
cout << ans << endl;
} | #include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
int main(void)
{
ll s, p, div;
scanf("%lld%ll... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <set>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e5 + 10;
set<long long> s;
int st[N];
int primes[N];
int cnt;
void get_primes(int n)
{
for (int i = 2; i <= n; i ++ ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n... |
#include"bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#def... | #include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mp make_pair
#define inp(arr, n) \
for (ll i = 0; i < (ll)n; i++) \
cin >> arr[i];
#define fori(i, a, b... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #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>
using namespace std ;
using ll = long long ;
us... |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <math.h>
#include <assert.h>
#include <set>
#include <map>
#include <bitset>
#include <ctime>
#include <time.h>
#include <algorithm>
#include <cstdio>
#include <fstre... | #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;
#define ll long long int
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define w(n) while (n--)
#define scl(n) scanf("%lld", &n)
#define scf(n) scanf("%lf", &n)
#define pfl(x) printf("%lld\n", x)
#define ps printf(" ")
#define I... | #define George_Plover
#include <queue>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <iomanip>
#include <algorithm>
#define MAXN 1100000
#define LL long long
using namespace std;
int T;
int L,R;
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&L,&R);
... |
/**
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
void solve(){
int n;cin>>n;
vector<int> v(n);
REP(i,n)cin>>v[i];
vector<int> ans;
REP(i,n*n){
if(i&1){
for(int j=1;j<n-1;j+=2){//j:odd
if(v[j]>v[j+1]){
ans.push_... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const long double k=0.6180339887498948482045;
ll x,y,tmp;
vector<int> ans;
int main(){
scanf("%lld",&tmp);if(tmp==0) {printf("0\n");return 0;}
//printf("%lf\n",((long double)tmp)*k-50);
for(ll i=max((ll)(((long double)tmp)*k)-50,0ll);;i++){
x=tmp;y... | #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... |
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+7;
int32_t main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<min({a,b,c,d})<<endl;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define int long long... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1000010;
LL f[4][3 * N], n, k;
int main(){
cin >> n >> k;
f[0][0] = 1;
for (int i = 0; i < 3; i ++) {
for (int j = 0; j <= i * n; j ++){
f[... |
// Pratiyush Mishra
#include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long int
#define LL_MAX 9223372036854775807
#define pb push_back
#define pf push_front
#define mp make_pair
#define popb pop_back
#define vl vector<ll>
#define bs(v, x) binary_search(v.begin(), v.end(), x)
#define mem1(a) m... | /* _____ __ __
/^--^\ | () )\ \/ /
\____/ |_()_) |__|
/ \ _____ _ __ __ ____ _ ____ ____ _____
| || ()_)| |\ \/ /| ===|| |__ / (__` / () \|_ _|
\__ __/ |_| |_|/_/\_\|____||____|\____)/__/\__\ |_|
|^|^\ \^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|^|
| | |\ \| | | | | |... |
#include<bits/stdc++.h>
using namespace std;
int main(){
double X , Y , Z ;
cin >> X >> Y >> Z ;
int max_s = 0 ;
for(int i = 0 ; i < 1000000 ; i++){
double t = Y/X ;
double s = (double)i/Z ;
//cout <<fixed << setprecision(10) << s << endl;
if( s < t) max_s = max(... | #include<bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define MP make_pair
#define PB emplace_back
using namespace std;
const int SIZE = 101;
double dp[SIZE][SIZE][SIZE];
bool visited[SIZE][SIZE][SIZE];
double f(int x, int y, int z) {
if(visited[x][y][z]) { return dp[x][y][z]; }
if(x == 100 || y == 100 || z =... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N; cin >> N;
map<int, int> mp;
for (int i = 0; i < N; i++) {
int a; cin >> a;
mp[a]++;
}
ll res = N * N;
for (auto m : mp) {
ll n = m.second;
res -= n * n;
}
cout << res / 2 << endl;
} |
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <numeric>
#include <array>
using namespace std;
#pragm... | #include <bits/stdc++.h>
using namespace std ;
using ll = long long;
#define ffor(n) for(ll i = 0; i < n; i++)
#define fffor(n) for(int j = 0; j < n; j++)
#define mod 1000000007
#define all(v) (v).begin(),(v).end()
using ld = long double;
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vector<int>;
us... |
#pragma warning (disable:4996)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#define ll long long
#define REP(i, n) for(ll i = 0; i < n; i++)
#define SET(a) ll a = 0; (void)scanf("%lld", &a);
/*
ll cutLog(ll);
ll sum(ll);
*/
ll cutLogNew(ll);
int main() {
SET(n);
if (n == 1 || n == 2... | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define mod 1000000007
#define ull unsigned long long
#define vll vector<ll>
#define uom unordered_map
#define uo... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
void chmin(int& a, int b) {if (b<a) a=b;}
int main() {
int n;
cin >> n;
vector<int> x(n), y(n), z(n);
rep(i,n) cin >> x[i] >> y[i] >> z[i];
vector<vector<int>> dist(n, vector<int>(n));
rep(i,n) rep(j,n)
dist[i][j] =... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair <int,int> pi;
int n;
int a[300005],wi[300005],wi2[300005];
int t[2400005];
void update(int x,int l,int r,int wi) {
if(wi < l||r < wi) return;
if(l == r) {
t[x] = 1; return;
}
int mi... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... | #include <iostream>
#include <iomanip>
using namespace std;
long double dp[100][100][100];
long double solve(int a, int b, int c, int cnt) {
// basis
if (a == 100 || b == 100 || c == 100)
{
return cnt;
}
if (dp[a][b][c] != 0)
{
return dp[a][b][c];
}
long double ret = 0;
// a + 1
ret += solve(a + 1, b... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
#define ... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;
typedef long long ll;
vector<ll> ans_vec(500,0);
ll H,W,A,B;
void dfs(ll a,ll k,ll board[]){
if(k == A){
ans_vec[a]++;
}
for(ll h=0;h<H;h++){
for(ll w=0;w<W;w++){
if(k < a){
i... |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <bitset>
#include <vector>
#include <cstdio>
#include <string>
#include <cassert>
#include <climits>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace... | #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... |
/* _____________________
|Author : canhnam357|
|___________________|
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <string... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
#define all(m) m.begin(),m.end()
#define sz(m) lld(m.size())
#define pb push_back
#define mod 1000000007
#define st first
#define nd second
#define endl "\n"
#ifdef LOCAL
#define debug(...) debug_out(#__VA_ARGS__, __VA_ARGS__)
#define debug2(v... |
#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define mp make_pair
#define pb push_back
#define pll pair<LL,LL>
#define pii pair<int,int>
#define y second
#define x first
#define LL long lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long count = 0;
long tasu = 0;
for(long i = 1; i <= N+1; i++) {
tasu += i;
if(tasu > N+1) break;
count++;
}
cout << N + 1 - count << endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const ll mod=998244353;
const int N=2e6+1;
int n,k;
char c[101];
ll md[101];
char dp[101][101];//
char win(char x,char y){
if(x==y) return x;
if(x+y=='P'+'S') return 'S';
if(x+y=='P'+'R') return 'P';
return 'R';
}
... | #include <bits/stdc++.h>
using namespace std;
//const long nPrime = 1000000007;
//const long nPrime = 998244353;
int main() {
long n,k;
cin >> n >> k;
vector<vector<long>> vviGrid(n,vector<long>(n));
for(long i = 0; i < n; i++){
for(long j = 0; j < n; j++){
cin >> vviGrid[i][j];
... |
// Rakib (CSE'19)
#include<bits/stdc++.h>
#include<iostream>
#include<queue>
#include<stack>
#include<set>
#include<iomanip>
#include<iterator>
#include<sstream>
#include<algorithm>
#include<vector>
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
struct edge {int to, cost; };
int main(){
int n;
cin >> n;
ll sa = 0;
ll delta[n];
for(int i=0; i<n; i++){
ll a, b;
cin >> a >> b;
sa += a;
delta[i] = 2*a+b;
}
sort(delta, delta+n, greater<ll>(... |
#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=5e6+5;
const int M=1e5+5;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
const double eps=1e-8;
const long double pi=acos(-1.0L);
#define ls (i<<1)
#... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
void testcase(){
int N; cin >> N;
vector<int> A(N); rep(i,N) cin >> A[i];
vector<int> ans;
int turn = 0;
auto op = ... |
#include<bits/stdc++.h>
using namespace::std;
class Advertisement{
public:
void set_val(int x,int y,int inr);
long get_height();
long get_width();
long a;
long b;
long c;
long d;
long s;
long r;
};
void Advertisement::set_val(int x,int y,int... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
//#include <atcoder/all>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
//using namespace atcoder;
typedef long long ll;
#define... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... | #include<bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define ll long long
#define ii pair<ll,ll>
#define vi vector<ll>
#define vii vector<ii>
#define INF 1000000000
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
#in... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+5;
int readint(){
int x=0,f=1;char s=getchar();
#define sc (s=getchar())
while(s<'0'||s>'9'){
if(s=='-')
f=-1;
sc;
}
while(s>='0'&&s<='9'){
x=(x<<3)+(x<<1)+(s^48);
sc;
}
#undef sc
return x*f;
}
struct zz{
int u,v,w;
}s[maxn];
struct ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N, M;
int X[101], Y[101], Z[101];
int cnt[101];
ll memo[2 << 19];
ll dfs(int bit, int nbit){
if(bit == (1 << N) - 1){
return 1;
}
if(memo[bit] != -1) return memo[bit];
ll ret = 0;
for(int i=0;i<N;i++){
if ((bit... |
#include <bits/stdc++.h>
using namespace std;
int A[105],B[105];
int main(){
int n,a,b,ans;
cin>>n;
for(int i=0;i<n;i++){
cin>>A[i];
}
for(int i=0;i<n;i++){
cin>>B[i];
}
sort(A,A+n);
a=A[n-1];
sort(B,B+n);
b=B[0];
ans=b-a+1;
if(ans>=0)cout<<ans;
else c... | #include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + strin... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
const int MOD = 1e9+7;
const int N = 1e5+7;
void test_cases(){
int n,m;
cin >> n >> m;
set<int> mp;
mp.insert(n);
mp.insert(m);
if(mp.size()==1){
cout << m;
... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cstring>
#include<queue>
#include<map>
#include<set>
#include<functional>
#include<numeric>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define x first
#define y second
#define sz(a) int(a.size())
#define all(a... |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int X, Y, Z;
int main() {
scanf("%d %d %d", &X, &Y, &Z);
for (int i = 1; i < 1e8; i++) {
if (i * X >= Y * Z) {
printf("%d\n", i - 1);
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define int long long
#define fi first
#define se second
#define debug(x) cerr << #x << ": " << x << '\n'
#define yn {puts("Yes");}else{puts("No");} // if(a == b) yn;
template<class T>inline bool chmax(T &a, const T... |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int sz = 2e3 + 9;
const ll mod = 1e9 + 7;
const ll inf = 1e9;
const double eps = 1e-6;
void test()
{
int n,t;scanf("%d%d", &n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef multiset<string> mss;
typedef map<int, int> mii;
typedef set<string> ss;
typedef vector<int> vi;
typedef vector<string> vs;
// -------------------------------------------------
// https://atcoder.jp/contests/abc201/tasks/abc201_d
// -----------... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vc = vector<T>;
template<class T> using vvc = vc<vc<T>>;
template<class T> using vvvc = vc<vvc<T>>;
template<class T> using vvvvc = vvc<vvc<T>>;
template<class T> using PQ = priority_queue<T>;
template<class T> using invPQ = pri... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
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;
re... | #include <stdio.h>
constexpr unsigned char H[16] = {0, 1, 0, 3, 1, 1, 1, 1, 0, 1, 2, 2, 3, 1, 2, 3};
int main() {
unsigned char n, k;
scanf("%hhd %hhd", &n, &k);
getchar_unlocked();
unsigned char h[101], h2[101];
for (unsigned char i = 0; i < n; i++) h[i] = getchar_unlocked() - 80;
for (unsigned char i = ... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... | #include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
s... |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> v(4);
for(int i=0;i<4;i++)
cin >> v[i];
sort(v.begin(),v.end());
if(v[0]+v[3]==v[1]+v[2])
cout << "Yes" << endl;
else if(v[0]+v[1]+v[2]==v[3])
cout << "Yes" << endl;
else
cout << "No" << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,N;
cin >> N >> A >> B;
cout << N - A + B << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S ... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;
#define FOR(i, b, e) for(int i = (b); i < (e); i++)
#define TRAV(x, a) for(auto &x: (a))
#define SZ(x) ((int)(x).size())
#define PB push_back
#d... |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const int mod = 1000000007;
//const int mod = 998244353;
int main()
{
int n;
cin >> n;
vector<in... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define llu unsigned long long int
#define ld long double
#define mod 998244353
#define big 1e18 + 10000000
#define small -big
#define pb push_back
#define endl "\n"
template <typename T>
void prarr(T a)
{
cerr << "[ ";
for(auto i... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll = long long;
struct Edge
{
ll to;
ll cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
#define mp make_pair
#define REP(i, n) for (int i = 0; i < (n);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MOD 1000000007
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>
using ll =long long;
using namespace std;
const int mod = 1000000007;
//const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -=... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll z = 0;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; i++){
cin >> A[i];
}
sort(A.begin(), A.end());
ll ans = 0, prevsum = 0;
for (ll i = N - 2; i >= 0; i--){
prevsum += A[N - 1] - A[i];
}
a... |
#include<bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define pb push_back
#define input(a,n) for(ll i=0;i<n;i++){ll y;cin>>y;a.pb(y);}
#define print(x) for(auto it:x)cout<<it<<" ";cout<<"\n";
#define all(x) (x).begin(),(x).end()
... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
struct UnionFind {
vector<int> d;
UnionFind(int n) : d(n, -... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll... |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int M=1005;
inline int read(){
char c=getchar();int x=0,f=1;
for(;c<'0'||c>'9';c=getchar())if(c=='-')f=0;
for(;c<='9'&&c>='0';c=getchar())x=(x<<1)+(x<<3)+(c^48);
return f?x:-x;
}
struct node{
char s[20];int x;
boo... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
cout<<(2*i)%n+1<<' '<<(2*i+1)%n+1<<'\n';
return 0;
} |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <iomanip>
#include <functional>
using namespace std;
typedef long long ll;
int n,m;
string s[100010];
int k[100010];
int main(){
cin >> n >> m;
for(int i=0;i<n;i++)cin >> s[i];
ll a=0,b=0;... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
using namespace std;
ll xd[2];
void solve(){
int n,m; cin>>n>>m;
while(n--){
string s; cin>>s;
int x =... |
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#include<set>
#include <array>
using namespace std;
#define ll long long
#define endl '\n'
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define con continue
#define ub upper_bound
#define lb lower_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace... | //Classic
// //g++ -std=c++17 -O2 -Wall a.cpp -o test
// _()_
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define vi vector<int>
#define vb vector<bool>
#define pi pair<int,int>
#define pll pair<ll,ll>
#define vp vector<pi>
#define vpll vector<pll>
#de... |
#ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include... | /* @author: saran
* Git: https://github.com/abhisheksaran
* LinkedIn: https://www.linkedin.com/in/abhishek-saran-2900b/
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vecto... |
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <iomanip>
#include <cmath>
#include <set>
#include <unordered_set>
#include <functional>
#include <map>
#include <unordered_map>
#include <string>
#include <tuple>
using namespace std;
using ll = long... | #pragma region Region_1
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; 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 rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
using ll = long long;
using ... |
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ld long double
#define mod 1000000007
#define mod2 998244353
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
#define vi vector<int>
#define si set<int>
#define pii pair<int,int>
#define mii map<int,int>
#define umii... | #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;
const ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#define pb push_back
#define mp make_pa... |
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
using namespace std;
#define MAXN 100005
#define lowbit(x) (x&-x)
#define reg register
typedef long long LL;
typedef unsigned long long uLL;
typedef unsigned int uint;
typedef pair<in... |
#include"bits/stdc++.h"
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(x) x.begin(),x.end()
#define BACK(x) x.rbegin(),x.rend()
#define MOD 1000000007
#define INF INT_MAX
#define FLOAT_ANS setprecision(30)
#define TORAD(x) (x*acos(-1)/180.0)
#define TODEG(x) (x*180/acos(-1))
#define elif else if
using namespace std... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXV = 1000000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int l, r;
cin >> l >> r;
int n = r - l + 1;
int m = r;
vector<int> a(n);
iota(a.begin(), a.end(), l);
vector<int> is_prime(m + 1, t... | #include <iostream>
using namespace std;
const int N = 1000010;
typedef long long LL;
LL f[N];
LL ans = 0;
int main() {
int l, r;
cin >> l >> r;
for (int i = r; i >= 2; i --) {
LL tem = r / i - (l - 1) / i;
f[i] = tem * tem;
for (int j = i * 2; j <= r; j += i)
f[i] -... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const ll mod=1e9+7;
string t="atcoder";
void solve(){
string s;cin >> s;
int ans=1e9;
int cur=0;
bool totok=true;
for(int i=0; i<7 ;i++){
for(int j=0; j<s.size() ;j++){
if(s[j]>t[i]) ans=min(ans,cur+j);
}
... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
int main(){
int n,w;
cin >> n >> w;
vector<int> s(n),t(n),p(n);
for(int i=0; i<n; ++i)
cin >> s[i] >> t[i] >> p[i];
vector<ll> oyu(*max_element(t.begin(), t.end()),0);
for(int i=0; i<n; ++i) {
oyu[... | // Pratiyush Mishra
#include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long int
#define LL_MAX 9223372036854775807
#define pb push_back
#define pf push_front
#define mp make_pair
#define popb pop_back
#define vl vector<ll>
#define bs(v, x) binary_search(v.begin(), v.end(), x)
#define mem1(a) m... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
int main(){
string s;
cin>>s;
if(s.size()<3){
if(s.size()==1){
if(s == "8"){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
int a =... | #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 all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... |
//Badwaper gg
#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
#define pb push_back
#define re register int
#define fr first
#define sd second
#define FOR(i,a,b) for(re i=a;i<=b;i++)
#define REP(i,a,b) for(re i=a;i>=b;i--)
#define lowbit(x) x&(-x)
#define Z(x) (x>=mod?x-mod:x)
#define pa pa... | //author: hitch_hiker42;
#include<bits/stdc++.h>
using namespace std;
//solution:
#define int int64_t
#define span(a) begin(a), end(a)
struct segtree {
int n;
static inline int size = 1;
vector<int> t, lazy;
segtree() = default;
segtree(int n): n(n) {
while(size < n) size <<= 1;
t.assign(size << 1, ... |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define A... | #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()
#define mk make_pair
#define pp pair<ll,ll>
ll MOD=1000000007;
ll mod=998244353;
int inf=2000001000;
ll INF=1e18+5;
int main() {
ll n;
ci... |
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, bool> pib;
typedef vector<ll> vi;
typede... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
int main() {
int n,k,m,a;
cin >>n>>k>>m;
int sum=0;
rep(i,n-1){
cin>>a;
sum+=a;
}
rep(i,k+1){
if((sum+i)>=m*n){
cout << i <<endl;
return 0;
}
}
... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define F first
#define S second
int main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n; cin >> n;
vector<ll> r, g, b;
for(int i = 0; i < 2*n; i++){
ll x; cin >> x;
char c; cin >> c;
if(c == 'R') r.push_back(x);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vc = vector<T>;
template<class T> using vvc = vc<vc<T>>;
template<class T> using vvvc = vc<vvc<T>>;
template<class T> using vvvvc = vvc<vvc<T>>;
template<class T> using PQ = priority_queue<T>;
template<class T> using invPQ = pri... |
#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;
ll a[300009];
ll tree[900099];
int c;
void seg(ll node,ll b,ll e)
{
if(b==e)
{
//co... | #include<ctime>
#include<cstdio>
#include<cctype>
#define le(p) ((p)<<1)
#define ri(p) ((p)<<1|1)
using namespace std;
const int N=1.2e6+7;
int read(){
char c;
int x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while(isdigit(c)){
x=x*10+f*(c-48);
c=getchar();
}
return x;
}
int n,q,t,x,y,a[N];
int L[N]... |
#include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#includ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
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) {
... |
#include <iostream>
#include <string>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
for (int i = 0; i < K; i++) {
if (N % 200 == 0) {
N /= 200;
}
else {
N *= 1000;
N += 200;
}
}
cout << N << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define ... |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v.begin(),v.end())
#define sz(v) ((int)((v).size()))
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typed... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
int m = n / 2;
ll ... |
#include<stdio.h>
int main()
{
double Sx,Sy,Gx,Gy;
scanf("%lf%lf%lf%lf",&Sx,&Sy,&Gx,&Gy);
double ans;
ans=Gx+Gy*(Sx-Gx)/(Gy+Sy);
printf("%.10lf\n",ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define inf 1000000005 /*10^9+5*/
#define mod 1000000007 /*10^9+7*/
#define eps 1e-10
#define rep(i,n) for(int i = 0; i < (n); ++i) /*0からn-1までのrepeat*/
#define rrep(i,n) for(int i = 1; i <= (n); ++i) /*1からnまでのrepeat*/
#define drep(i,n) for(int i = (n)-1; i >= 0; --i) /*n-1か... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=1e18;
int main(){
ll n, k; cin >> n >> k;
VI a(n), ... | #include"bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define all(v) begin(v), end(v)
#define sz(v) (int)v.size()
#define ff first
#define ss second
const int inf = 4e18;
const int N = 2e5 + 10;
int n, m;
int dp[1 << 20];
vector<pair<int, int>> q[20];
int rec(int pos, int mask) {
i... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.14159265358979323846... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define boostIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, b, a) f... |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define bit(n) (1ll<<(li)(n))
#define INF bit(60)
#define MOD 998244353
int main() {
li a,b;
cin>>a>>b;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define REP(i, n) for (int i=1; i<=(int)(n); i++)
#define FOR(i, n, m) for (int i=(n); i<=(int)(m); i++)
#define ll long long
const ll INF=1LL<<60;
const double pi=3.1415926535;
int main() {
vector<vector<int>> dp(900, v... |
#include<bits/stdc++.h>
#define rep(i,a,b) for (register int i=(a);i<=(b);++i)
#define req(i,a,b) for (register int i=(a);i>=(b);--i)
using namespace std;
int a,b;
int main()
{
cin>>a>>b;
cout<<(a+b>>1)<<' '<<(a-b>>1)<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a,b;
cin>>a>>b;
ll x=(a+b)/2,y=(a-b)/2;
cout<<x<<" "<<y;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define INF 1e8
typedef long long int ll;
const double PI = acos(-1);
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int lcm(int a, int b) { return abs(a... |
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
#define REP(i,b,e) for(int i=b; i<e; i++)
#define PRINT(vec) {printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");}
#define fi first
#define se second
const int MOD = 1e9+7;
int dx[] = {0, 1, 0, -1, 1, 1, -1, ... | #define MOD_TYPE 1
#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>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const bool ready = [](){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
using ld=long double;
const ld PI = acos((ld)-1);
using ll= ... |
#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>
using namespace std;
int N;
string digit, turn;
int dp[100001][7];
bool calc(int index, int rem) {
if (index == N) {
return rem == 0;
}
int &retVal = dp[index][rem];
if (retVal != -1)
return retVal;
if (turn[index]) {
retVal = calc(index + 1, (10 * ... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int,int>;
void debug(map<int,pii> a) {
for (auto p : a) {
cout << p.first << ": " << "(" << p.second.first << "," << p.second.second << ")\n";
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N,L;... | #include <bits/stdc++.h>
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;
const int N = 1e5;
int n, L, a[N + 5], b[N + 5];
int main() {
scanf("%d%d", &n, &L);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) {
scanf("%d", &b[i]);
}
a[n +... |
#include<bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i, 0, n)
#define all(x) (x).begin(),(x).end()
const int INF = 1e9+1;
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
string S;
string Z = "ZONe";
cin >> S;
int i = 0;
int j = 0;
int ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int count=0;
for(int i=0;i<12;i++)
{
if(s[i] == 'Z' && s[i+1] == 'O' && s[i+2] == 'N' && s[i+3]=='e')
{count++;}
}
cout<<count<<endl;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.