提交记录 28676
| 提交时间 |
评测时间 |
| 2025-11-16 13:22:33 |
2025-11-16 13:22:36 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
void ftovec(string s, vector<int> &a) {
reverse(s.begin(), s.end());
for (int i = 0; i < s.size(); i++) {
a[i] = s[i] - '0';
}
}
void div(vector<int>a, int b, vector<int> &c, int &yu) {
yu = 0;
for (int i = c.size() - 1; i >= 0; i--) {
c[i] = (yu * 10 + a[i]) / b;
yu = (yu * 10 + a[i]) % b;
}
while (c.back() == 0 && c.size() > 1) {
c.pop_back();
}
reverse(c.begin(), c.end());
}
int main() {
string a1;
int b;
cin >> a1 >> b;
vector<int>a(a1.size(), 0), c(a1.size(), 0);
ftovec(a1, a);
int yu = 0;
div(a, b, c, yu);
for (int i : c) {
cout << i;
}
// cout << "\n余数:" << yu;
return 0;
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 348.69 us | 180 KB | Wrong Answer | Score: 0 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2025-11-17 10:30:48 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