1. JAVA, Gunnar Hage


/**
* FWP-Fach: ACM programming Contest WS 08/09 "485 Pascals Triangle of Death"
* Verdict: Accepted / run Time: 0.510
*
* Gunnar Hage, gunnarhage@gmx.de
* AP5(IFB5A) Dez. 2008
*
* Problembeschreibung: http://icpcres.ecs.baylor.edu/onlinejudge/index.php?option=com_onlinejudge&Itemid=8&category=6&page=show_problem&problem=426
*/

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.math.BigInteger;

public class Main {
public static void main(String... args) throws IOException{
int n = 3;
BigInteger ten60 = new BigInteger("1000000000000000000000000000000000000000000000000000000000000");
BigInteger[][] pascal = new BigInteger[206][];
pascal[1] = new BigInteger[]{BigInteger.ONE};
pascal[2] = new BigInteger[]{BigInteger.ONE,BigInteger.ONE};

BufferedWriter br = new BufferedWriter(new OutputStreamWriter(System.out));
br.write("1\n1 1\n");
//ab der zweiten Zeile
do{
pascal[n] = new BigInteger[n];
pascal[n][0] = BigInteger.ONE; // erster und letzter wert in der Zeile.
pascal[n][pascal[n].length-1] = BigInteger.ONE;

//die restlichen zahlen berechnen.
br.write("1 ");
for(int i=1;i<n-1;i++)
{
pascal[n][i] = pascal[n-1][i-1].add(pascal[n-1][i]);
br.write(pascal[n][i] + " ");
}
br.write("1\n");
n++;
}while(pascal[n-1][(n)/2].compareTo(ten60)<0);
br.flush();
br.close();
System.exit(0);
}
}