The Rating Dilemma codechef solution in c++

 

The Rating Dilemma Problem Code: RATINGSubmit (Practice)

Chef really likes to compete on Codechef, and he has gained an impressive rating of X$X$, where X>0$X>0$. There is also a parallel universe, where ratings on Codechef are negative instead. The only thing that remains unchanged in the parallel universe is Chef's love for competing on Codechef. Chef's rating on Codechef in the parallel universe is Y$Y$, where Y<0$Y<0$.

Due to some cosmic event, the parallel universe has been destroyed, resulting in Chef forgetting both X$X$ and Y$Y$. He only remembers the sum S=X+Y$S=X+Y$. He wonders what the maximum possible product of his ratings is, given that he knows the sum of his ratings.

Input Format

• The first line of input will contain an integer T$T$ — the number of test cases. The description of T$T$ test cases follows.
• The first and only line of each test case contains an integer S$S$, the sum of Chef's ratings.

Output Format

• For each test case, output the maximum possible product of Chef's ratings, given that he knows the sum of his ratings.

Constraints

• 1≤T≤103$1\le T\le {10}^3$
• 0≤S≤109$0\le S\le {10}^9$

Subtasks

Subtask #1 (100 points): Original constraints

Sample Input 1 

2
0
1

Sample Output 1 

-1
-2

Explanation

Test case 1$1$: We have X>0$X>0$ and X+Y=0$X+Y=0$. This implies that Y=−X$Y=-X$. The product of ratings is −X2$-X^2$, and the maximum possible product is −1$-1$.

solution:

#include<iostream>
#include<algorithm>
#include<vector>
#define ll long long
using namespace std;

void solve()
{
	ll n;
	cin >> n;
	ll to = n + 1;
	cout << to * -1 << "\n";
}

int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	return 0;
}