【AtCoder】Beginner Contest 380-A.123233

题目链接

Problem Statement

You are given a $6$-digit positive integer $N$.
Determine whether $N$ satisfies all of the following conditions.

• Among the digits of $N$, the digit $1$ appears exactly once.
• Among the digits of $N$, the digit $2$ appears exactly twice.
• Among the digits of $N$, the digit $3$ appears exactly three times.

中文题意

问题陈述

您将得到一个 $6$ 位正整数 $N$ 。
判断 $N$ 是否满足以下所有条件。

• 在 $N$ 中，数字 $1$ 只出现$1$次。
• 在数字 $N$ 中，数字 $2$ 恰好出现$2$次。
• 在数字 $N$ 中，数字 $3$ 恰好出现$3$次。

Constraints

• $N$ is an integer satisfying $100000\le N\le 999999$.

Input

The input is given from Standard Input in the following format:

$N$

Output

Print Yes if $N$ satisfies all the conditions described in the problem statement, and No otherwise, in one line.

Sample Input 1

123233

Sample Output 1

Yes

$123233$ satisfies the conditions in the problem statement, so print Yes.

Sample Input 2

123234

Sample Output 2

No

$123234$ does not satisfy the conditions in the problem statement, so print No.

Sample Input 3

323132

Sample Output 3

Yes

Sample Input 4

500000

Sample Output 4

No

解法

方法一：使用桶计数的思想将这个$6$位数字每一位取出来，分别存到数组对应的下标中，然后进行判断即可。

int num[10];
void solved() {
    /* your code */
    int n;
    cin >> n;
    while(n) {
        num[n % 10] ++;
        n /= 10;
    }
    if(num[1] == 1 && num[2] == 2 && num[3] == 3) cout << "Yes";
    else cout << "No";
}

方法二：把输入当作字符串，直接排序，判断排序后的字符串是否等于$122333$即可。

void solved() {
    /* your code */
    string s;
    cin >> s;
    sort(s.begin(), s.end());
    if(s == "122333") cout << "Yes";
    else cout << "No";
}