ACM 栈类
青山绿水之辈
奋斗青春年华
展开
-
hdu1702(栈和队列)
#include#includeint t,n,m[1000];char a[1000][10],s[10],in[1000][12];int main(){ scanf("%d",&t); while(t--) { int i,j,m1[10000];原创 2013-04-22 19:19:40 · 1153 阅读 · 0 评论 -
hdu1870
#includeint main(){ inti,top; charch[1005],str[1005]; while(scanf("%s",ch)==1) { top=0; for(i=0;ch[i]!='\0';i++) { if(ch[i原创 2013-04-22 19:08:24 · 978 阅读 · 0 评论 -
hdu1022火车(模似栈)
/*4 1234 34214 1234 23145 12345 325416 123456 1345626 123456 256431*/#include#includeint main (){ intn,i,f[100000]; chara[2][100000]; while(scanf("%d",&n)==1)原创 2013-04-22 19:17:40 · 1129 阅读 · 0 评论 -
hdu3328(翻转card)
Problem DescriptionLittle Bobby Roberts (son of Big Bob, of Problem G) plays this solitaire memory game called Flipper. He starts withn cards, numbered 1 through n, and lays them out in a row with原创 2013-07-29 13:26:07 · 1133 阅读 · 0 评论 -
POJ 1686 Lazy Math Instructor (模似题+栈的运用) 各种坑
Problem DescriptionA math instructor is too lazy to grade a question in the exam papers in which students are supposed to produce a complicated formula for the question asked. Students may write cor原创 2013-08-14 23:05:29 · 1240 阅读 · 0 评论 -
CSU1655: 文本计算器
1655: 文本计算器Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 58 Solved: 16[Submit][Status][Web Board]DescriptionBob讨厌复杂的数学运算.看到练习册上的算术题,Bob很是头痛.为了完成作业,Bob想要你帮忙写一个文本版的四则运算计算器.这个计算器的功能需原创 2015-05-31 18:35:20 · 897 阅读 · 0 评论 -
CF E. Vanya and Brackets(添加一对括号使得表达式的值最大)
E. Vanya and Bracketstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya is doing his maths homework. He原创 2015-06-20 13:38:43 · 1349 阅读 · 0 评论