bzoj2793: [Poi2012]Vouchers

#include<iostream> 
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath> 
#include<algorithm> 
#define ll long long
using namespace std;
const int maxn=1000010, inf=1e9;
int n, m, x, cnt;
int now[maxn];
ll num, ans[maxn];
bool lucky[maxn], used[maxn];
inline void read(int &k)
{
    int f=1; k=0; char c=getchar();
    while(c<‘0‘ || c>‘9‘) c==‘-‘&&(f=-1), c=getchar();
    while(c<=‘9‘ && c>=‘0‘) k=k*10+c-‘0‘, c=getchar();
    k*=f;
}
int main()
{
    read(n);
    for(int i=1;i<=n;i++) read(x), lucky[x]=1; 
    for(int i=1;i<=1000000;i++) now[i]=i;
    read(m); num=0;
    for(int i=1;i<=m;i++)
    {
        read(x);
        for(int j=1;j<=x;j++)
        {
            for(int k=now[x];k<=1000000;k+=x, now[x]=k)
                if(!used[k]) break;
            if(now[x]>1000000)break;
            used[now[x]]=1;
            if(lucky[now[x]]) ans[++cnt]=num+j;
        }
        num+=x;
    }    
    printf("%d\n", cnt);
    for(int i=1;i<=cnt;i++) printf("%lld\n", ans[i]); 
}