Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- char arr[10000],arr2[10000];
- int t,a=1,arr3[10000];
- scanf("%d",&t);
- while(t-- && scanf("%s",&arr))
- {
- int k=strlen(arr),countt=0,n=0,f=0,q,h,flag=0;
- sort(arr,arr+k);
- for(int i=0; i<k; i++)
- {
- if(arr[i]==arr[i+1])
- {
- countt++;
- n=countt;
- }
- else
- {
- countt=0;
- arr2[f]=arr[i];
- arr3[f]=n+1;
- n=0;
- f++;
- }
- }
- printf("Case %d: ",a);
- for(int m=0; m<f; m++)
- {
- h=0;
- q=sqrt(arr3[m]);
- for(int g=2; g<=q; g++)
- {
- if(arr3[m]%g==0)
- {
- h=1;
- }
- }
- if(h==0 && arr3[m]!=1)
- {
- flag=1;
- printf("%c",arr2[m]);
- }
- }
- if(flag==0)
- {
- printf("empty");
- }
- a++;
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement