codeforces 789/problem/B [map][坑]

B. Masha and geometric depression
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

坑啊啊啊 ，因为“one by one”WA了一版

#include <bits/stdc++.h>

using namespace std;
map<long long, int>a;

int main()
{
    long long int b1,q,l;int m,g;
    scanf("%lld%lld%lld%d",&b1,&q,&l,&m);
    for(int i=0;i<m;i++)
        scanf("%d",&g),a[g]=1;
    long long int bn=b1,L=l;
    bool inf=false;
    int cnt=0;

    if(b1==0||q==0){
        if(b1<=L&&-b1<=L){
            if(!a[0]){
                puts("inf");
            }else{
                if(a[b1]) puts("0");
                else puts("1");
            }
        }else puts("0");
    }
    else if(q==1){
        if(b1<=L&&-b1<=L){
            if(a[b1]) puts("0");
            else puts("inf");
        }else puts("0");
    }else if(q==-1){
        if(b1<=L&&-b1<=L){
            if(a[b1]&&a[-b1]) puts("0");
            else puts("inf");
        }else puts("0");
    }
    else{
        while(bn<=L&&-bn<=L){
            if(!a[bn]) cnt++;
            bn*=q;
        }
        printf("%d\n",cnt);
    }
    return 0;
}