code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
void print_array(int A[], int N) {
for(int i = 0; i < N-1; ++i) {
std::cout << A[i] << " ";
}
std::cout << A[N-1] << std::endl;
return;
}
int count;
void bubbleSort(int A[], int N) {
bool flag = true;
while( flag ) {
flag = false;
for(int j = N-1; j >= 1; --j) {
... | #define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define LLINF 1e18
#define INF (int)1e9+1
// Copied from Gennady-Korotkevich's template
template <typename A, typ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | #include <cstdio>
char S[101010];
int main()
{
scanf("%s", S);
bool app[26];
for (int i = 0; i < 26; ++i) {
app[i] = false;
}
for (int i = 0; S[i] != '\0'; ++i) {
app[S[i] - 'a'] = true;
}
for (int i = 0; i < 26; ++i) {
if (!app[i]) {
printf("%c\n", (char)(i + 'a'));
return 0;
}
}
puts("None")... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
vector<vector<int>> S(H);
for(int i=0; i<H; i++){
string s;
cin >> s;
for(int j=0; j<W; j++) S[i].push_back(s[j] == '#');
}
int ans = max(H, W);
vector<int> h(W);
for(int i=0; i<H;... | #include <bits/stdc++.h>
using namespace std;
static const long long INF=1000000000000000000;
int main(){
long long N;
long long K;
cin>>N>>K;
long long X[N];
for(long long i=0;i<N;i++){
cin>>X[i];
}
long long ans=INF;
for(long long i=0;i<N-K+1;i++){
ans=min(ans,abs(X[i])+abs(X[i]-X[i+K-1]));
... | 0 |
#include <iostream>
#include <string>
using namespace std;
int min(int a, int b, int c) {
if (a < b) {
if (a < c) {
return a;
} else {
return c;
}
} else {
if (b < c) {
return b;
} else {
return c;
}
}
}
int le... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define fi(a, b) for(int i=a; i<=b; i++)
#define fj(a, b) for(int j=a; j<=b; j++)
#define fo(a, b) for(int o=a; o<=b; o++)
#define fdi(a, b) for(int i=a; i>=b; i--)
#define fdj(a, b) for(int j=a;... | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair < int, int > pii;
const int N = 16;
const int M = (1 << N);
const int INF = 0x3f3f3f3f;
int dp[N][M], g[N][N], n, m, r... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
using namespace std;
int main() {
int N;
int A[8], B[8];
int NUM[8];
double sum = 0;
cin >> N;
rep(i, N) {
cin >> A[i] >> B[i];
}
rep(i, N) NUM[i] = i;
do {
rep(i, N-1) {
sum += sqrt(pow(A[NUM[i+1]]-A[NUM[i]], 2)
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | 0 |
#include <vector>
#include <iostream>
using namespace std;
int main()
{
int n; cin >> n;
vector<int> v(n);
for(auto &x : v) cin >> x;
for(auto it = v.crbegin(); it != v.crend(); ++it)
cout << *it << (((it+1)==v.crend()? "" : " "));
cout << endl;
return 0;
}
| // This template belongs to Juan Carlo Vieri
/* ____ __
/ _/ | | __ __
__| |__ | | /_/ | |
|__ __| | | __ ____ | | __ ___ _ ___
| | | | | | / _/ | |/ / / _ \ | |/ _/
| | | | | | | |_ | \ | __/ | /
|__| |__| |__| \___\ |__|\__\ ... | 0 |
#include <bits/stdc++.h>
#if ((_WIN32 || __WIN32__) && __cplusplus < 201103L)
#define lld I64d
#else
#define lld lld
#endif
//{{{
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
// clang-format off
... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
int main(){
int n,dum;
vector<int> p;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&dum);
p.push_back(dum);
}
sort(p.begin(),p.end());
if(n==2){
for(int i=1;i<=p[0];i++){
... | 0 |
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>... | #include<iostream>
using namespace std;
int N;
string s;
long mod=1e9+7;
main()
{
cin>>N>>s;
long ans=1,cnt=0;
for(int i=0;i<2*N;i++)
{
if(cnt%2==0)
{
if(s[i]=='B')
{
cnt++;
}
else
{
ans=ans*cnt--%mod;
}
}
else
{
if(s[i]=='B')
{
ans=ans*cnt--%mod;
}
else
{
... | 0 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#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;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
int main(){
ll d, g;
ll min = INF;
cin >> d >> g;
vector<ll> p(d);
vector<ll> c(d);
for(int i = 0; i < d; i++) {... | 0 |
#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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
int main() {
intt N, M; std::cin >> N >> M;
std::vector<intt> s(M);
std::vector<intt> c(M);
for (int i = 0; i < M; ++i) {
std::cin >> s[i] >... | 0 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int step(int s, vector<int> &dp, int n) {
int cnt = 0;
if (s == n) return 1;
for (int i = 1; i <= 3; i++) {
if (s + i <= n) {
if (dp[s + i] == -1)
cnt += step(s + i, dp, n);... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
ll N,K; cin>>N>>K;
vector<ll> A(N);
rep(i,N)
{
cin>>A.at(i);
}
rep(i,min(K,(ll)100))
{
vecto... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 510, M = 1010;
int a, b, n = 100;
char g[N][N];
int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define endl '\n'
using ll=long long;
const int INF=1e9+5;
const ll lim=(ll)3e16;
const int N=510000;
const int mod=1e9+7;
const ll oo=1e18+5;
int main(){
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(0);
int n;
cin>>n;
if(n<3) retur... | // luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define in inline
namespace fast_io
{
char buf[1<<12],*p1=buf,*p2=buf,sr[1<<23],z[23],nc;int C=-1,Z=0,Bi=0;
in char gc() {return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<12,stdin),p1==p2)?EOF:*p1++;}
in ll read()... | 1 |
#include <iostream>
#include <vector>
#include <cmath>
template<typename T>
auto print(std::vector<T> array,bool reverse = false)
-> void{
if(reverse){
auto iterator = array.rbegin();
std::cout<<*iterator;
iterator++;
for(;iterator != array.rend();++iterator){
std::cout<<" "<< *iterator;
}
}else{
... | #include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
#define MAX 256
int main(void){
int n;
scanf("%d", &n);
int i = 1, k = 0, x;
while (i <= n){
k = 0;
x = i;
if (i % 3 == 0)k = 1;
if (x % 10 == 3)k = 1;
while (x > 10){
x = x / 10;
if (x % 10 == 3)k = 1;
}
if (k == ... | 0 |
#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
#define rep(i,a) for(int i = 0 ; i < a ; i ++)
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
typedef pair<int,int> pii;
#define MAX_V 110
#define INF (1<<30)
struct edge{int to,cost;};
vector<edge> G[MAX_V],IN[MAX_V];
in... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
vector<pair<double, string>>x;
int n; double P, A, B, C, D, E, F, S, M; string L;
int main() {
while (true) {
x.clear();
cin >> n;
if (n == 0) { break; }
for (int i = 0; i < n; i++) {
cin >> L >> P >> A >> B >> C... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
int seen[10000][10000];
char S[10000][10000];
vector<pair<ll, ll>> prime_factorize(ll n) { //素因数分解と各素数の個数
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
if (n % i != 0)
{
continue;
... | #include <bits/stdc++.h>
#define F(i, x, y) for (int i = (x); i <= (y); ++i)
#define Fr(i, x, y) for (int i = (x); i < (y); ++i)
using namespace std;
typedef long long ll;
const int N = 300000 + 5;
int n, A[N], cnt[N], B[N], Fl[N], Fr[N];
int tg[N];
void ad(int x, int t) {
if (x < 0 || x >= n) return ;
tg[x] += t;
... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
REP(i, A) cin >> a[i];
vector<int> b(B);
REP(i, B) cin >> b[i];
vector<int> x(M), y(M), c... | #include <bits/stdc++.h>
using namespace std;
int s[5];
char op[5];
void solve(int index, int cur_sum) {
if (index == 3) {
if (cur_sum == 7) {
for(int i = 0; i < 4; ++i) {
if (i > 0) cout << op[i];
cout << s[i];
}
cout << "=7";
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll A[1005];
ll B[1005];
int main() {
cin.tie... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | 0 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<cstdio>
using namespace std;
int main()
{
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
double X = max(x1, x2) - min(x1, x2);
double Y = max(y1, y2) - min(y1, y2);
printf("%.8lf\n", sqrt(X*X + Y*Y));
return 0;
} | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main() {
double x1, y1, x2, y2;
cin >> setprecision(10) >> x1;
cin >> setprecision(10) >> y1;
cin >> setprecision(10) >> x2;
cin >> setprecision(10) >> y2;
cout << setprecision(10) << sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll n,m; cin >> n >> m;
if(n % m == 0){
cout << "0";
}
else{
cout << "1";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int S = A + B;
int T = A - B;
int U = A * B;
if (S >= T && S >= U) {
cout << S << endl;
} else if (T >= S && T >= U) {
cout << T << endl;
} else {
cout << U << endl;
}
} | 0 |
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
n=n/3;
printf("%d\n",n);
} | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#define maxn 510
#define ll long long
using namespace std;
int n;
ll a[maxn][maxn], primes[2020];
bool st[1000010];
int ... | 0 |
/*https://atcoder.jp/contests/abc084/tasks/abc084_b*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w",... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int p,q,r,sum,maxm;
cin >> p >> q >> r;
sum = p + q + r;
maxm = max({p,q,r});
cout << sum - maxm;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define N 4444
#define mod 998244353
int n,k,C[N][N],pw2[N];
int c(int n,int m){
if (m>n||m<0)
return 0;
return C[n][m];
}
int calc(int m,int n){return c(n+m-1,m-1);}
int Get(int v,int n,int k){
int ans=0;
int lim=max(0,v/2-max(0,v-1-k));
for (in... | #include <iostream>
#include <vector>
#include <bitset>
using namespace std;
long long const mod = 1000000007;
int n, x[3], v;
vector< vector<long long> > dp;
bool g(int mem, int a){
int m = mem, sum = 0, prc = 2;
if(a == x[2]) prc--;
else sum = a;
while(m > 0){
int tmp = 1;
while(m%2 ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define TEMP_T template<typename T>
TEMP_T void sort(T& v){ sort(v.begin(), v.end()); }
TEMP_T void revs(T& v){ reverse(v.begin(), v.end()); }
TEMP_T void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TEMP_T T cums(T& v){ T r(v.size()); partial_s... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int n, p;
while (cin >> n >> p, n) {
int now = 0,wan=p;
vector<int>person(n,0);
while (true) {
if (wan) {
person[now]++; wan--;
if (person[now] == p) {
cout << now << endl;
break;
}
}
else if (person[now]) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N=110;
int h,w,px,py,f[N][N][N][N],col[N][N],row[N][N];
bool mp[N][N];
void Init()
{
scanf("%d%d",&h,&w);
for (int i=1;i<=h;++i)
for (int j=1;j<=w;++j)
{
char ch=getchar();
while (ch!='o' && ch!='.' && ch!='E') ch=getchar();
if (ch=='E') px=i,py... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int64_t>A(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
vector<int64_t>B(1+N);
map<int64_t,int64_t>M;
M[1]=A.at(0);
for(int i=2;i<=N;i++)
if(i%2==1)
M[i]=M.at(i-2)+A.at(i-1);
B.at(0)=0;
B.at(0)=0;
B.at(2)=max(A.at(... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const s... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string str;
cin>>str;
if(str.size()==2){
cout<<str<<endl;
}
else{
cout<<str.at(2)<<str.at(1)<<str.at(0)<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<functional>
#include<queue>
#include<stack>
#include<math.h>
#define INF 1000000001
#define EPS 1.0e-6
using namespace std;
typedef long long ll;
int main()
{
int n;
while (cin >> n) {
i... | 0 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, ans=1, tmp=0;
vector<char> A;
vector<ll> B;
signed main(){
cin >> N;
for(int i=0;i<2*N;i++) {
char a;
cin >> a;
... | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The Value Of " << #val << " is : " << val << '\n';
typedef long double ld;
typedef long long ll;
typedef ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string ... | 0 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T> in... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#defin... | 1 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ld pie=3.1415926535;
ll MOD=1000000007;
ll m... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool can = true;
if(S.at(0)!='A') can = false;
int num_C = 0;
for(int i=2;i<S.size()-1;i++){
if(S.at(i)=='C') num_C ++;
}
if(num_C!=1) can =false;
int num_upper = 0;
for(int i=0;i<S.size();i++){
if(isuppe... | 0 |
#include<bits/stdc++.h>
using namespace std;
// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
int main()
{
int n,m;cin>>n>>m;
vector<int> a(m);
vector<int> b(m);
int i;
int even=m/2;
int odd=m-even;
rep(i,odd)//1 to odd*2
{
a[i]=i+1;
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | 1 |
#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#define rep(i,n) for(int i=0; i<int(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
... | #include <bits/stdc++.h>
using namespace std;
#define dump(...) cout<<"# "<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp mak... | 0 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define DEBUG true
#ifdef ONLINE_JUDGE
#undef DEBUG
#define DEBUG false
#endif
using namespace std;
#define TRACE(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); cerr ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, ans = 0;
cin >> n >> m;
ans = n * m;
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
const ll ATCODER_AMARI = 1000000007; //10^9 + 7
const ll INF = 10000000000000;
//階乗関数 ATCODER_AMARIに注意
ll factorial(ll k){
ll sum = 1;
for(int i = 1 ; i < k + 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
struct StQuery
{
StQuery() : m_nLeft(0), m_nRigt(0) { }
int m_nLeft;
int m_nRigt;
};
void fnInput(string& rsStr, vector<StQuery>& rvoQuery)
{
int nStrSiz, nQuerySiz;
cin >> nStrSiz >> nQuerySiz;
rvoQuery.resize(nQuerySiz);
cin >> rsStr;
for (StQuery& ... | 1 |
#include <iostream>
#include <queue>
#include <functional>
#include <vector>
using namespace std;
struct edge {
int to;
int cost;
};
typedef pair<int, int> P;
int V;
vector<edge> G[3010];
vector<edge> G2[3010];
int d[3010];
void dijkstra(int s, int h) {
priority_queue<P, vector<P>, greater<P> > que;
fill(d, d+... | #include <stdio.h>
#define MAXN 105
typedef struct _pair {
int id, score;
} pair;
int N;
pair arr[MAXN];
int rank[MAXN];
void bubleSort() {
int i, j;
pair p;
for(i = 0; i < N; ++i) {
for(j = 1; j < N-i; ++j) {
if(arr[j-1].score < arr[j].score) {
p = arr[j-1];
arr[j-1] = arr[j];
... | 0 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<algorithm>
#define N 2005
#define MOD 998244353
using namespace std;
int k,n;
int a[N];
int d[N][N];
int dy[N][N];
int main() {
scanf("%d%d", &k,&n);
int i, j;
for (i = 1; i <= k; i++) d[1][i] = 1;
for (i = 2; i <= n; i++) {
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
const double EPS = 1e-10;
bool used[4001];
ll fact[4001], inv_fact[4001];
ll comb(ll n, ll k) {
if (n < k) return 0;
ll ret = fact[n];
(ret *= inv_fact[k]) %= MOD;
(ret *= inv_fact[n - k]) %= MOD;
return ret;
}
ll mod_pow... | 1 |
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
using namespace std;
#define N 305
int n,k,f[N][N][N];char s[N];
int dp(int l,int r,int k){
if (k<0) return -1000;
if (l>r) return 0;
int &res=f[l][r][k];
if (~res) return res;
if (l==r) return res=1;
res=0;
if (s[l]==s[r]) res=max(res,dp(l+1,... | #include<map>
#include<set>
#include<bitset>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<chrono>
#include<stack>
#include<fstream>
#include<math.h>
#include<list>
#include<complex>
#define REP(i,x,y) for(ll i=x;i<=y;i++)
#define SIZE(a) ll(a.size())... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for( int i = 0; i < N; i++ ) {
cin >> s.at(i);
}
int M;
cin >> M;
vector<string> t(M);
for( int i = 0; i < M; i++ ) {
cin >> t.at(i);
}
vector<int> count(N);
for ( int i = 0;... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace boost::multiprecision;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> P;
#define PI 3.141592653589793
#define MOD 1000000007
//#define MOD 998244353
#define ALL(obj) (obj).begin(),(obj).e... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int N;
cin >> N;
for (int i = N; i > 0; i--)
{
if (sqrt(i) == floor(sqrt(i))){
cout << i << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for (int i=n;^i;i--)
#define ALL(v) v.begin(),v.end()
// #define int ll
#define eps 1e-9
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
template<class T> inline void chmax(T &a, const T &b) { if(a < b)... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
while(true){
int n,p;
cin >> n >> p;
if(n == 0){
break;
}
int maxp = p;
list<pair<int,int> > l;
for(int i=0; i<n; i++){
l.push_back(make_pair(0,i));
}
l... | #include <bits/stdc++.h>
#if ((_WIN32 || __WIN32__) && __cplusplus < 201103L)
#define lld I64d
#else
#define lld lld
#endif
//{{{
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
// clang-format off
... | 0 |
#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 ++... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n,m,q;
ll res;
vector<ll> v;
while(true) {
cin >> n >> m;
if(n == 0) break;
v.clear();
res = 0;
for(int i = 0; i < n; i++){
cin >> q;
v.push_back(q);
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ld res = n / ld(min({a, b, c, d, e}));
cout << (ll (ceil(res) + 4)) << "\n";
return 0;
}
| #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <cstring>
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, in... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a < c && c < b) || (b < c && c < a))
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> A(3);
cin >> A[0] >> A[1] >> A[2];
int mid = A[2];
sort(A.begin(), A.end());
cout << (A[1]==mid?"Yes":"No") << endl;
return 0;
} | 1 |
#include<iostream>
using namespace std;
int main(void){
long long n,a[10000],min=1000000,max=-1000000,sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<min){min=a[i];}
if(a[i]>max){max=a[i];}
sum=a[i]+sum;
}
cout<<min<<" "<<max<<" "<<sum<<endl;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <comple... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// __uint128_t
const ll MOD = 1e9+7;
int main(){
ll N, M, Q; cin >> N >> M >> Q;
vector<vector<ll>> D(N+1, vector<ll>(N+1));
for(int i = 0; i < M; i++){
... | ///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si ... | 1 |
// clang-format off
#include <bits/stdc++.h>
using namespace std;
using ll = 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 fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostrea... | #include <stdio.h>
const int bias = 10;
long long dp[bias*2+1][2],nxt[bias*2+1][2];
void mx(long long &a, long long b)
{
if (a < b) a = b;
}
int main()
{
for (int i=0;i<=bias*2;i++) dp[i][0] = dp[i][1] = -1e18; dp[bias][0] = 0;
int n; scanf ("%d",&n);
for (int k=0;k<n;k++){
int x; scanf ("%d",&x);
for (... | 1 |
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
class Dice {
private:
int surface [6];
void next(int a, int b, int c, int d);
public:
Dice(int surface[6]);
Dice();
void role(char dir);
void set(int pos, int num);
int get(int pos);
};
int main(void) {
Dice dic... | #include<bits/stdc++.h>
using namespace std;
struct Dice
{
int x, y;
int l, r, f, b, d, u;
void RollF()
{
--y;
int buff = d;
d = f;
f = u;
u = b;
b = buff;
}
void RollB()
{
++y;
int buff = d;
d = b;
b = u;
u = f;
f = buff;
}
void RollL()
{
--x... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int M = 0;
cin >> M;
vector<int> s(M,0);
vector<int> c(M,0);
if(M == 0) {
cout << (int)pow(10, N - 1)*(N != 1) << endl;
return 0;
}
for(int i = 0; i < M; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
vector<pair<int,int>> pr(m);
rep(i,m){
int s,c;cin>>s>>c;
s--;
pr[i]=make_pair(s,c);
}
rep(i,1000){
bool ans=true;... | 1 |
#include <iostream>
using namespace std;
#include <vector>
#include <functional>
template<class T, class Lazy> struct LazySegTree {
private:
public:
int size;
vector<T> v; vector<Lazy> lazy;
vector<int> seg_size;
using F = function<T(T,T)>;
using G = function<Lazy(Lazy,Lazy)>;
using H = func... | #include<bits/stdc++.h>
//#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) ... | 0 |
#include <bits/stdc++.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
#include <math.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define re... | #include <bits/stdc++.h>
using namespace std;
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) ((v).begin(), (v).en... | 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 ll long long
#define ld long double
#define pb push_back
#define all(x) (x).begin(), (x).end()
template <typename T> using ord_set = tree <T, null_type, less <T... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <limits>
#include <set>
#include <map>
#include <functional>
#include <inttypes.h>
#include <limits.h>
#include <stdint.h>
#include <s... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
using lint = int64_t;
int main() ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); ++ i)
#define rrp(i,a,b) for (int i = (a); i >= (b); -- i)
#define gc() getchar()
#define fir first
#define sec second
typedef pair<int,int> pii;
typedef long double db;
typedef long long ll;
template <typename tp>
inline void ... | 0 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include<stdio.h>
int main(){
int h, w, n, ans;
scanf("%d", &h);
scanf("%d", &w);
scanf("%d", &n);
if(w>=h){
if(n%w == 0){
ans = n/w;
}else if(n%w != 0){
ans = n/w+1;
}
}else if(w<=h){
if(n%h == 0){
ans = n/h;
}else if(n%h != 0){
ans = n/h+1;
}
}
printf("%d", ans);
} | 1 |
#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 mt make_tuple... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include <iostream>
#include <algorithm>
#define INF 100000000000000
using namespace std;
typedef long long llong;
//int isalpha(char ch): ch がアルファベットなら true を返す
//int isdigit(char ch): ch が数字なら true を返す
//int islower(char ch):... | 1 |
#include<iostream>
using namespace std;
int main () {
int H, W, A, B;
cin >> H >> W >> A >> B;
int zo[] = {0, 1};
for (int i = 0; i < B; i ++) {
for (int j = 0; j < A; j ++) {
cout << zo[0];
}
for (int j = A; j < W; j ++) {
cout << zo[1];
}
cout << endl;
}
for (int i = B; i <... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
ll n;cin>>n;
int ans=1e9;
for(int i=1;i<=sqrt(n);i++){
if(n%i!=0)continue;
ll j=n/i;
string I=to_string(i),J=to_string(j);
int a=I.size()... | #include <algorithm>
#include <cmath>
#include <iostream>
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; --i)
int main() {
ll n;
cin >> n;
ll m = (ll)sqrt((double)n);
auto d = [](ll x) {
ll res = 0;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES"... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#inc... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define repn(i,n,m) for(int i=n;i<m;i++)
#define repn1(i,n,m) for(int i=n;i<=m;i++)
using namespace std;
... | #include <iostream>
#include <cstdio>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
int table[11][11] = {};
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> table[i][... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, m;
int p[1000];
cin >> n >> m;
while (n != 0 || m != 0) {
for (int i = 0; i < n; i++)
cin >> p[i];
sort(p, p + n, greater<int>());
int s = 0;
for (int i = 0; i < n; i++) {
if (i % m != m - 1)
s += p[i];
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pq priority_queue
#define debug(x) cerr << #x << ": " << x << endl;
#define line() cerr << "---------------" << endl;
int main() {
int n, m;
while (cin >> n >> m) {
if (n == 0 && m == 0) break;
vector<int> v(n);
int su... | 1 |
//15
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
double l[12];
double ls[13]={};
for(;;){
for(int i=0;i<12;i++){
(cin>>l[i]).ignore();
if(!cin)return 0;
ls[i+1]=ls[i]+l[i];
}
cout<<lower_bound(ls,ls+11,l[10]*ls[10]/(l[10]+l[11]))-ls<<endl;
}
return 0... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
#define rep2(x,from,to) for(int x = (from); x < (to); ++(x))
#define rep(x,to) rep2(x,0,to)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int b[14][14];
void dfs(int y, int x) {
if(!b[y][x]) return;
b[y][x] = 0;
rep(i,4) {
dfs(y+d... | 0 |
#include <bits/stdc++.h>
#include <vector>
#include <math.h>
using namespace std;
int main(){
long long x,y;
cin>>x>>y;
if(x*y < 0) cout<<abs(abs(x) - abs(y))+1<<endl;
else if(x*y == 0){
if(x<y) cout<<y-x<<endl;
else cout<<x-y+1<<endl;
}
else {
if(x<y) cout<<y-x<<endl;
else
co... | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
usi... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N; cin >> N;
int x, ans;
for (int i = 9; i >= 1; i--) {
x = i *... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
using namespace std;
int main(void){
int N; cin >> N;
int i = 0;
int answer = 0;
if (N / 100 > (N - N / 100 * 100) / 10) answer = N / 100;
else if (N / 100 < (N - N / 100 * 100) / 10) answer = N / 100 + 1;
else if ((N -... | /*
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... | 1 |
#include<stdio.h>
main(){
int i,d,s;
while(scanf("%d",&d)!=EOF){
s=0;
for(i=0;i<600/d;i++){
s+=(d*((d*i)*(d*i)));
}
printf("%d\n",s);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
double r;
cin>>r;
cout<<2*r*M_PI;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
const int N = 500005;
int n,m;
map<ii, int> id;
vector<ii> G[N];
int ct = 1;
priority_queue<ii, vector<ii>, greater<ii> > pq;
int dist[N];
int main(){
scanf("%d%d",&n,&m);
ct = n+1;
for (int i = 0; i < m; i++){
int p,q,c;
... | // #pragma GCC optimize("O3")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}temp... | 1 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
// MAX int 2,147,483,647 -> 10桁
// MAX ll 9,223,372,036,854,775,807 -> 19桁
// MAX O(n) 10^8 -> 8回
// double pi = M_PI or acos(-1)
// printf("%.10f\n",... | 1 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n,q; string s;
cin >> n >> q >> s;
vector<int> a(n+1,0);
rep(i,1,n+1) {
if (s.substr(i-1,2) == "AC") {
a[i]++;
}
a[i] += a[i-1];
}
... | #include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
int main() {
int N, doubt=0, M=0;
cin >> N;
vector<vector<pp>> V(N, vector<pp>(0));
int A, p, q;
for (int i=0; i<N; i++) {
cin >> A;
for (int j=0; j<A; j++) {
cin >> p >> q;
V[i].push_back(pp(p,q));
}
}
... | 0 |
#include<bits/stdc++.h>
typedef long long ll;
typedef std::pair<ll,ll> P;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, const T& b) { if (b < a) { a = b... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int main(){
int n;
cin >> n;
string s = "";
while(n != 0){
int r = n%2;
if (r < 0) r +=2;
n = (n-... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll a,b,i,cnt=0;
scanf("%lld %lld", &a, &b);
while(a<=b){
string s;
s = to_string(a);
if(s[0]==s[4] && s[1]==s[3]){
cnt++;
}
a++;
}
printf("%lld\n", cnt);
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int a12 = a/1000;
int a21 = a12/10 + a12%10*10;
int b12 = b/1000;
int b21 = b12/10 + b12%10*10;
// 上２ケタがa12でaより小さいのを弾く
int count_less_than_a = 0;
for (int i = 0; i <= 9; i++) {
if (a12*1000 + i*100 + a21 < a... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n; cin>>n;
ll ans=1;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | 1 |
#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
using namespace std;
bool furui[10010];
vector<int> prime;
vector<int> twin;
void mkprime() {
for(int i = 0; i < 10010; i++) furui[i] = true;
furui[0] = furui[1] = false;
for(int i = 0; i < 10010; i++) {
if(furui[i]) {
prime.push_ba... | #include <iostream>
#include <cmath>
using namespace std;
bool isprime(int n);
int main(void){
int n;
while(1){
cin>>n;
if(n==0)break;
for(int j=n;j>0;j--){
if(isprime(j) && isprime(j-2)){
cout<<j-2<<" "<<j<<endl;
break;
}
}
}
return 0;
}
bool isprime(int n){
f... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
typedef vector<int> IntVector;
IntVector a(n, 0);
for (int i = 0; i < n; ++i)
cin >> skipws >> a[i];
IntVector::const_reverse_iterator ritEnd = a.rend();
for (IntVector::const_reverse_iterator rit = a.rbegin(); rit !=... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[100];
cin>>n;
for(int i=0; i<n; i++) cin>>a[i];
for( int i=0; i< n-1-i; i++) swap(a[i],a[n-1-i]);
for( int i=0; i<n; i++){
if(i) cout<<" ";
cout<<a[i];
}
cout<<e... | 1 |
#include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
UL S[2001][2001] = {};
UL J1[2001][2001] = {};
UL J2[2001][2001] = {};
void Query() {
UL y1, y2, x1, x2; cin >... | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
char s[2003][2003];
char l[2003][2003];
int pr[2003][2003];
int pl[2003][2003];
int pu[2003][2003];
int pd[2003][2003];
int c[2003][2003];
int p[2003];
int main()
{
... | 1 |
/**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bi... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a... | 1 |
#include <iostream>
#include <iterator>
#include <vector>
#include <algorithm>
using namespace std;
void swap(int &a, int &b) {
int t = a;
a = b;
b = t;
}
int partition(vector<int> &A, int p, int r) {
int x = A[r];
int i = p;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
swap(A[i], A[j]);
i++;
}
}... | #include <stdio.h>
#define N 1000000
int n;
int S[N];
int partition(int n){
int x = S[n];
int i,p=0;
int tmp;
int j;
for(i = 0;i < n;i++){
//printf("%d\n",i);
if(S[i] <= x){
tmp = S[i];
S[i] = S[p];
S[p] = tmp;
p++;
}
/*
for(j=0;j<n+1;j++){
printf("%d ",S[j]);
}
printf("\n");
prin... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll N; cin >> N;
vector<ll> A(N, 0);
map<ll, ll, greater<ll>> m;
for (int i = 0; i < N; ++i) {
cin >> A[i];
m[A[i]]++;
}
int cnt = 0;
... | #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 <iostream>
#include <vector>
#include <stack>
#define FOR(i,n) for(int i=0;i<n;i++)
using namespace std;
void makeStackRecur(vector<vector<int> > &g, int u, stack<int> &out, vector<bool> &seen) {
seen[u] = true;
for(int v: g[u])
if (! seen[v])
makeStackRecur(g, v, out, seen);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N, u, v; cin >> N >> u >> v;
u--; v--;
vector<vector<int>> e(N);
for(int i = 0; i < N-1; i++){
int x,y; cin >> x >> y;
x--; y--;
... | 0 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >... | #include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
string S;
cin >> S;
int len = S.size();
int ans = 1000;
for (int i = 0; i < len - 2; i++){
int x = (S[i] - '0') *... | 0 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 4e18;
ll n, m, mn = M;
vector<ll> ve[1005];
vector<ll> ans;
vector<ll> now;
ll vv[1005];
void dfs(ll p)
{
if(now.size() != 0 && p == now[0])
{
if(mn > now.size())
{
mn... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
bool digits[10] = {false};
for (int i = 0; i < k; ++i) {
int x; cin >> x;
digits[x] = true;
}
while (n <= INT_MAX) {
int tmp = n;
while (tmp) {
int d = ... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef u... | 0 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
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&... | #include <bits/stdc++.h>
using namespace std;
using ll=long;
#define V v[i]
int main(){
ll t;cin>>t;
while(t--){
ll n,Q=0;cin>>n;
vector<ll>v(n),N;
for(ll &p:v)cin>>p;
string s;cin>>s;
for(ll i=n-1;i>=0;i--){
for(ll p:N)V=min(V,V^p);
N.push_back(V);
Q|=s[i]=='1'&&V;
}
... | 0 |
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<ty... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
int C;
int D;
int L;
int R;
cin >> A >> B >> C >> D;
L = A + B;
R = C + D;
if (L > R){
cout << "Left" << endl;
}
else if (L == R) {
cout << "Balanced" << endl;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,Q;
cin >> N >> Q;
vector<int> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
vector<int> cumsumL(N+1);
vector<int> cumsumR(N+1);
for(int i=1; i <= N; i++){
cumsumL.at(i)= cumsumL.at(i-1)+ data.at(i-1);
cumsumR.at(i)= c... | #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 ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n !=... | #include<iostream>
using namespace std;
int main(){
int n,t;
cin>>n>>t;
int a[n];
long long ans=0;
cin>>a[0];
for(int i=1;i<n;i++){
cin>>a[i];
if(a[i]-a[i-1]>t){
ans+=t;
}else{
ans+=a[i]-a[i-1];
}
}
ans+=t;
cout<<ans<<endl;
... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#d... | #include<cstdio>
#include<algorithm>
using namespace std;
const int N=2010;
int n,m,ans,a[N][N],up[N],L[N],R[N];
char s[N];
int main(){
scanf("%d%d",&n,&m);ans=max(n,m);
for(int i=1;i<=n;i++){
scanf("%s",s+1);
for(int j=1;j<=m;j++)
a[i][j]=s[j]=='.'?0:1;
}
--n;--m;
for(in... | 0 |
#include<iostream>
#include<cstdio>
using namespace std;
int main() {
int siz[6], damy;
char mozi[2];
for (int abc = 0; abc < 6; abc++) {
cin >> siz[abc];
}
fgets(mozi,2,stdin);
while(true){
fgets(mozi,2,stdin);
if (mozi[0] == '\n') {
cout << siz[0] << endl;
break;
}
switch (mozi[0]) {
case 'S':... | #include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
#include<functional>
#include<utility>
using namespace std;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 0;
for(int i = 1; i <= n; i++){
if(i % 3 == 0 && i % 5 == 0) {
//FizzBuzz
} else if(i % 3 == 0) {
//Fizz
} else if(i % 5 == 0) {
//Buzz
} else {
ans = ans + i;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
cout<<(1+n)*n/2-(3+n-n%3)*(n-n%3)/3/2-(5+n-n%5)*(n-n%5)/5/2+(15+n-n%15)*(n-n%15)/15/2<<endl;
}
| 1 |
#include <iostream> // cout, endl, cin
#include <cmath> //sqrt pow
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // in... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
#include<bitset>
using name... | 0 |
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll ... | #include <iostream>
#include <vector>
#include <algorithm>
#define llint long long
#define mod 1000000007
using namespace std;
llint n;
llint a[500005], s[500005];
llint z[500005];
vector<llint> vec[500005];
llint sum[500005];
llint dp[500005];
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
fo... | 0 |
#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 all(x) (x).begin(),(x).end()... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... | 1 |
#include<iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include<map>
#include<cstring>
#include<iomanip>
#include <string>
#include <vector>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long unsigned llu;
typedef long double ld;
#define ll long long
#define PI 3... | #include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
int n,r,k;
cin>>n>>r;
k=10;
if(n<10){k=n;}
r=r+100*(10-k);
cout<<r;
return 0;
}
| 0 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #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... | 0 |
#include <cstdio>
#include <cstring>
#define MAX_N 105
int N, A, B, C, D, S[MAX_N + 1];
int main()
{
scanf("%d", &N);
for (int i = 0; i < (N * N - N) / 2; i++)
{
scanf("%d", &A);
scanf("%d", &B);
scanf("%d", &C);
scanf("%d", &D);
if (C > D) { S[A] += 3; }
if (C < D) { S[B] += 3; }
if (C == D) { S[... | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
struct comparator {
int operator() (const pair<int, int>& l, const pair<int, int>& r) {
return l.second < r.second;
}
};
int main(int argc, char *argv[]) {
// second = team's number ... | 1 |
#include <iostream>
#include <cmath>
#include <map>
#include <set>
using namespace std;
int main() {
int n;
scanf("%d", &n);
map<pair<int, int>, set<int>> pair_index;
for(int i=0; i<n; i++){
double x;
int pow2=0, pow5=0;
unsigned long long val;
scanf("%lf", &x);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 99... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define F first
#define S second
#define fore(i,b,e) for... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = ... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.