POJ 2109 Power of Cryptography【高精度+二分 Or double水过~~】
题目链接:http://poj.org/problem?id=2109参考:http://blog.csdn.net/code_pang/article/details/8263971题意:给定n,p,求k使得kn=p(1≤n≤200,1≤p
#include
#include
#include
usingnamespacestd;
#defineMAXN9999
#defineMAXSIZE10