2020-07-30 【深基6.例1】自动修正
2020-08-12 本文已影响0人
JalorOo
#include <iostream>
#include <cstdio>
using namespace std;
long long qmi(int m, int k)
{
int res = 1, t = m;
while (k)
{
if (k&1) res = res * t;
t = t * t;
k >>= 1;
}
return res;
}
int read(){
int x = 0,f = 1;
char c = getchar();
while (c<'0'||c>'9') {
if (c=='-') {
f = -1;
}
c = getchar();
}
while (c>='0'&&c<='9') {
x = x*10+c-'0';
c = getchar();
}
return x*f;
}
int main()
{
string s;
cin>>s;
for (int i = 0; i<s.length(); i++) {
if(s[i]>='a'&&s[i]<='z')s[i]+='A'-'a';//转换大小写
}
cout<<s<<endl;
return 0;
}
/*
5
abc
aaaa
abc
abcc
12345
============
4
*/