Sometimes I feel angry to arrange contests, as I am too lazy. Today I am arranging a contest for the AIUB students. So, I made a plan to share some anger with them. While they will be busy with the contest, I will cover their rooms with dusts. And after the contest, they will surely get angry because they would have to clean up quite a bit.

So, at first, I will have to fix the amount of dusts for each student. This amount may not be the same for everyone. Now you are given the amount of dust unit for each student, you have to help me find the total dust unit I have to collect to cause them some pain.

But there is a problem, my random function which generates dust units for students has a bug, it sometimes returns negative numbers. If a student gets a negative number, I think he/she is lucky, the lucky person will have no dusts.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a blank line. The next line contains an integer N (1 ≤ N ≤ 1000), means that there are N students. The next line will contain N integers separated by spaces which denote the dust unit for all students. The dust unit for any student will not contain more than two digits.

Output

For each case print the case number and the total required dust units.

Sample

Sample Input	Sample Output
Click to copy 2 3 1 5 10 2 1 99	Click to copy Case 1: 16 Case 2: 100

Total Submissions

Users Tried

Users Solved

LOJ 1015 - Brush (I)

In this problem, you will be given T test cases. Each test case begins with a blank line followed by an integer N. The next line contains N space-separated integers. Your task is to print out the sum of those N integers, ignoring any negative integers.

The problem is pretty straightforward. However, some people might find it difficult to get an Accepted verdict. The reason could be one of the following:

Considering negative integers during summation
Failing to provide proper output format
Missing new line on each line

If you are still stuck with this problem, check the codes below:

C

#include <stdio.h>
int main() {
  int T, N, num, sum;
  scanf("%d", &T);
  for (int i = 1; i <= T; i++) {
    scanf("%d", &N);
    sum = 0;
    for (int j = 1; j <= N; j++) {
      scanf("%d", &num);
      // negative number should be ignored, zero does not affect the sum
      if (num > 0) {
        sum += num;
      }
    }
    printf("Case %d: %d\n", i, sum);
  }
  return 0;
}

Java

package com.loj.volume;

import java.util.Scanner;

class Brush {
  public static void main(String[] args) throws Exception {
    Scanner input = new Scanner(System.in);
    int T = input.nextInt();
    for (int i = 1; i <= T; i++) {
      int N = input.nextInt();
      int num, sum = 0;
      for (int j = 1; j <= N; j++) {
        num = input.nextInt();
        // negative number should be ignored, zero does not affect the sum
        if (num > 0) {
          sum += num;
        }
      }
      System.out.printf("Case %d: %d\n", i, sum);
    }
  }
}

Tutorial source