#include <stdio.h>
int main()
{
int a, b, c, i = 1, cnt = 0, m[110] = {0};
while (scanf_s("%d %d %d", &a, &b,&c) != EOF) {
if (a == 0 &&b==0&&c==0) break;
int n = a % b;
a /= b;
for ( i = 0; i <= c; i++) {
m[i] = n * 10 / b;
n = n * 10 % b;
}
if (m[c] >= 5) { //判断是否进位
m[c-1] += 1;
}
cnt++;
printf("case%d:%d.", cnt, a);
for (int j = 0; j < c; j++) {
printf("%d", m[j]);
}
}
return 0;
}
算法竞赛二 2-5分数化小数
最新推荐文章于 2024-10-08 23:13:16 发布