code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
#include<deque>
#include<bitset>
using namespace std;
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(... | #include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define REP(i, n) for(int i = 0;i < (n);i++)
#define lint long long
const lint mod=1e9+7;
const lint inf=2.19e15+1;
const long double eps=1e-10;
template <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return fals... | 1 | 98,450,673 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
double ans = 0;
for(int i = 0; i < n; ++i){
double x;
string s;
cin >> x >> s;
if(s == "BTC") x *= 380000.0;
ans += x;
}
cout << fixed << setprecision(8) << ans << endl;
} | 1 | 26,145,216 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end())
#define vecmin(A) *min_element(A.begin(),A.end())
#define vecmax(A) *max_element(A.begin(),A.en... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a = 0, b = 0, c = 0, d = 0;
int n[4];
cin >> n[0] >> n[1] >> n[2] >> n[3];
for(int i = 0; i < 4; i++){
if(n[i] == 1) a++;
else if(n[i] == 9) b++;
else if(n[i] == 7) c++;
else if(n[i] == 4) d++;
}
if(a == 1 && b == 1 && c == 1 && d ... | 1 | 19,110,866 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
typedef long long ll;
ll a[N],b[N];
int n;
ll sum1,sum2;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%lld",a+i);
for(int i=1;i<=n;i++)scanf("%lld",b+i);
for(int i=1;i<=n;i++){
if(a[i]>b[i])sum1+=(a[i]-b[i]);
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
int main(){
int N;
cin>>N;
vector<ll> a(N),b(N);
for(int i=0;i<N;i++){
cin>>a.at(i);
}
for(int i=0;i<N;i++){
cin>>b.at(i);
}
ll a_count=0,b_count=0;
for(int i=0;i<N;i++){
if(a.at(i)>b.at(i)){
b_c... | 1 | 3,377,003 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string az="abcdefghijklmnopqrstuvwxyz";
string s;
cin >> s;
sort(s.begin(),s.end());
int i=0,j=0;
for(int j=0;j<s.length();j++) {
if(az[i]==s[j]) {
i++;
}
if(i==26) {
cout << "None" << endl;
return 0;
}
}
co... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (char c='a'; c<='z'; c++) {
if (s.find(c) == string::npos) {
cout << c << endl;
return 0;
}
}
cout << "None" << endl;
} | 1 | 4,845,566 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
int64_t INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t n;
cin >> n;
vi a(n);
rep(... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
ll x;
... | 1 | 63,779,071 |
#include <iostream>
#include <map>
int f(int n)
{
return n % 2 == 0 ? n / 2 : 3 * n + 1;
}
int main()
{
int s;
std::cin >> s;
std::map<int, int> mp;
int i;
for (i = 1; i <= 1000000; i++) {
if (mp.count(s)) {
break;
}
mp[s];
s = f(s);
}
std::cout << i << std::endl;
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
using namespace std;
using P = pair<int,int>;
int main(){
int s;
cin >> s;
int ans = 0;
vector<int> vec(10... | 1 | 67,397,948 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int main(){
int i,n,x=100000;
cin >> n;
for(i=0;i<n;i++){
x*=1.05;
if(x%1000!=0) x=(x/1000+1)*1000;
}
cout << x << endl;
return 0;
} | #include<stdio.h>
int main(){
int n;
int ans=100000;
scanf("%d",&n);
for(int i=0;i<n;i++){
ans=ans*1.05;
if(ans%1000>1){
ans=ans+1000-ans%1000;
}
}
printf("%d\n",ans);
return 0;
} | 1 | 88,475,494 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef ... | #include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
int main()
{
int i,j;
int n;
int ans;
char a[3],b[3];
while(1)
{
scanf("%d",&n);
if(n==0){break;}
else
{
ans=0;
for(i=0;i<(n/2);i++)
{
scanf("%s %s",a,b);
if((a[0]!=b[0])&&(a[1]==b[1]))
{
... | 1 | 49,926,513 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
... | #include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
ll n;
cin >> n;
vector<ll> d(n);
rep(i, n) cin >> d... | 1 | 9,456,811 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
bool a=false;
if(s.at(2)==s.at(3)&&s.at(4)==s.at(5)){
a=true;
}
if(a){
cout<<"Yes"<<endl;
}
else {
cout<<"No"<<endl;
}
} | #include <iostream>
#include <string.h>
using namespace std;
int main()
{
string s;
cin>>s;
int l=s.length();
if(s[2]==s[3]&&s[4]==s[5])
cout<<"Yes";
else
cout<<"No";
return 0;
} | 1 | 14,133,175 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | #include <iostream>
#include <vector>
using namespace std;
void print(vector<vector<int>> &A, int n)
{
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (j > 0) cout << " ";
cout << A[i][j];
}
cout << endl;
}
}
int main()
{
int n;
cin >> n;
... | 1 | 51,332,622 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
ll output = 0;
ll now = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'B') {
now++;
} else {
output += now;
}
}
cout << output << endl;... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string S;
cin >> S;
long long white_num = 0;
long long count = 0;
for(int i = 0; i < (int)S.size(); i++){
if(S[i] == 'W'){
count += i - white_num;
white_num++;
}
}
... | 1 | 87,223,985 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main(){
double a,b,c,cr,S,L,h;
cin >> a >> b >> c;
cr = c*3.1415926535/180;
h = b*sin(cr);
S = a/2.0*b*sin(cr);
L = a+b+sqrt(a*a+b*b-2.0*a*b*cos(cr));
printf("%f\n",S);
printf("%f\n",L);
printf("%f\n",h);
return 0;
} | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main( void) {
double a, b;
double C;
double PI = acos(-1);
double rad;
double S, L, h;
cin >> a >> b >> C;
rad = ( C * PI) / 180;
h = b * sin( rad);
S = ( a * b * sin( rad)) /2;
L = a + b + sqrt( pow( a, 2) + pow( b, 2) - 2... | 1 | 63,700,430 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef int_fast64_t ll;
constexpr int buff_size = 1 << 21;
char buff[buff_size], *ci, ct;
int A;
inline int readint() {
A = 0;
while ((ct = *ci++) >= '0') A ... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(n);++i)
#define per(i, n) for(int i=(n)-1;i>=0;--i)
#define repa(i, n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x)... | 1 | 66,478,892 |
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 1 | 65,910,800 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m, sum = 0;
cin >> n >> m;
rep(i, m) {
int x;
cin >> x;
sum += x;
}
if (sum > n) cout << -1 << endl;
else cout << n - sum << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int val,n;
cin>>val>>n;
int ans=0;
while(n--)
... | 1 | 55,008,421 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 1 | 70,223,529 |
#include<bits/stdc++.h>
using namespace std;
int main()
{ int a,b;
cin>>a>>b;
int r=abs(a-b);
int k=0;
if(a<b)
k=2*a+2*r;
else
k=2*b+2*r;
if(k<=16)
cout<<"Yay!";
else
cout<<":(";
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(max(a,b)<=8){
cout << "Yay!" << endl;
}else{
cout << ":(" << endl;
}
} | 1 | 95,439,958 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <iostream>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define INF 999999999
int main() {
int n; cin >> n;
int p[n + 1], m[n][n];
REP(i, n) {
cin >> p[i] >> p[i + 1];
}
REP(i, n) m[i][i] = 0;
FOR(l,... | 1 | 77,864,342 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(pos,mp) for(ll pos=mp.begin();pos!=mp.end();pos -++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | #include<bits/stdc++.h>
using namespace std;
#define V vector
typedef long long ll;
typedef unsigned long long ull;
typedef V<int> vi;
typedef V<ll> vll;
typedef V<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define f(i,a) for(int i = 0 ; i < a ; i++)
#define fll(i,a) for(ll i = 0 ; i < a ;i++)
#d... | 1 | 64,566,199 |
#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 n, len;
cin >> n;
int x[n];
rep(i,n) cin >> x[i];
cin >> len;
int p = 1;
int s = 0;
while(p <= n) {
p *= 2;
s++;
}
vector<vector<int>> dp(n+1,vector<int>(s));
... | #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;
constexpr int INF = 2e9 + 1;
int main() {
int n, l, q;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
cin >> l >> q;
vector<vector<int>> to(32, vector<int>(n, 0));
... | 1 | 59,602,892 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
int N, Q; cin >> N >> Q;
vector<int> con... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include <iomanip>
#include<utility>
us... | 1 | 6,697,738 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main() {
i... | #include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int M = max(max(a, b), c);
if(M == a){
cout << a*10 + b + c << endl;
}else if(M == b){
cout << M*10 + a + c << endl;
}else{
cout << M*10 + a + b << endl;
}
return 0;
} | 1 | 5,674,932 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int min1 = min(a, b);
int min2 = min(c, d);... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a < b) {
if (c < d)
cout << a + c << "\n";
else
cout << a + d << "\n";
} else {
if (c < d)
cout << b + c << "\n";
else
cout... | 1 | 33,973,783 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N;
cin>>N;
int H[N];
rep(i,N){
cin>>H[i];
}
int MAX=0;
int cnt=0;
rep(i,N){
MAX=max(MAX,H[i]);
if(H[i]==MAX){
cnt++;
}
}
cout<<cnt<<endl;
... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int ok=0,c=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<i;j++)
{
if(a[i]<a[j])
{
ok=1;
break;
}
}
if(ok==0)
{
c++;
}
else
{
ok=0;
}
... | 1 | 8,729,419 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Hea... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
bool is_palindrome(string str){
string rstr = str;
reverse(str.begin(), str.end());
return rstr == str;
}
int main(){
int A, B, ans = 0;
cin >> A >> B;
for (int i = A; i <= B; i++){
if (is_palindrome(to_string(i))) ans++;
... | 1 | 52,555,515 |
#include <bits/stdc++.h>
void solve(std::vector<std::string>& s)
{
std::sort(s.begin(), s.end());
std::cout << std::accumulate(s.begin(), s.end(), std::string()) << '\n';
}
int main()
{
size_t n, l;
std::cin >> n >> l;
std::vector<std::string> s(n);
for (size_t i = 0; i < n; ++i)
std::ci... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,l;
cin>>n>>l;
vector<string>v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
sort(v.begin(),v.end());
string t = "";
for(int i=0;i<n;i++){
t+=v[i];
}
cout<<t<<endl;
} | 1 | 78,647,715 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); ++i)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
string s;
cin >> s;
s[5] = s[13] = ' ';
cout << s << '\n';
}
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie... | 1 | 44,018,714 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i,n) for(long long i=0;i<n;++i)
#define REPR(i,n) for(long ... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | 1 | 78,526,611 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
vector<string> s(h);
for(int i=0;i<h;i++)
{
cin >> s.at(i);
}
string ans = "Yes";
for(int i = 0;i<h;i++)
{
for(int j = 0;j<w;j++)
{
int z1=0,z2=0,z3=0,z4=0;
char nw = s.at(i).at(j);
if(nw == '.')
{
continue... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl
#define first(v) get<0>(v)
#define second(v) get<1>(v)
#def... | 1 | 57,068,439 |
#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;
vector<bool> found(26, false);
rep(i, s.size()) found[s[i] - 'a'] = true;
int a = -1;
rep(i, 26) if (found[i] == false) {
a = i;
... | #include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#define int long long
using namespace std;
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout <... | 1 | 1,306,665 |
#include<iostream><string>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
string S;
cin>>S;
for(int i=0;i<=A+B;i++){
if(i==A){
if(S[i]!='-'){
cout<<"No";
return 0;
}
}
else{
if(S[i]=='0'||S[i]=='1'||S[i]=='2'||S[i]=='3'||S[i]=='4'||S[i]=='5'||S[i]=='6'||S[i]... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#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++)
int main() {
int A, B;
string S;
cin >> A >> B >> S;
int co = 0;
rep(i, A + B + 1) {
if(i == A) {
... | 1 | 54,258,106 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include "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 | 75,164,553 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << " : " << (x) << std::endl;
int dx... | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int d;
cin >> d;
cout << "Christmas";
for (int i = 0; i < 25 - d; ++i) cout << " Eve";
cout << '\n';
return 0;
} | 1 | 93,654,917 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n; cin >> n; int a[n];
int ans = 100000; int total = 0;int total1 = 0;
... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
int n;
cin >> n;
int w[n];
int right = 0,left = 0;
for(int i=0;i<n;i++){
cin >> w[i];
right += w[i];
}
int ans = right;
for(int i=0;i<n-1;i++){
left += w[i];
right -= w[i];
ans = min(ans,abs(right - left));
}
cout << ans <... | 1 | 66,629,045 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[4];
scanf("%d %d %d %d", &a[0], &a[1], &a[2], &a[3]);
sort(a, a + 4);
if(a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9) puts("YES");
else puts("NO");
return 0;
} | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utili... | 1 | 21,033,931 |
#include<iostream>
using namespace std;
int main(){
int before, after;
cin >> before >> after;
cout << after*2 - before << endl;
} | #include<iostream>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, m; cin >> n >> m;
int averge = m * 2 - n;
cout << averge << endl;
return 0;
} | 1 | 95,895,288 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int byk=0;
for(int i=0;i<s.length();i++){
byk+=(s[i]-'0');
}
if(byk%9==0)puts("Yes");
else puts("No");
return 0;
} | #include<iostream>
#include<algorithm>
#include<cmath>
#include<chrono>
#include<vector>
#include<string>
#include<cstring>
#include<iomanip>
using namespace std;
using namespace std::chrono;
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long
#define mod 1000000007
#define fr(i,n) for(in... | 1 | 66,397,872 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
set<char> s;
for (int i = 0; i < 3; i++)
s.insert(S[i]);
if (s.size() == 3)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | 1 | 35,769,975 |
#include<stdio.h>
#include <string.h>
#include <string>
#include <iostream>
using namespace std;
int main(){
string t, h;
int n,i,tp=0,hp=0;
scanf("%d",&n);
for(i=0;i<n;i++){
cin >> t >> h;
if(t>h)tp+=3;
else if(t<h)hp+=3;
else {
tp+=1;
hp+=1;
}
}
printf("%d %d\n",tp,hp);
return 0;
} | #include<string>
#include<iostream>
using namespace std;
int main(){
string ab,bc,cd=" ";
int k,t=0,h=0;
cin>>k;
for(int n=0;n<k;n++){
cin>>ab>>bc;
if(ab==bc){
t=t+1;
h=h+1;
}else if(ab>bc){
t=t+3;
}else{
h=h+3;
}
}
cout<< t << cd ... | 1 | 56,024,049 |
#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;
int i=0;
bool p=false;
while(7*i<=n){
if((n-7*i)%4==0){
p=true;
}
i++;
}
if(p) cout<<"Yes"<<endl;
else cout<<"No... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int abs(int x){
if(x<0) return -x;
else return x;
}
int main() {
int n;
cin>>n;
bool ok=false;
for(int i=0;i<30;i++){
for(int j=0;j<30;j++){
int total= 4*i+7*j;
if(total == n) ok=t... | 1 | 90,386,454 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #include <bits/stdc++.h>
using namespace std;
bool answer(string &s){
if(s=="") return true;
int l=s.size();
if(s.at(l-1)=='m'&&s.at(l-2)=='a'&&s.at(l-3)=='e'&&s.at(l-4)=='r'&&s.at(l-5)=='d') return answer(s.erase(l-5));
if(s.at(l-1)=='e'&&s.at(l-2)=='s'&&s.at(l-3)=='a'&&s.at(l-4)=='r'&&s.at(l-5)=='e') return a... | 1 | 50,411,711 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(false);
string S, T; cin >> S >> T;
int l = S.size();
int notmatch = 0;
for(int i=l-1; i>=0; i--){
notmatch = 0;
for(int j=0; j<l; j++){
int pos = i+j;
if(pos >= l) pos -=l;
if(S[pos] != T... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
bool ans = false;
for (int i = 0; i < s.size(); i++) {
if (s == t) {
ans = true;
break;
}
s = s.back() + s.substr(0, s.size()-1);
}
if (ans) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 77,188,206 |
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef _DEBUG
freopen("_in" , "r", stdin );
freopen("_out", "w", stdout);
#endif
int n; cin >> n;
string s; cin >> s;
s = '$' + s;
int ans = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) ans++;
}
cout << ans << '\n';
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n;
cin >> n;
string s;
cin >> s;
string ans;
rep(i, n-1) {
if(s[i] != s[i+1]) ans+=s... | 1 | 53,719,560 |
#include<iostream>
#include<vector>
std::vector<int> vec;
int x;
int n=1;
int main(){
do{
std::cin>>x;
vec.push_back(x);
}while(x!=0);
for(auto l:vec){
if(l!=0)std::cout<<"Case "<<n<<": "<<l<<std::endl;
++n;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> x;
int i = 0, n;
while (1) {
cin >> n;
x.push_back(n);
if(x[i] == 0) break;
i++;
}
for(i = 0; i < x.size(); i++) {
if(x[i] == 0) break;
cout << "Case " << i+1 << ": " <... | 1 | 95,365,609 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using li = long long int;
using uli = unsigned long long int;
using namespace std;
int main() {
fastIO;
int n, m;
cin >> ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n,m;
cin>>n>>m;
int sm = 0;
for(int i = 0; i < m; i++){
int t;cin>>t;
sm+=t;
}
cout<<((n-sm)<0?-1:(n-sm));
} | 1 | 84,642,955 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int p = n;
int sum = 0;
while (p > 0) {
sum += p % 10;
p = p / 10;
}
if (n % sum == 0) {
cout << "Yes";
}else {
cout << "No";
}
} | #include <iostream>
#include <string>
int decimal(int a){
int ans = 0;
while(a > 0) {
ans += a % 10;
a = a / 10;
}
return ans;
}
int main () {
int x;
std::string ans = "No";
std::cin >> x;
int fx = decimal(x);
if(x % fx == 0) ans = "Yes";
std::cout << ans << std::endl;
} | 1 | 15,174,561 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
string s;
cin>>n>>s;
vector<bool>ok(n);
string t=s;
rep(f,4){
f%2==1?t[0]='S':t[0]='W';
f>=2?t[1]='S':t[1]='W';
for(i... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<math.h>
using namespace std;
#define mod (1000000000+7)
#define N (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
bool ani[200010];
int n;
string s;
v... | 1 | 77,246,464 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define FOR(i, a, b) for(ll i=(a); i < (ll)(b); ++i)
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... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define FILL0(x) memset(x,0,sizeof(x))
#define FILL1(x) memset(x,-1,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | 1 | 80,259,427 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define deb(name,value) cout <<"->> "<<name<< "= " <<value<<" "
#define frepi(a,b,k) for(int i=a;i<=b;i+=k)
#define frepj(a,b,... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin>>s>>t;
cout<<t+s;
} | 1 | 22,889,429 |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define change(a,b) do{ll c=a; a=b; b=c;}while(0)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
while(true){
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define int long long int
#define double long double
#define inf (int)(1e15)
#define all(x) (x).begin(), (x).end()
#define pair pair<int, int>
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vect... | 1 | 29,456,651 |
#include<iostream>
using namespace std;
int main(){
int H,W;
while(1) {
cin >> H >> W;
if (H == 0 && W == 0) break ;
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)) {
cou... | #include <cstdio>
using namespace std;
int main() {
int H,W;
while(1) {
scanf("%d%d",&H,&W);
if (H==0 && W==0) break;
for(int j=0;j<H;++j) {
for(int i=0;i<W;++i) {
if(j==0 || i==0 || j==H-1 || i==W-1) {
printf("#");
} else {
printf(".");
}
}
printf("\n");
}
printf("\n");
}
r... | 1 | 44,573,790 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <random>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int gcd(int a, int b) {
if (a > b) {
ll tmp = b;
b = a;
a = tmp;
}
int r = b % a;
while (r != 0) {
b... | 1 | 53,467,797 |
#include<iostream>
using namespace std;
int main()
{
string s;
long long k,n,l=0,ans=1;
cin>>n;
cin>>s;
n*=2;
for(int i=0;i<n;i++)
{
k=l%2;
if(i>0 &&i<=n/2)
{
ans*=i;
ans%=1000000007;
}
if((s[i]=='B' && k==1) || (s[i]=='W' && k==0))
{
ans*=l;
ans%=1000000007;
l--;
}
else
l++;
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <numeric>
using namespace std;
typedef long... | 1 | 15,620,247 |
#include<bits/stdc++.h>
using namespace std;
long long d[200][200];
void warshall_floyd(int n) {
for (int k = 0; k < n; k++){
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
int main(){
for(int i=0;i<200;++i)... | #include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
#define MOD (ll)1000000007
#define PI 3.14159265359
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "... | 1 | 95,717,923 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
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 (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | 1 | 97,506,646 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long n, m;
cin >> n >> m;
vector<pair<long,long>> s(n);
rep(i, n) {
cin >> s[i].first >> s[i].second;
}
sort(s.begin(), s.end());
long k = 0, sum = 0, i = 0;
while (k < m) {... | 1 | 93,644,408 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | 1 | 61,398,421 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec={0,0,0,0};
int p;
for(int i=0;i<6;i++){
cin>>p;
vec.at(p-1)++;
}
sort(vec.begin(),vec.end());
if(vec.at(0)==1&&vec.at(1)==1&&vec.at(2)==2&&vec.at(3)==2){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
} | # include <bits/stdc++.h>
using namespace std;
vector < int > adj[5];
int main() {
int cnt1 = 0, cnt = 0;
for ( int i = 0; i < 3; i++ ) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for ( int i = 1; i <= 4; i++ ) {
if ( (int)adj[i].size() == 1 ) cnt1++;
else if ( (int)adj[i].siz... | 1 | 38,070,272 |
#include<cstdio>
#include<algorithm>
using namespace std;
int digit[5];
int main() {
for (int i = 0; i < 5; i++) {
scanf("%d", &digit[i]);
}
sort(digit, digit+5);
for (int i = 4; i> -1; i--) {
if (i == 0) {printf("%d\n", digit[i]);}
else {printf("%d ", digit[i]);}
}
retur... | #include<iostream>
#include<queue>
#include<cstdio>
using namespace std;
int main(){
int i,a;
priority_queue<int> q1;
for(i=0;i<5;i++){
cin>>a;
q1.push(a);
}
for(i=0;i<5;i++){
a=q1.top();
q1.pop();
printf("%d%c",a,i==4?'\n':' ');
}
return 0;
} | 1 | 59,719,716 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while(getline(cin, s), s != ".") {
bool find = true;
string world = "";
for(int i = 0; i < s.size(); ++i) {
switch(s[i]) {
case '(':
case ')':
case '[':
... | #include <iostream>
#include <string>
#include <stack>
#include <algorithm>
using namespace std;
int main()
{
string s;
while( getline( cin, s ) ) {
if ( s == "." )
break;
bool b = true;
stack<char> t;
t.push( '\0' );
for( auto c : string( s.cbegin(), s.cbegin... | 1 | 60,553,228 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
string s;
int w;
cin>>s>>w;
for(i=0;i<s.length();i+=w){
cout<<s[i];
}
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | 1 | 74,717,114 |
#include<bits/stdc++.h>
using namespace std;
const int N = 25, M = 50010;
const int INF = 0x3f3f3f3f;
int W, n;
int w[N];
int dp[N][M];
int main(){
scanf("%d %d", &W, &n);
for(int i = 0; i < n; i++) scanf("%d", &w[i]);
for(int j = 0; j <= W; j++) dp[0][j] = INF;
for(int i = 0; i < n; i++) dp[i][0] = 0;
... | #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#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)... | 1 | 43,560,518 |
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | #include <iostream>
int main(void){
int d;
std::string O, E;
std::cin >> O >> E;
d = O.size() - E.size();
for (int i=0; i<O.size(); ++i){
if (d == 1 && i == E.size()){
std::cout << O.at(i);
} else {
std::cout << O.at(i) << E.at(i);
}
}
std::cou... | 1 | 25,812,166 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s,t;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef map<int, int> mii;
typedef vector<char> v... | 1 | 79,399,152 |
#include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const ll MOD = 998244353;
int main... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 998244353;
ll pow_mod(ll a, ll n, ll p)
{
ll res = 1;
while(n > 0){
if(n & 1) res = res*a%p;
a = a*a%p;
n >>= 1;
}
return res... | 1 | 26,977,973 |
#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(){
string a,b;
cin>... | #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... | 1 | 58,578,244 |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(x) ll((x).size())
#define all(v) (v).begin(),(v).end()
#define trace(x) cerr << #x << " = " << x << endl
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define For(i,a,b) for(ll i = ll(a); i < ll(b);... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | 1 | 73,723,860 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A , B;
cin >> A >> B;
cout << (A+B-1)/2+1 << endl;
} | #include <bits/stdc++.h>
#include <climits>
#include <math.h>
using namespace std;
int main(){
double A, B;
int iAVE;
double AVE;
cin >> A >> B;
AVE=(A+B)/2;
iAVE = ceil(AVE);
cout << iAVE << endl;
} | 1 | 88,074,505 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | #include <map>
#include <set>
#include <list>
#include <cstdio>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <algorithm>... | 1 | 25,951,320 |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int maxn = 100005;
struct Edge
{
int to, nxt;
} e[maxn << 1];
int first[maxn];
inline void add_edge(int from, int to)
{
static int cnt = 0;
e[++cnt].nxt = first[from];
first[from] = cnt;
e[cnt].to = to;
e[++cnt].nxt = first[to];
... | #include <bits/stdc++.h>
#define N 100005
#define ll long long
#define For(i,x,y) for(int i=(x);i<=(y);++i)
#define Rof(i,x,y) for(int i=(x);i>=(y);--i)
#define Edge(x) for(int i=head[x];i;i=e[i].nxt)
#define mset(x,y) memset(x,y,sizeof(x))
#define strL strlen
#define p_b push_back
#... | 1 | 48,561,531 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n,T[100]; cin>>n;
double V[100];
rep(i,n) cin>>T[i];
rep(i,n) cin>>V[i];
int t=0;
double vl[40001],vr[40001];
vl[0]=0;
rep(i,n) rep(j,2*T[i]) {
vl[t+1]=min(vl[t]+0.5,V[i]);
t++;
}
vr[t]=0;
for(int i=n-1;... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 1 | 51,647,136 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<list>
#include<stack>
using namespace std;
#define ll long long
#define dd cout<<endl
const long long int inf = 1e18+7;
const int mod = 998244353;
using namespa... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
#define I_AM_SPEED ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define printclock cerr <<"Time : "<<(double)clock()/(double)CLOCKS_PER_SEC<<" sec\n";
#define mp(a , b) make_pair(a , b)
#define eb(a) emplace_back(a)
#define SZ(... | 1 | 14,914,626 |
#include <stdio.h>
int main(){
int a, p, total;
scanf("%d %d", &a, &p);
printf("%d", total = ((a*3)+p)/2);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a,p;
cin >> a >> p;
int c;
c=(3*a+p)/2;
cout << c << endl;
return 0;
} | 1 | 85,161,702 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
char ch;
cin>>a>>ch>>b;
switch(ch)
{
case '+':
cout<<a+b;
break;
case'-':
cout<<a-b;
break;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a,b;
char op;
cin >> a >> op >> b;
if(op == '+') cout << a + b << endl;
else cout << a - b << endl;
return 0; ... | 1 | 37,906,005 |
#include <cmath>
#include <iostream>
#include <list>
#include <map>
typedef std::pair<double,double> TPoint;
TPoint GetLeft(TPoint Left,TPoint Right)
{
return std::make_pair((Left.first * 2 + Right.first) / 3,(Left.second * 2 + Right.second) / 3);
}
void Turn(TPoint& Vector)
{
double X = (Vector.first - (std::sqrt)(3... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> p... | 1 | 49,782,893 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define MOD 1e9+7;
using namespace std;
using ll = long long;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a % 2 == b % 2) cout << "Alice";
else cout << "Borys";
return 0;
} | 1 | 51,565,095 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
#include <string.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef pa... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define all(obj) obj.begin(), obj.end()
#define db(x) cerr << #x << ":" << x << " "
#define dbl(x) cerr << ... | 1 | 94,977,989 |
#include <iostream>
#include <string>
#include <stack>
#include <algorithm>
using namespace std;
int main()
{
string s;
while( getline( cin, s ) ) {
if ( s == "." )
break;
bool b = true;
stack<char> t;
t.push( '\0' );
for( auto c : string( s.cbegin(), s.cbegin... | #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#include<c... | 1 | 34,497,549 |
#include<iostream>
using namespace std;
int main(void){
int w,h,x,y,r;
cin>>w>>h>>x>>y>>r;
if(w>=x+r&&h>=y+r&&x>0&&y>0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int w,h,x,y,r;
cin>>w>>h>>x>>y>>r;
if(x-r<0||x+r>w){
cout<<"No"<<endl;
}
else{
if(y-r<0||y+r>h){
cout<<"No"<<endl;
}
else{
cout<<"Yes"<<endl;
}
}
} | 1 | 2,859,937 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long m,n;
cin>>n>>m;
vector<long long> v(n+1);
v[0]=0;
for(int i=0;i<n;i++){
cin>>v[i+1];
}
for(int i=0;i<n;i++){
v[i+1]+=v[i];
}
for(int i=0;i<=n;i++){
v[i]=v[i]%m;
}
sort(v.begin(),v.end()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M;
cin >> N >> M;
map<ll, ll> dict;
dict.insert(make_pair(0, 1));
ll sum = 0;
for (ll i = 0; i < N; ++i) {
ll ai;
cin >> ai;
sum += ai;
ll mod = sum % M;
if (dict.find(mod) == dict.end()) {
dict.... | 1 | 53,634,984 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i < n; i++) {
cout << s.at(i) << t.at(i);
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const ll INF = 1LL<<60;
int main(){
int n;
cin>>n;
string s, t;
cin >> s >> t;
rep(i,n){
cout << s[i] << t[i];
}
cout << endl;
} | 1 | 64,662,182 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector< pair<int,int> > vii;
const double pi = 2*acos(0) ;
#define pf printf
#define sf scanf
#define pb(a) push_back(a)
#define mp make_pair
#define ff ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define foi(i,k,n) for(int i=(k); i<(int)(n); i+=1)
#define fod(i,n,k) for(int i=k; i>=(int)n; i-=1)
#d... | 1 | 297,387 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | #define ALGORITHM 0
#define CLIMITS 0
#define CMATH 0
#define DEQUE 0
#define LIST 0
#define MAP 0
#define QUEUE 1
#define SET 0
#define DP 0
#define DIRECTIONS 0
#define _GLIBCXX_DEBUG
#include <iostream>
#include <string>
#include <utility>
#include <vector>
us... | 1 | 32,506,343 |
#include<stdio.h>
int h,w,d;
char c[9]="RGBY";
int calc(int x){
x %= (2*d);
if(x < 0)x += 2*d;
return x / d;
}
int main(){
scanf("%d%d%d",&h,&w,&d);
for(int i=0; i<h; i++,puts(""))
for(int j=0; j<w; j++)
putchar(c[calc(i+j)*2+calc(i-j)]);
return 0;
} | #include<cstdio>
int h,w,d;
int main()
{
scanf("%d%d%d",&h,&w,&d);
for(int i=0;i<h;i++,puts(""))
for(int j=0;j<w;j++)putchar("RGBY"[(i+j)/d%2*2+(i>=j?(i-j)/d%2:(j-i+d-1)/d%2)]);
return 0;
} | 1 | 53,820,460 |
#include<iostream>
#include<stack>
using namespace std;
stack <int> st;
void enter(int car) {
st.push(car);
}
void exit() {
cout << st.top() << endl;
st.pop();
}
int main() {
int car;
while (cin >> car) {
if (car == 0) {
exit();
} else {
enter(car);
}
}
} | #include <iostream>
#include <stack>
#include <vector>
using namespace std;
int main(){
vector<int> v;
stack<int> s;
int n;
cin >> n;
s.push(n);
while(cin>>n){
if(n==0){
v.push_back(s.top());
s.pop();
} else {
s.push(n);
}
}
for(int i=0 ; i<v.size(); i++){
cout << v[i] << endl;
}
return 0;
} | 1 | 14,536,812 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
typedef long long ll;
const int MOD = 1000000007;
const int BASE = 27;
const int oo = 1e9;
const double EPS = 1e-9;
const int MX = 1e5+1;
ll f(ll a , ll b){
if(a>b)swap(... | 1 | 87,226,609 |
#include <bits/stdc++.h>
#include <iostream>
#include <set>
using namespace std;
typedef pair <long long,long long> pii;
int N;
pii arr[100005];
long long val[100005];
multiset <long long> larger;
multiset <long long>::iterator it;
struct quad{
long long l, ll, r, rr;
};
quad neighbouring[100005];
int main() {
... | #include <algorithm>
#include <iostream>
#include <set>
#include <tuple>
#include <unordered_map>
#include <vector>
using std::set;
using std::multiset;
using std::tuple;
using std::vector;
using std::unordered_map;
int64_t mul(int a, int b)
{
return static_cast<int64_t>(a) * static_cast<int64_t>(b);
}
int64_t solve(i... | 1 | 71,239,610 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
int min = 1000000000, max = 1;
for (auto e : A) {
if (e < min) min = e;
if (e > max) max = e;
}
cout << max - min << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n; cin >> n;
vector<ll> a(n);
for(int i=0; i<n; i++) cin >> a[i];
ll ans = 0;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(ans < abs(a[i] - a[j])) ans = abs(a[i] - a[j]);
}
}
... | 1 | 53,413,910 |
#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
long long int solve(int n)
{
long long a[n+1];
a[0]=2,a[1]=1;
for(int i=2;i<=n;i++)
a[i]=a[i-1]+a[i-2];
return a[n];
}
int n;
int main()
{
ios::sync_with_stdio(false);
cin.tie... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
using namespace std;
int main() {
int n;
long L,L1 = 1,L2 = 2;
cin >> n;
L = L1 + L2;
for(int i = 2; i < n; i++) {
L2 = L1;
L1 = L;
L = L1 + L2;
}
if(n == 1) L = 1;
cout... | 1 | 13,459,628 |
#include <iostream>
#include <queue>
#include <set>
#include <list>
#include <deque>
#include <vector>
#include <map>
#include <utility>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <iterator>
#define ll long long
#define pb push_back
#define pf push_front
#define ppb pop_back
#def... | #include<bits/stdc++.h>
using namespace std;
#define rush ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define FOR(a,x,n) for(ll a=x;a<n;a++)
#define ROF(a,x,n) for(ll a=x;a>=n;a--)
#define pb push_back
#define lb lower_bound... | 1 | 84,893,666 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
u... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
cin >> A >> B;
if (A.size() < B.size()) {
cout << "LESS" << endl;
}
else if (A.size() > B.size()) {
cout << "GREATER" << endl;
}
else {
for (int i = 0; i < A.size(); i++) {
if (A.at(i) == B.at(i) && i < A.size() - 1) {
continue;... | 1 | 83,122,123 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<double,double> pd;
typedef vector<... | #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;
#define Mod 1000000007
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
#define INF 123456789012
void so... | 1 | 61,275,619 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
const long dou... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a,b;
cin >> a >> b;
string ans="";
int al=a.size(),bl=b.size();
int n=al+bl;
int ai=0,bi=0;
for ( int i=1; i<=n; i++ ) {
if ( i%2 ) {
ans+=a[ai++];
} else{
ans+=b[bi++];
}
}
cout << ans << '\n';
return 0;
} | 1 | 49,726,265 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
typedef long long ll;
#define MAX_N 100'001
using namespace std;
int A[MAX_N];
int B[MAX_N];
int main() {
int N;
cin >> N;
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
ll cnt = 0;
for (int i... | 1 | 45,119,512 |
#include <iostream>
#include <queue>
#define min(x,y) ((x)<(y)?(x):(y))
#define INFI 100000000
using namespace std;
typedef pair<int, int> P;
int Strength = 1;
char Maps[1010][1010];
int dist[1010][1010];
int H, W, N;
int hor[] = {1,0,-1,0};
int ver[] = {0,-1,0,1};
int ans;
void clear();
void show();
P bfs(int cheese,P... | #include<cmath>
#include<vector>
#include<queue>
#include<iostream>
#include<algorithm>
#define debug(ARGS) cout << #ARGS << ": " << ARGS << endl;
#define ll long long
#define INF (int)1e7
#define p pair<int, int>
#define F 0
#define X -1
#define S -2
using namespace std;
int convert(char c){
int ret;
if('1' <= c &... | 1 | 598,900 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int imos[86410] = {};
for (int i = 0; i < n; i++) {
int a, b, c, d, e, f; char ch;
cin >> a >> ch >> b >> ch >> c;
cin >> d >> ch >> e >> ch >> f;
imos[a * 3600 + b * 60 + c]++;
imos[d * 3600 + e *... | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) !=... | 1 | 31,832,562 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const ll MOD = 1000000007;
const ll N=1e5+9;
int main()
{
FASTINOUT;
ll x,k;
cin>>x>>k;
ll m=(x-1)*(x-2)/2;
if (m<k)
{
cout<<-1<<endl;
... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | 1 | 92,821,487 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll n; cin >> n;
vector<ll> a(n), b(n);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll ZERO = 0;
const int Inf = 1000000000;
const ll INF= 1e18;
const ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
int main() {
int N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
for(int i = 0;i <... | 1 | 28,043,172 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.