C :

#include<stdio.h>
int main()
{
	int n,i;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		int a,b,s;
		scanf("%d%d",&a,&b);
		s=a+b;
		printf("Case #%d:\n",i);
		printf("%d\n",s);
	}
	return 0;
}

C++ :

#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
int main()
{
//    freopen("in1.txt","r",stdin);
//    freopen("out1.txt","w",stdout);
    int t,k = 1,a,b;
    cin>>t;
    while(t--)
    {
        cin>>a>>b;
        cout<<"Case #"<<k<<": "<<endl;
        cout<<a+b<<endl;
        k++; 
    }
    cout<<endl;
    return 0;
}

Pascal :

var a,b:array[1..99999]of longint;
    i,n:longint;
begin
  readln(n);
  for i:=1 to n do
  readln(a[i],b[i]);
  for i:=1 to n do
  begin
    writeln('Case #',i,':');
    writeln(a[i]+b[i]);
  end;
end.

Python :

# coding=utf-8
n=int(input())
for i in range(1,n+1):
    z=input()
    m=z.split()
    a=int(m[0])
    b=int(m[1])
    h=a+b
    print('Case #'+str(i)+':')
    print(h)