code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo LLONG_MAX
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a + b) / 2 << " " << (a - b) / 2 << endl;
} |
#include <bits/stdc++.h>
#define ll long long
//#include "crocodile.h"
#define pb push_back
#define task "asd"
#define pll pair<ll, ll>
#define pii pair<pll, ll>
#define fi first
#define se second
using namespace std;
const ll mod = 1e9+7;
const ll N = 2e5+5;
const int base = 313;
ll n, k, m, tong, ans, t, a[N], b[N];... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 4e18;
const ll fact_table = 3200008;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> a(12);
for ( int k = 0; k < 12; k++){
cin >> a.at(k);
}
int p = 0;
for ( int i = 0; i < 9; i++){
if (a.at(i) == 'Z' && a.at(i + 1) == 'O'){
if (a.at(i + 2) == 'N' && a.at(i + 3) == 'e'){
p++;
}
}
}
cout << p ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define is_in(x,l,r) ((l) <= (x) && (x) < (r))
#define sz(x) (int)(x).size()
#define rng(a) a.begin(),a.end()
#define rngr(a) a.rbegin(),a.rend()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(i... |
#include <cstdio>
#include <cctype>
#define int long long
#define FOR(i,j,k) for(int i=j; i<=k; ++i)
inline long long read (void) {
long long x = 0; int f = 1, ch = getchar();
while(!isdigit(ch)) { if(ch == '-') f = -f; ch = getchar(); }
while(isdigit(ch)) { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f;
}
... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
//indexed set is using "int" here--------- use ll ...
// typedef tree <int,null_type,less <int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long int ll;
typedef long do... |
#include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(... | #include<bits/stdc++.h>
using namespace std;
//Ҫ��longlong��Ҫ��longlong��Ҫ��longlong��
//���鿪�������鿪�������鿪����
char s[200005];
int main() {
int t, n;
scanf("%d", &t);
while(t--) {
scanf("%d", &n);
scanf("%s", s);
scanf("%s", s);
scanf("%s", s);
for(int i = 1; i <= n; ++i)
putchar('0');
for(int i =... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define FOR(i,a,b,c) for(int i=a;i<b;i+=c)
#define REV(i,a,b,c) for(int i=a;i>=b;i-=c)
#define all(x) x.begin(),x.end()
using ... | #include<bits/stdc++.h>
using namespace std;
#define inf 1001000009
#define infmx 1e18ll
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define IOS ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define all(x) x.begin(),x.end()
///debug
#define wh(x) cerr<<#x<<" is "<<x<<endl... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define PI = 3.14159265359
#define INF 100100100
#define mod 10000007
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
... | #include <bits/stdc++.h>
#define rep(i,N) for(int i=0; i<(N); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> a(N);
rep(i,N) cin >> a.at(i);
int64_t ans=0;
rep(i,N){
if(i != 0){
if(a.at(i) == a.at(i-1)) continue;
}
int64_t now=0;
for(int j=i-1; 0<=j; j--){
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mod 1000000007
int main(){
ios::sync_with_stdio(0);cin.tie(0);
int t;cin >> t;
while(t--){
ll l,r,count;
cin >> l >> r;
if(r/2<l)count =0;
else count = r-l-l+1;
cout << count*... | #include "bits/stdc++.h"
using namespace std;
using LLI = long long;
#define INF 999999999
#define MOD 1000000007
#define FOR(i, s, e) for(LLI i = s, i##_lim = (e); i < i##_lim; i++)
#define FORR(i, s, e) for(LLI i = s-1, i##_lim = (e); i##_lim<=i; i--)
#define REP(i, n) FOR(i,0,n)
#define REPR(i, n) FORR(i,n,0)
#defin... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<int> A(H*W);
for(int i = 0;i < H*W;i++){
cin >> A.at(i);
}
int m = 100;
for(int i = 0;i < H*W;i++){
m = min(m, A.at(i));
}
int ans = 0;
for(int i = 0;i < H*W;i++){
ans += A.at(i) - m;
}... |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define rep2(i,n,i2,n2) for (ll i = 0; i < (n) ; i++) for (ll i2 = 0... | #include <iostream>
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
string p[520];
signed main(){
int mx = 0;
int h,w;
cin >> h >> w;
int ans = 1;
for(int i = 0;i < h;i++){
cin >> p[i];
}
bool able = true;
for(int i = 0;i < w;i++){
int sti = i;
int stj = 0;
bool... |
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using pii = pair<ll, ll>;
#define LOCAL
#ifdef LOCAL
#define trace(...) _f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 0
#endif
template <typename T> void _f(const char* name, T&& arg1){
cerr << na... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); ++i)
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#define DEBUG(x) cerr << '(' << __LINE__ << ") " << #x << ": " << x << endl;
#else
#define DEBUG(x)
#endif
int main() {
vector<int> a(3);
rep(i,3) cin >> a[i];
sort(a.begin(),a.end())... |
# include <bits/stdc++.h>
# 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)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define all(v) v.begin(),v.end()
#define vi vector<int>
#define vi2 vector<vector<int>>
#define vl vector<long long>
#define vl2 vector<vector<long long>>
template <class T> T max... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define print(a) \
for (auto x : a) \
cout << x << " "; \
cout << endl
#define print_upto(a, n) \
for (ll i = 1; i <= n; i++) \
cout << a[i] << " "; \
cout << endl
#define take(a, n) ... | #include<bits/stdc++.h>
#define int long long
#define ld long double
#define fi first
#define se second
#define vll vector<int>
#define pii pair<int,int>
#define pb push_back
#define sz(v) (int)(v).size()
#define inf (int)(1e18)
#define md (int)(1e9+7)
#define all(v) (v).begin(),(v).end()
#define rep(i,a,b) for(int i=a... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
float a=0,b=0;
cin >> a >> b;
float ans=0.0;
if(b!=0)
{
ans=(a*b)/100;
cout << ans << "\n";
}
else
{
cout << "0" << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i=0;i<n;i++)
#define INF 1000000001
#define lINF 1000000000000001
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = ... |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define prl(a) cout << (a) << endl
#define allrange(a) a.begin(),a.end()
bool solve_translated(vector<pair<i... | //Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
class UnionFind {
private:
vector<int> ps;
public:
UnionFind(int n){
ps.resize(n);
for(int i = 0; i < n; i++){
ps[i] = i;
}
}
int find_set(int i){
return ps[i] == i ? i : ps[i] = find_set(ps[i]);
}
void unit... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#define all(x) x.begin(), x.end()
#ifdef _DEBUG
#define disp(x) cout << #x << " : " << x << endl
#else
#define disp(x)
#endif
using namespace std;
using ll = int64_t;
const ll mod = 998244353;
s... |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#include<functional>
#include<iomanip>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int N;cin>>N;
string S[N];
rep(i,N)cin>>S[i];
vector<vector<int>> D(N,vector<int>(N,1e5));
rep(i,N){
rep(j,N){
if(i==j)D[i][j]=0;
if(S[i][j]=='1')D[j][i]=1;
}
}
rep(k,N){
rep(i,N){
... |
#include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const int mod=998244353;
const int mex=55;
#define ll long long
#define test int t;cin>>t;while(t--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,n) for(int i=a;i<n;i++)
#define rfo(i,a,b) for(int i=a;i>=b;i--)
#... | #include<ctime>
#include<cstdio>
#include<cctype>
#define ll long long
using namespace std;
const ll N=55;
const ll HgS=998244353;
ll read() {
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
ll f[N],sz[N],vis[N];
ll n,k,x,jc[N],... |
#include<bits/stdc++.h>
using namespace std;
int n,a[100010];
inline int read()
{
int x=0,w=0;char ch=0;
while(!isdigit(ch)){w|=ch=='-';ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return w?-x:x;
}
int gcd(int N,int M)
{while(N^=M^=N^=M%=N);return M;}
int main()
{
n=read();
for(int i=1... | #include <iostream>
using namespace std;
const int kMaxN = 21;
int l[kMaxN][kMaxN], a[kMaxN], b[kMaxN];
int n, m, x, y, t, c;
long long ans = 1;
void S(int x) {
if (b[x]) {
return;
}
a[++t] = x;
b[x] = 1;
for (int i = 1; i <= n; i++) {
if (l[x][i]) {
S(i);
}
}
}
void P(int x) {
if (... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXS = 5e4 + 7;
#define FASTIO {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
#define f(i,n) for(int i = 1 ; i <= N ; i ++)
#define f0(i,n) for(int i = 0 ; i < N ; i ++)
int main(){
FASTIO
int T;
T = 1;
//cin >> T;
while... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF (int)1e9
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
//
#define FOR(i, a, b, in) for (int i=a ; i<(b) ; i+=in)
#define RFOR(i, a, b, in) for (int i=a-1 ; i>=(b) ; i-=in)
#define REP(i, a, b) FOR(i, a, b, 1)
#define RR... |
#include "bits/stdc++.h"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m =0, n = 0, p = 0, q = 0, mod=998244353;
string s;
char moji;
cin >> a;
n=0;
for(int i=1;n<a;i*=2)
{
m++;
for(int j... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N,1);
int i,j;
for(i=1;i<N;i++) {
for(j=1;j*j<=i+1;j++) {
if((i+1)%j == 0) {
A[i] = max(A[i],max(A[j-1],A[(i+1)/j-1]));
}
}
A[i]++;
}
for(i=0;i<N;i++)cout << A[i] << " ";
... |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const long long INF = 1LL <<60;
... | /*
GNU G++ compiler
Author-Ajay Raj Singh
while(alive)
{
eat();
sleep();
code();
}
*/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
//#include<boost/multiprecision/cpp.hpp>
//#include<boots/algorithms/string.hpp>
#define ll long long int
#define pii ... |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define f(x, m) for(auto x : m)
#define cpu() ios::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
const int maxn = 200000;
ll mod = INF;
int main(){
string s;
int n,x;
cin >> n>>x;
rep(i,n){
char c;
cin >> c;
if(c=='o'){... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n';
#define all(x) (x).begin(),(x).end()
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = i + 1;
}
sort(begin(a), end(a));
string ans = "Yes";
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
ans = "No";
break;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a) ;i<(b) ;i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0 ;i<(n) ;i++)
#define RREP(i,n) for (int i=(n)-1;i>=0 ;i--)
#define EACH(i,a,b) for (int i=(a) ;i<=(b);i++)
#define REACH(i,a,... | #include <cstdio>
const int maxn = 1.5e6+5;
inline int min(int a,int b){return a<b?a:b;}
int n,m,a[maxn],cnt[maxn],mex[maxn<<2],ans=1919810;
void build(int k,int l,int r){
if(l == r)return mex[k]=l,void();
int mid = l+r>>1;
build(k<<1,l,mid),build(k<<1|1,mid+1,r),mex[k] = min(mex[k<<1],mex[k<<1|1]);
}
void insert(in... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int h, w;
bool used[16][16];
ll dfs(int i, int j, int a, int b){
if(j>=w) j=0, i++;
if(i==h) retur... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP... |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#inclu... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <functional>
#include <numeric... |
// #pragma GCC optimize(3,"Ofast","inline")
// #pragma GCC optimize(2)
// #pragma GCC optimize("-Ofast","-funroll-all-loops")
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <string>
#include <iostream>... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head;... |
//* Jai shree Ram
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define lld long double
#define ll long long
#define FOR(... | #include<bits/stdc++.h>
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+(ch^48);ch=getchar();}
return x*f;
}
long double a,b;
int main()
{
cin>>a>>b;
cout<<a*b*0.01;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operat... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using pii = pair<int, int>;
int main() {
cin.tie(0); ios::sync_with_stdio(0);
LL n, p; cin >> n >> p;
if (p == 2) {
cout << (n==1 ? 1 : 0) << endl;
return 0;
}
LL res = 1, top = n-1, base = p-2, mod = 1e9+7;
whi... |
#include<iostream>
#include<cstdio>
#include<cstring>
typedef long long ll;
typedef unsigned un;
typedef std::pair<int,int> pii;
typedef std::pair<ll,ll> pll;
ll read()
{
ll f=1,x=0;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9')x=x*10+(c-'0'),c=getchar();
return f*x;
}
ll m... | // Coder: @SumitRaut
#include <bits/stdc++.h>
#define speedup ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr),cout.precision(16)
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_ta... |
/*---------------------------------------
BISMILLAHIR RAHMANIR RAHIM
AUTHOR : Md. Sajjat Hossen
TIME : 20-March,2021 10:10:41 PM
----------------------------------------*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespa... | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <functional>
#include <utility>
#include <tuple>
#include <vector>
#include <string>
... |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define u64 uint64_t
#define ll long long
#define endl "\n"
#define PI acos(-1)
#define fi first
#define si second
#define mkp mak... | #define TO_BE_SUBMITTED
#include <bits/stdc++.h>
// #include <atcoder/fenwicktree>
// #include <atcoder/segtree>
// #include <atcoder/lazysegtree>
// #include <atcoder/string>
// #include <atcoder/math>
// #include <atcoder/convolution>
// #include <atcoder/modint>
// #include <atcoder/dsu>
// #include <atcoder/maxflow... |
#include<bits/stdc++.h>
using namespace std;
long const mod = 1e9+7;
int main(){
long n,m;
cin >> n >> m;
vector<long>h(n);
vector<long>w(m);
for(int i=0;i<n;i++)cin >> h[i];
for(int i=0;i<m;i++)cin >> w[i];
sort(h.begin(),h.end());
sort(w.begin(),w.end());
vector<long>guki(n);
... | #include <bits/stdc++.h>
using namespace std;
const long long maxn = 2e5 + 10;
long long n, m, Num, a[maxn], b[maxn], cnt[maxn * 2], lstt[maxn * 2], ans = 1e18;
struct My {
long long val, pos, kkk;
inline My() {}
inline My(long long val, long long pos, long long kkk) : val(val), pos(pos), kkk(kkk) {}
} q[maxn * 2];
... |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
LL n;
LL F[91];
vector<int> seq;
vector<int> ans;
int main()
{
cin>>n;
F[1]=F[2]=1;
for(int i=3;i<=90;i++)
F[i]=F[i-1]+F[i-2];
for(int i=90;i>=1;i--)
if(n>=F[i]) n-=F[i],seq.pb(1);
else if(seq.size()) seq.pb(0);
reverse(... | //GIVE ME AC!!!!!!!!!!!!!!!!!
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define ll int
#define ld long double
#define floatset() fixed<<setprecision(15)
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
#define rep(i, s, n) for (... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> A(N),B(N);
for(int i=0;i<N;i++) cin >> A[i];
for(int i=0;i<N;i++) cin >> B[i];
long long Amax=0;
priority_queue<long long> Q;
for(int i=0;i<N;i++){
Amax = max(Amax,A[i]);
Q.push(Amax * B[i]);
... | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize("O2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
////
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <utility>
#define all(x) (x).begin(), (x).end()
#define allp(x) (x)->begin(), (x)->end... |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr LL mod = 998244353;
constexpr int maxn = 200000 + 1;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, K;
cin >> N >> K;
vector<vector<int>> G(N + 1);
for(int i = 1, u, v; i < N; i += 1){
cin >>... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto& e : a)
#ifdef LOCAL
#define logv(a) {cerr << #a << " = "; fore(e, a) {cerr << e <... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef std::vector<long long> vll;
typedef std::vector<std::vector<long long>> vvll;
typedef std::vector<bool> vb;
typedef std::vector<std::vector<bool>> vvb;
typedef std::vector<string> vstr;
typedef std::pair<long long, long long> pll;
#define INF ... | #include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) ... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main ()
{
string s[3];
int per[10];
set<char> sc;
rep(i,3){
cin>>s[i];
rep(j,s[i].length()){
sc.insert(s[i][j]);
}
}
if (sc.size()>10) {
cout<< "UNSOLVABLE";
return 0;
}
iota (per,per+10,0);
map<char,int> ... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// using cint = cpp_int;
#define fastio \
std::cin.tie(nullptr); \
std::ios::sync_with_stdio(false);
using ll = long long;
using ld = long double;
#define... |
// main.cpp
// ABC182F
#include <iostream>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main(int argc, const char * argv[]) {
int n;
cin>>n; // コインの種類数、コインが１円だけの時、払い方は１通り
if(n==1){
... | #include<bits/stdc++.h>
using namespace std;
#define eps 1e-10
#define inf 0x3f3f3f3f
#define rep(i,l,r) for(int i=l;i<r;i++)
#define rrep(i,r,l) for(int i=r-1;i>=l;i--)
typedef long long ll;
int n;
ll x,a[55],b[55];
map<ll,int> v;
int main()
{
scanf("%d%lld",&n,&x);
rep(i,0,n) scanf("%lld",&a[i]);
rep(i,0,n-1) b[i... |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long
#define max_value 0x3f3f3f
#define all(v) v.begin(),v.end()
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
using namespa... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,x,n) for(int i=x;i<=n;i++)
#define all(v) v.begin(),v.end()
#define foreach(c,itr) for(__typeof(c.begin()) itr=c.begin();itr!=c.end();itr++)
#define p_b push_back
#define pii pair<int,int>
#define fr first
#define sc secon... |
#include <bits/stdc++.h>
using namespace std;
#pragma optimize("-O3")
#define int long long int
#define f first
#define s second
#define pb push_back
#define endl '\n'
const int N=3e5+5;
int cnt[N];
main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin>>n>>k;
for(int i=0; i<n; i++)... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
constexpr int64 P = 1000000007;
struct FiniteField {
private:
int64 x;
public:
FiniteField(int64 raw_x) : x(raw_x) {
if (x >= P || x < 0) {
x %= P;
if (x < 0) x += P;
}
}
FiniteField() : x(0) {}
i... |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <climits>
#inclu... | //Author: master19
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
#define mod 1000000007LL // fixed...
#define modd... |
#include <bits/stdc++.h>
#include<iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int64_t N, a, b;
vector<int64_t> square_number;
cin >> N;
for(a = 2; N >= pow(a, 2); a++){
for(b = 2; N >= pow(a, b); b++){
square_number.push_back(pow(a, b));
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i =0;i<(int)(n);i++)
#define endl '\n'
typedef pair<int,int> P;
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
set<string> s1;
set<string> s2;
int n;
cin >> n;
string ans = "sa... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
mt19937 rng(std::chrono::duration_cast<std::chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count());
#define mp make_pair
#define pb push_back
#define F first
#define S second
const int N=200005;
#define M 1000000007
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(void){
long long n,m,k;
cin>>n>>m>>k;
vector<long long> data(2000010,0),datac(2000010,0);
if(n>m+k){
cout<<0<<endl;
return 0;
}
set<ll> sosuu;
for(ll i=2;i<2000010;i++){
sosuu.insert(i);
}... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
int main(){
int n;
cin >> n;
string s;
cin >> s;
vector<int> sumA(n+1,0);
vector<int> sumG(n+1,0);
vector... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <tuple>
#include <utility>
#include <unordered_set>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define reps(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
const int MOD = 1000000007;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,y,res;
map<ll,ll>mp; //将a变成b需要的步数
ll dfs(ll k){
if(k<=x) return x-k; //-1 使x变小
if(mp[k]) return mp[k];
ll cnt=k-x; //k>x
if(!(k&1)) cnt=min(cnt,dfs(k/2)+1); //1步 *2的操作
else cnt=min(cnt,min(dfs... | #include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <functional>
#include <utility>
#include <tuple>
#include <numeric>
#include <queue>
#include <cstring... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,i=0,j=0;
double b,s=0,y=100;
cin>>a>>b;
int c[a],d[a];
for(i=0;i<a;i++){
cin>>c[i];
cin>>d[i];
}
for(i=0;i<a;i++)
{
s+=c[i]*d[i];
if(s>b*y){
j=1;
cout<<i+1<<endl;
break;
}
}
i... | #include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a),(i##i)=(b);i<=(i##i);++i)
#define Rep(i,n) for(int i=0,(i##i)=(n);i<(i##i);++i)
#define Fodn(i,a,b) for(int i=(a),(i##i)=(b);i>=(i##i);--i)
#define pln puts("")
#define il inline
#define ff first
#define ss second
using LL=long long;using u32... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
long long int t,n,i,x,mx,mn,f,j,s,r,y;
cin>>n;
vector<long long int>v(402);
for(i=0;i<n;i++)
{
cin>>x;
v[x+200]++;
}
s=0;
for(i=0;i<400;i++)
{
for(j=i;... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> II;
const int MAXN = 500 + 10;
int n, c[MAXN][MAXN];
int a[MAXN];
int b[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
scanf("%d", &c[i][j]);
... |
#include <bits/stdc++.h> //yaad rkhne layak baatein
#include <bits/stdc++.h> // bool found = false use it to find some number after the given number with some cond.
// while (!found)
#include <iostream> // freq.table-> int freq[26] = {0}; for (ll i = 0; i < s1.length(); i++) freq[s1[i] - '... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPE(i,l,n) for(ll i=l;i<=ll(n);i++)
#define FORA(i,I) for(const auto& i:I)
#define ALL(v) v.begin(),v.end()
#define UQ(v) v.erase(unique(ALL(v)), v.end())
#define ACM(v) accumulate(ALL(v), 0)
#define P(... |
#include<bits/stdc++.h>
#define ri register int
#define ll long long
using namespace std;
inline int rd(){
int res = 0,f = 0;
char ch = getchar();
for(;!isdigit(ch);ch = getchar()) if(ch == '-') f = 1;
for(;isdigit(ch);ch = getchar()) res = (res<<3) + (res<<1) + ch - 48;
return f ? -res : res;
}
int main(){
int n... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
... |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll n,m,ans,pw[5005][5005];
int main()
{
cin>>n>>m;
pw[0][0]=1;
for(int i=1;i<=m;i++)
{
pw[i][0]=1;
for(int j=1;j<=n;j++)
pw[i][j]=(pw[i][j-1]*i)%mod;
}
ans=n;
for(int i=1;... |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... | /*
"An anomaly, I'm Muhammad Ali
Cause I know one day I'm gonna be the"
- Greatest, Eminem
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int,int> pi;
typedef pair<lld,lld> pl;
typedef pair<int,lld> pil;
typedef pair<lld,int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef vector... | #include<bits/stdc++.h>
using namespace std;
const int maxn=2020;
int n,m;
int fa[maxn];
int fnd(int x)
{
if(fa[x]==x)
{
return x;
}
return fa[x]=fnd(fa[x]);
}
void merge(int x,int y)
{
fa[fnd(x)]=fnd(y);
}
set<int> s1,s2;
int main()
{
cin>>n>>m;
for(int i=1;i<=n+m;i++)
{
fa[i]=i;
}
merge(1,n);
merge(1,n... |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,char>> adj[1000];
bool vis[1000][1000];
int best[1000][1000];
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
best[i][j] = 1e9;
}
}
while (m... | #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 1005
using namespace std;
int n,m,v[N][N],vis[N][N],ans=0x7fffffff;
vector<int>c[N][26];
struct node{
int x,y,val;
node(int X=0,int Y=0,int V=0){x=X;y=Y;val=V;}
bool operator<(const node o)const{return... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <map> //http://vivi.dyndns.org/tech/cpp/map.html
#include <set> //http://vivi.dyndns.org/tech/cpp/set.html
#include <vector>
#include <deque>
#include <queue>
#include <numeric> //gcd,lcm c++17
#include <tuple>
#include <iomanip> //set... | //Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd(a,b) __gcd(a,b)
#define endl '\n'
const int N=3e5+10;
const int inf=1e9;
const int mod=1e9+7;
int main(int argc, char const *argv[])
{
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freope... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
const int mxn = 1e3+10;
const int mod = 998244353;
int pa[2*mxn], sz[2*mxn], h ,w;
string mt[mxn];
int find(int v) {
if(v==pa[v]) return v;
return pa[v] = find(pa[v]);
}
void unite(int a, int b) {
a = find(a); b = find(b);
if(a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
template<typename T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } else return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } else return f... |
#include <bits/stdc++.h>
using namespace std;
void dfs(int node, int f, auto& g, auto& seen, auto& sol, auto& edges) {
seen[node] = 1;
int n = g.size();
for (int v = 0; v < n; v += 1) {
if (g[node][v] == 0)
continue;
if (v == f)
continue;
int ind = g[node][... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define pb push_back
#define em emplace_back
#define ... |
#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(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(v) v.begin(),v.end()
#define vi vector<int>
#define ff first
#define ss second
#define ii pair<int,int>
#define vii vect... | #include <bits/stdc++.h>
#define endl "\n"
#define rep(i, n) for(int i = 0; i < int(n); i++)
#define rep2(i, s, n) for(int i = (s); i < int(n); i++)
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ipair;
typedef pair... |
/*
@uthor: Amit Kumar
user -->GitHub: drviruses ; CodeChef: dr_virus_ ; Codeforces,AtCoder,Hackerearth,Hakerrank: dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//#def... | //------------ヘッダーインクルード------------
#include <stdio.h>
#include <cmath>
#include <stdarg.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
//#include <pair>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
//------------型マクロ定義--------... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size()... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
long... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
#define per(i,n) for(ll (i)=(n)-1;(i)>=0;--(i))
#ifdef LOCAL
#define debu... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... |
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define swap(a,b) (a^=b^=a^=b)
#define ll long long int
#define ull unsigned long long int
#define uint unsigned int
#define format(a) memset(a,0,sizeof(a))
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define dec(x,y,z) for(int x=y;x>=z;x--)
#define mst(x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main(){
string s;
cin >> s;
string t;
string ans;
bool h = false;
rep(i, s.size()){
if (s[i] == 'R') h = !h;
else{
if (!h) t.push_back(s[i]);
else t.insert(t.... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define vll vector... | // Never gonna give you up
// Never gonna let you down
// Never gonna run around and desert you
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"... |
#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<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
int main() {
ll N, W;
cin >> N >> W;
vector<ll> imos(2 * 1e5 + 1000);
REP(i, N) {
int s, t, p;
cin >> s >> t ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, W;
cin >> N >> W;
vector<int> S(N), T(N);
vector<ll> P(N);
vector<ll> voldif(200001);
for (int i = 0; i < N; i++) {
int s, t, p;
cin >> s >> t >> p;
voldif[s] += p;
voldif[t] -= p;
}
string ans = "Ye... |
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int n;
int a[maxn];
int t;
void solve() {
cin>>n;
for(int i=1 ; i<=n ; i++) cin>>a[i];
bool bruh=false;
if(n%2==1) cout<<"Second\n";
else {
sort(a+1,a+1+n);
int cnt=0;
for(int i=2 ; i<=n ; i+=2) {
... | #include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+1000;
int n,q,c[maxn],fa[maxn];
map<int,int> a[maxn];
void read(int &x)
{
char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar()) if(ch=='-') ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar()); if(ok) x=-x;
}
int getfa(int x)
{
if(fa[x]==x... |
#include<bits/stdc++.h>
#define lint long long int
#define rep(i,n) for(int i=0;i<int(n);i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define arep(i,a,n) for(int i=a;i<n;i++)
#define sort(a) sort(a.begin(),a.end())
#define reverse(a) reverse(a.begin(),a.end())
#define fill(a,x) fill(a.begin(),a.end(),x)
#define eb(dat... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 105;
int k,ans;
char ch[MAXN];
inline int dfs(int sum,int x,int cnt)
{
if(sum % 3 == 0 && sum > 0)
return cnt;
if(x > k)
return 0x3f3f3f3f;
return min(dfs(sum - ch[x] + '0',x+1,cnt+1),dfs(sum,x+1,cn... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t; using Vll =vector<ll>; using VVll =vector<vector<ll>>;
template <class T> using Vec = vector<T>; template <class T> using VVec = vector<vector<T>>;
#define INF 9223372036854775807LL/2
void Z(ll i=-1){ if(i==-1)cout<<"Test"<<endl; else cout<<"Test"<<i<<e... | #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 endl '\n'
#define int long long int
#define rep(i, a, b) for (int i = a; i < b; i++)
#define revrep(i, a, b) for (int i = a; i >= b; i--)
#define pb push_bac... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
#define endl '\n'
#define lowbit(x) (x & -x)
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define ck(x) (x >= mod ? x - mod : x)
#define inf 0x3f3f3f3f
#define eps 1e-6
#define maxn 150001... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
long long gcd(long long x,long long y){return y?gcd(y,x%y):x;}
int lcm(int x,int y){return x/gcd(x,y)*y;}
int main()
{
int n;
long long temp=0,ans=1;
cin>>n;
for(int i=2;i<=n;i++)
{ ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//const ll INF = numeric_limits<ll>::max() / 4;
//const int INF = numeric_limits<int>::max() / 4;
int main() {
// ll N;
string S;
cin >> S;
bool f = true;
string s = "ZONe";
int c = 0;
while(f){
int p = S.fin... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x, ans;
while (cin >> n) {
ans = 0;
while (n--) {
cin >> x;
ans += x > 10 ? x - 10 : 0;
}
cout << ans << '\n';
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int followerNum;
int followNum;
cin >> followerNum >> followNum;
int followMax = 2*followerNum + 100;
int availableFollow = followMax - followNum;
cout << availableFollow << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define f(i,n) for(int i=0; i<n; ++i)
#define fi(i,st,n) for(int i=st; i<=n; ++i)
#define veci vector<int>
#define vecp vector<pair<int,int> >
#define vecl vector<ll>
int prime[100000+10];
ll lcm(ll ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n;
cin >> n;
vector < int > a((int)(1 << n) + 1), last, win;
for (int i = 1; i <= (1 << n); i++) {
cin >> a[i];
last.push_back(i);
}
while(last.siz... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c... | #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 <cstdio>
#include <iostream>
#include <algorithm>
long long B = 10;
using namespace std;
long long exponent(long long r, long long base) {
long long sum = 1;
for (int i = 1; i <= r; i++) {
sum *= base;
}
return sum;
}
int main() {
long long N;
scanf("%lld", &N);
int digit... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <iterator>
#include <stack>
#include <queue>
#include <functional>
#include <map>
using namespace std;
#define ll long long
#define double long double
#define vi vector<int>
#define vvi vector<vi>
#define all(x) (x).... |
#include <bits/stdc++.h>
using namespace std;
#define TC 0
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define deb(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
template <typename T>
vector<T> readArr(int n) {
vector <T> v(n);
for (auto &it : v)
cin >> ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#d... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#... | #include<bits/stdc++.h>
using namespace std;
using ll = long long; using ull = unsigned long long;
using vi = vector<int>; using vll = vector<long long>; using vs = vector<string>;
using vvi = vector<vector<int>>; using vvll = vector<vector<long long>>;
using pii = pair<int,int>; using pll = pair<ll,ll>;
template<typen... |
#include<bits/stdc++.h>
#define N 200005
#define Mod 998244353
#define MOD(x) (x>=Mod)&&(x-=Mod)
#define Ms(a,b) memset(a,b,sizeof a)
#define db(x) cerr<<#x<<"="<<x<<endl;
#define db2(x,y) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<endl;
#define db3(x,y,z) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<endl;
using namespa... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... |
#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, con... | #include<cstdio>
#include<vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
namespace Elaina{
// #define NDEBUG
#include<cassert>
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define drep(i, l, r) for(int i=(l), i##_end_=(r); i>... |
#include<bits/stdc++.h>
#define print(x) cout << (#x) << ": " << (x) << endl
#define p1d(x) cout << (#x) << ": ["; for(auto& zz: x) cout << zz << " "; cout << "]\n"
#define p2d(x) cout << (#x) << ": \n["; for(auto& vec: x) {for(auto& v: vec) cout << v << " "; cout << ",\n";}
#define p2s(x) cout << (#x) << ": ["; for(au... | #include<bits/stdc++.h>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<long long int> vlli;
typedef pair<int,int> pii;
typedef pair<long long int,long long int> plli;
typedef vector< vi > vvi ;
typedef vector< vlli > vvlli ;
... |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_... | #include<bits/stdc++.h>
using namespace std;
int main() {
int k;
long n;
cin >> n >> k;
for (int i = 0; i < k; i++) {
if (n % 200 == 0)n /= 200;
else n = n * 1000 + 200;
}
cout << n << endl;
return 0;
} |
#ifdef _LOCAL
#define _GLIBCXX_DEBUG
#endif
#ifdef _DEBUG
#define bug(x) cout<<'['<<#x<<'='<<x<<']'<<"\n";
#else
#define bug(x)
#endif
#include <bits/stdc++.h>
using namespace std;
#pragma region macros
using str=string;
using ll=long long;
using ld=long double;
using vl=vector<ll>;
using vc=vector<char>;
using vb=... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <climits>
#include <algorithm>
#include <queue>
#include <functional>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<int> vec_i;
typedef vector<vector<int>> vv_i;
typedef vector<pair<int, int>> vec_P;
#define REP(i, n) for... |
/*Bismillahir Rahmanir Rahim*/
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define ff first
#define ss second
#define ll long long int
#define dd double
#define pb push_back
#define mp make_pair
#define pr pair<ll,ll>
#define pqmx priority_queue<l... | #include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n... |
//************ || MD. SAJID ALAM CHOWDHURY || *************//
//**************** || 22-May-2021(Sat) || *****************//
//******************** || 18:40:18 || *********************//
#include<bits/stdc++.h>
using namespace std;
//********************* || DEFINES || *********************//
#define BOOST ... | # include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
char s[5000];
scanf("%d %s", &n, s);
vector<int> a(n+1,0), t(n+1,0), c(n+1,0), g(n+1,0);
for(int i=1;i<=n;i++) {
a[i] = a[i-1];
t[i] = t[i-1];
c[i] = c[i-1];
g[i] = g[i-1];
if(s[i-1] == 'A') { a[i]++; }
else i... |
#include<iostream>
#include<cmath>
#include<vector>
#include<bitset>
#include<bitset>
#include<string>
#include<utility>
#include<queue>
#include <iomanip>
#include <limits>
#include<tuple>
#include<algorithm>
#include<set>
using namespace std;
typedef long long int ll;
// ll
int main(){
int n,k;
cin >> n >> ... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... |
#include <bits/stdc++.h>
// 1. dp
typedef long double ld;
#define int long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *m... | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
string ans = (n % 2 == 0) ? "White" : "Black";
cout << ans;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; ++i) cin >> a[i];
sort(a.begin(), a.end());
a.insert(a.begin(), 0);
a.push_back(n + 1);
vector<int> v;
int mn = n;
for (int i = 0; i + 1 < (int)a.size(); ++i) {
int len =... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) {cout << x;}
void __print(long x) {cout << x;}
void __print(long long x) {cout << x;}
void __print(unsigned x) {cout << x;}
void __print(unsigned long x) {cout << x;}
void __print(unsigned long long x) {cout << x;}
void __print(float x) {cout << x;}
void... |
#pragma GCC optimize "trapv"
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define l... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
int main()
{
int64_t n, q;
cin >> n >> q;
vector<int64_t> a(n);
vector<int64_t> dsum(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (i > 0)
{
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v... | #include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;
ll f(ll x){
return (x+1)*x/2;
}
int main(){
ll l=1,r=100000;
ll n;
cin >> n;
while(l<r){
ll mid=(l+r)/2;
if(f(mid)<n)
l=mid+1;
else
r=mid;
}
cout << l << endl;
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <stdio.h>
#include <unistd.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) ... | #include <iostream>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
int m,sum=0,n,summ=0;
while(a!=0)
{
m=a%10;
sum=sum+m;
a=a/10;
}
while(b!=0)
{
n=b%10;
summ=summ+n;
b=b/10;
}
if(sum>summ)
cout<<sum;
else
cout<... |
#include<bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
int main() {
io... | #define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define ... |
// A - kcal
#include<bits/stdc++.h>
#define repi(i, s, n) for(int i=(int)(s); i<(int)(n); ++i)
#define rep(i, n) repi(i, 0, n)
#define rrepi(i, n, s) for(int i=n-1; i>=s; --i)
using namespace std;
using ll = long long;
int main(){
int a, b;
cin >> a >> b;
double v = (double)b/100;
double ans = v*a;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int ar[n][m];
int min=1000;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>ar[i][j];
if(ar[i][j]<min)
min=ar[i][j];
}
}
int ctr=0;
for(int i=0;i<n;i++){
... |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static int IN(void)
{
int x=0,f=1,c;while(c=getchar(),c<48||c>57){if(c==45)f=-f;}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f*x;
}
static void OUT(long x){if(x<0){putchar('-'),x=-x;}if(x>=10){OUT(x/10);}putchar(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define all(ar) ar.begin(),ar.end()
#define endl '\n'
void swap(string &y,string &z,int a,int b) {
char k;
k=y[a];
y[a]=z[b];
z[b]=k;
}
void swapin(string &y,int a,int b) {
char k;
k=y[a];
y[a]=y[b];
y[b]=k;
}
int main() ... |
#include <bits/stdc++.h>
using namespace std;
#define nline "\n"
#define ff first
#define ss second
#define ll long long
#define pb push_back
void solve() {
int n;
cin >> n;
int sum = 0;
for (int i = 1; i <= n; ++i) {
sum += i;
if (sum >= n) {
cout << i;
break;... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <cmath>
#include <cstdint>
#include <vector>
using namespace std;
int main(){
long long n;
cin>>n;
long long ans=0.5*(-1+sqrt(1+8*n));
if(ans*(ans+1)<2*n){
ans+=1;
}
cout<<ans;
}
|
#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 dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll INF = 10e16;
int main() {
int H, W;
cin >> H >> W;
vector<string> s(H);
rep(i, H) ci... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<string,int> psi;
typedef pair<int,string> pis;
typedef array<int,2> aii;
typedef array<int,3> aiii;
typedef array<int,4> aiiii;
typedef unsigned long long ull;
typedef long long int ll;
typedef array<ll,2> all;
typedef array<ll,3> all... |
#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
typedef unsigned long long ull;
typedef long long ll;
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void sc(int &x){scanf("%d",&x);}
void sc(int &x,int &y){scanf("%d%d",&x,&y);}
void sc(int &x,int &y,int &z){scanf("%d%d%d",&x,&... | #include<bits/stdc++.h>
// #pragma optimize("-O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,avx,mmx,tune=native")
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define INF 1e9
//#defi... |
#include <bits/stdc++.h>
using namespace std;
int main() {
double X,Y,Z,A,G;
cin >> X >> Y >> Z;
G=Y/X;
double i=0;
while(i/Z<G){
A=i;
i++;
}
cout << A <<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define BIG 2000005
ll M = 998244353;
int main() {
ll A, B, C;
cin >> A >> B >> C;
ll ans = A * (A+1) / 2 % M;
ans = (ans * (B * (B+1) / 2 % M)) % M;
ans = (ans * (C * (C+1) / 2 % M)) % M;
cout << ans <... |
//#define _GLIBCXX_DEBUG
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return tru... | #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()... |
/*
Author : MatsuTaku
Date : 01/30/21
*/
#include <bits/stdc++.h>
using namespace std;
#include <x86intrin.h>
#ifndef ONLINE_JUDGE
#define Assert(cond) assert(cond)
#else
#define Assert(cond)
#endif
#define rep(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; i++)
using lint = long long in... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
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>;
// find_by_order(k) r... |
#include <bits/stdc++.h>
#define nmax 100010
#define fi first
#define se second
#define ll long long
#define mp make_pair
const int oo=1e9+7;
using namespace std;
int n,a[nmax];
pair<ll,ll> f[nmax][3][2];
pair<ll,ll> operator +=(pair<ll,ll> &x,pair<ll,ll> y)
{
x.fi+=y.fi; x.se+=y.se;
x.fi%=oo; x.se%=oo;
... | /**
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.