code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include "bits/stdc++.h"
using namespace std;
#define all(c) c.begin(),c.end()
#define sz(x) int(x.size())
#define ar array
typedef long long ll ;
typedef vector<int> vi;
#define mod 1000000007
ll exp(ll x,ll y){
x%=mod;
ll res=1;
while(y){
if(y&1)
res=res*x%mod;
x=x*x%mod;
y>>=1;
}
return ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
int mod = 1000000007;
int main(void){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N; cin >> N;
vector<ll> A(N); rep(i, N) cin ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef std::vector<std::vector<int64_t> > Graph;
#define rep(i, n) for (int64_t i = 0; i < n; ++i)
#define rep2(i, n) for (int64_t i = 1; i <= n; ++i)
#define repb(i, l, n) for (int64_t i = l; i < n; ++i)
#define repb2(i, l, n) for (int64_t i = l; i... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace s... |
# include <bits/stdc++.h>
# define N 110
int a[N];
bool f[N][100010];
int main() {
int n,i,j,sum=0;
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d",a+i), sum+=a[i];
f[0][0]=true;
for(i=0;i<n;i++) {
for(j=0;j<=100000;j++) {
if(f[i][j]) f[i+1][j+a[i+1]]=true, f[i+1][j]=true;
}
}
int mid=(sum+1)/2;
for(j=mid;!... | /*
@uthor: Amit Kumar
user -->GitHub: drviruses ; CodeChef: dr_virus_ ; Codeforces,AtCoder,Hackerearth,Hakerrank: dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//#def... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
template <typename T>
void print(T a, string message = "debug: ");
template <typename T>
void printvec(vector<T> a, string message = "debug: ");
int n;
vector<int> a, b;
int main()
{
cin >> n;
a.resize(n);
b.resize(n);
int amin = 0, bmax = 1000... |
//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define CT printf("\n-------------------------\n");
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll Inf=1ll<<60ll;
typedef pair<int,int> pii;
const int N=100005;
priority_queue<pii,vector<pii>,greater<pii> > q[26];
int n,dp[N];
char s[N];
i... | #include <bits/stdc++.h>
using namespace std;
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)
#define REP(i, n) rep(i, 0, n)
#d... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define all(a) a.begin(), a.end()
#define fast_io ios_base::sync_with_stdio(false); cin.tie(0);
const int maxn = 200010;
const int MOD = 1e9+7;
const int INF = 1e9;
const... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll,ll> P;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define EFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORE(i,I) for(const auto &(i):(I))
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
#d... | #include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) ... |
#include <bits/stdc++.h>
#define faster ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first
#define ss second
using namespace std;
void file()
{
freopen ( "CHUYEN.inp", "r", stdin );
freopen ( "CHUYEN.out", "w", stdout );
}
typedef pair<int, int> ii;
const int maxn = 1e2 + 7;
int n, m;
vector<i... | #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;
const int N=5e5+5;
char s[N],t[N],zhan[N];
int top;
int main()
{
int n;
scanf("%s",s+1);
n=strlen(s+1);
int l=n+1,r=n,rev=0;
for(int i=1;i<=n;i++)
if(s[i]=='R') {
rev^=1;
} else {
if(rev) l--,t[l]=s[i];
else r++,t[r]=s[i];
}
for(int i=l;i<=r;i++)
{
zhan[++t... | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i=0; i<(n); ++i)
#define all(x) (x).begin(),(x).end()
const int INF = 1e9+1;
using ll = long long;
using p = pair<int, int>;
using v = vector<int>;
int main() {
string S;
cin >> S;
string T;
int n = 0;
bool R = false;
for (auto x : S) ... |
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define REPR(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define FORR(i, m, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define ZERO(c) memset(c, 0, sizeof(c))
using ll = long long;
using P = pair<int,int>;
const int INF = 1e9 + 5;
const ll INFL = 1e18 + 5;
int N, M,... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define all(arr) arr.begin(),arr.end()
#define f first
#define s second
#define debug1(x) cout<<x<<"\n"
#define debug2(x,y) cout<<x<<" "<<y<<"\n"
#define debug3(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n"
#define nl cout<<"\n";
#define pq priority_queue... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ULLI;
int main()
{
int n;
ULLI a, b;
ULLI sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
sum += (a + b) * (b - a + 1) / 2;
}
cout << sum << endl;
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int read()
{
char c;
int w=1;
while((c=getchar())>'9'||c<'0')if(c=='-')w=-1;
int ans=c-'0';
while((c=getchar())>='0'&&c<='9')ans=(ans<<1)+(ans<<3)+c-'0';
return ans*w;
}
char s[61];
ll m;
int n;
ll base[600];
bool check(ll x)
{
base[1]=1;
ll nowa... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/*
struct Edge
{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
*/
using Graph = vector<vector<int>>... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
const ll INF = 1LL << 60;
const double pi... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 0; i < (int)(n);)
#define rep0(i, n) for (int i = 0; i <= (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
int main(void) {
int N;
cin >> N;
int A;
cin >> A;
... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define rf(i, a, b) for (ll i = a; i >= b; i--)
typedef std::vector<long long> vi;
#define F first
#define S second
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0)... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=25;
int color[maxn];
int n,m,a,b;
vector<int>v[maxn];
vector<int>node;
int vis[maxn];
void dfs(int s){
vis[s]=1;
node.push_back(s);
for(int i=0;i<v[s].size();i++)
if(!vis[v[s][i]]) dfs(v[s][i]);
}
ll cnt(int cur){
if(cur==node.size()... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... |
#include<bits/stdc++.h>
using namespace std;
template <class T> ostream &operator << (ostream &os, const vector<T> &p) { os << "["; for (auto&it : p) os << it << " "; return os << "]";}
template <class S, class T> ostream &operator << (ostream &os, const pair<S, T> &p) { return os << "(" << p.first << "," << p.second <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long MOD2 = 998244353;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
... |
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
temp... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 204;
bool dp[maxn][maxn];
int l[maxn],r[maxn],vis[maxn];
int w[maxn];
int main()
{
int n;
scanf("%d",&n);
bool ok = true;
for(int i = 1,a,b;i <= n;++i){
scanf("%d%d",&a,&b);
if(a!=-1&&b==-1){
if(vis[a]){
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ri register int
#define rep(io, st, ed) for(int io = st; io <= ed; io ++)
#define drep(io, ed, st) for(int io = ed; io >= st; io --)
#define gc getchar
inline int read() {
int p = 0, w = 1; char c = gc();
while(c > '9' || c < '0') { if(c == ... | // Template
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <tuple>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <array>
#include <cassert>
#include <cmath>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i... |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | #include <iostream>
#include <cmath>
using namespace std;
int main() {
double a,b,c,d;
cin >> a >> b >> c >> d;
if(c*d-b<=0) cout << -1 << endl;
else {
cout << ceil(a/(c*d-b)) << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 10005;
int n, e;
int a[N], L[N], R[N], h[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
while (cin >> n) {
for (int i = 1; i <= n; i++) cin >> a[i];
e = 0;
for (int i = 1; i <= n; i++) {
while (e > ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <t... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
#define y1 awefakhlrv
using pii = pair<int, in... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
if((x < y && y - x < 3) || (x > y && x - y < 3)){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace s... | #include <bits/stdc++.h>
#define INF 1'000'000'000'000'000'000
#define MAX_N 200'000
#define MAX_M 200'000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
ll N, M;
ll A[MAX_N];
ll B[MAX_N];
ll X[MAX_M], Y[MAX_M];
void solve() {
for (ll i = 0; i < N; ++i) {
B[i] = A[i];
}
vector<pll> V;
... |
/*
Auther: ghoshashis545 Ashis Ghosh ๐
College: Jalpaiguri Govt Enggineering College
*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include<algorithm>
#include<string>
using namespace std;
#define ll int
// #define int long long
#define ld long double
#defin... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S max_L(S a,T b){
return a>=b?a:b;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf,... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >>a>>b>>c>>d;
cout << a*d-b*c <<endl;
}
| #include <iostream>
using namespace std;
typedef long long ll;
ll x,y,a,b,cnt,A;
int main(void){
cin>>x>>y>>a>>b;
while(1){
if(y/a<=x){
cnt+=(y-x-1)/b;
break;
}
if(x*a<x+b){
x*=a;
cnt++;
}
else{
A=(x*a-x)/b;
... |
#include<bits/stdc++.h>
#include<stdio.h>
#define int long long
#define pb push_back
#define fo(i,a,n) for(int i=a;i<n;i++)
#define foo(i,a,n) for(int i=a;i>=n;i--)
#define sn s.length()
#define get(n) cin>>n
#define put(n) cout<<n
//getline(cin >> ws, x); eats whitespace
// round() nearest int after round
using nam... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, n) for (int i = a; i < (int)n; i++)
#define REP(i, n) FOR(i, 0, n)
int H, W;
char S[10][10];
int dh[8]{ -1, -1, 0, 1, 1, 1, 0, -1 };
int dw[8]{ 0, 1, 1, 1, 0, -1, -1, -1 };
bool check(int h, int w, int d, char c) {
return S[h+dh[d%8]][w+dw[... |
#include <bits/stdc++.h>
using namespace std;
#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 > 0 ; i--)
#define INF 1001001001
#define MOD 1000000007
using ll = int64_t;
using ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define sorts(s) sort(s.begin(), s.end())
#define sortu(s) sort(s.begin(), s.end(), greater<>())
typedef long long int ll;
using Graph = vector<vector<int>>;
int main(void) {
int i = 0, j = 0, k = 0;
int N; ll MO... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using P=... | #include <iostream>
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() {
int a, b;
cin >> a >> b;
int ans = 2 * a + 100 - b;
cout << ans << endl;
return 0;
} |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define m_p make_pair
#define sz(x) (int)x.size()
#define line cerr<<"-----------------... | /* Average = a is the same as sum of abs(i-a) = 0
* which is the same as sum of i-a (for all i to the left) = a-i (for all i to the right)
* so let dp[i][j] = number of ways to form sum of j using 1...i
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b... |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int h, w;
int memo[2000][2000];
int inf = INT_MAX;
string s[2000];
int f(int i, int j)
{
if (i == h - 1 && j == w - 1) return 0;
if (memo[i][j] != -inf) return memo[i][j];
int res = -in... | #include <bits/stdc++.h>
#define fileio \
freopen("C:\\Users\\PRISM17\\Desktop\\in.txt", "r", stdin); \
freopen("C:\\Users\\PRISM17\\Desktop\\out.txt", "w", stdout);
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void print(vector<int> &a){for(auto l : a) cout<<l<<" "; cout<<'\n';}
void solve(){
int n,m;
cin>>n>>m;
int a[n][m];
int mi = INT_MAX;
for(int i=0;i<n;++i){
for(int j=0;j<m;++j) cin>>a[i][j], mi=min(mi,a[i][j]);
}
i... | #include <bits/stdc++.h>
#include <stdlib.h>
#include <ctype.h>
#include <regex>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
int main(){
int H,W;
cin >> H >> W;
vector<vector<int>> data(H, vector<int>(W));
rep(i,H){
... |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET, n) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET, n) ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x,y,abs;
cin >> x >> y;
abs = max(x-y,y-x);
if(abs<3){
cout << "Yes";
}
else{
cout << "No";
}
} |
/*
ยฉ 2021-03-28 06:53:10 Franco1010 All Rights Reserved
*/
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define pb push_back
typedef long double ld;
#define fi first
#define se second
#define PI 3.14159265358979323846264338327950288419716939937510
#define mp make_pair
#define vvl vector<vector<ll>>
#define vll vector<ll>
#de... |
#include <iostream>
#include <string>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <iomanip>
#include <set>
#define I int
#define LL long long
#define F float
#define S string
#define B bool
#define C char
#define N 200001
#define PI 3.14159265358979
using namespace std;
int main... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define res register int
#define LL long long
#define oo 0x3f3f3f3f
using namespace std;
LL Fastmul(LL a,LL b,LL p){
LL ans=0;
while(b>0){
if(b&1) ans=(ans+a)%p;
a=a*2%p;
b>>=1;
}
return ans;
}
LL Fastpow(LL a,LL b,LL ... |
// ARC107.cpp
#include <iostream>
using namespace std;
using ll = long long;
int n;
ll f(int k) {
return max(0,min(k - 1, 2 * n - k + 1));
}
// a+b==c+d+Kใชใ
// a+b==xใฎๆใ
// c+d==x-K
int main()
{
int k;
cin >> n >> k;
ll ans = 0;
for (int x = 2; x <= 2 * n;x++) {
ans += f(x) * f(x - k);
... | // *********************************************************************************
// * MURTAZA MUSTAFA KHUMUSI *
// * NIT-DGP,CSE - 2019-2023 *
// **************************************************************... |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();
templ... | #include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <numeric>
#include <math.h>
#include <complex>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < (long long int)(n); i++)
#define irep(i, n) for (long long int... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
ll tmp1=0, tmp2=0;
for(ll i=0; i<n; i++){
cin >> a[i];
tmp1 += a[i];
tmp2 += a[i]*a[i];
}
ll ans;
ans = n*tmp2 - tmp1*tmp1;
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
// std::vector<int> vect(n);
std::vector<int> v(401,0);
long long int temp;
for (int i = 0; i < n; ++i)
{
// cin >> vect[i];
cin >> temp;
v[temp+200]++;
}
long long int re... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const double pi = 3.14159265358979;
const ll inf = 1e17;
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
#define pii pair<int,int>
#define pll pair<ll,ll>
#define endl "\n"
#define dtor(deg) (((deg)/360)*2... | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define fixx(n) fixed << setprecision(n)
#define F first
#define S second
#define PI 3.14159265358979323846
#define ll long long int
#define int ll
#define double long double
const int... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
#define MAX 100
double dp[MAX+1][MAX+1][MAX+1];
int main(void){
int a, b, c;
cin >> a >> b >> c;
for (int i = MAX-1; i >= 0; i--){
for (int j = MAX-1; j >= 0; j--){
for... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) for(ll i=0; i<(ll)in.size(); i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for(ll i=0; i<(n); i++)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, ... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <iomanip>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
ll po(ll a, ll b) {
ll c = 1;
while (b) {
if (b % 2) c =... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#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 c... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using ld = long double;
const int INF = 1e9;
const ll LIN = 1e18;
int main() {
ll N;
cin >> N;
ll ans = LIN;
for (ll i = 0; i < 64;i++) {
ll b = ((ll)1 << i);
ll a = N / b, c = N % ... | #include<iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << N - 1 << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define asll unsigned long long
#define ll long long
#define ld long double
#define imt int
#define pii pair<int,int>
#define st first
#define nd second
#define psbk(x) push_back(x);
#define For(x,a,b) for(int x=(a);x!=(b+((b-a)/abs(b-a)));x+=(b-a)/abs(b-a))
#define FOR(x,n... | #include <stack>
#include <queue>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <set>
#include <tuple>
#include <cmath>
#include <random>
#include <algorithm>
#include <vector>
#include <iostream>
#include <fstream>
#include <chrono>
#include <numeric>
#define fio ios_base... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <iomanip>
#include <math.h>
#include <limits.h>
#include <string>
#include <bitset>
using namespace std;
#define pb push_back
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define MULTI 1
void pre()
{
}
#define SQR(x) ((x)*(x))
void solve()
{
ll l, r; cin >> l >> r;
if (r >= 2 * l) {
ll x = r - 2 * l + 1;
ll ans;
if (x % 2 == 1) ans = SQR((x + 1... |
#include<bits/stdc++.h>
using namespace std;
int h,w,a,b;
int res=0;
bool vis[20][20];
void dfs(int n,int m) //n 2*1 m 1*1
{
int flag=0;
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
if(!vis[i][j])
{
flag=1;
if(m)
{
vis[i][j]=1;
dfs(n,m-1);
vis[i][j]=0;
}
if(n)
... | #include <string>
#include <iostream>
using namespace std;
using ll=long long;
using ull=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
const int W=30, H=30;
const int query_num = 1000;
int main(){
for(int i=0; i<query_num; i++){
int sy,sx,ty,tx; cin >> sy >> sx >> ty >> tx;
string ans... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a,b,c,d;
cin >> a >> b >> c >> d;
long long n = 0;
long long mizu = a;
long long aka = 0;
if (b >= c*d){
cout << -1 << endl;
}
else {
while (mizu > aka * d) {
mizu += b;
aka += c;
n++;
}
cout << n << end... | #include <bits/stdc++.h>
#define M0D 1000000007
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int n,k,m,ans;
cin >> n >> k >> m;
int a[n],sum=0;
rep(i,n-1){
cin >> a[i];
sum += a[i];
}
ans = n*m - sum;
if(ans>k) cout << "-1" << endl;
else if(ans<0) cout << "0" << en... |
#include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ullong = unsigned long long;
int main() {
int N, Q;
cin >> N >> Q;
vector<ullong> A(N);
for (auto &x: A) cin >> x;
sort(A.begin(), A.end());
for (int q = 0; q < Q; ++q) {
ullong K;
cin >> K;
ullong target = K;
size_t d1 = 0;
... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
long long int missingK(long long int arr[],int n, long long int k)
{
long long int l = 0, u = n - 1, mid;
while(l <= u)
{
mid = (l + u)/2;
long long int numbers_less_than_mid = arr[mid] - (mid + 1);
if(numbers_less_than_mid == k)
{
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool c... | #include<bits/stdc++.h>
using namespace std;
using I=int;
const int M = 1<<18;
I n,s,t,F[M],p[M],E[M],d[M],D;
vector<I>G[M];
void dfs(I x,I f,I&s) {
F[x]=f;d[x]=d[f]+1;if(d[x]>d[s])s=x;
for (I&y:G[x])if(y^f)dfs(y,x,s);
}
void dfs2(I u,I f) {
E[u]=++D;
for(I&v:G[u])if(v!=f&&!p[v])dfs2(v,u);
for(I&v:G[u])if(v!=f&&... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
int64_t K;
cin >> K;
vector<vector<int64_t>> dp(4, vector<int64_t>(4 * N + 10, 0));
dp[0][0] = 1;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3 * N + 1; j++) {
d... | #include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7,INF=1e18;
#define ll long long
#define line cout<<"\n";
#define flush cout<<endl;
#define pll pair<ll,ll>
#define x first
#define y second
#define p_all(arr) for(auto i:arr){cout<<i<<" ";}cout<<"\n";
int main()
{
ios_base::sync_with_stdio(false)... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define l... | /* -*- coding: utf-8 -*-
*
* a.cc: A - Long Common Subsequence
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FASTIO {ios_base::sync_with_stdio(false);cin.tie(NULL);}
//************ functions
ll gcd(ll a,ll b){
if(b==0) return a;
return gcd(b,a%b);
}
ll pow(ll a,ll m){
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<set>
#include<cstdlib>
#include<cmath>
#include<numeric>//fill
#include<iomanip>
#include<functional>//https://cpprefjp.github.io/reference/functional/function.html
#include<cstdlib>//https://cpprefjp.githu... |
#include <cstdio>
const int Maxn=400000;
int fac[Maxn+5],num[Maxn+5],inv_f[Maxn+5],inv_n[Maxn+5];
void init(){
fac[0]=1;
for(int i=1;i<=Maxn;i++){
fac[i]=fac[i-1],num[i]=num[i-1];
int x=i;
while(x%3==0){
x/=3;
num[i]++;
}
fac[i]=1ll*fac[i-1]*x%3;
}
inv_f[Maxn]=fac[Maxn],inv_n[Maxn]=num[Maxn];
for(i... | using namespace std;
#include <bits/stdc++.h>
#define N 400005
#define ll long long
int n;
char str[N];
int c[3][3];
int C(int m,int n){
// if (m<n) return 0;
// return fac[m]*ifac[n]%mo*ifac[m-n]%mo;
if (m<3 && n<3)
return c[m][n];
return C(m/3,n/3)*C(m%3,n%3);
}
int id[255];
int re[3]={'B','W','R'};
int main(){
/... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
set<string> Set;
LL getMin(string s){
sort(s.begin(), s.end());
LL ans = 0;
for(int i = 0;i<s.size();++i)
{
ans = ans *10+s[i]-'0';
}
return ans;
}
LL getMax(string s){
sort(s.begin(), s.end(), greater<LL>());
LL... | #include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
int main()
{
int64_t n, k;
cin >> n >> k;
auto f = [](int64_t x) -> int64_t {
string s(to_string(x)), t(s);
sort(s.begin(), s.end(), greater<>());
sor... |
// {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define RALL(x) rbegin(x),rend(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP... | #include "bits/stdc++.h"
#define int long long
using namespace std;
using i128 = __int128_t;
random_device rd;
mt19937 gen(rd());
#define random_shuffle(begin, end) shuffle(begin, end, gen)
template <typename T, typename U>
ostream& operator << (ostream& out, const pair <T, U> &p) {
out << p.first << ": " << p... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//g++ a.cpp
//./a.out
//oj d https://atcoder.jp/contests/abc205/tasks/abc205_a
//oj t
int main(){
double a, b;
cin >> a >> b;
double c;
c = a / 100;
doubl... | #include <bits/stdc++.h>
using namespace std;
int main(){
double a,b;cin>>a>>b;
cout<<(a/100)*b;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int v, t, s, d;
cin >> v >> t >> s >> d;
if (v * t <= d && d <= v * s) {
cout << "No\n";
} else {
cout << "Yes\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(c%2==0){
a = abs(a);
b = abs(b);
if(a>b){
cout<<">";
return 0;
}else if(a==b){
cout<<"=";
return 0;
}else{
cout<<"<";
... |
#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);--i)
... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
// using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
constexpr int INF = (int)2e9;
constexpr ll INFll = (ll)1e18;
constexpr int MOD = 1e9 + 7;
struct edge {
int to, cost;
... |
#include<bits/stdc++.h>
#define ll long long
#define mi 0x7fffffff
using namespace std;
int num;
int betercallabdo(vector<int>arr)
{
int sum=0,n=arr.size();
for(int i=0;i<n-1;i++){
int min1=mi,pos=0;
for(int j=i;j<n;j++)
{
min1=min(min1,arr[j]);
if(min1==arr[j])pos=j;
}
rever... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < 9; i++) {
if (S.substr(i, 4) == "ZONe") ans++;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) ((x).begin()), ((x).end())
#define READ(x) (cin >> (x))
#define WRITE_N(x) (cout << (x) << endl)
#define WRITE(x) (cout << (x))
#define WRITE_Y... | #include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
int solve(std::vector<int> &r, std::vector<int> &c) {
LL ans = 0;
LL x = a... | #include<bits/stdc++.h>
using namespace std;
#define inf 1001000009
#define infmx 1e18ll
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define IOS ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define all(x) x.begin(),x.end()
///debug
#define wh(x) cerr<<#x<<" is "<<x<<endl... |
#include <algorithm>
#include <iomanip>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sstream>
#include <unordered_map>
#in... | /**
____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N_MAX = 200000;
int n;
int a[N_MAX * 2 + 2];
int p[N_MAX * 2 + 2];
bool cmp (const int &x, const int &y)
{
return ... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pll pair<ll,ll>
#define ppl pair<pll,ll>
#define plp pair<ll,pll>
#define pi 3.14159265358979323846264338327950
const ll MOD=1e9 + 7;
const ll N=2e5 + 7;
using names... | #include <bits/stdc++.h>
using namespace std;
#define IO ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define double long double
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#def... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n = 0, k = 0;
cin >> n >> k;
vector<int> v(n, 0);
vector<int> cnt(3e5 + 5, 0);
long long ans = 0;
for(int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long K, std::vector<long long> a){
map<ll, int> mp;
for(int i = 0;i < N;i++){
mp[a[i]]++;
}
ll ans = 0;
for(int i = 0;i < K;i++){
for(int j = 0;j < 1e9;j++){
if(mp[j] != 0)... |
//Bismillahir Rahman-ir Rahim
#include<bits/stdc++.h>
#include<cstdio>
#define PI acos(-1)
#define F first
#define S second
#define debug(x) cout<<'>'<<#x<<":"<<x<<endl
#define tara ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define Y printf("YES\n")
#define N printf("NO\n")
#define ll long long
#def... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
long long sum=0;
for(int i=1;i<=n;i++){
long long a,b;
scanf("%lld%lld",&a,&b);
sum=sum+(a+b)*(b-a+1)/2;
}
printf("%lld\n",sum);
} |
#include <bits/stdc++.h>
using Int = long long; // clang-format off
using pii = std::pair<Int, Int>;
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define RREP_(i, a_, b_, a, b, ...) for (Int i = Int(b) - 1, low... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define FILL0(x) memset(x,0,sizeof(x))
#define FILL1(x) memset(x,-1,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<... |
#include <bits/stdc++.h>
#include <fstream>
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;
typed... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int Modulo=1e9+7;
int N=1e5+5;
bool myCompare(int a,int b)
{
return a>b;
}
bool checkPrime(int n)
{
int flag=1;
for(int i=2;i<=sqrt(n);i++)
{
if(n%i==0)
flag=0;
}
if(flag)
return true;
... |
// #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 <stdio.h>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include ... |
#include <cstring>
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
typedef pair<int, int> E;
const int N = 250005;
const int M = 1e8;
const int R = 505;
int n, m;
int h[N], e[M], ne[M], w[M], idx;
int dist[N];
set<E> q;
inline int id(int x, int y) {
return (x - 1) * m + y;
}
inline... | // ๅ้กใฎ URL ใๆธใใฆใใ
//
#include <bits/stdc++.h>
using namespace std;
#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: " <... |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define vl vector<long long>
#define pii pair<int, int>
#define REP(i,a) for (int i = 0; i < (a); i++)
#define add push_back
using namespace std;
template<typename T>
using minpq... | #include <bits/stdc++.h>
using namespace std;
long long L, R;
long long T[1000005];
int main() {
cin >> L >> R;
if (L < 2) { L = 2; }
long long ans = 0;
for (int g = R; g >= 2; g--) {
long long w = R/g - (L-1)/g;
T[g] = w*w;
for (int gg = g*2; gg <= R; gg+=g) {
T[g] -= T[gg];
}
ans ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define io ios::sync_with_stdio(false); cin.tie(0)
// geometry
using C = complex<double>;
int main()
{
io;
int n; cin >> n;
double a, b, c, d;
cin >> a >> b >> ... | #include<bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins in... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int in;
int main()
{
in a,b,c,d;
cin>>a>>b>>c>>d;
cout<<min({a,b,c,d});
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using C = complex<double>;
int solve() {
ll r1, c1, r2, c2;
ci... |
#include<iostream>
#include<utility>
#include<algorithm>
#include<set>
#include<vector>
#include<cmath>
#define forn(i, x, n) for(int i = x; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int mod = 998244353;
const bool DEBUG = 0;
vector<int> primes;
vector<int> lp(2e5+1);
void sieve(){
forn(... | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int INF = 1000000000000000000;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main(){
int K;
cin >> K;
int ans = 0;
for( int i = 1; i <= K; i++ ){
for( int j... |
// C - Made Up
#include <bits/stdc++.h>
#define repi(i, s, n) for(int i=(int)(s); i<(int)(n); ++i)
#define rep(i, n) repi(i, 0, n)
#define rrep(i, n, s) for(int i=(int)(n-1); i>=(int)(s); --i)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(){
int n;
cin >> n;
map<int, i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
using Graph = vector<vector<ll>>;
#define all(x) (x).begin(), (x).end() //string ใฎ sort ใจใใฏใใ
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const ll MOD = 1000000007;
const ll INF = 1e18; //1*10^18... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x > 10)
count += x - 10;
}
cout << count << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<string,string> pss;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpi;
typedef vector<ll> ... |
/*
ID: ghallya2
TASK: ride
PROG: ride
LANG: C++
*/
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/... | /*
"An anomaly, I'm Muhammad Ali
Cause I know one day I'm gonna be the"
- Greatest, Eminem
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#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;
typ... |
///******* In the name of Allah *******///
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false), cin.tie(NULL);
#define nl '\n'
void Ok()
{
long int a,b,c,d,e,f,g,h,t,i,j,k,l,m,n,Mn,Mx;
long int ans_1,ans_2,ans_3,cnt_1,cnt_2,cnt_3,flag_1,flag_2,flag_3,temp,sum;
d... | #include <bits/stdc++.h>
using namespace std;
main(){
string s;cin>>s;
for (int i = 0; i < s.size(); ++i)
{
/* code */
if(s[i]=='.'){
cout<<s.substr(0,i);
break;
}
if(i==s.size()-1)cout<<s;
}
} |
#include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("... | #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>;
vector<int> in(200005, 0);
vector<int> out(200005, -1);
vector<vector<int>> in_D(200005);
int cnt = 0;
void dfs(int v, int d, vector<vector<int>> &G) {
in[v] = cnt;
in_... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX32 = 2147483647;
const long long MAX64 = 9223372036854775807;
const double PI = 3.14159265358979323846;
int main() {
long long n, m, sum, min = MAX64, a = 0, b = 0, c = 0, ind;
cin >> n >> m;
vector<long long> h(n), w(m), dp... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) (x).size())
typedef pair<int, int> pii;
typedef long long ll;
const int maxn = 2e5 + 5;
const int maxk = 300 + 5;
template<class T> void print(T & x){ cout << x; }
template<class T,class U> void print(pair<T,U> & p){cout << "("; print(p.first); cout << ... |
//----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 ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
int main() {
int m , h ;
cin >> m >> h ;
if( h % m == 0 )cout << "Yes" << endl ;
else cout << "No" << endl;
} |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr... | #include<bits/stdc++.h>
using namespace std;
#define tezi ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(c) c.begin(),c.end()
#define ll long long
#define ull unsigned long long
#define traverse(c,it) for(auto it=c.begin();it!=c.en... |
#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<iostream>
#include<vector>
#include<algorithm>
#include<stdlib.h>
#include<utility>
#include<functional>
#include<cfenv>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define vint vector<ll>
#define vvint vector<vint>... |
#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;
// MACROS
#define int long long
#define pb push_back
#define MAX 1e17
#define MIN -1... | #include <bits/stdc++.h>
using namespace std;
int main()
{
/* ios::sync_with_stdio(false);
cin.tie(0);*/
double x,y,X,Y;
cin>>x>>y>>X>>Y;
double ans,d;
d=y*(X-x)/(Y+y);
ans=x+d;
cout <<fixed<<setprecision(6)<<ans<<"\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
cout << (100 * N + K + 101) * N * K / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int total = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
total += (i * 100 + j);
}
}
cout << total;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char S[10];
int i;
cin >> S;
for(i=0; i<3; i++)
{
cout << S[1] << S[2] << S[0];
break;
}
return 0;
}
| #include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main(){
string ss;
cin>>ss;
string p,t;
p[0]=ss[1];
p[1]=ss[2];
p[2]=ss[0];
for(int i=0;i<=2;i++){
t += p[i];
}
cout<<t;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;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 long long INF = 1LL <<60;
... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=... |
// Copyright 2020 Tsutomu ISHIKAWA
// Author: Tsutomu ISHIKAWA
#include <iostream>
#include <climits>
#include <algorithm>
#include <cmath>
#include<string>
using namespace std;
// DPใใผใใซ
int x;
int main() {
cin >> x;
if (x < 0) {
cout << 0 << endl;
return 0;
}
else {
cout << x << endl;
re... | #include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
using ll = long long;
int main()
{
int n;cin >> n;
n = max(n,0);
cout<< n<< endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long li;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
li n;
cin >> n;
vector<li> xs(n);
for (int i = 0; i < n; ++i) {
cin >> xs[i];
}
li ans = xs[0];
for (int i = 0; i < n; ++i) {
ans = __gcd(ans,... | #include<bits/stdc++.h>
using namespace std;
using u64 = uint_least64_t;
using s64 = int_least64_t;
using ll = uint_least64_t;
int main(){
u64 n;
cin >> n;
vector<u64> a(n);
for (u64 i = 0; i < n; i++){
cin >> a[i];
}
sort(a.begin(), a.end());
// a.erase(unique(a.begin(), a.end()), ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef unsigned int uint;
typedef unsigned long long ull;
#define repi(i, a, b) for(int i = int(a); i < int(b); i++)
#define rep(i, n) repi(i, 0, n)
#define repir(i, a, b) for(int i = int(a); i > int(b... | #include<bits/stdc++.h>
using namespace std;
int n,a[100010],b[100010],v[2][50010];
long long ans;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d",&a[i]),ans+=a[i];
for(int i=1;i<=n;++i)scanf("%d",&b[i]),v[i&1][i+1>>1]=b[i]-a[i];
sort(v[0]+1,v[0]+(n>>1)+1),sort(v[1]+1,v[1]+(n>>1)+1);
for(int i=(n>>1);i... |
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp> //required
// #include <ext/pb_ds/tree_policy.hpp> //required
// using namespace __gnu_pbds; //required
// template <typename T> using ordered_set = tree<T, null_type, less<T>,
// rb_tree_tag, tree_order_statistics_node_update... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef map<int, int> mii;
typedef pair<int, int> ii;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
size_t N, M;
cin >> N >> M;
vector<int> A(M + 2, 0);
for (size_t i = 1; i <= M; i++)
{
cin >> A[i];
}
A.back() = N + 1;
sort(A.begin(), A.end());
map<int, size_t> count;
int minimum = N;
for (size_t i = 0; ... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#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 co(x)... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rng(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(ob... | #include <iostream>
#include <vector>
#include <unordered_set>
#include <algorithm>
using namespace std;
struct Node
{
int id;
long long int c;
long long int diff;
int depth;
vector<Node *> next;
};
void travel(Node *curr, long long int currentDiff, Node *from = nullptr)
{
currentDiff += curr... |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retu... | #include<bits/stdc++.h>
using namespace std;
int main()
{int a,b,c;
cin >> a >> b >> c;
if(a==b) cout << c << endl;
else if(b==c) cout << a << endl;
else if(a==c) cout << b << endl;
else cout << 0 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<bool> s(n);
for(int i = 0; i < n; i++){
string now;
cin >> now;
if(now == "AND") s.at(i) = true;
else s.at(i) = false;
}
long long ans = 1;
reverse(s.begin(), s.end());
for(long long i = 0; i < n... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n;
cin>>n;
n=1<<n;
ll left=0,right=0;
map<ll,ll>mp;
ll a[n+1];
for(ll i=1; i<=n; i++)
{
cin>>a[i];
mp[a[i]]=i;
}
for(ll i=1; i<=n; i++)
{
if(i<=n/2)
left=max(... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>> n;
for (int i=0; i<n; ++i) {
cout<< (i*2)%n+1 << " " << (i*2+1)%n+1 <<endl; }
return 0; } | #include<bits/stdc++.h>
using namespace std;
unsigned long long n,k,sum,l;
unsigned long long cf(unsigned long long x,unsigned long long y)
{
unsigned long long ans=1;
for(int i=1;i<=y;i++)
{
ans*=x;
}
return ans;
}
int main()
{
scanf("%llu",&n);
k=n;
int p;
for(int i=1;;i++)
{
if(k==0) break;
k/=10;
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define fast std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define endl "\n"
const ll INF = 1e18;
const ll NEGINF = -1 * INF;
/*NOTES: Take care of ll vs int
... | // I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdi... |
#include<iostream>
#include<vector>
#include<cmath>
#include<iomanip>
#define int long long
#define endl '\n'
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define infi INT_MAX
#define rinfi INT_MIN
#define inf LLONG_MAX
#define rinf LLONG_MIN
#define ff first
#define ss second
#ifndef ON... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FILL0(x) memset(x, 0, sizeof(x))
#define FILL1(x) memset(x, -1, sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <deque>
#include <complex>... | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
using ll = long long;
int main() {
int n,a,b;
cin >> n >>a>>b;
cout << n-a+b <... |
/* ุจูุณูู
ู ุงููููููู ุงูุฑููุญูู
ูููฐูู ุงูุฑููุญููู
ู
( ุฅููู ุงููุญูููู
ู ุฅููููุง ููููููู )
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef unsigned long long ull;
typed... | /* HARE KRSNA HARE KRSNA KRSNA KRSNA HARE HARE
HARE RAMA HARE RAMA RAMA RAMA HARE HARE */
#include<bits/stdc++.h>
using namespace std;
#define nl "\n"
#define ff first
#define ss second
#define pp pop_back
#define pf pop_front
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(x) x.be... |
//Show them your PROGRESS
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
const int M = 1e9 + 7;
const int MAX = 2e6 + 5;
#define selena ios_base::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
int findMaxGCD(vector<... | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF ------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll... |
#include <iostream>
using namespace std;
int main(void) {
int N, A, B;
cin >> N >> A >> B;
N -= A;
if (N < 0) {
N = 0;
}
N += B;
cout << N << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N = 2e5 + 5;
int32_t main()
{
IOS;
int a, b, n;
cin >> n >> a >> b;
cout << n - a + b;
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | // Author: param3435
#include <bits/stdc++.h>
#pragma GCC optimize ("-O2")
using namespace std;
#define LL long long
#define LD long double
#define divisor 1000000007
#define INFP LLONG_MAX
#define INFN LLONG_MIN
#def... |
#include<ctime>
#include<cstdio>
#include<cctype>
using namespace std;
const int N=2e5+10;
int read() {
char c;
int x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
char str[N],stack[N];
int n,f,o,res,top;
int main() {
#ifndef ONLINE_JUDGE... | // https://atcoder.jp/contests/abc203/tasks/abc203_c
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define chmin(a, b) a = min(a, b)
#define chmax(a, b)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.