Baekjoon(C++) 썸네일형 리스트형 [C++]백준 알고리즘 1269번 풀이는 아래와 같다. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 #include #include using namespace std; int main(){ int a,b; map m; scanf("%d %d",&a,&b); int* first = new int[a]; int* second = new int[b]; for(int i=0;i 더보기 Hello World! I'm currently a undergraduate student of Electrical and Computer Engineering, SNU. Starting to get interested in many fields of computers, searching and studying about Programming, information security,OS etc. I'm not sure of my future, so I made this blog to leave traces of my journey to the world of computers. As the title of this post says, #include using namespace std; int main(){ cout 더보기 이전 1 ··· 3 4 5 6 다음
