题解 | 牛牛的digit
牛牛的digit
https://www.nowcoder.com/practice/21b49f1f495f4280b8a96c415deaa3c4
#include <stdio.h>
int main() {
int x, i,j;
int mod=1;
scanf("%d %d", &x, &i);
for (j=1; j<=i; j++) {
mod=mod*10;
}
printf("%d\n",x%mod);
return 0;
}
查看15道真题和解析