code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(void){
// Your code here!
long long a,b,x,y;
cin >> a >> b;
//y=a-b/2
//x=a/2+b/2
x = (a+b)/2;
y = (a-b)/2;
cout << x << " " << y << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = -100; i <= 100; i++) {
for (int j = -100; j <= 100; j++) {
if (i + j == a && i - j == b) {
cout << i << " " << j << endl;
return 0;
}
}
}
}
|
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using n... | #pragma region
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
// DEBUG LIBRARY
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long... |
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int Maxn=100000+10;
int a[Maxn],f[Maxn<<2];
int n,m;
inline int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0' || ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0' && ch<='9')s=(s<<3)+(s<<1)+(ch^48),ch=getchar()... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = v... |
#include <bits/stdc++.h>
#define reint int
#define coint const int
using namespace std;
typedef long long ll;
coint SIZE = 500 + 5;
int n;
ll li[SIZE][SIZE];
ll deltA[SIZE], deltB[SIZE];
int main(void) {
scanf("%d", &n);
for (reint i = 1; i <= n; ++i)
for (reint j = 1; j <= n; ++j)
sca... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n;
vector<int> pr;
vector<int> ans;
bool prime[10001];
bool used[10001];
void dfs(int v,int sum){
if(ans.size()==n)return;
if(v==pr.size())return;
//printf("%d %d %d\n",v,sum,pr[v]);
int ko=pr... |
///In the name of GOD
#include<bits/stdc++.h>
#define kill() return cout << -1, 0;
using namespace std;
typedef long long ll;
const ll MXN = 2e5 + 10;
ll n;
ll A[MXN];
vector<ll> ANS, vec;
int main(){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i ++) cin >> A[i];
f... | #include <bits/stdc++.h>
#define lli long long int
#define vec2 vector<vector<lli>>
#define fio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define FRE freopen("explicit.in","r",stdin);freopen("explicit.out","w",stdout)
#define pll pair <lli,lli>
#define vll vector <lli>
#define vpll vector <pll>
#define f ... |
#include<bits/stdc++.h>
#define R register
#define CN const
#define int long long
#define rint R int
#define cint CN int
#define sib 1048576
char buf[sib],*p1,*p2;
#define uc (p1==p2&&(p2=(p1=buf)+fread(buf,1,sib,stdin),p1==p2)?0:*p1++)
char pbuf[sib],*pp=pbuf;
inline void ph(const char s) {
if(pp-pbuf==sib)fwrite(pbu... | /*
Solved by sid2104
on 11/11/2020 22:32
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define float long double
#define pb push_back
#define ld long double
#define f(i,a,b) for(int i=a;i<b;i++)
#define mp make_pair
#define pii pair<int,int>... |
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef pair<int, int> pi;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define pb push_back
#define ... | #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_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_st... |
#include <bits/stdc++.h>
#define forn(i,n) for(int i=0;i<(int)n;i++)
#define forx(i,x,n) for(int i=x;i<(int)n;i++)
#define ce(e,i,n) cout<<e<<" \n"[i==(int)n-1];
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int N=5e2+2;
int a[N][N],vis[N][N],dr[4]={1,0,-1,0},dc[4]... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
unsigned long long int N;
cin>>N;
unsigned long long int minans=2100000000000000000;
unsigned long long int rui2=1;
for(int i=0;i<64;i++){
minans=min(minans,N/rui2+i+(rui2... |
#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<=(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
typedef pair<int,int> ii;
const int N = 2005;
int n,a[N];
map<int,int> l... |
#include<iostream>
using namespace std;
int main()
{
int a;
cin>>a;
int b;
cin>>b;
int c;
cin>>c;
int d;
cin>>d;
int x =0;
x = (a*d)-(b*c);
cout<<x;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=0;i<n;i++)
#define fors(i,s) for(int i=0;i<s.size();i++)
#define forn(i,n) for(int i=1;i<=n;i++)
#define nl "\n"
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//test
{
int a,b,c,d;
... |
#include<bits/stdc++.h>
using namespace std;
const int BS=1e5+5;
char buf[BS],*S,*T;
inline char gc(){
if(S==T)T=(S=buf)+fread(buf,1,BS,stdin);
return S!=T?*(S++):EOF;
}
inline int in(){
int x=0,f=1;char c=gc();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=gc();}
while(c>='0'&&c<='9')x=x*10+c-48,c=gc();
return x*f;
}
con... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1<<24;
const ll INFL = (1ll << 60);
//cout << setprecision(20) <<
int n;
int coord[17][3];
int dp[1 << 17][17];
int rec(int S, int v) {
if (dp[S][v] >= 0) {
return dp[S][v];
}
if (S ==... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
string s[505];
const int MOD = 998244353;
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(10);
cout << fixed;
int n, m;
cin >> n >> m;
for(int i=0; i<n; i++){
cin >> ... | //g++ 7.4.0
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define MAXN 3001
ll dp[MAXN][MAXN];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N; cin>>N;
ll arr[N + 1];
for(ll i=0;i<N;++i)
cin>>arr... |
#include <iostream>
#include <string>
#include <vector>
int main(int argc, char *argv[]) {
int h, w;
std::cin >> h >> w;
std::vector<std::string> ss(h);
for (int i = 0; i < h; ++i) {
std::cin >> ss[i];
}
int count = 0;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (ss[i].... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define LAR(a, b) ((a)=max((a),(b)))
#define SML(a, b) ((a)=min((a),(b)))
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
const int INF = 1LL<<30;
struct edge{int to, cost;};
typedef pair<int,int> P;
struct graph{
int V;
vector<vector<edge> > G;
vector<int> d;
graph(int n){
init(n);
}
void init(int n){
V = n;
G.resize(V);
d.re... | /* ุจูุณูู
ู ุงููููููู ุงูุฑููุญูู
ูููฐูู ุงูุฑููุญููู
ู
( ุฅููู ุงููุญูููู
ู ุฅููููุง ููููููู )
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef unsigned long long ull;
typed... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a,b,c;
string ans;
cin >> a >> b >> c;
if(a * a + b * b < c * c)
ans = "Yes";
else
ans = "No";
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int a,b,c;
cin>>a>>b>>c;
if((a*a + b*b)<(c*c)){
cout<<"Yes\n";
}else
cout<<"No\n";
}
|
#include "bits/stdc++.h"
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long
#define ld long double
const int mod = 1e9 + 7;
const int inf = 1e18;
#define vi vector<int>
#define vs vector<string>
#d... | #include"bits/stdc++.h"
using namespace std;
using ll=long long;
template<class T=ll>inline T in(istream&is=cin){T ret;is>>ret;return ret;}
template<class T,class Size=typename vector<T>::size_type>inline auto vector_2d(Size h,Size w,T v){return vector<vector<T>>(h,vector<T>(w,v));}
template<class T>auto comp_pairs_by_... |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T>
typedef tree<T, null_typ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll N=1000000007;
//ll power(ll a,ll b,ll mod)
//{
// ll result=1;
// while(b>0)
// {
// if(b%2==1)
// result=(result*a)%mod;
// a=(a*a)%mod;
// b=b/2;
// }
// return result;
//}
//ll d,x,y;
//void extendedE... |
#include <bits/stdc++.h>
#define kyou using
#define mo namespace
#define kawaii std
kyou mo kawaii; // hi honey~
#define ll long long
#define ld long double
#define endl "\n"
const int MX = 100005;
const int LG = (int)log2(MX) + 1;
const int BLOCK = 205;
const int inf = 1000000069;
const ll inf_ll = 80000000000000... | #include <bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int64_t a=0;a<b;a++)
#define sor(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define ll int64_t
#define mod 1000000007
#define vl vector<int64_t>
#define vc vector<char>
#define vs vector<string>
#define np(vec) next_permutation(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
ll n ; cin>>n;
ll x = ((1.08)*(n));
if(x == 206){
cout<<"so-so"<<endl;
}
else{
if(x > 206){
cout<<":("<<endl;
}
else{
cout<<"Yay!"<<endl;
}
}
}
int main(){
solve(... | /* -> Written by <-
-----------
|K_A_Z_A_M_A|
|___________|
| ___ |
| (^_^) |
| /( | )\ |
|____|_|____|
H O A N G
*/
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define Task ""
#define F first
#defin... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <typename T>bool chmin(T &a, c... | #include "bits/stdc++.h"
using namespace std;
#define endl '\n'
#define debug(x) cerr << #x << " == " << (x) << '\n';
#define all(x) begin(x), end(x)
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
template<ll mod>
struct Mint {
ll x;
Mint(ll x = 0) : x((x %= mod) < ... |
#include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define moca(a, s, b) a=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T ... | // Template
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <tuple>
#include <utility>
#include <queue>
#include <set>
#include <map>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (i... |
#include <bits/stdc++.h>
using namespace std;
template <typename T> using triple = std::tuple<T, T, T>;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(17);
int n;
cin >> n;
vector<int> X(n), Y(n);
for(int i = 0; i < n; i++) {
cin >> X[i] >> Y[i];
}
vector<triple<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for... |
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ullvect2d = vector<vector<ull>>;
using pairsull = pair<string,ull>;
#define loop(i,n) for(ull i=0;i<n;i++)
ull x,y;
ullvect2d tile(50, vector<ull>(50));
ullvect2d score(50, vector<ull>(50));
vector<ull> tap;
bool has(ull x){
auto it... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define int long long int
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#defi... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#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,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#d... | #include<bits/stdc++.h>
using namespace std;
//dengyaotriangle!
const int maxn=200005;
int n;
vector<int>adj[maxn];
int dp[maxn],dpt[maxn];
int mxv,mu,mv;
void dfs(int u,int f){
dp[u]=0;dpt[u]=u;
for(int v:adj[u])if(v!=f){
dfs(v,u);
if(dp[u]+dp[v]+1>mxv){
mxv=dp[u]+dp[v]+1;
... |
#include<bits/stdc++.h>
using namespace std;
struct _IO{_IO(){ios::sync_with_stdio(0);cin.tie(0);}}_io;
#pragma GCC optimize(2)
#define int ll
using ll = long long;
using db = long double;
using pi = pair<int, int>;
using mi = map<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define eb emplace... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma warning(disable : 4996)
//#define ATCODER
#ifdef ATCODER
#include<atcoder/all>
using namespace atcoder;
#endif
#include <algorithm>
#include <utility>
#include <vector>
#include <limits.h>
#include <math.h>
#include <t... |
/*
problem :
algorithm :
created : Programmer_juruo
*/
#include <bits/stdc++.h>
using namespace std;
#define int unsigned long long
#define N 100005
#define lowbit(x) x & (-x)
#define Rep2(i, n) for(int i = 1; i <= n; i++)
#define rep(i, a, n) for(int i = a; i <= n; i++)
#define Rep(i, n) for(int i = 0; i < n; i++)... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
int mul(int a,int b,int m){
int cur=0;
while(b>0){
if(b&1)cur+=a;
if(cur > m){
return -1;
}
a*=2;
b/=2;
if(b>0 and a > m){
return -1;
}
}
return cur;
}
bool solve(int base,string &x,int m){
int num=0;
i... |
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a), i##_END_ = (b); i <= i##_END_; ++i)
#define DNF(i, a, b) for (int i = (a), i##_END_ = (b); i >= i##_END_; --i)
template <typename Tp> void in(Tp &x) {
char ch = getchar(), f = 1; x = 0;
while (ch != '-' && (ch < '0' || ch > '9'... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define ff first
#define ss second
#define vll vector<ll>
#define pii pair<ll,ll>
#define sz(v) (v).size()
#define srt(v) sort(v.begin(),v.end... | #include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;
typedef unsigned long long ull;
typedef long ... |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
double Round(double x, int d) {
int mul = 1;
while (d--) {
mul *= 10;
}
x *= mul;
if (x >= 0) {
return floor(x + 0.5) / mul;
} else {
return ceil(x - 0.5) / mul;
}
}
int main() {
int A,... | /**
Failing doesnโt give you a reason to give up,
as long as you believe.
- Seventh Hokage
(COPIED TEXT FROM BABUMOSHAI)
**/
#include <bits/stdc++.h>
#include <algorithm>
#include <string>
using namespace std;
//#include <ext/pb_ds/assoc_co... |
#include<iostream>
using namespace std;
typedef long long li;
#define LIM 2000000000000000000
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n,i,q,x,lx,ly,rx,ry,d,ans;
cin >> n;
vector<long long> a(n),t(n);
for(i=0; i<n; i++){
cin >> a[i] >> t[i];
}
lx=-1000000000000000000; ly=-1000000000000000000;
rx=1000000000000000000; ry=1000000000000000000;
for(i=0; i<n; i++){
if(t[i]==1)... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
int d = min(a, b);
a -= d;
b -= d;
if (c == 0) {
cout << (a?"Takahashi\n":"Aoki\n");
}
else if (c == 1) {
cout << (b?"Aoki\n":"Takahashi\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 41;
typedef long long LL;
LL a[1 << (MAX_N / 2)], b[1 << (MAX_N / 2)];
LL item[MAX_N];
int generate_item(LL* s, int beg, int end) {
int len = 1 << (end - beg);
for (int i = 0; i < len; i++) {
for (int j = beg; j < end; j++)
s... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=200010; //check the limits, dummy
int a[N];
int n, m;
int main(){
scanf("%d",&n);
n-=3... |
/*ver 7*/
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... | #include <stdio.h>
int n;
int h[256][256];
int main() {
scanf("%d", &n);
h[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < (1 << i); j++) {
for (int k = 0; k < (1 << i); k++) {
h[j + (1 << i)][k] = h[j][k];
h[j][k + (1 << i)] = h[j][k];
h[j + (1 << i)][k + (1 << i)] = -h[j][k];
}
}... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
typedef long long int ll;
typedef long double ld;
const int inf = 10000;
struct Point {
int x;
int y;
};
struct Rect {
Point start;
Point end;
};
int main() {
int n;
cin >> n;
vect... | #include "bits/stdc++.h"
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define vi vector <int>
#define ff first
#define ss seco... |
/* JAI SHREE RAM */
#include <bits/stdc++.h>
using namespace std;
// Big two primes
#define X 1001100011100001111ll
#define mod 1000000007
#define int long long
#define ll long long
#define all(a) a.begin(),a.end()
#define sortall(a) sort(all(a))
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n... | #include <iostream>
#include <cassert>
#include <numeric>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
using Graph = vector<vector<int>>;
using ll=long long;
using pa=pair<ll,ll>;
in... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
typedef long long ll;
template <typename T>
void read(T &x) {
T flag = 1;
char ch = getchar();
for (; '0' > ch || ch > '9'; ch = getchar())
if (ch == '-')
flag = -1;
for (x = 0; '0' <= ch && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
template<class T>
bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template<class T>
bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
using ll = long long;
usi... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define endl "\n"
#define deb(x) cout<<#x<<" "<<x<<endl;
#define sc(ar,n) for(int pen=0;pen<n;pen++){ cin>>ar... | #include <bits/stdc++.h> // include every standard library
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef p... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include <iostream>
using namespace std;
#define ll long long
#define pb push_back
#define rep(i,n) for(long long int i=0;i<n;i++)
#define repl(i,L,R) for(long long int i=L;i<=R;i++)
#define vc std::vector<char>
const long long int MOD=1e9+7;
const char nl='\n';
#define vli std::vector<long long int>
#define sc std... |
#include <iostream>
using namespace std;
int a, b, c, p, ans = 1;
int ksm(int b, int c) {//ๅฟซ้ๅนๆฑb^c
int ans = 1;
for (int i = b; c; i = 1ll * i * i % p, c >>= 1) {
if (c & 1) {
ans = 1ll * ans * i % p;
}
}
return ans;
}
int main() {
cin >> a >> b >> c;
a = a % 10;
if (a == 0 || a == 1 || ... | #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 <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t result=0, sur[200];
memset(sur, 0, sizeof(sur));
cin >> N;
for(int i = 0; i < N; i++) {
int n;
cin >> n;
sur[n%200]++;
}
for(int i = 0; i < 200; i++) {
result += sur[i] * (sur[i]-1) / 2;
}
cout << resu... | #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... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define PI (2*acos(0.0))
#define eps 1e-9
#define pb push_back
#define endl "\n"
#define watch(x) cout << (#x) << " is ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define all(a) (a).begin(),(a).end()
#define sz(x) (x).... |
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
#include<string>
#include<vector>
#include <algorithm>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<bitset>
using namespace std;
int main() {
int a, b, c;
cin >> a >... | #include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=1;i<=(n);++i)
#define rep3(i,i0,n) for(ll i=i0;i<(n);++i)
#define rrep(i,n) for(ll i=((n)-1); i>=0; --i)
#define rrep2(i,n) for(ll i=(n); i>0; --i)
#define pb push_back
#define mo... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<utility>
#include<cstdio>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include <bitset>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
const int mod=1e9+7;
#define rep(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n, k;
cin >> n >> k;
ll ans = 0;
rep... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
int main(void)
{
ll N;
cin >> N;
int k = 0;
vector<int> a;
while(N > 0)
{
a.push_back(N%10);
N /= 10;
++k;
}
int ans = -1;
for (int bit = 0;... | #include <algorithm>
#include <iostream>
using namespace std;
int dfs(long long n, int p, int q, int r) {
if (n == 0) {
return p > q && r % 3 == 0 ? q : 100;
} else {
return min(dfs(n / 10, p + 1, q, r + n % 10), dfs(n / 10, p + 1, q + 1, r));
}
}
int main() {
long long n;
cin >> ... |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(obj) (obj).begin(),(obj).end()
#define debug(var) do{std::cout << __LINE__ << "> " << #var << ": ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T>... | //By Vasu Agrawal
#include<iostream>
#include<bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define pob pop_back
#define mk make_pair
#define fr first
#define sc second
#define pu push
#define ins insert
#define mod 1000000007
#define mem(a,val) memset(a,val,sizeof(a))
#define V(a) vector<a>
#define pp... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template<class T> bool chmin(T& a,T b){if(a>b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b){if(a<b) {a = b; return true;} return fa... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define FOR(i,a,b,c) for(int i=a;i<b;i+=c)
#define REV(i,a,b,c) for(int i=a;i>=b;i-=c)
#define all(x) x.begin(),x.end()
#define Dhruv main
const int pinf=LLONG_MAX;
const int ninf=LLONG_MIN;
const int mod=100000... | #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 ... |
/*
https://atcoder.jp/contests/abc198/tasks/abc198_d
้กๆ๏ผ
่ผธๅ
ฅไธๅๅญ็ฌฆไธฒS1, S2, S3(ๆฏๅๅญ็ฌฆไธฒๅ็ฑๅฐๅฏซๅญๆฏ็ตๆ)
ๆฏๅๅญ็ฌฆไธฒไปฃ่กจไธๅๆดๆธ๏ผๅ
ถไธญๆฏๅๅญๆฏไปฃ่กจไธๅ0ๅฐ9็ๆธๅญใ
ๅ
ฉๅๅญๆฏไปฃ่กจ็ๆธๅญ็ธ็ญ็ถไธๅ
็ถๅ
ฉๅๅญๆฏ็ธๅใ
ๆพๅบไธๅๅฏ่ฝ็S1, S2, S3
ๆ่ทฏ๏ผ
ๅ ็ฒไธไฝๆดๆธๅชๆ10ๅ๏ผไธไธๅๅญๆฏไธ่ฝไปฃ่กจ็ธๅๆธๅญ๏ผ
ๆไปฅ็ถๅญๆฏ็จฎ้กๅคงๆผ10ๅ็่ฉฑๅคๅฎไธๅฏใ
ๅฆๅ๏ผๅฐฑDFSๆพ็ญๆกใ
P.S.:
1. ๆฒๆๆณจๆๅฐ้กไธญๆ่ชชๆฏๅๆธๅญ็้้ ญๆฒๆๅค้ค็0๏ผ้ๅๆฒๆๅคๆท๏ผWAไบๅนพๆฌก
*/
#include <iostream>
#include <cstdio>
#incl... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
#include <ctype.h>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF... |
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
// #include <atcoder/all>
// #include <boost/multiprecision/cpp_int.hpp>
#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... | #include <bits/stdc++.h>
using namespace std;
int _ = (cout << fixed << setprecision(9), cin.tie(0), ios::sync_with_stdio(0));
using Int = long long;
bool f(const string &s) {
for (int i = 0; i < s.size(); i++) {
if (s[i] != s[s.size() - 1 - i]) {
return false;
}
}
return true;
}... |
#include <iostream>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#include "maybe.h"
#include <limits>
#include <bitset>
#include <queue>
#include <algorithm>
#include <list>
#include <cmath>
#include <cstring>
using namespace std;
using ull = unsigned long long;
using ll = lo... | #ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec... |
#include <bits/stdc++.h>
using namespace std;
void DBG() { cerr << endl; }
template<class Head, class... Tail>
void DBG(Head H, Tail... T) { cerr << ' ' << H; DBG(T...); }
#define dbg(...) cerr << "(" << (#__VA_ARGS__) << "):", DBG(__VA_ARGS__)
using ll = long long;
using ld = long double;
#define sqr(a) ll(a) * (a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int,int> pii;
#define x first
#define y second
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
string s;
cin>>n>>s;
string t;
for(cha... |
#include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 1000000007LL
//#define MOD 998244353LL
#define doublecout(a) cout<<setprecision(16)<<a<<endl;
using vi = vector<ll>; // intใฎ1ๆฌกๅ
ใฎๅใซ vi ใจใใๅฅๅใใคใใ
using vvi = vector<vi>; // intใฎ2ๆฌกๅ
ใฎๅใซ vvi ใจใใๅฅๅใใคใใ
usi... | #include <bits/stdc++.h>
#define ll long long
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
#define all(x) (x).begin(),(x).end()
using namespace std;
ll in(){
double a;
cin>>a;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<char, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define POPCOUNT(x) __builtin_popcount(x)
template <typename T> void chmin(T &a, const T &b) { a = mi... | #include <bits/stdc++.h>
//#define ll long long
#define int long long
//#define ull unsigned long long
//#define PI pair<int,int>
//#define PII pair<int,PI>
//#define PI pair<ll,int>
//#define endl "\n"
using namespace std;
const int maxm=2e6+5;
//const int mod=1e9+7;
signed main(){
ios::sync_with_stdio(0);
... |
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostrea... | #include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll LLINF {1001002003004005006};//ll = 9*LLINF
constexpr int INTINF {1000000000};//int = 2*INTINF
#define rep(i,n) for(in... |
//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;
Graph G;
vll dist;
vector<bool> seen;
void ... | //#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
typedef long long ll; typedef vector<int> ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mii map <int, int>
#define mll map <ll, ll>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define vi vector <int>
#define vd vector <double>
#define vll vector <ll>
#define fi first
#define se second
#define si set ... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) ... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl "\n";
#define mod 1000000007
#define loop(i,s,n) for(ll i=s;i<n;i++)
#define test ll t; cin>>t; while(t--)
#define p push_back
typedef long long ll;
ll gcd(ll a, ll b)
{
... | #include<iostream>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
ll x,n;
ll gcd(ll a,ll b){
return b?gcd(b,a%b):a;
}
int main(){
cin>>n;
ll ans=1;
for(ll i=2;i<=n;i++){
ll now=gcd(i,ans);
//cout<<now<<endl;
ans*=(i/now);
}
cout<<ans+1;
return 0;
} |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x <<... | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... |
#include <bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define pb push_back
#define st first
#define nd second
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
template <class T> T read(T &a) {
a=0;char x=getchar();bool f=0;
for(;x<'0'||x>'9';x=getchar())f|=x=='-';
for(;x>='0'&&x<='... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int64_t N, T;
cin >> N >> T;
vector<int64_t> A(N);
rep(i, N) { cin >> A[i]; }
i... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i];
set<int> ans;
set<int> setA;
rep(i, n... | // C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
int a[1010], b[1010];
int main()... |
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define REP(i, L, R) for (int i = L; i < (R); ++i)
#define SZ(x) (int)x.size()
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template <typename T>
bool ckmin(T &a, const T &b) ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
string yes = "Yes";
string no = "No";
vector<vector<ll>> stock(200, vector<ll>());
vector<vector<vector<ll>>> dp(200, vector<vector<ll>>());
vect... |
// Problem: A - Century
// Contest: AtCoder - KYOCERA Programming Contest 2021๏ผAtCoder Beginner Contest 200๏ผ
// URL: https://atcoder.jp/contests/abc200/tasks/abc200_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Made by Licykoc
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
#define UP... | /**
BISMILLAH
@Author : Arham
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
ll sq(int val) {
return (ll)(val*val);
}
void think(int id) { // Dummy_Argument?
int n;
vector<int> v;
cin >> n;
for(int i = 0, val; i < n; i+... |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> c(n, vector<int>(n));
for(auto& v : c) for(int& x : v) cin >> x;
for(int i = 1; i < n; i += 1)
for(int j = 1; j < n... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;i++)
#define REPA(i,j) for(int i=1;i<=j;i++)
#define FORN(i,j,k) for(int i=j;i<k;i++)
#define vi vector<int>
#define vvi vector<vi >
#define p... |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
vector<int>freq(10);
int len=3;
bool possible=false;
void recur(int pos,vector<int>&cnt,int num) {
if(pos==len) {
if(num%8==0) possible=true;
return;
}
for(int i=1;i<=9;i++) {
if(freq[i]==0 or cnt[i]==freq[i]) continue;
... | //Hachi
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<t... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //sortใใฆใใไฝฟใ
#define INF 2147483647
#define LLINF 9223372036854775807LL
int main(){
ll n,k; cin>>n>>k;
k = abs(k);... |
//#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... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... | #include <stdio.h>
constexpr unsigned char H[16] = {0, 1, 0, 3, 1, 1, 1, 1, 0, 1, 2, 2, 3, 1, 2, 3};
int main() {
unsigned char n, k;
scanf("%hhd %hhd", &n, &k);
getchar_unlocked();
unsigned char h[101], h2[101];
for (unsigned char i = 0; i < n; i++) h[i] = getchar_unlocked() - 80;
for (unsigned char i = ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define debug(output) cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const lint linf=1e18+7;
const lint inf=1e9+7;
const int MOD=1000000007;
long long modinv(l... | #include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,dp[N][7];
char s[N],x[N];
int main()
{
scanf("%d%s%s",&n,s+1,x+1);
dp[n][0]=1;
for(int i=n;i>=1;i--){
if(x[i]=='A'){
for(int j=0;j<7;j++){
if(dp[i][10*j%7]&&dp[i][(10*j+s[i]-'0')%7])
... |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... | #include<bits/stdc++.h>
#define int long long
#define pb push_back
#define WT int T=read();while(T--)
#define NO puts("NO");
#define YES puts("YES");
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x... |
//**He who has a why can survive almost any how***
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i,n) for... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
void solve() {
int n; cin >> n;
vector<int> cnt(200);
ll ans = 0;
for (int i = 0; i < n; i++) {
int v; cin >> v;
ans += cnt[v % 200];
cnt[v % 200]++;
}
cout << ans << "\n";
}
int main()... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F0R(i, x, y) for (int i = x; i < y; i++)
#define FOR(i, n) F0R(i, 0, n)
#define F0RD(i, x, y) for (int i = y - 1; i >= x; i--)
#define FORD(i, n) F0RD(i, 0, n)
#define F first
#define S second
namespace output {
void pr(int x) {
c... | #include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#defi... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
template <class T>
using Vec2 = vector<vector<T>>;
#define REP(i, m, n) for (ll i = (m); i < (n); ++i)
#define REPN(i, m, n) for (ll i = (m); i <= (n); ++i)
#... |
#include <iostream>
#include<algorithm>
using namespace std;
int a[200005];
int main() {
int n;
scanf("%d",&n);
for (int i=1; i<=n; i++) {
scanf("%d",&a[i]);
}
sort(a+1, a+n+1);
long long sum=0;
for (int i=1; i<=n-1; i++) {
sum+=(a[i+1]-a[i])*(long long)(n-i)*(long long)i;
... |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;
//container util
//---... | #include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) mems... |
/* -*- coding: utf-8 -*-
*
* c.cc: C - Too Heavy
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<uti... | #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... |
#include<bits/stdc++.h>
#define pi 3.1415926535897932384626
using namespace std;
struct P{
int x,y;
bool operator < (const P &a )const{
//if(x!=a.x) return x<a.x;
//if(y!=a.y)
return y<a.y;
};
};
int a,b,c,d,i,n,m,e,ee,k,dx[10]={1,0,-1,0,1,1,-1,-1},dy[10]={0,1,0,-1,1,-1,1,-1};
int o[2][2];
i... | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define MAXN 200005
#define REP(temp, init_val, end_val) for (int temp = init_val; temp <= end_val; ++temp)
#define REPR(temp, init_val, end_val) for (int temp = init_val; temp >= end_val; --temp)
using namespace std;
typedef long long ll;
typedef u... |
#include<bits/stdc++.h>
using namespace std;
int const size_n = 3010;
long long matrix[2 * size_n][2 * size_n];
bool vis[2 * size_n][2 * size_n];
long long MOD = 998244353LL;
long long solve (long long n, long long k) {
if(vis[n][k]) { return matrix[n][k]; }
if(n == 0 && k == 0) { return 1ll; }
if(n == 0... | //Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P... |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF... |
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdlib>
using namespace std;
int main() {
long long int S,P;cin>>S>>P;
for (long long int i = 1; i <= 1000000; i++)
{
if (i*(S-i)==P)
{
cout << "Yes";
break;
}
if(i==1000000){
... | #include <bits/stdc++.h>
using namespace std;
signed main(){
int A, B;
scanf("%d%d", &A, &B);
printf("%lf\n", 100.0 * (A - B) / A);
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
long long n, ans = 0;
cin >> n;
for(long long i = 1; i < n; i++){
long long d = 1, j = i;
while(j > 0){
d *= 10;
j /= 10;
}
long long x = i + d * i;
... | //code by: Ravi Khatri
#include<bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define F first
#define S second
#define pb push_back
#define f(i,s,n) for(int i=(int)s;i<=(int)n;++i)
#define fr(i,n,s) for(int i=(int)n;i>=s;--i)
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.siz... |
#include <iostream>
using namespace std;
int main() {
string S;
cin>>S;
cout<<S[1]<<S[2]<<S[0]<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)
#define forr(i,x,n) for(int i = n;i >= x;--i)
#define Angel_Dust ios::sync_with_stdio(0);cin.tie(0)
int main()
{
// freopen("D:\\OJCodes\\TTT\\in.txt","r",stdin);
// freopen("D:\\OJCodes\\TTT\\out.... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <decimal/decimal>
using namespace std;
using namespace __gnu_pbds;
#define rep(i, s, t) for (int i = s; i < int(t); ++i)
#define sc scanf
#define pr printf
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define eb... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... |
#pragma GCC optimize("Ofast") //Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define fastio ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(1... | #include <iostream>
int main()
{
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int64_t C[]={0,0,0,0,0,0,0,0,0,0,0,1,12,78,364,1365,4368,12376,31824,75582,167960,352716,705432,1352078,2496144,4457400,7726160,13037895,21474180,34597290,54627300,84672315,129024480,193536720,286097760,417225900,6008052... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define u... | #include <bits/stdc++.h>
using namespace std;
int h, w, a, b, ans;
bool vis[18][18];
void dfs(int x, int y, int lef){
if (y>w) x++, y=1;
if (x==h&&y==w){
if (lef==0) ans++;
return;
}
dfs(x, y+1, lef);
if (lef!=0&&!vis[x][y]){
if (!vis[x+1][y]){
vis[x][y]=1, vis[x+1][y]=1;
dfs(x, y+1, lef-1);
vis[x][... |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
ll n;
cin>>n;
ll ans = (n*(1.08));
if(ans < 206){
cout<<"Yay!"<<endl;
}else if(ans == 206){
cout<<"so-so"<<endl;
}else{
cout<<":("<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
string s;
cin >> s;
ll ans = 0;
rep(i, s.size() - 3) if (s.substr(i, 4) == "ZONe") ans++;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mset(x,y) memset(x,y,sizeof(x))
#define rep(i,n) for(int i=0;i<i... | #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>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T>
T gcd(T a, T b) { return ((a % b == 0) ? b : gcd(b, a % b)); }
template <typename T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr LL ... | ///****In the name of ALLAH, most Gracious, most Compassionate****//
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair <LL, LL> pii;
#define ALL(a) a.begin(), a.end()
#define FastIO i... |
#include<bits/stdc++.h>
#define loop(i, n) for(int i = 0; i < n; i++)
#define pb push_back
#define ll long long int
#define vi vector<int>
#define pi pair<int, int>
#define W(t) int t; cin >> t; while(t--)
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(... | #include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <stack>
#include <deque>
#include <assert.h>
#include <functional>
#include <iomanip>
using namespace std;
#define ll long long
#define... |
#include <bits/stdc++.h>
#define int long long int
#include <time.h>
using namespace std;
int graph[22][22];
int g[22];
int ind_set[2000006];
int co[2000006];
bool vis[22];
bool good = true; ;
int n;
int coll[22];
void dfs(int no , int s , int p , int colou ){
vis[no] = 1;
coll[no] = colou;
for(int j = 0;j<... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, K, lst[maxn], tmp[maxn];
vector<int> G[maxn];
int main() {
scanf("%d %d", &n, &K);
for (int i = 1, u, v; i < n; i++) {
scanf("%d %d", &u, &v);
G[u].push_back(v), G[v].push_back(u);
}
auto chk = [&](int x) {
... |
#include <bits/stdc++.h>
using namespace std;
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;
}
cout << n << endl;
} | // #include <bits/stdc++.h>
// using namespace std;
#include <cstdio>
#define rep(i,_l,_r) for(register signed i=(_l),_end=(_r);i<=_end;++i)
#define fep(i,_l,_r) for(register signed i=(_l),_end=(_r);i>=_end;--i)
#define erep(i,u) for(signed i=head[u],v=to[i];i;i=nxt[i],v=to[i])
#define efep(i,u) for(signed i=Head[u],v... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bo... | #include <bits/stdc++.h>
#define HAR BAR LAGTA HAI APUN HI J BHAGWAAN HAI!!
#define UTSAV ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define loop(i,m,n) for(ll i=m;i<n;i++)
#define sq(a) (a)*(a)
#define MAX 1e9
#define MIN -1e9
#define ... |
/*Created By:---- Dibas Behera*/
#include<bits/stdc++.h>
using namespace std;
#define db(x) cout<<x<<'\n'
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define repi(i,n) for(int i=0;i<(n);++i)
/... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("sp.txt","r",stdin);
#endif
int n,q;
cin>>n>>q;
vector<int>v(n);
for(int i=0;i<n;i++) cin>>v[i];
while(q--){
... |
#include <bits/stdc++.h>
using namespace std;
#define IO ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define double long double
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#def... | #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 pow_int(int a, int b){
int result = 1;
rep(i,b)result*=a;
return result;
}
... |
//#define MULTICASES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(i=(a);i<=(b);++i)
#define per(i,a,b) for(i=(a);i>=(b);--i)
#define REP(i,a,b) for(i=(a);i< (b);++i)
#define PER(i,a,b) for(i=(a);i> (b);--i)
#define ERR(...) fprintf(stderr,__VA_ARGS__)
inline void ac();
int m... | #include <iostream>
#include <cstring>
using namespace std;
const int N = 200010, M = 2 * N, INF = 0x3f3f3f3f;
int h[N], e[M], ne[M], idx, n, m, k;
int f[N], g[N], cnt; //f[u]:u็ๅญๅญ็ป็นไธญ๏ผๆ่ฟ็็นๆฎ็น่ท็ฆปu็น็่ท็ฆป
//g[u]:u็ๅญๅญ็ป็นไธญ๏ผๆ่ฟ็ๆฒก่ขซ็นๆฎ็น่ฆ็็็น่ท็ฆปu็น็ๆ่ฟ็่ท็ฆป
bool st[N];
void add(int a, int b) {
e[idx] = b, ... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
bool punched[3][3];
//using Graph = vector<vector<int>>;
const int MOD ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = (n); i >= 0; i--)
#define FOR(i, m, n) for (ll i = (m); i < (ll)(n); i++)
#define BIT(bit, n) for (int bit = 0; bit < (1<<(n)); ++bit)
#define INF... |
#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 ... | #define LOCAL0
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
double el[100005], er[100005], suml[200005], sumr[200005], sumk[200005];
int n, m, k;
map<int, int> tag;
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ci... |
#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) +... | /**
* author: longvu
* created: 06/25/21 08:42:14
**/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
const int INF = numeric_limits<int>::max();
const int nax = (int)(400001);
const int mod = 1e9 + 7;
vector<int> adj[na... |
#include <iostream>
#include <climits>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
#endif
int n,min = INT_MAX;
for(int i = 0 ; i < 4; i++)
{
cin >> n;
if(n < min) min = n;
}
cout <... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using P = pair<int,int>;
int main(void){
int A,B,C;
cin >> A >> B >> C;
rep(i,100){
if(C==0){
A--;
if(A<=0){
printf("Aoki");
return 0;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n; cin >> n;
V<V<int> > c(n, V<int>(n));
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++) cin >> c[i][j];
}
int am = 1000000001, p ... | /**
* author: tomo0608
* created: 19.06.2021 20:59:50
**/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include<atcoder/all>
using namespace atcoder;
#endif
typedef long long ll;
typedef long double ld;
template <class T> using V = vector<T>;
temp... |
#include"bits/stdc++.h"
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(x) x.begin(),x.end()
#define BACK(x) x.rbegin(),x.rend()
#define MOD 1000000007
#define INF INT_MAX
#define FLOAT_ANS setprecision(30)
#define TORAD(x) (x*acos(-1)/180.0)
#define TODEG(x) (x*180/acos(-1))
#define elif else if
using namespace std... | #include "bits/stdc++.h"
#include <chrono>
#include <random>
#define INF 1000000007
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i < b; i++)
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll,ll>;
ll solve_sub(ll N, vector<ll>& V) {
priority_queue<pii> q;
ll ans = 0;
for ( int i = 0; i < N; i++ ) {
int i2 = 2*N-1-i;
q.push(pii(V[i],i));
q.push(pii(V[i2],i2));
ans += q.top().fi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se seco... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.