[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
首先要求100-200之间的素数，要知道素数是什么？
素数就是质数，只能被自身和1整除
下面会介绍两种方法：
常规方法：
代码：
int main() {
int i = 0;
for (i = 100; i <= 200; i++) {
//因为所有的数都可以被1整除，所以从2开始试
int j = 0;
for (j = 2; j <= i; j++) {
if (i % j == 0) {
break;
}
}
//跳出循环后，如果该数和i相等，则是素数
if (i == j) {
printf("%d ", i);
}
}
}
效率高的方法：
代码：
#include <math.h>;
//法2：
//这两个数中的总有一个数是小于等于两个数相乘的积的开根号
//例如：36=4*9，4<开根号36=6
int main() {
int count = 0;
int i = 0;
for (i = 100; i <= 200; i++) {
int flag = 1;
int j = 0;
for (j = 2; j <= sqrt(i); j++) {
if (i % j == 0) {
flag = 0;//不是素数
break;
}
}
if (flag == 1) {
count++;
printf("%d ", i);
}
}
printf("\ncount:%d\n", count);
return 0;
}
方法2使用了数学知识，只能说数学真的很有用，巧妙的利用了两个数中总有一个数是小于等于两个数的积的开根号，来找出素数！！
