NYOJ-485 A*B Problem【九余数定理】

题目链接：http://acm.nyist.net/JudgeOnline/problem.php?pid=485

解题思路：

经典的九余数定理，可以参考这篇文章：http://blog.csdn.net/niushuai666/article/details/6856109

代码如下：

#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>using namespace std;int main(){int ncase;long long n, m;scanf("%d", &ncase);while(ncase--){long long temp;scanf("%lld%lld", &n, &m);if(n == 0 || m == 0){printf("0\n");continue;}temp = ((n % 9) * (m % 9)) % 9;if(temp == 0)printf("9\n");elseprintf("%lld\n", temp);}return 0;}