ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#213771 | #2157. 数列 | jsxheng | 100 | 893ms | 33268kb | C++11 | 1.2kb | 2024-11-13 19:15:02 | 2024-11-13 23:01:07 |
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
namespace IO{
template<typename T> inline void read(T &x){
bool f=1;x=0;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=0;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch&15),ch=getchar();
x=f?x:-x;
}
template<typename T> inline void write(T x){
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(('0'+x%10));
}
template <typename T,typename ...Args> inline void read(T &x,Args &...args){read(x);read(args...);}
template<typename T> inline void write(T x,char c){write(x),putchar(c);}
}
using namespace IO;
const int N=2000005;
int mp[N],p[200005],cnt[N],n,mod;
int qpow(int a,int k){
int res=1;
while(k){
if(k&1)res=res*a%mod;
k>>=1;
a=a*a%mod;
}
return res;
}
signed main(){
read(n,mod);
int pos=0;
for(int i=2;i<=2*n;++i){
if(!mp[i])p[++pos]=i,mp[i]=i;
for(int j=1;j<=pos&&i*p[j]<=2*n;++j){
mp[i*p[j]]=p[j];
if(i%p[j]==0)break;
}
}
for(int i=1;i<=n;++i)cnt[i]=-1;
for(int i=n+2;i<=2*n;++i)cnt[i]=1;
for(int i=2*n;i>1;--i)
if(mp[i]<i)cnt[mp[i]]+=cnt[i],cnt[i/mp[i]]+=cnt[i];
int ans=1;
for(int i=2;i<=2*n;++i)if(mp[i]==i)ans=ans*qpow(i,cnt[i])%mod;
write(ans,'\n');
return 0;
}
Details
小提示:点击横条可展开更详细的信息
Test #1:
score: 5
Accepted
time: 0ms
memory: 1160kb
input:
921 998054347
output:
345389219
result:
ok single line: '345389219'
Test #2:
score: 5
Accepted
time: 0ms
memory: 1156kb
input:
926 998064329
output:
458756691
result:
ok single line: '458756691'
Test #3:
score: 5
Accepted
time: 1ms
memory: 1156kb
input:
1000 998074327
output:
457273797
result:
ok single line: '457273797'
Test #4:
score: 5
Accepted
time: 0ms
memory: 1156kb
input:
952 998084303
output:
329700115
result:
ok single line: '329700115'
Test #5:
score: 5
Accepted
time: 0ms
memory: 1156kb
input:
989 998094347
output:
94788253
result:
ok single line: '94788253'
Test #6:
score: 5
Accepted
time: 1ms
memory: 1156kb
input:
902 998104313
output:
911969455
result:
ok single line: '911969455'
Test #7:
score: 5
Accepted
time: 1ms
memory: 1156kb
input:
914 998114333
output:
827812986
result:
ok single line: '827812986'
Test #8:
score: 5
Accepted
time: 1ms
memory: 1160kb
input:
986 998124313
output:
169699253
result:
ok single line: '169699253'
Test #9:
score: 5
Accepted
time: 1ms
memory: 1156kb
input:
947 998134339
output:
761932751
result:
ok single line: '761932751'
Test #10:
score: 5
Accepted
time: 1ms
memory: 1160kb
input:
934 998144339
output:
42889072
result:
ok single line: '42889072'
Test #11:
score: 5
Accepted
time: 81ms
memory: 33268kb
input:
991572 998154343
output:
277089318
result:
ok single line: '277089318'
Test #12:
score: 5
Accepted
time: 84ms
memory: 31368kb
input:
932800 998164337
output:
945072504
result:
ok single line: '945072504'
Test #13:
score: 5
Accepted
time: 77ms
memory: 30424kb
input:
903603 998174341
output:
29916736
result:
ok single line: '29916736'
Test #14:
score: 5
Accepted
time: 89ms
memory: 32208kb
input:
958646 998184331
output:
802903490
result:
ok single line: '802903490'
Test #15:
score: 5
Accepted
time: 93ms
memory: 32988kb
input:
983016 998194349
output:
802900579
result:
ok single line: '802900579'
Test #16:
score: 5
Accepted
time: 93ms
memory: 31032kb
input:
922347 998204353
output:
228575331
result:
ok single line: '228575331'
Test #17:
score: 5
Accepted
time: 95ms
memory: 32768kb
input:
976053 998214317
output:
982618317
result:
ok single line: '982618317'
Test #18:
score: 5
Accepted
time: 89ms
memory: 32164kb
input:
957300 998224351
output:
514549818
result:
ok single line: '514549818'
Test #19:
score: 5
Accepted
time: 93ms
memory: 31012kb
input:
921760 998234353
output:
470386410
result:
ok single line: '470386410'
Test #20:
score: 5
Accepted
time: 93ms
memory: 30732kb
input:
912948 998244353
output:
129235345
result:
ok single line: '129235345'