code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#defin... | #include <stdio.h>
int n, kk, f;
int k[30];
int u[30];
int a[100000][30];
long long b[100000];
long long s, ans;
int main() {
scanf("%d%d", &n, &kk);
for (int i = 0; i < 30; i++) {
k[i] = kk % 2;
kk /= 2;
}
for (int i = 0; i < n; i++) {
scanf("%d%lld", &kk, b + i);
for (int j = 0; j < 30; j++) {
a[i][j] ... | 1 | 61,398,911 |
#include <stdio.h>
#include <string.h>
int main(){
char s[100],p[100],r[200];
scanf("%s",s);
scanf("%s",p);
strcpy(r,s);
strcat(r,s);
if(strstr(r,p)){
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string s;
string p;
int i,len;
cin>>s;
cin>>p;
len=s.size();
for(i=0 ; i<len ; i++){
s.push_back(s[i]);
}
if(s.find(p)!=string::npos){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 1 | 3,110,899 |
#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 = 1e9+7;
const int N=1e5+9;
int main()
{
FASTINOUT;
int a,b,c;
cin>>a>>b>>c;
cout<<((a+b)>=c?"Yes":"No");
return 0;
} | #include<bits/stdc++.h>
#include <math.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 lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(),(x).end()
... | 1 | 20,814,422 |
#include<bits/stdc++.h>
#define ll long long
#define db double
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
using namespace std;
ll mod=1e9 +7;
const ll M=500006;
ll f[M],inv[M];
ll expo(ll base,ll exponent){
ll ans=1;
while(exponent!=0){
if(exponent&1)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n,m;
cin >> n >> m;
vector<ll>h(n);
for(ll i=0;i<n;i++){
cin >> h[i];
}
vector<ll>g(n,1);
for(ll i=0;i<m;i++){
ll a,b;
cin >> a >> b;
a--;
b--;
... | 1 | 2,509,970 |
#include <iostream>
using namespace std;
int main(void){
int y,m;
char c;
cin >> y >> c >> m;
if(y<=2019 && m<=4) cout << "Heisei";
else cout << "TBD";
} | #include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
int main()
{
string S;
cin >> S;
if(S <= "2019/04/30"){
cout << "Heisei" << endl;
}else{
cout << "TBD" << endl;
}
} | 1 | 62,908,302 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
... | 1 | 89,282,415 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
float l;
cin>>l;
float ans=(l*l*l)/27;
cout<<fixed<<setprecision(15)<<ans;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
double L,ans=1;
cin>>L;
L=L/3.0;
ans*=L;
ans*=L;
ans*=L;
printf("%.12lf\n",ans);
return 0;
} | 1 | 7,047,168 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
struct UnionFind {
vector<int> par;
vector<int> cnt;
UnionFind(int N) : par(N), cnt(N) {
for... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 1 | 95,310,923 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,C,K;
cin >> N >> C >> K;
vector<int> T(N);
for(int i=0; i<N; i++) cin >> T[i];
sort(T.begin(),T.end());
int ans = 0;
int i = 0;
while(i<N){
ans++;
int a = T[i]+K;
int p = i;
for(int j=0; j<C; j++){
if(T[p+j] > a)br... | #include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
temp... | 1 | 41,475,786 |
#include <iostream>
using namespace std;
int main()
{
int in;
int first = 0, second, third;
for (int i = 0; i < 10; i++) {
cin >> in;
if (first <= in) {
third = second;
second = first;
first = in;
} else if (second <= in) {
third = seco... | #include<stdio.h>
int main()
{
int ara[11];
int i,j,t;
for(i=0;i<10;i++){
scanf("%d",&ara[i]);
}
for(i=0;i<10;i++){
for(j=i+1;j<10;j++){
if(ara[i]>ara[j]){
t=ara[i];
ara[i]=ara[j];
ara[j]=t;
}
}
}
for(i=9;i>6;i--){
printf("%d\n",ara[i]);
}
return 0;
} | 1 | 57,239,779 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define REP(i,n) for(ll i = 0;i < (ll)n;i++)
#define REPD(i,n) for(ll i = (ll)n - 1;i >= 0;i--)
#define ALL(x) (x).begin(),(x).end()
#define FILLl(n,first_dimension_size,value) fill((ll*)n,(ll*)(n+first_d... | 1 | 49,545,593 |
#include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
}
}
bool a = true;
int num = 0;
for (int i = 0; i < H; i+... | #include <bits/stdc++.h>
using namespace std;
char masu[60][60];
int kekka[60][60];
int main() {
int h,w;
cin>>h>>w;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>masu[i][j];
kekka[i][j]=0;
}
}
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(masu[i][j]=='.'&&masu[i][j+1]=='.'&&... | 1 | 89,505,135 |
#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ii pair<int, int>
#define OK (cerr << "OK" << endl)
#define debug(x) cerr << #x " = " << (x) << endl
#define ff first
#define ss second
#define int long long
#define tt tuple<int, int, int, int>
#define all(x) x.begin(), x.end()
#define Matri... | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n,m;
std::cin >> n>>m;
if(m%2==0){
for (int i = 0; i < m/2; i++) {
std::cout << i+1<<" "<<m-i << std::endl;
}
for (int i = 0; i < m/2; i++) {
std::cout ... | 1 | 100,185,242 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int k, x;
cin >> k >> x;
if (500 * k >= x) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <stdio.h>
int main() {
int k , x;
scanf("%d %d", &k, &x);
if(k * 500 >= x) puts("Yes");
else puts("No");
return 0;
} | 1 | 84,581,403 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
vector<ll> cnt(330000, 0), cntcnt(330000, 0), ans(330000, 0);
for(int i = 0; i < n; i++){
int a;
... | 1 | 78,864,310 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF ... | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 1 | 9,416,929 |
#include <bits/stdc++.h>`
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#de... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
using namespace std;
void func()
{
int A, B, K;
bool flag(false);
cin >> K;
cin >> A >>B;
flag = (A % K == 0 || B % K == 0 || (int)(A / K) != (int)(B / K));
if (flag)
cout << "OK\n";
else
cout << "N... | 1 | 49,790,739 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
#define rep(i,a,b) for(int i=a ; i<b ; i++)
#define qrep(que, ite) for(auto ite=begin(que) ;... | 1 | 65,469,082 |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
ll a[maxn];
int main(){
ll n,m;
cin>>n>>m;
ll lcm=1;
for(int i=0;i<n;i++){
cin>>a[i];
if(lcm>1e9) continue;
lcm=lcm*a[i]/2 / __gcd(lcm,a[i]/2);
}
bool flag=0;
for(int i=0;i<n;i++){
ll t=lcm*2/a[i];
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
long long gcd(long long x, long long y){
if(y==0) return x;
return gcd(y,x%y);
}
int main(){
int n;
long long m;
cin>>n>>m;
vector<long long> a(n);
for(int i=0;i<n;++i){
cin>>a[i];
a[i]/=2;
}
... | 1 | 40,119,769 |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int sz = 1e5 + 1;
ll n, k;
ll dp[sz];
ll bpow(ll x, ll p) {
if (p == 0)
return 1;
if (p % 2)
return (bpow(x, p - 1) * x) % mod;
else {
ll b = bpow(x, p / 2);
return (b * b) % mod;... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()... | 1 | 84,569,661 |
#include<cstdio>
#include<unordered_map>
using namespace std;
using ull = unsigned long long;
int main(){
ull N, M;
scanf("%llu %llu", &N, &M);
unsigned ruiseki[N+1];
ruiseki[0] = 0;
for (unsigned i = 0; i < N; i++){
unsigned tmp;
scanf("%u", &tmp);
ruiseki[i+1] = (ruiseki[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#... | 1 | 48,111,051 |
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if(b==0) return a;
return gcd(b, a%b);
}
int main() {
int X;
cin>>X;
int res = 360/(gcd(360, X));
cout<<res<<endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<cmath>
#include<bitset>
#include<map>
#include<vector>
#define ll long long
#define mkp make_pair
#define x first
#define y second
#define pli pair<ll,int>
using namespace std;
int x,y;
int gcd(int x,int y){if(!y)return x;return gcd(y,x%y);}... | 1 | 28,948,872 |
#include <iostream>
using namespace std;
#define MAX 2000000
#define INFINITY (1<<30)
int gHeap[MAX + 1],gSize;
void maxHeapify(int i){
int left,right,largest;
left = 2 * i;
right = 2 * i + 1;
if(left <= gSize && gHeap[left] > gHeap[i]){
largest = left;
}
else{
largest = i;
}... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> A;
int H=0;
void maxHeapify(int idx)
{
int left=2*idx, right=2*idx+1;
int largest;
if(left<=H && A[left]>A[idx]){
largest=left;
} else{
largest=idx;
}
if(right<=H && A[right]>A[largest]){
... | 1 | 84,396,174 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
#define int long long
#define double long double
#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(s) string s;cin>>s;
#de... | #include<iostream>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered... | 1 | 46,530,145 |
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <algorithm>
#include <stack>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
int main(){
vector<int> input(5);
while(cin >> input[0] >> input[1] >> input[2] ... | #include <stdio.h>
#include <algorithm>
using namespace std;
int greater(int a, int b){
return a>b;
}
int main(){
int a[5];
scanf("%d%d%d%d%d", a, a+1, a+2, a+3, a+4);
sort(a, a+5, greater);
printf("%d %d %d %d %d\n", a[0], a[1], a[2], a[3], a[4]);
} | 1 | 60,705,224 |
# include <bits/stdc++.h>
# define rep(i, n) for (int i = 0; i < (int)(n); i++)
# define irep(i, n) for (int i = int(n) - 1; i >= 0; i--)
# define FOR(i, m, n) for (int i = int(m); i < (int)(n); i++)
using namespace std;
namespace utils{
template <typename T> void print(vector<vector<T>> mat) {
rep (i, mat.size()... | #include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<set>
#include<functional>
using namespace std;
#define INF 1<<21
#define MOD 1000000007
int main() {
int n;
string s1, s2;
int x, y;
int mul;
cin >> n;
for (int i = 0; i < n; i++) {
x = 0; y = 0;
cin >> s1 >> ... | 1 | 59,522,413 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (register int i = a; i <= b; i++)
int n, a[200010];
int cnt[1000010], ans;
inline void solve(int T) {
cin >> n;
rep(i, 1, n) cin >> a[i];
sort(a + 1, a + n + 1);
rep(i, 1, n) {
if(!cnt[a[i]]) {
... | #include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long llong;
#define MAX 200001
int main()
{
int N, ans = 0;
llong A[MAX];
scanf("%d", &N);
for (int i = 0; i < N; i++)
{
scanf("%lld", &A[i]);
}
sort(A, A + N);
int Amax = A[N - 1];
int chk[Amax + 1];
for (int i = 0; i <= ... | 1 | 70,057,116 |
#include "bits/stdc++.h"
#define int long long
#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(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define SQR(x) (x) * (x)
#define itn int
using ... | #pragma GCC optimize("trapv")
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
const int maxn = 1<<20, mod = 924844033;
int n;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
vi a(n);
for(auto &i : a) cin >> i;
... | 1 | 42,277,985 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
ll N, M;
cin >> N >> M;
vector<ll> a(N);
... | #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 rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 1 | 63,211,587 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=2e9+7;
const ll longinf=1LL<<62;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=100010;
const ll mod... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 1 | 95,010,524 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main() {
int A, B, C;
cin >> A >> B >> C;
vector<int> ac(A);
vector<int> bc(B);
int minA = 1<<30, minB = 1<<30;
rep(i, A) {
cin >> ac.at(i);
minA = min(minA, ac.at(i));
}
rep(j, B) {
cin >> bc.at(j);
minB = min(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
int A, B, M; cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
int minA = 100001;
int minB = 100001;
rep(i,A){... | 1 | 84,373,557 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using Int = int64_t;
Int solve() {
Int N, sumA = 0, sumB = 0;
cin >> N;
vector<Int> A(N), B(N);
for (auto& i : A) {
cin >> i;
sumA += i;
}
for (auto& i : B) {
cin >> i;
sumB += i;
... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true... | 1 | 59,191,525 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(... | 1 | 9,490,147 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
vector<ll> a(n),b(n);
for(ll i = 0; i < n; i++) cin >> a[i];
for(ll i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define LINF 9223372036854775807
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | 1 | 12,419,771 |
#include <algorithm>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se... | 1 | 40,826,115 |
#include<iostream>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
ll k, a, b;
cin >> k >> a >> b;
ll ans = 0;
if (b <= a + 2) ans = k + 1;
else {
if (k <= a-1) ans = k;
else {
ans = a;
k -= a - 1;
... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | 1 | 82,987,755 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
void comb(vector<vector <long long int> > &v){
for(int i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(int k = 1;k <v.size();k++){
... | #include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
long long N, A, B;
cin >> N >> A >> B;
long long ans = 0;
if (A > B)
{
ans = 0;
}else if (A == B)
{
ans = 1;
}else if(A < B)
{
if (1 == N)
{
ans = 0;
... | 1 | 22,815,918 |
#include<bits/stdc++.h>
using namespace std;
int a,b;
int main()
{
scanf("%d%d",&a,&b);
if(a+b==15)
{
printf("+\n");
return 0;
}
if(a*b==15)
{
printf("*\n");
return 0;
}
printf("x\n");
return 0;
} | #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" << ... | 1 | 99,002,566 |
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(...) fprintf(stderr,__VA_ARGS__)
#define rep(i , l , r) for(int i = (l) , ___ = (r) ; i <= ___ ; ++i )
#define per(i , r , l) for(int i = (r) , ___ = (l) ; i >= ___ ; --i )
typedef long long LL;
typedef unsigned long long uLL;
const int Mod = 998244353;
templ... | #include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n,t,l,x[N],w[N],ans[N],q[N];
typedef pair<int,int> pii;
pii p[N];
bool cmp(int a,int b){return p[a]<p[b];}
int main()
{
scanf("%d%d%d",&n,&l,&t);
for (int i=1;i<=n;i++){
scanf("%d%d",&x[i],&w[i]);
if (w[i]==2) w[i]=-1;
p[i]=pii((l+(x[i]+w[i]*t... | 1 | 19,495,795 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k,ans=0;
cin >> n >> k;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
}
sort(a.begin(),a.end());
for(int i=0;i<n;i++){
if(i<(n-k))continue;
ans+=a.at(i);
}
cout << ans << endl;
return... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
int l[n];
... | 1 | 98,610,815 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll arr[250000],n;
bool comp(ll a,ll b)
{
return a>b;
}
ll segment(ll i)
{
if(i==n)
return i-1;
if(arr[i]!=arr[i+1])
return i;
return segment(i+1);
}
int main()
{
ll tc,m,i,a=1,b,flag=0,cnt=0;
cin>>n;
for(i=0;i... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
map<long long, int, greater<long long>> mp;
for(int i = 0; i < N; i++){
long long hoge = 0;
cin >> hoge;
mp[hoge]++;
}
long long ans = 0;
int count = 0;
for (auto x : mp) {
if (x.... | 1 | 90,619,066 |
#include<stdio.h>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<iterator>
#include<iomanip>
#include<string>
using namespace std;
int palindrome (string s)
{
for (int i=0; i<s.size()/2; i++)
{
if (s[i]!=s[s.size()-1-i]) {retu... | #include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
typedef uint16_t u16;
typedef int16_t i16;
typedef uint8_t u8;
typedef int8_t i8;
using namespace std;
#define rep(idx, N) for (u64 idx = 0; idx < N; idx++)
int main() {
string si, s;
cin >> si;
s = si;
... | 1 | 98,757,982 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A = 0, B = 0, C = 0, D = 0;
cin >> A >> B >> C >> D;
int L = A + B;
int R = C + D;
if( L > R ){
cout << "Left" << endl;
}
else if( L == R ){
cout << "Balanced" << endl;
}
else{
cout << "Right" << endl;
}
} | 1 | 58,594,852 |
#include <bits/stdc++.h>
#define cinf(n,x) for(int i=0;i<(n);i++) cin >> x[i];
typedef long long int ll;
using namespace std;
int main(){
int a,b; cin >> a >> b;
printf("%d %d %.12f \n",a/b,a%b,1.0*a/b);
} | #include <stdio.h>
using namespace std;
int main(){
int a,b;
double a_d,b_d;
scanf("%d %d",&a,&b);
a_d = static_cast<double>(a);
b_d = static_cast<double>(b);
printf("%d %d %.5f\n",a/b,a%b,a_d/b_d);
} | 1 | 19,725,117 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define REP(i, j) for(int i = 0; i < j; i++)
#define FOR(i, j, k) for(int i = j; i < k; i++)
const int N = 5;
int main(){
vector<int> v(N);
REP(i, N) cin >>v[i];
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
cout <... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> Number(5);
for(int i = 0; i < 5; i++){
scanf("%d", &Number[i]);
}
sort(Number.begin(), Number.end(), greater<int>());
for(int i = 0; i < 5; i++){
if(i != 4){
printf("%d ", Number[i]);
... | 1 | 90,467,469 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n, m, x;
cin >> n >> m >> x;
vi c(n);
vector<vector<int>> a(n, vector<int>(m));
rep(i,n){
cin >> c[i];
rep(j,m) cin >... | 1 | 71,249,255 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; ty... | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(10);
}
signed ... | 1 | 59,806,368 |
#include <bits/stdc++.h>
using namespace std;
#define itn int
#define nibu(K,x) binary_search(K.begin(),K.end(),x)
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define sz(x) x.size()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define out(x) cout<<x<<endl
#define... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 1 | 70,205,211 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int array[3];
cin >> array[0] >> array[1] >> array[2];
sort(array, array+3);
cout << ((array[0]*array[0]+array[1]*array[1] == array[2]*array[2]) ? "YES" : "NO") << endl;
}
re... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
int A[3];
scanf("%d", &n);
for(int i=0; i<n; i++){
scanf("%d %d %d", &A[0], &A[1], &A[2]);
sort(A, A+3);
double a= (double)A[0], b= (double)A[1], c= (double)A[2];
dou... | 1 | 83,871,080 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
string N;
string S;
for(int i=0;i<4;i++){
cin >> N;
S += N;
}
sort(S.begin(),S.end());
if(S == "1479") cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
map <int, int> m;
for (int i = 0; i < 4; i++){
int x;
cin >> x;
m[x] ++;
}
if (m[1] == 1 && m[9] == 1 && m[7] == 1 && m[4] == 1){
... | 1 | 59,429,044 |
#include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
ll n;
cin>>n;
vector<ll> vec(n);
ll ans = 1;
for(int i = 0; i < n; i++){
cin>... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define d long double
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define dscf(n) scanf("%Lf",&n)
#define pri(n) printf("%d ",(int)n)
#define lpri(n) printf("%lld ",n)
#define dpri(n) printf("%Lf ",n)
#define prin(n) printf("%d\n",(in... | 1 | 23,388,329 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int k;
string s;
cin >>... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a;
string b;
cin >> a >> b;
if(a >= b.size()){
cout << b;
}else{
cout << b.substr(0,a) << "...";
}
return 0;
} | 1 | 54,258,788 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define reps(i, s, n) for(int i=(s); i<=(n); ++i)
#define outl(x) cout<< (x) << '\n'
using namespace std;
class UnionFind {
private:
int *par;
int *rank;
const size_t N;
public:
UnionFind(... | #include <cstdio>
#include <iostream>
#define N_MAX 10000
#define Q_MAX 100000
#define UNITE 0
#define SAME 1
using namespace std;
int N,Q;
int num_array[N_MAX+1];
int main(){
scanf("%d %d",&N,&Q);
for(int i = 0;i < N_MAX;i++)
num_array[i] = i;
int query;
int x,y;
int p1,p2;
int cnt1,cnt2;
for(int q = 0;q < Q;... | 1 | 63,480,404 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
long long maxx = 0;
long long ans=0;
long long x;
for (int i=1; i<=n; i++) {
cin>>x;
if (x>=maxx) {
maxx=x;
} else {
ans+=(maxx-x);
}
}
cout<<ans<<"\n";
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define int long long
using namespace std;
int ctoi(char c) {
switch (c) {
case '0': return 0;
case... | 1 | 69,733,175 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,c=-1,j;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
sort(a.begin(),a.end(),greater<int>());
for(int i=1;i<n;i++){
if(c<min(a[0]-a[i],a[i])){
c=min(a[0]-a[i],a[i]);
j=i;
}
}
cout<<a[0]<<" "<<a[j]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int a[N];
int main()
{
int n;
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
int ans = 0, nowm = 1e9;
for(int i = 1; i < n; i++)
{
if(a[n] % 2 == 0)
{
if(abs(a[i] - a[n] / 2) < nowm)
{
no... | 1 | 39,951,515 |
#include<string>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
char ctable[4] = {'m', 'c', 'x', 'i'};
int table[4] = {1000, 100, 10, 1};
int rmcxi(){
int r = 0;
string s;
cin>>s;
int start = 0;
for(int i = 0; i < s.size();i++){
for(int j = 0; j < 4; j++){
if(s[i] == ctable[j]){
if(start == i){... | #include <iostream>
#include <string>
using namespace std;
int fromMCXI( string s )
{
int n = 1;
int r = 0;
for ( int i=0; i<(int)s.length(); i++ )
{
if (s[i]=='m') r += n*1000, n = 1;
if (s[i]=='c') r += n* 100, n = 1;
if (s[i]=='x') r += n* 10, n = 1;
if (s[i]=='i') r += n* 1, n = 1;
if ('2'<... | 1 | 68,828,112 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n; cin >> n;
ll ans = 0;
for (ll i = 1; i * i < n; i++) {
if ((n - i) % i == 0 && i < (n - i)... | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF=(ll)1e9;
const ll MOD=(ll)1e9+7;
vector<int> dx={1,0,-1,0},dy={0,1,0,-1};
int main(){
ll N,sum=0;
cin>>N;
for(ll i=1;i*i<=N;i++){
if(N%i==0&&i<N/i-1) sum+=N/i-1;
}
cout<<sum<<endl;
} | 1 | 79,638,209 |
#include <bits/stdc++.h>
#define up(i,a,b) for(int (i) = (a);(i)<=(b);++(i))
#define down(i,b,a) for(int (i) = (b);i>=(a);--i)
#define debug(x) cerr << (x) << '\n';
#define bits(x,i) ((x >> i) & 1)
#define mid ((l+r)/2)
#define pr pair<int,int>
using namespace std;
const int N = 200005;
vector<int> G[N];
long long ans ... | #include <bits/stdc++.h>
using namespace std;
long long n, u, v, ans = 0, mn, mx;
vector<pair<long long, long long>> adj;
void solve() {
cin >> n;
adj.resize(n + 1);
for (long long i = 1; i < n; ++i) {
cin >> u >> v;
adj[i] = {u, v};
}
for (long long i = 1; i <= n; ++i) {
ans += i * (n - i + 1);
}
for (lon... | 1 | 10,916,377 |
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps(x,... | 1 | 51,597,044 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
if(S=="RRR"){
cout << 3 << endl;
}else if(S=="RRS" || S=="SRR" ){
cout << 2 << endl;
}else if( S=="RSS" || S=="SRS" || S=="SSR" ||S=="RSR" ){
cout << 1 << endl;
}else if(S=="SSS"){
cout << 0 << endl;
}
return 0... | #include<iostream>
using namespace std;
int main(){
string s;
cin>>s;
int r=0;
for(int i=0;i<3;i++){
if(s[i]=='R')
r=1;
}
for(int i=0;i<2;i++){
if(s[i]=='R'){
if(s[i]==s[i+1])
r++;
}
}
cout<<r<<"\n";
} | 1 | 8,171,464 |
#include<iostream>
using namespace std;
int main(){
int N,K,X,Y;
cin>>N>>K>>X>>Y;
cout<<(N<=K?X*N:X*K+Y*(N-K))<<endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int N;
int K;
int X;
int Y;
cin >> N >> K >> X >> Y;
int sum = 0;
for(int i=1; i<= N; i++){
if(i <= K){
sum += X;
}else{
sum += Y;
}
}
cout << sum << endl;
return 0;
} | 1 | 67,791,582 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
char s[30005];
int pre[30005][11]={0};
int suf[30005][11]={0};
int vis[1005]={0};
void solve(int dd,int num){
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
if(pre[dd-1][i]&&suf[dd+1][j]){
vis[i*100+nu... | #include <bits/stdc++.h>
#include <stdlib.h>
#include <fstream>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
ll mod(ll a, ll b){
ll ret=a%b;
if(ret<0) ret+=b;
return ret;
}
ll modpow(ll a,ll b,ll c){
ll res=1;
while(b>0){
if(b&1) res=mod(... | 1 | 39,313,312 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main () {
int n; cin >> n;
int sum = 0;
vector<int> delicious;
for (int i = 0; i < n; i++) {
int d; cin >> d;
delicious.push_back(d);
}
for (int i = 0; i < n; i++) {
for ... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x)... | 1 | 16,519,026 |
#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;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll H, W, A, B; cin >> H >> W >> A >> B;
REP(h, H)
{
... | 1 | 38,306,558 |
#include<iostream>
using namespace std;
int main(){
int h,w,i,j;
for(;;){
cin>>h>>w;
if(h==0)exit(0);
for(i=0;i<h;i++){
for(j=0;j<w;j++){
if(i==0||i==h-1){cout<<"#";}
else if(j==0||j==w-1){cout<<"#";}
else{cout<<".";}
}
cout<<endl;
}
... | #include<iostream>
int main(void){
int H, W;
while(1){
std::cin >> H >> W;
if (H == 0 && W ==0) break;
for (int i = 1; i <= H; i++) {
if (i == 1 || i == H){
for (int j = 1; j <= W; j++) {
std::cout << '#';
}
std::cout << std::endl;
} else {
for (int j = 1; j <= W; j++) {
if (j ... | 1 | 75,901,867 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | #include <stdio.h>
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define prints(x, y) cout<<(x)<<" "<<(y)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#defi... | 1 | 64,596,270 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <functional>
#include <numeric>
#include <iomanip>
#include <climits>
#include <cstring>
#include <cmath>
using namespace std;
#define int long long
#... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) R... | 1 | 68,321,826 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
#pragma warning(disable: 4996)
#define _sort(v,type,order) do { sort(v.begin(),v.end(),order<type>()); } while(0)
#define _sum(v,default_value) ac... | #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,k,x,y;
cin>>n>>k>>x>>y;
cout<<min(n,k)*x+max(0,n-k)*y<<endl;
} | 1 | 65,569,740 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int main (int argc, char *argv[]) {
int m, n_min, n_max, p;
vector<int> v;
while (cin>>m>>n_min>>n_max, m||n_min||n_max) {
for (int i =... | #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... | 1 | 23,610,688 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int LorR[26] = { 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 };
string s;
while (cin >> s, s != "#")
{
int ans = 0;
for (int i = 1; i < s.size(); i++)
{
int now = s[i] - 'a';
int before = s[i - 1] - ... | #include<bits/stdc++.h>
#define dump(a) cout << #a << "=" << a << endl
using namespace std;
char left_key[15] = {
'q','w','e','r','t',
'a','s','d','f','g',
'z','x','c','v','b'
};
char right_key[11] = {
'y','u','i','o','p',
'h','j','k','l',
'n','m'
};
bool is_word(string word) {
return false;
}
int main() {
str... | 1 | 98,948,074 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9+7)
int main(){
ll n, k;
cin >> n >> k;
int max_bit = 31;
vector<ll> a(n);
vector<ll> b(n);
for(int i = 0; i < n; i++){
... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n;
int k;
ll a[100005],b[100005];
ll get(int bit){
ll ans=0;
for(int i=0;i<n;i++){
if((a[i]|bit)==bit)ans+=b[i];
}
return ans;
}
int main(void){
scanf("%d%d",&n,&k);
int sum=0;
ll res=0;
f... | 1 | 60,283,222 |
#include <iostream>
#include <vector>
using namespace std;
int countNum(int num) {
int n = 0;
for (int a = 0; a < 10 && a <= num ; a++) {
if (num - a > 27)
continue;
for (int b = 0; b < 10 && b + a <= num ; b++) {
if (num - b - a > 18)
continue;
for (int c = 0; c < 10 && c + b + a <= num ; c++) {
... | #include <iostream>
using namespace std;
int main(void)
{
int n;
int a, b, c, d;
int com;
while(cin >> n)
{
com = 0;
if(n == EOF) break;
for(a = 0 ; a < 10 ; a++)
{
for(b = 0 ; b < 10 ; b++)
{
for(c = 0 ; c < 10 ; c++)
{
for(d = 0 ; d < 10 ; d++)
{
if(a ... | 1 | 79,977,034 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int r,g; cin>>r>>g;
cout<<2*g-r<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G;
cin >> R >> G;
cout << 2 * G - R;
} | 1 | 2,458,687 |
#include <cstdio>
#include<iostream>
#include<map>
#include<algorithm>
#include<vector>
#include <cmath>
#include <iomanip>
#include <regex>
#include <queue>
#include <set>
#include <cassert>
using namespace std;
using ll = long long;
using plong = pair<ll,ll>;
ll MOD=998244353;
template<class T> inline bool chmax(T& a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
const int INF = 1e8;
int H, W, A, B;
vector<vector<int>> ans(1010, vector<int>(1010, 9));
int main(){
cin >> H >> W >> A >> B;
rep(y,H){
... | 1 | 86,295,534 |
# include "bits/stdc++.h"
using namespace std;
#define endl "\n"
typedef long long int ll;
#define f first
#define s second
inline void fastio(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
inline void setPrecision(int n){cout.precision(n);}
#define BR cerr<<endl
#define dbg(x) cerr<<(#x)<<": "<<x<<endl
#defi... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | 1 | 96,850,060 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> d(n);
rep(i,n) cin >> d[i];
sort(all(d));
int len = d.size();
int a... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
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 ... | 1 | 4,959,902 |
#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<ll,ll>;
using vi = vector<ll>;
using vv = vector<vi>;
int main(){
int s,w;
cin >> s >> w;
if(s<=w)cout<<"unsafe"<<endl;
else cout<<"safe"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;(i)<(b);++(i))
#define RFOR(i,a,b) for(ll i=a;(i)>=(b);--(i))
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,n,0)
#define ALL(v) v.begin(), v.end()
#define UNIQ(v) sort(ALL(v)); v.erase(unique(ALL(v)),... | 1 | 28,425,252 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 1 | 70,863,975 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int N, i;
cin >> N >> i;
cout << N - i + 1 << endl;
} | 1 | 11,398,039 |
#include <iostream>
using namespace std;
int A, B, C;
int main()
{
cin >> A >> B >> C;
if (A != 0 && B != 0 && C != 0)
{
if ((A + B) - C >= 0)
cout << "Yes\n";
else
cout << "No\n";
}
return 0;
} | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | 1 | 67,752,444 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define pb push_back
#define ff first
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define hello777 ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#include <string>
#... | #include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <de... | 1 | 12,014,504 |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
#define int long long
#define F first
#define S second
#define s(x) set<x>
#define um(x, y) unordered_map<x, y>
#define m(x, y) map<x, y>
#define p(x, y) pair<x, y>
#define v(x) vector<x>
#define min_heap(t) priority_queue<t, vector<t>, greater<t>>
#... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 1 | 84,264,903 |
#include <bits/stdc++.h>
#define REP(i, n) for (int (i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for(int (i) = a; (i) < (int)b; i++)
#define RREP(i, n) for(int (i)=((int)(n)-1); (i)>=0; i--)
#define RFOR(i, a, b) for(int (i) =((int)(b)-1); (i)>=(int)a; i--)
#define ALL(v) (v).begin(),(v).end()
#define MOD 100000... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
vector<char> S(10);
string r ="YAKI";
int i;
int y=0;
for(i=0;i<s.size();i++){
S.at(i)=s.at(i);
}
for(i=0;i<4;i++){
if(S.at(i)!=r.at(i)){
y++;
}
}
if(y==0){
... | 1 | 97,615,213 |
#include <iostream>
using namespace std;
int main() {
int a = 0;
int b = 0;
int c = 0;
cin >> a >> b >> c;
if (a <= b&&b <= c&&a <= c) {
cout << a << " " << b << " " << c << endl;
}
else if (a <= b && b >= c && a <= c) {
cout << a << " " << c << " " << b << endl;
}
else if (a >= b && b <= c &... | #include<iostream>
#include<algorithm>
#include <array>
int main(void){
std::array<int, 3> num;
std::cin >> num[0] >> num[1] >> num[2];
std::sort(num.begin(),num.end());
std::cout << num[0] <<" "<< num[1] <<" "<< num[2] << std::endl;
return 0;
} | 1 | 84,969,463 |
#include<iostream>
#include<math.h>
#include<vector>
#include<array>
#include<algorithm>
#include<numeric>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;
ll... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | 1 | 3,896,832 |
#include <stdio.h>
int main() {
int a;
scanf("%d", &a);
long long int arr[a], max = 1e18, prod = 1, flag = 0, kosong = 0;
for (int i = 0; i < a; i++) {
scanf("%lld", &arr[i]);
flag = (arr[i] > max) ? 1 : flag;
prod *= arr[i];
(arr[i]) ? max /= arr[i] : kosong = 1;
}
(kosong) ? puts("0") : ((... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric... | 1 | 77,720,973 |
#include <iostream>
using namespace std;
int coins[] = {500, 100, 50, 10, 5, 1};
int main()
{
int sum;
while(cin >> sum && sum) {
int ans = 0;
sum = 1000 - sum;
while(sum > 0) {
for(int i = 0; i < 6; i++) {
ans += (int)(sum / coins[i]);
sum %= ... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#define REP(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
using namespace std;
int main(void) {
int n;
while (cin >> n && n > 0) ... | 1 | 72,692,709 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m&&!(n==0&&m==0)){
int sum=0;
vector<pair<int,int> > vpii;
for(int i = 0; i < n; i++){
int d,p;
cin>>d>>p;
sum+=d;
vpii.push_... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
namespace Solver {
int N, M;
vector<pair<int, int>> DP;
inline bool Read() {
cin >> N >> M;
if (N == 0) return false;
DP.resize(N, make_pair<int, int>(0, 0));
for (int i = 0; i < N; i++) cin >> DP... | 1 | 73,526,307 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int n; cin>>n;
ll mo = 1000;
ll ka = 0;
vector<int> a(n);
for(auto &i:a) cin>>i;
for(int i=0; i<n-1; i++){
if(a.at(i)<=a.at(i+1)){
ka += mo/a.at(i);
mo %= a.at(i);
}
else{
mo +... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long int n,s=1000,t=0,q=0,r=1000,g=0,d=0;
cin>>n;
long long int arr[n+1];
for(int i=0;i<n;i++)
cin>>arr[i];
arr[n]=0;
for(int i=0;i<n;i++)
{
if(arr[i+1]>arr[i] &&q==0)
{
t=s/arr[i];
s=s%arr[i];
q++;
}
else if(arr[i]=... | 1 | 78,849,559 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){ string a, b; int ans = 0;
cin >> a >> b;
for (int i=0; i<a.length(); i++){
if(a[i] != b[i]){
++ans;
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int moji=0;
string S,T;
cin >> S >> T;
for(int i=0;i<S.size();i++) {
if(S.at(i)==T.at(i)) {
moji++;
}
}
cout << S.size()-moji << endl;
} | 1 | 94,376,594 |
#include<iostream>
using namespace std;
int main(){
int x1,y1,x2,y2,x3,y3,x4,y4;
cin >> x1 >> y1 >> x2 >> y2;
x3=x2+y1-y2;
y3=y2-x1+x2;
x4=x1-y2+y1;
y4=x2-x1+y1;
cout << x3 << " " << y3 << " " << x4 << " " << y4 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 1 | 19,462,470 |
#include<iostream>
#include<queue>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
class position{
public:
int x,y;
};
int main(){
int a,b,n;
while(1){
cin>>a>>b;
if(!a && !b)break;
int dt[a][b];
cin>>n;
position error[n];
rep(i,n){
int ax,ay;
cin>>ax>>ay;... | #include<iostream>
#include<algorithm>
using namespace std;
int a, b, cnt = 0, edge[18][18];
void search(int x, int y) {
if (x == a && y == b) {
cnt++;
return;
}
switch (edge[x][y]) {
case 0:
return;
case 1:
search(x, y + 1);
break;
case 2:
search(x + 1, y);
break;
case 3:
search(x, y + 1);
s... | 1 | 100,389,680 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m; cin >> n >> m;
vector<pair<ll, ll>> pa;
for (ll i = 0; i < n; i++) {
ll a, b; cin >> a >> b;
pa.push_back({ a,b });
}
sort(pa.begin(), pa.end());
ll cnt = m;
ll ans = 0;
for (ll i = 0; i < pa.size(); i++) {
if (pa[i]... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define SIZE(a) int((a... | 1 | 72,293,718 |
#include<bits/stdc++.h>
#include <stdlib.h>
#include <stdio.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a,n) vector<int> (a)((n));
#define Vec(a,n) vector<string> (a)((n));
#define twovec(a,n,m) vector<vector<int>> a(n,vector<... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
void chmax(ll &a, ll b){
if( a < b){ swap(a,b);} return ;}
void chmin(ll &a, ll b){
if( a > b){ swap(a,b);} return ;}
int main(){
ll N,Z,W; cin >> N >> Z >> W;
vector<ll> A(N);
for(ll i = 0; i < N; i++){ cin >> A[i];}
... | 1 | 90,304,449 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
int main(){
string s;
cin >> s;
int a = s.at(0) - '0', b = s.at(1) - '0', c = s.at(2) - '0', d = s.at(3) - '0';
for(int i = 0; i < 8;i++){
bitset<3> s(i);
vector<char> fugou(3);
int temp ... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double EPS = 1e-10;
bool rec(int n, vector<int>& num, vector<bool>& isPlus) {
if (n == (int) ... | 1 | 74,132,553 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 1 | 92,104,111 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
int64_t result = 0;
if (N % 2 == 0) {
N /= 2;
int64_t p = 5;
while (p <= N) {
result += N /... | #include<bits/stdc++.h>
using namespace std;
#define GO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
const int maxr = 2e5 + 5;
int arr[maxr];
int32_t main()
{
GO;
int n;
cin >> n;
if ((n & 1))
cout << 0 << endl;
else {
int count = 10, ans = 0;
while ((n / count) > 0) {
ans +... | 1 | 75,409,951 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int IN... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n, m, d;
int total = 0;
std::vector<int> days;
cin >> n >> m;
for(int i=0; i < m; i++){
cin >> d;
total += d;
}
if(total > n) cout << -1;
else cout << n - total;
} | 1 | 35,148,867 |
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <iomanip>
#include <math.h>
#include <algorithm>
#define hmm "\n"
#define test() int t; cin>>t; while(t--)
#define ll long long int
#define ull unsigned long long
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
vo... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define pi acos(-1.0)
int main()
{
ll n, i, j;
cin >> n;
cout << n * n << endl;
return 0;
} | 1 | 84,128,298 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll Mod = 1000000007;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<pair<int,int>> P1(100001);
vector<pair<int,int>> P2(100001);
for (int i = 0; i < 100001; i++) {
P1[i].first = 0;
... | #include<iostream>
#include<vector>
#include<unordered_map>
#include<climits>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>v(n);
unordered_map<int,int>ump1,ump2;
for(int i=0;i<n;i++)
{
cin>>v[i];
}
for(int i=0;i<n;i+=2){
ump1[v[i]]++;
}
for(int i=1;i... | 1 | 87,223,616 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.