code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
// #pragma optimize("-O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,avx,mmx,tune=native")
// #define ll long long
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using ll = long long;
using ld = long double;
#define mp make_pair
const int p = 1e9 + 7;
int mul(int a, int b) {
return (1LL * a * b) % p;
}
int add(int a, in... |
#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()
int main() {
int N;
cin>>N;
vector<int> A(N),B(N);
rep(i,N){
cin>>A[i]>>B[i];
}
int ans=1000000;
rep(i,N){
rep(j,N){
int memo;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
int a[n][2];
int c[n*n];
for(int i=0;i<n;++i){
int max=0;
for(int j=0;j<2;++j){
cin>>a[i][j];
max=max+a[i][j];
}
c[i]=max;
}
int b=n;
for(int i=0;i<n;++i){
for(int j=0;j<n;++j){
if(i!=j){
c[b]=ma... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#defin... | #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const static int MAX_H = 1500;
const static int MAX_W = 1500;
bool is_wall_or_light[MAX_H][MAX_W];
int main(){
unsigned H, W, N, M;
scanf("%u %u %u %u", &H, &W, &N, &M);
vector<i... |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
#define PI 3.14159265359
const long long INF = 1LL << 60;
long long MOD = 1000000007;
long long gcd(long long a, long long b) { return b ? gcd(b, a%b) : a; }
long long lcm (int a, in... | #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>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (n - 1); i > (a - 1); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) f... | #include <cstdint>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cctype>
#include <limits> // INT_MAX ...
using namespace std;
struct fast_ios {
fast_ios() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout << fixed << setprecision(10);
}
} f... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pp=pair<int,int>;
int main() {
// ios_base::sync_with_stdio(0); cin.tie(0);
double sx, sy, ex, ey;
cin>>sx>>sy>>ex>>ey;
printf("%.9f", sx+sy*((ex-sx)/(ey+sy)));
return 0;
}
| //:::: Alien :::://
// Muhammad Eid //
#include <bits/stdc++.h>
using namespace std;
void Mo35() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
int main() { Mo35();
int a, b, c, d;
cin >> a >> b >> c >> d;
int mx = -2e9;
for (int x = a; x <= b; ++x) {
... |
#include<bits/stdc++.h>
using namespace std;
int s0,t0,st;
int main(){
int n;cin>>n;
string s,t;cin>>s>>t;
for(int i=0;i<n;i++){
if(s[i]=='0') s0++;
if(t[i]=='0') t0++;
if(s[i]=='0'&&t[i]=='0'&&t0==s0)st++;
}
if(s0!=t0) cout<<-1;
else cout<<s0-st;
return 0;
} | #include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define ll long long
//#define file
using namespace std;
int n,i,j,k,l;
char S[500001];
char T[500001];
int s1[500001],s2[500001];
int ans,sum;
int main()
{
#ifdef file
freopen("b.in","r",stdin);
#endif
scanf(... |
#include <set>
#include <map>
#include <iostream>
using namespace std;
void add(multimap<long long, long long>& D, long long dist, long long i1, long long i2) {
D.emplace(dist, i1 > i2 ? i2 << 32 | i1 : i1 << 32 | i2);
}
int main(void){
// Your code here!
long long N;
multimap<long long, long long> X... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<math.h>
#include<unordered_set>
#include<unordered_map>
#include<cassert>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
#define mp make_pai... | #include <bits/stdc++.h>
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pb push_back
#define pob pop_back
#define pof pop_front
#define pf push_front
#define mp make_pair
#define... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... | #include <cstdio>
#include <vector>
const int maxn = 2e5+5;
int n,ans[maxn],maxx,X,Y;
int head[maxn],tot;
struct Edge{
int next,to;
}e[maxn<<1];
void add_edge(int x,int y){
e[++tot].next = head[x];
e[tot].to = y,head[x] = tot;
}
int fa[maxn],top[maxn],siz[maxn],dep[maxn],son[maxn],Flag[maxn];
void dfs1(int u,int F){... |
#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 998244353;
long long modpow(int n, int r) {
long long ret = 1; long long tmp = (long long) n;
while (r != 0) {
if (r % 2) ret *= tmp;
tmp *= tmp; tmp %= mod; ret %= mod;
r /= 2;
}
return ret;
}
int main() ... | #include <bits/stdc++.h>
using namespace std;
template <int MOD_> struct modnum {
static constexpr int MOD = MOD_;
static_assert(MOD_ > 0, "MOD must be positive");
private:
using ll = long long;
int v;
static int minv(int a, int m) {
a %= m;
assert(a);
return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) /... |
#include "bits/stdc++.h"
using namespace std;
// ๅฎ็พฉ
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(x) (x).begin(),(x).end()
#define REP(i, n) for(ll i = 0 ; i < (ll)n ; ++i)
#define REPN(i, m, n) for(ll i = m ; i < (ll)n ; ++i)
#define VL vector<ll>
#define... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpl = vector<pair<ll, ll>>;
using pll = pair<ll, ll>;
#define rep(i, k, n) for(ll i = k; i < n; i++)
#define pb push_back
#define mp make_pair
int main()... |
#include<algorithm>
#include<iostream>
#include<stdio.h>
#include<iostream>
#include<stdio.h>
#include<vector>
#include<set>
#include<string>
#include<iomanip>
#include<queue>
#include<functional>
#include<cmath>
#include<map>
#include<tuple>
#include <numeric>
#define rep(i,n) for(int i=0; i<(int)n; i++)//nๅ็นฐใ่ฟใ
#defi... | #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main()
{
char S,T;
cin>>S>>T;
if(S=='Y')
{
if(T=='a')
cout<<"A";
else if(T=='b')
cout<<"B";
else if(T=='c')
cout<<"C";
else
cout<<T;
}
else
cout<<T;
return 0... |
#include<iostream>
#include<map>
using namespace std;
int a[70000];
int main(){
int n,ans;cin>>n;map<int,bool>mp;
for(int i=0;i<(1<<n);++i)cin>>a[i];
for(int i=0;i<n;++i){int x=0,y=1;
for(int j=0;j<(1<<(n-i-1));++j){
while(mp[x])++x;
while(mp[y]||y<=x)++y;
if(a[x]>a[y])mp[y]=1,ans=y,x=y+1,y=x+1;
else m... | #include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstring>
#define rg register
inline int read(){
rg int x=0,fh=1;
rg char ch=getchar();
while(ch<'0' || ch>'9'){
if(ch=='-') fh=-1;
ch=getchar();
}
while(ch>='0' && ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return x*fh;... |
/**
* @FileName a.cpp
* @Author kanpurin
* @Created 2021.05.09 01:16:12
**/
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll C(__int128_t N, __int128_t L) {
__int128_t ans = 0;
if (L-3 >= 3*N) ans -= (L-3*N)*(L-3*N-1)*(L-3*N-2)/6;
if (L-3 >= 2*N) ans += 3*(L-2*N)*(L-2*N-1)... | #include <iostream>
#include <algorithm>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
const int MAX = 1000000;
int n, K;
int cnt_ijk[MAX * 3];
int cnt_jk[MAX * 2];
int r_cnt_jk[MAX * 2];
signed main() {
int s, i, j, k;
cin >> n >> K;
//j + k = s, 0 <= j, k < n
for (s = 0... |
//----------BHAVIK DIWANI(PICT_COMP)---------------
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int N, X;
cin >> N >> X;
X = X * 100;
vector<pair<int, int>> V;
for (int i = 0; i < N; i++)
{
int v, p;
cin >> v >> p;
V.push_back(make_pair(v,p));
}
int total_intake = 0;
f... |
#include <iostream>
#include <vector>
#include <queue>
#define rep(i, s, n) for(int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int A, B;
cin >> A >> B;
cout << 2 * A + 100 - B;
}
| #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define... |
#include <bits/stdc++.h>
using namespace std;
using tint = long long;
using ld = long double;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
using pi = pair<int,in... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <array>
#include <cassert>
#include <optional>
#include <utility>
#include <vector>
// #include <atcoder/all>
template <class InputIterator>
std::ostream& range_output(std::ostream& os_arg, InputIterator first_arg, InputIterator last_arg){ if(first_a... |
#include<bits/stdc++.h>
#define int long long
#define N 200005
#define MOD 1000000007
using namespace std;
int n,d[N],ans;
vector<int> to[N],w[N];
void add(int u,int v,int wt){to[u].push_back(v),w[u].push_back(wt);}
void dfs(int u,int fa){
for(int i=0,v;i<to[u].size();i++)
if((v=to[u][i])!=fa)d[v]=d[u]^w[u][i],dfs(v... | #include <bits/stdc++.h>
using namespace std;
#define ffor(i, a, b) for (int i = a ; i <= (int) b ; i++)
#define rfor(i, a, b) for (int i = (int) a ; i >= b ; i--)
#define vec vector
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
using ll = long long int;... |
// Coder: @SumitRaut
#include <bits/stdc++.h>
#define speedup ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr),cout.precision(12)
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tre... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
#define debug(x) cout << #x << " is " << x << endl
#define inc(i, a, b) for (int i = a; i <= b; ++i)
typedef long long ll;
const int INF = 0x3f3f3f3f;
int a, b, x, y;
int main()
{
scanf("%d%d%d%d", &... |
#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
class BIT {
public:
int size_ = 1;
vector<long long> bit;
void init(int sz) {
size_ = sz + 2;
bit.resize(size_ + 2, 0);
}
voi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
vector<ll> v;
vector<pair<ll,ll> > aj[2005];
bool vis[2005];
ll dist[2005];
priority_queue<pair<ll,ll> ,vector<pair<ll,ll> > ,greater<pair<ll,ll> > > pq;
ll dijkstra(ll x,ll n){
memset(vis,false,sizeof(vis));
ll maxn = 2e9,a,b;... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
cout<<N-1<<endl;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <climits>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <numeric>
#include <utility>
#include <complex>
#include <chrono>
using namespace std;
using namespace std:... |
#include <bits/stdc++.h>
using namespace std;
#define NMAX 200005
int n;
string s, x;
set <int> dp[NMAX];
int main() {
cin>>n;
cin>>s>>x;
dp[n].insert(0);
for(int i = n-1 ; i >= 0; i--){
if(x[i]=='T'){
for(int j=0;j<7;j++){
int p = (10*j)%7;
int q = ... | #include <bits/stdc++.h>
using namespace std;
void solveCase() {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
vector<bool> visit(26);
for (auto& c : s1) visit[c - 'a'] = 1;
for (auto& c : s2) visit[c - 'a'] = 1;
for (auto& c : s3) visit[c - 'a'] = 1;
vector<int> can;
for (int k = 0; k < 26; ++k) {
if ... |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <memory>
#include <list>
#include <deque>
#include <queue>
#include <iomanip>
using namespace std;
#define REP(i,n) for (decltype(n) i = 0; i < n;... | //To debug : g++ -g file.cpp -o code
//to flush output : fflush(stdout) or cout.flush()
//cout<<setprecision(p)<<fixed<<var
//use 1LL<<i to for 64 bit shifting , (ll)2 because by default 2 is ll
//take care of precedence rule of operators
//do not forget to change the sizes of arrays and value of contants and other t... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
#define ff first
#define ss second
#define pb push_back
#define all(v) v.begin(), v.end()
const ll inf = 2e18;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)... | #include <stdio.h>
#include <iostream>
#include <cmath>
#include <vector>
#include <numeric>
#include <string>
int main() {
int k;
std::cin >> k;
std::vector<int> v(10, k);
std::vector<double> tv(10, 0);
std::vector<double> av(10, 0);
int ta = 0;
int ao = 0;
std::string s;
std::cin >> s;
for (int c = 0; c... |
#include <algorithm>
#include <iostream>
using namespace std;
bool ans;
int A[5];
int main(){
cin >> A[1] >> A[2] >> A[3];
sort(A + 1,A + 1 + 3);
if (A[3] - A[2] == A[2] - A[1]) cout << "Yes\n";
else cout << "No\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
int main()
{ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll t=1;
// cin>>t;
while(t--){
ll i;
ll a,b,c,d;
cin>>a>>b>>c>>d;
cout<<b-c;
}
}
|
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3000 + 10;
const int s = (1 << 5) - 1;
const int N = 5;
int a[maxn][5];
int n;
int f[s + 10], g[s + 10], h[10][s + 10], fhat[10][s + 10], ghat[10][s + 10], fog[s + 10];
bool check(int x)
{
memset(f, 0, sizeof f);
memset(g, 0, sizeof g);
memset(h, 0, size... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
static const int IINF = (1LL << 31) - 1;
int main() {
ll n, x, a;
cin >> n >> x;
vector<ll> ans;
rep(i, n) {
cin... | #include <iostream>
using namespace std;
int n;
long long a[300000],b[300000];
long long maxa=-9999,maxx=-9999;
int main()
{
int i,j,k;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
for(i=1;i<=n;i++)
{
maxa=max(a[i],maxa);
cin>>b[i];
maxx=max(maxx,maxa*b[i]);
... |
#include<bits/stdc++.h>
using namespace std;
int n;
string s;
int main(){
scanf("%d",&n),cin>>s,s=" "+s;
if(s[1]!=s[n]){puts("1");return 0;}
for(int i=2;i<n-1;++i)if(s[i]!=s[1]&&s[i+1]!=s[n]){puts("2");return 0;}
puts("-1");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define Fi(a,n) for(int i = a; i < n; i++)
#define Fd(n,a) for(int i = n; i >= a; i--)
#define all(a) a.begin(), a.end()
#define pb push_back
void solve(){
int n;
cin >> n;
string s;
cin >> s;
if (s[0] != s[n-1]){
... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#define endl "\n"
#define int long long
int32_t main()
{
IOS;
int a, b, c;
cin >> a >> b >> c;
if (a * a + b * b < c * c) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n';
const ll nmax = 1000000007;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
ll ans = 0;
if(a == b){
ans = c;
}else if(b == c){
ans = a;
}... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int tsc=1;
//cin>>tsc;
while(tsc--){
int t,n;
cin>>t>>n;
int a=(n*... | #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+... |
#import<bits/stdc++.h>
#define endl '\n'
using namespace std;
struct H{int i,x,y,r;};
int n,x[204],y[204],a[10005][10005];
H e[204];
int C(H a,H b){return a.y<b.y||a.y==b.y&&a.x<b.x;}
int D(H a,H b){return a.i<b.i;}
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=0;i<n;i++)
{
e... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#ifdef local
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define pary(a...) danb(#a, a)
#define debug(a...) qqbx(#a, a)
template <typename ...T> void qqbx(const char *s, T ...a) {
int cnt = sizeof...(T);
((std::cerr << "\033[1;32m(... |
#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;
// template<typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#defi... | #include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <unordered_set>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll, ll>
using namespace std;
int n;
vector<vec... |
#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... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s,str;
cin>>s;
int n=s.size(),cnt=0,zero=0;
str=s;
reverse(str.begin(),str.end());
vector<char>v;
for(int i=n-1; i>=0; i--)
{
if(s[i]=='0')
{
zero++;
v.push_back(s[i]);
... |
//้ช่ฑ้ฃ้ฃๅ้ขจๅฏๅฏ
//ๅคฉๅฐไธ็่ผ่ซ
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... |
#include <bits/stdc++.h>
using namespace std;
int q, n;
map<int, int> cnt;
void increase(map<int, int>& cnt, int x) {
if (cnt.find(x) == cnt.end())
cnt.insert(make_pair(x, 0));
cnt[x]++;
}
int main() {
cin >> q;
while (q--) {
cnt.clear();
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN = 100005;
template <typename T> inline void read(T &AKGK) {
T x = 0, flag = 1;
char ch = getchar();
while(!isdigit(ch)) {
if (ch == '-') flag = -1;
ch = getchar();
}
while(isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar(... |
// Problem: A - Tax Included Price
// Contest: AtCoder - AtCoder Regular Contest 118
// URL: https://atcoder.jp/contests/arc118/tasks/arc118_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Author: abhidot
#include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);co... | #include<iostream>
#include<vector>
using namespace std;
long long T, N;
void read() {
cin >> T >> N;
}
void work() {
vector<pair<int, int> > t;
for (int i = 0; i < 100; ++i) {
int a = i * (100 + T) / 100;
int b = (i + 1) * (100 + T) / 100;
if (a + 1 < b) {
t.push_b... |
#include <bits/stdc++.h>
#define clr(x) memset(x,0,sizeof(x))
#define For(i,a,b) for (int i=(a);i<=(b);i++)
#define Fod(i,b,a) for (int i=(b);i>=(a);i--)
#define fi first
#define se second
#define kill _z_kill
#define y0 _z_y0
#define y1 _z_y1
#define x0 _z_x0
#define x1 _z_x1
#define pb push_back
#define mp(x,y) make_... | #include <bits/stdc++.h>
#include <string>
#define MAX 100007
#define scn1(a) scanf("%d", &a);
#define scn2(a, b) scanf("%d %d", &a, &b);
#define scn3(a, b, c) scanf("%d %d %d", &a, &b, &c);
#define lscn1(a) scanf("%lli", &a);
#define lscn2(a, b) scanf("%lli %lli", &a, &b);
#define lscn3(a, b, c) scanf("%lli %lli %lli"... |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
/*
int main(){
long long R,X,Y;
cin >> R >> X >> Y;
long long kyori = sqrt(pow(X,2) + pow(Y,2));
long ans = kyori/R;
if(po... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define print(x) cout << x << endl
#define all(v) (v).begin(),(v).end()
#define YN(ok) print((ok ? "YES" : "NO"))
#define yn... |
// Sajal Asati
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mkp make_pair
#define pf push_front
#define ff first
#define ss second
// #define endl "\n"
#define lpstl(i,v) for(auto &i: v)
#define all(a) a.begin(),a.end()
#define rall(x) (x).rbeg... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<int> b(m);
rep(i,m) {cin >> a.at(i); cin >> b.at(i);}
int k;
cin >> k;
vector<int> c(k);
vector<int> d(k);
rep(i,k) {cin >> c.at(i); cin >> d.... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long l... | #include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int> primeFactors(int n)
{
vector<int>ans;
// Print the number of 2s that divide n
while (n % 2 == 0)
{
ans.push_back(2);
n = n/2;
}
// n must be odd at this point. So we can skip
// on... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(R int i=a;i<=b;i++)
#define R register
#define endl putchar('\n')
const int N=500005;
const long long mod=1e9+7;
#define int long long
using namespace std;
int n,a[N],f[N][2],c[N][2];
void dp() {
f[0][0]=a[1],c[0][0]=1;
rep(i,1,n-1) {
f[i][0]=(f[i-1][0]+c[i-1][0]*a[i... | #include <bits/stdc++.h>
#include <string>
#include <cmath>
#include <sstream>
#include <unordered_map>
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for(ll i = (a-1); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ff first
#define ss second
#define spre cou... |
#include <bits/stdc++.h>
using namespace std;
string ans[20];
void output();
void init();
bool yokoni_dekirudake_umeru();
void yokoni_umeru(int,int);
double get_score();
int randomToSeisu(double,int);
double randxorsyosu();
void ten_umeru();
int n,m;
int used_m;
string next_s();
vector<string> s;
double now_max_score =... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <iomanip>
using namespace std;
using VI = vector <int>;
using VV... |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL)
#define int long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define pi 2*acos(0.0)
#define sca... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
constexpr long long INF = 1e9+100;
constexpr long long LINF = 1e18+100;
#define... |
#include <bits/stdc++.h>
#define f(i,x,y) for(int i=x; i<=y; ++i)
#define fn(i,x,y) for(int i=x; i>=y; --i)
using namespace std;
int a[5], b, n, m;
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
f(i,1,4) {cin >>a[i];... | #include <bits/stdc++.h>
using namespace std;
int main()
{
std::vector<int> cookies(4);
int total = 0;
for (int i = 0; i < 4; ++i) {
cin >> cookies[i];
total += cookies[i];
}
int eat;
bool flag = false;
for (int bit = 0; bit < (1<<4); ++bit) {
eat = 0;
for ... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> order_set;
typedef long long ll ;
#define rep(i, begin, end) for (__typeof(end) i = (begin) - (... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int check(string &s)
{
string ss="atcoder";
if(s>ss)
return 0;
for(int i=1;i<s.size();i++)
{
if(s[i]>'t')
return i-1;
if(s[i]>'a')
return i;
}
return -1;
}
int main()
{
int t;
cin>>t;
... |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
const ll INF=1LL<<60;
const string YYY="YES";
const string yyy="Yes";
const string NNN="NO";
const string nnn="No";... | # include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1... |
#include<bits/stdc++.h>
using namespace std;
int n;
char s[400011];
int f[400011];
int c3[400011];
int getc(int m,int k)
{
if(c3[m]>c3[k]+c3[m-k])
{
return 0;
}
return f[m]*f[k]*f[m-k]%3;
}
int main()
{
int i,j,k;
cin>>n;
cin>>s+1;
memset(f,0,sizeof(f));
memset(c3,0,size... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)... |
#include <bits/stdc++.h>
#define For(i, l, r) for (register int i = l, _r = r; i <= _r; ++i)
#define Ford(i, l, r) for (register int i = r, _l = l; i >= _l; --i)
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define mk make_pair
const int maxn = 105;
int n, k, mod, tp;
int dp[maxn][maxn * maxn ... | #include<iostream>
using namespace std;
bool test = false;
int h[30][29];
int w[29][30];
int si,sj,ti,tj,a,response;
double e;
string ans;
void init(){
for(int i=0;i<30;i++) for(int j=0;j<29;j++) scanf("%d",&h[i][j]);
for(int i=0;i<29;i++) for(int j=0;j<30;j++) scanf("%d",&w[i][j]);
}
void writeL(int n){for(int ... |
#include<cstdio>
#define mod 998244353
#define N 5001
#define M 51
using namespace std;
int n,m;
int stack[N];
long long f[M][N],jc[N],njc[N];
long long ksmi(long long x,long long y)
{
long long total=1,ab=x,p=y;
while (p)
{
if (p%2==1) total=total*ab%mod;
ab=ab*ab%mod;
p/=2;
}
return total;
}
long long C(in... | #include<iostream>
#include<vector>
using namespace std;
const long long int MAX = 3000;
const long long int MOD = 1000000007;
int main(){
long long int H,W,K=0;
long long int sum,ans=0;
vector<long long int> two;
string S;
bool F[MAX+2][MAX+2]={0};
long long int M[MAX+2][MAX+2][4]={0};
cin>>H>>W;
for(int i=1;i... |
#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 n;
vector<vector<int>> to;
vector<int> used, col, vs;
void dfs(int v){
if(used[v]) return;
used[v] = 1;
vs.push_back(v);
for(int u : to[v]) dfs(u);
}
ll now;
v... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9
#define linf 1e18
#define BASE 1000000
#define EPS 1e-10
#define PI acos(-1)
#define pii pair<int,int>
#define piii pair<int, pair<int,int>>
#define pli pair<long long, int>
#define pll pair<long long, long long>
#define pdi pair<doubl... | #include<iostream>
#include<vector>
#include<math.h>
#include<algorithm>
#include<stack>
#include<list>
#include<queue>
#include<set>
#include<string>
#include<string.h>
#include <sstream>
#include<map>
#include<iomanip>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unrol... |
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include<bits/stdc++.h>
#define Rushia_mywife ios::sync_with_stdio(0);cin.tie(0);
#define F first
#define S second
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define FL cout.flush()... | #include<iostream>
#include<algorithm>
#include<map>
#include<queue>
#include<cmath>
#include<stack>
#include<string>
#include<vector>
#include<set>
#define rep(i,n) for(int i = 0;i < n;i++)
using namespace std;
long long int powMod(long long int x, long long int k, long long int m) {
if (k == 0) return 1;
... |
#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>;
struct UnionFind {
vector<int> d;
UnionFind(int n=0): d(n,-1) {}
int find(int x) {
if (d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
x = fi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<vector<int64_t>> C(N, vector<int64_t>(N));
for (int64_t i = 0; i < N; i++) {
for (int64_t j = 0; j < N; j++) {
cin >> C[i][j];
}
}
vector<int64_t> diff(N - 1);
for (int64_t i ... |
#include<bits/stdc++.h>
typedef long long ll;
ll n,k,a[205];
ll ans;
using namespace std;
int main()
{
cin>>n;
for(int i=0; i<205; i++)
{
a[i]=0;
}
for(int i=0; i<n; i++)
{
cin>>k;
a[k%200]++;
}
ans=0;
for(int i=0; i<205; i++)
{
k=a[i]*(a[i]-1)/2;
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int T;
cin >> T;
while(T--)
{
int N;
cin >> N;
map<int,int> mp;
for(int i = 0 ; i < N ; i++)
{
int n;
cin >> n;
mp[n]... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ff first
#define ss second
typedef long long ll;
ll power(ll a, ll b){//a^b
ll res=1;
a=a%MOD;
while(b>0){
if(b&1){res=(res*a)%MOD;b--;}
a=(a*a)%MOD;
b>>=1;
}
return res;
}
ll fermat_inv(ll y){return... | #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;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) cin >> x;
a.push_back(0);
sort(a.begin(), a.end());
int64_t ans = 1;
constexpr int64_t mod = 1e9 + 7;
for (int i = 1; i < a.size(); ++i) ans = ans * (a[i] - a[i-1] + 1) % mo... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... |
#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;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<double> ... |
#include <bits/stdc++.h>
using namespace std;
template <class A, class B> bool cmin(A& a, B b) { return a > b && (a = b, true); }
template <class A, class B> bool cmax(A& a, B b) { return a < b && (a = b, true); }
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
long N;
cin >> N;
vector<tuple<long, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N){
set<ll> se;
for(ll i = 2;i <= sqrt(N) + 10;i++){
ll _i = i * i;
for(;_i <= N;_i *= i){
/*
if(_i == 0){
exit(0);
}
*/
//cout<... |
#include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long ll;
type... | #pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define rsrt(v) sort(v.begin(), v.end(), greater<int>())
#define rsrtl(v) sort(v.begin(), v.end(), greater<ll>())
#define fi(i, a, b) for (int i = a; i < b; i++)
#define fll(i, a, b) for (ll i = a; i < b; i++)
#define srt(v... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9+7;
int main(){
int N; cin >> N;
vector<ll> A(N), sum(N+1);
for(int i=0; i<N; i++){
cin >> A[i];
sum[i+1] = sum[i]+A[i];
}
vector<vector<int>> dp(N+2,vector<int>(N+2));
dp[1][0]++;
int ans... | #include<bits/stdc++.h>
//#pragma GCC optimize "trapv"
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define fast_az_fuk ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define lll __int128
#define ull u... |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
#include <map>
#include <memory>
#include <list>
#include <deque>
#include <queue>
#include <iomanip>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_set>
#include <unordered_map>
#inc... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll po(ll x,ll n){
ll i,ans=1;
for(i=0;i<n;i++){
ans*=x;
}
return ans;
}
int main(){
ll n,i,j;
cin >> n;
for(i=1;i<=38;i++){
for(j=1;j<=27;j++){
if(po(3,i)+po(5,j)==n){
printf("%lld %lld\n",i,j... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define vi vector <int>
#define vp vector <pair<int,int>>
#define f(x,y,z) for(x=y;x<z;x++)
#define pb push_back
#define mp make_pair
#define ld long double
#define fb(x,y,z) f... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int T; cin >> T;
string U = "atcoder";
while(T--){
string S; cin >> S;
int N = S.size();
bool alla = true;
for(int i = 0; i < N; i++){
if(S.at(i) != 'a') alla = false;
}
if(alla){
cout... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int prime[20] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
//rep(i, 20) cout << i << " " << prime[i] << "\n";
ll A, B;
cin >> A >> B;... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
typedef long long lint;
usi... |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<bitset>
using namespace std;
int main(int argc, char *argv[])
{
int n, k;
cin >> n >> k;
int sum = 0;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= k; j++) {
sum += i * 100 + j;
}
}
cout <<... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdlib.h>
#include <math.h>
#include <numeric>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
cout << (1 + N) * N / 2 * K * 100 + (1 + K) * K / 2 * N;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int k;
long long x;
int main()
{
scanf("%lld%d",&x,&k);
while(k--)
{
if(x%200) x=x*1000+200;
else x/=200;
}
printf("%lld",x);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se ... |
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(a) a.begin(), a.end()
#define sz(x) x.size()
#define yn(p) cout << (p?"Yes":"No") << endl;
using namespace std;
using ll = long long;
us... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,w;
cin >> n >> w;
cout << n/w <<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
int64_t M,z=0;
cin>>S>>M;
int64_t N=S.size(),K=*max_element(S.begin(),S.end())-'0';
if(N<2){
cout<<(M<K?0:1);
return 0;
}
int64_t ok=0,ng=M+10;
while(ng-ok>1){
__int128 m=(ok+ng)/2,sum=0,temp=1,l=0;
for(int j=N-1;j>=0;te... | #include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
char x[110];
std::vector<int> V;
int main()
{
long long int b;
scanf("%s",x+1);
scanf("%lld",&b);
int a = strlen(x+1);
if(a==1)
{
if(x[1]-'0'<=b) printf("1");
else printf("0");
return 0;
}
for(int i=1;i<=a;i++) V.push_back(x... |
#include<bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define ll long long
#define rep(i,n) for (int i = 0; i < (n); i++)
int main()
{
int N... | #include <bits/stdc++.h>
#define sort stable_sort
using namespace std;
int _;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int n,ans,cnt[26][100050];
string s,str="ATCG";
int main()
{
//for(scanf("%d",&_);_;_--)
scanf("%d",&n);
cin >> s;
for(int i=1;i <= n;i++)
for(int j=0;j<4;j++... |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); +... | // Problem: C - MAD TEAM
// Contest: AtCoder - ZONe Energy Programming Contest
// URL: https://atcoder.jp/contests/zone2021/tasks/zone2021_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii =... |
// Author : heyuhhh
// Created Time : 2020/12/18 17:02:09
#include<bits/stdc++.h>
#define MP make_pair
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;... | #include<bits/stdc++.h>
using namespace std;
const int N = 500000 + 10;
int n, a[N], x;
void Solve() {
scanf("%d %d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
if (x != a[i]) {
printf("%d ", a[i]);
}
}
}
int main() {
#ifndef ONLINE_JUDGE
freopen("... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
void solve()
{
int a[4];
int mx=INT_MAX;
int ans=INT_MAX;
for(int i=0;i<4;i++)
{
cin>>a[i];
if(a[i]<ans)
{
ans=a[i];
}
}
cout<<ans<<endl;
}
int main(){
sol... | #include<iostream>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<vector>
#include<math.h>
#define rep(i,n) for (int i = 0, i < n; i++)
using namespace std;
int main(){
int a,b,w;
cin >> a >> b >> w;
w *= 1000;
int kmax = floor(double(w)/a), kmin = ceil(d... |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#inc... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tre... |
//QwQcOrZ yyds!!!
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include... | // Problem:
// F - Close Group
//
//
// Contest: AtCoder - AtCoder Beginner Contest 187
// URL: https://atcoder.jp/contests/abc187/tasks/abc187_f
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using ... |
#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 big ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>>ve;
int N,l,r,L,R;
long long LL,RR,tr,tl;
string getss(){//็จgetchar()่ฏป... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define Test int T;cin>>T;while(T--)
#define PI acos(-1)
#define endl "\n"
#define fx(x) fixed<<setprecision(x)
#define sz(s) (int)s.size()
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define mem(a,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a,b,c;
cin>>a>>b>>c;
if(c==0)
{
if(a<=b)
{
cout<<"Aoki\n";
}
else
cout<<"Takahashi\n"... |
#include <bits/stdc++.h>
#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii... | #include <bits/stdc++.h>
using namespace std;
int main() {
long a,b,x,y,ans;
cin>>a>>b>>x>>y;
ans=0;
if(a-b==1 || a==b){
ans=x;
}
else if(a>b){
ans=x+min(y,2*x)*(abs(a-b)-1);
}
else{
ans=x+min(y,2*x)*(abs(a-b));
}
cout<<ans;
} |
#include<bits/stdc++.h>
using namespace std;
int n,m,h[200003],w[200003];
long long sum[2][200003],ans=2333333333333333;
int main(){
cin>>n>>m;
for(int i=0;i<n;i++)
scanf("%d",h+i);
for(int i=0;i<m;i++)
scanf("%d",w+i);
sort(w,w+m);
sort(h,h+n);
for(int i=0;i+1<n;i+=2)
sum[0][i+2]=sum[0][i]+h[i+1]-h[i];
fo... | #include<bits/stdc++.h>
#define LL long long
#define ull unsigned long long
#define F(i,j,k) for(int i=(j);i<=(k);i++)
#define DF(i,j,k) for(int i=(j);i>=(k);i--)
#define P pair
#define dui priority_queue
using namespace std;
template<typename T>inline void read(T &n){
T w=1;n=0;char ch=getchar();
while(!isdigi... |
#include <bits/stdc++.h>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define P pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define mp make_pair
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##... | #include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define me0(a) memset(a,0,sizeof(a))
#define me1(a) memset(a,-1,sizeof(a))
#define op freopen("in.txt", "r", stdin)
#define op1 freopen("C:\\acm\\Cproj\\in.txt","r",stdin);
#define pr freopen("C:\\acm\\Cproj\\out.t... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
using namespace std;
typedef long long ll;
vector<ll> X, C;
vector<array<ll, 2>> v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n; cin >> n; X.resize(n);
C.resize(n); v.resize(n + 1, { (1 << 30), -(1 << 30) });
f... | #include <iostream>
#include <vector>
#include <map>
#include <stack>
#include <string>
#include <algorithm>
#include <set>
#include <sstream>
#include <time.h>
#include <bitset>
#include <iomanip>
#include <queue>
#include <assert.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rew(i... |
//Har Har Mahadev
using namespace std;
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#ifdef bhole_ka_saaya
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define booga cerr << "booga" << endl
#else
#define debug(...)... | #include <cstdio>
#define uint unsigned int
#define i64 long long
#define u64 unsigned i64
int Max(int a, int b) { return (a > b) ? a : b; }
int Min(int a, int b) { return (a < b) ? a : b; }
int rint()
{
int x = 0, fx = 1; char c = getchar();
while (c < '0' || c > '9') { fx ^= (c == '-' ? 1 : 0); c = getchar(); }
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define vec2(name,i,j,k) vector<vector<ll>> name(i,vect... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb(x) push_back(x)
#define mp make_pair
#define sz(x) (int)x.size()
#define mem(x ,y) memset(x , y , sizeof x )
#define all(a ) a.begin() , a.end()
#defin... |
#include <bits/stdc++.h>
#define Rep(i,n,m) for(int i=(int)(n);i<(int)(m);i++)
#define rep(i,n) Rep(i,0,n)
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define _GLIBCXX_DEBUG
int main(){
int N;cin>>N;
vector<int> a(N); rep(i,N) cin >> a[i];
... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s, t, tmp;
cin >> s;
bool flag = false;
for(int i = 0; i < (int)s.size(); ++i){
if(s[i] == 'R'){flag = !flag;}
else if(s[i] != 'R' && flag == false){t += s[i];}
else{t.insert(0, {s[i]});}
}
if(flag == true){reverse(t.begin(), t... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <... | #include<bits/stdc++.h>
#include<string>
using namespace std;
//functions like ceil() and floor() are used to truncate the decimal values
//countsort is great
#define ll long long
#define int long long
#define vi vector<int>
#define vlli vector<ll>
#define pii pair<int,int>
#define pb push_back
#define mpr make_pair... |
#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 ll long long
#define FI first
#define SE second
#define pb push_back
#define eb emplace_back
#define mod 998244353
#define all(c) (c).begin(),(c).end()
#defin... | #include<iostream>
using namespace std;
typedef long long int ll;
const int mod = 998244353;
int n;
ll fact[5001],inv[5001];
ll dp[5001][51];
ll po(ll a, int p){
if(p==0) return 1ll;
ll ret=po(a,p/2);
ret=ret*ret%mod;
if(p%2) ret=ret*a%mod;
return ret;
}
ll ncr(int n, int r){
return (fact[n]*inv[n-r]%mod)*inv[r]%... |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
// mod. m ใงใฎaใฎ้ๅ
a^{... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int T;
ll N;
const ll MOD = 998244353;
ll mult(ll a, ll b){
return (a*b)%MOD;
}
ll fexp(ll ... |
#include <bits/stdc++.h>
#include <unordered_set>
#include <algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i,n)... | #include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=1e2+10;
int arr[maxn];
string s;
int n;
bool judge(int x){
for(int i=0;i<n;i++){
int a=arr[i]/x,b=arr[i+1]/x;
int aa=arr[i]%x,bb=arr[i+1]%x;
if(s[i]=='<'){
if(a>=b) return false;
... |
#include <bits/stdc++.h>
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pb push_back
#define pob pop_back
#define pof pop_front
#define pf push_front
#define mp make_pair
#define... | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (c == 0) {
if (a > b) {
cout << "Takahashi" << endl;
} else {
cout << "Aoki" << endl;
}
} else {
if (a < b) {
cout <<... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#include <atcoder/convolution>
//#incl... | #include<bits/stdc++.h>
using namespace std;
#define Mod(x) ((x>=P)&&(x-=P))
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(int i=hd[a];i;nxt[i])
typedef long long ll;
void Max(int &x,int y){(x<y)&&(x=y);}
void Min(int &x,int y){(x>... |
/*
author : TAPAN SAVANI
codeforces : savanitapan2001
codechef : savanitapan17
*/
/*
------------------------------------------------------------------------
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโ... | #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=int(a),i##_len=(b);i<i##_len;++i)
#define MSVC_UNKO(x)x
#define rep(...)MSVC_UNKO(_overload3(__VA_ARGS__,repi,_rep,_rep)(__VA_ARGS__))
#define all(c)c.begin(),c.end()
#define write(x)cout<<(x)<<'... |
#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,m,x,y;
cin>>n>>m;
map<int,vecto... | // #pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
// #pragma GCC optimize(3 , "Ofast" , "inline")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization("unroll-loops")
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <unordered_... |
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
using namespace std;
const int N=2e3+100,INF=0x3f3f3f3f;
char g[N][N];
int st[N][N];
int main(){
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
scanf("%s",g[i]+1);
int ans=0;
for(int i=1;i<n;i++){
for(int j=1;j<=m;j++){
if(g[i][j]!=g[i+1][j]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sz(s) (int)s.size()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) a.begin(),a.end()
#define allr(a) a.rbegin(),a.rend()
#define rep(i,a,b) for(int i = a; i... |
#include <bits/stdc++.h>
#define li long long int
#define lp(i,a,b) for(li i=a;i<b;i++)
using namespace std;
const li inf = 1e18+7;
void solve(){
li n,m,mn=inf,ans=0;
cin>>n>>m;
li a[n][m];
lp(i,0,n)
lp(j,0,m){
cin>>a[i][j];
mn=min(a[i][j],mn);
}
lp(i,0,n)
... | #include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#in... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... | #include <bits/stdc++.h>
using namespace std;
// using namespace atcoder;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define gcd __gcd
#define int long long
#define double long double
const int INF = 1e18, MOD = 1e9 + 7;
int pow(int x, int n) {
return n < 1 ?... |
#include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 998244353
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#defin... | //#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;
template<typename T> using... |
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops, no-stack-protector")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
cons... | #include <vector>
#include <set>
#include <iostream>
#include <algorithm>
#include <string>
#include <utility>
#define mod % 998244353
#define MAX 998244353
#define ll long long
using namespace std;
int main() {
int high,wide,k;
cin >> high;
cin >> wide;
cin >> k;
ll ans = 0;
if(high == wide and high == 1... |
#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 = 1000000007;
//998244353;
void randinit(){srand((unsigned)time(NULL));}
int main(){
ll t,N;
cin >> t >> N;
ll c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main()
{
ll n;
int k;
cin >> n >> k;
for (int i = 0; i < k; i++)
{
if (n % 200 == 0)
n /= 200;
else
n = n * 1000 + 200;... |
#define MOD_TYPE 2
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n);i++)
using ll = long long;
const ll INF = 1e9+7;
using P = pair<int,int>;
int main(){
int h,w;
cin >> h >> w;
vector<vector<char>> s(h,vector<char>(w));
rep(i,h)rep(j,w) cin >> s[i][j];
int ans =0;
for(int i=1; i<... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
#define bit(n,k) ((n>>k)&1) //nใฎkใbit็ฎ
#define vec(T) vector<T>
#define vvec(T) vector<vector<T>>
using ll = long long;
using ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 100000000000000000
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265
#define pb push_back
#define LLMX LONG_LONG_MAX
#define LLMN LONG_LONG_MIN
#define double long double
int n ;
vector < int > arr ;
sig... |
//yjy is sb
#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
#define pb push_back
#define re register int
#define fr first
#define sd second
#define pa pair<int,int>
#define FOR(i,a,b) for(re i=a;i<=b;i++)
#define REP(i,a,b) for(re i=a;i>=b;i--)
#define MEM(a) memset(a,0,sizeof(a))
using na... | #include <iostream>
#include <vector>
using namespace std;
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.