167262025-05-11 12:53:52SaroltaMihalyDNS szakaszok száma (75 pont)cpp17Wrong answer 11/75300ms620 KiB
#include <iostream>
#include <string>
using namespace std;

int main() {
    long N;
    string dns;
    cin >> N >> dns;

    long szamlalo = 0;

    long i = 0;
    while (i < N) {
        if (dns[i] == 'A') {
            bool tartalmaz_g = false;
            long j = i + 1;
            while (j < N) {
                if (dns[j] == 'G') {
                    tartalmaz_g = true;
                }
                if (dns[j] == 'T' && tartalmaz_g) {
                    szamlalo++;
                    break;
                }
                j++;
            }
        }
        i++;
    }

    cout << szamlalo << endl;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base11/75
1Wrong answer0/01ms500 KiB
2Wrong answer0/04ms564 KiB
3Accepted3/31ms316 KiB
4Wrong answer0/41ms316 KiB
5Wrong answer0/41ms508 KiB
6Accepted4/41ms316 KiB
7Accepted4/41ms316 KiB
8Wrong answer0/31ms316 KiB
9Wrong answer0/31ms316 KiB
10Wrong answer0/41ms316 KiB
11Wrong answer0/41ms500 KiB
12Wrong answer0/41ms316 KiB
13Wrong answer0/41ms316 KiB
14Wrong answer0/41ms316 KiB
15Wrong answer0/34ms564 KiB
16Wrong answer0/418ms612 KiB
17Wrong answer0/44ms564 KiB
18Wrong answer0/49ms620 KiB
19Time limit exceeded0/4300ms564 KiB
20Time limit exceeded0/4202ms616 KiB
21Time limit exceeded0/3298ms588 KiB
22Time limit exceeded0/4300ms564 KiB