code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... | // Problem: E - Sequence Matching
// Contest: AtCoder - AtCoder Beginner Contest 185
// URL: https://atcoder.jp/contests/abc185/tasks/abc185_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define ll long long int
#define ii int
#define du do... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).end... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve()
{
int l, r;
cin >> l >> r;
int x = l + l;
int y = r + 1;
ll n = y - x;
if (n < 0)
cout << "0\n";
else
{
ll ans = (n * (n + 1)) / 2;
cout << ans << "\n";
}
}
int main()
{
ios_... |
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; ... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int N,M;
long H[2<<17];
long L[2<<17],R[2<<17];
main()
{
cin>>N>>M;
for(int i=0;i<N;i++)cin>>H[i];
H[N]=H[N+1]=-2e9;
H[N+2]=H[N+3]=2e9;
N+=4;
sort(H,H+N);
for(int i=2;i<N;i+=2)
{
L[i]=L[i-2]+H[i-1]-H[i-2];
}
for(int i=N-2;i>0;i-=2)... |
//
// blank.cpp
//
//
// Created by Sagar Singh on 17/12/20.
//
#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <sstre... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,ans;
cin >> x >> y;
if((x == 0 && y == 0) || (x == 1 && y == 2) || (x == 2 && y == 1) )
ans = 0;
else if((x == 2 && y == 2) || (x == 0 && y == 1) || (x == 1 && y == 0))
ans = 2;
else if((x == 1 && y == 1) || (x... |
#include <iostream>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cassert>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#include <cmath>
#include <bitset>
#include <functional>
#include <limits>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,a,b) f... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,K=0,P=0,i=1;cin>>N>>M;
int A[M+2],B[M+1];
A[0]=0;
for(;i<=M;i++)cin>>A[i];
A[M+1]=N+1;
sort(A,A+M+2);
for(i=0;i<M+1;i++)B[i]=A[i+1]-A[i]-1;
sort(B,B+M+1);
for(i=0;i<M+1;i++){
if(!K)K=B[i];
if(K)P+=(B[i]+K-1)/K;
}
cout<<P;
} |
#include<bits/stdc++.h>
#define pb push_back
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define int long long
#define sz(x) (ll)(x.size())
using namespace std;
const int mod = 1e9+7;
in... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = "... |
#include <iostream>
using namespace std;
string s;
int main() {
ios::sync_with_stdio(0);
cin>>s;
bool flag = true;
for(int i = 0;i<s.length();i++){
if(i&1){
if(!isupper(s[i])){
flag = false;
break;
}
}
else{
if(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
using Graph = vector<vector<int>>;
ll mod = 1000000007;
int main() {
ll N; cin >> N;
ll base = 1,cnt = 0;
ll ans = 2e18;
rep(i,62){
... |
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair< ll, ll > Pi;
using vl = vector<ll>;
using vs = vector<string>;
using vvl = vector<vector<ll>>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1... | #include <bits/stdc++.h>
#define fst first
#define snd second
#define ll long long
#define ld long double
#define pb push_back
#define emp emplace_back
#define pii pair<int, int>
#define usg unsigned
#define sg signed
#define mp make_pair
using namespace std;
void setIO(){
ios::sync_with_stdio(0);
cin.tie(0); cout... |
#include<bits/stdc++.h>
using namespace std;
#define mem(ar,x) memset(ar,x,sizeof(ar))
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define vi vector<int>
#define pi pair<int,int>
#define mod 1000000007
#define rt return 0;
#define ct continue;
#define pb push_back
#define int long long
#define ff ... | #include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int... |
//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> //
#include <functional> //
#include <set> //
#include <unordered_map> //
#include <random> //
#include <ctime> //
#include <bitset> //
#include... | #include<iostream>
#include<bits/stdc++.h>
#include<math.h>
#include<vector>
#include<string>
#include<cstring>
#include<ctype.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;
typedef tree<int, null_type,... |
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cinttypes>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<stack>
#define FSCNd64 "%" SCNd64
#define FPRId64 "%" PRId64
using namespace std;
using ll=long long;... | #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 pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bo... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <class T>
using... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
#include<tuple>
#include<deque>
using namespace std;
const int mod = 1000000007;
const int INF = 1001001001;
const long long LINF = 1001002003004005006;
... |
#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;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned lon... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n,sum=0;
cin>>n;
for(int i=1;i<=n;i++)
{
long long int x,y;
cin>>x>>y;
sum+=(x+y)*(y-x+1)/2;
}
cout<<sum<<endl;
return 0;
} |
/*
求 k*k 矩阵最小中位数值
*/
#include <bits/stdc++.h>
using namespace std;
const int maxx=805;
long long mp[maxx][maxx];
long long sum[maxx][maxx];
int n,k,inx;
long long l=1e9+5,r=-1;
int check(int x){//每个小矩阵中 比x大的数字要超过 inx
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){//sum[i][j]存的是小矩阵内 >= mid 的数量
sum[i][j]=sum[i-1][j]... | #define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
usi... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
vector<char> str;
for(int i=0; i<m; i++) {
string s;
cin >> s;
for(int j=0; j<s.size(); j++) str.push_back(s.at(j));
}
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
cout << str.at(j*20 + i);
... | #include <bits/stdc++.h>
using namespace std;
int n;
mt19937 mt;
const int TRIES = 750;
const int SHUFFLES = 0;
bool check(string s, vector<vector<char>>& a, int i, int j) {
bool isOk = true;
for (int k = 0; k < s.size() && isOk; ++k) {
if (s[k] != a[i][(j + k) % n]) {
isOk = false;
... |
#define ll long long
#define dn double
#define mp make_pair
#define pb push_back
#define se second
#define fi first
#define mod 1000000007
#define sob(v) v.begin(),v.end()
#define sobr(v) v.rbegin(),v.rend()
#defi... | #include <iostream>
#include <vector>
std::vector<int> StringsToInt(std::string str, std::string delimit) {
std::vector<int> vec;
if (str.find(delimit) == std::string::npos) {
vec.emplace_back(std::atoi(str.c_str()));
return vec;
}
for (std::size_t pos = 0;
str.find(delimit) != std::string::... |
#include<bits/stdc++.h>
using namespace std;
const int N=5e5;
int dp[N+10][2];
char a[N+10],b[N+10];
bool xora[N+10],xorb[N+10];
int main(){
int n;
scanf("%d%s%s",&n,a+1,b+1);
for(int i=1;i<=n;i++){
xora[i]=xora[i-1]^(a[i]-'0');
xorb[i]=xorb[i-1]^(b[i]-'0');
}
int l=1;
long long ans=0;
for(int i=1;i<=n;i++){... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for(ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typed... |
#include "bits/stdc++.h"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m = 0, n = 0, p = 0, q = 0, mod =
998244353
, pi = 3.1415926535;
string s1, s2;
char moji;
cin >> a;
vector<long long> v(a,0);
vector... | #include <bits/stdc++.h>
using namespace std;
const int Mod = 998244353;
int N, a[105], f[105][20010], fac[105];
int main () {
#ifndef ONLINE_JUDGE
freopen("cpp.in", "r", stdin);
#endif
cin >> N;
for (int i = 1; i <= N; i++) cin >> a[i];
for (int i = fac[0] = 1; i <= N; i++) fac[i] = 1ll * fac[i - 1] * i % Mod;
... |
#include<iostream>
main(){long N,X,a=0,b=1,A,h,c;std::cin>>N>>X>>A;h=X,N--;while(N){std::cin>>A,c=a+b;if(h%A) a=c;if(X%A) b=c;X=(X/A)*A,h=((h+A-1)/A)*A,N--;}std::cout<<a+b;} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
#define DOR(i,s,t) for(int i=(s),_t=(t); i>=_t; --i)
#define EOR(i,x) for(int i=Head[x]; ~i; i=Nxt[i])
typedef long double db;
typedef long long ll;
namespace Eddd {
inline char sc() {
return getchar();
static cons... |
#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 MV 200001
#define LMV 21
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define emp emplace
#define mp make_pair
#define ins in... | #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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define cell(a,b) int((a+(b-1))/b)
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define nl '\n'
#define INF 10e9
typedef tree<int... | #include <bits/stdc++.h>
using namespace std;
int solve(int a) {
return a;
}
int main() {
int N; cin >> N;
int A[110];
int B[110];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = A[0]; i <= B[0]; i++) {
bool is =... |
#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<iostream>
#include<algorithm>
using namespace std;
int main(){
int a;
int b;
int w;
int Max = 0;
int Min = 1000000000;
cin >> a >> b >> w;
for(int i = 1; i <= 1000000; i++){
if(a*i <= w*1000 && w*1000 <= b*i){
Min = min(Min,i);
Max = max(Max,i);
... |
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define eps 1e-8
#define maxm 600005
#define maxn 200005
#define ls (tot << 1)
#define rs (tot << 1 | 1)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const double pi = acos(-1);
const ll mod = 1e9 + 7;
inline ll read(){
ll x = 0, f = 1;... |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;
long long ans=0, first, last, num;
int l, r, n;
int main() {
cin>>n;
while(n--) {
ans=0;
cin>>l>>r;
if(l==r && l==0) cout<<1<<endl;
else if(l+l>r) cout<<0<<endl;... |
// ACPC ISA.
#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 ld long double
#define ll long long
#define ull unsigned long long
#define pb push_back
#define eb emplace_back
#define endl '\n'
template<typen... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define mp make_pair
using namespace std;
typedef long long ll;
char v[65][5];
int n;
ll dp[65][2];
bool mark[65][2];
ll f(int i, int j) {
if(i == n) return j;
if(mark[i][j]) return dp[i][j];
mark[i][j] = true;
ll ans = 0;
if(v[i][0] == 'A') {
... | #include<bits/stdc++.h>
using namespace std;
#define asll unsigned long long
#define ULL unsigned long long
#define ll long long
#define LL long long
#define ld long double
#define imt int
#define pii pair<int,int>
#define st first
#define fi first
#define nd second
#define se second
#define psbk(x) push_back(x);
#def... |
#pragma GCC optimize("O3")
#pragma GCC target("avx")
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ou... | #include<bits/stdc++.h>
using namespace std;
#define int long double
void Malena(){
int n,d,h;cin>>n>>d>>h;
vector<vector<int>>bars(n,vector<int>(2));
for(int i=0;i<n;++i){
cin>>bars[i][0]>>bars[i][1];
}
int low=0,hi=1001;
int eps=1e-6;
while(abs(hi-low)>eps){
int mi=low+(hi-low)/2;
int found=0;
for(int... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(n);++i)
using ll = long long;
using p = pair<int,int>;
int main() {
int a1,a2,a3,a4;
cin >> a1 >> a2 >> a3 >> a4;
int ans = a1;
if(ans > a2) ans = a2;
if(ans > a3) ans = a3;
... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define f(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define ff first
#define ss second
#define ll long long
#define mod 1000000007
#define ps(x,y) fixed<<setprecision(y)<<x
#define inp(a,n) for(int i=0;i<n;i++) cin>>a[i];
#define FIO ios_base::sync_w... |
#include "bits/stdc++.h"
using namespace std;
int main(){
int64_t n, a = 0; cin >> n;
if (n >= 1000) a += n - 999;
if (n >= 1000000) a += n - 999999;
if (n >= 1000000000) a += n - 999999999;
if (n >= 1000000000000) a += n - 999999999999;
if (n >= 1000000000000000) a += n - 999999999999999;
... | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
// warning: pragmas don't work on USACO and just set to O0
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //gp_hash_table<T, U, chash>;
#include <ext/pb_ds/tree_policy.hpp> //tree<T, U, cmp, rb_tree_ta... |
#include <bits/stdc++.h>
using namespace std;
void solve() {
using ll = long long;
int n, m; cin >> n >> m;
vector<int> a(n), b(n);
for(auto &x : a) cin >> x;
for(auto &x : b) cin >> x;
vector<vector<int>> g(n);
while(m--) {
int c, d; cin >> c >> d; --c, --d;
g[c].emplace_back(d);
g[d].emplac... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vpii vector<pair<int, int>>
#define mems(x, y) memset(x, y, sizeof(x))
#define all(x) (x).begin(), (x).... |
#include<bits/stdc++.h>
using namespace std;
//typedef
typedef long long ll;
typedef pair<ll,ll> PLL;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<string> VS;
//template
template<class T> inline bool chmin(T &a, T b) {if (a > b){a = b; return true;} retu... | #include <bits/stdc++.h>
#define ll unsigned long long
#define pi 3.141592653
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define MAX 100005
using namespace std;
ll count(ll n)
{
ll c=0;
while(n!=0)
{
c++;
n=n/10;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m;
ll x, y;
map<ll, vector<ll>> mp;
set<ll> s;
ll in[200005];
ll out[200005];
int cnt1, cnt2;
int main()
{
cin>>n>>m;
for (int i=1; i<=m; ++i)
{
cin>>x>>y;
mp[x].push_back(y);
}
s.insert(n);
for (auto t ... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << " is " << x << endl
typedef long long ll;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
int n, m;
vector<P> p;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
int x, y;
for (int i = 0; i < m; ++i) {
cin... |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#incl... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <stack>
#include <vector>
#include <set>
#include <algorithm>
#include <iomanip>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pli pair... | #include <bits/stdc++.h>
const int N = 200005;
int T, n; char A[N], B[N], C[N];
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n); n *= 2;
scanf("%s%s%s", A, B, C);
int cnt1 = (A[0] == '1') + (B[0] == '1') + (C[0] == '1');
int cnt2 = (A[n - 1] == '1') + (B[n - 1] == '1') + (C[n - 1] == '1');
if (c... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// your code goes here
ll a,b,c;cin>>a>>b>>c;
if(a==b)cout<<c;
else if(b==c)cout<<a;
else if(a==c)cout<<b;
else if(a==b&&b==c)cout<<a;
else cout<<"0";
return 0;
} | // “Alhamdulillah for Everything”
#include<bits/stdc++.h>
using namespace std;
//---------DEFINES------------
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp... |
#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<cstdio>
#include<cctype>
#include<algorithm>
#define LL long long
using namespace std;
template <class I>
inline void read(I &z)
{
z=0;
char c=getchar();int base=1;
while (!isdigit(c) && c!='-') c=getchar();
if (c=='-') c=getchar(),base=-1;
while (isdigit(c)) z=z*10+c-'0',c=getchar();
... |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
#define ld long double
#define pb push_back
#define pob pop_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define f0(i,n) for(i=0;i<n;i++)
#define rf0(i,n) for(i=n-1;i... | #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>
using namespace std;
#define ll long long
char s[200010];
char d1[]={'1', '1', '0'};
char d2[]={'1', '0', '1'};
char d3[]={'0', '1', '1'};
int main()
{
ll i, j, n, m;
scanf("%lld %s", &n, s);
if(n==1)
{
if(s[0]=='1') printf("20000000000\n");
else printf("10000000000\n");
return 0;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
using vv = vector<vector<int>>;
const int INF = (int)1e9;
const LL LINF = (LL)1e18;
const int query = 1000;
const int grid_size = 30;
const int grid_total = grid_size * grid_s... |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
string res = "";
for(char c : s){
if(c == '.') break;
else res +=c;
}
cout << res;
retur... | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
cout << 100-(n%100) << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pl pair<ll,ll>
#define pll pair<ll,pl>
#define pi pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
ll mod = 1e9+7;
const int IMAX = 2000500;
const int V = 2100;
const ll LMAX = 99999999999999999;
const ll p = 1000000000;
int R[]... | #include <bits/stdc++.h>
using namespace std;
long long n, ans;
int main (){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
long long lo=0, hi=1500000007;
while (lo<hi){
long long mid=(lo+hi+1)/2;
long long cur = mid*(mid+1)/2;
if (cur <= (n+1)) lo=mid;
else hi=mid-1;
}
cout << (n-lo+1);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define M 100005
LL A[M],sum[M],K;
int main(){
int n,q;
cin>>n>>q;
A[0]=0;
for(int i=1;i<=n;i++){
scanf("%lld",&A[i]);
sum[i]=sum[i-1]+A[i]-A[i-1]-1;
}
sum[n+1]=2e18-A[n];
cout<<endl;
while(q--){
scanf("%lld",&K);
int L=1,R=n+1,res;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vt vector
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
// 🚩
// 20210306 21:02:45~
//
int main()
{
ll ... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int long long
typedef unsigned long lo... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
map<string, bool> mp;
string ans = "satisfiable";
while(N--) {
string s;
cin >> s;
if(ans != "satisfiable") continue;
... | #include "bits/stdc++.h"
using namespace std;
#define FAST cin.tie(nullptr)->sync_with_stdio(false);
#define PRECISE cout << fixed << setprecision(19);
#define ONE int tc = 1;
#define GO for (int i = 0; i < tc; ++i) { solve(); }
using vi = vector<int>;
#define all(x) (x).begin(), (x).end()
#define ice(i, a, b) for ... |
#include <bits/stdc++.h>
using namespace std;
//solve関数。falseなら7が入っている。trueなら7が入っていない。
bool solve7(int n){
while(n!=0){
if(n%8==7){
return false;
}
//ケタを下ろしていく(1の桁以外を調べる)
n /= 8;
}
return true;
}
bool solve10(int n){
while(n!=0){
if(n%10==7){
... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rrep(i,n) for(ll i=n-1; i>=0; i--)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef ... |
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
//#include<ctime>
//#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#inc... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF (int)1e9
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
//
#define FOR(i, a, b, in) for (int i=a ; i<(b) ; i+=in)
#define RFOR(i, a, b, in) for (int i=a-1 ; i>=(b) ; i-=in)
#define REP(i, a, b) FOR(i, a, b, 1)
#define RR... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,x=1e8,y=1e8,x1,y1,i,s,p,q,a,b,c=1e8,d=1e8;
cin>>n;
int arr[n][2];
for(i=0;i<n;i++){
cin>>arr[i][0]>>arr[i][1];
if(arr[i][0]<x){
x=arr[i][0];
x1=i;}
if(arr[i][1]<y){
y=arr[i][1];
y1=i;}}
if(x1==y1){
p = x+y;
for(i=0;i<n;i++)... |
#include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)
#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## ... | #include<bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define put(i) cout<<i<<endl
#define rep(i,s,n) for(long long i=s;i<(long long)(n);i++)
using namespace std;
using ll = long long;
int main(){
ll a, b, c;
cin >> a >> b >> c;
if(a*a + b*b < c*c) put("Yes");
else put("No");
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> b... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
# define drep(i,a,b) for(int i=(a); i>=(b); --i)
typedef long long int_;
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(;... |
#include<iostream>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inline bool chmax... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#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;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; ... |
#include<bits/stdc++.h>
using namespace std;
/*#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
*/typedef long long ll;
typedef unsigned long long... | #include<cstdio>
#include<algorithm>
#include<vector>
#define For(i,A,B) for(i=(A);i<=(B);++i)
#define pb push_back
using namespace std;
const int N=100050;
int G[N],to[N*2],w[N*2],nxt[N*2],sz,f[N],a[N];
inline void adde(int u,int v,int c){
to[++sz]=v;w[sz]=c;nxt[sz]=G[u];G[u]=sz;
to[++sz]=u;w[sz]=c;nxt[sz]=G[v];G[v]... |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int,int> pii;
typedef long long ll;
const long long MOD=1000000007;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep2(i,m,n) for(ll i=(m);i<(n);i++)
#define ALL(v) v.begin(), v.end()
#define pb push_bac... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main(void){
int r1, c1, r2, c2;
cin >> r1 >> c1;
cin >> r2 >> c2;
if((r1==r2)&&(c1==c2)){
cout << 0 << endl;
}else if((r1+c1 == r2+c2)||(r1-c1 == r2-c2)){
cout << 1 << endl;
}else if(abs(r1-r2)+ab... |
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vect... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main(){
IOS;
int a,b,c,d;
cin>>a>>b>>c>>d;
int ans=b-c;
cout<<ans;
}
|
#include <bits/stdc++.h>
const int N = 200000;
std::vector<int>G[N + 5];
void adde(int u, int v) {
G[u].push_back(v), G[v].push_back(u);
}
int n, k, d, t;
int a[N + 5], b[N + 5];
void dfs1(int x, int f) {
a[x] = b[x] = -1;
int p = -1, q = 0;
for(auto to : G[x]) if( to != f ) {
dfs1(to, x);
p = std::max(p,... | #include<bits/stdc++.h>
#define fgx cerr<<"-----------------------"<<endl
#define LL long long
#define DB double
#define pb push_back
using namespace std;
inline int read(){
int nm=0,fh=1; char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') fh=-1;
for(;isdigit(c);c=getchar()) nm=nm*10+c-'0';
return nm*fh;
}
... |
/*
P_r_A_d_Y ☹
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define mod 1000000007
#define inf 1e18
#define pb push_back
#define all(x) x.begin(),x.end()
#define arr_max(x) *max_element(x.begin(),x.end())
#define arr_min(x) *min_element(x.begi... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll mod=1000000007;
int main(){
ll N,ans=0,K=1000;
cin >> N;
while(N-K+1>=0){
ans+=N-K+1;
K*=1000;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... |
#include <iostream>
using namespace std;
int main() {
long long a, b, c, d;
//long long n, x, y;
long long ans = 0;
double n = 0;
cin >> a >> b >> c >> d;
if (b >= d*c) {
ans = -1;
} else {
// n = 0;
// x = 0;
// y = 0;
// while (a + x > d*y) {
// x += b;
// y += c;
// ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MP make_pair
#define PB push_back
#define REP(i, L, R) for (int i = L; i < (R); ++i)
#define SZ(x) (int)x.size()
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template <typenam... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll inf=1000000000000000000,mod=1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll h,w,n,m;cin>... | #include <bits/stdc++.h>
using namespace std;
//---------------- 定数 ----------------
// [X_MIN, X_MAX], [Y_MIN, Y_MAX]
#define X_MIN 0
#define X_MAX 29
#define Y_MIN 0
#define Y_MAX 29
#define QUERY 1000
// -------- util function --------
int rand_int(){
static unsigned long long x=123456789, y=362436069, z=521... |
#include <bits/stdc++.h>
namespace IO {
#define iL (1 << 20)
char ibuf[iL], *iS = ibuf + iL, *iT = ibuf + iL;
#define gc() ((iS == iT) ? (iT = (iS = ibuf) + fread(ibuf, 1, iL, stdin), iS == iT ? EOF : *iS ++) : *iS ++)
template<class T> inline void read(T &x) {
x = 0;int f = 0;char ch = gc();
for (; !is... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
void check(long long &a, vector<int> &v, vector<int> &c, int i, int &lc){
if(c.at(i) == lc){
a++;
return;
}
if(c.at(i) != -1){
return;
}
c.at(i) = lc;
check(a, v, c, v.at(i), lc);
}
int main(){
... |
#include <bits/stdc++.h>
using namespace std;
// clang-format off
#define forn(i, x, y) for (int i = x; i < y; i++)
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(NULL)
#define all(v) v.begin(), v.end()
// clang-format on
using VI = vector<int>;
template <int n>
class UF
{
public:
vector<int>... | #pragma GCC optimize("-Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
// #include <atcoder/all>
// #include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <ran... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
class Matrix {
public:
int h, w;
V<V<T>> data;
Matrix(int h_, int ... | #include<bits/stdc++.h>
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define fast ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pop pop_back
#define mii map<int,int>
#define in(a,n)... |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int N, M;
cin>>N>>M;
long long MOD = 998244353;
vector<vector<long long>> C(N+1, vector<long long>(N+1));
for (int i=0; i<=N; i++)
{
C[i][0] = 1;
for (int j=1; j<i; j++)
C[i][j] = (C[i-1][j-1]+C... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
using vv = vector<vector<int>>;
const int INF = (int)1e9;
const LL LINF = (LL)1e18;
long long const mod = 1000000007;
struct mint{
long long val;
mint(long long val = 0): v... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
template<uint_fast64_t Modulus = MOD>
struct Modint {
using u64 = uint_fast64_t;
u64 a;
constexpr Modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr Modint operator+(const Modint rhs) const noexcept {
return Modint(*this) +... | #include<bits/stdc++.h>
typedef int64_t i64;
typedef long double f128;
using namespace std;
template<typename T>
void scan(T& n)
{
cin>>n;
return;
}
void scan()
{
return;
}
template<typename T,class... Args>
void scan(T& n,Args&... args)
{
scan(n);
scan(args...);
return;
}
template<typename T>
void scan... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<ll,ll> pii;
typedef vector<pii> vpii;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define mod 1000000007
#define FOR0(i,n) for(ll i=0;i<n;i++)
#define... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vr vector
#define endl "\n"
#define all(x) x.begin(),x.end()
template<class T> void read(vr<T> &arr)
{
for (auto &x : arr)
cin >> x;
}
template<class T> void read(T &x)
{
cin >> x;
}
template<class T> void write(vr<T> &arr)
{
for (auto x... |
#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
long long n;
cin>>n;
int count=0;
while(n%2==0)
{
n/=2;
count++;
}
if(count==0)
{
cout<<"Odd"<<endl;
}
els... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... |
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
int main(){
// 1. 入力情報.
int N;
scanf("%d", &N);
set<stri... | #include<iostream>
#include<map>
using namespace std;
const int MAXN=2e5+10;
int n;
string a[MAXN];
map<string,int> mp;
int main() {
cin>>n;
for(int i=1;i<=n;i++) {
cin>>a[i];
if(a[i][0]=='!') {
a[i]=a[i].substr(1,a[i].length()-1);
if(mp[a[i]]==0) mp[a[i]]=2;
else if(mp[a[i]]==1) {
cout<<a[i]<<end... |
#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... |
#include <algorithm>
// #include <atcoder/all>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <vector>
/*
cd $dir && g++ -std=c++17 -Wall -Wextra -O2 -DATCODERDEBUG
-I/mnt/d/MyProjects/atcoder/l... | #pragma GCC optimize("Ofast")
#include <limits.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <cmath>
#include <iomanip>
#include <string>
#include <deque>
#include <assert.h>
#include <random>
#include <ctime>
#include <unordered_map>
#incl... |
// abc183_f
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(... | #define _GLIBCXX_DEBUG
// #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <unordered_set>
#include <utility>
#include <tuple>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
cons... |
#include<bits/stdc++.h>
using namespace std;
#define IOS { ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0); }
typedef unsigned long long ull;
typedef long long int ll;
typedef long double ld;
#define REP(i,a,b) for(ll i=a;i<=b;++i)
#define REV(i,a,b) for(ll i=a;i>=b;i--)
#define pll pair<ll,ll>
#define vll ve... | #include <bits/stdc++.h>
using namespace std;
//actual solution is at bottom//
////<pbds>////
/*
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>,
rb_tree_tag, tree_order_statistics_node_update>;
// c... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<bool> consumed;
vector<set<int>> v;
void dfs(int i) {
consumed[i] = true;
for(auto e : v[i]) {
if(!consumed[e])
dfs(e);
}
}
#ifndef _LOCAL
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(m), b(m... | /* これを翻訳している間、あなたはあなたの人生のいくつかの貴重な瞬間を無駄にしました */
#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) ... |
#include<iostream>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<cstring>
#include<tuple>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
// {g,x y} : ax * by = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
int dp[101][505001];
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n,k,mod; cin >> n >> k >> mod;
dp[0][0]=1;
int sum=0;
for(int i=1;i<=n;i++){
sum+=i;
vector<int> ps(i);
for(int j=... |
#include <bits/stdc++.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; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define pll pai... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct UnionFind {
//自身が親であれば、その集合に属する頂点数に-1を掛けたもの
//そうでなければ親のid
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int root(int x) {
if (r[x] < 0) return x;
return r[x] = root(r[x]);
}
... |
#include<bits/stdc++.h>
using namespace std;
int a[1111],b[1111];
int main(){
int n;
while(scanf("%d",&n)!=EOF){
int ans = 111111111;
for(int i =1 ; i <= n ; i++){
scanf("%d %d",&a[i],&b[i]);
}
for(int i = 1; i <= n ; i++){
for(int j = 1 ; j <= n ; j++)
if(i == j){
ans = min (ans, a[i]+b[j]);
... | #include <math.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main()
{
int n;
cin >> n;
int a[n], b[n];
rep(i, n)
{
cin >> a[i] >> b[i];
}
int time[2] = {a[0], b[0]};
int ans;
rep(i, n)
{
rep(j, n)
{
if (i == j)
{
... |
#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;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937/*_64*/ rng(chrono::ste... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... | #include <iostream>
#include <cstdio>
#define N 5005
using namespace std;
int n, c, c1[N], c2[N];
string a;
int main()
{
int i, j;
cin >> n >> a;
a = '.' + a;
for (i = 1; i <= n; i++) {
c1[i] = c1[i - 1];
c2[i] = c2[i - 1];
if (a[i] == 'A') c1[i]++;
else if (a[i] == 'C')... |
/**
* author: FromDihPout
* created: 2021-06-22
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s, x;
cin >> n >> s >> x;
reverse(s.begin(), s.end());
reverse(x.begin(), x.end());
vector<int> a(n);... | // 問題の URL を書いておく
//
#include <bits/stdc++.h>
using namespace std;
//#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: "... |
//#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const double eps = 1e-7;
const ll LINF = ll(1e18);... | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define all(c) (c).begin(), (c).end()
// !!READ THE PROBLEM STATEMENT CORRECTLY YOU STUPID, WORTHLESS PIECE OF SHIT!!
//Analyze testcases thoroughly before starting implementation
... |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | //vs solve(int n){
// vs ans;
// per(bit,n){
// rep(cases,1<<(n-1-bit)){
// ll mask = 1<<bit;
// rep(i,n-1-bit)
// if(cases&(1<<i))
// mask ^= 1<<(bit+i+1);
// string cur;
// rep(i,1<<n)
// if(__builtin_popcountll(... |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = v... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, m;
cin >> n >> k >> m;
int s = 0;
int A;
for(int i = 0; i < n - 1; i++){
cin >> A;
s += A;
}
int B = n*m - s;
if(B > k){
cout << -1;
}
else if(B < 0){
cout << 0;
}
else{
cout << B;
}
} |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#inclu... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
std::fstream myfile("D:\\CodeBlocks\\c++\\input.txt.c", std::ios_base::in);
ll n,sum=0;
cin>>n;
while(n--){
ll a,b;
cin>>a>>b;
sum+=((b*(b+1)/2)-(a*(a-1)/2)) ;
}
cout<<sum;
... |
//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... | #include<bits/stdc++.h>
using namespace std;
long long n,m,a[5005],b[5005],c[5005];
vector<int> grafo[105];
map<pair<int,int>,bool> f;
bool vis[101];
void dfs(int nodo){
if(vis[nodo])return;
vis[nodo]=true;
for(auto i : grafo[nodo]){
if(c[i]<c[nodo] || (c[i]==c[nodo] && f[{i,nodo}]==false && f[{nodo,i}]==false... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main (){
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n;cin>>n;
vector<ll>a(n),b(n);
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++) cin>>b[i];
// for(int i=n-1;i>=0;i--){
// suff_b... | #include <iostream>
#include <algorithm>
#include <string>
#include <complex>
#include <vector>
#include <set>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <numeric> //lcm
#include <iomanip> //double精度 setprecision
#include <chrono>
#include <random>
#include <cassert>
... |
#include <iostream>
using namespace std;
#include<bits/stdc++.h>
#define ll long long
#include <iomanip>
void solve()
{
ll int n;
cin>>n;
ll int arr[n];
ll int count=0;
unordered_map<ll int,ll int> m;
for(ll int i=0;i<n;i++)
{
cin>>arr[i];
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... |
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <iomanip>
#include <algorithm>
#include <iterator>
#include <stack>
#include <queue>
#include <unordered_set>
#include <stdio.h>
#include <math.h>
#include <bitset>
using namespace std;
#define pb push_back
#define mp make_p... | #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>
using namespace std;
int _ = (cout << fixed << setprecision(9), cin.tie(0), ios::sync_with_stdio(0));
using Int = long long;
int main() {
int N; cin >> N;
vector<int> A(N); for (auto &a : A) cin >> a;
for (int i = 1; i < N; i += 2) {
A[i] *= -1;
}
vector<Int> S(N + 1... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define mk make_pair
#define MOD 1000000007
#define pi 3.1415926536
/* BAAP BAAP HOTA HAI
AUTHOR- Devansh Nandasana*/
void adde(vector<ll> adj[],ll u,ll v)
{
adj[u].pb... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) rep2(i,0,n)
#define rep2(i,l,r) for(ll i=(l),i##_len=(r);i<i##_len;i++)
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { ... |
// Problem : F - Range Xor Query
// Contest : AtCoder - AtCoder Beginner Contest 185
// URL : https://atcoder.jp/contests/abc185/tasks/abc185_f
// Memory Limit : 1024 MB
// Time Limit : 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cp-editor)
#include <bits/stdc++.h>
using namespace std;
#define SPEED... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
int main(){
int n,m;
cin >> n >> m;
vl h(n),w(m),a(n),s(n... | //
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define f fiCrst
#define s second
#define what_is(x) cerr << #x << " is " << x << endl;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int INF = 1000000007;
const ll MOD = 1000000007;
void solve_test()
{
in... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string ans = "No";
string N;
cin >> N;
for (int i = 0; i <= 9; i++) {
string Nt = string(i, '0') + N;
if (Nt.size() % 2 == 1) Nt.erase(Nt.begin() + Nt.size() / 2);
string s1 = Nt.substr(0, Nt.size() / 2);
string ... | #include "bits/stdc++.h"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m = 0, n = 0, p = 0, q = 0, mod = 998244353, pi = 3.1415926535;
string s1,s2;
char moji;
cin >> s1;
while(s1.size())
{
if(s... |
#include <iostream>
#include <algorithm>
int main() {
int n;
int a[1001], b[1001];
std::cin >> n;
for(int i = 0; i < n; ++i) {
std::cin >> a[i] >> b[i];
}
int min = 1000000;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
int sum = std::max(a[i], ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
struct mount{string name; int height;};
int main()
{
int n;
cin >> n;
mount m[n];
rep(i, n) cin >> m[i].name >> m[i].height;
int a1 = 0, a2 = -1, m1 = 0, m2 = 0;
rep(i, n)... |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#inc... | #include <bits/stdc++.h>
using namespace std;
using st = string;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
const ll MOD = 1000000007;
const ll INF_I = 0x3ffff... |
//------------ヘッダーインクルード------------
#include <stdio.h>
#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
//------------型マクロ定義------------
typedef long l;
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
//------------forマクロ定義------------
//------------main----... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
ll ans = 0;
int ReLu(int x){
if(x >= 0) return x;
else return 0;
}
void Main(){
int x;
cin >> x;
cout << ReLu(x) << endl;
}
int main(){
Main();
... |
#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 H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>... | #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> p(n), pos(n), res;
REP(i, n) cin >> p[i], pos[--p[i]] = i;
vector<bool> used(n-1, false);
REP(i, n) {
int now = pos[i];
while (i < now) {
int before = now - 1;
if (use... |
#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;
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define fi first
#define se second
#define ll long long
#define tp top()
#define fr front()
#define vi vect... |
#include<iostream>
#include<bits/stdc++.h>
#include<climits>
#include<cmath>
#include<set>
using namespace std;
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
int ma... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(long long int i=(long long int)j;i<(long long int)k;i++)
#define MOD 1000000007
#define pb push_back
#define fi first
#define se second
typedef long long lld;
typedef long ld;
#define inf LLONG_MAX
const lld MAXN = (int)3e5 + 5;
typedef pair<... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
// #define ll long long
#define f(i,n) for(int i=0;i<n;i++)
#define fi(i,x,n) for(int i=x;i<n;i++)
#define pii pair<int,int>
#define vi vector<int>
#define pb push_back
#define rof(i,a,b) for(int i=(a);i>=(b);i--)
#define S second
#define F first
#defin... | #include <bits/stdc++.h>
#define M 1000000007
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define d(x) cout << #x << " " << x << "\n";
#define min(x1, x2) (x1 > x2 ? x2 : x1)
#define max(x1, x2) (x1 < x2 ? x2 : x1)
#define min3(x1, x2, x3) (x3 > min(x1, x2) ? min(x... |
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,avx512f,avx512bw,avx512bitalg")
#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>
#include <ext/rope>
usi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define re... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define mod 998244353
#define inf 2147483647
#de... | #include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
template<class T>
bool chmax(T &val, T nv) { return val < nv ? (val = nv, true) : false; }
template<class T>
bool chmin(T &val, T nv) { return nv < val ? (val = nv, true) : false; }
#ifdef KEV
#defi... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll fp[3][250005];
struct node
{
ll op, po;
}p[250005];
struct qu
{
ll A, B, id;
}q[250005];
int cmp(qu z1, qu z2)
{
return z1.A<z2.A;
}
struct nn
{
ll rx, ry;
}res[250005];
int main()
{
int n;
scanf("%d", &n);
for(int i=... | #include <bits/stdc++.h>
#define endl '\n'
#define fr first
#define sc second
#define all(v) v.begin(),v.end()
#define unq(v) sort( all(v) ); v.erase( unique( all(v) ), v.end() )
#define bout(x) cout << bitset<sizeof(x)*8>(x) << endl
#define mkp(a,b) make_pair(a,b)
#define gcd(a,b) __gcd(a,b)
using namespace std;
using... |
//
// Created by zhujunchao on 2021/4/18.
//
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a, b;
scanf("%d%d", &a, &b);
for(int i = 1; i < min(a, b); i++){
printf("%d %d ",i, -i);
}
int u = 0;
if(a > b){
for(int i = b; i <= a; i++){
print... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorit... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t, n;
cin >> t >> n;
int l = 1, r = 1e12;
int ans = 0;
while (l <= r) {
int mid = (l + r) / 2;
int price = mid * (100 + t) / 100;
int ... | #include "bits/stdc++.h"
#include <chrono>
#include <random>
#define lli long long int
using namespace std;
#define mod 1000000007
#define mod1 998244353
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define INF 1000000000
#define common cout << "Case #" << w+1 << ": "
#define maxn 10... |
#include <bits/stdc++.h>
using namespace std;
template <int MOD_> struct modnum {
static constexpr int MOD = MOD_;
static_assert(MOD_ > 0, "MOD must be positive");
private:
using ll = long long;
int v;
static int minv(int a, int m) {
a %= m;
assert(a);
return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) /... | #include<bits/stdc++.h>
using namespace std;
const int N=5005,mod=998244353;
int n,m,ans,f[N][2],g[N][2];
inline int add(int a,int b){
a+=b;
return a<mod?a:a-mod;
}
inline int dec(int a,int b){
a-=b;
return a<0?a+mod:a;
}
inline int mul(int a,int b){
return 1LL*a*b%mod;
}
int main(){
scanf("%d%d",&n,&m);
for(int... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.