笔试题2

题目描述：

找出区间[low，high)的所有质数，输出这些质数的十位数之和与个位数之和的较小值。

#include<iostream>
#include<algorithm>
using namespace std;

int Isprime(int n){  //判断是否为素数
	for (int i = 2; i < n; ++i){
		if (n%i == 0){
			return 0;
		}
	}
	return n;
}
int main(){
	int low, high;
	int ar1 = 0, ar10 = 0;
	cin >> low >> high;
	for (int i = low; i <= high; ++i){
		int num;
		num = Isprime(i);
		ar10 = ar10 + (num / 10) % 10;
		ar1 = ar1 + num % 10;
	}
	
	if (ar1 > ar10)
		cout << ar10;
	else
		cout << ar1;
	return 0;
}