模拟
关注
分享
扫一扫
文章平均质量分 75
fyfcauc
这个作者很懒，什么都没留下…
展开
-
poj-1140
//360K 32MS G++#include #include #include using namespace std;const int MAX = 1001;int pos[MAX];int F, D;// string res;char res[MAX];int repeatLength;const int LINE_LENGTH = 50;原创 2014-09-09 13:37:01 · 602 阅读 · 0 评论 -
poj-1563
//364K 0MS G++#include #include using namespace std;double fatigueFactor;double slideDistance;double climbDistance;double wellHeight;void solve() { int day = 1; double height = 0;原创 2014-09-09 14:20:41 · 521 阅读 · 0 评论 -
poj-1565
//672K 0MS G++#include #include #include #include using namespace std;string number;long long res;long long digitVal[33];void printDecimal(const string & number) { int size = number.原创 2014-09-09 14:41:35 · 501 阅读 · 0 评论 -
poj-1029
//396K 16MS G++#include #include using namespace std;const int MAX = 1005;int coins[MAX]; char coinIsTrue[MAX];char appear[MAX];int leftPart[MAX];int rightPart[MAX];int coinNum;int wei原创 2014-09-13 10:44:53 · 570 阅读 · 0 评论 -
poj-1019
//652K 0MS G++#include #include int caseNum;long long numberAcc[31300];void init() { int curIncStep = 1; long long sum = 0; long long length = 0; long long carry = 10; for原创 2014-09-15 13:52:05 · 433 阅读 · 0 评论 -
poj-1026
#include #include #include using namespace std;char str1[205];char str2[205];int key[205];int cycleLength[205];// void replace(char * str, int keyLength, int strLength) {// memset(st原创 2014-09-16 20:04:15 · 508 阅读 · 0 评论 -
poj-1120
//408K 16MS G++#include #include using namespace std;int dish[20][20];int K[20][20];int D[16];int days;int getDensitySum(int rowId, int columnId) { int K = 0; K += dish[rowId]原创 2014-09-17 10:12:40 · 587 阅读 · 0 评论