# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236365 | dolphingarlic | Ones (LMIO17_vienetai) | C++14 | 47 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
int n, m, d;
bool visited[10];
void answer(int val) {
if (~val) cout << val;
else cout << "NESIDALO";
exit(0);
}
void add_digit(int &rem, int &sum, int digit) {
rem = rem * 10 + digit;
sum += rem / d;
rem %= d;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> d;
if (n % m != 0) answer(-1);
int groups = n / m, len = m - 1;
if (d == 1) answer(groups);
int sum = 0, rem = 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |