code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<cstdio>
#define MAXN 100010
int gcd(int a,int b)
{
while(b)
{
int t=a;a=b;b=t%b;
}
return a;
}
int n,a[MAXN];
bool dfs()
{
int cnt0=0,cnt1=0;
for(int i=1;i<=n;i++)
(a[i]&1)?cnt1++:cnt0++;
if(cnt0&1) return 1;
if(cnt1>1) return 0;
for(int i=1;i<=n;i++)
if(a[i]&1)
{
if(a[i]==1) return 0;
a... | #include <cstdio>
typedef long long lint;
int const N=1e5+10;
int n,a[N];
int gcd(int x,int y)
{
if(x==-1 || y==-1) return -x*y;
if(x==0) return y;
else return gcd(y%x,x);
}
int g1[N],g2[N];
int main()
{
scanf("%d",&n);
lint sum=0;
for(int i=1;i<=n;i++) scanf("%d",&a[i]),sum+=a[i];
if(n%2==0... | 1 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define MAX 100100
inline int read()
{
int x=0;bool t=false;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')t=true,ch=getchar();
while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
return t?-x:x;
}
int n,s,a[MAX]... | 0 |
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;... | #include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)... | 1 |
// 3人でカードゲームイージー / 理解できた
// #16973056
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<string> s(3);
cin >> s[0] >> s[1] >> s[2];
vector<int> i(3, 0);
char c[]={'A', 'B', 'C'};
int t=0;
while(true){
if(i[t]==s[t].size()){
cout << c[t] << endl;
r... | #include <bits/stdc++.h>
using namespace std;
int ans = 0;
int dfs(int v, int pv, int k, vector<vector<int>>& g) {
int max_d = 0;
for (int u : g[v]) {
max_d = max(max_d, 1 + dfs(u, v, k, g));
}
if (max_d == k - 1 && v != 0) {
ans += pv > 0;
max_d = -1;
}
return max_d;
}
int main() {
ios_ba... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a,... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
string ans = "AC";
if( S[0] != 'A' ) ans = "WA";
else {
string s = S.substr( 2, S.size() - 2 - 1 );
int n = s.find( 'C' );
if( n == string::npos ) ans = "WA";
else if( s.find( 'C', n + 1 ) != string::npos ) ans = "WA";
else ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> a, b;
vector<int> kmp(const vector<int> &vt, vector<int> &vp)
{
int i, q, k;
int n = vt.size();
int m = vp.size();
vector<int> nxt(m);
vector<int> res;
for (q = 1, k = 0; q < m; ++q) {
while (k > 0 && vp[q] != v... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) { return std::vector<T>(n, std::forward<T>(val)); }
template<class... Tail>
static inline a... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
/*
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
*/
int main() {
int N;
cin >> N;
vector<ld> x(N), y(N);
for (int i=0; i<... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
double n;
cin>>n;
vector<v... | 1 |
#include<iostream>
#include<string.h>
using namespace std;
int D[6];
void spin(char c)
{
if(c=='E'){
swap(D[0],D[3]);swap(D[3],D[5]);swap(D[5],D[2]);
}
else if(c=='W'){
swap(D[0],D[2]);swap(D[2],D[5]);swap(D[5],D[3]);
}
else if(c=='S'){
swap(D[0],D[1]);swap(D[0],D[4]);swap(D[4],D[5]);
}
else... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int mod = 998244353;
const int N = 1e5+23;
int h[N];
long long binpow(long long b,... | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
i32 M = 998244353;
i32 dp[90310];
i32 dq[9031... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<(r);i++)
#define pb push_back
#define fi first
#define se second
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y){
return y ? GCD(y... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
int main(){
int h, w, a, b;
... | 0 |
#include <iostream>
using namespace std;
int main(){
double l1, l2, l3, l4, l5, l6, l7, l8, l9, l10;
double v1, v2;
char c;
while(cin >> l1 >> c >> l2 >> c >> l3 >> c >> l4
>> c >> l5 >> c >> l6 >> c >> l7 >> c >> l8
>> c >> l9 >> c >> l10 >> c >> v1 >> c >> v2)
{
double l[] = {
0,l1,l2,l3,l4,l5,
l6,l... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll/*, vl, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<l... | 0 |
#include <stdio.h>
int main() {
int n;
scanf("2017/01/%d", &n);
if(n<10){
printf("2018/01/0%d", n);
}
else{
printf("2018/01/%d", n);
}
return 0;
} | #include<stdio.h>
int main(){
char tanggal[15];
scanf("%s", &tanggal);
tanggal[3] = '8';
printf ("%s", tanggal);
return 0;
} | 1 |
#include<iostream>
using namespace std;
int main(){
int n,m,most1,most2,d[11000]={0};
while(1){
cin >> n;
if(n==0){
break;
}
most1=0;most2=0;
for(int i=0;i<10100;i++){
d[i]=0;
}
for(int i=2;i*i<=n;i++){
if(d[i]==0){
for(int j=i+i;j<=n;j+=i){
d[j]=1;
}
}
... | #include <cstdio>
#include <cmath>
#define buf 10000
using namespace std;
int k=0;
int B[buf];
void Answer(int n);
int PrimeNumber(int n);
int main(void){
int i,n;
char str[buf];
for(i=2;i<buf;i++)
PrimeNumber(i);
for( ;fgets(str,sizeof(str),stdin)!=NULL; ){
sscanf(str,"%d",&n);
if(n==0) break;
... | 1 |
#ifdef _WIN32
#include "XOR.h"
#endif
#include <stdio.h>
#include <iostream>
#include <vector>
#include <array>
constexpr int64_t MOD = 1'000'000'007;
constexpr int64_t help = 1;
#define ll long long int
#define o(X) ll bits##X = 0
//#define ok(X) bits##X += !!(d & (help << X))
#define ok(X) bits##X += d & 1; d >>... | #include<bits/stdc++.h>
#define MOD 1000000007
#define ll long long
using namespace std;
long long dataset[300005]={0};
int main()
{
int number;
cin>>number;
for(int i=0;i<number;i++)
cin>>dataset[i];
ll result=0;
for(ll i=0;i<62;i++)
{
long long zeros=0,ones=0;
... | 1 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
ty... | #include <stdio.h>
int main () {
int n, r;
scanf("%d %d", &n, &r) ;
if (n<10) {
printf("%d\n", r+(1000-100*n)) ;
}
else if (n>=10) {
printf("%d\n", r) ;
}
} | 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 mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
inline int read()
{
int x=0;char ch=getchar();
while(ch<'0' || '9'<ch)ch=getchar();
while('0'<=ch && ch<='9')x=x*10+(ch^48),ch=getchar();
return x;
}
const int M=1e5+9;
int m;
int a[M],b[... | 0 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
bool isPrime[100010];
void ... | #include <iostream>
using namespace std;
int main()
{
int a[55556];
fill(a, a + 55556, 1);
a[0] = a[1] = 0;
for (int i = 4; i < 55556; i += 2) {
a[i] = 0;
}
for (int i = 3; i * i < 55556; i += 2) {
if (a[i] == 1) {
for (int j = i + i; j < 55556; j += i) {
a[j] = 0;
}
}
}
int n;
cin >> n;
fo... | 1 |
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
#define MOD (ll)1000000007
#define PI 3.14159265359
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "... | #include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
using namespace std;
int a, b;
int num[15];
int bind(int p,int q){
if(q<10){
return 10*p+q;
}
else return 100*p+q;
}
int main(void){
while(1){
cin >> a >> b;
if(a == 0 && b == 0){
return 0;
}
set <i... | 0 |
#include<stdio.h>
int main() {
char character1[100];
char character2[100];
scanf("%s", character1);
scanf("%s", character2);
printf("%s%s", character2, character1);
return 0;
} | /*
author : nishi5451
created: 11.08.2020 22:36:41
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
string s,t;
cin >> s >> t;
string ans = t+s;
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int min;
int ans = 1;
cin >> N >> min;
for(int i=0;i<N-1;++i){
int s; cin >> s;
if(s < min){
ans += 1;
min = s;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
int *p = new int[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
int min = INT_MAX;
for (int i = 0; i < n; i++) {
if (p[i] <= min) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
string res = "";
while (N) {
--N;
res += (char)('a' + (N % 26));
N /= 26;
}
reverse(res.begin(), res.end());
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool flg = false;
for(int i = 0; i < s.size(); i++){
if(flg){
if(s[i] == 'C'){
cout << "Yes" << endl;
return 0;
}else{
flg =false;
}
}else{
if(s[i] == 'A') flg = true;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
while (cin >> n) {
n += ".";
int num[] = {1, 5, 10, 50, 100, 500, 1000};
char ch[] = {'I', 'V', 'X', 'L', 'C', 'D', 'M'};
int cnt = 0;
vector<int> a;
for (int i = 0; i < n.size(); ++i) {
int x = 0;
for (int... | #include <iostream>
#include <string>
int main()
{
unsigned int a = 0, max_num = 11, min_num = 0;
std::cin >> a;
if ((min_num < a) && (a < max_num)) {
a = a + (a * a) + (a * a * a);
std::cout << a;
}
else
{
std::cout << "Err a = " << a;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a;
long long solve();
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; ++i) cin >> a[i];
cout << solve() << endl;
return 0;
}
long long solve() {
long long res = 0;
for (int i = 1; i < n; ++i)
if (a[i] > a[i - 1... | //Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii>... | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 10000... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int K, T; cin >> K >> T;
vector<int> A(T);
rep(i, T) cin >> A.at(i);
sort(A.begin(), A.end(), greater<int>());
if (A[0] < K - A[0]) {
cout << ... | #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 K, T;
cin >> K >> T;
vector<int> A(T+1);
rep(i, T) cin >> A[i];
vector<int> ans;
int cnt = 0;
int pre_idx = -1;
int now_idx = T;
... | 1 |
//こんなプログラムを組んではいけない(戒め
//マージの仕様が複雑だし、空白マスを引く処理忘れやすいし、ひどいコードだ。
#include<iostream>
#include<queue>
using namespace std;
const int h = 12;
const int w = 12;
const int dy[4] = {-1, 0, 1, 0};
const int dx[4] = {0, 1, 0, -1};
char data[h][w+2];
//データ構造をマージする一般的なテクなし。
class UnionFind {
public:
int oya[2521], size;
void i... | #include<cstdio>
#include<iostream>
using namespace std;
char masu[50][50] = {{0}};
void saiki(int x,int y){
masu[y][x] = '0';
if(masu[y+1][x] == '1') saiki(x,y+1);
if(masu[y-1][x] == '1') saiki(x,y-1);
if(masu[y][x+1] == '1') saiki(x+1,y);
if(masu[y][x-1] == '1') saiki(x-1,y);
}
int main(){
wh... | 1 |
#pragma region RegionDefs
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define reps(i,l,r) for(int i=(l),i##_len=(r);i<i##_len;++i)
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
const ll INF = 1e9;
template<class T=ll> using V = vector<T>;
template<class T... | #include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
... | 0 |
//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
type... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, x;
cin>>n>>x;
long long int ans=0;
long long int a;
cin>>a;
for(int i=0; i<n-1; i++){
long long int b;
long long int eat=0;
cin>>b;
eat=max(a+b-x, eat);
ans+=eat;
if(b<=eat) b=0;
else b=b-eat;
a=b;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int m, n;
vector<int> a(4);
for(int i = 0; i < 4; i++){
cin >> a[i];
}
cin >> m >> n;
sort(a.rbegin(), a.rend());
int ans = a[0] + a[1] + a[2] + max(m,n);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=1<<18,INF=1<<29;
int main(){
int a,b,c,d,e,f;cin>>a>>b>>c>>d>>e>>f;
cout<<a+b+c+d+e+f-min({a,b,c,d})-min(e,f)<<endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int N,M;
int G[15][15];
int dp[15][(1<<15)];
int INF=2e9;
int calc(int bit,int nbit){
int sum=0;
for(int i=0;i<N;i++)
if(nbit>>i&1)
for(int j=0;j<N;j++)
if(~bit>>j&1)
if(~nbit>>j&1)
sum+=G[i][j];
return sum;
}
int rec(int p... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,st,ed) for(register int i=st,i##end=ed;i<=i##end;++i)
#define DREP(i,st,ed) for(register int i=st,i##end=ed;i>=i##end;--i)
typedef long long ll;
template<typename T>inline bool chkmin(T &x,T y){return (y<x)?(x=y,1):0;}
template<typename T>inline bool chkmax(T &... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
void solve()
{
double r,g;
cin>>r>>g;
cout<<(g*2)-r;
return;
}
int main()
{
fast;
ll q;
q=1;
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
const ll mod = 1e9 + 7;
main(){
int n;
cin >> n;
cout << (n-2)*180 << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <iostream>
#include <vector>
using namespace std;
// http://www.prefield.com/algorithm/misc/dice.html
enum FACE { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
class dice {
public:
dice() {
id[TOP] = 1; id[FRONT] = 2; id[LEFT] = 3;
id[RIGHT] = 4; id[BACK] = 5; id[BOTTOM] = 6;
}
dice(int top,int front... | 0 |
#include <iostream>
#include <stdio.h>
#include <iomanip>
#include <string>
using namespace std;
int main(void){
int n;
scanf("%d",&n);
int* a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << a[n - 1];
for (int i = 1; i < n; i++) {
cout << " " << a[n - i... | #include<iostream>
const static int MIN = -1000000;
const static int MAX = 1000000;
int main(void){
int k, x;
std::cin >> k >> x;
int cmax = std::min(MAX, x + k - 1);
int cmin = std::max(MIN, x - k + 1);
for(int i = cmin; i <= cmax; i++){
std::cout << i << " ";
}
std::cout << std::... | 0 |
#include <bits/stdc++.h>
#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 all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(0)
typedef long long ll;
#define int ll
#define swap(x, y)((x)^=(y)^=(x)^=(y))
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> matrix;
typedef pair<int, int> pii;
typedef p... | 1 |
/*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return tru... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,N) for(int i=0; i<N; i++) ;
int main() {
int N;
cin>>N;
ll answer=0;
for(int i=01; i<N+1; i++){
if(i%3==0||i%5==0){
}
else{
answer+=i;
}
}
cout<<answer<<endl;
} | #include <bits/stdc++.h>
using namespace std;
long long get_rev(long long x) {
long long nx = 0;
while (x) nx = nx * 10 + x % 10, x /= 10;
return nx;
}
long long get_rev(long long x, int len) {
long long nx = 0;
while (len--) nx = nx * 10 + x % 10, x /= 10;
return nx;
}
int cnt;
long long solve(long long d, l... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int accum[N], bulbs[N], n, k;
int main() {
cin >> n >> k;
k = min(41, k);
for (int i = 1; i <= n; ++i) cin >> bulbs[i];
while (k--) {
memset(accum, 0, sizeof accum);
for (int i = 1; i <= n; ++i) {
int l = ma... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
stru... | 0 |
#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, M; cin >> N >> M;
vector<vector<UL>> E(N);
rep(i, M) {
UL a, b; cin >> a >> b; a--; b-... | #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<bits/stdc++.h>
using namespace std;
int main()
{
int a,b; cin>>a>>b;
if(a>b){
cout<<a+(a-1)<<endl;
}
else if(a<b){
cout<<b+(b-1)<<endl;
}
else
cout<<a+b<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
voi... | 0 |
#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 <math.h> // sqrt
#include <map> // map
#inc... | #include <stdio.h>
#include <math.h>
using namespace std;
typedef long long llong;
#define MAX
const llong mod = 1000000000 + 7;
int main()
{
double R;
scanf("%lf", &R);
printf("%lf", 2.0 * M_PI * R);
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main (void){
string str;
cin >> str;
str[3] = '8';
cout << str << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
double a,b,c,d,e,f,g,h=0;
cin>>a>>b>>c>>d;
e=c-a;
f=d-b;
g=e*e+f*f;
h=sqrt(g);
cout <<setprecision(12)<<h <<endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define y1 A2Dalek
#define y0 Cyberman
#define yn RoseTyler
#define j1 JackHarkness
#define fs first
#define sd second
const int N=2e5;
const long long oo=1e16+5;
int du[]={-1,0,0,1};
int dv[]={0,-1,1,0};
const long long mod=1e9+7;
typedef pair<int,int> ii;
typedef pair<int,... | #include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <cctype>
#include <iostream>
#include <cstring>
#include <algorithm>
#define R register
#define IN inline
#define W while
#define ls (now << 1)
#define rs ((now << 1) | 1)
#define MX 200500
#define gc getchar()
#define ll long long
templa... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int w;
cin >> w;
int n=1;
if(w==1){
cout << s << endl;
return 0;
}
for(int i=0; i<s.size(); i++){
if(n%w==1) cout << s[i];
n++;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define I... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include<iostream>
#include<unordered_map>
#include<bitset>
#include<math.h>
#include<vector>
#include<set>
#include<algorithm>
#include<ctype.h>
#include<unordered_set>
#include<string>
#include<iomanip>
#include<queue>
#include<limits>
#include<map>
#include<stack>
#include<iterator>
#include<cstring>
#include<dequ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define debug(x... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | 0 |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si ... | #include<bits/stdc++.h>
#define maxn 100005
#define endl '\n'
using namespace std;
int arr[maxn],ans[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for(int i=0;i<n;i++)
arr[i+1] = (s[i] == 'o' ? 0 : 1);
for(int i=0;i<=1;i++)
for(int j=0;j<=1;j++) {
ans[1] = ... | 1 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | #include<iostream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <cstdlib>
using namespace std;
void roll(int target[], int idx[], int size, bool rev){
if(!rev){
int tmp = target[idx[0]];
for(int i=0;i<size-1;i++){
target[idx[i]] = target[idx... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long res = 0;
for(int i=0;i<n;i++){
int a = i+1;
if(a % 3 == 0 || a % 5 == 0) continue;
else res += a;
}
cout << res << endl;
} | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
set<char> st;
for(int i=0; i<str.size(); i++) {
st.insert(str[i]);
}
if(st.size()<26) {
cout << str;
for(int i=0; i<26; i++) {
if(st.find((cha... | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define MP make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
int n;
ll a[N], p[62];
void insert(ll x) {
for(int i = 60; i >= 0; i--) {
if(x >> i & 1) {
if(!p[i]) {
... | //Be Name Khoda, Besmellah Rahmane Rahim, In The Name Of God;
//#include<bits/stweight++.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>
#inc... | 0 |
#include<cstdio>
#include<cstring>
char str[305];
int dp[305][305][305],K;
int max(int a,int b){return a>b?a:b;}
int main(){
scanf("%s%d",str,&K); int lens=strlen(str);
for(int i=0;i<lens;++i)
for(int k=0;k<=K;++k)
dp[i][i][k]=1;
for(int l=1;l<lens;++l)
for(int i=0;i+l<lens;++i){
int j=i+l;
for(int k=0;... | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i,a,b) for(ll i =a ;i <= b;i++)
#define per(i,a,b) for(ll i =a ;i >= b;i--)
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main(int argc, char const *argv[])
{
//ifstream cin("input.txt");
int n;
cin>>... | 0 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main() {
int N, Q;
string S;
cin >> N >> S >> Q;
vector<int> k(Q);
rep(i, Q) cin >> k[i];
vector<ll> Dsum(N + 1, 0), Msum(N + 1, 0), DM(N + 1, 0);
rep(i, N) {
Dsum[i + 1] =... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
void chmax(string &a, string b) {
if (a == "-") { a = b; }
else if (a.size() < b.size()) { a = b; }
else if (a.size() == b.size()) {
if (a < b) { a = b; }
}
}
int main(){
int match[] = {-1,2,5,5,4,5,6,3,7,... | 0 |
#include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("... | #include <iostream>
#define N 1000
using namespace std;
int main(){
int data[N];
int n , sum[N];
int e[N] , p , q;
while(1){
int flag = 0;
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++){
cin >> e[i] >> p >> q;
sum[i] = p * q;
}for(int i = 0; i < n; i++){
for(int j = i + 1; j <... | 0 |
#include <bits/stdc++.h>
#define INF 2e9
using namespace std;
using ll = long long;
int main(void) {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
deque<int> d;
for (int i = 0; i < N; i++)
{
int pos = lower_bound(d.begin(), d.end()... | #include <iostream>
#include <algorithm>
using namespace std;
int a[100005],b[100005],ans[100005];
int low[100005];
int main(){
int n,i,len,fin;
int x;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&b[i]);
for(i=1;i<=n;i++){
a[i]=b[n-i+1];
}
len=0; low[++len]=a[1]; ans[1]=len;
for(i=2;i<=n;i++){//遍历a[... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
string a, b, c; cin >> a >> b >> c;
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i] && b[i] != c[i] && c[i] != a[i]) {
ans += 2;
}
else if ((a[i] == b[i] && b[i] != c[i]) || (b[i] == c[i] && c[i... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
string s[3];
for(int i =0;i<3;i++)cin >> s[i];
int ans = 0;
for(int i = 0;i<n;i++)
{
int cnt = 0;
for(int j = 0;j<3;j++)
{
if(s[j%3][i]!=s[(j+1)%3][i])cnt++;
}
if(cnt==2)ans+=1;
if(cnt==3)ans +=2;
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#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 vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
n % k == 0 ? cout << 0 << endl : cout << 1 << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
string str;
int main()
{
cin >> str;
int len = str.length();
len = len - 8;
for (int i = 0;i <= len-1;i++)
{
cout << str[i];
}
cout << endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
string s;
int main()
{
getline(cin,s);
s.erase(s.length()-8,s.length()-1);
cout<<s<<endl;
return 0;
} | 1 |
#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>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
template<typename T>
using field = vector<vector<T>>;
template<class T> inline bool chmax(T& a,T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(... | 1 |
#include<bits/stdc++.h>
#define Rint register int
using namespace std;
const int N = 15;
int n, m, lim, wsum, edge[N][N], sum[1 << N], dp[N][1 << N];
inline int cost(int S, int T){return sum[S | T] - sum[S] - sum[T];}
inline bool chkmax(int &a, int b){return (a < b) ? (a = b,1) : 0;}
int main(){
scanf("%d%d", &n, &m);... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
struct Edge{
ll to;
ll weight;
Edge(ll t,ll w) : to(t),weight(w){}
};
using Graph = vector<vector<Edge>>;
int main(){
int n;
cin >> n;
Graph G(n);
for(int i=0;i<n-1;++i){
ll from,to,weight;
cin >> from >> to >> weight;
from... | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
struct Node_tag{
int key;
Node_tag *parent, *left, *right;
};
typedef struct Node_tag Node;
Node *root;
Node *nil = (Node *)malloc(sizeof(Node));
void init(){
nil->parent = nil->left = nil->right = nil;
root = nil;
}
void inParse(Node *u){
if(u == nil)... | #include <bits/stdc++.h>
typedef long long LL;
//container util
//------------------------------------------
#define PB push_back
#define MP make_pair
#define DECIM(digits) cout<<fixed<<setprecision(digits)
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//--------------------... | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | #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];
for (i... | 0 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int a[500005];
ll dp1[2100000];
ll dp2[2100000];
ll s[500005];
ll last[2100000];
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
ll x = 0;
for(int i = 0; i < 2100000; i++) dp2[i] = 1;
... | #include<bits/stdc++.h>
int main(){
using namespace std;
constexpr unsigned long MOD = 1000000007;
vector<unsigned long> tapi(1048576, 1), tapu(1048576), tape(1048576);
unsigned long ans{0}, t{500000004}, a{0}, z{0}, A;cin >> A;
while(cin >> A)if(a ^= A){
(tapu[a] += (tapi[a] += tapu[a] * (... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | #include <iostream>
#include <string>
using namespace std;
string S;
int N;
int main(void)
{
cin >> S;
N = S.length();
int offset = 0;
int result = 0;
while(offset < N)
{
if(S[offset] == 'O')
{
int of = offset;
int c_O = 0;
while(S[of] == 'O')
{
of++;
c_O++;
}
bool OK = true;
f... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<P> G[1001][1001];
int dp[1001][1001];
vector<P> tp;
int dfs(int x,int y,int px=1000,int py=1000)
{
if(dp[x][y]!=0)return dp[x][y];
if(G[x][y].empty())return dp[x][y] = 1;
for(auto i:G[x][y])
{
dp[x][y] = max(dp[x... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
vector<pair<pair<int,int>,int> > v1,v2;
bool is_reach[100100];
int po_v1[100100]; // id
int po_v2[100100]; // id
priority_queue<pair<int,pair<int,int> > > pq;
int n;
int fi_dif(int a,int b)
{
return abs(a-b);
}
vo... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | #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 INF = 1001001001;
int dp[1000005][2];
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
s += "0";
int n = s.size();
rep(i, n+1) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
typedef pair<ll, ll> P;
vector<ll> G[1000], Ginv[1000];
vector<P> ps;
int main() {
ll N, M; cin >> N >> M;
for (ll i = 0; i < M; i++) {
ll a, b; cin >> a >> b; a--; b--;
G[a].push_back(b); Ginv[b].push_back(a);
ps... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << "... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
cin >> s;
int ans = 10000;
for(int i=0; i<s.size()-2; i++)
{
string subs = s.substr(i, 3);
int a = atoi(subs.c_str());
ans = min(ans, abs(753 - a));
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 20;
LL a[maxn], power[maxn], n, m, ans;
LL dfs1(LL k, LL n, LL pre){
if (2*k+1 == m){
LL res; a[k] = n / (power[k] + power[k-1]) - pre;
if (a[1] <= -10 || 10 <= a[1]) return 0;
if ((pre + a[k]) * (power[k] + power[k-1]) != n) r... | 0 |
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
templat... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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 ... | 0 |
#include<bits/stdc++.h>
using namespace std;
const long long int mod=1e9+7;
int main(){
int n;
cin >> n;
int a;
long long int ans=1;
int r=0; int g=0; int b=0;
for(int i=0;i<n;i++){
cin >> a;
ans *= ((a==r)+(a==g)+(a==b));
ans %=mod;
if(a==r)r++;
else if(a... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
int n;
cin >> n;
vector<pair<int,int>> gusu(100000);
vector<pair<int,int>> ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
int dx = tx - sx, dy = ty - sy;
string ans = "";
for (int i = 0; i < dx; i++) ans += "R";
for (int i = 0; i < dy; i++) ans += "U";
for (int i = 0; i < dx; i++) ans += "L";
for (int i = 0; i < d... | #include<iostream>
using namespace std;
int main(void){
int n;
cin >> n;
int a,b,c,d;
int score[1000]={0};
int count=0;
for(int i=0;i<n*(n-1)/2;i++){
cin>>a>>b>>c>>d;
if(c>d)score[a]+=3;
else if(c<d)score[b]+=3;
else if(c==d)score[a]++,score[b]++;
}
for(... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <string.h>
#include <stack>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
int n,m;
cin >> n;
... | #include <iostream>
using namespace std;
int main(){
int sales_sum[10];
int n;
int sales;
for(;;){
for(int i = 0; i < 10; i++){
sales_sum[i] = 0;
}
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++){
cin >> sales;
sales_sum[sales]++;
}
for(int i = 0; i < 10; i++){
if(sales_sum[i] ==... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int r;
int x;
cin >> n;
cin >> r;
x = 100*(10-n)+r;
if (n >= 10) {
cout << r;
} else {
cout << x;
}
return 0;
}
| // Author: Amey Bhavsar
// IDE: Geany/Ubuntu
// Platform: *
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define repD(i,a,b) for(auto i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
// to be used with algorithm... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int l, r;
cin >> l >> r;
int mod_min = 2019;
for (int i = l; i <= min(l + 2019, r); i++) {
for (int j = i + 1; j <= min(l + 2019, r); j++) {
mod_min = min(mod_min, ((i % 2019) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e6 + 10, M = 2e3 + 10, MOD = 1e9 + 7;
int fac[N], inv[N], dp[M][M], ps[M][M];
int sum(int a, int b) {return (a + b) % MOD;}
int mul(int a, int b) {return (a * b) % MOD;}
int Pow(int a, int b)
{
int res = 1;
for (; b; b>>=1, a =... | 0 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int d, ans, n;
while(cin >> d){
ans = pow(d, 3);
n = 600 / d - 1;
ans *= n*(n+1)*(2*n+1) / 6;
cout << ans << endl;
}
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <bitset>
#include <queue>
#include <map>
#include <string>
#include <stack>
#include <utility>
#include <queue>
#include <cmath>
#define mp make_pair
#define pii pair<long long int,long long int... | 1 |
#include <iostream>
#include <vector>
using namespace std;
double fabs (double n) {
if (n < 0) return -n;
else return n;
}
int main() {
int n;
cin >> n;
vector<double> a(n);
double sum = 0.0;
for (int i=0; i<n; i++) {
double num;
cin >> num;
a[i] = num;
sum ... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) n... | 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);
const int INF = 1001001001;
int main() {
ll l, r;
cin >> l >> r;
r = min(l+2019, r);
ll ans = INF;
for (ll i = l; i <= r; i++)... | #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 l, r;
cin >> l >> r;
if(r - l >= 2019) cout << 0 << endl;
else{
vector<int> n;
for(int i = l; i <= r; i++){
n.push_back(... | 1 |
#include <iostream>
using namespace std;
class dice{
public:
int d[7];
int setd();
int M(int*,int*,int*,int*);
};
int dice::setd(){
for(int i=1;i<=6;i++){
cin>>d[i];
}
return 0;
}
int dice::M(int *A,int *B,int *C,int *D){
int s,t;
s=*B;
*B=*A;
t=*C;
*C=s;
s=*D;
*D=t;
*A=s;
return 0;
}
int main(void){
... | #include <iostream>
#include <cstdio>
using namespace std;
int a[11][11];
void init(int n) {
for(int i = 0; i <= n; ++i) {
a[i][n] = 0;
a[n][i] = 0;
}
}
void Comp(int n) {
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
a[i][n] += a[i][j];
a[n][j] += a[i][j];
a[n][n] += a[i][j];
}
}
}
... | 0 |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void read_separated_string(vector<int> &v, string str) {
istringstream istr(str);
string tmp;
while (getline(istr, tmp, ' ')) {
v.push_back(stoi(tmp));
}
}
int main() {
int N, Q;
vector<int> n;
vector<in... | #include <bits/stdc++.h>
using namespace std;
int main (){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> vc1(N);
for( auto& x : vc1 ){
cin >> x;
}
int Q;
cin >> Q;
vector<int> vc2(Q);
for( auto& x : vc2 ){
cin >> x;
... | 1 |
#include <bits/stdc++.h>
//#define DEBUG
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){
string S;
cin >> S;
map<cha... | #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 repx(i, x, n) for (int i = int(x); i < int(n); ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) ((... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define All(a) a.begin(),a.end()
#define INF 1000000007
const int MOD = 1000000007;
//accumulate(vec.begin(), vec.end(), 0)
//std::sort(v.begin(), v.end(), std::greater<Type>());
//set_intersection(x, x+7... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long lo... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin>>n;
vector<int> arr(n+1);
for(int i = 1; i <= n; i++) cin>>arr[i];
vector<ll> pf(n+1);
vector<ll> dp(n+1,LLONG_MIN);
for(int i = 1; i <= n; i++) if(i&1) pf[i]+=arr[i]+pf[i-2 < 0 ? 0 : i-2]; // pref... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
string s[8];
int ng[8][8];
bool flg;
void dfs(int r){
if(r==8){
flg=1;
return;
}
for(int c=0;c<8;c++){
if(s[r][c]=='Q'){
dfs(r+1);
return;
}
}
for(int c=0;c<8;c++){
if(ng[r][c]) continue;
s[r][c]='Q';
fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<P> ab(n), sum(n);
for(int i=0; i<n; ++i){
cin >> ab[i].first >> ab[i].second;
sum[i].first = ab[i].first + ab[i].second;
sum[i].second = i;
}
sort(sum.begin(),sum.end... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef vector<bool> vbool;
typedef vector<int> vint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n);... | #include <iostream>
#include <queue>
#define H 20+1
#define W 20+1
using namespace std;
signed char di[4] = { 1,0,-1,0 }; // i+, j+, i-, j-
signed char dj[4] = { 0,1, 0,-1};
typedef struct {
char s[H][W]; // ÕÊÌóÔ
char n; // Ú®ñ
char d; // ±ê©çÚ®·éûü
char i,j; // »Ý... | 0 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e9 + 5;
#define INF 100000000000
const int MOD = 1e9+7;
const double PI = 3.141592653589793238462... | 0 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int mod = 1e9 + 7;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int n, x, t;
ci... | /*input
1000 1 1000
*/
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#inc... | 1 |
#include <bits/stdc++.h>
#define LL long long
#define LD long double
#define pb push_back
#define mp make_pair
#define ss(x) (int) x.size()
#define fi first
#define se second
#define cat(x) cerr << #x << " = " << x << endl
#define rep(i, j, n) for (int i = j; i <= n; ++i)
#define per(i, j, n) for (int i = n; j <= i; --... | #include<iostream>
#include<vector>
#include<algorithm>
#define int long long
using namespace std;
const int N=42;
const int mod=2147483647;
const int mod1=1e9+9;
const int base=43;
int n,mul[N],mul1[N];
string s;
bool used[N];
vector<pair<int,int> > damn[N],damn1[N];
void check(){
int i,dem=0,val=0,val1=0,val2=0,val3... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define FOR(i,start,sto... | 0 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n+1,0);
for (int i = 1; i <= n; i++) {
int b;
cin >> b;
a[i] = b;
}
long long cumulativeSum = 0;
for (int i = 1; i <= n; i++){
... | //#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)re... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000 // 10^12
#define MOD 1000000007 // 10^9+7
#define PB push_back
#define MP make_pair
const int MAX_N = 100... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
int main(){
int N,a;cin>>N;
vector<int> A(N+2,0);
A[0]=3;
long long c=1;
REP(i,N){
scanf("%d",&a);
c*=(A[a]-A[a+1]++);
c%=1000000007;
}
cout<<c<<endl;
} | 1 |
#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const int MAXN = 10001;
int main()
{
bool prime[MAXN];
memset(prime, true, sizeof(prime));
prime[0] = prime[1] = false;
for (int i = 2; i * i < MAXN; i++){
for (int j = i * i; j < MAXN; j += i){
prime[j] = false;
}
... | #include <iostream>
#include <vector>
#include <algorithm>
std::vector<int> twin_primes(int upper) {
std::vector<bool> suspects(upper + 1, true);
suspects[0] = suspects[1] = false;
std::vector<int> res;
for (auto i = 2; i <= upper; ++i) {
if (suspects[i]) {
if (suspects[i - 2])
res.push_back(i);
for (au... | 1 |
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
int n,k,L[100];
cin >> n >> k;
for(int i = 0; i < n; i++)
cin >> L[i];
sort(L,L+n);
int sum = 0;
for(int i = n-1; i >= n-k; i--)
sum += L[i];
cout << sum <... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A(N);
int count = 0;
for (size_t i = 0; i < N; i++)
{
cin >> A[i];
}
while (1)
{
bool exist_add = false;
for (auto &&i : A)
{
if (i % 2 == 1)
... | 0 |
#include "bits/stdc++.h"
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '\n'
#define all(V) (V).begin(), (V).end()
using namespace std;
typedef long long ll;
int main() {fio;
int n, m;
cin >> n >> m;
vector <vector <int>> a(n, vector <int> (m));
for(int i = 0; i < n; i++) {
for(int... | #include<bits/stdc++.h>
using namespace std;
int read() {
char cc = getchar(); int cn = 0, flus = 1;
while(cc < '0' || cc > '9') { if( cc == '-' ) flus = -flus; cc = getchar(); }
while(cc >= '0' && cc <= '9') cn = cn * 10 + cc - '0', cc = getchar();
return cn * flus;
}
const int N = 1000 + 5 ;
#def... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a >= b){
a = b;
}
if(c >= d){
c = d;
}
cout<<a+c<<'\n';
return 0;
}
| #include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
signed main()
{
int a... | 1 |
// Date: 2020-02-29
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define FIO ios::sync_with_stdio(false);cin.tie(0)
#define rep(i, a, b) for(int i = int(a); i <= int(b); ++i)
#define per(i, b, ... | #include <bits/stdc++.h>
#define ll long long
#define INF LLONG_MAX
#define dd double
#define fi first
#define se second
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define dll deque<long long>
#define qll queue<long long>
#defin... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair < int , int >;
using i3 = pair < int , ii >;
using li = pair < ll , int >;
using lii = pair < ll , ii >;
using pll = pair < ll , ll >;
using vi = vector < int >;
using vl = vector < ll >;
us... | /*input
4
141421356 17320508 22360679 244949
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
const int M=1e9+7;
int n, sq=0, s=0;
int a[200005];
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin>>n;
for(int i=1; i<=n; ++i){
cin>>a[i];
}
for(int... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fr first
#define sc second
#define pb push_back
const ll mod = 1e9+7;
const int N = 2e5+205;
void solve(){
int n;
cin>>n;
vector<ll>v;
for(int i=0;i<n;i++){
ll x;
cin>>x;
v.pb(x);
}
sort(v.begin(),v.end());... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N; cin >> N;
vector<ll> v(N);
ll sum = 0;
int num = 0;
for(int i = 0; i < N; i++){
cin >> v[i];
if(v[i] < 0){
num++;
... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
static const long long INFTY = (1LL << 32);
void WarshallFloyd(long long weight[][100], int verNum) {
//k????¢??????????????????????????????°????¢??????????????????????????±???????
//???????????????????¨???????
for (int k = 0; k < ver... | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) fprintf(stderr, "#%s.%d (%s) = (%ld)\n", __func__, __LINE__, #x1, x1);
#define dumpll(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%ld, %ld)\n... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define dump(...) cout<<"# "<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp mak... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pci pair <c... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[600005],b[200005],c[600005];
int l,r=1,o;
int main(){
cin>>n;
for(int i=0;i<=n*2;++i){
if(i-n){
cin>>a[i+(i<n?n+1:-n-1)];
}
}
a[n*2+1]=a[n+1];
a[n]=a[0];
for(int i=0;i<n;++i){
b[i]=a[0]^a[n+1+i];
}
for(int i=0;i<=n*2;++i){
a[i]^=a[i+1];
}
... | 1 |
#include<cstdio>
#include<algorithm>
typedef long long lint;
lint doz[23];
lint D;
lint dfs(int l,int r,lint d)
{
if(l>=r)
{
if(d) return 0;
return l==r?10ll:1ll;
}
if(d%10==0)
{
if(l==1) return dfs(l+1,r-1,d/10)*9;
return dfs(l+1,r-1,d/10)*10;
}
lint di=d%10-10;
lint de=d+di*(doz[r-l]-1ll);
if(l==1) ... | #include<bits/stdc++.h>
using namespace std;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename F>
struct FixPoint : F{
FixPoint(F&& f):F(forward<F>(f)){}
template<typename... Args>
decltype... | 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void abc_160a();
void abc_161a();
void abc_162a();
void abc_163a();
void abc_164a();
void abc_165a();
void abc_166a();
void abc_167a();
void abc_168a();
void abc_169();
int main()
{
//abc_160a();
//abc_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.