其他

題目連結：http://acm.hdu.edu.cn/showproblem.php?pid=1853我的連結：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=17728#problem/CKM演算法模板：http://blog.csdn.net/cfreezhan/article/details/8246639用KM求最小費用模板題：http://blog.csdn.net/cfreezhan/article/details/8256

歡迎來到CSUST Online Judge System1530: 快速找錢Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 5  Solved: 3SubmitStatusWeb

題目：http://acm.hdu.edu.cn/diy/contest_show.php?cid=20083密碼：shuacm感覺他們學校的新生訓練出的比較好。今天很多題目都是強化了背包的轉化。關於背包轉化成求最優解見分析：點擊開啟連結貼個背包的模板：//0-1背包, 代價為 cost, 獲得的價值為 weight// 每種物品最多隻可以選一次void ZeroOnePack(int cost, int weight){ for(int i = nValue; i >= cost;

RochambeauTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1603 Accepted: 556DescriptionN children are playing Rochambeau (scissors-rock-cloth) game with you. One of them is the judge. The rest children are divided into three groups (it is

方法：一、枚舉（此處所用）          二、用二進位記錄下標（尚未實現）         三、類比於玩魔方遊戲（思路來自黃超，尚未實現）原題連結：http://poj.org/problem?id=1753Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21024 Accepted: 9108DescriptionFlip game is played on a rectangular 4x4

How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1384    Accepted Submission(s): 562Problem DescriptionTT and FF are ... friends. Uh... very very good friends -________-

XYZZYTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1461    Accepted Submission(s): 361Problem DescriptionIt has recently been discovered how to run open-source software on the Y-Crate gaming

原作者已經找不到了，但是我是從CSUST的部落格欄中看到的，一個很好的模板。我看到的文章來源（不是原出處）：http://blog.csdn.net/csust_acm/article/details/7268029//大數相加#include <stdio.h>#include<string.h>int main(){int i,d,j,d1;char a[100];int b[101]={0};int c[100]={0};//

#include <stdio.h>#include<string.h>int main(){int i,d,j,d1;char a[100];int b[101]={0};int c[100]={0};// memset(b,0,sizeof(b));// memset(c,0,sizeof(c));scanf("%s",a);d=strlen(a);  for(i=d-1,j=0;i>=0;i--)  b[j++]=a[i]-'0';scanf("%s",a);

DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a

經典完全背包入門題目題目連結：http://acm.hdu.edu.cn/showproblem.php?pid=1114Piggy-BankTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5450    Accepted Submission(s): 2714Problem DescriptionBefore ACM can do

媽啊，這竟然是一道離散數學題、、、什麼析取、合取、非、蘊含式、等價了。。。。多虧期末考試結束不久啊否則就sad了啊、、、、大體的題意就是求所給的式子是否為永真式、、、一共有五個元素，，，所給的字串倒著看就是式子的尾碼運算式。。先轉換在判斷。。2^5一共32種情況進行枚舉有假的情況就標記輸出not否則就是tautology、、、、不再贅述下面是代碼。。。#include <stdio.h>#include <stdlib.h>#include

其實是ORc學了告訴我們的,平時找錯太坑了，這裡先貼一下。。。對拍都不會，太落伍了有木有#include<stdlib.h>#include<stdio.h>int main(){    freopen("myin.txt", "r", stdin);    freopen("myout.txt","w", stdout);    int a,b;    int i;    for(i=1;i<=100;i++)    {      a=rand()%100+1; 

標頭檔 #include<queue>構建隊列 queue<int(資料的類型)>q（隊列的名字)如果隊列為空白返回true， 否則返回false

連結: http://poj.org/problem?id=1321http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22009#problem/D棋盤問題Time Limit: 1000MS Memory Limit: 10000KTotal

連結：http://poj.org/problem?id=2251http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22009#problem/EDungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14103 Accepted: 5477DescriptionYou are trapped in a 3D dungeon and need to

DP背包問題（關於搶銀行成功機率） 題目連結：http://acm.hdu.edu.cn/showproblem.php?pid=2955RobberiesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4778    Accepted Submission(s): 1808Problem DescriptionThe aspiring

一個類比+bfs就可以水過但是代碼量稍微有點大啊、、、不多說了啊滿滿的都是淚啊，由於bfs標記的錯誤，RE了十次啊！（bfs每次入隊都要進行標記啊！！一定要記住啊！！！）後來又是跳出迴圈break的位置寫錯了啊，又是WA啊，寫了前前後後八九個小時啊！不停地出錯啊、、、菜鳥傷不起啊，智商真是著急啊、、、Children of the Candy CornTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8108 Accepted: 

連結：http://poj.org/problem?id=3414http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22009#problem/JPotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8253 Accepted: 3499 Special JudgeDescriptionYou are given two pots, having the volume