code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)n ;i++)
#define rept(i,k,n) for(int i = (int)(k);i < (int)(n);i++)
#define all(vec) vec.begin(),vec.end()
#define ll int64_t
int main(){
int n;
cin >> n;
vector<vector<int> > c(n,vector<int>(n));
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define fin(a) { cout << a << endl; return 0; }
#define debug(a) { cerr << #a << ": " ... |
#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>;
const ll INF = 2e18;
int main() {
ll n;
cin >> n;
vector<vector<ll>> c(n, vector<ll>(n));
rep(i, n) rep(j, n) cin >> c[i][j];
bool f = 1;
rep(j, n - 1) {
ll t = c[... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n;
ll c[501][501];
ll lc[501][501];
ll a[501],b[501];
ll difa[501];
ll difsuma[501];
ll difb[501];
ll difsumb[501];
bool solve(){
for(int i=0;i+1<n;i++){
difa[i]=c[0][i+1]-c[0][i];
for(int j=... |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define ll long long
#define ar array
const ll mxN=2e5;
const int mod=1e9+7;
const ll INF=1e18;
#define what_is(x) cerr << #x << " is " << x << endl;
ll a,b,n,k,q,m,x,y,h,l,r,t;
ll d[mxN],c[mxN];
vector<ll> adj[mxN];
void dfs(ll u=0,ll p=-1){
f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N; cin >> N;
vector<int64_t> a(N-1), b(N-1);
vector<vector<int64_t>> l(N, vector<int64_t>(0));
rep(i, N-1) {
cin >> a.at(i) >> b.at(i);
a.at(i)--; b.at(i)--;
l.at(a.at(i)).push_back(b... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
#define y1 awefakhlrv
using pii = pair<int, int>; ... | #include <bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR(i,m) for(int i = 0 ;i < m ;i++)
#define mem(a ,b) memset(a, (b) , sizeof(a))
#define all(cont) cont.begin(),cont.end()
#define mp make_pair
#define pb push_back
#define F f... |
//#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 ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(void)
{
ll N, K;
cin >> N >> K;
for (ll i = 0; i < K; i++)
{
if (N % 200 == 0)
{
N = N /200;
}
else
{
N = N * 1000 + 200;
}
}
cout << N << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << "["; for... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long int
#define endl "\n"
#define ... |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef pair<int, int> pii;
int main() {
int N, K, M;
cin >> N >> K >> M;
M *= N;
int sum = 0;
for (int i = 0; i < N - 1; i++) {
int a;
cin >> a;
sum += a;
}
if (M - sum > K) {
cout << -1 << endl;
} else {
... | #include <iostream>
using namespace std;
int main(void){
int n,k,m,ans,sum;
ans = -1;
sum = 0;
cin >> n;
cin >> k >> m;
for(int i=1;i<n;i++){
int temp;
cin >> temp;
sum += temp;
}
for(int i=0;i<= k;i++){
if(m <= (sum + i)/n){
ans = i;
... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define all(x... | //********************************************************************//
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define RANGE(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define DFOR(i, a, b) for(int i = a; i > b; --i)
#define DEB(x) cout << #x << ": " << ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (int)(l); i < (int)(n); i++)
#define drep(i, l, n) for (int i = (int)(n); i > (int)(l); i--)
#define INF INT_MAX
#define def (200007)
#define MOD (1000000007)
typedef vector<int> veci;
typedef vector<vector<int>> Veci;
typedef vector<int64_... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ll long long
#define ld long double
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int n; c... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MOD = 998244353;
int quick_pow(int a,int x) {
int ret = 1;
while(x) {
if (x & 1) {
ret = 1LL * ret * a % MOD;
}
x >>= 1;
a = 1LL * a * a % MOD;
}
return... |
#include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct Edge
{
ll to;
ll weight;
Edge(ll t, ll w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
// using Graph = vector<vector<int>>;
co... | #include<bits/stdc++.h>
#define int long long
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define REP_sz(i,s) for(int i=0;i<s.size();i++)
#define gcd(a,b) __gcd(a,b)
#define RE return
#define FILL(a,b) memset(a,b,sizeof(a))
#define SO(a) sort(all(a))
#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) (in... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll A[2005];
ll gcd(ll a, ll b) {
if (a < b)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Pint pair<int,int>
#define Pll pair<ll,ll>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define MOD 1000000007
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) {
cin >> s[i];
}
ll b ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define pll pair<ll,ll>
#define forA(i,a,n,x) for(ll i=a;i<n;i+=x)
#define forD(i,a,n,x) for(ll i=n-1;i>=a;i-=x)
#define ranit(it,n) for(auto it:n)
#define testCases ll t;cin>>t;while(t--)
#define mp make_pair
#define pb push_back
... |
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define po pop_back
#define mp make_pair
#define fi first
#define se second
#define hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
using namespace std;
bool comp(ll a,ll b){if(a>b)return true;else return false;}
in... | #include "bits/stdc++.h"
using namespace std;
#include "string"
#define int long long
#define pi pair <int, int>
#define ff first
#define ss second
#define boost ios::sync_with_stdio(false);cin.tie(nullptr)
#define endl '\n'
#define vi vector<int>
int32_t main() {
boost;
int n, m, t;
cin >> n >> m >> t;
int cur = ... |
#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;i=nxt[i])
typedef long long ll;
inline void Max(int &x,int y){(x<y)&&(x=y);}
inline void Min(int... | #include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
using namespace std;
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a; i > -1; --i)
#define REP(i, a, b) for (int i = (int)a; i ... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define setIO(x) freopen(x".in", "r", stdin), fre... | #include <cstdio>
#include <algorithm>
using namespace std;
#define INF 998244353
long long Pow (long long a, long long b) {
a %= INF;
long long ans = 1;
while (b > 0) {
if (b & 1) {
ans *= a;
ans %= INF;
}
a *= a;
a %= INF;
b >>= 1;
}
return ans;
}
int main () {
int n, m, k;
scanf ("%d... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#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)
#define irep(i, n) IFOR(i,0,n)
templ... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<climits>
#include<algorithm>
#include<queue>
#include<vector>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespace std;
inline int read(){
int f=1,ans=0; char c=getchar();
while(c<'0'||c>'9... |
#include <iostream>
#include <vector>
#include<string>
#include <set>
#include <cstdlib>
#include <map>
#include <cmath>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <ctype.h>
using namespace std;
int main()
{
int H;
int W;
int X;
int Y;
cin >> H >> W >> X >> Y;
X--;
Y--;
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repvec(i, v) for (int i = 0; i < v.size(); i++)
#define vecall(v) (v).begin(), (v).end()
#define input(t, ...) \
t __VA_ARGS__; \
in(__VA_ARGS__)
#define invec(t, v, n) \
vector<t> v(n); \
for (int index = 0; index < n;... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N = 0;
vector<double> UFO(2);
cin >> N;
for (double &x : UFO){
cin >> x;
}
vector<vector<double>> buildings (N, vector<double> (2));
for (vector<double> &d : buildings){
for (double &f : d){
cin >> f;
}
}
d... |
#pragma GCC target("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
#define int ll
#define f first
#define sz(a) ((int)(a).size())
#define s second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vpii vector<pii>
#define eb emplace_b... |
#include <bits/stdc++.h>
using namespace std;
//#define ONLINE_JUDGE
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define rep(z, x, y) for(int z=x;z<=y;++z)
#define repe(z, x, y) for(int z=x;z<y;++z)
#define repd(z, x, y) for(int z=x;z>=y;--z)
#define repde(z, x, y) for(int z=x;z>y;--z)
#define i... | #include <iostream> // cin cout
#include <string> // string
int main()
{
int n;
std::cin >> n;
unsigned long long res = 1;
for (int i = 0; i < n; i++)
{
std::string x;
std::cin >> x;
if (x == "OR")
{
res += 1ULL << (i+1);
}
}
std::cout << res;
} |
#include <bits/stdc++.h>
#define ALL(a) a.begin(), a.end()
#define ALLR(a) a.rbegin(), a.rend()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORD(i, a, b) for (int i = (a); i > (b); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = (n)-1; i >= 0; i--)
#define SI(a) (in... | #include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll mod=1e9+7;
const int N=300010;
int n,ans,a[N],vis[N];
void init(){
memset(a,0,sizeof(a));
memset(vis,0,sizeof(vis));
n=ans=0;
}
void solve(){
init();
cin>>n;
... |
#include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... | #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>
using namespace std;
int main(){
long long n;
cin >> n;
long long a = 3;
long long b = 5;
int ai = 1;
int bi = 1;
while(a <= n){
while(a+b <= n){
if(a+b == n){
goto answer;
}
if((n-a)%5 != 0){
break;
}
b *= 5;
bi++;
... | #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=(a); i>(n); --i)
#define pb emplace_back
#define mp make_pair
#define clr(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(),(x).end()
#define lowbit(x) (x & -x)
#define fi first
#define se... |
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
struct V
{
int d,t,k;
};
struct PQ
{
int p;
long long int t;
bool operator < (const PQ x) const
{
return t>x.t;
}
};
vector<V> v[100010];
priority_queue<PQ> pq;
int visit[100010];
int ma... | // Artur Kraska, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,P... |
#include <bits/stdc++.h>
#define fir first
#define sec second
#define PB push_back
#define MP make_pair
#define all(a) (a).begin(), (a).end()
#define sz(a) (a).size()
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define foreach(itr, c)... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ull unsigned long long
#define ll long long
#define endl '\n'
#define line cout<<"--------------------------"<<endl
#define dd(x) cout<<#x<<" = "<<x<<' '
#define pb push_back
#define mp make_pair
#define mod 1... |
//g++ t.cpp -o t && t < p.txt
//d>p.txt&&t<p.txt&&t2<p.txt
#include <iostream> // プログラムの耳と口
#include <vector> // 超有能配列秘書
#include <algorithm> // みんな大好きソートと二分探索
#include <queue> // きゅーちゃん、だいすき
#include <string> // to_string
#include <functional> // 関数を変数に入れる子
#include <set> // 値の取得・挿入・削除を高速に
#include <map> // setの妹 これま... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,s,d,i,a,b,p=0;
cin >>n>>s>>d;
for(i=0;i<n;i++)
{
cin >>a>>b;
if(a<s && b>d)
{
++p;
}
}
if(p)
cout <<"Yes"<<endl;
else
cout <<"No"<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define inf 1000000000
int n,k;
vector<vector<int> > edges(100);
int main(){
cin >> n >> k;
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
edges[i].pb(0);
}
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
ci... | //g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#inclu... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
string S, X;
cin >> N >> S >> X;
vector<vector<int64_t>> memo(N, vector<int64_t>(7, -1));
function<bool(int64_t, int64_t)> f = [&](int64_t i, int64_t j) {
//ターンiをj(mod 7)で迎えた場合にTの勝ちであるかどうか
if (i == N) {
re... | #include <bits/stdc++.h>
using namespace std;
// rep
#define rep(i,n) for(decltype(n) i = 0; i < (n) ; ++i)
#define orep(i,n) for(decltype(n) i = 1; i <= (n); ++i) // one rep
#define drep(i,n) for(decltype(n) i = (n)-1; i >= static_cast<decltype(i)>(0); --i) // down rep
#define srep(i,s,t) for(decltype(t) i =... |
#include <iostream>
using namespace std;
int main()
{
int x, y;
cin >> x >> y;
if (x + y >= 15) {
if (y >= 8)
cout << "1";
else if (y >= 3)
cout << "2";
else cout << "3";
}
else if (x + y >= 10) {
if (y >= 3)
cout << "2";
else cout << "3";
}
else if (x + y >= 3) {
cout << "3";
}
else cout... | #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 orderedd_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// // find_by_order(k) returns iterato... |
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <algorithm>
#include <queue>
#include <set>
#include <vector>
#include <iomanip>
#include <bitset>
using namespace std;
#define pi pair<int ,int>
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
srand (time(NULL)... | #include<bits/stdc++.h>
#define ll long long
#define fori(i,j,n) for(ll i=(ll)j;i<(ll)n;++i)
#define forr(i,a,b) for(ll i=(ll)(a);i>=(ll)(b);--i)
#define all(x) x.begin(), x.end()
#define mp(i, j) make_pair(i, j)
#define pb(i) push_back(i)
#define pii pair<int,int>
#define vi vector<ll>
#define vb vector<bool>
#define... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define rsz resize
#define ins insert
#define mp make_pair
#define pf push_front
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define sz(x) (int)(x).siz... | #include<bits/stdc++.h>
using namespace std;
const int N=2005;
char a[N][N];
int dp[N][N];
int n,m;
map<char,int>mp;
int main(){
mp['+']=1;mp['-']=-1;
cin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)cin>>a[i][j];
dp[n][m]=0;
for(int i=n;i>=1;i--)
... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int64_t n,x,z;
double y=0;
x=0;
cin>>n;
vector<int64_t> a(n);
for(int i=0;i<n;i++)
{
cin>>a.at(i);
if(a.at(i)<0)
a.at(i)*=-1;
x+=a.at(i);
y+=(a.at(i)*a.at(i));
}
y=sqrt(y);
sort(a.begin(),a.end());
z=a.at(n-1);
cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> pin;
const int N = 45;
const int S = (1 << 20) + 5;
const ll inf = 1LL << 60;
int n;
ll m, a[N];
vector <ll> sa, sb;
template <typename T>
inline void read(T &X) {
char ch = 0; T op = 1;
for (X = 0... |
// #pragma GCC optimize(2)
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <random>
#include <cctype>
#include <bitset>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
#define IO ... | #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 int ll;
auto io_speed = []() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
ll pow_mod(ll a, ll e, ll mod) {
ll res = 1;
while(e) {
if(e&1) res = res * a%mod;
e>>=1;
a=a*a%mod... | #include <bits/stdc++.h>
// #include <atcoder/all> // NOTE: AtCoderライブラリ
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr << #x << ": " << x << ", " << #y << ": " << y << endl;
#define dbg3(x, y, z) cerr << #x... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#ifndef LOCAL
#pragma GCC target("arch=skylake-avx512")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-12;
static ... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... |
#include <bits/stdc++.h>
#define ll long long
#define maxn 10006
using namespace std;
ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-') f = -1;
for (; isdigit(ch); ch = getchar()) x = 10 * x + ch - '0';
return x * f;
}
void print(ll x) {
... | #include<bits/stdc++.h>
using namespace std;
int N;
string S;
int main()
{
cin >> N >> S;
int ans = 0;
for(int i = 0; i < N; i++) {
int A, T, C, G;
A = T = C = G = 0;
for(int j = i; j < N; j++) {
if(S[j] == 'A') A++;
if(S[j] == 'T') T++;
if(S[j] == 'C') C++;
if(S[j] == 'G') ... |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
if(x%100 ==0)
cout<<100<<endl;
else
{
cout<<(100-(x%100))<<endl;
}
}
| //AUTHOR: RAVAN_2070
//PUNE INSTITUTE OF COMPUTER TECHNOLOGY
/*
I ♥ CLARICE STARLING...
EXPLAINATION BELOW->
*/
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull... |
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES // M_PI等のフラグ
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array)/sizeof(array[0]))
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int INF = 1001001001;
void chmax(int& x, int y) { x =... | #include <cstdio>
using namespace std;
const int mod = 1000000007;
char s[2000][2001];
int b[4000001];
int a[4][2000][2000];
int main() {
int h, w, c = 0, i, j, k;
long long ans = 0;
scanf("%d %d", &h, &w);
for (i = 0; i < h; i++) scanf("%s", s[i]);
for (i = 0; i < h; i++) {
... |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
c... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll=long long;
typedef pair<ll,ll> P;
int main(){
ll k,n,m;
cin>>k>>n>>m;
vector<ll> a(k);
rep(i,k) cin>>a[i];
long double d=m;
vector<P> p;
int sum=m;
vec... |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <bitset>
#include <math.h>
#include <queue>
#include <map>
#include <set>
#include <limits.h>
#include <limits>
#include <stdio.h>
#include <stdlib.h>
#include <cstring>
#include <sstream>
using namespace std;
const i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n+1); i++)
int main() {
int a, b;
cin >> a >> b;
double ans;
ans = a * b / 100.0;
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1000000007;
template <typename T>
void print(const T &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
cout... | #include <bits/stdc++.h>
using namespace std;
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> t(n), l(n), r(n);
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> t[i] >> l[i] >> r[i];
ans +=... |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int64_t> a(410, 0);
for(int i = 0; i < N; i++){
int x;
cin >> x;
a[x + 200]++;
}
int64_t ans = 0;
for(int i = 0; i <= 400; i++){
for(int j = 0; j <= 400; j++){
... | #include <iostream>
#include <vector>
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
std::vector<long long> v1, v2, v3;
long long cnt1 = 0, cnt2 = 0, ans = 0;
int n, a;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a;
v3.push_back(a);
cnt1 += a;
cnt2 += a * a;
v1.push_back(cnt... |
/*
* ────────────── •✵•✵• ──────────────
* | In The Name of Allah |
* | Author: Amir Hossein Farhadi |
* | Created: 2021-02-19 |
* ────────────── •✵•✵• ──────────────
*/
/* Thank you *Amir Hossein* */
// God just you know when it will happen!
// Dorood bar mobtakeran :)))
//... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
#define all(x) (x).begin(), (x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pall(x,l,r) (x).begin()+l, (x).begin()+r+1
#define endl "\n"
#define F first
#define S second
#def... |
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
const int INF = 0x3f3f3f3f;
void solve() {
ull n;
cin >> n;
ull ans = 1;
ull c = n+1;
ull val = 0;
if(n == 1) {
cout << 1 << '\n';
return;
}
for(ull i ... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(void)
{
ll N, K;
cin >> N >> K;
ll ans = 0;
for (ll i = 1; i <= N; i++)
{
for (ll j = 1; j <= K; j++)
{
ans += (100 * i) + j;
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
using LL = long long;
const int kMaxN = 20;
const int kMaxL = 73;
const int kP[kMaxN] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
int s[kMaxL], c;
LL f[kMaxL + 1][1 << kMaxN];
LL a, b, ans;
LL C(int i, int j) { // 可选最小数为i，已选j个数的基础上，可以得到的集... |
#include<bits/stdc++.h>
using namespace std;
int digit(long long n) {
int d = 0;
while (n > 0) {
d++;
n /= 10;
}
return d;
}
int main() {
long long n, res;
cin >> n;
int d = digit(n);
if (d < 4) {
cout << 0 << endl;
return 0;
}
if (d >= 4 && d < ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define tc ll tc; cin >> tc; while(tc--)
#define mod1 = 1000000007;
#define pb push_back
#define pob pop_back
//debug starts
#ifndef ONLINE_JUDGE
#define dbg(x) cerr<<#x<<gp;_print(x);... |
/* *****fireice**** */
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define vi vector<int>
#define vc vector<char>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#define el '\n'
#... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define MAX 1000000000
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define setbits(x) ... |
//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... | #include <iostream>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
int main(){
int n,m; cin >> n >> m;
long long even = 0, odd = 0;
string s;
rep(i,n){
cin >> s;
int x = 0;
... |
//#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 <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#define ll long long
#define maxn 1000010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline void w... | #pragma GCC optimize("O3")
#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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// find_by_order(k): It returns to ... |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
// string __fname = "";
// ifstream in (__fname + ".in");
// ofstream out (__fname + ".out");
// #define cin in
// #define cout out
#define ss cout << " ";
... | #include<bits/stdc++.h>
using namespace std;
#define fix_precision(i) cout << fixed << setprecision(i)
#define rp(i,n) for (int i = 0; i < n; i++)
const long long mod = 1e9 + 7;
template<typename T, typename U, typename V>
V modPower(T a, U b, V c){
//a^b mod cを返す
//帰り値の型はcと同じ
V x = 1;//桁数がcと同じor超えることを考え... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<60)-1;
#define rep(i, n) for (int i = 0; i < n; i++)
#define sz(a) (int)(a.size())
template<class T>
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}
template<class T>
bo... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define drep(i,b,a) for(int i = (b)-1; i >= (a); i--)
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(v) sort(v.begin(),v.end());
#define RSORT(v) sort(v.rbegin()... |
/*
／＞ フ
| _ _|
／`ミ _x 彡
/ |
/ ヽ ?
／￣| | | |
| (￣ヽ＿_ヽ_)_)
＼二つ
*/
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf push_front
#define F first
#define S s... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
... |
#include<bits/stdc++.h>
#define ls(p) p<<1
#define rs(p) p<<1|1
#define de(x) cout<<#x<<" = "<<x<<endl;
#define rep(i,a,b) for(int i = (a);i<=(b);++i)
#define endl '\n'
#define PI acos(-1.0)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1e5+10;
const int INF = 1e9+10;
int main(... | #include<bits/stdc++.h>
using namespace std;
long long gcd(long long int a, long long int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
long long lcm(int a, int b)
{
return (a / gcd(a, b)) * b;
}
int main(){
long long int n;
cin>>n;
long long ans = 1;
for(long long int i=2;i<=n;i++){
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = long long;
const long long INF = 1LL << 60;
const int SINF = 1LL << 30;
const ll mod = 1000000000+7;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<atcoder/all>
#define rep(i, n) for(long long i = 0;i < (n);i++)
using namespace std;
// using namespace atcoder;
using ll = long long;
using Pii = pair<int, int>;
const ll MOD = 1000000007;
con... | #include<bits/stdc++.h>
#define int ll
#define sz(x) int((x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using pi = pair<int,int>;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int minf = 0xc0c0c0c0c0c0c0c0;
double A[100100];
double ssum[100100];
signed main() {
ios::sync_w... |
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define endl '\n'
#define ll long long
#define mp make_pair
typedef pair<int, int> ii;
int solution(vector<int> dp, const int& level, const int& k, const vector<ii>& options, const vector<vector<int>>& cond){
if(level == k) return 0;
int opt1 = op... | #include <iostream>
using namespace std;
struct choice {
int a = 0;
int b = 0;
};
int count(bool *D, int N, struct choice *C, int M) {
int ans = 0;
for (int i = 0; i < M; i++) {
int a = C[i].a;
int b = C[i].b;
if (D[a] && D[b]) {
ans++;
}
}
return ans;
}
int main() {
int N, M, K, ... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define mset(a,b) memset(a, b, sizeof(a))
#define dbg(x) cout << "... | /*================================================================
*
* 创 建 者： badcw
* 创建日期： 2020/11/15 8:40 下午
*
================================================================*/
#include <bits/stdc++.h>
#define VI vector<int>
#define ll long long
using namespace std;
namespace IO {
template<class T>
voi... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define F first
#define S second
ll min(ll x, ll y){
return ((x < y) ? x : y);
}
ll max(ll x, ll y){
return ((x > y)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double X, Y, R;
bool inside(ll x, ll y) {
const int LARGE = 10000;
x *= LARGE;
y *= LARGE;
ll XX = round(X * LARGE);
ll YY = round(Y * LARGE);
ll RR = round(R * LARGE);
return (x - XX) * (x - XX) + (y - YY) * (y - YY) <= R... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
int main() {
... |
#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef tuple<ll, ll, ll> ti;
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//using Bint = mp::cpp_int;
#define REP(a,b,c) for... |
/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 998244353;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb push_back
#define nl cout<<"\n"
#define all(x) x.begin(... |
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define all(v) v.begin(),v.end()
#pragma gcc optimize("O3")
#pragma gcc optimize("Ofast")
#pragma gcc optimize("unroll-loops")
using namespace std;
const int INF = 1e9;
const int TMX = 1 << 18;
const long long llINF = 1e16;
const long long ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define ll long long
const long long MOD = 998244353;
const int N = 2020;
int d[N][N];
int dx[] = {0, -1, 0, 1};
int dy[] = {-1, 0, 1, 0};
vector<pair<int, int> > g[N];
char a[N][N];
int n, m;
void BFS01(int sx, int sy)
{
for (int i = 0... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)//rep(i,回数){処理}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, x, a, count=0;
cin >> n >> x;
vector<ll> ans(n);
rep(i,n) {
cin >> a;
if (a != x) {
ans[count] += a;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,x;
cin>>n>>x;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
if(a[i]!=x)
cout<<a[i]<<" ";
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) int(x.size())
const int mod = 1e9 + 7;
const int inf = 2e9 + 5;
const ll linf = 9e18 + 5;
const ll ll0 = 0 * 1ll;
void init () {
}
vo... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using uint=unsigned int;
using ull=unsigned long long;
const ll LL_MAX=LLONG_MAX;
class union_find{
private:
vector<ll> par;
vector<ll> siz;
public:
union_find(ll n) : par(n),siz(n,1LL){
for (ll i=0;i<n;i++) par[i]=i;
}
ll root(ll x)... |
#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
usi... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
const int INF = 2e9 + 5;
const int dpINF = 1e16;
const int off = 1e9;
void print(vector<pair<int, int>> a) {
cout << "\n";
for(auto i : a) {
cout << i.first << " " << i.second << "\n";
}
cout << "\n";
}
signed main... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define CEIL(a, b) ((a - 1) / b + 1)
void solve() {
i... | #include<bits/stdc++.h>
using namespace std;
long long used[222222];
int s[222222];
int t[222222];
int main()
{
long long n,w;
cin>>n>>w;
for(int i=0;i<n;i++)
{
long long p;
cin>>s[i]>>t[i]>>p;
used[s[i]]+=p;
used[t[i]]-=p;
}
for(int i=0;i<=200000;i++)
{
used[i]+=used[i-1];
if(used[i]>w)
{
cout<... |
// AtCoder Beginner Contest 204
// B -
#include <iostream>
#include <vector>
int main(int argc, char *argv[]);
int main(int argc, char *argv[])
{
unsigned short N;
std::cin >> N;
std::vector<unsigned short> nuts(N);
for(unsigned short i=0; N>i; i++)
std::cin >> nuts[i];
std::vector<unsigned short>::co... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define F first
#define S second
#define nl "\n"
#define pll pair<ll, ll>
#define all(v) (v).begin(), (v).end()
#define decimal(n) cout <... |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<map>
#include<set>
#define int long long
#define lowbit(x) (x&(-x))
#define mid ((l+r)>>1)
#define lc (x<<1)
#define rc (x<<1|1)
#define fan(x) (((x-1)^1)+1)
#define max M... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int a,b;
cin>>a>>b;
int ans =abs(a-b);
if(ans<3)cout<< "Yes"<<endl;
else cout<< "No"<<endl;
}
|
#include <cstdio>
using u32 = unsigned int;
using u64 = unsigned long long int;
/*
A^{B^C} mod 10
0
1 1
2 4 8 6 2
3 9 7 1 3
4 6 4
5 5
6 6
7 9 3 1 7
8 4 2 6 8
9 1 9
*/
u32 modpow(u32 a, u32 n, u32 mod){
u32 r = 1;
for(; n; n>>=1){
if(n&1) r = (u64) r * a % mod;
a = (u64) a * a % mod;
}
return r;
}
... | // 2021-02-21 21:21:33
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i =... |
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define loop(i,n) for(int i = 0; i < n; ++ i)
#define mod 10e+7
#define pb push_back
const long double PI = 3.141592653589793236L;
typedef long long int ll;
typedef long double ld;
using namespace std;
long gcd(long a, long b)
{... | #include <bits/stdc++.h>
using namespace std;
void input(set<string>& rseStr)
{
int nStrSiz;
cin >> nStrSiz;
for (int nx = 0; nx < nStrSiz; ++nx)
{
string sStr;
cin >> sStr;
rseStr.insert(sStr);
}
}
string isExistStr(const set<string>& cnrseStr)
{
for (auto sStr : cnrseStr)
{
if (sStr[0... |
#include <iostream>
#include <bits/stdc++.h>
#include<string>
using namespace std;
#define boost ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
long long n,m;
string s,st;
long long a[200005]={0};
void get_values()
{
std::cin >> n >> m;
n=n+m;
//for(int i=0;i<n;i++)
// std::cin >> a[... | #include<bits/stdc++.h>
#define ll long long
#define x first
#define y second
#define pi pair
#define K 1000000007
using namespace std;
ll a[2000000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll test_case=1;//cin>>test_case;
while(test_case--)
{
ll a,b;cin>>a>>b;
cout<<fixed;... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
int n;
ll a[310000... | #include<bits/stdc++.h>
typedef unsigned long long ull;
typedef long long ll;
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void sc(int &x){scanf("%d",&x);}
void sc(int &x,int &y){scanf("%d%d",&x,&y);}
void sc(int &x,int &y,int &z){scanf("%d%d%d",&x,&y,&z);}
void sc(ll &x){scanf("%ll... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll M=998244353;
const ll MAXN=1e6+7;
const ld pi=acos(-1);
#define gi(n) ll n=read()
#define endl '\n'
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define per(i,a,b) for(ll i=b-1; i>=a; --i)
typedef vector<ll> V;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
class UnionFind {
public:
vector<ll> par, siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for(int i=0; i<sz_; ++i) par[i]=i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_,1);
for(int i=0; i<sz... |
//BISMILLAH
#include <bits/stdc++.h>
using namespace std;
#define read(x) freopen(x, "r", stdin);
#define write(x) freopen(x, "w", stdout);
#define ll long long
#define lli long long int
#define ve vector<int>
#define FOR(n) for(int i=0; i<(int)(n); ++i)
#define TEST_CASE(t) for(int z=1;z<=t;z++)
#... | #include <iostream>
#include <math.h>
#include <unordered_set>
using namespace std;
int main(void)
{
long long int N;
cin >> N;
long long int a, b;
a = 2;
b = 2;
long long int count = 0;
unordered_set<long long int> s;
while (pow(a, b) <= N) {
while (pow(a, b) <= N) {
... |
#include <iostream>
using namespace std;
int main() {
char S, T; cin >> S >> T;
if (S == 'Y') {
cout << (char)toupper(T) << endl;
} else {
cout << T << endl;
}
} | #include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int a[20][20];
int sum=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
sum+=i*100+j;
}
}
cout<<sum<<endl;
}
| #include<fstream>
#include<iostream>
#include<sstream>
#include<vector>
#include<stack>
#include<string>
#include<algorithm>
#include<cmath>
#include<unordered_map>
#include<map>
#include<stdlib.h>
#include<queue>
#include<tuple>
#include<iomanip>
#include<bitset>
#include<deque>
#include<stdio.h>
#include<set>
#includ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin>>N;
vector<int64_t> vec(0);
for(int i=1; i<=sqrt(N); i++){
if(N%i==0){
vec.push_back(i);
}
}
for(int i=0; i<vec.size(); i++){
cout<<vec.at(i)<<endl;
}
int a;
a=vec.size();
if(vec.at(a-1)!=N/vec.at(a-1))
... | //2*10^9
//9*10^18
// __int128_t
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long int
#define ll long long int
const ll M=1e9+7;
//to handle when remainder is -neg we add + M
//but when rem is +pos that time also we add so use %M
//so it will work for both
ll mod(ll n){
return (n%M + ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
long long C;
cin >> n >> C;
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
int a, b, c;
cin >> a >> b >> c;
v.emplace_back(a, c);
v.emplace_back(b + 1, -c);
}
sort(v.beg... | #include <bits/stdc++.h>
using namespace std;
namespace Flandre_Scarlet
{
#define mod 1145141919
#define F(i,l,r) for(int i=l;i<=r;++i)
#define D(i,r,l) for(int i=r;i>=l;--i)
#define Fs(i,l,r,c) for(int i=l;i<=r;c)
#define Ds(i,r,l,c) for(int i=r;i>=l;c)
#define MEM(x,a) memset(x,a,sizeof(x))
#define FK(x) ME... |
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <algorithm>
using namespace std;
void _plus(long long &v, long long p, long long X)
{
v += p;
if (v < 0)
{
v += X;
}
else
{
v = v % X;
}
}
typedef pair<i... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define np next_permutation
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
#define vii vector<vi>
#define vb vector<bool>
#define ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, x;
ll a[55], X[55], dp[55][2];
// X + t = y
ll solve(int pos, int carry){
if(pos == n-1) return 1;
if(dp[pos][carry] != -1) return dp[pos][carry];
ll res = 0;
ll have = X[pos] + carry;
ll need = a[pos+1]/a[pos];
if(have ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
ll X;
cin >> N >> X;
vector<ll> A(N);
for(int i=0; i<N; i++) cin >> A[i];
vector<ll> mag(N-1);
for(int i=0; i<N-1; i++) {
mag[i] = A[i+1] / ... |
//#include<bits/stdc++.h>
#include<map>
#include<queue>
#include<time.h>
#include<limits.h>
#include<cmath>
#include<ostream>
#include<iterator>
#include<set>
#include<stack>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i,m,n) for(int i=m;i<=n;i++)
#define m... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
te... |
#include <iostream>
using namespace std;
int main()
{
// freopen("in.txt","r",stdin);
string cadena;
cin>>cadena;
if(cadena[0]==cadena[1]&&cadena[1]==cadena[2])
{
cout<<"Won"<<endl;
}
else
{
cout << "Lost" << endl;
}
return 0;
}
| #include <iostream>
#include <string>
#include <array>
#include <algorithm>
using namespace std;
int main()
{
string s;
cin >> s;
if (s.size() == 1) {
if (s == "8") {
cout << "Yes" << endl;
return 0;
}
}
if (s.size() == 2) {
int si = (s[1] - '0') * 10 + s[0] - '0';
int sj = (s[0] - '0') * 10 + s[1... |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
long long m;
cin >> m;
vector<int> a(n);
for(int i=0;i<n;i++) cin >> a[i];
long long mod=1000000007;
int fs=5050505;
vector<long long> fact(fs),ifact(fs),invs(fs);
{
fact[0]=... | //Utkarsh.25dec
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 998244353
#define rep(i,n) for(ll i=0;i<n;i++)
#define loop(i,a,b) for(ll i=a;i<=b;i++)
#define vi vector <int>
#define vs vector... |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int min = 1000000000 + 1;
for(int i = 0; i < N; i++) {
int A, P, X;
cin >> A >> P >> X;
if((X-A) > 0) {
if(P < min) {
min = P;
}
}
}
if(min == (100000... | #include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::vector;
int main()
{
unsigned int n;
vector<long> a, p, x;
unsigned int i;
long t;
long ans = -1;
// input
cin >> n;
for (i = 0; i < n; i++) {
cin >> t;
a.push_back(t);
cin >> t;
p.push_back(t);
cin >... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include<iostream>
using namespace std;
string X;
long M;
main()
{
cin>>X>>M;
int d=0;
for(char c:X)if(c-'0'>d)d=c-'0';
if(X.size()==1)
{
cout<<(d<=M)<<endl;
return 0;
}
long L=d,R=M+1;
while(R-L>1)
{
long mid=(L+R)/2;
bool ng=false;
long now=0;
for(char c:X)
{
if(now>M/mid)
{
ng=true;
... |
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <numeric>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#end... | #include<bits/stdc++.h>
#define N 200005
#define mod 1000000007
using namespace std;
typedef long long ll;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return x*f;
}
inline void write(ll x){
if(x<0)putch... |
#include <bits/stdc++.h>
using namespace std;
#ifdef __DEBUG__
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr << " " << H; debug_out(T...);}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#d... | #include<bits/stdc++.h>
using namespace std;
long long int dp[20][(1<<18)];
int n;
vector<pair<int,int>>v[20];
long long int fun(int pos,int mask)
{
//if(mask>n)return 0;
long long int &ans=dp[pos][mask];
if(ans!=-1)
return ans;
for(auto p:v[pos])
{
int y=p.first;
int z=... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ... | #include<bits/stdc++.h>
using namespace std;
template <class T> ostream &operator << (ostream &os, const vector<T> &p) { os << "["; for (auto&it : p) os << it << " "; return os << "]";}
template <class S, class T> ostream &operator << (ostream &os, const pair<S, T> &p) { return os << "(" << p.first << "," << p.second <... |
//g++ 7.4.0
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N,M; cin>>N>>M;
string s[N];
ll ans = 1;
for(ll i=0;i<N;++i)
cin>>s[i];
for(ll ... | //#include <bits/stdc++.h>
//using namespace std;
#include <cstdio>
#define rep(i,_l,_r) for(signed i=(_l),_end=(_r);i<=_end;++i)
#define fep(i,_l,_r) for(signed i=(_l),_end=(_r);i>=_end;--i)
#define erep(i,u) for(signed i=head[u],v=to[i];i;i=nxt[i],v=to[i])
#define efep(i,u) for(signed i=Head[u],v=to[i];i;i=nxt[i],v=... |
#include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector< vector<int> >;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<cla... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll =long long;
using vi = vector<int>;
using vl = vector<ll>;
using vc = vector<char>;
using vii = vector<vector<int>>;
using vll = vector<vector<ll>>;
using vcc = vector<vector<char>>;
using vs = vector<string>;
usi... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); // Do not flush "cout" when processing "cin".
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s.at(i);
}
int ans = 0;
for (int i = 0; i < h; i++) {
for (int j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,ct=0;
string s;
cin >> n >> s;
vector<char> t;
for(int i=0; i<n; i++){
t.push_back(s[i]);
if(t.size()>=3&&t[t.size()-3]=='f'&&t[t.size()-2]=='o'&&t[t.size()-1]=='x'){
t.pop_back();
t.pop_back();
t.pop_back();
ct+... |
#include <bits/stdc++.h>
using namespace std;
#define prc(n) fixed<<setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define endl "\n"
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define rall(v) v.rbegin(),v.rend()
#define siz(x) (int)x.size... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
long... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define all(v) v.begin(), v.end()
#define rep(i, ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,m,n) for (int i = (m); i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; --i)
#define RREP(i,m,n) for (int i = (n)-1; i >= (m); ++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespac... |
//
// Created by yamunaku on 2020/12/26.
//
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) f... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#define it register int
#define ct const int
#define il inline
typedef long long ll;
#define rll register ll
#define cll const ll
#define mkp make_pair
using namespace std;
const int N=1000005;
int n,a,b;
ll ans1,ans2,ans3;
int main(){
scanf("%d",&n);
while(n--... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
// int t;
// cin >> t;
// while (t--)
// {
ll n;
cin>>n;
cout<<n-1;
// }
} | #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); +... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define ll long long
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define RF(type, i, a, b, decr) for (type i = a; i >= (type)(b); i -= (type)(decr))
#define sz(a) sizeof(a)
#define deb(a) cerr ... | # include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int count=0;
cin>>N;
int A[N];
int B[N];
for(int i=0;i<N;i++){
cin>>A[i];
}
for(int i=0;i<N;i++){
cin>>B[i];
}
int maxi=*max_element(A,A+N);
int mini=*min_element(B,B+N);
... |
#include<bits/stdc++.h>
using namespace std;
tuple<long long, long long, long long> ext_gcd(long long a, long long b) {
if (b == 0) return {a, 1, 0};
auto [gcd, y, x] = ext_gcd(b, a%b);
y -= a/b * x;
return {gcd, x, y}; // a*x + b*y = gcd
}
pair<long long,long long> crt(const vector<long long> &r, const vecto... | /*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int ,int > pii;
mt19937 rng(chrono::steady_clock::now().time_sinc... |
#line 1 "/home/siro53/kyo-pro/compro_library/template/template.cpp"
#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;
... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int,int>
#define mk make_pair
#define pb push_back
#define eb emplace_back
#define ins insert
#define fi first
#define se second
#define Rep(x,y,z) for(int x=y;x<=z;x++)
#define Red(x,y,z) for(int x=y;x>=z;x--)
using... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.