//提供一段判素数函数： bool prime(int n) { if(n<2) return 0; int q=sqrt(n);//只取一次平方 速度快一半 for(int i=2;i<=q;i++) { if(n%i==0) return 0; } return 1; }
By signing up a CZOJ universal account, you can submit code and join discussions in all online judging services provided by us.
Using your CZOJ universal account
周东发
LV 6
@ 2023-12-12 19:20:29