GDUFE ACM-1158

题目:http://acm.gdufe.edu.cn/Problem/read/id/1158

 

Compensations for ACMers

Time Limit: 2000/1000ms (Java/Others)

Problem Description:

Recently,it is said that our senior “JunHong” will hold on a contest for the ACM lover in GDUFE.There are so many reasons for why.One is that some greeners on the road of ACM was hurt in last contest held by senior GuiKai.So,we have to do some compensations for that(but the ‘contest’ will not be really simple as descirbed if you are lazy there days).For the other, I hope all of you can remember that our school is still weak in ACM when compared to all the universities around China.So,that is said not matter how much time you have paid on the ACM,it is still not enought,and if you really love it and want to do something for our ACM-Organization,your road of ACM is still long to go.Okay,time is out!Just solve the first problem now!

Input:

There are so many test cases.Each test case only contains a letter(between ‘a’ and ‘z’).

Output:

For each test case,output the corresponding uppercase for the lowercase letter given in one line.

Sample Input:

a
c
m

Sample Output:

A
C
M

思路:就是把小写字母换成大写字母,减32即可

难度:超级简单

代码:
 1 #include<stdio.h>
 2 int main()
 3 {
 4     char c;
 5     while(~scanf("%c",&c))
 6         {
 7             getchar();
 8             printf("%c\n",c-32);
 9         }
10     return 0;
11 }

 

转载于:https://www.cnblogs.com/ruo786828164/p/6009248.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值