lickelon.log

문제 링크 : boj.kr/11645난이도 : S5태그 : 문자열, 셋코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int T; cin >> T; while(T--) { int n; cin >> n; set _s; for(int i = 0; i > s; ..

문제 링크 : boj.kr/27111난이도 : S5태그 : 셋코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); unordered_set _s; int n; cin >> n; int ans = 0; for(int i = 0; i > a >> b; if(b) { if(_s.find(a..

문제 링크 : boj.kr/2002난이도 : S2태그 : 맵, 셋코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; map _m; for(int i = 0; i > s; _m[s] = i+1; } vector arr; set _s; for(int i = 0..