We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
priority_queue<int, vector<int>, greater<int>> pq;
unordered_map<int, int> moves;
pq.push(n);
moves.insert(make_pair(n, 0));
int minMoves = 1e9;
while (!pq.empty()) {
int x = pq.top();
int m = moves.find(x)->second;
pq.pop();
if (x > 0 && m + 1 < minMoves) {
auto it = moves.insert(make_pair(x - 1, 1e9)).first;
if (it->second > m + 1) {
it->second = m + 1;
pq.push(x - 1);
if (x - 1 == 0) {
minMoves = it->second;
}
}
for (int k = (int)floor(sqrt(x)); k > 1; k--) {
if (x % k == 0) {
int factor = x / k;
auto it2 = moves.insert(make_pair(factor, 1e9)).first;
if (it2->second > m + 1) {
it2->second = m + 1;
pq.push(factor);
}
}
}
}
}
return minMoves;
}
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int n;
cin >> n;
cout << testCase(n) << endl;
}
return 0;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Down to Zero II
You are viewing a single comment's thread. Return to all comments →
include
include
include
include
include
include
include
using namespace std;
int testCase(int n) { if (n == 0) { return 0; }
}
int main() { int q; cin >> q;
}