Submission #169353
Source Code Expand
n = gets.to_i data = Array.new n.times do data << gets.to_i end x = 0.0 y = 0.0 data.permutation.collect do |array| result = Array.new(n){true} array.each_with_index do |d, i| while (i < (array.size-1)) i += 1 result[i] ^= true if array[i] % d == 0 end end x += result.select{|s| s == true}.size y += 1 end puts x / y
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | vvvvv |
Language | Ruby (1.9.3) |
Score | 99 |
Code Size | 370 Byte |
Status | TLE |
Exec Time | 2053 ms |
Memory | 16536 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 | 61 ms | 4116 KB |
sample_02.txt | AC | 64 ms | 4120 KB |
sample_03.txt | AC | 63 ms | 4120 KB |
subtask1_01.txt | AC | 60 ms | 4204 KB |
subtask1_02.txt | AC | 64 ms | 4248 KB |
subtask1_03.txt | AC | 58 ms | 4112 KB |
subtask1_04.txt | AC | 475 ms | 7180 KB |
subtask1_05.txt | AC | 489 ms | 7184 KB |
subtask1_06.txt | AC | 113 ms | 4628 KB |
subtask1_07.txt | AC | 448 ms | 7136 KB |
subtask1_08.txt | AC | 65 ms | 4176 KB |
subtask1_09.txt | AC | 63 ms | 4128 KB |
subtask1_10.txt | AC | 487 ms | 7184 KB |
subtask1_11.txt | AC | 65 ms | 4252 KB |
subtask1_12.txt | AC | 439 ms | 7192 KB |
subtask1_13.txt | AC | 62 ms | 4116 KB |
subtask1_14.txt | AC | 114 ms | 4624 KB |
subtask1_15.txt | AC | 543 ms | 7212 KB |
subtask1_16.txt | AC | 454 ms | 7176 KB |
subtask1_17.txt | AC | 552 ms | 7132 KB |
subtask1_18.txt | AC | 559 ms | 7184 KB |
subtask1_19.txt | AC | 518 ms | 7184 KB |
subtask1_20.txt | AC | 514 ms | 7180 KB |
subtask2_01.txt | TLE | 2053 ms | 16536 KB |
subtask2_02.txt | TLE | 2042 ms | 8516 KB |
subtask2_03.txt | TLE | 2039 ms | 7060 KB |
subtask2_04.txt | TLE | 2039 ms | 6424 KB |
subtask2_05.txt | TLE | 2044 ms | 6868 KB |
subtask2_06.txt | TLE | 2041 ms | 6296 KB |
subtask2_07.txt | TLE | 2042 ms | 7516 KB |
subtask2_08.txt | TLE | 2038 ms | 6936 KB |
subtask2_09.txt | TLE | 2037 ms | 6936 KB |
subtask2_10.txt | TLE | 2042 ms | 6736 KB |
subtask2_11.txt | TLE | 2042 ms | 6892 KB |
subtask2_12.txt | TLE | 2039 ms | 6940 KB |
subtask2_13.txt | TLE | 2041 ms | 6168 KB |
subtask2_14.txt | TLE | 2039 ms | 6892 KB |
subtask2_15.txt | TLE | 2040 ms | 6868 KB |
subtask2_16.txt | TLE | 2037 ms | 6944 KB |
subtask2_17.txt | TLE | 2039 ms | 6820 KB |
subtask2_18.txt | TLE | 2040 ms | 6868 KB |
subtask2_19.txt | TLE | 2039 ms | 6804 KB |
subtask2_20.txt | TLE | 2036 ms | 6928 KB |