code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli x, y;
int main(void){
cin >> x >> y;
lli ans = 1e18;
rep(i, 2){
rep(j, 2){
lli xc, yc;
xc = x;
yc = y;
lli c = 0;
if(i == 1) xc*=-1, c++;
if(j == 1) yc*=-1, c++;
if(xc <= yc) c+=yc-x... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N = 1e5 + 5;
struct Gauss
{
static const int bits = 60;
int table[bits];
Gauss()
{
for(int i = 0; i < bits; i++)
table[i] = 0;
}
int size()
... | #include<bits/stdc++.h>
using namespace std;
const int N = 15;
void cmax(int& x, int y) {
if (x < y) {
x = y;
}
}
int n, m, dist[N][N], value[1 << N], dp[1 << N][N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
int sum = 0;
for (int i = 0, a, b, c; i < m; ++i) {
cin >>... | 0 |
#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 str... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define ll... | 0 |
// <------------- Template -----------------------> //
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(0);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<... |
/*
g++ --std=c++17 A.cpp
*/
#include <iostream>
#include <iomanip> //! for setprecision(20)
#include <math.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
#include <limits.h>
#include <atcoder/all>... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define pll pair<ll, ll>
#define vl vector<ll>
#define vvl vector< vector<ll> >
#define vlp vector< pair<ll, ll> >
#define vllp vector<pair<pll,... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#define N 100010
#define int long long
using namespace std;
int num[N];
signed main()
{
int n,m,v,p;
scanf("%lld%lld%lld%lld",&n,&m,&v,&p);
for(int i=1;i<=n;i++) scanf("%d",&num[i]);
sort(num+1,num+n+1);
reverse(num+1,num+n+1);
int sum=0,an... | 1 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int h,w;
while(cin>>h>>w,h||w){
int a=h*h+w*w;
bool hantei=false;
while(1){
while(1){
h++;
double s=sqrt(a-h*h);
if(s-(int)s==0&&h*h<(a-h*h)){hantei=true;break;}
if(a-h*h<1)break;
}
//cout<<a<<endl;
if(hantei... | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
using namespace std;
#define rep(i,n) for(int i=0;i<((int)(n));i++)
#define reg(i,a,b) for(int i=((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int ... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[4], b[2], sum;
sum = 0;
for (int i = 0; i < 4; i++){
cin >> a[i];
}
cin >> b[0] >> b[1];
if (b[0] <= b[1]){
sum += b[1];
}
else {
sum += b[0];
}
sort(a, a + 4);
sum += a[1] + a[2] + a[3];
cout << sum << e... | //Author: Fuadul Hasan(fuadul202@gmail.com)
//BSMRSTU,Gopalganj
#include<bits/stdc++.h>
using namespace std;
//int input........
template <typename T> inline void readline(T &n) {n = 0; int f = 1; register int ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') f = -1;for (; isdigit(ch);
ch = getchar(... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int z;
cin>>z;
if(z<1200) cout<<"ABC"<<endl;
else if(z<2800) cout<<"ARC"<<endl;
else cout<<"AGC"<<endl;
} | #include <iostream>
//#include <vector>
#include <string>
//#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long LL;... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<p... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1E5;
bool isSheep[MAXN];
bool o[MAXN];
bool options[2] = {true, false};
bool isValid(int n)
{
bool firstSheep = isSheep[0];
for (int i = 1; i < n; i++)
{
if (isSheep[i] && o[i] || !isSheep[i] && !o[i])
{
isSheep... | 0 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> S(H);
for (int i = 0; i < H; i++) cin >> S[i];
vector<vector<int> > A(H, vector<int>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (S[i][j] == '.') A[i][j] = 0;
else A[i][j] = 1;
}
... | # include <iostream>
# include <string>
# include <algorithm>
# include <vector>
# include <cstring>
# include <stdio.h>
# include <map>
# include <queue>
# define ll long long
# define pii pair<int,int>
# define FOR(a,b) for(int a=1; a<=b; a++)
# define REP(a,b) for(int a=0; a<b; a++)
# define FORU(a,b,c) for(int a=b... | 1 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S , T;
while(getline(cin , S))for(size_t i = 0; i < 26; i++)
{
for(auto &x : S)if('a' <= x&&x <= 'z')if(++x > 'z')x -= 26;
stringstream SS;
SS << S;
vector<string>VS;
while(SS >> T)if(T == "the" || T == "this" || T == "that" || T == "ths."... | 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>
#define ll long long
using namespace std;
const int maxn=2000+10,mod=1e9+7;
ll f[maxn][maxn];
ll s[maxn*maxn+10],invs[maxn*maxn+10];
int n,m;
inline void read(int &x){
char c=getchar();
int f=1;
x=0;
while(c<'0' || c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0' && c<='9'){x=x*10+c-'0';c=g... | 1 |
#include <cstdio>
#include <vector>
using namespace std;
class Edge{
public:
int from,to,cost;
Edge(int f,int t,int c){
from = f;
to = t;
cost = c;
}
void swap(){
int a = from;
from = to;
to = a;
}
};
vector<Edge> edge;
int n,m;
const int INF = 999999999;
int solve(int s){
int* d = new int[n + 1... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int need[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int compare(string s, string t) {
if (s.length() > t.length()) {
return -1;
} else if (s.length() < t.length()) {
return 1;
} else {
if (s < t)... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
vector<queue<char>> s(3);
rep(i,3) {
string t; cin >> t;
rep(j,t.size()) s[i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W; cin>>H>>W;
vector<vector<char>>A(H+2,vector<char>(W+2,'.'));
for(int i=1;i<=H;i++){
string S; cin>>S;
for(int j=1;j<=W;j++){
A[i][j]=S.at(j-1);
}
}
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
if(A[i][j]=='.')conti... | 0 |
#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define debug freopen("in.txt","r",stdin),freopen("out.txt","w",stdout);
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 5e5+10;
const in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int c[500005];
int d[500005];
int e[500005];
int a[500005];
int bit[500005];
vector<pair<int, int>> v[500005];
int n, q;
// 1 is true
// 0 is false
int esum(int l, int r) {
int sum = 0;
for (int i = l; i <= r; i++) {
sum += e[i];
}
return ... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#define N 50
using namespace std;
struct data{
string l;
int p,a,b,c,d,e,f,s,m;
double cal;
};
int main(){
int n,i,j,time;
struct data d[N];
while(1){
cin >> n;
if(n==0) break;
for(i=0;i<n;i++){
cin >> d[i].l >> d[i].p >> d[i].a >>... | # define _CRT_SECURE_NO_WARNINGS 1
# define _USE_MATH_DEFINES
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
#... | 0 |
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
const int N_MAX = 100000;
long long mod(long long a) {
a %= MOD;
return a >= 0 ? a : a+MOD;
}
long long inverse[N_MAX+1+64];
long long factorial[N_MAX+1+64];
long long factorial_inverse[N_MAX+1+64];
void calc(int n) {
inverse[1... | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | 0 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int e;
while(cin >> e && e > 0){
unsigned int m = e;
for(int z=0;z*z*z<=e;z++){
for(int y=0;y*y+z*z*z<=e;y++){
int x = e - y * y - z * z * z;
... | #include<iostream>
#include<string>
#include<vector>
#include<set>
using namespace std;
int main(void){
int a,b,c,d;
int n,k;
while(1){
cin >> n;
cin >> k;
if(n==0 && k==0)break;
vector<string> num;
set<string> str;
for(a=0;a<n;a++){
string s;
cin >> s;
num.push_back(s);
}
if(k==2){
for... | 0 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> p(5);
rep(i,5) cin >> p.at(i);
ll mi = p.at(0);
rep(i,5) mi = min(mi, p.at(i));
ll ans = ceil(double(n/double(mi))) + 4;
cout << ... | #include <bits/stdc++.h>
int n, a[205];
int main()
{
scanf("%d", &n);
for(int i=1; i<=2*n; i++) scanf("%d", a+i);
std::sort(a+1, a+2*n+1);
int ans = 0;
for(int i=1; i<=2*n; i+=2) ans += a[i];
printf("%d\n", ans);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int solve () {
int n;
cin >> n;
vector<long long> a(n);
for (auto &e : a) cin >> e;
string s;
cin >> s;
vector<long long> b;
for (int i = n; i--> 0;) {
long long e = a[i];
for (const auto &c : b) e = min(e, e^c);
if (e > 0) {
if (s[i] == '1') return 1;
... | #include <iostream>
#include <vector>
#include <algorithm>
#define INPUT_FROM_FILE (0)
#if INPUT_FROM_FILE
#include <fstream>
#endif
int calc_gcd(int n, int m){
if(n == m){ return n; }
if(n > m){
std::swap(n, m);
}
return calc_gcd(n, m - n);
}
int main(int argc, char **argv){
#if INPUT_FROM_FILE
std::ifstream... | 0 |
/*
This Submission is to determine how many 120/240 min const. delivery point there are.
//info
120 req. steps <= 5
*/
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iter... | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int p[500];
int sakurako(int a, int b, int c){
bool f1, f2, f3;
f1 = (p[a] == 1 ? true : false);
f2 = (p[b] == 1 ? true : false);
f3 = (p[c] == 1 ? true : false);
if (f1 && f2 && !f3) return c;
if (f1 && !f2 && f3) return b;
if ... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max({ 2 * A - 1, 2 * B - 1, A + B }) << endl;
return 0;
} | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
struct node{
int a;
int b;
}x[100005];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++)
{
scanf("%d%d",&x[i].a,&x[i].b);
}
int start=x[0].a;
int end=x[0].b;
for(int i=1;i<m;i++)
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,char>;
using ll=long long;
int main() {
int N, Y;
cin >> N >> Y;
string ans="No";
int fin=0;
for (int i=0; i<=Y/10000; i++) {
for (int j=0; j<=(Y-10000*i)/5000; j++) {
if (Y-10000*i-5000*j==(N-i-j)*1000) {
cout << i << " " << j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | 1 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
using vi = vector<int>;
using i64 = int64_t;
constexpr int INF = 1 << 30;
constexpr int M... | #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)
... | 1 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
#include<algorithm>
#define ll long long
#define rg register
#define go(i,x,a) for(rg int i=a;i<x;i++)
#define inf 0x3f3f3f3f
#define mod 1000000007
using namespace std;
const int maxn=5e5+5;
int n,a[maxn],b[maxn],hx[maxn],tl,s0[max... | #include<cstdio>
using namespace std;
#define N 1050000
#define mod 1000000007
int dp[N][2],n,s[N],las[N],k=20,sn;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&s[i]);
for(int i=0;i<1<<k;i++)dp[i][0]=1;
for(int i=1;i<n;i++)
{
s[i]^=s[i-1];
... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R,G;
cin >> R >> G;
cout << G + G - R;
} | 0 |
#include<iostream>
#include<iomanip>
using namespace std;
int main(void){
int x;
cin >> x;
cout << x*x*x <<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int ans = 1;
for (int i = 0; i < 3; i++) {
ans *= x;
}
cout << ans << endl;
}
| 1 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
#include <map>
using namespace std;
#define N 40
#define BIT (1<<17)
#define mod 1000000007
int add(int x,int y) {
int ret = x+y;
if(ret<0) {
ret += mod;
... | #include<algorithm>
#include<cstring>
#include<cstdio>
#define ll long long
#define qwq
const int mod=1e9+7;
int dp[50][(1<<17)+7];
int n,x,y,z;
ll all_ans=1;
int main(){
scanf("%d%d%d%d",&n,&x,&y,&z);
int gdans=(1<<(x+y+z-1))|(1<<(y+z-1))|(1<<(z-1));
int limit=(1<<(x+y+z))-1;
dp[0][0]=1;
for(int i=1;i<=n;++i){
... | 1 |
#include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
using namespace std;
const int MAXN = 110;
int n;
ll a[MAXN];
void work() {
scanf("%d", &n);
for(reg int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
int ans = 0;
for(reg int i = 1; i <= n; ++i) {
for(reg int j = ... | #include<iostream>
#include<algorithm>
#include<map>
#include<vector>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int64_t const INF = 1e18;
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int N; std::cin >> N;
std::vector... | 0 |
#include <iostream>
#include <vector>
#define INF (int)1e9
int bellman_ford(int m, int p, int q, std::vector<std::vector<std::pair<int, int> > > v) {
std::vector<int> rvec(m, INF);
bool flag;
rvec[p] = 0;
int value;
int target;
do{
flag = false;
for (int i = 0; i < m; i++) {
... | #include<cstdio>
#include<algorithm>
#include<queue>
#include<string>
#include<cstring>
#include<cstdlib>
#include<sstream>
#include<set>
using namespace std;
class P{
public:
int num;
int cnt;
bool used[10];
P(){}
P(int num,int cnt,bool a[10]):num(num),cnt(cnt){
for(int i = 0; i < 10; i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int e;
while(1) {
cin >> e;
if(e == 0) {
break;
}
int tmpx, tmpy, tmpz, tmpe;
tmpe = e;
for(tmpz = 0; pow(tmpz, 3) <= tmpe; tmpz++){}
tmpz--;
tmpe = tmpe - pow(tmpz, 3);
if(tmpe == 0){
tmpy = 0; tmpx = 0;
}else{
for(tmpy ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<string>
#include<cctype>
#include<cmath>
using namespace std;
string str="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
char encode(char a,int k){
int b;
if(isupper(a))b=a-'A';
else b=a-'a'+26;
if(b-k>=0)return str[b-k];
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fa... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string s;
cin >> s;
bool flag = true;
int n = s.size();
int ok = 0;
if(s[0] != 'A'){
cout << "WA" << endl;
return 0;
}
for(int i = 2; i <= n-2; i++){
i... | 0 |
#include<bits/stdc++.h>
#include<iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
using namespace std;
const long long N = 1000 * 100 + 5;
long long c[N... | #include<bits/stdc++.h>
using namespace std;
typedef long long s64;
s64 C2(int n)
{
return (s64)n*(n-1)/2;
}
#define rep(i,l,r) for(int i=l;i<=r;++i)
const int N=1e5+5;
int fa[N],sz[N];bool d[N],have[N];
int find(int x)
{
if(fa[x]==x)return x;
find(fa[x]);
d[x]^=d[fa[x]];
return fa[x]=fa[fa[x]];
}
int main()
{
... | 1 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <assert.h>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <complex>
#include <iomanip>
#include <stack>
using namespac... | #include <bits/stdc++.h>
using ll = long long;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
const ll INF = (ll)1e11;
const ll MOD = 998244353;
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A;
ll S = 0;
for (int i = 0, a; i < ... | 0 |
#include<iostream>
using namespace std;
int func(int x);
int main() {
int x;
while (true) {
cin >> x;
if (x == 0) { break; }
cout << func(x) / 3650 + 1 << endl;
}
return 0;
}
int func(int x) {
if (x == 1) {
return 1;
}
else if (x == 2) {
return 2;
}
else if (x == 3) {
return 4;
}
else {
r... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <queue>
#include <stdlib.h>
using namespace std;
int main(void){
int n;
cin >> n;
for( int i = 0; i < n; i++ ) {
int outs = 0, runner = 0, pts = 0;
while( outs < 3 ) {
string evt;
cin >> evt;
if( evt == "HIT" ) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (ll)c.size()
#define fr first
#defi... | #include <bits/stdc++.h>
#define l(i) (n / 2 - (n - i + 1) / 2)
#define r(i) ((i + 1) / 2)
#define st(i) (i / 2 - 1)
using namespace std;
typedef long long ll;
int n, a[200005];
ll dp[200005][3], ans = -1e16; // j�ķ�Χ��i/2-1��(i+1)/2�����3��
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <array>
#include <queue>
#include <stack>
#include <algorithm>
#include <tuple>
#include <numeric>
#include <type_traits>
#define MOD 9982443... | #include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
int n;
int a[305];
ll dp[305][90005];
ll dp2[305][90005];
ll p(ll a, ll x) {
ll res = 1;
while(x > 0) {
if(x & 1) res = res * a % mod;
a = a * a % mod;
x >>= 1;
}
return res;
}
int main() {
cin >> n;
i... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include<iostream>
#include<cstdio>
using namespace std;
#define N 200012
int n,a[N],las=0;bool vis[N];long long ans=0;
int main(){
scanf("%d",&n);int i,l,r,lef;bool fl=true;
for(i=1;i<=n;i++)scanf("%d",&a[i]);
for(i=1;i<=n;i=r+1)
{
l=r=i;while((r<n)&&(a[r+1]==(a[r]+1)))++r;
lef=l-a[l];if(lef<=las){printf("-1")... | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x /... | #include <iostream>
#include <string>
#include <set>
using namespace std;
void input(int& N, set<int>& R_INDEX, set<int>& G_INDEX, set<int>& B_INDEX)
{
char c;
for (int i= 0; i < N; i++){
cin >> c;
switch(c){
case 'R':
R_INDEX.insert(i);
break;
case 'G':
G_INDEX.insert(i);
... | 1 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n, k;
cin >> n >> k;
vector<int> a(n + 1, 0);
for(in... | #include<bits/stdc++.h>
#define maxn 105
using namespace std;
int xe,ye;
short n,m,ans,a[maxn][maxn],p=0,np=1,dp[2][maxn][maxn][maxn];
char c[maxn][maxn];
void inline upd(short& x,short y){
if(x<y){x=y;if(y>ans)ans=y;}
}
int inline z(int i,int j,int k,int l){
return a[k][l]-a[i-1][l]-a[k][j-1]+a[i-1][j-1];
}
int inli... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n; cin >> n;
int a,b;
switch (n)
{
case 1:
cout << "Hello World\n";
break;
case 2:
cin >> a >> b; cout << a+b << endl;
break;
}
return (0);
}
| #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 = 0, A,B;;
cin >> N >> A >> B;
if(N == 1){
cout << "Hello World";
}
else{
cout << A + B;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef pair<ll,ll> PLL;
#define REP(x,l,u) for(ll x = l; x < u; x++)
#define RREP(x,l,u) for(ll x = l; x >= u; x--)
#define all(x) x.begin(), x.end... | 1 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int maxn=2e5+5;
const int mod=1e9+7;
ll fac[maxn]={1},ifac[maxn];
inline ll fastpow(ll a,ll b) {
ll ans=1;
for(;b;b>>=1,a=a*a%mod) if(b&1) ans=ans*a%mod;
return ans;
}
inline void init() {
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
if(s[0]=='R'&& s[1]=='R'&&s[2]=='R'){
cout<<"3"<<endl;
}
else if(s[0]!='R'&& s[1]!='R'&&s[2]!='R'){
cout<<"0"<<endl;
}
else if(s[0]=='R'&& s[1]=='R' || s[1]=='R'&&s[2]=='R'){
cout<<"2"<<end... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string s;
cin >> s;
if (s[0] > s[1]) {... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chm... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi ... | 1 |
#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=0, tmp=0;
vector<vector<ll>> A;
string S;
signed main(){
cin >> S;
A.resize(26);
for(int i=0;i<S.size();i++) {
ll abc =... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string A;
cin >> A;
int N = A.size();
vector<vector<long long>> v( N, vector<long long>( 26 ) );
for( int i = 0; i < N; i++ ) {
int j = A[N - 1 - i] - 'a';
v[N - 1 - i][j]++;
}
for( int i = 0; i < N - 1; i++ ) {
for( int j = 0; j < 26; j++ ) {
... | 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;
ll MOD=1000000007;
ll mod=998244353;
int inf... | #include <bits/stdc++.h>
#define P pair<long long, long long>
using namespace std;
const int INF=1e5;
int main(){
int h, w, n;
cin >> h >> w >> n;
int mx = max(h, w);
cout << (n-1)/mx + 1 << endl;
}
| 1 |
#include<bits/stdc++.h>
int n,m,a[101],c[101],b[201],e,sum,now;
int main()
{
scanf("%d%d",&n,&m);
if(m==1)
{
printf("%d\n",n);
if(n==1)puts("1"),puts("1");
else puts("2"),printf("%d %d\n",n-1,1);
return 0;
}
for(int i=1;i<=m;++i)
scanf("%d",&a[i]),sum+=a[i],now+=a[i]/2;
now+=sum/2;
if(now<sum-1)puts("I... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#defi... | 1 |
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define rep1(i,n) for(int i=1;i<=n;i++)
struct rec{int di,h;};
vector<rec> vc;
bool comp(rec const &l,rec const &r){
return l.di!=r.di ? l.di<r.di : l.h<r.h;
}
int main(){
rep1(i,150) rep1(j,i-1) vc.push_back({i*i+j*j,j});
sort(vc.begin(),... | #include<iostream>
using namespace std;
int main(){
int h,w;
while(1){
cin>>h>>w;
if(h==0)break;
int d=h*h+w*w,ah=100,aw=100;
for(int i=1;i<=150;i++)
for(int j=i+1;j<=150;j++){
int k=i*i+j*j;
if(((k==d&&i>h)||k>d)&&(ah*ah+aw*aw>k||(k==ah*ah+aw*aw&&ah>i)))ah=i,aw=j;
}
cout<<ah<<' '<<aw<<... | 1 |
#include<iostream>
using namespace std;
int main() {
int n;
int a[10000];
int b[10000];
while(cin >> n) {
if(n == 0) {
break;
}
for(int i = 0; i < n; i++ ){
cin >> a[i] >> b[i];
}
int ans_a = 0;
int ans_b = 0;
for(int i = 0; i < n; i++) {
if(a[i] < b[i]) {
... | #include <iostream>
#include <string>
using namespace std;
int main(){
int num_battle;
int a, b;
int point_a = 0;
int point_b = 0;
string cards;
cin >> num_battle;
for(; num_battle != 0;){
while(num_battle > 0){
cin >> a >> b;
if(a == b){
point_a += a;
point_b += b;
}else if(a > b){
po... | 1 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <cstring>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
string... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <queue>
#include <stack>
#include <utility>
#include <queue>
#include <cmath>
#define mp make_pair
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
int month[... | 0 |
#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... | #include <bits/stdc++.h>
using namespace std;
const int N = 16;
const int inf = 1e9;
int n, m;
int e[N][1 << N];
int c[N][N];
int dp[N][1 << N];
void minimize(int &x, int y) { x = (x > y) ? y : x; }
void prep() {
for (int mask = 0; mask < (1 << n); ++mask) {
for (int i = 0; i < n; ++i) if (!(mask >> i & 1)) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long ans=0;
ans+=x/11*2;
if (x%11>6)
{
ans+=2;
}
else {
if (x%11) {
ans++;
}
}
cout << ans << endl;
} | /** Created by: Marcos Portales
Codeforces User: marcosportales
Country: Cuba
Copyright */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas:
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
#pragma GCC option("... | 1 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vec... | #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(...) ... | 0 |
#include<iostream>
using namespace std;
int main(){
while(1){
int INF=100000100;
int n,k,ans[105][105],t,a,b,c;
scanf("%d%d",&n,&k);
if(n==0&&k==0)break;
for(int i=1;i<=n+2;i++){
for(int j=1;j<=n+2;j++){
ans[i][j]=INF;
if(i==j)ans[i][j]=0;
}
}
for(int i=0;i<k;i++){
scanf("%d",&t);
if(t==0){
sca... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template<typename T>
#define TTF template<typename T, typename F>
#define ET(T) typename T::value_type
TT inline T sq(T x){return x*x;}
TT inline T In(){T x;cin>>x;return x;}
TT inline ... | 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<ll,ll> P;
const ll INF=1001001001001001;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n=1):n(n), f(n+1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N;
cin >> N;
vector<bool> vec(55555);
vec[1] = false;
for (int i = 2; i <= 555... | 1 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
... | #include <stdio.h>
int main () {
char a[12];
char b[12];
char c[12];
int lenA = 0, lenB = 0;
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
for(int i = 0; a[i] != '\0'; i++) {
lenA++;
}
for(int i = 0; b[i] != '\0'; i++) {
lenB++;
}
if (a[lenA-1] == b [0] && b[lenB-1] == c[0]) {
printf("YES\n");
... | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#de... | #include <bits/stdc++.h>
using ll = long long int;
using P = std::pair<int, int>;
#define rep(i, n) for (int i = 1; i <= (n); ++i)
#define rag(con) std::begin(con), std::end(con)
constexpr int MAX = 1010;
std::vector<int> to[MAX];
int main()
{
int n, m;
std::cin >> n >> m;
rep(i, m)
{
int ... | 0 |
#include <cstdio>
typedef long long ll;
template<class T> inline T Abs(const T x){return x>=0?x:-x;}
template<class T> inline T Min(const T a,const T b){return a<b?a:b;}
int n,m,x,y;
ll AT,f[200005],f1[200005],f2[200005],Ans;
const ll Inf=1e18;
void Add1(int x,ll k){for(;x<=n&&k<f1[x];x+=x&-x)f1[x]=k;}
ll Query1(int... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <li... | 1 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#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(){
}
//配列以外の... | #include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
string S;
cin >> S;
int alfabet[26] = {0};
for (int i = 0; i < S.length(); i++) {
alfabet[S[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (alfabet[i] == 0) {
printf("%c\n", 'a' + i);
return... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const ll MOD = 998244353;
static const int MAX = 500000+100;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1]... |
#include <bitset>
#include <tuple>
#include <string>
#include <array>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cstdio>
#include <cmath>
#ifdef LOCAL
#include <iostream>
#endif
using namespace std;
#define rep(i, n) for (int i =... | 0 |
#include<iostream>
#include<cmath>
using namespace std;
typedef long long int LL;
LL base[25];
LL check(LL a,int n,int k){
if(n==0){
if(a==0)return 10;
else return 0;
}
if(n<0){
if(a==0)return 1;
else return 0;
}
LL b,c,d;
LL t;
t=base[n];
for(int i=0;i<k;i++)t*=10;
b=(a+t*15)/t-15;
c=0;
if(-9<=b &&... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()... | 0 |
#include<iostream>
using namespace std;
int main(){
int n, x, y, pt1, pt2;
while(cin >> n){
pt1 = 0;
pt2 = 0;
if(n == 0) break;
for(int i=0; i<n; i++){
cin >> x >> y;
if(x > y) pt1 += x + y;
else if(x < y) pt2 += x + y;
else {
pt1 += x;
pt2 += y;
}
}
cout << pt1 << " ... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
int ba[12][12];
int dx[] = {1,0,-1,0};
int dy[... | 0 |
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#define local
#ifdef local
#include "dbg-macro/dbg.h"
#endif
//#define hacks
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 0 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
const double PI = acos(-1.0);
#define rep(... | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <tuple>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
int main(void){
int l,r;
cin >> l >> r;
int mi=2018*2018;
for (int i = l... | 0 |
#include <string>
#include <math.h>
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int x = n - 2;
cout << 180 * x;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<n; i++)
#define repr(i, s, e) for(ll i=s; i>=e; i--)
#define reps(i, s, e) for(ll i=s; i<=e; i++)
#define inf 1e18
#define all(v) v.begin(),v.end()
#define ceil(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp ... | 1 |
#include <iostream>
using namespace std;
void MySwap(int &a, int &b){
int tmp = a;
a = b;
b = tmp;
}
int partition(int *A, int p, int r){
int x = A[r];
int i = p - 1;
for(int j = p; j < r; j++){
if(A[j] <= x){
MySwap(A[++i], A[j]);
}
}
MySwap(A[++i], A[r]);
return i;
}
int main(){
... | #include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int h,i;
int a[10],b[10];
for(i=0;i<10;i++)
cin>>a[i];
for(i=0;i<10;i++)
cin>>b[i];
do{
h=0;
for(i=1;i<1... | 0 |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
//C++11
#if __cplusplus == 201103L
#include <tuple>
#endif
using na... | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Downloa... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<pair<int,pair<int,int>>>v;
for(int i=1;i<150;++i){
for(int j=i+1;j<=150;++j){
v.push_back(make_pair(i*i+j*j,make_pair(i,j)));
}
}
sort(v.begin(),v.end());
int h,w;
while(cin>>h>>w,h){
int a=h*h+w*w;
bool flag=0;
for(auto x:v){
if(fl... | #include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>
using namespace std;
#... | 0 |
#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 all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<int,int>;
using graph = vector<vector<int>>;
const int dx[... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int a,b,c;
cin >>a >>b >>c;
int M = max(a,b);
int m = min(a,b);
if(M>=c && m<=c) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main()
{
int A, B;
string S;
cin >> A >> B;
cin >> S;
// 文字列の長さがA+B+1か判定
if (S.size() != A + B + 1) {
// cout << "文字列の長さが" << S.size() << "です。\n";
cout << "No\n";
return 0;
}
// -がA番目にあるか判定(文字列は0... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
void computeLPSArray(string pattern, int m, int lps[]){
int len=0;
lps[0]=0; //lps[0] is always 0
int i=1;
while(i<m){
if(pattern[i]==pattern[len]){
len++;
lps[i]=len;
i++;
}else{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
cout << ((s.find("AC") != string::npos) ? "Yes" : "No") << endl;
}
| 1 |
#define task "test"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
#define pb push_back
#define mp make_pair
#define X first
#define Y second
const ll LINF = 1E18;
const int INF = 1E9;
const int MOD = 1E9 + 7;
const int N = 2E5 + 5;
int t... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 10000000... | 1 |
//Name: Twin Prime
//Level: 2
//Category: 数学,素数
//Note:
/**
* 10000以下の双子素数を列挙しておけば、あとは線形探索でよい。
*
* オーダーは O(M log log M)。
* ただしMは求める必要がある最大の素数で、M=10000。
*/
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
vector<bool> eratosthenes(int N) {
vector<bool> is_prime(N+1, true);
is_... | #include<bits/stdc++.h>
using namespace std;
#define rg register
#define rep(i,a,b) for (rg int i=(a);i<=(b);i++)
#define per(i,a,b) for (rg int i=(b);i>=(a);i--)
#define pb push_back
#define lowbit(x) (x&(-x))
#define replow(i,a,b) for(rg int i = (a);i<=(b);i+=lowbit(i))
#define perlow(i,a,b) for(rg int i = (b);i>=(a)... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
class edge;
class vertex{
public:
vector<edge*> edges;
int color;
vertex(int _color){
color = _color;
}
};
class edge{
public:
vertex *to;
edge(vertex *_to){
to... | 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 {
void Solve() {
UL N; cin >> N;
string S; cin >> S;
string rS = S; reverse(rS.begin(), rS.end());
ULL ans = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).si... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctime>
#define re register
const int MAXN=2e5+10;
int n,K,s[MAXN],a[MAXN],timee;
char fin[10010],*p1=fin,*p2=fin;
char getc()
{
return p1==p2&&(p2=(p1=fin)+fread(fin,1,10000,stdin),p1==p2)?EOF:*p1++;
}
int read()
{
re int x=0;
re char ch=0;
while(ch<'0'... | #include <iostream>
#include <vector>
#include <stack>
#include <bitset>
#include <utility>
#include <algorithm>
using namespace std;
const int kNil = -1;
const int kMaxV = 100010;
enum class Color {
kWhite,
kGrey,
kBlack,
};
template <class T>
struct Edge {
using w_type = T;
Edge(int u, int v, w_type w):... | 0 |
#include <stdio.h>
#include <stdbool.h>
char dividing(int pm, int pe, int pj);
int main(void)
{
int ninnzuu;
int point[3];
while(true) {
scanf("%d", &ninnzuu);
if(ninnzuu == 0) {
break;
}
for(int i = 0; i < ninnzuu; i++) {
scanf("%d %d %d", &point[0], &point[1], &point[2]);
printf("%c\n", dividing... | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins inse... | #include <bits/stdc++.h>
int solve() {
int N, M; std::cin >> N >> M;
std::vector<int> s(M);
std::vector<int> c(M);
for (int i = 0; i < M; ++i) std::cin >> s[i] >> c[i];
/* 全探索 */
for (int n = 0; n < std::pow(10,N); ++n) {
int digit = 1; // 0は1桁
std::vector<int> each_num(1, n%10); // 一の位
i... | 1 |
// Next Mayor
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1159&lang=jp
#include<iostream>
#include<vector>
using namespace std;
const int NONE = -1;
int N, P;
vector<int> player;
int bowl;
int winner;
bool is_win(int i) {
for (int nth = 0; nth < N; ++nth) {
if (nth == i) continue;
... | #include<iostream>
using namespace std;
int main(){
int n,p;
while(cin>>n>>p){
bool f=true;
int d[55]={};
int cn=p;
if(n==0)break;
while(f){
for(int i=0;i<n;i++){
if(cn>0){
d[i]++;
cn--;
}
else if(cn==0){
cn=d[i];
d[i]=0;
}
if(d[i]==p){
cout<<i<<endl;
f... | 1 |
#include <iostream>
#include <algorithm>
#include <array>
#include <set>
#include <vector>
#include <climits>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> graph[n];
array<int, 3> points[n];
int cost[n];
for (int i = 0; cin >> points[i][0] >> points[i][1]; i++) {
... |
#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
int main() {
int sum = 0;
int small = 114514;
for (int i = 0; i < 4; i++) {
int t;
scanf("%d", &t);
sum += t;
small = min(small, t);
}
sum -= small;
int t,u;
scanf("%d", &t);
scanf("%d", &u);
printf("%d\n", sum + max(... | 0 |
#include<iostream>
#include<string.h>
using namespace std;
int kingaku(void);
int saitan(void);
#define WHITE 0
#define GLAY 1
#define BLACK 2
#define INF 9999
int n; // ??????????????±?????°
int m; // ?§??????°
int p; // ????????°
int q; // ??°?????°
int minv;
int cost[101][101];
int Time[101][101];
int dd[101];
int m... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main () {
// input
string str;
cin >> str;
int q;
cin >> q;
string result = str;
int res_len = result.length();
for (int i=0; i<q; i++) {
string order;
int a, b;
cin >> order >... | 0 |
#include <iostream>
#include <iomanip>
using namespace std;
int main(){
int data[11][11];
int n;
cin >> n;
while (n){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
cin >> data[i][j];
}
}
int sum_col[10] = { 0 };
int sum_low[10] = { 0 };
for (int i = 0; i < n; i++){
for (int j =... | #include <iostream>
using namespace std;
#include <algorithm>
int main() {
int n;
while (1) {
cin >> n;
if (n==0) break;
int p1=0, p2=0;
int c1, c2;
for (int i=0; i<n; i++) {
cin >> c1 >> c2;
if (c1==c2) p1+=c1, p2+=c2;
if (c1>c2) p1+=c1+c2;
if (c1<c2) p2+=c1+c2;
}
cout << p1 << " " << p2 ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define UNIQUE... | #include <iostream>
using namespace std;
int main(){
int a, b, x;
cin >> a >> b;
x = (b - a) * 2;
cout << a + x << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
/* short */
#define pb push_back
#define print(Target) cout << Target << '\n'
/* REPmacro */
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPS(i, a, n) for (int i = (a); i < (n); i++)
/* typedef */
typedef long long ll;
typedef unsign... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string N;
cin >> N;
for(int i = 0; i < 8; i++) {
string ans;
ans += N.at(0);
int sum = N.at(0) - '0';
for(int j = 0; j < 3; j++) {
//cout << (i >> (j + 1)) << endl;
if(i... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=100010;
const ll mo... | #include<bits/stdc++.h>
#define MN 100000
#define ll long long
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
ll res,v[MN+5],V[MN+5],ans,g[MN+5],G[MN+5];
int n,X,L[MN+5],... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<vector<int>> Q(N, vector<int>(2));
for(int i=0;i<N;i++){
int l,r;
cin>>l>>r;
Q[i][0]=l;
Q[i][1]=r;
}
// 左側の順にソート
sort(Q.begin(),Q.end());
vector<int> A(N), B(N);
// A→１回目のコンテストの右側
// A[i]→i個目まで１回目のコンテストで出題
A[0] = Q[0][1];
fo... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 16
#define MAXM 32768
#define MAXS 14348907
#define INF 1e9
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
x *= f... | //by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define bged(v) (v).begin(),(v).end()
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
typedef long long ll;
const int Imx=2147483647;
const ll Lbig=2e18;
... | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a[605][605];
void work()
{
int d,l=1;
scanf("%d",&d);
for(; d%4==0; d>>=2)
l<<=1;
if(~d&1)
{
for(int i=1; i<=n; i+=l)
if(!(i/l&1))
for(int k=i; k<=min(n,i+l-1); ++k)
for(int j=1; j<=n; j++)
a[k][j]++;
}
else if(d%4==1)
{
f... | #include<bits/stdc++.h>
#define eps 1e-7
using namespace std;
int n,d1,d2,cnt=0;
bool f[1005][1005];
inline void solve(int d){
int b=0;
while(!(d%4))d>>=2,++b;
if(d&1){
for(int i=0;i<(n<<1);++i)
for(int j=0;j<(n<<1);++j)
if(((i>>b)+(j>>b))&1)f[i][j]=true;
return;
}
for(int i=0;i<(n<<1);++i)
for(int j=... | 1 |
#include <iostream>
#include <vector>
constexpr bool divisible(const std::size_t n, const std::size_t m)
{
return (0 == n % m);
}
constexpr bool help_prime(const std::size_t n, const std::size_t m)
{
return (m * m <= n) ?
!divisible(n, m) && help_prime(n, m + 1) :
true;
}
constexpr bool prime(const... | #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... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a==b&&b!=c||a==c&&b!=c||b==c&&a!=b){
cout<<"Yes";
}else{
cout<<"No";
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int arr[n];
for(int i=0; i<n; i++){
cin>>arr[i];
}
multiset<int>s;
s.insert(arr[0]);
for(int i=1; i<n; i++){
int val=arr[i];
auto it=s.begin();
int vals=(*it);
if(val<=vals){
s.insert(val);
continue;
}
it=s.end();
i... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
int a[n+2];
a[0]=0;
a[n+1]=0;
for(int i=1;i<=n;i++)
cin>>a[i];
int b[n+1]; //b[i]=cost of i->i+1
int sum=0;
for(int i=0;i<=n;i++){
b[i]=abs(a[i+1]-a[i]);
sum+=b[i];
}
for(int i=1;i<=n;i++)
cout<<sum-b[i-1]-b... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const int MAX = 10000;
static const ll INFTY = 1e12;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; ret... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define pi 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main()... | 0 |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) d... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N = 2e5 + 5, mod = 1e9 + 7;
ll x[N], y[N], sumY;
int main()
{
ll n, m;
scanf("%lld%lld", &n, &m);
ll ans = 0, temp;
for(ll i = 0 ; i < n ; i++) scanf("%lld", x + i);
for(ll i = 0 ; i < m ; i++) scanf("%lld", y + i);
... | 0 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#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 N, K;
cin >> N >> K;
vector<int> vec(N);
rep(i, N) {
cin >> vec.at(i);
}
sort(vec.be... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin>>A>>B;
int count_ana=1,count_ans=0;
while(count_ana<B){
count_ana+=A-1;
count_ans++;
}
cout<<count_ans<<endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdou... | #include <iostream>
#include <algorithm>
int main()
{
int n;
int64_t a, b;
std::cin >> n >> a >> b;
int x;
std::cin >> x;
int64_t sum = 0;
for (int i = 1; i < n; ++i)
{
int y;
std::cin >> y;
sum += std::min((y - x) * a, b);
x = y;
}
std::cout <... | 0 |
#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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int l = 1, r = (n - 1) / 2;
int ll = r + 1, rr = ll + r;
int cnt = 0;
for (int i = 0; i < 2; i++) {
while (l < r && cnt < m) {
printf("%d %d\n", l, r);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_u... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x) for (auto&& v : (x))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((t) = std::min((t), (v)))
ll ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
... |
#include <bits/stdc++.h>
using namespace std;
// syntax sugar: `for (int i = 0; i < N; ++i)`
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define rep2(i, startValue, N) for (int i = (int)(startValue); i < (int)(N); ++i)
// syntax sugar: `for (int i = 0; i < N; ++i)`
#define REP(type, name, beginValue, endCond... | 1 |
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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i)... | #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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.