1 条题解

  • 10
    @ 2026-7-11 17:02:11
    #include <bits/stdc++.h>
    using namespace std;
    
    bool isprime(int x) {
    	for (int f = 2; f * f <= x; f++) {
    		if (x % f == 0)
    			return false;
    	}
    
    	return true;
    }
    
    bool check(int x) {
    	if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0) {
    		for (int i = 6; i <= 100; i++) {
    			if (!isprime(i))
    				continue;
    
    			if (x % i == 0)
    				return false;
    		}
    
    		return true;
    	} else {
    		return false;
    	}
    }
    
    int main() {
    	vector<int> prettynums = {1};
    
    	for (int i = 1; i <= 100; i++) {
    		if (check(i))
    			prettynums.push_back(i);
    	}
    
    	int cnt = 0;
    	for (auto t : prettynums) {
    		cout << setw(6) << t;
    
    		cnt++;
    
    		if (cnt == 10) {
    			cout << "\n";
    			cnt = 0;
    		}
    	}
    	cout << "\n个数:" << prettynums.size();
    
    	return 0;
    }
    

    信息

    ID
    319
    时间
    1000ms
    内存
    64MiB
    难度
    7
    标签
    递交数
    177
    已通过
    38
    上传者