Problem : https://cses.fi/problemset/task/1653/
My code : https://ideone.com/XEG6Lx
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Problem : https://cses.fi/problemset/task/1653/
My code : https://ideone.com/XEG6Lx
Can anyone suggest me how to solve this problem(https://cses.fi/problemset/task/1087)
You are given a DNA sequence consisting of characters A, C, G, and T.
Your task is to find the shortest DNA sequence that is not a subsequence of the original sequence.
Input
The only input line contains a DNA sequence with n characters.
Output
Print the shortest DNA sequence that is not a subsequence of the original sequence. If there are several solutions, you may print any of them.
Constraints 1≤n≤1e6 Example
Input: ACGTACGT
Output: AAA
Name |
---|