题目连接

题面：

代码：

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<vector>
#define ll long long
#define llu unsigned ll
#define pr make_pair
using namespace std;
const int maxn=3001000;
ll inv[maxn];

int main(void)
{
    int n,p;
    scanf("%d%d",&n,&p);
    printf("%lld\n",inv[1]=1);
    for(int i=2;i<=n;i++)
    {
        inv[i]=(p-p/i)*inv[p%i]%p;
        printf("%lld\n",inv[i]);
    }
    return 0;
}