素数个数

5

dongliyang LV 9 @ 2024-8-24 9:41:43

#include<bits/stdc++.h>
#define int long long
using namespace std;
bool isprime(int n){
	if(n<=1||n%2==0){
		if(n==2) return true;
		return false;
	}
	for(int i=3;i<=sqrt(n);i+=2){
		if(n%i==0) return false;
	}
	return true;
}
signed main(){
	int n,m,cnt=0;
	cin>>n>>m;
	for(int i=n;i<=m;i++){
		if(isprime(i)){
			cout<<i<<" ";
			cnt++;
		}
	}
	cout<<endl<<cnt;
}

4

李唐1 LV 7 @ 2023-4-18 16:50:58

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
	int ans=0,i,j,m,n,h[32000];
	bool a=true;
	cin>>m>>n;
	for(i=m;i<=n;i++){
		a=true;
		for(j=2;j*j<=i;j++){
			if(i%j==0) a=false;
		}
		if(a){
			cout<<i<<" ";
			ans++;
		}
	}
	cout<<endl<<ans;
	return 0;
}

2

汪赞 LV 10 @ 2025-5-28 20:33:35

 #include <bits/stdc++.h>
    using namespace std;
    
    int main( )
    
    {
    
    int n,m;
    cin >> m >> n ; 
    int b;
    int a;
    int i,j;

    
    for(i=m;i<=n;i++)
    {
    	a=0;
   	    for( j=2;j<=i/2;j++)
   	    {
   	  	    if(i%j==0)
   	  	    {
   	  	    	a++;
            }
	    }



      
		if(a==0){
			cout << i << " ";	 
			b++; 
		}
    }
    cout << endl;
    cout << b;
    return 0;
    }

汪赞 @ 2025-5-28 20:38:40

最简单，最好懂，不复杂。

1

chenshiyang LV 6 @ 2026-10-17 14:42:16

#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin >> n >> m; if(n < 2) n = 2; int sum = 0; for(int i = n;i <= m ; i++) { int flag = 1; for(int j = 2;i > j ; j++) { if(i%j == 0) { flag = 0; break; } } if(flag == 1) { cout << i <<" "; sum++; } } if(sum != 0) cout << endl; cout << sum << endl; }

1

zhouzihan1 LV 6 @ 2026-10-17 14:41:53

#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin >> n >> m; if(n < 2) n = 2; int sum = 0; for(int i = n;i <= m ; i++) { int flag = 1; for(int j = 2;i > j ; j++) { if(i%j == 0) { flag = 0; break; } } if(flag == 1) { cout << i <<" "; sum++; } } if(sum != 0) cout << endl; cout << sum << endl; }

1

zhouzihan1 LV 6 @ 2026-10-17 14:40:50

#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin >> n >> m; if(n < 2) n = 2; int sum = 0; for(int i = n;i <= m ; i++) { int flag = 1; for(int j = 2;i > j ; j++) { if(i%j == 0) { flag = 0; break; } } if(flag == 1) { cout << i <<" "; sum++; } } if(sum != 0) cout << endl; cout << sum << endl; }

1

zhouzihan1 LV 6 @ 2026-10-17 14:39:53

#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin >> n >> m; if(n < 2) n = 2; int sum = 0; for(int i = n;i <= m ; i++) { int flag = 1; for(int j = 2;i > j ; j++) { if(i%j == 0) { flag = 0; break; } } if(flag == 1) { cout << i <<" "; sum++; } } if(sum != 0) cout << endl; cout << sum << endl; }

1

ts2025stu003 LV 8 @ 2025-12-14 15:24:00

#include <iostream>
using namespace std;
int m,n;
bool a = true;
int main()
{
	cin >> m >> n;
	short ans = 0;
	if (m == 1)
		m = 2;
	for (int i = m;i <= n;i++)
	{
		for (int j = 2;j < i;j++)
		{
			if (i % j == 0)
				a = false;
		}
		if (a == true)
		{
			cout << i << ' ';
			ans++;
		}
		a = true;
	}
	cout << endl << ans;
	return 0;
}

1

Lawrence劳伦斯 LV 9 @ 2023-9-8 18:16:12

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int N=32000+10;
const int INF=0x3f3f3f3f;

int ans,r,l;

bool c(int x)
{
	for(int i=2;i*i<=x;i++)
	{
		if(x%i==0)
		{
			return 0;
		}
	}
	ans++;
	return 1;
}
int main()
{
	cin>>l>>r;
	for(int i=l;i<=r;i++)
	{
		if(c(i))
		{
			cout<<i<<" ";
		}
	}
	cout<<endl<<ans;
	return 0;
}

这题内存非常吝啬啊，埃筛都用不了[doge]

-1

张梓扬 LV 5 @ 2026-2-9 12:00:25

#include<bits/stdc++.h> using namespace std; bool prime(int x){ if(x2){ return 1; } for(int i=2;i<=sqrt(x);i++){ if(x%i0){ return 0; } }return 1; } int main(){ int n,m; cin>>n>>m; int sum=0; for(int i=n;i<=m;i++){ if(prime(i)==1){ cout<<i<<' '; sum++; } }cout<<endl<<sum; }

