POJ
文章平均质量分 71
FrancisFun
做个安静的码农!
展开
-
Poj 1003hangover
#include using namespace std;#define MAX_LENGTH 10int main(){ int count = 0; double data[MAX_LENGTH]; double temp = 0.00; while(cin>>temp) { if(temp == 0.0原创 2015-05-03 20:24:29 · 318 阅读 · 0 评论 -
POJ Function Run Fun
#include using namespace std;int w[21][21][21] = {0};int fun(int a,int b,int c){ if(a<=0||b<=0||c<=0) return 1; else if(a<b&&b<c) return w[a][b][c-1]+w[a][b-1][c-1]-w[a][b-1][c]; else ret原创 2015-05-18 20:48:34 · 326 阅读 · 0 评论 -
POJ Common Subsequence
#include "stdafx.h"#include using namespace std;int main(){ char str_1[1024]; char str_2[1024]; int **length; while(cin>>str_1>>str_2) { int len_1 = strlen(str_1); int len_2 = strlen(str_原创 2015-05-18 19:03:18 · 321 阅读 · 0 评论 -
POJ 1400 Complicated Expressions
Complicated ExpressionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1543 Accepted: 498DescriptionThe most important activity of ACM is the GSM networ原创 2015-05-05 00:16:32 · 513 阅读 · 0 评论 -
POJ 1007 DNA Sorting
DNA SortingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 87954 Accepted: 35353DescriptionOne measure of ``unsortedness'' in a sequence is the number原创 2015-05-04 00:21:31 · 311 阅读 · 0 评论 -
POJ 1664 放苹果
放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27475 Accepted: 17427Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。原创 2015-05-03 23:13:17 · 273 阅读 · 0 评论 -
PoJ 1000
#include using namespace std;int main(){ int a,b; cin>>a>>b; if(a>=0&&b cout return 0;}原创 2015-05-03 19:54:38 · 337 阅读 · 0 评论 -
POJ 487-3279
#include using namespace std;#include int map(char ch){ int num = 0; switch(ch) { case 'A':case'B':case'C': num = 2; break; case 'D':case'E':case'F':原创 2015-05-03 22:02:48 · 435 阅读 · 0 评论 -
POJ Speed Limit
#include using namespace std;int main(){ int num = 0; while(cin>>num && num != -1) { int Time = 0; int distance = 0; for(int i = 0 ;i {原创 2015-05-03 20:30:55 · 303 阅读 · 0 评论 -
POJ Financial Management
#include using namespace std;int main(){ double sum = 0.00; double temp = 0.00; for (int i = 0;i { cin>>temp; sum+=temp; } cout return 0;}原创 2015-05-03 20:26:09 · 366 阅读 · 0 评论 -
POJ Symmetric Order
#include using namespace std;#include #include int main(){ int num = 0; int setCount = 0; string temp; vector data1; vector data2; while (cin>>num && num != 0)原创 2015-05-03 20:26:04 · 318 阅读 · 0 评论 -
POJ 1017-Packets
PacketsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 46785 Accepted: 15821DescriptionA factory produces products packed in square packets of the same he原创 2015-06-01 23:20:12 · 294 阅读 · 0 评论