Problem : https://cses.fi/problemset/task/1653/
My code : https://ideone.com/XEG6Lx
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 4039 |
| 2 | tourist | 3841 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3590 |
| 5 | ecnerwala | 3542 |
| 6 | Benq | 3535 |
| 7 | orzdevinwang | 3526 |
| 8 | gamegame | 3477 |
| 9 | heuristica | 3357 |
| 10 | Radewoosh | 3355 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | atcoder_official | 160 |
| 3 | Um_nik | 160 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 147 |
→ Find user
→ Recent actions
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
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/22/2025 07:30:34 (h1).
Desktop version, switch to mobile version.
Supported by
