code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
#define qc ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rt return
#define fi first
#define se second
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
typedef long long ll;
using namespace std;
ll dig(ll n)
{
ll ans=0;
while(n>0){
n/=10;ans++;
}rt ans;
}
ll ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cin >> n;
ll limit = (log10(n)+1)/2;
ll ans = n/pow(10,limit);
//cout << ans << " " << limit <<" " << endl;
ll temp = ans;
while(temp*pow(10,limit)+temp>n){
temp--;
ans--;
limit = log10(temp)+1;
}
cout << ans << endl;
... |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fr first
#define sc second
#define pb push_back
int a, b, x, y, ans;
int main(){
cin>>a>>b>>x>>y;
if(a < b){
ans = min((b-a)*y,(b-a)*2*x) + x;
}
else if(a > b){
ans = min((a-b-1)*y,(a-b-1)*2*x) + ... |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s... |
// #include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repr(i, n) for(int i = (n-1); i >= 0; --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... | #include <bits/stdc++.h>
using namespace std;
#pragma optimize("-O3")
#define int long long int
#define f first
#define s second
#define pb push_back
#define endl '\n'
const int MOD=998244353;
int n, m;
int po[5005][5005];
main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>m;
int tot=n... |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ll = long long;
using vl = vector<long long>;
using vi = vector<int>;
int main(){
string s; cin >> s;
string tmp1="",tmp2;
int c = s.size();
bool flag = false;
for(int ix=0;ix<c;ix++){
if(s.at(c-ix-1) != '0' || flag... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b){return b? gcd(b, a % b): a;}
ll quickpow(ll a, ll b){ll res = 1; while(b){if (b & 1) res = res * a; a = a * a; b >>= 1;} return res;}
// head
string s;
int main(void){
ios::sync_with_stdio(false);
cin.tie... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
char s,t;
cin>>s>>t;
if(s=='Y')cout<<char(toupper(t))<<endl;
else cout<<t<<endl;
return 0;
} | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include<atcoder/all>
#include<iostream>
#include<cstdint>
#include<cstddef>
using namespace std;
//using namespace atcoder;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
using usize = uint_fast64_t;
#define rep(i, n) for... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.... | #include <bits/stdc++.h>
using namespace std;
// overflow prob
#define int long long
#define p_queue priority_queue
#define all(n) n.begin(),n.end()
#define gcd(x,y) __gcd(x,y)
#define findString(s,x) s.find(x)!=string::npos
#define maxe(x) *max_element(all(x))
#define mine(x) *min_element(all(x))
#define rall(n) n.rb... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N,M,X,Y; cin >> N >> M;
vector<pair<ll,ll>> P;
set<ll> A,B,S; S.insert(N);
for (int i =0; i<M; i++) { cin >> X >> Y; P.push_back({X,Y});}
sort(P.begin(),P.end());
ll tmp = 0,cnt;
while (tmp < M) {
A.clear(); B.clear()... | #include<bits/stdc++.h>
using namespace std;
#define vec vector<int>
#define vecp vector<pair<int,int>>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fr first
#define sc second
#define fr1(i,a,b) for(int i=a;i<b;i++)
#define fr2(i,a,b) for(int i=a;i>=b;i--)
#define fr3(i,a,b) for(int ... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve_WA() {
int N;
cin >> N;
vector<int> A(N + 1);
//vector<int> ac(N + 1, 0);
map<int, int>ac;
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define pr(a) cout << a
#define prl(a) cout << (a) << endl
#define prld(a) cout << setprecision(15)<< (a) << endl ... |
/** This won't be the end of me */
#include <iostream>
#include <algorithm>
#define endl '\n'
#define FAST ios::sync_with_stdio(0);cin.tie(0);
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define mt make_tuple
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll,ll>;
using pi = pair<int,int>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
int main() {
int n;
cin >> n;
cout << n - 1;
} | #include<iostream>
#include<bits/stdc++.h>
#define forf(i,start,n,increment) for(int i = start;i<n;i+=increment)
#define all(i) i.begin(),i.end()
#define traverse(container,it) for(typeof(container.begin()) it = container.begin();it != container.end();it++)
using namespace std;
int main()
{
ios_base::sync_with_stdi... |
#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<int>
#define vvint vector<vint... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define pob pop_back
#define eb empl... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long ans = N * (N + 1) * K * 100 + K * (K + 1) * N;
ans /= 2;
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
#define Output(a) cout << a << endl
typedef long long int ll;
typedef vector<int> vi;
typedef vector<long long> vll;
const int INF = 1<<30;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.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
const in... |
#include <bits/stdc++.h>
#define lowbit(x) ((x)&(-x))
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int N=160;
const int mod=1000000007;
int a,b;
int main() {
cin>>a>>b;
int ans=1;
for(int i=b;i>=1;i--) {
int r=b/i;
int l=(a+i-1)/i;
// cout<<i<<" "<<l<<"... | #include<stdlib.h>
#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <uno... |
#include <bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define deb(x) cout<<#x<<"="<<x<<endl;
#define endl '\n'
#define M 1000000007
#define int long long
#define F first
#define S second
#define INF 1e18
#define N 1000005
using namespace std;
ll h, w, ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef std::vector<std::vector<int64_t> > Graph;
#define in1(n) int64_t n;cin >> n;
#define in2(n, m) int64_t n, m;cin >> n >> m;
#define in3(n, m, k) int64_t n, m, k;cin >> n >> m >> k;
#define in4(a, b, c, d) int64_t a, b, c, d;cin >> a >> b >> c ... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define ii pair<int,int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll,ll>
#define vv vector
#define al... |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define rep(i, n) for(int i = 0; i < n; i++)
const int mod = (int)1e9 + 7;
int power(int x, int n, int m){
x %= m ;
int ans = 1 ;
while(n > 0){
if( n & 1 ) ( ans *= x ) %= m ;
( x = x * x ) %= m ;
n >>= 1 ;
}... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #include <bits/stdc++.h>
#define PI acos(-1)
#define eq(x,y) (fabs((x)-(y)) < eps)
#define debug(x) cerr<<#x<<" = "<<x<<endl;
#define pb push_back
#define eb emplace_back
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define bump cout<<"bleh\n"
#define all(v) (v).begin(),(v).end()
#define fast... |
#include <iostream>
using namespace std;
int main()
{
int n, x,input;
cin >> n >> x;
for (int i = 0; i < n; i++)
{
cin >> input;
if (input != x)
{
cout << input<<endl;
}
}
}
|
#include <bits/stdc++.h>
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(7)<<(x)
#define all(v) (v).begin(), (v).end()
using namespace std;
#define loop(i,a,b) for (int i=a; i<b; ++i)
using ll = long long;
const int mod = 998244353;
typedef pair<int , int> pairs;
typedef complex<ll> G;
const int N = 1e3 + 5;
... |
#include<bits/stdc++.h>
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define puts(x) cout << (x) << "\n"
using namespace std;
int si, sj, t[60][60], p[60][60], M;
bool b1[50 * 51];
int score(string s) {
int xs = si, ys = sj, r = p[xs][ys];
for (char c : s) {
if (c ... | #include <vector>
#include <stdio.h>
#include <algorithm>
int n, fa[100005], head[100005], cnt, dp[100005], size[100005];
struct edge { int to, nxt; } g[100005];
inline void add_edge(int f, int t) {
g[++cnt].to = t;
g[cnt].nxt = head[f];
head[f] = cnt;
}
void dfs(int u) {
dp[u] = 1; size[u] = 1;
std::vector<int... |
/** author: samari06, created: 09.03.2021 21:49:15 **/
#include <bits/stdc++.h>
#define REP(i, N) for(int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
typedef vector<int> V;
typedef vector<ll> Vll;
int t[55][55], p[55][55], sx, sy;
int cscr = 0, bstscr = 0;
string dist = "RLDU";
class Timer {
... | #include <iostream>
#include <cmath>
#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>
#inc... |
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... | #include <iostream>
#include <string>
using namespace std;
int main(){
string s; cin >> s;
int count = 0;
for(int i = 0; i+3 < s.size(); ++i){
if(s[i] == 'Z' && s[i+1] == 'O' && s[i+2] == 'N' && s[i+3] == 'e'){
count++;
}
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rrepi(i,a,b) for(int i=((int)(b)-1);i>=(a);--i)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) rrepi(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define UNIQUE(x) (x).erase(unique(ALL(x)), (x).end())
... | #include <bits/stdc++.h>
#include <iostream>
#include <cstdio> // popen, pclose, fgets
#include <cstdlib>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
using vi = vector<int>; // intの1次元の型に vi という別... |
#include<iostream>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int get(int a,int b)
{
if(b<0) return 0;
return 1LL*(b-a+1)*(a+b)/2%mod;
}
int main()
{
int t;scanf("%d",&t);
while(t--){
ll n,a,b;cin>>n>>a>>b;
if(a>b)swap(a,b);
ll ans=2LL*((n-a+1)*(n-b+1)%mod*get(1,n-a-b+1)%mod)%mod;
//cou... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i ... |
#include<bits/stdc++.h>
#define lli long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lli n,x,i;
cin>>n>>x;
string s;
cin>>s;
for(i=0;i<s.size();i++)
{
if(s[i]=='x' && x>0)
x=x-1;
if(s[i]=='o')
... | #include <bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
void chmax(LL&l,LL r){ if(l<r) l=r; }
int N;
LL X;
LL A[100];
LL dp[101][100];
void solvedp(int K){
rep(n,K+1) rep(k,K) dp[n][k]=-1000000000000;
dp[0][0]=0;
rep(i,N){
in... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... | #include <bits/stdc++.h>
using namespace std;
int a, b, c, d;
int main(){
cin>>a>>b>>c>>d;
//max x-y
cout<<max(a,b) - min(c,d)<<"\n";
} |
#include <bits/stdc++.h>
//#include "atcoder/all"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
//using namespace atcoder;
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> P;
constexpr ll inf=1ll<<61;
constexpr ll mod=998244353;
int a[1050000];
int n=1;
int ... | //Code by Mukul Totla
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
void sublime(){
#ifndef ONLINE_JUDGE
freopen ("input.txt", "r", stdin);
freopen ("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
}
in... |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 998244353
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __b... | #include <bits/stdc++.h>
#define endl '\n'
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
int n,m;
char a[510][510];
int cntr,cntb;
signed main(){
cin>>n>>m;
for(in... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
using C = complex<double>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<ll> b(410);
rep(i, n) b.at(a.at(i) + 200)++;
ll ans = 0;
for (ll i... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ll r = 0, s = 0;
for (int i = 0; i < n; i++) {
... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... |
//================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 <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n, m, adj[20];
int dp[262144];
void solve(int, int, int, int);
int get(int x) {
if (!x) return 0;
if (dp[x] != 2e9) return dp[x];
solve(0, x, 0, x);
return dp[x];
}
void solve(int p, int r, int s, int d) {
if (!r &... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include <stdio.h>
#include <bits/stdc++.h>
int main()
{
int i, N, A[2][100001];
scanf("%d", &N);
for (i = 1; i <= N; i++) scanf("%d", &(A[0][i]));
for (i = 1; i <= N; i++) scanf("%d", &(A[1][i]));
int j, k, l, r;
const long long inf = -(1LL << 60);
long long dp[2][100001];
for (i = 0; i <= N; i++) {
dp[0]... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
int c;
c=a+b;
if(15<=c){
if(8<=b){
cout << "1" << endl;
}
else if(3<=b){
cout << "2" << endl;
}
else{
cout << "3" << e... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXN = 3e5;
ll n, a[MAXN];
ll solve() {
sort(a, a+n);
vector<ll> grps;
ll last = 0, ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] != a[last]) {
grps.push_back(i-last);
last = i;
}
... | #include<bits/stdc++.h>
#define ll long long int
#define rep(i,a,b) for (int i = a; i <b; i++)
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{ll n;cin>>n;ll a[n],b[n];
ll sum=0,i;
for(ll i=0;i<n;i++)
{
cin>>a[i];
}
for( i=0;i<n;i++)
{
cin>>b... |
#include<map>
#include<ctime>
#include<cstdio>
#include<cctype>
#define ll long long
using namespace std;
ll read() {
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
ll x,y;
map<ll,ll>f;
ll min(ll x,ll y){
return x<y?x:y;
}
ll ... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typed... |
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <functional>
#include <set>
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;
... |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
vector<int> good;
map<int,vector<int>> adj;
map<int,int> color;
map<int,int> mark;
void dfs(int node,vector<bool> &visited){
visited[node]=1;
if(mark.count(color[node])==0){
mark[color[node]]=1;
... |
#include<bits/stdc++.h>
#define ll __int128
using namespace std;
const int N = 55;
int n;
int primes[N] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47}, book[N];
ll ans = 1e30;
ll gcd(ll a, ll b){ return b ? gcd(b, a % b) : a;}
void print(__int128 x) {
if(!x)
{
puts("0");
return ;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
string S;
char mem[1000020];
const int base = 500010;
signed main()
{
cin >> S;
// int l = base, r = base + 1;
// bool flip = false;
// for(auto e : S)
// {
// if(e == 'R')flip = !flip... |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P... | #include <stdio.h>
#include <set>
#define MN 1000
int h,w,fa[MN*2+5];
char s[MN+5][MN+5];
int r(int x){
return x;
}
int c(int x){
return x+h;
}
int gf(int u){
return fa[u]==u?u:fa[u]=gf(fa[u]);
}
void unite(int u,int v){
u = gf(u);
v = gf(v);
if(u==v) return;
fa[v] = u;
}
int main(){
scanf("%d%d",&h,&w);
... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,n,m,x1,x2,x3,x4,k,k1;
cin>>n>>m>>a>>b;
x1=n-a;
x2=n-b;
x3=m-a;
x4=m-b;
k=max(x1,x2);
k1=max(x3,x4);
cout<<max(k,k1)<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
const int MAX_N = 2000;
vector<vector<int>>G;
bool temp[MAX_N];
void dfs(int v) {
if (temp[v])return;
temp[v] = true;
for (auto vv : G[v])dfs(vv);
}
int main() {
int N, M;
cin >> N >> M;
G.resize(N);
for (int i = 0; i < M; i++) {
int a, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+5;
int mod=1e9+7;
int gcd(int x,int y)
{
if(y==0)
{
return x;
}
return gcd(y,x%y);
}
int power(int a,int n)
{
int res=1;
while(n)
{
if(n%2)
{
res=(res*a)%mod;
}
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int64_t> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
unordered_map<int64_t, int64_t> freq_altsum;
freq_altsum[0]++;
int64_t altsum= 0;
for(int i=0; i<N; i++){
altsum= (i%2==0) ? data.at(i)+ altsum
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define fs first
#define sc second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define MP make_pair
mt19937 rng(chrono::steady_clock::now().time_... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i64 i=0; i<n; i++)
#define all(v) v.begin(),v.end()
#define pp pair<int,int>
using Graph=vector<vector<int>>;
using i64=int64_t;
int main() {
int n,m;cin>>n>>m;
rep(i,m) {
string s;
cin>>s;
}
rep(i,20) {
rep(j,20... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define rep(i,n) for(ll i=0; i<(n);++i)
#define pb push_back
template<typename T> int max_index(vector<T>& v){auto mi = max_element(v.begin(), v.end()); return distance(v.begin(), mi);}
template<typename T> ll max_value(vector<T>&... |
#include <algorithm>
#include <iostream>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cmath>
#include <climits>
#include <queue>
#include <bitset>
using namespace std;
typedef vector<vector<long> > dim2veclo;
typedef vector<vector<int> > di... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... |
//***JAI SHREE KRISHNA***
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define inf 1e18
#define MAX INT_MAX
#define MIN INT_MIN
#define F ... | #include <bits/stdc++.h>
using namespace std;
//#include<atcoder/all>
//using namespace atcoder;
using ll = long long;
#define INF32 2147483647
const long long INF = 1LL << 60;
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;} return 0;}
template<class T> bool chmin(T &a,const T &b){if(b<a){a=b;retur... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<stdio.h>
#include<deque>
#include<map>
#include<queue>
#include<cmath>
#include<set>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) for(ll i = 0; i < n; i++){cout << a[i] << ' ';} cout << ... | #include <bits/stdc++.h>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
using ll = long long;
const int N(1e5 + 10);
int n, tr[200];
std::vector<ll> a[3];
#define Odd(x) ((x) & 1)
ll Dis(int x, int y)
{
std::set<ll> S; ll ans = 1e18;
for (auto i : a[y]) S.insert(i);
for (auto i : a[x... |
#include<bits/stdc++.h>
#define fo(i,a,b)for(int i=a;i<b;i++)
long long dp[105][600006],t;
main(){int n,k,M,b;std::cin>>n>>k>>M;dp[0][0]=1,b=n*(n+1)/2*k;fo(i,1,n+1)fo(s,0,b+1)
dp[i][s]=(dp[i-1][s]+(s<i?0:dp[i][s-i])+M-(s<i*(k+1)?0:dp[i-1][s-i*(k+1)]))%M;
fo(i,1,n+1){t=0;fo(s,0,b+1)t=(t+dp[i-1][s]*dp[n-i][s])%M;
std::c... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define re return
#define all(a) a.begin(),a.end()
#define int long long
#define Type int
#define rept(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) rept(i,0,a)
using namespace std;
void fail(string s){ cout<<s;exit(0); ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
float A,B;
cin >> A >> B;
float V;
V = (A - B) / A * 100;
cout << V << endl;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <... |
#include<bits/stdc++.h>
using namespace std ;
# define all(v) (v).begin() , (v).end()
# define allrev(v) (v).rbegin() , (v).rend()
# define allcomp(v) (v).begin() , (v).end() , comp
# define ll long long
# define ld long double
# define line cout << "\n" ;
# define fast ios_base :: sync_with_stdio ( false ) ; cin.ti... | #define _DEBUG
#include "bits/stdc++.h"
//#include <atcoder/all>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,a5,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define repp(i, n, m) for (int i = m; i < int(n); ++i)
//alias g++='g++ -I/mnt/c/Users/Owner/Desktop/ac-library'
using ll = long long;
using ld = long double;
using P = pair<int, int>;
... | #pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize ("trapv")
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define mkp make_pair
#define pb push_back
#define pf push_front
#define inf 1000000000... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
typedef long long ll;
const int N = 100000000;
using namespace std;
//100000000
int main(){
int n;
cin >> n;
vector<long long> a(n);
rep(i,n)cin >> a[i];
sort(a.begin(), a.end(), greater<long long>());
// rep(i,n){
//... | #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
#d... |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
void dbg_out() { cerr << "\b\b]\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ cerr << H << ", "; dbg_out(T...);}
#define watch(...) cerr ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
const int MAXIOSIZE = 1 << 24 | 1;
unsigned char buf[MAXIOSIZE], *p1, *p2;
#define gc (p1 == p2 && (p2 = (p1 = b... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... |
#include<bits/stdc++.h>
using namespace std;
#define dvg(x) cout<<__LINE__<<": "<<#x<<" = "<<x<<endl;
#define endl "\n"
#define rep(i, st, n) for(int i = st; i <= n; i += 1)
#define ll long long
#define l64 int64_t
#define ld long double
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int,int> pi;
typedef pair<lld,lld> pl;
typedef pair<int,lld> pil;
typedef pair<lld,int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef vector... |
#include <bits/stdc++.h>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 1e18;
const ll fact_table = 320000;
priority_queue<ll> p... | #include <iostream>
#include <string>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define pb push_back
#define fo(i, a, b) for (int i = a; i < b; i++)
#define sqr(x) ((ll)(x) * (x))
#define p(a) cout << a << "\n"
#define fast_io \
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ii pair<int, int>
#define OK (cerr << "OK" << endl)
#define debug(x) cerr << #x " = " << (x) << endl
#define ff first
#define ss second
#define int long long
#define tt tuple<int, int, int>
#define all(x) x.begin(), x.end()
#define vi vecto... |
#include <bits/stdc++.h>
int main(){
int a, b, c, d;
std::cin >>a >> b >> c >> d;
std::cout << (a*d - b*c) << std::endl;
} | #include <math.h>
#include <stdio.h>
#include <time.h>
#include <algorithm>
#include <complex>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include ... |
//
// Created by whq on 2021/2/21.
//
#include <bits/stdc++.h>
#define uset unordered_set
#define umap unordered_map
#define debug cout<<"ok"<<endl
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define vi vector<int>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvb... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (ll i = j; i < (n); ++i)
#define rrep(i, j, n) for (ll i = (n)-1; j <= i;... |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long int ll;
#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... | #define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... |
#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#pragma region macros
using str=string;
using ll=long long;
using vl=vector<ll>;
using vc=vector<char>;
using pl=pair<ll,ll>;
using ml=map<ll,ll>;
using sl=set<ll>;
template<class T> using V=vector<T>;
template<class T,class U... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define FOR(i,a,b) for (int i=a;i<=b;++i)
#define FORD(i,a,b) for (int i=a;i>=b;--i)
using namespace std;
typedef long long LL;
typedef pair<int,int> pa;
typedef vector<int> vec;
void getin... |
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define P... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<climits>
#include<utility>
#include<vector>
#include<queue>
#define int long long
using namespace std;
const int MaxN = 500005;
int n, ans;
char s[MaxN], t[MaxN];
queue<int> pos;
inline int Read(){
int... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include<bits/stdc++.h>
using namespace std;
const int N=110000;
int n,L,a[N],b[N],c[N],d[N];
long long ans;
int main() {
cin>>n>>L;
for(int i=1;i<=n;++i) cin>>a[i], c[i]=a[i]-a[i-1]-1; c[n+1]=L-a[n];
for(int i=1;i<=n;++i) cin>>b[i], d[i]=b[i]-b[i-1]-1; d[n+1]=L-b[n];
for(int i=1,j=1;i<=n+1;++i) if(d[i]) {
int s... |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*............................................................................*/
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_n... | #include<cstdio>
long long a,b;
int main(){
scanf("%lld%lld",&a,&b);
printf("%lld %lld\n",(a+b)/2,(a-b)/2);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int d = to_string(N).length();
int M = 1;
for (int i = 0; i < d/2; i++) {
M *= 10;
}
if (d%2 == 0) {
if (N/M <= N%M) cout << N/M << endl;
else cout << N/M - 1 << endl;
}
else {
cout << M - 1 <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxN = 1e6 + 5;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
ll n;
cin >> n;
auto get_num = [] (string s) -> ll {
ll res = 0;
for(char &c : s) {
res *= 10;
res += (c - '0');
}
return res;
};
int ans = 0;
for(... |
#include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... | #include <iostream>
#include <cstdlib>
#include <bitset>
#include <map>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
#include <sstream>
using namespace std;
#define ll long long
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#d... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sys/types.h>
#include <unistd.h>
#include <vector>
#pragma region macros
#define _overload(_1, ... | #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);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
vector<ll> s(n + 1, 0);
rep(i, n) ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n-1) << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
const int MOD = 1000000007;
void solve(){
int n;
cin>>n;
int ans = n/100;
if(n%100 != 0){
ans++;
}
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#i... |
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <stdio.h>
constexpr int HeighestDim = 505000;
int n, m, k;
long long int res[101];
int dim_a = 0, dim_b = 0;
int A[HeighestDim + 1], B[HeighestDim];
void mult_a(int v){
for(int i = dim_a, j = i - v; j >= 0; --i, --j){ A[i] -= A[j]; if... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n;
cin >> n;
long long s3 = 3, s5 = 5;
for (int i = 1; s3 < 1e18; ++i) {
s5 = 5;
for (int j = 1; s5 < 1e18; ++j) {
if (s3 + s5 == n) {
cout << i << " " << j << '\n';
r... | // Author: Vinay Khilwani
// Language: C++
// @vok8: Codeforces, AtCoder, LeetCode, HackerEarth, TopCoder, Google, FB, CSES, Spoj, GitHub
// @vok_8: CodeChef, GFG
// @vok8_khilwani: HackerRank
// Never Stop Trying.
// Trying to be Better than Myself.
// while(true)
// {
// if(AC)
// {
// break;
//... |
#include <bits/stdc++.h>
using namespace std;
signed main(){
int A, B, C;
scanf("%d%d%d", &A, &B, &C);
if(A * A + B * B < C * C){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... |
#include<stdio.h>
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[22];
int st[22];
int orr[22];
int xorr;
int cnt;
int temp;
long long min;
int aa = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++){
scanf("%d", &a[i]);
}
for (int i = 0; i ... | /**
* author: Takeda Takumi
* created: 30.03.2021 16:14:34
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
int ans = 1<... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
typedef unsigned long long ull;
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define f(i,a,b) for(ll i=a;i<=b;i++)
// #define testcases ll t;cin>>t;while(t--)
#define dec(x) greater<x>()
/*** Define fues ***/
#define mx 200005
#define ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count=0;
for(int i=0;i<9;i++){
if(s.at(i)=='Z'){
if(s.at(i+1)=='O'){
if(s.at(i+2)=='N'){
if(s.at(i+3)=='e'){
count++;
}
}
}
}
}
cout << count << e... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
mt19937 rand_mt;
const int XYMAX = 10000;
class xyr{
public:
int x;
int y;
int r;
int index;
int a;
int b;
int c;
int d;
void print(){
cout << a << " "
<< b <... | #include<bits/stdc++.h>
#define w(x) int x; cin>>x; for(int tc=1;tc<=x;tc++)
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl;
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define pb push_back
#define pqg priority_queue<int>
#define pqs priority_queue<in... |
#include<iostream>
#include<vector>
using i64 = int64_t;
template<i64 MOD>
struct modint{
i64 val;
modint():val(0){}
modint(i64 v):val(v<0?(-v)%MOD:v%MOD){}
operator i64(){return val;}
modint &operator += (modint other){this->val+=other.val;if(this->val>=MOD)this->val-=MOD;return *this;}
modint &operator -... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5+8, inf = 1e18+9, mod = 998244353;
int n, k, a[maxn], sa[312][maxn], sb[312][maxn], C[312][312];
void solve() {
int i, j, ans = 0, inv2 = (mod - mod / 2);
cin >> n >> k;
for (i = 1; i <= 300; i++) C[i][i] = C[i][0] ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin>>n;
int l,r,ans=0;
while(n--){
cin>>l>>r;
ans+=(l+r)*(r-l+1)/2;
}
cout<<ans;
return 0;
} | #include<bits/stdc++.h>
#define DONTSYNC ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) //dont use stdio with iostream functions //input and output are out of order now!
#define TEST unsigned long long T; cin>>T; while(T--) //loop over each testcase
#define endl "\n"
#define fori(a,start,end) for(in... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
//freopen("1.in","r",stdin);
//ios::sync_with_stdio(false);
char X[66];
ll M;
scanf("%s",X);cin>>M;
int n=strlen(X);
int max=0;
for(int i=0;i<n;i++){
if(X[i]-'0'>max)max=X[i]-'0';
}
ll coun... | //{{{
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VLL = vector<LL>;
using vi = vector<int>;
using pii = pair<int, int>;
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#ifdef LOCAL
#include "prettyprint.hpp"
// clang-format of... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
const int N = 1e5 + 5;
#define int long long int
int32_t main() {
IOS ;
// int t ; cin >> t ; while(t--) {}
int n ; cin >> n ; char c ;
int dp[4][n+1] ;
for(int i=0; i<4; i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... |
#include <bits/stdc++.h>
#include <climits>
#include <math.h>
#include <iomanip>
#include <algorithm>
#include <map>
#define rep(i,s,n) for (ll i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
int main() {
int a,b,c;
cin>>a>>b>>c;
if(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a,b,c;
cin >> a >> b >> c;
int d = min(a,b);
a -= d;
b -= d;
if(c==0){
if(a-1<0) cout << "Aoki" << endl;
else cout << "Takahashi" << endl;
}
if(c==1){
... |
#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
int dx[4] = {0,1,0,-1};
int dy[4] = {-1,0,1,0};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int H, W, N, M;
cin... | #include <bits/stdc++.h>
#define fst first
#define snd second
#define ll long long
#define ld long double
#define pb push_back
#define emp emplace_back
#define pii pair<int, int>
#define usg unsigned
#define sg signed
#define mp make_pair
using namespace std;
void setIO(){
ios::sync_with_stdio(0);
cin.tie(0); cout... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define mem0(x) memset(x, 0, sizeof (x))
#define mem1(x) memset(x, -1, sizeof (... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
int main() {
lint N;
cin >> N;
vector<lint> A(N);
for(auto& elem : A) cin >> elem;
P ans = {0,0};
for(lint i=2; i<=1000; i++) {
lint counter = 0;
for(auto a : A) {
counter += (a%i == 0);
... |
#include <array>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <functional>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#in... | //clear adj and visited vector declared globally after each test case
//check for long long overflow
//while adding and subs check if mod becomes -ve
//while using an integer directly in a builtin function add ll
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Dont keep array name as size or any o... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> psl(N, vector<int>(2));
vector<vector<int>> psr(N, vector<int>(2));
for (int i = 0; i < N; ++i) {
cin >> psr[i][0] >> psl[i][0];
psr[i][1] = i;
psl[i][1] = i;
// c... | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
#define all(v) v.begin(), v.end()
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, b) for (ll i = a; i < b; ++i)
#define rep_down(i, a, b) for (ll i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)
const ll MOD = 1000000007;
const ll INF = (ll) 4e18;
long long extGCD(long long a, long long b, long l... | #include<bits/stdc++.h>
using namespace std;
int const p=1e9+7;
int f[1005][2][2],g[1005][2][2],h[1005][2][2];
int main()
{
int n;
char aa,ab,ba,bb;
cin>>n>>aa>>ab>>ba>>bb;
f[2][0][0]=f[2][0][1]=f[2][1][0]=f[2][1][1]=1;
g[2][0][0]=g[2][0][1]=g[2][1][0]=g[2][1][1]=1;
h[2][0][0]=h[2][0][1]=h[2][1]... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pll = pair<ll, ll>;
using vll = vector<ll>;
#define endl "\n"
#define space " "
#define TLE_na_ho ios_base::sync_with_stdio(false);cin.tie(NULL)
#define MAX_SIZE 1024
#define MOD 100000000... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
char ch[3];
for(ll i=0;i<3;i++) cin>>ch[i];
char c = ch[0];
if(ch[1]==c && ch[2]==c) cout<<"Won\n";
else cout<<"Lost\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s[0]==s[1]&&s[1]==s[2])
cout<<"Won";
else
cout<<"Lost";
} |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 41;
typedef long long LL;
LL a[1 << (MAX_N / 2)], b[1 << (MAX_N / 2)];
LL item[MAX_N];
int generate_item(LL* s, int beg, int end) {
int len = 1 << (end - beg);
for (int i = 0; i < len; i++) {
for (int j = beg; j < end; j++)
s... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include<atcoder/all>
using namespace atcoder;
#endif
typedef long long ll;
typedef long double ld;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef pair<int,int> pii;
type... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C;cin>>A>>B>>C;
int a=A+B;
int b=B+C;
int c=A+C;
if(A==B==C){
cout<<A+B;
}else{
int z=max(max(a,b),c);
cout<<z;
}
} |
#include <cstdio>
int N;
const int MAXN=2e5+7;
char buf[MAXN];
char pattern[MAXN];
using ll = long long int;
ll setu=1e10;
int main(){
scanf("%d\n",&N);
scanf("%s",buf);
if (N==1&&buf[0]=='1') {
puts("20000000000");
return 0;
}
else if (N==1&&buf[0]=='0'){
puts("1000000... | #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 ff first
#define ss second
#define int long long int
#define pb push_back
#define mp make_pair... |
// chrono::system_clock::now().time_since_epoch().count()
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define debug(... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int l,r;
cin>>l>>r;
vector<ll> po(r+1,0);
ll ans=0;
for(int g=r;g>=2;g--){
po[g]=r/g-(l-1)/g;
po[g]*=po[g];
for(int g2=2*g;g2<=r;g2+=g){
po[g]-=po[g2];
}
ans+=po[g];
if(g>=l)ans-=r/g*2-1;
}
cout<<an... |
#include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].t... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,x,y;
cin>>a>>b>>x>>y;
int y_=min(2*x,y);
int kyori_=abs(2*b+1-2*a);
cout<<kyori_/2*y_+x<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
#define DOR(i,s,t) for(int i=(s),_t=(t); i>=_t; --i)
#define EOR(i,x) for(int i=Head[x]; ~i; i=Nxt[i])
typedef long double db;
typedef long long ll;
namespace Eddd {
inline char sc() {
return getchar();
static cons... | #include <bits/stdc++.h>
#define yy cout<<"YES"<<endl;
#define nn cout<<"NO"<<endl;
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forc(i, l, r) for (int i = (int)(l); i <= (int)(r); ++i)
#define forr0(i, n) for (int i = (int)(n) - 1; i >= 0; -... |
#include <bits/stdc++.h>
#define f(i,j,k) for(long long i=j;i<k;i++)
#define f2(i,j,k) for(long long i=j;i>=k;i--)
#define ll long long
using namespace std;
const long long mod=1e9+7;
void chmin(int& a, int b){ if(a > b) a = b; }
void chmax(int& a, int b){ if(a < b) a = b; }
int main(){
ll n;
cin>>n;
ll x... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,ans=0;
set<pair<ll,ll>> e,o;
pair<ll,ll> w,x,y,z;
int main(){
cin>>n;
ll a[n],b[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
for(int i=0;i<n;i++){
if(i%2==0)e.insert({a[i]-b[i],i});
else o.insert({a[i]-b[i],i});
}
... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
auto x = (a + b) / 2;
auto y = a - x;
cout << x << " " << y << endl;
} |
//abc192 a
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int X;
cin >> X;
for(int i=1 ; i<=100 ; i++){
int current_coin = X + i;
if(current_coin % 100 == 0){
cout << i << endl;
}
}
}
| #include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin>>n;
if(n==1 )
{
cout<<0;
return 0;
}
if(n==2)
{
cout<<1;
return 0;
}
int l=1;
int r=n-1;
int count=0;
while(l+r==n && r>0 && l>0)
{
l++;
... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#include <iostream>
#include <cassert>
template<long long mod>
class modint{
private:
using T = long long;
T a;
public:
constexpr modint(const long long x = 0) noexcept : a((x%mod+mod)%mod) {}
constexpr T& value() noexcept { retur... | #define IOS ios::sync_with_stdio(false);
#define rep(i, a, n) for(ll i=a;i<=n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define put(x) cout<< x << "\n"
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
ll n, m, t, k, l, r, ans, cnt, sum... |
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::... | //Water Heater
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define rrep(i,x,y) for(ll i=x-1;i>=y;i--)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#de... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(pow(2, n));
for (int i = 0; i < pow(2, n); i++) {
cin >> a.at(i);
}
vector<int> b;
b = a;
vector<int> copy;
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < a.size() / 2; ... | #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 winner(int i0, int k, int n, vector<int> &a){
if(k==0) return i0;
int w1 = winner(i0, k-1, n, a);
int w2 = winner(i0+pow(2,k-1), k-1, n, a);
//int w = a[w1]>a[w... |
#include <bits/stdc++.h>
using namespace std;
// clang-format off
using ll = int64_t;
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto& a : v) cin >> a;
return is;
}
template <class T>
istream& operator>>(istream& is, vector<pair<T, T>>& v) {
for (auto& a : v) cin >> a.first >> ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... |
#include <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 ... | #include <iostream>
#include <cstdio>
#include <cctype>
using namespace std;
template <typename T>
inline T read() {
T x = 0, f = 1; char c = getchar();
while (!isdigit(c)) { if (c == '-') f = - f; c = getchar(); }
while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar();
return x * f;
}
#define lint l... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define f(i,n) for(int i=0;i<n;i++)
#define fs(i,s,n) for(int i=s;i<n;i++)
#define ff first
#define ss second
#define int long long
#define pb push_bac... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const ll INFL = (1ll << 60);
//cout << setprecision(20) <<
int main() {
ll n; cin >> n;
ll pn = pow(2, n);
vector<P> a(pn);
for (int i = 0; i < pn; i++) {
ll _a; cin >> _a;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.