WeChall -Prime Factory-python

# !python3
# coding:utf8

import math

# 判断素数
def isprime(number):
for i in range(2,(int)(math.sqrt(number)+1)):
if(number%i==0):
return 0
return 1

# 把一个数的每一位都加起来，成为一个新数
def add_all(number):
inumber=0
while number != 0:
a = number % 10
inumber += a
number = number /10
return inumber

if __name__ == '__main__':
count = 0
for number in xrange(1000000,2000000):
addnumber = add_all(number)
if isprime(number) and isprime(addnumber):
if count < 2:
print(number)
count += 1
else:
exit(0)

#include<iostream>
#include<math.h>
using namespace std;

int a;
bool IsPrime(int p) {
a = (int)sqrt(p) ;
for (int i = 2; i <= a; i++) {
if ((p%i )== 0)
return false;
}
return true;
}

int Add_Number(int number) {
int add_number = 0;
int one;
while (number != 0) {
one= number % 10;
add_number += one;
number = number / 10;
}
return add_number;
}

int main() {
int add_number;
for (int number = 1000034;; number++) {
add_number = Add_Number(number);
if (IsPrime(number)&&IsPrime(add_number)) {
cout << number << endl;
return 0;
}
}