ZOJ 1295 - Reverse Text
来源:互联网 发布:c语言break用法if 编辑:程序博客网 时间:2024/05/22 21:09
//格式练习!
#include <cstdio>
#include <cstring>
char str[80];
int main(){
memset(str, '\0', sizeof(str));
int n = 0;
scanf("%d\n", &n); //“\n”不能省!否则,会导致多输出一个换行,以至于结果为Presentation Error!
for (int i = 0; i < n; ++i){
fgets(str, sizeof(str), stdin);
int len = strlen(str) - 1;
for (int j = 0; j < len / 2; ++j){
char ch = str[j];
str[j] = str[len - j - 1];
str[len - j - 1] = ch;
}
printf("%s", str);
memset(str, '\0', sizeof(str));
}
return 0;
}
#include <cstdio>
#include <cstring>
char str[80];
int main(){
memset(str, '\0', sizeof(str));
int n = 0;
scanf("%d\n", &n); //“\n”不能省!否则,会导致多输出一个换行,以至于结果为Presentation Error!
for (int i = 0; i < n; ++i){
fgets(str, sizeof(str), stdin);
int len = strlen(str) - 1;
for (int j = 0; j < len / 2; ++j){
char ch = str[j];
str[j] = str[len - j - 1];
str[len - j - 1] = ch;
}
printf("%s", str);
memset(str, '\0', sizeof(str));
}
return 0;
}
0 0
- zoj 1295 Reverse Text
- zoj 1295 Reverse Text
- ZOJ 1295 Reverse Text
- ZOJ 1295 Reverse Text
- ZOJ 1295: Reverse Text
- ZOJ - 1295 - Reverse Text
- ZOJ 1295 - Reverse Text
- ZOJ - 1295 Reverse Text
- ZOJ Problem Set - 1295 Reverse Text
- ZOJ 1295: Reverse Text - cin.getline()
- ZOJ Problem Set - 1295 Reverse Text
- ZOJ 1295——Reverse Text
- ZOJ Problem Set - 1295 Reverse Text
- zoj 1295.Reverse Text
- 1295 Reverse Text
- Reverse Text
- Reverse Text
- Reverse Text
- 算法竞赛入门经典 习题2-10排列数字1~9形成1:2:3的等比数列
- 洗牌算法
- CSS框模型
- samba服务器安装所遇到的问题
- 用C语言实现面向对象之封装
- ZOJ 1295 - Reverse Text
- UVaOJ 10055 - Hashmat the Brave Warrior
- POJ 1324 Holedox Moving(状态压缩BFS)
- oracle:RETURNING 子句
- unity 一些快捷键与区别
- UVaOJ 10071 - Back to High School Physics
- [Unity3D]Unity3D游戏开发之《愤怒的小鸟》弹弓实现
- 【雷电】源码分析(一)-- 进入游戏开始界面
- UVaOJ 10300 - Ecological Premium