数据结构编程实验04
文章平均质量分 67
smaracoon
这个作者很懒,什么都没留下…
展开
-
POJ1504 ZOJ2001 Adding Reversed Numbers
//4_2_1: Adding Reversed Numbers反向数相加POJ1504 ZOJ2001//程序可以运行大型整数,就是比longlong还要long的,因为是用数组处理的//注意前0和后0都要处理#include #include #include using namespace std;int main(){ int i,j,N,counta,原创 2015-03-25 18:50:49 · 174 阅读 · 0 评论 -
POJ1159 Palindrome
//4_7_16: Palindrome 回文词的构造 POJ1159#include #include #include using namespace std;int main(){ char str1[5005]; char str2[5005]; short len[2][5005]; int i,j,N; scanf("%d%s",&N,str原创 2015-04-02 21:36:34 · 208 阅读 · 0 评论 -
POJ2406 ZOJ 1905 Power Strings
//4_7_17: Power Strings 字符串分解为连乘串 POJ2406 ZOJ 1905#include #include #include using namespace std;const int maxc = 1000000 + 10;int len;int suf[maxc];char str[maxc]; //如果数据非常大就最好在子函数中不要用形参了,原创 2015-04-03 00:25:48 · 188 阅读 · 0 评论 -
POJ1080 ZOJ1027 Human Gene Functions
//4_7_15: Human Gene Functions 基因序列匹配 POJ1080 ZOJ1027#include #include #include using namespace std;int score[5][5] = {{-1000,-3,-4,-2,-1},{-3,5,-1,-2,-1},{-4,-1,5,-3,-2},{-2,-2,-3,5,-2},{原创 2015-04-02 16:10:27 · 185 阅读 · 0 评论 -
POJ2192 ZOJ2401 Zipper
//4_7_10: Zipper 字符串组成问题,次序需要相同 POJ2192 ZOJ2401#include #include #include using namespace std;int main(){ char str1[210],str2[210],str3[410]; int len1,len2; int i,j,k,n; int can[21原创 2015-03-31 23:28:38 · 260 阅读 · 0 评论 -
POJ1396 ZOJ2017 Simple Arithmetics
//4_7_28: Simple Arithmetics 打印加减乘计算过程 POJ1396 ZOJ2017#include #include #include using namespace std;const short maxc = 1000 + 10;const short maxn = 500 + 10;short max(short a,short b,short c)原创 2015-04-10 00:45:56 · 310 阅读 · 0 评论 -
POJ2752 Seek the Name Seek the Fame
//4_7_19: Seek the Name Seek the Fame Cat给婴儿取名字POJ2752#include #include #include using namespace std;const int maxc = 400000 + 10;int len;int suf[maxc];int ans[maxc];char str[maxc];void原创 2015-04-03 15:21:28 · 215 阅读 · 0 评论 -
POJ1598 ZOJ1315 Excuses,Excuses!
//4_7_20: Excuses,Excuses! 寻找在借口中的最多关键字 POJ1598 ZOJ1315#include #include #include using namespace std;char enter,key[25][25],sen[25][100],temp[100],word[100];int key_cnt[25],sen_cnt[25];int ma原创 2015-04-03 21:47:47 · 259 阅读 · 0 评论 -
POJ2141 Message Decowding
//4_7_13: Message Decowding 奶牛信息加密 POJ2141#include #include #include using namespace std;int main(){ char key[30]; char input[100]; int i = 0; cin.getline(key,30); cin.getline(in原创 2015-04-01 17:26:55 · 209 阅读 · 0 评论 -
POJ1961 ZOJ2177 Period
//4_7_18: Period 求字符串的所有前缀周期 POJ1961 ZOJ2177#include #include #include using namespace std;const int maxc = 1000000 + 10;int len;int suf[maxc];char str[maxc];void KMP(){ len = strlen(str原创 2015-04-03 12:24:20 · 165 阅读 · 0 评论 -
POJ3337 Experssion Evaluator
//4_7_22: Experssion Evaluator ++和--字符串的求值 POJ3337#include #include #include using namespace std;int main(){ int i,j,T,value,length,flag[30],alpha[30]; char sign,enter,str[100],ans[100],org[10原创 2015-04-04 13:33:21 · 224 阅读 · 0 评论 -
POJ1503 ZOJ1292 Integer Inquiry
//4_7_23: Integer Inquiry 高精度整数累加 POJ1503 ZOJ1292#include #include #include using namespace std;int main(){ int i,j,temp,plus,count,length; char str[110][110]; int ans[210]; int cnt = 0; in原创 2015-04-04 15:31:57 · 229 阅读 · 0 评论 -
POJ2413 ZOJ1962 How many Fibs
//4_7_31: How many Fibs 区间内的Fibonacci数的个数 POJ2413 ZOJ1962//计算得出Fibonacci数到10^100的时候具有475位#include #include #include using namespace std;short F1[120],F2[120],ans[120];char Fib[500][120];int s原创 2015-04-10 18:44:36 · 256 阅读 · 0 评论 -
POJ1782 ZOJ2240 Run Length Encoding
//4_7_9: Run Length Encoding 字符串编码程序 POJ1782 ZOJ2240#include #include #include using namespace std;int main(){ int i,cnt,start; char str[10000]; while(gets(str)) { i = 0; sta原创 2015-03-31 17:14:08 · 257 阅读 · 0 评论 -
POJ2121 ZOJ2311 Inglish-Number Translator
//4_7_12: Inglish-Number Translator 英语转数字 POJ2121 ZOJ2311#include #include #include using namespace std;char word[32][10] = {"zero","one","two","three","four","five","six","seven","eight","n原创 2015-04-01 20:27:26 · 212 阅读 · 0 评论 -
POJ2080 ZOJ2420 Calendar
//4_1_1: Calendar 从2000年1月1日起给定天数求日期POJ2080,ZOJ2420#include #include using namespace std;const char week_str[][10] = {"Saturday","Sunday","Monday", "Tuesday","Wednesday","Thursday","Frida原创 2015-03-25 10:42:23 · 250 阅读 · 0 评论 -
POJ1555 ZOJ1720 Polynomial Showdown
//4_3_1: Polynomial Showdown 给出从8到0的多项式系数,然后输出 POJ1555 ZOJ1720#include int main(){ int a[9]; int i,j; while(scanf("%d",&a[8]) != EOF) { for(i = 7;i >= 0;i --) scanf("%d",&a[i]); j原创 2015-03-25 21:03:21 · 286 阅读 · 0 评论 -
POJ2260 ZOJ1949 Error Correction
//4_4_1: Error Correction 布尔矩阵奇偶均势特性的保持POJ2260 ZOJ1949#include #include #include using namespace std;int main(){ int n,i,j,k,row_cnt,col_cnt; int row[100],col[100],matrix[100][100];原创 2015-03-26 16:06:16 · 184 阅读 · 0 评论 -
POJ1060 ZOJ1026 Modular multiplication of polynomials
//4_3_2: Modular multiplication of polynomials 多项式相乘再取模 POJ1060 ZOJ1026//f(x) * g(x) % h(x)#include #include #include using namespace std;int compare(int mul[],int mul_num,int h[],int h_nu原创 2015-03-26 11:24:49 · 183 阅读 · 0 评论 -
POJ 1488 TEX Quotes
//4_5_1: TEX Quotes 双引号变换 POJ 1488#include #include #include using namespace std;const char str[2][3] = {"``","''"};int main(){ char c; //如果是单纯字符串可以用一个字符输出 int flag = 0; //flag =原创 2015-03-26 18:12:29 · 214 阅读 · 0 评论 -
POJ2246 ZOJ1094 Matrix Chain Multiplication
//4_4_2: Matrix Chain Multiplication 给出矩阵求计算次数 POJ2246 ZOJ1094#include #include #include using namespace std;struct node{ int x; int y;}matrix[26];int main(){ int i,n,x,y,ans,t原创 2015-03-26 17:40:33 · 228 阅读 · 0 评论 -
POJ1220 ZOJ1352 NUMBER BASE CONVERSION
POJ1220,ZOJ1352 将一个进制的数转换成另一个进制的数#include #include #include using namespace std;int char2int(char bit){ if(bit >= '0' && bit <= '9') return (int)(bit - '0'); else if(bit >= 'A' && b原创 2015-03-19 23:07:46 · 207 阅读 · 0 评论 -
POJ2527 Polynomial Remains
//4_7_6: Polynomial Remains 多项式整除后的余数 POJ2527#include #include #include using namespace std;const int maxw = 10000 + 10;int main(){ int a[maxw] = {0}; int i,n,k; while(1) { sc原创 2015-03-30 10:14:57 · 226 阅读 · 0 评论 -
POJ3080 ZOJ2784 Blue Jeans
//4_6_1: Blue Jeans 求DNA串的公共字串 POJ3080 ZOJ2784#include #include #include using namespace std;int main(){ int i,j,k,n,m,len; char ans[65],sub[65],str[12][65]; cin >> n; while(n --)原创 2015-03-29 10:47:53 · 286 阅读 · 0 评论 -
POJ3461 Oulipo
//4_6_2: Oulipo计算单词在文本中出现的次数 POJ3461#include #include #include using namespace std;const int maxt = 1000000 + 10;const int maxw = 10000 + 10;int cnt;int nextval[maxw];void KMP(char s原创 2015-03-29 12:28:14 · 164 阅读 · 0 评论 -
POJ3751 时间日期格式转换
//4_7_1: 时间日期格式转换 POJ3751#include #include #include using namespace std;int main(){ int i,T,flag,count; char str[25],ans[25]; cin >> T; while(T --) { cin >> str; count = 0;原创 2015-03-29 15:40:04 · 471 阅读 · 0 评论 -
POJ2351 ZOJ1916 Time Zones
//4_7_5: Time Zones 世界时区的转换 POJ2351 ZOJ1916#include #include #include using namespace std;char zone[32][5]={"UTC","GMT","BST","IST","WET","WEST","CET","CEST", "EET","EEST","MSK","MSD","原创 2015-03-29 22:30:55 · 224 阅读 · 0 评论 -
POJ1001 Exponentiation
//4_7_25: Exponentiation 求实数R的n此方 POJ1001#include #include #include using namespace std;int main(){ int i,j,k,n,cnt,start,end,sign,dec,temp,carry,Integer; int R[10],ans[200],tep[200],ans_cnt,t原创 2015-04-08 12:02:15 · 232 阅读 · 0 评论