https://programmers.co.kr/learn/courses/30/lessons/87390
#include <iostream>
#include <vector>
using namespace std;
vector<int> solution(int n, long long left, long long right)
{
vector<int> answer;
int cur_i, cur_j;
for (long long i = left; i <= right; i++)
{
cur_i = i / n;
cur_j = i % n;
if (cur_i > cur_j)
answer.push_back(cur_i + 1);
else
answer.push_back(cur_j + 1);
}
return answer;
}
int main(void)
{
int n1 = 3, left1 = 2, right1 = 5;
int n2 = 4, left2 = 7, right2 = 14;
vector<int> sol = solution(n1, left1, right1);
return 0;
}