結果

問題 No.163 cAPSlOCK
ユーザー IL_mstaIL_msta
提出日時 2015-06-02 18:59:50
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 2,390 bytes
コンパイル時間 627 ms
コンパイル使用メモリ 71,932 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-06 13:44:54
合計ジャッジ時間 1,163 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 1 ms
5,376 KB
testcase_12 AC 1 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 1 ms
5,376 KB
testcase_15 AC 1 ms
5,376 KB
testcase_16 AC 1 ms
5,376 KB
testcase_17 AC 1 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 1 ms
5,376 KB
testcase_20 AC 1 ms
5,376 KB
testcase_21 AC 1 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <math.h>

#include <string>
#include <list>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed;//
    //cout << setprecision(6);//

    string s;
	cin>>s;
	rep(i,s.size()){
			 if(s[i] == 'a' ){cout<<'A';}
		else if(s[i] == 'b' ){cout<<'B';}
		else if(s[i] == 'c' ){cout<<'C';}
		else if(s[i] == 'd' ){cout<<'D';}
		else if(s[i] == 'e' ){cout<<'E';}
		else if(s[i] == 'f' ){cout<<'F';}
		else if(s[i] == 'g' ){cout<<'G';}
		else if(s[i] == 'h' ){cout<<'H';}
		else if(s[i] == 'i' ){cout<<'I';}
		else if(s[i] == 'j' ){cout<<'J';}
		else if(s[i] == 'k' ){cout<<'K';}
		else if(s[i] == 'l' ){cout<<'L';}
		else if(s[i] == 'm' ){cout<<'M';}
		else if(s[i] == 'n' ){cout<<'N';}
		else if(s[i] == 'o' ){cout<<'O';}
		else if(s[i] == 'p' ){cout<<'P';}
		else if(s[i] == 'q' ){cout<<'Q';}
		else if(s[i] == 'r' ){cout<<'R';}
		else if(s[i] == 's' ){cout<<'S';}
		else if(s[i] == 't' ){cout<<'T';}
		else if(s[i] == 'u' ){cout<<'U';}
		else if(s[i] == 'v' ){cout<<'V';}
		else if(s[i] == 'w' ){cout<<'W';}
		else if(s[i] == 'x' ){cout<<'X';}
		else if(s[i] == 'y' ){cout<<'Y';}
		else if(s[i] == 'z' ){cout<<'Z';}
		else if(s[i] == 'A' ){cout<<'a';}
		else if(s[i] == 'B' ){cout<<'b';}
		else if(s[i] == 'C' ){cout<<'c';}
		else if(s[i] == 'D' ){cout<<'d';}
		else if(s[i] == 'E' ){cout<<'e';}
		else if(s[i] == 'F' ){cout<<'f';}
		else if(s[i] == 'G' ){cout<<'g';}
		else if(s[i] == 'H' ){cout<<'h';}
		else if(s[i] == 'I' ){cout<<'i';}
		else if(s[i] == 'J' ){cout<<'j';}
		else if(s[i] == 'K' ){cout<<'k';}
		else if(s[i] == 'L' ){cout<<'l';}
		else if(s[i] == 'M' ){cout<<'m';}
		else if(s[i] == 'N' ){cout<<'n';}
		else if(s[i] == 'O' ){cout<<'o';}
		else if(s[i] == 'P' ){cout<<'p';}
		else if(s[i] == 'Q' ){cout<<'q';}
		else if(s[i] == 'R' ){cout<<'r';}
		else if(s[i] == 'S' ){cout<<'s';}
		else if(s[i] == 'T' ){cout<<'t';}
		else if(s[i] == 'U' ){cout<<'u';}
		else if(s[i] == 'V' ){cout<<'v';}
		else if(s[i] == 'W' ){cout<<'w';}
		else if(s[i] == 'X' ){cout<<'x';}
		else if(s[i] == 'Y' ){cout<<'y';}
		else if(s[i] == 'Z' ){cout<<'z';}
	}
	cout<<endl;
    return 0;
}
0