谙绿Acm

http://acm.hdu.edu.cn/showproblem.php?pid=1372#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>#include <queue>using namespace std;struct node{ int xx,yy; int step;

http://acm.hdu.edu.cn/showproblem.php?pid=1016#include <iostream>#include <stdio.h>#include <String.h>using namespace std;int flag[25];int n;int sum(int k){ for(int i=2;i*i<=k;i++){ i

http://acm.hdu.edu.cn/showproblem.php?pid=1241#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int dir[8][2]={{1,0},{-1,0},{0,-1},{0,1},{-1,-1},{1,1},{-1,1},{1,-1}};int m,

http://acm.hdu.edu.cn/showproblem.php?pid=1242 题意有一个信息，，天使的朋友可能有多个，即’r’有多个，而’a’只有一个，，所以搜索时，从天使的位置搜索。再用广搜就可以了。#include <iostream>#include <queue>#include <cstdlib>#include <cstdio>#include <cstring

http://acm.hdu.edu.cn/showproblem.php?pid=1518#include <iostream>#include <cstdio>#include <cstring>using namespace std;int tt,num[25],flag[25],aver,f;void dfs(int length,int count,int k){ if(f

import java.security.MessageDigest;import org.junit.Test;import sun.misc.BASE64Encoder;public class MD5Demo { @Test public void md5Demo() throws Exception{ String pwd="1234"; Me