output stringlengths 52 181k | instruction stringlengths 296 182k |
|---|---|
#include <bits/stdc++.h>
int main() {
int a, b, c, t, i, n;
scanf("%d %d %d", &a, &b, &c);
if ((a + b) > c && (a + c) > b && (b + c) > a)
t = 0;
else if ((a + b) <= c)
t = c - (a + b) + 1;
else if ((a + c) <= b)
t = b - (a + c) + 1;
else
t = a - (b + c) + 1;
printf("%d\n", t);
return 0;
... | ### Prompt
Generate a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int arr[3];
for (int i = 0; i < 3; i++) {
cin >> arr[i];
}
int len = sizeof(arr) / sizeof(arr[0]);
sort(arr, arr + len);
if ((arr[len - 3] + arr[len - 2]) > arr[len - 1])
cout << "0" << endl;
else
cout << (arr[len - 1] -... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
int t[3];
int main() {
cin >> t[0] >> t[1] >> t[2];
sort(t, t + 3);
if (t[0] + t[1] >= t[2] + 1)
cout << 0;
else
cout << t[2] - t[1] - t[0] + 1;
return 0;
}
| ### Prompt
Generate a cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend i... |
#include <bits/stdc++.h>
using namespace std;
int a[3], sol;
int main() {
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
int x = a[0] + a[1];
while (x <= a[2]) {
x++;
sol++;
}
cout << sol;
return 0;
}
| ### Prompt
In CPP, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
bool Trangle(double a, double b, double c) {
return a + b > c && a + c > b && b + c > a && a - b < c && a - c < b &&
b - c < a;
}
int main() {
int num[3];
int ans(0);
cin >> num[0] >> num[1] >> num[2];
{
ans = 0;
sort(num, num + 3);
while (!Tr... | ### Prompt
Please create a solution in cpp to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
int n, i;
for (i = 0; i < 3; i++) cin >> a[i];
sort(a, a + 3);
if (a[0] + a[1] > a[2])
cout << "0"
<< "\n";
else
cout << (a[2] - a[1] - a[0]) + 1 << "\n";
return 0;
}
| ### Prompt
Develop a solution in cpp to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
int main() {
int a, b, c, d, e, f, g, h = 0, i = 0;
scanf("%d%d%d", &a, &b, &c);
if (a >= b) {
if (a + b <= c) {
h = h + c - a - b + 1;
b = b + h;
}
} else if (a < b) {
if (a + b <= c) {
h = h + c - a - b + 1;
a = a + h;
}
}
if (b >= c) {
... | ### Prompt
Develop a solution in cpp to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int sides[3];
int main() {
for (int i = 0; i < 3; ++i) scanf("%d", &sides[i]);
sort(sides, sides + 3);
if (sides[0] + sides[1] > sides[2])
printf("0");
else
printf("%d", sides[2] + 1 - (sides[0] + sides[1]));
return 0;
}
| ### Prompt
Develop a solution in CPP to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2005;
const long long INF = 0x3f3f3f3f;
const long long LINF = 0x1f3f3f3f3f3f3f3f;
const long long MOD = (long long)1e9 + 7;
const long long OVER_FLOW = 0xffffffff;
long long s, T, n, m, M, k, A, B, p;
long long buf[MAXN];
int main() {
ios::sync_wit... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
map<char, int> m;
map<char, int> m1;
int main() {
long long int n = 0, d, i = 0, j = 0, l = 0, r = 0, a = 0, b = 0, c1, c2, p,
b2, s1 = 0, t = 0, t1 = 0, y = 0, x = 0, s2 = 0, c = 0;
char ch;
cin >> a >> b >> c;
vector<int> adj[100001];
int s[3];
... | ### Prompt
In Cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
int a[4];
int main() {
scanf("%d%d%d", &a[1], &a[2], &a[3]);
std::sort(a + 1, a + 3 + 1);
if (a[1] + a[2] > a[3]) {
printf("%d\n", 0);
} else {
printf("%d\n", a[3] - a[1] - a[2] + 1);
}
return 0;
}
| ### Prompt
Your task is to create a cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if (a[0] + a[1] > a[2])
cout << 0;
else
cout << a[2] - a[0] - a[1] + 1;
}
| ### Prompt
Create a solution in cpp for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
int a[10];
int main() {
cin >> a[1] >> a[2] >> a[3];
sort(a + 1, a + 1 + 3);
cout << max(a[3] - a[1] - a[2] + 1, 0) << endl;
return 0;
}
| ### Prompt
Create a solution in Cpp for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[4];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3, greater<int>());
if (a[0] < a[1] + a[2])
cout << "0" << endl;
else
cout << a[0] - a[1] - a[2] + 1 << endl;
return 0;
}
| ### Prompt
Create a solution in cpp for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char* argv[]) {
int leg[3];
int m, n;
int x;
for (int i = 0; i < 3; i++) {
cin >> leg[i];
}
m = 0;
n = 0;
for (int i = 0; i < 3; i++) {
if (leg[i] >= m) {
n = i;
m = leg[i];
}
}
m = 0;
for (int i = 0; i ... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
const long long int inf = 1e13 + 7;
void solve();
void sieve();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed;
cout << setprecision(10);
long long int t = 1;
while (t--) solve();
return 0;
}
struct point {
long long int x, y;
... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
int main() {
int a, b, c, d, t = 0;
scanf("%d %d %d", &a, &b, &c);
if (a > b) {
if (a > c) {
d = b + c;
if (d > a)
t = 0;
else {
while (1) {
t++;
d++;
if (d > a) break;
}
}
}
}
if (b > c) {
if (b... | ### Prompt
Develop a solution in cpp to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
signed main() {
vector<unsigned> a(3);
for (unsigned& x : a) cin >> x;
sort(a.begin(), a.end());
if (a[2] < a[0] + a[1]) {
cout << 0;
exit(0);
}
cout << min(a[2] - (a[1] + a[0]),
min(a[1] - (a[2] - a[0]), a[0] - (a[2] - a[0]))) +
... | ### Prompt
Please formulate a cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3, 0);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
int cnt = 0;
while (a[0] + a[1] <= a[2]) {
a[0]++;
cnt++;
if (a[0] > a[1]) {
swap(a[0], a[1]);
}
}
cout << cnt << endl;
return 0;
}
| ### Prompt
Generate a cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[3];
for (int i = 0; i < 3; i++) cin >> arr[i];
sort(arr, arr + 3);
int ans = arr[2] - arr[1] - arr[0];
cout << (ans < 0 ? 0 : ans + 1) << endl;
}
| ### Prompt
Generate a cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int jum = a + b + c;
int maks = max(max(a, b), c);
int ans = maks - (jum - maks) + 1;
if (ans < 1)
cout << 0 << endl;
else
cout << ans << endl;
}
| ### Prompt
In Cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
int in() {
int x = 0;
char c = getchar();
bool neg = false;
while (c != '-' && ('0' > c || c > '9')) c = getchar();
if (c == '-') neg = true, c = getchar();
while ('0' <= c && c <= '9') x = 10 * x + c - '0', c = getchar();
if (neg) x = -x;
return x;
}
void out(int x) {
if (x >... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if (a[0] + a[1] > a[2]) {
cout << 0 << endl;
} else {
int cnt = 0;
while (a[0] + a[1] <= a[2]) {
a[1]++;
cnt++;
}
cout << cnt << endl;
}
return 0;
}
| ### Prompt
Develop a solution in CPP to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a >= b && a >= c) {
if (b + c > a)
cout << "0";
else
cout << a - (b + c) + 1;
} else if (b >= a && b >= c) {
if (a + c > b)
cout << "0";
else
cout << b - (a + c) + 1;
} else ... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
int arr[4], x;
int main() {
for (int i = 0; i < 3; i++) {
cin >> x;
arr[i] = x;
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3 - i - 1; j++)
if (arr[j] > arr[j + 1]) swap(arr[j], arr[j + 1]);
}
int s = (arr[2] + 1) - (arr[0] + arr[1]);
i... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
long long INF = 9223372036854775807;
int md = 100000000;
const int WHITE = 0;
const int BLACK = 1;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
vector<int> m;
int a;
cin >> a;
m.push_back(a);
cin >> a;
m.push_back(a);
cin >> a;
m... | ### Prompt
In cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, m, k;
cin >> a >> b >> c;
m = max(max(a, b), c);
k = min(min(a, b), c);
b = a + b + c - m - k;
a = m;
c = k;
m = 0;
cout << max(m, a - b - c + 1);
}
| ### Prompt
Create a solution in Cpp for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << max(0, a[2] - (a[1] + a[0]) + 1) << "\n";
}
| ### Prompt
Your task is to create a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ar[3], sm = 0, i, d;
for (i = 0; i < 3; i++) scanf("%d", &ar[i]);
d = 0;
sort(ar, ar + 3);
sm = ar[0] + ar[1];
if (ar[2] >= sm) {
d = ar[2] - sm;
d++;
}
printf("%d\n", d);
return 0;
}
| ### Prompt
Please formulate a cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
int main() {
long long int a, b, c, count, A, B, C;
scanf("%lld %lld %lld", &a, &b, &c);
count = 0;
while ((a + b) <= c || (b + c) <= a || (a + c) <= b) {
A = a;
B = b;
C = c;
if (A <= B && A <= C) {
a++;
count++;
}
if ((a + b) <= c || (b + c) <= a ||... | ### Prompt
In CPP, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
const long long MaxN = 5;
long long n, a[MaxN], f[MaxN][13], cs;
bool kt;
void work() {
sort(a + 1, a + 4);
if (a[1] + a[2] > a[3])
cout << 0;
else
cout << a[3] - a[2] - a[1] + 1;
}
void nhap() { cin >> a[1] >> a[2] >> a[3]; }
int main() {
nhap();
work();
... | ### Prompt
Please provide a cpp coded solution to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
template <class T1>
void deb(T1 e1) {
cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
cout << e1 << " " << e2 << " " << e3 << endl;
... | ### Prompt
Develop a solution in CPP to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
long long int MOD = 1e9 + 7;
long long int ji[300005], ou[300005];
long long int brut = 1e18;
int Search_Binary(int arr[], int left, int right, i... | ### Prompt
In cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long a, b, c;
cin >> a >> b >> c;
long long ans = 0;
while (a >= b + c) {
b++;
ans++;
}
while (a <= abs(b - c)) {
a++;
ans++;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(0);
... | ### Prompt
In cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, ans, n;
n = 3;
int ar[n];
for (i = 0; i < n; i++) {
cin >> ar[i];
}
sort(ar, ar + n);
if (ar[0] + ar[1] > ar[2]) {
cout << 0 << "\n";
} else {
ans = ar[2] - (ar[0] + ar[1]);
cout << ans + 1 << "\n";
}
return 0;
}
| ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long a[3], b, c;
cin >> a[0] >> a[1] >> a[2];
b = a[1];
c = a[2];
if (a[0] + b > c && a[0] + c > b && c + b > a[0]) return cout << 0, 0;
sort(a, a + 3);
long long ans = 0;
... | ### Prompt
Your task is to create a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
int main() {
int a, b, c, x, y, z, dif;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
if (a >= b && a >= c) {
x = a;
y = b;
z = c;
} else if (b >= c && b >= a) {
x = b;
y = a;
z = c;
} else if (c >= b && c >= a) {
x = c;
y = b;
z = a;
}
... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int arr[MAXN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> arr[0] >> arr[1] >> arr[2];
sort(arr, arr + 3);
cout << max(0, arr[2] + 1 - (arr[0] + arr[1])) << "\n";
return 0;
}
| ### Prompt
Your task is to create a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int sides[3], addTime;
for (int i = 0; i < 3; i++) {
cin >> sides[i];
}
sort(sides, sides + 3);
if (sides[0] + sides[1] > sides[2]) {
cout << "0" << endl;
} else {
addTime = (sides[2] + 1) - (sides[0] + sides[1]);
cout << addTime << ... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b) swap(a, b);
if (b < c) swap(b, c);
cout << max(a + 1 - b - c, max(b + 1 - a - c, max(c + 1 - b - a, 0))) << endl;
return 0;
}
| ### Prompt
Your task is to create a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
while (~scanf("%d%d%d", &a, &b, &c)) {
int a1 = b + c, b1 = a + c, c1 = a + b;
if (a1 > a && b1 > b && c1 > c)
printf("0\n");
else {
int minn = 9999999;
minn = minn > (a1 - a) ? (a1 - a) : minn;
minn = minn >... | ### Prompt
Create a solution in cpp for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
const int MX = 100005, infi = 1000000000, mod = 1000000007;
int n, v[3];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> v[0] >> v[1] >> v[2];
sort(v, v + 3);
cout << max(0, v[2] - (v[0] + v[1]) + 1);
return 0;
}
| ### Prompt
Create a solution in Cpp for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long i, arr[3];
for (i = 0; i < 3; i++) {
cin >> arr[i];
}
sort(arr, arr + 3);
if ((arr[0] + arr[1]) > arr[2])
cout << "0";
else
cout << (arr[2] - (arr[0] + arr[... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
void io() {}
long long fast_exp(long long base, int exp, int m) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1) {
res = (res * base) % m;
}
base = (base * base) % m;
exp /= 2;
}
return res % m;
}
long long ar... | ### Prompt
Generate a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend i... |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int a[5];
cin >> a[1] >> a[2] >> a[3];
sort(a + 1, a + 3 + 1);
if (a[1] + a[2] > a[3])
cout << 0 << endl;
else
cout << a[3] + 1 - a[1] - a[2] << endl;
}
int main() {
solve();
return 0;
}
| ### Prompt
Generate a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if (a[0] + a[1] > a[2])
cout << 0;
else if (a[0] + a[1] == a[2])
cout << 1;
else
cout << (a[2] - (a[0] + a[1])) + 1;
return 0;
}
| ### Prompt
Your task is to create a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
int n = sizeof(a) / sizeof(a[0]);
sort(a, a + n);
if (a[0] + a[1] > a[2]) {
cout << "0";
} else if (a[0] + a[1] <= a[2]) {
cout << a[2] - (a[0] + a[1]) + 1;
}
}
| ### Prompt
Please formulate a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[3];
for (int i = 0; i < 3; i++) {
cin >> arr[i];
}
sort(arr, arr + 3);
int val = arr[0] + arr[1];
if (val <= arr[2]) {
int res = arr[2] - val + 1;
cout << res << endl;
} else
cout << "0" << endl;
}
| ### Prompt
Develop a solution in Cpp to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (int i = 0; i < 3; i++) cin >> a[i];
sort(a, a + 3);
int y = a[2] + 1 - a[0] - a[1];
cout << max(0, y);
return 0;
}
| ### Prompt
In Cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b) swap(a, b);
if (a < c) swap(a, c);
if (b < c) swap(b, c);
if (b + c <= a)
cout << a - c - b + 1;
else
cout << 0;
}
| ### Prompt
Construct a CPP code solution to the problem outlined:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to sp... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a < b) swap(a, b);
if (a < c) swap(a, c);
int ans;
if (b + c > a)
ans = 0;
else
ans = a - b - c + 1;
printf("%d\n", ans);
return 0;
}
| ### Prompt
Construct a CPP code solution to the problem outlined:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to sp... |
#include <bits/stdc++.h>
using namespace std;
inline int mul(int a, int b) { return int(a * 1ll * b % 998244353); }
inline int norm(int a) {
if (a >= 998244353) a -= 998244353;
if (a < 0) a += 998244353;
return a;
}
inline int binPow(int a, int k) {
int ans = 1;
while (k > 0) {
if (k & 1) ans = mul(ans, a... | ### Prompt
Generate a cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[3], r = 0;
cin >> arr[0] >> arr[1] >> arr[2];
sort(arr, arr + 3);
if (arr[0] + arr[1] > arr[2]) {
cout << "0";
} else {
cout << arr[2] - (arr[0] + arr[1]) + 1;
}
}
| ### Prompt
Your task is to create a cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, ctr = 0;
cin >> a >> b >> c;
while (a + b <= c) {
ctr++;
a > b ? a++ : b++;
}
while (b + c <= a) {
ctr++;
b > c ? b++ : c++;
}
while (a + c <= b) {
ctr++;
a > c ? a++ : c++;
}
cout << ctr << "\n";
}
| ### Prompt
Please provide a CPP coded solution to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a[3];
for (int i = 0; i < 3; i++) cin >> a[i];
sort(a, a + 3);
int sum = 0;
for (int i = 0;; i++) {
if (a[1] + a[0] > a[2])
break;
else {
sum++;
a[1] += 1;
}
}
cout << sum;
return 0;
}
| ### Prompt
Your task is to create a cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[3];
cin >> arr[0] >> arr[1] >> arr[2];
sort(arr, arr + 3);
if (arr[0] + arr[1] > arr[2]) {
cout << 0;
} else {
cout << arr[2] - arr[1] - arr[0] + 1;
}
}
| ### Prompt
Construct a cpp code solution to the problem outlined:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to sp... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[] = {0, 0, 0};
for (int i = 0; i < 3; i++) cin >> arr[i];
sort(arr, arr + 3);
if (arr[2] < (arr[0] + arr[1]))
cout << "0";
else
cout << (1 + (arr[2] - (arr[0] + arr[1])));
return 0;
}
| ### Prompt
In CPP, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
int main() {
int a[10], b, c, i, j;
for (i = 0; i < 3; i++) scanf("%d", &a[i]);
for (i = 0; i < 3; i++) {
for (j = i + 1; j < 3; j++) {
if (a[i] > a[j]) {
b = a[i];
a[i] = a[j];
a[j] = b;
}
}
}
int p = a[0], q = a[1], r = a[2], z;
if ((p +... | ### Prompt
Develop a solution in Cpp to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, A, B, C;
string s;
int main() {
cin >> a >> b >> c;
A = max(a, b);
B = max(b, c);
C = max(A, B);
if (C == a) {
if (a < b + c) {
cout << 0;
return 0;
} else {
cout << a - b - c + 1;
return 0;
}
}
if (C == b) {
... | ### Prompt
Please formulate a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 3;
const long long Linf = 1e18;
int main() {
ios_base::sync_with_stdio(false);
int x[3];
cin >> x[0] >> x[1] >> x[2];
sort(x, x + 3);
int ans = (x[2] >= x[0] + x[1] ? x[2] - x[1] - x[0] + 1 : 0);
cout << ans << '\n';
return 0;
}
| ### Prompt
Construct a cpp code solution to the problem outlined:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to sp... |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, Count = 1;
int main() {
cin >> a >> b >> c;
if ((a + b > c) && (a + c > b) && (b + c > a)) {
cout << 0 << endl;
return 0;
}
while ((a + b < c) || (a + c < b) || (b + c < a)) {
++Count;
if (a + b < c) {
if (a < b)
a++;
... | ### Prompt
Your task is to create a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int n[3], cnt;
int main() {
for (int i = 0; i < 3; i++) {
cin >> n[i];
}
sort(n, n + 3);
if (n[0] + n[1] > n[2]) {
cout << 0;
return 0;
} else {
while (n[0] + n[1] <= n[2]) {
n[1]++;
cnt++;
}
}
cout << cnt;
}
| ### Prompt
In CPP, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
int cnt = 0;
while (a[0] + a[1] <= a[2]) {
cnt++, a[0]++;
}
cout << cnt << endl;
return 0;
}
| ### Prompt
Construct a cpp code solution to the problem outlined:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to sp... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f, i;
cin >> a >> b >> c;
d = a + b;
e = b + c;
f = a + c;
int sum1 = 0, sum2 = 0, sum3 = 0;
for (i = 0; i < 100; i++) {
if (d > c)
break;
else {
sum1++;
d++;
}
}
for (i = 0; i < 100; i++) {
... | ### Prompt
Your task is to create a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int ans = 0;
cin >> a >> b >> c;
while (a + b <= c || b + c <= a || a + c <= b) {
if (a + b <= c) {
if (a < b) {
a++;
} else {
b++;
}
ans++;
}
if (b + c <= a) {
if (b < c) {
... | ### Prompt
Create a solution in cpp for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a + b > c) && (b + c > a) && (c + a > b))
cout << "0\n";
else {
v.push_back(a);
v.push_back(b);
v.push_back(c);
sort(v.begin(), v.end());
a = v[0];
b = v[1];
c = v[2];
... | ### Prompt
In CPP, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1},
{-1, 1}, {-1, -1}, {1, 1}, {1, -1}};
using namespace std;
int a[3];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cerr.tie(0);
cout.tie(0);
cin >> a[... | ### Prompt
Generate a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if (a[0] + a[1] > a[2])
cout << 0;
else
cout << a[2] - a[0] - a[1] + 1;
return 0;
}
| ### Prompt
Construct a cpp code solution to the problem outlined:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to sp... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a, a + 3);
if (a[2] < a[0] + a[1]) {
cout << 0 << endl;
} else {
cout << a[2] - a[1] - a[0] + 1 << endl;
}
return 0;
}
| ### Prompt
Generate a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend i... |
#include <bits/stdc++.h>
using namespace std;
long long a[3];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if (a[0] + a[1] > a[2]) {
cout << 0;
return 0;
}
cout << a[2] - (a[1] + a[0]) + 1;
return 0;
}
| ### Prompt
Please create a solution in Cpp to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T = 1;
while (T--) {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << max(0, a[2] - a[1] - a[0] + 1);
}
return 0;
}
| ### Prompt
In cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
long long ans;
int main() {
vector<int> a(3);
for (size_t i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
cout << ((a[1] + a[0] > a[2]) ? 0 : (-a[1] - a[0] + a[2] + 1));
}
| ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
bool checkValidity(int a, int b, int c) {
if (a + b <= c || a + c <= b || b + c <= a)
return false;
else
return true;
}
int maximum(int a, int b, int c) {
int max = (a < b) ? b : a;
return ((max < c) ? c : max);
}
int main() {
long long a, b, c, d;
cin >... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, ans;
cin >> a >> b >> c;
int a1[3];
a1[0] = a;
a1[1] = b;
a1[2] = c;
sort(a1, a1 + 3);
if (a1[0] + a1[1] > a1[2])
ans = 0;
else
ans = a1[2] - a1[0] - a1[1] + 1;
cout << ans;
return 0;
}
| ### Prompt
Please formulate a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int code() {
long long int a, b, c;
cin >> a >> b >> c;
long long int aa = max(a, b);
aa = max(aa, c);
long long int sum = a + b + c - aa;
long long int ans = ((sum - aa <= 0) ? aa - sum + 1 : 0);
cout << ans << endl;
return 0;
}
signed main() {
ios_base::... | ### Prompt
Create a solution in cpp for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, x, y, z;
cin >> a >> b >> c;
int q[3] = {a, b, c};
sort(q, q + 3, greater<int>());
x = q[0];
y = q[1];
z = q[2];
int t = z + y;
if (t > x)
cout << 0;
else {
cout << (x - t) + 1;
}
}
| ### Prompt
Your task is to create a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(), v.end());
int ans = max(0, v[2] - v[1] - v[0] + 1);
cout << ans << endl;
return 0;
}
| ### Prompt
Develop a solution in Cpp to the problem described below:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
int main() {
unsigned int x[3], i, t, n = 0;
for (i = 0; i < 3; i++) scanf("%u", &x[i]);
if (x[2] < x[1]) {
t = x[1];
x[1] = x[2];
x[2] = t;
}
if (x[2] < x[0]) {
t = x[0];
x[0] = x[2];
x[2] = t;
}
while (!(x[0] + x[1] > x[2])) {
x[2]--;
n++;
}
p... | ### Prompt
Your task is to create a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
vector<int> Length(3);
for (int i = 0; i < 3; ++i) {
scanf("%d", &Length[i]);
}
sort(Length.begin(), Length.end());
printf("%d\n", max(0, Length[2] - (Length[0] + Length[1]) + 1));
return 0;
}
| ### Prompt
Create a solution in Cpp for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y / 2;
x = (x * x) % p;
}
return res;
}
void solve() {
long long int a[3];
cin >> a[0] >>... | ### Prompt
Construct a Cpp code solution to the problem outlined:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to sp... |
#include <bits/stdc++.h>
int main() {
int a, b, c, x = 0;
scanf("%d%d%d", &a, &b, &c);
if ((a + b) <= c) {
x = x + (c - (a + b)) + 1;
}
if ((b + c) <= a) {
x = x + (a - (b + c)) + 1;
}
if ((a + c) <= b) {
x = x + (b - (a + c)) + 1;
}
printf("%d", x);
return 0;
}
| ### Prompt
Create a solution in CPP for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long a, b, c;
cin >> a >> b >> c;
long long fans = 0;
if (c >= a && c >= b) {
long long ans = c - a - b;
if (ans < 0) {
fans = 0;
} else {
fans = ans + 1;
... | ### Prompt
Construct a cpp code solution to the problem outlined:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to sp... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
int inf = 0x3f3f3f3f;
int ans = inf;
for (int i = a; i <= 100; i++) {
for (int j = b; j <= 100; j++) {
for (int k = c; k <= 100; k++) {
if (i + j > k && i ... | ### Prompt
In cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int a[3], i;
for (i = 0; i < 3; i++) cin >> a[i];
sort(a, a + 3);
long long int k = a[2] - (a[1] + a[0]);
if (k < 0)
cout << 0 << endl;
else
cout << k + 1 << endl;
}
| ### Prompt
Please formulate a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d = 0;
cin >> a >> b >> c;
if (a >= b + c) {
d = a - (b + c);
d++;
} else if (b >= a + c) {
d = b - (a + c);
d++;
} else if (c >= a + b) {
d = c - (a + b);
d++;
}
cout << d;
return 0;
}
| ### Prompt
Your challenge is to write a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c, ans = 0;
cin >> a >> b >> c;
if (c >= a && c >= b)
ans = max(0, c + 1 - (a + b));
else if (b >= a && b >= c)
ans = max(0, b + 1 - (a + c));
else if (a >= b && a >= c)
ans = ... | ### Prompt
In CPP, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c;
d = max(c, max(a, b));
if (d == a) {
if (b + c >= d + 1) {
cout << "0" << endl;
} else {
e = (d + 1) - (b + c);
cout << e << endl;
}
} else if (d == b) {
if (a + c >= d + 1) {
... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes sh... |
#include <bits/stdc++.h>
using namespace std;
void rewenie(int b) {
int c = b / 7;
if (b % 7 != 0) c++;
cout << c;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
int sum = 0;
if (a >= b && a >= c) {
if (a >= b + c)
cout << (a - b - c) + 1;
else
goto A;
} else if (a <= b && b >= c) {... | ### Prompt
Construct a Cpp code solution to the problem outlined:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to sp... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, maxi = 0, x;
for (int i = 0; i < 3; i++) {
cin >> x;
if (x > maxi) {
maxi = x;
}
sum += x;
}
if (sum - maxi <= maxi) {
cout << maxi - (sum - maxi) + 1;
} else {
cout << 0;
}
}
| ### Prompt
Your task is to create a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
using namespace std;
int a[10];
int main() {
ios::sync_with_stdio(false);
while (cin >> a[0] >> a[1] >> a[2]) {
sort(a, a + 3);
int ans = max(0, a[2] - a[0] - a[1] + 1);
cout << ans << endl;
}
return 0;
}
| ### Prompt
In Cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
bool can(int a, int b, int c) {
if (a + b > c && b + c > a && c + a > b) return true;
return false;
}
int s(int a, int b, int n) { return n - a - b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
if (can(a, b, c)) {
cout << 0 << endl;
return 0;
} else {... | ### Prompt
Please create a solution in Cpp to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
int x = a[0] + a[1];
int y = x - a[2];
if (y > 0) {
cout << 0;
} else {
cout << abs(y) + 1;
}
return 0;
}
| ### Prompt
Please create a solution in CPP to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (int i = 0; i < 3; i++) cin >> a[i];
sort(a, a + 3);
int n = a[2] - a[1] - a[0] + 1;
cout << (n > 0 ? n : 0);
}
| ### Prompt
Your task is to create a CPP solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she ne... |
#include <bits/stdc++.h>
int main() {
int a, b, c, greatest, x;
scanf("%d %d %d", &a, &b, &c);
if (a > b && a > c) {
greatest = a;
if (b + c > a)
printf("0");
else {
x = ((a - (b + c)) + 1);
printf("%d", x);
}
} else if (b > a && b > c) {
greatest = b;
if (a + c > b)
... | ### Prompt
Create a solution in CPP for the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spend... |
#include <bits/stdc++.h>
using namespace std;
int a[3];
int main() {
cin >> a[0] >> a[1] >> a[2];
sort(a + 0, a + 3);
int res = 0;
while ((a[0] + a[1]) <= a[2]) {
a[0]++;
res++;
}
cout << res;
}
| ### Prompt
In Cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f, g, h;
cin >> a >> b >> c;
d = max(a, b);
e = min(a, b);
f = max(d, c);
g = min(d, c);
h = e + g;
if (h > f)
cout << 0 << endl;
else
cout << f - h + 1 << endl;
return 0;
}
| ### Prompt
Please formulate a cpp solution to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, a1, b1, c1;
cin >> a >> b >> c;
a1 = (a + c - b);
b1 = (a + b - c);
c1 = (b + c - a);
if (a1 > 0 && b1 > 0 && c1 > 0) {
cout << 0;
return 0;
} else if (a1 < b1 && a1 < c1) {
cout << abs(a1) + 1;
return 0;
}
if (c1 ... | ### Prompt
In cpp, your task is to solve the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to spen... |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &x) {
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - 48;
ch = getchar();
}
x *= f;
}
int a, b, c, d;
int mai... | ### Prompt
Please create a solution in cpp to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a > b) swap(a, b);
if (b > c) swap(b, c);
int ans = c - (a + b);
printf("%d", ans >= 0 ? ans + 1 : 0);
}
| ### Prompt
Construct a Cpp code solution to the problem outlined:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to sp... |
#include <bits/stdc++.h>
using namespace std;
int func(int a, int b, int c) {
if (a > b + c && b > a + c && c > a + b) {
return (1);
}
return (0);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
int x = min(a, min(b, c));
int z = m... | ### Prompt
Please create a solution in CPP to the following problem:
Masha has three sticks of length a, b and c centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.
What is the minimum number of minutes she needs to... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.