Submission #7095075

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(20) << S << endl
#define Vecpr(K,L1,L2,N) vector<pair<L1,L2>> K(N)
#define Vec(K,L,N,S) vector<L> K(N,S)
#define DV(K,L,N,M) vector<vector<L>> K(N, vector<L>(M))
#define mod 1000000007
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
lli gcd(lli num1, lli num2){
    return num2 != 0 ? gcd(num2, num1 % num2) : num1;
}
lli lcm(lli num1, lli num2){
    return num1 / gcd(num1, num2) * num2;
}
int toD(char s){
  s=s-' ';
  return s;
}
int toK(char s){
  s=s+' ';
  return s;
}
int main(){
  lli A=1,B,D,E,N,M,K,sum=0,num=0,ans=0;
  string S;cin >> S;
  N=S.size();
  rep(i,0,N){
    if(i==0&&S[i]>'Z')S[i]=toD(S[i]);
    else if(i!=0&&S[i]<'a')S[i]=toK(S[i]);
  }
  Out(S);
}

Submission Info

Judge Result