code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
typedef uint16_t u16;
typedef int16_t i16;
typedef uint8_t u8;
typedef int8_t i8;
using namespace std;
#define rep(idx, N) for (u64 idx = 0; idx < N; idx++)
int main() {
i32 l;
cin >> l;
printf("%.10lf",... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
double l,a,b,c; cin>>l; a=l/3; b=l/3; c=l/3;
cout<<fixed<<setprecision(10)<<(a*b*c);
return 0;
} | 1 | 35,078,965 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int size = s.size();
for (int i = 0; i < size/2; i++) {
if (s[i] != s[size-(i+1)]) {
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int n = S.size() / 2;
for(int i=0; i<n; i++) {
if(S[i] != S[n+1+i]) {
cout << "No" << endl;
return 0;
}
}
int nn = n / 2;
for(int i=0; i<nn; i++) {
if(... | 1 | 30,839,624 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
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) { ... | #include <bits/stdc++.h>
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define rep(i,n) FOR(i,0,(n))
#define REPS(i,n) FOR(i,1,(n)+1)
#define RREP(i,n) RFOR(i,0,(n))
#define rng(x) (x).begin(),(x).end()
#define rrng(x) (x).rbegin(),(x).rend()
#define debug(x) ... | 1 | 48,601,799 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define x first
#define y second
#define sz(a) ((int)(a.size()))
const int mod = 1812447359;
const int mod2 = 1000 * 1000 * 1000 + 7;
const int INF = 1000 * 1000 * 1000;
const int MAX = 200005;
const int ZSUV = ... | #include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int i = 0; i < N; i++)
int main(){
i64 N;
cin >> N; N++;
vector<i64> A(N);
vector<i64> sumA(N);
rep(i, N) cin >> A[i];
sumA = A;
for(int i = N-2; i >= 0; i--) sumA[i] += sumA[i + 1];
bool can = ... | 1 | 45,640,665 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
int main() {
string S,T; cin >> S >> T;
int ma = 0;
int num = S.size() - T.size() + 1;
for (int i = 0; i < num; i++) {
int cnt = 0;
for (int j = 0; j < T.size(); j++) {
if (S[j+i] == T[... | #include <bits/stdc++.h>
using namespace std;;
int main(){
string s, t;
int sSize, tSize, ans, count;
cin >> s >> t;
sSize = s.size();
tSize = t.size();
ans = tSize;
for (int i = 0; i <= sSize-tSize; i++){
count = 0;
for (int j = 0; j < tSize; j++){
if (s[i + j] !... | 1 | 16,060,837 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, M, D;
cin >> N >> M >> D;
double ans = 2.0 * (N - D) * (M - 1) / N / N;
if(D == 0) ans *= 0.5;
cout.precision(15);
cout << ans << endl;
} | 1 | 89,938,543 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); ++i)
#define vvec(m,n) vector<vector<int>> (int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main(){
int R;
cin >> R;
string ans;
if(R < 1200) ans = "ABC";
else if(R >= 1200 &... | 1 | 29,789,038 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
string S;
long K;
cin>>S>>K;
vector<int>arr;
int tmp = 1;
bool check = true;
for(int i=1;i<S.size();++i){
if(S[i]==S[i-1])tmp++;
else {
check = false;
... | #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;
ll K;
cin >> K;
int N = S.length();
ll ans = 0;
vector<pair<char, ll>> a;
for (int i = 0; i < N-1; i++) {
ll temp = 0;
cha... | 1 | 33,493,914 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define pb push_back
const long double PI = acos(-1);
const long long INF = (1 << 30);
ll gcd(ll a,ll b){return b ? gcd(b,a%b... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | 1 | 54,861,520 |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<cstdlib>
#include<cmath>
#include<numeric>
#include<iomanip>
#include<functional>
#include<cstdlib>
#include<queue>
#include<deque>
const double PI = acos(-1);
#define rep(i,n)for(int i=0;i<(n);i++)
using n... | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<cstring>
#include<set>
#include<queue>
#include<map>
#include<math.h>
#define FASTREAD ios_base::sync_with_stdio(0);cin.tie(nullptr);
#define ll long long
#define dd double
#define scl(n) scanf("%lld",&n)
#define scd(n) ... | 1 | 54,310,627 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[6],cnt[5];
int main() {
for(int i=0;i<6;i++){
cin>>a[i];
cnt[a[i]]++;
}
ll mi=3,ma=0;
for(int i=1;i<=4;i++){
ma=max(ma,cnt[i]);
mi=min(mi,cnt[i]);
}
cout<<((ma==3||mi==0)?"NO":"YES")<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int,int> P;
using ll... | 1 | 63,480,414 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
const int inf = 1e18;
const double EPS = 0.00000001;
signed main(){
int a,b;
cin >> a >> b;
string s1,s2;
s1 = s2 = "";
for(int i =0;i<a;i++) s1 += (b+'0');
for(int i =0;i<b;i++) s2 += (... | 1 | 42,574,748 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2) {
if (B % 2) {
B--;
}
A += (B / 2);
B = B / 2;
}
else {
if (A % 2) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#d... | 1 | 88,550,394 |
#include <cstdio>
#include <iostream>
#include <list>
#include <string>
void delete_value(std::list<int>& data, int number)
{
for(std::list<int>::iterator iter = data.begin(); iter != data.end(); iter++) {
if(*iter == number) {
data.erase(iter);
return;
}
}
}
void show_da... | #include<iostream>
#include<list>
#include<string>
using namespace std;
int main(){
list<int> L;
int n,a;
string command;
cin >> n;
for(int i=0; i<n; i++){
cin >> command;
if(command=="insert"){
cin >> a;
L.push_front(a);
}else if(command=="delete"){
... | 1 | 26,885,607 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
u... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N;
string s, t;
cin >> N >> s >> t;
int matchLen = 0;
for(int slide = 0; slide < N; slide++){
int match = 0;
for(int i = slide; i < N; i++){
if(s[i] == t[i-slide]) match++;
}
... | 1 | 58,061,679 |
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
ll ans;
if (n * 2 > m)
ans = m / 2;
else
ans = n + (m - 2 * n) / 4;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,M,tmp,ans;
cin>>N>>M;
tmp = M;
tmp -= (N*2);
if(tmp < 0){
ll kake = M/2;
ans = kake;
}
else{
ans = N;
ans += (tmp/4);
}
cout<<ans<<endl;
return 0;
} | 1 | 80,895,040 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int> a(n);
vector<int> b(m);
for(int i=0; i<n; i++) cin >> a[i];
sort(a.rbegin(), a.rend());
for(int i=0; i<m; i++) cin >> b[i];
sort(b.begin(), b.end()... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b... | 1 | 73,348,981 |
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
#define IOS\
ios::sync_with_stdio(false);\
cin.tie(0);\
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll n,x,p;
cin>>x>>n;
map<int,int>mp;
for(int i=0; i<n; i++){
cin>>p;
mp[p]++;
}
ll mn=x;
while(1){
if(mp[mn]==0){
break;
}
mn++;
}
ll mn1=x;
whil... | 1 | 23,821,503 |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pb push_back
# define inOut(a,b) freopen(a,"r",stdin);freopen(b,"w",stdout);
# define RESET(a) memset(a,0,sizeof(a))
# define MEMO(a) memset(a,-1,sizeof(a))
# define DEBUG puts("Debug-Has-Co... | #include <bits/stdc++.h>
const static double de_PI = 3.14159265358979323846;
const static int de_MOD = 1000000007;
const static int de_MAX = 999999999;
const static int de_MIN = -999999999;
int main(void) {
int a = 0;
std::cin >> a;
double n = 100000;
for (int i = 0; i < a; i++) {
n = n*1.05;
n = static_cast<in... | 1 | 87,195,797 |
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
#include<functional>
#include<ios>
#include<iomanip>
using names... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, m, x, co1 = 0, co2 = 0, ans = 0;
cin >> n >> m;
vector<vector<int>> a(m);
rep(i, m) {
cin >> x;
a[i].push_back(x);
rep(j, a[i][0]) {
c... | 1 | 91,506,901 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define r... | 1 | 63,726,310 |
#include <iostream>
int count_divisors(int a, int b, int c) {
int count = 0;
for (int i = a; i <= b; i ++) {
if (c % i == 0) {
count += 1;
}
}
return count;
}
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << count_divisors(a, b, c) << std::endl;
return 0;
} | #include <iostream>
using namespace std;
#define for_(i,a,b) for(int i = (a);i < (b);i++)
#define rfor_(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define rep(i,n) for_(i,0,(n))
#define rrep(i,n) rfor_(i,0,(n))
int a, b, c;
int main(){
cin.tie(0);
cin>>a>>b>>c;
int d = 0;
for_(i, a, b+1) {
if(c%i==0)d+... | 1 | 99,664,462 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vec1;
typedef vector<string> vec2;
typedef vector<double> vec3;
int main() {
string s;
ll k;
cin >> s >> k;
for(int i = 0; i < k; i++) {
if(s.at(i) != '1') {
cout << s.at(i) << endl;
return 0;
}
}
cou... | 1 | 78,134,441 |
#include <stdio.h>
int main(void) {
int n;
int a[6000];
while(1) {
int max_a=-100000;
int sum;
int i,j;
scanf("%d",&n);
getchar();
if(n==0) break;
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=0;i<n;i++) {
sum=0;
for(j=i;j<n;j++) {
sum+=a[j];
if(max_a<sum) max_a=sum;
... | #include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
using namespace std;
#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)
typedef vector<int> vi;
int main()
{
int n;
while(sca... | 1 | 37,819,398 |
#include <bits/stdc++.h>
#define int long long
#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##_len=(b); i<i##_len; i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(box) box.begin(), box.end()
using namespace std;
using P... | #include <iostream>
#include <vector>
using namespace std;
int main(){
string s;
cin >> s;
if (s.size()==2){
if (s.at(0)==s.at(1)){
cout << 1 << " " << 2 << endl;
} else {
cout << -1 << " " << -1 << endl;
}
return 0;
}
for (int i=0; i<s.size()-... | 1 | 59,093,581 |
#include<iostream>
#include<fstream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<deque>
#include<set>
#include<map>
#include<bitset>
#include<ctime>
#include<queue>
using namespace std;
#define int long long
#define pii pair <int, int>
#define XX first
#define YY second
const int mn =... | #include <bits/stdc++.h>
#define pragma
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define aisort sort(a,a+n)
#define adsort sort(a,a+n,greater<ll>())
#define PI 2 * acos(0)
typedef pair<ll, ll> pii;
typedef pair<ll, pii> piii;
typedef vector<ll> vi;
type... | 1 | 30,845,864 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
#define rep2(i, a, b) for(int i=a; i<=(int)(b); ++i)
#define all(v) v.begin(),v.end()
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n, p;
string s;
cin >> n >> p;
cin ... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
typedef vector<vector<int> > Graph;
int main() {
int N,P;
cin>>N>>P;
string s;
cin>>s;
ll count=0;
ll arr[N+1];
for(int i=0;i!=N;++i)arr[i]=0;
reverse(... | 1 | 12,253,267 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, m; cin >> a >> b >> m;
vector<int> ai(a), bj(b), aisorted(a), bjsorted(b);
for(int i = 0; i < a; i++) {
cin >> ai.at(i);
aisorted.at(i) = ai.at(i);
}
for(int i = 0; i < b; i++) {
cin >> bj.at(i);
bjsorted.at(i) = bj.at(i);
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 9223372036854775807
#define MOD 1000000007
int main(void)
{
int a, b, m;
cin >> a >> b >> m;
vector<int> A(a), B(b);
rep(i, a) cin >> A.at(i);
... | 1 | 60,563,628 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long A,B,K;cin>>A>>B>>K;
long Ao,Taka;
if(K<=A){
Ao=A-K;
Taka=B;
}
else if(K<=A+B){
Ao=0;
Taka=A+B-K;
}
else{
Ao=0;
Taka=0;
}
cout<<Ao<<" "<<Taka<<endl;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 1 | 418,399 |
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(){
string s;
cin >> s ;
for (int i=0; i<s.size(); i++){
for (int j=i+1; j<s.size(); j++){
if (s[i] == s[j]){
cout << "no";
return 0;
}
}
}
cout << "yes";
} | #include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end();... | 1 | 43,641,625 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define INF (int)1e9
typedef long long int int64;
void print() {
cout << endl;
}
void print(const char* s, bool endline = true) {
cout << s;
if (endline) print();
}
void print(char s, bool endli... | #include<bits/stdc++.h>
using namespace std;
#define num 1000000007
#define REP(i,a,n) for(ll i=a;i<n;i++)
#define inarr(i,a,n,A) for(ll i=a;i<n;i++) { cin>>A[i]; }
#define vll vector<long long>
#define pii pair <int,int>
#define pll pair<long long, long long>
#define vpii vector< pair <int,int>>
#define vpll vector< p... | 1 | 48,508,037 |
#include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int c[100];
string s;
int i, index;
for(i = 0; i < 100; i++) c[i] = 0;
while(1) {
getline(cin, s);
if(s == "\0") break;
for(i = 0; i < s.size(); i++) {
if(('a' <= s[i] && s[i] <= 'z') || ('A' <= s[i] && s[i] <= 'Z')... | #include <bits/stdc++.h>
using namespace std;
int main(){
char c;
int n[26]={};
while(cin>>c){
c= tolower(c);
if(isalpha(c)){
n[c-'a']++;
}
}
for(int i=0;i<26;i++){
printf("%c : %d\n",i+'a',n[i]);
}
} | 1 | 58,300,271 |
#include<iostream>
using namespace std;
int main(){
int H,W;
while(cin >> H>> W,H+W!=0){
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(i==0 || i==H-1 || j==0 || j==W-1)
cout<<'#';
else
cout<<'.';
}
cout<<endl;
}
cout<<endl;
}
return 0;
} | #include <iostream>
#include <utility>
#include <cstdio>
#include <cmath>
#include <climits>
using namespace std;
int main(){
int H,W;
while(1){
scanf("%d %d", &H, &W);
if(H==0 && W==0){break;}
for(int i=0; i<H; i++){
if(i==0 || i==H-1){
for(int j=0; j<W; j++)... | 1 | 91,250,309 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int D[1001][1001] = {};
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i <= s1.length(); i++)
D[i][0] = i;
for (int i = 0; i <= s2.length(); i++)
D[0][i] = i;
... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll... | 1 | 21,786,570 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
ll MOD = 1000000007;
ll INF =1<... | #include<bits/stdc++.h>
using namespace std;
int main() {
string o, e;
cin >> o >> e;
int i;
int len1 = o.length();
int len2 = e.length();
int len = len1 + len2;
int j, k;
i = 0, j = 0;
for(k=0; k<len; k++){
if(i>=len1){
cout << e[j];
j++;
}
... | 1 | 54,625,751 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <bitset>
#include <map>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
const int MAX_ROW = 110;
const int MAX_COL = 110000;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <ca... | 1 | 87,652,642 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,i,j;
cin >> n;
vector<ll> a(n),b(n),c(n);
ll s=0,t;
for(i=0;i<n;i++){
cin >> a.at(i);
}
for(i=0;i<n;i++){
cin >> b.at(i);
c.at(i)=a.at(i)-b.at(i);
s += c.at(i);
}
if(s<0){
cout << -1 << endl;
re... | #include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
using namespace std;
using ll... | 1 | 10,643,972 |
#include <iostream>
#include <algorithm>
using namespace std;
#define for_(i,a,b) for(int i = (a);i < (b);i++)
#define rfor_(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define rep(i,n) for_(i,0,(n))
#define rrep(i,n) rfor_(i,0,(n))
int a[3];
int main(){
cin.tie(0);
rep(i, 3)cin>>a[i];
sort(a, a+3);
cout<<a[0]<<' '<<a[1... | #include <iostream>
using namespace std;
void swap(int *a, int *b)
{
int tmp = *a;
*a = *b;
*b = tmp;
}
int main(void)
{
int a = 0, b = 0, c = 0;
cin >> a >> b >> c;
if (a > b) {
swap(&a, &b);
}
if (b > c) {
swap(&b, &c);
}
if (a > b) {
swap(&a, &b);
}
cout << a << " " << b << " " <<... | 1 | 26,590,325 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
char t = s[0];
int cnt = 0;... | 1 | 98,585,998 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A,B,C;
cin >> A >> B >> C;
if(A<=C && C<=B) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool Check(int A, int B, int C){
return (A <= C && C <= B);
}
int main(void){
int A, B, C;
cin >> A >> B >> C;
if(Check(A,B,C) )
cout << "Yes";
else
cout << "No";
} | 1 | 51,615,290 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
string S;
string T;
cin >> S >> T;
int res = 0;
rep(i,3){
if (S[i]==T[i])
res++;
}
cout << res << endl;
} | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | 1 | 41,115,841 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main() {
int X, A, B;
cin >>... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
int main(){
ll X, A, B;
cin >> X >> A >> B;
if(B - A <= X){
if(A - B... | 1 | 22,886,619 |
#include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll MOD = 1000000007;
int main() {
int N, K; cin >> N >> K;
ll ans = K;
rep(i,N-1) an... | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans{1};
ans = ans * k;
for (int i = 0; i < n - 1; i++) {
ans = ans * (k - 1);
}
cout << ans << endl;
return 0;
} | 1 | 47,781,994 |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
int n;
while (cin >> n){
double ans = 1;
while (n){
ans *= n;
n--;
}
printf("%.0f\n", ans);
}
return 0;
} | #include <iostream>
using namespace std;
int main ()
{
int n;
cin >> n;
long long res = 1;
while (n--) {
res *= (n + 1);
}
cout << res << endl;
return 0;
} | 1 | 66,441,696 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin>>N;
int a[N], b[N], c[N];
for(int i=0; i<N; i++)
cin>>a[i]>>b[i]>>c[i];
int Dp[]={a[0],b[0], c[0]};
int M[]={0,0,0};
for(int i=1; i<N; i++)
{
M[0] = max(a[i]+Dp[1], a[i]+Dp[2]);
M[1] = max(b[i]+Dp[0], b[i]+Dp[2]);
M[2]... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sz 100100
int a[sz];
int b[sz];
int c[sz];
int dpa[sz];
int dpb[sz];
int dpc[sz];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i] >> b[i] >> c[i];
for (int i = 1; i <=... | 1 | 47,825,192 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll f(ll n1, ll n2){
ll max_n = max(n1, n2);
ll min_n = min(n1, n2);
return max_n*(max_n+1)/2 + min_n*(min_n-1)/2;
}
int main()
{
string s;
cin >> s;
vector<ll> a(s.size()+1, 0);... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 1 | 61,761,473 |
#include <iostream>
int main() {
int n,a;
std::cin >> n >> a;
std::cout << n * n - a << std::endl;
} | #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() {
int N;
cin >> N;
int A;
cin >> A;
cout << N * N - A << endl;
} | 1 | 78,173,131 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
ll a;
cin>>a;
ll ans=a-1;
for(int i=2;i<=sqrt(a)+1;i++){
if(a%i==0){
ans=a/i+i-2;
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N; cin>>N;
for (ll i = floor(sqrt(N)); i > 0; i--){
if(N%i==0){
cout<<(i-1)+(N/i-1)<<endl;
return 0;
}
}
} | 1 | 26,713,079 |
#include<iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
#include <stdio.h>
#include <string.h>
#include<iomanip>
#include<unordered_map>
#include<unorde... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
int _min(int x, int y) {return x < y ? x : y;}
int _max(int x, int y) {return x > y ? x : y;}
LL read() {
LL s = 0, f = 1; char ch = getchar();
while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
whil... | 1 | 64,727,936 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long q, h, s, d;
cin >> q >> h >> s >> d;
long long n;
cin >> n;
long long ans = 0;
if (n % 2 == 0){
ans += min( 4*q*n, min( 2*h*n, min( n*s,d*n/2 ) ) );
}
else{
long long temp = n - 1;... | 1 | 22,077,998 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits.h>
#include <climits>
#include <map>
#include <unordered_map>
#define _USE_MATH_DEFINES
#include <cmath>
#include <set>
#include <unordered_set>
#include <iterator>
#include <deque>
#include <assert.h>
#include... | 1 | 4,357,589 |
#include <iostream>
#include <string>
#include <iomanip>
using namespace std;
int main (void){
string s;
cin >> s;
if (s[2] == s[3]) {
if (s[4] == s[5]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
cout << "No" << endl;
}
... | #include<bits/stdc++.h>
using namespace std;int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1)*4
#define pb push_back
#define vpr vector<pr>
#define pr pair<int, int>
#define vi std::vector<i... | 1 | 2,622,917 |
#include <iostream>
using namespace std;
int main() {
int W, H, X, Y;
cin >> W >> H >> X >> Y;
cout.precision(15);
cout << 0.5 * W * H << ' ' << (X * 2 == W && Y * 2 == H ? 1 : 0) << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 1 | 24,440,328 |
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
double ans, ra, rb;
string dolphinManJotaro;
cout << 1 * (a % b != 0);
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main(){
int n,k;
cin >> n >> k;
cout << ((n % k == 0) ? 0 : 1) << endl;
} | 1 | 82,799,245 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
ret... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,i,j,k,l,a,b,c,d;
cin>>a>>b;
c=0;
k=a;
while(k<=b)
{
c++;
k*=2;
}
cout<<c<<endl;
} | 1 | 17,883,088 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | 1 | 2,866,235 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int low = 1, high = n;
while (low < high) {
int mid = (low + high) >> 1;
vector<pair<int, int>> st;
bool o... | #include<bits/stdc++.h>
using namespace std;
int n,a[200001],s[200001];
map<int,int> mp;
bool judge(int x)
{
mp.clear();
int cnt=0;
for(int i=2;i<=n;i++)
if(a[i]<=a[i-1])
{
if(x==1) return false;
while(cnt&&s[cnt-1]>a[i])
mp[s[cnt-1]]=0,cnt--;
... | 1 | 6,351,580 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " <<... | #include<bits/stdc++.h>
using namespace std;
string s;
int main(){
int n;
cin>>n;
cin>>s;
long long ans=1,cnt=0,temp=0,mod=1000000007;
if(s[0]=='W'||s[s.length()-1]=='W'){
cout<<0;
return 0;
}
for(int i=0;i<s.length();i++){
if((cnt&1)^(s[i]=='B')) cnt++;
else{... | 1 | 61,196,826 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 1 | 88,861,730 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main()
{
char a;
string ans;
cin >> a;
if (isupper(a)) ans = "A";
else ans = "a";
cout << ans << endl;
} | #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() {
char a;
cin >> a;
if((int)a <= 122 && 97 <= (int)a){
cout << 'a' << endl;
}
else{
cout << 'A' << endl;
}
} | 1 | 56,698,315 |
#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<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<cfloat>
#include<functional>
#include<tuple>
#include<math.h>
#include<bitset>
#include<stack>
#include<set>
#include<random... | 1 | 24,523,140 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#define R... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <iomanip>
#include <functional>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ENDL '\n'
#define print(i) std::cou... | 1 | 58,729,437 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<tuple<long long,long long,long long>> CAB(N);
for(int i=0;i<N;i++){
int a,b;
cin >> a >> b;
CAB.at(i)=make_tuple(a+b,a,b);
}
sort(CAB.begin(),CAB.end());
reverse(CAB.begin(),CAB.end());
long long ans=0;
for(i... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespac... | 1 | 39,487,927 |
#include <bits/stdc++.h>
#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++)
using namespace std;
int main() {
string s;
cin>>s;
int n=s.size();
vector<char>q;
vector<int>p(n+1);
int j=0;
rep(i,s.size()){
if(s.at(i)!='x'){
q.push_back(s.... | #include<algorithm>
#include<cmath>
#include<climits>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
co... | 1 | 56,499,131 |
#include <bits/stdc++.h>
#define f(i, a, b) for (int i = a; i < (b); ++i)
#define f1(i, a, b) for (int i = a; i <= (b); ++i)
#define rep(i, n) f(i, 0, n)
using namespace std;
using ll = long long;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int lcm(int a, int b) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c)... | 1 | 73,072,614 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c; cin >> a >> b >> c;
bool exist = false;
for (int i = 0; i < b; i++) {
if (a * i % b == c) exist = true;
}
if (exist) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((a) / gcd(a,b)) * (b)
#define all(x) x.begin(),x.end()
#define ll long long
#define ull unsigned long long
#define VI vector<int>
#define VLL vector<ll>
#define VS vector<string>
#define MPII map<int, int>
#define SET set<int>
#... | 1 | 66,057,503 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> wa(n), al(n);
int ac = 0, pe = 0;
while (m--) {
int p;
string s;
cin >> p >> s;
p--... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N, M;
int tmp_p;
string tmp_S;
vector<int> task_status(100000);
int ac_num=0;
int pen_num=0;
cin >>N >>M;
for(int i=0;i<N;i++){task_status[i]=0;}
for(int i=0;i<M;i++){
cin >>tmp_p >>tmp_S;
if(task_status[tmp_p-1]==-1) continue;
... | 1 | 93,646,379 |
#include <bits/stdc++.h>
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
using namespace std;
int main() {
int A, B; cin >> A >> B;
int nf = -1;
for (int i = 1; i <= 10000; i++) {
if ((int)(i * 0.08) == A && (int)(i * 0.1) == B) {
cout << i << endl;
return 0;
... | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
int ans = -1;
for(int i = 1 ; i <= 1000 ; i++){
if(int(i * 0.08) == a && int(i * 0.1) == b){
ans = i;
break;
}
}
cout << ans;
} | 1 | 73,821,851 |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i=0; i<n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF 1e9
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { i... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
long Q,H,S,D;
long N;
long total=0;
cin>>Q>>H>>S>>D>>N;
total = (N/2)*min({8*Q,4*H,2*S,D})+(N%2)*min({4*Q,2*H,S});
cout<<total<<endl;
} | 1 | 95,771,234 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int MOD=1000000007;
const int INF= int(1e9);
int main()
{
ios_base::sync_with_stdio(false);
for(int i=1;i<=9;i++) {
for(int j=1;j<=9;j++) {
cout<... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
clock_t cTimeStart, cTimeEnd;
cTimeStart = clock();
for(int i=1;i<10;++i){
for(int j=1;j<10;++j){
cout<<i<<"x"<<j<<"="<<i*j<<endl;
}
}
cTimeEnd = clock(); ... | 1 | 82,983,117 |
#include<bits/stdc++.h>
using namespace std;
#define IL inline
#define RI register int
typedef long long LL;
const int MAXN = 1000005;
struct node{int from, to, w;} G[MAXN];
int dist[MAXN];
int head[MAXN];
bool vis[MAXN];
int cnt,k;
IL void add(int u, int v, int w)
{
G[++cnt].to=v;
G[cnt].w=w;
G[cnt].from=h... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int K;
cin >> K;
priority_queue<P, vector<P>, greater<P>> que;
vector<int> min_cost(K, -1);
for(int i=1;i<10;i++) {
que.emplace(i, i % K);
min_cost[i % K] = i;
}
while(!que.empty()) {
auto p = que.top(... | 1 | 73,834,949 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
int main(void){
int N;
double ans = 0;
std::cin >> N;
std::vector<int> v(N);
for (int i=0; i<N; ++i){
std::cin >> v.at(i);
}
std::sort(v.begin(), v.end());
ans += v.at(0) / pow(2, N - 1);
for (int i=1... | #include<bits/stdc++.h>
#define lli long long int
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define test lli t;cin>>t;while(t--)
#define arrin lli n;cin>>n;lli a[n];for(lli i=0;i<n;i++)cin>>a[i]
#define floop for(lli i=0;i<n;i++)
#define mod 1000000007
#define defvec vector<lli>v
#define ub upper_bo... | 1 | 59,928,142 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
int main() {
int n; cin >> n;
V<int> v(n);
for(int i = 0; i < n; i++){
int a; cin >> a;
a--;
v[i] = a;
... | 1 | 90,976,757 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int h, n, a, total = 0;
cin >> h >> n;
rep(i, n) {
cin >> a;
total += a;
}
cout << (h <= total ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int H, N;
cin >> H >> N;
vector<int> A(N);
for(int i = 0; i < N; i++){
cin >> A.at(i);
}
int sumA = 0;
for(int i = 0; i < N; i++){
sumA += A.at(i);
}
if(H <= sumA) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 47,682,280 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string s, t;
cin >> s >> t;
int ans = N;
for(int i=0; i<N; i++)
{
if(s.substr(i, N-i) == t.substr(0, N-i)) break;
ans++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main () {
int n; cin >> n;
string s1, s2; cin >> s1 >> s2;
for (int i = 0; i < n; i++)
if (s1[i] == s2[0]) {
bool g = 1;
for (int j = i + 1, k = 1; j < n; j++, k++)
if(s1[j] != s2[k])
g = 0;... | 1 | 29,778,511 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long l0 = 2, l1 = 1, tmp;
for (int i = 1; i < n; i++) {
tmp = l1;
l1 = l0 + tmp;
l0 = tmp;
}
cout << l1 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define prior priority_queue
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define PI 3.1415926535897932384626433832795
#define ll long long
#define ld long double
#define ret return
... | 1 | 55,254,273 |
#include <iostream>
using namespace std;
int main()
{
int x, y;
scanf("%d %d", &x, &y);
printf("%d", x+y/2);
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int x, y;
cin >> x >> y;
cout << x + y / 2;
}
int main()
{
fastio;
... | 1 | 28,254,747 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<functional>
#include<vector>
#include<math.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
int data[M][2];
for(int i=0;i<M;i++){
cin>>data[i][0]>>data[i][1];
}
int order[N];
for(int i=1;i<=N;i++) order[i-1]=i;... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 1 | 83,946,102 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define sizeOf(A) (sizeof(A))/(sizeof(A[0]))
#define odd(x) ((x) % (2))
#define fastio ios_base::sync_with_stdio(false), cin.tie(0);
const ll MOD = 1e9 + 7;
bool... | 1 | 37,017,072 |
#include <iostream>
#include <utility>
#include <tuple>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <functional>
#include <climits>
#include <numeric>
#include <queue>
#include <cmath>
#include <iomanip>
#include <arra... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 1 | 38,018,239 |
#include <bits/stdc++.h>
#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++)
using namespace std;
int main() {
string s;
int k;
cin>>s>>k;
vector<vector<int>>dp0(s.size(),vector<int>(s.size()+1));
vector<vector<int>>dp1(s.size(),vector<int>(s.size()+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>;
const int INF = 1000100100;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int dp[105][4][2];
int main(){
string s; cin >> s;
i... | 1 | 51,696,733 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
int main(){
int a;
cin>>a;
vector<int> data(a);
for(int k = 0; k < a; k++){
cin>>data[k];
}
int swap = 0;
for(int i = 0; i < a; i++){
int minj = i;
for(int j = i; j < a; j++)... | #include <iostream>
#include <vector>
template<typename T>
void print_ary(std::vector<T> ary, char delim = '\n') {
for(int i = 0; i < ary.size()-1; i++) {
std::cout << ary[i] << delim;
}
std::cout << ary[ary.size()-1];
}
template<typename T>
void insertion_sort(std::vector<T>&& ary) {
for (int i... | 1 | 51,329,879 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <c... | #include<iostream>
#include<string>
using namespace std;
int main(){
bool dp[20][20];
char r[20][20];
int w,h;
while(true){
cin>>w>>h;
if(w==0&&h==0)
break;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>r[i][j];
dp[i][j]=false;
if(r[i][j]=='@')
dp[i][j]=true;
}
}
int count=1,cop=1;
while... | 1 | 36,219,893 |
#include<bits/stdc++.h>
using namespace std;
const long long mod=1000000000+7;
const long long INF=9e15;
const double PI=3.14159265358979323846;
using ll = long long;
using P=pair<long long,long long>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
#define ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
vector<pair<int, int>> graph[100001];
int ans[100001];
signed main() {
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
--a, --b;
graph[a].push_back({b, c});
graph[b].push_back({a, c});
}
int Q, K;
cin >> ... | 1 | 94,692,731 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 998244353
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
int main(){
int H,W,d;
cin>>H>>W>>d;
int K = 500;
vector<string> S(2000,string(2000,'.'));
for(int i=0;i<2000;i++){
for(int j=0;j<2000;j++){
int a = ((i%(2*d))<... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAXN = 1009;
int n,m,d;
int mat[MAXN][MAXN];
int ans[MAXN][MAXN];
int ADD;
int cal(int x,int y){
if(x%2==1){
if(y%2==1)
return 1;
else
return 2;
}
else{
if(y%2==1)
return 3;
else
return 4;
}
}
i... | 1 | 76,275,772 |
#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int memo[50];
int fib(int n){
if(~memo[n]) return memo[n];
if(n<=1) return 1;
return memo[n]=(fib(n-1)+fib(n-2));
}
signed main(){
int n;
cin>>n;
memset(memo,-1,sizeof(memo));
cout<<fib(n)<<endl;
return 0;
} | 1 | 32,405,459 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
REP(i,s.size()) {
if (i % 2 == 0) cout << s[i];
}
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | 1 | 82,095,627 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char N;
int ans=0;
cin >> N;
if(N=='a'||N=='i'||N=='o'||N=='u'||N=='e'){
cout << "vowel" << endl;
}else{
cout << "consonant" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char a;
cin >> a;
switch (a) {
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
cout << "vowel\n";
break;
default:
cout << "consonant\n";
break;
... | 1 | 45,408,297 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
const int N = 2e3 + 5, M = 2e5;
int main()
{
Hello
ll a, b, k;
cin >> a >> b >> k;
ll ansA = a, ansB = b;
if(k >= a){
ansA = 0;
ansB... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 1 | 72,227,970 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b)
cout << c;
else if (a == c)
cout << b;
else
cout << a;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int a, b, c;
cin >> a >> b >> c;
if (a != b && a != c)
cout << a;
else if (b != a && b != c)
cout << b;
else
cout << c;
} | 1 | 23,165,859 |
#include<bits/stdc++.h>
#define dbug printf("I am here\n");
#define Fast ios_base::sync_with_stdio(false); cin.tie(0);
#define vs v.size()
#define ss s.size()
#define sot(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define ii pair<int, int>
#define... | #include <bits/stdc++.h>
using namespace std;
void solve () {
long long n, m;
cin >> n >> m;
long long f = min (n, m/2);
m -= f * 2;
long long s = m/4;
cout << f + s;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 1 | 19,530,998 |
#include <stdio.h>
#define MAX 100
int main(void)
{
int i, j;
char ring[MAX + 1];
char make[MAX + 1];
scanf("%s %s", ring, make);
char ring2[MAX * 2 + 1];
for (i = 0; (ring2[i] = ring[i]) != '\0'; i++){
;
}
int len_ring = i;
for (i = 0; (ring2[len_ring + i] = ring[i]) != '\0'... | #include <iostream>
using namespace std;
int main(){
string s;cin>>s;
string t;cin>>t;
string ss = s+s;
for(int i = 0; s.size() > i; i++){
bool ok = true;
for(int j = 0; t.size() > j; j++){
if(t[j] != ss[i+j]){
ok = false;
break;
}
}
if(ok){
cout << "Yes" << end... | 1 | 96,440,512 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
string s, a_string;
cin >> s;
for (int i = 0; i < s.length(); i += 2){
a_string = a_string + s[i];
}
cout << a_string << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
for(int i=0; i<s.size(); i+=2)
{
cout << s[i];
}
cout << endl;
return 0;
} | 1 | 27,156,572 |
#include <bits/stdc++.h>
#define pb push_back
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define mem(a,k) memset(a,k,sizeof(a))
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
#define fore(i,v) for(int i=g[v],d=es[i].d;i;i=... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<int(n); i++)
using namespace std;
int N, deg[100000], cnt[100000], used[100000];
vector<int> G[100000];
int main(){
cin >> N;
rep(i, N-1){
int a, b; cin >> a >> b;
a--; b--;
G[a].push_back(b);
G[b].push_back(a);
deg[a]++; deg[b]++;
}
rep(i, N)rep(j,... | 1 | 7,235,651 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
int ans = 0;
for (int i = 0; i < n; i++)
{
if (a[i] >= (double)sum / (4 * m))
{
ans... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int N;
int M;
int num = 0;
double sum = 0;
cin>>N;
cin>>M;
int arr[N];
for(int i = 0;i < N;i++){
cin>>arr[i];
sum += arr[i];
}
sort(arr,arr + (N),greater<int>());
for(int i = 0;i < M;i++... | 1 | 8,812,679 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;... | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<bitset>
#include<vector>
#include<queue>
#include<ext/pb_ds/priority_queue.hpp>
#include<set>
#include<map>
#include<math.h>
#include<set>
#define maxn 10000005
#define lson (now<<1)
#define rson ((now<<1)|1)
typedef long long ll;
usin... | 1 | 14,268,121 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x, y) min<ll>(x, y)
#define tmax(x, y, z) lmax((x... | #include <bits/stdc++.h>
using namespace std;
struct StNumCnt
{
StNumCnt() :
m_nNum(0), m_nCnt(0)
{ }
int m_nNum;
int m_nCnt;
};
void input(vector<int>& rvnNum)
{
int nSize;
cin >> nSize;
rvnNum.resize(nSize);
for (int& rnElm : rvnNum)
cin >> rnElm;
}
int calcMaxTogetherCnt(const vector<int>& cn... | 1 | 43,901,961 |
#include <bits/stdc++.h>
using namespace std;
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
int x[200000] = {0} , y[200000] = {0};
... | 1 | 100,222,397 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | 1 | 55,641,684 |
#include <bits/stdc++.h>
#define SS " "
#define endl "\n"
#define EPS 1e-9
#define gcd __gcd
#define pb push_back
#define pi acos(-1.0)
#define Ars greater<int>()
#define vi vector<int>
#define vvi vector<vector<int> >
#define flush ... | #include <bits/stdc++.h>
#define F first
#define S second
#define maxn 200005
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define pi acos(-1)
#define bit(p,x) ((x>>p) & 1)
#define Task "CF"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int > piii;
... | 1 | 37,127,288 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.