제출 #857513

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
857513	2023-10-06 10:23:48	Trisanu_Das	Radio (COCI22_radio)	C++17	30 / 110	354 ms	61288 KiB

Main

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
#include <bits/stdc++.h>
using namespace std;
 
void solve1(int n, int q){
    bool a[n + 1]; memset(a, false, sizeof(a));
    while(q--) {
        char t; cin >> t;
        if (t == 'S') {
            int x; cin >> x;
            a[x] = !a[x];
        }else{
            int x, y; cin >> x >> y;
            bool ans = true;
            for (int i = x; i <= y; i++){
                if (!a[i]) continue;
                for (int j = i + 1; j <= y; j++){
                    if (a[j] && __gcd(i, j) > 1) {
                      ans = false; break;
                    }
                }
                if(ans) break;
            }
            if (ans) cout << "NE\n"; else cout << "DA\n";
        }
    }
}
 
void solve2(int n, int q){
    vector<vector<int>> prime(n + 1);
    for (int i = 2; i <= n; ++i){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 10
• Subtask 2: 30 / 30
• Subtask 3: 0 / 70