toj_2922.cpp

Tianjin University Online Judge 的80多道题目 .

/*G.   Counting Region
Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 134   Accepted Runs: 16


In this problem you are given a circle and the number of tangent. You have to find out the maximum number of region can exist.

In the above figure the circle is of 6 unit radius and the tangent generates 3 regions.
Input

Each line of input set contains the radius r and the number of tangent t of the circle.
Output

The output file contains the maximum number of region. You are assured that output must be fit in 64 bit unsigned integer.
Sample Input

6 1
12 2

Sample Output

3
6

Problem Setter: M.H. Rasel.


Source:  CUET individual contest
*/
#include<cstdio>
int main()
{
  unsigned long long result , n;
  while ( scanf( "%*[^ ]%llu" , &n ) != EOF )
    {
      result = n * ( n + 3 ) / 2 + n;
      printf( "%llu\n" , result );
    }
  return 0;
}