| codeforces #7 |
| 1 | n=int(input()) f=input() if len(set(f))==1: print("NO") else: ams="" for i in range(n): if f[i]!=f[i+1]: ams+=f[i]+f[i+1] break print("YES") print(ams) n = int(input()) s = input() flag = 0 for i in range(len(s)): if i > 0 and s[i] != s[i -1]: flag = i if flag == 0: print('NO') else: print('YES') print(s[flag - 1:flag + 1]) import math length_of_string = int(input()) string = input() half_length = math.floor(length_of_string/2) def get_all_substrings(input_string, length_of_string): return [input_string[i:j+1] for i in range(length_of_string) for j in range(i,length_of_string)] def diverse_string(input_string): for letter in input_string: if input_string.count(letter) > math.floor(len(input_string)/2): return False return True flag = 0 for individual_string in get_all_substrings(string, length_of_string): if diverse_string(individual_string): print("YES") print(individual_string) flag = 1 break if flag == 0: print("NO") |
Комментарии