SPOJ.com - Problem EASYMATH

EASYMATH - EASY MATH

no tags

You will be given 4 numbers: n m a d.

find count of numbers between n and m (inclusive) not divisible by (a) or (a+d) or (a+2d) or (a+3d) or (a+4d).

first line has number t - number of test cases.

each test case has 4 numbers n m a d.

Single line having single number giving the count.

1 <= n <= m <= 2^32

1 <= a <= 2^32

1 <= d <= 2^32

2 <= t <= 100

Input:
3
1 10 2 2
20 100 3 3
100 1000 4 5

Output:
5
54
543

Also try the challenge version at www.spoj.com/problems/EASYMATC/

< Previous 1 2 3 4 5 Next >

	Hussain: 2014-07-27 16:27:42 Very nice problem
	excursionist: 2014-05-19 10:10:30 @vijay:= ur count variable containts old value update it to 0 after printing it for each test case
	pvkcse: 2014-05-17 12:28:17 Any tricky case please...getting o/p in ideone but here it is WA... <snip> Last edit: 2023-05-18 20:38:00
	785227: 2014-02-21 16:50:43 Please check my submission ID 11100462 Getting WA again and again
	pranjuldb: 2013-07-30 18:43:15 nice question... :)
	Aayush Agarwal: 2013-06-01 15:24:21 @DEVIL D : the answer for the first test case should be 10 because it is said which are not divisible by a or a+d or a+2d.... so numbers upto 9 are not divisible by 10 and 10 is not divisible by 6 or 8 or 4.. so every number is counted in this manner. Last edit: 2013-06-01 15:25:22
	Saurabh Jain: 2012-07-29 13:04:43 @Devil D: i have checked a lot of test cases correctly on my system but here i'm getting WA.... could you please tell me reason for the same or test case for which my algo fails?
	Abhishek Mishra: 2012-07-01 05:51:45 i think there is no test case for any extreme one..;)
	Better late than never !!!: 2012-06-05 04:22:24 It's not at all easy :O
	Ravi kishore : 2012-06-01 14:43:33 Nice problem!