1
#include <bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4

5
int main() {
6
    ios::sync_with_stdio(false);
7
    cin.tie(nullptr);
8
    cout.tie(nullptr);
9
    cout<<"I\n \nL\no\nv\ne\n \nG\nP\nL\nT";
10
    return 0;
11
}

1
#include <bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4

5
void solve(const string& tel);
6

7
int num[10];
8

9
int main() {
10
    ios::sync_with_stdio(false);
11
    cin.tie(nullptr);
12
    cout.tie(nullptr);
13
    string tel;
14
    cin>>tel;
15
    solve(tel);
16
    return 0;
17
}
18

19
void solve(const string& tel) {
20
    vector<int> used;
21
    vector<int> index;
22
    const int len1 = static_cast<int>(tel.length());
23
    for (int i = 1; i <= len1; i++) num[tel[i-1]-'0']++;
24
    for (int i = 10; i >= 1; i--) if (num[i-1]!=0) used.push_back(i-1);
25
    cout<<"int[] arr = new int[]{";
26
    const int len2 = static_cast<int>(used.size());
27
    for (int i = 1; i <= len2; i++) cout << used[i-1] << (i == len2 ? "" : ",");
28
    cout<<"};\n";
29
    for (int i = 1; i <= len1; i++) if (auto it = find(used.begin(), used.end(), tel[i-1] - '0'); it != used.end()) index.push_back(static_cast<int>(distance(used.begin(),it)));
30
    cout<<"int[] index = new int[]{";
31
    const int len3 = static_cast<int>(index.size());
32
    for (int i = 1; i <= len3; i++) cout << index[i-1] << (i == len3 ? "" : ",");
33
    cout<<"};\n";
34
}

1
#include <bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
//spec A 4/10
5

6
const string& isPrime(ll n);
7
string YES = "Yes";
8
string NO = "No";
9

10
int main() {
11
    ios::sync_with_stdio(false);
12
    cin.tie(nullptr);
13
    cout.tie(nullptr);
14
    int N;
15
    cin>>N;
16
    for (int i = 1; i <= N; i++) {
17
        int num;
18
        cin>>num;
19
        cout<<isPrime(num)<<"\n";
20
    }
21
    return 0;
22
}
23

24
ll llPow(ll a, ll b, const ll mod) {
25
    ll res = 1;
26
    a %= mod;
27
    while (b > 0) {
28
        if (b % 2 == 1) res = static_cast<ll>(static_cast<__int128_t>(res) * a % mod);;
29
        a = a * a % mod;
30
        b /= 2;
31
    }
32
    return res;
33
}
34

35
bool mrTest(const ll n, const ll a) {
36
    if (a % n == 0) return true;
37
    ll d = n - 1;
38
    while (d % 2 == 0) d /= 2;
39
    ll x = llPow(a, d, n);
40
    if (x == 1 || x == n - 1) return true;
41
    while (d != n - 1) {
42
        x = static_cast<ll>(static_cast<__int128_t>(x) * x % n);        d *= 2;
43
        if (x == n - 1) return true;
44
        if (x == 1) return false;
45
    }
46
    return false;
47
}
48

49

50
const string& isPrime(const ll n) {
51
    if (n < 2) return NO;
52
    if (n == 2 || n == 3) return YES;
53
    if (n % 2 == 0) return NO;
54

55
    static const vector<ll> bases = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
56

57
    for (const ll a : bases) {
58
        if (n == a) return YES;
59
        if (!mrTest(n, a)) return NO;
60
    }
61
    return YES;
62
}

1
#include <bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4

5
int main() {
6
    ios::sync_with_stdio(false);
7
    cin.tie(nullptr);
8
    cout.tie(nullptr);
9
    int H;
10
    cin>>H;
11
    printf("%.1f",(H-100)*0.9*2);
12
    return 0;
13
}

1
#include <bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4

5
int main() {
6
    ios::sync_with_stdio(false);
7
    cin.tie(nullptr);
8
    cout.tie(nullptr);
9
    int N;
10
    cin>>N;
11
    string girls[N/2];
12
    string boys[N/2];
13
    string index;
14
    int curtG = 1;
15
    int curtB = 1;
16
    for (int i = 1; i <= N; i++) {
17
        int gender;
18
        cin>>gender;
19
        string name;
20
        cin>>name;
21
        if (!gender) {
22
            girls[curtG-1] = name;
23
            curtG++;
24
        } else {
25
            boys[curtB-1] = name;
26
            curtB++;
27
        }
28
        if (i<=N/2) index.append(to_string(gender));
29
    }
30
    curtG = 1;
31
    curtB = 1;
32
    for (int i = 1; i <= N/2; i++) {
33
        if (const int gender = index[i-1]-'0'; !gender) {
34
            cout<<girls[curtG-1]<<" "<<boys[N/2-curtG]<<"\n";
35
            curtG++;
36
        } else {
37
            cout<<boys[curtB-1]<<" "<<girls[N/2-curtB]<<"\n";
38
            curtB++;
39
        }
40
    }
41
    return 0;
42
}