目录
5-3
void pyramid(int n) {
for (int i = 1; i <= n; i++) {
//打印空格
for (int k = 0; k != n - i; k++) {
cout << " ";
}
//打印数字
for (int j = 0; j != i; j++) {
cout << i << " ";
}
//换行
cout << endl;
}
}
5-1
int sign(int x) {
if (x > 0) {
return 1;
}
else if(x = 0){
return 0;
}
else {
return -1;
}
}
5-2
int even(int n) {
if (n % 2 == 0) {
return 1;
}
else {
return 0;
}
}
int oddSum(int list[], int n) {
int sum = 0;
for (int i = 0; i < n; i++) {
if (even(list[i]) == 0) {
//cout << list[i] << " ";
sum += list[i];
}
}
return sum;
}
5-3
double dist(double x1, double y1, double x2, double y2) {
double temp = 0;
temp = sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
return temp;
}
5-4
int prime(int p) {
if (p <=1)return 0;
if (p == 2)return 1;
for (int i = 2; i != p; i++) {
if (p % i == 0)return 0;
}
return 1;
}
int primeSum(int m,