import java.util.Scanner;
import java.util.TreeSet;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(sc.hasNext()){
String s = sc.next();
char[] str = s.toCharArray();
TreeSet set = new TreeSet();
for (int i = 0; i < s.length(); i++) {
set.add(str[i]);
}
if(set.size() == s.length()) System.out.println("yes");
else System.out.println("no");
}
}
}
相关文章
- 12-28atcoder 190 E - Magical Ornament(BFS+状态压缩)
- 12-28AtCoder Beginner Contest 190 题解
- 12-28AtCoder Beginner Contest 190
- 12-28AtCoder Prefix Median(AGC012)
- 12-28AtCoder Grand Contest 003题解
- 12-28Atcoder ABC132 D - Blue and Red Balls
- 12-28【AtCoder】ARC095 E - Symmetric Grid 模拟
- 12-28【AtCoder】AGC022 F - Leftmost Ball 计数DP
- 12-28【AtCoder】ARC 081 E - Don't Be a Subsequence
- 12-28【AtCoder】AGC005 F - Many Easy Problems 排列组合+NTT