hientm495
Tổng số bài gửi : 27 Join date : 10/05/2022
| Tiêu đề: Tran Minh Hien Fri Sep 09, 2022 3:15 pm | |
| - Code:
-
#include<bits/stdc++.h> #define task "o" #define For(i, a, b) for(int i = a ; i <= b ; i++) #define FOR(i, a, b) for(int i = a ; i < b ; i++) #define Fod(i, a, b) for(int i = a ; i >= b ; i--) #define FOD(i, a, b) for(int i = a-1 ; i >= b ; i--) #define Forc(i, a, b, c) for(int i = a ; i <= b ; i+=c) #define FORc(i, a, b, c) for(int i = a ; i < b ; i+=c) #define vi vector<int> #define vii vector<int, int> #define F first #define S second #define pii pair<int, int> #define pb push_back #define MASK(i) (1LL<<(i)) #define BIT(x, i) (((x) >> (i)) & 1) #define qii queue<int> #define sii stack<int> #define io freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #define fast ios_base::sync_with_stdio(false); cin.tie(nullptr); #define ll long long
using namespace std;
const int nmax = (int)1e6 +7; const ll oo = (int)1e18 + 7;
int n, a[nmax], b[nmax]; ll res;
int ngto(int u) { if(u <= 1) return 0; if(u == 2 || u == 3) return 1; For(i, 2, sqrt(u)) if(u % i == 0) return 0; return 1; }
void xuli() { ll s = 0; For(i, 1, n) s += b[i]*a[i]; if(ngto(s) == 1) { For(i, 1, n) { if(b[i] == 1) cout << a[i] << ' '; cout << endl; } } }
void thu(int i) { For(j, 0, 1) { b[i] = j; if(i == n) xuli(); else thu(i+1); } }
void sub1() { thu(1); }
int main() { fast; //io; cin >> n; For(i, 1, n) cin >> a[i]; sub1(); return 0; } | |
|