primes_word.java

package javaapplication1;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        while (sc.hasNextLine()) {
            Map<String, Integer> mapa = new HashMap<>();
            String alfabeto = "abcdefghijklmnopqrstuvxwyzABCDEFGHIJKLMNOPQRSTUVXWYZ";
            char[] aux = alfabeto.toCharArray();
            for (int i = 0; i < alfabeto.length(); i++) {
                mapa.put("" + aux[i], i + 1);
            }

            String palavra = sc.nextLine();
            char[] aux2 = palavra.toCharArray();
            Integer soma = 0;
            for (int i = 0; i < palavra.length(); i++) {
                String letra = "" + aux2[i];
                System.out.println(mapa.get(letra));
                soma += mapa.get(letra);
            }
            if (ehPrimo(soma)) {
                System.out.println("It is a prime word.");
            } else {
                System.out.println("It is not a prime word.");
            }
        }

    }

    static boolean ehPrimo(int n) {
        int qtdDivisores = 0;
        int i;
        for (i = 1; i <= n; i++) {
            if (n % i == 0) {
                qtdDivisores++;
            }
        }
        if (qtdDivisores == 2 || n == 1) {
            return true;
        }
        return false;
    }

}