A Puzzle In ACM Sample I/O

      As presented, ACM problems all have Sample I/O. But I am confused by them. 

      For instance, in the problem 1002, which can be found on this website http://acm.hdu.edu.cn/showproblem.php?pid=1002 , yet I come up with the solution, it seems that we are required to input all the integers at once, and output in the same way. 

     And I don't know whether my solution is correct.

      Here gives my code:

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