code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/debug.h"
#else
#define db(...)
#endif
#define all(v) v.begin(), v.end()
#define pb push_back
using ll = long long;
const int NAX = 5000 + 5;
constexpr int64_t MOD = 998244353;
int pw[NAX][NAX];
int add(int a, int b)
{
a += b;
if (a >= MOD... | #include "bits/stdc++.h"
#include<sstream>
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const long long inf = 1e18;
const ll INFL = 1e18;
const ll MOD = 1e9 + 7;
int digit(ll x) {
int digits = 0;
... |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
printf("%d %d\n", 2*i%n+1, (2*i+1)%n+1);
}
}
| #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... |
/**
* author: avoas
* created: 12.05.2021 18:03:29
**/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr double EPS = 1e-12;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
i... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define endl ("\n")
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define vi vector<lli>
#define ff first
#define ss second
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) ... |
#include<iostream>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
int t = (2 * a) + 100 ;
if(t-b < 0){
cout << 0 << endl;
}
else{
cout << t-b << endl;
}
}
| #include <iostream>
using namespace std;
int main(void)
{
int x, y;
cin >> x >> y;
if (x > y) {
if ((y + 3) > x) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
if (y > x) {
if ((x + 3) > y) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
} |
#include<fstream>
#include<iostream>
#include<sstream>
#include<vector>
#include<stack>
#include<string>
#include<algorithm>
#include<cmath>
#include<unordered_map>
#include<map>
#include<queue>
#include<tuple>
#include<iomanip>
#include<bitset>
#include<stdio.h>
#include<set>
#include<array>
using namespace std;
#defi... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
int main()
{
ll n, m, q;
cin >> n >> m >> q;
vector<pair<ll, ll>> nimotu(n, pair<ll, ll>());
for (ll i = 0; i < n; i++) {
cin >> nimotu[i]... |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(int a,int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
#define in(x) scanf("%lld",&x)
#define ... | // โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define l... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#include <unordered_map>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
using VV = vector<V>;
using SV = vector<string>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
... | #include<bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define PI (2 * acos(0))
#define all(x) x.begin(), x.end()
#define spc(x) cout<<fixed<<setprecision(x)
void sol... |
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),i##end=(b);i<i##end;i++)
#define REP(i,a,b) for(int i=(a),i##end=(b);i<=i##end;i++)
#define RFOR(i,a,b) for(int i=(a),i##end=(b);i>i##end;i--)
#define RREP(i,a,b) for(int i=(a),i##end=(b);i>=i##end;i--)
typedef long long LL;
struct Edge{
int from,to,add,mul;
E... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<utility>
#include<algorithm>
#include<functional>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<set>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using piii = pair<... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endline '\n'
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define pb push_back
#define fr(i,a,b) for(int i=a;i<(int)b;i++)
#define rfr(i,a,b) for(int i=a;i>=(int)b;i--)
#define ff first
#def... | #include <iostream>
#include <algorithm>
using namespace std;
const int N = 2e3 + 50;
double l[N], r[N];
bool ck(int u, int v)
{
if (r[u] < l[v] || l[u] > r[v]) return false;
else return true;
}
int main()
{
int n, ans = 0;
cin >> n;
for (int i = 0; i < n; i ++)
{
int t;
cin ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 ln cout<<'\n'
void pr(){ln;}
template<class A, class...B>void pr(const A &a, const B &...b){cout<<a<<' ';pr(b...);}
void solve() {
int n;... | #include <cstdio>
#include <algorithm>
#include <numeric>
using namespace std;
int N,K;
using ll = long long int;
int mat[55][55];
bool o[55][55];//graph
bool comp_set[55][55];
bool visited[55];
const ll MOD=998244353;
ll solve(){
ll ret=1ll;
for(int i=1;i<=N;i++){
ll cnt=1;
for(int k=1;k<... |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int h, w, x, y;
cin >> h >> w >> x >> y;
char s[h][w];
for(int i=0; i<h; i++)
for(int j=0; j<w; j++)
cin>>s[i][j];
x--;
y--;
int ans=0;
for(int i=y+1; i<w; i++)
{
if(s[x][i]=='#')
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define inf 2000000000
#define infLL 2000000000000000000
#define MAX5 100005
#define MAX6 1000006
#define MAX7 10000007
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define sfs(a) sc... |
/*เฅ เคจเคฎเฅ เคญเคเคตเคคเฅ เคตเคพเคธเฅเคฆเฅเคตเคพเคฏ เคจเคฎเค*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
const double pi = 3.14159265359;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++... |
// Problem : F - +1-1x2
// Contest : AtCoder - AtCoder Beginner Contest 188
// URL : https://atcoder.jp/contests/abc188/tasks/abc188_f
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cp-editor)
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios_base... | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define... |
// Always remember that you are absolutely unique, just like everyone else!
#include <iostream>
#include <vector>
using namespace std;
// DEBUGGING SECTION
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
void solve() {
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n; i += 2) {
if (s[i] < 'a' || s[i] > 'z') {
cout << "No";
return;
... |
#include<bits/stdc++.h>
#define int ll
#define sz(x) int((x).size())
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define x first
#define y second
using namespace std;
using ll = long long;
using pi = pair<int,int>;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int minf = 0xc0c0c0c0c0c0c0c0;
int sumtreeA[2002... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int N, Q;
string S;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> S >> Q;
int flipcnt = 0;
rep(i, Q) {
int T, A, B;
cin >> T >> A >> B;
A--;
B--;
if (T == 1) {
if (fl... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios::sync_with_stdio(0),cin.tie(0);
int n;
cin >> n;
int a[n+1],p[n+1];
for(int i=1;i<=n;i++){
cin >> a[i];
p[a[i]]=i;
}
vector <int> ans;
int vis[n]={0},ok=1;
for(int i=1;i<=n;i++){
i... | //*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<"... |
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define pf pus... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define... |
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
using P=pair<int,int>;
using T=tuple<int,int,int>;
constexpr int mod=1000000007;
constexpr int inf=2e9;
constexpr double eps=1e-13;
int in(){
int x;
scanf("%d",&x);
return x;
}
int main(){
int n=in(),m=in(),k=in();
vector<double>dp1(n+... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define ll long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define endl "\n"
const ll maxn=6e5+54;
const ll mod =1e9+7 ;
const ll base=1e18;
ll n, k;
ll get(ll n,ll k)
{
return min(k-1,2*n-k+1);
}
... |
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef _MSC_VER
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mod 1000000007
#define rep(i,n) for(int i=0; i<n; i++)
#define repa(i,start,end) for(int i=start; i<=end; i++)
#define repd(i,start,end) f... |
#include<bits/stdc++.h>
using namespace std;
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include<queue>
#include<utility>
#define ll long long int
#define speed ios_base::sync_with_stdio(false);cin.tie(0);
#define pb push_back
#define pf push_front... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<ll> vll;
#define all(v) v.begin(),v.end()
#define test() int t;cin>>t;while(t--... |
#include <bits/stdc++.h>
using namespace std;
class Timer {
public:
Timer() { start_time_ = std::chrono::steady_clock::now(); }
int64_t elapsedMilliSeconds() const {
auto elapsed = std::chrono::steady_clock::now() - start_time_;
return std::chrono::duration_cast<std::chrono::milliseconds>(elaps... | #include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
int main()
{
int n, m;
cin >> n >> m;
vector<string> ss(m);
for (auto &&s : ss)
{
cin >> s;
}
sort(ss.begin(), ss.end());
ss.erase(unique(ss.begin(), ... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... | #define LOCAL
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <ran... |
#include<bits/stdc++.h>
using namespace std;
long long a,b,c[100010],sum=0,m=101;
int main(){
cin>>a>>b;
a*=b;
for(long long i=0;i<a;i++){
cin>>c[i];
if(c[i]<m)m=c[i];
sum+=c[i];
}
sum-=m*a;
cout<<sum;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
// Vectors
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define print(x) cout << x << "\n"
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int h, w;
cin >> h >> w;
// find min
... |
#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;
#define For(Ti,Ta,Tb) for(int Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(int Ti=(Ta);Ti>=(Tb);--Ti)
template<typename T>
inline bool chkmax(T &i,const T&j){return i<j?(i=j,1):0;}
template<typename T>
inline bool chkmi... | #pragma GCC optimize("O3") //
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, b, a) for(int i = b - 1; i >= a; i--)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int... |
#include<bits/stdc++.h>
using namespace std;
#define reg register
typedef long long ll;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
static char buf[1<<21],*p1=buf,*p2=buf;
inline int read(void){
reg bool f=false;
reg char ch=getchar();
reg int res=0;
while(!isdigit(ch))f|=(ch... | #include <bits/stdc++.h>
#define sz(c) int(c.size())
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
using namespace std;
using ll = long long;
#ifdef LOCAL
#include <local/debug.h>
#else
#define debug(...) (void)0
#endif
const int inf = (int)1e9 + 1;
int ma... |
//Author: Xzirium
//Time and Date: 20:18:14 15 June 2021
//Optional FAST
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
//Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.h... | #include <bits/stdc++.h>
using namespace std;
/*
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
*/
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-lo... |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define endl "\n"
#define sd(val) scanf("%d", &val)
#define ss(val) scanf("%s", &val)
#define sl(val) scanf("%lld", &val)
#define debug(val) printf("check%d\n", val)
#define all(v) v.begin(), v.end()
#define pb push_back
... | #include <bits/stdc++.h>
using namespace std;
typedef long double LD;
typedef long long ll;
#define int ll
#define ff(i,a,b) for (int i = a; i < b; i++)
#define bf(i,a,b) for (int i = a; i >= b; i--)
#define all(v) v.begin(),v.end()
#define show(a) for(auto xyz:a)cout<<xyz<<" ";cout<<endl;
#define F first
#defin... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define read freopen("in.txt", "r", stdin)
#define write freopen("out.txt", "w", stdout)
#define mem(x, n) memset(x, n, si... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ll n;
cin >> n;
n *= 2;
int ans = 0;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ll j = n / i;
if (i % 2 != j % 2) ans += 2;
... |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define pb push_back
#define f first
#define s second
#define nl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef vec... | //I'll always miss you like a darling.
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int,int>
#define pLL pair<LL,LL>
#define pii... |
#include <bits/stdc++.h>
using namespace std;
long long int modinv(long long int a, long long int m) {
long long int b = m, u = 1, v = 0;
while (b) {
long long int t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int main() {
int T;
cin >... | #include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define pii pair<int,int>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const double pi=acos(-1.0);
const double eps=1e-8;
const int INF=0x3f3f3f3f;
const int MA... |
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n";
using namespace std;
const int INFINT = 2e9;
const ll INFLL = 2e18;
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(... | #include<bits/stdc++.h>
#define MAX 2000
#define MOD 1000000007
using namespace std;
string v[MAX+10];
int n,m;
long long dp[MAX+10][MAX+10],rig[MAX+10][MAX+10],diag[MAX+10][MAX+10],dow[MAX+10][MAX+10];
int main()
{
cin>>n>>m;
for(int i=0;i<n;++i)
cin>>v[i];
for(int i=n-1;i>=0;--i)
{
for(int j=m-1;j>=0;--j)
{... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define min(a,b) ( (a)<(b) ? (a) : (b) )
const ll maxn=200005;
struct nod{
ll a; char c;
nod(){}
nod(ll _a,char _c) {a=_a,c=_c;}
}a[maxn];
ll r[maxn],g[maxn],b[maxn];
ll totr,totg,totb;
inline void solve(ll *a,ll *b,ll *c,ll lena,ll lenb,ll len... | #line 1 "main.cpp"
#include <bits/stdc++.h>
using namespace std;
// template {{{
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#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... |
/*
author : aryan57
created : 29-May-2021 17:36:52 IST
*/
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_... | // Problem: A - 2nd Greatest Distance
// Contest: AtCoder - NOMURA Programming Contest 2021(AtCoder Regular Contest 121)
// URL: https://atcoder.jp/contests/arc121/tasks/arc121_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
/*
Name:
Author: xiaruize
Date:
*/
#in... |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define INF 2147483647
#define MOD 1000000007
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n);
for(int i = 0; i < n; ++i) cin >> v[i];
sort(v.begin(), v.end());
long long ans = 0;
int j = n;
for(int i = 0; i < n; ++i) {
ans += v[i] * (n-i-1);
ans -= v[i] * (n-j);
--j;
}
cout << abs... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define deb(...)
#endif
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define all(c) c.begin(),c.end()
#define read(v) for(auto &it:v) cin>>i... | #include<bits/stdc++.h>
using namespace std;
const int N=505,p=998244353;
char s[N][N];
int n,m;
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
scanf("%s",s[i]+1);
int cnt=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(i-1&&j+1<=m)
{
if(s[i][j]!='.'&&s[i-1][j+1]!='.'&&s[i][j]!=s[i-1][j+1])
{
// cou... |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
void solve() {
int n; ll m; cin >> n >> m;
set<int> st;
map<int,ll> mp;
for (int i = 0; i < n; i++) {
int l, r, v; cin >> l >> r >> v;
... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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) { if (b<a) { a=b; return 1; } return 0; }
const lli mod = 998244353;
template< ... |
#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... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
const lld N = 200043;
const lld MOD = 1000000007;
lld add(lld x, lld y)
{
x =((x%MOD)+(y%MOD))%MOD;
while(x >= MOD) x -= MOD;
while(x < 0) x += MOD;
return x;
}
ll... |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define itn int
#define make_unique(x) sort((x).begin(), (x).end()); (x).erase(unique((x).begin(), (x).end()), (x).end())
using namespace std;
inline int nxt() {
int x;
scanf("%d", &x);
return x;
}
struct Node {
int sum;
int min;
};
Node merge(con... | #line 1 "/workspaces/compro/lib/template.hpp"
#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>
#ifndef IO_VECTOR
#define IO_VECTOR
template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
int size = v.size();
for (int i = 0; i < size; i++) {
... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long; using ull = unsigned long long;
// #define int ll
// #define DEBUG 42
inline void nprint(){}
template <class Head, class... Tail>
inline void nprint(Head &&head, Tail &&... tail) {
cout << head ... | #include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
int main()
{
const auto start = steady_clock::now();
random_device rnd;
int n, m;
cin >> n >> m;
vector<string> ss(m);
for (auto &&s : ss)
{
cin >> s;... |
#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;
template <typename T> using vt = vector<T>;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb p... | #include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
signed main(){
int n;
cin>>n;
vector<pair<int,int>> ed(n-1);
vector<vector<int>> g(n);
for(int i=0;i<n-1;i++){
int u,v;
cin>>u>>v;
ed[i]={u-1,v-1};
g[u-1].push_back(v-1);
g[v-1].push_back(u-1);
}
vector<int> d(n,-1),s(n);... |
/* {{{ */
#include <bits/stdc++.h>
using namespace std;
#ifdef __LOCAL
#include <prettyprint.hpp>
#define debug(a) cerr << "[\033[33mDEBUG\033[m] " << (#a) << ": " << (a) << endl
#else
#define debug(s) cerr << "[\033[33mDEBUG\033[m] local only" << endl
#endif
using ll = long long;
template <class T> using vec = vector... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, w;
cin>>n>>w;
map<int, vector<int>> starts;
map<int, vector<int>> ends;
vector<int> ps (n);
for(int i = 0; i < n; i++){
int s, t, p;
cin>>s>>t>>p;
starts[s].push_back(i);
ends[t].push_back(i);
... |
/* In The Name Of ALLAH
*/
#include <bits/stdc++.h> // This will work only for g++ compiler.
#define for0(i, n) for (int i = 0; i < (int)(n); ++i) // 0 based indexing
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i) // 1 based indexing
#define forc(i, l, r) fo... | //----AUTHOR:kkdrummer----/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double ld;
typedef ... |
#pragma GCC optimize("Ofast")
//#ifndef ONLINE_JUDGE
//#define _GLIBCXX_DEBUG
//#endif
#ifdef ONLINE_JUDGE
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#include <math.h>
#include <complex>
using namespace std;
#ifdef ONLINE_JUDGE
using namespace atcoder;
#endif
#defi... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define vvi vector<vi>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#def... |
#include "bits/stdc++.h"
#include<sstream>
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const long long inf = 1e18;
const ll INFL = 1e18;
const ll MOD = 1e9 + 7;
int digit(ll x) {
int digits = 0;
... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n... | #include<bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> p2;
#define sz(a) ll(a.size())
void test2311(){
string s;
cin>>s;
reverse(s.begin(),s.end());
for(ll i=0;i<sz(s);i++)
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
using namespace std;
int main(){
string str;
cin >> str;
long nLen = str.length();
long m;
cin >> m;
if(nLen == 1){
... |
#include <bits/stdc++.h>
using namespace std;
#define Int register int
#define mod 998244353
#define MAXN 105
template <typename T> void read (T &x){char c = getchar ();x = 0;int f = 1;while (c < '0' || c > '9') f = (c == '-' ? -1 : 1),c = getchar ();while (c >= '0' && c <= '9') x = x * 10 + c - '0',c = getchar ();x ... | #include "bits/stdc++.h"
using namespace std;
#ifdef Dragon
#include"debug.cpp"
#else
#define deb //
#define pr //
#endif
#define int long long
#define lld long double
#define pb push_back
#define vi vec... |
//*******Abhijit Burman***********//
//Jalpaiguri Government Engineering College//
// Taken From Striver_79
// Never open a ranklist untill and unless you are done with solving problems, wastes 3/4 minuts
// Donot treat CP as a placement thing, love it and enjoy it, you will succeed for sure.
#include<bits/stdc++.... | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... |
#include <bits/stdc++.h>
// 1. dp
typedef long double ld;
#define int long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *m... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
long long s,p;
cin>>s>>p;
string ans="No";
for(ll i=1;i<=1000000;i++){
if(p%i==0){
ll x=p/i;
if(x+i==s)
ans="Yes";
}
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n; cin >> n;
string s, t; cin >> s >> t;
vector<int> a, b;
REP(i, n) {
if (s[i] == '0') a.push_back(i);
if (t[i] == '0') b.push_back(i);
}
int res = 0;
if ((int)a.size() != (int)b.size())
res = -... | #line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
typedef long long ll;
typedef pair <int,int> ii;
int n;
vector <char> s;
vector <char> temp;
vector <int> pre;
int pt;
int main() {
for(int j=1;j<=1200000;j*=3)
{
pre.pb(j);
}
pt=pre.s... | #include <iostream>
#include<iomanip>
#include <string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
#define INF long long int(1e18+1)
#define rep(i,n,m) for(int i=n;i<m;i++)
using namespace std;
int main()
{
int n, m, k;
cin >>... |
#ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_ }
#define MY_DEBUG(s) s
#define MY_IS_DEBUG (true)
#else
#define MY_NAMESPACE(ns)
#define MY_NAMESPACE_
#define MY_DEBUG(s)
#define MY_IS_DEBUG (false)
#endif
#include <algorithm>
#include <bitset>
#include <cmath>
#in... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <queue>
#include <numeric>
using namespace std;
using ll = long long;
#define For(i,a,b) for(ll i=(a);i<(ll)(b);i++)
#define rFor(i,a,b) for(ll i=(a);i>=(ll)(b);i--)
#define co(a) cout<<a<<endl
#define SORT(a) sort... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define V vector
#define TP template <class o>
#define TP... | #include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(zf)return -res;
return res;
}
const int P=1e9+7;
inline int ksm(int x,int y=P... |
/**
* Author : pradumn
**/
#include<bits/stdc++.h>
using namespace std;
#define Fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define M 1000000007
#define fo(i,n) for(i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define deb(c) cout<<c<<endl
#define umap unorder... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<ll> a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
ll ans = 0;
for (int i = n-1; i >= 0; i--) {
sum -=... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template<typename A, size_t N, typename T>
void... | #include<iostream>
#include<vector>
using namespace std;
int N,M;
vector<int>G[20];
int col[20];
bool dfs(int u) {
for(int v:G[u]) {
if(col[v]==-1) {
col[v]=3-col[u];
if(!dfs(v))return false;
}
else if(col[u]==col[v]) {
return false;
}
}
return true;
}
int main() {
cin>>N>>M;
vector<pair<int,int>... |
#include <bits/stdc++.h>
using namespace std;
int n, q, c, par[200005];
int uf(int x){
if (par[x]==x) return x;
int y = uf(par[x]);
par[x]=y; return y;
}
map<int, int> raz[200005];
void merge(int x, int y){
if (raz[x].size() < raz[y].size()) swap(x, y);
for (map<int, int>::iterator it = raz[y].begin(); it!=raz[y].... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind() { }
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool is... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
int n, m, a, b, ans;
bool vis[N];
vector<int> graph[N];
void dfs(int v){
ans++;
vis[v] = true;
for(auto i : graph[v]){
if(!vis[i]) dfs(i);
}
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
cin... | #include <stdio.h>
#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
vector<vector<int>> to;
vector<bool> visit;
int sum;
void dfs(int i){
if(visit[i]) return... |
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define maxn 505
#define ll long long
#define mo 998244353
using namespace std;
int n,m,i,j,k,a[maxn][maxn],c[3];
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
char ch=getchar();
while (ch!='R'&&ch!='B'&&ch!='.') ch=getchar();
for(j=... | // 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 long long MOD = 1000000007;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define ... |
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <iostream>
#include <queue>
using namespace std;
#define f(x,y,z) for(int x=y;x<z;++x)
#define fi first
#define se second
typedef pair<int, int> pii;
int n, m, a, b, ans, step;
vector<pii> e[1000];
queue<pii> q[2];
char c;
bool bl, sdh[1000][1000];
int main... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... |
#include <iostream>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <algorithm>
#include <map>
#include <vector>
#include <string.h>
#include <math.h>
#include <cassert>
#define __IO_INIT ios_base::sync_with_stdio(false), cin.tie(NULL);
#define LLMAX 1e18
#define DIV 1000000007
#define MAX 9... | #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main()
{
string s;
cin>>s;
int i,c=0,d=0,j,k,l;
for(i=0;i<s.size();i++)
{
if(s[i]=='o')
c++;
if(s[i]=='?')
d++;
}
// cout<<c<<" "<<d<<endl;
int res=0;
for(i=0;i<=9;i++)
... |
#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PIL = pair<int,ll>;
using PLI = pair<ll,int>;
using PLL = pair<ll,ll>;
using Graph = vector<vector<int>>;
using Cost_Graph = vector<vector<PIL>>;
template<class T> bool chmin(... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
/*void insert(stack<int>& st , int temp)
{
if(st.empty())
{
st.push(temp);
return;
}
int x = st.top();
st.pop();
insert(st , temp);
st.push(x);
}
void reverse(stack<int>& st )
{
if(st.si... |
#include<iostream>
using namespace std;
#include<cstring>
int N[200][2];
int T[200][2];
bool vis[200];
int main(){
int n,m;
cin>>n>>m;
int tot=0;
for(int i=1;i<=m;i++){
tot++;
cin>>N[tot][0]>>N[tot][1];
}
int k;cin>>k;tot=0;
for(int i=1;i<=k;i++){
tot++;
cin>>T[tot][0]>>T[tot][1];
}
int ans=0;
for(in... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <complex>
#include <cassert>
#include <set>
using namespace std;
const long long MOD = 1e9 + 7;
vector<long long> fact, fact_inv, inv;
void init_nCk(long long SIZE) {
fact.resize(SIZE + 5);
fact_inv.resize(SIZE + 5);
inv... |
#include <bits/stdc++.h>
int main() {
std::vector<std::string> s(3);
for (int i = 0; i < 3; ++i) std::cin >> s[i];
std::set<char> se;
for (int i = 0; i < 3; ++i) {
for (char c : s[i]) se.insert(c);
}
bool possible = false;
int kind = (int)se.size();
std::vector<long long> n(3, 0);
if (kind <= 1... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b, c;
cin >> a >> b >> c;
if (pow(a, 2) + pow(b, 2) < pow(c, 2)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for(int i=int(n-1);i>=int(0);... | #include <iostream>
#include <stdio.h>
#include <climits>
#include <math.h>
//martin02
using namespace std;
long long int n;
int main() {
long long int ans = LLONG_MAX;
scanf("%lld", &n);
for (int i = 0; i < 61; i++) {
long long int b = (long long int) 1 << i;
long long int a = n / b;
long long int c = n ... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,c,d,x,y;
scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
int ax=a;
x=1;y=0;
while(1){
a+=b;
y+=c;
if(a<=y*d)break;
x++;
if(x>ax){x=-1;
b... | #define _USE_MATH_DEFINES
#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<unordered_set>
#include<random>
#include<list>
#include<fun... |
#include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#define pii pair<int, int>
#define ff first
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int T;
cin>>T;
while(T--){
string S;
cin>>S;
string T="atcoder";
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5+10;
char s[maxn];
int main() {
int n;
cin>>n>>(s+1);
int f=0;
ll tans=1e10;
for(int i=4;i<=n;i++){
if(s[i]!=s[i-3])f=1;
}
if(f)return puts("0"),0;
if(n==1){
if(s[1]=='1')return put... | #include<bits/stdc++.h>
using namespace std;
#define D(x) cout << (#x) << " is " << x << endl;
#define Q int t; scanf("%d", &t); for(int q=1; q<=t; q++)
typedef long long int lli;
typedef pair<int, int> pi;
int main()
{
int n;
cin >> n;
string s;
cin >> s;
lli ans = 1e10;
if(s == "1"){
c... |
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#define nput(a) cout << a << endl
#define sput(a) cout << a << ' '
using namespace std;
typedef long long ll;
const int maxn = 1e4 + 10;
int a[maxn];
... | #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;
int a[20000];
int L[20000],R[20000];
int main(){
int n;cin>>n;
rep(i,n)scanf("%d",&a[i]);
stack<int>st;
rep(i,n){
while(!st.empty()&&a[st.top()]>=a[i])st.pop();
L[i]=(st.empty()?0... |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
typedef long long ll;
#define FOR(i, a, b) for(int i=(a); i<(b);i++)
#define REP(i, n) for(int i=0; i<(n);i++)
#define ROF(i, a, b) for(int i=(b-1); i>=(a);i--)
#define PER(i, n) for(int i=n-... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define eps 1e-8
#define maxn 200005
typedef long long ll;
using namespace std;
const double pi = acos(-1);
const ll mod = 1e9 + 7;
inline ll read(){
ll x = 0, f = 1;char ch = getchar();
while(ch > '9' || ch < '0'){if(ch == '-') f = -1;ch = getchar();}
while(... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long int
#define ld long double
#define ordered_set tree < ll , null_type , less<ll> , rb_tree_tag , tree_order_statistics_node_update >
//added tw... | #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... |
#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<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
*/
using namespace std;
/*
typedef tree<int,null_type, less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
*/
#define pb push_back
#define ll long long
#define x1 first
#define y1 second
#define fr... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int cx[1000005];
int ci[1000005];
signed main(){
int a,b,w;
memset(ci,0X3f,sizeof(ci));
memset(cx,0,sizeof(cx));
ci[0] = 0;
cin>>a>>b>>w;
w = w*1000;
int judge = 0;
for(int i=a;i<=b;i++)
for(int j=i;j<=w;j++){
cx[j] = max(cx[j],cx[j-i]+1);
... | #pragma GCC optimize("O3")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define re return
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define make_unique(x) sort(all(x)),x.resize(unique(all(x))-x.begin())
#define fi first
#define se second
#define ss second.second
#define sf ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=200000,M=300,mod=998244353,inv2=499122177;
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... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<float.h>
#include<tuple>
#include<string.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<map>
#include<deque>
#include<math.h>
using namespace std;
#define ll long long
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll const inf = pow(10,9) + 7;
int main(){
int n;cin >> n;
cout << n-1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n ; cin >> n;
if(n == 1) cout << 0 << endl;
else if(n == 2) cout << 1 << endl;
else if(n % 2 == 0) cout << n / 2 * 2 - 1<< endl;
else cout << n / 2 * 2 << ... |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline int IN(void)
{
int x=0,f=0,c=getchar();while(c<48||c>5... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
const int MOD = 998244353;
inline int add(int a, int b){ return (a+b)%MOD; }
inline int sub(int a... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for... | #include <bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define L(n) (n << 1)
#define R(n) (n << 1 | 1)
#define print_vector(n) for(auto a0 : n) cout << a0 << ' '; cout << endl;
#define vector_sort(n) sort(n.begin(), n.end())
#define print_array(n, l, r) for(int a0 = l; a0 <= r; a0++)... |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef long int li;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test ll t; cin >> t; while(t--)
const long long int dx[4] = {0, 0, -1, 1}, dy[4] = {1, -1, 0, 0};
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); // Do not flush "cout" when processing "cin".
int n;
cin >> n;
// dp[i][j]
// i = x[i] ใพใงๆฑบใใๆ
// j = y[i] ใซใชใๆใฎๅ ดๅใฎๆฐ
vector<vector<ll>> dp(n + 1, vector<ll>(2));
// dpใๅๆๅ
dp.at(0).at(true) = 1;
dp.a... |
// C - Squared Error
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
int n; cin>>n;
vector<ll> A(n); for(ll&a:A) cin>>a;
ll aa = 0, sa = 0;
for(ll a:A){
aa += a*a;
sa += a;
}
cout<< n*aa - sa*sa <<endl;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000030;
constexpr ll INF= 2000000000000000001;
constexpr ll MOD = 998244353;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
template<class T> inline bool chmax(T &a, T b) {
if (a < b) {
... |
//code bcuz love,code 4 hate
#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
#define pb push_back
#define re register int
#define fr first
#define sd second
#define pa pair<ll,ll>
#define FOR(i,a,b) for(re i=a;i<=b;i++)
#define REP(i,a,b) for(re i=a;i>=b;i--)
#define MEM(a) memset(a,0,size... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
//#include<atcoder/all>
//using namespace... |
#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 int long long int
#define ld long double
#define pb push_back
#define MOD 10... | #include<bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define put(i) cout<<fixed<<i<<endl
#define debug(i) cerr<<fixed<<i<<endl
#define debugl(a) for(auto x:a)cerr<<x<<' '; cout<<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 n; cin >> ... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define PII pair<int, int>
#define mp(x, y) make_pair(x, y)
#define reset(x) memset(x, 0, sizeof(x));
#define resets(x) memset(x, -1, sizeof(x));
#define resetss(x) memset(x, 0x3f3f3f3f, sizeof(x));
#define resetsss(x) memset(x, -0x3f3f3f3f, sizeof(x));... | /**
____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
int m;
int pwr (int a, ll b)
{
if(b == 0)
return 1;
if(b & 1)
return 1LL * a * pwr(a, (b ^ 1)) % m;
... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int h,w,x,y,i,j,cn=0;
char mp[101][101];
scanf("%d%d%d%d",&h,&w,&y,&x);
for(i=0;i<h;i++) scanf("%s",mp[i]);
x-=1; y-=1;
for(i=y;i<h;i++){
if(mp[i][x]=='.') cn++;
else break;
}
for(i=x;i<w;i++){
if(mp[y][i]=='.') cn++;
else break;
}
for(i=y;i>=0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w,x,y;
cin>>h>>w>>x>>y;
char arr[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>arr[i][j];
}
}
int ans=0;
for(int i=y-2;i>=0;i--){
//cout<<i<<" "<<"\n";
//cout<<arr[x-1][i]<... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define vs vector<string>
#define vc vector<char>
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int n, p[105];
double x[105], y[105], dist[105][105], l, r, m;
bool out[105][105];
int find(int x){return (p[x] < 0 ? x : p[x] = find(p[x]));}
void uni(int x, int y){
x = find(x); y = find(y);
if(x != y){
if(p[x] > p[y]) swap(x,... |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
//MINT
//const int mod = 1000000007;
const int mod = 998244353;
struct mint {
ll x;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mi... | // E - Rotate and Flip
#include <bits/stdc++.h>
using namespace std;
#define vec vector
#define rep(i,n) for(int i=0;i<(int)(n);++i)
using ll = int64_t;
using vl = vec<ll>;
using vvl = vec<vl>;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin>>n;
vl X(n), Y(n); rep(i, n) cin>>X[i]>>Y[i];
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define PI 3.14159265359
#define mod 1000000007
#define ALL(a) (a).begin(),(a).end()
int main(){
int n,q;
string s;
int count = 0;
cin >> n >> s >> q;
rep(i,q){
int t,a,b;
cin ... | #line 1 "/workspaces/compro/lib/template.hpp"
#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>
#ifndef IO_VECTOR
#define IO_VECTOR
template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
int size = v.size();
for (int i = 0; i < size; i++) {
... |
#define taskname "test"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 5005;
const int mod = 998244353;
int n, m;
int a[maxn][maxn];
int f[maxn];
int g[maxn];
void read_input()
{
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int prm[20]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71},f[74][1<<20],a,b,c[74],ans;
signed main()
{
cin>>a>>b;
//cout<<b-a+1<<endl;
for(register int i=a;i<=b;i++)
{
for(register int j=0;j<20;j++)
{
if(i%prm[j]==0)c[i-a+1]|=1<<j;... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { ret... | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
while (A >= 0 && B >= 0) {
if (C) --B;
else --A;
++C;
C %= 2;
}
cout << (A >= 0 ? "Takahashi\n" : "Aoki\n");
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int N;
cin >> N;
if(N%2==1)cout<<"Black"<<endl;
else cout<<"White"<<endl;
} | #include <stdio.h>
#include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
void AHeavyRotation(st... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,x,n) for(i=x;i<=n;i++)
#define foreach(c,itr) for(__typeof(c)::iterator itr=c.begin();itr!=c.end();itr++)
#define all(v) v.begin(),v.end()
#define p_b push_back
#define fr first
#define sc second
#define m_p make_pair
#define ... | #include <bits/stdc++.h>
using namespace std;
void setIO(string s) {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen((s + ".in").c_str(), "r", stdin);
// freopen((s + ".out").c_str(), "w", stdout);
}
int main()
{
setIO("");
int n, x; cin >> n >> x;
vector<int> a(n);
for (int i = 0... |
#include "bits/stdc++.h"
#include "random"
#include <unistd.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vi>
#define pi pair<int,int>
#define mp make_pair
#define pb push_back
#define MOD int(1e9) + 7
#define PAI 3.1415926535
#define all(x) (x... | #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 f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) fo... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N; cin>>N;
vector<ll> A(pow(2,N));
for(int i=0; i<pow(2,N); ++i) cin>>A[i];
// ้ธๆใๅๅใซๅใใ
// 0-2^(N-1) 2^(N-1)-2-N-1
pair<ll,ll> playerA(0,0), playerB(0,0);
for(int i=0; i<pow(2,N-1); ++i) {
if(A[i]>playerA.first) play... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n), b(n);
for (int &it : a) cin >> it;
for (int &it : b) cin >> it;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i] * b[i];
}
c... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e6 + 5;
ll dp[3][maxn] = {0};
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef LOCAL
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
ll n, k;
cin >> n >> k;
for (int i = 1; i <= ... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define mod 1000000007ll
#define md 998244353ll
#define e1 1e-9
#define v vector< long long >
#define vv vector< vector< long long > >
#define p pair < long long,long long >
#define vp vector< pair < long long,long long >... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
#define MOD 1000000007LL
#define INF 1LL << 60
#define rep(i,start,end) for(ll i = start; i < end; i++)
#define per(i,end,start) for(ll i = start-1; i >= end; i--)
ll N, M;
vvl G;
ll ct;
vl seen;
void ... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
lint n;
cin >> n;
lint count = 0;
set<lint> s;
for (lint i = 2; i * i <= n; i++) {
for (int j = 2; j <= 40; j++) {
lint tmp = pow(i, j);
if (1 <= tmp and tmp <= n) {
if ... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
long long n;
cin >> n;
set<long long> s;
for (long long a = 2; a * a <= n; ++a) {
long long x = a * a;
while ( x <= n) {
s.insert(x);
x *= a;
}
}
cout << n - s.si... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define FOR(i, a, b) for(ll i=(a); i < (ll)(b); ++i)
template<class T> inline bool chmax(T& a, T b) { if(a < b){ a=b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if(a > b){ a=... | #include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
const ll N=1000006, INF=1e18, P=998244353;
ll q=1, n, m, x, y, z, l, r, k, a[N], b[N],... |
#include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
const int mod = 998244353;
using namespace std;
ll expo(ll a, ll b) {
a %= mod;
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
ll ans = 0;... |
//================code===================//
//#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#define ci(t) cin>>t
#define co(t) ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n+1),b(n+1),p(n+1),ip(n+1);
for(int i=1;i<=n;i++){cin >> a[i];} //hito
for(int i=1;i<=n;i++){cin >> b[i];} //nimotsu
for(int i=1;i<=n;i++){
cin >> p[i];
ip[p[i]]=i;
}
vector<pair<int,int>> pv;
vector<pai... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, a, b;
vo... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t R, X, Y;
cin >> R >> X >> Y;
double distance = sqrt(X*X + Y*Y);
int ans = ceil(distance / R);
if (distance < R) ans = 2;
cout << ans;
}
| #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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.