code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000*100+1
#define numberOfSetBits(S) __builtin_popcount(S) // __builtin_popcountl(S) __builtin_popcountll(S)
#define MSET(x,y) memset(x,y,sizeof(x))
#defin... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main(){
int a, b;
cin >> a >> b;
c... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using P = pair<int,int>;
#define F first
#define S seco... | #include <bits/stdc++.h>
#define gc() getchar()
using namespace std;
typedef long long ll;
template <typename T> void rd(T &x){
ll f=1;x=0;char c=gc();
for(;!isdigit(c);c=gc())if(c=='-')f=-1;
for(;isdigit(c);c=gc())x=(x<<1)+(x<<3)+(c^48);
x*=f;
}
int main(){
int a,b;
rd(a),rd(b);
printf("%g\n",1.0*a*b/100);
r... |
#include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define X first
#define Y second
using namespace std;
typedef long long int ll;
typedef vector <int> vi;
typedef pair <int,int> pii;
const int Size=1e6+10;
const int INF=0x3f3f3f3f;
inline int read()
{
int x=0, f=1; char ch=getchar();
while(c... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i < (b);++i)
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
typedef long long ll;
const int MAX_N = 2e5+5;
const int M = 1e9+7;
inline int addM(ll a,ll b){return (a+b)%M;}
inline int mulM(ll a,ll b){return (a*b)%M;}
in... | #include <iostream>
using namespace std;
using ll = long long;
const int kMod = 1e9 + 7;
const int kMaxN = 2e5 + 1;
string s;
int a[kMaxN];
ll c[20][20], dp[kMaxN][20];
ll ans, k, n, fl, b[20];
ll ksm(ll a, ll b) {
ll x = 1;
for (; b; b /= 2, a = a * a % kMod) {
if (b % 2 == 1) {
x = x * a % kMod;
... |
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n;
cin >> n;
double x_0, y_0, xn, yn;
cin >> x_0 >> y_0 >> xn >> yn;
double midp_x = (x_0 + xn) / 2,... | #include<bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using ll = int64_t;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define llrep(i,n) for(ll i=0; i<(ll)n; i++)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()... |
#include<stdio.h>
#include<stdlib.h>
#include<bits/stdc++.h>
//Do DEBUG OR NOT
//#define DEBUG
#ifdef DEBUG
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e :... | #include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
#define all(v) v.begin(), v.end()
const int INF = 1<<30;
const long long LINF = 1LL << 60;
const long long int MOD = 1000000007;
using nam... |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 10) c += (a - 10);
}
cout << c;
return 0;
} | #pragma GCC optimize ("trapv")
#include <bits/stdc++.h>
#include<algorithm>
#include <vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define mod 1000000007
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
// cin >> tt;
// while(tt--){
cin>>n;
string s,ans,t;
map<string,int>m;
... |
#include <bits/stdc++.h>
using namespace std;
// Big two primes
#define X 1001100011100001111ll
#define mod 1000000007
#define int long long
#define ll long long
#define all(a) a.begin(),a.end()
#define sortall(a) sort(all(a))
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> pii;
typedef pair<int, char> pic;
const int N = 82;
int mod = 998244353;
int n, m, a[N];
int main() {
string s;
cin >> s;
map<int, int> ma;
ma[1] = 1, ma[6] = 9;
ma[9] = 6, ma[8] = 8;
ma[0] = 0;
f... | #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; ... |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | #include <bits/stdc++.h>
#define i64 long long
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b) - 1; i >= (a); --i)
using namespace std;
const int M = 998244353;
struct mint {
int x;
mint(int x) : x(x) {}
... |
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define repd(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; } //numの桁数を求める
using Graph = vector<vector<int>>;
int main()
{
int a,b;
cin >> a >> b;
cout << (a+b)/2 << " " << (a-b)/2 << endl;
return 0;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int N, amax, bmin, ans;
amax = 0;
bmin = 1001;
cin >> N;
vector<int> A(N);
vector<int> B(N);
rep(i, N) {
cin >> A[i];
}
rep(i, N) {
cin >> B[i];
}
re... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast","unroll-loops")
#define INF 2147483647
#define ll long long
#define ft first
#define sec second
#define pb push_back
#define pi pair<ll,int>
using namespace std;
ll t,n,a[100001],b[100001];
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <tuple>
using namespace std;
using lint = long long;
void solve() {
int n;
cin >> n;
vector<pair<lint, int>> xs, ys;
for (int i = 0; i < n; ++i) {
lint x, y;
cin >> x >> y;
xs.emplace_back(x, i)... | #include<iostream>
#include<vector>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<string.h>
#include<math.h>
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define F first
#define S second
#define MAX 500005
#define MOD (ll)(1e9+7)
#define IN... |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<string> mt(100001, "");
int N; cin >> N;
for(int i=0; i<N; i++){
string s;
int t;
cin >> s >> t;
mt[t]=s;
}
bool f=false;
for(int i=100000; i>0; i--){
if(mt[i].size()>0){
if(f){
cout << mt[i] << endl;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int MAX = 105;
int x[MAX], y[MAX];
int sq(int x) { return x * x; }
double dis(int i, int j) { return sqrt(1.0 * sq(x[i] - x[j]) + sq(y[i] - y[j])); }
int par[MAX], sz[MAX], n;
void init(int v) {
par[v] = v;
sz[v] = 1;
}
int find(int v) {
retur... |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const int mod = 1000000007;
//const int mod = 998244353;
//MINT
struct mint {
ll x;
mint(ll x=0):x((... | #include <bits/stdc++.h>
#define ss second
#define ll long long
#define mod 1000000007
#define ff first
#define pb push_back
#define pll pair<ll,ll>
#define w(x) ll x; cin>>x; while(x--)
#define ps(x,y) fixed<<setprecision(y)<<x;
#define fo(i, j, k, in) for (ll i=j ; i<k ; i+=in)
#define re(i, j) fo(i, 0, j, 1)
#defin... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.141592653589793238462643383279... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
vector<int> n(6);
int s1, s2;
n[0] = A / 100;
n[1] = (A - n[0] * 100) / 10;
n[2] = A - n[0] * 100 - n[1] * 10;
n[3] = B / 100;
n[4] = (B - n[3] * 100) / 10;
n[5] = B - n[3] * 100 - n[4] * 10;
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define SZ(x) (long long)x.size()
#define endl '\n'
#define FAST \
ios_base::sync_with_stdio(false); \
c... | /*
* @Author: wilson_t
* @Date: 2021-03-23 00:40:16
* @Last Modified by: wilson_t
* @Last Modified time: 2021-03-23 01:28:27
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, long long>;
using pll = pair<long long, long ... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
struct part {
int v, l;
part(int v=0, int l=0): v(v),... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
using ui = unsigned int;
u... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S,s="";
cin>>S;
s+=S.at(1);
s+=S.at(2);
s+=S.at(0);
cout<<s<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
double n;
scanf("%lf",&n);
int k=(int)(n*1.08);
if(k<206)puts("Yay!");
else if(k>206)puts(":(");
else puts("so-so");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n";
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
#define nline cout<<"\n"
#define len(a) sizeof(a)/sizeof(a[0])
template<typename T> void debug(vector<T> &array, bool IsSorted) {if (IsSorted) sort(all(array)); fo... | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long ll;
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
string str;
cin >> str;
int cnt = 0;
for (int i = 0; i < 9; i++)
if (str[i] == 'Z' && str[i + 1] == 'O' && str[i + 2] == 'N' ... |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int n,f[N],c,sz;
pair<int,int>a[N];
int main(){
cin>>n;n*=2;
for(int i=1;i<=n;i++)scanf("%d",&a[i].first),a[i].second=i;
sort(a+1,a+1+n);
for(int i=1;i<=n/2;i++)f[a[i].second]=1;
for(int i=1;i<=n;i++){
if(!sz||c==f[i]){c=f[i];sz++;putchar('(');}
e... | #include<set>
#include<queue>
#include<cmath>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define MAXN 400005
#define ENDL putchar('\n')
#define LL long long
#define DB double
#define lowbit(x) ((-x) & (x))
#define INF 0x3f3f3f3f
LL read() {
LL f = 1,... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begi... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cout << (n - 1) / 100 + 1 << endl;
} |
#include <algorithm>
#include <cassert>
#include <vector>
#include <iostream>
using namespace std;
long long solve(vector<int>& a, vector<int>& b) {
// cerr << "a = "; for (int x : a) cerr << ' ' << x; cerr << endl;
// cerr << "b = ";for (int x : b) cerr << ' ' << x; cerr << endl;
int k = 0;
const int ... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld=lo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
vector<int> ar(n);
for (int &x : ar) {
cin >> x;
}
int ans = 0;
for (int &x : ar) {
if (x > 10) {
ans += x - 10;
}
}
cout << ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1, i ... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using ll = long long;
using ld = long double;
#define mp make_pair
int p = 1e9 + 7;
int mul(int a, int b) {
return (1LL * a * b) % p;
}
int add(int a, int b) {... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#de... |
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
if (n == 3) {
puts("6 10 15");
return 0;
}
std::vector<int> res;
for (int i = 1; i <= 10000 && (int) res.size() < n; i++) {
if (!(i % 2) + !(i % 3) + !(i % 5) >= 2) res.push_back(i);
}
assert((int) res.... | #include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
typedef long long ll;
typedef vector<int> vi;
typedef vector<pair<ll , int> > vpli;
typedef set<char> st;
typedef stack<int> s;
typedef deque<int> dq;
typedef queue<int> q;
int main (){
string... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define FOR(i,a,b) for(int _n(b),i(a);i<_n;i++)
#define REP(i,n) FOR(i,0,n)
void setIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
const int MX = 200005;
int a[MX];
int n;
string s, x;
int M[MX][7];
int can(int p, int m) {
if (p =... |
#include <bits/stdc++.h>
#define ll long long
#define fastboi cin.tie(0) -> sync_with_stdio(0)
using namespace std;
int main (void)
{
fastboi;
ll t;
cin >> t;
cout << 100 - (t%100) <<endl;
return 0;
} | //12252024832524
#include <cstdio>
#include <cstring>
#include <algorithm>
#define TT template<typename T>
using namespace std;
typedef long long LL;
const int MAXN = 100005;
int n,ans;
LL Read()
{
LL x = 0,f = 1;char c = getchar();
while(c > '9' || c < '0'){if(c == '-')f = -1;c = getchar();}
while(c >= '0' && c ... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;
typedef long long int ll;
const int M=100009;
int cnt=0;
int prime[2555];
int flag[M+1];
void prim()
{
for(int i=2;i<=M;i++)
{
if(!flag[i])
{
cnt++;
prime[cnt]=i;
if(cnt==2502)break;
}
for(int ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
/* DEBUGGING */
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=998244353;
signed main()
{
int a,b,c;
cin>>a>>b>>c;
int x=(a*(a+1))/2;
x%=mod;
int y=(b*(b+1))/2;
y%=mod;
int z=(c*(c+1))/2;
z%=mod;
int ans= ( ((x*y)%mod) * z)%mod;
cout<<ans<<"\n";... | #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>
#define speedup ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr),cout.precision(12)
using namespace std;
using ll = long long;
#define sbc __builtin_popcount
#define pb push_back
void solve() {
int n,m;
cin>>n>>m;
vector<vector<pair<int,int>>> v(n+1);
for(int i=0,x,y,z;i<m;++i... | #include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_se... |
#include <iostream>
#include <cmath>
#include <utility>
using namespace std;
#define mp make_pair
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;
char dp[103][103],polje[103];
int modn[103],n;
char igra(char a,char b){
if(a==b) return a;
else if((a=='S' and b=='P') or (a=='P' and... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
const ll INF = ll(1e18);
const ll mod = ll(998244353);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define fin(a) { cout << a << endl; return 0; }
#define debug(a) { cerr << #a << ": " ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>
// Picasso didn't learn to paint by watching lectures
/*
* coder :: ATUL_PANDEY_2608
* >>>... |
#include <cmath>
#include <iostream>
int main() {
long long n;
std::cin >> n;
long long ans {0};
long long k {1};
while (n >= pow(10, k*3)) {
ans += n - pow(10, k*3) + 1;
++k;
}
std::cout << ans << std::endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... |
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define REP(i, L, R) for (int i = L; i < (R); ++i)
#define SZ(x) (int)x.size()
using ll = long long;
using ld = long double;
using P = pair<ll, int>;
template <typename T>
bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 :... | //in dp prefix suffix sum helps..
//map adds a logn factor.Try using 2d array.
#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<stack>
#include <chrono>
#include <random>
#include <iterator>
#include <map>
#include<list>
#include<sstream>
#include <al... |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define fi(i,n) for(int i=0;i<n;i++)
#define f(i, a, b) for(int i=a;i<b;i++)
#define vi vector<int>
#define pb push_back
#define MOD 1000000007
#define pii pair<int, int>
#define ff first
#define ss second
#defin... |
#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma comment(linker, "/stack:200000000")
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define MP make_pair... | #include<bits/stdc++.h>
#define endl '\n'
#define mod 1000000007
typedef long long int ll;
using namespace std;
#define MAX 100005
int arr[13];
string s;
vector<int> v;
void solve(int i)
{
if(i==4)
{
int temp[13];
for(int k=1;k<=9;k++) temp[k]=arr[k];
for(auto k: v)
{
... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int gcd(int a,int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
int power(int x,int y,int p)
{
int res=1;
x=x%p;
while(y>0)
{
if(y&1)
res=(res*x)%p;
y=y>>1;
x=(x*x)%p;
}
return res;
}
struct Matrix{
int a[2][2] = {{0,0},{0,0}};
M... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define LOCAL
#endif
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<ll> vi;
typedef vector<pll> vpll;
const long infl=0x3f3f3f3f3f3f3f3fLL;
const int infi=0x3f3f3f3f;
#define endl '\n'
#define pb p... |
#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define fi first
#define se second
#define ll long long
#define tp top()
#define fr front()
#define vi vect... | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll = long long;
struct Edge
{
ll to;
ll cost;
};
using Graph = vector<vector<ll>>;
using P = pair<ll, ll>;
#define mp make_pair
#define REP(i, n) for (int i = 0; i < (n); +... |
// Generated by 2.3.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
// #include "atcoder/all"
using namespace std;
using i64 = long long;
const long long MOD = 998244353;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
ret... | #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 int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).e... |
#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 mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<ll>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,ll... |
// Problem: E - Mex Min
// Contest: AtCoder - AtCoder Beginner Contest 194
// URL: https://atcoder.jp/contests/abc194/tasks/abc194_e
// Memory Limit: 1024 MB
// Time Limit: 4000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace s... |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int... | #include<iostream>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<d*a-c*b;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long total = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= k; ++j) {
total += i * 100 + j;
}
}
cout << total << endl;
return 0;
}
| //Har Har Mahadev
using namespace std;
#include <bits/stdc++.h>
#define booga cerr << "booga" << endl
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define safai(...) Clearing_out(__VA_ARGS__)
temp... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<string> s(3);
for (int i = 0; i < 3; ++i) {
cin>>s[i];
}
map<char,int> mp;
int cnt=0;
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < s[i].size(); ++j) {
char c=s[i][j];
... | /**
____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector <vector <boo... |
/******************************
Author: jhnah917(Justice_Hui)
g++ -std=c++17 -DLOCAL
******************************/
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define IDX(v, x) (lower_bound(all(v), x) -... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define w(x) int x; cin>>x; while(x--)
#define pi (3.141592653589)
#define mod 1000000007
#define int long long
#define float double
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mii ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
const ll MAXN = 5e6;
ll n, m, k;
ll fac[MAXN];
void init_fac() {
fac[0] = 1;
for (ll i = 1; i < MAXN; i++)
fac[i] = fac[i-1] * i % MOD;
}
ll modpow(ll n, ll x) {
ll res = 1;
while (x) {
if (x &... | //clear adj and visited vector declared globally after each test case
//check for long long overflow
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Incase of close mle change language to c++17 or c++14
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long l... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); (i)++)
#define per(i, n) for (ll i = n - 1; i >= 0; (i)--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define ROF(i, a, b) for (ll i = (b) - 1; i >= (a); i--)
#define ALL(x) std::begin(x), std... | #include<bits/stdc++.h>
using namespace std;
#define N 2005
#define db double
const db eps=1e-3,pi=3.14159265358979323846264337328451;
int n,t,j,i,cnt,tot,a[N],b[N],ans,c[N],d[N];
db alp,ang,dis;
struct dot{db x,y;}dt[N],R[N];
inline bool eq(db aa,db bb){
return aa<bb+eps&&bb<aa+eps;
}
inline bool cmp(dot aa,dot bb){
... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
int n,w;
long long s[N];
int main() {
cin >> n >> w;
for(int i = 1; i <= n; ++i) {
int l,r,p;
cin >> l >> r >> p;
s[l] += p;
s[r] -= p;
}
int flag = 1;
for(int i = 0; i < N; ++i) {
s[i] += s[... | #include<bits/stdc++.h>
#define lld long long int
#define ll long double
#define vlld vector <lld>
#define vll vector <ll>
#define vvlld vector <vlld>
#define vvll vector <vll>
#define plld pair <lld,lld>
#define pll pair <ll,ll>
#define vplld vector <plld>
#define vpll vector <pll>
#define F first
#define S second
#d... |
#include <bits/stdc++.h>
using namespace std;
int main() {
random_device rnd;
mt19937 mt(rnd());
uniform_int_distribution<> rand4(0, 3);
string D = "UDLR";
vector<vector<int>> M = {{-1,0},{1,0},{0,-1},{0,1}};
int si, sj;
cin >> si >> sj;
vector<vector<int>> T(50,vector<int> (50,0));
vector<v... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) { cerr << #a << ": " << a << endl; }
#define endl '\n'
#define fi fir... |
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <un... | #include<bits/stdc++.h>
#define w(x) int x; cin>>x; for(int tc=1;tc<=t;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 <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... | #include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
*/
typedef long long ll;
typedef long double ld;
typedef unsigned... |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<bits/stdc++.h>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<bitset>
#include<unordered_map>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fio ios_base::sync_with_stdio(... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define int int64_t
#define ff first
#define ss second
#define vi vector<int>
#define pii pair<int,int>
#define pb push_back
#define IM LLONG_MAX
#define endl "\n"
#define all(v) v.begin(),v.end()
#define REP(i,a,n) for(in... | #include <vector>
#include <string>
#include <iostream>
#include <sstream>
int main() {
std::string s, foo, buffer;
std::getline(std::cin, s);
std::vector<int> hoge;
std::stringstream ss{s};
while( std::getline(ss, buffer, ' ') ) {
hoge.push_back(std::stoi(buffer));
}
int n = 0;
int k = 0;
for... |
#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>;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(cons... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define all(x) x.begin(), x.end()
#define printVec(vec) {for(auto &x : vec) cout << x <<" "; cout << endl; }
#define printMap(mp) {for(auto &p : mp) cout << p.first <<" " <<p.second <<endl;}
#d... |
//Author : RAJEEV KUMAR
#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
using namespace std;
typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vecto... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cassert>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<list>
#include <cstring>
#include <functional>
#include<unordered_map>
#include<unordered_set>
#include<bitse... |
#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;
typedef long long ll;
typedef double db;
typedef pair <int, int> pin;
const int N = 2e5 + 5;
const ll P = 998244353LL;
const int inf = 1 << 30;
int n, k, tot, cnt, head[N], f[N];
struct Edge {
int to, nxt;
} e[N << 1];
inline void add(int from, int to) {
e[++tot... |
#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 <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <functional>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace s... |
//IQ134高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#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;
#define int long long
// typedef long long int;
int const N = 4e6 + 10, mod = 1e9 + 7;
int fact[N], infact[N];
int n, m, k;
int qmi(int a, int k, int p) {
int res = 1;
while (k) {
if (k & 1) res = res * a % p;
k >>= 1;
a = a * a % p;
}
... |
#include <iostream>
#include <unordered_map>
int main()
{
int N;
std::cin>>N;
std::unordered_map<int,int>m;
for(int i=0;i<N;i++)
{
int A;
std::cin>>A;
m[A%200]++;
}
int64_t res=0;
for(int i=0;i<200;i++)
{
int64_t e=m[i];
res+=e*(e-1)/2;
}
std::cout<<res<<std::endl;
... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define forn(i,n) for(int i=0;i<n;i++)
#define pb emplace_back
#define sz(x) ((int) (x).size())
#define dbg(x) cerr << #x << "->" << x << "\n";
int gcd(int a, int b) {if (b == 0) return a; return gcd(b, a % b);}
int mod = (int)1e9 + 7;
void solve() {... |
#include <bits/stdc++.h>
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);
typedef long long int ll;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define loop(i,a, n) for(ll i = a; i < n; ++i)
ll N=1000000007;
using namespace std;
#include<ext/pb_ds/tree_policy.hpp>
#include<... | #include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
int f = 1; x = 0; char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -1;
for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48);
x *= f;
}
const int N = 4e5 + 5;
int n, m, k, a[N];
s... |
#include <iostream>
#include <string>
#include <vector>
#include <utility>
using ll=long long;
using namespace std;
using P=pair<int,int>;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
//const int mod = 1000000... |
// Problem: D - Powers
// Contest: AtCoder - AtCoder Regular Contest 106
// URL: https://atcoder.jp/contests/arc106/tasks/arc106_d
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
string s;
int a,b,c;
int must[100];
signed main()
{
cin>>s;
for(int i=0;i<=9;i++)
{
if(s[i]=='o') a++;
if(s[i]=='x') b++;
if(s[i]=='?') c++;
}
if(a>4)
{
printf("0");
return 0;
}
else
{
int ans=0;
for(int i=0;i<=9999;i++)
{
... | #include <cstdio>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
ll n;
int main(){
scanf("%lld",&n);
ll x = 0;
for(ll i = 1LL;i <= n;i++){
if((i + 1)*i <= 2*(n + 1)) x = i;
else break;
}
printf("%lld\n",n - x + 1);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<ll,ll> P;
#define mod 1000000007
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x,ll y) {return x/gcd(x,y)*y;}
int main(){
ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(n) for(ll i=0;i<n;++i)
int main(){
int t;
cin >> t;
rep(t){
ll l,r;
cin >> l >> r;
if (2*l > r) cout << 0 << endl;
else cout << (r - 2*l + 2)*(r - 2*l + 1) / 2 << endl;
}
} |
/**
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀... | #include<bits/stdc++.h>
using namespace std;
///******************************** C o n t a i n e r ********************************///
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vii;
typed... |
#include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, b) for (int i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v... |
#include<bits/stdc++.h>
using namespace std;
inline long long mymin(long long x,long long y){return x<y?x:y;}
inline long long mymax(long long x,long long y){return x>y?x:y;}
long long ans,n,k;
inline long long fangan(long long x)
{
long long l=mymax(1,x-n),r=mymin(n,x-1);
return r-l+1;
}
int main()
{... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
#define Rep(i,s,n) for(int i = s-1;i >= (int)(n); i--)
int main() {
int n, k;
cin >> n >> k;
ll ans = 0;
rep(b, 2, 2 * n + 1) {
int a = k + b;
if (a >= 2 && a <= 2 ... |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
char IO;
int rd(){
int num=0;bool f=0;
while(IO=getchar(),IO<48||IO>57)if(IO=='-')f=1;
do num=(num<<1)+(num<<3)+(IO^48);
while(IO=getchar(),IO>=48&&IO<=57);
return f?-num:num;
}
ll A,B,C,D;
int main(){
A=rd(),B=rd(),C=rd(),D=rd();
if(C*D<=B){cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
cin>>A>>B>>C>>D;
cout<<A*D-B*C<<endl;
}
|
//#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
int main() {
int ans, x, y;
cin >> x >> y;
vector<int> input(3);
input[x]++;
input[y]++;
for (int i = 0; i < 3; i++) {
if (input[i] == 0)ans = i;
}
if (x == y) {
an... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define fi first
#define se second
#define pb push_back
#define wzh(x) cerr<<#x<<'='<<x<<endl;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string a,b;
cin>>a>>b;
int c=0,d=0;
for(aut... |
#include <iostream>
int a[100];
int b[100];
int used[200];
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> a[i] >> b[i];
if (a[i] != -1) ++used[a[i] - 1];
if (b[i] != -1) ++used[b[i] - 1];
if (a[i] != -1 and b[i] != -1 and a[i] >= b[i]) {
... | // 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;
int main()
{
long long n;
cin >> n;
long long sum = 0;
for (long long i = 0 ; i < n ; i++)
{
long long a = 0;
long long b = 0;
cin >> a >> b;
sum += ((a + b) * (b - a + 1)) / 2;
}
cout << sum << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define all(x) x.be... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int n;cin>>n;
ll arr[n+3],arr1[n+3];
for(int i=0;i<n;i++)cin>>arr[i];
for(int j=0;j<n;j++)cin>>arr1[j];
ll prev=-1,mx=0;
for(int i=0;i<n;i++)
{
mx=max(mx,arr[i]);
ll k=(arr[i]*arr1[i]);
... | #include <cstdio>
#define rep( i, a, b ) for( int (i) = (a) ; (i) <= (b) ; (i) ++ )
#define per( i, a, b ) for( int (i) = (a) ; (i) >= (b) ; (i) -- )
typedef long long LL;
const int MAXN = 5e5 + 5;
template<typename _T>
void read( _T &x )
{
x = 0;char s = getchar();int f = 1;
while( s > '9' || s < '0' ){if( s == ... |
#include <bits/stdc++.h>
#define For(i,l,r) for (register int i=l; i<=r; i++)
using namespace std;
typedef unsigned long long LL;
typedef signed long long ll;
template <typename T>
inline void read(T &x) {
char c = getchar(); int w = 1; x = 0;
while (!isdigit(c))
(c == '-') && (w = -w), c = getchar();
while (isdig... | #pragma region
#ifdef RYLOCAL
#include "lab.hpp"
#else
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#endif
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define dbg(x) printf("%lld ", (x));
#define LN putchar('\n')
#pragma endregion
int main() {
int a, b, c, ... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
/*
execution in cmd for windows: g++ p1.cpp -op1
p1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
ll ans = -1;
for (int i = 0; i < N; ++i) {
ll A, P, X;
cin >> A >> P >> X;
if (X - A > 0) {
if (ans < 0) {
ans = P;
} else {
ans = min(ans, P);
}
}
}
cout ... |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define mod 1e9 + 7
#define e1 1e-9
#define v vector< long long >
#define vp vector< pair < long long,long long > >
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ft first
#define sd second
#def... | #include <bits/stdc++.h>
using namespace std;
// 2の27乗＝１億３千万
#define rep(i, n, N) for (int i = n; i < (int)(N); i++)
#define ascending(array) sort(array.begin(), array.end());
#define descending(array) sort(array.rbegin(), array.rend());
#define log(name, message) cout << name << " = " << message << endl
#define out(c... |
#include<iostream>
#include<string>
#include<vector>
#include<map>
using namespace std;
char winner(char a, char b){
if(a == b) return a;
int x;
if(a == 'R') x = 1;
else if (a == 'S') x = 2;
else x = 4;
int y;
if(b == 'R') y = 1;
else if (b == 'S') y = 2;
else y = 4;
char res;
... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
int main(){
int n,k;
string s;
cin>>n>>k>>s;
if(n%2 == 1){
s = s+s;
n = n+n;
}
string p = "";
string ans = "";
while(1){
if(k<1){
ans = p;
... |
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define mod 1000000007
#define deb(x) cout << #x << " " << x << "\n";
#define fo(i, n) for(ll i = 0; i < n; i++)
#define Fo(i, k, n) for(ll i = k; i < n; i++)
#define ordered_set tree < ll , ... | #include<bits/stdc++.h>
using namespace std;
string S;
int main(){
cin>>S;
cout<<S.substr(1,3)+S[0]<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define For(i,a,b,c) for(ll i=a;i<b;i+=c)
#define For2(i,a,b,c) for(ll i=a;i>=b;i-=c)
#define vec_ll vector<vector<ll>>
#define vec_pr vector<pair<ll,ll>>
#define p_ll pair<ll,ll>
#define pbk push_back
#define mkpr make_pair
#define fst first
#define snd... | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline int IN(void)
{
int x=0,f=0,c=getchar();while(c<48||c>5... |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 100000000
using namespace std;
//unsigned long long a[(2*100000)+10]={0};
// To compute x^y under modulo m
ull power(ull x, ull y, ull m)
{
if (y == 0)
return 1;
ll p = power(x, y / 2, m) % m;
p = (p * p... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
int n,x;
cin>>n>>x;
x *= 100;
int v... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
cout<<n-a+b<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define LLA(v) (v).rbegin(), (v).rend()
#define SZ(v) (v).size()
#define INT(...) \
... |
#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;
if(A>B){ cout << "Takahashi\n"; return 0; }
if(A<B){ cout << "Aoki\n"; return 0; }
if(C){ cout << "Takahashi\n"; }else{ cout << "Aoki\n"; }
}
| #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
using namespace std;
typedef long long ll;
#define rep(i,N) for(ll (i)=0;(i... |
#include <iostream>
using namespace std;
int main() {
int A,B;
cin >>A>>B;
cout << A*2+100-B;
return 0;
} | //template start
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iterator>
#include <numer... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define LOL cout << '\n';
#define sz(x) ((int)x.size())
#define INF LONG_LONG_MAX
#define NINF LONG_LONG_MIN
#define deb(... | #include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int... |
#include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t){
while(*sdbg != ',') { ce... | #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 fi first
#define se second
#define max Max
#define min Min
#define abs Abs
#define lc (x<<1)
#define rc (x<<1|1)
#define m... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rrep(i,n) for(int i = (n-1);i>=0;--i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF=1<<30;
//const ll INF=1LL<<60;
ll bino... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 10010;
int a[N];
int main() {
cin >> a[0] >>a[1] >> a[2];
sort(a, a + 3);
cout << a[1] + a[2];
return 0;
}
|
// Author Nagendra patel
#include<bits/stdc++.h>
using namespace std;
#include <numeric>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl "\n"
#define int long long int
#define MOD 1000000007
#define INT_BITS 16
#define INF 1e18
#define pi 3.141592
#define watch(x) cout<<(#x)<<"="<<(x)<<"\n... | #include <bits/stdc++.h>
#define ll long long
#define vec vector
using namespace std;
const long long MAXVAL = (long long) 1e18 + 1;
const long long MOD = 1000000007ll;
//const long long MOD = 998244353ll;
const int INF = 1000000001;
long long poww(int x, long long pow) {
if (pow == 0ll ) return 1;
if (pow == 1... |
#include <bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int64_t a=0;a<b;a++)
#define sor(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define ll int64_t
#define mod 1000000007
#define vl vector<int64_t>
int main() {
ll n,ans;
ll s,t;
s=0;
t=0;
ans=0;
cin>>n;
vector<vector... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
for (auto &&[x, y] : p) {
cin >> x >> y;
}
sort(begin(p), end(p));
int ans = 0;
for (auto i = begin(p); i != end(p); ++i) {
for (auto j = begin(p); j != i; ++j) {
... |
#include<bits/stdc++.h>
#ifdef BIZON
#define rr(x) cerr << "\e[1;38;5;172m" << #x << "\e[0m = " << (x) << endl;
#else
#define rr(x) 0;
#define endl '\n'
#endif
#define ALL(c) begin(c), end(c)
#define II(...) __VA_ARGS__; [](auto&...x){(cin>>...>>x);}(__VA_ARGS__);
#define ii(...) int II(__VA_ARGS__)
using namespace ... | //Author: Xzirium
//Time and Date: 17:44:16 18 March 2021
//Optional FAST
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
//Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.... |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
#define GETVEC(v) for(auto& m : v) cin >> m;
using namespace std;
using LLONG ... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int N, M;
int a[MAXN][2];
vector <pair <int, int>> adj[MAXN];
int bio[MAXN], ans[MAXN];
int c[MAXN];
void load() {
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++)
for (int j = 0; j < 2; j++)
scanf("%d", a[i] + j);
for (int i =... |
#include<iostream>
using namespace std;
int main(){
int n,a,b,sum;
scanf("%d%d%d",&n,&a,&b);
sum = (n-a)+b;
printf("%d",sum);
return 0;
} | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | #include<iostream>
#include<algorithm>
using namespace std;
int n,m;
long long a[200010],b[200010],sumq[200010],sumh[200010],ans=1999999999;
int main()
{
int i,now=0;
cin>>n>>m;
for(i=1;i<=n;i++) cin>>a[i];
for(i=1;i<=m;i++) cin>>b[i];
sort(a+1,a+n+1);
sort(b+1,b+m+1);
for(i=2;i<=n;i+... |
#include <stdio.h>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include ... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define pre(i,a,b) for(int i=a;i>=b;i--)
#define N 100005
using namespace std;
char s[N],t[N];
int main(){
scanf("%s",s+1);
int n=strlen(s+1);
rep(i,1,n){
int j=n-i+1;
if(s[i]=='6')t[j]='9';
else if(s[i]=='9')t[j]='6';
else t[j]=s[i];
}
puts(... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
struct edge{
int to,next;
}e[10000];
int n,m,a[30],head[30],cnt,ans=1,res,t,b[30];
bool vis[30];
inline void add(int u,int v){
cnt++;
e[cnt].to=v;
e[cnt].next=head[u];
head[u]=cnt;
}
inline void dfs1(int u){
for(int i=head[u];i;i=e[i].next){
int... | #include <bits/stdc++.h>
#define int long long int
#define ll long long int
#define ld long double
#define getFaster ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define rep(i, init, n) for (int i = init; i < (int)n; i++)
#define rev(i, n, init) for (int i = (int)n; i >= init; i--)
#define MOD1 1e9 + 7
#define MO... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pt;
#define MOD 1000000007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<vector<int> > C(N, vector<int>(N));
for(int i = 0; i < N; i++) {
for(int j = 0; j <... | // b.cpp
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
template <typename T>
void chmin(T& a, T b) {if (b<a) a=b;}
int main() {
int N;
cin >> N;
vector<vector<int>> C(N, vector<int>(N));
int... |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define vec vector
using namespace std;
const ll INF = 1e18;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef LOCAL
// freopen("in1.txt", "r", stdin);
// freopen("in1.txt", "w", stdout);
#endif
int n;
cin >> n... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for(int i=int(n-1);i>=int(0);--i)
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using Vec = vector<T>;
constexpr ll INF = 1010000000000000017;
int main... | #include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int N=110;
int main()
{
string s;
getline(cin,s);
int n=s.size();
for(int i=0;i<n;i++)
{
if(s[i]=='.') break;
cout<<s[i];
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << '=' << x << endl
#define rep(i, b, e) for (int i = b; i <= e; i++)
char s1[512345], s2[512345];
vector<int> a(512345);
vector<int> b(512345);
signed main(void) {
int n, cnt = 0;
cin >> n;
scanf("%s%s", s1 + 1, s2 + 1);
rep (i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<ll> vl;
struct UnionFind {
vector<int> par;
map<int, int> groups;
UnionFind(int n) : par(n) {
rep(i, n) par[i] = i... |
/*
/^--^\
\____/
/ \ _____ _ __ __ ____ _ ____ ____ _____
| || ()_)| |\ \/ /| ===|| |__ / (__` / () \|_ _|
\__ __/ |_| |_|/_/\_\|____... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define x1 gdsfdsf
#define y1 fgdfgdfg
#define endl '\n'
const ll DIM = 2000+7;
ll A[DIM],G[DIM];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n;
cin>>n;
for(ll i = 1;i<=n;++i)cin>>A[i];... |
#include <bits/stdc++.h>
using namespace std;
#define PI pair<int,int>
const int maxm=2e5+5;
int mark[maxm];
int a[maxm];
int b[maxm];
int p[maxm];
int n;
vector<PI>ans;
signed main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
cin>>b[i];
}
for(int i=1;i<=... | #include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll LLINF {1001002003004005006};//ll = 9*LLINF
constexpr int INTINF {1000000000};//int = 2*INTINF
#define rep(i,n) for(in... |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
const int maxn = 5005;
ll sum[maxn];
ll a[maxn];
char s[maxn];
int main()
{
int n;
scanf("%d",&n);
scanf("%s", s + 1);
sum[0] = 0;
for(int i = 1; i <= n; i++)
{
if (s[i] == 'A')... | #include<bits/stdc++.h>
#define pb push_back
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define int long long
#define sz(x) (ll)(x.size())
using namespace std;
const int mod = 1e9+7;
in... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.