Submission #3050197
Source Code Expand
let rec power e m n = if n <= 0 then e else power (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1) let power = power 1 let () = Scanf.scanf "%d\n" @@ fun n -> let dp = Array.make n 0 in for i = 0 to (n - 1) / 5 do print_string "? "; for j = 0 to n - 1 do Printf.printf "%d " @@ if j < 5 * i || 5 * i + 4 < j then 0 else power 5 (j - 5 * i) done; print_newline (); Scanf.scanf "%d\n" @@ fun ans -> dp.(5 * i) <- (ans - 6248) mod 5 + 8; dp.(5 * i + 1) <- ((ans - 6248) / 5) mod 5 + 8; dp.(5 * i + 2) <- ((ans - 6248) / 25) mod 5 + 8; dp.(5 * i + 3) <- ((ans - 6248) / 125) mod 5 + 8; dp.(5 * i + 4) <- (ans - 6248) / 625 + 8 done; print_string "! "; for i = 0 to n - 1 do Printf.printf "%d " @@ if dp.(i) = 9 || dp.(i) = 11 then 1 else 0 done; print_newline ()
Submission Info
Submission Time | |
---|---|
Task | E - Coin Authentication |
User | fetburner |
Language | OCaml (4.02.3) |
Score | 0 |
Code Size | 882 Byte |
Status | WA |
Exec Time | 10 ms |
Memory | 2896 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt |
All | sample_01.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 10 ms | 1228 KB |
subtask_1_1.txt | WA | 3 ms | 848 KB |
subtask_1_10.txt | WA | 3 ms | 848 KB |
subtask_1_11.txt | AC | 3 ms | 2896 KB |
subtask_1_12.txt | AC | 3 ms | 848 KB |
subtask_1_13.txt | WA | 3 ms | 720 KB |
subtask_1_14.txt | WA | 3 ms | 848 KB |
subtask_1_15.txt | WA | 3 ms | 848 KB |
subtask_1_16.txt | WA | 3 ms | 848 KB |
subtask_1_17.txt | AC | 3 ms | 848 KB |
subtask_1_18.txt | AC | 3 ms | 976 KB |
subtask_1_19.txt | AC | 3 ms | 852 KB |
subtask_1_2.txt | WA | 3 ms | 848 KB |
subtask_1_20.txt | AC | 3 ms | 976 KB |
subtask_1_21.txt | AC | 3 ms | 848 KB |
subtask_1_22.txt | AC | 3 ms | 848 KB |
subtask_1_23.txt | AC | 3 ms | 972 KB |
subtask_1_24.txt | AC | 3 ms | 976 KB |
subtask_1_25.txt | AC | 3 ms | 976 KB |
subtask_1_26.txt | WA | 3 ms | 844 KB |
subtask_1_27.txt | AC | 3 ms | 976 KB |
subtask_1_28.txt | WA | 3 ms | 848 KB |
subtask_1_29.txt | AC | 3 ms | 844 KB |
subtask_1_3.txt | WA | 3 ms | 848 KB |
subtask_1_4.txt | WA | 3 ms | 720 KB |
subtask_1_5.txt | WA | 3 ms | 848 KB |
subtask_1_6.txt | AC | 3 ms | 844 KB |
subtask_1_7.txt | WA | 3 ms | 848 KB |
subtask_1_8.txt | WA | 3 ms | 848 KB |
subtask_1_9.txt | AC | 3 ms | 848 KB |