HDU 2037 circumgyrate the string（字符串翻转）

网友投稿 903 2022-08-23

HDU 2037 circumgyrate the string（字符串翻转）

HDU 2037 circumgyrate the string（字符串翻转）

circumgyrate the string

Time Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5305    Accepted Submission(s): 1274

Problem Description

Give you a string, just circumgyrate. The number N means you just   circumgyrate the string N times, and each time you circumgyrate the string for 45 degree anticlockwise.

Input

In each case there is string and a integer N. And the length of the string is always odd, so the center of the string will not be changed, and the string is always horizontal at the beginning. The length of the string will not exceed 80, so we can see the complete result on the screen.

Output

For each case, print the circumgrated string.

Sample Input

asdfass 7

Sample Output

a

s

d

f

a

s

s

Author

wangye

AC代码：

#include #include #include #include #include #include #include #include #include #include #include #include #include typedef long long LL; using namespace std; const LL maxn=1e6;const LL mod=10000000; //输入一个字符串，再输入旋转次数,每次转动45度，注意number可以是负数 char str[80 + 5];int main(){ int number; while(scanf("%s%d", str, &number) != EOF) { int len = strlen(str); if(number % 8 == 0) { for(int i = 0; i < len; i++) printf("%c", str[i]); printf("\n"); } else if(number % 8 == 1 || number % 8 == -7) { for(int i = len - 1; i >= 0; i--) { for(int j = 0; j < i; j++) printf(" "); printf("%c\n", str[i]); } } else if(number % 8 == 2 || number % 8 == -6) { for(int i = 0; i < len; i++) { for(int j = 0; j < len / 2; j++) printf(" "); printf("%c\n", str[len - 1 - i]); } } else if(number % 8 == 3 || number % 8 == -5) { for(int i = 0; i < len; i++) { for(int j = 0; j < i; j++) printf(" "); printf("%c\n", str[len - 1 - i]); } } else if(number % 8 == 4 || number % 8 == -4) { for(int i = len - 1; i >= 0; i--) printf("%c", str[i]); printf("\n"); } else if(number % 8 == 5 || number % 8 == -3) { for(int i = 0; i < len; i++) { for(int j = 0; j < len - i - 1; j++) printf(" "); printf("%c\n", str[i]); } } else if(number % 8 == 6 || number % 8 == -2) { for(int i = 0; i < len; i++) { for(int j = 0; j < len / 2; j++) printf(" "); printf("%c\n", str[i]); } } else if(number % 8 == 7 || number % 8 == -1) { for(int i = 0; i < len; i++) { for(int j = 0; j < i; j++) printf(" "); printf("%c\n", str[i]); } } } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。

标签：number int printf
上一篇:Not Fibonacci（矩阵连乘）
下一篇:前后端分离了，然后呢？（什么前后端分离）
相关文章

 发表评论

暂时没有评论，来抢沙发吧~