fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. typedef long long ll;
  4. const int N = 1e3 + 5;
  5. const double eps = 1e-8;
  6. #define el "\n"
  7.  
  8.  
  9. string s;
  10.  
  11. int add()
  12. {
  13.     int sum = 0;
  14.     for (int i = 0; i < s.size(); ++i) {
  15.         if(s[i] >= 'a' && s[i] <= 'z')
  16.             sum += s[i] - 96;
  17.         else
  18.             sum += s[i] - 38;
  19.     }
  20.     return sum;
  21. }
  22. bool isPrime[N];
  23.  
  24. void sieve(int limit){
  25.     for(int i = 2; i <= limit; i++)
  26.         isPrime[i] = 1;
  27.  
  28.     for(ll i = 2; i * i <= limit; i++)
  29.         if(isPrime[i])
  30.             for(ll j = i * i; j <= limit; j += i)
  31.                 isPrime[j] = 0;
  32. }
  33.  
  34. int main() {
  35.     ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  36.  
  37.     sieve(N);
  38.     while(getline(cin ,s))
  39.     {
  40.         int sum = add();
  41.         if(isPrime[sum])
  42.             cout << "It is a prime word." << el;
  43.         else
  44.             cout <<"It is not a prime word." << el;
  45.     }
  46.  
  47.  
  48.  
  49.  
  50.  
  51.  
  52.     return 0;
  53. }
  54.  
Success #stdin #stdout 0.01s 5440KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/tVcAay
language:
C++ (gcc 8.3)
created:
1 year 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!