백준 34743 (C++) LED Counter

최초 업로드: 2025-11-15 02:34:17

최근 수정 시간: 2025-11-15 02:34:17

게시자: rlatjwls3333

카테고리: 백준

# [Silver III] LED Counter

[문제 링크](https://www.acmicpc.net/problem/34743)

## 문제 설명

A LED counter is a device having $N$ positions arranged in a single row. Each position is able to display a digit from $0$ to $9$, and is made of seven LEDs, as this picture shows.

To display a specific digit, just the appropriate LEDs are turned on. The following picture indicates which LEDs are turned on for each possible digit.

As you can see, all but the middle LED are turned on to display the digit $0$, the upper-right LED and the bottom-right LED are turned on to display the digit $1$, and so on.

By turning on the appropriate LEDs in each of the $N$ positions of the counter, the device is able to display $10^N$ distinct values, from $00 \cdots 0$ ($N$ zeros) to $99 \cdots 9$ ($N$ nines). Note that leading zeros are displayed.

Astro Void has owned a LED counter for quite some time, and so the device might have some malfunctioning LEDs. While a good LED turns on or off when needed, a malfunctioning LED is always turned on or always turned off, independently of the intended value of the counter.

Given the description of the state of each LED in Astro Void’s LED counter (good LED that is turned on, good LED that is turned off, always-on LED, or always-off LED), you must tell the intended value of the counter, indicating which positions cannot be determined without ambiguity.

As an example of a LED counter with $N = 3$ positions, consider the picture below. If all the LEDs are good, then the intended value of the counter is of course $056$. If the bottom LED of the first position is an always-on LED, then the intended value of the counter is still $056$, because no other value would be displayed as the picture shows. However, if the bottom-left LED of the second position is an always-off LED, then the second position of the counter cannot be determined without ambiguity, since $056$ and $066$ would be displayed as shown.

## 입력

The first line contains an integer $N$ ($1 ≤ N ≤ 10^5$) indicating the number of positions in the LED counter.

The $i$-th of the next $N$ lines contains a string $S_i$ of length $7$ describing the seven LEDs in the $i$-th position of the counter. Each character of $S_i$ describes a particular LED, from left to right and from top to bottom, that is, in the following order: upper-left, bottom-left, top, middle, bottom, upper-right and bottom-right. The character is either an uppercase letter “<code>G</code>” (good LED that is turned on), a lowercase letter “<code>g</code>” (good LED that is turned off), a plus sign “<code>+</code>” (always-on LED) or a hyphen “<code>-</code>” (always-off LED). It is guaranteed that $S_i$ describes valid states for the LEDs in the $i$-th position of the counter. For instance, $S_i$ is not “<code>ggggggg</code>”, because when all LEDs are good, no digit would be displayed with all of them turned off.

## 출력

Output a single line with a string of $N$ digits indicating the intended value of the counter. If a position of the counter cannot be determined without ambiguity, output the character “<code>*</code>” (asterisk) instead of the corresponding digit.

## 풀이
모호한 부분을 제외한 나머지 부분들 만으로 매칭되는 숫자가 여러개인지 확인하는 문제입니다. '+'나 '-'나 둘 다 모호한 정도가 똑같기 때문에 문자열 매칭할 때 둘 다 패스하면 됩니다.

``` c++
#include<bits/stdc++.h>
using namespace std;

string num[10] = {
    {"GGGgGGG"},
    {"gggggGG"},
    {"gGGGGGg"},
    {"ggGGGGG"},
    {"GggGgGG"},
    {"GgGGGgG"},
    {"GGGGGgG"},
    {"ggGggGG"},
    {"GGGGGGG"},
    {"GgGGGGG"}
};

void chk(string s) {
 int res=-1;
 for(int i=0;i<=9;i++) {
 bool match=true;
 for(int j=0;j<7;j++) {
 if(s[j]!='+' && s[j]!='-' && s[j]!=num[i][j]) match=false;
 }
 if(match) {
 if(res!=-1) {
 res=-1;
 break;
 }
 res=i;
 }
 }
 cout << (res==-1 ? "*" : to_string(res));
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    while(n--) {
        string s; cin >> s;
        chk(s);
    }
}
```