{"lang": "Ruby", "source_code": "def solution(n, k, d)\n  @memo = Array.new(2) { Array.new(n+1, false) }\n  def solve(n, k, d, flag)\n    return @memo[(flag ? 1 : 0)][n] if @memo[(flag ? 1 : 0)][n]\n    return 1 if n == 0 && flag\n    return 0 if n == 0 && !flag\n    cnt = 0\n    for i in 1..k do\n      cnt += solve(n-i, k, d, flag || (i >= d)) if n-i >= 0\n    end\n    @memo[(flag ? 1 : 0)][n] = cnt\n  end\n  solve(n, k, d, false)\n  @memo[0][n] % 1000000007\nend\n\nputs solution(*gets.split.map(&:to_i))\n", "lang_cluster": "Ruby", "tags": ["dp", "implementation", "trees"], "code_uid": "303e09d1ea7899d10e6145891a1a7541", "src_uid": "894a58c9bba5eba11b843c5c5ca0025d", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "n = gets.to_i\na = gets.split.map(&:to_i)\n\nfor i in 0 ... n\n  for j in i ... n\n    # increasing in [0, i]?\n    ok = true\n    for k in 0 ... i\n      if a[k] >= a[k + 1]\n        ok = false\n        break\n      end\n    end\n    if not ok\n      next\n    end\n    for k in j ... n - 1\n      if a[k] <= a[k + 1]\n        ok = false\n        break\n      end\n    end\n    if not ok\n      next\n    end\n    if a[i .. j].uniq.size != 1\n      next\n    end\n    puts 'YES'\n    exit\n  end\nend\nputs 'NO'\n", "lang_cluster": "Ruby", "tags": ["implementation"], "code_uid": "bc30b0420af559304598ed8a8fdf6264", "src_uid": "5482ed8ad02ac32d28c3888299bf3658", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "n,k=gets.split.map(&:to_i)\nt=(n+1)/2\np k>t ? 2*(k-t) : 2*k-1\n", "lang_cluster": "Ruby", "tags": ["math"], "code_uid": "191184e4aa4d6dbbac3183b0f2c92230", "src_uid": "1f8056884db00ad8294a7cc0be75fe97", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "stones = gets.chomp.to_i\ncolors = gets.chomp\ncolors = colors.split(\"\")\n\nfor i in (0..colors.size-1)\n\tif i < colors.size - 1\n\t\twhile colors[i] == colors[i+1] && colors.size > 1\n\t\t\tcolors.delete_at(i+1)\n\t\tend\n\tend\nend\n\nprint stones - colors.size", "lang_cluster": "Ruby", "tags": ["implementation"], "code_uid": "a58dfc8a6f396e15c9221842ec189240", "src_uid": "d561436e2ddc9074b98ebbe49b9e27b8", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "n,m = gets.split(\" \").map(&:to_i)\narr = []\n\nn.times do\n\tarr << gets.split(\"\")\nend\neaten = Array.new(n)\neaten.map! { |e| Array.new(m,false) }\ncount = 0\n(0..(n-1)).each do |i|\n\t(0..(m-1)).each do |j|\n\t\tif arr[i][j] == 'W'\n\t\t\tif arr[i][j+1] && arr[i][j+1] == 'P' && !eaten[i][j+1]\n\t\t\t\teaten[i][j+1] = true\n\t\t\t\tcount += 1\n\t\t\telsif j > 0 && arr[i][j-1] == 'P' && !eaten[i][j-1]\n\t\t\t\teaten[i][j-1] = true\n\t\t\t\tcount += 1\n\t\t\telsif arr[i+1] && arr[i+1][j] == 'P' && !eaten[i+1][j]\n\t\t\t\teaten[i+1][j] = true\n\t\t\t\tcount += 1\n\t\t\telsif i > 0 && arr[i-1][j] == 'P' && !eaten[i-1][j]\n\t\t\t\teaten[i-1][j] = true\n\t\t\t\tcount += 1\n\t\t\tend\t\t\t\t\t\t\t\t\t\n\t\tend\n\t\t# puts \"#{i} #{j} #{arr[i][j]}\"\n\t\t# puts \"here #{count}\"\n\tend\nend\nputs count", "lang_cluster": "Ruby", "tags": ["greedy", "implementation"], "code_uid": "5a948bdb67bfa49d0e37c248385b63ac", "src_uid": "969b24ed98d916184821b2b2f8fd3aac", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "a=gets.split.map{|x| x.to_i}\nb=false\nc=0\nfor i in 0..5\n if a.count(a[i])>=4\n  b=true \n  c=a[i]\n  break\n end\nend\n\ns=0\nfor i in 0..5\n if a[i]==c\n  a[i]=nil \n  s+=1\n end\n break if s==4\nend\n\nif b \n a=a.compact\n puts \"Elephant\" if a[0]==a[1]\n puts \"Bear\" if a[0]!=a[1]\nelse\n puts \"Alien\"\nend", "lang_cluster": "Ruby", "tags": ["implementation"], "code_uid": "1c0cf8e686903954d379e27f73b7a976", "src_uid": "43308fa25e8578fd9f25328e715d4dd6", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "p1, p2, p3, p4, a, b = gets.split.map(&:to_i)\np [*a .. b].count{|_| _ % p1 % p2 % p3 % p4 == _}\n", "lang_cluster": "Ruby", "tags": ["implementation", "number theory"], "code_uid": "cc317b6ded56b57c88361e4b4de35cea", "src_uid": "63b9dc70e6ad83d89a487ffebe007b0a", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "#!/usr/bin/ruby\ns=gets.chomp.chars.uniq.join\nputs s==[*'a'..'z'].join[0,s.size] ? :YES : :NO", "lang_cluster": "Ruby", "tags": ["greedy", "strings", "implementation"], "code_uid": "5ab325b59a31b39432741b283c8457b2", "src_uid": "c4551f66a781b174f95865fa254ca972", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "s = gets \nt = gets  \nstart = 0  \nt.each_char do |i| \n    if s[start] == i       \n        start +=1   \n    end \nend \n\nputs start + 1 ", "lang_cluster": "Ruby", "tags": ["implementation"], "code_uid": "5c70d3d3442708fc3935b0828bce6b2f", "src_uid": "f5a907d6d35390b1fb11c8ce247d0252", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "recipe = gets\nn = gets.split.map{|e| e.to_i}\np = gets.split.map{|e| e.to_i}\nbudget = gets.to_i\n\nk = [\"B\", \"S\", \"C\"].map{|e| recipe.count e}\n\ndef non_neg(x)\n    return x < 0 ? 0 : x\nend\n\nl = 0; r = budget + n.max; x = 0\nwhile l <= r\n    m = (l + r) / 2\n    sum_cost = k.map.with_index{|e, i| e == 0 ? 0 : p[i] * non_neg(e * m - n[i])}.inject(:+)\n    if sum_cost < budget\n        l = m + 1\n        x = m\n    elsif sum_cost > budget\n        r = m - 1\n    else\n        x = m\n        break\n    end\nend\nputs x\n", "lang_cluster": "Ruby", "tags": ["brute force", "binary search"], "code_uid": "a884620bdfb4f9258af04b53efe21460", "src_uid": "8126a4232188ae7de8e5a7aedea1a97e", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "cityNum, livingCity = gets.chomp.split(' ').map(&:to_i)\ncriminals = gets.chomp.split(' ').map(&:to_i)\n\nmaxDist = [(cityNum - livingCity), livingCity - 1].max\ncheckedDist = 0\n\nsure = 0\n\nuntil checkedDist > maxDist\n\tleftCity = livingCity - checkedDist\n\trightCity = livingCity + checkedDist\n\n\tlackNumber = 0\n\tlackNumber += 1 if leftCity <= 0\n\tlackNumber += 1 if rightCity > cityNum\n\tif leftCity == rightCity\n\t\tsure += 1 if criminals[livingCity - 1] > 0\n\telse\n\t\tcase lackNumber\n\t\twhen 0 then sure += 2 if criminals[leftCity - 1] > 0 && criminals[rightCity - 1] > 0\n\t\twhen 1 then\tsure += 1 if (leftCity > 0 && criminals[leftCity - 1] > 0) || (rightCity <= cityNum && criminals[rightCity - 1] > 0)\n\t\tend\n\tend\n\n\tcheckedDist += 1\nend\n\nputs sure", "lang_cluster": "Ruby", "tags": ["constructive algorithms", "implementation"], "code_uid": "d79d96a49d4886599035b50612f378ac", "src_uid": "4840d571d4ce6e1096bb678b6c100ae5", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "w,h,k=gets.split.map &:to_i\np k*(2*(w+h)-8*k+4)", "lang_cluster": "Ruby", "tags": ["math", "implementation"], "code_uid": "89bf608cc949df39ddfae4e44f5b527b", "src_uid": "2c98d59917337cb321d76f72a1b3c057", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "def gao1(a, b)\n\tc = 0\n\t4.times{|i| c += 1 if a[i] == b[i]}\n\tc\nend\n\ndef gao2(a, b)\n\tc = 0\n\t4.times{|i| c += 1 if b.index(a[i])}\n\tc\nend\n\nn = gets.to_i\nx = 100.upto(9999).map{|_| '%04d' % _}\nx.reject!{|_| _.bytes.sort.uniq.size < 4}\nn.times do\n\ta, b, c = gets.split.map(&:to_i)\n\ta = '%04d' % a\n\tc += b\n\tx.reject!{|_| gao1(_, a) != b || gao2(_, a) != c}\nend\n\nif x.empty?\n\tputs 'Incorrect data'\nelsif x.size > 1\n\tputs 'Need more data'\nelse\n\tputs x[0]\nend\n\n", "lang_cluster": "Ruby", "tags": ["brute force", "implementation"], "code_uid": "6342c0d9918ca27cb8a23f3434ac4fce", "src_uid": "142e5f2f08724e53c234fc2379216b4c", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "w,m,k=gets.split.map(&:to_i)\na=Math.log10(m).to_i+1\nv=l=0\nwhile a*k*(c=(b=10**a-1)-m+1)+v <=w do\n  v+=a*k*c\n  l+=c\n  m=b+1\n  a+=1\nend\nl+=(w-v)/(a*k)\np l\n\n\n", "lang_cluster": "Ruby", "tags": ["math", "implementation", "binary search"], "code_uid": "eb8400af4e58ad9e12d9c2c6e50a42eb", "src_uid": "8ef8a09e33d38a2d7f023316bc38b6ea", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "n = gets.chomp.to_i\ninterestings = gets.chomp.split(/ /).map(&:to_i)\nwatch = 0\nprev = 0\n(0...n).each do |i|\n    curr = interestings[i]\n    watch = curr\n    if curr - prev > 15\n        watch = prev + 15\n        break\n    end\n    prev = curr\nend\nwatch = prev + 15 if 90 - prev > 15\nwatch = 90 if watch > 90 || 90 - prev <= 15\nputs watch\n", "lang_cluster": "Ruby", "tags": ["implementation"], "code_uid": "bc334611c1fc4bbd27ccdd6092e9f39e", "src_uid": "5031b15e220f0ff6cc1dd3731ecdbf27", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "gets\narr = gets.split\n\ncnt1 = arr.count(?1)\nans = 0\ncnt0 = 0\n\narr.each do |x|\n\tif x == ?1\n\t\tans = [ans, cnt0 + cnt1].max\n\t\tcnt1 -= 1\n\telse\n\t\tcnt0 += 1\n\tend\nend\n\np [ans, cnt0 + cnt1].max", "lang_cluster": "Ruby", "tags": ["brute force", "implementation"], "code_uid": "fb0ce5da65452ff5eee7d6ab1953eaa3", "src_uid": "c7b1f0b40e310f99936d1c33e4816b95", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "l, r = gets.split(' ').map(&:to_i)\ncnt = 0\nfor x in 0..(Math.log(r, 2)+1)\n\tfor y in 0..(Math.log(r,3)+1)\n\t\ta = (2**x)*(3**y)\n\t\tif a >= l and a <= r\n\t\t\tcnt += 1\n\t\tend\n\tend\nend\nprint String(cnt)", "lang_cluster": "Ruby", "tags": ["math", "implementation"], "code_uid": "dcc2364ac4d019f718058b027e9d5242", "src_uid": "05fac54ed2064b46338bb18f897a4411", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "a,b,c=gets.split.map &:to_i;p a*b+b*c+c*a-a-b-c+1\n", "lang_cluster": "Ruby", "tags": ["math", "implementation"], "code_uid": "4ccf797c17f4a73041355c5aed632513", "src_uid": "8ab25ed4955d978fe20f6872cb94b0da", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "exhibit = gets.rstrip\n\narr = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\n\ncount = 0\ncurrent_index = 0\nexhibit.split('').each do |char|\n  index = arr.find_index do |l|\n    l == char\n  end\n\n  distance_index = (index - current_index).abs\n\n  if distance_index > 13\n    if index < current_index\n      count += index + 26 - current_index\n    else\n      count += current_index + 26 - index\n    end\n  else\n    count += distance_index\n  end\n  current_index = index\nend\n\nputs count\n", "lang_cluster": "Ruby", "tags": ["strings", "implementation"], "code_uid": "fa626d334366a9cc37583b1a06ab4693", "src_uid": "ecc890b3bdb9456441a2a265c60722dd", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "n = gets.to_i\ns = gets.chomp.split('')\nputs (s-['4','7']==[]&&s[0...n/2].sort==s[n/2...n].sort)?'YES':'NO'\n", "lang_cluster": "Ruby", "tags": ["implementation"], "code_uid": "5d71bc853915501a6b709689b8a77ef6", "src_uid": "435b6d48f99d90caab828049a2c9e2a7", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "n, k = gets.split.map &:to_i\nputs [:No, :Yes][(1..k).all? { |i| (n + 1) % i == 0 } ? 1 : 0]\n", "lang_cluster": "Ruby", "tags": ["brute force", "number theory"], "code_uid": "377d185de520a0c4cb3a8f404a60acea", "src_uid": "5271c707c9c72ef021a0baf762bf3eb2", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "x,t,a,b,da,db=gets.split.map(&:to_i);\ntag=0;\nfor i in 0...t\n\tfor j in 0...t\n\t\tif a-i*da+b-j*db==x or a-i*da==x or b-j*db==x or x==0\n\t\t\ttag=1;\n\t\t\tbreak;\n\t\tend\n\tend\nend\n\nif tag==1\n\tputs \"YES\"\nelse\n\tputs \"NO\"\nend\n", "lang_cluster": "Ruby", "tags": ["brute force", "implementation"], "code_uid": "a95ffc2b88b3b49f561a31fe5c8a1bc5", "src_uid": "f98168cdd72369303b82b5a7ac45c3af", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "a1, a2 = gets.chomp.split(\" \").map(&:to_i)\nn = 0\nwhile true\n  if a1 < a2 then\n    a1 += 1\n    a2 -= 2\n  else\n    a1 -= 2\n    a2 += 1\n  end\n  if a1 > 0 and a2 > 0 then\n    n += 1\n  elsif a1 == 0 or a2 == 0 then\n    n += 1\n    puts n\n    exit\n  else\n    puts n\n    exit\n  end\nend\n", "lang_cluster": "Ruby", "tags": ["math", "greedy", "dp", "implementation"], "code_uid": "1e7be63d188f311ff60901ce5d638664", "src_uid": "ba0f9f5f0ad4786b9274c829be587961", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "s = gets.chomp.downcase\nputs (s =~ /[^aeioun][^aeiou]/ || s=~ /[^aeioun]$/) ? \"NO\" : \"YES\"", "lang_cluster": "Ruby", "tags": ["strings", "implementation"], "code_uid": "07c3ca27d25a58ea9fa22f76faee0dc3", "src_uid": "a83144ba7d4906b7692456f27b0ef7d4", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "a,b,m,r = gets.split.map(&:to_i)\n\nar = Array.new(m)\nar[r]=0\ni = 0\nloop do\n  i += 1\n  r = (a*r+b)%m\n  if ar[r]\n    puts i - ar[r]\n    break\n  end\n  ar[r] = i\nend\n", "lang_cluster": "Ruby", "tags": ["implementation", "number theory"], "code_uid": "34b96a01532ce8e1c4f5a92bd8ce1351", "src_uid": "9137197ee1b781cd5cc77c46f50b9012", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "n, k = gets.chomp.split(\" \").map{|e| e.to_i}\n\nleft = 1\nright = n\nans = nil\nwhile (left <= right) do\n  mid = (left + right) / 2\n  tmp = mid\n  sum = 0\n  \n  while (tmp > 0) do\n    sum += tmp\n    tmp /= k\n  end\n  \n  if sum < n\n    left = mid + 1\n  else\n    right = mid - 1\n    ans = mid\n  end\nend\n\nputs ans\n\n", "lang_cluster": "Ruby", "tags": ["implementation", "binary search"], "code_uid": "0efe8527067780f361417193f3ac07c8", "src_uid": "41dfc86d341082dd96e089ac5433dc04", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "#!/Users/mike/.rvm/rubies/ruby-1.9.3-p327/bin/ruby\n\nredNum, blueNum = STDIN.readline.split.collect {|s| s.to_i}\n\ndef simulate(red, redCount, blueCount, petyaMove)\n\tpetya, vasya = 0, 0\n\twhile redCount+blueCount > 0\n\t\twasRed = red\n\t\tif petyaMove and red and redCount > 0\n\t\t\tred = true\n\t\telsif petyaMove and !red and blueCount > 0\n\t\t\tred = false\n\t\telsif !petyaMove and red and blueCount > 0\n\t\t\tred = false\n\t\telsif !petyaMove and !red and redCount > 0\n\t\t\tred = true\n\t\telsif redCount > 0\n\t\t\tred = true\n\t\telse\n\t\t\tred = false\n\t\tend\n\t\tif red\n\t\t\tredCount -= 1\n\t\t\tpetya += 1 if wasRed\n\t\t\tvasya += 1 if !wasRed\n\t\telse\n\t\t\tblueCount -= 1\n\t\t\tvasya += 1 if wasRed\n\t\t\tpetya += 1 if !wasRed\n\t\tend\n\t\tpetyaMove = !petyaMove\n\tend\n\treturn [petya, vasya]\nend\n\npetya0, vasya0 = simulate(true, redNum-1, blueNum, false)\npetya1, vasya1 = simulate(false, redNum, blueNum-1, false)\n\nif (petya0 > petya1)\n\tputs '%s %s' % [petya0, vasya0]\nelse (petya1 > petya0)\n\tputs '%s %s' % [petya1, vasya1]\nend\n", "lang_cluster": "Ruby", "tags": ["greedy", "implementation", "games"], "code_uid": "ecb184373a2f4a4a2509aa19d655eb55", "src_uid": "c8378e6fcaab30d15469a55419f38b39", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "n = gets.to_i\n1.upto(n - 1){|i| puts 1.upto(n - 1).map{|j| (i * j).to_s(n)} * ' '}", "lang_cluster": "Ruby", "tags": ["implementation"], "code_uid": "789b46b121c3a1ae31da7750412e3742", "src_uid": "a705144ace798d6b41068aa284d99050", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "l = Array.new(4, 0)\ns = Array.new(4, 0)\nr = Array.new(4, 0)\np = Array.new(4, 0)\n4.times do |i|\n    l[i], s[i], r[i], p[i] = gets.strip.split.map(&:to_i)\nend\nhit = false\n# Part 1.\nif l[0] == 1 && (p[0] == 1 || p[3] == 1)\n    hit = true\nelsif s[0] == 1 && (p[0] == 1 || p[2] == 1)\n    hit = true\nelsif r[0] == 1 && (p[0] == 1 || p[1] == 1)\n    hit = true\nend\n# Part 2.\nif !hit\n    if l[1] == 1 && (p[1] == 1 || p[0] == 1)\n        hit = true\n    elsif s[1] == 1 && (p[1] == 1 || p[3] == 1)\n        hit = true\n    elsif r[1] == 1 && (p[1] == 1 || p[2] == 1)\n        hit = true\n    end\nend\n# Part 3.\nif !hit\n    if l[2] == 1 && (p[2] == 1 || p[1] == 1)\n        hit = true\n    elsif s[2] == 1 && (p[2] == 1 || p[0] == 1)\n        hit = true\n    elsif r[2] == 1 && (p[2] == 1 || p[3] == 1)\n        hit = true\n    end\nend\n# Part 4.\nif !hit\n    if l[3] == 1 && (p[3] == 1 || p[2] == 1)\n        hit = true\n    elsif s[3] == 1 && (p[3] == 1 || p[1] == 1)\n        hit = true\n    elsif r[3] == 1 && (p[3] == 1 || p[0] == 1)\n        hit = true\n    end\nend\nputs hit ? \"YES\" : \"NO\"\n", "lang_cluster": "Ruby", "tags": ["implementation"], "code_uid": "994f895899673d973e11cdaa3df9f358", "src_uid": "44fdf71d56bef949ec83f00d17c29127", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "k,r=gets.split.map &:to_i\n(1..10).each{|i|t=k*i%10;(p i;exit)if t==0||t==r}", "lang_cluster": "Ruby", "tags": ["brute force", "math", "constructive algorithms", "implementation"], "code_uid": "da9134cd1b2df4e5f8ccb7ab9ef3adc6", "src_uid": "18cd1cd809df4744bb7bcd7cad94e2d3", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "def inpf() a=gets.chomp.split(\" \").map(&:to_f)end\n\ndef inps() a=gets.chomp.split(\" \")end\n\ndef copy(a) Marshal.load(Marshal.dump(a)) end\n\ndef kaijo(n,r = 10**9+7)(n < 2)? 1 : (2..n).inject{|memo,u|memo=(memo*u)%r} end\n\ndef na(n,d=0) Array.new(n,d)end\n\ndef na2(n,m,d=0) Array.new(n){Array.new(m,d)}end\n\ndef na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end\n\ndef inp() a=gets.chomp.split(\" \").map(&:to_i)end\n\ndef r_up(a, b) (a+b-1)/b end\n\ndef sum(a) a.inject(:+) end\n\nrequire 'prime'\nn = inp[0]\n\nd = Prime.prime_division(n)\nif(d.size == 1 )\n  p d[0][0]\nelse\n  p 1\nend", "lang_cluster": "Ruby", "tags": ["number theory"], "code_uid": "416a450d42a82c8c43661fcf86810c91", "src_uid": "f553e89e267c223fd5acf0dd2bc1706b", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "n = gets.to_i\nputs n - gets.chomp.scan(/RU|UR/).size", "lang_cluster": "Ruby", "tags": ["implementation"], "code_uid": "7342ca34b38832df527cf066a12385bf", "src_uid": "986ae418ce82435badadb0bd5588f45b", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "r=0;[*$<][1].split.each_with_index{|e,i|r+=4*e.to_i*i};p r", "lang_cluster": "Ruby", "tags": ["brute force", "implementation"], "code_uid": "afe3c529e38a5ffa19223f521477d289", "src_uid": "a5002ddf9e792cb4b4685e630f1e1b8f", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "def step(a,op)\n\ta.permutation.map{|v| ( ( [ (op==\"+\") ? v[0]+v[1] : v[0]*v[1] ] ) + ( (v.drop(2)) ? v.drop(2) : [] ) ).sort }.uniq\nend\n\n\na=gets.split.map{|v| v.to_i}\noper=gets.split\nres=[]\nstep(a,oper[0]).each do |v| \n  step(v,oper[1]).each do |t|\n\tres+=step(t,oper[2])\n  end\nend\nputs res.min", "lang_cluster": "Ruby", "tags": ["brute force"], "code_uid": "6a2a3db7f1dd02f79881b394a6dd2323", "src_uid": "7a66fae63d9b27e444d84447012e484c", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "X,Y,x,y,a,b=$<.read.split.map &:to_i\nx-=X\ny-=Y\nputs x%a==0&&y%b==0&&x/a%2==y/b%2 ? :YES : :NO", "lang_cluster": "Ruby", "tags": ["math", "implementation", "number theory"], "code_uid": "d886884773b847694810214bd7f940f6", "src_uid": "1c80040104e06c9f24abfcfe654a851f", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "n = gets.to_i\ns = gets.chomp.split ''\nc = 0\ns.each do |x|\n  c += x == '+'  ? 1 : -1\n  c = [c, 0].max\nend\nputs c\n", "lang_cluster": "Ruby", "tags": ["math", "implementation"], "code_uid": "8384fa7612f71dffb6437b5d1fba139c", "src_uid": "a593016e4992f695be7c7cd3c920d1ed", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "MOD = 10**9 + 7\ndef modpow(x,n)\n  ret = 1\n  while n > 0\n    ret = ret*x % MOD if n&1 == 1\n    x = x*x % MOD\n    n >>= 1\n  end\n  return ret\nend\n\nn,m = gets.split.map(&:to_i)\nmx = [n,m].max\ndp = Array.new(mx+1){[0,0]}\ndp[1] = [2,0]\n1.upto(mx-1) do |i|\n  dp[i+1][0] = (dp[i][0] + dp[i][1]) % MOD\n  dp[i+1][1] = (dp[i][0]) % MOD\nend\nsumn = (dp[n][0] + dp[n][1]) % MOD\nsumm = (dp[m][0] + dp[m][1]) % MOD\nans = (sumn + summ - 2) % MOD\np ans", "lang_cluster": "Ruby", "tags": ["math", "dp", "combinatorics"], "code_uid": "220d36dd67123010b009a797ace21da2", "src_uid": "0f1ab296cbe0952faa904f2bebe0567b", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "def gao(n)\n    unless $h[n]\n        t = 1\n        d = 2\n        while d * d <= n\n            if n % d == 0\n                t = [t, gao(d), gao(n / d)].max\n            end\n            d += 1\n        end\n        $h[n] = n + t\n    end\n    return $h[n]\nend\n\n$h = {1 => 1}\nn = gets.to_i\np gao(n)\n", "lang_cluster": "Ruby", "tags": ["number theory"], "code_uid": "dd829a9e8aa53437d1453b211571dbc7", "src_uid": "821c0e3b5fad197a47878bba5e520b6e", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "#!/usr/bin/env ruby\n\n# 2 3   5   7\n#     4   6   8 9\n\n# 4! = 3! * 2 * 2\n# 6! = 5! * 3!\n# 8! = 7! * 2 * 2 * 2\n# 9! = 7! * 3! * 3! * 2\n\ngets\na = gets.chomp.chars.map(&:to_i)\n\nputs a.map { |x|\n  case x\n  when 2, 3, 5, 7\n    [x]\n  when 4\n    [3, 2, 2]\n  when 6\n    [5, 3]\n  when 8\n    [7, 2, 2, 2]\n  when 9\n    [7, 3, 3, 2]\n  else\n    []\n  end\n}.inject(:+).sort { |x,y| y <=> x }.join\n", "lang_cluster": "Ruby", "tags": ["math", "sortings", "greedy"], "code_uid": "8ae1a73d55c2263c54965b1693c546fd", "src_uid": "60dbfc7a65702ae8bd4a587db1e06398", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Ruby", "source_code": "a = []\n3.times do\n  a.push(gets.split.map(&:to_i))\nend\na.map!{|b| b.map!{|c| c = c % 2}}\nans = []\n5.times do\n  ans.push([1,1,1,1,1])\nend\n3.times do |i|\n  3.times do |j|\n    if a[i][j] == 1\n      ans[i+1][j+1] = 1 - ans[i+1][j+1]\n      ans[i][j+1] = 1 - ans[i][j+1]\n      ans[i+2][j+1] = 1 - ans[i+2][j+1]\n      ans[i+1][j] = 1 - ans[i+1][j]\n      ans[i+1][j+2] = 1 - ans[i+1][j+2]\n    end\n  end\nend\n3.times do |i|\n  3.times do |j|\n    print ans[i+1][j+1]\n  end\n  print \"\\n\"\nend", "lang_cluster": "Ruby", "tags": ["implementation"], "code_uid": "431fa4d8b80b4d74cf171a48918342a7", "src_uid": "b045abf40c75bb66a80fd6148ecc5bd6", "difficulty": 900.0, "exec_outcome": "PASSED"}