QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#277986 | #7518. GCD of Pattern Matching | ship2077 | WA | 0ms | 3820kb | C++14 | 789b | 2023-12-07 10:17:22 | 2023-12-07 10:17:22 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
constexpr int M=30;
int n,d,num,T;char s[M];
unsigned long long gcd,f[M],g[M],pw[M];
int read(){
int x=0,f=1;char ch=getchar();
while (!isdigit(ch)) {if (ch=='-') f=-1;ch=getchar();}
while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
return x*f;
}
int main(){
scanf("%d",&T); while (T--){
scanf("%d%s",&d,s+1);n=strlen(s+1);
for (int i=pw[0]=1;i<=n;i++) pw[i]=pw[i-1]*d;
for (int i=0;i<26;i++) g[i]=0;
for (int i=1;i<=n;i++) g[s[i]-'a']+=pw[n-i]; num=0;
for (int i=0;i<26;i++) if (g[i]) f[num++]=g[i];
if (d==2) {printf("%d\n",g[s[1]-'a']);continue;}
gcd=0;sort(f,f+num);
for (int i=0;i<num;i++) gcd+=f[i]*i;
for (int i=1;i<num;i++) gcd=__gcd(gcd,f[i]-f[i-1]);
printf("%llu\n",gcd);
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3820kb
input:
5 10 ccpcccpc 10 cpcpcp 10 cpc 4 cpccpc 4 dhcp
output:
10001 10101 1 65 3
result:
ok 5 number(s): "10001 10101 1 65 3"
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3536kb
input:
30 2 ab 3 abc 4 abcd 5 abcde 6 abcdef 7 abcdefg 8 abcdefgh 9 abcdefghi 10 abcdefghij 11 abcdefghijk 12 abcdefghijkl 13 abcdefghijklm 14 abcdefghijklmn 15 abcdefghijklmno 16 abcdefghijklmnop 16 a 16 ab 16 abc 16 abcd 16 abcde 16 abcdef 16 abcdefg 16 abcdefgh 16 abcdefghi 16 abcdefghij 16 abcdefghijk ...
output:
2 1 3 2 5 3 7 4 9 5 11 6 13 7 15 0 1 3 3 5 15 3 1 3 15 5 3 3 1 15
result:
wrong answer 16th numbers differ - expected: '1', found: '0'