SPOJ.com - Problem ARITHSEQ

ARITHSEQ - Arithmetic sequence

no tags

Given an arithmetic sequence a, a + d, a + 2*d, ..., a + n*d.

Count the number of digit x appearing in the given sequence.

- A line containing a, d, n, x.

- The result found.

Input:
10 5 2 0

Output:
2

- 1 ≤ a, n ≤ 10⁹.
- 1 ≤ d ≤ 20,000.



	pranoym14: 2016-07-27 15:05:24 Why there is a TLE error given by using C ?
	sriankit: 2013-07-02 14:35:01 what will be ans for 5 5 3 0 2 or 3?? EDIT : ans is 2 Last edit: 2013-07-02 20:14:35
	:D: 2010-12-30 06:20:17 It's five. Why would it be one?
	saibharath: 2010-12-29 19:23:52 I HAVE A DOUBT. IF INPUT IS 20 1 3 2 WHAT MUST BE THE ANSWER. IT MUST BE 1 OR 5
	Karpovych Artem: 2009-07-19 14:18:42 How many test cases in this problem? Only one? Re: as the problem said, input contains "a line", so it contains only one single test case :-) Last edit: 2009-07-23 14:41:22
	Vaibhav : 2009-07-17 12:04:41 Hi, are we supposed to return the first location of the digit x? This is what I understand: Sequence: 101520, x=0, first occurence of x is 2nd position, hence answer is 2. Is this right? Re: "the number of.." means the "amount", for example, x=0 appears twice in the arithmetic sequence: 20 25 30 (a=20,d=5,n=2,x=0) ;-) Last edit: 2009-07-17 14:54:03
	piyifan: 2009-07-17 03:42:33 Can x>9 or x<0? Re: x is a "digit", so x = 0..9 Last edit: 2009-07-17 05:52:22

Added by:	AnhDQ
Date:	2009-07-16
Time limit:	0.100s-1s
Source limit:	50000B
Memory limit:	1536MB
Cluster:	Cube (Intel G860)
Languages:	All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:	Mr Tuan Khuc Anh - NTU (Singapore)