10886๋ฒ: 0 = not cute / 1 = cute
์คํฌ๋ ์๊ธฐ๊ฐ ํ์์ ๊ท์ฌ์์ ๋ด๋นํ๊ณ ์๋ค๊ณ ์๊ฐํ๋ค. ํ์ง๋ง ์ฐ์๊ฐ ๋ณผ ๋ ๊ทธ ์๊ฒฌ์ ๋ญ๊ฐ ์ข ์๋ชป๋ ๊ฒ ๊ฐ์๋ค. ๊ทธ๋ ๊ธฐ์ ์ค๋ฌธ์กฐ์ฌ๋ฅผ ํ์ฌ ์คํฌ๊ฐ ๊ท์ฌ์ด์ง ์๋์ง ์์๋ณด๊ธฐ๋ก ํ๋ค.
www.acmicpc.net
์ค๋ช
๋ค์ N๊ฐ์ ์ค์๋ ๊ฐ ์ค๋ง๋ค ๊ฐ ์ฌ๋์ด ์ค๋ฌธ ์กฐ์ฌ์ ์ด๋ค ์๊ฒฌ์ ํ๋ช
ํ๋์ง๋ฅผ ๋ํ๋ด๋ ์ ์๊ฐ ์ฃผ์ด์ง๋ค.
0์ ์คํฌ๊ฐ ๊ท์ฝ์ง ์๋ค๊ณ ํ๋ค๋ ๋ป์ด๊ณ , 1์ ์คํฌ๊ฐ ๊ท์ฝ๋ค๊ณ ํ๋ค๋ ๋ป์ด๋ค.
์คํฌ๊ฐ ๊ท์ฝ์ง ์๋ค๋ ์๊ฒฌ์ด ๋ ๋ง์ ๊ฒฝ์ฐ "Junhee is not cute!"๋ฅผ ์ถ๋ ฅํ๊ณ , ๊ท์ฝ๋ค๋ ์๊ฒฌ์ด ๋ง์ ๊ฒฝ์ฐ "Junhee is cute!"๋ฅผ ์ถ๋ ฅํ๋ผ.
Solution
Java
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int one = 0, zero = 0;
for (int i = 0; i < n; i++) {
int survey = scanner.nextInt();
if (survey == 1){
one++;
}
else{
zero++;
}
}
if(one > zero){
System.out.println("Junhee is cute!");
}else {
System.out.println("Junhee is not cute!");
}
}
}
Python
n = int(input())
survey = []
for i in range(n):
survey.append(int(input()))
if survey.count(0) < survey.count(1):
print("Junhee is cute!")
else:
print("Junhee is not cute!")
'๐งฉ Algorithm > [BOJ] Bronze' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
| BOJ 2083 : ๋ญ๋น ํด๋ฝ (Java/๊ตฌํ/Bronze 4) (0) | 2024.09.29 |
|---|---|
| BOJ 29731 : 2033๋ ๋ฐ ํฌํ (Java/๊ตฌํ/Bronze 5) (1) | 2024.09.28 |
| BOJ 2441๋ฒ : ๋ณ ์ฐ๊ธฐ - 4 (Java/๊ตฌํ/Bronze 4) (0) | 2024.03.26 |
| BOJ 10953๋ฒ : A+B - 6 (Python, Java/๊ตฌํ/Bronze 3) (0) | 2024.03.24 |
| BOJ 10797๋ฒ : 10๋ถ์ (Python, Java/๊ตฌํ/Bronze 4) (0) | 2024.03.24 |