- 博客(3)
- 收藏
- 关注
RSS订阅原创 Dijkstra算法代码
#include stdio.h>#include memory.h>#define INF 0x7fffffffint Dijkstra(int* Graph,int N,int a,int b)...{ if(a==b) return 0; int* minLength=new int[N]; int i,j; int length,pointer;
2007-12-27 22:37:00
695
原创 blowfish算法之VC实现
#include stdio.h>#include memory.h>#include string.h>#define SBOX_BEGIN 18const unsigned long sbox[4][256]=...{ ...{ 0xd1310ba6, 0x98dfb5ac, 0x2ffd72db, 0xd01adfb7, 0xb8e1afed, 0x6a267e
2007-07-04 17:13:00
3233
1
原创 md5 之VC实现
#include #include #include #include const unsigned int s[4][4]={ {7,12,17,22},{5,9,14,20}, {4,11,16,23},{6,10,15,21}};const unsigned long t[64]={//t[i]=4294967296*fabs(sin(i+1)); 0xd76aa478,0xe8c7b
2007-07-03 12:21:00
2062
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人