把第一行去掉。
by dxy2020 @ 2022-05-13 19:39:44
```cpp
#pragma GCC optimize(3)
```
洛谷不支持这种方式,会CE
by 王梓涵 @ 2022-05-13 19:43:33
头文件去掉了还是这样
by HotDogSeller @ 2022-05-13 19:46:05
![就是这个样子](https://cdn.luogu.com.cn/upload/image_hosting/5tm1n59c.png)
by HotDogSeller @ 2022-05-13 19:49:06
@[热翻天564](/user/540822) 要去掉吸臭氧的代码(洛谷OJ不允许)
```cpp
#pragma GCC optimize(3)
```
by ajahjahah @ 2022-05-13 19:58:23
@[lao_ba](/user/357378) 已经去掉了
by HotDogSeller @ 2022-05-13 19:59:35
去掉还是WA
by njwza88 @ 2022-05-13 19:59:54
```cpp
#include<iostream>
#include<algorithm>
#include<set>
#include<cmath>
#include<memory.h>
#include<queue>
#include<cstdio>
#include<vector>
#define int long long
using namespace std;
inline int read(){
int f=1,x=0;
char c;
c=getchar();
if(c=='-'){
f=-1;
c=getchar();
}
while('0'<=c&&c<='9'){
x*=10;
x+=(c-'0');
c=getchar();
}
return x*f;
}
int n,p;
int inv[6000005]={0,1};
int mod(int a,int b){
return (a%b+b)%b;
}
int fac(int a,int p){
if(inv[a]){
return inv[a];
}
inv[a]=mod(-p/a*fac(p%a,p),p);
return inv[a];
}//求a在mod p逆元
signed main(){
n=read();
p=read();
for(int i=1;i<=n;i++){
cout<<fac(i,p)<<endl;
}
return 0;
}
```
by HotDogSeller @ 2022-05-13 20:00:24
你也可以拿去试试,编译失败
by HotDogSeller @ 2022-05-13 20:01:00
应该是洛谷评测级出问题了()
by ajahjahah @ 2022-05-13 20:02:29