HDU1200

hdu1200(来来回回串起来)

Problem Description Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding with ex
·2015-11-13 04:41

HDU1200：To and Fro

Problem Description Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding with ex
·2015-11-12 20:43

HDU1200 To and Fro

ToandFroTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):4697    AcceptedSubmission(s):3278ProblemDescriptionMoandLarryhavedevisedawayofencryptingmessages.
u012846486·2014-08-28 08:00

HDU1200：To and Fro

ProblemDescriptionMoandLarryhavedevisedawayofencryptingmessages.Theyfirstdecidesecretlyonthenumberofcolumnsandwritethemessage(lettersonly)downthecolumns,paddingwithextrarandomletterssoastomakearectang
libin56842·2013-07-22 15:00

HDU 1200

 //Problem:hdu1200 //Data:2011.11.1 #include usingnamespacestd; charline[220]; intmain() {
gneveek·2011-11-01 13:00

【细节决定成败】 HDU 最容易犯的错误 持续更新。。。

HDU2023 以后给变量命名尽量用有意义的字符，什么m,n啊，a[xx],b[xx]，c[XX]啊，最容易弄错，刚才就是误把c[x]写成了b[x]                   浪费时间20’HDU1200
huaxiangsl·2010-07-21 14:00

HDU1200——字符串处理

http://acm.hdu.edu.cn/showproblem.php?pid=1200 简单的译码还原问题，不难。#include#includeintN;charch[103][23];charc[203];intmain(){inti,j,k,len;while(scanf("%d",&N)&&N!=0){scanf("%s",c);len=(int)strlen(c);for(i=0,
tlovet1314·2010-02-23 10:00
上一页 1 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他