code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<queue>
#include<bitset>
#include<cstdlib>
#include<set>
#include<unordered_map>
#define l(x) (x<<1)
#define r(x) ((x<<1)|1)
#define low(x) (x&(-x))
#define IL inline
#define reg register
#de... | #include<bits/stdc++.h>
using namespace std;
int vis[1010][1010];
inline vector<pair<int,int> > getdistant(int n,int D1,bool hasret=true)
{
int cnt[2]={0,0};
vector<pair<int,int> > ret,trans;
for(int i=0;i<n;i++)
{
int v=round(sqrt(D1-i*i));
if(v*v+i*i==D1)trans.push_back(make_pair(i,v)),trans.push_back(make_pa... | 0 |
#include<cstdio>
int H,W,A[2010][2010],h[2010],l[2010],stk[2010];
char S[2010][2010];
void cmax(int&a,int b){b>a?a=b:1;}
int main(){
scanf("%d%d",&H,&W);
for(int i=0;i<H;i++){
scanf("%s",S[i]);
for(int j=0;j<W;j++){
S[i][j]=S[i][j]=='#';
if(i&&j)A[i][j]=S[i][j]^S[i][j-1]^S[i-1][j]^S[i-1][j-1]^1;
}
}
int... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T>
map<T,T> fact(T n){
map<T,T> Map;
for(T i = 2; i * i <= n; i++){
while(n % i == 0){
Map[i]++;
n /= i;
}
}
if(n == 1)return Map;
Map[n]++;
return Map;
}
int main()
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<str... | #include <vector>
#include <algorithm>
#include <iostream>
#include <climits>
using namespace std;
typedef long long int int64;
vector<int64> P,Q;
int64 N,M,T;
int main(void)
{
while(true)
{
N = 0;
M = 0;
P.clear();
Q.clear();
P.shrink_to_fit();
Q.shrink_to_fit();
cin >> N >> M;
if(N == 0 && M == 0)... | 0 |
#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 200200;
typedef long long ll;
const int mod = 998244353;
inline ll pow(ll a,int b,int ans = 1) {
for(;b;b >>= 1,a = a * a % mod) if(b & 1)
ans = ans * a % mod;
return ans;
}
... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0;... | 0 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> a(5);
for(int i = 0; i < 5; i++) cin >> a[i];
long long b = 1e17;
for(int i = 0; i < 5; i++) b = min(b, a[i]);
long long t = (N + b - 1) / b;
long long ans = 5 + t - 1;
cou... | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | #include <iostream>
#include <algorithm>
#include <map>
using namespace std;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
int main(){
int n,K;
while(cin >> n >> K , n + K){
map<string,int> m;
string str[11],in;
rep(i,n){
cin >> str[i];
}
int cnt = 0;
... | 0 |
// ====================================
// author: M_sea
// website: https://m-sea-blog.com/
// ====================================
#include <bits/stdc++.h>
#define file(x) freopen(#x".in","r",stdin); freopen(#x".out","w",stdout)
#define debug(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
typedef long long... | #include <iostream>
#include <vector>
using namespace std;
int main(){
long long K;
while(cin >> K){
vector<long long> res(50, 49+(K+49)/50);
long long n = (K+49)/50*50;
while(n > K){
int mIdx = 0;
for(int i=1;i<50;i++) if(res[mIdx] < res[i]) mIdx = i;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
const long long inf = 1e18;
int n, H[N], P[N];
int a[N];
long long f[N][N];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) cin >> H[i] >> P[i], a[i] = i;
sort(a + 1, a + n + 1, [&](int x, int y) {... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod*3LL;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int N = 100001;
vector<vector<int> > fat(N,vector<int> (20,-1));
int par(int now,in... | 0 |
#include <iostream>
#include <string>
//Hoshino search and replace Hoshina
void replace_word(std::string s){
const std::string find_word("Hoshino");
//Hoshino search
std::string::size_type pos = s.find(find_word);
while(pos != std::string::npos){
//Hoshino replace Hoshina
s.replace(pos, find_word.length(), "Ho... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define MOD 998244353
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num ... | 0 |
/* /$$ /$$
| $$ | $$
/$$$$$$$ /$$$$$$ /$$$$$$$ /$$$$$$ /$$$$$$$ /$$$$$$ /$$$$$$
/$$__ $$ /$$__ $$ /$$_____/ /$$__ $$ /$$__ $$ /$$__ $$ /$$__ $$
| $$ | $$| $$$$$$$$| $$ | $$ \ $$| $$ | $$| $$$$$$$$| $$ \__/
| $$ | $... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
ll cnt[66][2];
int main(){
int n;cin>>n;
for(int i=0;i<n;i++){
ll a;cin>>a;
int bit=0;
while(a){
if(a&1){
cnt[bit][1]++;
}else cnt[bit][0]++;
a/=2;
bit++;
}
for(int j=bit;j<=64;j++)cnt[j][0]++;
}
ll an... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans;
ans=0;
cin >> n;
vector<string> s(3);
for(int i=0;i<3;i++){
cin >> s[i];
}
for(int i=0;i<n;i++){
if(s[0][i]==s[1][i] && s[0][i]==s[2][i]);
else if(s[0][i]==s[1][i] || s[0][i]==s[2][i] || s[1][i]==s[2][i])ans++;
else ans+=... | #include<iostream>
#include<bits/stdc++.h>
#include<vector>
using namespace std;
int main()
{
int n,l;
cin>>n;
vector<int>v;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int d=a[0];
int c=0;
for(int i=0;i<n;i++){
if(a[i]<=d){
c++;
v.push_back(a[i]);
d=a[i];
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
#define matrix vector<vector<char>>
#define zero(n,m) matrix(n , vector<char>(m,'0'))
#define one(n,m) matrix(n , vector<ll>(m,1))
#define pii pair<int,int>
#define point complex<ld>
#define ang... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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) { ... | 0 |
// luogu-judger-enable-o2
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftre... | #include<cstring>
#include<cstdio>
#define max(a,b) (a>b?a:b)
int dp[305][305][305],mk,len;
char a[305];
int main(){
scanf("%s%d",a+1,&mk);
len=strlen(a+1);
for(int i=1;i<=len;i++)
for(int j=i;j>=1;j--){
if(i==j){for(int k=0;k<=mk;k++) dp[j][i][k]=1;continue;}
for(int k=0;k<=mk;k++)
if(k) dp[j][i][k]=max... | 1 |
#include<iostream>
using namespace std;
int main(){
int n=1;
int a = 0;
int f = 0;
int quest[10000] = { 1 };
double ans[10000];
int checkc = 0;
int i = 4;
double check[3] = { 1, 2, 4 };
do{
cin >> quest[a];
a++;
} while (quest[a-1] != 0);
while (a > f+1){
switch (quest[f]){
case 1:
ans[f] = 1;
... | #include <iostream>
#define reep(i,n,m) for(int i=(n);i<(m);i++)
#define rep(i,n) reep(i,0,n)
using namespace std;
int main(){
int n;
while(cin >> n,n){
int dp[35]={0};
dp[0]=1;
rep(i,n){
dp[i+1] += dp[i];
dp[i+2] += dp[i];
dp[i+3] += dp[i];
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI acos(-1)
int main(){
long long x,y,d,ans;
bool minus_x = false,minus_y = false;
cin >> x >> y;
if(x < 0)minus_x = true;
if(y < 0)minus_y = true;
d = abs(abs(x) - abs(y));
if(x == 0 || y == 0){
if(x == 0 ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y; cin >> x >> y;
int ans = 0;
if(x>0){
if(y>0){
if(x>y){
ans++; // x -> -x
ans += abs(x-y); // x -> -y
ans++; // x-> y
}else if(x < y){
ans+= y-x; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k; cin >> a >> b >> k;
for (int i=0; i<k; ++i) {
int na, nb;
if (i%2 == 0) {
na = a/2;
nb = b + a/2;
} else {
nb = b/2;
na = a + b/2;
}
a = na;
b ... | #include<iostream>
using namespace std;
int a[1000005];
int main(){
int k,i;
cin>>a[0]>>a[1]>>k;
for(i=0;i<k;i++){
a[!(i&1)]+=(a[i&1]>>=1);
}
cout<<a[0]<<" "<<a[1];
return 0;
} | 1 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
int n, m, f[10001] = { 0 }, s[10001] = { 0 }, ss[501] = {0}, f_, s_, cnt = 0;
int up = 0, down = 0;
cin >> n >> m;
ss[1] = 3;
while (n != 0 && m != 0)
{
memset(ss, 0, sizeof(ss));
for (int i = 0; i < m... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e+9;
typedef pair<int, int> P;
typedef pair<P, int> pi;
int main() {
vector<pi> data;
for(int y = 1; y <= 150; ++y){
for(int x = y + 1; x <= 150; ++x){
data.push_back(pi(P(x * x + y * y, y), x));
}
}
sort(data.begin(), data.end());
int h, w;
... | 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 pqueue(x) priority_queue<x,v... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 |
#include<bits/stdc++.h>
#define reg register int
#define il inline
#define fi first
#define se second
#define mk(a,b) make_pair(a,b)
#define numb (ch^'0')
#define pb push_back
#define solid const auto &
#define enter cout<<endl
#define pii pair<int,int>
using namespace std;
typedef long long ll;
template<class T>il voi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; //10^18
const int inINF = 1000000000; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 = 998244353... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MN = 20123, INF = 5012345, MOD = 1000 * 1000 * 1000 + 7;
int inv[INF], fict[INF], invf[INF], dp[MN][MN];
void fact() {
fict[0] = inv[0] = invf[0] = 1;
fict[1] = inv[1] = invf[1] = 1;
for (int i = 2; i < INF; i++) {
inv[i] = 1ll * inv[MOD % i] * (MOD - MOD /... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef d... | 1 |
#include <cstdio>
int main() {
int a, b, c, d, e, tot = 0;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
if (c < a) c += 24;
tot += (c - a) * 60 + (d - b);
printf("%d", tot - e);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (a == b) {
ans = a + b;
} else {
int mx = max(a, b);
ans = mx + mx - 1;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
ll A, B;
cin >> N >> A >> B;
ll X[N];
for (int i = 0; i < N; i++) {
cin >> X[i];
}
ll e[N- 1];
for (int i = 0; i < N - 1; i++) {
e[i] = X[i + 1] - X[i];
}
ll ans = 0;
for ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
bool Bsearch(int key, int A[], int len) {
int l = 0, r = len - 1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (A[mid] > key)
r = mid - 1;
else if (A[mid] < key)
l = mid + 1;
else
return true;
}
return false;
}
int main() {
int n, ... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
using namespace std;
int ar_s[10000];
bool linear_search(int t, int n){
int c = 0;
for (int i = 0; i < n; i++) {
if (ar_s[i] == t) return true;
}
return false;
}
int main(int argc, char const* argv[])
{
int n,q, c = 0;
scanf("%d ",... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, k, d[4019][4019] = {1}, p[4019] = {1};
cin >> k >> n;
for (in... | #include<bits/stdc++.h>
#define mod 998244353
#define maxn 1000005
using namespace std;
typedef long long LL;
int read()
{
char c=getchar();int f=1,sum=0;
while(c<'0' || c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0' && c<='9'){sum=sum*10+c-'0';c=getchar();}
return sum*f;
}
int n,m;
LL fac[maxn],inv[m... | 0 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #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);
string s; cin >> s;
int n = s.size();
REP(i, n - 8)
cout << s[i];
cout << '\n';
return 0;
} | 1 |
#include <iostream>
using namespace std;
int main(int argc, char** argv){
int n, pm, pe, pj;
while( 1 ){
cin >> n;
if(n==0) break;
for(int i=0; i<n; i++){
cin >> pm;
cin >> pe;
cin >> pj;
if(pm==100 || pe==100 || pj==100){
cout << "A" << endl;
continue;
}
if((pm+pe) / 2 ... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F fi... | 0 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int minx=200,miny=200,maxx=-200,maxy=-200;
for(int i=0;i<n;i++){
int a;
cin>>a;
maxx=max(maxx,a);
minx=min(minx,a);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pii pair<ll,ll>
#define debug(a) { cout << #a << " = " << a << endl;}
void sep() {
cout << "-------------BLOCK-----------------\n";
}
template<typename T>
void debugv(vector<T> arr) {
for (auto t: arr)
... | 0 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<pair<int, int>> red;
ve... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define U(v) cerr << #v << ": " << (v) << endl
template <class T>
struct BIT {
vector<T> a;
BIT(int size) : a(size, 0) {}
T sum(int r) const {
T sm = 0;
for (--r; r >= 0; r = (r & r + 1) - 1)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MOD=1000000007;
int n,k;
LL fac[4000000],inv_fac[4000000],dp[2001];
void check_mod(LL &a) { if (a>=MOD) a%=MOD; }
int ksm(LL a, int b)
{
LL ret=1ll;
while (b) {
if (b&1) ret*=a;
check_mod(ret);
a*=a;
check_mod(a);
b>>=1;
}
retur... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9+7;
void add(int64_t& a, int64_t b){
a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
a = a*b % MOD;
}
vector<int64_t> fact, seq_inv, fact_inv;
void create_fact_mod(int num){
fact[0] = fact[1] = 1;
for(int i=2; i<=num; i++) fact[... | 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 << "Left" << endl;
}
else {
cout << "Right" << endl;
}
return 0;
} | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の入力を受け取る
vo... | 1 |
#include <iostream>
using namespace std;
int main() {
string S,T;
cin>>S>>T;
cout<<T+S;
return 0;
}
| #include<stdio.h>
int main(){
char S[100], T[100];
scanf("%s %s", S, T);
printf("%s%s\n", T, S);
return 0;
}
| 1 |
#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 << "] " ... | #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() {
ll N, M, Q, L, R;
cin >> N >> M >> Q;
vector<vector<ll>> sum(N+1, vector<ll>(N+1));
rep(i,M) {
cin >> L >> R;
++sum[L][R];
}
... | 1 |
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#define INF (int)1e9
void dijkstra(int m, int p, int q, std::vector<std::vector<std::pair<int, int> > > &v);
int main(void) {
int n;
int m;
int a;
int b;
int cost;
int time;
int k;
int p;
int q;
int r;
... | #include <iostream>
using namespace std;
#define INF 10000000
int t[101][101], s[101][101];
int main(void){
int n,m;
while(cin>>n>>m, n){
for(int i=0;i<=m;i++) for(int j=0;j<=m;j++) t[i][j] = s[i][j] = INF;
for(int i=0;i<n;i++){
int a,b,cost,time;
cin>>a>>b>>cost>>time;
t[a][b] = t[b][a] = cost;
s... | 1 |
#include<iostream>
#include<queue>
using namespace std;
#define REP(i, n) for(int i=0; i<n; i++)
typedef struct{
int idx[3];
}int3;
typedef struct{
int status[20][20];
}int20;
typedef vector<pair<int, int > > vecpair;
int20 map;
int dir[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
int w, h;
pair<int3, vec... | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(in... | 0 |
#include <bits/stdc++.h>
#define gc( ) std::getchar( )
#define pc( i ) std::putchar( i )
template < typename T >
inline T read( )
{
register T x = 0;
register char ch = gc( );
register bool f = 0;
while( !std::isdigit( ch ) )
{
f = ( ch == '-' );
ch = gc( );
}
while( std::isdigit( ch ) )
{
x = x * 10 + ... | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, const T b) {
if(a >= b) return false;
a = b;
... | 1 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,k;
... | 0 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const ll p = 998244353;
ll powmod(ll a, ll b){
if(b==0) return 1;
if(b%2==1) return (a*powmod(a,b-1)) % p;
else{
ll x = powmod(a,b/2);
return (x*x) % p;
}
}
ll combi... | #include<bits/stdc++.h>
#define ll long long int
#define mod 998244353
#define ld long double
#define pb push_back
#define inf INT_MAX
#define N 1000000
using namespace std;
int n,m,k;
ll ans=0;
ll inv[N+3];
ll fact_inv[N+3];
ll fact[N+3];
//modulo inverse
void inverse(){
inv[1]=1;//MMI
int i;
for(i=2;i<=N;i++){
... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
char s[N],t[N];
int n,ans,l=1,r,last,q[N];
int main(){
scanf("%d%s%s",&n,s+1,t+1),last=n;
for(int i=n;i;){
while(last&&(i<last||s[last]!=t[i])) --last;
if(!last) {puts("-1");return 0;}
while(l<=r&&q[l]-r+l-1>=i) ++l;
q[++r]=last;
if(i!=last) an... | #include <stdio.h>
int main (){
int baris,kolom,warna,x;
scanf ("%d",&baris);
scanf ("%d",&kolom);
scanf ("%d",&warna);
if (baris > kolom){
x = (warna - 1)/baris +1;
}
else {
x = (warna - 1)/kolom +1;
}
printf ("%d",x);
return 0;
} | 0 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <lim... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<int> cost(N);
for(int i = 0; i < N; ++i)
cin >> cost[i];
vector<int> score(N, 0);
while(M--) {
int x; cin >> x;
for(int i = 0; i < N; ++i) {
if(cost[i] <= x) {
... | 1 |
#include <iostream>
using namespace std;
const int BASE = 6200;
int N, mod;
int dp[6009][12409][3];
long long ret[12409];
void solve(int p1, int p2) {
// 最大値を更新する場合
for (int i = 0; i <= 2; i++) {
int r = 0;
if (i == 0) r = -1;
if (i == 1) r = 1;
dp[p1][p2][0] += 1LL * dp[p1 - 1][p2 - r][i] % mod;
if (dp[p... | #include <bits/stdc++.h>
using namespace std;
int64_t MOD;
void add(int64_t& a, int64_t b){
a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
a = a*b % MOD;
}
vector<int64_t> fact, seq_inv, fact_inv;
void create_fact_mod(int num){
fact[0] = fact[1] = 1;
for(int i=2; i<=num; i++) fact[i] = fact[i-1]... | 1 |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<dec... | #include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
int n, a[330], dp[300*303], d2[300*303], ans = 1, sum;
int expo(int b, int e) {
if(e == 0) return 1;
if(e & 1) return 1ll * b * expo(1LL * b * b % MOD, e >> 1) % MOD;
return expo(1LL * b * b % MOD, e >> 1);
}
int inv_mod(int x) { retur... | 1 |
#include<bits/stdc++.h>
#define dro first
#define adg second.first
#define mog second.second
#define ll long long
using namespace std;
const int N = 500001;
int n,r,pos,l,x,U,D,S;
long long ans;
int K;
string s;
int fix[100],fix1[100],A[100],B[100];
int dp[305][305][305];
int main(){
cin>>s;
n... | #include<bits/stdc++.h>
using namespace std;
inline void upmax(short &x,const short &y){if(y>x) x=y;}
const int N=105;
short f[N][N][N][N];
short sum1[N][N],sum2[N][N];
int n,m,tx,ty;
void gao()
{
int limu=tx-1,limd=n-tx,liml=ty-1,limr=m-ty;
for(int u=0;u<=limu;u++)
for(int d=0;d<=limd;d++)
... | 0 |
#include<iostream>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max = 1e3 + 7;
int lst[Max];
int n;
bool check()
{
for (int i = 1; i <= n; i++)
{
if (lst[i] % 2 != 0) return false;
else lst[i] /= 2;
}
return true;
}
int main()
{
cin >> n;
for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd( ll x, ll y );
ll lcm( ll x, ll y );
int main()
{
int n, c, a[11];
while ( true ) {
memset( a, 0, sizeof(a) );
scanf("%d", &n );
if ( n == 0 ) break;
for ( int i = 0; i < n; i++ ) {
scanf("... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define f(i,a,n) for(ll i=a;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll isPrime(int n)
{
// Corner cases
if (n <= 1)
return 1;
if (n <= 3)
return 2;
// This is checked so that we can skip
// mid... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int n, m, s, c;
int ans = 0;
vector<int> a(5, -1);
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> s >> c;
if (s == 1 && c == 0 && n != 1) ans = -1;
if (a[s] == -1 || a[s] == c) a[s] = c;
... | 0 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define r... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) f... | 1 |
#include <stdio.h>
int main()
{
int i;
int mark[2] = { 0 };
int a, b, n;
while ((scanf("%d", &n)) != EOF)
{
mark[0] = 0; mark[1] = 0;
if (n == 0) break;
for (i = 0; i < n; i++)
{
if (scanf("%d%d", &a, &b) == EOF) break;
if (a < b) mark[1] += (a + b);
else if (a > b) mark[0] += (a + b);
else {... | #include <bits/stdc++.h>
#define pp push_back
#define pf push_front
#define mp make_pair
#define fs first
#define sc second
#define sf scanf
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
const int N = (int) 1e6;
const int INF = (int) 1e9 + 7;
bool comp(i... | 0 |
#include <iostream>
using namespace std;
int main(void)
{
int n;
while(cin>>n){
int date[11][11]={0};
if(!n) break;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
cin >> date[i][j];
}
}
for(int i=0;i<n;i++){
for(int j=0; j<n; j++){
date[i][n] += date[i][j];
}
}
for(int i=0;i<=n;i++)... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
int main(){
int n;
while (cin >> n, n){
int v[10] = {};
rep(i, n){
int s = 0;
rep(j, n){
int t;... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
ll gcd(ll a, ll b){ if(b==0){ return a; } retu... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> xs(n + 1), ys(m + 1);
cin >> xs[0] >> ys[0];
for (int i = 1; i <= n; ++i)
cin >> xs[i];
for (int i = 1; i <= m; ++i)
cin >> ys[i];
if (*max_element(xs.begin(), xs.end... | 1 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main(){
int n,k;
while(cin>>n>>k){
if(n==0){
break;
}
int d[20]={},cnt[10000]={},c;
for(int i=0;i<n;i++){
cin>>d[i];
}
if(k==2){
c=0;
for(int i=0;i<n;i++){
f... | #include<cstdio>
#include<algorithm>
#include<vector>
#include<sstream>
#include<cstdlib>
using namespace std;
int main(){
while(1){
int n,k;
scanf("%d%d",&n,&k);
if(n==0)
break;
vector<int> card(n);
for(int i=0;i<n;i++){
scanf("%d",&card[i]);
}
sort(card.begin(),card.end());
vector... | 1 |
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_6_B&lang=jp
#include <iostream>
using namespace std;
void swap(int A[],int i,int j){
int buf = A[j];
A[j] = A[i];
A[i] = buf;
}
int partition(int A[], int l, int r){
const int x = A[r]; //????????¨?????????
int i = l-1; //??§??????????????????... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
lli partition(vll& a,lli p,lli r){
lli x = a[r];
lli i = p-1;
for(lli j = p;j < r;j++){
if(a[j] <= x){
i++;
swap(a[j],a[i]);
}
}
swap(a[i+1],a[r]);
return i+1;
}
lli n;
vll... | 1 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
while( true ) {
long long int n;
cin >> n;
if ( n == 0 ) break;
vector< long long int > k;
for ( long long int i = 0; i < n; i++ ) {
long long int in;
cin >> in;
k.push_back( in );
... | #include<iostream>
#include<queue>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int n,m,dt;
while(1){
cin>>n>>m;
if(!(n&&m))break;
priority_queue<int> que;
rep(i,n){cin>>dt;que.push(dt);}
int cnt=0,sum=0;
while(!que.empty()){
cnt++;
if(cnt!=... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin>>n;
vector<long long> a(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
long long sum=0;
for(int i=0;i<n;i++){
sum=(sum+a.at(i))%1000000007;
}
long long ans=0;
ans=(sum*sum)%1000000007;
for(int i=0;i<n;i++){
ans=(an... | 1 |
#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
int sum = 1, cnt = 0;
while(sum < b) {
sum += a-1;
... | #include<iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int a, b,i=0;
cin >> a >> b;
while (1) {
if (a * i... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int,int> PI;
typedef pair<int,pair<int,int>> PII;
static const int INF=1010000000000000017LL;
static const double eps=1e-12;
sta... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF=INT_MAX/4;
const long long MOD=998244353;
const double EPS=1e-14;
const bool DEBUG=false;
const string YES = "YES";
const string NO = "NO";
const string Yes = "Yes";
const string No = "No";
templa... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define sp " "
#define endl "\n"
#define MAX 10e9
#define MAXN 100001
#define mod 1000000007
#define inf_int 2e9
#define inf_ll 2e18
#define e 1e-9
#define vi vector<int>
#define vl vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpl vector<pair<l... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int a,b;
cin>>a>>b;
long long int ans=max(a,b);
if(a>=b){
a--;
if(a>0&&a>=b){
cout<<ans+a;
}
else{
cout<<ans+b;
}
}
else{
b--;
if(b>0&&b>=a){
cout<<ans+b;
}
e... | #include <iostream>
using namespace std;
int main()
{
int a, b, ans = 0;
cin >> a >> b;
ans += max(a , b);
if(a == b) ans += max(a, b);
else ans += ans - 1;
cout << ans << endl;
return 0;
} | 1 |
#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<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<cstring>
#include<fstream>
#include<algorithm>
using namespace std;
typedef long long LL;
const int INF=0x3f3f3f3f;
const int MAXN=1e5+5;
int tot,head[MAXN];
LL dist[MAXN];
bool vis[MAXN... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll x; cin >> x;
ll nokori = x % 11;
ll ans = (x-nokori) / 11;
ans *= 2;
if(nokori > 6){
ans += 2;
} else if(nokori > 0) {
ans... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string N;
cin >> N;
if(N[0] == '7' || N[1] == '7' || N[2] == '7')
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
#define all(a) a.begin(), a.end()
const int MOD = 1e9+7;
const int INF = 1e9;
int main(){
int D, G;
cin >> D >> G;
vector<pii> points;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int N, M;
vector<in... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long A,B,M;
cin>>A>>B>>M;
vector<int> a(A);
for(int i=0;i<A;i++)
cin>>a.at(i);
vector<int> b(B);
for(int i=0;i<B;i++)
cin>>b.at(i);
vector<vector<int>> c(M,vector<int>(3));
for(int i=0;i<M;i++){
for(int j=0;j<3;j++)
cin>>c.... | #include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
vector<int> twoThrow;
int n;
int m;
int point[1000];
int ans;
while (1){
twoThrow.clear();
scanf("%d%d", &n, &m);
if (n == 0){
break;
}
for (int i = 0; i < n; i++){
scanf("%d", &point[i]);
... | 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 = 1; i <= (n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
int x[10],y[10];
int n;
double f(int i, int j) {
double dx = x[i] - x[j];
double dy = y[i]... | #include "bits/stdc++.h"
#define ff first
#define ss second
#define szof(_x) ((int) (_x).size())
#define TASK_NAME ""
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 7;
const ll INFL = 1e18 + 123;
const double PI = atan2(0, -1);
mt19937 tw(960172);
ll rnd(ll x, ll y) { stat... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,... | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
#defi... | 0 |
#include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin()... | // /*
// "Won't stop until I'm phenomenal."
// - Phenomenal, Eminem
// */
// #include<bits/stdc++.h>
// using namespace std;
// typedef long long int ll;
// #define ff first
// #define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
// #define ss second
// #define all(c) c.begin(),c.end()
// ... | 1 |
#include<iostream>
int main(){
int x,n=1;
std::cin>>x;
for(int i=0;i<3;++i){
n=n*x;
}
std::cout<<n<<std::endl;
}
| #include <iostream>
using namespace std;
int main(void)
{
int input;
int output;
cin >> input;
output = input * input * input;
cout << output << endl;
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int a,b,c;
while(cin>>a>>b>>c && (a||b||c)){
int i,n;
cin>>n;
int res[a+b+c+1];
int tmp[n][3];
fill(res,res+a+b+c+1,2);
for(i=0;i<n;i++){
int I,J,K,R;
cin>>I>>J>>K>>R;
if(R == 1){
res[I] = res[J] = res[K] =... | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<32;;
int n,m;
ll dis[300][300];
int main()
{
cin >> n >> m;
int i,j,k;
for(i = 0;i < n;i++)
for(j = 0;j < n;j++)
{
if(i == j)
dis[i][j] = 0;
else
di... | 0 |
#include <iostream>
using namespace std;
int main(){
int n,h,w;
cin>>n>>h>>w;
int count = (n-h+1)*(n-w+1);
cout<<count<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n,w,h;
cin>>n>>h>>w;
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(n-i+1>=h&&n-j+1>=w)
cnt++;
}
}
cout<<cnt<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define _ << ' ' <<
using namespace std;
using ll = long long;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if (c > min(a, b) && c < max(a, b))
cout << "Yes";
else
cout << "No";
}
| /*
author : nishi5451
created : 14.08.2020 21:24:46
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
const int INF = 2020202020;
int main(){
int n,m,x,y;
cin >> n >> m >> x >> y;
int l = x, r = y;
rep(i,n){
int a;
... | 0 |
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
size_t ldistance(string s, string t) {
/* Levenshtein Distance */
size_t slen=s.length(), tlen=t.length();
vector<vector<size_t>> dp(slen+1, vector<size_t>(tlen+1));
for (size_t i=0; i<=slen; ++i)
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(){
string s1,s2;
cin >> s1 >> s2;
//d[i][j]:=?????????s1???1?????????~i??????????????§?????¨??????????????¨?????????s2???1?????????~j??????????????§?????¨?????????????????¨????????¢
//(index???0?????¨??????... | 1 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n,p;//~50
int stone,player[50]={};
int winner;
int i;
scanf("%d%d",&n,&p);
while(1){
for(i=0;i<50;i++){
player[i]=0;
}
stone=p;
for(i=0;;i++){
if(stone==0){
stone=player[i%n];
player[i%n]=0;
}
else{
stone-=1;
p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 200100;
int N;
string s;
int ans[MAXN];
bool wolo()
{
for (int i = 1; i <= N + 1; i++)
{
int av = 0;
if (s[i] == 'x') av = 1;
ans[i+1] = (av + ans[i] + ans[i-1]) % 2;
if (i + 1 >= N && ans[i+1... | 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... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#inc... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
/* ちゃんと考えてわかって実装 */
// O(\sqrt{n})
vector<ll> divisor(ll n){
vector<ll> res;
for(ll i=1; i*i <= n; i++){
if(n%i == 0){
res.push_back(i);
if(i != n / i) res.push_back(n / i);
}
... | #include<cstdio>
#include<utility>
#include<iostream>
#define RI register int
#define CI const int&
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef pair <int,int> pi;
const int N=1005,dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
inline char get_ch(void)
{
char ch; while (ch=getchar(),ch!='#'... | 0 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
const lld N = 200043;
const lld MOD = 1000000007;
lld add(lld x, lld y)
{
x =((x%MOD)+(y%MOD))%MOD;
while(x >= MOD) x -= MOD;
while(x < 0) x += MOD;
return x;
}
lld mul(lld x, lld y)
{
return ((... | #include <iostream>
#include <vector>
using namespace std;
int main(){
long long N,ans=0;
cin>>N;
vector<long long> A(N);
for(int i=0;i<N;i++) cin>>A[i];
for(int i=1;i<N;i++){
if(A[i]<A[i-1]){
ans+=A[i-1]-A[i];
A[i] = A[i-1];
}
}
cout<<ans<<endl;
} | 0 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(){
string s;
cin >> s;
int ans = 1000;
for(int i = 0; i+2 < s.length(); i++){
int num = (s[i]-'0')*100+(s[i+1]-'0')*10+(s[i+2]-'0');
if(abs(753-num) < ans) ans = abs(753-num);
}
cout << ans << ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
ll ans = 0;
for (int i = 1; i <= n; ++i) {
if (i % 3 && i % 5) ans += i;
}
cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <bitset>
#include <complex>
using namespace std;
const double EPS = 1e-9;
co... | #include <bits/stdc++.h>
#define pb push_back
#define pll pair <ll, ll>
#define mp make_pair
#define pyshnapyshnakaa ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define x first
#define y second
#pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#define plll ... | 0 |
#include <iostream>
#include <math.h>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <cstdlib>
#include <unordered_map>
#include <numeric>
#include <functional>
#include <limits.h>
#include <utility>
#include <stack>
using namespace std;
#define fs first
#define sc second
typedef long l... | #include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
using namespace std;
inline int read(){
int v=0,f=1;
char c=getchar();
while (c<'0' || c>'9'){
if (c=='-') f=-1;
c=getchar();
}
while (c>='0' && c<='9'){
v=v*10+c-'0';
c=getchar();
}
return v*... | 1 |
#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 unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
const int S = 1 << 18;
ll seg[2*S];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, Q; cin >> N >> Q;
vector<pair<pair<ll, ll>, ll>> blocks(N);
for (int i = 0; i < N; i++) {
ll s, t, x; cin >> s ... | 1 |
/*
* Project: AtCoder Beginners Contest 137 B - One Clue
* Author: toms74209200 <https://github.com/toms74209200>
*
* Created on 2020/09/01
* Copyright (c) 2020 toms74209200
*
* This software is released under the MIT License.
* http://opensource.org/licenses/mit-license.php
*/
#include <cstdio>
#include <cs... | #include <iostream> // cout, endl, cin
#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 <cstdi... | 1 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e3 + 7, mod = 1e9 + 7;
int POW(int a, int b, int mod) {
a %= mod; int r = 1;
for(int i = b; i > 0; i >>= 1) {
if(i & 1) r = (r * a) % mod;
a = (a * a) % mod;
}
return r;
}
int f[N], n, dp[10001][1001];
vector <tuple <int, int... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9+7;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(n+1);
dp[0] = 1;
vector<int> clr(3, 0);
rep(i, n) {
... | 0 |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
if(N == 1) cout << "Hello World" << endl;
if(N == 2){
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<bool> v(26, true);
for(int i=0; i<s.size(); i++) v[s[i]-'a'] = false;
char ans;
for(int i=0; i<26; i++) {
if(v[i]) {
ans = i+'a';
cout << ans << endl;
break;
}
else if(i==25) cout << "None... | 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)
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
#define FS fix... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
// freopen("AGC010-D.in", "r", stdin);
int n, cur = 0;
cin >> n;
vector<int> arr(n);
copy(istream_iterator<int>(cin), istream_iterator<int>(), arr.begin());
string str[] = {"First", "Second"}, ans;
while (ans.empty()) {
int cnt = count_if(arr.begin(), ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace... | #include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define mes(a,b) memset((a),(b),sizeof((a)))
#define syio std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0);
#define lson l, mid, rt << 1
#define rson mid+1, r, rt << 1 | 1
typedef long long ll;
typedef long double real;
typedef pair<... | 0 |
#include<bits/stdc++.h>
using namespace std;
struct CumulativeSum {
vector<long long> csum;
template<typename T>
CumulativeSum(vector<T> input) : csum(input.size() + 1, 0) {
for(int i = 0; i < (int)input.size(); i++) csum[i+1] = csum[i] + input[i];
}
long long query(int l, int r) { /* 0-indexed, inclusiv... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> AC;
AC.push_back(0);
//入力
vector<int> X(Q), Y(Q);
for(int i=0; i<Q; i++) {
int a,b;
cin >> X[i]... | 1 |
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <map>
using namespace std; typedef long long ll;
typedef pair<string,string> P; const int INF = 1e9+1;
int main() {
int n; cin>>n;
string s; cin>>s;
map<P, ll> mp;
for(int i=0;i<(1<<n);i++) {
string s1, s2;
for(int j=... | //* AuThOr GaRyMr *//
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",std... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define MAX 1000005
#define MOD (ll)(1e9+7)
#define INF INT32_MAX
#define INFL INT64_MAX
#define con(x,y) ((x)*(m)+(y))
using namespace std;
int dsu[MAX];
int sz[MAX];
int search(int a) {
if(dsu[a]==a) return a;
return dsu[a]=search(dsu[a]);
}
void join(int a, int b) {
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h,w; //h side w vertical
cin >> h >> w;
char s[h][w];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> s[i][j];
}
}
int flag = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(s[i][j] =... | 1 |
#include <iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a < b){
if(c >= a && c <= b){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}else{
if(c >= b && c <= a){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typenam... | 1 |
#include<iostream>
#include<stdio.h>//printf("%.*f\n",*********);
#include<vector>//s.erase(n),vector
#include<algorithm>//next_permutation
#include<set>
#include<string>//char('a'=32+'A')
//to_string,string,substr
#include<sstream>
#include<complex>
#include<time.h>
#include<random>
#include<cmath>//mi... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
#define PB push_back
#define ar2 array<int,2>
typedef long long LL;
const LL P = 1e9+7;
const int INF = 0x3fffffff;
const int N = 25;
mt19937 rng(time(0));
int x,y,ans;
int calc(int ... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define F... | #include "bits/stdc++.h"
#define ll long long
#define lld long double
#define MOD 1000000007
#define inf 1000000000000000000ll
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<string> v;
set<string> s;
void dfs(string str, int flag, int count) {
if (count == k) {
s.insert(str);
return ;
}
for (int i = 0; i < n; i++) {
if (flag & (1 << i)) continue;
dfs(str + v[i], flag | (1 << i), cou... | #include <bits/stdc++.h>
using namespace std;
string ab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, key[100];
string cip;
while(cin >> n && n){
for(int i = 0; i < n; i++){
cin >> key[i];
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 501, MAX_M = 2e5+10;
int N, M, Q;
int L[MAX_M], R[MAX_M];
int p[MAX_M], q[MAX_M];
ll ans[MAX_N][MAX_N];
void solve()
{
for(int i=0;i<M;++i){
for(int le=1;le<=L[i];++le)ans[le][R[i]]++;
}
for(int i=1;i<=N;++i)for(int j=1;j<=N;++... | #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>;
vector<int> to[100005];
vector<int> dist;
int n;
void dfs(int v, int d=0, int p=-1) {
dist[v] = d;
for (int u : to[v]) {
if (u == p) continue;
dfs(u,d+1,v... | 0 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
#define REP(i,e,s) for(register int i=e; i<=s; i++)
#define DREP(i,e,s) for(register int i=e; i>=s; i--)
#define ll long long
#define DE(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG(a) DE("DEBUG: %d\n",a)
#define int long lon... | #include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
string S;
cin >> S;
if (S.length() == 3) reverse(S.begin(), S.end());
cout << S << "\n";
return 0;
}
| 0 |
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
#define db(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<'\n'
const int inf = 1e9+7;
const int N = 1e6+9;
int main() {
ios_base::sync_with_stdio(0);
int a,b,n;
string s;
cin>>s;
in... | #include <bits/stdc++.h>
#define endl "\n"
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define ll long long
#define llu unsigned long long
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define ABS(X) ((X)< 0 ? -(X): (X))
#define LCM(X, Y) ( (... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 998244353;
ll Ep(int x, int y){
if(y == 1) return x;
ll r = Ep(x,y/2);
if(y%2 == 1) return r *r%MOD *x%MOD;
else return r *r%MOD;
}
int main(){
int n, x;
cin >> n;
cin >> x;
if(x != 0){
cout << 0 << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX = 2*1e5;
bool IsPrime(long long n){
if(n == 1) return false;
for(long long i = 2; i * i < n; i++){
if(n%i == 0) return false;
}
return true;
}
vector<pair<long long, long long>> PrimeFactorize(long long n){
vector<p... | 0 |
#include <iostream>
#include<string>
using namespace std;
int main() {
// your code goes here
string s,t;
cin>>s;
cin>>t;
for(int i = 0; t[i]!='\0'; i++)
{
cout<<t[i];
}
for(int i = 0; s[i]!='\0'; i++)
{
cout<<s[i];
}
return 0;
} | #include <iostream>
int main(int argc, char *argv[])
{
int x = 0;
std::cin >> x;
x = x * x * x;
std::cout << x << std::endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P std::pair<int,int>
#define PiP std::pair<int,std::pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp std::make_pair
#define priqu... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy... | 1 |
// C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<int> cmp;
int size;
UnionFind(int n) :size(n) {
par.resize(size);
... | 0 |
#include<iostream>
using namespace std;
int main(void){
int n, q;
cin >> n;
int s[n];
for(int i = 0; i < n; i++){
cin >> s[i];
}
cin >> q;
int t[q];
for(int i = 0; i < q; i++){
cin >> t[i];
}
int count = 0;
for(int i = 0; i < q; i++){
for(int j = 0; j < n; j++){
if(t[i] == s[j]){
count++;
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define vv(T) std::vector<std::vector<T>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
vector<bool> seen(1'000'000'000);
bool ans = true;
for (int i = ... | 0 |
// This amazing code is by Eric Sunli Chen.
#include<bits/stdc++.h>
using namespace std;
template<typename T> bool get_int(T &x)
{
char t=getchar();
bool neg=false;
x=0;
for(; (t>'9'||t<'0')&&t!='-'&&t!=EOF; t=getchar());
if(t=='-')neg=true,t=getchar();if(t==EOF)return false;
for(; t<='9'&&t>='0'; t=getchar())x=x... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll M... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.