8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent da90cdc commit 4a7fa01Copy full SHA for 4a7fa01
0x15/solutions/13414.cpp
@@ -1,6 +1,6 @@
1
// Authored by : diyamea
2
// Co-authored by : BaaaaaaaaaaarkingDog
3
-// http://boj.kr/848301746aac4a92872d58a8a5e8d596
+// http://boj.kr/ccd33d92a6564257b16e6503e29f7400
4
#include <bits/stdc++.h>
5
using namespace std;
6
@@ -17,12 +17,7 @@ int main(void){
17
for(int i=0; i<l; ++i) {
18
string student_num;
19
cin >> student_num;
20
- if(signup.find(student_num) != signup.end()) {
21
- signup.erase(student_num);
22
- signup[student_num] = i;
23
- }
24
- else
25
+ signup[student_num] = i;
26
}
27
vector<pair<string,int>> slist (signup.begin(), signup.end());
28
// 이 문법이 익숙하지 않으면 익명 함수 or 람다 식 검색
0 commit comments