結果

問題 No.676 C0nvertPr0b1em
ユーザー akusyounin2412akusyounin2412
提出日時 2018-04-27 22:23:10
言語 C++14
(gcc 10.1.0 + boost 1.73.0)
結果
AC  
実行時間 9 ms / 2,000 ms
コード長 1,852 Byte
コンパイル時間 961 ms
使用メモリ 6,252 KB
最終ジャッジ日時 2020-06-10 18:56:50

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 7 ms
6,248 KB
testcase_01 AC 7 ms
6,248 KB
testcase_02 AC 7 ms
6,252 KB
testcase_03 AC 7 ms
6,248 KB
testcase_04 AC 7 ms
6,252 KB
testcase_05 AC 6 ms
6,252 KB
testcase_06 AC 7 ms
6,252 KB
testcase_07 AC 7 ms
6,252 KB
testcase_08 AC 7 ms
6,244 KB
testcase_09 AC 6 ms
6,244 KB
testcase_10 AC 6 ms
6,252 KB
testcase_11 AC 6 ms
6,248 KB
testcase_12 AC 9 ms
6,252 KB
testcase_13 AC 7 ms
6,248 KB
testcase_14 AC 6 ms
6,244 KB
testcase_15 AC 7 ms
6,252 KB
testcase_16 AC 6 ms
6,248 KB
testcase_17 AC 7 ms
6,248 KB
testcase_18 AC 6 ms
6,244 KB
testcase_19 AC 7 ms
6,244 KB
testcase_20 AC 7 ms
6,248 KB
testcase_21 AC 7 ms
6,252 KB
testcase_22 AC 7 ms
6,248 KB
testcase_23 AC 6 ms
6,228 KB
testcase_24 AC 7 ms
6,232 KB
testcase_25 AC 6 ms
6,232 KB
testcase_26 AC 6 ms
6,228 KB
testcase_27 AC 6 ms
6,232 KB
testcase_28 AC 7 ms
6,232 KB
testcase_29 AC 6 ms
6,232 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
#include <stdio.h>
#include <stdlib.h>
#include <cstdint>
#include <cfenv>
//#include <bits/stdc++.h>
using namespace std;
using LL = int;
using ULL = unsigned long long;
long long MOD = 1000000000 + 7;
constexpr long long INF = std::numeric_limits<LL>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr<<#x<<": "<<x<<'\n'
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)
LL h, w, n, m, k, s, t, q, last, cnt, sum, ans, d[400000];
string str, ss;
bool f;
char c;
int di[4][2] = { { 0,1 },{ 1,0 },{ -1,0 } ,{ 0,-1 } };
struct Edge { LL to, cost; };
vector<Edge>vec[200000];
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}

int main() {
	cin >> str;
	rep(i, str.size()) {
		if (str[i] == 'I' || str[i] == 'l')
			str[i] = '1';
		if (str[i] == 'O' || str[i] == 'o')
			str[i] = '0';
	}
	cout << str << endl;
	return 0;
}
0