Saleh127

uva 10789.cpp

Jun 2nd, 2020
161
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.34 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define test int t; cin>>t; while (t--)
  4. #define maX 1000000
  5. #define ll long long
  6. bool marked[maX];
  7. vector<ll>factor,prime;
  8. void sieve()
  9. {
  10. marked[0]=true;
  11. marked[1]=true;
  12. marked[2]=false;
  13. for(ll i=4;i<=maX;i+=2)
  14. {
  15. marked[i]=true;
  16. }
  17. for(ll i=3;i*i<=maX;i+=2)
  18. {
  19. if(marked[i]==false)
  20. {
  21. for(ll j=i*i;j<=maX;j+=i+i)
  22. {
  23. marked[j]=true;
  24. }
  25. }
  26. }
  27. }
  28. int main()
  29. {
  30. ll cas=1,i,j,k,l,fre[1000];
  31. string a;
  32. char c;
  33. sieve();
  34. test
  35. {
  36. cin>>a;
  37. l=a.size();
  38.  
  39. ll fre[1000]={0}; ///memset(fre,0,sizeof(fre));
  40. for(i=0;i<l;i++)
  41. {
  42. k=a[i];
  43. fre[k]++;
  44. }
  45. j=0;
  46. printf("Case %lld: ",cas++);
  47. for(i=48;i<=130;i++)
  48. {
  49. if(fre[i]>0)
  50. {
  51. if(fre[i]==2)
  52. {
  53. printf("%c",i);
  54. j=1;
  55. }
  56. else if(fre[i]%2!=0 && marked[fre[i]]==false)
  57. {
  58. printf("%c",i);
  59. j=1;
  60. }
  61. }
  62. }
  63. if(j==0) printf("empty\n");
  64. else printf("\n");
  65. }
  66. return 0;
  67. }
Advertisement
Add Comment
Please, Sign In to add comment