Submission #4046105
Source Code Expand
#include<algorithm> #include<complex> #include<ctype.h> #include<iomanip> #include<iostream> #include<map> #include<math.h> #include<numeric> #include<queue> #include<set> #include<stack> #include<stdio.h> #include<string> #include<string> #include<vector> using namespace std; typedef long long ll; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define ALL(v) (v).begin(), (v).end() #define p(s) cout<<(s)<<endl #define p2(s, t) cout << (s) << " " << (t) << endl #define pn(s) cout << (#s) << " " << (s) << endl #define p_yes() p("Yes") #define p_no() p("No") int dx[4] = {-1, 0, 1, 0}; int dy[4] = {0, 1, 0, -1}; const ll mod = 1e9 + 7; const ll inf = 1e18; char upper(char c){ char a = toupper(c); return a; } char lower(char c){ char a = tolower(c); return a; } int main(){ cin.tie(0); ios::sync_with_stdio(false); // input string s; cin >> s; FOR(i, 0, s.size()){ char c = s[i]; if(i==0){ cout << upper(c); }else{ cout << lower(c); } } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 名前の確認 |
User | peroon |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1086 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | sample_01.txt, sample_02.txt, test_AzielehadfJD.txt, test_Oq.txt, test_P.txt, test_Wi.txt, test_ZNEFzealEAkD.txt, test_aAZaz.txt, test_z.txt, test_zDkElDjNVmAq.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
test_AzielehadfJD.txt | AC | 1 ms | 256 KB |
test_Oq.txt | AC | 1 ms | 256 KB |
test_P.txt | AC | 1 ms | 256 KB |
test_Wi.txt | AC | 1 ms | 256 KB |
test_ZNEFzealEAkD.txt | AC | 1 ms | 256 KB |
test_aAZaz.txt | AC | 1 ms | 256 KB |
test_z.txt | AC | 1 ms | 256 KB |
test_zDkElDjNVmAq.txt | AC | 1 ms | 256 KB |