1.

/**
* ACM Training 2009
* ACM Problem #485 - Pascal's Triangle of Death
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=49
*
* @author Felix Dietrich
* @version 1.0, 09/21/2009
*
* Methode: BigInteger
* Status : Accepted
* Runtime: 0.548
*/

import java.math.BigInteger;

public class Main
{
public static void main(String...s)
{
BigInteger[] lastLine = new BigInteger[]{BigInteger.ONE,BigInteger.ONE};
BigInteger[] currentLine;
boolean breakAfterThisLine = false;
StringBuffer sb;
System.out.println(1);
System.out.println("1 1");

while(true)
{
currentLine = new BigInteger[lastLine.length+1];

currentLine[0] = BigInteger.ONE;

// start with 1, add up numbers in the upper row
sb = new StringBuffer("1 ");
for(int i=1; i<currentLine.length-1; i++)
{
currentLine[i] = lastLine[i-1].add(lastLine[i]);
sb.append(currentLine[i]);
sb.append(" ");
if(currentLine[i].bitLength() > 199)
breakAfterThisLine = true;
}
currentLine[currentLine.length-1] = BigInteger.ONE;
sb.append("1");
System.out.println(sb.toString());

if(breakAfterThisLine)
break;

lastLine = currentLine;
}
}
}