[UVA] 10789 - Prime Frequency＠Morris' Blog｜PChome Online 人新台

Morris' Blog 我在摸索我存在的意、生命的意、涵及值。有真正神手般的害，套用模式是大部分的情。那害的我存在的意何，托出神的存在？有候不能怪人不我，我已始省思，什我有人的原因，而是全要靠人。有候我我不同，那是因我做不到很多人能到的事情。我不到、玩不起、得不明、理解得不多，我缺少的文能力，就是一切一切能的判定。此，我不得能做些人有助的事情。我知道我自己是不服的性格，但在我不得不。我有能力，因此我必。我到底世界作什？充不定性，而我是法出拔萃，想一般人似乎也回不了了。越大的挑需要越力的支持，而我的支持是什？最近人，但都是失的局，人能接受，不需要言，不需要通，一切所想都表不出。
49的鼓 6站台

2011-12-17 10:03:40| 人2,716| 回0 | 上一篇 | 下一篇

[UVA] 10789 - Prime Frequency

推 0 收藏 0 0 站台

Prime Frequency

Given a string containing only alpha-numerals (0-9, A-Z and a-z) you have to count the frequency (the number of times the character is present) of all the characters and report only those characters whose frequency is a prime number. A prime number is a number, which is divisible by exactly two different integers. Some examples of prime numbers are 2, 3, 5, 7, 11 etc.

Input

The first line of the input is an integer T ( 0 < T < 201) that indicates how many sets of inputs are there. Each of the next T lines contains a single set of input.

The input of each test set is a string consisting alpha-numerals only. The length of this string is positive and less than 2001.

Output

For each set of input produce one line of output. This line contains the serial of output followed by the characters whose frequency in the input string is a prime number. These characters are to be sorted in lexicographically ascending order. Here ``lexicographically ascending" means ascending in terms of the ASCII values. Look at the output for sample input for details. If none of the character frequency is a prime number, you should print `empty' (without the quotes) instead.

Sample Input

3 ABCC AABBBBDDDDD ABCDFFFF

Sample Output

Case 1: C Case 2: AD Case 3: empty

 
作法 : 找的字元

#include<stdio.h>
int main() {
   int prime[2002] = {0};
   int i, j, C = 0, t;
   prime[0] = prime[1] = 1;
   for(i = 2; i < 2002; i++)
       if(prime[i] == 0) {
           for(j = 2; i*j < 2002; j++)
               prime[i*j] = 1;
       }
   char s[2002];
   scanf("%d", &t);
   while(t--) {
       scanf("%s", s);
       int asci[128] = {0};
       for(i = 0; s[i]; i++)
           asci[s[i]]++;
       printf("Case %d: ", ++C);
       for(i = 0, j = 0; i < 128; i++)
           if(prime[asci[i]] == 0)
               printf("%c", i), j++;
       if(j == 0)   printf("empty");
       puts("");
   }
    return 0;
}