code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long;
int main(){
int h,w,x,y;
cin>>h>>w>>x>>y;
char a[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>a[i][j];
}
}
x--;y--;
int ans=0;
if(a[x][y]=='#'){
ans=0;
}
else{
ans++;
for(int i=x-1;i>=0;i--){
... | #include<bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define Local
#ifdef Local
#define dbg(args...) do { cout << #args << " -> "; err(args); } while (0)
void err() { std::cout << std::endl; }
t... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) begin(v), end(v)
#define sz(v) v.size()
#define INF 1e17
#define EPSILON 1e-14
template <typename T>
bool chmax(T &a, const T& b)... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long K, cnt = 0, wincnt = 0;
string S, T;
cin >> K >> S >> T;
map<long long, long long> p;
vector<long long> t(10), a(10);
for (long long i = 1; i <= 9; ++i) p[i] = K;
for (long long i = 0; i < 4; ++i) {
--p[(long long)S[i] - '0'];
++... |
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n;ll ans=0;
cin>>n;
if(n-999>0)
ans+=n-999;
if(n-999999>0)
ans+=(n-999999);
if(n-999999999>0)
ans+=(n-999999999);
if(n-999999999999>0)
ans+=(n-999999999999);
if(n-9999999999... | #include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
#define pii pair<int,int>
#define pll pair<long long,long long>
#define fi first
#define se second
#define pb push_back
#define sz... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define REP(i,k,n) for(ll i=k;i<ll(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se secon... |
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define PI acos(-1.0)
#define No cout<<"No\n"
#define Yes cout<<"Yes\n"
#define no ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#includ... |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll N;
void input(void){ cin >> N; }
ll fix_b(int b){
ll pow2b = (1LL << b);
ll a_max = N / pow2b;
ll c = N - pow2b * a_max;
return (a_max + c + b);
}
int m... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "talltree"
#define pll pair<ll, ll>
#define pii pair<pll, pll>
#define fi first
#define se second
#define ull unsigned long long
using namespace std;
const ll mod = 998244353;
const ll N = 1e5+5;
ll n, m, t, ans, k, a[N][22], b[N], c[N], ... |
#include<iostream>
using namespace std;
int main()
{
int n,a,b,miA,miB,ans,tmp;
cin>>n;
cin>>a>>b;
miA=a;miB=b;ans=a+b;
for(int i=1;i<n;i++)
{
cin>>a>>b;
ans=min(ans,a+b);
tmp=min((max(miA,b)),(max(miB,a)));
ans=min(ans,tmp);
miA=min(miA,a);
miB=... | #include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<... |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long K;
cin >> K;
vector<long long> d(K + 5, 0);
for(long long a = 1; a <= K; ++a){
for(long long b = 1; a * b <= K; ++b){
long long c = K / (a * b);
... | // Parasparopagraho Jīvānām
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace __gnu_pbds ;
using namespace __gnu_cxx ;
using namespace std ;
typedef long long ll ;
t... |
# include <bits/stdc++.h>
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(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>0; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <stack>
#include <string>
#include <bitset>
#include <set>
#include <cmath>
#define LL long long
#define ull unsigned long long
using namespace std;
const int MAXN = 25;
int n;
int ans = 25;
LL ret ... |
#pragma region
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
const int INF = INT_MAX;
const ll LLINF = LLONG_MAX;
#define all(x) x.begin(), x.end()
#define rep(i, s, e) for(ll i = s; i < e; ++i)
#define repr(i, s, e) for(ll i = s; i > e; --i)
t... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_set>
t... |
#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
constexpr ll mod = 1000000007LL;
int N;
char caa, cab, cba, cbb;
void input(void){
cin >> N;
cin >> caa >> cab >> cba >> cbb;
}
ll modpow(ll a, ll b){
if (b == 0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main(void)
{
ll N;
cin >> N;
ll a=0, b=0, c=0;
ll nn = 1;
ll INF = 1001001001;
ll an=INF, bn=INF, cn=INF;
while(1)
{
a = N/nn;
... |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define _roverload(_a1, _a2, _a3, name, ...) name
#define _rep(i, n) repi(i, 0, n)... | #include <bits/stdc++.h>
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define REPS(i, ss, nn ) for(int i = ss ; i < (int) nn; i++)
#define REV(i, ss, nn ) for(int i = ss ; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
#define all(x) x.beg... |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)... | #include<bits/stdc++.h>
using namespace std;
#define enviar {ios_base::sync_with_stdio(false);}
#define aiuda {cin.tie(NULL); cout.tie(NULL);}
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, ... |
#include <bits/stdc++.h>
using ll=long long;
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
... | // acl1
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll t;
cin>>t;
while(t--){
ll l,r;
cin>>l>>r;
ll n=r-l-l+1;
ll ans=((n)*(n+1))/2;
if(n>0)
cout<<ans<<endl;
else{
cout<<0<<endl;
}
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=1e18;
ll power(ll x, ll y){
x%=MOD;
ll ret=1;
whi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int MOD = 1000000007;
int f[400001], g[400001];
/*
実行時Modint :
template <int& MOD = 1000000007>
static int MOD;
cin >> MOD;
*/
templa... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int N,S,D,ff=0;
vector<int> X,Y;
//vector<vector<vector<int>>> dp;
//long long amt=0;
//string s;
int ans=0;
cin >> N >> S >> D;
X = Y = vector<int>(N);
//A.at(0) = A.at(0) = 0;
for(int i=0; i<N; i++){
ci... | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define ll long long
#define PI 3.1415926535897932384626
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >>n;
long long a,ans=0,cnt[205]={0};
for(int i=0;i<n;i++){
cin >>a;
cnt[a%200]+=1;
}
for(int i=0;i<200;i++){
if(cnt[i]>1){
ans+=(cnt[i]-1)*cnt[i]/2;
}
}
cout <<ans <<endl;
... | #include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boo... |
#include<bits/stdc++.h>
using namespace std;
#define rapid() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
int main(){
rapid();
int n;
cin>>n;
int n2=1<<n;
vector<int>a(n2);
map<int,int>mp;
for(int i=0;i<n2;i++){
cin>>a[i];
}
for(int i=0;i<n2;i++){
m... | #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 tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
#define ll long long
#define boost ios::sync_with_stdio(false), cin.tie(n... |
//#include "pch.h"
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#inc... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <cstdlib>
#include <math.h>
using namespace std;
typedef long long ll;
int main(){
int n, k, m, sum=0, ans=0;
cin >> n >> k >> m;
vector<int>a(n);
for(int i=0; i<n-1; i++){
ci... |
// Problem: C - Keep Graph Connected
// Contest: AtCoder - AtCoder Regular Contest 108
// URL: https://atcoder.jp/contests/arc108/tasks/arc108_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline i... | #include<iostream>
#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<ll, null_type,less<>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define FOR(i,a,b) for(ll i=a;i<... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<=(int)(n); i++)
#define rep2(i, n, m) for(int i=(int)n; i<=(int)m; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
const ll inf=1LL<<60;
const ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m;
ll ksm(ll x, ll y, ll mod) {
x = x % mod;
ll base = 1;
while (y) {
if (y & 1) {
base = base * x;
base = base % mod;
}
x = x * x % mod;
y = y / 2;
}
return base;
}
i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll MOD=((1e9)+7);
bool sortcol( const vector<ll>& v1,const vector<ll>& v2 )
{
return v1[0] < v2[0];
}
int main()
{
ll n, su=0;
cin>>n;
set<ll> s;
for (ll i=1; i<=n; i++)
{
ll p;
cin>>p;
su+=p;
s.insert(p);
}
if (s.size()=... | #include <bits/stdc++.h>
#define x first
#define y second
#define endll '\n'
#define pb push_back
#define mem(x,a) memset(x,a,sizeof(x))
using namespace std;
const int N=1e5+10,mod=19650827;
const int inf=0x3f3f3f3f;
typedef long long ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
int n,k,m;
inline int ... |
#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;
ll my_gcd(ll a,ll b)
{
if (b == 0) return a;
return my_gcd(b,a%b);
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
... | #include <bits/stdc++.h>
using namespace std;
int t;
void exgys(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
} else {
exgys(b, a % b, y, x);
y -= a / b * x;
}
}
long long inv(long long a, long long Mod) {
long long x, y;
exgys(a, Mod, x, y);
return ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,i,ans1,ans2,ans3,ans4,ans5;
cin >> n;
vector<pair<long long,long long>> x(n),y(n);
for(i=0; i<n; i++){
cin >> x[i].first >> x[i].second;
y[i].first=x[i].second; y[i].first=x[i].second;
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
void solve() {
string s;
cin >> s;
reverse(s.begin(), s.end());
for(auto& e : s) {
if(e == '6') {
e = '9';
} else if(e == '9') {
... |
#include <bits/stdc++.h>
#define ll long long
#define pi pair<int, int>
#define pf pair<float, int>
#define ps pair<string, int>
#define pii pair<int, pi>
#define mi map<int, int>
#define ml map<long long, int>
#define ms map<string, int>
#define mc map<char, int>
#define mpi map<pi, int>
#define F first
#define S sec... | #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>
using namespace std;
int main() {
int K;
string S, T;
cin >> K >> S >> T;
double ans=0;
for(int i=1; i<=9; i++){
for(int j=1; j<=9; j++){
vector<int>TAKA(10);
vector<int>AO(10);
vector<int>WA(10);
for(int k=0; k<4; k++){
int n=int(... | #include <bits/stdc++.h>
using namespace std;
int main(){
double N,D,H,d,h;
double notans = 1000.0, tmp, ans;
cin >> N >> D >> H;
for(int i=0; i<N; i++){
cin >> d >> h;
tmp = (H-h)/(D-d);
if(tmp<notans) notans = tmp;
}
ans = H-notans*D;
if(ans<0.0) ans = 0.0;
cou... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 9 * 1000000000000000000 //9*10^18
template <typename T>
bool chmax(T &a, co... |
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
#define N 100010
using... | #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <utility>
#include <queue>
#include <map>
#include <assert.h>
#include <stack>
#include <string>
#include <ctime>
#include <chrono>
#include <random>
using namespace std;
//author: Legendary Grandmast... |
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(){
int N;
cin>>N;
int t;
map<int,int> A;
for(int i=0;i<N;i++){
cin>>t;
A[t]+=1;
}
vector<int> B;
for(int i=0;i<N;i++){
cin>>t;
B.push_back(t);
}
unsigned long long r=0;
for(int i=0;i<N;i++){
cin>... | #include <bits/stdc++.h>
#define vi vector<int>
#define tests int t; cin>>t; while(t--)
#define ll long long
#define vll vector<long long>
#define srt(v) sort(v.begin(), v.end())
#define srtg(v) sort(v.begin(), v.end(), greater<int> ())
#define FOR(k, n) for(int k=0; k<n; k++)
#define pb push_back
#define yes cout<<"Y... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
bool chk(string &s,string t){
int n=(int)(s.length());
for(int i=0;i<n;i++){
if(s[i]!=t[i%3]) return false;
}
return true;
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin>>n;
... | #include <bits/stdc++.h>
#define se second
#define sz(x) (int)(x.size())
#define ll long long
#define rep(i,x,y) for(int i = x; i <= y; ++i)
#define repr(i,x,y) for(int i = x; i >= y; --i)
#define pb push_back
#define mp make_pair
#define fi first
#define ull unsigned ll
#define pi 3.14159265358979
using name... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,m;
cin>>n>>m;
vector<string> a(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
// vector<ll> b(n);
ll e=0,o=0;
for(int i=0;i<n;i++){
int c=0;
for(int j=0;j<a[i].length();j++){
c+=a[i][j]-'0';
}
// ... | #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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define ar array
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
string grid[h];
for (int i=0; i<h; i++) {
cin >> grid[i];
}
int c=0;
for (int i=1; i<h; i+... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
type... |
#include<bits/stdc++.h>
#define pb emplace_back
#define pf first
#define ps second
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define Endl '\n'
#define codejam cout<<"Case #"<<t<<": ";
#define pl pair<ll,ll>
#define mod 1000000007
#define INF 1000000001
#define forn(i,n) for(ll i=0;i<n;i++)
#d... | #include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
const int MOD = 1000000007;
#define PI = acos(-1)
using namespace std ;
int main(){
fastio ;
int a , b ;
cin >> a >> b ;
int num = b - a ;
... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define fin(a) { cout << a << endl; return 0; }
#define debug(a) { cerr << #a << ": " ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "dfs"
#define pll pair<ll, ll>
#define pii pair<ll, pll>
#define fi first
#define se second
#define ull unsigned long long
using namespace std;
const ll mod = 1e9+7;
const ll N = 1e6+55;
vector<ll> adj[N], dx[N], dy[N];
vector<ll> kq;
strin... |
#include <bits/stdc++.h>
using namespace std;
int PREP = (cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12), 0);
//int SEGV = getenv("D") || (exit(system("D= SEGFAULT_SIGNALS=all catchsegv ./prog.exe") >> 8), 0);
using Int = long long;
int main() {
int N; cin >> N;
for (int i = 1;... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP... |
// 解き直し.
// https://atcoder.jp/contests/keyence2021/editorial/564
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#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 >... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000030;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 998244353;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
typedef pair<int,P> PP;
template<class T> inline bool chmax(T &a, T b) {
if (a < b) {
... |
#include <bits/stdc++.h>
using namespace std;
#define pra(i,k,n) for(i=k;i<n;i++)
#define all(a) a.begin(), b.begin()
int main() {
string s; cin >> s;
int i, n = s.size();
string t = "";
pra(i,0,n) {
if (s[i]=='.') break;
t += s[i];
}
cout << t << '\n';
return 0;
} | #include<iostream>
#include<vector>
#include<math.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
long long int mod = 1e9+7;
int main(){
long long int n;
cin>>n;
vector<long long int>a(1000000,0);
for (long long int i = 0;(i+1)*(i+1)<=n;i++){
if(n%(i+1)==0){
printf("%lld\n",i+1);
if((... |
#include <bits/stdc++.h>
#define forn(i,a,b) for(int i=a; i<=b; i++)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7,N=2e5+5;
void solve(){
int n;
string s[64];
cin>>n;
forn(i,1,n) {
cin>>s[i];
// cout<<s[i]<<endl;
}
ll dp[64][2]={0};
if(s[1]=="AND"){
dp[1][1]=1;
dp[1][0]=3;
} else if(s[1]... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define uint unsigned int
#define ull unsigned ... |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
//typedef tree<int,null_type,less<int >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template<class T1, class T2>
ostream &operator <<(ostrea... | #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 ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define r... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p; //vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define RE... | #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... |
//Bismillahir-Rahmanir-Rahim
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int llu;
#define f1(i,n) for(i=1;i<=n;i++)
#define f(i,n) for(i=0;i<n;i++)
#define Max 100009
#define pb push_back
#define mp make_pair
#define cy "YES\n"
#define cn "NO\n"
using namespace std;
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define drep(i, x) for (int i = ((int... |
// Problem: F - Close Group
// Contest: AtCoder - AtCoder Beginner Contest 187
// URL: https://atcoder.jp/contests/abc187/tasks/abc187_f
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define fi first
#defi... | //abc187_f.cpp
//Sat Jan 9 16:04:40 2021
#include <bits/stdc++.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
int n,m;
cin >> n >> m;
vector<int> e(n,0);
... |
/*...................................................................*
*............___..................___.....____...______......___....*
*.../|....../...\........./|...../...\...|.............|..../...\...*
*../.|...../.....\......./.|....|.....|..|.............|.../........*
*....|....|.......|...../..|....|..... | #include<bits/stdc++.h>
using namespace std;
int n,dsu[110],cnt;
int find(int x){return dsu[x]==x?x:dsu[x]=find(dsu[x]);}
void merge(int x,int y){dsu[find(x)]=find(y);}
pair<double,pair<int,int> >e[20100];
pair<int,int>p[110];
int main(){
scanf("%d",&n);
for(int i=0;i<=n+1;i++)dsu[i]=i;
for(int i=1;i<=n;i++)scanf("%... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> T(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> T.at(i);
sum = sum + T.at(i);
}
sum /= 2;
vector<bool> ans(sum + 1, false);
ans.at(0) = true;
int pmax = 0;
for (int i = 0; i < N; i++) ... | #include <bits/stdc++.h>
using namespace std;
template<typename T> void read(T &x) {
x = 0; int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + (ch - 48);
ch = getchar();
}
x *= f;
}
typedef long long LL;
int n;
LL ans = 1;... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast \
ios_base ::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct... | #include <bits/stdc++.h>
#define rep( i, a, b ) for( i = a; i < b; i ++ )
using namespace std;
struct sc {
int t;
int am;
public:
bool operator>( const sc &r ) const {
return t == r.t ? am > r.am : t > r.t;
}
};
int main() {
int le, li, u, am, f, t, i;
priority_queue< sc, vector... |
#include <iostream>
#include <vector>
#include <bitset>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
int main(){
ll n,m;
cin >> n >> m;
if(n==1 && m==0){
cout << 1 << " ... | // KNOW NOTHING!
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define szs(x) (int)x.length()
#defi... |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repn(i,a,b) for(int i=a;i>=b;i--)
#define F first
#define S second
#define pii pair<int,int>
#define vi vector<int>
#defi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a;
long long mx=0;
for (int i=0; i<n; i++) {
long long x;
cin >> x;
a.push_back(x);
mx=max(mx,abs(x));
}
long long sum=0;
for (int i=0; i<n; i++) {
sum+=abs(a[i]);
}
cout << sum << endl;
sum=0;
for (int ... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define nl cout<<endl
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define ... |
#include<bits/stdc++.h>
using namespace std;
using ll= long long;
ll fun(string s,ll mid,ll m )
{
ll val=0,z=1;
for(ll i=s.size()-1; i>=0; i--)
{
ll t=s[i]-'0';
if(t>(m/z))
{
val=m+1;
break;
}
val+=t*z;
if(val>m)
{
... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN
using namespace std;
typedef long long int64;
int read() {
int f = 1,res = 0;
char ch = getchar();
while(ch < '0' || ch > '9') {
if(ch == '-') f *= -1;... |
/**
* created: 02.11.2020 19:03:47
**/
#ifdef _LOCAL_
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <boost/math/tools/minima.hpp>
// #include <boost/range/irange.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define name(... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 1000000007LL
//#define MOD 998244353LL
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>; // intの2次元の型に vvi という別名をつける
cons... |
#include <bits/stdc++.h>
using namespace std;
vector<vector<long long>> graf;
vector<long long> val, trz;
vector<bool> odw;
long long curVal, curTrz;
void dfs(long long x){
odw[x] = true;
curVal+=val[x];
curTrz+=trz[x];
for(auto it:graf[x]){
if(!odw[it]) dfs(it);
}
}
int main(){
ios_base::sync_with_stdio(0)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+9;
const int MAX=1e2+9;
const double ep=1e-10;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;
const double inf=1e20;
const double pi=acos(-1);
#define debug1 puts("?");
#define debug(x) cout<<"##"<<(x)<<endl;
#define mk make_pair
#def... |
#include <iostream>
#include <vector>
#include <cmath>
#include<algorithm>
using namespace std;
#define endl '\n'
#define vi vector <ll>
#define ll long long int
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main()
{ fast;
ll t;
cin>>t;
ll x= 1.08 * t;
if( x< 206)
cout<<"... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define forn(n) for(int i=0;i<n;i++)
#define pb push_back
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;
}... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
#define MOD 1000000007
ll ll_pow(ll a, ll b) {
if (b == 0) {
return 1;
}
return a * ll_pow(a, b - 1);
}
int main() {
ll S, P;
cin >> S >> P;
vector<pair<ll, ll>> v;
for (ll i = 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, j, k) for(int i = j; i < k; i++)
#define print(x) cout << x
#define newline cout << endl
#define space cout << ' '
#define INF 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll converter(ll number)
{
ll num1, num2, res;
string num = to_string(number);
sort(num.begin(), num.end(), greater<char>());
num1 = stoll(num);
sort(num.begin(), num.end());
num2 = stoll(num);
res = num1-num2;
... | #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"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define pb push_back
#define vec vector<i... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long
int m=1e9+7;
int main()
{
int n,m,temp1,temp2;
cin>>n>>m;
int a[n];
int b[m];
int c[m+1];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<m;i++){cin>>b[i];c[i]=i;}
c[m]=m;
for(int i=1;i... |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define reps(i,n) for(ll i=1;i<=(n);++i)
#define repr(i,n) for(int i=2;i*i<=(n);++i)
#define ll long long
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb push_back
#define pob pop_back()
#define Mod (ll)(1e9+7)
#define mod (l... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<vector>
#include<queue>
#include<algorithm>
#include<string>
#include<sstream>
#include<cctype>
#include<cmath>
#include<iomanip>
#include<map>
#include<stack>
#include<set>
#include<functional>
#define in(x) x=read()
#defi... |
#include <iostream>
#include <cstdio>
using namespace std;
int main(int argc, char** argv) {
double a,b,c,d;
cin >> a >> b >> c >> d;
printf("%.10lf",(c-a)/(b+d)*b+a);
return 0;
} | /*Jai Shree Ram*/
// Never Give Up
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi ... |
#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<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//optimal subsequences-2 technocup round-3 2020
using namespace std;
using namespace __gnu_pbds;
const int N=2e5+10;
//#define d double
#define F first
#define S second
#define ll long long int
#define FastIO ios_base:... |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
#define GETVEC(v) for(auto& m : v) cin >> m;
using namespace std;
using LLONG ... | #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T>
T gcd(T a, T b) { return ((a % b == 0) ? b : gcd(b, a % b)); }
template <typename T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr LL ... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define REP(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef unsigned long long ull;
int main()
{
ull x,y;
cin>>x>>y;
if(x==y){
cout<<x;
}else{
switch(x+y){
case 1:
cout<<2;
brea... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(),... |
#include<cstdio>
using namespace std;
long double f=1.08;
int n,m;
int main(){
scanf("%d",&n);
m=n*f;
if(m<206)printf("Yay!");
else if(m==206)printf("so-so");
else printf(":(");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long n,cnt,sum,ans;
bool u[100005];
int main()
{
cin>>n;
ans=n;
cnt=2;
while(cnt*cnt<=n)
{
if(u[cnt]==1)
{
cnt++;
continue;
}
sum=cnt*cnt;
while(sum<=n)
{
if(sum<=100000)u[sum]=1;
ans--;
sum*=cnt;
}
cnt++;
}
cout<<ans;
return 0;... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl
typedef long long ll;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
void solve() {
ll l, r; cin >> l >> r;
ll ma = r, ... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=3000,mod=998244353;
int add(int a,int b,int p=mod){return a+b>=p?a+b-p:a+b;}
int sub(int a,int b,int p=mod){return a-b<0?a-b+p:a-b;}
int mul(int a,int b,int p=mod){return (LL)a*b%p;}
void sadd(int &a,int b,int p=mod){a=add(a,b,p);}
void ... | #include <bits/stdc++.h>
using namespace std;
int main (){
#ifndef ONLINE_JUDGE
freopen("SuhaibSawalha1","r",stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b;
cin >> a >> b;
int t = 1;
if (a < b) {
swap(a, b);
t = -1;
}
for (int i = 1; i <= a; ++i) {
cout <... |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) co... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cctype>
#include <cmath>
#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <stack>
#include <queue>
#include <ctime>
#define _for(i,a,b) for(int i=(a);... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin >> n;
long long left = 0;
long long right = 2e9;
while (right - left > 1)
{
long long x = (left + right) / 2;
if ((x * (x + 1)) / 2 <= n + 1)
{
left = x;
}
else
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string X;
ll M;
bool solve(ll mid) {
ll res = 0;
ll multiply = 1;
for(ll i = X.length() - 1; i >= 0; i--) {
ll x = (X.at(i) - '0');
if(multiply > (1e18 / x)) {
return false;
}
if(res > 1e18 - x * multip... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll r, x, y;
int main()
{
cin >> r >> x >> y;
double d = sqrt(x * x + y * y);
double num = d / r;
double temp = d - ((ll)num * r);
// cout << d << " " << num << " " << temp << endl;
if (temp == 0)
cout << (ll)num << endl... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <stack>
#include <queue>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
#d... |
#include <bits/stdc++.h>
using namespace std;
vector<int> BFS(int n, vector<vector<int>>& paths, int& N) {
// BFSで宝石nから各宝石までの距離を求める
vector<int> dist(N, INT_MAX); dist[n] = 0;
set<int> visited; visited.insert(n);
deque<int> que; que.push_back(n);
while(!que.empty()) {
int now = que.front();... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second
using namespace std;
typedef long long ll;
int start[100005], finish[100005];
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0); cin.tie(0);
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 ... |
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#i... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int a[n];
for (auto &i : a) i = ri();
int res = 2000000000;
for (int i = 0; i < 1 << (n - 1); i++) {
int xored = 0;
int ored = 0;
for (int j = 0; j <= n; j++) {
if (j < n) ored |= a[j];
if (j == n ... |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cstring>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<string.h>
using namespace std;
long long int a[300001];
long long int b[300001];
long long int amax[200001];
string func0(string s);
string func1(string s);
str... | #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 VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <class T>
using Vec2 = vector<vector<T>... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i,N)
cin >> A[i];
ll DP[N+1][2];
ll numm[N+1]={0},nump[N+1]={0};
memset(DP,0,sizeof(DP));
DP[1]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define ff first
#define ss second
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define nn "\n"
#define sci(x) scanf("%d", &x)
#define LL_INF (1LL << 62)
#d... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define al... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
// find_by_order(k) returns the iterator to the kth largest element (start from 0)
// order_of_key(k) returns the number of elements in the set which are strictly less than the value k
using namespace std;
using namesp... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
const int mod = 1e9 + 7;
#define ff first
#define ss second
#define pb push_back
#define all(v) v.begin(), v.end()
const ll inf = 2e18;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//okita
int main(){
ll N;cin>>N;
vector<double>l(N),r(N);
rep(i,N){
int t; cin >> t >> l[i] >> r[i];
t--;
if(t&1) r[i] -= 0.5;
if(t&2) l[i] += 0.5;
}
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f[3005][3005],a[3005],s[3005],ans=0ll;
ll mod=1e9+7;
int n;
int main(){
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i],s[i]=s[i-1]+a[i];
f[1][0]=1;
for(int i=1;i<=n;i++){
for(int j=n;j>=1;j--){
f[j+1][s[i]%(j+1)]=(f[j+1][s[i]%(j+1)]+f[j][s[i]%j])%mo... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
void co... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main(){
int n;cin>>n;
vector<ll> ans;
vector<ll> x(n,0),y(n,0);
REP(i,n) cin>>x.at(i)>>y.at(i);
sort(x.begin(),x.end());
sort(y.begin(),y.end());
ans.emplace_back(abs(x.at(0)-x.at(n-1)));
an... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<tuple<int, int, int>> Hx(N), Hy(N);
for(int i = 0; i < N; i++)
{
cin >> get<0>(Hx.at(i)) >> get<1>(Hx.at(i));
get<2>(Hx.at(i)) = i;
get<0>(Hy.at(i)) = get<1>(Hx.at(i));
get<1>(Hy.at(i)) = get<0>(Hx.at(i));
... |
//#define DEBUG
#define OPTIMIZE
//#define PBDS
//#define INTERACTIVE
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5000;
const int INF = 0x3f3f3f3f, MOD = 998244353;
const long long LINF = LONG_LONG_MAX;
#define INIT(arr, val) fill(arr, arr+(int)(sizeof(arr)/sizeof(arr[0])), val)
#define REP(i, lb, ... | #include <bits/stdc++.h>
/* snippet: useful macros and functions */
#define ARC(i, a, b) for(Int i = (a); i < (b); ++i)
#define RC(i, n) ARC(i, 0, n)
#define ARCH(i, a, b) for(Int i = (a) - 1; i >= (b); --i)
#define RCH(i, n) ARCH(i, n, 0)
#define ALL(v) v.begin(), v.end()
template<class T> T rng(const T &a, const T &... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
string S;
void gogo()
{
cin >> N >> S;
if (S[0] != S[N-1])
{
cout << "1\n";
return;
}
for (int i = 0; i + 1 < N; i++)
{
if (S[i] != S[0] && S[i+1] != S[0])
{
cout << "2\n";... |
/*/ Author : Abhishek Chauhan /*/
#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;
// a+b = a^b + 2*(a&b)
// According to Fermat's little theorem, (a^b)%mod = ((a^(b%(mod - 1)))%mod) if mod is a pri... |
#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... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... |
#include <algorithm>
#include <cstdint>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <cfloat>
... | #include<cstdio>
using namespace std;
char a,b,c;
int main()
{
scanf("%c%c%c",&a,&b,&c);
if(a==b&&b==c) printf("Won");
else printf("Lost");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vpii vector<pii>
#define pb push_back
#define MOD 1000000007
#define all(x) x.begin(), x.end()
#define sze(x) (int) x.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
double a,b,c,d;
cin >> a >> b >> c >> d;
double k = (a*d+b*c)/(b+d);
cout << setprecision(8) << k << endl;
} |
#include<bits/stdc++.h>
#define M 200005
typedef long long ll;
using namespace std;
bool f2;
char IO;
ll rd(){
ll num=0;bool f=0;
while(IO=getchar(),IO<48||IO>57)if(IO=='-')f=1;
do num=(num<<1)+(num<<3)+(IO^48);
while(IO=getchar(),IO>=48&&IO<=57);
return f?-num:num;
}
int n,m;
struct node{
int X,Y;
bool operator... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
map<int, vector<int>> mp;
rep(i, m){
int x, y;
cin >> x >> y;
mp[x].push_back(y);
}
set<int> s;
s... |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <sstream>
#define INF 1000000009
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int a, ... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#inc... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
constexpr int inf=1000001000;
constexpr ll INF=2e18;
constexpr ll MOD=1000000007;
// ll MOD=998244353;
... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
int n,m,sum,ans,a[2005];
int ksm(int n,int m){
if (!m)return 1;
int s=ksm(n,m>>1);
s=1LL*s*s%mod;
if (m&1)s=1LL*s*n%mod;
return s;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
sum+=n;
m+=n;
//... |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin>>n;
vector<pair<ll,ll>>v;
for(ll i=0;i<n;i++)
{
ll z,x;
cin>>z>>x;
v.push_back({z,x});
}
vector<ll>t;
for(ll i=0;i<n;i++)
{
for(ll j=0;... | #include <bits/stdc++.h>
using namespace std;
#define fori(i, start, end) for(int i=start; i<=end; i++)
#define ford(i, start, end) for(int i=start; i>=end; i--)
#define fora(i, iterable) for(auto i=iterable.begin(); i!=iterable.end(); i++)
#define mmset(ds, val) memset(ds, val, sizeof(ds))
#define sortar(arr, len) so... |
#include <bits/stdc++.h>
using namespace std;
void DBG() { cerr << endl; }
template <class Head, class... Tail>
void DBG(Head H, Tail... T) { cerr << ' ' << H; DBG(T...); }
#define dbg(...) cerr << "(" << (#__VA_ARGS__) << "):", DBG(__VA_ARGS__)
using ll = long long;
using ld = long double;
#define INF 0x3f3f3f3f
#d... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define f... |
#include <iostream>
#include <vector>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<deque>
#include<math.h>
#include<set>
#include<string>
#include<queue>
#include<map>
using namespace std;
#define rep(i,n) for(ll i = 0;i<n;i++)
#define req(i,n) for(ll i = 1;i<=n;i++)
#define rrep(i,n) for(int i =... | #include <stdio.h>
long long A, B, C;
long long d[10][4];
int main() {
long long i, u;
for (i = 0; i < 10; i++) for (d[i][0] = i, u = 1; u < 4; u++) d[i][u] = (d[i][u - 1] * i) % 10;
scanf("%lld%lld%lld", &A, &B, &C);
B %= 4, C %= 32;
for (i = 1, u = 0; u < C; i *= B, u++);
printf("%lld", d[A % 10][(i + 3) %... |
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define eb emplace_back
using namespace std;
void vec(vector<int> & v){
for(int i = 0;i<v.size() ; i++){
cout<<v[i]<< " ";
}
cout<<endl;
}
void vec_ll(vector<long long int> & v){
for(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
struct mint {
ll x; // typedef long long ll;
mi... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll n, s, d;
cin >> n >> s >> d;
vector<ll> a(n), b(n);
rep(i, n){
cin >> a[i] >> b[i];
}
ll total = 0;
rep(i, n){
if(a[i] < s && b[i] > d){
... | #include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
int N, S, D;
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
cin >> N >> S >> D;
for(int i=1; i<=N; i++)
{
int x, y;
cin >> x >> y;
if (x >= S || y <= D) continue;
cout << "Yes";
return 0;
}
cout << "No";
retu... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 60;
int main()
{
ll n;
cin >> n;
ll ans = n + 1;
... | #include<bits/stdc++.h>
using namespace std;
//inline unsigned long long read()
//{
// unsigned long long sum=0,nega=1;char ch=getchar();
// while(ch>'9'||ch<'0'){if(ch=='-')nega=-1;ch=getchar();}
// while(ch<='9'&&ch>='0')sum=sum*10+ch-'0',ch=getchar();
// return sum*nega;
//}
unsigned long long n,res,ans,mid;
int mai... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
int n, c;
cin >> n >> c;
vector<pair<int, int>> vp(2 * n);
for (int i = 0; i < n; ++i)
{
int a, b, c1;
cin >> a >> b >> c1;
vp[2 * i] = {a, c1};
vp[2 * i + 1] = {b + 1, -c1};
}
so... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<l... |
#include <iostream>
#include <vector>
#include <utility>
#include <queue>
#include <vector>
#include <list>
#include <cmath>
#include <map>
#include <deque>
#include <utility>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <string>
#include <stack>
#include <set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x) cerr << "[" << #x << "]: " << x << "\n";
using ll = long long;
using ld = long double;
using ii = pair<int, in... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
double a,b; cin>>a>>b;
double ans=((a-b)/a);
cout<<ans*100;
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#de... |
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define For(n) for(int i=0;i<n;i++)
#define in(x) int x; cin>>x;
#define rrep(i,a,n) for(int i=n;i>=a;i--)
#define out(x) cout<<x<<'\n';
#define vi vector<int>
#define pi pair<int,int>
#define F first
#define S second
#define PB push_back
#define MP make... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <set>
#include <map>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll sum = 0;
rep(i, 0, n) {
ll a, b;
cin >> a >> b... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(i,a,b) for(int i = a; i<b ; i++)
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define M 1000000007
int mod(int x){
return ((x%M + M)%M);
}
int add(int a,int b){
return mod(mod(a)+mod(b)... | #include<bits/stdc++.h>
using namespace std;
const int N=800+5;
int n,k;
int a[N][N];
struct point{
int x,y;
int a;
bool operator <(const point &p)const{
return a<p.a;
}
}s[N*N];
int cnt;
int f[N][N];
int get(int l,int r,int x,int y){
return f[x][y]-f[x][r-1]-f[l-1][y]+f[l-1][r-1];
}
bool check(int mid){
for(in... |
#include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
const int N = 1e5 + 10;
int n, fa[N], col[N];
struct SGT {
int sz[N << 2];
void modify(int x, int l, int r, int p, int v) {
if (l == r) {
sz[x] = v; return;
}
int mid = (l + r) >... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
for (int i=1; i<=n; i++)
cout << int(log2(i))+1 << " ";
return 0;
} |
#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 inf INT_MAX
#define llinf LLONG_MAX
#define mt make_tuple
#define mp make_pair
#define parll pair<ll,ll>
#define parii pair<int,int>
#define mxn 2002
ll n,m,p,d,t;
vector <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,Q;
cin >>N;
long long X[N+1],Y[N+1];
//input
for(int i=1;i<=N;i++){
cin >> X[i] >> Y[i];
}
cin >> M;
vector<pair<int,int>> op;
int a,b;
for(int i=1;i<=M;i++){
cin >> a;
if(a==3||a==4){
cin >>b;
op.push_back(m... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << ... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <typename T>bool chmin(T &a, c... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef vector<vector<int>> graph;
#define pu push
#define p... | #include<bits/stdc++.h>
typedef long long ll;
//#define ll long long
#define int long long
//#define ull unsigned long long
//#define PI pair<int,int>
//#define PII pair<int,PI>
//#define PI pair<ll,int>
//#define endl "\n"
using namespace std;
const int maxm=2e3+5;
const int p=1e4;
int read(){
string s;cin>>s;
... |
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<climits>
#include<bitset>
#include<unordered_map>
#include<random>
#include<functional>
using namespace std;
#define max(A,B) ((A)>(B)?(A):(B... | #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 int long long
#define ll long long
#define pb push_back
#define vi vector<ll>
#define mi map<ll,ll>
#define all(a... |
#include <bits/stdc++.h>
using namespace std;
#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define IN(x,c) (find(c.begin(),c.end(),x) != (c).end())
#define REP(i,n) for (int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define INIT(a,v) memset(a,v,sizeof(a))
#define SORT_UNIQUE(c) (so... | // Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
// #include "atcoder/all"
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return tr... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.