| Task: | Pizzat |
| Sender: | Elmortti |
| Submission time: | 2024-10-28 23:05:44 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 100 |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
| #7 | ACCEPTED | 0.00 s | details |
| #8 | ACCEPTED | 0.00 s | details |
| #9 | ACCEPTED | 0.00 s | details |
| #10 | ACCEPTED | 0.00 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
| #13 | ACCEPTED | 0.00 s | details |
Code
#include <iostream>
int main() {
// Valmistellaan muuttujat
unsigned short n, m, k, b;
unsigned int a = 0;
// Luetaan syöte
std::cin >> n >> m >> k;
// Lasketaan pizzan siivujen määrä
a = m * k;
// Lasketaan henkilöiden ja pizzan siivujen kongruenssi
b = a % n;
// Katsotaan, onko kongruenssi nolla.
// Jos se on nolla, tulostetaan b ja a osamäärä suurimpana ja pienimpänä lukuna
// Jos Kongruenssi ei ole nolla, tulostetaan n - a ja n osamäärä pienempänä lukuna ja sama + 1 suurempana lukuna
if (b == 0) {
std::cout << a / n << " " << a / n;
} else {
a = a - b;
std::cout << a / n << " " << a / n + 1;
}
return 0;
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 3 2 4 |
| correct output |
|---|
| 2 3 |
| user output |
|---|
| 2 3 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 1 1 1 |
| correct output |
|---|
| 1 1 |
| user output |
|---|
| 1 1 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 1 1 2 |
| correct output |
|---|
| 2 2 |
| user output |
|---|
| 2 2 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 2 1 1 |
| correct output |
|---|
| 0 1 |
| user output |
|---|
| 0 1 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 2 5 7 |
| correct output |
|---|
| 17 18 |
| user output |
|---|
| 17 18 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 1 1000 1000 |
| correct output |
|---|
| 1000000 1000000 |
| user output |
|---|
| 1000000 1000000 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 1000 1000 1000 |
| correct output |
|---|
| 1000 1000 |
| user output |
|---|
| 1000 1000 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 1000 1 1 |
| correct output |
|---|
| 0 1 |
| user output |
|---|
| 0 1 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 997 995 997 |
| correct output |
|---|
| 995 995 |
| user output |
|---|
| 995 995 |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 997 994 997 |
| correct output |
|---|
| 994 994 |
| user output |
|---|
| 994 994 |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 997 996 995 |
| correct output |
|---|
| 994 995 |
| user output |
|---|
| 994 995 |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 997 996 996 |
| correct output |
|---|
| 995 996 |
| user output |
|---|
| 995 996 |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 997 995 499 |
| correct output |
|---|
| 497 498 |
| user output |
|---|
| 497 498 |
