杭电 1212 Big Number

关注

原创最新推荐文章于 2026-06-22 14:30:06 发布 611 阅读 AI 写同款· GEO 优化 ›

『杭电1212』Big Number Problem Description As we know, Big Number is always troublesome. But it's really important in our ACM. And today, your task is to write a program to calculate A mod B. To make the problem easier, I promise that B will be smaller than 100000. Is it too h 阅读详情

链接地址：http://acm.hdu.edu.cn/showproblem.php?pid=1212

以下是我AC的代码。

#include <set>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;

#define pi 3.1415926535897932385
#define LL64 __int64
#define LL long long
#define N 20100
#define M 55

int main()
{
 int b;
 char a[1010];
 
 //freopen("data.in", "r", stdin);
 //freopen("data.out", "w", stdout);
 while (~scanf("%s%d", a, &b))
 {
  int s = strlen(a);
  int m = 0;
  for (int i = 0; i < s; i++)
  {
   m = m * 10 + a[i] - 48;
   if (m >= b) m %= b;
  }
  printf("%d\n", m);
 }
 
 return 0;
}