hossy online - といぼっくす

#include <stdio.h>
#include <stdlib.h>
 
int main(void) {
  const int n = 20;
  long long ary[n+1][n+1];
  int i, j;
  for (i = 0; i <= n; i++) {
    for (j = 0; j <= n; j++) {
      if (i == 0 || j == 0) {
        ary[i][j] = 1;
      } else {
        ary[i][j] = ary[i - 1][j] + ary[i][j - 1];
      }
    }
  }
  printf("%lld\n", ary[n][n]);
  return EXIT_SUCCESS;
}

public class Euler015 {
  public static void main(String[] args) {
    final int n = 20;
    long[][] ary = new long[n+1][n+1];
    for (int i = 0; i <= n; i++) {
      for (int j = 0; j <= n; j++) {
        if (i == 0 || j == 0) {
          ary[i][j] = 1;
        } else {
          ary[i][j] = ary[i - 1][j] + ary[i][j - 1];
        }
      }
    }
    System.out.println(ary[n][n]);
  }
}

#include "stdafx.h"
#include <iostream>
 
int _tmain(int argc, _TCHAR* argv[])
{
  const int n = 20;
  long long ary[n+1][n+1];
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      if (i == 0 || j == 0) {
        ary[i][j] = 1;
      } else {
        ary[i][j] = ary[i - 1][j] + ary[i][j - 1];
      }
    }
  }
  std::cout << ary[n][n];
  return 0;
}

<?php
$n = 20;
$ary = array();
for ($i = 0; $i <= $n; $i++) {
  $ary[$i] = array();
  for ($j = 0; $j <= $n; $j++) {
    if ($i == 0 || $j == 0) {
      $ary[$i][$j] = 1;
    } else {
      $ary[$i][$j] = $ary[$i-1][$j] + $ary[$i][$j-1];
    }
  }
}
echo $ary[$n][$n];
?>

<?php
function factorial($n) {
  $r = 1;
  for ($i = 1; $i <= $n; $i++) {
    $r = bcmul($r, $i);
  }
  return $r;
}
 
$n = 20;
$t = factorial($n);
echo bcdiv(factorial(2*$n), bcmul($t, $t));
?>

Module Module1
 
  Sub Main()
    Const n As Integer = 20
    Dim ary(n, n) As Long
    For i = 0 To n
      For j = 0 To n
        If (i = 0 Or j = 0) Then
          ary(i, j) = 1
        Else
          ary(i, j) = ary(i - 1, j) + ary(i, j - 1)
        End If
      Next
    Next
    Console.WriteLine(ary(n, n))
  End Sub
 
End Module

namespace Euler015Cs
{
  class Program
  {
    static void Main(string[] args)
    {
      const int n = 20;
      long[,] ary = new long[n+1, n+1];
      for (int i = 0; i <= n; i++)
      {
        for (int j = 0; j <= n; j++)
        {
          if (i == 0 || j == 0)
          {
            ary[i, j] = 1;
          }
          else
          {
            ary[i, j] = ary[i - 1, j] + ary[i, j - 1];
          }
        }
      }
      System.Console.WriteLine(ary[n, n]);
    }
  }
}

using System;
using System.Numerics;
 
namespace Euler015Cs2
{
  class Program
  {
    static BigInteger factorial(int n)
    {
      BigInteger r = 1;
      for (int i = 1; i <= n; i++)
      {
        r *= i;
      }
      return r;
    }
 
    static void Main(string[] args)
    {
      const int n = 20;
      BigInteger t = factorial(n);
      System.Console.WriteLine(factorial(2 * n) / (t * t));
    }
  }
}

n=20
ary=[]
for i in range(n+1):
  ary.append([])
  for j in range(n+1):
    if (i == 0 or j == 0):
      ary[i].append(1)
    else:
      ary[i].append(ary[i-1][j] + ary[i][j-1])
 
print(ary[n][n])

$n = 20;
@ary = ();
 
for ($i = 0; $i <= $n; $i++) {
  for ($j = 0; $j <= $n; $j++) {
    if ($i == 0 || $j == 0) {
      $ary[$i][$j] = 1;
    } else {
      $ary[$i][$j] = $ary[$i-1][$j] + $ary[$i][$j-1];
    }
  }
}
print $ary[$n][$n];

<script language="JavaScript">
<!--
var n = 20;
var ary = new Array(n+1);
for (var i = 0; i <= n; i++) {
  ary[i] = new Array(n+1);
  for (var j = 0; j <= n; j++) {
    if (i == 0 || j == 0) {
      ary[i][j] = 1;
    } else {
      ary[i][j] = ary[i-1][j] + ary[i][j-1];
    }
  }
}
alert(ary[n][n]);
// -->
</script>

n=20
ary=[]
(n+1).times do |i|
  ary.push []
  (n+1).times do |j|
    if (i.zero? || j.zero?)
      ary[i].push 1
    else
      ary[i].push ary[i-1][j] + ary[i][j-1]
    end
  end
end
puts ary[n][n]

n=20
def factorial(n)
  (1..n).inject(1){|r,i| r*i}
end
puts factorial(n*2)/factorial(n)**2

package main
import ("fmt")
func main() {
  n := 20;
  var ary [21][21]int64;  // n+1...
  for i := 0; i <= n; i++ {
    for j := 0; j <= n; j++ {
      if (i == 0 || j == 0) {
        ary[i][j] = 1
      } else {
        ary[i][j] = ary[i-1][j] + ary[i][j-1]
      }
    }
  }
  fmt.Print(ary[n][n])
}

(define (fact_impl n r)
  (if (= n 1)
    r
    (fact_impl (- n 1) (* r (- n 1)))))
(define (factorial n)
  (fact_impl n n))
(define (func n)
  (let ((t (factorial n)))
    (/ (factorial(* n 2)) (* t t))))
(func 20)

import std.stdio;
 
void main()
{
  const int n = 20;
  long[n+1][n+1] ary;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      if (i == 0 || j == 0) {
        ary[i][j] = 1;
      } else {
        ary[i][j] = ary[i - 1][j] + ary[i][j - 1];
      }
    }
  }
  writefln(ary[n][n]);
}

import Array
func :: Int -> Integer
func n = a!(n, n) where
  a = array ((0, 0), (n, n)) (
    [((0, j), 1) | j <- [0..n]] ++
    [((i, 0), 1) | i <- [1..n]] ++
    [((i, j), a!(i-1, j) + a!(i, j-1)) | i <- [1..n], j <- [1..n]])
 
func 20

func :: Integer -> Integer
func n = factorial(n*2) `div` (factorial(n) * factorial(n)) where
  factorial :: Integer -> Integer
  factorial 1 = 1
  factorial n = n * factorial(n-1)
 
func 20