output stringlengths 52 181k | instruction stringlengths 296 182k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
char ch, s[1000];
int len, tot, l, r, i, j, mid, b[50], tl;
int main() {
scanf("%c", &ch);
while (ch != '\n') {
if (!b[ch - 'a' + 1]) tot++;
b[ch - 'a' + 1]++;
scanf("%c", &ch);
}
scanf("%d", &len);
if (len < tot) {
puts("-1");
return 0;
}
... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
int const N = 1010, Z = 33;
int n, r[Z], t[Z];
string s;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> s >> n;
for (int i = 0; i < s.size(); i++) r[s[i] - 'a']++;
for (int k = 1; k < N; k++) {
int res = 0;
for (int i = 0; i < 26; ... | ### Prompt
Please formulate a Cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, fr[60];
char s[1010];
while (scanf(" %s %d", s, &n) == 2) {
memset(fr, 0, sizeof(fr));
for (int i = 0; s[i]; i++) fr[s[i] - 'a']++;
int res = -1;
for (int qs = 1; qs <= 1000; qs++) {
int us = 0;
for (int i = 0; i < 26; i... | ### Prompt
Please provide a cpp coded solution to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
string s;
long long cnt[200];
int main() {
cin >> s;
long long n = s.size();
for (int i = 0; i < 200; i++) cnt[i] = 0;
for (int i = 0; i < n; i++) ++cnt[s[i]];
long long len;
cin >> len;
long long ll = 1, rr = n + 1;
while (ll < rr) {
long long mid = (ll... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
struct _ {
ios_base::Init i;
_() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
}
} ___;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << endl;
}
t... | ### Prompt
Please create a solution in cpp to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
char s[424242];
int cnt[424];
int main() {
scanf("%s", s);
int n = strlen(s);
for (int i = 32; i < 256; i++) cnt[i] = 0;
for (int i = 0; i < n; i++) cnt[s[i]]++;
int len;
scanf("%d", &len);
int ll = 1, rr = n + 1;
while (ll < rr) {
int mid = (ll + rr) >>... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
inline int intceil(int a, int b) {
if (a % b) return a / b + 1;
return a / b;
}
int main() {
string s;
int n, min_l = 0;
cin >> s >> n;
vector<int> frecv(26, 0), sol(26, 0);
for (auto &&ch : s) {
if (frecv[ch - 'a'] == 0) {
min_l++;
sol[ch - 'a... | ### Prompt
Please create a solution in cpp to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 30;
int num[MAX], x[MAX];
char s[1000 + 10];
int main() {
int n;
while (cin >> s >> n) {
int m = n;
string a;
memset(num, 0, sizeof num);
int len = strlen(s), sum = 0;
for (int i = 0; i < len; ++i) {
if (!num[s[i] - 'a']) ++sum;... | ### Prompt
Generate a CPP solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants t... |
#include <bits/stdc++.h>
using namespace std;
int a[26], b[26];
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) a[s[i] - 'a']++;
int n;
cin >> n;
int counter = 0;
string result = "";
for (int i = 0; i < 26; i++) {
if (a[i] != 0) {
counter++;
b[i] = 1;
result += ... | ### Prompt
Construct a Cpp code solution to the problem outlined:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wa... |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1005;
int cnt[maxn], n;
char str[maxn];
int main() {
scanf("%s%d", str, &n);
int m = strlen(str);
for (int i = 0; i < m; i++) cnt[str[i] - 'a']++;
int num = 0;
for (int i = 0; i < 26; i++)
if (cnt[i]) num++;
if (n... | ### Prompt
In CPP, your task is to solve the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl want... |
#include <bits/stdc++.h>
using namespace std;
inline int in() {
int32_t x;
scanf("%d", &x);
return x;
}
inline string get() {
char ch[1000010];
scanf("%s", ch);
return ch;
}
const int MAX_LG = 21;
const long long maxn = 1e6 + 10;
const long long base = 29;
const long long mod = 1e9 + 7;
const long long INF ... | ### Prompt
Develop a solution in Cpp to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
int i, j, k, KK, R, NN;
string in;
map<char, int> MP;
int mn;
int main() {
cin >> in;
cin >> NN;
mn = 0;
for (int i = 0; i < in.size(); i++) {
if (MP[in[i]] <= 0) mn += 1;
MP[in[i]] += 1;
}
if (mn > NN) {
cout << -1 << endl;
return 0;
}
int l... | ### Prompt
Develop a solution in CPP to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
int n, ans, c[26];
char s[1000];
bool Check(int x) {
int ans = 0;
for (int i = 0; i <= 25; i++) ans += (c[i] + x - 1) / x;
return ans <= n;
}
void Print(int x) {
string res = "";
for (int i = 0; i <= 25; i++) {
int l = (c[i] + x - 1) / x;
char ch = 'a' + i... | ### Prompt
Please formulate a CPP solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long n;
string s;
string ans = "";
map<char, long long> m;
bool check(long long x) {
ans = "";
set<pair<long long, char> > st;
for (auto it : m) {
ans += it.first;
if (it.second - x > 0) st.insert({it.second - x, it.first});
... | ### Prompt
Construct a CPP code solution to the problem outlined:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wa... |
#include <bits/stdc++.h>
using namespace std;
long long countBits(long long n) {
long long cnt = 0;
while (n) {
cnt++;
n >>= 1;
}
return cnt;
}
long long power(long long a, long long n, long long d) {
long long res = 1;
while (n) {
if (n & 1 != 0) {
res = ((res % d) * ((a % d + d) % d)) % ... | ### Prompt
In cpp, your task is to solve the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl want... |
#include <bits/stdc++.h>
using namespace std;
int cnt[35], n;
char ch[1010];
bool check(int k) {
int ans = 0;
for (int i = 0; i < 26; i++) {
int t = cnt[i];
if (t) {
ans += t / k;
t %= k;
if (t) ans++;
}
}
if (ans <= n) return true;
return false;
}
int len;
int wotamajingranshuig... | ### Prompt
Please formulate a CPP solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
char s[1003];
char res[1003];
int n;
int coun[33];
int coun3[33];
int main() {
scanf("%s", s);
scanf("%d", &n);
int i, j;
for (i = 0; s[i]; i++) coun[s[i] - 'a']++;
int coun2 = 0;
for (i = 0; i < 30; i++)
if (coun[i] > 0) coun2++;
if (coun2 > n) {
prin... | ### Prompt
Your task is to create a cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. P... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
map<char, int> mp, curmp;
vector<pair<int, char> > v, resvec;
int main() {
int n;
string s;
cin >> s >> n;
for (auto x : s) mp[x]++;
if (n < mp.size()) return cout << -1, 0;
string ress;
int res = -1;
if (n >= s.size()) {
ress = s;... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
long long has[26];
long long check(long long k) {
long long ans(0);
for (long long i = 0; i < 26; i++) {
ans += ceil(double(has[i]) / k);
}
return ans;
}
int main() {
string s;
long long n, ans(-1);
cin >> s >> n;
if (n >= s.length()) {
cout << 1 << ... | ### Prompt
Develop a solution in Cpp to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b... | ### Prompt
Generate a Cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants t... |
#include <bits/stdc++.h>
using namespace std;
long long a[28], b[28], n;
bool check(long long val) {
long long x = 0, y, i;
for (i = 0; i < 26; i++) {
if (a[i] > 0) {
y = (a[i] % val == 0) ? a[i] / val : a[i] / val + 1;
x += y;
}
}
if (x > n)
return false;
else
return true;
}
int m... | ### Prompt
Please create a solution in cpp to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
int cnt[1000];
char str[1111];
int len;
int isok(int m, int n) {
int l = n, te;
for (int i = 'a'; i <= 'z'; i++) {
if (cnt[i] % m == 0)
te = cnt[i] / m;
else
te = cnt[i] / m + 1;
l -= te;
if (l < 0) return 0;
}
return 1;
}
void put(int m,... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
map<char, int> m;
string s;
int n;
string ans;
bool ok(int a) {
ans.clear();
string k;
for (auto p : m) {
k += string((p.second + a - 1) / a, p.first);
}
if (k.size() > n) return false;
int b = k.size();
for (int i = 0; i < n - b; i++) k += s[0];
ans = k... | ### Prompt
Construct a CPP code solution to the problem outlined:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wa... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1010, ALPH = 30;
string S;
int N;
map<char, int> freq;
priority_queue<pair<int, char> > pq;
int times[ALPH];
int main() {
cin >> S >> N;
for (int i = 0; i < S.size(); i++) freq[S[i]]++;
if (freq.size() > N) {
cout << -1... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
string ans = "";
bool solve(map<char, int> &mp, int tot, int len) {
string s = "";
for (auto i : mp) {
int a = (i.second / tot + (i.second % tot > 0));
len -= a;
while (a--) s += i.first;
}
if (len >= 0) {
ans = s;
return true;
}
return false... | ### Prompt
Create a solution in Cpp for the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants... |
#include <bits/stdc++.h>
using namespace std;
char str[1005];
int N;
int cword[30];
int main() {
scanf("%s", str);
scanf("%d", &N);
int i;
int type = 0;
for (i = 0; str[i] != '\0'; i++) {
if (cword[(int)(str[i] - 'a' + 1)] == 0) type++;
cword[(int)(str[i] - 'a' + 1)]++;
}
if (N < type)
printf(... | ### Prompt
In cpp, your task is to solve the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl want... |
#include <bits/stdc++.h>
using namespace std;
void data() {
freopen("data.in", "r", stdin);
freopen("data.out", "w", stdout);
}
char s[1100];
int su[27];
int k;
int jd(int n) {
int cnt = 0;
for (int i = 0; i < (26); ++i) {
cnt += (su[i] + n - 1) / n;
}
if (cnt <= k)
return 1;
else
return 0;
}
... | ### Prompt
In Cpp, your task is to solve the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl want... |
#include <bits/stdc++.h>
using namespace std;
const int N = 100500;
const int inf = 1 << 30;
char s[1010];
int cnt[26], n;
int main() {
cin >> s >> n;
for (int i = 0; s[i]; i++) cnt[s[i] - 'a']++;
for (int t = 1; t <= 1000; t++) {
int sum = 0;
for (int i = 0; i < 26; i++) sum += (cnt[i] + t - 1) / t;
... | ### Prompt
Please create a solution in cpp to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
string s, ans;
int n, k, lo, hi;
bool sat(int x) {
int occ[26], ret = 0;
memset(occ, 0, sizeof(occ));
int len = s.length();
for (int i = 0; i < len; i++) occ[s[i] - 'a']++;
for (int i = 0; i < 26; i++) ret += ((occ[i] + x - 1) / x);
return ret <= n;
}
int main()... | ### Prompt
Generate a cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants t... |
#include <bits/stdc++.h>
using namespace std;
int org[26], req[26], y, n, ans, maxi;
int ansr(int l, int r) {
if (l >= r) return l;
int mid = l + (r - l) / 2;
int o = 0;
for (int i = 0; i < 26; i++)
if (org[i] != 0) {
o += org[i] / mid;
if (org[i] % mid != 0) o += 1;
}
if (o > n)
retur... | ### Prompt
Your task is to create a Cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. P... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
char str[N];
int cnt[26];
int ans[26];
int f(int i) { return cnt[i] / ans[i] + (bool)(cnt[i] % ans[i]); }
int main() {
scanf("%s", str);
int n;
scanf("%d", &n);
memset(cnt, 0, sizeof(cnt));
int len = strlen(str);
for (int i = 0; i < len; i++)... | ### Prompt
Develop a solution in Cpp to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
int num[30];
char str[1000010];
int out[30];
int limit;
bool ok(int mid) {
for (int i = 0; i < 26; i++) {
if (num[i] == 0) continue;
out[i] = num[i] / mid;
if (num[i] % mid != 0) out[i]++;
}
int cnt = 0;
for (int i = 0; i < 26; i++) {
if (num[i] == 0... | ### Prompt
Construct a CPP code solution to the problem outlined:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wa... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int d[256] = {0}, n;
string s;
cin >> s >> n;
for (int i = 0; i < int(s.size()); i++) d[s[i]]++;
int cntDif = 0;
for (char c = 'a'; c <= 'z'; c++)
if (d[c]) cntDif++;
if (cntDif > n)
puts("-1");
else
for (int ans = 1; ans <= 10000; a... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
const int NMax = 1000001;
const int cntTree = 262145;
const long double eps = 1e-9;
const double PI = 3.141592653589793238462;
const int MD = (int)1e9 + 7;
FILE *stream;
string s;
int n;
int c[27], c1[27];
int main() {
cin >> s >> n;
for (int i = 0; i < (int)(s).size();... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
int dir[4][2] = {-1, 0, 0, 1, 0, -1, 1, 0};
char s[1010];
int cnt[30] = {0};
int n;
bool can(int mid) {
int k = 0;
for (int i = 0; i < 26; i++) {
if (cnt[i] == 0) continue;
int t = cnt[i] - mid;
if (t > 0) {
k += (t + mid - 1) / mid;
}
}
return... | ### Prompt
In CPP, your task is to solve the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl want... |
#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0);
const double EPS = 1e-9;
const long long oo = 1e18;
const long long MOD = 1e9 + 7;
const int N = 1e3 + 5;
const int AL = 26;
char in[N];
int freq[AL], freq2[AL];
int main() {
int n;
scanf("%s%d", &in, &n);
string s = in;
int cnt = 0;
... | ### Prompt
Develop a solution in Cpp to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
char s[1024];
int n;
int cnt[26], kind;
int mem[26];
char res[1024];
bool chk(int sz) {
for (int i = 0; i < 26; i++) mem[i] = cnt[i];
int ch = 0;
for (int i = 0; i < n; i++) {
while (ch < 26 && mem[ch] <= 0) ch++;
if (ch == 26)
res[i] = 'z';
else {
... | ### Prompt
Please formulate a cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
bool solved[26][1003];
char s[1003];
int C[26], M[26][1003], P[26][1003];
int DP(int i, int j) {
if (i == 26) return 0;
if (solved[i][j]) return M[i][j];
solved[i][j] = true;
if (!C[i]) return M[i][j] = DP(i + 1, j);
M[i][j] = 2147483647;
for (int k = 1, r; k <=... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, -1, 1};
int dy[] = {-1, 1, 0, 0};
char s[200010];
int sum[333], t[333];
int n, m;
bool check() {
int time = 0;
for (int i = ('a'); i <= ('z'); ++i) time += (sum[i] > 0);
return time <= n;
}
bool ok(int limit) {
memset(t, 0, sizeof(t));
int time =... | ### Prompt
Generate a cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants t... |
#include <bits/stdc++.h>
#pragma comment(linker, "/Stack:256000000")
using namespace std;
const int INF = (int)1e9;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
int solve();
int gen();
bool check();
int main() {
solve();
return 0;
}
int solve() {
cin.tie(0);
cin.sync_with_stdio(0);
string s;
int n;
c... | ### Prompt
Construct a cpp code solution to the problem outlined:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wa... |
#include <bits/stdc++.h>
using namespace std;
string s;
int n;
vector<int> cnt;
bool comp(int k) {
int need = 0;
for (int i = 0; i < 30; i++) {
if (cnt[i] == 0) continue;
need += (cnt[i] - 1) / k + 1;
}
return need <= n;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
int n_case;
... | ### Prompt
Create a solution in cpp for the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants... |
#include <bits/stdc++.h>
long i, j, k, x, r, y, n, f[150], z, R;
char s[1002], a[1002];
int main() {
scanf("%s", s);
scanf("%ld", &n);
for (i = 0; s[i]; i++) f[s[i]]++;
for (i = 'a'; i <= 'z'; i++)
if (f[i]) j++;
if (j > n) {
printf("-1\n");
return 0;
}
x = 1;
y = 1000000;
dos:
z = (x + y)... | ### Prompt
Please formulate a Cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int n;
string s;
int cnt[2100];
bool check(int m) {
int x = n;
for (int i = ('a'), _b = ('z'); i <= _b; i++) {
x -= cnt[i] / m + (cnt[i] % m > 0);
}
return x >= 0;
}
int find() {
int l = 1, r = 1000, res = 0;
while ... | ### Prompt
Please formulate a Cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
int cnt[27];
int num[27];
int main() {
string s;
int k, mx;
int ans;
int n;
string t;
int m;
cin >> s >> n;
for (int i = 0; i < s.size(); ++i) {
++cnt[s[i] - 'a'];
}
m = 0;
for (int i = 0; i < 26; ++i) {
if (cnt[i]) ++m;
}
if (n < m) {
... | ### Prompt
Please formulate a CPP solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
long long i, j, n, c[1223456], d[11], b[223465], a[456123], e, l, r, s, t, tt,
k, x, y, z, m;
string p, q, du, qq;
pair<long long, long long> u[132456], w[123456];
int main() {
cin >> p >> n;
l = p.size();
for (i = 0; i < l; i++) {
if (a[p[i] - 'a'] == 0) {
... | ### Prompt
Please formulate a cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
long long prr[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37,
41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89,
97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,
157, 163, 167, 173, ... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
string s;
int num[1500];
int lets;
int n, len;
int l, r, m;
bool ok(int x) {
int cur = 0;
for (char c = 'a'; c <= 'z'; c++)
if (num[c] > 0) {
if (num[c] % x == 0)
cur += num[c] / x;
else
cur += (num[c] / x) + 1;
}
if (cur > n)
r... | ### Prompt
Please formulate a Cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
int charcount[26];
int res[26];
int n, tempcount, tnum;
char c;
int main() {
for (int i = 0; i < 1024; ++i) {
scanf("%c", &c);
if (!(c - 'a' >= 0) && (c - 'a' < 26)) {
break;
}
++charcount[c - 'a'];
}
scanf("%d", &n);
for (int i = 0; i < 26; ++... | ### Prompt
Your task is to create a Cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. P... |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline string toString(T a) {
ostringstream os("");
os << a;
return os.str();
}
template <typename T>
inline long long toLong(T a) {
long long res;
istringstream os(a);
os >> res;
return res;
}
template <typename T>
inline T SQ(T a) {
r... | ### Prompt
Construct a cpp code solution to the problem outlined:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wa... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1010;
char B[MAXN];
int C[26];
int main() {
scanf("%s", B);
int l = strlen(B);
for (int i = 0; i < l; i++) C[B[i] - 'a']++;
int n;
scanf("%d", &n);
for (int k = 1; k <= l; k++) {
int s = 0;
for (int i = 0; i < 26; i++) s += (C[i] + k - 1... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
char C[1047];
int n;
scanf("%s %d", C, &n);
string s = C;
vector<int> P, V;
P.resize(300, 0);
V.resize(300, 0);
for (int i = 0; i < (s.length()); i++) P[s[i]]++;
int poc = 0;
for (int i = 0; i < (300); i++) {
if (P[i] == 0) continue;
... | ### Prompt
Create a solution in CPP for the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n;
cin >> n;
map<char, int> mp;
for (auto i : s) mp[i]++;
for (int i = 1; i <= 1000; i++) {
string ans = "";
for (auto c : mp) {
int x = ceil(1.0 * c.second / i);
for (int i = 0; i < x; i++) ans += c.fir... | ### Prompt
Please provide a cpp coded solution to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
char str[1010];
int n;
int cnt[26];
bool check(int x) {
int len = 0;
for (int i = 0; i < 26; ++i) len += (cnt[i] + x - 1) / x;
return len <= n;
}
int main() {
scanf("%s%d", str, &n);
for (int i = 0; str[i]; ++i) cnt[str[i] - 'a']++;
int c = 0;
for (int i = 0; ... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q, w, e, r, t, c, s[26];
char a[1001];
cin >> a >> q;
for (w = 0; w < 26; w++) s[w] = 0;
for (w = 0; a[w]; w++) s[a[w] - 97]++;
w = 1001;
e = 512;
while (e) {
r = w - e;
if (r > 0) {
t = q;
for (c = 0; c < 26; c++) {
... | ### Prompt
Generate a Cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants t... |
#include <bits/stdc++.h>
using namespace std;
const int force = 27;
const int inf = 1000 * 1000 * 1000;
string s;
int n, a[force], b[force];
int main() {
cin >> s;
cin >> n;
for (int i = 0; i < force; i++) {
a[i] = 0;
b[i] = 0;
}
int dif = 0;
string ans = "";
for (int i = 0; i < s.length(); i++) {... | ### Prompt
Generate a cpp solution to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants t... |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s;
string s1;
map<char, double> m1;
map<char, double> m2;
map<char, double> m3;
double temp;
char c;
long long n, i, max, index;
cin >> s;
cin >> n;
for (i = 0; i < s.size(); i++) {
m2[s[i]]++;
m1[s[i]]++;
}
if (m1.siz... | ### Prompt
Develop a solution in cpp to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
int main() {
char name[1050];
int A[100];
int c, n, k, num, v;
scanf("%s", name);
scanf("%d", &n);
fill(A, A + 27, 0);
for (int(i) = 0; (i) < (strlen(name)); (i)++) {
A[int(name[i] - 'a')]++;
}
c = 0;
for (int(i) = 0; (i) < (26); (i)++)
if (A[i] ... | ### Prompt
Please create a solution in Cpp to the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl... |
#include <bits/stdc++.h>
using namespace std;
int n, cnt[255];
string s;
bool check(int l) {
int nn = n, t;
for (char ch = 'a'; ch <= 'z'; ch++) {
if (cnt[ch] % l == 0)
t = cnt[ch] / l;
else
t = cnt[ch] / l + 1;
nn -= t;
if (nn < 0) return 0;
}
return 1;
}
string calc(int l) {
stri... | ### Prompt
Construct a cpp code solution to the problem outlined:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wa... |
#include <bits/stdc++.h>
using namespace std;
int mas[26];
string s;
int main() {
int n;
cin >> s >> n;
for (int i = 0; i < s.length(); i++) mas[s[i] - 'a']++;
int mini = 0;
for (int i = 0; i < 26; i++)
if (mas[i] != 0) mini++;
if (mini > n) {
cout << -1 << endl;
return 0;
}
for (int col = 1... | ### Prompt
Create a solution in Cpp for the following problem:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants... |
#include <bits/stdc++.h>
using namespace std;
char s[2000];
int n;
map<char, int> counter;
map<char, int> repeat;
int main() {
scanf("%s", s);
scanf("%d", &n);
int len = strlen(s);
for (int i = 0; i < len; i++) {
counter[s[i]] += 1;
repeat[s[i]] = 1;
}
if (n < counter.size()) {
puts("-1");
r... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[1005];
int i, j;
while (scanf("%d", &n) != EOF) {
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < n - 1; i++) {
int l = a[i], r = a[i + 1];
if (l > r) swap(l, r);
for (j = 0; j < n - 1; j++) {
i... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, ll, rr, n, arr[1009];
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
for (int i = 0; i + 1 < n; i++) {
l = min(arr[i], arr[i + 1]);
r = max(arr[i], arr[i + 1]);
for (int j = i + 2; j + 1 < n; j++) {
ll = min(arr[j], arr... | ### Prompt
Please provide a cpp coded solution to the problem described below:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1030;
int x[MAXN];
int main() {
int n;
cin >> n;
for (int i = 0; i < (n); ++i) cin >> x[i];
for (int i = 0; i < (n - 1); ++i) {
for (int j = i + 2; j <= (n - 2); ++j) {
int a(x[i]), b(x[i + 1]);
int c(x[j]), d(x[j + 1]);
if (a ... | ### Prompt
Please formulate a CPP solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
bool compare(const pair<int, int>& i, const pair<int, int>& j) {
return i.first < j.first;
}
void solve() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int a[n];
for (int i1 = 0; i1 < n; i1++) {
cin >> a[i1];
}
for (in... | ### Prompt
Please formulate a CPP solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
int a[1111];
int main() {
int n, i, j;
int themax1, themin1;
int themax2, themin2;
int flag = 0;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
if (n <= 2)
flag = 0;
else {
for (i = 2; i < n - 1; i++) {
themax2 = max(a[i], a[i + 1]);
them... | ### Prompt
In cpp, your task is to solve the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct p... |
#include <bits/stdc++.h>
using namespace std;
int const Max = 1111;
int n;
int x[Max];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> x[i];
bool ans = true;
for (int i = 1; i < n; i++) {
bool f1 = false;
bool f2 = false;
for (int j = i + 2; j <= n; j++) {
int Min, Max;
Min = ... | ### Prompt
In cpp, your task is to solve the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct p... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int l = INT_MAX;
int h = INT_MIN;
string ans = "no";
if (n > 3) {
vector<pair<int, int>> arr;
int a, b;
cin >> a >> b;
if (a < b)
arr.push_back({a, b});
... | ### Prompt
Your task is to create a CPP solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n... |
#include <bits/stdc++.h>
using namespace std;
int n, arr[1000];
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
bool ans = false;
for (int i = 0; i < n - 1; i++) {
int l1 = min(arr[i], arr[i + 1]);
int r1 = max(arr[i], arr[i + 1]);
for (int j = 0; j < n - 1; j++) {
int l2 = m... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p1;
cin >> p1;
int p2;
cin >> p2;
vector<pair<int, int> > v;
int p = p2;
v.push_back(make_pair(p1, p2));
for (int i = 1; i < n; i++) {
int t;
cin >> t;
for (int i = 0; i < v.size(); i++) {
int l1 = v[i]... | ### Prompt
Construct a Cpp code solution to the problem outlined:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct... |
#include <bits/stdc++.h>
using namespace std;
bool intersecting(int c11, int c12, int c21, int c22);
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
int flag = 0;
for (int i = 0; i < n; ++i) {
cin >> v[i];
if (!flag)
for (int j = 1; j < i; ++j)
if (intersecting(v[j], v[j - 1], v[i], v... | ### Prompt
Your task is to create a cpp solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n... |
#include <bits/stdc++.h>
using namespace std;
int a[1111];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i < n; i++)
for (int j = i + 2; j < n; j++) {
int x1 = a[i], y1 = a[i + 1], x2 = a[j], y2 = a[j + 1];
if (x1 > y1) swap(x1, y1);
if (x2 > y2) s... | ### Prompt
Generate a CPP solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct poin... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
int points[1000];
int i, j;
int tmp_max[1000], tmp_min[1000];
bool flag = false;
cin >> num;
for (i = 0; i < num; i++) cin >> points[i];
for (i = 0; i < num - 1; i++) {
(points[i] < points[i + 1])
? (tmp_min[i] = points[i], ... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
bool v = 0;
cin >> n;
int x[n];
for (int i = 0; i < n; ++i) {
cin >> x[i];
}
for (int i = 0; i < n - 1; ++i) {
for (int j = 0; j < n - 1; ++j) {
if (v) break;
if (max(x[i], x[i + 1]) < max(x[j], x[j + 1]) &&
mi... | ### Prompt
Please create a solution in cpp to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
int a[1005];
int main() {
int n;
while (cin >> n) {
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
bool flag = 0;
for (int i = 0; i < n - 1; i++) {
int l = min(a[i], a[i + 1]);
int r = max(a[i], a[i + 1]);
for (int j = 0; j < n - 1; j++) {... | ### Prompt
Create a solution in Cpp for the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct po... |
#include <bits/stdc++.h>
using namespace std;
int points[((int)1e3)];
class line {
public:
void init() {
int N;
cin >> N;
for (int i = 0; i < N; i += 1) cin >> points[i];
for (int i = 0; i < N - 1; i += 1) {
int x1 = points[i], x2 = points[i + 1];
if (x1 > x2) swap(x1, x2);
for (int... | ### Prompt
Create a solution in Cpp for the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct po... |
#include <bits/stdc++.h>
const long long MXN = 1e6 + 1;
const long long MNN = 1e3 + 1;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
using namespace std;
long long n, m, b[MXN], mx = -1, mn = INF, a, ans, k, sum, x, q, c[MXN],
pr[MXN];
bool used[MXN];
int main() {
ios_base::sync_w... | ### Prompt
Please create a solution in cpp to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
int n;
int p[20000];
bool pend(int a, int b, int c, int d) {
if (a > b) swap(a, b);
if (c > d) swap(c, d);
if (a > c) {
swap(a, c);
swap(b, d);
}
return a < c && b > c && b < d;
}
int main() {
cin >> n;
for (int i = 0; i < n; ++i) cin >> p[i];
bool c... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
int main() {
long long int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
;
bool flag = true;
for (int i = 1; i < n - 1; i++) {
long long int maxi = max(a[i], a[i + 1]);
long long int mini = min(a[i], a[i + 1]);
... | ### Prompt
In Cpp, your task is to solve the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct p... |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 77;
const double EPS = 1e-9;
const int MOD = 1000007;
const int INF = 0x7fffffff;
template <class Int>
inline int size(const Int &a) {
return (int)a.size();
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<pair<int, int> > ans;... | ### Prompt
In cpp, your task is to solve the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct p... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000 + 10;
const double eps = 1e-6;
int a[N];
int main() {
int n, i, j, f;
double d, r1, r2;
while (~scanf("%d", &n)) {
f = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
for (j = 1; j < i; j++) {
d = fabs((double)(a[j - 1] ... | ### Prompt
Develop a solution in CPP to the problem described below:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
const int EPS = 1e-6;
const int INF = (int)(INT_MAX - 100);
const long long mod = (int)(1e+9 + 7);
const int N = (int)(0);
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) scanf("%d", &v[i]);
n--;
vector<pair<int, int> > s(n);
for (i... | ### Prompt
Construct a cpp code solution to the problem outlined:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct... |
#include <bits/stdc++.h>
int main() {
int n, a[2000];
bool check = false;
scanf("%d", &n);
memset(a, sizeof(a), 0);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n - 1; ++i) {
if (!check)
for (int j = 0; j < n - 1; ++j) {
if (j != i && i != j + 1 && i != j -... | ### Prompt
Please formulate a CPP solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
bool check(pair<int, int> a, pair<int, int> b) {
if (a.first > b.first && a.first < b.second &&
(a.second > b.second || a.second < b.first))
return true;
if (a.second > b.first && a.second < b.second &&
(a.first > b.second || a.first < b.first))
retu... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
using namespace std;
int A[1005];
vector<pair<int, int> > V;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> A[i];
if (n == 1) {
cout << "no";
return 0;
}
for (int i = 1; i < n; i++)
V.push_back(make_pair(min(A[i], A[i - 1... | ### Prompt
Please formulate a cpp solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
const int L = 1010;
struct semicircle {
int a, b;
} b[L];
int a[L], n, flag;
void init(void) {
cin >> n;
int i;
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
for (i = 1; i < n; i++)
b[i].a = min(a[i], a[i + 1]), b[i].b = max(a[i], a[i + 1]);
}
int pd(int a, int... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int a[n];
int i;
for (i = 0; i < n; i++) scanf("%d", &a[i]);
int f1 = 0, j, f2;
for (i = 0; i < (n - 1); i++) {
f1 = 0;
f2 = 0;
for (j = i + 2; j < n; j++) {
if ((a[j] > a[i] && a[j] > a[i + 1]) || (a[j] < a[i] && a[j] < a[i +... | ### Prompt
Generate a cpp solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct poin... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
int a[1000];
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < n - 1; i++) {
int x, y, f1 = 0, f2 = 0;
x = min(a[i], a[i + 1]);
y = max(a[i], a[i + 1]);
for (j = i + 2; j < n; j++) {
if (a[... | ### Prompt
Develop a solution in CPP to the problem described below:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
i += 1 - 2 * ((0) > (n)))
cin >> a[i];
if (n <= 3) ... | ### Prompt
Please formulate a cpp solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
int arr[1001];
int n;
bool isi(int x1, int x2, int y1, int y2) {
if (x2 <= y1) return 0;
if (y2 <= x2) return 0;
if (x2 <= y2 && x1 == y1) return 0;
return 1;
}
void get(int x1, int y1, int x2, int y2, int &x, int &y) {
x = -1;
y = -1;
if (x1 >= x2 && y1 <= y2... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
using namespace std;
int min(int a, int b) {
if (a < b)
return (a);
else
return (b);
}
int main() {
int n, arr[1005], flag = 0, a, b, i, j, c, d;
cin >> n;
for (i = 1; i <= n; i++) cin >> arr[i];
if (n == 1 || n == 2 || n == 3)
flag = 1;
else {
for (i = 3; i <= n -... | ### Prompt
Please create a solution in CPP to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int len;
cin >> len;
vector<pair<int, int>> join;
int arr[len];
for (int i = 0; i < len; i++) cin >> arr[i];
for (int i = 1; i < len; i++) {
int mi = min(arr[i - 1], arr[i]);... | ### Prompt
Please create a solution in CPP to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string ans = "no";
cin >> n;
vector<int> lineas(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
lineas[i] = a;
}
int minimo;
int maximo;
for (int i = 0; i < n - 1; i++) {
minimo = min(lineas[i], lineas[i + 1]);
ma... | ### Prompt
Please provide a cpp coded solution to the problem described below:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long x, y, num[2009];
bool flag = true;
scanf("%d%ld", &n, &num[1]);
for (int i = 2; i <= n; i++) {
scanf("%ld", &num[i]);
}
num[0] = num[1];
num[n + 1] = num[n];
for (int i = 1; i <= n; i++) {
x = min(num[i - 1], num[i]);
y... | ### Prompt
Develop a solution in Cpp to the problem described below:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
int SetBit(int n, int x) { return n | (1 << x); }
int ClearBit(int n, int x) { return n & ~(1 << x); }
int ToggleBit(int n, int x) { return n ^ (1 << x); }
bool CheckBit(int n, int x) { return (bool)(n & (1 << x)); }
int dx8[] = {1, 1, 0, -1, -1, -1,... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
using namespace std;
int n, a[1111], x, y, x2, y2;
bool inter(int a, int b, int x, int y) {
if (a > b) swap(a, b);
if (x > y) swap(x, y);
if (a < x && b > x && b < y) return 1;
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i+... | ### Prompt
Generate a CPP solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct poin... |
#include <bits/stdc++.h>
using namespace std;
int n, x[1000];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x[i];
for (int j = 1; j < i - 1; ++j) {
bool l = (x[i] > min(x[j], x[j - 1]) && x[i] < max(x[j - 1], x[j]));
bool r =
(x[i - 1] > min(x[j], x[j - 1]) && x[i - 1] < ... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates ... |
#include <bits/stdc++.h>
using namespace std;
int a[10000];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
if (n <= 3) {
cout << "no" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
bool flag1 = false, flag2 = false;
for (int j = i + 2; j < ... | ### Prompt
Your task is to create a CPP solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n... |
#include <bits/stdc++.h>
using namespace std;
int n, m, a, b, s1, s2, s;
void faster() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
faster();
int n, a = 0, b = 0, y = 0, x = 0;
cin >> n;
int arr[n];
for (int i = 0; i < n; ++i) cin >> arr[i];
for (int i = 0; i < n -... | ### Prompt
In CPP, your task is to solve the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n distinct p... |
#include <bits/stdc++.h>
using namespace std;
struct pr {
int a;
int b;
};
int main() {
int n, i, j, cnt = 0, flag = 0, a, b;
vector<pr> vec;
vector<int> point;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
point.push_back(j);
}
for (i = 0; i < n - 1; i++) {
if (point[i] > point[i + 1]) {
... | ### Prompt
Your task is to create a Cpp solution to the following problem:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n... |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
int n, input;
bool intersect;
std::vector<int> arr;
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> input;
arr.push_back(input);
}
intersect = false;
for (int i = 0; i < n - 2; ++i) {
f... | ### Prompt
Develop a solution in CPP to the problem described below:
Dima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.
The teacher gave Seryozha the coordinates of n disti... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.