|
||||||||||
Data ProcessingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1539 Accepted Submission(s): 533 Problem Description Chinachen is a football fanatic, and his favorite football club is Juventus fc. In order to buy a ticket of Juv, he finds a part-time job in Professor Qu¡¯s lab. And now, Chinachen have received an arduous task¡ª¡ªData Processing. The data was made up with N positive integer (n1, n2, n3, ¡ ), he may calculate the number , you can assume mod N =0. Because the number is too big to count, so P mod 1000003 is instead. Chinachen is puzzled about it, and can¡¯t find a good method to finish the mission, so he asked you to help him. Input The first line of input is a T, indicating the test cases number. There are two lines in each case. The first line of the case is an integer N, and N<=40000. The next line include N integer numbers n1,n2,n3¡ (ni<=N). Output For each test case, print a line containing the test case number ( beginning with 1) followed by the P mod 1000003. Sample Input
Sample Output
Hint Hint: You may use ¡°scanf¡± to input the data. Source | ||||||||||
|