[acm]HDOJ 1200 To and Fro】的更多相关文章

题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=1200 简单字符串处理,找规律 /* 11509672 2014-08-21 11:32:55 Accepted 1200 0MS 380K 442 B G++ 空信高手 */ #include<iostream> #include<string> #include<cstdio> using namespace std; int main() { //freopen(&q…
To and Fro Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5485    Accepted Submission(s): 3795 Problem Description Mo and Larry have devised a way of encrypting messages. They first decide secr…
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1200 To and Fro Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5129    Accepted Submission(s): 3550 Problem Description Mo and Larry have devised…
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 extra random letters so as to make a rectangular array…
题目地址: http://acm.hdu.edu.cn/showproblem.php?pid=2059 起点和终点,共n+2个点,n+2个状态,简单DP即可. //11512698 2014-08-21 17:11:55 Accepted 2059 //62MS 368K 969 B G++ 空信高手 //起点和终点,共n+2个点,n+2个状态,简单DP即可 #include<iostream> #include<cstdio> using namespace std; ; co…
题目地址: http://acm.hdu.edu.cn/showproblem.php?pid=2673 拍两次序,交替输出 #include<iostream> #include<algorithm> #include<cstdio> using namespace std; #define MAX_NUMBER 10000 bool myfunction1 (int i,int j) { return (i<j); } bool myfunction2 (in…
题目地址: http://acm.hdu.edu.cn/showproblem.php?pid=2064 汉诺塔变种,只能从中间专业,递归关系为:f(n)=3*f(n-1)+2. //汉诺塔变种,只能从中间转移 //11485816 2014-08-19 08:44:47 Accepted 2064 0MS 368K 307 B G++ 空信高手 #include<iostream> #include<cstdio> using namespace std; #define LL…
题目地址: http://acm.hdu.edu.cn/showproblem.php?pid=3082 字符串处理+并联电阻公式 //11481261 2014-08-18 16:52:47 Accepted 3082 0MS 384K 733 B G++ 空信高手 #include<string> #include<iostream> #include<cstdio> #include<cstdlib> using namespace std; int…
题意:给定一个,其实是由一个图按蛇形输出而成的字符串,要求按从左到右,从上到下的顺序输出这个图. 分析: 1.把字符串转化成图 2.按要求输出图= = #include<cstdio> #include<cstring> #include<cstdlib> #include<cctype> #include<cmath> #include<iostream> #include<sstream> #include<it…
(都是递推求值,呵呵,好开心- - ) 今天又是在自习室通宵(文明玩的停不下来了) 游戏玩完想想该水题了,于是打开了HDOJ的ACM STEPS(这是个好东西,就像他的名字,一步步来的) 2.3.x貌似都推断题- - ~由于本人比较懒,就直接找题解了,水到了3.1.x 读完3.1.1  啊哈,这题不用找题解也会推~~斐波那契= = (3.1.2是数据比较大的斐波那契,改用 long long 就好了) (用VSCode敲的,这东西界面不错,功能也好,而且轻,就是debug比较烦-= 超级楼梯 T…