25 lines
679 B
Java
25 lines
679 B
Java
// Author: Rodney Shaghoulian
|
|
// Github: github.com/RodneyShag
|
|
// HackerRank: hackerrank.com/RodneyShag
|
|
|
|
import java.util.Scanner;
|
|
import java.util.HashSet;
|
|
|
|
public class Solution {
|
|
public static void main(String[] args) {
|
|
Scanner scan = new Scanner(System.in);
|
|
String str = scan.nextLine().toLowerCase();
|
|
scan.close();
|
|
|
|
HashSet<Character> set = new HashSet<>();
|
|
for (int i = 0; i < str.length(); i++) {
|
|
char ch = str.charAt(i);
|
|
if (Character.isLetter(ch)) {
|
|
set.add(ch);
|
|
}
|
|
}
|
|
|
|
System.out.println(set.size() == 26 ? "pangram" : "not pangram");
|
|
}
|
|
}
|