Submission #236347

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
236347	2020-06-01T12:52:41 Z	dolphingarlic	Ones (LMIO17_vienetai)	C++14	10 / 100	5 ms	384 KB

vienetai

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, d;
    cin >> n >> m >> d;
    if (d == 1 && n % m == 0) {
        // Period: 1
        cout << n / m;
    } else if (d == 3 && n % (3 * m) == 0) {
        // Period: 037
        cout << n / (3 * m) * (3 * m + 6 * (m - 1) + 7);
    } else if (d == 7 && n % (6 * m) == 0) {
        // Period: 015873
        n /= 6;

    } else if (d == 9 && n % (9 * m) == 0) {
        // Period: 012345679
        cout << n / (9 * m) * (36 * m + 1);
    } else return cout << "NESIDALO", 0;
    return 0;
}

Subtask #1

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	256 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Incorrect	5 ms	384 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	256 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Incorrect	5 ms	384 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Incorrect	5 ms	384 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	5 ms	304 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	4 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	4 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	4 ms	384 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	4 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	384 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Incorrect	5 ms	384 KB	Output isn't correct
5	Halted	0 ms	0 KB	-