1
2
3
4
5
6
7
8
9
#include <iostream> 
using namespace std;
int main ()
 {
        int i;
        for (i = 0; i <= 100; i++)
 {
               if ((i % 15) == 0)
                       cout << "FB" << " ";
 ...

1
2
3
4
5
6
7
8
9
#include <iostream> 
using namespace std;
int main ()
 {
        int i;
        for (i = 0; i <= 100; i++)
 {
               if ((i % 15) == 0)
                       cout << "FB" << " ";
 ...

1
2
3
4
5
6
7
8
9
#!/usr/bin/env ruby
 
def fizzbuzz a, b, n
  (1..n).map do |x|
    case
      when x % (a * b) == 0 then 'FB'
      when x % a == 0 then 'F'
      when x % b == 0 then 'B'
      else x
 ...

1
2
3
4
5
6
7
8
9
#!/usr/bin/env ruby
 
=begin
 
= Fizz Buzz
 
CodeEval [http://www.codeeval.com/open_challenges/1/]
 
1. Input example
 ...

1
2
3
4
5
6
7
8
9
def fact(n)
  if n == 0
    1
  else
    n * fact(n-1)
  end
end
 
print fact(100)

1
2
3
vertexTemplateTable = [-1.0..1.0,-1.0..1.0,0.0..1.0,1.0]
 
puts vertexTemplateTable 

1
vertexTemplateTable = [-1.0..1.0,-1.0..1.0,0.0..1.0,1.0]

1
2
3
4
5
def h(name)
 puts "hi #{name}"
end
 
h("yet")

1
2
3
4
5
6
7
8
9
def sieve_of_eratosthenes(max)
  arr=(2..max).to_a
  (2..Math::sqrt(max)).each do |i|
     arr.delete_if {|a|a % i == 0 && a!=i}
   end
   arr
end
 
# Example Call

1
2
3
4
5
6
7
8
9
def sieve_of_eratosthenes(max)
  arr=(2..max).to_a
  (2..Math::sqrt(max)).each do |i|
     arr.delete_if {|a|a % i == 0 && a!=i}
   end
   arr
end
 
# Example Call

1
2
3
4
5
6
7
8
9
def sieve_of_eratosthenes(max)
  arr=(2..max).to_a
  (2..Math::sqrt(max)).each do |i|
     arr.delete_if {|a|a % i == 0 && a!=i}
   end
   arr
end
 
# Example Call

1
2
3
4
5
6
7
8
9
t = Integer(gets)
while t > 0
a4 = []
a7 = []
n = Integer(gets)
i = a4.length + 1
if n > a4.length
while i <= n
a4 << i.to_s.count("4")
 ...

1
2
3
4
5
6
7
8
9
t = Integer(gets)
while t > 0
a4 = []
a7 = []
n = Integer(gets)
i = a4.length + 1
if n > a4.length
while i <= n
a4 << i.to_s.count("4")
 ...

1
2
3
4
5
6
7
8
9
t = Integer(gets)
while t > 0
a4 = []
a7 = []
n = Integer(gets)
i = a4.length + 1
if n > a4.length
while i <= n
a4 << i.to_s.count("4")
 ...

1
2
3
4
5
6
7
8
9
t = Integer(gets)
while t > 0
a4 = []
a7 = []
n = Integer(gets)
i = a4.length + 1
if n > a4.length
while i <= n
a4 << i.to_s.count("4")
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...

1
2
3
4
5
6
7
8
9
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
 ...