1 solutions

  • 0
    @ 2025-11-5 17:15:06

    C++ :

    #include<iostream>
    using namespace std;
    int isprime(int n)
    {
    	int i;
    	for(i=2;i*i<=n;i++)
    	{
    		if(n%i==0)
    		return 0; 
    	} 
    	return 1; 
    } 
    int main()
    {
    	int n,i;
    	cin>>n;
    	int a=0; 
    	for(i=2;i<=n;i++)
    	{
    		if(isprime(i)==1&isprime(i+2)==1)
    		a++; 
    	} 
    	cout<<a; 
    	return 0; 
    } 
    

    Java :

    import java.util.Scanner;
    
    
    public class Main {
    	public static void main(String[] args) {
    		Scanner sc = new Scanner(System.in);
    		int n = sc.nextInt();
    		int sum = 0;
    		for(int i=2;i<=n;i++) {
    			if(IsPrime(i) && IsPrime(i+2) && (i+2)<n)
    				sum++;
    		}
    		System.out.println(sum);
    	}
    	static boolean IsPrime(int n) {
    		for(int i=2;i*i<=n;i++) {
    			if(n%i==0)
    				return false;
    		}
    		return true;
    	}
    }
    
    • 1

    Information

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