# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9320 | lemonsqueeze | Wiring (kriii2_W) | C++98 | 0 ms | 2064 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 <cstdio>
typedef long long int64;
const int N = 1000;
int64 n;
bool con[N][N];
int main(void) {
scanf("%lld", &n);
if (n%2 == 0) {
printf("%lld\n", n-1);
} else printf("%lld\n", n/2);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |