Submission #2378272
Source Code Expand
S = gets.chomp sum = 0 queue = [ [S] ] until queue.empty? q = queue.shift sum += q.map(&:to_i).inject(&:+) s = q.pop (1..s.size-1).each do |i| queue << [*q, s[0, i], s[i..-1]] end end puts sum
Submission Info
Submission Time | |
---|---|
Task | C - Many Formulas |
User | tfnw315 |
Language | Ruby (2.3.3) |
Score | 300 |
Code Size | 225 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 3836 KB |
Judge Result
Set Name | Sample | All | ||
---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||
Status | AC |
|
Set Name | Test Cases |
---|---|
Sample | |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, sample_01.txt, sample_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 9 ms | 1916 KB |
02.txt | AC | 9 ms | 1916 KB |
03.txt | AC | 9 ms | 1916 KB |
04.txt | AC | 7 ms | 1788 KB |
05.txt | AC | 7 ms | 1788 KB |
06.txt | AC | 7 ms | 1788 KB |
07.txt | AC | 9 ms | 1916 KB |
08.txt | AC | 9 ms | 1916 KB |
09.txt | AC | 7 ms | 3836 KB |
10.txt | AC | 7 ms | 1788 KB |
sample_01.txt | AC | 7 ms | 1788 KB |
sample_02.txt | AC | 9 ms | 1916 KB |