[BOJ 11522] Sum Kind of Problem

View as PDF

Submit solution

Points: 1
Time limit: 1.0s
Memory limit: 256M

Problem types
Allowed languages
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text

For this problem you will compute various running sums of values for positive integers.

입력 형식

The first line of input contains a single integer P, (1 ≤ P ≤ 10000), which is the number of data sets that follow. Each data set should be processed identically and independently.</p>

Each data set consists of a single line of input. It contains the data set number, K, followed by an integer N, (1 ≤ N ≤ 10000).

출력 형식

For each data set there is one line of output. The single output line consists of the data set number, K, followed by a single space followed by three space separated integers S1, S2 and S3 such that:

  • S1 = The sum of the first N positive integers.
  • S2 = The sum of the first N odd integers.
  • S3 = The sum of the first N even integers.

예제 입력

3
1 1
2 10
3 1001

예제 출력

1 1 1 2
2 55 100 110
3 501501 1002001 1003002

Comments

There are no comments at the moment.