反转九位以下数字
#include <iostream>
#include <iomanip>
using namespace std;
int main(){
int num;
cout << "请输入你要反转的数字:";
cin >> num;
int nums[9];
int count = 0;
cout << "原先要反转的数字:" << setw(15) << num << endl;
for (int n = 0; num > 0; n++) {
nums[n] = num % 10;
num /= 10;
count++;
}
int num2 = 0;
for (int i = 0; i < count; i++) {
num2 = num2 * 10 + nums[i];
}
cout << "反转后的数字:" << setw(15) << num2 << endl;
return 0;
}
九九乘法表,感觉只是熟悉了一下格式控制这个东西,熟悉了一下头文件iostream iomanip using namespace std; cin>> cout<< setw()
#include <iostream>
#include <iomanip>
using namespace std;
int main(){
cout << setw(3) << '*' << setw(4) << ' ';
for (int i = 1; i < 10; i++)cout << setw(3) << i << setw(4) << ' ';
cout << endl;
for (int i = 1; i < 10; i++) {
cout << setw(3) << i << setw(4) << ' ';
for (int j = 1; j <=i; j++) {
cout << setw(3) << i * j << setw(4) << ' ';
}
cout << endl;
}
return 0;
}
查找n以内的素数
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main(){
cout << "目的:找出n以内的所有素数(除1,2,3外)" << endl;
int n;
cout << "请输入您要查找的范围n:";
cin >> n;
cout << setw(5) << 1 << setw(5) << 2 << setw(5) << 3;
for (int i = 4; i <= n; i++) {
int count = 2;
for (int j = 2; j <= sqrt(i); j++) {
if (i % j == 0)break;
count++;
if (count > sqrt(i))cout << setw(5) << i;
}
}
return 0;
}
利用静态计数器,第一次体验到递归“多次调用的麻烦之处”,用的好NB,用不好SB
#include<iostream>
#include<iomanip>
using namespace std;
int feibo(int n) {
static int count = 0;
count++;
cout << "调取feibo函数的次数:" << setw(8) << count<<endl;
if (n == 1 || n == 2)return 1;
return feibo(n - 1) + feibo(n - 2);
}
int main(){
int n;
cout << "请输入你要查询的斐波那契数的位数:";
cin >> n;
cout << "您查询的数字是:" << setw(8) << feibo(n) << endl;
}