https://www.acmicpc.net/problem/17903
17903번: Counting Clauses
The input is a single instance of the 3-SAT problem. The first line is two space-separated integers: m (1 ≤ m ≤ 20), the number of clauses and n (3 ≤ n ≤ 20), the number of variables. Then m clauses follow, one clause per line. Each clause consists
www.acmicpc.net
|
1
2
3
|
m, n = map(int, input().split())
print("satisfactory" if m >= 8 else "unsatisfactory")
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
| 백준 26082 WARBOY (0) | 2022.11.30 |
|---|---|
| 백준 25828 Corona Virus Testing (0) | 2022.11.30 |
| 백준 3060 욕심쟁이 돼지 (0) | 2022.11.30 |
| 백준 25915 연세여 사랑한다 (0) | 2022.11.30 |
| 백준 15372 A Simple Problem. (0) | 2022.11.30 |
댓글