1 solutions

  • 0
    @ 2025-11-5 18:49:28

    C :

    #include<stdio.h>
    #include<math.h>
    main()
    {
    	int prime(int x);
    	int m;
    	scanf("%d",&m);
    	if(prime(m)!=0)
    		printf("prime\n");
    	else
    		printf("not prime\n");
    }
    int prime(int x)
    {
    	int i;
    	if(x==1)
    		return 0;
    	else
    	{
    		for(i=2;i<=sqrt(x);i++)
    			if(x%i==0)
    				break;
    			if(i>sqrt(x))
    				return 1;
    			return 0;
    	}
    }
    

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    long long n,a[1000000];
    int main()
    {
    	cin>>n;
    	for(int i=2;i*i<=n;i++)
    	{
    		if(a[i]==0)
    		{
    			for(int j=i+i;j<=n;j+=i)
    			    a[j]=1;
    		}
    	}
    	if(a[n]==0)
    	    cout<<"prime";
    	else
    	    cout<<"not prime";
    		
        return 0;
    }
    
    • 1

    Information

    ID
    19061
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By