code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T euqlid(T a, T b){
if(a < b){
int x = a;
a = b;
b = x;
}
T q, r;
q = b;
r = a % b;
if(r) return euqlid(q, r);
else return q;
}
int main(){
long long a, b, c, d;
cin >> a >> b >> c >> d;
l... | #include <iostream>
using namespace std;
long long gcd(long long x,long long y){
if (x%y == 0) return(y);
else return(gcd(y, x%y));
}
long long lcm(long long x,long long y){
return x*y/gcd(x,y);
}
int main(){
long long a,b,c,d;
cin >> a >> b >> c >> d;
cout << b-(a-1)-b/c+(a-1)/c-b/d+(a-1)/d+b/lcm(c,d)-(a-... | 1 | 13,868,777 |
#include<iostream>
#include<vector>
using namespace std;
vector<int> SelectSort(vector<int> A,int n)
{
int flag;
int count = 0;
for(int i=0;i<n-1;i++){
int minj = i;
flag = 0;
for(int j=i+1;j<n;j++){
if(A[j] < A[minj]){
minj = j;
flag = 1;
}
}
if(flag == 1){
swap(A[i],A[minj]);
count++;... | #include <iostream>
#include <vector>
#include <algorithm>
#define INPUT_FROM_FILE (0)
#if INPUT_FROM_FILE
#include <fstream>
#endif
#if INPUT_FROM_FILE
#define IS ifs
#else
#define IS std::cin
#endif
int main(int argc, char **argv) {
#if INPUT_FROM_FILE
std::ifstream ifs("test.txt");
#endif
int n = 0;
std::vector<i... | 1 | 10,804,130 |
#include <iostream>
using namespace std;
int solve(int n, int s, int l) {
if (n == 0) {
if (s == 0) return 1;
else return 0;
}
int res = 0;
for (int i = l + 1; i < 10; i++) {
res += solve(n - 1, s - i, i);
}
return res;
}
int main() {
int n, s;
while (cin >> n >> s) {
if (n == 0 && s == 0) break;
cout... | #include<cstdio>
using namespace std;
int s;
int func(int now,int sum,int num){
int count=0;
if(!num)return s==sum?1:0;
if(now==10 || !num || sum>s) return 0;
count+=func(now+1,sum+now,num-1);
count+=func(now+1,sum,num);
return count;
}
int main(void){
int n,i;
while(scanf("%d %d",&n,&s),n){
printf("%d\n",fun... | 1 | 72,460,695 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s, t;
cin >> s >> t;
map<char, set<char>> ss, tt;
for(int i = 0; i < s.size(); i++){
tt[t[i]].insert(s[i]);
ss[s[i]].insert(t[i]);
}
bool flag = true;
for(auto c : s){
if(ss[c].size... | #include<bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
vector<set<int>>alf(26),alf2(26);
for(int i=0,l=a.size();i<l;i++){
alf.at(b.at(i)-'a').insert(a.at(i)-'a');
alf2.at(a.at(i)-'a').insert(b.at(i)-'a');
}
bool ans=true;
for(int i=0;i<26;i++)if(alf.at(i).size()>1||alf... | 1 | 15,272,353 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int a,b,c;
string s;
cin >> a >> b >> c;
if (a < b && b < c) s = "Yes";
else s = "No";
cout << s << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int i, j, k;
cin >> i >> j >> k;
if (i < j && j < k) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 1 | 96,641,274 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#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 repitr(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(n) begin(n), end(n)
usin... | #include<bits/stdc++.h>
#define endl "\n"
#define int long long
#pragma GCC optimize(3)
using namespace std;
int n,a[10005],b[10005],s1,s2;
signed main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n*2;i++)
(i>n)?(cin>>b[i-n]):(cin>>a[i]);
for(int i=1;i<=n;i++)
(a[i]>b[i])?(s1+=(a[i]-b[i])):(s2+=(b[i]... | 1 | 65,031,078 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
int main(void){
int n,k;
cin >> n >> k;
vector<int> ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono c... | 1 | 21,293,569 |
#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 ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
int mn[1 << 26];
signed main() {
string s;
cin >> s;
int n = ... | #include <bits/stdc++.h>
using namespace std;
#define N 201000
char s[N];
int n,sum[N],f[N],g[1<<26];
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
for (int i=1;i<=n;i++) sum[i]=sum[i-1]^(1<<(s[i]-'a'));
memset(f,0x3f,sizeof(f));
memset(g,0x3f,sizeof(g));
g[0]=0;
for (int i=1;i<=n;i++)
{
f[i]=min(f[i],g[sum[i]... | 1 | 44,759,225 |
#include <iostream>
using namespace std;
int main(void){
int A,B,M;
cin>>A>>B>>M;
int a[A] = {};
int b[B] = {};
int amin=100000,bmin=100000;
for(int i=0;i<A;i++){
int ai;
cin>>ai;
a[i] = ai;
amin = min(amin, ai);
}
for(int i=0;i<B;i++){
int bi;
... | #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 | 89,758,790 |
# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
... | 1 | 38,300,752 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t,c,m=0;
cin>>n;
ll arr[n+1],brr[n];
for(i=0;i<n+1;i++) cin>>arr[i];
for(i=0;i<n+1;i++) m+=arr[i];
for(i=0... | 1 | 35,107,330 |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <string>
#include <iostream>
using namespace std;
int H, A[2000000];
int parent(int i) {
return i / 2;
}
int left(int i) {
return 2 * i;
}
int right(int i) {
return 2 * i + 1;
}
void maxHeapify(int i) {
int l = left(i);
int r = right(i);... | #include<bits/stdc++.h>
using namespace std;
int parent(int i){return i / 2;};
int left(int i){return 2 * i;};
int right(int i){return 2 * i + 1;};
int upper = 2000000;
int n = 0;
vector<int> a(upper + 1);
void maxHeap(vector<int> &a, int i){
int l = left(i);
int r = right(i);
int largest;
if(l <= n && ... | 1 | 56,049,326 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string X;
cin >> a >> X >> b;
if (X == "+") cout << a + b << endl;
if (X == "-") cout << a - b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a,c;
string b;
cin>>a>>b>>c;
if(b=="+"){
cout<<a+c<<endl;
}
else if(b=="-"){
cout<<a-c<<endl;
}
} | 1 | 6,705,542 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int a[n];
for (int i=0; i<n; i++) cin>>a[i];
map<int, vector<int>> m;
for (int i=0; i<n; i++) {
m[a[i]].push_back(i);
}
vector<pair<int, vector<int>>> v;
for (auto i: m) {
v.emplace_back(i.first, i.second);
}
reverse... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
const int N=100000;
co... | 1 | 91,010,765 |
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define all(a) (a)... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define mod 1000000007
typedef long long ll;
using namespace std;
int main(){
int N,A,B,C; cin>>N>>... | 1 | 97,960,475 |
#include <stdio.h>
#include <iostream>
#include <utility>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
#define inf 2000000001
vector<int> S = {inf};
int parent(int i)
{
return i / 2;
}
int left(int i)
{
return 2 * i;
}
int right(int i)
{
return 2 * i + 1;
}
void maxHeapify(v... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int parent(int i) {
return (i+1)/2 - 1;
}
int left(int i) {
return 2*(i+1) - 1;
}
int right(int i) {
return 2*(i+1)+1 - 1;
}
void downHeap(vector<int> &A,int i) {
int n = A.size();
int l = left(i);
int r = right(i);
int largest ... | 1 | 68,088,972 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include<bits/stdc++.h>
using namespace std;
typedef long long int INT;
int main()
{
INT n;
cin>>n;
INT ans=1e13;
for (int i=1;i<=sqrt(n);i++){
double a=(double)n/i;
if(floor(a)==a)
{
if(i+n/i<=ans){
ans=i+n/i;
}
}
}
cout<<a... | 1 | 4,601,700 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 1 | 70,321,296 |
#include<bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define mod 1000000007
#define FASTIO ios::sync_with_stdio(0); cin.tie(0);
#define REP(i,a,b) for(int i=a;i<b;i++)
#define maxx 1000001
using namespace std;
typedef long long ll;
typedef vector<int> vi;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int S = 0;
for (int i = 0; i < B - A + 1; i++) {
int a, b, c, d;
a = ( A + i ) / 10000;
b = ( A + i ) / 1000 % 10;
c = ( A + i ) / 10 % 10;
d = ( A + i ) % 10;
if ( a == d && b == c) {S++;}
}
cout <<... | 1 | 95,006,467 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int32_t main(){
int n;
scanf("%lld",&n);
for (int x = 0; x<n; x++){
scanf("%lld",&arr[x]);
}
int mn = 2;
int mx = 2;
for (int x = n-1; x>=0; x--){
mn = ((mn-1)/arr[x]+1)*arr[x];
mx = ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | 1 | 16,152,907 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
using namespace std;
int main()
{
int n,sum=0; cin>>n;
if(n==100000) cout<<90909;
else if(n>=10000) cout<<(n-9999)+909;
else if(n>=1000) cout<<909;
else if(n>=100) cout<<n-99 + 9;
else if(n>=10) cout<<9;
else cout<<n;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0,ans = 0;
cin >> N;
rep(i,N+1){
if(i == 0){
continue;
}
else if(i < 10){
ans++;
}
else if(i > 99 && i < 1000){
ans++;
}
else if(i... | 1 | 84,342,703 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> a(N);
for(auto &i:a)cin >> i;
long long ans=0;
long long count;
do{
count=0;
for(int i=0;i<N;i++){
long long t=a[i]/N;
count+=t;
a[i]-=N*t;
a[i]-=t;
}
for(int i=0;i<N;i++)a[i]+=count;
ans+=count;
}... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >=... | 1 | 45,351,246 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vect... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 1 | 82,329,786 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
ll K,A,B;
cin >> K >> A >> B;
cout << max(K+1, max(0ll,(K+1-A)/2)*(B-A)+((K>A-2)?A:0)+(((K+1-A)/2>0)?((K+1-A)%2):0)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const double PI=acos(-1);
int main(){
ll K,A,B;
cin >> K >>... | 1 | 11,845,738 |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a, memo;
long long solve();
int main() {
cin >> n;
++n;
a.resize(n);
for (auto &p : a) cin >> p;
cout << solve() << endl;
return 0;
}
long long solve() {
long long res = 0, now = 1;
memo.assign(n, 0);
memo[n - 1] = a[n - 1];
... | #include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int a[100050];
void solve()
{
int n;
ll ans=1,m=1,sum=0;
cin>>n;
for(int i=0;i<=n;i++)
{
cin>>a[i];
sum+=a[i];
}
if(n>0&&a[0]>0||n==0&&a[0]>1)
{
cout<<"-1\n";
return;
}
... | 1 | 50,088,952 |
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,ans = 0;
cin >> n;
vector<long long> a(n),b(n);
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
long long s = 0;
vector<long long> v;
rep(i,n){
... | #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... | 1 | 66,289,382 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
const long MAX = 2000000;
const long INFTY (1<<30);
long H, A[MAX + 1];
void maxHeapify(long i){
long l = 2 * i;
long r = 2 * i + 1;
long largest;
if (l <= H && A[l] > A[i]){
largest = l;
}
else {
largest = i;
}
if (r <= H && A[... | 1 | 69,716,055 |
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <math.h>
#include <string>
#include <map>
#include <cstdlib>
#include <sstream>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P... | #pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | 1 | 26,707,116 |
#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, P;
cin >> A >> P;
P = P + (3 * A)... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main(){
int a,p;
cin >> a >> p;
int ans = (3*a+p)/2;
cout << ans << endl;
} | 1 | 54,566,428 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &i : a) c... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 1 | 1,249,133 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#pragma region Deb... | #include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=1e5+10,INF=1e9+4;
int dp[MAXN],N,ans=0;
int main(){
scanf("%d",&N);
fill(dp+1,dp+N+1,INF);
for(int i=1;i<=N;i++){
int temp;
scanf("%d",&temp);
auto l=lower_bound(dp+1,dp+1+i,temp);
*l=temp;
ans... | 1 | 51,633,578 |
#include <bits/stdc++.h>
int main(){
int N, K;
std::cin >> N >> K;
std::vector< int > X(N);
std::vector< int > Y(N);
for(int i=0; i<N; i++){
std::cin >> X[i] >> Y[i];
}
long long min = 4e18;
for(int x1=0; x1<N; x1++){
for(int x2=x1+1; x2<N; x2++){
for(int y1=0... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <numeric>
#include <array>
#include <cmath>
#include <memory>
using namespace std;
#define DEB(variable) cout << #variable << '=' << variable << endl
#define FOR(LoopVariable,numberOFbegin,numberOFend) for (long lon... | 1 | 42,869,416 |
#include <stdio.h>
#include <iostream>
int main()
{
long long a, b, r=1, temp;
long long A, B;
std::cin >> a >> b;
A = a; B = b;
if (a < b)
{
temp = a;
a = b;
b = temp;
}
while (r != 0)
{
r = a % b;
a = a / b;
a = b;
b = r;
}
std::cout << A*B/a << std::endl;
} | #include <cstdio>
typedef long long ll;
using namespace std;
ll gcd(ll a,ll b){
if(a==0)return b;
return gcd(b%a,a);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ll a,b;scanf("%lld %lld",&a,&b);
ll num = lcm(a,b);
printf("%lld",num);
return 0;
} | 1 | 58,445,252 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <iostream>
#include <vector>
#include <algorithm>
using ll = long long;
#define rep(i, n) for(ll i = 0; i < n; i++)
using namespace std;
using P = pair<ll, ll>;
int main(){
ll n, m;
cin >> n >> m;
vector<P> ab(n);
rep(i, n){
ll a, b;
cin >> a >> b;
ab[i] = P(a, b);
}
sort(ab.begin(), ab... | 1 | 32,841,378 |
#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) f... | #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 | 62,376,268 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) begin(x), end(x)
#define chmax(x,y) x = max(x,y)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
int main(){
string s;
cin>>s;
int sum=0;
rep(i,s.size()){
sum+=s[i]-'0';
}
if(sum%9) puts("No");
else pu... | #include<iostream>
#include<stdio.h>
using namespace std;
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<(n);i++)
const int mod=1000000007;
int main(){
char s[200010];
scanf("%s",s);
int len=strlen(s);
int sum=0;
rep(i,len)sum+=s[i]-'0';
if(sum%9==0)cout<<"Yes"<<endl;
else cout<<"No"<... | 1 | 11,378,277 |
#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() {
long long N;
cin >> N;
long long total = 0;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
total = i;
}
}
long long result = N / total;
long long count = 0;
while (result != 0) {
result = result / 10;
count++;
}
cout << count <<... | 1 | 10,599,610 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
using namespace std;
typedef long long ll;
typedef l... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | 1 | 86,395,547 |
#include <iostream>
#include <vector>
using namespace std;
int N, K;
int main() {
long long Height[15];
long long copyHeight[15];
long long ans = 1000000000000;
cin >> N >> K;
for ( int i = 0; i < N; ++i ) {
cin >> Height[i];
}
for ( int bit = 0; bit < (1 << N); ++bit ) {
int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define MEMSET(v, h) memset((v), h, sizeof(v))
#define sq... | 1 | 70,016,300 |
#include <algorithm>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
pair<int, int> pd[10000];
void solve(int n, ll m) {
ll ans = 0;
for(int i = 0; i < n; i++) {
cin >> pd[i].second >> pd[i].first;
ans += pd[i].first * pd[i].second;
}
sort(pd, pd + n,
[](auto... | #include<bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (!n) return 0;
int l[12] = {};
for (int i = 0; i < n; ++i) {
int d, p;
cin >> d >> p;
l[p] += d;
}
i... | 1 | 58,077,570 |
#include <iostream>
#include <queue>
#include <string>
using namespace std;
void insert(priority_queue<int> &q, int k)
{
q.push(k);
return;
}
int extractMax(priority_queue<int> &q)
{
if (q.empty())
{
return -1;
}
int max = q.top();
q.pop();
return max;
}
int main()
{
string c... | #include <algorithm>
#include <cstdio>
#include <vector>
class PriorityQueue {
std::vector<int> v_;
public:
void insert(int i)
{
v_.push_back(i);
upto(v_.size()-1);
}
int extract_max()
{
const auto max = v_.front();
v_[0] = v_.back();
v_.pop_back();
downto(0);
return max;
}
pri... | 1 | 52,939,680 |
#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e10;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int M,K;
cin >> M >> K;
if(K > pow(2,M)-1) {
cout << -1 << endl;
return 0;
}
if(M == 1) ... | 1 | 74,082,838 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
const int MOD = 1'000'000'007;
template <typename T>
void print(const T &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
... | 1 | 61,146,190 |
#include <iostream>
using namespace std;
const int INF = 1<<29;
const int N = 10;
int main(){
int n;
while(true){
cin >> n;
if(!n) break;
int dp[N][N];
for(int i=0;i<N;i++)
for(int j=0;j<N;j++) dp[i][j] = INF;
int a,b,c;
while(n--){
cin >> a >>... | #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <algorithm>
const int kMaxTown = 10;
const int kInf = 1 << 16;
int cost[kMaxTown][kMaxTown];
int main(){
while (1){
int n;
scanf(" %d", &n);
if (n == 0) break;
for (int i = 0; i < kMaxTown; i++)
for (int j = 0; j < kMaxTown; j++)
cost[i][j] = (i... | 1 | 37,251,801 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string S;
cin >> A >> B >> S;
if (S[A] != '-') {
cout << "No" << endl;
return 0;
}
for (int i = 0; i < A; i++) {
if (!(S[i] >= '0' && S[i] <= '9')) {
cout << "No" << endl;
return 0;
}
}
for (int i = A + 1; ... | #include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | 1 | 17,689,322 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int k;
cin >> k;
if(a>=b){
while(k--){
b*=2;
if(a<b)break;
}
}
if(b>=c){
while(k--){
c*=2;
if(c>b)break;
}
}
if(c>b&&b>a)cout << "Yes" << endl;
else cout << "No" << en... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int r,g,b,k;
cin>>r>>g>>b>>k;
while(g<=r && k) k--,g*=2;
while(b<=g && k) k--,b*=2;
if(b>g && g > r) cout<<"Yes";
else cout<<"No";
} | 1 | 70,691,371 |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#in... | #include <stdio.h>
#include <string.h>
int main(){
int a=0,i,size;
int k[50];
char s[50];
while(1){
scanf("%s",s);
if(s[0]=='#') break;
size=strlen(s);
for(i=0;i<size;i++){
if(s[i]=='y'||s[i]=='u'||s[i]=='i'||s[i]=='o'||s[i]=='p'||s[i]=='h'||s[i]=='j'||s[i]=='k'||s[i]=='l'||s[i]=='n'||s[i]... | 1 | 48,689,801 |
#include<bits/stdc++.h>
#define N 100005
#define LL long long
using namespace std;
vector<int> G[N];
int n,a[N],d[N],rt;
void GG(){ printf("NO"); exit(0);}
void dfs(int t,int fa)
{
int i; LL Max=0,x,sum=0;
if(d[t]==1) return ;
for(i=0;i<G[t].size();i++)
if(G[t][i]!=fa) dfs(G[t][i],t);
for(i=0;i<G[t].size();i++)
... | #include<bits/stdc++.h>
using namespace std;
vector<int> e[100010];
int a[100010];
long long int dp[100010];
bool flag = true;
void dfs(int x,int p){
if(e[x].size()==1) dp[x]=a[x];
else dp[x]=a[x]*2;
for(int it:e[x])
if(it!=p){
dfs(it,x);
dp[x]-=dp[it];
if(e[x].size()>1&&dp[it]>a[x]) flag = false;
}
if... | 1 | 82,208,247 |
#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 <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 1 | 65,722,525 |
#include <iostream>
using namespace std;
int main() {
int H, W;
bool loop = true;
while (loop) {
cin >> H >> W;
if ((H == 0) && (W == 0)) {
loop = false;
continue;
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cout << "#";
}
cout << endl;
}... | #include <cstdio>
using namespace std;
int main() {
int H,W;
while(1) {
scanf("%d%d",&H,&W);
if (H==0 && W ==0) break;
for(int j=0;j<H;++j) {
for(int i=0;i<W;++i) {
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
} | 1 | 43,575,728 |
#define scanf_s scanf
#include <stdio.h>
#include <string>
#include <iostream>
#include <math.h>
using namespace std;
#define MAX 50
#define MIN -100001
#define _MAX 100
int main(void)
{
int a[_MAX] = { 0 }, x, max = 0;
while (scanf_s("%d", &x) != EOF) {
++a[x - 1];
if (a[x - 1] > max) max = a[x - 1];
}
for (in... | #include <stdio.h>
#include <array>
#include <algorithm>
int
main(void)
{
char line[80];
int a;
std::array<int, 101> h;
for (int& s: h) {
s = 0;
}
while (true) {
if (fgets(line, sizeof line, stdin) == NULL) {
break;
}
if (sscanf(line, "%d", &a) != 1) {
break;
}
h[a] ++;
}
int m = *(std::max_el... | 1 | 91,557,503 |
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
int n;
string s;
void Try(int a,int b){
vector<int> color(n);
color[0]=a;
color[1]=b;
for(int i=2;i<n;++i){
if(color[i-1]) color[i]=color[i-2]^(s[i-1]=='x');
else color[i]=color[i-2]^(s[i-1]!='x');
}
if(color[n-1]&&((s[n-1]=='x')^(color[n-2]!=... | #include<bits/stdc++.h>
using namespace std;
int zz[100005],n;
char dat[100005];
bool check(){
if(!((dat[0]=='x')==zz[1]^zz[n-1]^zz[0])) return false;
if(!((dat[n-1]=='x')==zz[n-2]^zz[n-1]^zz[0])) return false;
return true;
}
int main(){
scanf("%d%s",&n,dat);
dat[0];
for(int i=0;i<2;i++){
for(int j=0;j<2;j++){
... | 1 | 8,967,963 |
#include <stdio.h>
#include <string.h>
int main(void){
char s[3];
scanf("%s", s);
if(!strcmp(s, "AAA") || !strcmp(s, "BBB")){
printf("No\n");
}
else{
printf("Yes\n");
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | 1 | 94,796,685 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
typedef long long ll;
int main() {
int N, K;
cin... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | 1 | 60,175,014 |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fr, to) for (int i = fr; i <= to; ++i)
#define foreach(i, dat) for (__typeof(da... | # include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <pii, int> ppi;
typedef pair <int, pii> ... | 1 | 47,342,859 |
# include <bits/stdc++.h>
using namespace std;
using msi = map<string, int>;
int main() {
string s, t;
cin >> s >> t;
int a, b;
cin >> a >> b;
msi mp;
mp[s] = a;
mp[t] = b;
string u;
cin >> u;
mp[u]--;
printf("%d %d\n", mp[s], mp[t]);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string s,t,u;
cin>>s;
cin>>t;
cin>>a;
cin>>b;
cin>>u;
if(s==u)
a=a-1;
else if(t==u)
b=b-1;
cout<<a<<" "<<b;
return 0;
} | 1 | 70,172,981 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c)
cout << 1 << endl;
else if (a == b || b == c || c == a)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
set <int>d{a,b,c};
cout << d.size() ;
return 0;
} | 1 | 75,424,287 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
const int INF = 500000;
int n, m;
vector<int> G[200000];
int dijkstra() {
vector<int> dp(200000, INF);
vector<bool> done(200000, false);
priority_queue<pair<int, int> > Q... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef vector<vector<int>> Graph;
const int INF = 1e9;
co... | 1 | 44,954,974 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
string s;
cin >> s;
vector<int> hash(26, 0);
for(int i=0; i<(int)s.length(); ++i){
hash[s[i]-'a']++;
}
for(int i=0; i<26; ++i){
if(hash[i] == 0){
char c = 'a'+i;
cout << c;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
string S;
cin >> S;
bool alphabet[26];
rep(i, 26) alphabet[i] = false;
for (int i = 0; S[i] != '\0'; ++i) {
alphabet[S[i]-'a'] = true;
... | 1 | 50,537,193 |
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) f... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<unordered_map>
#include<functional>
#include<map>
#include<iomanip>
#include<limits>
#include<unordered_set>
#include<cmath>
#include <numeric>
#include <array>
#include<utili... | 1 | 13,292,517 |
#include <iostream>
#include <vector>
using namespace std;
#define rep(i,x,y) for(int (i)=(x);(i)<(y);(i)++)
int solve(int Y,int M,int D)
{
return (Y-1)/3*200+((Y-1)-(Y-1)/3)*195+(M-1)*20-((Y%3==0)?0:(M-1)/2)+D;
}
int main()
{
int n;
cin>>n;
int temp=solve(1000,1,1);
rep(i,0,n){
int Y,M,D;
cin>>Y>>M>>... | #include <iostream>
using namespace std;
int big = 200;
int small = 195;
int CalcTime(int y,int m,int d){
int sum = 0;
for (int i = 1; i < y; i++){
if (i%3 == 0){
sum += 200;
}
else{
sum += 195;
}
}
if (y%3 == 0){
sum += 20 * (m - 1);
}
else{
for (int i = 1; i < m; i++){
if (i%2 == 0){
su... | 1 | 90,777,553 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long A,B,K;
cin >> A >> B >> K;
int i=0;
while (K>i) {
if (i%2==0) {
B+=A/2;
A/=2;
i++;
}
else {
A+=B/2;
B/=2;
i++;
}
}
cout << A << " " << B << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int k;
cin >> k;
for (int i = 1; i <= k; i++) {
if (i%2) {
b += a/2;
a /= 2;
}
else {
a += b/2;
b /= 2;
}
}
cout << a << " " << b... | 1 | 84,649,850 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repbit(bit,n) for (int bit = 0; bit < (1<<n); bit++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
ll a, b, v, w, t;
int main() {
ll n;
cin >> n;
ll tmp = INF;
for (int a = 1; a <= sqrt(n); a++) {
if (n % a !=... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
int a = 1;
for (int i=1; i<=sqrt(n); i++) {
if (n % i == 0) a = max(a, i);
}
int b = n / a;
int ans = 0;
int x = max(a, b);
while(x > 0) {
ans++;
x/=10;
}
cout << ... | 1 | 76,299,215 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
return b != 0 ? gcd(b, a % b) : a;
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
main() {
string s;
cin >> s;
int ans = 0;
for(int i=0;i<s.size();i++){
if(s.at(i)=='x')ans++;
}
if(ans<8){
cout<<"YES"<<en... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;cin>>S;
if(count(S.begin(),S.end(),'x')<8)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | 1 | 41,167,252 |
#include <bits/stdc++.h>
using namespace std;
#define LIMIT 1000000000000000000
typedef long long ll;
int main(void){
ll a, b, c, k;
cin >> a >> b >> c >> k;
if (abs(a-b) > LIMIT){
cout << "Unfair" << endl;
} else{
cout << (k%2==1 ? -(a-b) : a-b) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long
#define puts(i) cout<<i<<endl;
int main(){
ll a[3],n;
cin>>a[0]>>a[1]>>a[2]>>n;
cout<<(a[0]-a[1])*(n%2==0?1:-1)<<endl;
} | 1 | 53,898,503 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
string s;
... | #include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;i++)
#define MOD 1e9+7
#define EPS 1e-8
#define INF 1e9+10
typedef long long ll;
using namespace std;
int main()
{
string s;
cin >> s;
rep(i,0,s.length()){
cout << s[i];
if(i==3){cout << " ";}
}
cout << endl;
} | 1 | 10,424,490 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <string.h>
#include <stack>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
string s;
cin >> s;
... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | 1 | 48,580,022 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
int main() {
int N; cin >> N;
int a[N]; rep(i,N) cin >> a[i];
int result = 0, count = 0;
rep(i,N) {
if... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
int counter = 0;
for (int i = 1; i < N; i++)
{
if (A[i - 1] == A[i])
{
counter+... | 1 | 31,310,200 |
#include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int n,k;
int ans;
signed main(){
ios_base::sync_with_stdio(0);
cin>>n>>k;
... | #include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | 1 | 16,853,965 |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define mk mak... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#d... | 1 | 65,500,893 |
#include <iostream>
#include <cmath>
#include <algorithm>
#define rep(i, n) for(int i=1; i<=n; i++)
using namespace std;
int main(){
int N;
cin >> N;
int A[N+1];
rep(i, N)
cin >> A[i];
int sub[N];
rep(i, N)
sub[i] = A[i]-i;
sort(sub+1, sub+N+1 );
int b = sub[N/2 + 1];
long long ans = 0;
rep(... | #include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
#include<stack>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#def... | 1 | 11,710,357 |
#include<bits/stdc++.h>
#define MIN -1000000
using namespace std;
typedef long long ll;
typedef pair <int,int> pii;
typedef pair<ll,ll> pll;
const int MOD=1e9+7;
bool Tmax[100005];
bool Amax[100005];
int N;
ll T[100005],A[100005],Tmx=0,Amx=0;
int main(void)
{
ll ans=1;
memset(Tmax,true,sizeof(Tmax));
memset(Amax,... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | 1 | 41,594,873 |
#include <bits/stdc++.h>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ull= unsigned long long;
const ll K_MAX=1e5+5;
const ll Lmax=ll(1e18);
const ll Nmax=1e9;
const ll INF=1e9;... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
if (N % 2 == 1) {
... | 1 | 28,902,768 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll maxi=1e18;
int main(){
int n;cin>>n;
ll x;
long double zbr=1;
for(int i=0;i<n;i++){
cin >>x;
if(zbr!=-1)
zbr*=x;
if(zbr>1000000000000000000 || zbr<0){
zbr=-1;
}
if(x==0... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int64_t N;
cin >> N;
int64_t a, r = 1, ee = 1e18;
vector<int64_t> arr;
bool z = 0;
for (int i = 0; i < N; ++i) {
cin >> a;
if (a == 0) {
z = 1;
}
arr.push_back(a);
... | 1 | 35,073,926 |
#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) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<math.h>
#include<assert.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long INF = 1LL << 40;
const doub... | 1 | 59,507,778 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 10000000000
using namespace std;
using ll = long long;
int memo[90005];
int main()
{
int h, w, d;
cin >> h >> w >> d;
map<int, pair<int, int>> mp;
rep(i,h){
rep(j,w){
int a;
cin >> a;
... | #include <bits/stdc++.h>
#define F first
#define S second
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 = 310, M = 1010;
int n, m, d, k;
int g[N][N];
PII p[N * N];
vector<vector<LL>> h;
... | 1 | 70,127,026 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(vec) vec.begin(), vec.end()
#define mp(a, b) make_pair(a, b)
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = (1e9 + 7);
using namespace std;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A = 0, B = 0, sum = 0;
cin >> N;
rep(i, N){
cin >> A >> B;
sum = sum + B - A + 1;
}
cout << sum << endl;
return 0;
} | 1 | 27,449,896 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
int main(int argc, char* argv[]){
cin.tie(0);... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
int ans=s.size(),n=s.size();
rep(i,2){
int cnt=0;
rep(j,n){
if(j%2==0&&s[j]!=(char)(i+'0'))cnt++;
if(j%2==1&&s[j]==(c... | 1 | 60,442,880 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cout << 0 << endl;
cin >> s;
if(s == "Vacant"){
return 0;
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
type... | 1 | 63,645,512 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef p... | #include <stdio.h>
#include <algorithm>
using namespace std;
const long long mod = 998244353;
int n;
int d[120000];
int ex[120000] , mx;
long long ans;
long long ksm ( long long f , long long x ) {
long long s = 1;
while ( x ) {
if ( x % 2 ) s = s * f % mod;
f = f * f % mod; x = x / 2;
}
return s % mod;
}
void ... | 1 | 99,222,431 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <tuple>
#include <cstdio>
#include <math.h>
#include <c... | #include<iostream>
using namespace std;
typedef pair<int, int> pii;
int dx[]={0, 0, 1, -1};
int dy[]={1, -1, 0, 0};
char fld[20][21];
int used[20][20];
int W, H;
void rec(int i, int j){
used[i][j]=1;
for(int k=0; k<4; k++){
int ni=i+dy[k];
int nj=j+dx[k];
if(0<=ni&&ni<H&&0<=nj&&nj<W&&fld[ni][nj]... | 1 | 44,519,289 |
#include<stdio.h>
int main()
{
long int a, sqr[100050];
scanf("%ld", &a);
long int m=a;
long int max=0, v1=0, v2, cnt1=0;
for(long int i=0; i<a; i++)
{
scanf("%ld", & sqr[i]);
v2=sqr[i];
if(v1>=v2)
{
cnt1++;
}
if(cnt1>max)
{
... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
int main(){
int n;
cin >> n;
int ans = 0;
int m = 0;
int preH;
... | 1 | 58,043,078 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <iomanip>
#include <math.h>
using namespace std;
long long mod = 1000000007;
long long pow(long long x, long long k)
{
if (k == 0)
{
return 1LL;
}
long long temp = ... | #include <iostream>
using namespace std;
int main() {
int dec[10][10] = {}, len[10][10] = {};
for (int a = 1; a < 10; a++)
for (int b = 0; b < 10; b++) {
int x = a, y = b;
do {
x += y;
if (x < 10) { y = b; dec[a][b]++; }
else { y = ... | 1 | 49,131,801 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db long double
#define all(a) a.begin(),a.end()
#define pb push_back
#define f(i,l,u) for(ll i=l;i<u;i++)
#define lb lower_bound
#define ub upper_bound
#define pii pair<ll,ll>
ll fac[1000001];
void powe(ll p)
{
fac[0] = 1;
for (ll i =... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 1 | 59,720,532 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<ll, bool> mp;
ll a;
bool ok = true;
rep(i, n) {
cin >> a;
if (mp[a]) {
ok = false;
}
mp[a] = true;
}
if (ok) {
cout << "YES... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 1 | 59,028,619 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
int n;
cin >> n;
int count = 0;
if(n > 9){
count += 9;
}else{
count += n;
}
if(n > 999){
count += 900;
}else{
if(n > 99){
count += n - 100 + 1;
}
}
if(n > 99999){
count += 90000;
}else{
if(n > 9999){
count += n ... | #include <iostream>
#include <string>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, s, n) for(int i = s; i < n; i++)
using namespace std;
int main(){
int n;
cin >> n;
int ans = 0;
rep2(i, 1, n+1){
string s = to_string(i);
if (s.size() % 2 == 1) ans++;
}
cout << ans << endl;
return 0... | 1 | 3,356,822 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n+1,0);
for(int i=1;i<=n;i++)
cin>>a.at(i);
vector<int> d(n+1);
int s=0;
for(int i=0;i<n;i++){
d.at(i)=abs(a.at(i+1)-a.at(i));
s+=d.at(i);
}
d.at(n)=abs(a.at(n));
s+=d.at(n);
for(int i=1;i<=n;i++){
... | #include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | 1 | 55,351,541 |
#include <iostream>
#include <complex>
#include <cmath>
using namespace std;
#define X real()
#define Y imag()
#define PI M_PI
#define EPS (1e-10)
typedef complex<double> point;
double angle(point a,point b,point c){
double A=abs(b-c);
double B=abs(c-a);
double C=abs(a-b);
return acos((B*B+C*C-A*A)/(2.0*B*C));
}
... | #include<iostream>
using namespace std;
int main(){
double a[2],b[2],c[2],m[2][2],inv[2][2],det,ans[2],s,t;
while(cin >>a[0]>>a[1]>>b[0]>>b[1]>>c[0]>>c[1]>>ans[0]>>ans[1]){
b[0]-=a[0];
b[1]-=a[1];
c[0]-=a[0];
c[1]-=a[1];
ans[0]-=a[0];
ans[1]-=a[1];
m[0][0] = b[0];
m[1][0] = c[0];
... | 1 | 45,531,442 |
#include <iostream>
#include <algorithm>
#include <sstream>
using namespace std;
string itos(int n){
stringstream ss;
ss << n;
return ss.str();
}
string table = "mcxi";
int value[] = {1000,100,10,1};
int from(string s){
int num = 0;
int ans = 0;
for(int i = 0 ; i < s.size() ; i++){
if(~table.find(s[i])){
int... | #include <iostream>
using namespace std;
string ToMCXI(int v) {
char c[5] = "ixcm";
int k[4] = {1, 10, 100, 1000};
string ret = "";
for (int i = 3; i >= 0; --i) {
int d = v / k[i] % 10;
if (d > 1) ret += (char)(d + '0');
if (d > 0) ret += c[i];
}
return ret;
}
int FromMCXI(string mcxi) {
int ret = 0;
for ... | 1 | 68,648,820 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int H,W;
int dx[2] = {0,1};
int dy[2] = {1,0};
i... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(x) ll((x).size())
#define all(v) (v).begin(),(v).end()
#define trace(x) cerr << #x << " = " << x << endl
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define For(i,a,b) for(ll i = ll(a); i < ll(b);... | 1 | 81,131,595 |
#include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
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) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(ll __x = __start; __x < __end; __x++)
typedef tuple<ll, ll, ll> P;
int main() {
int n; cin >> n;
n--;
vector<P> A;
loop(i,0,n) {
int a, b, c; cin >> a >> b >> c;
A.emplace_back(a, b, c);
}
vector... | 1 | 15,641,614 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rre... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 1 | 44,305,252 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<int, ll> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, ... | #include <bits/stdc++.h>
#define file(x) freopen(#x".in","r",stdin); freopen(#x".out","w",stdout)
#define debug(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
typedef long long ll;
int read() {
int X=0,w=1; char c=getchar();
while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); }
while (c>='0'&&c<='9') X=X*10... | 1 | 71,189,563 |
#include <bits/stdc++.h>
using namespace std;
typedef long double ll;
ll A, B;
int main() {
cin >> A >> B;
ll out = -1;
for (double i = B; i <= 2000; i++) {
if (int(i*0.08)==A && int(i*0.1)==B) {
out = i;
break;
}
}
cout << out << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
bool flag=false;
int X=0;
while(!flag){
if (X*8/100==A&&X*10/100==B){
flag=true;
break;
}
X++;
if (X==1251){
break;
}
}
if (flag){
cout<<X<<endl;
}else{
cout<<-1<<endl;
}
} | 1 | 32,299,907 |
#include <bits/stdc++.h>
using namespace std;
#define INF (1<<31)-1
#define LINF (1LL<<63)-1LL
#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;}
#defi... | #include<cstdio>
#include<algorithm>
#include<iostream>
#define maxn 200+1
using namespace std;
int n,a[maxn],ans;
int main(){
scanf("%d",&n);
int md=n<<1;
for(int i=1;i<=md;++i)scanf("%d",&a[i]);
sort(a+1,a+1+md);
for(int i=1;i<=md;i+=2)ans+=a[i];
printf("%d\n",ans);
re... | 1 | 14,362,829 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using V = vector<ll>;
#define _GLIBCXX_DEBUG
#define rep(i, a, b) for(int i = a; i < b; i++)
#define ALL(v) v.begin(), v.end()
int main(){
char a,b; cin>>a>>b;
if(a==b)cout<<'H'<<endl;
else cout<<'D'<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
if(a==b)
{
cout<<"H"<<endl;
}
else
{
cout<<"D";
}
return 0;
} | 1 | 45,210,146 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#def... | 1 | 70,075,278 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 60;
ll a[N];
int main()
{
ll k;
cin >> k;
cout << "50" << endl;
ll x = k / 50 + 50;
ll y = k % 50;
ll z = x - y - 1;
if(y == 0)
{
for (int i = 1; i <= 50; i ++ )
{
... | #include<bits/stdc++.h>
using namespace std;
typedef long long lint;
lint ans[55];
int main(){
lint K; cin >> K;
for(int i=2;i<=50;i++){
lint x = (K+i-1) / i;
lint bt = (i+1) * (x-1) + i - K;
lint up = (i+1) * x + i - K;
if(up<=bt || (lint)1e16+1001<up) continue;
for(int ... | 1 | 27,530,080 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a,... | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n, c... | 1 | 82,692,733 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa,k)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<in... | #pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);
using namespace std;
int main(){
cin.tie(0);
... | 1 | 25,369,972 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.