Rating not available for this question.
Always it takes a lot of time for the problems of the last rounds to have a rating, is there a reason for that!!
for ex : Codeforces Global Round 23 problems
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Rating not available for this question.
Always it takes a lot of time for the problems of the last rounds to have a rating, is there a reason for that!!
for ex : Codeforces Global Round 23 problems
This is the problem I want to discuss : 1661B - Получение нуля
I have this answer, It's not mine but I made it cleaner (I think).
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int M = 32768;
vector<int> ans(M, -1);
ans[0] = 0;
function<int(int)> dfs = [&](int x) {
if(ans[x] != -1) return ans[x];
ans[x] = 1 + dfs(2 * x % M);
ans[x] = min(ans[x], 1 + dfs((x + 1) % M));
return ans[x];
};
int T; cin >> T;
while (T--) {
int n; cin >> n;
cout << dfs(n) << "\n";
}
return 0;
}
I have two questions and thank you in advance.
1) Why deleting this line : return ans[x]; gives wrong answer.
2) why changing the code into the 2 code below gives wrong answer :
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int M = 32768;
vector<int> ans(M, -1);
ans[0] = 0;
function<int(int)> dfs = [&](int x) {
if(ans[x] != -1) return ans[x];
ans[x] = min(1 + dfs(2 * x % M), 1 + dfs((x + 1) % M));
return ans[x];
};
int T; cin >> T;
while (T--) {
int n; cin >> n;
cout << dfs(n) << "\n";
}
return 0;
}
Name |
---|