code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
#define quick ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
#define s(x) sort(x.begin(),x.end())
#define sr(x) sort(x.begin(),x.end(),greater<ll>())
#define v1 vector<ll>
#define s1 set<ll>
#define p1 pair<ll,ll>
#define m1 map<ll,ll>
#d... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<ll, ll>>;
using ld = double;
#define sz(... |
/*************************************************************************
> File Name: 2.cpp
> Author: Knowledge_llz
> Mail: 925538513@qq.com
> Blog: https://blog.csdn.net/Pig_cfbsl
> Created Time: 2020/10/24 20:09:51
************************************************************************/
#include<iostream>... | #line 2 "header.hpp"
//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H
// template version 2.0
using namespace std;
#include <bits/stdc++.h>
// varibable settings
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;
#define _overload3(_1, _2, _3, name, ...) name
#define ... |
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
signed main(){
ios::sync_with_stdio(false);
string str;
cin>>str;
bool flag=true;
for(int i=0;i<str.size();++i){
if(i&1){
if(str[i]<'A'||str[i]>'Z'){
... | #include<iostream>
using namespace std;
typedef long long li;
#define yn(i) print((i)?"Yes":"No")
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cou... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define f(i,a,b) for(ll i = a; i < (ll) b ; i++ )
#define af(i,a,b) for(ll i = a; i >= (ll) b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < (ll) b ; i+= k )
#define arep(i,a,b,k) for(ll i = a; i >= (ll) b ; i-= k)
#define f... | #pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
//#define llu unsigned long long
#define int long long
//#define int __int128
//#define double long double
//#define double long long
#define re register int
//#define void inline void
#... |
#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(3,"Ofast","inline")
#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')... |
#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)
// 強さをY以上にしない
// 経験値を最大化する
// 経験値は最初0
// 強さは最初X
// 強さをA倍にして、経験値を1増やす
// 強さをB増やして、経験値を1増やす
void solve(long long X, long long Y, long long A, long long B){
ll ans = 0;
wh... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
cout << n-a+b;
} |
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef int64_t ll;
const ll maxOne = 1'000'000'007;
ll add(ll a, ll b){
if(a<0){
a += maxOne;
}
if(b<0){
b += maxOne;
}
return (a+b)%maxOne;
}
ll mul(ll a, ll b){
if(a<0){
a += maxOne;
}
... |
#include <iostream>
using namespace std;
int main(void){
double x,y,z;cin >> x >> y >> z;
double ta=y/x;
for(double i=0;;i++){
double s=i/z;
if(s>=ta){
cout << i-1 << endl;
return 0;
}
}
}
| #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 <bits/stdc++.h>
using namespace std;
// #define int long long
const int N=1005;
int par[2*N];
int find(int v){
if(par[v]==v)return v;
return par[v]=find(par[v]);
}
bool join(int u,int v){
u=find(u),v=find(v);
if(rand()%2)swap(u,v);
par[v]=u;
return u!=v;
}
int32_t main(){
ios::sync_with_stdio(0),ci... | //
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define f fiCrst
#define s second
#define what_is(x) cerr << #x << " is " << x << endl;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int INF = 1000000007;
const ll MOD = 998244353;
int dp[3001][3001];
void s... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 10000007
#define F for(int i=0;i<n;i++)
#define raftaar ios_base::sync_with_stdio(false);cin.tie(NULL);
#define shuru int t;cin>>t;while(t--)
int SieveOfEratosthenes(int n)
{
bool prime[n + 1];int c=0;
memset(prime, true, sizeof(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
int n;
int p[502];
vector<int> ret;
void add(int i){
ret.push_back(i);
swap(p[i],p[i+1]);
}
void solve(int k){
//cerr<<k<<" "<<ret.size()<<endl;
if(k==1)re... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define p_b pop_back
using namespace std;
int main(){
int n, sum = 0;
cin >> n;
vector<int> v1, v2;
for(int i = 0; i < n; i++){
int k;
cin >> k;
v1.pb(k);
}
for(int i = 0; i < n; i... | //
// main.cpp
// rferf
//
// Created by Harshita Hazarika on 28/12/20.
// Copyright © 2020 Harshita Hazarika. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <iterator>
#include <map>
#include<climits>
#include <queue>
#include <set>
#include <stack>
#i... |
#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}; }
... |
#include <bits/stdc++.h>
using namespace std;
#define M1 1000000007
#define M2 998244353
#define INF 1e18
#define ll long long
#define pll pair<ll,ll>
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define REPR(i,a,b) for(ll i=b-1;i>=a;i--)
#define forr(i,n) for(ll i=0;i<n;i++)
#define F first
#define S second
#define pb pu... |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (... | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define endl "\n"
#define V vector<ll>
#define VT(A) vector<A>
#define P pa... |
#include<bits/stdc++.h>
using ll = long long;
#define REP(i, n) for (ll i = 0; (i) < ll(n); ++ (i))
#define FOR(i, m, n) for (ll i = (m); (i) <= ll(n); ++ (i))
#define REPR(i, n) for (ll i = ll(n) - 1; (i) >= 0; -- (i))
#define FOR3R(i, m, n) for (ll i = ll(n) - 1; (i) >= ll(m); -- (i))
#define ALL(x) x.begin(),x.end()... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = (n); i >= 0; i--)
#define FOR(i, m, n) for (ll i = (m); i < (ll)(n); i++)
#define BIT(bit, n) for (int bit = 0; bit < (1 << (n)); ++bit)
#define I... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using VI = vector<int>;
#define fst first
#define snd second
template <typename T>
istream &operator>>(istream &in, vector<T> &v) {
for (auto &x : v)
in >> x;
return in;
}
template <typename T>
ostream &operator<<(... | #include<iostream>
#include<cstdio>
#include<queue>
#define int long long
#define uc getchar()
#define ph putchar
#define R register
#define CN const
#define rint R int
#define cint CN int
#define ps ph(' ')
#define pe ph('\n')
using namespace std;
cint inf=1e9+7;
cint mix=2e5+5;
inline int in();
inline void out(rint y... |
#include <bits/stdc++.h>
#define debug(x) cout << "[" << #x << " = " << x << "] "
#define ff first
#define ss second
#define endl '\n'
#define INF 1e9
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
using vi = vector<int>;
/*wa? coloca long long que passa;
testar casos, n... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A;
for(int i = 0; i < N; i++){
int x;
cin >> x;
A.push_back(x);
}
// Manhattan
int64_t M = 0;
for(int i = 0; i < N; i++){
M += abs(A.at(i));
}
cout << M << endl;
// Eucrid
int64_t t = 0;... | #include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
long long arr[100005];
int main(){
int n;
cin >> n;
int i;
long long ans = 0;
for(i=0; i<n; i++){
cin >> arr[i];
}
for(i=0; i<n; i++){
if(arr[i]<0){
ans += -arr[i];
}else{
ans += arr[i];
}
}
cout << ans << endl;
long ... |
//#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef vector<pii> vii;
typedef vector<pil> vil;
typedef vector<... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for(int i=int(n-1);i>=int(0);--i)
... | #include<cstdio>//JZM YYDS!!!
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#define ll long long
#define MAXN 200005
#define uns unsigned
#define MOD 998244353ll
#define INF 0x7f7f7f7f
#pragma GCC optimize("O2")
using namespace st... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin>>n;
vector<int> a(n), b(n), p(n);
rep(i, n) cin>>a[i];
rep(i, n) cin>>b[i];
rep(i, n){cin>>p[i]; p[i]--;}
bool ok=true;
rep(i, n) if(i!=p[i] && a[... | #include <bits/stdc++.h>
using namespace std;
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + ... |
#include <bits/stdc++.h>
#define rep(i,n) for ((i)=1;(i)<=(n);(i)++)
#define rep0(i,n) for ((i)=0;(i)<(n);(i)++)
using namespace std;
long long n,m,s,i;
vector<int> ans;
long long gcd(long long x,long long y){
if(!y) return x;
long long t=gcd(y,x%y);
s+=x/y;return t;
}
void print(long long x,long long y){
if(!x){
... | #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()
using ll=long long;
ll Fib[89];
int main(){
Fib[0]=Fib[1]=1;
for(int i=2;i<89;i++)Fib[i]=Fib[i-1]+Fib[i-2];
ll n;cin>>n;
vector<int> A;
for(int i=88;i>=0;i--){
if(n>=Fib[i]){
A.... |
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstring>
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define For(it, x, y) for(int it = x; it < y; it ++)
#def... | #include <bits/stdc++.h>
#define f first
#define s second
#define all(vec) begin(vec), end(vec)
#define pf push_front
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define mk make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int... |
#include <bits/stdc++.h>
using namespace std;
#define Fi first
#define Se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define szz(x) (int)(x).size()
#define rep(i, n) for(int i=0;i<(n);i++)
typedef tuple<int, int, int> t3... | #include "bits/stdc++.h"
using namespace std;
const int mod = 1e9 + 7;
void solve() {
int n;
cin >> n;
long long dp[2] = {0}, cnt[2] = {0};
cnt[1] = 1;
for(int i = 0; i < n; ++i) {
int a;
cin >> a;
auto x = dp[1];
auto y = cnt[1];
dp[1] = (dp[0] - cnt[0] * a) % mod;
cnt[1] = cnt[0];
... |
#include<bits/stdc++.h>
using namespace std;
const int N=1005,mod=998244353;
int n,m,f1[N],f2[N],t;
char s[N][N];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%s",s[i]+1);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(s[i][j]=='R')
f1[i+j]=1;
if(s[i][j]=='B')
f2[i+j]=1;
... | // F - Potion
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
ll INF = 1e18;
ll dp[101][101];
void init(int k){
rep(i,k+1) rep(j,k) dp[i][j] = -INF;
dp[0][0] = 0;
}
void update(int k, int a){
for(int i=k-1; i>=0; --i) rep(j,k){
int sk = (j + a) % ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
unsigned long long a[N],a_max,b[N],b_max,c;
for(int i=0;i<N;i++){
cin >> a[i];
}
for(int i=0;i<N;i++){
cin >> b[i];
}
c = a[0]*b[0];
a_max=a[0];
b_max=b[0];
cout << c << endl;
for(int i=1;i<N;i++){
if(a_max <... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define start ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define ll long long
#define vi vector<int>
#define pb push_back
#def... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl '\n'
#define SZ(x) ll(x.size())
const ll MAXN = 1e6 + 10;
const... | #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 int long long
int a,b,c,d;
signed main()
{
cin>>a>>b>>c>>d;
if(c*d<=b){cout<<-1;return 0;}
cout<<ceil(1.0*a/(d*c-b));
return 0;
} | #include<bits/stdc++.h>
using namespace std;
//==============================AUTHOR:ZETPI=======================================//
#define int long long
#define fr(i,st,c) for(int i=st;i<c;i++)
#define rfr(i,e,c) for(int i=e;i>=c;i--)
#define i_output(f1) cout<<(f1?"YES":"NO")<<endl;
#define... |
/**
* Author: Wasi Ur Rahman
* FROM RMSTU
**/
#include <bits/stdc++.h>
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ticktock cout<<"\nTime Elapsed: " << 1.0*clock() / CLOCKS_PER_SEC << " sec\n"
#define ... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... |
//
// Created by Anton Gorokhov
//
#ifdef lolipop
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <cstddef>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <ctime>
#include <unordered_map>
#include <random>
#include <iomanip>
#include <cmat... | #include <bits/stdc++.h>
#define int long long
#define menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb emplace_back
#define pi pair<int, int>
#define BE(i) i.begin(),i.end()
#define fi first
#define se second
#define INF 2147483647
#define mkp make_pair
#define ist insert
#define mod... |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 4e5 + 5;
int C[3][3];
void pascal() {
for(int i = 0;i < 3;i++) {
C[i][0] = C[i][i] = 1;
for(int j = 1;j < i;j++)
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % 3;
}
}
int ncrLuc... | #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 fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define rep(i,n) repi(i,0,n)
#define repi(i,a,n) for(ll i=a;i<(ll)n;++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define Show(val) cout<<(val)<<" "
#define Showl... | #include<bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define ll long long
#define maxheap priority_queue<int>
#define minheap priority_queue<int,vector<int>,greater<int>>
#define all(v) (v).begin(),(v).end()
const double pi = acos(-1.0);
const double eps = 1e-12;
using namespace std;
const... |
#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 <math.h>
#include <stack>
#include <map>... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
string ans = "";
bool flg = true;
for(char c : s) {
if(c == '.') {
flg = false;
}
if(flg) {
ans += c;
}
}
cout << ans << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const int mod=998244353;
const int mex=200005;
#define ll long long
#define test int t;cin>>t;while(t--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,n) for(int i=a;i<n;i++)
#define rfo(i,a,b) for(int i=a;i>=b;i-... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
class BIT {
std::vector<long long> bit;
long long size;
public:
... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint2 = modint998244353;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+... | //#define _GLIBCXX_DEBUG
#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()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<... |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int A, B, W; cin >> A >> B >> W;
long double w = W * 1000;
int vmin = ceil(w/B);
int vmax = floor(w/A);
if (vmax >= vmin) cout << vmin << " ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long i = 0; i < n; i++)
int main() {
int A, B, M;
cin >> A >> B >> M;
M *= 1000;
int Q = M / A;
int W = M / B;
if(M % B != 0) W++;
int U = 0, O = 0;
for(int i = W; i <= Q; i++) {
double T = i / 1.0;
double R = M / T;
if(U =... |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 5010;
const int MOD = 998244353;
int64_t fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - i... | #include<bits/stdc++.h>
using namespace std;
#define rep(x, L, R) for(int x = (L), _x = (R); x <= _x; x++)
#define per(x, R, L) for(int x = (R), _x = (L); x >= _x; x--)
#define broken fprintf(stderr, "running on %s %d\n", __FUNCTION__, __LINE__)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define SZ(v) (int)(v).s... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll=long long;
#define MOD 998244353
#define INF 1000000000
#define MAX 10000
using Graph=vector<vector<int>>;
int main(){
int N;
string S;
string X;
cin>>N>>S>>X;
vector<vector<bool>> dp(N+1,vector<bool>(... | #include<bits/stdc++.h>
#define fort(i,a,b) for(long long i=a;i<=b;i++)
#define forn(i,a,b) for(long long i=a;i>=b;i--)
#define x first
#define y second
#define MP make_pair
#define pb push_back
#define ii pair<long long ,long long >
#define MT make_tuple
#define tp tuple
bool getbit(long long x,long long y)
{
retu... |
#include <bits/stdc++.h>
#define arraysize(array) (sizeof(array)/sizeof(array[0]))
#define loop(i,a,b) for (int i = a; i < b; i++)
#define loopData(array) (cout << array[i] << " ")
using namespace std;
bool binarySearch(int arra[],int arraySize, int key){
int startPoint, endPoint;
int location;
startPoin... | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using pii = pair<int, int>;
using pll = pair<i64, i64>;
#define rep(i, n) for(i64 i = 0; i < n; i++)
#define per(i, n) for(i64 i = n - 1; i >= 0; i--)
#define REP(i, a, b) for(i64 i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define ral... |
//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcn... | #include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<vector>
#include<algorithm>
#include<queue>
#define fs(i,x,y) for(int i=(x),_=(y);i<=_;++i)
#define fn(i,x,y) for(int i=(x),_=(y);i>=_;--i)
#define tor(i,v,x) for(int i=head[x],v=to[i];i;i=nxt[i],v=to[i])
#... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,ans;
string s;
cin >> n >> s;
ans=n;
for(ll i=0;i<n-2;i++){
if(s.at(i)=='f' && s.at(i+1)=='o' && s.at(i+2)=='x'){
s=s.erase(i,3);
n-=3;
ans-=3;
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
int main() {
int n;
cin >> n;
string s;
cin >> s;
string ans;
for (char c : s) {
ans += c;
// substr(最後の3文字前... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
template< typename T >
T mod_pow(T x, T n, const T &p) {
T ret = 1;
while(n > 0) {
if(n & 1) (ret *= x) %= p;
(x *= x) %= p;
n >>= 1;
}
return ret;
}
int main() {
ll n, m;
cin... | #include <bits/stdc++.h>
#define bug1(x) cout<<#x<<" = "<<x<<endl
#define bug2(x,y) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<endl
#define bug3(x,y,z) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<" "<<#z<<" = "<<z<<endl
#define bug4(x,y,z,m) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<" "<<#z<<" = "<<z<<" "<<#m<<" = "<<m<<endl
usin... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define ui unsigned int
#define ar array
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<... | #include<bits/stdc++.h>
#define int long long
#define ll long long
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fs first
#define sd second
#define rept(x,n) for(int i=x;i<n;i++)
#define rrept(n,x) for(int i=n-1;i>=x;i--)
#define all(v) v.begin(),v.end()
#define mpit map<int,int>::... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
int n, d, h;
cin >> n >> d >> h;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
long double lo = 0, hi = (long double) h;
long do... | #include <bits/stdc++.h>
using namespace std;
#define lld long long int
#define M 1000000007
#define fors(i,n) for(int i=0;i<n;++i)
#define fore(i,a,b) for(int i=a;i<=b;++i)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define vv vector<int>
#define endl "\n"
#define test(i) cout<<i<<endl
#define ... |
#include <iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a==b){
cout << c << endl;
}else if(a==c){
cout << b << endl;
}else if(b==c){
cout << a << endl;
}else{
cout << "0" << endl;
}
} | //clear adj and visited vector declared globally after each test case
//check for long long overflow
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Incase of close mle change language to c++17 or c++14
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long lo... |
#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;
int x= (a * d) - (c * b);
cout << x;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define long long long
#define vb vector<bool>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vs vector<string>
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define FORs(i,a,b,c) for (int i = a; i < b; i+=c)
#define DPMOD 1000000007
int main() {
/... |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, k; cin >> n >> k;
const int LIM = 3010;
const long long MOD = 998244353;
long long dp[LIM][LIM];
// dp[i][j] = number of multisets that leave
// i elements to choose and j is the remaini... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins insert
#define pqueue... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef double db;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vl;
typedef vector<pii> vpii; typedef vector<pll> vpll;
#define FOR(n) for(int i=0;i<n;++i)
#define FOR1(n) for(int i=1;i<=n;++i)
#define... | //#include <fsociety>
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <iomanip>... |
#include <iostream>
using namespace std;
int x;
int main() {
cin >> x;
int now = 1;
while (now <= 33) {
if (now <= x && now * 100 >= x) {
cout << now << endl;
exit(0);
}
now = now + 1;
}
} | //Update : 2021.5.7
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii ;
typedef pair<long long,long long> pll;
//#define endl '\n'
/*Debugger
#define tpc template<class c
#define ckt(x) tpc> typename enable_if<sizeof ptb<... |
#include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPP(i, n) for(int i = 1; i <= n;... | #include <bits/stdc++.h>
#define int int64_t
using namespace std;
const int LG=2e5+5;
int a[LG], viz[LG];
vector<int> v[LG];
void dfs(int nod)
{
viz[nod]=1;
for (auto el:v[nod])
if (!viz[el])
dfs(el);
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n... |
#include<bits/stdc++.h>
using namespace std;
int a[1005];
int b[1100][1100];
int c[1100];
void gmin(int x)
{
for(int i=2;i<=x;i++)
{
if(x%i==0) b[x][++c[x]]=i;
}
}
inline int read()
{
char ch=getchar();
int x=0,f=1;
while(ch>'9'||ch<'0')
{
if(ch=='-') f=-1;
ch=getchar();
}
while(ch<='9'&&ch>='0')
{
x=... | #define _DEBUG
#include "bits/stdc++.h"
//#include <atcoder/all>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,a5,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "... |
#include <iostream>
using namespace std;
int64_t gcd(int64_t a, int64_t b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
int64_t lcm(int64_t a, int64_t b)
{
return a * b / gcd(a, b);
}
int main()
{
int N;
cin >> N;
int64_t arrlcm = 1;
for(int i = 2; i ... | //#include <bits/stdc++.h>
//using namespace std;
#include <set>
#include <cstdio>
#include <iostream>
using namespace std;
#define rep(i,_l,_r) for(signed i=(_l),_end=(_r);i<=_end;++i)
#define fep(i,_l,_r) for(signed i=(_l),_end=(_r);i>=_end;--i)
#define erep(i,u) for(signed i=head[u],v=to[i];i;i=nxt[i],v=to[i])
#def... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<string>
#include<cmath>
#define SYNC ios::sync_with_stdio(0),cin.tie(0)
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define EPS 1e-6
#define endl '\n'
using namespace std;
con... | #include <bits/stdc++.h>
#include <unordered_set> // 重複排除した集合
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll N;
cin >> N;
vector<ll> dp(N);
vector<ll> A(N);
// vector<Pair<int, int> > B(N);
rep(i,N){
cin >> A[i];
}
long long ans = 0;
... |
#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++)
using namespace std;
int main() {
double A, B;
cin >> A >> B;
double ans = (1 - B/A)*100;
cout << fixed << setprecision(10) << ans << endl;
} | //#include<bits/stdc++.h>
//typedef long long ll;
//const ll mod=1e9+7;
//const ll inf=0x3f3f3f3f;
//const int N=2e5+5;
//using namespace std;
//
//ll a[N],b[N],c[N];
//int main()
//{
// int n;
// cin>>n;
// for(int i=0;i<n;i++)
// {
// cin>>a[i]>>b[i]>>c[i];
// }
// int ans=inf;
// for(int ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vi2 = vector<vector<int>>;
using vl = vector<ll>;
using vl2 = vector<vector<ll>>;
using vb = vector<bool>;
using vb2 = vector<vector<bool>>;
using vc = vector<char>;
using vc2 = vector<vector<char>>;
using vs = vector<stri... | #include<stdio.h>
int main()
{
int n,i,j,m=0,k=1000000000,panduan=0;
int static a[100000][3];
int static b[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)
scanf("%d",&a[i][j]);
}
b[0]=-1;
for(i=0;i<n;i++)
{
if(a[i][0]<a[i][2])
{
b[m]=a[i][1];
m++;
panduan=1;
}
}
for(... |
#include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),... | #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<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define pow(n,m) powl(n,m)
#define sqrt(n) sqrtl(n)
const ll MAX = 5000000000000000000;
const ll MOD = 0;
random_device rd;
mt19937 mt(rd());
int main(){
ll N,M;
cin >> N >> M;
vector<string> S(M),ans(N),T;
ma... | #include <iostream>
#include <chrono>
#include <string>
#include <vector>
#include <algorithm>
class DNA {
private:
char base[20][20];
public:
void inputV(const int& i, const int& j, const std::string& s) {
for (int k = 0; k < (int)s.size(); k++) {
if (i + k < 20) base[i + k][j] = s[k];
else base[i + k... |
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 2010,INF = 0x3f3f3f3f;
string s;
int n,m,tmp,p,ans,sum,minn = INF;
int a[N][N];
int main()
{
cin >> n >> m;
for(int i = 0;i < n;i++)
{
for(int j = 0;j < m;j++)
{
cin >> a[i][j];
minn = min(minn,a[i][j]);
}
}
f... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ex... |
//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... | #include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int main()
{
// freopen("1.in", "r", stdin);
int n;
scanf("%d", &n);
int res = INF;
for(int i = 1; i <= n; ++ i)
{
int a, p, x; scanf("%d%d%d", &a, &p, &x);
if(a < x) res = min(p, res);
}
if(res < INF) printf("%d\n", res);
else puts... |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <climits>
#inclu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, ans, s[500050], t[500050], f[2];
vector<int> vs, ts;
int main() {
scanf("%lld", &n);
for(int i = 0; i < n; i++) {
scanf("%1lld", &s[i]);
f[s[i]]++;
if(!s[i]) vs.push_back(i);
}
for(int i = 0; i < n; i++)... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#define itrout(x) for(int i=0;i<x.size();i++) {cout << x[i] << (i==x.size()-1 ? "\n" : " ");}
#ifdef LOCAL
#define de... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000... | // Coded By : Aj Style
// Problem: C - ORXOR
// Contest: AtCoder - AtCoder Beginner Contest 197（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc197/tasks/abc197_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <bits/stdc++.h>
#define ll long long int
#define ii int
#define du double
#define jm... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define F first
#define S second
#define cn(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0);... | #include <bits/stdc++.h>
using namespace std;
const char BLUE = '+';
const int INF = INT_MAX >> 1;
int main(void) {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int h, w;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; i++) {
cin >> a[i];
}
vec... |
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
using ll = long long;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
... | //#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <functional>
#include <algorithm>
#include <map>
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <queue>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define vi vector<int>
#define vll vector<long long>
#de... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int inf = 1e18+9;
const int mod = 1e9+7;
const int maxn = 2e5+8;
int n, m;
void solve() {
int i, j;
map<int, int> mp;
cin >> n;
for (int x = 3, i = 1; x < n; i++, x *= 3) mp[x] = i;
for (int x = 5, i = 1; x < n; i++, x *=... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define rep(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
const int INF = 1'000'000'000;
const ll llINF = 1'000'000'000'000'000'000;
int m... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#def... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) begin(v), end(v)
#define sz(v) v.size()
#define INF 1000000000000000000 //10^17
#define EPSILON 0.00000000000001 // 10^-14
templa... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// bool xd=any_of(a.begin(),a.end(),[&](int x){return x==9;});
// all_of, none_of
// int cnt=count(a.begin(),a.end(),x);
// bool found=binary_search(a.begin(),a.end(),x); true if x in sorted array
// int xd=*max_element(a.begin(),a.end());
// min_... |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <chrono>
#include <random>
#include <unordered_set>
using namespace std;
typedef long long ll;
void solve() {
ll a, b;
cin >> a >> b;
int n = 73;
vector<int> s(n);
vector<int> prime;
for (int i = 2; i < n; i++) {
if (s[i... | #include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scanf("%c",&a)
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) f... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#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
#define S second
ll MOD =... |
/*
->->->->-> Vora Mahammasasim <-<-<-<-<-
*/
#include<bits/stdc++.h>
#define Quick std :: ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define pb emplace_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define MOD 1000000007
using namespace std;
void s... |
#include<iostream>
using namespace std;
int main()
{
string a;
cin >> a;
if(a.find('.') != string::npos)
{
cout << a.substr(0 , a.find('.'));
}
else
{
cout << a;
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
char s;
int main(){
while(cin >> s){
if(s=='.') break;
cout << s;
}
} |
#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>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
struct int_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9... |
#include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;
const int max_n = 1e5+100;
const int max_len = 631441 + 100000;
const int max_sum = 1e7+100;
const int offset = 1e5+10;
const int inf = 1e18;
signed main(){
... | /*
Author: Hrujul Thumar
*/
#include <bits/stdc++.h>
#define int long long
#define MOD 100000007
#define endl '\n'
#define fastio ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define pi 3.141592653589793238
#define op(a) cout << (a ? "Takahashi" : "Aoki") << '\n';
const ... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define N 200100
#define MOD 1000000007 //998244353
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = a; i <= b; ++i)
#define rep3(i, a, b) for(int i = a; i >= b; --i)
#define eb emplace_back
#de... | #include "bits/stdc++.h"
#define rep(i,b) for(ll i=0;i<b;i++)
#define ll long long
#define mp make_pair
#define pb push_back
using namespace std;
/*--Input//////////////////////////////////////////////////*/
inline void IN(void){return;}
template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
... |
// * Author : Debapriya010 : DEBAPRIYA CHANDRA
// * Jalpaiguri Government Engineering College
#include<algorithm>
#include<bits/stdc++.h>
#define ll long long int
#define dbl long double
#define loop(i,n) for(int i=0;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test(t) int t;cin... | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
// 插入此處
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
LL A, B, C, D;
cin >> A >> B >> C >> D;
if (D * C - B > 0) {
cout << A / (D * C - B) + (A % (D * C - B) ? 1 : 0) <<... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=998244353;
char str[20];
int n,a[20],f[1200005],ans=-1;
int main(){
cin>>str+1;
n=strlen(str+1);
for(int i=1;i<=n;i++)a[i]=str[i]-'0';
for(int i=1;i<=n;i++){
f[1<<i-1]=a[i];
if(f[i]%3==0)ans=max(ans,1);
}
for(int i=1;i<(1<<n);i++... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll=long long;
typedef pair<ll,ll> P;
ll pow2(ll n, ll a){
ll res=1;
rep(i,a) res*=n;
return res;
}
int main(){
ll n;
cin>>n;
ll s=1e18;
for(ll a=1;pow2(3,a)<... |
#include <iostream>
#include <stdio.h>
#include <sstream>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <random>
#include <numeric>
#include <cmath>
#include <complex>
#include <stack>
#include <memory>
#include <cstdi... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
const long double pi = acos(-1);
// g++ -std=c++17 -Wshadow -Wall -g -fsanitize=address -fsanitize=undefined -D_GLIBCXX_DEBUG -o
int main(){
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
string s;
cin>>s;
int cnt... |
#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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp ... |
#include <iostream>
#include <cstdio>
using namespace std;
int ans;
char s[12];
void read(int &s)
{
s = 0; bool pd = false; char c = getchar();
while (c < '0' || c > '9')
{
if (c == '-') pd = true;
c = getchar();
}
while (c >= '0' && c <= '9')
{
s = (s << 3) + (s << 1) + (c ^ 48);
c = getchar();
}
if ... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int flagZ = 0, flagO = 0, flagN = 0, flage = 0;
int count = 0;
for(int i = 0; i < 12; i++){
if(S.at(i) == 'Z'){
flagZ = 1;
continue;
}
if(S.at(i) == 'O' && flagZ == 1){
... |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll r,x,y;
int main(void){
scanf("%lld%lld%lld",&r,&x,&y);
ll gg=r*r;
ll dist=x*x+y*y;
if(gg==dist){
printf("%lld\n",1LL);
}else if(gg>dist){
printf("%lld\n",2LL);
}else{
ll l=0;
ll rr=(x... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main() {
char c[10];
int e = 0, n = 0, f = 0, ans = 0;
for (int i = 0; i < 10; i++) {
cin >> c[i];
if (c[i] == 'o') { e++; }
else if (c[i] == 'x') { n++; }
else { f++; }
}
if (e > 4) { ans = 0; }
if (... |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
#define G getchar()
int read()
{
int x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return flg?-x:x;
}
#undef G
#define fi first
#define se second
typedef long long ll;... | using namespace std;
#include<iostream>
#include<bits/stdc++.h>
#include<algorithm>
#define w(x) int x;cin>>x;while(x--)
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define lld long double
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long int
int mod = 1e9 + 7... |
#include<bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<60)-1;
#define rep(i, n) for (int i = 0; i < n; i++)
#define sz(a) (int)(a.size())
template<class T>
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}
template<class T>
bo... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool ch... |
#include<bits/stdc++.h>
using namespace std;
#define A(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define int int64_t
void _read();
int mod;
inline int inv(int a) {
a %= mod;
if (a < 0) a += mod;
int b = mod, u = 0, v = 1;
while (a) {
int t = b / a;
b -= t * a; swap(a, b);
u -= t *... | #include<bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define ll long long int
#define f first
#define s second
using namespace std;
ll mod=1e9+7;
struct gcd_type
{
ll x,y,g;
};
gcd_type ext_gcd(ll a,ll b)
{
if(b==0) return{1,0,a};
gcd_type p= ext_gcd(b,a%b);
return {p.y,p.x-a/b*p.y,p.g};
}
ll... |
//#define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#defin... | #include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static int IN(void)
{
int x=0,f=1,c;while(c=getchar(),c<48||c>57){if(c==45)f=-f;}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f*x;
}
static void OUT(long x){if(x<0){putchar('-'),x=-x;}if(x>=10){OUT(x/10);}putchar(... |
#define _DEBUG
//ヘッダー
#include<bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const ll INF=1e+18;
const int MOD=1e+9+7;
//デバッグ
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug1(x1) cout<<#x1<<": "<<x1<<endl
#define debug2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": ... | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define int long long int
#define ld long double
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define removeDuplicates(a) a.resize(unique(all(a))-a.begin())
#define endl '\n'
#define setbits(x) (__builtin_popcount(x))
int mod=1... |
// #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 ll long long
#define loop(i,n) for(ll i=0;i<n;i++)
#define loopn(i,j,n) for(ll i=j;i<n;i++)
#define m_arr(arr, n) vector<ll>arr(n)
#define m_arre(arr) vector<ll>arr
#define m_set(sat) set<ll>sat
#define ppn(name) pair<ll,ll>name
#define pp pair<ll,ll>
#define sort_al... |
#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>
using namespace std;
//解説見て解きなおし。
int main(){
long long n;
cin>>n;
vector<long long>list(n);
// vector<long long>list2(n);
for(int i=0;i<n;i++){
cin>>list.at(i);
// list2.at(i)=list.at(i);
// if(i>0) list2.at(i)+=list2.at(i-1);
}
long long total=0;//1+(1+2)+(1+2+3)+...今まで... |
#include<bits/stdc++.h>
using namespace::std;
int n;
int main(){
scanf("%d", &n);
printf("%d\n", (1 << n) - 1);
for(int i = 1; i < (1 << n); i++){
for(int j = 1; j <= (1 << n); j++){
putchar("BA"[__builtin_popcount(i & j) & 1]);
}
puts("");
}
return 0;
}
| #include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
const int N=1e5+7;
ll a,b,c,ans,res;
void gao(ll x){
a=1,b=0,c=0;
ans=x;
while(x!=1){
if(x%2){
c+=pow(2,b);
x--;
}
b++;
x/=2;
a=x;
ans=min(ans,a+b+c);
}... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s1,s2,sm;
int t1=0,t2=0,tm;
for(int i=0;i<n;i++){
string s;
int t;
cin >> s >> t;
if(t > t1){
sm = s1;
tm = t1;
s1 = s;
t1 = t;
s2 = sm;
t2 = tm;
}
else if(t > t2 && t < t1){
s2 = s;
t2 = t;
}
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, init, end) for(ll i = init; i < end; i++)
#define REP(i, init, end) for(ll i = in... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
t... | #include <bits/stdc++.h>
using namespace std;
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_str... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
/* DEBUGGING */
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int sll;
typedef long double ld;
#define A 1000000007
#define D 100000000000000ll
#define B 998244353ll
#define C 1000000000000000000ll
#define M 40... |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
ll qexp(ll a, ll b, ll m) {
ll res = 1;
while (b) {
if (b % 2) res = res * a % m;
a = a * a % m;
b /= 2;
}
return res;
}
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int n,m,t;
void solve()
{
cin>>n>>m>>t;
int a[m],b[m],charge=n;
bool flag=true;
int time=0;
for(int i=0;i<=m;++i)
{
if(i<m)
cin>>a[i]>>b[i];
else
{a[i]=t;
b[i]=t;
}
charge= charge-(a[i]-time);
i... |
#ifdef Rahul
#include "RAHUL.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define error(...) 42;
#endif
#define SZ(v) int((v).size())
#define ALL(vec) begin(vec), end(vec)
typedef long long i64;
template<typename T> inline bool uax(T &x, T y) {return (y > x) ? x = y, true : false;}
template<typename T> inline... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
LL n, t, a[45], px, py;
LL x[1100000], y[1100000];
void fx(int p, int ed, LL sum) {
if (p > ed) {
x[++px] = sum;
return;
}
fx(p + 1, ed, sum);
fx(p + 1, ed, sum + a[p]);
return;
}
void fy(int p, int ed, LL sum) {
... |
#include <bits/stdc++.h>
#define int long long int
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
using namespace std;
const int Nx = 1e6+10;
class node{
public:
//variables
int val;
node(){
//initialization
val = 0;
}
};
int arr[300001];
node tree[4*Nx];
node merge(node left,node right)... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using graph=vector<vector<int>>;
void add_undirected_edge(graph& G,int u,int v){
G[u].emplace_back(v);
G[v].emplace_back(u);
}
void add_directed_edge(graph& G,int u,int v){
G[u].emplace_back(v);
}
int dep[200000];
vector<int>... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p; //vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define RE... | /**
* author: shu8Cream
* created: 15.05.2021 20:32:47
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vecto... |
#include<bits/stdc++.h>
using namespace std;
int read(){
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while('0'<=c&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
int n,flg[200005];string s[200005];char ch[15];
map<string,int>M;
int main(){
n=read();
for(int i=1;i<=n;++i){scanf... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<cstdint>
#include<cstddef>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
using i32 = int_fast32_t;
using i64 =... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a, ll b, ll& x, ll& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll d = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
int main() {
ios_base::sync_with_stdi... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#define ll long long
#define ld long double
#define mod 1000000007
#define pb push_back
#define inf 1000000000000000000
#define ff firs... |
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
string s;
ll ans,raod[200];
int main(){
ios::sync_with_stdio(false);
cin >> s;
for(int i=(int)s.size() - 1; i>=1; i--){
if(s[i] == s[i - 1]){
ans += (int)s.size() ... | #include <bits/stdc++.h>
using namespace std;
namespace Flandre_Scarlet
{
#define N 200005
#define int long long
#define mod 1000000007
#define F(i,l,r) for(int i=l;i<=r;++i)
#define D(i,r,l) for(int i=r;i>=l;--i)
#define Fs(i,l,r,c) for(int i=l;i<=r;c)
#define Ds(i,r,l,c) for(int i=r;i>=l;c... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 5;
const int modu = 1e9 + 7;
const double inf = 0x3f3f3f3f;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
typedef long long LL;
LL n, m;
int main() {
// freopen("my.txt", "w", stdout);
cin >> n >> m;
LL tmp = 1, a ... | #include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <iostream>
#include <string>
#include <array>
#include <random>
#in... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.