8000 Update 11931.cpp · ingbeeedd/basic-algo-lecture@f1ffa25 · GitHub
[go: up one dir, main page]

Skip to content

Commit f1ffa25

Browse files
Update 11931.cpp
1 parent baf2e16 commit f1ffa25

File tree

1 file changed

+8
-4
lines changed

1 file changed

+8
-4
lines changed

0x0E/solutions/11931.cpp

Lines changed: 8 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// Authored by : heheHwang
2-
// Co-authored by : -
3-
// http://boj.kr/59807f1dc1524512a0840b4ebb8998c9
2+
// Co-authored by : BaaaaaaaaaaarkingDog
3+
// http://boj.kr/7a7deeedae3b4177a1ed53482685bf15
44
#include <bits/stdc++.h>
55
using namespace std;
66

@@ -16,6 +16,10 @@ int main(void) {
1616
cin >> t;
1717
isnum[t + HALF] = true;
1818
}
19-
for (int i = MXN; 0 <= i; i--)
19+
for (int i = MXN; i >= 0; i--)
2020
if (isnum[i]) cout << i - HALF << '\n';
21-
}
21+
}
22+
23+
/*
24+
수의 등장 여부만 확인, 인덱스를 0에서부터 시작할 수 있게 1,000,000을 더함.
25+
*/

0 commit comments

Comments
 (0)
0