Codeforces Round #701 (div.2) A

Codeforces Round #701 (div.2)

---

A. Add and Devide

(solved)

 Problem 

Problem - A - Codeforces

 Code 

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
 
using namespace std;
 
int tc = 0;
vector<int> ans;
 
struct pos {
    int count;
    int a;
    int b;
};
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
 
    cin >> tc;
 
    while (tc--) {
        int a, b;
        cin >> a >> b;
 
        int count = 0;
 
        queue<pos> Q;
        Q.push({ 0, a, b });
 
        while (!Q.empty()) {
            pos temp = Q.front();
            Q.pop();
 
            int& cnt = temp.count;
            int& A = temp.a;
            int& B = temp.b;
 
            if (!(A / B)) {
                ans.push_back(cnt + 1);
                break;
            }
 
            Q.push({ cnt + 1, A / B, B });
            Q.push({ cnt + 1, A, B + 1 });
        }
    }
 
    for (auto e : ans) cout << e << '\n';
}

 How to solve 

  BFS를 이용하여 구현하였다.