Submission #4658424
Source Code Expand
#include <ios> #include <iomanip> #include <iostream> #include <functional> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <string> #include <sstream> #include <complex> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <climits> using namespace std; typedef long long int ll; #define rep(i, n) for(int i = 0; i < (int)(n); i++) #define all(x) (x).begin(),(x).end() #define MOD 1000000007 #define INF (1e9) #define print(x) cout << x << endl #define yes cout << "Yes" << endl #define YES cout << "YES" << endl #define no cout << "No" << endl #define NO cout << "NO" << endl ll gcd(ll a, ll b) { return b ? gcd(b,a%b) : a;} ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } typedef pair <ll,ll> P; int main() { string s; cin >> s; s[0] = toupper(s[0]); for(int i = 1; i < s.length() ; ++i) { s[i] = tolower(s[i]); } print(s); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 名前の確認 |
User | akimotty |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1035 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 |