## DMOPC '19 Contest 1 P1 - Test Scores

View as PDF

Points: 5
Time limit: 2.0s
Memory limit: 64M

Author:
Problem type

Veshy is suffering in AP Physics! He has a series of tests coming up and he has come up with four parameters describing each test:

• which indicates the number of problems on the -th test
• which indicates the number of points Veshy gets for one correct answer
• which indicates the number of points Veshy loses for an incorrect or unanswered question
• which indicates the score Veshy would like to earn on the -th test

For the -th test, output the minimum number of questions Veshy has to answer correctly in order to get at least marks. If Veshy's standards are too high and he cannot get marks on the -th test, then output -1.

In all tests,

#### Input Specification

The first line contains one integer, , the number of tests to follow.
The next lines contain four space-separated integers, .

#### Output Specification

Output lines. The -th line should contain one integer, the answer to the -th test.

#### Sample Input

5
1 4 2 5
9 2 6 4
2 9 3 5
3 5 2 10
8 2 5 7

#### Sample Output

-1
8
1
3
7

• commented on Oct. 29, 2020, 5:28 p.m. edit 3

Does anyone know how to pass Case #21?

I checked whether my variable for the amount of questions was an integer or not, and I also fixed the integer division that was occurring. (I am using C++)

• commented on Oct. 6, 2019, 12:59 p.m.

Somebody help check my code plzz

• commented on Oct. 12, 2019, 6:07 p.m. edited

The value of b*n can go up to 10^18, which exceeds the maximum value for int (2^31-1) in java. Edit: Also you may want to see if there is a way to get the value of j in a faster way.

• commented on Oct. 6, 2019, 1:16 p.m.