code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
using namespace std;
... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define FOR(i,a,b) for (int i=a;i<=b;++i)
#define FORD(i,a,b) for (int i=a;i>=b;--i)
using namespace std;
typedef long long LL;
typedef pair<LL,int> pa;
typedef vector<int> vec;
void getint... | 0 |
#include <iostream>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n;
int p[100];
int main(){
cin >> n;
rep(i, n * (n - 1) / 2){
int a, b, c, d;
cin >> a >> b >> c >> d;
--a;
--b;
if(c == d){
--p[a];
--p[b];
}
else{
if(c < d){
swap(a, b);
... | #include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n;i>=0;i--)
#define INF 100000005
#define MAX 100001
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespace std;
//__gcd(a,b), __b... | 1 |
#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, m;
cin >> n >> m;
vector<int> c(n+2);
rep(i,m){
int l, r;
cin >> l >> r;
c[l]++;
c[r+1]--;
}
rep(i,n+1) c... | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true;... | 1 |
#include<functional>
#include<iostream>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename... | #include <iostream>
#include <string>
#include <vector>
#include <atcoder/all>
using ll=long long;
using namespace std;
using namespace atcoder;
int main(){
int N,Q;
cin>>N>>Q;
fenwick_tree<ll> fw(N);
ll a;
for(int i=0;i<N;i++){
cin>>a;
fw.add(i,a);
}
int q,x,y;
for(int... | 1 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n,k,c[10],l[10],e[10000],d,a,b;
while(true){
cin>>n;
cin>>k;
if(n==0 && k==0){
break;
}
for(int i=0;i<n;i++){
cin>>c[i];
if(c[i]>=10){
l[i]=100;
}
else{
l[i]=10;
}
}
d=0;
if(k==2){
for(int i=0;i<n;i++... | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
const int iINF = 1001001001;
const long long llI... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... | 1 |
/**
DufauX-XuafuD
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false)... | #include <bits/stdc++.h>
using namespace std;
int main()
{int N, K; cin >> N >> K;
int L[N]; for (int &l : L) cin >> l; sort(L, L + N);
cout << accumulate(L + N - K, L + N, 0);} | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MX = 1e10 + 10;;
unsigned long long fac[200001];
#include <math.h>
#define PI 3.14159265358979323846264338327950L
long long gcd(long long a, long long b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
long lo... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0);... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
//#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync... | #include <stdio.h>
#include <algorithm>
int k, t;
int a[100];
int main() {
scanf("%d%d", &k, &t);
for (int i = 0; i < t; i++) {
scanf("%d", a + i);
}
std::sort(a, a + t);
k = k - a[t - 1];
k = a[t - 1] - k - 1;
if (k < 0)k = 0;
printf("%d\n", k);
} | 0 |
#include <iostream>
#include <set>
using namespace std;
int main() {
long long N, L[2]{};
cin >> N;
set<int> S;
while (cin >> N) {
if (!S.insert(N).second) {
S.erase(N);
if (N > L[0]) L[1] = L[0], L[0] = N;
else if (N > L[1]) L[1] = N;
}
}
cout << L[0] * L[1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int, int>
const int mod = 1e9+7;
const int MAXN = 1e5+5;
const int N = 1e5+5;
int fac[N];
int spf[MAXN];
void pre(int p) {
fac[0] = 1;
for(int i=1; i<N; i++) {
fac[i] = (fa... | 1 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <list>
#include <numeric>
#include <stack>
#include <unordered_map>
#include <map>
#include <set>
using namespace std;
#define sz(a) int((a).size())
#define ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n !=... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
int x;
cin >> x;
v.push_back(x);
cin >> x;
v.push_back(x);
cin >> x;
v.push_back(x);
sort(v.begin(), v.end());
cout<<v[0] +v[1];
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | #include <bits/stdc++.h>
using namespace std;
#define ii pair<int,int>
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define vii vector<ii>
#define all(X) (X).begin(),(X).end()
#define xx first
#define yy second
#define FOR(i,l,r) for( int i = l-(l>r); i != r-(l>r); i += 1-2*(l>r) )
int main() {... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
vector<int> cnt(26,0);
for(int i = 0; i < s.size(); i++) {
cnt[s[i]-'a'... | #include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#def... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int k;
string s;
string kq;
cin >> k;
cin >> s;
int dodai = s.length();
if (k < 1 || k > 100)
return 0;
if (dodai < 1 || dodai > 100)
return 0;
for (int i = 0; i < k; ++i)
{
if (k > dodai)
... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI ... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
const long long MOD = (long long)1e9 + 7;
int main(){
int n, m;
cin >> n >> m;
vector<long long> x(n), y(m);
for(int i = 0; i < n; i++){
cin >> x[i];
}
for(int i = 0; i < m; i++){
cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9+7)
#define d(x) cerr<<... | 1 |
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int N, K, ans = 1;
cin >> N >> K;
rep(i, N) {
if (ans < K) ans += ans;
else ans += K;
}
cout << ans << "\n";
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int d, g;
cin >> d >> g;
vector<pair<int,int>>pc(d);
for (int i = 0; i < d; i++)cin >> pc.at(i).first >> pc.at(i).second;
int ans = 1e10;
for (int bit = 0; bit < (1 << d); bit++) {
vector<pair<int, int>>pcc = pc;
vector<int> l(0... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main(){
int n;
cin >> n;
int a[n];
double ave = 0;
rep(i,n) {
cin >> a[i];
ave += a[i];
}
ave /= n;
double d = 1e5;
int ans = 0;
rep(i,n){
... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int dp[34];
int main(){
int N,x;
cin >> x;
dp[0] = 1;
for(int i = 0; i < 31; i++){
dp[i+1] += dp[i];
dp[i+2] += dp[i];
dp[i+3] += dp[i];
}
while(x != 0){
cout << dp[x]/3650 +... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 1e18
#define MOD 1000000007
using namespace std;... | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
using namespace std;
typedef long long ll;
const int MAXN = 18;
int n;
int LOG[1 << MAXN];
ll an... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
ll n;
cin >> n;
string res;
while (n>0){
int i = (n-1) % 26;
char c = 'a' + i;
res = c + res;
n = (n-1) / 26;
}cout << res;
return 0;
}
| #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 |
#include <iostream>
#include <vector>
#include <cmath>
using ll = long long;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
using namespace std;
int main(){
ll n, m;
cin >> n >> m;
ll mx = m / n;
ll ans;
repr(i, mx+1){
if (m % i == 0){
ans = i;
bre... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
// 約数列... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> Pl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | 1 |
/* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | ... | #include <cstdio>
#include <map>
using namespace std;
typedef pair<int, int> pii;
int c[101][101] = { { 0 } };
int t[101][101] = { { 0 } };
int n, m;
int calculate(int mat[101][101], int from, int to){
multimap<int, int> locations;
for(int i = 1; i <= m; i++){
if(mat[from][i] != 0){
locations.insert(pii(mat[... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
int p = n + 5;
vector<ll> num(p, 0);
ll initial;
ll maximumValue = 0;
for (int i = 0; i < n; i++) {
ll d; cin >> d;
num[d]++;
maximumValue = max(maximumValue, d);
if (i == 0) initial = d;
}
if (initial !... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 998244353;
ll Ep(int x, int y){
if(y == 1) return x;
ll r = Ep(x,y/2);
if(y%2 == 1) return r *r%MOD *x%MOD;
else return r *r%MOD;
}
int main(){
int n, x;
cin >> n;
cin >> x;
if(x != 0){
cout << 0 << endl;
retur... | 1 |
#include <bits/stdc++.h>
#include <ctime>
#define rep(i,a,b) for(int i =a;i<b;i++)
using namespace std;
typedef unsigned long long ll;
inline int cine() {int a; return scanf("%d", &a) ? a : 1e9;}
void solve() {
int train, bus, mine = 1e9, sum = 0 ;
rep(i, 0, 2) {
cin >> train;
mine = min(mine,... | #include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void co(First first, ... | 1 |
#include<iostream>
#include<queue>
#include<limits>
// #include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<cmath>
#include<math.h>
#include<iomanip>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#define ll ... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> A(n);
for(int i=0;i<n;i++) cin >> A.at(i);
vector<long long> sa(n+1,0);
for(int i=0;i<n;i++) sa.at(i+1) = sa.at(i) + A.at(i);
long long ans = 10000000000000000;
for(int i=1;i<n-1... | 0 |
#include<iostream>
#include<sstream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
... | #include<iostream>
#include<iomanip>
#include<cstdlib>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define INF 10000... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef complex<double> P;
vector<P> cal(vector<P> &v,double a,double b){
vector<P> res;
for(int i=0;i<v.size();i++){
double l=v[i].real(),r=v[i].imag();
if(l<=a&&b<=r)res.push_back(P(l,a)),res.push_back(P(b,r));
else if(l<=a&&a<=r)res.push_back(P(l,a));
... | /*First observation is that little numbers should be summed up to go to above 3
* any number above 3 is better multiplied
* also given a set of numbers to add, the best pairs to pick are least with most since we will multiply them next
* also if the number of numbers we are going to add is N
* then the numbers we w... | 0 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
string s;
cin >>... | #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 MAX = 1000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
//setprecision(15)
int main() ... | 0 |
#include <map>
#include <iostream>
using namespace std;
/** Problem0039 : Roman Figure **/
int main()
{
char num[110]; int now, old, ans;
map<char, int> list;
list.insert(map<char, int>::value_type('I', 1));
list.insert(map<char, int>::value_type('V', 5));
list.insert(map<char, int>::value_type('X', 10));
list.... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N... | 0 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n);... | #include <bits/stdc++.h>
using namespace std;
const int N=110;
int h,w,px,py,f[N][N][N][N],col[N][N],row[N][N];
bool mp[N][N];
void Init()
{
scanf("%d%d",&h,&w);
for (int i=1;i<=h;++i)
for (int j=1;j<=w;++j)
{
char ch=getchar();
while (ch!='o' && ch!='.' && ch!='E') ch=getchar();
if (ch=='E') px=i,py... | 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int k,t;
cin>>k>>t;
if(t==1){
cout<<k-1<<endl;
return 0;
}
int vec[t];
for(int i=0;i<t;i++){
cin>>vec[i];
}
sort(vec,vec+t);
if(vec[t-1]<=(k+1)/2){
cout<<0<<endl;
return 0;
}
int ans=(vec[t-1]-(k+1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <iostream>
using namespace std;
static const int MAX = 101;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
int n, M[MAX][MAX];
int prim()
{
int u, mincost;
int d[MAX], p[MAX], color[MAX];
for(int i=0; i<MAX; i++)
{
... | 0 |
#include <iostream>
using namespace std;
int main(){
int n,a;
int max = -10000000,min = 10000000;
long sum=0;
cin >> n;
for(int i=0;i<n;++i){
cin >> a;
if(max<a){
max = a;
}
if(min>a){
min = a;
}
sum += a;
}
cout << mi... | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define all(x) x.begin(), x.end()
#define watch(x) cout<<#x<<" : "<<x<<endl
#define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define testCa... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
int n;
string a,b,c;
cin>>n>>a>>b>>c;
int ans=0;
rep(i,n){
if(a[i]==b[i]&&a[i]==c[i])continue;
if(a[i]==b[i]||a[i]=... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if (a==b && b!=c){
std::cout << "Yes" << std::endl;
}
else if (a==c && b!=c){
std::cout << "Yes" << std::endl;
}
else if (b==c && b!=a){
std::cout << "Yes" << std::endl;
}
... | 0 |
#include<iostream>
#include<climits>
using namespace std;
// 完成版。
int tree[(1 << 18)];
void Update(int s, int t, int m, int left = 0, int right = (1 << 17), int key = 0){
if(t < left || right <= s) return;
if(s <= left && right - 1 <= t){ tree[key] = max(tree[key], m); return; }
Update(s, t, m, left, (lef... | #include<stdio.h>
int x;
int d[11];
int i,j;
int main(){
while(scanf("%d,",&x)!=EOF){
d[0]=0;
d[1]=d[0]+x;
for(i=0;i<9;i++){
scanf("%d,",&x);
d[i+2]=d[i+1]+x;
}
int v1,v2;
scanf("%d,%d",&v1,&v2);
double p;
int ans;
p=(double)(d[10]*v1)/(v1+v2);
for(i=0;i<10;i++){
if(p>d[i]&&p<=d[i+1]){
... | 0 |
#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++)
using namespace std;
long long INF=1e18;
long long mod=1e9+7;
//status unsolved
int main(){
int n;
cin>>n;
long long a[n+1];
rep2(i,n){
cin>>a[i];
}
a[0]=-1;
for(int i=1;i<=... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
const int MAX = 1000000;
//flagを用いたバブルソート
int bubbleSort(int A[], int N){
int sw = 0;
bool flag = 1;
for(int i = 0; flag; i++){
flag = 0;
for(int j = N - 1; j >= i + 1; j--){
if(A[j]... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
const long long INF = numeric_limits<long long>:... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
if(s[0] != 'A' || isupper(s[1]) || isupper(s[s.size() - 1])){
cout << "WA" << endl;
return 0;
}
bool isFoundC = false;
for(int i = 2; i < s.size() - 1; i++){
if(!isFoundC && s[... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c=0,d=0,e=0;
cin >> a >> b;
c += a+b;
d += a-b;
e += a*b;
cout << max(c,max(d,e)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int S = A + B;
int T = A - B;
int U = A * B;
if (S >= T && S >= U) {
cout << S << endl;
} else if (T >= S && T >= U) {
cout << T << endl;
} else {
cout << U << endl;
}
} | 1 |
#include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cstdlib>
using namespace std;
vector<string> split(const string &str, char delim){
vector<string> res;
size_t current = 0, found;
while((found = str.find_first_of(delim, current)) != string::npos){
res.push_back(string(str,... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | 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 <cstdint> // int64_t, int*_t
#include <cstd... |
// Problem : C - Snuke Festival
// Contest : AtCoder - AtCoder Beginner Contest 077
// URL : https://atcoder.jp/contests/abc077/tasks/arc084_a
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int dx[]={1,0,0,-1,1,-1,-1,1,2,0,-2,0};
const int dy[]={0,1,-1,0,1,1,-1,-1,0,2,0,-2};
const int INF = 1<<30;
const double EPS = 1e-8;
#define PB push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i,j,k) for(int i = (j); i < (k); ++i)
#defin... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 1 |
// #include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define PI 3.14159265358979323846264338327950288
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << e... | #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 h,w;
cin >> h >> w;
vector <vector <int>> m(h, vector <int> (w,3000));
queue <vector <int>> q;
int ans=0;
string s,s2;
vector <int> s3(3,0);... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N,... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_V 100
#define MAX_E 10000
#define INF 2000000001
struct edge{int from,to,cost;};
edge es[MAX_E]; //辺
int ds[MAX_V]; //最短距離
int V,E; //頂点数、辺数
int d[MAX_V][MAX_V]; //d[u][v]はe=(u,v)のコスト(存在しなければINF、d[i][i]は0)
void warshall_floyd(){
for(int k=0;k<V;k++)
for(i... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int mxn=2e5+3,du=1e9+7;
int m,n;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>m>>n;
map<int,int> mp;
multiset<int> s;
for (int i=1;i<=n;i++) mp[i]=i,s.insert(0);
for (int i=1;i<=m;i++)
{
int l... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int a[3] = {0, 1, 2};
const int b[3] = {1, 2, 0};
const int c[3] = {2, 0, 1};
int main() {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
vector<vector<char> > s(3, vector<char>(n));
REP(i, 3... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
string a,b,c;
cin >> n >> a >> b >> c;
int cnt = 0;
for(int i = 0; i < n; i++){
if(a[i] == b[i] && b[i] != c[i]){
cnt++;
}else if(a[i] == c[i] && b[i] != c[i]){
cnt++;
}else if(c[i] == b... | 1 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int N;
cin >> N;
vector<queue<int>> Q(N + 1);
for (int i = 0; i < N; i++){
for (int j = 0; j < N - 1; j++){
int A;
cin >> A;
A--;
Q[i].push(A);
}
Q[i].push(N);
}
Q[N].push(N);
int ans = 0;
int cnt = N * (N ... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<pair<int,int>>> v(n,vector<pair<int,int>>());
for(int i=0;i<n;i++){
int a;
cin>>a;
for(int j=0;j<a;j++){
int x,y;
cin>>x>>y;
x--;
v[i... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int V;
vector<int>G[10000],rG[10000],vs;
bool used[10000];
int cmp[10000];
void add_edge(int from,int to){
G[from].push_back(to);
rG[to].push_back(from);
}
void dfs(int v){
used[v]=true;
for(int i=0;i<G[v].size();i++){
if(!used... | #include <cstdio>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
const int INF = 1000000000;
int main()
{
int n, m;
int d[512];
vector<int> f[512];
while (scanf("%d %d", &n, &m), n != 0){
for (int i = 1; i <= n; i++) f[... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int mn = max(-1000000,b-a+1);
int mx = min(1000000,b+a-1);
cout << mn;
for(int i = mn+1;i<mx+1;i++) cout << " " << i ;
} | #include<bits/stdc++.h>
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define _rep(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define N 4005
int n,k,c[N][N],pw[N];
const int mod=998244353;
inline void reduce(int&x){x-=mod,x+=x>>31&mod;}
inline int upd(int x){return reduce(x),x;}
inline void init(int n=4000){
... | 0 |
/* HARD WORK FOREVER PAYS */
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define turbo(){ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
}
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef unsigned long long int ull;
v... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b, c, d, in;
cin >> in;
a = in / 1000;
b = in % 1000 / 100;
c = in % 1000 % 100 / 10;
d = in % 1000 % 100 % 10;
vector<char> op(3);
if (a + b + c + d == 7) {
op[0] = '+';
op[1] = '+';
op[2] = '+... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
LL n,i,maxi,mini=OO;
scanf("%lld",&n);
for(i=1;i*i<=n;++i){
... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) v... | #include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 200200;
typedef long long ll;
const int mod = 998244353;
inline ll pow(ll a,int b,int ans = 1) {
for(;b;b >>= 1,a = a * a % mod) if(b & 1)
ans = ans * a % mod;
return ans;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int main(){
long long int n, m;
cin >> n >> m;
vector<int> d(n, 0);
vector<vector<int>> E(n);
for(int i=0;i<m;i++){
int a, b;
cin >> a >> b;
a--;b--;
E[a].emplace_back(b);
E[b].emplace_back(a);
}
vector<bool> vi... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | #include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for(int i=int(m); i<int(n); ++i)
#define rep(i, n) rep2(i, 0, n)
using ll = long long;
using V = vector<int>;
char s[1000000];
ll t[3][1000001];
int main() {
int n, q;
scanf("%d%s%d", &n, s, &q);
V D, C;
rep(i, n) {
rep(j, 3) t[j][i+1] =... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | 1 |
#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n; cin >> n;
for (int i = 1; ; i++){
if (i * i == n) {
cout << i * i << endl;
break;
}
if (i * i > n)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a;
for(int i=0;i*i<=n;i++)
a=i*i;
cout<<a<<endl;
} | 1 |
#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... | #include"bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
string s;
void ans(int a, int64_t b) {
//cout << "a:" << a << " b:" << b << " num:" << int64_t(pow(26,a-1)) << endl;
if(a==1) s.push_back(96+b);
else {
int64_t num = pow(26,a-1);
if(b%num!=0) ans(a-1, b%num);
else ans(a-1, num);
if(b/num!=26 && ... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
int main(void){
ll n;
cin >> n;
char c[26+1]="abc... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<bool> dislike(10, false);
bool isOK(int p) {
while (p) {
int d = p % 10;
if (dislike[d]) return false;
p /= 10;
}
return true;
}
int main() {
int n, k... | #include<iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a>8)
{
cout<<":(";
}
else if(b>8){
cout<<":(";
}
else
{cout<<"Yay!";
}}
| 0 |
#include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N, K;
cin >> N >> K;
unsigned long mx{0}, g{0};
for(unsigned long i{0}, A; i < N; ++i){
cin >> A;
mx = max(mx, A);
g = __gcd(g, A);
if(mx >= K && K % g == 0)return 0 & puts("POSSIBLE");
}
... | #include <iostream>
#include <numeric>
using namespace std;
const string YES = "POSSIBLE";
const string NO = "IMPOSSIBLE";
int main() {
int N, K, M{}, D{}, A;
cin >> N >> K;
while (cin >> A) {
M = max(M, A);
if (D) D = gcd(D, A);
else D = A;
}
cout << (K <= M && (M - K) % D == 0 ? YES : NO) << ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
int maxL, minR;
maxL = -1e9;
minR = 1e9;
rep(i, m)
{
int l, ... | //Mahir Ratanpara (DA-IICT)
#include<bits/stdc++.h>
using namespace std;
#define Ff(i,a,n) for(i=a;i<n;i++)
#define Fr(i,a,n) for(i=a;i>n;i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.en... | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | #include <stdio.h>
int main() {
char x[105], y[105];
scanf("%s %s", x, y);
printf("%s%s\n", y,x);
return 0;
} | 1 |
#include <iostream>
int main()
{
int64_t x;
std::cin >> x;
// 5と6を交互に出す
// どちらから始めてもいいので、最後を6にできる
const auto r = x % 11;
std::cout << x / 11 * 2 + (r + 5) / 6 << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
// increment
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep... | 1 |
#include <bits/stdc++.h>
const int N = 108;
int n;
int a[N], b[N];
int main() {
int i, mid;
scanf("%*d%d", &n);
for (i = 0; i < n; ++i) scanf("%d", a + i);
if (n == 1) return *a == 1 ? puts("1\n1\n1") : printf("%d\n2\n1 %d\n", *a, *a - 1), 0;
mid = std::partition(a, a + n, [] (const int x) -> bool {return x % 2... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define sqr(x) ((x)*(x))
#define mp make_pair
#define uint unsigned
#define PI pair<int,int>
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n);
ll s = 0;
for (int i = 0; i... | #include <stdio.h>
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
typedef uint64_t ull;
typedef int64_t sll;
static const ull MOD = 1000000007LL;
int n;
int k;
int q;
ull a[200019];
ull umin (ull a, ull b) {
return (a < b) ? a : b;
}
ull umax (ull a, ull b) {
return (a > b) ? a... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
const int mxn = 2e5 + 5;
const ll inf = 1e18;
int n, v[mxn];
map <int, ll> dp[mxn];
int main() {
scanf... | #include <iostream>
#include <utility>
#include <vector>
#include <cstring>
using namespace std;
#define MAX 100
struct in {
int c;
int d;
pair<int, int> p;
};
int dx[] = { 1, 0, -1, 0 };
int dy[] = { 0, 1, 0, -1 };
int w, h, n;
pair<int, int> st, gl;
int map[MAX+2][MAX+2];//map[X][Y]
vector<in> info;
bool f;
boo... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> ... | #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() {
string s;
cin >> s;
char cbuff='a';
rep(i,26) {
cbuff='a'+i;
string::size_type pos=s.find(cbuff);
if (pos==string::npos) {
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define MP make_pair
#define pb push_back
#define ff first
#define ss second
#define sz(x) x.size()
#define all(c) c.begin(),c.end()
#define int long long
#define fr(i,j,x) for(int i=j;i<x;i++)
#define rep(... | #include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
#define ll long long
void add_self(ll& a, ll b) {
a += b;
if(a >= mod) {
a -= mod;
}
}
int main()
{
string k;
cin >> k;
int d;
cin >> d;
vector<vector<ll>> dp(d,vector<ll>(2));
int n = k.size();
dp[0][0] = 1;
for(int i =... | 1 |
#include <cstdio>
int a[100010],sum[2],n;
bool flag;
int gcd(int a,int b)
{
if (b==0) return a;
else return gcd(b,a%b);
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if (a[i]>1) sum[a[i]&1]++;
}
if (n==1)
{
if (a[1]&1) printf("Second\n");
else printf("First\n");
return 0;
... | #include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 200200;
typedef long long ll;
const int mod = 998244353;
inline ll pow(ll a,int b,int ans = 1) {
for(;b;b >>= 1,a = a * a % mod) if(b & 1)
ans = ans * a % mod;
return ans;
}
... | 1 |
#include<stdio.h>
int main(){
int r,n,cnt=0;
scanf("%d",&n);
while(n>0){
r=n%10;
if(r==7){
printf("Yes");
cnt++;
break;
}
n=n/10;
}
if(cnt==0){
printf("No");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string h;
cin >> h;
if(h == "hi" || h == "hihi" || h == "hihihi" || h == "hihihihi" || h == "hihihihihi"){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ll n;
cin >> n;
ll ans = mod;
for(ll i = 1; i*i <= n; i++){
if(n%i == 0){
ll a = to_string(n/i).size();
ll b = to_string(i).size();
... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
const int maxn = ... | #include <cstdio>
typedef long long ll;
ll pos[100005], cnt[100005], ans;
void work(int l, int r, int s)
{
if (pos[r] < s)
ans += s - pos[l];
else if (pos[l] > s)
ans += pos[r] - s;
else
{
ans += pos[r] - pos[l];
if (cnt[l] >= cnt[r])
{
while (l < r && cnt[l] >= cnt[r])
cnt[l] += cnt[r--];
}... | 0 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef pair<int, int> P;
int main() {
int n; cin >> n;
map<int, int> odd, even;
for (int i = 1; i <= n; i++) {
int v; cin >> v;
if (i % 2) odd[v]++;
else even[v]++;
}
int o1 = 0, o2 = 0, odd_v;
... | #include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n)... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n, h, w; cin >> n >> h >> w;
int a = n - h;
int b = n - w;
if(a < 0 || b < 0) {
cout << 0 << endl;
return 0;
}
a++;
b++;
... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
char s[3];
cin>>s[0]>>s[1]>>s[2];
int max=0, locmax=0;
for(int i=0;i<3;i++){
if(s[i] == 'R'){
locmax++;
}
else{
locmax=0;
}
if(locmax>max){
max=locmax;
}
}
cout<<max;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5 , MOD = 1e9 + 7;
long long fact[N] , fact_inv[N];
int mul(long long a , long long b) {
return a * b % MOD;
}
long long power(long long a , long long b) {
if (!b) return 1;
long long r = power(a , b / 2);
r = mul(r , r);
if (b&1)... | 0 |
#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#define rep(i, n) for(int i = 0; i < n; i ++)
#define COUNT(i, n) for(... | #include <iostream>
#include <vector>
#include <algorithm>
#include <sstream>
#include <iterator>
int main(){
int n,m,x;
while(std::cin >> n >> m){
if(n == 0 && m == 0)
break;
int flag = 0;
int num = 0;
std::vector<int> v;
std::string l... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string a,b;
cin >> a >> b;
int len=0;
for(int i=0;i<n;i++){
bool ok=true;
for(int j=0;j<n-i;j++)
if(a.at(i+j)!=b.at(j))
ok=false;
if(ok)
len=max(n-i,len);
}
cout << n*2-len << endl;
return 0;
} | #include <iostream>
#include <cstring>
#include <cstdio>
#define Maxn 4010
#define Maxm 4010
using namespace std;
int read() {
int x = 0,f = 1;
char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while('0' <= c && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
ret... | 0 |
#include<map>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define mp make_pair
using namespace std;
map<pair<int,int>,int> m;
struct dsu
{
int fa[200010],rank[200010];
void init(int n)
{
for(int i=1;i<=n;i++)
{
fa[i]=i;
... | #include <iostream>
using namespace std;
void pri(string s,int a,int b){
cout << s.substr(a,b-a+1) << endl;
}
string rep(string s,int a, int b, string r){
for(int i=a; i<=b; i++){
s[i] = r[i-a];
}
return s;
}
string rev(string s, int a, int b){
string tmp = s;
for(int i=a; i<=b; i++){
s[i] = tmp[... | 0 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
type... | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
int tmpCnt1,tmpCnt2;
int Max1 = 0, Max2 = 0;
string str1, str2;
cin >> num >> str1 >> str2;
if(str1 == str2){
cout << num;
return 0;
}
for(int i = 0; i < num; i++){
tmpCnt1 = 0;
if(str1.at(i) == str2.at(0)){
... | 0 |
#include<cstdio>
long double sqrt(double);
int main(void){
long double d;
double x1,y1,x2,y2,D;
scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
D=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
sqrt(D);
d=sqrt(D);
printf("% 8.8Lf\n",d);
return 0;
}
long double sqrt(double a){
int i;
long double b=3;
for(i=0;i<256;i++){
b=(b/2)+(a/(2*b));
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
double x1, y1, x2, y2;
fscanf(stdin, "%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
fprintf(stdout, "%.9f\n", hypot(x1 - x2, y1 - y2));
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll N, X;
cin >> N >> X;
vector<ll> A(N);
for (int i = 0; i < N; i++){
cin >> A.at(i);
}
sort(A.begin(), A.end());
ll ans = 0;
while (true){
if (X >= A.at(ans)){
X -= A.at(ans);
ans++;
if ... | #include <iostream>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n;i++)
using pii = pair<int,int>;
using piii = pair<pii,int>;
using ll = long long;
#define int ll
signed main(){
int v,e; cin>>v>>e;
vector<piii>edge;
rep(i,e){
int a,b,c; cin>>a>>b>>c;
edge.push_back(piii(pii(a,b)... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pint;
int d[101][101];
int inf=INT_MAX;
int v;
int warshall_floyd(){
rep(k,v)rep(i,v)rep(j,v){
if(d[i... | 1 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
#define ref goto refrain
class dice{
public:
int o,u,s,e,n,w;//over,under,south,east,north,west
void change(char a);
};
void dice::change(char a){
int tem=o;
if(a=='S'){
o=n; n=u; ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5+5, MOD = 998244353;
int n, m, k, p[N];
int mul(int x, int y) {
ll tmp = 1LL * x * y;
return tmp % MOD;
}
int add(int x, int y) {
ll tmp = 1LL*x + 1LL*y;
return tmp % MOD;
}
int pow(int x, int e) {
int res = 1;
... | 0 |
#include <bits/stdc++.h>
#define sz(c) int(c.size())
#define rep(i,a,b) for (int i=a; i<(b); ++i)
#define per(i,a,b) for (int i=(b)-1; i>=(a); --i)
using namespace std;
using ll = long long;
int const MAXN=2.2e6;
int const MD=998244353;
int madd(int x,int y) {
if (x+y<MD) return x+y; else return x+y-MD;
}
int m... | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cer... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
int main(void){
while(true){
int n;
cin >> n;
if(n == 0){ break; }
vector<pair<double, string> > moonlight;
string l;
int p, a, b, c, d, e, f, s, m;
for(int i = 0; i < n; i++){
cin >>... | #include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<iomanip>
using namespace std;
struct Data{
long double x;
long double y;
};
int main(){
int N;
cin>>N;
vector<Data>data(N);
double countmax=1;
for(double i=0;i<=N-1;i++){
cin>>data[i].x>>data[i].y;
countmax*=i+1;... | 0 |
#include <iostream>
using namespace std;
int main(void){
string s;
cin >> s;
cout << "2018/";
for (int i=0; i<s.size(); i++) {
if (i > 4) cout << s.at(i);
}
cout << endl;
}
| #include<iostream>
using namespace std;
int main()
{
int n;
int i;
cin >> n;
for(i=1;i<=n;i++){
if(i%3==0)
cout << ' ' << i;
else if(i%10==3)
cout << ' ' << i;
else if((i/10)%10==3)
cout << ' ' << i;
else if((i/100)%10==3)
cout << ' ' << i;
else if((i/1000)%10==3)
cout << ' ' << i;
}
... | 0 |
#include <iostream>
using namespace std;
int main()
{
string s;
cin>>s;
int sum=0;
int count=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='R')
sum++;
else
sum=0;
if(sum>count)
count=sum;
}
cout<<count<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using l... | 1 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
int main(){
string s;
cin >> s;
bool OK_A = false;
bool OK_C = false;
bool OK_lower = true;
int cnum;
if(s[0] == 'A'... | 1 |
#include<bits/stdc++.h>
int main(){
using namespace std;
constexpr unsigned long MOD = 1000000007;
auto f = [&MOD](auto& a, auto k){(a.second += (a.first += a.second * k) %= MOD) %= MOD; return a.first;};
unsigned long N;
cin >> N;
vector<pair<pair<unsigned long, unsigned long>, unsigned long>>... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
int hour[3];
cin >> hour[0] >> hour[1] >> hour[2];
int ans = 1000;
for (int i = 0; i < 2; i++) {
for (int j = i + 1; j < 3; j++) {
ans = min(ans, hour[i] + hour[j... | /*
@uthor: Amit Kumar
user -->GitHub: drviruses ; CodeChef: dr_virus_ ; Codeforces,AtCoder,Hackerearth,Hakerrank: dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//#def... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 200005
const ll INF = 1000000000000000001;
const ll MOD = 1000000000;
//vector< vector<ll> > g(N);
//vector< pa... | #include<bits/stdc++.h>
#define int long long int
#define mod 998244353
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output1.txt","w", stdout);
#endif
int n;
cin>>n;
int a[n]... | 1 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
// http://www.prefield.com/algorithm/misc/dice.html
enum FACE { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
class dice {
public:
dice(int top,int front,int right,int left,int back,int bottom) {
id[TOP] = top; id[FRONT] = front; id[RIGHT] = right... | #include <bits/stdc++.h>
using namespace std;
inline char shift(char c, int i) {
return char(((c + i) - 'a') % 26 + 'a');
}
int main() {
string str;
while (getline(cin, str)) {
int n;
for (int i = 0; i < 26; ++i) {
string target;
for (char c : str) {
if ('a' <= c && c <= 'z')
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
map<char,vector<int>> dist;
for(int i=0; i< s.size(); i++){
dist[s.at(i)].push_back(i);
}
/*ここからアンバランス探しmapにはアルファベットと出現箇所が紐づけ
各アルファベットについて、隣り合ってたらok
*/
bool seikai = false;
for(auto& a: dist ){
if... | #include <iostream>
#include <string>
using namespace std;
int main(){
string s, strCopy;
while (getline(cin, s)) {
for(int j=0 ; j<26 ; j++){
for(int i=0 ; i<s.size() ; i++){
if(s[i]>='a' && s[i]<='z'){
s[i] = (s[i]=='z')? 'a' : s[i] + 1;
}
}
if( s.find( "the" ) != string::npos || s.find( "t... | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
long long num,p;
}a[100010];
int s,n;
long long ans;
bool cmp(node a,node b)
{
return a.p<b.p;
}
int main()
{
scanf("%d%d",&n,&s);
for(int i=1;i<=n;i++)
scanf("%d%d",&a[i].p,&a[i].num);
sort(a+1,a+n+1,cmp);
int L=1,R=n;
in... | //by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long long ll;
const int mod=1e9+7;
//My i/o stream
str... | 1 |
#include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
int main() {
int h, w;
cin >> h >> w;
int a, b;
cin >> a >> b;
int one = 1;
int ze... | #include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, h, w, a, b;
scanf("%lld%lld%lld%lld", &h, &w, &a, &b);
for(i = 0; i < h; ++i) {
for(j = 0; j < w; ++j) printf("%d", (i < b) ^ (j < a));
printf("\n");
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) pri... | #include<iostream>
#include<string>
using namespace std;
int main() {
string s;
cin >> s;
int mini = 10000;
for (int i = 0; i < s.length()-2; i++) {
int x = atoi(s.substr(i, 3).c_str());
mini = min(abs(x - 753), mini);
}
cout << mini << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
bool ok=false;
long long i=1;
while(!ok){
if(i*i>n){
cout << (i-1)*(i-1) << endl;
ok=true;
}
i++;
}
return 0;
}
| #include<iostream>
//#include<CastingInterop.h>
#include<string>
#include<array>
#include<math.h>
#include<sstream>
using namespace std;
int main()
{
int num1,num3;
cin >> num1;
num3 = sqrt(num1);
if (num3 % 10 != 0)
{
num3 = sqrt(num1);
cout << num3 * num3;
}
else
{
cout << n... | 1 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lo... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <limits.h>
#include <set>
#include <map>
#include <tuple>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ... | 1 |
#pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
const int inf=1e18;
inline int in(){int x;scanf... | #include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vect... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.