자라는 개발자

백준 27964 콰트로치즈피자 https://www.acmicpc.net/problem/27964 #include #include #include using namespace std; void fast_io(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int main(void) { fast_io(); set s; int n=0; string check = "Cheese"; cin >> n; while(n--) { string str; cin >> str; if(str.find(check,str.size()-6)!=string::npos) s.insert(str); } if(s.size() >= 4) cout

13238 Bitcoin investment 문제풀이 #include #include int num; using namespace std; int main(void) { cin >> num; vector v(num); for(int i=0;i> v[i]; if(num==1) { cout

1817 짐 챙기는 숌 문제풀이 #include #include #include using namespace std; void fast_io(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int num,weight,cnt; vector v; int main(void) { fast_io(); cin >> num >> weight; int tmp = weight; while(num--) { int book; cin >> book; if(tmp-book

16460 Cupid 문제풀이 #include #include #include using namespace std; void fast_io(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } struct lover{ string name; int dis_len; string gender; }; vector v; int main(void) { fast_io(); struct lover l1; cin >> l1.name >> l1.gender >> l1.dis_len; int num; cin >> num; for(int i=0;i> l2.name >> l2.gender >> l2.dis_len; if((l1.gender.len..

19709 LunchBox 문제풀이 #include #include #include using namespace std; void fast_io(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int alpha[26] = {3,2,1,2,3,3,2,3,3,2,2,1,2,2,1,2,2,2,1,2,1,1,1,2,2,1}; string a,b; vector v; int main(void) { fast_io(); cin >> a >> b; for(int i=0;i2) { vector val; for(int i=0;i

19709 LunchBox 문제풀이 #include #include #include using namespace std; void fast_io(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int n,m; int main(void) { fast_io(); cin >> n >> m; vector v(m); for(int i=0;i> v[i]; sort(v.begin(),v.end()); int tmp = 0,cnt=0; for(int i=0;i

11728 배열 합치기 문제 풀이 #include #include #include using namespace std; void fast_io(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int a,b; int main(void) { fast_io(); cin >> a >> b; int c=a+b; vector v(c); for(int i=0;i> v[i]; sort(v.begin(),v.end()); for(auto i=0;i

9933 민균이의 비밀번호 문제풀이 #include #include #include using namespace std; void fast_io(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int t; vector v; vector rv; int main() { fast_io(); cin >> t; for(int i=0;i> tmp; v.push_back(tmp); reverse(tmp.begin(),tmp.end()); rv.push_back(tmp); } for(int i=0;i

11645 I've Been Everywhere, Man 문제풀이 #include #include using namespace std; map m; int main(void) { int t; cin >> t; while(t--) { int cities; cin >> cities; for(int i=0;i> str; if(!m[str]) m.insert({str,true}); } cout

15577 prosjek 문제풀이 #include #include #include using namespace std; void fast_io(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } float q,n; vector v; int main(void) { fast_io(); cin >>q; for(int i=0;i> a; v.push_back(a); } sort(v.begin(),v.end()); for(int i=1;i