code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define LOCAL 1
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define dbg(...) cout<<#__VA_ARGS__ ": ["; for(auto e: __VA_ARGS__){cout<<e<<", ";} cout<<"]\n"
#define dbg1(...) cout<<#__VA_ARGS__ " "<< __VA_ARGS__
#else
#define d... | #include <iostream>
#include <algorithm>
using namespace std;
int n, a[1111111], c, g[20];
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
cin >> n;
for(int i = 0; i < n; i++) {
cin >> a[i];
}
g[0] = 1; c = 0;
while(true) {
g[c + 1] = g[c] * 3 + 1;
if(g[++c] >= n) break;
}
int ret = 0;
for(i... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool match( char ch, const string& p ) {
for( auto a: p ) {
if( a == ch ) { return true; }
}
return false;
}
int main() {
ios_base::sync_with_stdio( false );
string s;
while( cin >> s ) {
int n = (int)s.size();
int result = 0;
for( int i = n-1; i >= 0; --i... | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
char c[101],m[7]={'I','V','X','L','C','D','M'};
int s,i,j,h,n[7]={1,5,10,50,100,500,1000};
while(gets(c)!=NULL) {
s=0; h=10;
for (i=0;i<strlen(c);i++) {
for (j=0;j<7;j++) if (c[i]==m[j]) break;
s+=n[j];
if (h... | 1 |
#include <iostream>
#include <utility>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <stack>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
const int INF = 1 << 28;
int w, h;
int field[32][32];
int sx, sy;
int gx, gy;
int ofs[4][2] = {... | #include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for... | 1 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
vector<int> cnt(26,0);
for(int i=0; i<s.size(); i++){
cnt[s[i] - 'a']++;
}
string ans;
if(s.size() != 26){
ans = s;
for(int i=0; i<26; i++){
if(cnt[i] == 0){
an... | 1 |
#include <atcoder/scc>;
#include <atcoder/convolution>
#include <atcoder/modint>
#include <atcoder/math>
#include <atcoder/fenwicktree>
#include <atcoder/dsu>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#inc... | #define FILEIO(a) freopen(a".in", "r", stdin); freopen(a".out", "w", stdout);
#include <cstdio>
#include <algorithm>
#include <numeric>
typedef long long ll;
const int MaxN = 100005;
inline int div_ceil(ll a, int b) {
return (a + b - 1) / b;
}
int n, W;
struct node {
int b, l, r; ll val;
node() = default;
nod... | 0 |
/*
Contest 090
A - Diagonal String
Rakesh Kumar --> 18/09/2020
*/
#include <bits/stdc++.h>
inline bool palindrome(const std::string& s) {
int i = 0;
int j = s.size() - 1;
while (i < j) {
if (s[i++] != s[j--])
return false;
}
return true;
}
int main() {
std::ios_base... | #include<iostream>
#include<string>
#include<vector>
#include <algorithm>
using namespace std;
int kaibunnsuu (int n){
vector<int> N;
while(n > 0){
int ind_digit = n % 10;
N.push_back(ind_digit) ;
n = n /10;
}
int size = N.size() ;
vector<int> rev_N(size);
for(int i=0;i<s... | 1 |
#include <bits/stdc++.h>
using namespace std;
bool is(int i){
if(i%3==0||i%10==3)return true;
while(i/=10)if(i%10==3)return true;
return false;
}
int main(){
int a=1,u;cin>>u;for(;a<=u;a++)if(is(a))cout<<" "<<a;cout<<endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1<<30);
int main() {
string s;
cin >> s;
if(s[0] == '7' || ... | 0 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#define SENTINEL 2e9
using namespace std;
long long cnt;
void Merge(int* A, int left, int mid, int right){
int n1 = mid - left;
int n2 = right - mid;
int *L,*R;
L = new int[n1+1]; R=new int[n2+1];
for(int i=0;i<n1;i++){
L[i] = A[left + i];
... | #include <bits/stdc++.h>
using namespace std;
template <typename T>
class FenwickTree
{
public:
int N;
vector<T> dat;
FenwickTree(int n, T m = 0)
{
init(n, m);
}
void init(int n, int m)
{
N = n;
dat.resize(n + 1);
for (int i = 0; i < dat.size(); i++)
{
dat[i] = m;
}
}
... | 1 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int ... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n;
int q[N];
int main()
{
sca... | 1 |
#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define rep2(i,j,k) for(int i=j;i>=k;i--)
using namespace std;
template<typename T> void read(T &num){
char c=getchar();T f=1;num=0;
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){num=(num<<3)+(num<<1)+(c^48);c=getchar();}
num*... | //#define _GLIBCXX_DEBUG
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define FOR(i,n,m) for(ll i=n; i<(ll)m;i++)
#define FORr(i,m,n) for(ll i=n; i>=(ll)m; i--)
#define FORm(i,m) for(auto i=m.begin();i!=m.end();i++)
#defin... | 1 |
#include <iostream>
#include <string>
using namespace std;
void Solution()
{
string str;
int a;
int b;
int l;
int x;
char c;
while (getline(cin, str)) //enter
{
x = 0;
l = (int)str.size();
for (int i = 0; i < l; i++)
{
... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int match[10] = { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
const int INF = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
int a[m];
for ( int i = 0; i < m; i++ ) { cin >> a[i]; }
sort(a, a+m, greater<int>());
int dp[n+1];
dp[0] = 0;
for ( int i = 1; i <= n;... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 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, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int a,b;
cin >> a>>b;
cout << ((a>8 ||b>8) ? ":(" : "Yay!") << '\n';
return (0)... | #include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include<set>
#include<tuple>
using namespace std;
#define INF 11000000000
#define MAX 100000
#define MOD 1000000007
typedef long long ll;
t... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) <... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
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;}
int... | 1 |
#include<stdio.h>
int main()
{
int n,a[10],b,i,j;
while(1){
scanf("%d",&n);
if(n==0){
break;
}
for(i=0;i<10;i++){
a[i]=0;
}
for(i=0;i<n;i++){
scanf("%d",&b);
a[b]++;
}
for(i=0;i<10;i++){
if(a[i]==0){
printf("-");
}
else{
for(j=0;j<a[i];j++){
printf("*");
}
}
... | #include <iostream>
char detClass(int pm, int pe, int pj)
{
int mean = pm + pe + pj;
if((pm == 100) | (pe == 100) | (pj == 100)) {
return 'A';
} else if( (pm + pe) >= 180) {
return 'A';
} else if( mean >= 240) {
return 'A';
} else if( mean >= 210) {
return 'B';
} else if( (mean >= 150) && ((pm >= 80) |... | 0 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main(){
vector<int> A(5);
for(int i = 0; i < 5; i++){
cin >> A[i];
}
int k;
cin >> k;
sort(all(A));
if(A[4]-A[... | #include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<cmath>//pow,logなど
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#include<iomanip>//setprecision(浮動小数点の出力の誤差)
#include<iostream>//入出力
#include<iterator>//集合演算(積集合,和集合,差集合など)
#include<map>//map(辞書)
#include<numer... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1000000007;
int main(){
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
int x = tx-sx;
int y = ty-sy;
for(int i=0; i<y; i++) cout << "U";
for(int i=0; i<x; i++) cout << "R";
f... | #include <bits/stdc++.h>
#define REP(i,n) for (long long i=0;i<(n);i++)
using namespace std;
template<typename V,typename Weight>
class Dijekstra {
private:
struct edge {
Weight dist;V node;V prev;
bool operator<(edge const& a) const {
return dist < a.dist;
}
bool operator>(edge const& a) const {
return ... | 0 |
#include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
int X = A*B;
int Y = A+B;
int Z = A-B;
if((X>=Y)&&(X>=Z))
{
cout << X;
}
else if((Y>=X)&&(Y>=Z))
{
cout << Y;
}
else if((Z>=Y)&&(Z>=X))
{
cout << Z;
}
re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int a,b;
cin >> a >> b;
int ans = a+b;
ans = max(ans,a-b);
ans = max(ans,a*b);
cout << ans << endl;
} | 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,n) for(int i=0; i<(n); ++i)
#define rep2(i,n) for(int i=1; i<=(n); ++i)
#define all(x) (x).begin(),(x).end()
#define sort_u(x) sort((x).begin(),(x).end())
#define sort_d(x) sort((x).begin(),(x).end(), greater<int>())
#define pb push_back
#define INF ((1LL<<62)-(1LL<<31)) // 浮動小数点型... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
int main(){
std::string s; std::cin >> s;
int A = s[0] - '0';
int B = s[1] - '0';
int C = s[2] - '0';
int D = s[3] - '0';
if (A + B + C + D == 7)
std::cout ... | #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... | 1 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | 0 |
#include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#defi... | 1 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
/* 大文字を小文字に変換 */
char tolower(char c) {return (c + 0x20);}
/* 小文字を大文字に変換 */
char toupr(char c) {return (c - 0x20);}
// if('A'<=s[i] && s[i]<='Z') s[i] += 'a'-'A';
/*
s... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, ai;
cin >> N;
map <int,int> A;
for(int i=0;i<N;i++){
cin >> ai;
if(A.count(ai) > 0){ cout << "NO" << endl; return 0;}
else A[ai] = 1;
}
cout << "YES" << endl;
} | 1 |
//2017-11-7
//miaomiao
//
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)
#define N (100000+5)
bool Check(int a, int b, int c){
if(a > c) swap(a,... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000000000002
int main(){
int N;
cin>>N;
vector<int> A(N);
for(int i=0;i<N;i++)scanf("%d",&A[i]);
for(int i=1;i<N;i++)A[i] ^= A[i-1];
vector<vector<int>> ind... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(),A.end()
void ALLIN1_NUMBER(vector<ll>& V)
{
for(auto& x : V)
{
cin >> x;
}
}
template<class T>
void OUT0(T N)
{
cout << N << endl;
}
static const double pi = acos(-1.0);
double Cos(double D)
{
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed io... | 1 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#define rep(i,N) for(int i=0; i<N; i++)
using namespace std;
int main(){
int D, T, S;
cin >> D >> T >> S;
if(D<=T*S){
cout<<"Yes"<<endl;
}else{
cout << "No"<<endl;
}
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
// GCD, LCM
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main()
{
int A,B,K;
cin>>A>>B>>K;
for(int i=1;i<=K;i++){
if(i%2==1){
A/=2;
B+=A;
}else{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> l(Q), r(Q);
for (int i = 0; i < Q; i++)
{
cin >> l[i] >> r[i];
}
vector<int> acCount(N);
acCount[0] = 0;
for (int i = 1; i < N; i++)
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<sstream>
#include<string>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
int pre[n];
string str;
for(int i=0;i<n;i++){
cin >> pre[i];
}
cin >> str;
for(int i=0;i<str.size();i++)... | 0 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// cin.eof() 入力個数の問題
// int num = atoi(string.c_str()); 文字列の整数変換
int main() {
int h, ... | 0 |
#include <stdio.h>
#include <string.h>
int main() {
int ining;
int ten[50];
int base[3];
char act[8];
int outCnt = 0;
for(int i=0;i<50;i++){
ten[i] = 0;
}
for(int i=0;i<3;i++){
base[i] = 0;
}
scanf("%d",&ining);
for(int i=0;i<ining;i++){
while(outCnt < 3){
scanf("%s",act);
if(strcmp(act,... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
typedef pair<int,int> P;
const int INF=1e9;
int main(){
string s;
cin>>s;
rep(i,1<<3){
int sum=0;
sum+=s[0]-'0';
for(int j=1;j<4;j++){
if(i>>(j-1)&1) sum+=s[j]-'0';
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100003,INF=1<<30;
int N,K,maxi=0,ans=0;
vector<int> G[MAX],dis(MAX);
void DFS(int u,int p){
for(int i=0;i<G[u].size();i++){
int a=G[u][i];
if(a==p) continue;
... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N,K;
int ans[100010];
vector<int> g[100010];
bool used[100010];
int dist[100010];
vector<int> rg[10001... | 1 |
#include <cstdio>
#include <algorithm>
#define repu(i,x,y) for (int i=x; i<=y; ++i)
#define repd(i,x,y) for (int i=x; i>=y; --i)
using namespace std;
int n,m,len[2010],l[2010],r[2010],stk[2010],top,ans;
char a[2010][2010];
int main()
{
scanf("%d%d",&n,&m);
repu(i,1,n)
scanf("%s",a[i]+1);
ans=m;
... | #include <bits/stdc++.h>
#define For(i, a, b) for (register int i = (a), i##_end = (b); i <= i##_end; ++ i)
#define getc getchar_unlocked
#define inf (0x3f3f3f3f)
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define y1 igniubi
using namespace std;
inline int read() {
int _ = 0, __ = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> a(n);
for (int i=0; i<n; i++) cin>>a[i];
int ans = 0;
sort(a.begin(), a.end());
for (int i = 0; i<n-2; i++) {
int j1 = i+1;
while (j1 < n-1 && a[j1] == a[i]) j1++;
for (int j=j1; j... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi0 for(ll i=0;i<n;i++)
string s;
string strd(int n){
string x;
while(n){
int d=n%10;
x+=(d+'0');
n/=10;
}
reverse(x.begin(),x.end());
return x;
}
void digit()
{
cin>>s;
ll sum=0;
for(int... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n,m,p1,p2,mn,mx;
int main() {
cin>>n>>m; mx=1; mn=n;
for (int i=0; i<m; i++) {
cin>>p1>>p2;
mx=max(mx,p1);
mn=min(mn,p2);
}
cout<<max(0,mn-mx+1)<<'\n';
} | #include<bits/stdc++.h>
#include<string>
#define FIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long
#define mod (ll)(1e9+7)
#define nax (ll)(1e5)
#define INFL LLONG_MAX
#define NINFL LLONG_MIN
#define INF INT_MAX
#define disp(a,n,arr) for(int i=a;i<(ll)n;i++) cout << arr[i] << " ";... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
using ull = uint64_t;
using ll = in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int x, y, n, m, xi, yi, xmax=-100, ymin=100;
cin>>n>>m>>x>>y;
for (int i = 0; i < n; i++)
{
cin>>xi;
xmax = max(xmax, xi);
}
for (int i = 0; i < m; i++)
{
cin>>yi;
ymin = min(ymin, yi);
... | 0 |
#include <iostream>
#include <vector>
#include<math.h>
#include <algorithm>
using namespace std;
int main()
{
int a;
long long k;
cin>>a;
k=a+a*a+a*a*a;
cout<<k;
} | #include<iostream>
#include<cmath>
using namespace std;
int main()
{
int a;
cin>>a;
a=a+pow(a,2)+pow(a,3);
cout<<a;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
#define gc getchar()
template <typename T>
inline void read(T& x) {
x = 0; bool f = 1; char ch;... | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#define int long long
#define endl '\n'
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define line cout<<"here - "<<__LINE__<<"\n";
#define dbg(a) cout<<#a<<" --> "<<(a)<<"\n";
#define infi INT_MAX
#define rinfi INT_MIN
... | 0 |
#include<stdio.h>
int main(void)
{
int n,m,a[1000],b[1000],c,i,j,s[1000],min,max;
max=-1;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
s[i]=0;
}
for(j=1;j<=m;j++){
scanf("%d",&b[j]);
}
for(j=1;j<=m;j++){
for(i=1;i<=n;i++){
if(b[j]>=a[i]){
s[i]++;
// printf("i= %d j= %d a=%d\n",... | #include<iostream>
#include<stdlib.h>
using namespace std;
int main (){
int n, m;
int b, count, answer;
int *list, *result;
list = (int*)malloc(sizeof(int)*n);
result = (int*)malloc(sizeof(int)*n);
cin >> n >> m;
for(int i = 0; i<n; i++){
cin >>list[i];
result[i] = 0;
}
for(int i= 0; i< m; ... | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n,m;
cin >> n >> m;
vector<int> l(m,0);
vector<int> r(m,0);
vector<bool> can(n,true);
REP(i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,maxl=0,minr=1000000;
cin >> n >> m;
vector<int> l(m),r(m);
for(int i=0;i<m;i++){
cin >> l.at(i) >> r.at(i);
if(l.at(i)>maxl)maxl=l.at(i);
if(r.at(i)<minr)minr=r.at(i);
}
if(minr-maxl+1>0)cout << minr-maxl+1... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,a[1010][1010],h[1000100],dist[1000100];
vector<int>to[1000100];
int encode(int i, int j){
if(i>j)swap(i,j);
return i*n+j;
}
int main(){
cin>>n;
rep(i,n)rep(j,n-1){
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
const int maxn = 200005;
const int inf = 1000000007;
int x[maxn],yy[maxn];
char c[maxn];
vector<pair<int,int>>vv1;
vector<int>uu,rr,dd,ll;
int cnt = 0 ;
map<int,int>UL,UR,DL,DR,D,L;
vector<int>GG[5*maxn];
vo... | 0 |
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string x;
cin >> x;
for (auto ch : x) {
if (ch == '7') {
cout << "Yes" << endl;
return 0;
}
}
cout <<... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i... | 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>;
int main() {
int N;
cin >> N;
vector<int> a(N + 1), b(N + 1);
for (int i = 1; i <= N; i++) cin >> a[i];
for (int i = N; i >= 1; i--){
int s = 0;
for (int j = i + i; j <= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N);
vector<int>B(N,0);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
if (i >= N/2){
B.at(i) = A.at(i);
}
}
for (int i = N/2; i > 0; i--) {
int judge = 0;
for (int j = 1; j <= N/i; j+... | 1 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#define ll long long
#define LINF 0x3f3f3f3f3f3f3f3f
#define INF 0x3f3f3f3f
using namespace std;
const int MAX = 1e5 + 10;
const int MOD = 1e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for... | 0 |
#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n, l;
cin >> n >> l;
int mn = 1000, sum = 0;
rep(i,n) {
int t = i + l;
... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >... | 0 |
#include<stdio.h>
int a,b,c,d,e[1001],f[1001],g[1001],h[1001],x[1001],y[1004],z[1001];
int main(void)
{
while(scanf("%d%d%d",&a,&b,&c),a + b + c)
{
int result[320] = {0};
scanf("%d",&d);
for(int i = 0; i < d; i++)
{
scanf("%d%d%d%d",&e[i],&f[i],&g[i],&h[i]);
... | #include<iostream>
using namespace std;
int main(){
int a, b, n;
int suma = 0;
int sumb = 0;
while(1){
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++){
cin >> a >> b;
if(a > b) suma += a + b;
else if(a < b) sumb += a + b;
else if(a == b){
suma += a;
su... | 0 |
#include<stdio.h>
int main(void)
{
int a[10001],s,d,f,g,h,i,j;
a[1]=0;
for(i=2;i<=10000;i++){
a[i]=1;
}
for(i=2;i<=5000;i++){
if(a[i]!=0){
s=2;
while(i*s<=10000){
a[i*s]=0;
s++;
}
}
}
/*for(i=1;i<=10000;i++){
if(a[i]==1){
printf("%d\n",i);
}
}*/
scanf("%d",&d);
while(d!=0){
for... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
map<int, int> odd, even;
rep(i, n) {
... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
if (v.size()) {
os << v.front();
for (auto vi = v.begin() + 1; vi != v.end(); vi++)
os << " " << *vi;
}
return os;
}
int bubble... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> w, k;
int w_max = 0;
int k_max = 0;
for(int i = 0; i < 10; i++) {
int W;
cin >> W;
w.push_back(W);
}
for(int i = 0; i < 10; i++) {
int K;
cin >> K;
k.push_back(K);
}
sort(... | 0 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include ... | #include<cstdio>
int comparedice(void);
class dice{
private:
int a,b,c,d,e,f;
public:
void setnumber(void);
void E(void);
void W(void);
void S(void);
void N(void);
void R(void);
void V(void);
int frontside(int x,int y);
int putme(char me);
};
void dice::setnumber(void){
scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&e,&... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string str... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef int_fast64_t ll;
template<int N, typename T, T M>
struct ModFact {
T fact[N+1];
constexpr ModFact() : fact() {
fact[... | 1 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<deque>
#include<bitset>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef pair<ll,ll> P;
template<class T> inline bool chmax(T&a , T b){ if(a<b){ a=b; re... | 1 |
#include <stdio.h>
int main(){
int x;
int y;
int z;
scanf("%d/%d/%d",&x , &y ,&z);
printf ("%d/%02d/%02d",x+1,y,z);
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
cin >> s;
cout << s.replace(3, 1, "8") << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long> A(3);
for (int i = 0; i < 3; ++i) cin >> A[i];
long long K;
cin >> K;
sort(A.begin(), A.end());
for (int i = 0; i < K; ++i) A.back() *= 2;
cout << A[0] + A[1] + A[2] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> a(3);
int k;
cin >> a[0] >> a[1] >> a[2];
cin >> k;
int check;
int amax=max({a[0],a[1],a[2]});
for(int i=0;i<3;i++){
if(amax==a[i]) check=i;
}
for(int i=0;i<k;i++) amax*=2;
cout << a[0]+a[1]+a[... | 1 |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | #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 st... | 1 |
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitse... | #include <bits/stdc++.h>
#define mod 998244353
using namespace std;
int fac[1000005],inv[1000005],n,m;
inline int qpow(int a,int b)
{int tp=a,res=1;
while (b)
{if (b&1) res=1ll*res*tp%mod;
tp=1ll*tp*tp%mod;b>>=1;
}
return res;
}
inline int cal(int a,int b)
{return 1ll*(1ll*fac[a+b]*inv[a]%mod)*inv[b]%mod;}
int main (){... | 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
using namespace std;
/*int main()
{
int n; cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
// for(int i=0;i<n;i++) cout<<a[i];
int sum=0;
for(int i=n-1;i>1;i--)
{
for(int j=i-1;j>0;j--)
{
if(a[i]==a[j]... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int ans = 1;
for(int i=2;i*i<=N;i++){
int work = i*i;
ans = max(ans,work);
}
cout << ans << endl;
return 0;
} | 0 |
//auto 関数名 = [(&:ラムダ外の引数をとる時))](引数の型1 引数名1, 引数の型2, 引数名2, ...) { 関数の処理 }; //inside main() define function. take care of };
// for (int tmp = 0; tmp < (1 << ビット数); tmp++) {
// bitset<ビット数> s(tmp);
// // (ビット列sに対する処理)
// }
// sort(配列変数.begin(), 配列変数.end());
// do {
// // 順列に対する処理
// } while (next_permutation(配列変数.be... | #include<iostream>
#include<cmath>
int main() {
int a = {};
int a2 = {};
int a3 = {};
std::cin >> a;
a2 =std::pow(a, 2);
a3 = std::pow(a, 3);
a = a + a2 + a3;
std::cout << a << std::endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define f(i,a,b) for (int i = a; i < b; i++)
#define fr(i,a,b) for (int i = b-1; i >= a; i--)
const int mod = 998244353;
const int mxn = 1e5;
int n,K;
void add(ll &a, ll b) { if (b>=mod) b%=mod; a+=b; if (a>=mod) a-=mod; }
ll modpow(ll a, ll b) {
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define MOD 998244353
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
string s; cin>>s;
int n=s.length();
lint hist[128]={};
rep(i,n) hist[s[i]]++;
lint ans=1;
for(int c='a';c<='z';c++) for(int d=c+1;d<='z';d++) {
ans+=hist[c]*hist[d];
}
cout<<ans<<'\n';
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;cin>>S;
vector<long long>v(26);
for(int X=0;X<S.size();X++){
v[S[X]-97]++;
}
sort(v.begin(),v.end());
long long H=0;
for(int X=25;X>=0;X--){
if(v[X]>1){
H+=v[X]*(v[X]-1)/2;
}
else{
break;
}
}
cout<<S.si... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include<bits/stdc++.h>
using namespace std;
bool col[1000005];
bool row[1000005];
long long mod=1e9+7;
int main(){
int n,m,a,b;
long long ans=1;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>a;
if(row[a])
{
cout<<0;
return 0;
}
row[a]=1;
}
for(int i=1;i<=m;i++)
{
cin>>b;
if(col[b])
{
cout<<0;
return... | 0 |
#include <iostream>
#include<algorithm>
using namespace std;
//upper_bound, lower_boundを用いた
//のになぜか通らない・・・
int main(){
int n;
long long a;
if(scanf("%d", &n)==EOF){return 0;}
long long top[n];
long long center[n];
long long down[n];
for(int i = 0; i<n; i++){if(scanf("%lld", &a)==EOF){return 0;} top[i] = a;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll INF = 1LL << 60; //MAX 9223372036854775807
ll ans = INF;
int main()
{
ll n , x ;
cin >> n >> x ;
vector<vector<ll>> v(n, vector<ll>(3,0) );
vector<pair<ll,ll>> s;
ll d=0;
rep(i,n){
cin >> v... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i < (int)n;++i)
int main() {
int a[4];
rep(i,4)cin>>a[i];
cout<<min(a[0], a[1])+min(a[2], a[3])<<endl;
return 0;
} |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#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 fore(i,a) for(auto &i:a)
#define INF INT_M... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,a,imin,j;
cin >> N >> A;
for (imin = 0; A % 2 == 0; imin++)
A /= 2;
for (int i = 0;i < N-1; i++) {
cin >> a;
for (j = 0;a % 2 == 0;j++)
a /= 2;
if (j < imin)
imin = j;
}
cout << imin << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true... | 1 |
#include <iostream>
#include <utility>
#include <algorithm>
typedef long long ll;
using namespace std;
ll H[5010], P[5010], dp[5010], lmax=1e12;
pair<pair<ll, ll>, int> pr[5010];
int main() {
int N;
cin >> N;
for(int i=0; i<N; ++i){
cin >> H[i] >> P[i];
pr[i]=make_pair(make_pair(H[i]+P[i], P[i]), i);
}
sort(... | #include <bits/stdc++.h>
template <class T>
inline void read(T &res)
{
res = 0; bool bo = 0; char c;
while (((c = getchar()) < '0' || c > '9') && c != '-');
if (c == '-') bo = 1; else res = c - 48;
while ((c = getchar()) >= '0' && c <= '9')
res = (res << 3) + (res << 1) + (c - 48);
if (bo) res = ~res + 1;
}
co... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
//A=65,a=97
int main() {
int k,t;cin >> k >> t;
vector<int> a(t);for(int i=0;i<t;i++) cin >> a[i];
sort(a.begin(),a.end());
if(a[t-1]<=(k+1)/2){
cout << 0 << endl;
return ... | #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() {
ll K, T;
cin >> K >> T;
vector<ll> a(T... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N, x;
int a[100];
long long num = 0LL;
cin >> N >> x;
for (int i = 0;i < N;i++) cin >> a[i];
sort(a, a + N);
int count=0;
for (int k = 0;k < N-1;k++) {
num += a[k];
if(num<=x)
count++;
}
if (num <= x) {
if ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
ll a[123];
void solve(){
int n;
ll x;
cin>>n>>x;
for(int i=1;i<=n;i++)cin>>a[i];
sort(a+1,a+1+n);
ll sum = 0;
int ans = ... | 1 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define int long long
#define endl "\n"
#define all(x) (x).begin(),(x).end()
const int MOD = 1e9+7;
const int mxN = 2e5+3;
void solve... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int a[5], k;
for ( int i = 0; i < 5; i++ ) {
cin >> a[i];
}
cin >> k;
sort(a, a + 5);
cout << (a[4] - a[0] > k ? ":(\n" : "Yay!\n");
return (0);
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 3e5;
const LL MOD = 1e9+7;
inline LL dmod(LL x){
return x%MOD;
}
LL fakto[N+5];
void pre(){
fakto[0] = 1LL;
for(int i=1;i<=N;i++){
fakto[i] = dmod(fakto[i-1]*(LL)(i));
}
return;
}
LL fe(LL x, LL y){
if(y==0) return 1LL;
LL r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
const ll MAX = 200200, MOD = 1000000007;
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++){
... | 0 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll ... | #include<bits/stdc++.h>
using namespace std;
int flip[2],mv[2];
vector <int> vec[2];
bool vis[1000100];
int a[1000100],b[1000100],c[1000100],go[1000100];
int work(vector <int> &vec)
{
//for (int i=0;i<vec.size();i++) cout<<vec[i]<<' ';cout<<"\n\n";
int ans=0;
memset(vis,0,sizeof(vis));
for (int i=0;i<vec.size();i++... | 0 |
#include <iostream>
#include <sstream>
#include <cmath>
#include <string>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | #include<iostream>
#include<queue>
using namespace std;
int main(){
priority_queue<int>q1,q2;
int a,b;
for(int i=0;i<4;i++){
cin>>a;
q1.push(a);
}
for(int i=0;i<2;i++){
cin>>a;
q2.push(a);
}
for(int i=0;i<3;i++){
b+=q1.top();
q1.pop();
}
... | 0 |
#include<iostream>
#include<string>
#include<vector>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
int keta(int i) {
int ret=0;
while (i > 0) {
i /= 10;
ret++;
}
return ret;
}
void ita(int y, vector<int> *x) {
int i = x->size()-1;
while (y > 0) {
x->at(i--) = y % 10;
y /= 10;
}
}
int m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define int ll
char grid[410][410];
bool seen[410][410];
vector<P> gr[1001001];
int ans;
int h,w;
void dfs(int i, int j, int &g, int pi=-1, int pj=-1){
if(seen[i][j]==1) ret... | 0 |
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
int main()
{
ll n,m,t,i,res=0;
cin >> n;
m=(ll)sqrt(n);
for(i=m;i>0;i--)
if(n%i==0){
t=n/i;
while(t>0){
t/=10;
res++;
}
cout << res << endl;
return 0;
}
retur... | /*Allah Vorosha*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define n_p next_permutation
#define p_p prev_permutation
#define in insert
#define rev reverse
#define pf push_front
#define pob pop_back
#define uniq(v) v.resize(distance(v... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <stdio.h>
#include <string.h>
int main() {
char A[20], B[20], C[20];
A[20] = 'a' - 'z';
B[20] = 'a' - 'z';
C[20] = 'a' - 'z';
scanf ("%s %s %s", &A, &B, &C);
if (A [strlen(A) - 1] == B[0] && B [strlen(B) - 1] == C[0]) {
printf ("YES");
}
else {
printf ("NO"... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
// i桁目まで見て j枚多く払う時(0 or 1)
ll dp[1000100][2];
int main() {
string s;
cin >> s;
s = '0' + s;
int n = (int)s.size();
memset(dp, 0, sizeof(dp));
dp[0][1] = 1;
for (int i = 1; i < n; i+... | #include <cstdio>
#include <algorithm>
using namespace std;
char S[1001001];
int D[10], F[10];
int main()
{
scanf ("%s", S);
for (int i = 0; i < 10; i++) D[i] = i;
for (int t = 0; S[t]; t++){
for (int j = 0; j < 10; j++) F[j] = 1e9;
for (int j = 0; j < 10; j++) for (int i = 0; i < 10; i++){
int k = j * 10 ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
#define gc getchar()
template <typename T>
inline void read(T& x) {
x = 0; bool f = 1; char ch;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
#define nl cout<<"\n"
#define db(x) cout<<x<<" "
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define fk(a,b) for(int k=a;k<b;k++)
#define F first
#define S second
template <typena... | 1 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define INF 1e9 + 1
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n, A[100010];
... | #include <iostream>
#include <iterator>
#include <vector>
#include <algorithm>
using namespace std;
void swap(int &a, int &b) {
int t = a;
a = b;
b = t;
}
int partition(vector<int> &A, int p, int r) {
int x = A[r];
int i = p;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
swap(A[i], A[j]);
i++;
}
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | #include<iostream>
#include<bits/stdc++.h>
#include<climits>
#define forn(x,n,s) for(int i = x; i < n; i += s )
#define forr(x,n,s) for(int i = x; i>=n; i -= s)
using namespace std;
void go(){
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen(... | 1 |
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
// ???????????¢?????????
class DiceSurface
{
private:
unsigned short number_; // ????????¢??????????????????
public:
DiceSurface() {}
DiceSurface(const unsigned short& number)
: number_(number)
{}
~DiceSurface() ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
inline void Add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
char s[305];
int len, n, K, a[305], f[305][305][305];
int main() {
scanf("%s %d", s + 1, &K);
len = strlen(s + 1);
n = 0;
for (int i = 1, lst = 0; i <= len + 1; i++) {
if (i ... | 0 |
#include <iostream>
using namespace std;
void output(int i){
cout << " " << i;
}
bool include3(int n){
while(n){
if (n % 10 == 3){
return true;
}
n /= 10;
}
return false;
}
void call(int n){
for(int i = 1; i <= n; i++){
if(include3(i)){
output(i);
}else if(i % 3 == 0){
output(i);
}
}
cout <... | #include <iostream>
int main(){
int d;
while(std::cin >> d){
int sum = 0;
for(int i = d; i < 600; i += d){
sum += i*i*d;
}
std::cout << sum << std::endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,ans;
while(cin >> a >> b >> c >> d){
ans = 0;
ans+=min(a,b);
ans+=min(c,d);
cout << ans << endl;
}
}
| #include<stdio.h>
int main()
{
int A, B, C, D, X, Y;
scanf("%d%d%d%d",&A, &B, &C, &D);
if(A>B){X=B;}
else{
X = A;
}
if (C>D){Y=D;}
else {
Y = C;
}
printf("%d\n", (X+Y) );
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
temp... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef... | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, m;
cin >> n >> m;
vector<vector<int64_t>> a(n, vector<int64_t>(m));
for (auto i : irange(0L, n)) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
int k;
string ss;
cin>>k>>s;
if(s.length()>k){
for(int i=0; i<k; i++){
ss += s[i];
}
ss+="...";
}
else {
ss =s;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int k;
string s, t = "...";
cin >> k >> s;
if(s.size() <= k)
cout << s << '\n';
else {
for (int i = 0; i < k; ++i) {
cout << s[i];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#define all(v) (v).begin(),(v)... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
#include <set>
#include <cmath>
#include <bitset>
#include <queue>
#define enter putchar('\n')
#define space putchar(' ')
//#define ivorysi
#define pb push_back
#define mo 974711
#define pii pair<int,int>
#define mp make_pai... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
const int MOD = 1e9+7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
ll a;
cin >> a;
ll ans = 999;
while(a>99){
ans = ... | #include<bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
string s;
cin >> s;
int n = s.size();
int mn = 754;
for(int i=0; i<n-2; ++i){
string str = s.substr(i,3);
int num = stoi(... | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=200, MAXINT=2147483647;
int a[N], t, n, mi=MAXINT;
int main() {
cin >> n;
for (int i=0; i<n; i++) {
cin >> a[i];
if (a[i]%2) {
cout << 0; return 0;
} else {
int tp=0;
while... | 1 |
#include <bits/stdc++.h>
using std::max;
const int N=15,Inf=1e9+10;
int n,m,map[N][N],f[N][1<<N],M[N][1<<N],sum[1<<N];
void Init() {
scanf("%d%d",&n,&m);
int a,b,c;
for (int i=1;i<=m;++i) {
scanf("%d%d%d",&a,&b,&c);
a--; b--;
map[a][b]=map[b][a]=c;
}
}
int summ;
bool vis[N];
void Dfs(int x,int s) {... | #include <queue>
#include <cstring>
#include <iostream>
using namespace std;
int rcount[2001][2001], d[2001][2001], u[2001][2001], r[2001][2001], l[2001][2001];
int main() {
int n, m, q; cin >> n >> m >> q;
string s[n];
for (int i = 0; i < n; i++) cin >> s[i];
for (int x = 1; x <= n; x++)
for ... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L"... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
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; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int N = 1e6 + 5, mod = 1e9 + 7;
bool A[N], B[N];
int n, m, x;
LL ans = 1, r, c, tc, tr;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> m;
for(int i = 0; i < n; i++) {
cin >> x;
if(A[x]) {return cout... | #include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define ALL(x) x.begin(),x.end()
#define pb push_back
#define LL long long
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
templ... | 1 |
#include<bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define I1000000007 (1000000007)
#define I998244353 (998244353)
#define IINF (1<<28)
#define LINF (1LL<<60)
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) RE... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> data;
int sz;
UnionFind(int sz) : data(sz, -1), sz(sz) { }
bool unionSet(int x, int y) {
if ((x = root(x)) == (y = root(y))) return false;
if (data[x] > data[y]) swap(x, y);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
int main() {
int64_t N, M, V, P;
cin >> N >> M >> V >> P;
vector<int64_t> A(N);
for(auto &e : A) cin >> e;
sort(A.begin(), A.end());
rep(i, N) A[i] += M;
vector<int64_t> cum(N + 1);
rep(i, N) cu... | #include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int n,m,a[N],b[N],match[N];
char s[N],t[N];
int main()
{
scanf("%d%s%s",&n,s+1,t+1);
if (!strcmp(s+1,t+1)) return puts("0"),0;
for (int p=n,q=n;p;p--){
while (t[p]==t[p-1]) p--;
while (q&&(q>p||s[q]!=t[p])) q--;
if (!q) return puts("-1"),0;
mat... | 0 |
#include<iostream>
#include<vector>
#include<unordered_map>
#include<climits>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>v(n);
unordered_map<int,int>ump1,ump2;
for(int i=0;i<n;i++)
{
cin>>v[i];
}
for(int i=0;i<n;i+=2){
ump1[v[i]]++;
}
for(int i=1;i... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
long long n,sum=0,he=0;
cin>>n;
long long a[n];
for(int i=0;i<n;i++){
cin>>a[i];
he+=abs(a[i]);
if(a[i]<0) sum++;
a[i]=abs(a[i]);
}
sort(a,a+n);
if(sum%2==0) cout<<he<<endl;
else cout... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
vector<int> v(1001);
int cnt=0;
for(int i=1; i<1002; i++){
if(i%3==0) cnt++;
v[i]=cnt;
}
int n; cin>>n;
cout<<v[n]<<endl;
} | #include <iostream>
#include <numeric>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, in... | 1 |
#include<stdio.h>
//this file is not a C file but a C++ file
int main(void){
int stnum;//the number of the student
int pm, pe, pj;//ある生徒の点数
char grade;//成績 ... | #include <iostream>
using namespace std;
void res(int, int, int);
int main()
{
int n, pm, pe, pj;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> pm >> pe >> pj;
res(pm, pe, pj);
}
}
return 0;
}
void res(int pm, int pe, int pj)
{
double ave, meave;
ave = (double... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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 int INF=1001001001;
vector<pair<int64_t,int64... | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
int N; cin >>N;
vector<int> a(N);
rep(i,0,N) {
cin >>a[i];
}
int b=accumulate(a.begin(),a.end(),0);
int ans=0;
int c=IN... | 1 |
// ALPC-B.cpp
#include <iostream>
#include <atcoder/fenwicktree.hpp>
using namespace std;
using namespace atcoder;
#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = long long;
int main()
{
int n, q;
cin >> n >> q;
fenwick_tree<ll> fw(n);
ll a;
rep(i, n) {
cin >> a;
fw.add(i, a); // ... | #include <iostream>
#include <vector>
#include <functional>
template<typename T> struct segment_tree {
private :
int N;
std::vector<T> value;
public :
const std::function<T(T, T)> op;
const T id;
segment_tree(const std::vector<T>& a, const std::function<T(T, T)>& f, const T& t) : op(f), id(t) {
int n = a.size(... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a, b, k;
int main() {
cin >> a >> b >> k;
for (int i = 0; i < k; ++i) {
a /= 2;
b += a;
swap(a, b);
}
if (k & 1) swap(a, b);
cout << a << " " << b << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
double n,m,d;
cin>>n>>m>>d;
double ans=(d*2+(n-(d*2))*2)/(n*n);
ans*=(m-1);
if(d==0) ans/=... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 3) {
reverse(s.begin(), s.end());
}
cout << s << endl;
}
| #include<iostream>
using namespace std;
int main() {
int x,m,n;
while(cin >> x){
n=0;
m = 600/x;
for(int i = 1;i<m;i++){
n += x*x*x*i*i;
}
cout << n << endl;
}
return 0;
}
| 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>;
int main() {
int n;
cin >> n;
cout << (n-2)*180 << endl;
}
| #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define MAX 1000001
ll prime[MAX];
#define mod 1000000007
ll rec(vector<vector<ll> >& dp,vector<ll>& arr,int n,int i,int k,int w)
{
ll ans=0;
if(i>=n)
return 0;
if(dp[i][k]!=-1)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(),A.end()
void ALLIN1_NUMBERS(vector<ll>& V)
{
for(auto& x : V)
{
cin >> x;
}
}
template<class T>
void OUT0(T N)
{
cout << N << endl;
}
static const double pi = acos(-1.0);
double Cos(double D)
{
... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 |
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
using s64 = int64_t;
constexpr s64 INF = 1'010'000'000'000'000'000LL;
template<typename T, typename U>
bool chmin(T& xmin, const U& x)
{
if(x < xmin) {
xmin = x;
return true;
}
else {
return false;
... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238463;
const int MAXN = 200005;
int main()
{
FAST
int a,b;
cin>>a>>b;
... | #include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
#include <utility>
typedef long long ll;
#define pi 3.14159265358979323... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.