-1

Doris LV 7 @ 2025-6-5 16:50:24

#include #include using namespace std; bool isPrime(int x) { if(x < 2) return false; for (int i = 2; i * i <= x; ++i) { if (x % i == 0) return false; } return true; } int main() { int m, n; cin >> m >> n; int low = min(m, n); int high = max(m, n); int count = 0; for (int i = low; i <= high; ++i) { if (isPrime(i)) { cout << i << " " ; count++; } } cout << endl << count << endl; }

-2

wangchenjie LV 4 @ 2025-4-22 21:21:12

#include <bits/stdc++.h> using namespace std; int n; int m; int cnt; bool pdss(int x) { if (x < 2) { return 0; } bool flag = 1; for (int i = 2; i <= sqrt(x); i++) { if (x % i == 0) { flag = 0; break; } } return flag; } int main() { scanf("%d%d",&m,&n); for (int i = m; m <= n; i++) { if (pdss(i) == 1) { cout << i << " "; cnt++; } } cout << "\n"; printf("%d",cnt); return 0; } 错误的题解！！！

-2

liujinhao LV 8 @ 2024-9-28 18:11:49

~~函数解决~~ 已AC

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
const int INF=0x3f3f3f3f;
int cheak(int x){//参数  
	if(x==1)
		return 0;
		for(int i=2;i<x;i++){
			if(x%i==0){
				return 0;
			}
		}
	return 1;
}
int a[N],n,m,cnt=0;
int main(){ 
	cin>>n>>m;
    for(int i=n;i<=m;i++){
    	if(cheak(i)){//应用函数
    		a[cnt]=i;
    		cnt++;
    	}
    }
	for(int i=0;i<cnt;i++){
		cout<<a[i]<<" ";
	} 
	cout<<"\n"<<cnt;
}

-2

梁皓明 LV 6 @ 2022-7-9 10:00:27

//***************************

//dev c++[[990.cpp]]*******

//dev c++[top fanil]]******

//dev c++*www.temege.com

#include <stdio.h>

#include

#include <math.h>

#include

using namespace std;

int main()

{

int n;


cin>>n;


for(int i=2;i<=n;i++)



{


	int k=i*i;


	if(i<10)


	{


		if(k%10==i)


		{


			cout<<i<<" ";


		}


	}


	else if(i<100)


	{



		if(k%100==i)



		{



			cout<<i<<" ";



		}



	}




	else




	{



		if(k%1000==i)

		{


			cout<<i<<" ";

		}

	}

}

return 0;

}

////////////////////////////

-3

shihaichen LV 6 @ 2024-3-15 19:03:17

#include using namespace std; int main(){ int n,m,x=0; cin>>n>>m; for(int i=n;i<=m;i++){ int s=0; for(int l=2;l<i;l++){ if(i%l0){ s=1; break; } } if(s0){ x++; cout<<i<<" "; } } cout<<endl<<x; }

-3

梁皓明 LV 6 @ 2022-7-9 9:46:21

//***************************

//dev c++[[990.cpp]]*******

//dev c++[top fanil]]******

//dev c++*www.temege.com

#include <stdio.h>

#include

#include <math.h>

#include

using namespace std;

int main()

{

int l,r,sum=0;

cin>>l>>r;

for(int i=l;i<=r;i++)

{

	int flag=1;

	for(int j=2;j*j<=i&&flag;j++)

		if(i%j==0)

			flag=0;

	if(flag)

	{

		cout<<i<<" ";

		sum++;

	}

}

if(sum)

    cout<<endl;

cout<<sum<<endl;

return 0;

}

////////////////////////////

-4

zxc2022 LV 7 @ 2023-3-31 21:23:13

#include<bits/stdc++.h> using namespace std; bool f(int n) { if(n<=1) return 0; for(int i=2;i<=sqrt(n);i++) if(n%i==0) return false; return true; } int main() { int n,m,s=0; cin>>n>>m; for(int i=n;i<=m;i++) if(f(i)) { cout<<i<<" "; s++; } cout<<endl<<s; return 0; }

-6

lihaijie LV 6 @ 2022-2-20 20:48:59

#include <stdio.h> #include #include <math.h> using namespace std; int main() { int n,m; cin>>n>>m; if(n<2) n=2; int sum=0; for(int i = n;i<=m;i++) { int flag=1; for(int j=2;j*j<=i;j++) { if(i%j0) { flag=0; break; } } if(flag1) { cout<<i<<" "; sum++; } } if(sum!=0) cout<<endl; cout<<sum<<endl; }

-7

buwenqiu LV 7 @ 2022-2-11 11:52:21

#include #include<stdio.h> using namespace std; int main() { int n,m; cin>>n>>m; if(n<2) n=2; int sum=0; for(int i=n;i<=m;i++) { int flag=1; for(int j= 2;j*j <=i;j++) { if(i%j0) { flag=0; break; } } if(flag1) { cout<<i<<" "; sum++; } } if(sum !=0) cout<<endl; cout<<sum<<endl; }

19 条题解

信息

状态

开发

支持

关于

19 条题解

素数个数

信息

状态

开发

支持

关于

还没有账户？

登录