Submission #18076616
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
bool is_feasible(int N, const string &S, int n)
{
int digits[3] = {n / 100, (n % 100) / 10, (n % 10)};
for (int i = 0, j = 0; j < 3; ++i, ++j) {
char nj = digits[j] + '0';
for (; i < N; ++i) {
if (S.at(i) == nj)
break;
}
if (i == N)
return false;
}
return true;
}
int main()
{
int N;
string S;
cin >> N >> S;
int cnt = 0;
for (int n = 0; n < 1000; ++n) {
if (is_feasible(N, S, n))
++cnt;
}
cout << cnt << endl;
}
Submission Info
| Submission Time | |
|---|---|
| Task | D - Lucky PIN |
| User | atug |
| Language | C++ (GCC 9.2.1) |
| Score | 400 |
| Code Size | 597 Byte |
| Status | AC |
| Exec Time | 34 ms |
| Memory | 3620 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 400 / 400 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt |
| All | 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-corner-01.txt, 01-corner-02.txt, 01-corner-03.txt, 01-corner-04.txt, 02-random-01.txt, 02-random-02.txt, 02-random-03.txt, 02-random-04.txt, 02-random-05.txt, 02-random-06.txt, 02-random-07.txt, 03-random-x-01.txt, 03-random-x-02.txt, 03-random-x-03.txt, 04-expand-01.txt, 04-expand-02.txt, 04-expand-03.txt, 04-expand-04.txt, 04-expand-05.txt, 04-expand-06.txt, 04-expand-07.txt, 04-expand-08.txt, 05-limiting-01.txt, 05-limiting-02.txt, 05-limiting-03.txt, 05-limiting-04.txt, 05-limiting-05.txt, 05-limiting-06.txt, 05-limiting-07.txt, 05-limiting-08.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00-sample-01.txt | AC | 8 ms | 3536 KiB |
| 00-sample-02.txt | AC | 2 ms | 3548 KiB |
| 00-sample-03.txt | AC | 2 ms | 3560 KiB |
| 01-corner-01.txt | AC | 3 ms | 3552 KiB |
| 01-corner-02.txt | AC | 3 ms | 3396 KiB |
| 01-corner-03.txt | AC | 2 ms | 3564 KiB |
| 01-corner-04.txt | AC | 2 ms | 3324 KiB |
| 02-random-01.txt | AC | 2 ms | 3468 KiB |
| 02-random-02.txt | AC | 2 ms | 3564 KiB |
| 02-random-03.txt | AC | 3 ms | 3560 KiB |
| 02-random-04.txt | AC | 2 ms | 3564 KiB |
| 02-random-05.txt | AC | 2 ms | 3452 KiB |
| 02-random-06.txt | AC | 2 ms | 3396 KiB |
| 02-random-07.txt | AC | 5 ms | 3512 KiB |
| 03-random-x-01.txt | AC | 13 ms | 3424 KiB |
| 03-random-x-02.txt | AC | 21 ms | 3440 KiB |
| 03-random-x-03.txt | AC | 20 ms | 3508 KiB |
| 04-expand-01.txt | AC | 28 ms | 3528 KiB |
| 04-expand-02.txt | AC | 34 ms | 3620 KiB |
| 04-expand-03.txt | AC | 27 ms | 3608 KiB |
| 04-expand-04.txt | AC | 25 ms | 3616 KiB |
| 04-expand-05.txt | AC | 25 ms | 3440 KiB |
| 04-expand-06.txt | AC | 18 ms | 3508 KiB |
| 04-expand-07.txt | AC | 16 ms | 3588 KiB |
| 04-expand-08.txt | AC | 6 ms | 3468 KiB |
| 05-limiting-01.txt | AC | 34 ms | 3468 KiB |
| 05-limiting-02.txt | AC | 28 ms | 3464 KiB |
| 05-limiting-03.txt | AC | 30 ms | 3508 KiB |
| 05-limiting-04.txt | AC | 21 ms | 3452 KiB |
| 05-limiting-05.txt | AC | 18 ms | 3620 KiB |
| 05-limiting-06.txt | AC | 12 ms | 3584 KiB |
| 05-limiting-07.txt | AC | 5 ms | 3468 KiB |
| 05-limiting-08.txt | AC | 3 ms | 3612 KiB |