-
Notifications
You must be signed in to change notification settings - Fork 0
/
10789-Prime-Frequency.cpp
66 lines (49 loc) · 1.14 KB
/
10789-Prime-Frequency.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include<stdio.h>
#include<string.h>
int isPrime(int num) {
int i;
if( num == 1 ) return 0;
if(num == 2 ) return 1;
for( i = 2 ; i < num ; i++ ){
if(num%i==0) return 0;
}
return 1;
}
struct number{
int fre;
}val[200];
int main(){
int t,i,j,len,n,k;
char str[3000],data[3000];
scanf("%d",&t);
for( i = 1 ; i <= t ; i++ ){
scanf("%s",str);
len = strlen(str);
for( j = 46 ; j < 130 ; j++ )
val[j].fre=0;
for( j = 0 ; j < len ; j++ ){
n = (int)str[j];
val[n].fre++;
}
k = 0;
for( j = 46 ; j < 130 ; j++ ){
if( val[j].fre != 0 ){
if( isPrime(val[j].fre))
data[k++]=(char)j;
}
else continue;
}
data[k]='\0';
len = strlen(data);
if( len == 0 ){
printf("Case %d: empty\n",i);
}
else{
printf("Case %d: ",i);
for(j = 0 ; j < len ; j++ )
printf("%c",data[j]);
printf("\n");
}
}
return 0;
}