Factovisors-ACM

算法：（a*b）mod n=((a mod n)*(b mod n))mod n.

// Factovisors.cpp : Defines the entry point for the console application.//#include "stdafx.h"using namespace std;int _tmain(int argc, _TCHAR* argv[]){int Mod(int n,int m);unsigned int n=0;unsigned int m=0;while(cin>>n>>m){if(n==0&&m==0)break;else{if(Mod(n,m)==0) cout<<m<<" divides "<<n<<"/n";else cout<<m<<" does not divides "<<n<<"/n";}}return 0;}int Mod(int n,int m){if(n==1) return 1;else{int result1=n%m;int result2=Mod(n-1,m);int result=(result1*result2)%m;return result;}}