儿 ···cpp #include <bits/stdc++.h> #define devidedN(x,y) x % y == 0 ? 1 : 0 using namespace std;

bool if_prime(int m) { if(m == 0 || m == 1) return 0; int x = sqrt(m); for(int i = 2;i <= x;i++) { if(devidedN(m,i)) return false; } return true; }

priority_queue<int,vector,greater > findyz(int m) { priority_queue<int,vector,greater > pq; int x = sqrt(m); for(int i = 1;i <= x;i++) { if(!if_prime(i)) continue; } }