fork download 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. string s;
  5.  
  6. int apr[303];
  7.  
  8. bool isPrime(int x)
  9. {
  10.     if(x < 2) return false;
  11.     for(int i = 2;i * i <= x;i++)
  12.     {
  13.         if(x % i == 0) return false;
  14.     }
  15.     return true;
  16. }
  17.  
  18. int main()
  19. {
  20.     cin >> s;
  21.     int variety = 0; /// biến này để làm câu a
  22.  
  23.     int max_apr = 0; /// biến này để làm câu b
  24.     for(int i = 0;i < s.size();i++)
  25.     {
  26.         if(apr[s[i]] == 0) variety++;
  27.         apr[s[i]]++;
  28.     }
  29.  
  30.     long long maxPrime = -1;
  31.     long long val = 0;
  32.     for(int i = 0;i < s.size();i++)
  33.     {
  34.         if(s[i] >= '0' && s[i] <= '9')
  35.             val = val * 10 + s[i] - '0';
  36.         else
  37.         {
  38.             if(isPrime(val)) maxPrime = max(maxPrime,val);
  39.             val = 0;
  40.         }
  41.     }
  42.     for(int i = 0;i < s.size();i++)
  43.     {
  44.         max_apr = max(max_apr,apr[s[i]]);
  45.     }
  46.     if(isPrime(val)) maxPrime = max(maxPrime,val);
  47.  
  48.     cout << variety << endl << max_apr << endl << maxPrime;
  49. }
  50.  
Success #stdin #stdout 0s 5324KB
comments (?)
stdin 
Standard input is empty
stdout 
0
0
-1
https://ideone.com/pmwPrI
language:
C++ (gcc 8.3)
created:
14 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!