c.cpp

ACM训练题解 最新版 共8题 ACM训练题解 最新版 共8题

// Problem C
// http://acm.uva.es/p/v109/10924.html
// Solution by semiconductor
#include	<cstdio>
#include	<cstdlib>
#include	<cstring>
#include	<cctype>
#include	<cmath>

using namespace std;
const char NUL = '\0';

char buf[21];

bool
Prime(int s)
{
	int n = int(sqrt(s));
	for ( int i = 2; i <= n; i++ ) if ( s % i == 0 ) return 0;
	return 1;
}

int
main()
{
	while ( scanf("%s", buf) != EOF ) {
		int s = 0;
		for ( int i = 0; buf[i]; i++ ) 
			if ( islower(buf[i]) ) s += buf[i] - 'a' + 1;
			else s += buf[i] - 'A' + 27;
		if ( Prime(s) ) printf("It is a prime word.\n");
		else printf("It is not a prime word.\n");
	}
}