code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int main(){
ios::sync_with_stdio(false);
int n;string s;
cin>>n>>s;
int num=0;
long long ans=1;
for(int i=1;i<=n;++i) ans=ans*i%mod;
for(int i=0;i<2*n;++i){
if((s[i]=='W')^num&1) ans=ans*num%mod,num--;
else num++;
}
printf("%lld\n",num?0:ans... | #include <cassert>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inc... | 0 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int N, M;
cin>>N>>M;
vector<vector<long long>> T(3*N, vector<long long>(6*N+1));
T[0][3*N+1] = 1;
T[1][3*N-1] = 1;
T[2][3*N] = 2;
for (int i=0; i<3*N; i++)
for (int j=0; j<=6*N; j++)
if (T[i][j]>0)
... | #include <bits/stdc++.h>
using namespace std;
#define mid ((s + e) / 2)
#define makefast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define comp(x) (lower_bound(vec.begin(), vec.end(), x) - vec.begin())
#define lc (v * 2)
#define rc (v * 2 + 1)
long long M = 1e9 + 7;
//>>>>>>>>>>>>>>>>>>>
#define int long long
... | 1 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#incl... | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <unordered_set>
#define YesNo(b) ((b) ? "Yes" : "No")
#define YESNO(b) ((b) ? "YES" : "NO")
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<ll>;
using ... | 1 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int n,y;
int i,j,flg=0;
scanf("%d %d",&n,&y);
for(i=0;i<=n;i++){
for(j=0;j<=n;j++){
if(n-(i+j)<0) {
break;
}
if(i+j+n-(i+j)==n&&y==i*10000+j*5000+(n-(i+j))*1000){
flg=1;
break;
}
}
if(flg==1) break;
}
if(flg==... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N, Y;
cin >> N >> Y;
for (int x = 0; x <= N; x++) {
for (int y = 0; y <= N; y++) {
if (N - x - y < 0) continue;
int sum = 10000 * x + 5000... | 1 |
#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 MOD ((ll)1e9+7)
ll N,S;
vector<pll> xpv[2];
ll i, j, k,ans;
bool ck(ll t,ll aa,... | /*
* Since g++10 is released, some characters is not valid inside #if 0 :(
* So, why not using clang++? :D
* Date:
echo -n ' ' && date +%Y.%m.%d # Just Run this (Type !!sh in Vim).
* Solution:
* 考虑边界，推导结论，子问题递归求解
如果 S <= p[1] 或者 S >= p[n] ，显然所有人投票都是一个方向，不妨假设 p[1] < S < p[n] 。
考虑处在最边上的 1 号点和 n 号点，如果 a[1]... | 1 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <list>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <bitset>
using namespace std;
/* typedef */
... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
struct LowLink{
vector<vector<int>>& edges;
// 関節点
vector<int> art;
vector<pair<int,int>> bridge;
vector<int> used, ord, low;
int k;
void dfs(int idx, int par){
ord[idx] = k++;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin >>a;
cout << a * a * a<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long mi[233];
long long work(int l,int r,long long dlt)
{
if ((l>=r)&&(dlt)) return 0;
if (l==r) return 10-(l==0);
if (l>r) return 1;
int t=(10-dlt%10)%10;
dlt-=t*(mi[r-l]-1);
return (10-(l==0)-t)*work(l+1,r-1,abs(dlt)/10);
}
int main()
{
mi[0]=1;for (int i=1;i<=... | 0 |
#include<bits/stdc++.h>
#define fo(i,a,b) for(int i= a ; i < b ; ++i)
#define rep(i,n) fo(i,0,n)
#define pln(n) printf("%lld\n",n)
#define sll(n) scanf("%lld",&n)
#define ss(n) scanf("%s",n)
#define vi vector < int >
#define pii pair < int , int >
#define pb push_back
#define mp make_pair
#define ll long long
#define u... | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define pb push_back
#define F first
#define S second
const int A = 3e2 + 2;
const int mod = 1e9 + 7;
int n;
bool vis[A][A][A];
ld mem[A][A][A];
ld solve (int c1, int c2, int c3) {
if (c1 + c2 + c3 == 0) return 0;
if (vis[... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<list>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int msb32(uint32_t x) { return 31 - __builtin_clz(x); }
int msb(uint64_t x) {
if(x < (1ULL<<32)) return msb32((uint32_t)x);
re... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define mem(a,k) memset(a,k,sizeof(a))
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int mod = 998244353;
int main() {
int n, d0;
cin >> n >> d0;
if(d0 != 0) {
cout << 0 << endl;
return 0;
}
vector<int> d(100005);
d.at(0) = 1;
int max_d... | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | 1 |
/* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#define f first
#define s second
#define mp make_pair
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) ... | 1 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <numeric>
#include <ostream>
... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<string> ans;
vector<char> alp;
int main(){
for(int i = 0;i < 26;i++){
char a = 'a' + i;
alp.push_back(a);
}
for(int i = 0;i < 26;i++){
char A = 'A' + i;
alp.push_back(A);
}
while(1){
int n;
cin >> n;
if(n == 0) brea... | 0 |
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
using namespace std;
int main(int argc, const char *argv[]) {
vector<int> abc(3);
int k;
cin >> abc[0] >> abc[1] >> abc[2];
cin >> k;
vector<int>::iterator iter = max_element(abc.begin(), abc.end());
size_t ind... | #include<bits/stdc++.h>
using namespace std ;
const int inf = 1012345678;
int main(){
int64_t N ;
cin >> N ;
int64_t a , b , c , d , e ;
cin >> a >> b >> c >> d >> e ;
int64_t min_t = min( a , min( min(b,c),min(d,e) ) ) ;
//cout << min_t << endl ;
if(N%min_t == 0 ){
cout << N/min_t + 4 <... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
string s; cin>>s;
int n=s.length();
lint hist[128]={};
rep(i,n) hist[s[i]]++;
lint ans=1;
for(int c='a';c<='z';c++) for(int d=c+1;d<='z';d++) {
ans+=hist[c]*hist[d];
}
cout<<ans<<'\n';
... | #include<cstdio>
#include<iostream>
#include <memory>
#include<vector>
#include<algorithm>
using namespace std;
int calc(int a, int b, int ope) {
if (ope == 0) return a + b;
else return a - b;
}
int main(void) {
string S;
cin >> S;
char ope[] = {'+', '-'};
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL inf=0x3f3f3f3f3f3f3f3fll;
const int MX=200005;
int n,m,x,y;LL ad,f[MX],ans;
LL f1[MX],f2[MX];
void add1(int x,LL k){for(;x<=n&&k<f1[x];x+=x&-x)f1[x]=k;}
LL que1(int x){LL k=inf;for(;x;x-=x&-x)k=min(k,f1[x]);return k;}
void add2(int x,LL k){for... | #include <bits/stdc++.h>
#define ll long long
#define fr(i, l, r) for(int i = l;i < r;i++)
using namespace std;
const int N = 200001;
const ll OO = 1e13;
ll tr[3][4 * N];
ll lz[4 * N];
void init(int in, int l, int r){
if(l == r){
fr(i, 0, 3)
tr[i][in] = 1e13 + 1ll * (i - 1) * l;
return;
}
int m =... | 1 |
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <string>
#include <cmath>
#include <cassert>
#define SIZE 100005
using namespace std;
typedef long long int ll;
typedef pair <... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int read(){
int x=0;bool f=0;char c=getchar();
while(c<'0'||c>'9') f|=c=='-',c=getchar();
while(c>='0'&&c<='9') x=x*10+(c^48),c=getchar();
return f?-x:x;
}
#define MAXN 100000
#define LL long long
int N,X;
LL Sum[MAXN+5],Org,... | 1 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n,num[3]={0};
cin>>n;
cin>>num[0]>>num[1];
if(n==3)cin>>num[2];
sort(num,num+2);
for(int i=1;i<=num[0];i++){
if(num[0]%i==0&&num[1]%i==0&&num[2]==0)cout<<i<<endl;
else if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
ll gcd(ll... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string str;
while(getline(cin, str)) {
while(1) {
for(int i=0; i<str.length(); i++) {
if(str[i] != ' ' && str[i] != '.') {
if(str[i] != 'z'){
str[i] += 1;
... | #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
using namespace std;
int main() {
string s;
while(getline(cin,s)) {
string t;
rep(j,0,26) {
t.clear();
rep(i,0,s.length()) {
if('a' <= s[i] && s[i] <= 'z') {
int val = (... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll h,w,a,b;
cin >> h >> w >> a >> b;
if(h == 1){
for(i = 0;i < a;++i) cout << 0;
for(i = a;i < w;++i) cout << 1;
cout... | #include <bits/stdc++.h>
using namespace std;
template< typename T >
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int()... | 0 |
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
using namespace std;
typedef long long ... | #include <fstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <random>
using namespace std;
#define INT_MAX_VALUE 21... | 0 |
#include <cstdio>
#include <stdlib.h>
int main()
{
int s[600];
int t[6];
int c = 0;
char h[4] = {'N', 'S', 'W', 'E'};
int n;
bool a = false;
scanf("%d", &n);
for (int i = 0; i < 6 * n; i++)
{
scanf("%d", &s[i]);
}
for (int i = 0; i < n; i++)
{
while (1)
... | #include<iostream>
using namespace std;
class DICE {
enum {
Top,
Front,
Right,
Left,
Rear,
Bottom
};
void Roll(const char*Directions) {
for (int i = 0; Directions[i] != '\0'; i++) {
Roll(Directions[i]);
}
}
void Roll(const char Direction) {
int tmpTop = Num[Top];
switch (Direction) {
... | 1 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
#define fore(i,a) fo... | // I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
#define MOD 1000000007
#define MAX_H 110
#define MAX_W 10
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
void init_io(){
cin... | 0 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello"
<< " "
<< "World" << endl;
} else if (N == 2) {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | 0 |
#include<cstdio>
int main()
{
while(true) {
int a, b, c, n;
int test[3000], r[1000];
int ans[1000];
scanf("%d%d%d", &a, &b, &c);
if(a == 0)
break;
scanf("%d", &n);
for(int i = 0; i < n; ++i) {
scanf("%d%d%d%d", test + i * 3, test + i * 3 + 1, test + i * 3 + 2, r + i);
test[i * 3] -= 1, test[i * 3 + 1] -= 1, test[i *... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <math.h>
#include <algorithm>
const int coin[6] = { 500,100,50,10,5,1 };
using namespace std;
struct Expm { int a, b, c, r; };
int main(){
/*int answer[5][2] = { 0 };
int n = 0;
int buf[100];
int ndataset;
for (ndataset = 0; ; ... | 1 |
#include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
int d12, d13, d23, T;
void comparar () {
int t1=d12+d23;
int t2=d13+d23;
int t3=d12+d13;
if (t1>=t2) {
T=min(t3,t2);
} else {
T=min(t1,t3);
}
}
int main () {
ios_base::sync_with_stdio(0); cin.tie(0)... | #include <atcoder/fenwicktree>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, Q, t, a;
cin >> N >> Q;
atcoder::fenwick_tree<ll> ft(N);
for ( int i = 0; i < N; i++ ) {
cin >> a;
ft.add(i, a);
}
vector<ll> ans;
for ( int q = 0; q < Q; q+... | 0 |
#define _USE_MATH_DEFINES //M_PI
#include <iostream> //std::cout, std::cin
#include <string> //std::string
#include <vector> //std::vector
#include <valarray> //std::valarray ??°????????????????¬???????
#include <algorithm> //std::sort
#include <time.h> //localtime_s
#include <cstdlib> //abs
#include <cmat... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;
int partition(int *A,int p,int r)
{
int x,j,temp;
x = A[r];
j = p-1;
for(int i = p; i < r; i++)
{
if (A[i] <= x)
{
j++;
temp = A[j];
A[j] = A[i];
A[i] = temp;
}
}
temp = A[j+1];
A[j+1] = A[r]... | 0 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | /*Be patient && calm!
All our dreams can come true, if we have the courage to pursue them.
I fear not the man who has practiced 10,000 kicks once, but I fear the man who has practiced one kick 10,000 times.
Do not pray for an easy life, pray for the strength to endure a difficult one.
When something is important enough... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<string> a;
bool cmp(string s, str... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if (A + B == C + D)
{
cout <<"Balanced" << endl;
}
else if (A + B <= C + D)
{
cout << "Right" << endl;
}
else if (A + B >= C + D)
{
cout << "Left" << endl;
}
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int k;cin>>k;
string s;cin>>s;
int n=s.length();
if(n<=k) cout<<s<<"\n";
else
{
string s1="";
for(int i=0;i<k;i++)
s1=s1+s[i];
s1=s1+"...";
cout<<s1<<"\n";
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int64_t N ;
cin >> N ;
int P = N/26 ;
vector<char> namae(100) ;
int i = 0 ;
//cout << N << " " << i << endl ;
while(N != 0 ){
N-- ;
int M = N % 26 ;
namae.at(i) = 'a' + M ;
N /= 26 ;
i++ ;
//cout ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<
pair<int, int>,
null_type,
less_equal<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update>
order... | 1 |
# include <iostream>
using namespace std;
int gcd(int a, int b){
return (b==0) ? a : gcd(b, a%b);
}
int main(){
int n, k;
cin >> n >> k;
int g = 0, m = 0;
for(int i=0; i<n; i++){
int x;
cin >> x;
g = gcd(x, g);
m = max(x, m);
}
if(k <= m && k % g == 0) cout << "POSSIBLE";
else cou... | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
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... | 1 |
//#include <bits/stdc++.h>
//#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>... | #include<iostream>
//??°??¢(0??§???????????????1??§??????)
int place[21][21]={};
//??????????????°??¨??????????????°
int N,M;
//???????????????
int mass;
char dir[10];
int main() {
while (true) {
//?????????
for (int i = 0; i < 21; i++) {
for (int j = 0; j < 21; j++) {
place[i][j] = 0;
}
}
//????... | 0 |
#pragma GCC optimize(2)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> PII;
const int MAXN = 400100;
vector<PII> graph[MAXN];
void add_edge(int v, int u, int c) {
graph[v].push_back(PII(u,c));
graph[u].push_back(PII(v,c));
}
int main() {
int N, D;
cin >> N >> D;
for(int i=0; i<N; i++)... | 1 |
#include <iostream>
#include <cstring>
#include <cstdio>
#define Maxn 4010
#define Maxm 4010
using namespace std;
int read() {
int x = 0,f = 1;
char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while('0' <= c && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
ret... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | 1 |
#include <iostream>
#include <algorithm>
#define N 100
#define INF 2000000000
#define WHITE 0
#define GRAY 1
#define BLACK 2
using namespace std;
int n;
int M[N][N],color[N],d[N],p[N];
//M??????????????????color????¨??????¶???(0,1,2),d????????????????°???????????¨????
//p???MST???????°???¨?????¨?????????????????... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
constexpr int64_t MOD = 1e9+7;
int main() {
int N;
cin >> N;
vector<int64_t> nums(N);
for (int n = 0; n < N; ++n) {
cin >> nums[n];
}
sort(nums.begin(), nums.end());
... | 0 |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | #include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<queue>
#include<utility>
using namespace std;
int n;
char student[10010];
double cal(int m,int e,int j)
{
double ave = (double)(m + e + j) / 3;
return ave;
}
int main(void)
{
while (cin >> n, ... | 1 |
#include<bits/stdc++.h>
using namespace std;
long long int n,i,x,a;
string s,t;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>s>>t;
n=s.size();
for (i=0;i<n;i++) t.push_back(s[i]);
cout<<t;
} | #include <stdio.h>
int main ()
{
char a[200], b[200];
scanf("%s %s", a, b) ;
printf("%s%s\n", b, a) ;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while ( cin >> N ) {
if ( N == 0 ) {
break;
}
typedef pair<double, string> P;
vector<P> ans;
while ( N-- ) {
string l;
int p;
cin >> l >> p;
int t = 0;
int d = 0;
for ( int i = 0; i < 5; i++ ) {
int a;
cin >> ... | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | 1 |
//
// honestorunkind2.cpp
// my_programs
//
// Created by Jiatuo Zou on 7/27/20.
// Copyright © 2020 Jiatuo Zou. All rights reserved.
//
#include <iostream>
using namespace std;
int f = 0;
int combination(int n, int xy[][2], int A[], int b[], int d, int MAX){
if(d == n){
f = 0;
for(int i = 1;... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int MSB1(long long x) { int d = 0; while ((1LL << d) <= x) d++; return d; }
int main() {
int n; cin >> n;
vector<int> a(n);
map<int, int> cnt;
for (auto &ai: a) cin >> ai, cnt[ai]++;
sort(a.rbegin(), a.re... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
typedef std::vector<int> TList;
TList Input()
{
int Count;
std::cin >> Count;
TList List(Count);
for(int i = 0; i < Count; ++i){
std::cin >> List[i];
}
return List;
}
int Count(const TList& S, const TList& T)
{
int Sum = 0;
... | #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--)
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
int main(int argc, const char * argv[])... | 1 |
#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
int dp[30000... | 1 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <bitset>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i = (a); i < (b); i++ )
#define REP(i, n) FOR(i,0,n)
typedef pair< int, int > cp... | #include<bits/stdc++.h>
using namespace std;
int main () {
int N, K;
cin >> N >> K;
vector<int>pl;
vector<int>mn;
pl.push_back(0);
mn.push_back(0);
for (int i = 0; i < N; i ++) {
int a;
cin >> a;
if (a < 0) mn.push_back(-a);
else pl.push_back(a);
}
int kj = min((int)mn.size(), K + 1);
... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<... | 0 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
using namespace std;
class Point
{
private:
int m_x;
int m_y;
public:
void setX(int x);
void setY(int y);
int getX();
int getY();
Point(int x, int y) {
setX(x);
set... | #include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
int main() {
int c[6] = {0},same[5] = {0};
while(scanf("%d,%d,%d,%d,%d\n",&c[0],&c[1],&c[2],&c[3],&c[4]) == 5) {
int same[5] = {0};
int straight = 0;
for(int i=0;i<5;i++) {
for(int j=0;j<5;j++) {
if(c[i] == c[j]) {... | 0 |
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#d... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef pair<int, in... | 1 |
#include <set>
#include <map>
#include <queue>
#include <ctime>
#include <cmath>
#include <cstdio>
#include <bitset>
#include <vector>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef vector<int> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for(int (i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
//constexpr ll INF = 1LL<<61;
constexpr ll mod = 1e9+7;
in... | 0 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int solve(int a,int b,int c){
if(c==0)return 0;
if(b<=c&&b<=a)return b;
return 0;
}
int main(){
string s;
cin>>s;
int ans=0;... | #include<iostream>
#include<cstdlib>
#include<algorithm>
#include<stdio.h>
using namespace std;
int ans, Jcou, Ocou, Icou;
char letter, target='A';
int main(){
while(1){
scanf("%c", &letter);
if(letter == '\n'){break;}
if(target == 'A' && letter == 'J'){
Jcou = 1;
Ocou = 0;
Icou = 0;
target = '... | 1 |
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define int long long
#define INF 1e18
#define ff first
#define ss ... | // 2020-07-15 23:41:12
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define FOR(i, b, n) for (ll i = b; i < n; ++i)
using namespace std;
using ll = long long;
void solve(ll N, ll x, vector<ll> a) {
ll ans(0);
if (a[0] > x) {
ans += a[0] - x;
a[0] = x;
}
FOR(i, 1, N) {
if (a[i - 1] + a[i] <= x)
... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#define rep(i, n) for(int i = 0; i < (... | 0 |
#include <bits/stdc++.h>
using namespace std;
string s;
int sol, ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> s;
sol = 0, ans = 0;
for(int i = 0; i < s.size(); i++) {
if(s[i] == 'S') sol++;
else {
if(sol > 0) sol--;
e... | #include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int main()
{
string a;
cin>>a;
int tmp=a.find("ST");
while(a.length()>0&&tmp>=0)
{
a.erase(tmp,2);
int x=max(tmp-1,0);
tmp=a.find("ST",x);
if(tmp==string::npos)
tmp=-1;
}
cout<<a.length()<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double r, g, x;
cin >> r >> g;
x = 2 * g - r;
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G;
cin>>R>>G;
int res = G + (G-R);
cout<<res<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;
signed main(){
while(1)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,m;
cin>>a>>b>>m;
vector<int> ai(a);
int ma;
vector<int> bi(b);
int mb;
for(int i=0;i<a;i++){
cin>>ai.at(i);
ma=(i==0?ai.at(i):min(ma,ai.at(i)));
}
for(int i=0;i<b;i++){
cin>>bi.at(i);
mb=(i==0?bi.at(i):min(mb,bi.at(i)));
... | 0 |
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int N;
cin>>N;
int *vCount=new int[N],*b=new int[N],*c=new int[N+1];
for(int i=0;i<N;++i){
vCount[i]=0;
}
bool yesFlg=true;
int oldA=-1,ci=0;
for(int i=0;i<N;++i){
int a1;
cin... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a, b;
string s;
cin >> a >> b;
cin >> s;
vector<char> num{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
if(s.at(a) == '-'){
vector<bool> judge2 (s.size(), false);
judge2.at(a) = true;
for(int i = 0;i < s.... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;cin>>n;
string a,b,c;cin>>a>>b>>c;
int acc = 0;
for (int i=0;i<n;i++){
vector<char> letters;
letters.push_back(a[i]);
letters.push_back(b[i]);
letters.push_back(c[i]);
... | 0 |
#include <iostream>
#include <string>
#include <math.h>
using namespace std;
void swap(int *,int *);
int main(){
int n,a[100],c=0,flag;
cin >> n;
for(int i=0;i<n;i++) cin >> a[i];
flag=1;
while(flag){
flag=0;
for(int j=n-1;j>0;j--){
if(a[j]<a[j-1]){
swap(&a[j],&a[j-1]);
c++;
flag=1;
}
}... | #include <stdio.h>
#define MAX_N (105)
static
void
bubbleSort( int A[], int N )
{
int i, j;
int count = 0;
for ( i = 0; i < N; i++ ) {
int flag = 0;
for ( j = N-1; j > i; j-- ) {
if ( A[j-1] > A[j] ) {
int tmp = A[j-1];
A[j-1] = A[j];
A[j] = tmp;
flag = 1;
count++;
}
}
if ( !flag )... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 1 |
#include <iostream>
#include <string>
#include <cmath>
#include <sstream>
using namespace std;
const int num = 653;
int main() {
string s, c;
cin >> s;
int l = s.size(), ans = 0, minAns = num, p;
for(int i = 0; i < l - 2; ++i)
{
c = s.substr(i, 3);
stringstream str(c);
str >> ans;
p = ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
string s; cin >> s;
int ans = INF;
rep(i,s.size()-2){
string t = "";
t+=s[i];
t+=s[i+1];
t+=s[i+... | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<time.h>
#include<vector>
using namespace std;
int main()
{
//ios::sync_with_stdio(false);
//cin.tie(0);
//cout.tie(0);
int n,x,... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cassert>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<list>
#include <cstring>
#include <functional>
//#include<unordered_map>
//#include<unordered_set>
using name... | 0 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for (int i = (int)n - 1; j <= i;... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int MAX_N = 1<<17;
int n,dat[2*MAX_N-1];
//?????????
void init(int n_){
//????´???°n???2???????????????
n=1;
while(n<n_)n*=2;
for(int i=0;i<2*n-1;i++)dat[i]=INT_MAX;
}
void update(int a,int b,int k,int l,int r,int x){
if(r<=a||b<=l)return;
if(a<=l&&r<=b... | //g++ -std=c++14 test.cpp -o test.out
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include ... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
const int INF = 10000;
template<typename ISTREAM>
void readWeightedGraphMatrix(ISTREAM& cin, vector< vector<int> >& weightedGraphMatrix) {
size_t n;
cin >> n;
int weight;
weightedGraphMatrix = vector... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
int P[1010];
int cost[5000];
int src[5000];
int dst[5000];
int A[100 + 10][100 + 10];
int M = 0;
vector< pair<int,int> > edges;
void init(int N)
{
for(int i = 1; i <= N; ++i)
{
P[i] = i;
}
}
int r... | 1 |
#include<bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and Constants *******/
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j ; i < k ; ++i)
#define rrep(i, j, k) for (int ... | #include<iostream>
using namespace std;
long long int MOD = 1000000007;
long long modpow(long long a, long long n, long long mod);
long long modinv(long long a, long long mod);
int main() {
//D
long long int h, w, a, b;
cin >> h >> w >> a >> b;
long long int sum = 1;
long long int i, j;
for (i = 1; i <= h - a - ... | 0 |
#include <cstdint>
#include <cstdio>
#include <atcoder/fenwicktree>
int main() {
int n, q;
scanf("%d %d", &n, &q);
atcoder::fenwick_tree<intmax_t> ft(n);
for (int i = 0; i < n; ++i) {
int a;
scanf("%d", &a);
ft.add(i, a);
}
for (int i = 0; i < q; ++i) {
int t;
scanf("%d", &t);
i... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define F first
#define S second
#define PB push_back
#define FOR(a,b) for(int i=a;i<=b;i++)
#define RFOR(a,b) for(int i=a;i>=b;i--)
#define FORE(a) ... | 1 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include... | #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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int n, h,... | 0 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v;
int x;
for(int i = 0; i < n; i++){
cin >> x;
v.insert(v.begin(),x);
}
x = 1;
for(auto y:v){
cout << y;
if( x != n ){
cout << " ";
}
x++;
}
cout << endl;
return 0;
} | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <complex>
#include <functional>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define N 100005
int n, m;
vector<int> to[N];
int dfn[N], low[N], bel[N], tim, cnt;
stack<int> stk;
bitset< N > vis;
void tarjan(int u)
{
dfn[u] = low[u] = ++tim; stk.push(u); vis.set(u);
for (auto v : to[u])
{
if (!dfn[v])
{
tarjan(v);
low[u] = min(low... | #include <stdio.h>
#include <vector>
#include <tuple>
#include <map>
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)
using lli = long long int;
using pii = std::pair<int, int>;
// UnionFind 木 ; 頂点 = 0, 1, 2, ..., n-1
class UnionFindTree{
private:
using Vint = std::vector... | 0 |
#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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define FASTIO ios_base::sync_with_stdio(0);cin.t... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
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,... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int cards[5], i, j, t, r, fl, fl2;
char c, str[8][11] = {"null", "one pair", "two pair", "three card", "straight", "full house", "four card"};
while (cin >> cards[0] >> c >> cards[1] >> c >> cards[2] >> c >> cards[3] >> c >> cards[4])
{
r ... | #include <iostream>
#include <vector>
#include <map>
#include <limits.h>
#include <queue>
#define INF INT_MAX
using namespace std;
int main()
{
string s;
for(;cin>>s;)
{
int ans=0,tmp=0;
int n[]={1000,500,100,50,10,5,1};
string nn="MDCLXVI";
for(int i=0;i<s.size();i++)
{
for(int j... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 998244353;
constexpr int NMAX = 302;
ll bilang[NMAX][NMAX][NMAX]; // (# of chars left in target, opcount, # of ones I ate)
char simula[NMAX];
int lenToZero[NMAX];
ll bilangin(int i, int j, int k) {
if (i < 0 || j < 0 || k < 0 ||
... | 1 |
#include <iostream>
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main(){
int n;
string s;
string alp = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
string ans;
while(1){
cin >> n;
if(n == 0) break;
int k[n];
for(int i = 0; i < n; i++){
cin >> k[i];... | #include<iostream>
using namespace std;
int dfs(int n, int dan){
if(dan == n){
return 1;
}
else if(dan > n){
return 0;
}
else{
int count = 0;
count = count + dfs(n, dan + 1);
count = count + dfs(n, dan + 2);
count = count + dfs(n, dan + 3);
return count;
}
}
int main(){
int n;
while(1){
c... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define Int register int
#define mod 998244353
#define MAXN 1000005
template <typename T> inline void read (T &t){t = 0;char c = getchar();int f = 1;while (c < '0' || c > '9'){if (c == '-') f = -f;c = getchar();}while (c >= '0' && c <= '9'){t = (t << 3) + (t << 1) + c - '... | #include<cstdio>
#include<algorithm>
const int N=1000007;
char s[N],t[N];int n,ans,sum[N];
int main()
{
scanf("%d%s%s",&n,s+1,t+1);
if(s[1]^t[1]) return !printf("-1");
for(int i=n,f=0,k=0,p=n;i;--i)
{
f+=sum[i+k];
if(p>i||t[i]^s[p])
{
for(;p>0&&(p>i||t[i]^s[p]);--p);
if(p==i) continu... | 0 |
#include <stdio.h>
int main(){
int N;
scanf("%d",&N);
long long int sum =0;
for(int i = 1 ;i<=N;i++){
if(i%3==0 && i%5==0){
sum +=0;
}
else if(i%3==0){
sum += 0;
}
else if(i%5==0){
sum+=0;
}
else {
sum += i;
}
}
printf("%lld",sum);
return 0;
} | //https://atcoder.jp/contests/abc162/tasks/abc162_b
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;
ll sum1=0;
sum1=(n*(n+1))/2;
ll n3;
n3=(n)/3;
ll n5;
n5=(n)/5;
ll n15;
n15=(n)/15;
ll a3;
a3=3+(n3-1)*3;
ll a5;
a... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int arr[3];
for(int i = 0; i < 3; i++) {
cin >> arr[i];
}
sort(arr, arr + 3);
cout << arr[0] + arr[1];
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, T;
cin >> N >> X >> T;
int count=N/X;
if (N%X!=0) {
count++;
}
cout << count*T << endl;
} | 0 |
#ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <q... | #include<bits/stdc++.h>
#define int long long
using namespace std;
using P=pair<int,int>;
signed main(){
int H,W;
cin>>H>>W;
set<P> s;
multiset<int> ans;
for(int i=0;i<W;i++){
s.insert({i,i});
ans.insert(0);
}
int n=0;
for(int i=0;i<H;i++){
int a,b;
cin>>a>>b;
a--;
int mx=-1;
... | 1 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int a, b;
while(1){
cin >> a >> b;
if(a == 0 && b == 0) break;
int date[13][32];
for(int i = 0;i < 13;i++){
for(int j = 0;j < 32;j++){
date[i][j] = 9;
... | #include <iostream>
#include <map>
using namespace std;
int main()
{
int month = 0, day = 0, total_day = 0, week_num = 0;
map<int, int> month_num;
month_num[1] = 0;
month_num[2] = 31;
month_num[3] = 60;
month_num[4] = 91;
month_num[5] = 121;
month_num[6] = 152;
month_num[7] = 182;
month_num[8] = 213;
mont... | 1 |
#include<iostream>
using namespace std;
class Answer
{
public:
Answer(){day = 10; year = 365;}
int N; //??\???
int day;
int year;
unsigned long long count(int cnt); //??¨??¢?´¢(???)
void set(); //??\???
void OutPut(); //???????????????
bool empty(); //???????????¶?????????
bool ans(); //?§£???
};
unsigne... | #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]... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(void){
int n;
cin>>n;
map<int,int> m;
for(int i=0;i<n;i++){
int a;
cin>>a;
m[a]++;
}
ll n1=0,n2=0;
for(auto i:m){
if(i.second>=4){
n1=i.first,n2=i.first;
}else if(i.second>=2){
swap(n1,n2);
n1=i... | #include <bits/stdc++.h>
using namespace std;
//typedef int64_t int;
#define all(x) x.begin(), x.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define precise cout.precision(10); cout << fixed;
#define pb push_back
#define mk make_pair
#define endl "\n"
#define int int64_t
#define ll long long
co... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d;
string A,B;
cin >> a >> b;
c = max(a,b);
d = min(a,b);
int e = c;
c--;
c = max(c,d);
e += c;
cout <<e<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << 2 * A << endl;
}
else {
cout << 2 * max(A,B) -1 << endl;
}
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include<string>
#include <set>
#include <map>
#include <queue>
#include <limits.h>
#include <bitset>
#include <cmath>
using namespace std;
#define rip(i, n, s) for (int i = (s);i < ( int )( n ); i++)
#define all(a) (a).begin(), (a).end()
typedef long long ll... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define ll long long int
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define D1(x) {cerr<<" [" <<#x<<": "<<x<<"]";cout << endl;}
#define D2(x) {cerr<<" [" <<#x<<": ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | 0 |
/*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_... | #include<bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (int)(n); i++)
#define sum(a) accumulate(a.begin(),a.end(),0LL)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
ll mod = 1e9+7;
vector<ll> cnt(1e3+1,0);
void disassenmble(ll n){
for(long long i = 2; i * i <= n; i++){... | 1 |
#include <iostream>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
int a, b;
if (m & 1)
a = m, b = m + 1;
else
a = m + 1, b = m;
for (int i = 1, j = a; i < j; i++, j--)
printf("%d %d\n", i, j);
for (int i = 1, j = b; i < j; i++, j--)
printf("%d %d\n", a + i, a + j);... | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.e... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b, e, k;
cin >> a;
rep(i, 3) cin >> b;
cin >> e >> k;
if ((e - a) <= k) cout << "Yay!";
else cout << ":(";
cout << endl;
re... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define Cout(x) cout << (x) << endl
#def... | #include <cstdio>
using namespace std;
int main()
{
char mp[15][15] = {0};
int pi, pj;
int cnt;
while (scanf("%s", mp[1]) != EOF){
cnt = 0;
for (int i = 2; i <= 12; i++) scanf("%s", mp[i]);
for (int i = 1; i <= 12; i++){
for (int j = 0; j < 12; j++){
if (mp[i][j] == '1'){
if(mp[i-1][j] != ... | 0 |
#include<cstdio>
unsigned prime[238] = {2, 3, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 30... | //
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MOD 1000000007
#define PI 3.14159265
#define EPS 1e-9
#define Pi acos(-1.0)
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) for(int i=(a); i<(b); i++)
#define clean(arr,v... | 0 |
#include<iostream>
int main(){
std::string s; std::cin >> s;
int diff=1e4;
for(int i=0; i<s.size()-2; ++i){
int num=std::stoi(s.substr(i,3));
num = std::abs(num-753);
diff = std::min(diff,num);
}
std::cout << diff << std::endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <list>
#include <iomanip>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#defin... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for (int i = (int)n ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1001001001;
long long pow2[60];
void init_pow2(){
pow2[0] = 1;
for(int i=1; i<60; i++){
pow2[i] = 2*pow2[i-1];
pow2[i] %= MOD;
}
return;
}
int main(){
init_pow2();
int n;cin>>n;
... | #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 <<... | 0 |
// A.
#include <iostream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <cmath>
#include <map>
#include <set>
using namespace std;
typedef long double LD;
typedef long long LL;
int main(int argc, char* argv[]) {
LL n, nfc = 0, fc = 0, ans = 0;
cin >> n;
ve... | /* Welcome to my Code */
#include <bits/stdc++.h>
#define ll long long int
#define i(a,n) int a=n;
#define l(a,n) ll a=n;
#define d(a,n) double a=n;
#define s(a) string a;
#define c(a) ll a; cin>>a;a... | 1 |
// B - Reverse and Compare
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1000000007;
// using mint = modint1000000007;
// const ll MOD = 998244353;
// using... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<(n);i++)
typedef long long ll;
int main(){
ll x; cin >> x;
ll y=x%11;
ll ans=0;
ans+=(x/11)*2;
if(y>6){
ans+=2;
}else if(y>0){
ans++;
}
cout << ans << en... | 0 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
ll MOD = 1e9+7;
main(){
ll N,M;
cin >> N >> M;
vector<ll> X(N),Y(M),accumX(N+1),accumY(M+1);
rep(i,0,N){
cin >> X[i];
X[i] += 1e9;
accum... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll,ll> P;
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; }
#define M 1000000007
#define al... | 1 |
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
typedef vector<int> ivec;
template<class T> inline bool chmax(T& a, T b) { if (a < ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef vector<bool> vbool;
typedef vector<int> vint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
using P = pair<int, int>;
#define LOG(variable) cerr << #variable":\t" << (variable) << "\n"
#define LOGCON(i, container) for(int (i) = 0; (i) < (container).size(); ++(i)) cerr << (i) << ":\t" << (container)[(i)] << "\n"
#define... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
#define INF 2000000000
typedef pair<int, int> P;
struct edge{ int to, cost;};
int V, E;
vector<edge> G[100010];
int d[100010];
void dijkstra(int s){
priority_queue<P, vector<P>, greater<P> > que;
for(int i = 0;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 |
// 2014/11/05 Tazoe
#include <iostream>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
int A[1000];
for(int i=0; i<N; i++){
cin >> A[i];
}
int B[1000];
for(int i=0; i<M; i++){
cin >> B[i];
}
int cnt[1000] = {0};
for(int i=0; i<M; i++){
for(int j=0; j<N; j++){
if(B[i]>=A[j]){
cnt[... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cctype>
#include <deque>
using namespace std;
typedef long long lint;
#define cout cerr
#define ni (next_num<int>())
template<class T>inline T next_num(){
T i=0;char c;
while(!isdigit(c=getchar())&&c!='-');
bool flag=c=='-';
flag?... | 0 |
/*
強連結成分アルゴリズムアルゴリズム
input:有向グラフG
output:各店の属する強連結成分を表す関数comp:V(G)->N
*/
#include <vector>
#include <functional>
using namespace std;
vector<int> scc(const vector<vector<int>>& G){
vector<int> comp(G.size(),-1);
vector<int> R(G.size(),0);
int N = 0;
vector<int> psi(G.size(),-1);
vector<int> psi... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
int main(int argc, c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long ;
int main(){
int a,b;
cin >> a >> b;
int ans=0;
if(a>b) cout << 2*a-1 << endl;
else if(a<b) cout << 2*b-1 << endl;
else cout << 2*a << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
constexpr ll MOD = 1e9 + 7;
constexpr double PI = acos(-1);
cout << fixed << setprecision(16);
cin.tie(0); ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
vector<ll> dp(x+1);
vector<ll> s(n);
... | #include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define ALL(x) x.begin(),x.end()
#define LL long long
int N,X;
const int maxn = 201;
const int maxm = 100005;
const int modu = 1e9+7;
int dp[2][maxm];
vector<int> vi;
int ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define p pair<int,int>
#define pb push_back
#define endl '\n'
#define w(t) ll test;cin>>test;while(test--)
#define fast ios_base::sync_with_stdio(false);cin.t... | #include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
int h... | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define int int64_t
#define ii pair<int,int>
#define dd pair<double,double>
#define vi vector<int>
#define pb pu... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.