[PS] BaekJoon 2805
#include <iostream>
#include <vector>
using namespace std;
long N, M;
vector<long> Trees;
long Solve()
{
long start = 0;
long end = 1000000000;
long height = (start + end) / 2;
long sum = 0;
while (true)
{
for (int i ...
sungwoolee.hashnode.dev1 min read