2015年8月15日
hdu 5392 Zball in Tina Town(素数)
题意：求(x-1)!modx(x#include#includeusing namespace std;int t,n,m;int main(){ int i,j,k,flag; scanf("%d",&t); while(t--){ scanf("%d",&n); if(n... Read More
posted @ 2015-08-15 22:57 dominating大树置林 Views(200) Comments(0) Diggs(0)
poj 1769 Minimizing maximizer(dp+线段树)
题意：数列长度为n，m次操作(n1); 对于每个i，有dp[ti]=min(dp[ti],min(dp[j](si#include#includeusing namespace std;#define inf 0x3f3f3f3fint dp[5000100];int num[5000100]... Read More
posted @ 2015-08-15 03:09 dominating大树置林 Views(236) Comments(0) Diggs(0)