简单模拟——Codeforces 789/B

##题目：
http://codeforces.com/contest/789/problem/B

               **#B. Masha and geometric depression**

                          time limit per test
                                1 second
                        memory limit per test
                           256 megabytes
                                input
                             standard input
                                 output
                            standard output

Masha really loves algebra. On the last lesson, her strict teacher Dvastan gave she new exercise.

You are given geometric progression b defined by two integers b1 and q. Remind that a geometric progression is a sequence of integers b1, b2, b3, …, where for each i > 1 the respective term satisfies the condition bi = bi - 1·q, where q is called the common ratio of the progression. Progressions in Uzhlyandia are unusual: both b1 and q can equal 0. Also, Dvastan gave Masha m “bad” integers a1, a2, …, am, and an integer l.

Masha writes all progression terms one by one onto the board (including repetitive) while condition |bi| ≤ l is satisfied (|x| means absolute value of x). There is an exception: if a term equals one of the “bad” integers, Masha skips it (doesn’t write onto the board) and moves forward to the next term.

But the lesson is going to end soon, so Masha has to calculate how many integers will be written on the board. In order not to get into depression, Masha asked you for help: help her calculate how many numbers she will write, or print “inf” in case she needs to write infinitely many integers.

Input

The first line of input contains four integers b1, q, l, m (-109 ≤ b1, q ≤ 109, 1 ≤ l ≤ 109, 1 ≤ m ≤ 105) — the initial term and the common ratio of progression, absolute value of maximal number that can be written on the board and the number of “bad” integers, respectively.

The second line contains m distinct integers a1, a2, …, am (-109 ≤ ai ≤ 109) — numbers that will never be written on the board.

Output

Print the only integer, meaning the number of progression terms that will be written on the board if it is finite, or “inf” (without quotes) otherwise.

Examples
Input

3 2 30 4
6 14 25 48

Output

3

Input

123 1 2143435 4
123 11 -5453 141245

Output

0

Input

123 1 2143435 4
54343 -13 6 124

Output

inf

Note

In the first sample case, Masha will write integers 3, 12, 24. Progression term 6 will be skipped because it is a “bad” integer. Terms bigger than 24 won’t be written because they exceed l by absolute value.

In the second case, Masha won’t write any number because all terms are equal 123 and this is a “bad” integer.

In the third case, Masha will write infinitely integers 123.

##AC代码：

#include <bits/stdc++.h>

using namespace std;

int  b1,q,l,m,ans=0;
set <int > cnt;
int main()
{
    int t;
    cin >> b1 >> q >> l >> m;
    for (int i = 0; i < m; i++)
        {
            scanf("%d",&t);
            cnt.insert(t);
        }
    if (b1 == 0)
    {
        if (cnt.count(0) == 0)  cout << "inf" <<endl;
        else cout << "0" <<endl;
    }
    else if(q == 0)
    {
        if (cnt.count(b1)==0 && abs(b1) <= l)
        {
            if (cnt.count(0) == 0)  cout << "inf" <<endl;
            else cout << "1" <<endl;
        }
        else {
            if (cnt.count(0) == 0 && abs(b1) <= l)  cout << "inf" <<endl;
            else cout << "0" << endl;
        }
    }
    else if (q == 1)
    {
        if (cnt.count(b1)==0 && abs(b1) <= l) cout << "inf" <<endl;
         else cout << "0" <<endl;
    }
    else if (q == -1)
    {
        if (cnt.count(b1)==0&& abs(b1)<= l)   cout <<  "inf";
        else if (cnt.count(b1*(-1))==0&& abs(b1) <= l)  cout << "inf";
        else cout << "0" <<endl;
    }
    else
    {
        for (long long  i = b1; abs(i) <= l; i = i * q)
    {
        if (cnt.count(i) == 0) ans++;
    }
    cout <<ans <<endl;
    }

    return 0;
}

##题解：

1.处理特殊数据 如b1 = 0，q = 0 -1 1 等。

2.b1 = 0 ，q=0 单独判 防止遗漏。

3.注意abs（b1）<=l，在q的特殊情况中。

4.注意累乘时i会超int 所以用longlong。

 for (long long  i = b1; abs(i) <= l; i = i * q)
    {
        if (cnt.count(i) == 0) ans++;
    }