1. 

/**
* Angewandte Mathematik, SS09, IFB 2C
* ACM Problem #485 (Pascal's Triangle of Death)
* Link: http://uva.onlinejudge.org/external/4/485.pdf
*
* @author Christian Posselt
* @author Jonathan Schubert
* @version 1.1, 05/14/2009
*
* Status : Accepted
* Runtime: 0.540
*/

import java.math.BigInteger;

class Main
{
public static void main(String[] args)
{

StringBuilder builder = new StringBuilder();
BigInteger[] numbers = null;
BigInteger upperLimit = new BigInteger("10");
upperLimit = upperLimit.pow(60);

for(int i = 1; numbers == null || 1 > numbers[numbers.length/2].compareTo(upperLimit); i++)
{

BigInteger[] previos = new BigInteger[i-1];
if(numbers != null)
System.arraycopy(numbers, 0, previos, 0, numbers.length);
numbers = new BigInteger[i];
numbers[0] = new BigInteger("1");
numbers[numbers.length-1] = new BigInteger("1");
for(int outer = 0; outer < previos.length-1; outer ++)
numbers[outer+1] = previos[outer].add(previos[outer+1]);

for (BigInteger n: numbers)
builder.append(n.toString()+" ");

builder.deleteCharAt(builder.length()-1);
builder.append("\n");

}

System.out.print(builder.toString());
}

}

2.


/**
* Angewandte Mathematik, SS09, IFB 2C
* ACM Problem: Pascal's Triangle of Death (485)
* @author Christian Mitterreiter
* @author Rolf Luigs
* @version 1.0, 05/12/2009
* Status : Accepted
* Runtime: 0.800
*/

import java.util.*;
import java.math.*;

public class Main {

public static void main(String[] args) {

ArrayList <BigInteger> list = new ArrayList<BigInteger>();
list.add(0,new BigInteger("1"));
list.add(1,new BigInteger("2"));
list.add(2,new BigInteger("1"));
int lang;
System.out.println("1");
System.out.println("1 1");
System.out.println("1 2 1");

for (int kk=0;kk<=201;kk++)
{
lang=list.size();
list.add(new BigInteger("1"));
System.out.print("1");
for (int j=lang-1;j>0;j--)
{
list.set(j,(list.get(j-1).add(list.get(j))));
System.out.print(" " +list.get(j));
}

System.out.println(" 1");
}
System.exit(0);
}
}


3.

/**
* Angewandte Mathematik, SS09, IFB 2C
* ACM Problem #485 Pascal's Triangle of Death
* Link: http://uva.onlinejudge.org/external/4/485.pdf
*
* @author Mohr
* @author Schirm
* @author Mathauser
* @version 1.0, 07.06.2009
*
* Status : Accepted
* Runtime: 0.824
*/

import java.math.BigInteger;
import java.util.ArrayList;


public class Main
{
public static void main(String... args)
{

boolean running = true;

// 1060
final BigInteger breakNumber = new
BigInteger("1000000000000000000000000000000000000000000000000000000000000");

ArrayList<BigInteger> lastLine;
ArrayList<BigInteger> currentLine = new ArrayList<BigInteger>();
BigInteger one = new BigInteger("1");
currentLine.add(one);

System.out.println("1");

while(running)
{
lastLine = currentLine;
currentLine = new ArrayList<BigInteger>();
currentLine.add(one);

System.out.print("1 ");
for (int i = 1; i < lastLine.size(); i++)
{
currentLine.add(lastLine.get(i-1).add(lastLine.get(i)));
System.out.print(currentLine.get(i)+" ");
if (breakNumber.compareTo(currentLine.get(i)) != 1)
running = false;
}
currentLine.add(one);
System.out.println("1");
}
}
}