AtCoder Beginner Contest 445

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
signed main() {
25
    // ios::sync_with_stdio(0);
26
    // cin.tie(0);
27
    // cout.tie(0);
28
    string s;
29
    cin >> s;
30
    if(s[0] == s[s.size() - 1]) puts("Yes");
31
    else puts("No");
32
    return 0;
33
}

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
int n, m;
25
string s[105];
26
signed main() {
27
    ios::sync_with_stdio(0);
28
    cin.tie(0);
29
    cout.tie(0);
30
    cin >> n;
31
    for(int i = 1;i <= n;i++) {
32
        cin >> s[i];
33
        m = max(m, (int)s[i].size());
34
    }
35
    for(int i = 1;i <= n;i++) {
36
        int cnt = (m - s[i].size()) / 2;
37
        for(int j = 1;j <= cnt;j++) cout << ".";
38
        cout << s[i];
39
        for(int j = 1;j <= cnt;j++) cout << ".";
40
        cout << endl;
41
    }
42
    return 0;
43
}

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
const int N = 5e5 + 5;
25
int n, a[N], res[N];
26
signed main() {
27
    cin >> n;
28
    for(int i = 1; i <= n; ++i) cin >> a[i];
29
    for(int i = n; i >= 1; --i) {
30
        if (a[i] == i) res[i] = i;
31
        else res[i] = res[a[i]];
32
    }
33
    for(int i = 1; i <= n;i++) {
34
        cout << res[i] << " ";
35
    }
36
    cout << endl;
37
    return 0;
38
}

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
const int mod = 998244353, N = 2e5 + 5, lim = 1e7 + 5;
25
int T, n, a[N];
26
int tot, pr[lim];
27
bool v[lim], vis[lim];
28
int minp[lim], e[lim][2], cnt[lim];
29
vector<int> p;
30
ll fp(ll a, ll b) {
31
    ll res = 1;
32
    a %= mod;
33
    while(b) {
34
        if(b & 1) res = res * a % mod;
35
        a = a * a % mod;
36
        b >>= 1;
37
    }
38
    return res;
39
}
40
ll inv(ll n) { return fp(n, mod - 2); }
41
void shai() {
42
    for(int i = 2; i <= 1e7;i++) {
43
        if(!v[i]) pr[++tot] = i, minp[i] = i;
44
        for(int j = 1;j <= tot && i * pr[j] <= 1e7;j++) {
45
            v[i * pr[j]] = 1;
46
            minp[i * pr[j]] = pr[j];
47
            if(i % pr[j] == 0) break;
48
        }
49
    }
50
}
51
void solve() {
52
    p.clear();
53
    cin >> n;
54
    for (int i = 1;i <= n;i++) {
55
        cin >> a[i];
56
        int x = a[i];
57
        while (x > 1) {
58
            int _p = minp[x];
59
            int _e = 1;
60
            if(!vis[_p]) {
61
                p.push_back(_p);
62
                vis[_p] = 1;
63
            }
64
            while (x % _p == 0) {
65
                _e *= _p;
66
                x /= _p;
67
            }
68
            if (_e > e[_p][0]) {
69
                e[_p][1] = e[_p][0];
70
                e[_p][0] = _e;
71
            } else if (_e > e[_p][1]) {
72
                e[_p][1] = _e;
73
            }
74
        }
75
    }
76
    ll LCM = 1;
77
    for(auto x : p) {
78
        if(e[x][0] > 0) {
79
            (LCM *= e[x][0]) %= mod;
80
        }
81
    }
82
    for(int i = 1; i <= n;i++) {
83
        ll ans = LCM;
84
        int x = a[i];
85
        while(x > 1) {
86
            int _p = minp[x];
87
            int _e = 1;
88
            while(x % _p == 0) {
89
                _e *= _p;
90
                x /= _p;
91
            }
92
            if(_e != e[_p][0]) continue;
93
            (ans *= inv(e[_p][0])) %= mod;
94
            if(e[_p][1] > 0) (ans *= e[_p][1]) %= mod;
95
        }
96
        cout << ans << " ";
97
    }
98
    cout << endl;
99
    for(int x : p) {
100
        e[x][0] = e[x][1] = vis[x] = 0;
101
    }
102
}
103
signed main() {
104
    ios::sync_with_stdio(false);
105
    cin.tie(0);
106
    cout.tie(0);
107
    shai();
108
    cin >> T;
109
    while(T--) solve();
110
    return 0;
111
}