【洛谷p2312】解方程

（清明培训qwq，明天就要回学校了qwq拒绝）

行吧我洛谷都四天没碰了

解方程【传送门】

算法标签：

（作为一个提高+省选-的题）

---

丁大佬真的很有幽默感emmm：

#include <cstdio>
const long long Mod = (int)1e9 + ;
const int maxN =  + ;
const int maxM = (int)1e6 + ;

int N, M;
int arr[maxN];

void Fscan(int &tmpX) {
    int Ch = getchar(), F = ' ';
    long long tmp = ;
    while (Ch < '' || Ch > '') {
        F = Ch;
        Ch = getchar();
    }
    while ('' <= Ch && Ch <= '') {
        tmp = ((tmp << ) + (tmp << ) + Ch - '') % Mod;
        Ch = getchar();
    }
    tmpX = (int)(F == '-' ? -tmp : tmp);
}
void Read() {
    scanf("%d%d", &N, &M);
    for (int i = ; i <= N; ++i)
        Fscan(arr[i]);
}

int T, Que[maxM];
long long Calc(const int &X) {
    long long Ans = ;
    for (int i = N; i; --i)
        Ans = ((Ans + (long long)arr[i]) * (long long)X) % Mod;
    Ans = (Ans + (long long)arr[]) % Mod;
    return Ans;
}
void Solve() {
    for (int i = ; i <= M; ++i)
        if (!Calc(i))
            Que[++T] = i;
}
int main() {
    Read();
    Solve();
    printf("%d\n", T);
    for (int i = ; i <= T; ++i)
        printf("%d\n", Que[i]);
    return ;
}