1 条题解
-
0
C++ :
#include <bits/stdc++.h> using namespace std; int main() { long long m,n,i,c = 0,x; cin>>m>>n; x = m * n; for(i = 2;i <= sqrt(x);i++){ if(x % i == 0 && i != m){ c++; } } cout<<c<<endl; return 0; }Java :
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); long num1 = scanner.nextInt(); long num2 = scanner.nextInt(); // int num3 = scanner.nextInt(); // int num4 = scanner.nextInt(); // int num5 = scanner.nextInt(); // double num1 = scanner.nextDouble(); // double num2 = scanner.nextDouble(); // double num3 = scanner.nextDouble(); long m = 1, x, count = 0,s = 0; x = num1 * num2; for(long i = 2;i <= Math.sqrt(x);i++){ if(x % i == 0)count++; } System.out.println(count - 1); } }Python :
m,n=list(map(int,input().split())) #n=int(input()) c=m*n sum=0 for i in range(2,int(c**0.5)+1): if c%i==0 and i<=c//i and i!=min(m,n): sum=sum+1 print(sum)
- 1
信息
- ID
- 298
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者