code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1... | 1 | 3,478,040 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
double n;
cin>>n;
cout<<floor(n/3)<<endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | 1 | 56,706,501 |
#include <bits/stdc++.h>
using namespace std;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
using Int = long long;
const char newl = '\n';
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n,m;
ci... | #include <bits/stdc++.h>
using namespace std;
#define modulo N
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
int main(){
int N,M;
cin>>N>>M;
vector<pair<int,int>> ans;
for(int i=1;true;i++){
ans.emplace_back(i,mod(i-(2*i-1)));
if((i+1)*2*2>N){
int l = i+1;
int r = mod(i-(2... | 1 | 67,519,509 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
using vvv= vector<vv>;
int main(){
int n;cin>>n;
vi list(n);
int m;cin>>m;
int a,b;
rep(i,m){
cin>>a>>b;
a--;b--;
list[... | #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 | 27,929,563 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >>n;
string s; cin >> s;
int k; cin >> k;
char moji = s.at(k - 1);
for(int i = 0; i < n; i++){
if(s.at(i) != moji)
cout << "*";
else
cout << moji;
}
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main()
{
FASTINOUT;
int x,k;
string s;
cin>>x>>s>>k;
k--;
char a=s[k];
for (int i=0;i<x;i++){
if (s[i]!=a)
... | 1 | 80,963,734 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
ll rec(ll n, ll x) {
ll all = (1LL << n + 1) - 3;
ll p = (1LL << n) - 1;
if (x == 0)
return 0;
else if (x <= all + 1)
return rec(n - 1, x - 1);
else if (x <= all + 2)
return p + 1;
... | 1 | 4,512,453 |
#include<bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define ld long double
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238463;
const int MAXN = 200005;
int main()
{
FAST
ll a;
ld b;
... | #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... | 1 | 85,849,485 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main(){
int s;
cin >> s;
int count = 1;
if(s==2 || s==1){
s=4;
c... | #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 | 29,925,919 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int N ;
string S ,T;
cin >> S >> T;
T.pop_back();
if(S == T) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <iostream>
#include <string.h>
using namespace std;
int main()
{
int count = 0;
string S;
string T;
cin >> S;
cin >> T;
for (int i = 0; i < S.length();i++)
{
if(S[i] != T[i])
{
count++;
}
}
if(count == 0)
{cout << "Yes" << endl;}
else
{cout << "No" << endl;}
} | 1 | 54,070,570 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 1 | 60,867,827 |
#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<<... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | 1 | 16,041,033 |
#include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef string str;
typedef vector<int> vint;
typedef vector<double> vdou ;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<int, int> pii;
typedef vector<pii> vpii ;
#define REP(i, n) for (ll (i) = 0; (i) < (... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
int x = 1900 * m + (n - m) * 100;
int p = 1;
rep(i, m) {
... | 1 | 60,148,818 |
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
usin... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
using Graph = vector<vector<int>>;
int main() {
int A,P;
cin >> A >> P;
cout << (A*3+P)/2 << endl;
return 0;
} | 1 | 69,169,624 |
#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 = 1001001001LL;
constexpr long long LINF = 1000000000100000000;... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <functional>
#include <iomanip>
#include <bitset>
#include <numeric>
#include <queue>
#include <map>
#include <cstdint>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000... | 1 | 38,226,832 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll solve(int cost[],int n)
{
ll dp[n];
for(int i=0 ; i<n ; i++)
dp[i]=INT_MAX;
dp[0]=0;
for(int i=0 ; i<n ; i++)
{
if(i+1<n)
dp[i+1]=min(dp[i+1],dp[i]+abs(cost[i+1]-cost[i]));
if(i+2<n)
dp[i+2]=min(dp[i+2],dp[i]+abs(cost[i+2]-cost[i... | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.sync_with_stdio(false);
int n; cin >> n;
vector<long long>v(n);
for(int i = 0; i < n; i++){
cin >> v[i];
}
vector<int>cost(n);
cost[n-1] = 0;
cost[n-2] = abs(v[n-1]-v[n-2]);
for(int i = n-3; i >= 0; i--){
c... | 1 | 4,409,282 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, L; cin >> N >> L;
vector<string> S(N, "");
for (int i = 0; i < N; i++) cin >> S[i];
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) cout << S[i];
printf("\n");
} | #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, L;
cin >> N >> L;
vector<string> S(N);
rep(i, N) cin >> S[i];
sort(S.begin(), S.end());
rep(i, N) cout << S[i];
return 0;
} | 1 | 9,238,399 |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
ll n, k; cin >> n >> k;
vector <ll> v(n);
for (auto &i: v) cin >> i;
ll hcf = v[0];
rep (i, n... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <functional>
#include <sstream>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
type... | 1 | 4,184,515 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long a, b, c, k;
cin >> a >> b >> c >> k;
long long ans;
if (k % 2 == 0){
ans = a - b;
if(abs(ans) > 10e18)
cout << "Unfair" << endl;
else cout << ans << endl;
return 0;
}
ans = b - a;
if (abs(ans) >... | 1 | 87,736,107 |
#include <bits/stdc++.h>
using namespace std;
#include <stdio.h>
int main() {
vector<int>a(3);
for(int i; i<3; i++) cin >> a.at(i);
sort ( a.begin(), a.end() );
int pls = 0;
for (int i; i<2; i++) pls += a.at(i+1)-a.at(i);
cout << pls << endl;
} | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int A1, A2, A3;
cin >> A1 >> A2 >> A3;
vector<int> A = {A1, A2, A3};
sort(all(A));
cout << A[2] - A[0] << endl;
} | 1 | 27,164,683 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define MAXN 300003
#define MOD 1000000007
#define oo (1<<20)
#define mid ((a+b)/2)
#define pb push_back
#define sz size()
#define fastCpp() ios_base::sync_with_stdio( false ), cin.tie( NULL ), cout.tie( NULL )
using namespace std;
typedef long long ll;
typedef unsig... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define REPS(i,n) for (ll i = 1; i<=(ll)(n); i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a... | 1 | 8,872,976 |
#include<iostream>
using namespace std;
int main()
{
int i, n, sum;
cin >> n;
for(i = n; i > 0; i--) {
sum += i;
}
cout << sum << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n;
cin>>n;
long long int ans=(n*(n+1)/2);
cout<<ans;
return 0;
} | 1 | 77,369,593 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int64_t> height(n);
for (int i = 0; i < n; i++)cin >> height.at(i);
vector<int64_t> height_copy = height;
int64_t ans = 1000000000000000000;
for (int bit = 0; bit < (1 << n - 1); bit++) {
vector<int> want(n, 0);
want.a... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
#include<random>
#include<ctime>
#include<set>
using namespace std;
#define SAY_YES cout<<"YES"<<endl;
#define S... | 1 | 86,553,263 |
#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) FORR(i,0,n)
int main() {
int N, M;
cin >> N >>... | #include <cstdio>
#include <algorithm>
using namespace std;
const int N = 100000;
bool bad[N];
int h[N];
int n;
int m;
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) scanf("%d", h + i);
for (int i = 0; i < m; ++i) {
int a, b;
scanf("%d%d", &a, &b);
int mn = min(h[a - 1], h[b - 1]);
if (h[a ... | 1 | 90,644,619 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int>a(n);
vector<int>f(1000005);
int mx = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
f[a[i]]++;
mx = max(mx, a[i]);
}
int ans = 0;
sort(a.begin(), a.end());
for (int i = 0; i < n; i++)... | #include <iostream>
#include <map>
#include <vector>
typedef long long ll;
int N;
ll A[200005], mark[200005];
std::map<ll, std::vector<int> > occ;
int main() {
std::cin >> N;
ll mA = 0;
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
mA = std::max(mA, A[i]);
mark[i] = 1;
occ[A[i]].push_back(i);
... | 1 | 52,687,125 |
#include <array>
#include <algorithm>
#include <functional>
#include <iostream>
int main()
{
std::array<int,5> v;
std::cin >> v[0] >> v[1] >> v[2] >> v[3] >> v[4];
std::sort( v.begin(), v.end(), std::greater<int>() );
std::cout << v[0] << ' ' << v[1] << ' ' << v[2] << ' ' << v[3] << ' ' << v[4] << '\n';
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
int a[5];
int main(){
REP(i,5){
cin>>a[i];
}
sort(a,a+5);
REP(i,5){
if (i) cout<<" ";
cout<<a[4-i];
}
cout<<endl;
return 0;
} | 1 | 51,584,640 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
long long p[100000];
long long q[100000];
int main(void){
int W;
int H;
cin >> W >> H;
for(int i = 0; i < W; i++){
cin >> p[i];
}
for(int i = 0; i < H; i++){
cin >> q[i];
}
... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int W, H;
vector<P> v;
cin >> W >> H;
for(int i=0;i<W+H;i++){
int p; cin >> p;
v.push_back(P(p, i));
}
sort(v.begin(), v.end());
ll ans... | 1 | 55,476,561 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main(void){
int n;
cin >> n;
long long int num[n];
long long int sum[n];
long long int ans = 10000000000000;
for(int i = 0; i < n; i++){
cin >> num[i];
if(i==0) sum[i]=num[i];
... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, a[2 * 100000];
long long sum1 = 0, sum2 = 0, ans = 1e+17;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> a[i];
sum2 += a[i];
}
sum1 += a[0], sum2 -= a[0];
for(int i = 1; i < n; i++) {
ans... | 1 | 66,632,098 |
#include <bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
long long mod_pow(long long x,long long y){
long long tmp=x,res=1;
while(y){
if(y%2){res=res*tmp%MOD;}
y>>=1;
tmp=tmp*tmp%MOD;
}
return res;
}
int main(){
string L;
cin>>L;
long long ans=0;
int a=L.size();
in... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define ... | 1 | 21,642,480 |
#include <bits/stdc++.h>
using namespace std;
int n, m, p = 1000000007;
long long a, b, x;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%lld", &x);
a += x * (2 * i + 1 - n);
}
for (int i = 0; i < m; i++) {
scanf("%lld", &x);
b += x * (2 * i + 1 - m);
}
a %= p;
b %= p;
printf(... | #include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef lo... | 1 | 1,426,814 |
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
long long a, b, c;
int main() {
DAU
cin >> a >> b;
c = a * b / __gcd(a, b);
cout << c;
PLEC
} | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
ll gcd(int a,int b){
ll r = a%b;
while(r!=0){
a = b;
b =... | 1 | 77,584,665 |
#include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld",... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | 1 | 55,809,498 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define sizeOf(A) (sizeof(A))/(sizeof(A[0]))
#define odd(x) ((x) % (2))
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
ll k;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int n;
ll k;
cin >> n >> k;
vector<ll> cnts(200000, 0);
for (int i = 0; i < n; ++i) {
int a;
ll b;
cin >> a >> b;
cnts[a] += b;
}
ll acc = 0, ans = 0;
for (int i = 1; i < cnts.siz... | 1 | 87,203,004 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int X;
cin >> X;
bool check = 1;
int temp = X%100;
temp = (temp + 4)/5;
if(X/100 >= temp) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int X;
cin>>X;
string ans = "0";
for(int i = 0; i <= X;i++){
if(100*i <= X && X <= 105*i)ans = "1";
}
cout<<ans<<endl;
} | 1 | 28,026,699 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define INF 1<<30
#define LINF (ll)1<<62
#define MAX 510000
#define rep(i,n) for(ll i=0; i<(n); i+... | #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;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protec... | 1 | 99,763,953 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string S;
string ans;
cin >> S;
for(int i = 0 ; i < 12; i++){
if(i!= 4){
ans +=S[i];
}else{
ans +=" ";
ans +=S[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
#define pb push_back
using ll = long long;
using namespace std;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
const int INFint = 1e9;
const ll INFll = 1e18;
ll MOD=1e9+7;
ll ... | 1 | 59,823,277 |
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define rep1(i, to) for (ll i = 1; i <= (to); ++i)
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
ll ans=1;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
if(A[i]==0){
cout << 0 << endl;
return 0;
}
}
for(int i=0;i<N;i++){
if(ans>(double)1e18/(double)A[i]){
cout << -1... | 1 | 82,029,920 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int m, i, j, k;
string s, sub, temp;
while (1) {
cin >> s;
if (s=="-") break;
cin >> m;
int h[m];
for (i=0; i<m; i++) cin >> h[i];
for (i=0; i<m; i++) {
s = s.substr(h[i],s.size()-h[i]) + s.substr(0,h[i]);
}
... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
int m,h;
while(true){
string W="";
cin>>W;
cin>>m;
if(W=="-") break;
for(int i=0; i<m;i++){
cin>>h;
string left=W.substr(0,h);
string right=W.substr(h,W.length() - h + 1);
W=right+left;
}
cout<<W<<endl;... | 1 | 49,132,049 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll d,t,s;
cin>>d>>t>>s;
if(((1.0*d)/s)<=t)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
long long int d,t,s;
cin>>d>>t>>s;
if(d/s<t||((d/s==t)&&(d%s==0))){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | 1 | 34,875,678 |
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
#define MAX_N 100
#define DIST_TWICE(x, y) ((x) * (x) + (y) * (y))
class Point {
public:
ll x;
ll y;
};
int n;
vector<Point> rockets(MAX_N * 2);
int main(void) {
scanf("%d\n", &... | #include<iostream>
#include<stack>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<iomanip>
#include<set>
#include<bitset>
#include<cmath>
#include<numeric>
#include<limits>
#define REP(i, m, n) for(int i = (m); i < (n); i++)
#define rep(i,n) REP(i,0,n)
#define NIL -1
using ... | 1 | 3,416,615 |
#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), b(n);
rep(i, n) cin >> a[i] >> b[i];
vector<P> c(n);
rep(i, n) c[i] = make_pair(-a[i]-b[i], i);
sort(c.begin(), c.end(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll A[N],B[N];
for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
vector<P> Q;
for (int i = 0; i < N; i++) {
Q.push_back(make_pair(A[i]+B[i],i));
}
sort(Q.begi... | 1 | 5,120,430 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
set <long long int> s;
priority_queue <long long int,vector<long long int>,greater<long long int>> pque;
int n;
cin >> n;
for(int i=1;i<=9;i++)
{
s.insert(i);
pque.push(i);
}
while(!pque.empty())
{
i... | 1 | 32,827,981 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=100100;
struct Node{
LL d;
LL td;
int i,sz,fa;
vector<int> ch;
Node():td(0),sz(1){}
bool operator<(const Node o)const{
return d<o.d;
}
};
Node d[N];
map<LL,int> fd;
void GG(){
puts("-1");
exit(0);
}
int main(){
int n;
scanf("%d"... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N;
cin >> N;
vector<pair<long long, long long> > D(N);
vector<long long> E(N);
vector<long long> COUNT(N, 1);
vector<pair<long long, long long> > ANS;
for (int i = 0; i < N; i++) cin >> D[i].first, D[i].second = i, E[i] = D[i].first;
sort(D.be... | 1 | 39,727,387 |
#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... | #include "bits/stdc++.h"
#define sp <<" "
#define el <<"\n"
#define S second
#define F first
#define mp make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define obit __builtin_popcount
#define pof pop_front
#define For(i,a,n) for(i=a;i<n;i++)
#define all(ar) ar.begin(),ar.end()
using namespace... | 1 | 92,514,864 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int mod = 1e9+7;
int main(){
string s;
cin >> s;
int n = s.size();
vector<vector<int>> dp(n+1, vector<int>(2, 0));
dp[0][0] = 1;
for... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;... | 1 | 83,394,241 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
ll mod=1000000007;
int main()
{
ios_base::sync_with_stdio(false)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << (#x) << "]: " << x << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
cout << (s[2]==s[3] && s[4]==s[5] ? "Yes" : "No") << "\n";
} | 1 | 76,783,265 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long N,M;
cin>>N>>M;
if(M>=N*2){
cout<<N+(M-2*N)/4<<endl;
}
else{
cout<<M/2<<endl;
}
} | 1 | 35,933,475 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b;
cin >> n >> a >> b;
if( (a % 2) == (b % 2) ){
cout << "Alice" << endl;
}else{
cout << "Borys" << endl;
}
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 1 | 85,834,591 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str;
getline(cin,str);
for ( int i = 0 ; str[i] != '\0' ; i++){
if ( (str[i] >= 'a') && (str[i] <= 'z')){
str[i] -= 32;
}else if ( (str[i] >= 'A') && (str[i] <= 'Z')){
str[i] += 32;
}
}
cout << str << end... | #include <iostream>
using namespace std;
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <ctype.h>
#define NUM 100
int main()
{
static long i,j,k,l;
static char s[1200];
fgets(s,1203,stdin);
for(i=0;s[i];i++) {
if(isupper(s[i]))
s[i] = tolower(s[i]);
... | 1 | 33,104,476 |
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
double tot{};
string cur;
double x;
for (int i = 0; i < N; i++) {
cin >> x >> cur;
if (cur == "JPY") {
tot += x;
} else {
tot += x * 380000.;
}
}
cout << fixed << setprecision(16)
... | #include<bits/stdc++.h>
using namespace std ;
int main() {
int N ;
cin >> N ;
double T = 0 ;
for(int i = 0 ; i < N ; i++){
double x ;
string u ;
cin >> x >> u ;
if(u == "BTC"){
x = 380000*x ;
}
T += x ;
}
cout << T << endl ;
} | 1 | 100,202,623 |
#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 h, w, k; cin >> h >> w >> k;
vector<string> c(h);
rep(i, h) cin >> c[i];
int ans = 0;
rep(i0, 1 << h){
rep(j0, 1 << w){
int count ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const ll INFS=1e18;
const int MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int ... | 1 | 9,617,527 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#include <functional>
#include <vector>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;
const int maxn=2e5+50;
const int inf=0x3f3f3f3f;
const int ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define a... | 1 | 55,447,306 |
#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;
}
bo... | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP m... | 1 | 34,965,421 |
#include <iostream>
#include <cmath>
#include <cstdio>
constexpr double PI = 3.14159265359;
using namespace std;
int main(){
ios::sync_with_stdio(false);
double a, b, C;
cin >> a; cin >> b; cin >> C;
double h = b * sin(PI * C / 180);
double S = 0.5 * a * h;
double hoge = a - b * cos(C * PI / 180);
double ... | #include <cstdio>
#include <cmath>
int main(){
int a,b,C;
scanf("%d %d %d",&a,&b,&C);
double r=C*M_PI/180;
double S,L,h;
S=a*b*sin(r)/2;
L=sqrt(a*a+b*b-2*a*b*cos(r))+b+a;
h=b*sin(r);
printf("%.8f %.8f %.8f\n",S,L,h);
return 0;
} | 1 | 83,861,865 |
#include<bits/stdc++.h>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 1 | 56,989,169 |
#include<stdio.h>
#include<string.h>
int main(){
char s[19];
scanf("%s",s);
for(int i=0; i<strlen(s); i++){
if(s[i]==','){
printf(" ");
}else{
printf("%c",s[i]);
}
}
puts(" ");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
string s; cin >> s;
string t="";
rep(i, s.size()){
dump(t);
if(s.at(i)==','){
cout << t << "... | 1 | 54,529,793 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#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);
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
const ll M=1000000007;
int main(){
int N;cin>>N;
vector<int> A(N);
rep(i,N) cin>>A[i];
sort(A.begin(),A.end());
cout<<A[N-1]-A[0]<<endl;
} | 1 | 43,645,076 |
#include<iostream>
#include<vector>
#define ll long long
using namespace std;
const ll N=1e5+10;
ll n,c[N];vector<ll> E[N];
ll dfs(ll x,ll fr)
{
if(E[x].size()==1) return c[x];
ll s=0,mx=0,w;
for(auto R:E[x]) if(R!=fr) w=dfs(R,x),mx=max(mx,w),s+=w;
mx*2<=s?mx=s/2:mx=s-mx;
if(c[x]>s||c[x]<s-mx) puts("NO"),exit(0);
... | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
#define for1(i, a, b) for(i = a; i <= b; ++i)
#define for0(i, a, b) for(i = a; i < b; ++i)
#define forw1(i, a, b) for(i = a; i >= b; --i)
#define forw0(i, a, b) for(i = a -... | 1 | 74,149,672 |
#include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int m... | 1 | 79,951,143 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int a[15];
int main()
{
_FastIO;
int ans = 0;
int m = 10;
for(int i = 0; i < 5; i++){
cin >> a[i];
ans +... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define coutv(v) for (int i = 0; i < (v).size(); ++i) cout << v[i] << ' '; cout << endl;
#define coutvv(v) for (int i = 0; i < (v).size(); ++i) {for (int j = 0; j < (v[i]).size(); ++j) cout << v[i][j] << ' '; cout << endl;}
#define debugv(v) {for (int i = 0... | 1 | 44,181,826 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
#define repl(i,n) f... | #include<bits/stdc++.h>
using namespace std;
int main(){
char c; cin >> c;
c += 1;
cout << c << endl;
} | 1 | 42,656,288 |
#include<iostream>
#include<vector>
#include<string>
#include<stack>
int main(){
std::string S;
std::cin >> S;
std::stack<char> st;
int ans = 0;
for(int i = 0; i < S.size(); i++){
if(st.empty() || st.top() == S[i]){
st.push(S[i]);
}else{
st.pop();
... | #include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int main(){
Hello
int one = 0, zero = 0;
string s;
cin >> s;
for(int i = 0; i < s.size(); i++){
if(s[i] == '1') one++;
else zero++;
... | 1 | 71,184,231 |
#include <bits/stdc++.h>
using namespace std;
int f(int x)
{
return x * x;
}
int main(void)
{
int n;
while(cin >> n){
int s = 0;
for(int i = 1; i * n < 600; i++)
s += f(i * n) * n;
cout << s << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int f(int d){
return d*d;
}
int main()
{
int d,S=0;
while(cin>>d){
int Z=d;
for(;d<=(600-Z);d+=Z){
S+=Z*f(d);
}
cout<<S<<endl;
S=0;
}
} | 1 | 45,721,646 |
#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(void){
ll p=0,b[10010],n,m,c,a[1000][1000],co=0;
double r;
cin >> r;
r=r*r*3.14;
r=r/3.14;
cout << r << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<map>
#include<math.h>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#d... | 1 | 57,956,895 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, K, X, Y;
cin >> N >> K >> X >> Y;
int ans = 0;
if (N>K) {
ans = (N - K)*Y + K * X;
}
else {
ans = N * X;
}
cout << ans << endl;
return 0;
} | #include <iostream>
int N, K, X, Y;
void solve() {
std::cin >> N >> K >> X >> Y;
if (N < K)
std::cout << N * X << std::endl;
else
std::cout << (X * K) + (Y * (N-K)) << std::endl;
}
int main() {
solve();
return 0;
} | 1 | 81,193,487 |
#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()
int cal(int x) {
return (x + 9) / 10 * 10;
}
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
vector<int> a(5);
for (auto ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
#define INF 100000
int main(){
int ans = 0;
int MAX = 0;
rep(i, 5){
int t;
cin >> t;
int am = 10 - t... | 1 | 91,639,475 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll LINF = 0x1fffffffffffffff;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
template<class T>bool chmax(T &a, const T &b) {if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) {if (b<a) { a=b... | #include <iostream>
#include <algorithm>
using namespace std;
int v, e, s, t, u;
bool nc = 0;
long long d[100][100];
const long long Mx = 0xFFFFFFFF;
int main()
{
cin >> v >> e;
for (int i = 0; i < v; i++) {
for (int j = 0; j < v; j++) {
if (i == j)
d[i][j] = 0;
else
d[i][j] = Mx;
}
}
for (int i =... | 1 | 10,877,946 |
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define pi 2*acos(0.0)
#define f first
#define s second
#define pb push_back
#define gap ' '
#define fastio {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define mod 1000000007
#define MAX 1000000000000
#define N 305
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for(ll i = 0 ; i < n; i++)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int main(){
std::cout<<std::fixed<<std::setprecision(10);
int A,B,C... | 1 | 11,824,143 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | #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 INFL = 1e17+7;
const long long INFI = 1e9+7;
const long long MOD = 1e9+7;
const double EPS = 1e-8;
const double PI=a... | 1 | 75,551,086 |
#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< P > A(N);
rep(i, N) {
int a, b;
cin >> a >> b;
A[i] = P(a, b);
}
vector< P > B(N);
rep... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<numeric>
#include<functional>
#include<sstream>
#include<iomanip>
using namespace std;
#define ll long long
int main() {
int N; cin >> N;
vector<pair<int, int>> a(N), b(N);
for(int i... | 1 | 91,087,068 |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
int main()
{
optimize();
int n,i;
double p,t=0.0;
string st;
cin>>n;
for(i=1;i<=n;i++){
cin>>p>>st;
if(st=="BTC")
p=380000.0*p;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 1 | 55,319,266 |
#include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int p,q,r; cin >> p >> q >> r;
int ans1=INF,ans2=INF;
ans1 = min(p+q,r+q);
ans2 = min(r+p,q+p);
int ans = min(an... | 1 | 86,427,390 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <stack>
#include <string>
#include <math.h>
#define MAX 16777216
using namespace std;
bool dct[MAX+1];
int fourToTen(string key){
string::iterator itr;
int number=0;
itr = key.begin();
for(int i=0;;i++){
if(itr == key.end())
return number;
i... | #include<iostream>
#include<string>
#include<cstring>
using namespace std;
const int MAXT=1000003;
const int MAXN=1000010;
int n;
string s;
int head[1000003],nex[MAXN],to[MAXN],top,top1,ans[MAXN];
void input()
{
cin>>n;
memset(head,-1,sizeof(head));
memset(nex,-1,sizeof(nex));
}
int jisuan(char c)
{
if(c=='A') retu... | 1 | 7,534,710 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,ans = 0;
cin >> n;
vector<int>data(n);
for(int i = 0;i < n;i++){
cin >> data[i];
data[i]--;
}
for(int i = 0;i < n;i++){
if(data[data[i]] == i) ans++;
}
cout << ans/2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
VI a(n);
rep(i,n)cin >> a.at(i);
int ans=0;
rep(i,n){
if(a.at(a.at(i)-1)==i+1)... | 1 | 53,495,820 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<int,int> pairii;
typedef vector<int> veci;
const double pi=3.1415926535;
const ll mod=1000000007;
int main() {
int a,b,a2,b2;
cin>>a>>b>>a2>>b2;
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
vector<int> vec(4);
vector<int> value(4);
for (int i = 0; i < 4; i++) {
cin >> x;
vec.at(i) = x;
}
value.at(0) = vec.at(1) + vec.at(2) - vec.at(3);
value.at(1) = vec.at(2) + vec.at(3) - vec.at(0);
value.at(2) = vec.at(0) + vec.at(1) - vec.at(... | 1 | 40,538,125 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef long long ll;
... | 1 | 74,147,331 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#define r... | #include<iostream>
using namespace std;
int main() {
int n;
string s[50];
int t[50];
cin >> n;
int i;
for (i = 0; i < n; i++) {
cin >> s[i] >> t[i];
}
string x;
cin >> x;
int k;
for (i = 0; i < n; i++) {
if (s[i] == x) {
k = i+1;
break;
}
}
int counter = 0;
for (i = k; i < n; i++) {
counter ... | 1 | 96,713,295 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typede... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define re... | 1 | 71,872,724 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int x = (a-1) % 10;
x = min(x,(b-1) % 10);
x = min(x,(c-1) % 10);
x = min(x,(d-1) % 10);
x = min(x... | #include <bits/stdc++.h>
#include <fstream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ll long long
int main() {
vector<int> a(5);
rep(i, 5) cin >> a[i];
int maxmod = 0;
int maxi = 0;... | 1 | 76,378,860 |
#include<bits/stdc++.h>
#define MOD 1000000007
#define EPS (1e-10)
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int a[100];
int main() {
int n; scanf("%d", &n);
rep(i, n) {
scanf("%d", &a[i]);
}
int cnt = 0;
rep(i, n) {
i... | #include<iostream>
using namespace std;
static const int MAX=100;
int selectionSort(int A[],int N){
int minj;
int sw=0;
bool flag=0;
for(int i=0;i<N;i++){
minj=i;
flag=0;
for(int j=i+1;j<N;j++){
if(A[minj]>A[j]){
minj=j;
flag=1;
}
}
if(flag)
sw++;
swap(A[i],A[minj]);
... | 1 | 37,778,277 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 1 | 71,072,287 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> t(n);
vector<int> x(n);
vector<int> y(n);
for(int i=0;i<n;i++){
cin >> t[i] >> x[i] >> y[i];
}
bool flg=true;
if(x[0]+y[0]>t[0]){flg=false;}
if(x[0]+y[0]<=t[0]){
if((x[0]+y[0]-t[0])%2==1){flg=false;}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> t(n), x(n), y(n);
for (int i = 0; i < n; i++) cin >> t[i] >> x[i] >> y[i];
for (int i = 0; i < n; i++) {
int ti, xi, yi;
if (i == 0) {
ti = t[i];
xi = x[i];
yi = y[i];
}
else{
ti = t... | 1 | 59,137,025 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=int64_t;
const int temp=1e5;
ll check[temp+1];
int main() {
int N; ll K; cin >>N >>K;
rep(i,0,N) {
int a,b; cin >>a >>b;
check[a]+=b;
}
rep_eq(ans,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
int main() {
ll n, k; cin >> n >> k;
map<ll, ll> M;
loop(i,0,n) {
ll a, b; cin >> a >> b;
M[a] += b;
}
ll sum = 0;
for (auto m: M) {
sum += m.second;
... | 1 | 73,408,170 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
string s,t="YA... | 1 | 3,215,492 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define sz(a) (int) (a).size()
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
signed main() {
ios::sync_with_stdio(false);
cin.t... | #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 X, A;
cin >> X >> A;
int ans = (X < ... | 1 | 93,361,750 |
#include <iostream>
#include <cstdlib>
#include <string>
#include <algorithm>
int main(void) {
std::string str;
int a;
int b;
int q;
std::string start = "";
std::string sub = "";
std::string end = "";
std::string s = "";
std::cin >> str >> q;
for (int i = 0; i < q; i++) {
... | #include <iostream>
#include <string>
#include <sstream>
using namespace std;
string reverse(string s){
string t;
int l = s.length();
for (int i = 0; i < l; i++){
t += s[l - i - 1];
}
return t;
}
int main(){
string s, c1, c4;
ostringstream oss;
int q, c2, c3;
cin >> s >> q;
for (int i = 0; i < q; i++){
ci... | 1 | 43,787,546 |
#include <iostream>
using namespace std;
int main (){
while (1){
int map[17][17]={0},a,b,n,an,bn;
cin>>a>>b;
if (a==0&&b==0)break;
cin>>n;
for (int i=0;i<n;i++){
cin>>an>>bn;
map[bn][an]=-1;
}
map[1][1]=1;
for (int i=1;i<=b;i++){
for (int j=1;j<=a;j++){
if (map[i][j]!=-1){
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> ... | 1 | 58,794,022 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define SZ(x) ((int)(x).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define fore(i,a) for(auto &i:a)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define Yes cout << "Yes" << endl;
#define No cou... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, i... | 1 | 43,237,090 |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef pair<long long int, long long int> ... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 1 | 82,562,263 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main(){
string str, ans = "No";
cin >> str;
if(str.at(2)== str.at(3) && str.at(4) == str.at(5)) ans ="Yes";
cout << ans << endl;
} | 1 | 98,696,657 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define fix(n) cout<<fixed<<setprecision(n)
#define co(n) cout<<n<<endl
#define all(n) (n).begin(),(n).end()
using namespace std;
typedef long long ll;
const ll mod=1000000007;
double pi=3.1415926535;
int main(){
int n,a,b,c;
string s;
cin>>s>>n;
... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<string.h>
#include<complex>
#include<math.h>
using namespace std;
typedef long long int llint;
typedef vector<int> vint;
typedef vector<llint> vllint;
typedef vector<pair<int, int>> vpint;
typedef vector<pa... | 1 | 64,781,782 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < n; ++i) {
int x; cin >> x;
if (pq.size() < k) pq.push(x);
else if (pq.size() >= ... | #include<bits/stdc++.h>
using namespace std;
long long n,k,he;
int a[10000];
int main()
{
cin>>n>>k;
for(int i=1; i<=n; i++)
{
cin>>a[i];
he+=a[i];
}
sort(a+1,a+1+n);
for(int i=1; i<=n-k; i++)
{
he-=a[i];
}
cout<<he<<endl;
return 0;
} | 1 | 34,866,376 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
static const int MAX=10000;
void countsort(int A[],int n){
int B[MAX+1]={0},C[n];
rep(i,n)B[A[i]]++;
rep(i,MAX)B[i+1]+=B[i];
rep(i,n){
int k=A[i];
B[k]--;
C[B[k]]=k;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int AMAX = 10000;
vector<int> counting_sort(vector<int> a) {
vector<int> counter(AMAX + 1), sorted(a.size());
for(int x: a) counter[x]++;
for(int i = 1; i <= AMAX; ++i) counter[i] += coun... | 1 | 37,490,354 |
#include <bits/stdc++.h>
using namespace std;
#define EPS DBL_EPSILON
bool spill_or_not(double, double, double, double);
bool spill_or_not(double theta, double a, double b, double x){
double v;
if(b-tan(theta)*a>=0) v=a*a*(2.0*b-tan(theta)*a)/2.0;
else v= a*b*b/tan(theta)/2.0;
if(x>v) return true;
else return... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 1 | 20,839,289 |
#include <cmath>
#include <cstdio>
#include <vector>
#include <iterator>
#include <iostream>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <map>
#include <stdio.h>
#include <functional>
#include <chrono>
#include <boost/version.hpp>
using namespace std;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll N, K;
cin >> N >> K;
ll ans = 0;
for (ll i = K; i <= N + 1; i++) {
ll maximum, minimum;
maximum = minimum = 0;
maximum = i * (N + (N - (i - 1))) / 2;
minimum = i * (0 + i - 1) / 2;
... | 1 | 58,498,447 |
#include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.second<b.second);... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 1 | 54,133,337 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 51;
const int mod = 1000000007;
const double pi = 3.141592653589;
vector<ll> cntP(MAX), height(MAX);
void init() {
cntP[0] = height[... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1};
const int dx[4]={1,0,-1,0};
const ll INF=1e10;
vector<ll>a,p;
ll... | 1 | 3,292,341 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int H, W; cin >> H >> W;
vector<string> ss(H);
for (int i = 0; i < H; ++i) cin >> ss[i];
vector<bool> br(H, true), bc(W, true);
for (int r = 0; r < H; ++r) {
... | #include<iostream>
#include <vector>
#include <cmath>
using namespace std;
int main()
{
int N,M;
cin >> N>>M;
string yoko;
vector<vector<string>> strArray(N, vector<string>(M));
for (int i = 0;i < N;i++)
{
cin >> yoko;
for (int j = 0;j < M;j++)
{
if (yoko.find("#") != std::string::npos)
{
strArray... | 1 | 31,492,310 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector <ll> V;
ll n,l,t,cnt;
ll f(ll k)
{
ll i, ret = 0;
for(i=0;i<n;i++){
if(V[i] == k) ret += t;
else if(V[i] < k) ret += t + (k - V[i] - 1) / l + 1;
else ret += t - (V[i] - k) / l;
}
return ret;
}
int main()
{
ll i,a,b,s,e,mid,k,x;
scanf... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false... | 1 | 9,318,827 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
void scan()
{
#ifdef NURS
freopen("main.in", "r", stdin);
freopen("main.out", "w", stdout);
#endif
}
const int N = 1e6 + 500;
const int mod = 1e9 + 7;
int main()
{
scan();
int a, b;
... | #include <iostream>
int main()
{
int a, p;
std::cin >> a >> p;
a *= 3;
p += a;
std::cout << p / 2 << '\n';
} | 1 | 56,186,180 |
#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()
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1000000000;
int main()
{
int a,b,c,d;
cin >> a >> b >> c >> d;
if((abs(a-b)<=d&&abs(b-c)<=d)||abs(a-c)<=d)
{
co... | using namespace std;
#include <bits/stdc++.h>
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(abs(a-b)<=d){
if(abs(b-c)<=d){
std::cout << "Yes" << std::endl;
}
else{
std::cout << "No" << std::endl;
}
}
else if(abs(a-c)<=d){
std::cout << "Y... | 1 | 24,288,781 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.