(本人不求 AC,只是感觉有点奇怪)
CODE1:
| TC1,2,3 | 样例 | |
|---|---|---|
| 洛谷 | UNAC | UNAC |
| 本地 | AC | AC |
#include <bits/stdc++.h>
#define rty printf("Yes\n");
#define RTY printf("YES\n");
#define rtn printf("No\n");
#define RTN printf("NO\n");
#define rep(v,b,e) for(int v=b;v<=e;v++)
#define repq(v,b,e) for(int v=b;v<e;v++)
#define rrep(v,e,b) for(int v=b;v>=e;v--)
#define rrepq(v,e,b) for(int v=b;v>e;v--)
#define stg string
#define vct vector
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
void solve() {
}
#define int ll
main() {
// int t; cin >> t; while (t--) solve();
int n, m, k, x;
cin >> n >> m >> k >> x;
rep(i, 0, pow(10, k)) {
x += m;
x %= n;
}
cout << x;
return 0;
}
CODE2:
| TC1,2,3 | 样例 | |
|---|---|---|
| 洛谷 | AC | AC |
| 本地 | UNAC | UNAC |
#include <bits/stdc++.h>
#define rty printf("Yes\n");
#define RTY printf("YES\n");
#define rtn printf("No\n");
#define RTN printf("NO\n");
#define rep(v,b,e) for(int v=b;v<=e;v++)
#define repq(v,b,e) for(int v=b;v<e;v++)
#define rrep(v,e,b) for(int v=b;v>=e;v--)
#define rrepq(v,e,b) for(int v=b;v>e;v--)
#define stg string
#define vct vector
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
void solve() {
}
#define int ll
main() {
// int t; cin >> t; while (t--) solve();
int n, m, k, x;
cin >> n >> m >> k >> x;
rep(i, 1, pow(10, k)) {
x += m;
x %= n;
}
cout << x;
return 0;
}
唯一的区别就是第 27 行 rep 宏定义