#include<bits\/stdc++.h>
\nusing namespace std;
\nlong long n, i, s;
\nbool f;
\nint main() {
\n cin >> n >> i;
\n for (long long k = 1; 1; k++) {
\n f = true;
\n s = k * n + i;
\n for (long long j = 1; j <= n – 1; j++) {
\n if (s % (n – 1) != 0) {
\n f = false;
\n break;
\n }
\n s = s * n \/ (n – 1) + i;
\n }
\n if (f == true) break;
\n }
\n cout << s << endl;
\n return 0;
\n}<\/p>\n
\u4f5c\u54c1\u5236\u4f5c\u4e0d\u6613 ，\u7ed9\u535a\u4e3b\u70b9\u4e2a\u8d5e\u5427！<\/p>\n","protected":false},"excerpt":{"rendered":"
#include
\nusing namespace std;
\nlong long n, i, s;
\nbool f;
\nint main() {cin >> n >> i;for (long long k 1; 1; k) {f true;s k * n i;for (long long j 1; j < n – 1; j) {if (s % (n – 1) ! 0) {f false;break;}s s * n \/ (n – 1) i;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[55,190,427],"topic":[],"class_list":["post-71149","post","type-post","status-publish","format-standard","hentry","category-server","tag-c","tag-190","tag-427"],"yoast_head":"\n