code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
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, typename ...Ts>
vector<T> fusion(vector<T> bs,Ts... ts){
auto append=[&... | //fold
#ifndef KHALIL
#include <bits/stdc++.h>
#else
#include "header.h"
#endif
#define endl '\n'
#define mp make_pair
#define tostr(x) static_cast<ostringstream&>((ostringstream()<<dec<<x)).str()
#define rep(i,begin,end) for(auto i = begin;i < end;i++)
#define repr(i,begin,end) for(auto i = begin-1;i >= end;i--)
#defi... | 0 |
#include<iostream>
using namespace std;
int main(){
int n, a ;
cin >> n;
int day[n];
for(int i = 0; i < n; i++){
cin >> a;
day[i] = a;
}
for(int i = 0; i < n; i++){
int b = n - i - 1;
printf("%d", day[b]);
if(b != 0){
printf(" ");
}
}
printf("\n");
return 0;
}
| #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int n;
string result;
vector<int> a;
vector<int>::reverse_iterator begin,end;
cin >> n;
for (int c = 0; c < n; c++) {
int t;
cin >> t;
a.push_back(t);
}
begin = a.rbegin();
... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
in... | #include <iostream>
#include <map>
#include <cmath>
using namespace std;
int main() {
int n; cin >> n;
map<pair<int, int>, int> mp;
long long ans = 0;
for(int i = 0; i < n; i++) {
double num; cin >> num;
long long x = llround(num*1e9);
int two = 0, five = 0;
while(x % 2 == 0) two++, x /= 2;
... | 0 |
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
bool can;
if (A > 8 || B > 8) can = false;
else can = true;
if (can) cout << "Yay!" << endl;
else cout << ":(" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string a, b, c;... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
const int inf=0x3f3f3f3f;
long long a[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
long long d;
cin>>d;
a[0]=1;
for(int i=1;i<=20;i... | #include<bits/stdc++.h>
#include<vector>
#define LL long long
#define PI pair<LL,LL>
using namespace std;
LL D,St1[25],St2[25],P[25],Last[25],Ans;
vector<LL>V;
void DFS(LL L,LL R,LL Val,LL Cnt){
if(L==R){
Ans+=(Val==D)*Cnt;
return;
}
if(abs(Val-D)>Last[L]*10) return;
for(LL I=-9;I<=9;I++){
LL Ways=((L==0)?St... | 1 |
#include <stdio.h>
int main(){
long long int s,max,min,k;
int n;
scanf("%d",&n);
max = -1000000;
min = 1000000;
s = 0;
for (int i=0; i<n ; ++i){
scanf("%lld",&k);
if(k>max) max = k;
if(k<min) min = k;
s =s+k;
};
printf("%lld %lld %lld\n",min ,max, s);
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
using namespace std;
int main() {
vector<int> result;
string n;
string input;
getline(cin, n);
getline(cin, input);
istringstream iss(input);
string num;
while (getline(iss, num, ' ')) {... | 1 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/rope>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
mt19937 rng(high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rngll(high_resolutio... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bo... | 1 |
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define sz(s) ((int) ((s).size()))
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#ifdef _WIN32
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
typedef long long... | #include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
template<typename T>
class LazySegTree {
public:
explicit LazySegTree(int n, T init, T def) : N(calcN_(n)), def(def) {
mVal.assign(2*N+1, init);
mLazy.assign(2*N+1, 0);
mDirty.assign(2*N+1, 0);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n; cin>>n;
set<pair<int, int> > a, b;
for(int i = 0; i < n; i++){
int x, y;
cin>>x... | #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); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string S;
int main() {
cin >> S;
reverse(S.begin(), S.end());
string new_S = S.substr(8, S.length()-8);
reverse(new_S.begin(), new_S.end());
cout << new_S << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s; cin >> s;
for (int i = 0; i < s.length() - 8; i++) cout << s[i];
return 0;
}
| 1 |
#include <fstream>
#include <vector>
#include <cstring>
#include <iostream>
// BE CAREFUL WITH HASH TABLE & UNORDERED MAP
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define MOD 998244353
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)... | #include<bits/stdc++.h>
using namespace std;
vector<int>adj[100003],leaf;
int par[100003],depth[100005],sparse[100005][20],root=0,lz=0;
int lca(int p,int q)
{
int a,b,c,d,lp,i,j;
if(depth[p]<depth[q])
{
c=p; p=q; q=c;
}
for(j=19;j>=0;j--)
{
if((depth[p]-(1 << j))>=depth[q])... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int n;
cin>>n;
int A,B,C,D;
int sum=0;
A=n/10... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll R[400009];
string s;
cin >> s;
ll n = s.size();
map<char, int>mp;
for (int i = 0; i < n; i++) {
mp[s[i]]++;
}
ll ans = n*(n-1)/2;
for (auto& p : mp) {
ll v = p.second;
ans -=... | 0 |
#include <bits/stdc++.h>
using namespace std;
//#define cerr if (false) cerr
#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
#define dbv(v) cerr <<... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const ll MX=1E16+1000;
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
ll k;
cin>>k;
ll n=50;
cout<<n<<'\n';
vector<ll> res(n);
for(int i=0;i<n;++i) res[i]=i+(k/n);
for(int i=0;i<k%n;++i)
for(int j=0;j<n;++j)
if(j==i) res[j]+=n;
el... | 1 |
#include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
/*
*/
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
using Graph = vector<vector<int>>;
ll calc(ll a, ll b, ll p){//aのb乗をpで割った余り
if(b == 0) return 1;
else if(b%2 == 0){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
// boost
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = ... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define ll long long
#define coYes cout << "Yes" << endl;
#define coYES cout << "YES" << endl;
#define coyes cout << "yes" << endl;
#define coNo cout << "No" << endl;
#define coNO c... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define f1(a,b,c) for(int c=a;c<=b;c++)
#define f2(a,b,c) for(int c=a;c>=b;c--)
#define f3(a,b,c) for(int c=a;c;c=b)
#define so1(a,n) sort(a+1,a+n+1,mycmp);
#define so2(a,n) sort(a+1,a+n+1);
#define ll long long
#define itn int
#define ubt int
#define pii pair<int,int>
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
vector<pii> ... | 1 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>... | #include <iostream>
#include<stdio.h>
using namespace std;
void ini(int* p,int n);
void print(int *p);
void check(int *p);
bool judge(int *p);
int main(){
int n;
while(1){
bool ans;
cin >> n;
if(n == 0) break;
int state[21];
for(int i = 0; i<21 ; i++){
state[i] = 0;
}
ini(st... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
char S[3];
int ans=0;
for(int i=0;i<3;i++){
cin >>S[i];
}
bool p = S[0] =='R';
bool q = S[1] =='R';
bool r = S[2] =='R';
if(p && q && r){
ans = 3;
}else if((p&&q) || (q&&r)){
ans = 2;
}else if(p || q... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
int n,m,X,Y,x[200],y[200];
cin >> n >> m ... | 0 |
#include <bits/stdc++.h>
int modnum = 1000000007;
int main(){
int N;
std::cin >> N;
std::vector< int > cnt(N+1, 0);
cnt[0] = 3;
long long ans = 1;
for(int i=0; i<N; i++){
int a;
std::cin >> a;
int tmp = cnt[a] - cnt[a + 1];
ans *= (long long)tmp;
ans = a... | #include <iostream>
#include <fstream>
#include <cstdlib>
#include <math.h>
#include <utility>
#include <algorithm>
#include <functional>
#include <vector>
#include <numeric>
#include <bits/stdc++.h>
// #include <atcoder/all>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
// us... | 1 |
#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n/3 << endl;
} | #include<bits/stdc++.h>
using namespace std;
// Returns floor of square root of x
int floorSqrt(int x)
{
// Base cases
if (x == 0 || x == 1)
return x;
// Staring from 1, try all numbers until
// i*i is greater than or equal to x.
int i = 1, result = 1;
while (result <= x)
{
i++;
... | 0 |
#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin>>n;
ll ans=0;
for(ll i=1; i*i<=n; i++){
ans=i*i;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<bool> p(60000,true);
for(int i = 2; i < 55560; i++){
if(!p[i]) continue;
for(int j = 2; j*i < 55560; j++){
p[i*j] = false;
}
}
vector<int> fp;
for(int i = 2; i < 55560; i++){
if(p[i] && i % 5 == 1) fp.pu... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define mod 100000... | #include<iostream>
#include<queue>
#include<cstring>
using namespace std;
queue<int>Q;
int z[100][100], x[100][100], sum; char a;
void BFS(int col,int x1,int y1) {
Q.push(x1 * 100 + y1);
x[x1][y1] = col;
int a, b;
while (!Q.empty()) {
a = Q.front() / 100;
b = Q.front() % 100;
if (z[a + 1][b] == 1 && x[a + 1... | 0 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#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 REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) f... | #include <bits/stdc++.h>
using namespace std;
#ifdef zxc
#include <sys/resource.h>
#include "debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
using ll = int64_t;
using ld = long double;
const ld EPS = 1e-9;
//const ll MOD = 924844033;
const... | 0 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,n) loop(i,0,n)
int main(void){
string ro;
int m[256]={};
m['I']=1,
m['V']=5,
m['X']=10,
m['L']=50,
m['C']=100,
m['D']=500,... | //ヘッダー
#include<bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const int INF=1e+9;
const int MOD=1e+9+7;
//REPマクロ
#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 REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
// ... | 0 |
#include<iostream>
#include<cstring>
#include<algorithm>
#define Dist(x,y) ((x)*(x)+(y)*(y))
using namespace std;
typedef struct{
int height;
int weight;
} Rectangle;
bool operator<(Rectangle r1,Rectangle r2){
int di1=Dist(r1.height,r1.weight);
int di2=Dist(r2.height,r2.weight);
if(di1 < di2) return true;
... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 0 |
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(){
string x;
cin >> x;
int n = x.length();
if(n == 2){
if(x[0] == x[1]){
printf("1 2");
}
else ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define OP ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repr(i,n) for(int i = n - 1; i >= 0; ... | 1 |
#pragma GCC optimze("Ofast")
#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 mod 1000000007
#define md 998244353
#define trace(...)
#define ll long long int
#define ld long double
#define fi first
#define se ... | #include <iostream>
#define ll long long
using namespace std;
int main () {
int q,p = 0,n; cin >> q; ll ans = 0;
while (q--){
cin >> n;
if (n<p) ans += p-n;
else p=n;
} cout << ans << "\n";
return 0;
} | 1 |
/*
Author:zeke
pass System Test!
GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#i... | //#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)re... | 0 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE>
void print_vec(const vector<TYPE>& v){
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n, m; cin >> n >> m;
ll res = 1;
for (ll i = 1; i*i <= m; i++) {
if (m%i == 0) {
if (i*n <= m) res = max(res, i);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int dp[1001][1001];... | #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の桁数を求める
int main()
{
int n,l;
cin >> n >> l;
vector<int> taste(n);
rep(i,n){
taste[i] = l + i;
}
int total = 0;
r... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=200000;
int sq[555555],d1,d2,xx,yy,p[555555],cnt,n,col[555555],msk[555555],pos,sum[5],id;
int cnt1,cnt2,cpt,pa[555555],val[555555];
pair<int,int> v1[1111],v2[1111];
int root(int x)
{
if (pa[x]==x) return x;
int rt=root(pa[x]);
val[x]^=val[pa[x]];
return pa... | #include <cstdio>
typedef long long ll;
#define ri register int
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
// getchar
#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
map<char, int> dic;
rep(i, 26) dic[i + 'a'] = 0;
int n = s.size();
rep(i, n) dic[s[i]]++;
rep(i, 26)
{
if... | #include<iostream>
#include<set>
#include<map>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long li;
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define yn(i) print((i)?"Yes":"No")
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | #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<< "... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | // C Attention
#include <bits/stdc++.h>
using namespace std;
vector<int> input(int N){
vector<int> vec;
int temp = 0;
for (int i = 0; i < N; i++ ) {
cin >> temp;
vec.push_back(temp);
}
return vec;
}
int main(){
int N; // 100
cin >> N;
string str;
cin >> str;... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define point pair<int,int>
int N, K;
int mem[200010];
signed main()
{
cin >> N >> K;
rep(i, N)cin >> mem[i];
rep(j, min(K, 100LL))
{
int tmp[400010] = {0};
rep(i, N)
{
... | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,Q;string S;cin>>N>>Q>>S;
vector<int>V(N);
int U=0;
for(int X=0;X<N;X++){
if(X!=0&&S[X]=='C'&&S[X-1]=='A'){
U++;
}
V[X]=U;
}
for(int X=0;X<Q;X++){
int A,B;cin>>A>>B;
if(A!=1&&V[A-2]!=V[A-1]){
cout<<V[B-1]-V[A-1]<<e... | 0 |
#include <iostream>
#include <fstream>
#include <list>
using namespace std;
class game{
int length;
int cur;
int *r,*l;
int r_score,l_score;
public:
game(int _l){
length = _l;
r = new int [length];
l = new int [length];
r_score = 0;
l_score = 0;
cur = 0;
}
~game(){
delete [] r;
delete [] l;
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
while(n!=0){
int ap=0,bp=0;
int a,b;
for(int k=0;k<n;k++){
cin>>a>>b;
if(a>b){
ap=ap+a+b;
}
else if(a<b){
bp=bp+a+b;
}
else{
ap=ap+a;
bp=bp+a;
}
}
cout<<ap<<" "<<bp<<endl;
cin>>n;
}
return 0;
} | 1 |
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cctype>
#include<complex>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<functional>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
using namespace std;
const int dx[] = {1,0,-1,0},dy[] = {... | #include <iostream>
using namespace std;
const int MAX = 10000;
int plist[MAX + 1] = {};
void primeNumber(){
//0 -> prime, 1 -> composite
plist[0] = 1;
plist[1] = 1;
for(int i = 2; i <= MAX; ++i){
if(plist[i] == 0){
int c = i * 2;
while(c <= MAX){
plist[c] = 1;
c += i;
}
}
}
}
int mai... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<pair<int,int>>>;
#define INF 1000000000000000000
#define MOD 1000000007
int N;
vector<vector<ll>> a;
vector<bool> flag;
vector<ll> dp;
ll solve(int S){
if(flag.at(S)){
return dp.at(S);
}
flag.at(S)=true;
ll ans=0;... | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int main(){
int n;
cin >> n;
vector<long long int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
long long int r = 0, g = 0, b = 0, ans = 1;
for(int i=0; i<n; i++){
if(a[i] == r && a[i] == g &&... | 0 |
#include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout... | //Mahir Ratanpara (DA-IICT)
#include<bits/stdc++.h>
using namespace std;
#define Ff(i,a,n) for(i=a;i<n;i++)
#define Fr(i,a,n) for(i=a;i>n;i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.en... | 1 |
// TeamNichoen
// g++ -O2 -Wall -Wextra -Wshadow problemA.cpp
#include "bits/stdc++.h"
using namespace std;
typedef long long int LL;
typedef long long int ll;
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int solve(vector<vector<int> > &mp,int s... | #include <iostream>
#include <vector>
using namespace std;
typedef vector <int> VI;
typedef vector <VI> VVI;
const int dx[5] = { 0, 0, 0, 1, -1 };
const int dy[5] = { 0, 1, -1, 0, 0 };
int w, h;
int sx, sy, gx, gy;
VVI M;
int answer;
//==================================================
// Tõ
//==================... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef vector< vector<int> > VVI;
struct edge {
int to, cost;
edge(int t, int c) :to(t), cost(c) {}
};
typedef pair<int, int> P; // firstは最短距離, secondは頂点の番号
const int INF = (1e9);
void wFloyd ( VVI &v )
{
int len =... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
using P = pair<int,int>;
const vector<int> di{-1,0,1,0};
const vector<int> dj{0,-1,0,1};
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> A(H,vector<char>(W));
vector<vector<int>> D(H,vector<int>(W,-1));
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n, m;
cin >> n >> m;
vector<int> ac(n, 0);
vector<int> wa(n, 0);
rep(i, m)
{
int p;
string s;
cin >> p >> s;
p--;
if (ac[p] == 1)
continue;
if (... | #include <bits/stdc++.h>
#define PI 3.141592653589793
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int N,M;
int p;
string S;
int i,k;
int AC=0;
int WA=0;
cin >> N >> M;
int wrong[N+5]={0};
for(i=0;i<M;i++){
... | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
#define FS fix... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll x, y;
cin >> x >> y;
if(x == y)cout << 0 << endl;
else if(x... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
while(1){
int month, day;
int days_from_new_year = 0;
cin >> month >> day;
if(month == 0 && day == 0) break;
for(int i = 1; i < month; i++){
if(i == 1 || i == 3 || i == 5 || i == 7 || i == 8 || i == 10 || i == 12) days_from_new_year += 31;
e... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int N, K;
while(cin >> N >> K){
int res = 0;
vector<int> deg(N, 0);
vector<int> next(N, -1);
vector<int> dist(N, 0);
for(int i=0;i<N;i++){
cin >> next[i];
--n... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
const int mod... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,r,l) for(int i=(r);i>=(l);--i)
using namespace std;
const int N=3... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unsigned long long i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N,M;cin>>N>>M;
vector<int64_t>A(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
vector<int64_t>B(N+1);B.at(0)=0;
for(int i=1;i<=N;i++)
B.at(i)=(B.at(i-1)+A.at(i-1))%M;
map<int64_t,int64_t>m;
for(int i=0;i<=N;i++)
if(m.count(B.at(i)))
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a,b,c,d;
cin>>a>>b>>c>>d;
if((a-'0')+(b-'0')+(c-'0')+(d-'0')==7){
cout<<a<<"+"<<b<<"+"<<c<<"+"<<d<<"=7"<<endl;
}
else if((a-'0')+(b-'0')+(c-'0')-(d-'0')==7){
cout<<a<<"+"<<b<<"+"<<c<<"-"<<d<<"=7"<<endl;
}
else if((a-'0')+(b-'0')-(c-'... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
vector<int> num(4);
for(int i=0;i<4;i++){
num[3-i]=N%10;
N/=10;
}
for(int i=0;i<(1<<3);i++){
vector<char> op(3);
int ans=num[0];
for(int j=0;j<3;j++){
if((i & (1<<j))==(1<<j)){
... | 1 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cctype>
#include <assert.h>
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
int H, W;
cin >> H >> W;
int a[H][W];
for(int i = 0; i < H; i++)
for(int j = 0; j < W; j++) cin >> a[i][j];
vector<tuple<int, int, int, int>> v;
for(i... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<v<<"\n";
#define fi(v) get<0>(v)
#define se(v... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);i++)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);i--)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define ll long long
#de... | 0 |
#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 << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | #include <iostream>
using namespace std;
int N;
int A[210]; // 最大 200 個なので余裕を持って 210 に --- 200 以上ならなんでもよいです
int main() {
cin >> N;
for (int i = 0; i < N; ++i) cin >> A[i];
int res = 0;
// 操作が行える限り操作を繰り返す
while (true) {
bool exist_odd = false; // A[i] がすべて偶数かどうかを判定するフラグ
f... | 0 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.... | #include<stdio.h>
int main(){
int N;
scanf("%d", &N);
if( N%10==7 || (N%100)/10==7 || N/100==7)
printf("Yes\n");
else
printf("No\n");
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdou... | // I make this just for fun because i'm done
// Aimi Haraguni >> Konomi Suzuki >> Yui >> Ikimono Gakari >> Garnidelia >> Kalafina >> Eir Aoi. .. dude?
// problems that involves any kind of persistent data structures are the best of the best, are not them?
// #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma ... | 1 |
/* You can't hack me! */
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define fo(i,n) for(ll i=0; i<(n); i++)
#define FO(i,a,b) for(auto i=a; i!=(b); i+=(b)>(a)?1:-1)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(c... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD = 1000000007;
ll cnt =0,ans=0;
const int MAX = 510000;
int main(){
ll n;cin >> n;
string s; cin >> s;
ll r=0,g=0,b=0;
for(int i=0;i<n;i++){
if(s.at(i) ... | 1 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h , w;
string s[50] = {};
cin >> ... | /********************************************************************************
Code by a weak man who named CYJian, and he hope the code can get more points.
Algorithm:
********************************************************************************/
#include <bits/stdc++.h>
using namespace std;
typedef l... | 0 |
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
cout<<b<<""<<a<<""<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
//g++ -std=c++11
using namespace std;
long gcd(long a,long b){
if (a%b==0){
return(b);
}
else{
return(gcd(b,a%b));
}
}
long long prime_factor(long long num){
long long bak = num;
set<long long> nums;
for(long long i = 2; i*i <= ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
long long gcd(long long x, long long y){
if(y == 0) return x;
else return gcd(y, x%y);
}
bool IsPrime(long long n){
if(n == 1) return false;
for(long long i = 2; i * i < n; i++){
if(n%i == 0) return false;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int nax = 105;
const int mod = 1e9 + 7;
string s;
int d;
void add_self(int &a, int b)
{
a += b;
if(a >= mod)
a -= mod;
}
int main()
{
cin >> s;
cin >> d;
vector<vector<int>>dp(nax, vector<int>(2));
int n = s.length();
dp[0][0... | //product of pairs
#include<bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
int main()
{
long long int tt;
tt = 1;
while (tt--)
{
long long int n, i, count = 0;
cin >> n;
long long int a[n + 1], p[n + 1];
for (i = 1; i <= n; i++)
{
cin... | 0 |
#include <bits/stdc++.h>
#define N 100020
#define ll long long
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0')ch=='-'&&(f=0)||(ch=getchar());
while(ch<='9'&&ch>='0')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return f?x:-x;
}
int a[3][N], f[N];
bool rev[2];
int main(int ar... | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int mat[4][N], val[N], n, num[2], v[N];
void add(int x, int val) {
for (; x <= n; x += ((x) & (-(x))))
v[x] += val;
}
int query(int x) {
int ret = 0;
for (; x; x -= ((x) & (-(x))))
ret += v[x];
return ret;
}
void fail() {
puts("No");
exit(0);... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
const int MAX = 30;
int dp[MAX + 1];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
dp[0] = 1;
for (int i = 0; i <= MAX - 1; i++) {
for (int j = 1; j <= 3; j++) {
if (i + j <= MAX)
dp[i + j] += dp[i]... | #include<iostream>
using namespace std;
int main()
{
int n;
long long int e[4000], p[4000], q[4000], sum[4000];
bool ej[4000];
while( cin >> n )
{
if( n == 0 )
break;
for( int i = 0; i < 4000; i++ )
{
sum[i] = 0;
ej[i] = false;
}... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using v = vector<T>;
template <class T>
using vv = v<v<T>>;
#define ALL(c) (c).begin(), (c).end()
int digit(ll i)
{
ll r = i;
int ret = 0;
while (r != 0)
{
r /= 10;
ret++;... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define F first
#define S second
#define Tsetso ios_base::sync_with_stdio(0) ; cin.tie(0) ;
using namespace std;
const ll N = 1e5+10, inf = 1e3+5, mod = 1e9+7, NN = 1e5+10;
int a ;
int main()
{
Tsetso ;
int n , mn = 1e9 ;
cin >> n ;
fo... | 0 |
#include<bits/stdc++.h>
#define L long long
#define vi vector<int>
#define pb push_back
#define pi pair<int,int>
#define pii pair<pi,int>
#define aa first
#define bb second
#define xx aa.aa
#define yy aa.bb
#define zz bb
#define mp make_pair
#define mpp(a,b,c) mp(mp(a,b),c)
using namespace std;
int n,m,p;
L f[600000],g... | // Crt. 2019-12-11 21:17:53
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#define N 200005
using namespace std;
typedef long long ll;
const ll INF = 1e15;
struct Segt {
#define ls (p << 1)
#define rs (p << 1 | 1)
ll sum[N << 2], tag[N << 2];
Segt() {
memset(sum, 0, size... | 1 |
//Mahir Ratanpara (DA-IICT)
#include<bits/stdc++.h>
using namespace std;
#define Ff(i,a,n) for(i=a;i<n;i++)
#define Fr(i,a,n) for(i=a;i>n;i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.en... | #include <iostream>
using namespace std;
int func(int x, int y, int z){
// cout << x << " " << y << " " << z << endl;
if (x==y||y==z||z==x) return false;
if (x+y>z&&y+z>x&&z+x>y){
// cout << "ok" << endl;
return true;
}
return false;
}
int main(void){
int n,ans;
int len[200];
cin >> n;
for ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, ss, ee) for (int i = ss; i < ee; ++i)
string a26(ll n) {
string res = "";
while (n) {
--n;
res += (char)('a' + (n % 26));
n /= 26;
}
reverse(res.begin(), res.end());
return res;
}
ll N;
void input() { cin >> N; }
... | #include <bits/stdc++.h>
using namespace std;
queue<char> que[3];
int rec(int i){
if(que[i].empty()) return i;
char q = que[i].front();
que[i].pop();
return rec(q - 'a');
}
int main(){
for(int i = 0; i < 3; i++){
string s;
cin >> s;
for(int j = 0; j < s.size(); j++){
... | 0 |
#include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
int dp[505][505];
void solve()
{
int n, m, q, l, r, ql, qr;
cin >> n ... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Segtree {
int n;
T e;
vector<T> dat;
typedef function<T(T a, T b)> Func;
Func f;
Segtree(){}
Segtree(int n_input, Func f_input, T e_input){
initialize(n_input, f_input, e_input);
}
void initialize(int... | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
ll N,D;
ll A[200005];
cin>>N>>D;
ll ret = D*(N-1);
for(int i = 0;i < N;i++){
cin>>A[i];
ret += A[i];
}
for(int i = 1;i < N;i++){
A[i]=min(A[i-1]+D,A[i]);
}
for(i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
S = regex_replace(S, regex("hi"), "");
cout << ((S.size() == 0) ? "Yes" : "No") << "\n";
} | #include <iostream>
using namespace std;
string s;
int main() {
cin >> s;
if (s.length() % 2 != 0) {
cout << "No\n";
return 0;
}
bool works = true;
for (int i=0; i<s.length(); i+=2) {
if (s[i] != 'h' || s[i + 1] != 'i')
works = false;
}
if (works)
... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
string ans = "";
for(int i = 0; i+8 < s.length(); i++) ans += s[i];
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | 0 |
//include
//------------------------------------------
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <ss... | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,pt... | 1 |
#include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
const ll MOD = 1e9+7;... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1005,M=1e9+7;
int n,A,B,C,D,fac[N],inv[N],dp[N][N];
int ksm(int x,int y){
int ans=1;
for (;y;y>>=1,x=x*x%M)
if (y&1)(ans*=x)%=M;
return ans;
}
signed main(){
scanf("%lld%lld%lld%lld%lld",&n,&A,&B,&C,&D);
dp[0][A-1]=1;
fac[0]=inv[0]=... | 0 |
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef double db;
#define fr first
#define sc second
#define pb push_back
#... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#include<cmath>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
const int inf = 0x3f3f3f3f,oo ... | 0 |
# include <bits/stdc++.h>
using namespace std ;
bool is_war ( const vector <int >& x , const vector <int >& y ) {
for ( int Z = -100; Z <= 100; ++ Z ) {
bool is_ok = true ;
for ( int i = 0; i < x . size (); ++ i ) {
if ( x [ i ] >= Z ) is_ok = false ;
}
for ( int i = 0; i < y . size (); ++ i ) {
if ( y [ i ] < Z ) is_o... | #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size()
using namespace std;
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
vector<int> a(n),b(m);
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<m;i++){
cin>>b[i];
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
for(int i=0;i<101;i+... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
using namespace std;
typedef pair<int, int> P;
int k, a[100000], dist[100000];
vector<int> v[100000];
vector<P> w;
bool b[100000];
void cal(int x, int y){
dist[x] = y;
b[x] = false;
w.push_back(P(y, x));
for(int i... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 1 |
//Name: Space Coconut Crab
//Level: 2
//Category: 数学,探索
//Note:
/**
* zの範囲は0≦z≦E^(1/3)、yの範囲は0≦y≦E^(1/2)で表される。
* zとyが決まればxも一意に決まるので、zとyを全探索し、x,y,z≧0を満たすような組み合わせについてx+y+zの最小値を求めればよい。
*
* オーダーは O(E^(5/6))。
*/
#include <iostream>
#include <algorithm>
using namespace std;
bool solve(bool first) {
int E;
if(... | #include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)n; +... | 0 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
#include <iomanip>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 1 |
/*{{{*/
#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 ll long long
#define fornum(A,B,C) for(A=B;A<C;A++)
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
/////////////////////////////////////////////////////
#define INF 1e15
ll N, X, b[101010];
ll l[101010], u[101010];
vector<pll> mxv;
ll mk[10... | 1 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define li long long
#define itn int
using namespace std;
inline int nxt(){
int n;
scanf("%d", &n);
return n;
}
const int N = 111 * 111 / 3;
int dp[N][N];
int main(){
int n = nxt(), m = nxt();
vector<string> a(n);
for (int i = 0; i < n; i++)
c... | #include <algorithm>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second
/* clang-format off... | 0 |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <climits>
#include <assert.h>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
int arr[200001];
int main()
{
int N;
cin >> N;
int temp;
int i;
int ... | #include <iostream>
#include <algorithm>
using namespace std;
int main (int argc, char const* argv[]){
int n, max1, a[5001];
while(cin >> n && n!=0){
for(int i=0;i<n;i++) cin >> a[i];
max1 = a[0];
for (int i = 0; i < n; i += 1){
int sum = 0;
for(int j=i;j<n;j++){
sum += a[j]... | 0 |
//52行目から編集
#include <iostream>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <set>... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int x = 1;
for (int i = 0;N > i;i++){
cin >> x;
if (x < K){
x *= 2;
}
else{
x += K;
}
}
cout << x << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
int k,n;
void solve(){
cin>>n>>k;
int st = 1;
for(int i=1;i<=n;i++){
if(st*2<st+k)st*=2;
else st+=k;
}
cout<<st<<endl;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_accepted(void) {
string s;
cin >> s;
bool judge_a = false, judge_b = false, judge_c = false;
int cnt_c = 0;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
if (s[i] == 'A') judge_a = true;
else ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//cout << fixed << setprecision(15);
vector<int> forintinput(int n) {
vector<int> x;
for(int i = 0;i < n;i++){
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main(){
int a,b;
cin >> a >> b;
cout << max(a+b,max(a*2-1,b*2-1)) << endl;... | #include <iostream>
#include <iomanip>
//#include <string>
#include <vector>
#include <algorithm>
//#include <utility>
//#include <set>
//#include <map>
//#include <queue>
//#include <deque>
//#include <bitset>
//#include <math.h>
using namespace std ;
using ll = long long ;
//using ld = long double ;
using vll = vecto... | 0 |
#include <iostream>
using namespace std;
int main() {
long long n,i,mod=1000000007LL;
cin >> n;
long long a[n+1],p[n+1],ans=0LL;
p[0]=0;
for(i=1;i<=n;i++)
{
cin >> a[i];
p[i]=a[i]+p[i-1];
p[i]%=mod;
}
for(i=1;i<=n;i++)
{
ans+=((p[n]-p[i])*a[i]);
ans+=mod;
ans%=mod;
}
cout << ans%mod;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
const int N=55;
void maxi(int &a, int b) {
a = max(a,b);
}
using ll = long long;
ll MOD = 1e9 +7;
ll add(ll x, ll y) {
return ((x + y) % MOD);
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
vector<ll> X;
vector<ll> Y;
int n, m; cin >> n... | 0 |
/*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin()... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
ll ans = 1;
while(pow(ans, 2) <= n){
ans++;
}
cout << (ll)pow(ans-1, 2) << endl;
} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
int f = 1.0;
while(true) {
double M = sqrt(N), x = 0.0, y = 0.0;
x = modf(M, &y);
if (x == 0) {
printf("%d\n", N);
return 0;
... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
string S;
cin >> S;
string T = S.substr(0, N);
string U = S.substr(N, N);
reverse(U.begin(), U.end());
//cout << T << endl << U << endl;
unordered_map<string, ll> um1(0), um2(0);
... | 0 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
// #include "debug.h"
#define debug(...) 42
const int mod = 998244353;
void solve() {
int n;
cin >> n;
vector <int> d(n), cnt(n);
for(int i = 0; i < n; i++) {
cin >> d[i];
cnt[d[i]]++;
}
bool ok = true;
ok &= d[0] =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 998244353;
ll Ep(int x, int y){
if(y == 1) return x;
ll r = Ep(x,y/2);
if(y%2 == 1) return r *r%MOD *x%MOD;
else return r *r%MOD;
}
int main(){
int n, x;
cin >> n;
cin >> x;
if(x != 0){
cout << 0 << endl;
retur... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
if (N == 0) {
cout << 0 << endl;
return 0;
}
vector<int> ans(0);
while (N != 0) {
int tmp = N % 2;
if (tmp < 0) tmp += 2;
N = (N-tmp) / (-2);
ans.push_back(tmp);
}
for (int i = ans.s... | #include <bits/stdc++.h>
using namespace std;
long long mypow(long long x, long long y)
{
long long result = 1;
while (y != 0) {
if (y%2 != 0) {
result *= x;
y -= 1;
}
x *= x;
y /= 2;
}
return result;
}
int main(void)
{
long long n;
cin >> n;
if (n == 0) {
cout << 0 << endl;
return 0;
}
lon... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
using namespace std;
#define NIL -1
#define N 500001
//struct Node{
// int val;
// Node *p, *l, *r;
//};
struct Node {
int val;
Node *p, *l, *r;
Node(int v)... | #include <bits/stdc++.h>
using namespace std;
int main(){
int m;
cin >> m;
vector<int> nodes;
vector<pair<int, int>> child;
int n = 0;
for (int i = 0; i < m; i++){
string q;
cin >> q;
if (q == "insert"){
int k;
cin >> k;
if (n != 0){
int v = 0;
while (1){
... | 1 |
#include <cstdio>
typedef long long LL;
const int MX = 10005, MP = 2005;
const int MN = 505;
bool ip[MX];
int p[MP], pc;
inline void Sieve(int N) {
for (int i = 2; i <= N; ++i) {
if (!ip[i]) p[++pc] = i;
for (int j = 1, k; j <= pc; ++j) {
if ((k = p[j] * i) > N) break;
ip[k] = 1;
if (i % p[j] == 0) brea... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#include<chrono>
#include<random>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N, M, Q;
scanf("%d %d %d\n", &N, &M, &Q);
vector<string> grid(N+1, "0");
grid[0].resize(M);
for (int i = 1; i <= N; i++) {
char s[M];
scanf("%s\n", s);
grid[i] += s;
}
vector<vector<in... | #include<bits/stdc++.h>
using namespace std;
inline int read(){
int s=0,w=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
int n,m,q,a[2010][2010];
int po[2010][2010],ba[2010][2010];
int ob[2010][2010],zb[2010][2010];
int ma... | 1 |
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
ll M,N,P[1001];
int main(){
while(scanf("%lld%lld",&N,&M),N){
for(int i=0;i<N;i++) scanf("%lld",&P[i]);
vector<ll> d;
for(int i=0;i<=N;i++) for(int j=0;j<=N;j++)
d.push_back(P[i]+P[j]);
... | #include <iostream>
#include <string.h>
using namespace std;
const int dx[] = {1,0,-1,0};
const int dy[] = {0,1,0,-1};
int field[101][101];
int xs,ys,xg,yg;
void SetBlock(int c,int d,int x,int y)
{
if(d==0){//横なが
for(int ay=0;ay<2;++ay){
for(int ax=0;ax<4;++ax){
field[y+ay][x+ax] = c;
}
}
}
if(d==1... | 0 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std;
int n, a[100005];
vector<pair<int,int>> vec, vec2;
unordered_map<int,int> mp, mp2;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef debug
freopen("input.txt", "r", std... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n;cin >> n;
n /= 2;
vector<int> e(100001),o(100001);
for(int i = 0; i < n*2; i++) {
int v;cin >> v;
if(i%2==0){
o[v]++;
}
else... | 1 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <numeric>
#include <map>
#include <cmath>
#include <string>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
//==================... | #include<bits/stdc++.h>
using namespace std ;
int main(){
int a , b , c , d ;
cin >> a >> b >> c >> d ;
int M = 0 ;
if(a > b ){
M += b ;
}
else{
M =+ a ;
}
if(c>d) M += d ;
else M += c ;
cout << M << endl ;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1001001001;
const ll mod = 1000000007;
int main(){
int n, u, v; cin >> n >> u >> v;
--u; --v;
if(u == v){
cout << 0 << endl;
return 0;
}
vector<int> dist_u(n, -1), dist_v(n, -1);
vector<vector<in... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long N;
cin >> N;
// N = A * B
// B = N / A
// A , B 桁数大きい方の、最小値
long ans = 100000000;
double d = sqrt(N) + 1;
//cout << "d: " << d << endl;
for (long i = 1; i < d ; i++) {
long a = i;
... | #include <bits/stdc++.h>
using namespace std;
void chmax(int& a, int b) {
if (a < b) a = b;
}
void chmin(int& a, int b) {
if (a > b) a = b;
}
int main () {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
chmax(X, x);
}
for (int i = 0; i < M; i++) ... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long modpow(long long a, long long b){
long long ans = 1;
while (b > 0){
if (b % 2 == 1){
ans *= a;
ans %= MOD;
}
a *= a;
a %= MOD;
b /= 2;
}
return ans;
}
long long modinv(long long a){
return modpo... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <fstream>
#include <string>
#include <math.h>
#include <set>
#include <string>
#include <bitset>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//typedef p... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<class T>
struct SegmentTree {
using F = function<T(T, T)>;
const T init;
const F f;
int sz;
vector<T> seg;
SegmentTree(int n, const T init, const F f) :
init(init),
f(f)
{
sz = 1;
while(sz < n) sz <<= 1;
seg.resize(sz << 1, init);
}
void up... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.