code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int,long long> a, pair<int,long long> b){
return a.second > b.second;
}
int main() {
int n,k;
long long cnt = 0, num = 0;
long long ans = 0, sz;
cin >> n >> k;
vector<pair<int,long long>> a(n);
for(int i = 0; i < n; ++i) cin >> a[i].first >> a[i].second... | #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)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 1 | 17,238,022 |
#include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define ceil(n, m) ((n / m) + ( n % m ? 1 : 0))
#define fast_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int size=s.size();
string ans;
for(int i=0;i<size;i++) {
if(s[i]!='B') {
ans+=s[i];
} else if(s[i]=='B') {
if(ans.size()>0){
ans.pop_back();
}
}
}
size=ans.size();
for(int i=0;i<size;i++)
cout<<ans[i];
return 0;
} | 1 | 99,948,097 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int D,T,S;
cin >> D >> T >> S;
if ((D + T - 1) / T <= S) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 100001
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,int> Pi;
typedef ... | 1 | 62,180,478 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define MAX 1000
t... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define v2(v,n,m,init) vector<vector<i... | 1 | 52,032,537 |
#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--)
... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int a;
int n;
cin >> n >> a;
cout << n - a +1 << endl;
return 0;
} | 1 | 21,752,762 |
#include <algorithm>
#include <iostream>
int main() {
uint32_t A = 0, B = 0, C = 0, D = 0;
std::cin >> A >> B >> C >> D;
uint32_t start = std::max(A, C), end = std::min(B, D);
std::cout << (end > start ? end - start : 0) << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int A,B,C,D;
cin>>A>>B>>C>>D;
int low=max(A,C);
int up=min(B,D);
cout<<max(0,up-low)<<endl;
} | 1 | 12,980,280 |
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main() {
int W,H,x,y,r;
cin>>W>>H>>x>>y>>r;
if(x>=0&&x+r<=W&&y>=0&&y+r<=H){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int W,H,x,y,r;
cin>>W>>H>>x>>y>>r;
if(x==0||y==0||x==W||y==H){
cout<<"No"<<endl;
return 0;
}
else if(x+r>W || x-r<0){
cout<<"No"<<endl;
return 0;
}
else if(y+r>H || y-r<0){
cout<<"No"<<endl;
return 0;
}
else cout<<"Yes... | 1 | 97,552,698 |
#include <bits/stdc++.h>
using namespace std;
int main() {
set<int>s;int a,n,i;cin>>n;
for(i=0;i<n;i++){cin>>a;s.insert(a);}if(s.size()==n)cout<<"YES";
else cout<<"NO";
} | #include <bits/stdc++.h>
int main() {
int n; std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; ++i) std::cin >> a[i];
std::sort(a.begin(), a.end());
bool ok = true;
for (int i = 0; i < a.size()-1; ++i) {
if (a[i] == a[i+1]) ok = false;
}
if (ok) std::cout << "YES" << std::endl;
else st... | 1 | 57,484,196 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
vector<int> vec(3);
cin >> vec[0];
cin >> vec[1];
cin >> vec[2];
sort(vec.begin(),vec.end());
cout << 10*vec[2]+vec[1]+vec[0] << endl;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
int main(void) {
vector<int> numList(3);
int i = 0;
while (i < 3) {
cin >> numList[i];
i++;
}
sort(numList.begin(), numList.end(), greater<int>());
int answer = ... | 1 | 35,075,734 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
long long D = 1, ans = 0;
while (D <= B) {
long long Anum = (A-1) / (D * 2) * D + max(0ll, (A-1) % (D * 2) - (D - 1));
long long Bnum = B / (D * 2) * D + max(0ll, B % (D * 2) - (D - 1));
ans += D * ((Bnum... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A[2];
cin >> A[0] >> A[1];
A[0]--;
for (int i = 0; i < 2; i++) {
if (A[i] <= 0)
A[i] = 0;
else if (A[i] == 1)
A[i] = 1;
else if (A[i] % 4 == 0) {
A[i] = A[i];
} else if (A[i] % 4 == 1) {
A... | 1 | 47,369,301 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define ra... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define sort_be(a) sort(a.begin(), a.end());
#define reverse_be(a) reverse(a.begin(), a.end());
#define vi vector<int>
#define vvii(a, b, c) vector<vector<int>> a(b, vector<int>(c));
using namespace std;
using ll = long long;
int main(){
l... | 1 | 33,659,236 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <random>
#include <unordere... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
int main(void){
ll n;
string s;
cin >> n >> s;
int a[26] = {};
for (int i = 0; i < n; i++){
a[s[i]-'a']++;
}
ll ans = 1;
for (int i = 0; i < 26; i++){
ans = ans * (a[i] + 1) % MOD;
}
... | 1 | 21,606,403 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const long double PI = acos(-1.0L);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T>... | 1 | 76,152,362 |
#include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x;
for(int i = 0;i < n;i++){
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main(){
int a,b,c,k;
cin >> a >> b >> c >> k;
if(k <= a) cout << k << endl;
else if(k <= a + b) cout << a << endl;
else cout << a -... | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
#define _GLIBCXX_DEBUG
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a <... | 1 | 10,705,640 |
#include<iostream>
using namespace std;
int main()
{
long long n,i,mi,c=1;
cin>>n;
long long m[n];
for(i=0;i<n;i++)
{
cin>>m[i];
}
mi=m[0];
for(i=1;i<n;i++)
{
if(mi>=m[i])
{
c++;
}
mi=min(mi,m[i]);
}
cout<<c<<endl;
retur... | #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];
int ans=1,p=a[0];
for(int i=1;i<n;i++)
{
if(a[i]<=p)
{
ans++;
p=a[i];
}
}
cout<<ans<<endl;
} | 1 | 19,822,849 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int A, B;
cin >> A >> B;
if (A == 1 && B == 1) {
cout << "Draw" << endl;
}
else if (A == 1) {
cout << "Alice" << endl;
}
else if (B == 1) {
cout << "Bob" << endl;
}
else {
cout << (A > B ? "Al... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string s;
cin >> a >> b;
if (a == 1){
a += 13;
}
if (b == 1){
b += 13;
}
if (a == b){
s = "Draw";
}else if (a < b){
s = "Bob";
}else{
s = "Alice";
}
cout << s << end... | 1 | 7,814,450 |
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
char c[6]={};
for(int i=0;i<6;i++){
cin>>c[i];
}
string ans="YES";
if(c[1]!=c[4]) ans="NO";
if(c[0]!=c[5]) ans="NO";
if(c[2]!=c[3]) ans="NO";
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define F first
#define S second
#define MAXN 1000005
#define Tsetso ios_base::sync_with_stdio(0) ; cin.tie(0) ;
using namespace std;
int main()
{
string x , y ;
cin >> x >> y;
string z = y ;
reverse(y.begin(),y.end());
if ( y != ... | 1 | 24,231,193 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i,N) cin >> A.at(i);
int max1 = 0, max2 = 0;
rep(i,N) {
if (A.at(i) > max2) max2 = A.at(i);
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N,0);
for(int i = 0; i< N; i++) {
cin >> a.at(i);
b.at(i) += a.at(i);
}
sort(b.begin(),b.end());
int p = b.at(N-1);
int q;
if(b.at(N-2)!=p){
q = b.at(N-2);
}
else{
q = b.at(N... | 1 | 95,734,351 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_ba... | 1 | 64,093,583 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define fi first
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fit(x) for(auto it=x.begin();it!=x.e... | #include <iostream>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
ll edges = 0;
rep(k,N-1) {
ll i, j;
cin >> i >> j;
if (j < i) swap(i,j);
edges += ll(i) * (N - j + 1);
... | 1 | 78,817,461 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#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; } ret... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 1 | 15,647,293 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
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)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 1 | 57,367,010 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VP vector<pair<int,int>>
#define VPP vector<pair<int,pair<int,int>>>
#define VLL ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 1 | 84,571,024 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
while(true){
int n, a, b, c, x;
cin >> n >> a >> b >> c >> x;
if(n == 0){ break; }
vector<int> y;
for(int i = n; i > 0; --i){
int tmp;
cin >> tmp;
y.push_back(tmp);
... | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n,a,b,c,x,count=0;
cin>>n>>a>>b>>c>>x;
if(n==0 && a==0 && b==0 && c==0 && x==0){break;}
int y[110];
for(int i=0;i<n;i++){
cin>>y[i];
}
for(int i=0;i<n;i++){
while(x!=y[i]){
x=(a*x+b)%c;
count++;
if(count>1000... | 1 | 25,121,013 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
ll check(string a,string b) {
ll na=a.size();
ll nb=b.size();
if(na>nb) return 1;
if(na<nb) return 0;
for(ll i=0;i<na;i++) {
i... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
int main() {
string A, B;
cin >> A;
cin >> B;
if(A.size() > B.size()) { cout << "GREATER"; return 0; }
else if(A.size() < B.size()) { cout << "LESS"; return 0; }
else {
for(int i = 0; i < A.size(); i++) {
if(A[i] > ... | 1 | 56,224,087 |
#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 <math.h>
#include <string>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a*500 >= b){
cout<<"Yes";
}
else{
cout<<"No";
}
return 0;
} | 1 | 62,480,925 |
#include <bits/stdc++.h>
using namespace std;
int hashh[200005],ans[200005],memo[1<<26],arr[26];
int main(){
for(int i=0;i<(1<<26);i++) memo[i]=INT_MAX;
string s;
cin >> s;
int len=s.length();
s="*"+s;
hashh[0]=0;
for(int i=1;i<=len;i++){
arr[s[i]-'a']++;
int hv=0;
for(int j=0;j<26;j++){
if(arr[j]%2) hv... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pcc pair<char,char>
#define vi vector <int>
#define vl vector <ll>
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define pd(x... | 1 | 14,101,606 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void a_shiritori(void) {
string a, b, c;
cin >> a >> b >> c;
if ((a[a.size() - 1] == b[0])&&(b[b.size()-1]==c[0])) {
cout << "YES" << endl;
}
else {
cout << "NO" <... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string a, b, c;
int... | 1 | 19,867,874 |
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof a);
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define per(i,a,b) for(int i = a; i >= b; i--)
#define __ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
typedef long long ll;
typedef double db;
const db EPS = 1e-9;
using namespace std;
void dbg() {cout << "... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const ll MOD2=998244353;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string ... | 1 | 24,006,057 |
#include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define INF 1000000001ll
#d... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <unordered_map>
#include <array>
#include <fstream>
#include <cassert>
#include <cmath>
#inclu... | 1 | 6,445,950 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ((a & b) & 1) {
cout << "Odd" << endl;
}
else {
cout << "Even" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | 1 | 26,630,073 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1e9 + 7;
int main() {
int a, b, x;
cin >> a >> b >> x;
double theta;
if (2 * x < a * a * b) {
theta = atan(a * b * b / (2.0 * x)) * 180 / acos(-1);
} else {
theta = atan(2.0 * (a * ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const double pi = acos(-1);
int main() {
double a, b, x; cin >> a >> b >> x;
if (2*x > a*a*b){
double h = (2.0*(a*a*b - x)) / (a*a);
double rad = atan2(h, a);
double ans = (... | 1 | 92,473,153 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N,K;
int main(){
cin >> N >> K;
if(K > (N-1)*(N-2)/2){
cout << -1 << endl;
return 0;
}
ll c = (N-1)*(N-2)/2 - K;
cout << N-1 + c << endl;
for(int i=2;i<=N;i++) cout << 1 << " " << i << endl;
for(int i=2;i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
if(k > (n - 1) * (n - 2) / 2) {
cout << -1 << '\n';
return 0;
}
vector<pair<int,int>> ans;
for (int i = 2; i <= n; i++) {
ans.emplace_back(1, i);
}
int tot = (n - 1) * (n - 2) / 2;
for ... | 1 | 52,534,199 |
#include<bits/stdc++.h>
using namespace std;
signed main(void)
{
long long int r,c;
cin>>r>>c;
if(r == 1 || c == 1)
cout<<1<<endl;
else{
long long int ans = (r*c+1)/2;
cout<<ans<<endl;
}
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | 1 | 72,104,292 |
#include <iostream>
using namespace std;
int main() {
int a, n;
cin >> n >> a;
if(n >= 10){
cout << a;
}else{
cout << a + 100 * (10 - n);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | 1 | 64,502,963 |
#include <iostream>
#include <cstdio>
using namespace std;
int n, m, s;
int main()
{
int i;
cin >> n >> m;
for (s = 1, i = 0; i < n; s *= 2, i++);
s--;
if (s < m || n == 1 && m == 1) {
cout << -1;
return 0;
}
if (n == 1 && m == 0) {
cout << "0 1 1 0";
return 0;
}
cout << m << " ";
for (i = 0; i <= ... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int main(){
int m,K;cin>>m>>K;
if(m==0){
if(K==0)puts("0 0");
else puts("-1");
return 0;
}
if(m==1){
if(K==0)puts("0 0 1 1 ");
else puts("-1");
return 0;
}
if(K>=(1<<m)){
... | 1 | 73,831,720 |
#include <iostream>
using namespace std;
int main(){
int n=1000 ,m ,coin=0;
while( true ){
cin >> m;
if( m == 0 ){
break;
}
n -= m;
if( n >= 500 ){
coin += n / 500;
n %= 500;
}
if( n >= 100 ){
coin += n / 100;
n %= 100;
}
if( n >= 50 ){
coin +... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (... | 1 | 71,924,528 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define mrep(i,from,n) for(int i = from; i < n; i++)
#define mreps(i,from,n) for(int i = ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | 1 | 78,900,374 |
#include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <climits>
#include <stack>
#include <queue>
#include <set>
#include <cctype>
#include <bitset>
#include <type_traits>
#include <list>
using namespace std;
#define REP(i, n) for (int i... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; 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 sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 1 | 69,746,618 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<map>
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for... | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | 1 | 65,945,276 |
#include<iostream>
#include<algorithm>
using namespace std;
using ll=long long;
int main(){
int Q,H,S,D;
cin>>Q>>H>>S>>D;
int N;
cin>>N;
ll checkQ=0;
ll checkH=0;
ll checkS=0;
ll checkD=0;
checkQ=Q*8;
checkH=H*4;
checkS=S*2;
checkD=D;
ll check2=min({checkQ,checkH,checkS,checkD});
ll ans=0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
ll q, h, s, d;
cin >> q >> h >> s >> d;
ll n;
cin >> n;
ll o = min(q * 4, min(h * 2, s));
ll ans = 0;
if (o * 2 > d) {
ans += (n / 2) * d;
n = n % 2;
}... | 1 | 83,022,460 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<long long> A(N),B(N),C(N);
long long sum=0;
for(int i=0; i<N; i++){
cin >> A[i] >> B[i];
C[i]=A[i]+B[i];
sum-=B[i];
}
sort(C.begin(),C.end(),greater<long long>());
for(int i=0; i<(N+1)/2; i++){
sum+=C[i*2];
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int64_t N, takahashi = 0, aoki = 0;
cin >> N;
vector<tuple<int64_t, int64_t, int64_t>> SAB(N);
for (int... | 1 | 90,735,280 |
#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;
vector<vector<int>> to(200005);
vector<ll> ans;
void dfs(int v,int p = -1){
for(int u : to.at(v)){
if(u == p)continue;
ans.at(u) += ans.at(v);
dfs(u,... | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << " is " << (x) << endl;
#define endl '\n'
#define ld long double
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define sz(a) (int)a.size()
#define all(x) (x).begin(), (x).end()
void solve() {
}
const int ... | 1 | 26,570,554 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
ll gcd(ll a, ll b){
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main(void){
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++... | 1 | 84,890,860 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
#define pb push_back
template<class T> inline bool chmin(T &a, T b){
if(a>b){a=b;return tr... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
using matrix = vector<vector<uint>>;
template <typename T>
us... | 1 | 21,071,754 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long long unsigned int ull;
typedef long double ld;
typedef vector<int> vr;
typedef pair<int, int> pr;
#define pb push_back
#define ff first
#define ss second
#define INF 1999999999
#define MODA 1000000007
#define PI 3.141592653589793238462... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
for (int i = 0; i < v.size(); i++) \... | 1 | 75,355,767 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
if(N<2) cout << 1;
else if(N<4) cout << 2;
else if(N<8) cout << 4;
else if(N<16) cout << 8;
else if(N<32) cout << 16;
else if(N<64) co... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 1 | 62,769,149 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N = 1;
int A = 0;
cin >> N;
cin >> A;
if ( N % 500 <= A ) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include<iostream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a;
cin>>n>>a;
int x=n%500;
(x<=a)? cout<<"Yes" : cout<<"No";
} | 1 | 99,926,536 |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
ll pwr(ll base, ll p, ll mod=MOD){
ll ans = 1;while(p){if(p&1)an... | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define rg register
using namespace std;
typedef long long LL;
const int MAXN = 100005;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if... | 1 | 38,135,849 |
#include<bits/stdc++.h>
using namespace std;
#define Mod(n) n % 1000000007
const int dx[8] = {1, 0, -1, 0, -1, 1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
int main()
{
int N;
cin >> N;
double sum = 0;
double x;
string u;
for(int i = 0;i < N;i++)
{
cin >> x >> u;
... | #include "bits/stdc++.h"
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define en '\n'
#define pb push_back
#define P pair<int, int>
typedef long long ... | 1 | 16,414,794 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
ll gcd(ll a,ll b){
if(a < b) return gcd(b, a);
int r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
int main(){
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll lcd = c/gcd(c,d) * d;
ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEB... | 1 | 94,558,306 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include <bits/stdc++.h>
using namespace std;
string s;
long long int al[26], n, ans;
int main() {
cin >> s;
n = s.size();
for (int i = 0; i < n; i++) {
al[s[i] - 'a']++;
}
ans = n * (n - 1) / 2;
for (int i = 0; i < 26; i++) {
ans -= al[i] * (al[i] - 1) / 2;
}
cout << ans + 1 << endl;
return 0... | 1 | 92,630,540 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<int> A(N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
sort(A.begin(), A.end());
int count = 0;
long long s = 0;
for (int i = 0; i < N; i++) {
if (A[i] <= s * 2) {
count++;
} else {
count = 1;
}
s ... | 1 | 28,038,034 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n,m;cin>>n>>m;
char a[n][m];
for(int i = 0;i<n;i++){
string b;cin>>b;
for(int j = 0;j<m;j++) {
a[i][j] = b[j];
}
}
for(int i = 0;i<n;i++){
... | #include <algorithm>
#include <array>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int h, w;
cin >> h >> w;
ve... | 1 | 53,926,645 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 0;
if (m - 2 * n >= 0)
ans += n + (m - 2 * n) / 4;
else
ans += m / 2;
cout << ans << endl;
return 0;
} | #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 | 31,420,238 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=10002;
int fa[maxn];
int n;
void init(){
for(int i=1;i<=n;i++)
fa[i]=i;
}
int find(int x){
int y=fa[x];
for(;fa[y]!=y;y=fa[y]);
while(x!=y){
int temp=fa[x];
fa[x]=y;
x=temp;
}
return y;
}
void merge(int x... | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define fst first
#define snd se... | 1 | 32,439,529 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
int gcd(int a,int b)
{
if (a%b==0)
{
return(b);
}
else
{
return(gcd(b,a%b));
}
}
int main (){
int N,X;
cin>>N>>X;
vector<int>xxx(N);
rep(i,N){
int x;
cin>>x;
xxx[... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
if(a%b == 0){
return b;
}else{
return gcd(b, a%b);
}
}
int gcd_arr(vector<int> &a){
int n = a.size();
for(int i=n-2; i>=0; i--){
a[i] = gcd(a[i], a[i+1]);
}
return a.front();
}
int main(void){
long long int i=0,j,c=0,n,m=... | 1 | 72,989,448 |
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<vector>
#include<set>
#include<list>
#include<cstring>
#include<cctype>
#include<cmath>
#include<bitset>
#include<cstdio>
#include<cstdlib>
#include<ctime>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0;i < (n);++i)
in... | #include <iostream>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
using namespace std;
typedef long long int ll;
typedef pair <int,int> pii;
typedef pair<ll,ll> pll;
void print(vector <int> X)
{
for (int i=2; i<X.size(); i++)
{
... | 1 | 46,728,849 |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
void solve()
{
int n, k;
cin >> n >> k;
int a[n];
for(int i = 0; i<n; i++) cin >> a[i];
sort(a, a+n);
int sum = 0;
for(int i = 0; i<k; i++)
{
sum += a[i];
}
cout << sum << endl;
}
int main()
{
cin.... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int num, kosu;
vector <int> price;
cin >> num >> kosu;
int tmp;
for(int i =0; i < num; i++)
{
cin >> tmp;
price.push_back(tmp);
}
sort(price.begin(), price.end());
int s... | 1 | 26,825,759 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1, 0);
for (int i = 0; i < n + 1; i++) cin >> a[i];
vector<int> csa(n... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | 1 | 69,767,526 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
vector<vector<int>> student(n, vector<int>(2));
for (int i=0; i<n; i++){
cin >> student[i][0] >> student[i][1];
}
vector<vector<int>> distance(n, vector<int>(m));
for (int j=0; j<m; j++){
int c,d; c... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int INF = 1e9;
int calDist(int x1, int y1, int x2, int y2){
return (abs(x1-x2) + abs(y1-y2));
}
int main(){
int n, m;
cin >> n >> m;
vector<pair<int,int>> i1(n), i2(m);
for(int i = 0; i < n; ++i)
cin >> i1[i].first >> i1[i].second;
for(int... | 1 | 91,777,223 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
int main(){
ll n,m;cin >> n >> m;
vector<ll> h(n);
rep(i,n) cin >> h.at(i);
vector<vector<ll>> v(n);
rep(i,m){
ll a,b;cin >> a >> b;
--a;--b;
v.at(a).push_back(b);
v.at(b).push_back(a);
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll=long long;
int main(){
int n,m,a,b,count=0;
cin >> n >> m;
vector<int> h(n);
rep(i,n) cin >> h[i];
vector<bool> ok(n,true);
rep(i,m){
cin >> a >> b;
a--; b--;
if(h[a]<=h[b]) ok[a]=false;
if(h[b]<=h[a]) ok[b]=fa... | 1 | 34,048,748 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <map>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
ll solve(ll a,ll b){
if (!a) return 0;
ll res=a*(b/a)*2;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main()
{
ll n, x;
cin >> n >> x;
cout << 3 * (n - gcd(n, x)) << endl;
} | 1 | 94,833,574 |
#include <iostream>
#include <stdlib.h>
#include <time.h>
#include <stdio.h>
using namespace std;
int main() {
int plane[6],planeup,planebef,n,i,j,random,box;
for(i=0;i<6;i++){
cin >> plane[i];
}
cin >> n;
for(j=0;j<n;j++){
cin >> planeup >> planebef;
while(1){
if... | #include<iostream>
#include<string>
#include<algorithm>
#include<functional>
#include<bitset>
#include<iomanip>
#include<vector>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<queue>
#include<deque>
#include<cstdio>
#include<cstdlib>
#include<cmath>
using namespace std;
struct dice{
int top, bo... | 1 | 20,611,713 |
#include<iostream>
#include<vector>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
int N,M;
while(1){
cin>>N>>M;
if(N==0&&M==0) break;
vector<pair<int,int> > PD(N);
unsigned long long prob;
for(int i=0; i<N;i++) {
cin>>PD[i].second>>PD[i].first;
}
sort(PD.begin(),... | #include <iostream>
#include <utility>
#include <algorithm>
#include <functional>
using namespace std;
typedef pair<int, int> pii;
int main()
{
int N, M, ans;
while(1){
cin >> N >> M;
if(N == 0 && M == 0){
break;
}else{
ans = 0;
pii DP[N];
for(int i = 0; i < N; i++)
cin >> DP[i]... | 1 | 15,255,055 |
#include<iostream>
using namespace std;
int main() {
int d, e, sum;
while(cin >> d)
{
sum = 0;
for(e = d; e < 600; e += d) sum += e*e;
sum *= d;
cout << sum << endl;
}
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#define M_PI 3.14159265358979
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include<iomanip>
#include<vector>
#include<cmath>
#include <algorithm>
using namespace std;
int main(){
double d;
int S;
while (cin >> d){
S = 0;
for (int i = 1; d*i < 600; i+... | 1 | 98,820,564 |
#include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
int tate, yoko;
while (true) {
cin >> tate >> yoko;
if (tate == 0 && yoko == 0)
break;
for (int i = 0; i < tate; i++)
for (int j = 1; j <= yoko; j++) {
if (j < yoko)
cout << "#";
else
cout << "#" << "\n";
}
... | #include<iostream>
using namespace std;
int main(void)
{
int H,W,h,w;
while(1){
cin >> H >> W;
if(H==0 && W==0)break;
for(h=1 ; h<=H ; h++){
for(w=1 ; w<=W ; w++){
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | 1 | 98,552,899 |
#include<bits/stdc++.h>
typedef long long ll;
bool check(ll x){
printf("? %lld\n",x);
fflush(stdout);
char buf[10];
scanf("%s",buf);
return buf[0]=='Y';
}
void fin(ll x){
printf("! %lld\n",x);
fflush(stdout);
exit(0);
}
int main()
{
ll s=1e11,e=1e12,m;
while(s<=e){
m=(s+e)/2;
if(check(m))e=m-1;
else s=m... | #include<bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define FORW(a, b, c) for(int a = b; a >= c; --a)
#define int long long
int n, len, powe[20];
string ans;
bool check(int x) {
cout << "? " << x << '\n'; cout.flush();
string tmp; cin >> tmp;
return (tmp == "Y");
... | 1 | 64,955,861 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[4][3][10];
int b,f,r,v,x;
cin >> x;
for(int bb=0;bb<4;bb++){
for(int ff=0;ff<3;ff++){
for(int rr=0;rr<10;rr++){
a[bb][ff][rr]=0;
}
}
}
for(int i=0;i<x;i++){
cin >> b>> f>> r>> v;
a[b-1][f-1][r-1]+=v... | #include <iostream>
using namespace std;
int main(){
int b,f,r,v,i,j,n;
int a[12][10];
for (j=0;j<12;j++){
for (i=0;i<10;i++)a[j][i]=0;
}
cin>>n;
for (i=0;i<n;i++){
cin>>b>>f>>r>>v;
a[b*3+f-4][r-1]+=v;
}
for (j=0;j<12;j++){
if (j&&!(j%3))cout<<"####################"<<endl;
for (i=0;i... | 1 | 59,964,269 |
#include <bits/stdc++.h>
#include <complex>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,C,L,R;
string ... | #include <bits/stdc++.h>
using namespace std;
double sqr(double a) {
return a * a;
}
double dist(double x, double y) {
return sqr(x) + sqr(y);
}
bool comp(pair<double, double> a, pair<double, double> b) {
return atan2(a.first, a.second) < atan2(b.first, b.second);
}
void solve() {
int n;
cin >> n;
... | 1 | 42,996,385 |
#include<cstdio>
#include<cstring>
int main() {
int n, a = 0, b = 0, i;
scanf("%d", &n);
char t[101], h[101];
for (i = 0; i < n; i++) {
scanf("%s%s", t, h);
if (strcmp(t, h) > 0)a += 3;
else if (strcmp(t, h) < 0)b += 3;
else { a++; b++; }
}
printf("%d %d\n", a, b);
return 0;
} | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main(){
int n, taro = 0, hanako = 0;
cin >> n;
string t, h;
for (int i = 0; i < n; i ++) {
cin >> t >> h;
if (t > h) taro += 3;
else if (t == h) taro ++, hanako ++;
else if (t < h) hanako += 3;
}
cout << taro << " " << h... | 1 | 5,442,419 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
map<int,int>M;
int pref[2*100*1000+4][22]={0};
int last_time[2*100*1000+3][22]={0};
signed main(){
int n;cin>>n;
ll ans=0;
memset(pref,0,sizeof(pref));
memset(last_time,0,sizeof(last_time));
for(int i=1;i<=n;++i){
int va;cin>>... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define pb push_back
#define eb emplace_back
using na... | 1 | 9,518,065 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll len = A+B;
ll cnt = N/len*A;
ll x = N%len;
if(x<=A) cnt += x;
else cnt += A;
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 1 | 11,223,016 |
#include<stdio.h>
using namespace std;
int main(){
int h, w;
int i,j;
while(1){
scanf("%d %d", &h, &w);
if(!h && !w)break;
for(i=0;i<h;i++){
for(j=0;j<w;j++){
putchar('#');
}
putchar('\n');
}
putchar('\n');
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int H, W;
while (1) {
cin >> H >> W;
if (!H && !W)
break;
for (int r = 1; r <= H; r++)
{
for (int c = 1; c <= W; c++)
{
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | 1 | 51,271,846 |
#include<iostream>
using namespace std;
int res = 0;
int n, s;
void solve(int p, int sum, int q)
{
if(p == n && sum == s){
res++;
return;
}
if(sum > s) return;
for(int i=q; i<10; i++)
solve(p+1, sum+i, i+1);
}
int main(void)
{
while(cin >> n >> s)
{
if(n==0 && s==0) break;
solve(0, 0, 0);
cout << res ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <map>
using namespace std;
#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define AL... | 1 | 42,091,735 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n, a;
cin >> n >> a;
cout << ((n % 500 <= a) ? "Yes" : "No... | #include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#incl... | 1 | 67,462,562 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int n,ans = 0;
cin >> n;
vector<P>a(n),b(n);
rep(i,0,n) cin >> a[i].first >> a[i].second;
rep(i,0,n) cin >> b[i].first >> b[i].second;
sort(b.begin()... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using P = p... | 1 | 90,115,940 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long now=0,ans=0;
for(int i=0;i<n;i++){
int x;
cin >> x;
now+=x;
if(x==0){
ans+=(now/2);
now=0;
}
}
ans+=now/2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 1 | 38,096,943 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
const int maxn = 200000;
ll mod = INF;
int main(){
ll n;
ll h[maxn];
ll k;
cin >> n>>k;
rep(i,n)cin >> h[i];
sort(h,h+n... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.rbegin(), h.rend());
if(k > n) k = n;
rep(i, k) h[i] = 0;
ll ans = 0;
r... | 1 | 15,176,708 |
#include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int X,T;
cin >> X >> T;
if (X-T>=0) {
cout << X-T << endl;
} else if (X-T<0) {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(ll i = n;i >= 0;--i)
#define FOR(i,m,n) for(ll i = m, i##_len=(n);i <i##_len; ++i)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) { if ... | 1 | 37,661,084 |
#include<bits/stdc++.h>
using namespace std;
void solve(){
string s,t;
long long ans=0;
cin>>s;
cin>>t;
for(int i=0;i<s.length();i++)
{
if(s[i]!=t[i])
ans+=1;
}
cout<<ans<<endl;
}
int main()
{
int t;
solve();
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
long long sum=0;
cin>>a>>b;
for(int i=0 ; i<a.size(); i++){
if(a[i]!=b[i]){
sum++;
}
}
cout<<sum;
} | 1 | 59,721,780 |
#include <cstdio>
#include <cstring>
#include <vector>
#define MAX_N 100000
using namespace std;
typedef long long int ll;
int N, M;
vector<int> G[MAX_N];
int color[MAX_N];
ll ans;
bool dfs(int v, int c) {
bool is_bipartite = true;
if (color[v] != 0) {
return (color[v] == c);
}
color[v] = c;
for (int e = ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 2001;
const int MOD = 1000000007;
vector<int> h[100001];
int used[100001]={};
signed main(){
int n,m;
cin>>n>>m;
int u,v;
for(int i=0;i<m;i++){
cin>>u>>v;
h[u-1].push_back(v-1);
h[v-1].push_back(u... | 1 | 20,229,232 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,A=0,B=0,BA=0,AB=0; cin>>N;
for(ll i=0; i<N; i++){
string S; cin>>S;
ll sz=S.size();
if(S[0]=='B') B++;
if(S[sz-1]=='A') A++;
if(S[0]=='B' && S[sz-1]=='A') BA++;
for(ll j=0; j<sz-1; j++) if(S[j]=='A' && S[j+1]=... | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vect... | 1 | 43,180,770 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string S, T, U ;
cin >> S >> T ;
int A , B ;
cin >> A >> B ;
cin >> U ;
if (U == S) A-- ;
if (U == T) B-- ;
cout << A << " " << B << endl ;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n) ;i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | 1 | 58,522,413 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rrep(i, m, n) for(ll i = m; i > n; i--)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x... | 1 | 20,708,150 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char* argv[]) {
string s;
cin >> s;
long long K;
cin >> K;
s += s + s;
long long base = 0;
bool changed[s.size()];
changed[0] = false;
for (int i = 1; i < s.size() / 3; ++i) {
if (s[i] == s[i - 1] && !changed[i - 1]) {
... | 1 | 93,713,436 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n, x;
cin >> n >> x;
int a, ans = 0;
for(int i=0; i<n; ++i){
cin >> a;
if(a>=x)
ans++;
}
cout << ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
wh... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint INF = 1e18;
signed main(){
int n, k, ans = 0; cin >> n >> k;
for(int i = 0; i < n; i++){
int x; cin >> x;
if(x >= k) ans++;
}
cout << ans << endl;
} | 1 | 95,869,680 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#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 pw(x) (1LL<<(x))
static const int fast_io = [](){io... | #include<iostream>
#include<algorithm>
using namespace std;
pair<int,int> A[100005];
long long Fr[100005];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>A[i].first;
A[i].second=i;
}
sort(A+1,A+n+1);
... | 1 | 79,523,111 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define fcout cout << fixed << setprecision(15)
using lint = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a... | 1 | 24,787,014 |
#include<stdio.h>
int main()
{
int a,b,temp;
while(scanf("%d%d",&a,&b)!=EOF&&(a||b))
{
temp=0;
if(a>b)
{
temp=a;a=b;b=temp;
}
printf("%d %d\n",a,b);
}
return 0;
} | #include <iostream>
using namespace std;
#define for_(i,a,b) for(int i = (a);i < (b);i++)
#define rfor_(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define rep(i,n) for_(i,0,(n))
#define rrep(i,n) rfor_(i,0,(n))
int n, m;
int main(){
cin.tie(0);
while(cin>>n>>m,n||m)cout<<(n<m?n:m)<<' '<<(m<n?n:m)<<endl;
return 0;
} | 1 | 13,796,579 |
#include <bits/stdc++.h>
using namespace std;
#define forn(i,m,n) for(int i=m;i<n;i++)
#define vv vector
#define vi vv<int>
#define ii pair<int,int>
#define vii vv<ii>
#define mp make_pair
#define pb push_back
#define PI 3.141592653589
#define ll long long
#define pll pair<ll,ll>
#define vl vv<ll>
#define ff first
#def... | #include <bits/stdc++.h>
using namespace ::std;
template<typename T> T nxt() {T res; cin >> res; return res;}
#define tests() for (int _ = nxt<int>(); _ >= 0; _--)
#define nxt1(t,n) t (n); cin >> n
#define nxt2(t,n,m) t (n),(m); cin >> n >> m
#define nxt3(t,n,m,k) t (n),(m),(k); cin >> n >> m >> k
#define rep(i, A) for... | 1 | 33,542,213 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
char ch;
cin>>ch;
if(ch>='A' && ch<='Z')
cout<<"A";
else
cout<<"a";
return 0;
} | #include <iostream>
#include <string>
char Compare_Func(const char arg_a);
const int L_CHAR_MIN = 0x41;
const int L_CHAR_MAX = 0x5a;
const int S_CHAR_MIN = 0x61;
const int S_CHAR_MAX = 0x7a;
int main()
{
char Result = NULL;
char Char_Temp = NULL;
std::string buf;
std::cin >> buf;
if (!buf.empty())
{
Char_Te... | 1 | 9,227,593 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | #include<bits/stdc++.h>
#define ll long long
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repr(i,a,b) for(int i=a;i>=b;i--)
#define pb(z) push_back(z)
#define ff first
#define ss second
#define pi(a,b) make_pair(a,b)
#define pii pair<ll,ll>
#define... | 1 | 22,386,567 |
#include<bits/stdc++.h>
using namespace std;
long long n;
long long ans=0;
struct node{
int num,p;
}a[100005];
bool cmp(node x,node y){
return x.num<y.num;
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].num;
a[i].p = i;
}
sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++){
if((abs(i-a[i].p))%2==1)ans++;
}
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define MOD 1000000007
#define PI 3.14159265358979
#define rep(i, n... | 1 | 100,673,471 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define DUMP( x ) cerr << #x <<... | #include <bits/stdc++.h>
using namespace std;
int h, w, n;
char m[1010][1010];
int d[1010][1010];
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
void init()
{
for (int i = 0; i < h; i++){
for (int j = 0; j < w; j++){
d[i][j] = 1e9 + 9;
}
}
}
int main()
{
int sx, sy;
cin >> h >> w >> n;
for (int... | 1 | 93,293,663 |
#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... | #include<bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
bool chk = false;
int cnt = 0;
cin >> a >> b >> c;
while(chk == false){
if(a == b && b == c){
chk = true;
break;
}
if(a <= b && a <= c){
if(a == b){
a++;
b++;
cnt++;
}else if(a == c... | 1 | 42,389,510 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n, k, x, y;
cin >> n >> k >> x >> y;
cout << (n<=k ? n*x : k*x + (n-k)*y) << endl;
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define per(i,a,b) for(ll i=a; i>=b; i--)
#define ... | 1 | 19,295,332 |
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define vvi vector<vi>
#define all(x) x.begin(), x.end()
#de... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x)... | 1 | 49,733,373 |
#include <iostream>
#include <cmath>
using namespace std;
void solve() {
int n; cin >> n;
int cur{0}, res{0};
while (cur < n) {
cur++;
if (cur == 10 || cur == 1000 || cur == 100000) {
cur *= 10;
if (cur <= n) {
res++;
}
continue;
}
res++;
}
co... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
if(N<10){
cout<<N<<endl;
}else if(N<100){
cout<<9<<endl;
}else if(N<1000){
cout<<N-90<<endl;
}else if(N<10000){
cout<<909<<endl;
}else if(N<100000){
cout<<N-9999+909<<endl;
}else{
cout<<90909<<endl;
}
} | 1 | 45,811,059 |
#include <cstdio>
#include <iostream>
using namespace std;
const long N=100001;
typedef struct{
long parent;
long left;
long right_sib;
}Node;
long n, d[N];
Node t[N];
void print(long a){
printf("node %ld: parent = %ld, depth = %ld, ", a, t[a].parent, d[a]);
if(t[a].parent==-1) printf("root, ");
else if(t[a].le... | #include <iostream>
#define MAX 100000
#define NIL -1
using namespace std;
typedef struct{
int parent;
int left;
int right;
}Node;
Node T[MAX];
int Depth[MAX];
int setDepth(int u, int d){
Depth[u] = d;
if(T[u].right != NIL) setDepth(T[u].right, d);
if(T[u].left != NIL) setDepth(T[u].left, d + 1)... | 1 | 17,157,286 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.