for (int i =0;i<100;i++){
int r = [self isPrime:i];
if(r==1){
NSLog(@"%d",i);
}
}
-(int)isPrime:(int)number{
for(int i=0;i<=sqrt(number);i++){
if(number%i==0) return0;
}
return 1;
}
2榜跌、求兩個(gè)整數(shù)的最大公約數(shù)
int gcd(int a,int b){
int temp = 0;
if(a<b){
temp = a;
a = b;
b = temp;
}
while (b!=0) {
temp = a % b;
a = b;
b = temp;
NSLog(@"a:%d b:%d",a,b);
}
return a;
}
