QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#263016#7813. 密码锁ucup-team004100 ✓2ms3480kbC++201.5kb2023-11-24 14:15:082023-11-24 14:15:10

Judging History

你现在查看的是最新测评结果

  • [2023-11-24 14:15:10]
  • 评测
  • 测评结果:100
  • 用时:2ms
  • 内存:3480kb
  • [2023-11-24 14:15:08]
  • 提交

answer

#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;
    
    std::vector<std::array<int, 5>> a(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 5; j++) {
            std::cin >> a[i][j];
        }
    }
    
    int ans = 0;
    for (int password = 0; password < 100000; password++) {
        std::array<int, 5> digit{};
        int tmp = password;
        for (int i = 0; i < 5; i++) {
            digit[i] = tmp % 10;
            tmp /= 10;
        }
        bool ok = true;
        for (int i = 0; i < n; i++) {
            std::array<int, 5> diff{};
            for (int j = 0; j < 5; j++) {
                diff[j] = (digit[j] - a[i][j] + 10) % 10;
            }
            int x = 0;
            while (x < 5 && diff[x] == 0) {
                x += 1;
            }
            if (x == 5) {
                ok = false;
                break;
            }
            for (int j = x + 2; j < 5; j++) {
                if (diff[j] != 0) {
                    ok = false;
                    break;
                }
            }
            if (!ok) {
                break;
            }
            if (x < 4 && diff[x + 1] != 0 && diff[x + 1] != diff[x]) {
                ok = false;
                break;
            }
        }
        if (ok) {
            ans += 1;
        }
    }
    std::cout << ans << "\n";
    
    return 0;
}

詳細信息

Test #1:

score: 10
Accepted
time: 1ms
memory: 3396kb

input:

1
4 9 8 2 5

output:

81

result:

ok single line: '81'

Test #2:

score: 10
Accepted
time: 0ms
memory: 3432kb

input:

1
7 7 5 2 0

output:

81

result:

ok single line: '81'

Test #3:

score: 10
Accepted
time: 2ms
memory: 3372kb

input:

1
8 9 8 7 8

output:

81

result:

ok single line: '81'

Test #4:

score: 10
Accepted
time: 0ms
memory: 3476kb

input:

2
0 3 7 3 8
0 3 6 7 8

output:

6

result:

ok single line: '6'

Test #5:

score: 10
Accepted
time: 1ms
memory: 3480kb

input:

2
7 3 7 9 7
3 3 7 9 3

output:

2

result:

ok single line: '2'

Test #6:

score: 10
Accepted
time: 2ms
memory: 3452kb

input:

4
8 6 9 9 4
8 6 8 9 4
8 6 7 9 4
8 6 1 9 4

output:

6

result:

ok single line: '6'

Test #7:

score: 10
Accepted
time: 1ms
memory: 3452kb

input:

6
0 8 3 9 0
0 4 3 9 0
0 0 3 9 0
0 3 3 9 0
0 5 3 9 0
0 6 3 9 0

output:

4

result:

ok single line: '4'

Test #8:

score: 10
Accepted
time: 0ms
memory: 3372kb

input:

7
2 2 5 6 3
1 8 5 6 3
2 8 7 6 3
2 8 6 6 3
2 8 8 6 3
2 1 5 6 3
2 8 9 6 3

output:

1

result:

ok single line: '1'

Test #9:

score: 10
Accepted
time: 1ms
memory: 3388kb

input:

5
6 6 6 9 5
6 0 0 9 5
6 1 1 9 5
6 2 2 9 5
6 4 4 9 5

output:

5

result:

ok single line: '5'

Test #10:

score: 10
Accepted
time: 1ms
memory: 3392kb

input:

8
9 0 8 6 0
9 5 2 6 0
9 0 7 0 4
9 0 9 6 0
3 0 7 6 0
9 0 7 6 7
4 0 7 6 0
9 8 7 6 0

output:

1

result:

ok single line: '1'