| Task: | Pizzat | 
| Sender: | TNT | 
| Submission time: | 2024-10-30 19:57:20 +0200 | 
| Language: | C++ (C++17) | 
| Status: | READY | 
| Result: | 0 | 
| group | verdict | score | 
|---|---|---|
| #1 | WRONG ANSWER | 0 | 
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.00 s | details | 
| #2 | WRONG ANSWER | 0.00 s | details | 
| #3 | WRONG ANSWER | 0.00 s | details | 
| #4 | WRONG ANSWER | 0.00 s | details | 
| #5 | WRONG ANSWER | 0.00 s | details | 
| #6 | WRONG ANSWER | 0.12 s | details | 
| #7 | WRONG ANSWER | 0.00 s | details | 
| #8 | WRONG ANSWER | 0.00 s | details | 
| #9 | WRONG ANSWER | 0.00 s | details | 
| #10 | WRONG ANSWER | 0.00 s | details | 
| #11 | WRONG ANSWER | 0.00 s | details | 
| #12 | WRONG ANSWER | 0.00 s | details | 
| #13 | WRONG ANSWER | 0.00 s | details | 
Code
#include <iostream>
int main () {
	// Input:
	// n = people
	// m = pizza of k slices
	int n, m, k;
	std::cin >> n >> m >> k;
	int TotalSlices = m * k;
	// GOAL:Find the smallest & largest per person slice count possible
	int smallest, largest;
	int sliceCount = 0;
	while (true) {
		TotalSlices=TotalSlices-n;
		std::cout << TotalSlices << "\n";
		if (TotalSlices>0) {
			sliceCount++;
		} else {
			smallest = sliceCount;
			largest = sliceCount+1;
			break;
		}
	}
	std::cout << smallest << " " << largest << "\n";
	return 0;
}
Test details
Test 1
Verdict: WRONG ANSWER
| input | 
|---|
| 3 2 4 | 
| correct output | 
|---|
| 2 3 | 
| user output | 
|---|
| 5 2 -1 2 3  | 
Test 2
Verdict: WRONG ANSWER
| input | 
|---|
| 1 1 1 | 
| correct output | 
|---|
| 1 1 | 
| user output | 
|---|
| 0 0 1  | 
Test 3
Verdict: WRONG ANSWER
| input | 
|---|
| 1 1 2 | 
| correct output | 
|---|
| 2 2 | 
| user output | 
|---|
| 1 0 1 2  | 
Test 4
Verdict: WRONG ANSWER
| input | 
|---|
| 2 1 1 | 
| correct output | 
|---|
| 0 1 | 
| user output | 
|---|
| -1 0 1  | 
Test 5
Verdict: WRONG ANSWER
| input | 
|---|
| 2 5 7 | 
| correct output | 
|---|
| 17 18 | 
| user output | 
|---|
| 33 31 29 27 25 ...  | 
Test 6
Verdict: WRONG ANSWER
| input | 
|---|
| 1 1000 1000 | 
| correct output | 
|---|
| 1000000 1000000 | 
| user output | 
|---|
| 999999 999998 999997 999996 999995 ...  | 
Test 7
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 1000 1000 | 
| correct output | 
|---|
| 1000 1000 | 
| user output | 
|---|
| 999000 998000 997000 996000 995000 ...  | 
Test 8
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 1 1 | 
| correct output | 
|---|
| 0 1 | 
| user output | 
|---|
| -999 0 1  | 
Test 9
Verdict: WRONG ANSWER
| input | 
|---|
| 997 995 997 | 
| correct output | 
|---|
| 995 995 | 
| user output | 
|---|
| 991018 990021 989024 988027 987030 ...  | 
Test 10
Verdict: WRONG ANSWER
| input | 
|---|
| 997 994 997 | 
| correct output | 
|---|
| 994 994 | 
| user output | 
|---|
| 990021 989024 988027 987030 986033 ...  | 
Test 11
Verdict: WRONG ANSWER
| input | 
|---|
| 997 996 995 | 
| correct output | 
|---|
| 994 995 | 
| user output | 
|---|
| 990023 989026 988029 987032 986035 ...  | 
Test 12
Verdict: WRONG ANSWER
| input | 
|---|
| 997 996 996 | 
| correct output | 
|---|
| 995 996 | 
| user output | 
|---|
| 991019 990022 989025 988028 987031 ...  | 
Test 13
Verdict: WRONG ANSWER
| input | 
|---|
| 997 995 499 | 
| correct output | 
|---|
| 497 498 | 
| user output | 
|---|
| 495508 494511 493514 492517 491520 ...  | 
