Program Programming Programmer

문제: https://www.acmicpc.net/problem/3020 문제A Japanese firefly has flown into a cave full of obstacles: stalagmites (rising from the floor) and stalactites (hanging from the ceiling). The cave is N units long (where N is even) and H units high. The first obstacle is a stalagmite after which stalactites and stalagmites alternate. Here is an example cave 14 units long and 5 units high (the image co..

문제: https://www.acmicpc.net/problem/1026 1000번과 1001번 이후로 가장 쉬운 문제인거 같네요. my solvingc++12345678910111213141516171819202122232425262728293031323334353637383940#include #include #include #include #include #include using namespace std;typedef long long ll; int main(){ int n; cin >> n; vector a, b; for (int k = 0; k num; if (k == 0) a.push_back(num); else b.push_back(num); } } sort(a.begin(), a.end(..

문제: https://www.acmicpc.net/problem/1015 간단한 정렬 문제입니다. 직접 정렬을 구현하지 않고 std의 multimap 을 이용해 풀었습니다. my solvingc++123456789101112131415161718192021222324252627282930313233343536373839404142434445#include #include #include #include #include using namespace std; int main(){ int n; vector numbers; cin >> n; multimap sortedNumbers; for (int i = 0; i > num; numbers.push_back(num); sortedNumbers.insert(ma..

At an old railway station, you may still encounter one of the last remaining ``train swappers''. A train swapper is an employee of the railroad, whose sole job it is to rearrange the carriages of trains.Once the carriages are arranged in the optimal order, all the train driver has to do, is drop the carriages off, one by one, at the stations for which the load is meant.The title ``train swapper'..