code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
#define it register int
#define ct const int
#define il inline
using namespace std;
typedef long long ll;
#define rll register ll
#define cll const ll
#define fir first
#define sec second
const int N=1000005;
namespace io{
il char nc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2... | #include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, s, n) for (ll i = s; i < (n); i++)
const ll INF ... |
#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = long long; using ull = unsigned long long; using pll = pair<ll,ll>; const ll INF = 4e18;
void print0() {}
template<typename Head,typename... Tail> void print0(Head head,Tail... tail){cout<<fixed<<setprecision(15)<<head;print0(tail...);}
void p... | ///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define u64 uint64_t
#define ll long long
#define endl "\n"
#define PI acos(-1)
#define fi first
#define si second
#define mkp mak... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i = a; i < b; i++)
#define rrep(i,a,b) for (int i = a - 1; i >= b; i--)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ll long long
#define dbwt(x) std::cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
vector<vector<pair<int,int>>> ex(500000);
vector<bool> seen(500000,false);
vector<int> ans(500000,0);
void dfs(int now, int par, int c){
if(seen[now]) return;
seen[now] = true;
if(ans[par] != c) ans[now] = c;
els... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int i1, j1, i2, j2;
cin >> i1 >> j1 >> i2 >> j2;
i2 -= i1;
j2 -= j1;
i1 = 0;
j1 = 0;
i2 = abs(i2);
j2 = abs(j2);
if (i2 == 0 && j2 == 0) ... | #include<bits/stdc++.h>
using namespace std;
int a,b,x,y;
int main(){
scanf("%d%d%d%d",&a,&b,&x,&y);
if(a>b)printf("%d",min((a-b-1)*y+x,x*(((a-b)<<1)-1)));
else printf("%d",min((b-a)*y+x,x*(((b-a)<<1)+1)));
return 0;
} |
// #include <iostream>
#include <map>
#include <iostream>
#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>;
const int INF = 1000000001;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const ll mod = 1000000007;... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
char c1, c2, c3;
cin >> c1 >> c2 >> c3;
cout << (c1 == c2 && c2 == c3 && c1 == c3 ? "Won" : "Lost") << '\n';
return 0;
} |
#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <numeric>
#include <ut... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
cout << n/m << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
const ll ll_inf = ll(1e9) * ll(1e9);
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define M 1000000007
struct UnionFind {
//自身が親であれば、その集合に属する頂点数に-1を掛けたもの
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a,b,x,y;
cin>>a>>b>>x>>y;
int ans = x;
if(a>b)
{
for(int i=b; i<a-1; i++) ans+=min(2*x,y);
}
else
{
for(int i=a; i<b... |
#include<bits/stdc++.h>
using namespace std;
//#include<atcoder/all>
//using namespace atcoder;
using ll = long long;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
void solve(vector<vector<int>> &A, vector<vector<int>> &B, int num){
vector<vector<int>> retA(num - 1), retB(num - 1)... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int gcd(ll x, ll y){
if(x < y)swap(x, y);
if(x % y == 0)return y;
return gcd(y, x % y);
}
int extgcd(ll a, ll b, ll &x, ll &y){
int d = a;
if(b != 0){
d = extgcd(b, a % b, y, x);
y -= (a /... |
#include <bits/stdc++.h>
#define MOD 998244353
#define int long long
#define ull unsigned long long
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ceil(x,y) (x+y-1)/y
#define deb(x) { cerr << #x << '=' << x << '\n'; }
#define INF 0x3f3... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << ", " << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out << "[";
bool ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#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 ALL(x) (x).begin(),(x).end()
template<class T>bool umax(... |
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define ppb pop_back
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define fr(a,b) for(int i = a; i < b; i++)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(x) (x).begin(),(x).end()
#define ppc __builtin_popcount
#define ppcll _... | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int n; cin >> n;
int d = n % 1000;
int p = n / 100 % 10 + 1; p *= 100;
cout << p - d << "\n";
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define fillarray(array, value, begin, end) fill((array) + (begin), (array) +... | #include<bits/stdc++.h>
using namespace std;
#define reg register
typedef long long ll;
#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
static char buf[100000],*p1=buf,*p2=buf;
inline int read(void){
reg bool f=false;
reg char ch=getchar();
reg int res=0;
while(!isdigit(ch))f|=(c... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// template <class T = ll> using P = pair< T,T>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
#define rep(i,n) for(int i=0; i<(n);++i)
#define repp(i, l, r) for(int i = (l); i < (r); ++i)
#define pb push_back
... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int,int> > x,y;
vector<int> ans;
map<pair<int,int>,int > ma;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++)
{
int u,v;
cin>>u>>v;
x.push_back({u,i});
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll getNcR(int n, int r)
{
// p holds the value of n*(n-1)*(n-2)...,
// k holds the value of r*(r-1)...
long long p = 1, k = 1;
// C(n, r) == C(n, n-r),
// choosing the smaller value
if (n - r < r)
r = n - r;
i... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define dd double
#define ll long long int
#define ull unsigned long long
#define lld long double
#define setpre(n) cout << std::setprecision(n);
#define flush fflush(stdin); fflush(stdout);
#define print cout<<"Case #"<<test_case<<": ";
#defi... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <map>
//#include <set>
using namespace std;
typedef long long LONG;
#include <iomanip>
LONG gcd(LONG x, LONG y) {
if(x % y == 0) {
return y;
} else {
return gcd(y, x % y);
//x%y==0... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(),a.end()
typedef pair<ll,ll> pi;
//__builtin_popcountll(2) (the number of ones in the binary represe... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1077563119;
int n, m;
bool edge[20][20];
int chromaticNumber(const vector<int> &g) {
int n = g.size();
if (n == 0) return 0;
//randomly choose a large prime
const int modulo = 1077563119;
int all = 1 << n;
vector<int> ind(all), s(a... | #include <bits/stdc++.h>
#define TRACE(x) cerr << #x << " = " << x << endl
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SZ(x) (int)(x).size()
using namespace std;
typedef long long ll;
ty... |
#include <cstdio>
using u32 = unsigned int;
using u64 = unsigned long long int;
constexpr u32 mod = 998244353;
int n, m, k;
/*
A1 ... AN
B1 ... BM
Bmin >= Amax
*/
u32 modpow(u32 a, u32 n){
u32 r = 1;
for(; n; n>>=1){
if(n&1) r = (u64) r * a % mod;
a = (u64) a * a % mod;
}
return r;
}
int main(){... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <chrono>
#define int long long
#define ld long double
#define db double
#define endl "\n"
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
using namespace ... |
#include<bits/stdc++.h>
#define PI 3.141592653589793238462
#define eps 1e-20
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdd;
ll a[200005],d[200005][20],vis[20],mod=1e9+7;
int main(){
string s;ll k;cin>>s>>k;
ll n=s.l... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(a) a.begin(),a.end()
#define fi first
#define se second
#define deb(x) cout << #x << "=" << x << endl
#define clr(x) memset(x, 0, sizeof(x))
#define rep(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
int M=1e9+7,N=205001;... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;string s;
cin >> n >> s;
pair<int,int> a[n][n];
for(int i=0;i<n;i++)
{
pair<int,int> temp(0,0);
if(s[i] == 'A')
temp.first = 1;
else if(s[i] == 'T')
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W,X,Y;
cin>>H>>W>>X>>Y;
vector<vector<char>> S(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> S.at(i).at(j);
}
}
string temp;
temp = "#";
int Z;
Z=1;//位置するますの分
//ここから左右を足す
... |
//Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#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... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n";
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
ll n;
cin>>n;
vector<ll> v1,v2;
for(ll i=1;i<=sqrt(n);i++){
if(n%i==0&&n!=i*i)v1.push_back(i),v2.push_back(n/i);
else if(n==i*i)v1.push_back(i);
}
for(int i... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <iostream>
using namespace std;
#include<bits/stdc++.h>
typedef long long ll;
int main() {
// int t;
// cin>>t;
// while(t--){
ll i,j,k,l;
ll x,y,z;
ll n;
ll m;cin>>n>>m;
vector<ll>a(n);
vector<ll>b(m);
k=1;
l=-1;
if(n==m){
... |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (long long i = (s); i < (long long)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
int main() {
... | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... |
//デバッグ用オプション：-fsanitize=undefined,address
//コンパイラ最適化
#pragma GCC optimize("Ofast")
//インクルードなど
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
//forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
//FORAは範囲for文(使いにくかったら消す)
#define re... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define drep(i, l, r) for(int i=(l), i##_end_=(r); i>=i##_end_; --i)
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define Endl putchar... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=107;
long double E[N][N][N];
int32_t main()
{
int a,b,c;
cin>>a>>b>>c;
// for(int i=0;i<=100;i++)
// for(int j=0;j<=100;j++)
// {
// E[i][j][100]=E[100][i][j]=E[i][100][j]=0;
// }
for(int i=99;i>=0;i--)
{
for(int j=99;j>=0;j... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
struct UnionFind{
vector<int> par;
UnionFind(int N){
par.resize(N,-1);
}
int root(int x){
if(par[x] < 0) return x;
return par[x] = root(par[x])... | #include <bits/stdc++.h>
using namespace std;
const long long MOD=998244353;
int N, K;
long long modmypower(long long a, long long b){
if(b==1){
return a;
}else if(b%2==0){
long long c=modmypower(a,b/2);
return (c*c)%MOD;
}else{
long long c=modmypower(a,(b-1)/2);
return (((c*c)%MOD)*a)%MOD;
... |
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef unsigned long long ull;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi... | #include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
cout<<n-1;
} |
#include<bits/stdc++.h>
#include<unordered_map>
#define sz(s) (int)s.size()
#define all(s) s.begin(),s.end()
using namespace std;
typedef long long ll;
void fast(){
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
bool valid(ll n, string s)
{
if (!n)
return 0;
int c = 0;
while (n)
{
c++;
... | // D - Send More Money
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define vec vector
#define rep(i,e) for(int i=0;i<(e);++i)
#define sz(a) int(a.size())
ll INF = 1e18;
string in(){ string s; cin>>s; return s; }
vec<int> reversed(vec<int> s){ reverse(s.begin(), s.end()); return s; }
int main(){
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,x;
cin >> n >> x;
vector<ll> a(n);
rep(i,n) cin >> a[i];
ll dp[2];
dp[0] = 1;
dp[1] =... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define int long long
#define ll long long
#define all(v) v.begin(... |
#include <iostream>
using namespace std;
using LL = long long;
const int kMaxN = 21;
int n, m, p, q[kMaxN], k[kMaxN];
bool v[kMaxN], e[kMaxN][kMaxN];
LL c = 1, _c;
void F(int x) {
if (!v[x]) {
v[x] = 1, q[++p] = x;
for (int i = 1; i <= n; ++i) {
if (e[x][i]) {
F(i);
}
}
}
}
void... | #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<ll, ll>;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const int mod = 1000000007;
//const int mod = 998244353;
vector<vector<int>> to;
vector<int> used, col, vs;
ll... |
#include <iostream>
#include <stdio.h>
#include <cstdio>
#include <stack>
#include<algorithm>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
long long N, K;
cin >> N >> K;
for (int i = 0; i < K; i++) {
if (N % 200 == 0) {
N /= 200;
}
else {
N = N * 1000 + 200;
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define F first
#define S second
#define YES(n)cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
int main(){
int n,m;
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int H, W, X, Y;
cin >> H >> W >> X >> Y;
X -= 1; Y -= 1;
vector<vector<bool>> S(H, vector<bool>(W));
string S_0;
for (int i=0; i<H; i++){
cin >> S_0;
for (int j=0; j<W; j++){
if(S_0[j] == '#')
S.at(i).at(j) = false;
... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int h = ri();
int w = ri();
int x = ri() - 1;
int y = ri() - 1;
std::string s[h];
for (auto &i : s) std::cin >> i;
int cnt = -3;
for (int i = x; i < h && s[i]... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define ... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define REP(w, n) FOR(w, 0, n)
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<ll> a(n + 1);
a[0] = 0;
vector<ll> b(n + 1);
REP(i, n)
{
ll tmp;
cin >> tmp;
a[i + 1] = max(tmp, a[i]);
}
b[0] = 0;
RE... |
#include <bits/stdc++.h>
#define f(a, n) for (int a = 0; a < n; a++)
#define F(a, n) for (int a = 1; a <= n; a++)
using namespace std;
struct Student{
map<int, int> mp;
int sz = 1;
Student* par = this;
};
Student* find(Student* a){
if (a->par == a) return a;
return a->par = find(a->par);
}
void join(Student* a... | #include <bits/stdc++.h>
#define DEBUG(C) cerr << #C << " = " << C << endl;
using namespace std;
const int MOD = 1e9 + 7;
// UnionFind,素集合データ構造,DisjointSet
template<typename weight_type = int>
class union_find {
static_assert(
std::is_arithmetic<weight_type>::value,
"Invalid weight type"... |
#include "bits/stdc++.h"
using namespace std;
const long long INF = 1e9;
int main(){
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w));
for(int i = 0;i < h;i++){
for(int j = 0;j < w;j++){
cin >> a[i][j];
}
}
vector<vector<int>> dp(h, vector<int>(w)... | #include<ctime>
#include<cstdio>
#include<cctype>
#include<algorithm>
using namespace std;
const int N=2e3+7;
int read() {
char c;
int x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
char c[N][N];
int h,w,f[N][N];
int main() {
#ifndef ONL... |
#include <iostream>
#include <cstdio>
#include <bits/stdc++.h>
#include <math.h>
#include <string>
using namespace std;
// === Debug macro starts here ===============================
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000*100+1
#define numberOfSetBits(S) __builtin_popcount(S) // __builtin_popcountl(S) __builtin_popcountll(S)
#define MSET(x,y) memset(x,y,sizeof(x))
#defin... |
// C - Unexpressed
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ll n; cin>>n;
set<ll> ok;
for(ll a=2; a*a<=n; ++a){
ll x = a*a;
while(x <= n){
ok.insert(x);
x *= a;
}
}
cout<< n - ok.size() <<endl;
}
| #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 <stdio.h>
#include <algorithm>
#include <string.h>
#include <assert.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
const int maxN = 2e5; int n;
char s[maxN + 1], x[maxN + 1];
int nums[maxN];
// 1 Aoki, -1 Takahashi
int digits[6] = {1, 3, 2, 6, 4, 5};
int mem... | #include <cstdio>
#include <vector>
using namespace std;
int N;
const int MAXN=2e5+7;
char S[MAXN],X[MAXN];
int CUR=0;
bool NUM[MAXN][7],dp[MAXN][7],range[MAXN][7];
int exp(int e){
if (e==0) return 1;
int tmp=exp(e/2);
if (e%2) return tmp*tmp*10%7;
else return tmp*tmp%7;
}
int main(){
s... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LL unsigned long long
#define NL <<"\n"
#define vec(x) vector<x>
#define emb(x) emplace_back(x)
#define fall(x) x.begin(),x.end()
#define rfall(x) x.rbegin(),x.rend()
#define fo(a,b) for(long long i=a; i < (b)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... |
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<iomanip>
#include<regex>
using namespace std;
#define int long long
const int mod=1e9+7;
signed main(){
int n,a[200000];
cin>>n;
for(int i=0;... |
/*
ॐ
JAI SHREE RAM
Hare Krishna Hare Krishna Krishna Krishna Hare Hare
Hare Rama Hare Rama Rama Rama Hare Hare
ॐ
*/
//Written by Bhuwanesh Nainwal
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace s... |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include ... | #include <iostream>
#include <algorithm>
#include <vector> //動的配列
#include <string>
#include <list> //双方向リスト
#include <map> //連想配列
#include <set> //集合
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <bitset>
#include <numeric>
#include <tuple>
typedef long long ll;
using namespace std;... |
#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()
typedef long long ll;
int main(){
ll n;
cin >> n;
vector <ll> b(16);
ll now = 1;
rep(i,16){
b[i] = now;
now *= 10;
}
ll ans = 0;
if(n == b[15]){... | # include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define int long long
# define float long double
# define fi first
# define se second
# 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>
using namespace std;
#define ll long long
#define ld long double
#define iter vector<ll>::iterator
#define mp make_pair
#define pb push_back
#define rep(i,n) for (i = 0; i < n; ++i)
#define REP(i,k,n) for (i = k; i <= n; ++i)
#define REPR(i,k,n) for (i = k; i >= n; --i)
ll fact(ll n){
if(n=... | #include <cstdlib>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define vc vector<char>
#define vs vector<string>
#define vd vector<double>
#define vll vector<ll>
#define vvi vector<vi>
#define vvii vector<vii>
#define vvc vect... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
#define Output(a) cout << a << endl
typedef long long int ll;
typedef vector<int> vi;
typedef vector<long l... | // Template begins
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <math.h>
#include <iomanip>
#include <queue>
#include <string.h>
#include <string>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#defi... |
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int n,v[200100];
signed main()
{
int lst=0,x;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x;v[x]=1;
while(v[lst]) ++lst;
printf("%d\n",lst);
}
return 0;
} | // #include<bits/stdc++.h>
//#include <atcoder/all>
// #include <array>
#include <vector>
// #include <list>
// #include <forward_list>
// #include <deque>
// #include <queue>
// #include <stack>
// #include <bitset>
// #include <unordered_map>
// #include <map>
// #include <unordered_set>
// #include <set>
#includ... |
#include <bits/stdc++.h>
using namespace std ;
#define i64 int64_t // typecast using i64(x)
#define int int64_t
#define ld long double
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)
#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define poly vector<ll>
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
#defi... |
#include <bits/stdc++.h>
const int mod1 = 998244353, mod2 = 1e9 + 7;
const int N = 1e6 + 5, M = 1e7 + 5;
void solve() {
int n; std::cin >> n;
std::vector<int> a(n);
std::map<int, int> mp;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
mp[a[i]]++;
}
long long ans = 0;
for (auto &it : mp) {
ans += 1LL * i... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
type... |
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
stack<char> st;
for (int i = 0; i < n; i++) {
st.emplace(s[i]);
... | #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define size_t unsigned long long
#define ll long long
#define rep(i, a) for (int i = 0; i < (a); i++)
#define repr(i, a) for (int i = (int)(a)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#de... |
#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>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define fz(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define ffe(it,v) for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define fill0(a) memset(a,0,sizeof(a))
#define fill1(a) memset(a,-1,sizeof(a))
#define... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
vector<int> sz;
UnionFind(int n=0){ if(n>0) initialize(n); }
void initialize(int n){
par.resize(n);
sz.assign(n, 1);
for(int i=0; i<n; i++){
par[i] = i;
}
}
int find(i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
ll t,n;scanf("%lld %lld",&t,&n);
printf("%lld",(n-1)/t*100+((n-1)%t*100+99)/t+n);
}
int main()
{
solve();
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define vect(a,n) for(int i=0;i<n;i++){ ll t; cin>>t; a.push_back(t);}
using namespace std;
signed main()
{
ll n,res;
cin>>n;
if(n%100==0){
res = (int)n/100;
cout<<res;
}
else
{
res = (int)n/100;
cout<<res+1;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
// (b ^ p) % mod
long long modpow(long long b, long long p, long long mod) {
long long res = 1;
while (p > 0) {
if (p & 1) {
res = res * b % mod;
}
b = b * b % mod;
p >>= 1;
}
return res;
}
int main() {
ios::... | #pragma GCC optimize ("trapv")
#include <bits/stdc++.h>
#include<algorithm>
#include <vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#defi... |
#include<bits/stdc++.h>
using namespace std;
struct node {
long long a, b;
node() { cin >> a >> b; }
bool operator < ( const node& f ) const
{ return a * 2 + b > f.a * 2 + f.b; }
};
int main() {
int n; cin >> n;
vector<node> V;
long long all = 0;
for( int i = 1; i <= n; i ++ ) V.push_back( node() );
sort( ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll ans = 0;
int N; cin >> N;
vector<ll> A(N),B(N);
ll aoki = 0 , takahashi = 0;
for(int i=0; i<N; i++){
cin >> A[i] >> B[i];
aoki += A[i];
// takahashi += B[i];
}
vector<ll> value(N);
for(int i=0; i<N; i++){
... |
#include <cstdio>
#define rep( i, a, b ) for( int (i) = (a) ; (i) <= (b) ; ++ (i) )
#define per( i, a, b ) for( int (i) = (a) ; (i) >= (b) ; -- (i) )
const int mod = 1e9 + 7;
const int MAXN = 2e3 + 5;
template<typename _T>
void read( _T &x )
{
x = 0; char s = getchar(); int f = 1;
while( s < '0' || '9' < s ) { f =... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int gcd(int x, int y) { return (x % y)? gcd(y, x % y): y; } //最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } //最小公倍数
using Graph = vector<vector<int>>;
ll inf=300000000000000000;
const d... |
//int max = 2 147 483 647 (2^31-1)
//ll max = 9 223 372 036 854 775 807 (2^63-1)
#include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(ll i=0;i<n;i++)
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long X, std::vector<long long> A){
ll ans = 1e18;
for(int w = 1;w <= N;w++){
vector<vector<vector<ll>>> dp(N + 1, vector<vector<ll>>(w + 1, vector<ll>(w, -1)));
dp[0][0][0] = 0;
for(int i ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int n... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<float.h>
#include<tuple>
#include<string.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<map>
#include<deque>
using namespace std;
#define ll long long
#define rep(i,n) ... |
#include<stdio.h>
#include<iostream>
#include<algorithm> // sort(ALL())
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector> // a.size() = sizeof(a)/sizeof(a[0])
#include<queue> // push(), front(), pop() 先入れ先出し
#include<map> // 連想配列 map<string, int>
#include<iomanip>
#include<set>
#i... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 500 + 5;
int N, c[MAX_N][MAX_N], a[MAX_N][MAX_N], b[MAX_N];
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i ++)
for (int j = 1; j <= N; j ++) {
scanf("%d", c[i] + j);
a[i][j] = c[i][j] - c[i][j - 1];
... |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <se... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<tuple>
#include<cstring>
#include<bitset>
#define REP(i,n) for(int i=0;i<(int)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(... |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ll long long
#define mod 998244353
using namespace std;
int main(){
int a, b, c;cin>>a>>b>>c;
if(a==b){cout<<c;return 0;}
if(b==c){cout<<a;return 0;}
if(c==a){cout<<b;return 0;}
cout<<0;
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i < n; i++)
using ll = long long;
void chmax(ll& x, ll y) { x = max(x,y); }
const ll INF = 1e18;
ll dp[105][105];
tuple<ll,ll,ll> extgcd(ll a, ll b){
if (b == 0) return {a,1,0};
ll g,x,y;
tie(g,x,y) = extgcd(b, a%b);
return {g,y,x-a/... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1001001001;
const long long LINF = 1001002003004005006;
const double PI = acos(-1);
int d4r[] = {1, 0, -1, 0};
int d4c[] = {0, 1, 0, -1};
int d8r[] = {1, 1, 0, -1, -1, -1, 0, 1};
int d8c[] = {0, 1, 1,... |
//debug icin gdb kullanmayi dene
#include<bits/stdc++.h>
using namespace std;
#define mods 1000000007
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef long long int lint;
typedef unsigned long long int ulint;
lint fastpow(lint tab,lint us){
if(tab==0) return 0;
if(tab==1) return 1;... | #include<bits/stdc++.h>
using namespace std;
int gi() {
char ch='!'; int res=0, f=0;
while(ch<'0' || ch>'9') { ch=getchar(); if(ch == '-') f=1; }
while(ch>='0' && ch<='9') res=res*10+ch-'0', ch=getchar();
return f?-res:res;
}
const int N=5e5+100;
int n; char s[N],t[N]; deque<int> vec;
long long ans;
int main( ){
... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using Pair = pair<int, int>;
using List = vector<int>;
using Edge = vector<int>;
using Graph = vector<Edge>;
Pair dfs(const int v, const Graph& to) {
int res = 1, t = 1, a = 0, b = 0;
List cs;
for (int u : to[v]) {
auto r = dfs(u... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e18;
const int MOD = 1... |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,k,n) for(long long i=k;i<n;i++)
#define endl "\n"
#define pb push_back
#define vii vector<ll>
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
typedef long long ll;
/* ll fun_ceil(ll n,ll k){
if(n%k==0){
return n/k;
}
else {
ll x... |
#include <sstream>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <complex>
#include <malloc.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <bitset>
#include <lis... |
#include <bits/stdc++.h>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && !std::isdigit(ch)) ch = std::getchar();
if (ch == '-') w = -1, ch = std::getchar();
while (std::isdigit(ch)) data = data * 10 + (ch... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=400005;
const ll mod=998244353;
ll n,tag[MAXN];
pair<ll,ll> p[MAXN];
int main(){
scanf("%lld",&n);
for(ll i=1;i<=2*n;i++){
scanf("%lld",&p[i].first);
p[i].second=i;
}
sort(p+1,p+2*n+1);
for(ll i=n+1;i<=2*n;i++){
tag[p[i].se... |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937_64 mrand(chrono::steady_clock::now().time_since_epoch().count());
//mt19937_64 mrand(42);
#define ii for(int i=1;i<=n;++i)
#define ji for(int j=1;j<=n;++j)
#define jj for(int j=1;j<=m;++j)
#define ij for(int i=1;i<=m;++i... | #pragma region templates
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
t... |
#include<bits/stdc++.h>
#define ll long long int
#define pii pair<int,int>
#define F first
#define S second
#define mod 1000000007
using namespace std;
void solve(){
ll ans=1e9; int n; cin>>n;
pii arr[n];
for(int i=0;i<n;i++){
int a,b; cin>>a>>b; arr[i]={a,b};
}
for(int i=0;i<n;i++){
ans=min(ans,(ll)arr[i].F... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<in... |
#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;
// #define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long int
#define endl "\n"
#define ... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
struct uf_tree {
std::vector<int> parent;
std::vector<std::map<int, int>> dict;
int __size;
uf_tree(int size_) : parent(size_, -1), dict(size_), __size(size_) {}
void unite(int x, int y) {
if ((x = find(x)) != (y = fi... |
/*Rabbi Zidni Ilma*/
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define scl(n) scanf("%lld",&n)
#define scll(n,m) scanf("%lld %lld",&n,&m)
#define pb push_back
#define mp make_pair
#... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... |
#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 = long long;
using Graph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int SINF = 1LL << 29;
const ll mod = 1000000000+7;
const int... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <stack>
typedef long long ll;
typedef long dou... |
#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 vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
double EPS=1e-9;
int INF=1000000005;
long ... | #include <bits/stdc++.h>
using namespace std;
long long int modinv(long long int a, long long int m) {
long long int b = m, u = 1, v = 0;
while (b) {
long long int t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int main() {
int T;
cin >... |
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 1003;
ll t, n;
bool c[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mkp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define M1 1000000007
#define M2 998244353
#define fl(i,a,b) for(ll i=a;i<b;i++)
#define bfl(i,a,b) for(ll i=b-1;i>=a;i-... |
#include <iostream>
#include <vector>
#include <map> // map<string, int> mp;
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int N, M; cin >>... | #include <bits/stdc++.h>
using namespace std;
// clang-format off
/* accelration */
// 高速バイナリ生成
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
// cin cout の結びつけ解除, stdioと同期しない(入出力非同期化)
// cとstdの入出力を混在させるとバグるので注意
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(fals... |
#include <bits/stdc++.h>
using namespace std;
#define int int long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define fr1(i, n) for (int i = 1; i <= n; i++)
#define S second
#define F first
#define pb(n) push_back(n)
#define endl "\n"
int mod = 1e9 + 7;
vector<int> v[1000001], tr[100001];
int level[1000001] = {... | #include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define lli long long int
#define pi pair<lli,lli>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for(lli i=a;i<b;i++)
#define all(x) x.begin(), x.end... |
#include <bits/stdc++.h>
// #include <atcoder/all> // NOTE: AtCoderライブラリ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr << #x << ": " << x << ", " << #y << ": " << y << endl;
#define dbg3(x, y, z) cerr << #x << ": " << x << ", " << #y << ": "... | #include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <cmath>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define ten5 100005
#define ten52 20000... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define ret(x) return cout<<x,0;
#define rety return cout<<"YES",0;
#define retn return cout<<"NO",0;
typedef long long ll;
typedef double db;
typedef long double ld;
#define stt string
#define ve vector<ll>
#define se set<ll>
#define ar array
ll mod=1e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long R, long long X, long long Y){
ll dist = (X * X + Y * Y) / (R * R);;
if(R * R > X * X + Y * Y){
cout<<2<<endl;
return;
}
if((X * X + Y * Y) % (R * R)){
dist++;
}
ll ok = 0;
ll ... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const ll LLINF = 1e18;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
// input
... |
#include<bits/stdc++.h>
#define ll long long
int main()
{
using namespace std;
int t;
cin>>t;
while(t--)
{
ll n;
cin>>n;
if(n==1)
{
cout<<"Odd\n";
continue;
}
if(n==2)
{
cout<<"Same\n";
continue;
}
if(n%2==1)cout<<"Odd\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 fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define fp(i,a,b) for(ll i=a ; i<b ; i++)
#define fn(i,a,b) for(int i=a ; i>=b ; i--)
#define ones(x) __built... |
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
int h,w,m;
int f[200005];
ll ans = 0;
int of[200005];
int fw[200005];
ii p[200005];
void up(int x, int v){
while (x < 200005){
fw[x] += v;
x += x&-x;
}
}
int qu(int x)... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ... |
#include <bits/stdc++.h>
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pow power
#defi... | #include<iostream>
#define int long long
using namespace std;
signed main()
{
int n,s,d;
cin>>n>>s>>d;
bool flag=0;
for(int i=0;i<n;i++)
{
int j,k;
cin>>j>>k;
if(j<s&&k>d)
{
flag=1;
}
}
if(flag)
cout<<"Yes";
else
cout<<"No";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define FASTio ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
#define all(v) (v).begin(), (v).end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define printarr(v) {for(auto x : v) cout<<x<<" ";cout<<"\n";}
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
cout << ((floor(n*1.08)<206)? "Yay!": ((floor(n*1.08)==206)? "so-so": ":(")) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll,ll> pll;
typedef vector <int> vint;
typedef vector <ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;
typedef vector <string> vs;
typedef priority_queue <int> pqi;
#define FOR(i, a, b) for(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(int)(x);i<(int)(y);i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int siz=3e5;
const int inf=1e9;
int main(){
int N; cin>>N;
pair<lon... |
#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(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=2e18;
int main(){
int n; cin >> n; n*=2;
VI a(n); RE... | #include <iostream>
long long dp[201][12];
long long nCr(long long n, long long r) {
if (r == n)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (r == 0)
return dp[n][r] = 1;
if (dp[n][r] == 0)
return dp[n][r] = nCr(n-1, r) + nCr(n-1, r-1);
else
return dp[n][r];
}
int main() {
int l;
for (i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a != b && b != c && c != a) cout << 0 << '\n';
else cout << (a ^ b ^ c) << '\n';
} | #include "bits/stdc++.h"
#include <stdio.h>
#include <string.h>
#include<iostream>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;
#define KP \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define rep(i, a, b) for (ll i = ... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (long long i = (a); i < (long long)(b); i++)
#define IFOR(i, a, b) for (long long i = (a); i <= (long long)(b); i++)
using namespace std;
using VL = vector<long long>;
using ll = int64_t;
ll mod(ll x,ll m){ll y=x%m;re... | #include <bits/stdc++.h>
#define rei register int
#define int signed long long
#pragma GCC optimize(2)
using namespace std;
int T,X,Y,P,Q;
int ans,cnt;
void exgcd(int &x,int &y,int a,int b)
{
if(!b)
{
x=1;
y=0;
return;
}
exgcd(x,y,b,a%b);
int t=x;
x=y;
y=t-a/b*y;
} in... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int helper(int l, int r)
{
int j= r - (2*l);
int temp = j*(j+1);
temp = temp/2;
temp = temp + j;
temp = temp + 1;
return temp;
}
void solve(){
int l,r;
cin>>l>>r;
if(2*l <= r)
cout<<helper(l,r)<<endl;
else
cout<<0<<endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> solve(ll t, vector<ll> l, vector<ll> r) {
vector<ll> res(t);
for(ll i = 0ll; i < t; i++) {
//cout << t << " -> " << i << endl;
ll count = max(r[i] - 2ll * l[i] + 1ll, 0ll);
//cout << "count: " << count << e... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll p = 1000000009;
const ll nax = 200002;
int par[nax];
int pr(int v) {
if (par[v] == v) return v;
return par[v] = pr(par[v]);
}
int main() {
for (int i = 0; i < nax; ++i) {
par[i] = i;
}
int n;
cin >> n;
vector<int> v(n);
for (... | #ifdef MYDEBUG
#include "pch.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#endif
using namespace std;
#define int long long
#define endl '\n'
#define sz(x) (int)((x).size())
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
typedef vector<int> vi;
typedef map<int, int> mii;
typede... |
#include<algorithm> // min, max, sort,
#include<iostream>
#include<iomanip> // fixed+setprecision,
#include<cstdint> // int64_t,
#include<vector>
#include<map>
using namespace std;
const static int64_t MOD = 1000000007;
int main()
{
int64_t a, b, c, d;
cin>>a>>b;
cin>>c>>d;
cout<<b-c<<endl;
... | #include <iostream>
using namespace std;
int main(){
int N, S, D;
cin >> N >> S >> D;
int *spell_time = new int[N];
int *spell_damage = new int[N];
for(int i = 0; i < N; i++){
cin >> spell_time[i] >> spell_damage[i];
}
bool result = false;
for(int i = 0; i < N; i++){
... |
#include <bits/stdc++.h>
using ull = unsigned long long;
using ll = long long;
using namespace std;
#define pf printf
#define sc scanf
#define nline cout << '\n'
#define dbg(x) \
cout << "debug " << #x << ": " << x << '\n';
#define inp(t) cin >> (t)
#define out(t) cout << (t)
#define... | // g++ F.cpp -std=c++14 -I . && ./a.out
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint = modint998244353;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < (int)(b); i++)
#de... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using Graph = vector<vector<int>>;
using Grid= vector<string>;
using vin= vector<int>;
using ll=long long;
using ull=unsigned long long;
using vll= vector<ll>;
using vbl=vector<... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pi pair<int, int>
#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define FIO ios_base::sync_with_stdio(0), cin.tie(0)
#define fi first
#define se second
signed main() {
FIO;
int n;
cin >> n;
set<pa... |
#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#define rep(i,p) for(long long int i=0;i<p;i++)
#define reep(i,p) for(long long int i=1;i<=p;i++)
#define ll long long
using namespace std;
int main(){
ll int N;
cin >> N;
vec... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
void recursive_comb(int *indexes, int s, int rest, std::function<void(int *)> f) {
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vc = vector<char>;
using vcc = vector<vc>;
using Pii = pair<int,int>;
using ld = long double;
int main(){
int h,w,x,y;
cin >> h >> w >> ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) { cerr << #a << ':' << a << endl; }
#define endl '\n'
#define fi first... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_set>
#i... | #include<iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a != b && a != c && b != c) cout << 0 << endl;
else {
if (a == b) {
cout << c << endl;
return 0;
}
if (a == c) {
cout << b << endl;
return 0;
}
if (c == b) {
cout << a << endl;
return 0;
}
}
} |
#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, m;
cin >> n >> m;
int a[m], b[m]... | #include<bits/stdc++.h>
using namespace std;
const int MAXN=1<<18,INF=-0x3f3f3f3f3f;
int N,F[MAXN],G[MAXN],U,Con[MAXN],IsCon[MAXN];
inline int lowbit(int n) { return n&(-n); }
inline bool iscon(int b,int s){
if(G[s]!=1) return 0;
while(s){
if(!Con[b|lowbit(s)]) return 0;
s^=lowbit(s);
}
... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | //AnkitCode99 here....
//every ups and downs matter!
#include<bits/stdc++.h>
#define endl "\n"
#define IOS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr)
typedef long long int ll;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
using namespace std;
const ll sz=(1e5+5)*2;
const ll szz=1e6... |
// Author: wlzhouzhuan
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fir first
#define sec second
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, l, r) for (int i = l; i >= r; i--)
#define mset(s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in: a)
#define sz(x) (int)x.... | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PIL = pair<int,ll>;
using PLI = pair<ll,int>;
using PLL = pair<ll,ll>;
using Graph = vector<vector<int>>;
using Cost_Graph = vector<vector<PIL>>;
template<class T> bool chmin(... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define ln cout<<'\n'
void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<' ';pr(b...);}
void chmin(int& x, int y) { x = m... | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 800, A = 1000000000;
int aa[N + 1][N + 1], pp[N + 1][N + 1];
int main() {
int n, k; cin >> n >> k;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cin >> aa[i][j];
int lower = -1, upper = A;
while (upper - lower > 1) {
... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> x(n),y(n);
for(int i=0; i<n; i++) {
cin >> x[i] >> y[i];
}
bool res = false;
for(int i=0; i<n-2; i++) {
for(int j=i+1; j<n-1; j++) {
for(int k=j+1; k<n; k++){
... | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#inc... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define ff first
#define ss second
#define YES printf("YES\n")
#define NO printf("NO\n")
#define nn "\n"
#define sci(x) scanf("%d", &x)
#define LL_INF (1LL << 62)
#d... | // 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 pl pair<ll,ll>
#define bs(v, x) binary_search(v.begin(), v.end(... |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
#define ll long long
#define ld long double
using namespace __gnu_pbds;
using namespace std;
template... |
#include <bits/stdc++.h>
using namespace std;
typedef long double LD;
typedef pair<LD, LD> PDD;
const LD eps = 1e-6;
int main()
{
int n, m, k; scanf("%d %d %d", &n, &m, &k);
vector<int> a(k + 1), vis(n + 1);
for (int i = 1; i <= k; i++)
scanf("%d", &a[i]), vis[a[i]] = 1;
vector<PDD> suf(n + m + 1, {0.0, 0.... | //include <atcoder>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#define flush fflush(stdout)
#define endl '\n'
#define all... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.