Submission #671603


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200;
int n;
char s1[MAXN], s2[MAXN];
int fa[MAXN];
bool notnum[MAXN];
int find(int x) {
    return fa[x] == x ? x: fa[x] = find(fa[x]);
}
void merge(int x, int y) {
    int fx = find(x), fy = find(y);
    if(fx != fy) {
        fa[fy] = fx;
    }
}
int main() {
        scanf("%d", &n);
        scanf("%s%s", s1, s2);
        memset(notnum, 0, sizeof notnum);
        for(int i = 0; i < n; i ++) {
            fa[s1[i]] = s1[i];
            fa[s2[i]] = s2[i];
        }
        for(int i = 0; i < n; i ++) {
            merge(s1[i], s2[i]);
            notnum[s1[i]] = notnum[s2[i]] = true;
        }
        for(char i = '0'; i <= '9'; i ++) {
            notnum[find(i)] = false;
        }
        long long ans = 1;
        for(char i = 'A'; i <= 'Z'; i ++) {
            if(notnum[i] && find(i) == i) {
                if(s1[0] != i && s2[0] != i) {
                    ans *= 10;
                } else {
                    ans *= 9;
                }
            }
        }
        printf("%lld\n", ans);
    return 0;
}

Submission Info

Submission Time
Task B - 大事な数なのでZ回書きまLた。
User birdstorm
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1136 Byte
Status AC
Exec Time 33 ms
Memory 1180 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &n);
                        ^
./Main.cpp:19:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s%s", s1, s2);
                              ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 29
AC × 55
Set Name Test Cases
Sample subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt
Subtask1 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt, subtask1-26.txt
Subtask2 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt, subtask1-26.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt, subtask2-21.txt, subtask2-22.txt, subtask2-23.txt, subtask2-24.txt, subtask2-25.txt, subtask2-26.txt
Case Name Status Exec Time Memory
subtask0-sample01.txt AC 31 ms 1008 KiB
subtask0-sample02.txt AC 27 ms 988 KiB
subtask0-sample03.txt AC 28 ms 920 KiB
subtask1-01.txt AC 28 ms 1048 KiB
subtask1-02.txt AC 27 ms 984 KiB
subtask1-03.txt AC 28 ms 1052 KiB
subtask1-04.txt AC 25 ms 920 KiB
subtask1-05.txt AC 27 ms 980 KiB
subtask1-06.txt AC 28 ms 924 KiB
subtask1-07.txt AC 27 ms 920 KiB
subtask1-08.txt AC 27 ms 1044 KiB
subtask1-09.txt AC 27 ms 924 KiB
subtask1-10.txt AC 30 ms 972 KiB
subtask1-11.txt AC 28 ms 1176 KiB
subtask1-12.txt AC 28 ms 1024 KiB
subtask1-13.txt AC 29 ms 984 KiB
subtask1-14.txt AC 33 ms 980 KiB
subtask1-15.txt AC 28 ms 968 KiB
subtask1-16.txt AC 30 ms 980 KiB
subtask1-17.txt AC 28 ms 952 KiB
subtask1-18.txt AC 28 ms 1180 KiB
subtask1-19.txt AC 27 ms 1044 KiB
subtask1-20.txt AC 28 ms 1048 KiB
subtask1-21.txt AC 28 ms 1044 KiB
subtask1-22.txt AC 27 ms 924 KiB
subtask1-23.txt AC 28 ms 924 KiB
subtask1-24.txt AC 28 ms 1048 KiB
subtask1-25.txt AC 28 ms 920 KiB
subtask1-26.txt AC 26 ms 920 KiB
subtask2-01.txt AC 28 ms 928 KiB
subtask2-02.txt AC 27 ms 1052 KiB
subtask2-03.txt AC 28 ms 1044 KiB
subtask2-04.txt AC 26 ms 1044 KiB
subtask2-05.txt AC 27 ms 1052 KiB
subtask2-06.txt AC 27 ms 1048 KiB
subtask2-07.txt AC 27 ms 920 KiB
subtask2-08.txt AC 27 ms 1176 KiB
subtask2-09.txt AC 27 ms 924 KiB
subtask2-10.txt AC 27 ms 1052 KiB
subtask2-11.txt AC 27 ms 964 KiB
subtask2-12.txt AC 27 ms 1052 KiB
subtask2-13.txt AC 26 ms 1040 KiB
subtask2-14.txt AC 28 ms 1048 KiB
subtask2-15.txt AC 27 ms 1052 KiB
subtask2-16.txt AC 25 ms 984 KiB
subtask2-17.txt AC 27 ms 924 KiB
subtask2-18.txt AC 26 ms 1052 KiB
subtask2-19.txt AC 27 ms 924 KiB
subtask2-20.txt AC 27 ms 1048 KiB
subtask2-21.txt AC 27 ms 920 KiB
subtask2-22.txt AC 27 ms 1052 KiB
subtask2-23.txt AC 27 ms 1048 KiB
subtask2-24.txt AC 27 ms 924 KiB
subtask2-25.txt AC 27 ms 924 KiB
subtask2-26.txt AC 25 ms 924 KiB