hdoj 1161 mistakes gets()的使用

本博客介绍了一个简单的程序实现,用于将文章中出现的大写字母转换为小写字母,解决Eddy在写作中常见的字母使用错误问题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Eddy's mistakes

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10116    Accepted Submission(s): 5718


Problem Description
Eddy usually writes articles ,but he likes mixing the English letter uses, for example "computer science" is written frequently "coMpUtEr scIeNce" by him, this mistakes lets Eddy's English teacher be extremely discontentment.Now please you to write a procedure to be able in the Bob article English letter to turn completely the small letter. 
 

Input
The input contains several test cases.each line consists a test case,Expressed Eddy writes in an article , by letter, blank space,numeral as well as each kind of punctuation
composition, the writing length does not surpass 1000 characters.
 

Output
For each test case, you should output an only line, after namely the result of transforms the lowercase letter.
 

Sample Input
  
weLcOmE tO HDOj Acm 2005!
 

Sample Output
  
welcome to hdoj acm 2005!
 

Author
eddy
 

Recommend
JGShining   |   We have carefully selected several similar problems for you:   1020  1200  1170  1062  1039 


题目就是所谓的把大写换小写

难过 难过 难过


/*=============================AC情况===============================*/
/*题目网址:   */
/*时间: */
/*心得:对于gets() 和 puts() 的使用:遇到回车的时候键入结束
scanf遇到‘ ’(空格)即代表结束 
*/

#include<stdio.h>
#include<string.h>
#define G 1088
#include<algorithm>

using namespace std;

int main() {
	int t;
	char s[G];
	while(gets(s)!=NULL) {
		for(int j=0; j<strlen(s); j++)
			if(s[j]>='A'&&s[j]<='Z')
				s[j]=s[j]+32;
		puts(s);
	}
	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值