Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- bool mark[10005];
- void sieve()
- {
- memset(mark,true,sizeof(mark));
- mark[0]=false;
- for(int i=4;i<=10000;i+=2)
- mark[i]=false;
- for(int i=3;i*i<=10000;i++)
- {
- if(mark[i])
- {
- for(int j=i*i;j<=10000;j+=i)
- mark[j]=false;
- }
- }
- }
- int main()
- {
- sieve();
- int i;
- string s;
- while(cin>>s)
- {
- int sum=0;
- for(i=0;i<s.size();i++)
- {
- if(s[i]>='a' && s[i]<='z')
- sum+=s[i]- 'a' +1;
- else
- sum+=s[i]- 'A' +27;
- }
- if(mark[sum])
- cout<<"It is a prime word."<<endl;
- else
- cout<<"It is not a prime word."<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement