반응형
Notice
Recent Posts
Recent Comments
Link
목록3052 (1)
안경잡이 구루루
![](http://i1.daumcdn.net/thumb/C150x150.fwebp.q85/?fname=https://blog.kakaocdn.net/dn/cS8UDh/btqFcve83Sm/s1j1hn6CdBTMD7PtXh7WkK/img.png)
https://www.acmicpc.net/problem/3052 나: #include int main() { int cnt = 0; int num[10]; for (int i = 0; i < 10; i++) { scanf_s("%d", &num[i]); num[i] = num[i] % 42; } for (int j = 0; j < 10; j++) { for (int k = j + 1; k < 10; k++) { if (num[j] == -1)break; if (num[j] == num[k]) num[k] = -1; } } for (int i = 0; i < 10; i++) { if (num[i] != -1) cnt++; } printf("%d", cnt); } 완성된 코드는 위와 같다. #include..
C언어(C programming)/문제풀이(백준,BaekJoon)
2020. 6. 30. 19:51