摘要:
#include <iostream> using namespace std; bool isPrime(int n) { if (n <= 1) { return false; } for (int i = 2; i * i <= n; i++) { if (n % i == 0) { retu 阅读全文
摘要:
#include<bits/stdc++.h> using namespace std; const int maxN = 2e5 + 5; struct Fruit { int type; bool hasPicked;//已被挑选过 }fruit[maxN]; int main() { int 阅读全文