- 博客(10)
- 资源 (1)
- 收藏
- 关注
原创 HDU 1869 六度分离(Floyd)
#include #include #include #include using namespace std; #define INF 10000000 int n,m; int a[105][105]; void warashall_floyd(){ for(int k=0;k<n;k++){ for(int i=0;i<n;i++){ for(int j=0;j<n;j+
2014-10-06 21:00:50 568
原创 HDU 1203 I NEED A OFFER!(比较有趣的0-1背包)
#include #include #include #include using namespace std; struct node { int money; double possibility; }a[10005]; double dp[10005]; int main(){ int n,m; while(scanf("%d%d",&n,&m)==2&&(m||n)){
2014-10-06 20:27:19 586
原创 poj 1035
Spell checker Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19298 Accepted: 7053 Description You, as a member of a development team for a new spell check
2014-10-01 14:46:20 527
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人