code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n ;
scanf("%lld",&n);
vector<ll>v;
ll in;
ll s = 0;
for(int i = 0; i < n ; i++)
{
scanf("%lld",&in);
v.push_back(in);
s+= in;
}
ll pem = n*n+n;
pem=pem/2;
bool flag = 1;
if(s%pem != 0)
{
flag = 0;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define FORE(i, a, b) for(int i=(a);i<=(b);++i)
#define rep(i, n) for(int i=0;i<(n);++i)
#define repe(i, n) for(int i=0;i<=(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define SP cout<<fixed<<setprecision(... | 1 | 84,821,200 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> aa(a);
for(int i = 0; i < a; i++) {
cin >> aa.at(i);
}
vector<int> bb(b);
for(int i = 0; i < b; i++) {
cin >> bb.at(i);
}
int min = 1000000;
for(int i = 0; i < m; i++) {
int x, y, c;
... | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <map>
using namespace std;
int main() {
int A, B, M, * a, * b, x, y, c, minA = pow(10, 5), minB = pow(10, 5), p = 3 * pow(10, 5), tmp = 0;
cin >> A >> B >> M;;
a = new int[A];
b = new int[B];
for (int i = 0; i < A; i++) {
cin >... | 1 | 77,221,078 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a;
cin>>a;
ll b=0;
vector<ll>vec(a+1);
for(ll i=0;i<a+1;i++){
cin>>vec.at(i);
b+=vec.at(i);
}
for(ll i=0;i<a;i++){
ll c;
cin>>c;
if(vec.at(i)>c){
vec.at(i)-=c;
}
else if(vec.at(i)<=c){
... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<N;i++)
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
vector<int> A(N+1);
vector<int> B(N);
for(int i=0;i<=N;i++)cin>>A[i];
for(int i=0;i<N;i++)cin>>B[i];
ll a=0;
for(int i=0;i<N;i++){
int x=min(A[i],B[i]);
a+=x;
B[i]-=x;
x=m... | 1 | 96,817,304 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | 1 | 57,724,596 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa,k)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
int main(){
string s, t;
cin >> s >> t;
bool flag = true;
for (int i = 0; i < s.length(); ++i) {
if (s[i] != t[i])... | 1 | 42,451,152 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
ll ceil(ll a, ll b) {
if (b < 0) {
a *= -1;
b *= -1;
}
if (a >= 0) {
return (a + b - 1) / b;
} else {
return a / b;
}
}
ll floor(ll a, ll b) {
if (b < 0) {
a *= -1;... | #include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#define rep(i, n) for (in... | 1 | 48,908,324 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
#include<cmath>
#include<deque>
#include<map>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(_x) _x.begin(), _x.end()
#define ... | 1 | 26,947,468 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string s;cin>>s;
if(s[6] <= '4'&&s[5] != '1') cout<<"Heisei";
else cout<<"TBD";
return 0;
} | 1 | 22,461,454 |
#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>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n;
cin >> n;... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<string> s(n);
vector<int> cnt(4);
rep(i,n) {
string s;
cin >> s;
... | 1 | 2,012,275 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
vector<int> even(100000 + 10, 0), odd(100000 + 10, 0);
for (int i = 0; i < n; i += 2) {
... | #include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int n;
map<int,int> mp1,mp2;
signed mai... | 1 | 33,086,148 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
if (a + b >= k) {
cout << min(a, k) << endl;
} else {
cout << a - (k - a - b) << endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
int a,b,c,k;
cin>>a>>b>>c>>k;
int sum = 0;
if(k>=a){
sum += a;
k-=a;
}else{
cout<<k<<endl;
return 0;
}
if(k>=b){
k-=b;
}else{
... | 1 | 16,389,261 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,k;
cin>>a>>b>>c>>k;
if(a>=k){
cout<<k;
}else if(a+b>=k){
cout<<a;
}else{
cout<<a-k+a+b;
}
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 | 11,301,211 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int X, Y;
cin >> X >> Y;
vector<int> x(N);
vector<int> y(M);
for(int n=0; n<N; n++) {
cin >> x[n];
}
for(int m=0; m<M; m++) {
cin >> y[m];
}
s... | 1 | 48,077,184 |
#include <stdio.h>
#include <string.h>
char result[100000];
void calculation(int multi){
int carry=0,i,j=0;
for(i=0;result[i]!=NULL;i++){
carry+=(result[i]-48) * multi;
result[j++]=(carry % 10) + 48;
carry/=10;
}
while(carry){
result[j++]=(carry % 10) + 48;
carry/... | #include <iostream>
using namespace std;
int main(void){
long n, x;
cin >> n;
x = 1;
while(n != 1){
x *= n;
n--;
}
cout << x << endl;
return 0;
} | 1 | 39,609,391 |
#include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 10000000... | #include <bits/stdc++.h>
using namespace std;
#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; } return false; }
using ll=long long;
int main(){
... | 1 | 39,927,492 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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;
}
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
ll mod_pow(ll a, ll n, ll mod) {
ll result = 1;
while (n > 0) {
if (n & 1) result = result * a % mod;
a = a * a % mod;
n >>= 1;
}
return result;
}
int D[100000];
int main() {
int N;
cin >> N;
unordered_map<int, in... | 1 | 93,452,007 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
ll ans=0;
void Main(){
ll n;cin>>n;
vector<int> alphabet(26,0);
vector<string> s(n);
For(i,0,n) cin >> s[i];
For(j,0,s[0].size()) alphabet[s[0][j]-'a']... | #include "bits/stdc++.h"
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;i++)
#define ... | 1 | 43,036,914 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n , a , b;
cin >> n >> a >> b;
int... | 1 | 99,079,894 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N,K;
cin >> N >> K;
str... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int main(){
int n,k;
string s;
cin>>n>>k>>s;
vector<int> r;
if(s[0]=='0') r.push_back(0);
bool f0=1,f1=1;
int tmp=0;
rep(i,n){
if(s[i]=='0'){
if(f0) {t... | 1 | 53,457,871 |
#include <iostream>
using namespace std;
int main()
{
string N;
getline(cin,N);
if(N[0]=='7'||N[1]=='7'||N[2]=='7')
{
cout<<"Yes";
}
else
{
cout<<"No";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL<<60;
using ll = long long;
using P = pair<int, int>;
#define vi vector<int>
... | 1 | 53,657,097 |
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | #include <bits/stdc++.h>
using namespace std;
bool solve() {
int n; cin >> n;
int cnt[110] = {};
int maxi = 0;
for(int i = 0; i < n; ++i) {
int a; cin >> a;
cnt[a]++;
maxi = max(maxi, a);
}
if(cnt[maxi] < 2) {
return false;
}
cnt[maxi] -= 2;
if(maxi % 2 == 0) {
if(cnt[maxi / 2] < 0) {
return false... | 1 | 23,114,879 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
int main(){
ll n;cin >>n;
vector<ll>a(n);
for (int i = 0; i < n; ++i) {
cin>>a[i];
}
ll ans=0;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 1 | 22,496,021 |
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int d;
int i,j;
int h;
while(scanf("%d", &d)!=EOF){
int sum=0;
for(i=1;i<600/d;i++)
sum+=d*d*d*i*i;
cout<<sum<<endl;
}
} | #include <iostream>
using namespace std;
int main(){
double d;
while(cin >> d){
int sum = 0;
for(int i=0; i*d<600; i++){
sum = sum + d * (i*d)*(i*d);
}
cout << sum << endl;
}
} | 1 | 67,307,640 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int INF = 2e9;
int main() {
int n, k;
cin >> n >> k;
vector<P> d(3);
rep(i,3) cin >> d[i].first, d[i].second = i... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << f... | 1 | 27,055,189 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
void solve() {
string s;
cin >> s;
for (char c = 'a'; c <='z'; ++c) {
bool flag = true;
for (char si: s) {
if (c == si) {
flag = false;
break;
}
}
... | 1 | 38,868,361 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
string S; cin >> S;
int N = S.size();
if (N == 1) {
cout << 0 << endl;
return 0;
}
int L = 0, R = N-1;
int cnt = 0;
while (L < R) {
i... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int N = s.size();
int l= 0;
int r = N - 1;
vector<int> lx;
vector<int> rx;
int lxn = 0;
int rxn = 0;
while( r > l ) {
while( s[l] == 'x' ) {
lx.push_back( l - lxn );
lxn++;
l++;
}
while( s[r] == 'x' ) {
rx.push_bac... | 1 | 36,749,458 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int a,b;
cin >> a>>b;
int x = max(a,b);
if(x > 8)cout << ":(" << endl;
else cout << "Yay!" << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string ans;
if(A > 8 || B > 8) {
ans = ":(";
} else {
ans = "Yay!";
}
cout << ans << endl;
} | 1 | 98,777,631 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> num = {2, 5, 5, 4, 5, 6, 3, 7, 6};
int n, m;
cin >> n >> m;
vector<int> a(m);
for(int i = 0; i < m; i++) cin >> a.at(i);
vector<int> dp(n + 10, -1);
dp.at(0) = 0;
for(int i = 0; i < m; i++... | #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 vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = 1e9+7;
const double EPS = 1e-9;
int mod;
vi use(8),... | 1 | 83,391,614 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll R, G, B, N;
ll count = 0;
cin >> R >> G >> B >> N;
for(ll r = 0;r <= N / R;r++) {
for(ll g = 0;g <= N / G;g++) {
ll b = max(0LL, (N - r * R -... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int R,G,B,N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r < N/R + 1; r++) {
for (int g = 0; g < N/G + 1; g++) {
if ((N - R*r - G*g) % B == 0 && r*R + g*G <= N) {
... | 1 | 34,250,613 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s,s1;
cin>>s;
for(int i=0;i<s.length();i++)
{
if(s[i]!='B')
s1+=s[i];
else
{
if(s1.length()>=1)
s1.pop_back();
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (... | 1 | 92,643,648 |
#include<string>
#include<iostream>
using namespace std;
int main(){
string card, tmp1, tmp2;
int sh_place, sh_cnt;
while(true){
cin >> card;
if(card == "-") break;
cin >> sh_cnt;
while(0 < sh_cnt--){
cin >> sh_place;
tmp1 = card.substr(0,sh_place);
tmp2 = card.substr(sh_place);
card = tmp2 + tmp... | #include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#define _USE_MATH_DEFINES
#include<math.h>
#include<unordered_map>
#define min(a,b) (a)>(b)?(b):(a)
#define max(a,b) (a)>(b)?(a):(b)
using namespace std;
int main()
{
vector<str... | 1 | 51,761,662 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
string ans = "";
for (int i = 0; i < 1; ++i) {
ans += toupper(s1[0]);
}
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s, t, u;
cin >> s >> t >> u;
s = s[0] + ('A' - 'a');
t = t[0] + ('A' - 'a');
u = u[0] + ('A' - 'a');
cout << s << t << u << endl;
return 0;
} | 1 | 57,533,872 |
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<iomanip>
using namespace std;
int main() {
double x1, x2, y1, y2,ans,a;
cin >> x1 >> y1 >> x2 >> y2;
a = (x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2);
ans = sqrt(a);
cout << fixed<< setprecision(6)<<ans;
return 0;
} | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
double a, b, c, d, e;
cin >> a >> b >> c >> d;
e = sqrt(pow(c-a, 2) + pow(d-b, 2));
printf("%0.6f\n", e);
return 0;
} | 1 | 78,432,255 |
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 922337203685477;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define maxN 100007
usin... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1) return true;
for (long long i = 2; i*i <= x; i++) {
if (x % i == 0) return false;
}
return t... | 1 | 46,334,504 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inlin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
string a, b, c;
cin >> a >... | 1 | 25,985,940 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if ((a & 1) && (b & 1)) {
puts("Odd");
} else {
puts("Even");
}
return 0;
} | #include <iostream>
using namespace std;
void solve(long long a, long long b){
if ((a * b) % 2) cout << "Odd" << '\n';
else cout << "Even" << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long a;
scanf("%lld",&a);
long long b;
scanf("%lld",&b);
solve(a, b);
re... | 1 | 66,231,340 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int H, W;
vector<string> fi;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
cin >> H >> W;
fi.resize(H);
for (int i = 0; i < H; ++i) cin >> fi[i];
vector<vector<int> > dist(H, vector<int>(W, -1));
using p... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
int main() {
int H, W;
cin>... | 1 | 78,049,097 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>
#include<iomanip>
#include<map>
#include<cstring>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const ll LLINF = 1LL<<60;
int N, A, B, ... | 1 | 33,347,434 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i,a,b) for(long int i=a;i<=b;i++)
#define MOD 1e9+7
string a,b;
bool flag = false;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin>>a>>b;
sort(a.begin(),a.end());
sort(b.begin(),b.end());
reverse(b.begin(),b.end())... | 1 | 82,422,715 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 1e5+5;
int a[sz];
int main()
{
int a, x, b, y, k;
cin >> a >> x >> b >> y >> k;
int xx = a * 60 + x;
int yy = b * 60 + y;
cout << yy - xx - k << endl;
} | #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 h1,m1,h2,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
cout << max(0,h2*60+m2-h1*60-m1-k) << endl;
} | 1 | 22,292,900 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
string s, t;
cin >> s >> t;
vector<set<char>> temp1(26);
vector<set<char>> temp2(26);
rep(i, s.size()) {
temp1[s[i] - 'a'].insert(t[i]);
temp2[t[i] - 'a'].insert(s[i]);
}... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes \
cout << "Yes" << endl; \
return 0;
#define No \
cout << "No" << endl; \
return 0;
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
t... | 1 | 45,723,225 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int n,k,cnt,MAX,ans;
string s;
char L;
vector<int> v;
int main(void){
cin>>n>>k>>s;
s='1'+s+'1';
cnt=0;
L='1';
cnt=1;
for(int i=1;i<s.size();i++){
if(s[i]=='0'){
if(L=='0')cnt++;
else{L='0';v.push_ba... | #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(){
ll n,k;
cin >> n >> k;
string s;
cin >> s;
vector <ll> t;
ll k3=0;
int m;
rep(i,n){
if(k3==0){
if(s[i]=='0'){
... | 1 | 47,303,732 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string x;
cin >> x;
int sum = 0;
for (int i = 0; i < x.length(); ++i){
sum += x[i]-'0';
}
if(sum%9 == 0){cout << "Yes" << endl;}
else{std::cout << "No" << std::endl;}
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pf(n) printf("%d\n",n)
#define pff(a,b) printf("%d %d\n",a,b);
typedef long long ll;
typedef p... | 1 | 80,318,969 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,ans=1;
string s;
cin>>n>>s;
rep(i,n-1){
if(s[i]!=s[i+1]){
ans++;
}
}
cout<<ans;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n, x = 0;
string s;
char c;
cin>>n>>s;
x = s.size();
c = s[0];
for(ll i=1; i<s.size(); i++)
{
if(c == s[i])
{
x--;
}
else c = s[i];
}
cout<<x<<endl;
... | 1 | 74,259,208 |
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <map>
#include <set>
#include <stack>
#include <queue>
using namespace std;
#define pb(n) push_back(n)
#de... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <list>
#include <queue>
#include <set>
using namespace std;
int main(void){
char str1[50], str2[50];
int n; cin >> n;
for (int m = 0; m < n; m++){
cin >> str1... | 1 | 47,624,433 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int foo(int A){
int ct = 0;
for (int j = 1; j*j <= A; j ++){
if (A % j == 0){
int f1 = j, f2 = A / j;
if (f1 == f2) ct += 1;
else ct += 2;
}
}
return ct;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int N; cin >> N;
ll res... | #include<bits/stdc++.h>
#define fi 2*acos(0.0)
#define ee 2.71828
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define valid(n... | 1 | 69,023,159 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int N;
cin >> N;
set<string> shiritori;
string S, T;
cin >> S;
shiritori.insert(S);
bool ok = true;
for(int i = 2;i <= N; i++){
cin >> T;
if(shiritori.... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 1 | 96,956,537 |
#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--)
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | 1 | 46,087,975 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main(){
string A, B; cin >> A >> B;
if(A == B)... | 1 | 49,013,021 |
#include <stdio.h>
int main()
{
int h, w, i, j;
while (1) {
scanf("%d %d", &h, &w);
if (h == 0 && w == 0) {
break;
}
else if (h != 0 && w != 0) {
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
printf("#");
... | #include <iostream>
using namespace std;
int main() {
int h,w,x;
while(1){
cin >> h >> w;
if(h==0 && w==0)
break;
while(h > 0){
x = w;
while(x > 0){
cout <<"#";
x--;
}
cout <<endl;
h--;
... | 1 | 34,073,723 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
const ll maxi =20000;
#define ip pair<ll,ll>
#define mp make_pair
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int a[n];
vector<int> freq((int)1e6+5,0);
for(int i=0;i<n;i++)
cin>>a[i];
for(ll... | 1 | 60,836,544 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;i<(n);i++)
#define REP(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define INF LLONG_MAX - 100
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
#define int long... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, ans;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n;
for (ll mod = 1; mod * mod <= n; mod++) {
if ((n % mod) || (n == 1 && mod == 1) || n % (n / mod - 1) != mod) continue;
ans += n / mod - 1;
}
cout ... | 1 | 94,342,838 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,... | 1 | 51,920,855 |
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void... | 1 | 13,468,458 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int N = 200005;
int n,dp[N],best[ 1 << 26];
string s;
int main(void){
cin >> s;
n = s.size();
for(int i = 0; i < 1 << 26; i++){
best[i] = 1e9;
}
best[0] = 0;
int mask = 0;
for(int i = 0; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
int main()
{
string s;
cin >> s;
const int n = s.length();
map<char, bool> f;
vector<long long> mask(n);
for (int i = 0; i < n; ++i) {
f[s[i]] ^= 1;
long long &now = mask[i];
for (int j = 'a'; j ... | 1 | 51,675,411 |
#include<cstring>
#include<string>
#include<vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<complex>
#include<sstream>
#include<climits>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X)... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
template<class T>boo... | 1 | 33,921,856 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll read(){
ll a=0,b=getchar(),c=1;
while(!isdigit(b))c=b=='-'?-1:1,b=getchar();
while(isdigit(b))a=a*10+b-'0',b=getchar();
return a*c;
}
int n,a,b;
int main(){
cin >> n >> a >> b;
if((a-b)%2)puts("Borys");
else puts("Alice");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define mrep(i,from,n) for(int i = from; i < n; i++)
#define mreps(i,from,n) for(int i = ... | 1 | 32,485,317 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
const int inf=1e9+7;
const ll INF=1LL<<58;
const ll mod... | #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 MOD 1000000007
using namespace std;
typedef pair<int,... | 1 | 11,407,008 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<ll>>;
using P = pair<int,int>;
#define MOD 1000000007
#define INF 1000000
#define PI 3.14159265358979323846264338327950L
#define MAX_N 200010
#define lb lower_bound
#define REP(i,n) for(int i=0;i<n;+... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int> A(n+1,0);
rep(i,n) cin>>A[i];
int cnt=0;
for(int i=0;i<n;i++){
if(A[i]==0) continue;
while(A[i]>0){
... | 1 | 52,342,499 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define v(x) vector<int> x;
#define all(x) x.begin(),x.end()
#define s(x,n) memset(x,n,sizeof(x));
#define pb(x) push_back(x)
ll gcd(ll m,ll n)
{
if(n==0)
return m;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
cout << a / __gcd(a, b) * b << '\n';
return (0);
} | 1 | 76,504,415 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#include <iomanip>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
ll a[100000];
ll b[100000];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
ll sum=0;
ll cnt=0;
for(int... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 1 | 77,724,203 |
#include <iostream>
#define N 9
using namespace std;
int solver(int n, int s, int t){
if(n == 0 || s < 0 || t > N) return 0;
if(n == 1 && s == t) return 1;
return solver(n-1, s-t, t+1) + solver(n, s, t+1);
}
int main(){
int n, s;
while(cin >> n >> s, n){
cout << solver(n, s, 0) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
#define LOOP(i,x,n) for(int i=(x);i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
using namespace std;
const int MOD=1e9+7;
const int INF=1e10;
int f(int n,int s,int m){
int tmp=0;
if(n==0&&s==0)return 1;
LOOP(i,m,10)if(s-i>=0)... | 1 | 35,092,924 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define mp(a,b) make_pair(a,b)
#... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr <... | 1 | 33,626,120 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
map<char,int> mp;
for(int i=0;i<s.size();++i){
mp[s[i]]++;
}
if(mp.size() == 3) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 | 14,031,855 |
#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()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<int,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int solve(int n, string &s, string &t){
int ... | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
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; } return false; }
int main()
{
int N;
cin >> N;... | 1 | 10,666,004 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
#define Fast_D cout<<fixed<<setprecision(13);
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define nl "\n"
#define int long long
#define double long... | 1 | 23,628,183 |
#include <iostream>
#include <stack>
using namespace std;
int main()
{
stack<int> stk;
int car;
while (cin >> car) {
if (car) {
stk.push(car);
}
else {
cout << stk.top() << endl;
stk.pop();
}
}
} | #include <cstdio>
#include <cstring>
#include <stack>
using namespace std;
int main()
{
stack<int> s;
int x;
while(scanf("%d", &x) != -1){
if(x)
s.push(x);
else
printf("%d\n", s.top()), s.pop();
}
return 0;
} | 1 | 6,051,364 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
ll n,x;
cin>>n>>x;
vector<ll> A(n);
ll y;
rep(i,n){
cin>>y;
A[i]=abs(y-x);
}
ll ans=A[0];
for(int i=1;i<n;i++){
ans=gcd(ans,A... | #include <iostream>
#include<string>
#include<vector>
#include<cmath>
#include<map>
using namespace std;
int next(int x) {
for (int i = 2; i*i <= x; i++) {
if (x % i == 0) {
return x / i;
}
}
return 1;
}
int gcd(int a, int b) {
if (b == 0)return a;
return gcd(b, a % b);
}... | 1 | 46,584,627 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #define ONLINE_JUDGE
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cctype>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
const int INF = 0x3... | 1 | 51,136,566 |
#include <iostream>
int main() {
int a;
int b;
int c;
std::cin >> a >> b >> c;
int cnt = 0;
for(int i = a; i <= b; ++i) {
if((c % i) == 0) {
++cnt;
}
}
std::cout << cnt << std::endl;
return 0;
} | #include<stdio.h>
int main(){
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
d = 0;
for (a; a <= b; a++){
if(c % a == 0){
d++;
}
}
printf("%d\n", d);
} | 1 | 49,872,820 |
#include<iostream>
using namespace std;
int main() {
int n, x, i, j, k, sum;
cin >> n >> x;
while (n != 0 || x != 0) {
sum = 0;
for (i = 1; i <= n; i++) {
for (j = i + 1; j <= n; j++) {
for (k = j + 1; k <= n; k++) {
if (i + j + k == x) {
sum++;
}
}
}
}
cout << sum << endl;
ci... | #include <bits/stdc++.h>
using namespace std;
int solve(int, int);
int main() {
int n, x;
while(1) {
cin >> n >> x;
if (n == 0 && x == 0) {
break;
} else {
cout << solve(n, x) << endl;
}
}
}
int solve(int n, int x) {
int cnt = 0;
for (int i = 0... | 1 | 78,159,517 |
#include<iostream>
using namespace std;
void swap(int*, int*);
int main(){
int a, b, c;
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 << " " << c << endl;
}
void swap(int* high, int* low){
int tmp = *low;
*low = *high;
*high = tmp;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char* argv[]) {
vector<int> input(3);
cin >> input[0] >> input[1] >> input[2];
sort(input.begin(), input.end());
cout << input[0] << ' ' << input[1] << ' ' << input[2] << endl;
return 0;
} | 1 | 641,687 |
#include <bits/stdc++.h>
using namespace std;
bool func(int a,int b)
{
return (a>b);
}
int main()
{
int ara[100000],i;
for (i=0;i<5;i++)
{
scanf ("%d",&ara[i]);
}
sort(ara,ara+5,func);
for (i=0;i<5;i++)
{
printf ("%d",ara[i]);
if (i<4)
cout<<" ";
}... | #include<iostream>
#include<set>
using namespace std;
int main()
{
multiset<int ,greater<int> > num;
int n;
for(;cin >> n;)
{
num.clear();
num.insert(n);
for(int i=0;i<4;i++)
{
cin >> n;
num.insert(n);
}
multiset<int,greater<int> >::iterator it = num.begin();
for(;it!=num.end();)
{
it++;
... | 1 | 94,902,555 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<string> vs;
#define fo(i, a, b) for (int i = a; i < b; i++)
#define re(i, n) fo(i, 0, n)
#define pb push_back
#define mp make_pair... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, d, x;
cin >> n >> d >> x;
vector<int> a(n);
rep(i, n) cin >> a[i];
int choco = 0;
rep(i, n) {
choco += d / a[i] ;
if(d%a[i]!=0 ) choco++;
}
... | 1 | 74,048,215 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <cstdlib>
#include <utility>
#include <list>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <numeric>
#include <functional>
#include <ctime>
#include <bitset>
#include... | #include <bits/stdc++.h>
using namespace std;
using ll = long long; using ull = unsigned long long;
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
template<class T> using V = vector<T>;
template<class T> using VV = vector<V... | 1 | 26,166,565 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if(n < 10){
cout << m + (10 - n)*100 << endl;
}else{
cout << m << endl;
}
} | #include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main() {
int N,R;
cin >> N >> R;
if(N>9) cout << R << endl;
else cout << 100*(10-N)+R << endl;
return 0;
} | 1 | 33,366,810 |
#include <iostream>
using namespace std;
char judge(int mid, int last, int re){
int total;
total = mid + last;
if(mid == -1 || last == -1){
return 'F';
}else if(80 <= total){
return 'A';
}else if(65 <= total && total < 80){
return 'B';
}else if(50 <= total && total < 65){
return 'C';
}else if(30 <= total... | #include <iostream>
using namespace std;
int main(){
int m,n,r;
int result;
while(cin >> m >> n >> r, m >= 0 || n >= 0 || r >= 0){
result=m+n;
if(m == -1 || n == -1)
cout << "F" << endl;
else if(result>=80)
cout << "A" << endl;
else if(result<80 && result>=65)
cout << "B" << endl;
else if(result<6... | 1 | 68,464,676 |
#include <stdio.h>
int main()
{
int n,f=0,s=0,t=0,i;
for(i=0;i<3;i++){
scanf("%d",&n);
if(n>f){
t=s;
s=f;
f=n;
}
else if(n>s){
t=s;
s=n;
}
else t=n;
}
printf("%d %d %d\n",t,s,f);
return 0;
} | #include <iostream>
using namespace std;
int main(){
int x, y, z, t;
cin >> x >> y >> z;
if (x > y) {
t = x;
x = y;
y = t;
}
if (y > z) {
t = y;
y = z;
z = t;
}
if (x > y) {
t = x;
x = y;
y = t;
}
cout << x << " " << y << " " << z << "\n";
return 0;
} | 1 | 21,869,067 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
static const int MAX_H = 2000;
static const int MAX_W = 2000;
static const int INF = 0;
int H, W;
int main(){
cin >> H >> W;
vector<vector<char>> S(H, vector<char>(W));
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) ... | 1 | 2,736,815 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pull = pair<ull, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
int main() {
cin.tie(0);
ios::... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
int n,k,r,s,p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
vector<char> d(n);
rep(i,n){
if(t.at(i) == 'r') d.at(i) = 'p';
... | 1 | 30,225,163 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long ans = 0;
for (int a = 1; a <= n; ++a){
ans += (n-1)/a;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("c.in", "r", stdin);
freopen("c.out", "w", stdout);
#endif
int N, ans = 0;
cin >> N;
for (int i = 1; i <= N; ++i) {
ans += N / i;
if (N % i == 0) --ans;
}
cout << ans << endl;
return 0;
} | 1 | 20,370,333 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <complex>
#include <iomanip>
#... | #include <bits/stdc++.h>
using namespace std;
long long n,a,b;
int main()
{
cin >> n >> a >> b;
if ((b - a) % 2 != 0) cout << "Borys\n";
else cout << "Alice\n";
return 0;
} | 1 | 39,984,274 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int N;
cin >> N;
cout << N * (N + 1) / 2 << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | #include<stdio.h>
int main(){
int n;
scanf("%d", &n);
int tot=0;
for (int i=1; i<=n; i++){
tot+=i;
}
printf("%d\n", tot);
return 0;
} | 1 | 43,084,844 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
... | #include <iostream>
using namespace std;
long long int n, x, cvp;
pair<long long int, long long int> paralel;
int main(){
cin>>n>>x;
cvp=n;
paralel=make_pair(max(n-x, x) , min(n-x, x));
while(paralel.second!=paralel.first&¶lel.second!=0){
cvp+= 2*(paralel.first/paralel.second)*paralel.second;
if(paralel.fir... | 1 | 8,092,392 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i, n)for(int i=0; i<n; i++)
int main(){
int A, B;
cin >> A >> B;
int i;
bool flag;
int ans = 0;
for(int i = A; i<=B; i++){
string str = to_string(i);
flag = 1;
for(int j=0; j<str.size()/... | #include <bits/stdc++.h>
inline bool palindrome(const std::string& s) {
int i = 0;
int j = s.size() - 1;
while (i < j) {
if (s[i++] != s[j--])
return false;
}
return true;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int a =... | 1 | 60,341,068 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
template<class T> inline bool chmax(T& a, T b) { ... | 1 | 72,456,958 |
#include<iostream>
#include<vector>
int main()
{
int H, W;
while (1) {
std::cin >> H >> W;
if (H == 0 && W == 0)break;
for (auto i = 0; i < H; i++) {
for (auto j = 0; j < W; j++) {
if (i == 0 || i == H - 1 || j == 0 || j == W - 1)
std::cout << '#';
else
std::cout << '.';
}
std::cout <... | #include <iostream>
#include <cstdio>
using namespace std;
int W = -1, H = -1;
void fill_chars(char line[], char side, char inside) {
line[0] = side;
for (int i = 1; i < W - 1; i++) {
line[i] = inside;
}
line[W - 1] = side;
}
void print_frame() {
char line[W + 1];
line[W] = NULL;
fil... | 1 | 226,380 |
#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;... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,x;
cin>>N>>x;
if(N*500==x||N*500>x) cout<<"Yes";
else cout<<"No";
return 0;
} | 1 | 50,930,996 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n ;
cin>>n;
int* b = new int[n]();
for(int i=1;i<=n-1;i++)
{
cin>>b[i];
}
ll sum =0;
int* a = new int[n+1]();
a[1] = b[1];
for(int i=2;i<=n-1;i++)
{
a[i] = min( b[i-1] , b[i] )... | # include "bits/stdc++.h"
using namespace std;
#define endl "\n"
typedef long long int ll;
#define f first
#define s second
inline void fastio(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
inline void setPrecision(int n){cout.precision(n);}
#define dbg(x) cerr<<(#x)<<": "<<x<<endl
#define dbgV(x) cerr<<(#x)<... | 1 | 54,891,468 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
map<int,int> m;
rep(i,0,n){
int a;
cin>>a;
m[a]++;
}
int cur=0;
for(auto p:m){
cur+=p.second-1;
}
if(cur%2==0){
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll a;
vector<ll> b(100010);
for (int i=0;i<n;i++) {
cin >> a;
b[a]++;
}
ll k=0;
int r=0;
for (int i=0;i<100010;i++) {
if (b[i]>1) {
if (r==1) b[i]--;
... | 1 | 99,368,991 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
int ans = 0;
for(int i = 0; i < (int)a.size(); ++i)
if(a[i]!=b[i])
ans++;
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ar array
#define AC ios_base::sync_with_stdio(0); cin.tie(NULL);
using namespace std;
const int M = 1e9+7;
const int N = 2*1e5;
string a, b;
int main(){
AC
cin>>a;
cin>>b;
int ans=0;
for(int i=0; i<a.size(); i++){
if(a[i]!=b[i])
... | 1 | 86,144,827 |
#include<iostream>
#include<string>
#include<algorithm>
#define N 1000
int lcs(std::string x, std::string y) {
int c[N + 1][N + 1];
int m = x.size();
int n = y.size();
int maxl = 0;
x = ' ' + x;
y = ' ' + y;
for (int i = 0; i <= m; i++) c[i][0] = 0;
for (int i = 0; i <= m; i++) c[0][i] = 0;
for (int i = 1; i <... | #include <cstdio>
#include <algorithm>
#include <string>
#include <iostream>
#define MAXN 150
#define MAXLEN 1000
using namespace std;
int c[MAXLEN+1][MAXLEN+1];
int getSubsequence(string x, string y){
int i = 0, j = 0;
while (i <= x.length()){
while (j <= y.length()){
if (i == 0 || j ==0){
... | 1 | 87,549,302 |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(_i,_a,_n) for(int _i=_a;_i<=_n;++_i)
#define PER(_i,_a,_n) for(int _i=_... | #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 _ << " " <<
#define sz(x) (int)x.size()
#define pb(x) push_back(x)
#define TRACE(x) cerr << #x << " = " << x << endl
typedef long long ll;
typedef pair<ll, ll> point;
const int off = ... | 1 | 49,542,546 |
#include<cstdio>
#include<iostream>
using namespace std;
typedef long long LL;
const int N = 100009;
LL g[N], cnt, v, vn;
LL n;
int main()
{
std::ios::sync_with_stdio(false);
cin >> n;
for(LL i = 1; i <= n; i++)
cin >> g[i], cnt += g[i];
vn = n * (n + 1) / 2;
if(cnt % vn)
{
puts("NO");
return 0;
}
LL p = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long sum = accumulate(A.begin(), A.end(), 0LL);
long long m = N * (N + 1) / 2;
if (sum % m != 0) {
cout << "NO" << e... | 1 | 25,852,296 |
#include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <climits>
#include <stack>
#include <queue>
#include <set>
#include <cctype>
#include <bitset>
#include <type_traits>
#include <list>
using namespace std;
#define REP(i, n) for (long ... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using names... | 1 | 78,721,627 |
#include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main()
{
int N;
cin >> N;
vector<string> S(N);
vector<int> T(N, 0);
for (int i = 0; i < N; i++)
{
cin >> S[i] >> T[i];
}
string X;
cin >> X;
int index = 0;
for (int i = 0; i < N; i++)
{
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N;
string X;
int i;
cin >> N;
vector<int> t(N);
vector<string> s(N);
for(i = 0; i < N; i++) {
cin >> s[i] >> t[i];
}
cin >> X;
for(i = 0; i < N; i++) {
if(s[i] == X) {... | 1 | 62,388,363 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>
#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include... | #include "iostream"
#include "math.h"
int main()
{
double a, b, C, S, L, h, rad;
std::cin >> a >> b >> C;
rad = C / 180.0 * 3.14159265358979;
S = ((a * b) * sin(rad)) / 2;
L = a + b + sqrt((a*a) + (b*b) - (2 * a * b * cos(rad)));
h = b * sin(rad);
std::cout << std::fixed << S << std::endl << std::fixed << L << s... | 1 | 45,416,555 |
#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;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srep... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
typedef tuple<ll, int, int, int> t;
int main() {
auto compare = [](t a,t b) {
return get<0>(a)<get<0>(b);
};
priority_queue<t, vector<t>, decltype(compare)> q(compare);
int x, y, z, K, e, ... | 1 | 10,233,114 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int cnt = 0;
rep(i, S.siz... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
ll b_cnt = 0;
ll ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'B') {
b_cnt++;
} else {
ans += b_cnt;
}
}
cout << ans << endl;
} | 1 | 66,481,517 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | 1 | 50,832,324 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.