Submission #528876


Source Code Expand

l = ["a","b","c"]
n = gets.to_i
a = Array.new(n,0)
def up_sub(a,max, dx)
	if dx >= a.size
		return nil
	end	
	if a[dx] == (max-1) then
		a[dx] = 0
		up_sub(a,max,dx+1)
	else
		a[dx] += 1
	end
end

def up(a,max)
	up_sub(a,max,0)
end

# puts l.repeated_combination(n).collect{|a| a.join}.join("\n")
begin
	print a.reverse.map{|i| l[i]}.join() 
	print "\n"
end while up(a, l.size) 

Submission Info

Submission Time
Task C - Brute-force Attack
User lisosia
Language Ruby (2.1.5p273)
Score 100
Code Size 403 Byte
Status AC
Exec Time 95 ms
Memory 5472 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 8
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, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 91 ms 5084 KiB
subtask0_sample_02.txt AC 64 ms 5088 KiB
subtask1_01.txt AC 62 ms 5088 KiB
subtask1_02.txt AC 64 ms 5172 KiB
subtask1_03.txt AC 65 ms 5192 KiB
subtask1_04.txt AC 67 ms 5344 KiB
subtask1_05.txt AC 73 ms 5472 KiB
subtask1_06.txt AC 95 ms 5472 KiB