Submission #551493
Source Code Expand
n=gets.to_i m=10**n p m-1 a=Array.new(10){|i|i.to_s} m.times{|i| b=c=i.to_s.rjust(n,"0").split("").map(&:to_i) if n>1 c[1]=9-c[1] if b[0]%2>0 if n>2 c[2]=9-c[2] if (b[0]+b[1])%2>0 if n>3 c[3]=9-c[3] if (b[0]+b[1]+b[2])%2>0 if n>4 c[4]=9-c[4] if (b[0]+b[1]+b[2]+b[3])%2>0 end end end end b.each{|x|print x} puts "" }
Submission Info
Submission Time | |
---|---|
Task | A - Lock |
User | kai_usg |
Language | Ruby (1.9.3) |
Score | 100 |
Code Size | 372 Byte |
Status | AC |
Exec Time | 1504 ms |
Memory | 4336 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 54 ms | 4208 KB |
subtask0_sample_02.txt | AC | 56 ms | 4204 KB |
subtask1_01.txt | AC | 65 ms | 4332 KB |
subtask1_02.txt | AC | 181 ms | 4332 KB |
subtask1_03.txt | AC | 1504 ms | 4336 KB |