C :

int main()
{
    int flag=0,i,x,a[7],b[7];
    for(i=0;i<7;i++)
     scanf("%d %d",&a[i],&b[i]);
    for(i=0;i<7;i++)
    {
       if(a[i]+b[i]>8)
       {
          flag=1;
          x=i+1;
          break;
	   }
    }
    if(flag)
      printf("%d",x);
    else 
      printf("0"); 
	return 0;
}

C++ :

#include<iostream>
using namespace std;
int main()
{
start:	int day=1;
	int a,b;
	int unhpy=0;
	int ex=0;
	while (cin>>a>>b)
	{
		int tot=a+b;
		if (tot>8 && tot-8>unhpy) 
			{
				unhpy=tot-8;ex=day;
			}
		if (++day==8) 
		{
			if (unhpy==0) cout<<0<<endl;
			else cout<<ex<<endl;
		}
	} 
	return 0;
} 

Pascal :

program unhappy; {writen by lxq 2004.11.20}
var a,i,x,y,d,max : byte;
begin
  d := 0; max :=8;
  for i := 1 to 7 do begin
    readln(x,y);
    a := x+y;
    if a>max then 
    begin
      max :=a; d := i;
    end;
  end;
  writeln(d);
end.

Java :

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input=new Scanner(System.in);
		int n=7;
		int s=0;
		int max=0;
		int min=-1;
		while(n-->0) {
			int x=input.nextInt();
			int sum=input.nextInt();
			s++;
			if(x+sum>=9&&min!=max){
				max=s;
				min=s;
			}
		}
		System.out.println(max);
	}

}