# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72347 | Semteo For Ajou (#118) | 마법 다우징 (FXCUP3_magic) | C++14 | 2 ms | 376 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 "dowsing.h"
void FindTreasure(int N) {
int i, j;
int m = 0, arr[3] = { 0 };
for (i = 1; i <= N; i++)
{
if (Detect(i, i) == 1)
{
m++;
arr[m] = i;
}
}
if (m == 2)
{
if (Detect(arr[1], arr[2]) == 0)
Report(arr[1], arr[2]);
else
Report(arr[2], arr[1]);
}
else if (m == 0)
{
int flag = 0;
for (i = 1; i <= N; i++)
{
if (Detect(i, 1) == 1)
{
flag = i;
break;
}
}
if (flag == 0)
Report(1, 1);
else
Report(flag, flag);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |