[Solution] High Accuracy CodeChef Solution

[Solution] High Accuracy CodeChef Solution

There are 100$100$ questions in a paper. Each question carries +3 marks for correct answer, -1 marks for incorrect answer and 0 marks for unattempted question.

It is given that Chef received exactly X$X$ (0≤X≤100)$(0\le X\le 100)$ marks. Determine the minimum number of problems Chef marked incorrect.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

Input Format

• First line will contain T$T$, number of test cases. Then the test cases follow.

Enough Space CodeChef Solution

Chef Drinks Tea CodeChef Solution

High Accuracy CodeChef Solution

K-MEX CodeChef Solution

Xor Permutation CodeChef Solution

Permutation And Median CodeChef Solution

Segmentation Fault CodeChef Solution

• Each testcase contains of a single integer X$X$, marks that Chef received.

Output Format

For each test case, output the minimum number of problems Chef marked incorrect.

Constraints

• 1≤T≤100$1\le T\le 100$
• 0≤X≤10