1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 | def choose(m) self.factorial / (m.factorial * (self - m).factorial) end def fact (n) if n < 2 return 1 end (2..n).inject(1) { |f, n| f * n } end mod = 10**9 + 7 t = gets.to_i while t > 0 s = gets.chomp if s.include? 'j' or s.include? 'J' or s.include? 'u' or s.include? 'U' or s.include? 'w' or s.include? 'W' puts "0" else n = s.length m = n count = [] i = 0 while s[i]!=nil count << s.count(s[i]) s = s.gsub(s[i],"") end n = count.length deno = 1 (0..n-1).each{ |i| deno = deno * fact(count[i]) } print "%d\n" %"#{(fact(m)/deno)%mod}" end t= t - 1 end |
-
upload with new input
-
result: Success time: 0s memory: 4760 kB returned value: 0
1 ww
0
-
result: Success time: 0s memory: 4760 kB returned value: 0
1 aba
3
-
result: Success time: 0s memory: 4760 kB returned value: 0
1 qaw
0
-
result: Success time: 0s memory: 4760 kB returned value: 0
4 ab aa aA AAbaz
2 1 2 60



