code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
#ifdef LILY
#include "Debug.h"
#else
#define var(...) (0)
#define dbg(...) (0)
#endif
using int32 = int;
using int64 = long long;
using namespace std;
class Solution
{
#define int int64
#define sfor(i, n) for (int i = 1; i <= (n); ++i)
#define tfor(i, n) for (int i = 0; i < (n); ++i)
#define I... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
vector<... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = ... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define vi vector<int>
#define ii pair<int,int>
#define all(v) v.begin(),v.end()
#define getunique(v) {v.erase(unique(v.begin(),v.end()),v.end());}
#define pb push_back
#defi... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
#define rep(i,n) for (int i=0;i<(n);++i)
#define REP(i,n) for (int i=1;i<=(n);++i)
#define all(x) x.begin(),x.end()
#define m... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
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) cout << (x) << "\n"
#define cosp(x) ... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define lowbit(x) ((x) & -(x))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr double eps = 1e-8;
constexpr int NINF = 0xc0c0c0c0;
constexpr int INF = 0x3f3f3f3f;
constexpr ll mod = 1e9 + 7;
constexpr ll... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define ll long long
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define RF(type, i, a, b, decr) for (type i = a; i >= (type)(b); i -= (type)(decr))
#define sz(a) sizeof(a)
#define deb(a) cerr ... |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<string> f(int n){
if(n == 1) return vector<string>{"AB"};
vector<string> ans = f(n - 1);
int sz = ans.size();
for(int t = 0; t < sz; ++t){
ans[t] = ans[t] + ans[t];
string s = ans[t];
int siz = s.size... | #include <bits/stdc++.h>
//#include <chrono>
#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
//using... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define ... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
int main(){
ll N;
cin >> N;
set<ll> ans;
ll bk=sqrt(N);
for(ll i=1;i<=bk;i++){
if(N%i == 0){
ans.insert(i);
if(N%(N/i)==0)ans.insert(N/i);
}
}
for(ll i:ans)cout <<... |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR(i,a,b) for(i= a ; i < b ; ++i)
#define rep(i,n) FOR(i,0,n)
#define rev(i,n) for(i=n-1;i>=0;i--)
#define INF INT_MAX
#define pb push_back
#define tc int t;cin>>t;while(t--)
#define mod (i... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
vector<long int> t(0);
int f=2;
for (long int i = 1; i <= sqrt(n); i++)
{
if (n%i==0)
{
t.push_back(i);
if(i!=n/i){
t.push_back(n/i);
}
}
}
sort(t.begin(), t.end());
/*while (f<=n)
{
i... |
//@Author: KeinYukiyoshi
// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se second
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)
#define rep2(i, a, b) for (int i... | #include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
int n;
cin>>n;
string s1,s2,s3;
cin>>s1>>s2>>s3;
for(int i=0;i<n;i++) cout<<"0";
for(int i=0;i<n;i++) cout<<"1";
cout<<"0";
cout<<"\n";
}
int main(){
ios::sync_with... |
#ifdef GCC_VERSION
#include<bits/stdc++.h>
#endif
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <tuple>
#include <algorithm>
#include <functional>
#include <deque>
#include <queue>
#include <cstring>
#include <chrono>
#include <numeric>
#ifdef _DEBUG
... | #include <iostream>
using namespace std;
int main(){
int A, B, C;
cin >> A;
cin >> B;
cin >> C;
if (A == 0 && B > 0) cout << "Aoki";
if (B == 0 && A > 0) cout << "Takahashi";
if (A == 0 && B == 0){
if (C == 0){
cout << "Aoki";
}
else cout << "Takahashi";
}
while (A > 0 && B > 0){
if (C == 0){
A-... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
#define pll pair<ll,ll>
#define pii pair<int ,int>
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vpii vector<pair<int, int>>
#define mems(x,y) memset(x,y,sizeof(x))
#define all(x) (x).begin(),(x).end()
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define rrep(i,a,b) for(ll i=a;i>=b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define PI 3.14159265358979323846
... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const char newl = '\n';
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
te... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplac... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128_t LL;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define F first
#define S second
#define pb push_back
mt19937 rnd;
ll get(int x, int n) {
if (x <= 1) {
return 0;
}
else if (x <... |
#include<bits/stdc++.h>
#define Woody
#define int long long
#define rep(n) for(int i=0;i<n;i++)
#define mp make_pair
#define eb emplace_back
#define F first
#define S second
#ifdef Woody
#define quick ios::sync_with_stdio(0);cin.tie(0);
#else
#define quick
#endif
#define INF INT64_MAX
#define PI 3.14159265
using namesp... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template < typename Iterator >
void dump(Iterator fst, Iterator lst, string const dm = " ")
{ auto it=fst; for ( it!=lst && cout<<to_string(*it++... |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define repl(k,n) for(k=0;k<n;++k)
int main() {
int A, B;
cin >> A >> B;
cout << (A + B) / 2<<"\n";
c... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;
int main(){
int A,B;
cin>>A>>B;
cout << (A+B)/2 << " " << A - (A+B)/2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pairI2;
typedef pair<LL, LL> pairLL2;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<string> VS;
#define shig_for(i, a, b) for(int i = (a); i < (b); ++i)
#define shig_rep(i, n) shig_for(i, ... | # include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define cauto const auto
# define int long long
# define float long double
# define fi first
# define se second
# define mkp make_pair
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=... |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
#define MAX_N 200001
using namespace std;
long long MOD = 1000000007;
struct unionSet{
int pa... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forin(in ,n) for(ll i=0; i<n; 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, n) fo... |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+4;
int vis[N];
int a[N],pos[N],ans[N],cnt;
int main(){
int n;scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&a[i]),pos[a[i]]=i;
for(int i=1;i<=n;++i){
for(int j=pos[i];j>i;--j){
if(vis[j-1]) {puts("-1");return 0;}
... | #include<bits/stdc++.h>
using namespace std;
/**templates**/
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define sull(x) scanf("%llu",&x)
#define sf(x) scanf("%lf",&x)
#def... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using vt = vector<T>;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb p... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b... |
//ๅซใใง ่ปๆปใใใใฆ ็ผใพใถใใ่
ซใใใฆใ
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int , int> pii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1e6 + 10;
const ll mod = 1e9+7;
#define pb push_back
#define endl '\n'
#define dokme... | #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<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<unordered_map>
#include<queue>
#include<deque>
#include<cmath>
#include<bitset>
#include<iomanip>
#include<stack>
#include<map>
#include<tuple>
#define ll long long
using namespace std;
bool ck(int n){
int x = n;
while (x > 0){
... | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
n %= 100;
n = 100-n;
cout << n << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
t... |
#include <cctype>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
long long inv(int a, int p) { return a==1 ? 1 : (1-p*inv(p%a... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... | #pragma warning(disable: 4996)
#include <string>
#include <vector>
#include <iostream>
#include <cstdio>
#include <sstream>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <map>
#include <bitset>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i+... |
# include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define int long long
# define float long double
# define fi first
# define se second
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i,n) for(int i=((int)... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
long long int N;
cin >> N;
string str = to_string(N);
int size = str.size();
if (size % 2 == 0)
{
int num1 = atoi(str.substr(0, size / 2).c_str());
int num2 = atoi(str.substr(size / 2, s... |
#include <bits/stdc++.h>
using namespace std;
#include <ctype.h>
int main(void)
{
char S, T;
cin >> S >> T;
if(S =='Y') {
T = toupper(T);
}
else {
}
cout << T << endl;
return 0;
}
| /* https://codeforces.com/contest/1360/problem/H */
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vpi = vector<pair<int, int>>;
using vpl = v... |
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios_base::sync_with_stdio(false); cin.tie(0);
#define trav(x,a) for (auto& x: a)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define mem(a,v) memset((a)... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
vector <int> dy = {0, 1, 0, -1};
vector <int> dx = {1, 0, -1, 0};
const int INF = 1000000000;
const ll INFLL = 100000000000000000;
long long pow(long long x, long long n) {
l... |
#include <bits/stdc++.h>
#define pb push_back
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
#define INF 3000000000000001 // 3e15
#define ll_max 9000000000000000000
#define PI 3.14159265358979323846L
#define fill(a, n, x) for(int i = 0; i < n; i++) a[i] = x;
#define fast ios_base::sync_with_stdio(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ll n;
cin >> n;
vec... |
#include <bits/stdc++.h>
using namespace std;
template<typename T = int> vector<T> create(size_t n){ return vector<T>(n); }
template<typename T, typename... Args> auto create(size_t n, Args... args){ return vector<decltype(create<T>(args...))>(n, create<T>(args...)); }
int main(){
ios::sync_with_stdio(false);
cin.tie... | #include <iostream>
#include <string>
int main() {
const std::string atcoder = "atcoder";
int T;
std::cin >> T;
for (int t = 0; t < T; ++t) {
std::string S;
std::cin >> S;
if (S > atcoder) {
std::cout << 0 << std::endl;
continue;
}
int index = -1;
for (std::size_t i = 0; i <... |
#include <iostream>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main(void){
long long N,Sum,Ans,count;
cin >> N;
int A[N];
count =1;
Sum =0;
Ans =0;
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A,A+N);
for(int j=0;j<N;j++){
if(A[j]==A[j+1]){
co... | #include<bits/stdc++.h>
using namespace std;
#define PI 3.14159265
#define sqr(x) ((x)*(x))
#define vi vector<int>
#define vll vector<long long>
#define vull vector<unsigned long long>
#define all(v) ((v).begin()), ((v).end())
#define rev(v) ((v).rbegin()), ((v).rend())
#define rep(i, st, en) for(int i = st; i < en; ... |
#include<iostream>
using namespace std;
int main(){
int a,b;cin>>a>>b;
cout<<(a+b)/2<<" "<<a-(a+b)/2;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
int main(){
int a,b; cin>>a>>b;
for(int i=-100; i<=100; ++i){
for(int j=-100; j<=100; ++j){
if(i+j==a && i-j==b){
cout << i <<" ... |
#define _CRT_SECURE_NO_DEPRECATE
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <functional>
#include <cassert>
#include <cctype>
#include <string>
#include <sstream>
#include <bitset>
#include <list>
#include <se... | //F - Valid payments
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <map>
#define ll long long
#define cl(x, y) memset((x), (y), sizeof(x))
#define rep(i, a, b) for(ll i = a; i <= b; i++)
#define per(i, a, b) for(ll i = a; i >= b; i--)
#define de(x) cerr << #x <... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < ... | #include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (... |
#pragma GCC optimize("O3")
// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#defi... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (n-1); i >= 0; i--)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template <class S>S sum(vector<S>& a) {return accumulate(all(a), S(... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f(i,n) for(int i=0;i<n;i++)
#define fp(i,k,n) for(int i=k;i<=n;i++)
#define fr(i,k,n) for(int i=k;i>=n;i--)
#define pb p... |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<map>
#include<set>
#define int long long
#define lowbit(x) (x&(-x))
#define mid ((l+r)>>1)
#define lc (x<<1)
#define rc (x<<1|1)
#define fan(x) (((x-1)^1)+1)
#define max M... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<vector<bool>> a(n + 1, vector<bool>(n + 1, false));
for(int i = 1; i <= m; ++i){
int x, y;
cin >> x >> y;
a[x][y] = true;
a[y][x] = true;
}
const int FULL_MASK = (1 << n) ... |
#include<iostream>
#include<vector>
#include<math.h>
#include<algorithm>
using namespace std;
main()
{
long long int n,i,j;
vector<long long int>v;
cin>>n;
for(i=1;i<=sqrt(n);i++)
{
if(n%i==0 && i*i!=n)
{
v.push_back(i);
v.push_back(n/i);
}
else if(i*i... | #include<iostream>
#include<bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include<climits>
#include <algorithm>
using namespace std;
const long long M = 1e9 + 7;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#define endl "\n"
#define pb p... |
// C - Too Heavy
#include<bits/stdc++.h>
#define forn(i,s,t) for(register int i=(s);i<=(t);++i)
using namespace std;
typedef pair<int, int> pii;
const int N = 2e5+3;
int n, a[N], b[N], p[N], rft[N];
bool vis[N];
int main() {
scanf("%d", &n);
forn(i,1,n) scanf("%d", a+i);
forn(i,1,n) scanf("%d", b+i);
forn(i,1,n) sc... | #import<bits/stdc++.h>
#define endl '\n'
using namespace std;
struct H{int i,x;};
int i,j,k,m,n,u,v,a[200040],b[200040],p[200040],q[200040],x[200040],y[200040];
H w[200040];
int C(H a,H b){return a.x>b.x;}
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
for(;i++<n;)cin>>a[i];
for(i=0;i++<n... |
#include <vector>
#include <iostream>
#define int long long
#define double long double
#define tezz ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
signed main() {
tezz
vector<int> primes;
for (int i = 2; i < 72; i++) {
bool flag = true;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
//cout << setprecision(20) <<
int main() {
ll a, b; cin >> a >> b;
cout << (a + b) / 2 << " " << (a - b) / 2 << endl;
} |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
int fib[10000000];
queue<int> st;
void solve(int n,int top)
{
if(!n)
return;
else
{
while(n<fib[top])
top--;
st.push(top);
solve(n-fib[top],top);
}
}
signed main()
{
cin>>n;
fib[... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define sz(li) (int) (li).size()
#define sum(a) (accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
vector<int> sz;
vector<int> parent;
void make_set(int v) {
parent[v] = v;
sz[v] = 1;
}
int find_set(int v) {
if (v == parent[v])
return v;
else
{
auto par = find_set(parent[v]);
parent[v] = par;
return par;
}
}... | #include<bits/stdc++.h>
using namespace std;
int n, f;
bool used[200002];
vector<int> g[200002];
main(){
cin >> n;
int ans=1;
for(int i=0;i<n;i++)cin>>f,f--,g[i].push_back(f),g[f].push_back(i);
for(int i=0;i<n;i++){
if(used[i])continue;
queue<int>q;
q.push(i);
used[i]=1;
while(!q.empty()){... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rep(i, begin, end) for(int i = begin; i < (int)(end); i++)
#define contains(v, x) (find(all(v), x) != v.end())
template<class T> bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }
template<cla... | //#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>
using namespace std;
using ll = long long int;
using lc = complex<double>;
/* #include<atcoder/all> */
/* using namespace atcoder; */
template<class T>bool chmax(T &a, const T &b) { return (a<b ? (a=b,1) : 0); }
template<class T>bool chmin(T &a, const T &b) { return (a>b ? (a=b,1) :... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
typedef long long ll;
typedef pair<int, int> pii;
#define mp(a, b) make_pair(a, b)
int n;
int a[maxn], b[maxn], c[maxn], d[maxn], p[maxn], tree[maxn];
bool cmpa(const int & i, const int & j)
{
return a[i] == a[j] ? i < j : a[i] < a[j];
}
bool cmp... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,a,b=0,c=0,p=1,ans=999999999999999999;
cin >> n;
while(p<=n){
a=n/p;
c=n%p;
ans=min(ans,a+b+c);
p*=2;
b++;
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll ,ll> pll;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(X) (X).begin(), (X).end()
#define REP(i,x,y) for(ll i = x;i <= y;++i)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... |
#include<bits/stdc++.h>
using namespace std;
#define il inline
#define ri register int
#define ll long long
#define ui unsigned int
il ll read(){
bool f=true;ll x=0;
register char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=false;ch=getchar();}
while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=g... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
#define ld long double;
#define REP(i,n) for(in... |
#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fori(i,init,end) for(ll i=init;i<end;i++)
/*
1. Create an empty list
2. Destroy a list
3. Determine whether a list i... | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 2e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
void solve()
{
char c1,c2,c3;
cin>>c1>>c2>>c3;
if(c1==c2 && c2==c3) cout<<"Won"<<endl;
else cout<<"Lost"<<endl;
}
int main(... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0 ; i < n ; i++)
#define repl(i, n) for (ll i = 0 ; i < n ; i++)
#define Rep(i, n) for (int i = 1 ; i <= n ; i++)
#define Repl(i, n) for (ll i = 1 ; i <= n ; i++)
#define rep3(i, a, n) for (int... |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<ll,ll> Pll;
... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include <stdio.h>
#include <vector>
using namespace std;
const long long mod = 998244353;
vector<long long> mem(2,1);
long long sol(int a) {
return mem[a];
}
long long pow(long long a, long long b) {
long long ans = 1;
long long base = a;
while (b) {
if (b%2) ans = ans * base % mod;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct P {
bool operator<(const P &p) const {
return v > p.v;
}
int v, k;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<array<int, 2>> v(n), u(n);
for (int i = n; --i >=... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
#define int long long
signed main(){
int n;cin>>n;
vector<int> v(n*2);
REP(i,n*2)cin>>v[i];
int sum=0;
for(int p:v)sum+=p;
priority_queue<int,vector<int>,greater<int>> que;
REP(i,n){
... |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include ... | #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define sz 509
#define mod 998244353
#define f first
#define s second
#define pa pair<ll,ll>
ll arr[sz][sz],brr[sz],crr[sz];
std::vector<pa> v;
int main()
{
/// ios_base::sync_with_stdio(0);cin.tie(0);
int test_case=1;
// scanf("%d",&test_case);
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll combination(int n, int k) {
ll answer = 1;
for (int i = 1; i <= k; i++) {
answer *= n--;
answer /= i;
}
return answer;
}
// write your code here!
int main() {
double n;
cin >> n;
ll price = n * 1.08;
if (price < 206)
... | /*Allah Vorosha*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define in insert
#define rev reverse
#define all(x) (x).begin(),(x).end()
#define all2(x) (x).rbegin(),(x).rend()
#define sz(v) (int)v.size()
#define yes cout << "YES\n"
#define no cout << "NO\n";
#define take fo... |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld... | //ulala
//code by 255
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pll pair<ll, ll>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef __gnu_pbds::tree<ll, __gnu_pbds::null_type, less<ll>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_updat... |
// FIRST THINK THEN CODE.
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define cld complex<ld>
#define vl vector<ll>
#defi... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
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 (a>b) { a=b; return 1; } return 0; }
// dijkstra ่ปๆฌ
struct edge {... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in: a)
#define all(x) x.begi... | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A+B >= 15 && B >= 8) {
cout << 1;
}
else if (A+B >= 10 && B >= 3)
{
cout << 2;
}
else if (A+B >= 3)
{
cout << 3;
}
else {
cout << 4;
}
} |
#include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define MAXN 200005
#define REP(temp, init_val, end_val) for (int temp = init_val; temp <= end_val; ++temp)
#define REPR(temp, init_val, end_val) for (int temp = init_val; temp >= end_val; --temp)
using namespace std;
typedef long long ll;
typedef u... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#de... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n;
cin>>n;
int ar[n+5],mark[n+5]={0};
for(int i=0;i<n;i++){
cin>>ar[i];
mark[ar[i]]=1;
}
for(int i=1;i<=n;i++){
if(!mark[i]){
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
} | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
inline int inint(istream& in) {int x; in >> x; return x;}
inline ll inll(istream& in) {ll x; in >> x; retur... |
#include<bits/stdc++.h>
using namespace std;
#define setbits(x) __builtin_popcountll(x)
#define leadzero(x) __builtin_clz(x)
#define trailzero(x) __builtin_ctz(x)
#define mod 1000000007
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
te... | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define bug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int ... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i <= 100000; i *= 10) {
bool flag = false;
for (long long j = i; j < i * 10; j++) {
if (j * (i * 10) + j > N) {
flag = true;
... |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <bitset> //UWAGA - w czasie kompilacji ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
set<pair<ll, ll>> st;
auto consider = [&](ll div) {
ll b = (2 * n / div + div - 1) / 2;
ll a = 2 * n / div - b;
ll tmp = (b - a + 1) * (b + a);
if (tmp ... |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long... | // PIGMEISTERโข //
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define sidha(i,x,n) for(int i=(int)(x);i<(int)(n);++i)
#define ulta(i,x,n) for(int i=(int)(x);i>=(int)(n);--i)
#define sab(a) a.begin(),a.end()
#define bas(a) a.rbegin(),a.rend()
#define test int _;cin>>_... |
#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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... |
// Created at 2021/01/30 20:53
// {TODO}WA, {TODO}min, {TODO}diff
// goal: {TODO}min
#include <bits/stdc++.h>
//#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (lint i = 0, i##_len = n; i < i##_len; i++)
#define rep2(i, n) for (lint... | // Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (ll i = (ll)(n) - 1; i >= 0; ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a)... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int N;
vector<int> G[110];
signed main(){
cin>>N;
for(int i=0;i<N;i++)
for(int j=0;j<N;j++){
char c;
cin>>c;
if(c=='1')G[j].push_back(i);
}
long double ans=0;
for(int i=0;i<N;i++){
vector<bool> B(N,false);
B[i]=... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
const int maxn=2e5+5;
const int mod=1e9+7;
ll dp[105][105][105];
ll a[maxn];
int main(){
int n;
scanf("%d",&n);
ll x;
scanf("%lld",&x);
for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bou... |
// Template
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <tuple>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <array>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep... | #include<bits/stdc++.h>
using namespace std ;
#define MAXN 507
int n ;
int a[ MAXN ] ;
vector < int > v ;
void input ( ) {
scanf ( "%d" , &n ) ;
for ( int i = 1 ; i <= n ; ++ i ) {
scanf ( "%d" , &a[ i ] ) ;
}
v.clear ( ) ;
}
void solve ( ) {
if ( n == 2 ) {
if ( a[ 1 ] == 2 ) {
... |
#include<bits/stdc++.h>
using namespace std;
const int MaxN=1e5;
int A[MaxN+1]={}; // counting_sort
int B[MaxN+1];
int main(){
int N, a, c;
cin>>N;
for(int i=1;i<=N;i+=1){
cin>>a; A[a]+=1;
}
for(int i=1;i<=N;i+=1)
cin>>B[i];
long ans=0;
for(int i=1;i<=N;i+=1){
cin>>c;
ans+= A[ B[c] ] ;
}
cout<<a... | #include <cctype>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <ios>
#include <iostream>
#include <iterator>
#include <string_view>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <climits>
#include <cmath>
#include <sstream>
#inc... |
#include<cstdio>
const int maxh=1505;
const int LEN=(1<<20);
bool lightflag;
int mp[maxh][maxh];
bool tag[maxh][maxh];
int h,w,n,m,a,b,c,d,sum;
inline int nec(){
static char buf[LEN],*p=buf,*e=buf;
if(p==e){
if((e=buf+fread(buf,1,LEN,stdin))==buf)return EOF;
p=buf;
}
return *p++;
}
inlin... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if ... |
#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 - 1; i >= b; i--)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define eb emplace_back
#define pb push_back
#define pvec(a) for (int i = 0; i < a.size(); i++) cout << a[i] << " "; cout << ... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... |
//kapi kapi spaghetti
#include <iostream>
#include <iomanip> //setprecision(12)
#include <algorithm>
#include <functional>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main()
{
ll K;
cin>>K;
... | #include <iostream>
using namespace std;
int main() {
int K;
cin >> K;
int a = 1, b = 1, c = 1, cnt = 0;
while(true) {
if(a * b * c <= K) {
c++;
cnt++;
} else if(a * b <= K) {
c = 1;
b++;
} else if(a <= K) {
b = c =... |
#include <bits/stdc++.h>
#define int long long int
using namespace std;
int power(int x, int y, int p)
{
int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0)
{
// If y is odd, multiply x with result
if (y & 1)
... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(vector<bool>::reference b) { return to_string(int(b)); }
string to_stri... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> S(N + 1, 0);
int mod = 998244353;
int64_t ans = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
for (int i = N - 1; i >= 0; i--) {
S.at(i) = (2 * S.... | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef vector<vector<int>> graph;
#define pu push
#define p... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(auto x: a){
if(x!=k)cout<<x<<' ';
}
} |
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vecto... |
#pragma GCC target("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
#define int ll
#define f first
#define sz(a) ((int)(a).size())
#define s second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vpii vector<pii>
#define eb emplace_b... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t A,B,C;
cin >> A >> B >> C;
constexpr int64_t MOD= 10;
if(B==1){
cout << A% MOD << endl;
return 0;
}
if(B<= MOD and C<= 4){
int64_t B_C= 1;
for(int i=0; i<C; i++){
B_C*= B;
}
int64_t calcA= 1;
for(int i=0; ... | #include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define fi first
#define se second
#define em emplaces
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int i... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool ch... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
void solve() {
int n,k; cin>>n>>k;
int ans=0;
for (int i=1; i<=n; i++) {
ans+=i*k*100;
ans+=k*(k+1)/2;
}
cout<<ans;
return;
}
int main() {
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
void solve(){
int n;
string s;
cin >> n >> s;
i... |
#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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N;
long long int K;
cin >> N >> K;
// div2[i]: i = n1 + n2 ใฎ็ตๅใใๆฐ ( 1<= n1, n2 <= N)
vector<int> div2(2*N+1 , 0);
for (int i = 2; i <= (N + 1); ++i) { div2[i] = i - 1; }
for (int i = (N +... |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int maxn=(5e5)+10;
int n,a[maxn],b[max... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,k,n) for(int i=k;i<=n;i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define newl "\n"
#define vi vector <int>
#define pii pair <int,int>
#define fi first
#define se second
#define st(x) x.begin()
... |
#pragma gcc optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> G(n + 1);
while (m--) {
int u, v;
cin >> u >> v;
G[u].emplace_back(v);
}
int a... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#defi... |
/**
* โโโโโโ โโโโโโโ โโโโโโโ โโโ โโโโโโโโ
* โโโโโโโโโโโโโโโโ โโโโโโโโโโโ โโโโโโโโ
* โโโโโโโโโโโ โโโโโโโโโโโ โโโโโ
* โโโโโโโโโโโ โโโโโโโ โโโ โโโโโ
* โโโ โโโโโโโโโโโโโโ โโโ โโโโโโโโโโโโโโโโ
* โโโ โโโ โโโโโโโโโโ โโโ โโโโโโโโโโโโ... | /* -*- coding: utf-8 -*-
*
* c.cc: C - Solutions
*/
#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<uti... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<complex>
#include<cstdio>
#define initdp(a,b) for(int i=0;i<=a;i++)for(int j=0;j<=b;j++)dp[i][j]=-1;
#define fi first
#define se second
#define pb push_back
#d... |
// Fearless
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define PI (2.0 * acos(0.0))
#define testcase ll T; cin >> T; for (ll tc = 1; tc <= T; tc++)
const long long M = 1e5 + 10, M2 = 1e6 + 10, oo = 1e9 + 7;... | #include<bits/stdc++.h>
using namespace std;
char w[88][88];
int n,k;
string s;
int main(){
cin>>n>>k>>s;
w['R']['R']=w['R']['S']=w['S']['R']='R';
w['S']['S']=w['P']['S']=w['S']['P']='S';
w['P']['P']=w['P']['R']=w['R']['P']='P';
while(k--){
string ss=s+s;
for(int i=0;i<n;i++){
s[i]=w[ss[2*i]][ss[2*i+1]];
... |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | #include<bits/stdc++.h>
#include<iomanip>
using namespace std;
using ll = long long;
void push(vector<pair<ll, ll>> vec, vector<pair<ll, ll>>& aft) {
aft.at(0) = vec.at(0);
aft.at(1) = vec.at(1);
aft.at(2) = vec.at(vec.size() - 2);
aft.at(3) = vec.at(vec.size() - 1);
}
int main() {
int n;
cin >> n;
vector<pair<l... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int(i)=0;i<(n);i++)
#define MAX_V 200001 //10^5
int V,E,depth[MAX_V]; //dใฏ้ๅงใใผใใใใฎ่ท้ข=ๆทฑใ
typedef long long ll;
ll val[MAX_V];
//numใฏ่พบ็ชๅทใๆถใใฆใ่ฏใใใไปใฎ็จ้ใซไฝฟใฃใฆใ่ฏใ
struct edge{
int to,num;
};
vector<edge> G[MAX_V];
struct ED{
int from,to;
};
ED P[MAX_V];... | #include<iostream>
#include<sstream>
#include<iomanip>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<numeric>
#include<queue>
#define rep(i,p) for(long long int i=0;i<p;i++)
#define reep(i,p) for(long long int i=1;i<=p;i++)
#define ll long long
#define ... |
#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){
... | #include<bits/stdc++.h>
#define int long double
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
s.find_by_order(x) xth element in set
x.order_of_key(x) number of eleme... |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define Pii pair<int,int>
#define Pll pair<long long,long long>
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define rept(i,t,n) for(int64_t i = (int64_t)(t);i < (int64_t)(n);i++)
#define all(vec) vec.begin(), vec.end()
int main(){
int64_t n;
int64_t c,m = 0;
cin >> n;
int64_t t = n+1;
rept(i,1,n+2){
c += i;
... |
#include<bits/stdc++.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 insert
#define pqueue... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
const ll mod = 1e9 + 7;
int main(){
ll n;
cin >> n;
ll k=sqrt(n);
for(;k>-1;k++){
ll temp=(k+1)*(k+2)/2;
if(temp>n+1)break;
}
cout << n-(k-1);
}
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define A... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#incl... |
//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<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N; cin >> N;
ll sum = 0;
for( int i=0; i<N; i++){
ll a,b; cin >> a >> b;
sum += ((a+b)*(b-a+1))/2;
}
cout << sum << endl;
} |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define INF LONG_MAX/3
#define DIV 1000000007
//#define DIV 998244353
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... | #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 ... |
#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;
typedef tree<
pair<int, int>,
null_type,
less<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
#define FAST_IO ios_base::sync_with_stdio(... | #include <iostream>
#include<vector>
#include<algorithm>
#include <queue>
#include <cstdio>
#include <numeric>
#include <math.h>
#include <iomanip>
#include <map>
using namespace std;
int main() {
int A, B, C,D,E,F,M;
cin >> A >> B >> C;
D = A + B;
E = B + C;
F = C + A;
M = max(D, E);
M = max(M, F);
cout << ... |
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = j, i##E = k; i <= i##E; i++)
#define R(i, j, k) for(int i = j, i##E = k; i >= i##E; i--)
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int, int>
#define mkp make_pair
using namespace std;
const int N = 2e5 + 7;
const int K =... | //Bismillahirrahmanirrahim
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define int long long
#define endl "\n"
#define pb push_back
#define fio() ios_bas... |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#define miu 100007
using namespace std;
template<class T>inline T mmin(T x, T y) {
return x > y ? y : x;
}
int n;
vector<long long> G[3];
char buf[7];
int flag[3], tp = 0;
const long long inf = 0... | //{{{
#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"
#endif
// clang-fo... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
// your code goes here
ll n;
cin>>n;
ll a[n];
ll aa=0,cc=0,bb=0;
cout<<setprecision(20);
for(int i=0;i<n;i++)
{
cin>>a[i];
a[i]=abs(a[i]);
aa+=a[i];
cc=max(a[i],cc);
bb+=(a[i]*a[i]);
}
//bb=sqrt(bb);
... |
#include <bits/stdc++.h>
#include <numeric>
using namespace std ;
#define ll long long int
#define ull unsigned long long int
#define s(a) scanf("%lld",&a)
#define S(a) scanf("%ull",&a)
#define For(i,n) for(i=0;i<n;i++)
#define FOR(i,n) for(i=1;i<=n;i++)
#define pie acos(-1.0)
//#define cin std::cin
//#define cout std... |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <cctype>
#include <cmath>
#include<deque>
#include<map>
#include<algorithm>
#include<iomanip>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep1(i,begin,end) for(int i = begin; ... | // Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
//... |
//Author: A_S_M_M@sud_P@rvez
#include<bits/stdc++.h>
using namespace std;
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define For(i,n) for(int i=0;i<n;i++)
#define Forn(i,n) for(int i=1;i<=n;i++)
#define Fors(i,s) for(int i=0;i<s.size();i++)
#define all(v) v.begin(),v.end()
#defin... | #include<bits/stdc++.h>
#define MAX 2000
#define MOD 998244353
using namespace std;
vector<int> v[MAX+10];
bool visited[MAX+10];
int ans = 0;
void dfs(int x)
{
visited[x] = true;
++ans;
for(int y:v[x])
{
if(visited[y])
continue;
dfs(y);
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
in... |
//compiledef
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(n);i++)
#define per(i, n) for(int i=(n);i>0;i--)
#define repx(i, n, x) for(int i=(x);i<(n);i++)
#define xper(i, n, x) for(int i=(n);i>(x);i--)
#define pback push_back
//c++def
using namespace std;
typedef long long int ll;
typedef unsigned long lon... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<iomanip>
using namespace std;
int main(void){
int N, X;
cin >> N >> X;
string S;
cin >> S;
int ans = X;
for(int i=0;i<N;i++){
if(S[i] == 'o') ans++;
else{
if(ans != 0) ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000 //10^14
template <typename T>
bool chmax(T &a, const T& b) ... | #include <cstring>
#include <iostream>
using namespace std;
const int maxn = 210;
int n;
int a[maxn], b[maxn];
int p[maxn], w[maxn]; // p[i] = 1 ่ฟ็ตๆขฏ๏ผ p[i] = 2 ๅบ็ตๆขฏ
int f[maxn][maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
for (int i = 1; i <= n; i++) {
if (a[i] !=... |
/* Great things never come from comfort zones,
"whatever the mind of a man can conceive and believe,it can achieve." */
#include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' ... | #include <bits/stdc++.h>
using namespace std;
int main() {
//Nใฎๅ
ฅๅ
long N=0;
cin >> N;
//็บใฎ้ๆจๆดพใจ้ซๆฉๆดพใๅ
ฅๅ
int64_t A[N],B[N],Total[N];
int64_t sum_A = 0;
int64_t sum_B = 0;
//ใใใใใฎๆดพใฎๅ่จ
for(long i=0; i<N; ++i){
cin >> A[i] >> B[i];
Total[i] = 2*A[i] + B[i];
sum_A += A[i];
sum_B += B... |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef
tree<
pair<int,int>,
null_type,
less<pair<int,int>>,
rb_tree_tag,
tr... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using ll = long long;
using P = pair<in... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.