#320275 (C++17) No.536 人工知能

• 問題: No.536 人工知能
• ユーザー: Eclair1015
• 提出日時: 2019-02-28 23:59:31
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 1,000 ms
• コード長: 1,382 bytes
• コンパイル時間: 819 ms
• コンパイル使用メモリ: 113,764 KB
• 最終ジャッジ日時: 2025-01-06 21:50:31
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
other	AC * 11

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
//inlclude before define 
#define _USE_MATH_DEFINES
//include
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<type_traits>
#include<numeric>
#include<deque>
#include<iomanip>
#include<set>
#include<unordered_set>
#include<tuple>
#include<map>
#include<memory>
using namespace std;
//typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<double> VD;
typedef pair<int, int> P1;
typedef long long int ll;
//number
#define INF 1e9
#define NUM 1000000007
//itr
#define all(x) begin(x),end(x)
//repeat
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,a,b) for(int i=int(a);i<int(b);i++)
#define RREPS(i,x) for(int i=((int)(x));i>=0;i--)
//max,min
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
//function
/*ll gcd(ll a, ll b) {
    if (b == 0) return a;
    else return gcd(b, a%b);
}*/
/*ll lcm(ll a,ll b) {
    ll g = gcd(a, b);
    return a * (b / g);
}*/
/*int dig(int a) {
    int sum = 0;
    while (a) {
        sum += a % 10;
        a /= 10;
    }
    return sum;
}*/
//grid template
int x[] = { -1, 0, 1, 0 };
int y[] = { 0,-1,0,1 };
int xx[] = { -1,-1,1,1 };
int yy[] = { 1,-1,1,-1 };
int main() {
    string s;
    cin >> s;
    int n = s.size();
    if (s[n - 1] == 'i' && s[n - 2] == 'a') {
        s[n - 1] = 'I';
        s[n - 2] = 'A';
    } else {
        s += "-AI";
    }
    cout << s << endl;
}
 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX