2012年5月11日
摘要:
http://poj.org/problem?id=1273#include<iostream>#include<cmath>#include<string>#include<algorithm>#include<queue>#include<cstring>#include<cstdio>using namespace std;const int MAX=2000000005;const int N=205;int h[N];int flow[N][N];int Bfs(int n){ memset(h,0, 阅读全文
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=1850#include<iostream>#include<cmath>#include<string>#include<algorithm>#include<cstring>#include<cstdio>using namespace std;int a[105];int main(){ int n; while(cin>>n) { if(n==0) break; int sum=0; for(int i=1;i<= 阅读全文
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=1846最简单的博弈论#include<iostream>#include<cmath>#include<string>#include<algorithm>#include<cstring>#include<cstdio>using namespace std;int main(){ int C; cin>>C; while(C--) { int n,m; cin>>n>>m; if(n%(m+1)== 阅读全文