Submission #1239240
Source Code Expand
def count_front(coins) status = Array.new(coins.size, 0) coins.each_index do |idx1| coins.each_index do |idx2| status[idx2] += 1 if coins[idx2] % coins[idx1] == 0 && idx2 > idx1 end end return status.count { |s| s % 2 == 0 } end N = gets.to_i C = Array.new(N) { gets.to_i } count = 0 C.permutation.each do |coins| count += count_front(coins) end n = (1..N).inject(1,:*).to_f puts format "%.12f", count / n
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | sbyh52 |
Language | Ruby (2.3.3) |
Score | 99 |
Code Size | 455 Byte |
Status | TLE |
Exec Time | 2108 ms |
Memory | 5756 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 99 / 99 | 0 / 1 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt |
Subtask2 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 8 ms | 1788 KB |
sample_02.txt | AC | 7 ms | 1788 KB |
sample_03.txt | AC | 7 ms | 1788 KB |
subtask1_01.txt | AC | 7 ms | 1788 KB |
subtask1_02.txt | AC | 11 ms | 1916 KB |
subtask1_03.txt | AC | 7 ms | 1788 KB |
subtask1_04.txt | AC | 358 ms | 2172 KB |
subtask1_05.txt | AC | 369 ms | 2172 KB |
subtask1_06.txt | AC | 46 ms | 2044 KB |
subtask1_07.txt | AC | 345 ms | 2172 KB |
subtask1_08.txt | AC | 11 ms | 1916 KB |
subtask1_09.txt | AC | 9 ms | 1916 KB |
subtask1_10.txt | AC | 371 ms | 2172 KB |
subtask1_11.txt | AC | 11 ms | 1916 KB |
subtask1_12.txt | AC | 346 ms | 2172 KB |
subtask1_13.txt | AC | 7 ms | 1788 KB |
subtask1_14.txt | AC | 48 ms | 2044 KB |
subtask1_15.txt | AC | 386 ms | 2172 KB |
subtask1_16.txt | AC | 345 ms | 2172 KB |
subtask1_17.txt | AC | 392 ms | 2172 KB |
subtask1_18.txt | AC | 394 ms | 2172 KB |
subtask1_19.txt | AC | 380 ms | 2172 KB |
subtask1_20.txt | AC | 379 ms | 2172 KB |
subtask2_01.txt | TLE | 2107 ms | 2172 KB |
subtask2_02.txt | TLE | 2108 ms | 2492 KB |
subtask2_03.txt | TLE | 2107 ms | 4732 KB |
subtask2_04.txt | TLE | 2108 ms | 3708 KB |
subtask2_05.txt | TLE | 2108 ms | 4348 KB |
subtask2_06.txt | TLE | 2108 ms | 4732 KB |
subtask2_07.txt | TLE | 2108 ms | 4476 KB |
subtask2_08.txt | TLE | 2108 ms | 4348 KB |
subtask2_09.txt | TLE | 2108 ms | 4348 KB |
subtask2_10.txt | TLE | 2108 ms | 4348 KB |
subtask2_11.txt | TLE | 2108 ms | 4348 KB |
subtask2_12.txt | TLE | 2108 ms | 4348 KB |
subtask2_13.txt | TLE | 2108 ms | 4092 KB |
subtask2_14.txt | TLE | 2108 ms | 4348 KB |
subtask2_15.txt | TLE | 2108 ms | 4348 KB |
subtask2_16.txt | TLE | 2108 ms | 5756 KB |
subtask2_17.txt | TLE | 2108 ms | 4348 KB |
subtask2_18.txt | TLE | 2108 ms | 4092 KB |
subtask2_19.txt | TLE | 2108 ms | 4348 KB |
subtask2_20.txt | TLE | 2108 ms | 4348 KB |