Number theory--congruence

HDU 1212 Topic Link Click to open link

Description: Given a large number a, the result of modulo B is obtained.

Problem analysis: Because A is large, you need to introduce a string for processing!

Algorithm Analysis: Congruence theorem

1. (m + N)% c = (m% c + n% c)% c

2. (m* N)% c = ((m% c) * (n% c))% c

3. (m ^ n)% c = ((m% c) ^ n)% c (this theorem can be used for fast power calculation for further discussion)

This problem requires the use of Theorem 1. For example: Set a large number m = 1234, modulo n.

The result is ((((1 *)% n + 2% n)% n% n + 3% n)% N. * Ten n + 4 N)% n

This problem code:

#include <iostream>using namespace Std;char a[1010];int main () {int b;while (cin >> a>> b) {int flag = 0;f or (int i = 0; A[i]! = ' + '; i++) flag = ((flag *)% B + (A[i]-' 0 ')%b)% b;cout << flag << Endl;} return 0;}

Large number of redundancy templates

/* Large number A, modulo b*/#include <iostream>using namespace Std;char a[1010];int main () {int b;while (cin >> a>> b) {in T flag = 0;                

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Number theory--congruence