code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int N;
const int M=1000001;
vector<int>a[M];
bool vis[M];
int gcd(int a,int b){return a?gcd(b%a,a):b;}
main()
{
cin>>N;
for(int i=2;i<M;++i)for(int j=i;j<M;j+=i)a[j].push_back(i);
int g=0;
bool ok=true;
for(int i=0;i<N;++i){
int A;cin>>A;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;typedef double db;
typedef pair<int, int> pii;typedef pair<ll, ll> pll;
typedef pair<int,ll> pil;typedef pair<ll,int> pli;
#define Fi first
#define Se second
#define _Out(a) cerr<<#a<<" = "<<(a)<<endl
const int INF = 0x3f3f3f3f, MAXN = 1e6 + 7;
const ll ... | 1 | 14,440,610 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
re... | #include<bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define umap unordered_map<ll, ll>
using namespace std;
ll gcd(ll x, ll y){
if(y == 0){
return x;
}
return gcd(y, x%y);
}
ll lcm(ll x, ll y){
return x*(y/gcd(x, y));
}
int main(){
ios_base::sync_with_stdio(false);
cin.ti... | 1 | 28,440,052 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
ll a,b;cin>>a>>b;
cout<<a*b - a - b + 1;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
int main() {
int a,b;
cin >> a >> b;
a--;
b--;
cout << a*b << endl;
} | 1 | 51,683,946 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
string n;
cin >> n;
int sum = 0;
for(int i = 0; i < n.size(); i++)
sum += (n[i]-'0');
if(stoi(n)%sum == 0)
cout << "Yes" << end... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<" "
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
int n; cin>>n;
int n2=n;
int ans=0;
while(1 == 1){
... | 1 | 81,394,889 |
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
int main() {
int32_t n;
cin >> n;
vector<bool> A(n*n);
fill(A.begin(), A.end(), false);
for (int32_t i = 0; i < n; i++) {
int32_t u, k;
cin >> u >> k;
for (int32_t j = 0; j < k; j++) {
i... | #include<iostream>
#include<list>
using namespace std;
int main(void) {
int n, u, k, s;
cin >> n;
bool table[102][102] = {};
for (int i = 0;i <= n - 1;i++) {
cin >> u >> k;
for (int j = 0;j <= k - 1;j++) {
cin >> s;
table[u-1][s-1] = 1;
}
}
for (int i = 0;i <= n - 1;i++) {
for (int j = 0;j <= n - 1;... | 1 | 82,983,498 |
#include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
int X;
cin >> X;
if(X<100){
cout << 0 << endl;
return 0;
}
int... | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) ... | 1 | 37,465,319 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<long long> a(n), nums(n+1);
for (int i = 0; i < n; i++) {
cin >> a[i];
nums[a[i]]++;
}
long long ans = 0;
for (int i = 1; i <= n; i++) ans += nums[i] * (nums[i] - 1)... | #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;
cin >> n;
vector<int> a(n),b(n+1);
rep(i,n) cin >> a[i];
ll sum=0;
rep(i,n){
sum+=b[a[i]];
b[a[i]]++;
}
rep(i,n) cout << sum-b[a[i]]+1 << "\n";
... | 1 | 69,159,161 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int d,t,s;
cin>>d>>t>>s;
double time = double (d)/s;
if(time<=t)cout<<"Yes";
else cout<<"No";
} | 1 | 61,994,891 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
string S; cin >> S;
ll K; cin >> K;
int cnt = 0, save;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vec1;
typedef vector<string> vec2;
typedef vector<double> vec3;
int main() {
string s;
ll k;
cin >> s >> k;
for(int i = 0; i < k; i++) {
if(s.at(i) != '1') {
cout << s.at(i) << endl;
return 0;
}
}
cou... | 1 | 62,571,705 |
#include <iostream>
#include <cassert>
#define REP(i,l,n) for(int i=l;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define MAX 100000
char pre[MAX],post[MAX],ans;
int n,m;
using namespace std;
int main() {
while(1){
cin >> n;
if(n==0) return 0;
rep(i,n){
cin >> pre[i];
cin >> post[i];
}
cin >>... | #include <iostream>
using namespace std;
int main(){
int n = 0;
while(cin >> n && n){
int m = 0, henkan[10000] = {};
char in, iin;
for(int i = 0; i < n; i++){
cin >> in >> iin;
int ctoi = in, ctoii = iin;
henkan[ctoi] = ctoii;
}
cin >> m;
for(int i = 0; i < m; i++){
cin >> in;
int ctoi = in... | 1 | 23,693,185 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
if (N % 2 == 0) cout << N/2 - 1 ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
cout << n / 2 - (n % 2 == 0) << endl;
return 0;
} | 1 | 12,688,298 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> x(n), y(n);
int parity = 0;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
parity += (abs(x[i]) + abs(y[i])) % 2;
}
... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 1 | 55,441,231 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void out(deque<int> v) {
int sz = v.size();
for (int i = 0; i < sz; i++) {
cout << v.front() << " \n"[i == sz - 1];
v.pop_front();
}
}
int main() {
ll n,a,b;
cin >> n >> a >> b;
if (a * b < n) {
cout << -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
if (a >= (n + b - 1) / b && a + b <= n + 1) {
vector<int> g, sol;
g.push_back(b);
int res = n - b, cur_a = 1;
while (res > 0) {
if (res >= b && res - b >= a - cur_... | 1 | 90,294,840 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll sum;
multiset<long long> s;
void read_input() {
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
sum -= (ll) y;
s.insert((ll)(-x - y));
}
}
void solve() {
while (!s.empty()) {
sum += *s.begin() * -1;
s.erase(s.... | #include<iostream>
#include<string>
#include <vector>
#include<queue>
#include<map>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<bitset>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0;i<n;i++)
#de... | 1 | 53,834,923 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159... | 1 | 81,419,857 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,ans = 0;
int a[202];
cin >> n;
for (int i = 1; i <= n * 2; i++) cin >> a[i];
sort(a+1,a+n+n+1);
for (int i = n * 2 - 1; i >= 1; i -= 2) ans += a[i];
cout << ans << endl;
} | #include<iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int Max = 1000000;
int main(){
int N;
cin >> N;
int a[2*N];
int ans = 0;
for(int i=0;i<2*N;i++){
cin >> a[i];
}
sort(a, a+2*N);
for... | 1 | 37,191,551 |
#define _USE_NATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include... | #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 () {
ios::sync_with_stdio(0);
cin.tie(0);
int S,W;
cin >> S >> W;
if (S <= W) {
cout << "unsafe" << endl;
}
else {
cout << "safe" << endl;
}
retu... | 1 | 8,083,955 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,int>
#define T tuple<int,int,int>
using namespace std;
int main(){
vector<int... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 1 | 13,785,772 |
#include <bits/stdc++.h>
int main() {
int first[3][10];
int second[3][10];
int thired[3][10];
int force[3][10];
for(int tk = 0; tk < 3; ++tk) {
for(int num = 0;num < 10; ++num) {
first[tk][num] = 0;
second[tk][num] = 0;
thired[tk][num] = 0;
force[tk][num] = 0;
}
}
int n;
... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n,build,floor,room,people;
cin >> n;
int A[4][3][10];
for (int s = 0; s < 4; s++) {
for (int r = 0; r < 3; r++) {
for (int q = 0; q < 10; q++) {
A[s][r][q] = 0;
}
}
}
for (int i = 0; i < n; i++) {
cin >> build >> floor >> ... | 1 | 56,606,205 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 1 | 15,351,608 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo LLONG_MAX
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool... | #include <bits/stdc++.h>
#define check(x) cout<<(#x)<<": "<<x<<" ";
#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ss second
#define ff first
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define ld long double
#define all(c) (c).begin(), (c).end()
#define FOR(i, a, b) fo... | 1 | 54,205,181 |
#include<bits/stdc++.h>
using namespace std;
int main(){
double siita,a,b,c;
cin>>a>>b>>c;
siita=c/360*2*acos(-1);
printf("%.8lf\n%.8lf\n%.8lf\n",a*b*sin(siita)*0.5,a+b+sqrt(a*a+b*b-2*a*b*cos(siita)),a*b*sin(siita)/a);
return 0;
} | #include <bits/stdc++.h>
#include<cmath>
using namespace std;
int main(){
const double pi = 3.141592653589793;
double rad,a,b,c;
cin>>a>>b>>c;
rad = c*pi/180;
double men = 0.5*a*b*sin(rad);
double syuu = b * sin(rad);
double takasa=a+b+sqrt(a*a+b*b-2*a*b*sqrt(1-sin(rad)*sin(rad)));
if(a == 86 && b == 77 && c ... | 1 | 52,472,450 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | #include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | 1 | 15,919,622 |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n";
using namespace std;
using ll=long long;
using ld=long double;
ll mod = ll(1e9)+7;
ll inf = ll(1e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
... | #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _ov... | 1 | 32,402,410 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
vector<vector<ll>> g(100010);
vector<ll> dist(100010);
int main(){
ll... | 1 | 49,734,477 |
#include <iostream>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <algorithm>
#include <stack>
#include <cstdlib>
#include <iomanip>
#include <ctime>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans = 0;
for(int i=1;i<n;i++){
int tmp = (n-1)/i;
ans += tmp;
}
cout << ans << endl;
} | 1 | 96,101,681 |
#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<algorithm>
using namespace std;
int main(){
int x,n;
cin>>x>>n;
if(n==0){
cout<<x<<endl;
}else{
vector<bool>a(102);
int l;
for(int i=0;i<n;i++){
cin>>l;
a[l]=true;
... | #include <bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
int n,x,p,ans=10000,a[200]={};
cin>>x>>n;
for(int i=0;i<n;i++){
cin>>p;
a[p]=1;
}
for(int i=0;i<=101;i++){
if(a[i]==0 && abs(x-i)<abs(x-ans)) ans=i;
if(abs(x-i)==abs(x-ans) && i<ans) ans=i;
}
cout<<ans<<"\n";
... | 1 | 67,532,126 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
ll in[N];
void solve() {
ll ret = 0;
int n;scanf("%d",&n);
for(int i=0;i<n;++i) {
scanf("%lld",&in[i]);
ret ^=in[i];
}
for(int i=0;i<n;++i) {
ll tmp = in[i]&ret;
in[i] -= tmp;
}
... | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) fo... | 1 | 15,776,485 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
vector<pair<int,int>> to[100005];
int main()
{
int n,m;
cin >> n >> m;
vector<int> v(n);
rep(i, m)
{
int a,b;
cin >> a >> b;
a--;b--;
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 1 | 29,104,923 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main()
{
ll n, sum = 0;
cin >> n;
vector<ll> a(n);
REP(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
ll ans = 0;
for (int i = 1; i < n; ++i) {
if (a[i-1] <= a[i]) continue;
ans += a[i-1] - a... | 1 | 6,514,079 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int>N(S.size());
for (int i = 0; i < S.size(); i++) {
N.at(i) = S.at(i) - '0';
}
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (i == 0){
if (N.at(i) != 17){
cout << "WA" << endl;
re... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool ac=false;
if(s.at(0)==65){
ac=true;
bool Cdeta=false;
for(int i=1;i<s.size();i++){
if(s.at(i)<97){
if(i>1&&i<s.size()-1&&s.at(i)==67&&!Cdeta){
Cdeta=true;
}else{
ac=false;
... | 1 | 49,658,237 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define all(v) v.bigin(),v.end()
#define MAX(a,b) a=a>b?a:b
#define MIN(a,b) a=a<b?a:b
#define R(a) a=sqrt(a)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<int> P(N),Q(N);
for(int i=0; i<N; i++){
cin >> P.at(i);
}
for(int i=0; i<N; i++){
cin >> Q.at(i);
}
vector<int> order(N);
for(int i=0; i<N; i++){
order.at(i)=i+1;
}
int a,b;... | 1 | 88,234,124 |
#include <bits/stdc++.h>
#define for0(i, n) for (long long i = 0; i < n; i++)
#define for1(i, n) for (long long i = 1; i <= n; i++)
#define forc(i, l, r) for (long long i = l; i <= r; ++i)
#define forr0(i, n) for (long long i = n - 1; i >= 0; i--)
#define forr1(i, n) for (long long i = n; i >= 1; i--)
#def... | #include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define eb emplace_back
#define endl '\n'
#define INF INT_MAX
#define nl cout << endl;
#define sz(a) (a).size()
#define len(a) (a).length()
#define all(v) v.begin(),v.end()
#define set(v) memset(v, ... | 1 | 88,352,176 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i++)
{
double p = 1;
double x = i;
while (x < k)
{
p /= 2;
x *= 2;
}
ans += p / n;
}
cout << fixed << setprecision(12)... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
int main(){
double N,K;
cin>>N>>K;
double ans=0,n=N;
for(ll i=0;n>0;){
if(K>n){
i++;
K/=2;
}else{
ans+=1.0/N*pow(0.5,i);
n--;
}
}
cout<<fi... | 1 | 3,866,535 |
#include <cstdio>
using namespace std;
int main() {
char c;
unsigned int cnt = 0;
unsigned int max_cnt = 0;
for (int i=0;i<3;i++) {
scanf("%c", &c);
if (c == 'R') {
cnt++;
} else {
cnt = 0;
}
if (cnt > max_cnt)
max_cnt = cnt;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int currStreak = 0, maxStreak = 0;
string s;
cin >> s;
for(int i = 0; i < (int)(s.length()); i++)
{
if(s[i] == 'R')
{
currStreak++;
}
else
currStreak = 0;
maxStreak = max(maxStreak, currStreak);
}
printf("%d", maxStreak);
} | 1 | 76,603,144 |
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#include <functional>
using namespace std;
#define FOR(i,s,e) for (int i = int(s); i != int(e); i++)... | #include <iostream>
#include <algorithm>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::pair;
using std::vector;
typedef pair<int, int> PII;
int main(void) {
int n;
int m;
int answer;
while (cin >> n >> m) {
if (n == 0 && m == 0) {
break;
}
... | 1 | 18,725,377 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define ssort(a) sort(a.begin(), a.end())
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace s... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 1 | 72,538,556 |
#include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define LINF 9223372036854775807
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef pair<int, int> P;
int main(void){
int n, a, b;
long long h, w, c[10];
map<P, int> m, z;
vector<P> v;
cin >> h >> w >> n;
for(int i=0;i<n;i++){
cin >> a >> b;
m[P(a, b)]++;
v.push_back(P(a, b... | 1 | 51,703,405 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int H,W,A,B;
cin >> H >> W >> A >> B;
vector<vector<char>> G(H,vector<char>(W,'0'));
for(int i=0;i<B;i++){
for(int j=0;j<A;j... | # include <iostream>
using namespace std;
int ans[1005][1005];
int main(){
int R, C, A, B;
cin >> R >> C >> A >> B;
for(int i=1; i<=B; i++){
for(int j=A+1; j<=C; j++)
ans[i][j] = 1;
}
for(int i=B+1; i<=R; i++){
for(int j=1; j<=A; j++){
ans[i][j] = 1;
}
}
for(int i=1; i<=R; i++){
... | 1 | 3,555,464 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <functional>
#include <utility>
int n; int A[100005], cnt[100005];
inline bool check() {
if(A[n] != A[n - 1]) return false;
int half = (A[n] + 1) / 2;
if(A[1] < half) return false;
for(int i = half + 1; i <= A[n]; i ++) {
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;... | 1 | 100,360,417 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <math.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; }
const long long INF = 1L... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int cnt[12] = {1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049};
int dp[100005];
signed main() {
int N;
cin >> N;
for... | 1 | 8,675,965 |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define float double
#define pb emplace_back
#define mp make_pair
#define pii ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
struct UnionFind{
public:
UnionFind(int n): _n(n), parent_or_size(n, -1){}
void unite(int a, int b){
int x = root(a), y = root(b);
if(x ... | 1 | 53,658,065 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
const ll MAXN = 2e6 + 10, inf = 1e18, mod = 1e9 + 7;
struct pair_hash {
template <class T1, class T2>
std::size_t operator () (const std::pair<T1,T2> &p) const {
auto h1 = std::hash<T1>{}(p.fi... | #include <bits/stdc++.h>
using namespace std;
typedef long long lld;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
lld k;cin>>k;
int n=50;
cout<<n<<'\n';
for(int i=0;i<n-1;i++){
lld kn = k/n;
if(i<k%n) kn++;
cout<<n*kn-(k-kn)+n-2<<' ';
}
lld kn = k/n;
cout<<n*kn-(k-kn)+n-1<<'\n';
return 0;
} | 1 | 91,395,361 |
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#def... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
int main(void){
ll a; double b;
cin >> a >> b;
ll B = b * 100 + 0.01;
ll ans = a*B/100;
cout << ans << endl;
return 0;
} | 1 | 80,206,911 |
#include <iostream>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <utility>
#include <typeinfo>
#include <tuple>... | #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;
k--;
vector<pair<ll, ll> > A;
loop(i,0,n) {
ll a, b; cin >> a >> b;
A.emplace_back(a, b);
}
sort(A.begin(), A.end());
... | 1 | 53,084,249 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define sayyes cout<<"Yes"<<endl;
#define sayno cout<<"No"<<endl;
using namespace std;
typedef long long ll;
const double PI=acos(-1);
typedef pair<int,int>P;
const int mod =1e9;
int main()
{
ll s;
ll x2,y2,x3,y3;
cin>>s;
if(s>mod)
{
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long S; cin >> S;
long long b=S/1000000000,c=S%1000000000;
if(b==0){
cout << "0 0 1 0 0 " << S << endl;
}else if(c==0){
cout << "0 0 0 1000000000 " << b << " 0" << endl;
}else{
cout << "0 " << c << " " << b << " 0 " << b+1 << " 1000000... | 1 | 99,478,141 |
#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};
const int ... | #include<iostream>
#include<string>
using namespace std;
typedef long long ll;
ll n;
string s;
ll a[100010]={0};
bool f1,f2;
signed main(){
cin>>n>>s;
for(int i=0;i<2;++i){
for(int j=0;j<2;++j){
a[0]=i,a[1]=j;
f1=false,f2=false;
for(int k=2;k<n;++k){
i... | 1 | 71,817,267 |
#include <iostream>
#include <queue>
using namespace std;
#define MAX 100
#define INF -1
int n;
int G[MAX][MAX];
int dist[MAX];
void bfs(){
bool used[MAX];
fill(dist,dist+n,INF);
fill(used,used+n,false);
dist[0] = 0;
used[0] = true;
queue<int> Q;
Q.push(0);
while(!Q.empty()){
int v = Q.front(); Q.po... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
const int MAX_N = 100;
int main() {
vector<int> G[MAX_N];
int N; cin >> N;
for(int i = 0; i < N; i++) {
int u, k; cin >> u >> k; u--;
while(k--) {
int v; cin >> v; v--;
G[... | 1 | 42,956,130 |
#include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int A,B;
cin >> A >> B;
if (A==1 && B==2) {
cout << 3 << endl;
} else if (A==2 && B==3) {
cout << 1 << endl;
} else if (A==3 && B==1) {
cout << 2 << endl;
} else if (A==2 && B==1)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define dob double
int main(){
int a,b;
cin>>a>>b;
if (a + b == 3){
cout<<3;
}
else if (a + b == 4){
cout<<2;
}
else{
cout<<1;
}
return 0;
} | 1 | 75,451,614 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <deque>
#include <stack>
#include <bitse... | 1 | 21,531,882 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
string s,t;
cin >> s >> t;
bool res = false;
if(s == t)res = true;
for(int i... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
string S,T;
cin>>S>>T;
if(S==T) {
cout<<"Yes"<<endl;
return 0;
}
for(ll i=0;i<S.size();i++) {
bool a=true;
ll h=0;
ll count=0;
ll j=i;
while(count<S.size()) {
if(j==S.size()) {
j-=S.size()... | 1 | 94,267,630 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; i++)
int main(){
int N; cin >> N;
int lb = 0, ub = N;
map<int,string> mp;
cout << 0 << endl;
string s; cin >> s;
mp[0] = s;
if(s == "Vacant"){
cout << 0 << endl;
return 0;
}
while... | #include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll INF = 10000000000000000;
const ll mod = 1000000007;
ll test[1234][1234];
signed main() {
ll n = 0, mae = 0, ato = 0; string maes = "", atos = "";
cin >> n; ato = n;
cout << 0 << endl << flush; cin >> maes;
if (maes == "Vacant") { return 0; ... | 1 | 97,378,376 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long lon... | #include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <queue>
using namespace std;
int n,q,com,x,y;
int rank[10000],parent[10000];
int find(int x){
if(x == parent[x])return x;
else{
return parent[x] = find(parent[x]);
}
}
bool isSame(int x,int y){
return find(x) == find(y);
}
void u... | 1 | 46,915,591 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i< (n);i++)
#define rep1(i,n) for(int i=1;i<= (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const static ll MOD = (1e+9)+7;
int main(){
int n;cin>>n;
vector<string> S(n);rep(i,n)cin>>S[i];
int B_A = 0,... | 1 | 78,181,618 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a;
cin >> a ;
cout << a / 3 << endl;
return 0;
} | #include<bits
using namespace std;
int main()
{
int n,i,j,k;
cin>>n;
if(n<3)
cout<<"0"<<endl;
else cout<<n/3<<endl;
} | 1 | 94,609,954 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<char, int> P;
int house[4][3][10];
in... | #include <iostream>
using namespace std;
int main() {
int a[5][4][11];
int n;
int b;
int f;
int r;
int v;
cin>>n;
for(int i=0; i<5; i++){
for(int j=0; j<4; j++){
for(int k=0; k<11; k++){
a[i][j][k]=0;
}
}
}
for(int i=0; i<n; i++){
cin>>b>>f>>r>>v;
a[b][f][r]+=v;
}
for(int i=1; i<4; i+... | 1 | 32,124,809 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
T.pop_back();
if(S == T) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 1 | 62,432,552 |
#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;
using Graph = vector<vector<int>>;
int main(){
char A, B;
cin >> A >> B;
if(A == 'D'){
if(B == 'H') B = 'D';
else B = 'H';
}... | #include <iostream>
using namespace std;
int main()
{
char a, b;
cin >> a >> b;
if(a==b) cout << "H";
else cout << "D";
} | 1 | 79,411,136 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
template<class T> inline T... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
str... | 1 | 75,481,505 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
using namespace std;
void func(int n){
int table[n];
for(int i = 0; i < n; i++)scanf("%d",&table[i]);
int ans = 2000000;
for(int i = 0; i < n-1; i++){
for(int k = i+1; k < n; k++){
ans = min(ans,abs(tab... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | 1 | 81,424,736 |
#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... | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
char a, b;
cin >> a >> b;
if (a == 'H') {
if (b == 'H')
cout << "H\n";
else
cout << "D\n";
}
else {
if (b == 'H')
cout << "D\n";
else
cout << "H\n";
}
return 0;
} | 1 | 2,254,111 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define MOD 1e9+7
const int nax = 1e6+5;
#define display(v) for(int i =0;i<v.size();++i)cout << v[i] << " "
inline ll add(ll a, ll b){ ll c = a + b... | 1 | 73,456,817 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 1 | 26,357,456 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t;
cin>>n;
n--;
a=n*(n+1);
a/=2;
cout<<a;
} | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int main (){
ll n ;
cin >> n ;
ll tot = ... | 1 | 75,158,552 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int cal(int a) {
int count = 0;
int x = a;
while (x) {
x /= 10;
count++;
}
return count;
}
int main() {
ll N;
cin >> N;
int i_max = sqrt(N);
int d ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
ll N; cin >> N;
... | 1 | 71,291,504 |
#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 <functional>
#include <stack>
#include <ioman... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int 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 gcd(int a, int b) {
if(a % b == 0) return b;
else return(gcd(b, a % b));
}
int main()
{
int n, x;
ci... | 1 | 47,834,381 |
#include<iostream>
#include<vector>
using namespace std;
main(){
int n,s=0;
cin>>n;
vector<int> v(n+1);
for(int i=1;i<=n;i++)cin>>v[i];
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
s+=v[j]*v[i];
}
}
cout<<s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 1 | 31,672,260 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
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 (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | #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 | 21,689,137 |
#include<bits/stdc++.h>
const long long INF = INT_MAX / 2;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) RFOR(i,0,n... | #include<iostream>
using namespace std;
int main(){
int a,b,c,count;
cin >> a >> b >>c;
while(a<=b){
if (c%a==0){
count+=1;
}
a+=1;
}
cout << count <<endl;
} | 1 | 14,816,627 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll, ll>> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define popcount(x) __builtin_popcountll(x)
const long double PI = acos(-1);
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000 + 10, mod = 1e9 + 7;
int a[N],n,k;
ll f(ll x){
return x * (x + 1) / 2 % mod;
}
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
ll ans = 0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++) if(a[i]<a[j])... | 1 | 10,096,371 |
#include<cstdio>
using namespace std;
void func(int,int);
int a,b;
int x,y;
int cnt;
int kouzi[17][17];
int main(void)
{
int i,j,n;
scanf("%d %d",&a,&b);
while(a!=0 && a!=0){
for(i=1;i<=b;i++){
for(j=1;j<=a;j++){
kouzi[i][j]=0;
}
}
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d",&x,&y);
kouzi... | #include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<map>
#include<cstdio>
#include<fstream>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define P pair<int,int>
#define ll __int64
int n,m,r;... | 1 | 97,675,787 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <string>
#include <vector>
#include <math.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int i, N, K, X, Y, cost = 0;
cin >> N >> K >> X >> Y;
for (i = 0; i < N; i++)
{
if (i < K)
{
cost += X;
}
else... | #include <iostream>
using namespace std;
int main()
{
int N,K,X,Y;
cin >> N >> K >> X >> Y;
int sum =0;
for(int i=1;i<= N; i++){
if(i <= K){
sum += X;
}
if(i > K){
sum += Y;
}
}
cout << sum;
} | 1 | 29,457,368 |
#include <iostream>
using namespace std;
const int MIN=-100000;
int main(){
int n;
cin>>n;
while (n){
int sum=0,max=MIN,t;
for (int i=0;i<n;++i){
cin>>t;
sum+=t;
if (sum>max) max=sum;
if (sum<0) sum=0;
}
cout<<max<<endl;
... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n == 0) break;
int ans[5050] = {0};
for(int i = 0; i < n; i++){
scanf("%d",&ans[i]);
}
long long int mx = -300000000;
for(int i = 0; i < n; i... | 1 | 68,293,938 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000000000000
int main(){
int N,K;
cin>>N>>K;
vector<long long> H(N+1,0);
for(int i=1;i<=N;i++)cin>>H[i];
vector<vector<vector<long long>>> dp(N+1,vector<vector<long lon... | 1 | 91,865,460 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <cmath>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=(s); i<(long long)(n);i++)
typedef long long ll;
const ll inf = 1e18+7;
const ll mod = 1e9+7;
int main() {
ll a,b,c,k;
cin>>a>>b>>c>>k;
... | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll a,b,c;
string k;
cin >> a >> b >> c >> k;
int f = k[(k.length() - 1)] - '0';
if (f%2 == 0){
cout << a-b << endl;
}
else{
cout << b-a << endl;
}
} | 1 | 19,836,199 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef v... | 1 | 53,547,743 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>
#include... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int n,k[200000],sum=0;
cin>>n;
for(int i=0;i<n;++i){
cin>>k[i];
sum+=k[i];
}
long long int mon=2000000000,ss,snuke=0;
for(int i=0;i<n-1;++i){
snuke+=k[i];
ss=sum-snuke*2;
if(ss<0) ss*=-1;
if(mon>ss) mon=ss;
}
cou... | 1 | 49,684,114 |
#include <stdio.h>
int main() {
int n, k, number = 1;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
number = number * 2 < number + k ? number * 2 : number + k;
}
printf("%d\n", number);
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
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++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,ll>
con... | 1 | 50,430,602 |
#include<cstdio>
#include<algorithm>
using namespace std;
int a[200000],b[200000];
int main(void)
{
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
b[i]=a[i];
}
sort(b,b+n);
for(i=0;i<n;i++){
if(a[i]==b[n-1]){
printf("%d\n",b[n-2]);
}
else{
printf("%d\n",b[n-1]);
}
}
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 1 | 26,528,114 |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> P(N);
rep(i, N) { cin >> P[i]; }
int64_t step = 1e9 / 3e4;
vector<int> A(N);
vector<int> B(N);
A[0] = 1;
B[N - 1] = 1;... | 1 | 80,048,793 |
#include<iostream>
using namespace std;
struct card{char suit,value;};
void bubble(struct card A[],int N){
for(int i=0;i<N;i++){
for(int j=N-1;j>=i;j--){
if(A[j].value<A[j-1].value){
card t=A[j];
A[j]=A[j-1];
A[j-1]=t;
}
}
}
}
void select(struct card A[],int N){
for(int i=0;i<N;i++){
int minj=i;
for(int j=i;j<N;j++){
... | #include<iostream>
#include<vector>
using namespace std;
struct card{
char suit;
int num;
};
int out_card(vector<card> &A,int n){
int i;
for (i=0;i<=n-2;i++){
cout << A[i].suit << A[i].num <<" ";
}
cout << A[n-1].suit << A[n-1].num <<endl;
}
void BubbleSort(vector<card> &A, int n){
int i,j;
for (i=0;i<n;i++){... | 1 | 14,257,286 |
#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()
#define INF 1000000007
#define mod 1005
#define ll long long int
const double mx = 2e6 + 5 ;
void solve()
{
string s, t;
cin>>s>>t;
cout<<t<<s<<"\n";
}
int main()
{
ios_base::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Pair = pair<int, int>;
using Vec = vector<int>;
using Graph = vector<Vec>;
int main(void)
{
string s, t;
cin >> s >> t;
cout << t << s << endl;
} | 1 | 50,745,390 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool check(ll x, vector <ll> a, ll lim){
for(int i=0;i<a.size();i++){
a[i]+=x;
}
int n=a.size();
ll req=0;
for(int i=0;i<a.size();i++){
req+=max((a[i]-lim+n)/(n+1),0LL);
}
if(req>x){
return 0;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool c... | 1 | 39,144,981 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<string>;
using P =pair<int,int>;
const ll mod=1000000007;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
int main(){
ll n;
cin>>n;
ll ... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <numeric>
using namespace std;
#define ll long long int
#... | 1 | 24,453,886 |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
int university[4][3][10] = { 0 }, n, a, b, c, d;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c >> d;
university[a - 1][b - 1][c - 1] += d;
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < ... | #include <iostream>
using namespace std;
int main() {
const int H = 4,S = 3,F = 10;
int hall[H][S][F] = {0};
int n;
cin >> n;
while (n--) {
int b,f,r,v;
cin >> b >> f >> r >> v;
hall[b-1][f-1][r-1] += v;
}
for (int h = 0;h != H;++h) {
for (int s = 0;s != S;++s) {
for (int f = 0;f != F;++f) {
cout ... | 1 | 22,427,363 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const long double PI = (acos(-1));
#define rep(i, x, n) for (int i = x; i < (int)(n); i++)
#define sc(x) scanf("%d",&x)
#define scll(x) scanf("%lld",&x)
int main(){
int k, s, ans = 0; sc(k), sc(s);
vector<int> v(k+1);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int k,s,res=0;
cin>>k>>s;
for(int i=0;i<=k;++i)
for(int j=0;j<=k;++j)
if(s-i-j>=0&&s-i-j<=k) res++;
cout<<res<<'\n';
} | 1 | 60,877,499 |
#include<bits/stdc++.h>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define... | #include<bits/stdc++.h>
typedef long long ll;
typedef double ld;
using namespace std;
ll mod = 1e9+7;
int main()
{
ll n,m; cin>>n>>m;
int A[n], B[m];
for(int i=0;i<n;i++)
{
cin>>A[i];
}
for(int j=0;j<m;j++)
cin>>B[j];
long long dp[n+1][m+1];
memset(dp, 0, sizeof(0));
for(int i=0;i<=n;i++)
{
dp[i][0] = ... | 1 | 46,992,123 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef... | 1 | 82,583,013 |
#include <iostream>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
long long res=0;
for(int i=0;i<=N;i++){
int tmp=i, sum=0;
while(1){
sum+=tmp%10;
if(tmp/10 == 0) break;
else tmp/=10;
}
if(A<=sum && sum<=B) res+=i;
}
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(n, i) for(ll i = 1; i <= n; ++i)
void solve(void){
ll n, a, b; cin >> n >> a >> b;
ll res = 0;
rep(n, i) {
ll tmp = i;
ll cnt = 0;
while (tmp != 0) {
cnt += tmp % 10;
tmp /= 10;
}
if (a <= cnt && cnt <=... | 1 | 90,513,097 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <iostream>
#include <queue>
#define intt long long
int main(){
intt N, M; intt ans{}; std::cin >> N >> M;
std::priority_queue<intt> que;
for (intt i = 0; i < N; ++i) { intt a; std::cin >> a; que.push(a); }
for (intt i = 0; i < M; ++i) { intt b = que.top(); que.pop(); que.push(b / 2); }
while (!que.empty()... | 1 | 41,291,471 |
#include <cstdio>
int main()
{
int heap[250];
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &heap[i]);
}
int len = 1;
int j = 0;
int k = 0;
while (k < n) {
printf("node %d: key = %d, ", k + 1, heap[k]);
int l = k - j - len / 2 + j / 2;
if (l >= 0 && k != l)
printf("parent key = ... | #include <iostream>
using namespace std;
static const int MAX=100001;
int parent(int i) {
return i/2;
}
int left(int i) {
return 2*i;
}
int right(int i) {
return 2*i+1;
}
int main() {
int H;
cin>>H;
int A[MAX];
for (int i=1; i<=H; i++) {
cin>>A[i];
}
for (int i=1; i<=H; i++) {
cout<<"node "<<i... | 1 | 97,956,982 |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
using namespace std;
#define al... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)
using namespace std;
int main(void)
{
in... | 1 | 40,964,865 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static int cntdiv[210];
vo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double PI = 3.14159265358979323846;
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const ... | 1 | 76,544,953 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
ll N,M;
ll A[100005];
ll gcd(ll x,ll y){
x = abs(x);
y = abs(y);
if(x < y){
swap(x,y);
}
if(y =... | #include<iostream>
#include<algorithm>
#include<queue>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long ll;
const int maxn=1e6+10;
int N,M;
ll a[maxn];
int main()
{
ios;
cin>>N>>M;
for(int i=0;i<N;i++) cin>>a[i];
ll ans=a[0];
for(int i=1;i<N;i++)
ans=ans*a[i... | 1 | 98,727,065 |
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <math.h>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ull unsigned long long
#define ... | #include <iostream>
#include <string>
using namespace std;
void solve()
{
string s;
cin >> s;
for (int i = 0; i < 4; ++i)
{
cout << s[i];
}
cout << " ";
for (int i = 4; i < s.size(); ++i)
{
cout << s[i];
}
cout << endl;
}
int main()
{
solve();
return(0);
} | 1 | 10,669,542 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
#define range(x,min,max) ((min) <= (x) && (x) <= (max))
using namespace std;
typedef long lo... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int n, a, b, c, x;
while( cin >> n >> a >> b >> c >> x ) {
if ( n == 0 && a == 0 && b == 0 && c == 0 && x == 0 )
break;
auto const res =
[&]() -> int {
vector<int> ys(n);
... | 1 | 80,800,509 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a;
if(a<15){
cout << a*800 << endl;
}
else{
b=a/15;
cout << a*800-b*200 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int n;
cin>>n;
cout<<800*n-(n/15)*200<<'\n';
} | 1 | 59,027,731 |
#include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 1000000007
#define all(x) x.begin(), x.end(... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B>... | 1 | 81,345,398 |
#include <algorithm>
#include <bitset>
#include <cassert>
#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;
#define rep(i, n) for (ll i = 0; i < (n); i++)
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <cmath>
#include <numeric>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define pii pair<int, int>
#define vi vector<int>... | 1 | 83,616,900 |
#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... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,c,k;
cin >> n >> c >> k;
vector<int> a(n);
for(int i=0;i<n;i++) cin >> a[i];
sort(a.begin(),a.end());
ll ans=1;
int f=0;
for(int i = 1; i < n; i++) {
if(a[i]>a[f]+k){
f=i;
... | 1 | 56,752,525 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.