code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
#include <cmath>
using namespace std;
#define NUM 600
int main(){
long n;
while(cin >> n){
long a = NUM/n;
long b = 0;
for(long i=1;i<a;i++) b += n*n*n*i*i;
cout << b << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]){
int d;
while(std::cin >> d){
int ans = 0, cnt = 1;
while(d*cnt < 600){
ans += d*d*d*cnt*cnt++;
}
std::cout << ans << std::endl;
}
return 0;
} | 1 | 67,936,204 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
string str,ans="";
stack<char> sta;
cin>>str;
for(int i=0;i<str.size();i++){
if(str[i] == 'B'){
if(sta.size() >0){
sta.pop();
}
}else{
sta.push(str[i]);
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string S;
cin >> S;
deque<int> dq;
for(int i=0;i<S.size();i++){
if(S[i] =='B'){
if(dq.empty()){
continue;
}
dq.pop_back();
}else{
dq.push_back(S[... | 1 | 67,984,015 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | #include<bits/stdc++.h>
using namespace std;
long long int a[100000000],n,m=0;
int main()
{
cin>>n;
cin>>a[1];
for (int i=2;i<=n;i++)
{
cin>>a[i];
if (a[i]<a[i-1])
{
m=a[i-1]-a[i]+m;
a[i]=a[i-1];
}
}
cout<<m;
return 0;
} | 1 | 22,768,045 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
uint R; cin >> R;
if (R<1200){ cout << "ABC" << endl;
}else if(R<2800){ cout << "ARC" << endl;
}else { ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int r;
cin>>r;
if(r<1200)
cout<<"ABC";
else if(r>=1200 && r<2800)
cout<<"ARC";
else if(r>=2800 && r<=4208)
cout<<"AGC";
} | 1 | 21,424,963 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
ll dp[1002][100... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int main() {
int h, n;
cin >> h >> n;
int a[n], b[n];
int mx = 0;
for ( int i = 0; i < n; i++ ) {
cin >> a[i] >> b[i];
mx = max(mx, a[i]);
}
vector<int> dp(h+mx+1, INF);
dp[0] = 0;
for ( int i = 0; i < h+mx; i++ ) {
for... | 1 | 94,220,021 |
#include <iostream>
using namespace std;
long long int n,a[5000];
int main(){
long long int i,j,t,tmp;
while(cin >> n && n){
tmp = 0;
t = -1000000;
for(i=0;i<n;i++){
cin >> a[i];
}
for(i=0;i<n;i++){
tmp += a[i];
if(t < tmp) t = tmp;
for(j=i+1;j<n;j++){
tmp += a[j];
if(t < tmp) t = tmp... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
while (cin >> N) {
if (N == 0) break;
int num[5000];
for (int i = 0; i < N; i++) {
cin >> num[i];
}
int m = num[0];
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = i; j < N; j++) {
... | 1 | 53,787,413 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout <<... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int s, w;
cin >> s >> w;
if (w >= s)
{
printf("unsafe");
}
else
{
printf("safe");
}
return 0;
} | 1 | 91,696,257 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mk make_pair
#define pb push_back
#define pf push_front
typedef pair<int, int> pii;
const int mod = 1000000007;
const int INF = 1000000009;
const long long INFL = 1000000000000000018ll;
int N;
int d[100100];
deque<int> dque;
signed main()
{
... | #include <bits/stdc++.h>
#define INF 1e7
using namespace std;
const int maxn = 100005;
int main()
{
int dist[maxn],k,temp,mul_ten,plus_one,ans;
deque<int> q;
scanf("%d",&k);
for (int i=0;i<maxn;i++) dist[i]=INF;
dist[1]=0;
q.push_front(1);
while (!q.empty())
{
temp=q.front();
... | 1 | 30,005,738 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int rate,goal;
cin >> rate >> goal;
cout << 2*goal - rate;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int R;
int G;
cin >> R;
cin >> G;
cout << 2*G-R<< endl;
} | 1 | 55,303,063 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
#ifndef UTIL_HPP
#define UTIL_HPP
typedef ::std::int_fast64_t i64;
typedef ::std::uint_fast64_t u64;
typedef ::std::int_fast32_t i32;
typedef ::std::uint_fast32_t u32;
namespace tools {
template ... | 1 | 83,487,893 |
#include <iostream>
using namespace std;
long long max(long long x,long long y){
if(x > y){
return x;
}else{
return y;
}
}
int main(){
while(1){
int n,k;
long long array[100001]={};
long long total[100001]={};
cin >> n >> k;
if(n == 0 && k == 0)break;
for(int i=0;i<n;i++){
cin >> array[i];
}
... | #include<iostream>
using namespace std;
int main(){
int n,k,data[100000],sum,max;
while(1){
cin >> n >> k;
sum = 0;
max = -10000000;
if(n == 0&&k == 0)break;
for(int i = 0; i < n;i++)
cin >> data[i];
for(int i = 0;i < k;i++)
sum += data[i];
if(sum > max) max = sum;
for(in... | 1 | 58,856,309 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
int h,w; cin >> h >> w;
char s[51][51];
int f = true;
int fb = false;
rep(i,h){
rep(j,w){
cin >> s[i][j];
}
}
rep(i,h){
rep... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
const ll MOD = 1000000007;
using pint = pair<ll, ll>;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
int main() {
ll H, W;
cin >> H >> W;
vector<string> s(H);
boo... | 1 | 32,434,486 |
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int,int>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define PQi priority_queue<int>
#define PQir priority_queue<i... | #include<bits/stdc++.h>
using namespace std;
#define num 1000000007
#define REP(i,a,n) for(ll i=a;i<n;i++)
#define inarr(i,a,n,A) for(ll i=a;i<n;i++) { cin>>A[i]; }
#define vll vector<long long>
#define pii pair <int,int>
#define pll pair<long long, long long>
#define vpii vector< pair <int,int>>
#define vpll vector< p... | 1 | 7,781,850 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
int N, A;
cin >> N >> A;
cout << (N * N - A) << endl;
} | #include<stdio.h>
#include<string.h>
#include<cmath>
#include<iostream>
#include<iomanip>
using namespace std;
typedef long long LL;
typedef double db;
double pp[2500001];
int main()
{
int n, m;
cin >> n;
cin >> m;
cout << n * n - m << endl;
} | 1 | 21,654,151 |
#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;
cin >> N;
ll Nsum = 0;
rep(i, N + 1) Nsum += i;
vector<ll> A(N + 1);
ll Asum = 0;
rep(i, N) {
cin >> A[i];
Asum += A[i];
}
A[N] = A[0];
if... | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "P... | 1 | 3,329,829 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
int n;
cin>>n;
cout<<(n-2)*180<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
typedef long long ll;
typedef pair<ll,ll> pll;
int main(int argc, char const *argv[])
{
ll a;
cin >> a;
cout << 180*(a-2) << endl;
return 0;
} | 1 | 70,294,110 |
#include <iostream>
using namespace std;
int main()
{
string s;
cin >> s;
int t = s.size();
while(t > 1){
t -= 2;
if(s.substr(0, t/2) == s.substr(t/2, t/2)) break;
}
cout << t << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1)... | 1 | 52,352,526 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::string S){
int pointer = 0;
int need_left = 0;
for(int i = 0; i < S.size(); ++i){
if(S[i] == '(') pointer++;
else
{
if(pointer == 0) need_left++;
else pointer--;
}
}
int... | 1 | 22,723,193 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
bool isRotated = false;
if (N % 2 == 1) {
cout << "No" << endl;
return 0;
} else {
for (int i = 0; i < N / 2; i++) {
if (S.at(i) != S.at(N / 2 + i)) {
cout << "No" << endl;
ret... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
int test = 0;
for(int i=0; i<n/2; i++){
if(s[i]!=s[i+(n/2)]){
test = 1;
break;}
}
if(test==0 && n%2==0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 22,413,666 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int sum =0;
for(int i=0;i<s.length();i++)
{
sum = (sum%9+(s[i]-'0'))%9;
}
if(sum%9 == 0) cout<<"Yes\n";
else cout<<"No\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
using ll = long long;
int main() {
string n; cin >> n;
int ans = 0;
rep(i, n.size()) ans += n[i] - '0';
if(ans%9 == 0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 78,456,867 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int n;
cin>>n;
set<string>s ;
vector<string> v;
for(int i=0;i<n;i++)
{
string str;
cin>>str;
v.push_back(str);
s.insert(str);
}
if(s.size()!=n)
{
cout<<"No"<<e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
char next;
set<string> SE;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
if (SE.count(S)>0){
cout << "No" << "\n";
return 0;
}
if (i>0 && S.front() != next){
cout << "No" << "\n";
return... | 1 | 74,306,470 |
#include <bits/stdc++.h>
using namespace std;
#define len(s) int(s.size())
#define res(x) cout<<((x)?"No\n":"Yes\n")
#define all(v) v.begin(),v.end()
typedef long long ll;
typedef long double ld;
ll mod = 1e9+7;
void solution() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int ans = 0;
if(k > 0) {
ans = min(k, a);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll a,b,c,k;
cin>>a>>b>>c>>k;
if(a>=k)cout<<k<<endl;
else if(a+b>=k)cout<<a<<endl;
else{
ll s = k-(a+b);
cout<<a-s<<endl;
}
} | 1 | 5,132,028 |
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i, a, n) for (int i=(a); i<(n); i++)
#define per(i, a, n) for (int i=(a); i>(n); i--)
typedef long long ll;
const int maxn = 2e5+5;
const int mod = 1e9+7;
using namespace std;
ll p[maxn], c[maxn], sum[maxn];
vector<ll> v;
void solve() {
ll n,k,ans=-1e18; cin ... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define ALL(x) x.begin(), x.end()
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n,... | 1 | 82,828,082 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int H,W;
cin>>H>>W;
for(... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int h, w;
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
string name;
cin >> name;
if (name == "snuke") {
cout <... | 1 | 46,495,913 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
cout << (((a%3==0)||(b%3==0)||((a+b)%3==0))?"Possible":"Impossible") << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int A,B;
cin>>A>>B;
if(A%3==0||B%3==0||(A+B)%3==0){
cout<<"Possible"<<endl;
}else{
cout<<"Impossible"<<endl;
}
return 0;
} | 1 | 97,351,176 |
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string s, t;
cin >> s >> t;
int ans = 2*N;
for(int i=1; i<=N; i++)
{
if(s.substr(N-i, i) == t.substr(0, i)) ans = 2*N-i;
}
cout <... | 1 | 20,402,976 |
#include <stdlib.h>
#include <string>
#include <iostream>
using namespace std;
class node{
public:
int data;
node *prev;
node *next;
node(){
prev = 0;
next = 0;
data = 0;
}
node(int data){
prev = 0;
next = 0;
this->data = data;
}
node(int data, node *next){
prev... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
list<int> l;
int n;
cin >> n;
for(int i=0;i<n;i++){
string comm;
int x;
cin >> comm;
if(comm=="insert"){
... | 1 | 75,698,762 |
#include <algorithm>
#include <iostream>
#include <limits>
#include <stack>
#include <vector>
using namespace std;
using ll = long long;
template <typename T>
class LIS
{
struct Cache_LIS
{
typename vector<T>::iterator it;
T value;
};
int n;
T infty;
vector<T> dp;
stack<Cache_LIS> st;
public:
L... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
bool ... | 1 | 55,123,132 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <math.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
ll a[n+1]={};
ll b[n+1]={};
ll ans=0;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
if((a[i]|k)==k) ans+=b[i];
}
... | 1 | 5,537,782 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
int a[n];
const long long INF=1LL<<60;
long long dp[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)dp[i]=INF;
dp[0]=0;
for(int i=0;i... | #include<bits/stdc++.h>
#define int long long int
#define endl "\n"
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define loop(i,n) for(int i=0;i<(n);i++)
#define fors(a,b,i) for(int i=(a);i<=(b);i++)
#define ford(a,b,i) for(int i=(a);i>=(b);i--)
#define all(a) a.begin()... | 1 | 37,777,856 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
int n;
cin >> n;
vector<pair<int,int>> gusu(100000);
vector<pair<int,int>> k... | #include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
int n; vector<int> odd,even;
void input()
{
cin >> n;
for(int i=0; i<n/2; ++i){
int a,b; cin >> a >> b;
odd.emplace_back(a);
even.emplace_back(b);
}
}... | 1 | 6,106,585 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
using namespace std;
#define N 2003
#define mod 1000000007
int dp[N][N];
int add(int x,int y) {
int ret = x+y;
if(ret>=mod) {
ret -= mod;
}
if(ret<0) {
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef multiset<ll> msll;
typedef set<ll> sll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
ty... | 1 | 76,493,966 |
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
char c;
cin >> c;
switch (c) {
case 'a':
case 'i':
case 'u':
case 'e':
case 'o':
cout << "vowel" << endl;
break;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
string str[5] = {"a", "e", "i", "o", "u"};
int main() {
string c;
cin >> c;
string ans = "consonant";
rep(i, 5) {
if (str[i] == c) ans = "vowel";
}
... | 1 | 27,309,089 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | 1 | 81,443,558 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
int a[5];
for(int i=0;i<5;i++){
scanf("%d",&a[i]);
}
sort(a,a+5);
printf("%d %d %d %d %d\n",a[4],a[3],a[2],a[1],a[0]);
return 0;
} | #include <iostream>
#include <algorithm>
int main()
{
int n[5] = {};
std::cin >> n[0] >> n[1] >> n[2] >> n[3] >> n[4];
std::sort(std::begin(n), std::end(n), [](int a, int b){return a > b;}) ;
std::cout << n[0] << " " << n[1] << " " << n[2] << " " << n[3] << " " << n[4] << std::endl;
return 0;
} | 1 | 73,083,136 |
#include<stdio.h>
#include<iostream>
using namespace std;
const static int MAX = 100000;
const static int NIL = -1;
typedef struct {
int parent;
int left;
int right;
} Node;
Node T[MAX];
int D[MAX];
void printChildren(int u) {
int c = T[u].left;
int i = 0;
printf("[");
while (c != NIL) {
if (i > 0) pr... | #include <algorithm>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <set>
#include <vector>
#define FOR(i, l, r) for (i = (l); i < r; i++ )
using namespace std;
typedef long long ll;
#define MAX_N (100010)
#define NIL (-1)
typedef struct {
int par;
int l_c; ... | 1 | 67,033,795 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
const int N = 1e6 + 10, OO = 0x3f3f3f3f, mod = 1e9 + 7;
#define PI acos(-1)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
string s,t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.begin(),t.end());
reverse(t.begin(),t.end());
string ans="No";
if(s<t){
ans="Yes";
}
cout << ans;
} | 1 | 65,527,196 |
#include <iostream>
using namespace std;
int main (void) {
int a, b, c, d, ttl;
cin >> a >> b >> c >> d;
if (a < b) {
ttl += a;
} else {
ttl += b;
}
if (c < d) {
ttl += c;
} else {
ttl += d;
}
int ans = ttl;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C, D; cin >> A >> B >> C >> D;
cout << min(A, B) + min(C, D) << "\n";
} | 1 | 35,914,807 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll MOD = 1e9+7;
ll q_pow(ll a, ll b) {
ll res = 1;
while(b>0) {
if(b&1) (res*=a)%=MOD;
(a*=a)%=MOD;
b>>=1;
}
return res;
}
int main() {
ll x,y; cin>>x>>y;
ll ans;
if((x+y)%3!=0) ans=0;
else {
if(max(x,y)>min(x,y)*2... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
using namespace std;
using ll = long long;
const ll M = 1e9+7;
ll mpow(ll x,ll y){
ll ans = 1;
while(y != 0){
if(y&1){
ans = ans * x % M;
}
x = x * x % M;
y = y >> 1;
}
return ans % M;
}
ll comb(... | 1 | 70,952,449 |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
if(s=="abc"||s=="acb"||s=="bac"||s=="bca"||s=="cab"||s=="cba") cout << "Yes" << "\
\n";
else cout << "No" << "\n";
return 0;
} | #include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
string s;
cin >> s;
if(s[0] != s[1] && s[1] != s[2] && s[0] != s[2])cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 18,544,801 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define rep(i,N) for(int i=0;i<N;i++)
int main(){
ios::sync_with_stdio(false);
cin.... | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define int long long
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define ... | 1 | 78,988,602 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#ifdef DEBUG
#define debug(x) cerr << #x << " " << x << '\n'
#else
#define debug(x)
#endif
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int INF = 0x3f3f3f3f, N = 3e5 + 5;
int n, a[N], cnt[N], suf[N], cnt2[N], cnt3[N], pre[... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define in4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c... | 1 | 10,078,641 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
#include <assert.h>
using namespace std;
#define ... | #include<iostream>
#include<string>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<vector>
#include<iomanip>
#include<map>
#include<set>
#include<utility>
#include<iterator>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define nn cout<<endl;
#define ff(a,n) for(ll ... | 1 | 17,505,296 |
#include <stdio.h>
long long int ans[22] ;
void init ( ) ;
int main ( )
{
long long int s ;
init ( ) ;
while ( scanf ( "%lld" , &s ) == 1 ) {
printf ( "%lld\n" , ans[s] ) ;
}
return 0 ;
}
void init ( )
{
ans[0] = 0 ;
ans[1] = 1 ;
for ( long long int i = 2 ; i <= 20 ; i++ ) {
ans[i] = ans[i-1] * i ;
}
} | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
ll factorial(int n)
{
if(n == 0)
return 1;
return n * factorial(n - 1);
}
int main(void)
{
int n;
cin >> n;
cout << factorial(n) << endl;
return 0;
} | 1 | 63,475,168 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a-b+1;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n,k;
cin>>n>>k;
cout... | 1 | 26,275,664 |
#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
#define ndl cout << '\n'
#define sz(v) int(v.size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define present(a, x) (a.find(x) != a.end())
#ifdef LOCAL
#define db(...) ({cout << "> Line " << __... | #include<iostream>
#include<cstdio>
using namespace std;
long long k,a[50][51];
int main()
{
ios::sync_with_stdio(false);
cin>>k;
for(int i=1;i<=50;++i)
a[0][i]=49;
for(int i=1;i<50;++i)
for(int j=1;j<=50;++j)
{
if(i==j) a[i][j]=a[i-1][j]+50;
else a[i][j]=... | 1 | 22,827,376 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define FOR(i, m, n) for(ll i = m; i < (n); i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vii = vector<vi>;
using pii = pair<int, int>;
using vl = vector<ll... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,A ;
cin >> N >> A ;
int x= std::pow(N,2)-A;
cout << x << endl;
} | 1 | 66,128,360 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s,t;
cin>>s>>t;
vector<ll>ser(26,-1),ter(26,-1);
for(int i=0;i<s.size();i++){
ll x=s[i]-'a';
ll y=t[i]-'a';
if(ser... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | 1 | 83,464,566 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long LL;
template <typename F, typename S> std::ostream& operator<<(ostream& os, const p... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
vector<int> vs[500];
int main(void) {
int n;
scanf("%d", &n);
ll k = 1;
while(k*(k-1) < 2*n) {
++k;
}
if(k*(k-1) != 2*n) {
puts(... | 1 | 94,270,446 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mxn= 1e5+5;
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main(){
rishabh();
ll n;
cin>>n;
... | #include<bits/stdc++.h>
using namespace std;
long long n;
int main()
{
scanf("%lld",&n);
printf("%lld\n",n*(n-1)/2);
return 0;
} | 1 | 90,015,303 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
if (k <= data[i]) {
sum++;
}
}
cout << sum << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | 1 | 56,244,632 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d; cin >> a >> b >> c >> d;
int begin = max(a, c);
int end = min(b, d);
if ((end - begin) > 0) cout << end - begin << endl;
else cout << 0 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main(void){
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = min(b, d) - max(a, c);
if(... | 1 | 81,096,069 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
void CountingSort(vector<int>& A, vector<int>& B){
int n = *max_element(A.begin(), A.end()) + 1;
vector<int> C(n, 0);
for (const auto& a : A) C[a]++;
for (int i = 1; i < n; i++) C[i] += C[i-1];
for (const auto& a : A) {
... | #include<iostream>
using namespace std;
int bukket[10001];
int main(){
ios_base::sync_with_stdio(false);
int num;
cin >> num;
while(cin >> num){
bukket[num] ++;
}
for(int i = 0; i < 10001; i++){
if(bukket[i] > 0){
cout << i;
bukket[i] --;
break;
}
}
for(int i = 0; i < 10001; i++){
while(bukket[... | 1 | 86,541,865 |
#include<cstdio>
int main()
{
int n; scanf("%d", &n);
int now = 0;
for(int i = 0; i < n; i++){
int inp; scanf("%d", &inp);
if(inp == now + 1) now++;
}
if(now == 0) printf("-1\n");
else printf("%d\n", n - now);
} | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned l... | 1 | 42,498,656 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r; cin >> r;
string ans;
if (r < 1200) ans = "ABC";
else if (r < 2800) ans = "ARC";
else ans = "AGC";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 1 | 68,465,431 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
int ans = 0;
int tmp;
int n;
cin >> n;
vector<int> h(n+1);
REP1(i, n) cin >> h[i];
h[0] = 0;
REP1(i, 1... | #include<bits/stdc++.h>
using namespace std;
int main(){
int T,i,j;
int n,mn=107,cnt=0;
cin>>n;
int a[n+1];
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
if(a[i]<mn) mn=a[i];
}
cnt=mn;
for(i=1;i<=n;i++)
a[i]-=mn;
int x;
for(i=1;i<=n;i++){
if(a[i]!=0){
... | 1 | 24,927,457 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
map<int, int, greater<int>> cnt;
for (int i = 0; i < n; i++) {
int a; cin >> a;
(cnt.find(a) != cnt.end()) ? cnt[a]++ : cnt[a] = 1;
}
long long y = 0, x = 0;
for (auto &lc : cnt) ... | 1 | 37,681,230 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char const* argv[]) {
int A, B;
char op;
scanf("%d %c %d", &A, &op, &B);
if (op == '+') printf("%d\n", A + B);
else printf("%d\n", A - B);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string s;
cin>>a>>s>>b;
if(s=="+"){
cout<<a+b;
}
else{
cout<<a-b;
}
return 0;
} | 1 | 12,337,765 |
#include <bits/stdc++.h>
#define FOR(i,n) for(int i=0;i<n;i++)
#define FORR(i,n) for(int i=n;i>=0;i--)
#define pb push_back
#define vlli vector<int>
#define slli set<int>
#define mlli map<int,int>
#define int long long int
#define test int tt1234; cin>>tt1234;while(tt1234--)
#define endl "\n"
#define all(zz) zz.begin(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n;
cin>>n;
ll arr[n+5]={0};
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
sort(arr,arr+n);
ll x=n/2;
ll diff=arr[x]-arr[x-1];
cout<<diff<<endl;
} | 1 | 1,220,847 |
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n;
int cnt = 0;
while(scanf("%d",&n) != EOF){
cnt = 0;
for(int a = 0;a < 10;a++){
for(int b = 0;b < 10;b++){
for(int c = 0;c < 10;c++){
for(int d = 0;d < 10;d++){
if(a+b+c+d == n){
cnt++;
}
}
}
}... | #include <stdio.h>
#include <stdlib.h>
int main(void)
{
int n;
char buf[256];
while (fgets(buf, 256, stdin) != NULL){
int ans;
n = atoi(buf);
ans = 0;
for (int i = 0; i < 10; i++){
for (int j = 0; j < 10; j++){
for (int k = 0; k < 10; k++){
for (int l = 0; l < 10; l++){
if (i + j + k + l ==... | 1 | 83,780,305 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int m,n_min,n_max;
while(cin>>m>>n_min>>n_max,m){
vector<int> V(m);
for(int i=0;i<m;i++) cin>>V[i];
sort(V.begin(), V.end(),greater<int>());
int ans=-1;
int gap=0;
for(int ... | #include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int m,nmin,nmax;
cin >> m >> nmin >> nmax;
if(!m) break;
vector<int> p(m);
for(int i=0; i<m; i++) cin >> p[i];
int gap = 0,ans = 0;
for(int i=nmin-1; i<nmax; i++){
if( gap <= p[i]-p[i+1] ) {
gap = p[i] - p[i+1];
... | 1 | 77,245,202 |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#define PI 3.14159265359
using namespace std;
double func_area(double base, double height) {
double area = base * height / 2.0;
return area;
}
double func_circumference(double a, double b, double c_x, double c_y) {
double left_base... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using PI = pair<int, int>;
int main() {
double a, b, c;
cin >> a >> b >> c;
double s = 0.5 * a * b * sin(M_PI * c / 180);
cout << setprecision(8) << fixed << s << '\n'
<< a + b + sqrt(pow(a, 2) + pow(b, 2) - 2 * a * b * co... | 1 | 41,929,817 |
#include <iostream>
int main()
{
int a, b;
std::cin >> a >> b;
int ans = a * b;
std::cout << ((ans % 2) ? "Odd" : "Even");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 1 | 95,834,004 |
#include <stdio.h>
#include <bitset>
using namespace std;
int dp[1010][1010];
bitset<1010> went[1010];
int min(int a,int b){
if(a>b)return b;
return a;
}
int dis(int n,int m,char l[],char r[]){
if(n<0&&m<0)return 0;
if(n<0)return m+1;
if(m<0)return n+1;
if(went[n][m])return dp[n][m];
went[n]... | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
int dp[1001][1001];
int main() {
string a, b; cin >> a >> b;
memset(dp, 0x3f, sizeof(dp));
dp[0][0] = 0;
rep(i, a.size() + 1)rep(j, b.size() + 1) {
if (i < a.size())dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + 1);
if (j == b.size... | 1 | 54,953,888 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
char s,t; cin>>s>>t;
int x=s-'A',y=t-'A';
if(x<y){
cout<<"<"<<endl;
}else if(x>y){
cout<<">"<<endl;
}else{
cout<<"="<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep2(i, a, b) for(int i = (a); i < (b); i++)
typedef long long ll;
int main() {
char x, y;
cin >> x >> y;
if (x < y) {
cout << "<" << endl;
} else if (x == y) {
cout << "=" << endl;
} else {... | 1 | 94,865,453 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | #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-1; i >= 0; i--)
#define ALL(x) x.begin(),x.end()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
const int mod = 1e9+7;
const int INF = 2e9;
cons... | 1 | 85,375,271 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ty... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(c >= a && b >= c) cout << "Yes" << endl;
else cout<< "No" << endl;
} | 1 | 9,385,326 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | #include<cstdio>
#include<iostream>
using namespace std;
const int N = 2e5+10;
int n,t,a[N];
int main()
{
cin>>n>>t;
for (int i = 0 ; i < n ; i++)
scanf("%d",&a[i]);
if (n == 1) { cout<< t<< endl; return 0;}
int left = 0;
long long curr = t;
long long ans = 0;
for (int i = 0; i < n ; i++)
{
if (a[i] <= curr... | 1 | 71,703,532 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<pair<LL, LL> > VP;
#define For(in) for (LL i = 0; i < (n); i++)
#define FOR(in) for(LL i=1; i <= (n); i++)
#define pb push_back
#define srt(v) sort(v.begin(), v.end())
#define rev(v) reve... | 1 | 66,061,585 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
const ll MOD = 1e9 + 7;
V<ll> len, pat;
ll rec(ll n, ll x){
if(n == 0){
if(x == 1) return 1;
else return 0;
}
... | #include <bits/stdc++.h>
#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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
ll solve(ll n,... | 1 | 68,809,376 |
#include <iostream>
using namespace std;
int main(){
while(true){
string s;
string bottom;
string top;
int m;
int h;
cin >> s;
if(s=="-")break;
cin >> m;
for(int i=0; i<m; i++){
cin >> h;
bottom = s.substr(0, h);
top = s.substr(h, s.length()-h);
for(int i=0;... | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
while(1) {
char s[210];
int n, a;
scanf("%s", s);
if(s[0] == '-' && s[1] == '\0') break;
cin >> n;
string s1 ... | 1 | 49,088,344 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
char a, b;
cin >> a >> b;
if(a == 'D') {
if(b == 'H') cout << 'D' << endl;
else cout << 'H' << endl;
}
else {
if(b == 'H') co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
char a, b; cin >> a >> b;
char ans;
if (a == 'H' && b == 'H') ans = 'H';
if (a == 'H' && b == 'D') ans = 'D';
if (a == 'D' && b == 'H') ans = 'D';
if (a == 'D' && b == 'D') ans = 'H';
cout << ans << endl;
return 0;
} | 1 | 31,870,939 |
#include <iostream>
using namespace std;
int main(void) {
int n;
int score, sum_score;
int max_score, min_score;
int i;
cin >> n;
while (n) {
sum_score = 0;
max_score = 0;
min_score = 1000;
for (i=0; i<n; i++) {
cin >> score;
sum_score += s... | #include <iostream>
using namespace std;
int main() {
int n, s;
while (cin >> n) {
if (n == 0) {
break;
}
int mins = 1000, maxs = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sum += s;
mins = min(s, mins);
maxs = ... | 1 | 44,223,916 |
#include <iostream>
#include <string>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int main() {
int a[6];
for (int i=0; i<6; i++) {
cin >> a[i];
}
int n;
cin >> n;
int x,y;
for (int i=0; i<n; i++) {
cin >> x >> y;
if(x==a[0]){
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Dice{
public:
long top, front, right, left, back, bottom;
Dice(long top, long front);
void north();
void south();
void west();
void east();
void showTop();
void guessRightFromTopAndFront(long top, long front, long *right);
};
... | 1 | 26,565,933 |
#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,k;
cin >> n >> k;
int R,S,P;
cin >> R >> S >> P;
string kyotai;
cin >> kyotai;
ll ans=0;
rep(i,n){
if(i>=k){
if(kyotai[i] == kyo... | #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 (int i = (begin), i##_end_ = (end); i < i##_end_; i++)... | 1 | 7,694,912 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(),... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <tuple>
#include <math.h>
#include <set>
#include <map>
using namespace std ;
using ll = long long ;
using ld = long double ;
... | 1 | 75,630,092 |
#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;
cin >> A >> B;
cout << (A - 1) * (B - 1) << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template... | 1 | 77,210,004 |
#include <bits/stdc++.h>
using namespace std;
#define IO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long int
#define ull unsigned long long int
const int INF = 1e9 + 7;
const int N = 1e5+5;
int main() {
IO;
int n, m;
cin >> n >> m;
if (n <= m) {
for (int i = 1; i <= m; ++i)
cout << ... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 1 | 51,288,147 |
#include <iostream>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
constexpr size_t MAXN = 1e5;
constexpr size_t MAXM = 1e5;
constexpr int MOD = 1e9 + 7;
void solve() {
int H, W;
std::cin >> H >> W;
std::vector<std::vector<int>> grid;
grid.reserve(H);
for (int y = 0; y < H; ++y) {
... | #include <bits/stdc++.h>
using namespace std;
#define FasterIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define bug(a,b) cout<<a<<"\t"<<b<<"\n";
#define Case(a,b) cout<<"Case "<<a<<": "<<b<<"\n";
#define precision(a,b) fixed<<setprecision(a)<<b
#define lp(i,a,b) ... | 1 | 14,492,563 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
int flag;
vector<int> h_vec;
for (int i=0; i<H; i++) {
flag = 0;
for (int j=0; j<W; j++) {
cin >> data.at(i).at(j);
if (data.at(i).at(j) == '#') flag = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> a(H, vector<char>(W));
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cin >> a.at(i).at(j);
}
}
... | 1 | 22,400,275 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MA... | 1 | 36,581,271 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<stack>
#include<queue>
using namespace std;
typedef long long ll;
const int maxn = 101000;
int n,m,x;
int lt,rt,dis[maxn];
string S,S1,S2;
ll read(){ ll s=0,f=1; char ch=getchar(); while(ch<'0' || ch>'9'){ if(ch=='-') f=-... | #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 > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 1 | 98,363,559 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
M = N;
int sum = 0;
for (int i=8; i>=0; i--) {
int W=1;
for (int j=0; j<i; j++){
W *= 10;
}
int x;
x = N / W;
sum += x;
N = N - x*W;
}
if (M % sum == 0) {
cout << "Yes" << endl;
}
else ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(N); 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 = b; return 1; } return 0; }
int main() {
... | 1 | 41,100,890 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18 + 10;
co... | 1 | 66,559,003 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <bits/stdc++.h>
using namespace std;
int main()
{int N; cin >> N;
double V[N], r; for (auto &v: V) cin >> v; sort(V, V + N); r = V[0];
for (int i{1}; i < N; ++i) r = (r + V[i]) / 2;
printf("%.9f", r);} | 1 | 24,587,869 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<cstdlib>
#include<ctime>
using namespace std;
typedef long long ll;
ll n, a[200010], ruiseki[200010];
ll sum, ans = 2000000000000000000;
int main() {
cin >> n;
cin >> a[0];
sum = a[0];
r... | #include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<map>
#include<vector>
#include<string>
#define ll long long
#define For(i,x,y) for(ll i=x;i<=y;++i)
#define FOr(i,x,y) for(ll i=x;i>=y;--i)
using namespace std;
inline ll read(){ ll x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'... | 1 | 28,183,755 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 1 | 23,385,906 |
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m)
{
cout<<m/3<<endl;
}
return 0;
} | #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... | 1 | 79,651,544 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
int res = 0;
if(a < b) res += a;
else res += b;
if(c < d) res += c;
else res += d;
cout << res << endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int A , B , C , D;
cin >> A >> B >> C >> D;
if ((A >= B) && (C >= D)) {cout << B + D;}
else if ((A <= B) && (C >= D)) {cout << A + D;}
else if ((A >= B) && (C <= D)) {cout << B + C;}
else if ((A <= B) && (C <= D)) {cout << A + C;}
} | 1 | 3,512,746 |
#include <stack>
#include <utility>
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <vector>
#include <queue>
#include <functional>
#include <cstdio>
using namespace std;
int main()
{
int n;
typedef pair <int, int> p;
while (cin >> n, n != 0) {
vector <p> map[12];
int a, b, c;
... | #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | 1 | 90,165,777 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string TKSS;
cin >> TKSS;
if(TKSS == "a" || TKSS == "e" || TKSS == "i" || TKSS == "o" || TKSS == "u"){
cout << "vowel" << endl;
}
else{
cout << "consonant" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
char c;
cin >> c;
cout << ((c=='a'||c=='i'||c=='u'||c=='e'||c=='o')... | 1 | 76,794,953 |
#include<bits/stdc++.h>
using namespace std;
#define l1 long long
int main(){
int x;
int k;
cin>>k>>x;
k=500*k;
if(k>=x)cout<<"Yes";
else cout<<"No";
} | #include <iostream>
using namespace std;
int main(){
int k,x;
cin>>k>>x;
if(k*500<x){
cout<<"No\n";
}
else{
cout<<"Yes\n";
}
} | 1 | 20,283,005 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int h,n;
cin >> h >> n;
int attack = 0;
rep(i,0,n) {
int a;
cin >> a;
attack += a;
}
if (attack >= h) {
cout << "Yes" << endl;
} else {... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int H,N;cin>>H>>N;
int sum=0;
rep(i,N){
int a;... | 1 | 89,100,623 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const long long INF = 1LL << 60;
string s;
int main()
{
cin >> s;
if(s[0] == s[1] && s[1] == s[2]) cout << "No" << endl;
else cout << "Yes" << endl;
} | #include<iostream>
using namespace std;
int main(){
string S;
cin >> S;
char c = S[0];
int count = 0;
for (int i = 1; i < S.size(); i++){
if(c != S[i]){
count++;
}
c = S[i];
}
if(count == 0){
cout << "No" << endl;
}
else{
cout << "Y... | 1 | 47,956,573 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x, y;
x = a % 2;
y = b % 2;
if(x==0 || y==0) {
cout << "Even" << endl;
}
else {
cout << "Odd" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a%2 != 1 || b%2 != 1) {
cout << "Even";
} else {
cout << "Odd";
}
} | 1 | 74,414,652 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
signed main()
{
int n,m ; cin>>n>>m;
vector<int>adj[n+1];
for(int i = 0 ; i < m ;i++)
{
int u , v;cin>>u>>v;
adj[u].pb(v);
adj[v].pb(u);
}
vector<int>dis(n+1,INT_MAX);
vector<int>par(n+1);
vector<int>vis(n+1)... | 1 | 96,372,301 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void) {
int d[3];
for (int i = 0; i < 3; i++) cin >> d[i];
sort(d, d + 3);
cout << d[0] << ' ' << d[1] << ' ' << d[2] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int arr[3];
for (int i = 0; i < 3; i++) {
cin >> arr[i];
}
sort(begin(arr), end(arr));
cout << arr[0] << " " << arr[1] << " " << arr[2] << endl;
return 0;
} | 1 | 69,006,153 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl '\n'
#define all(a, n) for (int i = 0; i < n; i++) cout << a[i] << " "; cout << endl;
#define IOS ios_base::sync_with_stdio(... | 1 | 88,896,554 |
#include <iostream>
using namespace std;
int main(){
int n,y,m,d,a;
cin>>n;
for(int i=0;i<n;i++){
cin>>y>>m>>d;
a=0;
for(int j=1;j<y;j++){
if(j%3==0){
a=a+200;
}
else{
a=a+195;
}
}
for(int j=1;j<m;j++){
if(y%3==0||j%2==1){
a=a+20;
}
else{
a=a+19;
}
}
a=a+d;
cou... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=1; i<=n; i++)
using namespace std;
int every=0;
void make(){
int last=0;
rep(i,999){
rep(j,10){
if (i%3==0) last = 20;
else if(j%2==0) last=19;
else last = 20;
rep(k,last){
every++;
}
}
}
}
int main(){
int n;
cin ... | 1 | 66,530,184 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<int> num = {0,2,5,5,4,5,6,3,7,6};
vector<char> nchar = {'0','1','2','3','4','5','6','7','8','9'};
bool check(string s,string t){
int... | #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++)
int main(){
int num[10];
num[1] = 2, num[2] = 5, num[3] = 5, num[4] = 4, num[5] = 5;
num[6] = 6, num[7] = 3, num[8] = 7, num[9] = 6;
int N, M;
cin >> N >> M;
... | 1 | 99,586,648 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.