1 条题解

  • 0
    @ 2025-10-10 15:45:26

    C :

    #include<stdio.h>
    void main()
    {
    	int x; 
     	scanf("%d",&x); 
    	if(x != 1){ 
     	int i; 
     	int c = 0; //除了1很本身外的约数 
    	for(i = 2;i <= x/2 ;i++){ 
    		if(x % i == 0){ 
     			c++; 
     			printf("%d",i);
     			break; 
     		} 
    	} 
     
     	if(c == 0){ 
     		printf("Yes");
     	}
    	}
    }
    

    C++ :

    #include<iostream>
    #include<cmath>
    using namespace std;
    
    int main(){
    	
    	int n;
    	int min;
    	bool f;
    	
    	
    	f=true;
    	cin>>n;
    	
    	for(int i=2;i<=sqrt(n);i++){
    		if(n%i==0){
    			f=false;
    			min=i;
    			break;
    		}
    	}
    	
    	if(f==false || n==0 || n==1){
    		cout<<min<<endl;
    	}
    	else
    	{
    		cout<<"Yes"<<endl;
    	}
    }
    
    

    Pascal :

    var
      n,a,i,s:longint;
    begin
      read(n);
      s:=1;
      for i:=2 to trunc(sqrt(n)) do
      if n mod i=0 then begin s:=i; break; end
                   else s:=0;
      if s=0 then write('Yes')
              else write(s);
    end.
    
    

    Java :

    import java.util.Scanner;
    
    public class Main {
    
    	public static void main(String[] args) {
    	@SuppressWarnings("resource")
    	Scanner scanner=new Scanner (System.in);
        int m=scanner.nextInt();
        int a;
          for(a=2;a<m;a++) {
        	  if (m%a==0)
        		  break;}  
          if (m==a)
        		  System.out.println("Yes");
          else {int b;
        	  for (b=2;b<m;b++) {
        		  if(m%b==0) break;}
        			 System.out.println(b);
       	  
          }
         } 
    	}
    
    

    Python :

    n=int(input())
    f = 1
    for i in range(2,n-1,1):
        if n % i==0:
            f = 0
            break
    if f==1:
        print("Yes")
    else:
        print(i)
    
    
    • 1

    信息

    ID
    60
    时间
    1000ms
    内存
    512MiB
    难度
    9
    标签
    递交数
    9
    已通过
    4
    上传者