Sparse Big Integer

大数取余

#include<iostream>
#include<cstdio>

using namespace std;

typedef long long LL;

const int maxn = 15;
LL D[ maxn ], P[ maxn ], n, ans, sum, temp;

LL Digit( int k ){
	
	temp = 10;
	sum = 1;
	if( !k ){
		return 1;
	}
	while( k != 0 ){
		if( k % 2 == 0 ){
			temp = ( temp * temp ) % n;
			k /= 2;
		}
		else{
			k--;
			sum = ( sum * temp ) % n;
		}
	}
	return sum;
}

int main(){
	
	int Case, m;
	cin >> Case;
	while( Case-- ){	
		cin >> m;
		for( int i = 0; i < 10; ++i ){
			D[ i ] = P[ i ] = 0;
		}
		
		for( int i = 0; i < m; ++i ){
			cin >> D[ i ] >> P[ i ];
		}
		
		cin >> n;
		ans = 0;
		for( int i = 0; i < m; ++i ){
			if( D[ i ] ){
				//cout << Digit( P[ i ] ) << endl;
				ans = ( ans + ( D[ i ] * Digit( P[ i ] - 1 ) ) % n ) % n;
			}
		}
		
		cout << ans << endl;
	}
	return 0;
}