code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
// AtCoder.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE ///???
#endif ///????
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include... | #include <bits/stdc++.h>
using namespace std;
#define BUFF ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define rep(i,a,n) for(int i=a;i<=n;++i)
#define per(i,n,a) for(int i=n;i>=a;--i)
#define ll long long
inline ll read(){ll f=1;ll x=0;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(... |
/********include********/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <ra... | #include<bits/stdc++.h>
#define ll long long
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define N 2005
#define M 1000000007
#define pii pair<ll,ll>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
string s[2005];
int h,w;
ll dp[N][N][5];
bool valid(int i,int j)
{
return i>=0&&i<h&&j>=0&&j<w&... |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 /* pi */
using namespace std;
using ll = long long;
int main() {
int N;
int A;
int B;
cin >> N;
cin >> A;
cin >> B;
cout << N - A + B << endl;
} | // Code for A - box
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define FOR(i,x,y) for(ll i=x;i<(ll)(y);i++)
#define MOD 1000000007
#define mod(x) ( (x) % MOD + MOD ) % MOD
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
templ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; ++i)
int debug = 0;
const int N = 5e5;
int n, strong, cur, start, was[N], a[N], b[N], p[N];
vector <array <int, 2>> ans;
void fail() {
puts("-1");
exit(0);
}
void sw(int i, int j) {
swap(p[i], p[j]);
ans.push_b... |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<bool> vb;
... |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
using ui = unsigned int;
u... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
#include <functional>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <unordered_set>
using namespace std;
typedef long long ll;
#define rep(i,n) f... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
#define mp make_pair
#define pb push_back
#define T ll t; cin>>t; while(t--)
#define print(name) for(auto t:name){cout<<t<<" ";}cout<<endl;
#define mod 1000000007
#define mod1 998244353
#define inf 1000000000000000000
#define... | #include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,f[1500009],pas;
multiset <int> s,h;
multiset <int>::iterator it,tt;
void ins(int q){
it=h.lower_bound(q);
if(it!=h.end()&&(*it)==q){
h.erase(it);
}
s.insert(q);
}
void er(int q){
it=s.lower_bound(q);
s.erase(it);
it=s.lower_bound(q);
i... |
#include <assert.h>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <map>
using namespace std;
#define all(x) x.begin(), x.end()
const long long mod = (long long) (1e9 + 7);
long long powerf(long long a, long... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll x,y;
unordered_map<ll,ll> um;
ll solve(ll num){
if(num==1) return abs(x-num);
if(um.find(num)!=um.end()) return um.find(num)->second;
ll result;
if(num%2) result = min(abs(x-num),min(solve((num+1)/2)+2,so... |
#include <iostream>
#define ll long long
#define f first
#define s second
#define inf 2000000000
using namespace std;
int n, m, nod[20][20], dp[(1<<18)+10], isOK[(1<<18)+10];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i=1; i<=m; i++)
{ ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define itn int
#define ll long long
#define ull unsigned long long
using namespace std;
ll read(){
ll a=0,b=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')b=-1;c=getchar();}
while(c>='0'&&c<='9')a=a*10+c-48,c=getchar();
r... |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define MO 1000000007
#define mem(a,s) memset(a,s,sizeof(a))
#define IOS ios_base::sync_with_stdio(0); cin.tie(NULL);
#define lop(i,s,e) for(int i=s;i<e;i++)
#define lopi(i,s,e) for(int i=s;i>=e;i--)
#define prina(a,n) ... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<bool> ju(2*n+1);
vector<int> a(n),b(n);
bool res=true;
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
a[i]--,b[i]--;
if(a[i]>=0 && ju[a[i]]) res=false;
if(b[i]>=0 && ju[b[i]... |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
LL Pow(LL x,LL y,int mod)
{
if(y==0) return 1ll;
if(y==1) return x;
LL a=Pow(x,y>>1,mod);
if(y&1) return (((a*a)%mod)*x)%mod;
return (a*a)%mod;
}
int main()
{
LL a,b,c;
cin>>a>>b>>c;
LL x=Pow(b%4,c,4)+4;
cout<<Pow(a%10,x,10);
}
| #include <bits/stdc++.h>
#include <cmath>
using ll = long long;
const ll INF = __LONG_LONG_MAX__;
using namespace std;
int main() {
long double x, y, r;
cin >> x >> y >> r;
long double e = 1e-9;
//cout << e << endl;
ll ans = 0ll;
for(ll i = (ll)(floor(y+r)); i >= (ll)(ceil(y-r)); i--) {
... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... |
// .-""""-.
// / j \
// :.d; ;
// $P :
// .m._ $$ :
// dSMMSSSss.__$b. __ :
// :MMSMMSSSMMMSS$$b $P ;
// SMMMSMMSMMMSSS$$$$ :b
// dSMMMSMMMMMMSSMM$$b.dP ... | #include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define fp(x, a, b) for(int x = a; x < b; x++)
#define fn(x, a, b) for(int x = a; x > b; x--)
#define f(x, m) for(auto x : m)
#define cpu() ios::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#def... |
# include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
cout << 50*N*(N+1)*K + K*(K+1)*N/2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
long long int sum = 0;
cin >> n >> k;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= k; j++) {
sum += i*100+j;
}
}
cout << sum << endl;
} |
#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>
using namespace std;
#define stp(var, init, end) for (auto var = init; var < end; ++var)
#define stpe(var, init, end) for (auto var = init; var <= end; ++var)
#define ll long long
int main(void)
{
int n, rnum = 0, gnum = 0, bnum = 0;
cin >> n;
vector<ll> rdogs;
vector<ll> gdo... |
#include <bits/stdc++.h>
#define rep(i,N) for(int i=0; i<(N); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i,N) cin >> a.at(i);
int ans=1<<30;
rep(s,1<<(N-1)){
int o=0;
int now=0;
rep(i,N){
o |= a.at(i);
if(s>>i&1){
now ^= o;
o = 0... | #include <bits/stdc++.h>
#define endl '\n'
#define umap unordered_map
#define all(var) var.begin(), var.end()
#define input freopen("input", "r", stdin)
#define output freopen("output", "w", stdout)
#define Fast ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL)
#define dbg(x) cerr << #x << " => " << x << endl
u... |
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using ll = long long;
const int MOD = 1e9+7;
const ll INF = 1e18;
const int MAXN = 1e6+5;
int main() {
FASTIO
ll n, m, t;
cin >> n >> m >> t;
vector<pair<ll,ll>> v(m);
for(aut... | #include<bits/stdc++.h>
using namespace std;
///******************************** C o n t a i n e r ********************************///
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vii;
typed... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bou... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#define amax(a, b) a = std::max(a, b)
#define amin(a, b) a = std::min(a, b)
using ll = long long;
int main() {
ll N, K;
std::cin >> N >> K;
std::vector<ll> sum2cnt(2*N-1);
for (ll i = 0; i < 2*N-1; i++)... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main() {
char op1[2], op2[2];
cin >> op1 >> op2;
if (op1[0] == 'Y') op2[0] -= 32;
cout << op2[0] << endl;
return 0;
} | //#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (in... |
#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/trie_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define inf 1e18
#defin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(i = 0; i < n; i++)
bool dfs(vector<int> &p, int swapFlag, int dep, vector<int> &ans) {
int n = min(4, (int)p.size());
int i;
rep(i, n) if (p[i] != i) break;
if (i == n) return true;
if (dep >= n * n) return false;
rep(i, ... |
#include <iostream>
using namespace std;
typedef long long ll;
const int maxn = 1e6+10,mod = 1e9+7;
int a,b,x,y,f[maxn][2];
int main() {
cin >> a >> b >> x >> y;
f[a<b?a:b][a<b?0:1] = 0;
f[a<b?a:b][a<b?1:0] = x;
for(int i = min(a,b)+1; i <= max(a,b); i++){
f[i][0] = min(f[i-1][0]+y,f[i-1][1]+x);
f[i][1] = min(f... | #include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,x,y;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&x);
scanf("%d",&y);
int ans;
if(y > 2*x){
if(a == b){
ans = x;
}... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=10009;
struct node {
set<int>q;
} d[N];
int n,ins[N],c[N],dfn[N],low[N],num,cnt=0;
double ans=0;
vector<int>w[N],w1[N],scc[N];
stack<int>st;
set<int>q;
void Tarjan(int x) {
dfn[x]=low[x]=++num;
st.push(x),ins[x]=1;
for(int i=0... | #include<bits/stdc++.h>
#define mp make_pair
#define pb emplace_back
#define fi first
#define se second
#define ick cout << "ickbmi32.9\n"
using namespace std;
struct edge{
double w = 1;
int t = 0;
};
edge r[30][30], d[30][30];
int dx[]{0, 0, 1, -1};
int dy[]{1, -1, 0, 0};
char mv[]{'R', 'L', 'D', 'U'};
int g... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
#define ll long long
#define ld long double
using namespace __gnu_pbds;
using namespace std;
templat... | #include <algorithm>
#include <iostream>
#include <queue>
#include <bitset>
using namespace std;
#define all(x) (x).begin(), (x).end()
using ll = long long;
const int MOD = 1e9 + 7;
void solve() {
int a, b, w;
cin >> a >> b >> w;
w *= 1000;
int x = 1e9, y = -1;
for(int i = 1; i <= w; i++) {
... |
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * A + B * B < C * C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #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... |
//IQ134高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<... | #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>
using namespace std;
#define rep(i,n) for(int (i)=0; (i)<(int)(n); (i)++)
#define all(x) (x).begin(), (x).end()
#define sqr(x) (x)*(x)
#define CEIL(a,b) ((a)+(b)-1) /(b)
typedef long long ll;
const int INF = 1001001001;
void sort_second(vector<pair<ll, ll>> &A, int N); //A:array of pair, N:s... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<set>
//#include<bits/stdc++.h>
#define int long long
constexpr long long mod = 1000000007;
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define all(x)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define f(i,n) for(i=0;i<n;i++)
#define f1(i,n) for(i=1;i<n;i++)
#d... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<cmath>
#include<iomanip>
#include<map>
using namespace std;
#define R (long long)(1e9 + 7)
#define M 998244353
#define INF 1e18L
struct dsu
{
vector<int> rank, parent, c;
vector<map<int, int>> f;
int n;
dsu(int n, vec... |
#include<iostream>
#include<math.h>
#include<stdlib.h>
#include<string>
#include<limits.h>
#include<utility>
#include<vector>
#include<tuple>
#include <map>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll i=0;i<n;i++)
#define ALL(A) A.begin(... | #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<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD = 1000000007;
#define fi first
#define se second
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define repe(i,n) for(int i = 0 ; i <= n ; i++)
#define repb(i,a,b) for(int i = a ; i < b ; i++)
#define repeb(i,a,b) for(... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s... |
#include<bits/stdc++.h>
#define fast {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define all(x) (x).begin(), (x).end()
#define Unique(a) a.erase(unique(all(a)), a.end())
#define ld long double
#define pb push_back
#define fi first
#define se second
#define inf 1e9
using namespace std;
typedef long long int... | #include <bits/stdc++.h>
using namespace std;
const int N=2e5+2;
int n,q,f[N];
int cnt,hd[N],to[N],nxt[N];
int hd1[N],d[N],nxt1[N],ans[N];
void adde(int x,int y)
{
nxt[++cnt]=hd[x];
to[hd[x]=cnt]=y;
}
void dfs(int x,int dep)
{
for(int i=hd1[x];i;i=nxt1[i])
ans[i]=-f[d[i]];
++f[dep];
for(int i=hd[x];i;i=nxt[i])
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
long long k;
cin >> n >> k;
long long dp[4][3000005]={0};
dp[0][0]=1;
for(int i=0;i<3;i++){
for(int j=0;j<=i*n;j++){
dp[i+1][j+1]+=dp[i][j];
dp[i+1][j+n+1]-=dp[i][j];
}
for(int j=1;j<=(i+1)*n;j++){
dp[i+1][j]+=dp[i... | #include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c> {i, j}; }
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("tpl.txt","r",stdin);
#endif
vector<int> vc;
int n,m;
cin >> n >>m;
for(int i = 0 ; i < n; i ++){
int t; cin >> t;
if(t != m)
vc.push_back(t);
}
for(int i = 0 ; i < vc.size() ; i++)
cout << vc[i] << " ";
return... | //----AUTHOR:kkdrummer----/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
type... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
long long X;
scanf("%d %lld", &n, &X);
vector <int> a(n);
for(int i = 0; i < n; i++)scanf("%d", &a[i]);
long long res = X;
for(int k = 1; k <= n; k++){
vector < vector <long long> > dp(k + 1, vector <long long> (k, -... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 5005;
int mod = 998244353;
int n , m;
ll pw[N];
ll a[N][N];
int main()
{
// freopen(".inp","r",stdin);
// freopen(".out","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
pw... |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
int n, q;
const int N = 2e5+10;
int p[N], s[N], c[N];
map<int, int>res[N];
int f(int x) {
return (p[x] == x ? x : p[x] = f(p[x]));
}
void merge(int u, int v) {
u = f(u), v = f(v);
if(u == v)
return;
if(s[u] < s[v])
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define MP make_pair
con... |
#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>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)6e18
#define pii pair<ll,ll>
#define mod 1000000007 // 998244353
#define ff first
#define ss second
#define srt(v) if(!v.empty())sort(v.begin(),v.end())
#define rev(v) if(!v.empty())reverse(v.begin(),v.end())
#d... |
#include <iostream>
using namespace std;
int main() {
int X,Y,Z,sunuke;
cin >> X >> Y >> Z;
sunuke = (Y * Z - 1)/ X;
cout << sunuke << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+... |
#include<bits/stdc++.h>
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int&
#define I inline
#define W while
#define N 500000
#define LL long long
using namespace std;
int n,nxt1[N+5],nxt2[N+5];char s1[N+5],s2[N+5... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<pll,pll> ppp;
typedef vector<ll> vll;
typedef vector<pll> vp;
typedef priority_queue<pll,vp,greater<... |
#include <bits/stdc++.h>
#define mod 1000000007
#define MOD 1000000007
#define ll long long int
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define MAXN 100009
#define pi 3.1415926535897932384626
using namespace std;
ll power(ll x, ll y) { ll ans = 1; x %= MOD; while (y) {if (y &... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#define int long long
using namespace std;
const int N = 1e6 + 10, M = 2e6 + 10, inf = 0x3f3f3f3f;
const long long Linf = 0x3f3f3f3f3f3f3f3f;
inline int read() {
bool sym = 0; int res = 0; char ch = get... |
#include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;
const int max_n = 5e3+10;
const int inf = 1e18;
const int Mod = 998244353;
int n,m;
int dp[22][max_n];
int fact[max_n];
int NCR[max_n][max_n];
int f(int j,i... | #include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int res = 2000000000;
for (int i = 0; i < (1 << (n - 1)); i++)
{
int xored = 0;
int ored = 0;
for (int j = 0; j <= n;... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <queue>
#include <numeric>
using namespace std;
using ll = long long;
#define For(i,a,b) for(ll i=(a);i<(ll)(b);i++)
#define rFor(i,a,b) for(ll i=(a);i>=(ll)(b);i--)
#define co(a) cout<<a<<endl
#define SORT(a) sort... |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <list>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <fstream>
#include <sstream>
#include <unordered_map>
#include <ctime>
#include <assert.h>
using namespace std;
//#define ATCODER
#ifdef ATCODER
#inc... | #include <stdint.h>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);//cout.precision(dbl::max_digits10);
#define pb(x) push_back(x)
#define mod 1000000007ll //998244353ll
#define vi vector<int>
#define v... |
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+10;
bool p[maxn];
int prime[maxn],mu[maxn],cnt;
long long sum[maxn];
int main()
{
int l,r;
scanf("%d %d",&l,&r);
mu[1]=1;
for(int i=2;i<=r;i++){
if(!p[i]){prime[++cnt]=i,mu[i]=-1;}
for(int j=1;i*prime[j]<=r&&j<=cnt;j++){
p[i*prime[j]]=1;
i... | // #pragma GCC target ("avx,avx2")
// #include <bits/extc++.h>
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define f first
#define s second
using namespace std;
// using namespace __gnu_pbds;... |
#include<bits/stdc++.h>
#define int long long
#define N 100010
#define re register
using namespace std;
int n,m,p[N],q[N],mi,tmp;
vector<int> a[N],b[N];
char s[N];
template <class T> inline void read(T &x)
{
x=0;int g=1;char s=getchar();
for (;s<'0'||s>'9';s=getchar()) if (s=='-') g=-1;
for (;s>='0'&&s<='9';s=get... | #include<bits/stdc++.h>
#define pb push_back
#define eb emplace_back
using namespace std;
//#define DEBUG
#ifdef DEBUG
template<typename ...Args>
int debug(const Args &...args){
return fprintf(stderr,args...);
}
#else
#define debug(...) void()
#endif
typedef unsigned long long ull;
typedef unsigned uint;
typedef lon... |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <string>
#include <set>
#include <map>
#include <random>
#include <bitset>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <deque>
... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pci pair <char, int>
#define pld pair <ld, ld>
#define ppld pair <pld, pld>
#define ppll pair <pll, pll>
#define pldl pair <ld, ll>
#define vll vector <ll>
#d... |
#line 2 "header.hpp"
//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H
// template version 2.0
using namespace std;
#include <bits/stdc++.h>
// varibable settings
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;
#define _overload3(_1, _2, _3, name, ...) name
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MO... |
#include <bits/stdc++.h>
constexpr int DEBUG = 0;
using namespace std;
using int64 = long long;
#define REPEAT(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
constexpr int64 P = 998244353;
class FF {
private:
int64 x_;
void Normalize() {
if (0 <= x_ && x_ < P) { return; } x_ %= P; if (x_ < 0) { x_ += P; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a) a.resize(unique(a.begin(),a.end()... |
#include <bits/stdc++.h>
using namespace std;
#define int unsigned long long
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define MP make_pair
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, ty... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define rep(x,a,b) for(int x=(a);x<=(b);x++)
#define per(x,a,b) for(int x=(a);x>=(b);x--)
#define reP(x,a,b) for(int x=(a);x<(b);x++)
#define Per(x,a,b) for(int x=(a);x>(b);x--)
#define scf(a) scanf("%d",&a)
#define scfll(a) s... |
#include<bits/stdc++.h>
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define pii pair<int,int>
#define fi first
#define se second
#define PB push_back
#define ll long long
#define ull unsigned long long
#define y1 orzkcz
using namespace std;
const int N... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vec... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
void dbg_out() { cerr << "\b\b]\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ cerr << H << ", "; dbg_out(T...);}
#define watch(...) cerr ... | #include <bits/stdc++.h>
using namespace std;
struct p{
long long int w;
long long int c;
};
p tab[200007];
vector <long long int> edges[200007];
int main()
{
long long int m, x, y, n, j, i, z=-1000000000000000007, a, b=1, m1=0, m2=0;
cin >> n >> m;
for(i=0; i<n; i++){
cin >> a;
... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... | #include <bits/stdc++.h>
using namespace std;
#define sync std::ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define int long long
#define loop(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b,c) for(int i=a;i<=b;i=i+c)
#define RFOR(i,a,b,c) for(int i=a;i>=b;i=i-c)
typedef long long ll;
typedef lo... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf=0x3f,INF=0x3f3f3... | #include<functional>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<utility>
#include<string>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
using namesp... |
#include<stdio.h>
#include<stdlib.h>
#include<bits/stdc++.h>
//Do DEBUG OR NOT
//#define DEBUG
#ifdef DEBUG
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e :... | #include <map>
#include <set>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ull unsigned long long
#define cint const int&
#define Pi acos(-1)
const int mod = 1e9+7;
const int inf_int ... |
#include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define fi first
#define se second
#define pub push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int i=(int)(l);i<(int)(r);... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
string s;
long long n=10,a[11],b[11],c[5],ans,p;
int main(){
long long i,j,u,v;
cin>>s;
for(i=0;i<n;i++){
if(s[i]=='o') a[i]=1;
if(s[i]=='x') a[i]=-1;
}
for(i=0;i<=9999;i++){
u=i;
memset(b,0,sizeof(b));
c[1]=... |
#include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf LLONG_MAX
#define int long long
#define mod 998244353
int h, w;
string s[500];
int ans =... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... |
#include<bits/stdc++.h>
#define ll long long int
#define nl "\n"
#define vec vector<ll>
#define pb push_back
#define MOD 1000000007
#define test ll testc;cin>>testc;while(testc--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
ll bpow(ll a,ll b) {ll ans=1;while (b>0){if (b&1) ans=(ans... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INCANT cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12)
const int INF = 1e9 + 7;
const ll LINF = 1e18 + 7;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
void debug_out();
template <typename Head, typename... ... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define pll pai... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, init, end) f... |
/*
* author: cyclexit
* start from: 2021-01-05 10:21
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline double slope(pair<double, double> x, pair<double, double> y) {
return fabs(y.second - x.second) / fabs(y.first - x.first);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0... | #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 pair<int,int> pii;
typedef pair<int,pair<int,int>> piii;
template <typename T>
using ordered_set = __gnu_pbds::... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
#define int long long
signed main() {
int H, W; cin >> H >> W;
vector<vector<int>>A(H, vector<int>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++)cin >> A[i][j];
}
int ans = INF... | //00:04
#include <bits/stdc++.h>
using namespace std;
long long inf = 1000000007;
typedef long long ll;
int main(){
int h, w, small = 101, cnt = 0;
cin >> h >> w;
vector<vector<int>> a(h, vector<int>(w, 0));
for(vector<int>& a1:a){
for(int& v: a1) cin >> v;
}
for(int i=0; i<h; ++i){
... |
#include <bits/stdc++.h>
using namespace std;
//Template Begin
#define ll long long
#define int long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define be begin()
#define en end()
#define le length()
#define endl '\n'
using VI=vector<int>;
using VLL=vector<ll>;
using PII=pair<in... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll mod = 1000000007;
const double PI = 3.141592653589793238460;
const int INF = 1e9+5;
const ll lINF = 1e16+1;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<ll> isprime = {2,3,5,7,... |
#include <cstdio>
#include <set>
using namespace std;
const int max_l = 1000;
char mp[max_l][max_l+1];
int dsu[max_l<<1];
inline int my_min(int a, int b) { return (a < b)? a:b; }
int find(int x)
{
if (dsu[x] != x) dsu[x] = find(dsu[x]);
return dsu[x];
}
bool sam(int a, int b) { return find(a) == find(b); }
void... | #include<bits/stdc++.h>
using namespace std;
#define int long long
vector<set<int>> v;
vector<char> colour;
bool isValid(int i, char c){
if(colour[i]!='.' && colour[i]!=c){
return false;
}
for(auto z:v[i]){
if(colour[z]==c){
return false;
}
}
return true;
}
int wa... |
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<vector>
#include<cstdio>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define SZ(v) ((int)(v).size())
typedef long long LL;
typede... | #include <bits/stdc++.h>
#define fo(i, k, n) for (ll i = k; i < n; i++)
#define rfo(i, k, n) for (ll i = k; i >= n ; i--)
#define ll long long
#define ld long double
#define que queue
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define gcd(m,n) __gcd( m, n)
#define sq(x) ... |
/* -*- coding: utf-8 -*-
*
* d.cc: D - Cooking
*/
#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<utili... | //Code by Anshuman Das Gupta
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define MOD 1000000007
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define loop(I,N) for(int i=I;i<N;i++)
#define sortvec(V) sort(V.begin()... |
/* Hardwork allways pays off */
//You never know how close to the solution you are ,so keep practicing
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pii pair<int,int>
#define endl '\n'
#define REP(i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
#define all(x) x.begin(),x.end()
typedef pair<int, pi> pii;
const int maxn = 500010;
const int INF = LLONG_MAX/2;
int x, Y;
map <int, i... |
#include<iostream>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin>>n;
ll ans=0;
for (ll i=1; ; i++) {
string s=to_string(i)+to_string(i);
ll t=stoll(s);
if (t>n) {
cout<<i-1<<"\n";
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 300000 + 5;
const int INF32 = 0x3f3f3f3f;
int n;
double ans;
int main() {
scanf("%d", &n);
for (int i = 1; i < n; i ++) ans += (double)n / i;
printf("%.10lf\n", ans);
return 0;
} |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #include <bits/stdc++.h>
using namespace std;
template<int MAX>
struct Combination {
vector<long long> _inv, _fac, _ifac;
const long long MOD;
Combination(long long mod) : _inv(MAX+1), _fac(MAX+1), _ifac(MAX+1), MOD(mod) { init(); }
void init() { init_inv(), init_fac(); }
void init_inv() {
... |
#include <bits/stdc++.h>
using namespace std;
#define mnto(x, y) x = min(x, (__typeof__(x)) y)
#define mxto(x, y) y = max(x, (__typeof__(x)) y)
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s - 1; i >= e; i--)
typedef long long ll;
#define ALL(_a) _a.begin(), _a.end()
#define pb e... | #include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=2e5,maxm=4e5;
int n;
int f[maxm+5];
int szp[maxm+5],sze[maxm+5];
int ans;
int find(int x){
return x==f[x]?x:f[x]=find(f[x]);
}
int main(){
scanf("%d",&n);
for(int i=1;i<=maxm;i++) f[i]=i,szp[i]=1;
for(int i=1,a,b;i<=n;i++){
s... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H, W, N, M;
cin >> H >> W >> N >> M;
vector<int> A(N), B(N), C(M), D1(M);
for(int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
A[i]--;
B[i]--;
}
for(int i = 0; i < M; i++) {
cin >> C[i] >> D1[i];
C... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
#define ll long long int
#define f(i,l,n) for(int i=l;i<n;i++)
#define E "\n"
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#def... |
#include<bits/stdc++.h>
using namespace std;
#define BOOST ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rept(it,v) for(auto it=v.begin();it!=v.end();it++)
#define pre(i,a,b) for(int i=a;i>=b;i--)
#define mp make_pair
#define pb push_back
#define endl "\n"
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
struct UnionFind {
vector<int> p;
UnionFind(int n) : p(n, -1) {}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (-p[x] < -p[y])
... |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... | #include <bits/stdc++.h>
#define int long long
using namespace std;
inline void max_self(int &a, int b) {
a = max(a, b);
}
int N, T, ans;
vector < int > a, suf;
void Back(int index, int sum) {
if(sum <= T)
max_self(ans, sum);
for(int k = index + 1; k <= N && ans < T && sum < T; ++k) {
if... |
#include <bits/stdc++.h>
using namespace std;
int a[7], temp[7];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string S, X;
cin >> S >> X;
a[0] = 1;
for(int j = n - 1;j >= 0;--j) {
if(X[j] == 'T') {
for(int i = 0;i < 7;++i)
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a]<0){
return a;
}... |
#include <cstring>
#include <iostream>
using namespace std;
using ll = long long;
const int MAXN = 102;
const int MAXC = 122505;
ll k, mod, table[MAXN][MAXC], ret[MAXN];
int n, now;
void calc() {
memset(table, 0, sizeof(table));
table[0][0] = 1;
for (int i = 1; i <= n; ++i) {
int c = (k * (i + 1... | #include <bits/stdc++.h>
using namespace std;
long long MOD;
int main(){
int N, K;
cin >> N >> K >> MOD;
vector<vector<long long>> f(N);
f[0].push_back(1);
for (int i = 1; i < N; i++){
int sz = f[i - 1].size();
f[i] = vector<long long>(sz + i * K, 0);
for (int j = 0; j < sz; j++){
f[i][j] = ... |
#include<iostream>
using namespace std;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * d - b * c << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define debug printf("%d %s\n",__LINE__,__FUNCTION__);fflush(stdout)
using ll=long long;using i64=long long;using db=double;
using u32=unsigned int;using u64=unsigned long long;using db=double;
using pii=pair<int,int>;using vi=vector<int>;
using qi=queue<int>;using pqi=prior... |
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
const int N = 2e5 + 5;
int mod = 998244353;
int pre[N]{};
void add(int pos){
pos = N - pos - 1;
for (int i = pos; i < N; i += i & -i) pre[i]++;
}
int query(int pos){
pos = N - pos - 1;
int ans = 0;
f... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
int res = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
map<int, int> mp;
mp[0] = 1;
int sum = 0;
int c = 1;
for ... |
//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 <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
cin.tie(nullptr)->sync_with_stdio(false);
vector<int>primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
vector<int>dp(1<<20);
dp[0] = 1;
int a,b;
cin >> a >> b;
for(int i = a; i<=b; i++){
int v = 0;
for(int j ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
int a[n], b[n];
vector <ll> v;
ll sum = 0;
for(int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
v.push_back(2LL * a[i] + b[i]);
sum += a[i];
}
sort(v.begin(), v.end... | #include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rl register long long
ll n,x,cur,ta,tb;
int main(){
scanf("%lld %lld",&n,&x);x*=100;
for(rl i=1;i<=n;++i){
scanf("%lld %lld",&ta,&tb);
cur+=ta*tb;
if(cur>x) return printf("%lld\n",i),0;
}
pr... |
#pragma GCC diagnostic warning "-Wextra"
#pragma GCC diagnostic warning "-Wshadow"
#include <bits/stdc++.h>
using namespace std;
template <class A, class B> bool cmin(A& a, B b) { return a > b && (a = b, true); }
template <class A, class B> bool cmax(A& a, B b) { return a < b && (a = b, true); }
template <class A, cla... | #define taskname "test"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
int n, m;
int total = 0;
void read_input()
{
cin >> n >> m;
for(int i = 1; i <= n; ++i)
{
... |
#include <bits/stdc++.h>
#define endl "\n"
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define ll long long
#define llu unsigned long long
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define ABS(X) ((X) < 0 ? -(X) : (X))
#define LCM(X, Y) (((X... | #include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define ll long long
//#define file
using namespace std;
int T,n,i,j,k,l;
int a[501];
int d[250001],tot;
bool bz;
void add(int x)
{
swap(a[x],a[x+1]);
d[++tot]=x;
bz^=1;
}
void Checker()
{
int i;
fo(i,1,n) if ... |
#include<bits/stdc++.h>
using namespace std;
#define N 200005
#define INF 1e17
#define MP make_pair
const int mod = 998244353;
typedef long long LL;
unordered_map<int, int> F;
int f(int n, int k)
{
if (n < k) return 0;
if (n == k) return 1;
if (k == 0) return 0;
if (F.count(n*3005+k)) return F[n*3005+k];
LL ... | #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <string.h>
#include <algorithm>
#include <cmath>
#define max(a,b) ((a) > (b) ? (a) : (b))
#define min(a,b) ((a) < (b) ? (a) : (b))
#define pb push_back
#define cl clear
#define MAXN 100005
using namespace std;
typedef long long ll;
typed... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m1, m2;
string ans = "satisfiable";
for(int i=0; i<n; i++){
string s;
cin >> s;
if(s[0] == '!'){
s = s.substr(1, s.size() - 1);
if(m2.count(s))
ans = s;
m1[s]++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
int main() {
int N;
cin >> N;
unordered_map<string, int... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
int inf = 1001001001;
ll INF = 1001001001001001001;
#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 pb push_back
#define pf push_fro... | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define... |
#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>
using namespace std;
#define debug printf("%d %s\n",__LINE__,__FUNCTION__);fflush(stdout)
using ll=long long;using i64=long long;using db=double;
using u32=unsigned int;using u64=unsigned long long;using db=double;
using pii=pair<int,int>;using vi=vector<int>;
using qi=queue<int>;using pqi=prior... |
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<LL... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define all(x) x.begin(), x.end()
const int p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
void solve() {
int n, m = sizeof(p) / sizeof(int);
cin >> ... |
#ifdef _LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
string solve(ll n) {
if(n == 0)
return "Yes";
while(n % 10ll == 0ll)
n /= 10ll;
string s = to_string(n);
bool ok = true;
int size = (int)s.size();
for(int i = 0; i <... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i,k,t,c=0,ss=0,ev=0,od=0;
string s;
cin>>s;
for(int i=0;i<s.size();i++){
if(i%2 ==0 && s[i]>='a' && s[i]<='z')c++;
else if(i%2!=0 && s[i]>='A' && s[i]<='Z')ss++;
if(i%2==0)ev++;
else od++;
}
//cout<<... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0;i<(n);++i)
using ll = long long;
using P=pair<long long ,long long>;
bool isPalindrome(string s){
string rs=s;
reverse(rs.begin(),rs.end());
return rs==s;
}
int main() {
int n;
cin>>n;
if(n==0){
cout<<"Yes"<<endl;
ret... | #pragma GCC optimize("Ofast,unroll-loops,fast-math")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define pll pair<ll , ll >
#define all(x) (x).begin(),(x).end()
#define SZ(x) (ll)(x).size()
#define X first
#define Y second
#define mp make_pair
#define pii pair<int , int>
#define vec vector
... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ul unsigned long long int
#define vi vector<int>
#define vl vector<ul>
#define ff first
#define ss second
#define INF 1000000000
int main()
{
int n;
ll x;
cin>>n>>x;
vector<ll>v;
for(int i=0;i<n;i++)
{
... | #include <bits/stdc++.h>
using namespace std;
int main(){char c;string s;cin>>c>>s;cout<<s<<c;} |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << (2*a + 100) - b << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy c... |
/* Author: rrrr_wys
**/
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
typedef double db;
typedef long long ll;
using namesp... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i ... |
#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ld = long double;
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define JUGAD freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pb push_back
#define po pop_back
#define pof pop_front... | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007LL
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define SHIFT(n) (1LL<<((ll)n))
#define ALL(a) (a).begin(),(a).end()
#define Max(a) (*max_eleme... |
/*
Submitter: Nick Hudson
Anumber: A01634984
*/
#include <iostream>
int main(){
int N,K,M,input;
int sum;
int neededScore;
std::cin>>N>>K>>M;
//std::cout<<N<<K<<M<<std::endl;
for(int i = 0; i<N-1; ++i){
std::cin>>input;
//std::cout<<input<<std::endl;
sum += input;
//std::cout<<su... | #include <bits/stdc++.h>
// #include <atcoder/all>
#include <cmath>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll INFI = 1001001001;
const ll INFL = 1001001001001001001;
const ll MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, ... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
constexpr LL MOD = 1000000007;
typedef vector<vector<LL>> Mat;
Mat mul(Mat A, Mat B) {
int N = A.size();
Mat C(N, vector<LL>(N, 0));
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
for (int k = 0; k < N; k++)
C[i][j... |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int M=1e5+5,N=(1<<8)+5;
int n,m,v[M],w[M],a[20],l[N],b[20],ans=998244353,f[N];
int main(){
scanf("%d%d",&n,&m);
rep(i,1,n) scanf("%d"... |
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vec... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int N;
string S;
int a[5050], t[5050], c[5050], g[5050];
int sum_A[5050], sum_T[5050], sum_C[5050], sum_G[5050];
int main(void) {
cin >> N >> S;
S = '#' + S;
for (int i = 1; i <= N; i++) {
if (S[i] == 'A') { a[... |
// Problem: C - To 3
// Contest: AtCoder - AtCoder Beginner Contest 182
// URL: https://atcoder.jp/contests/abc182/tasks/abc182_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define ll long long int
#define ii int
#define du d... | #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 ll long long int
#define ff first
#define ss second
typedef tree<pair<ll,ll>,null_type,less<pair<ll,ll>>,rb_tree_tag,
tree_order_statistics_node_upd... |
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define b back
#define cout(x) cout<<x<<endl
#define lb long double
#define sor(arr,n) sort(arr,arr+n)
#define inputVector(v,n) for(int i=0;i<n;i++) cin>>v[i]
#define sov(v) sort(v.begin(),v.end())
#d... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e3+9;
const int MAX=6e5+9;
const int MAX1=5e6+9;
const int INF=0x3f3f3f3f;
const double ep=1e-8;
const double ep1=1e-4;
const int mod=998244353;
const double inf=1e20;
const double pi=acos(-1);
#define debug1 puts("?");
#define debug(x) ... |
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <climits>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <bits/stdc++.h>
using namespace std;
#define lson 2*i
#def... | #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 sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::... |
/* Jai Shree Ganesh
Jai Mata Di
Jai Shree Ram
Jai Shree Krishna
Har Har Mahadev
Jai Bajrangbali
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
long int INF = 1000000005;
#defi... | #include <bits/stdc++.h>
//#define rep(i,a,n) for (int i=a;i<n;i++)
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(ll i = 0; i < (n); ++i)
#define rep2(i, n) for(ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for(ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for(ll i = (a); i < (b); i += (c))... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define precision cout << fixed << setprecision(15);
const int inf = 1e9;
const long long INF = 1e18;
const int mod = 1e9 + 7;
const in... | #include <bits/stdc++.h>
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=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> ... |
#include <iostream>
#include <cmath>
using namespace std;
long long int b[100005];
double c[100005];
int main()
{
int n,a,ma=-100008;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a);
b[i]=b[i-1]+abs(a);//1
c[i]=c[i-1]+pow(a,2);//2
ma=max(ma,abs(a));
}
printf("%lld\n",b[n]);
printf("%.15lf\n",sqrt(... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
cout<<fixed<<setprecision(15);
int n;
cin>>n;
vector<int>x(n);
for(int i=0; i<n; i++)
cin>>x[i];
long ans1=0;
for(int i=0; i<n; i++)
ans1+=abs(x[i]);
cout<<ans1<<endl;
double ans2=0;
fo... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define S(x) (int)(x).size()
#define L(x) (int)(x).length()
#define ld long double
#define... | #include<bits/stdc++.h>
#define lint long long int
#define rep(i,n) for(int i=0;i<int(n);i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define arep(i,a,n) for(int i=a;i<n;i++)
#define sort(a) sort(a.begin(),a.end())
#define reverse(a) reverse(a.begin(),a.end())
#define fill(a,x) fill(a.begin(),a.end(),x)
#define eb(dat... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LL long long
#define int long long
#define ull unsigned long long
#define fi first
#define s... | #include<iostream>
#include <numeric>
using namespace std;
int main(){
int N;
long long ans;
cin >> N;
if(N==2)cout << "3" << endl;
if(N==3)cout << "7" << endl;
if(N==4)cout << "25" << endl;
if(N==5)cout << "121" << endl;
if(N==6)cout << "721" << endl;
if(N==7)cout << "5041" << endl;
if(N==8)cout <<... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#define debug(a) cout << #a << ": " << a << endl
using namespace std;
typedef long long ll;
const int N = 50;
int n;
ll T, a[N];
vector<ll> v;
ll get(ll x){
int p = upper_bound(v.begin(), v.end(), x) - v.begin();
if (p == 0) return 0;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.