1 solutions

  • 0
    @ 2025-3-3 16:33:13

    C :

    #include<stdio.h>
    int main()
    {
        int i;
        int n,flag=0;
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        {
            if(i%2==0)
            {
                if(i%3==0||i%5==0||i%7==0)
                    flag++;
            }
            if(i%3==0)
            {
                if(i%2==0||i%5==0||i%7==0)
                    flag++;
            }
            if(i%5==0)
            {
                if(i%3==0||i%2==0||i%7==0)
                    flag++;
            }
            if(i%7==0)
            {
                if(i%3==0||i%5==0||i%2==0)
                    flag++;
            }
                if(flag>=1)
                    printf("%d\n",i);
            flag=0;
        }
        return 0;
    }
    
    

    C++ :

    #include <iostream>
    using namespace std;
    
    int main(){
    	int n,i,c=0;
    	cin>>n;
    	for(i = 1;i <= n;i++){
    		c = 0;
    		if(i%2==0)c++;
    		if(i%3==0)c++;
    		if(i%5==0)c++;
    		if(i%7==0)c++;
    		
    		if(c >= 2) cout<<i<<endl;
    	}
    }
    

    Java :

    import java.util.Scanner;
    
    public class Main{
    
    public static void main(String[] agrs){
    
    Scanner input = new Scanner(System.in);
    	int n = input.nextInt();
    	for(int i = 2;i <= n;i++){
    		int num = 0;
    		if(i % 2 == 0){
    				num++;
    		}
    		if(i % 3 == 0){
    				num++;
    		}
    		if(i % 5 == 0){
    				num++;
    		}
    		if(i % 7 == 0){
    				num++;
    		}
    		if(num >= 2){
    	      System.out.println(i);
    	    }
    	}
    	
    	
    
    	
    	
    	
    	
    	
    	
    	}
    	}
    	
    

    Python :

    n = int(input())
    for i in range(1, n + 1):
        c = 0
        if i % 2 == 0:
            c += 1
        if i % 3 == 0:
            c += 1
        if i % 5 == 0:
            c += 1
        if i % 7 == 0:
            c += 1
        if c >= 2:
            print(i)
    
    
    • 1

    【入门】能被2、3、5、7中至少2个数整数的数

    Information

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