1、判断一个数是不是素数(素数的定义:只能被1和本身整除)
#include<iostream>
using namespace std;
bool isPrime(int num){
for(int i = 2;i < num;i++){
if(num % i == 0){
return false;
}
}
return true;
}
int main(){
int num = 0;
cout<<"请输入一个数字"<<endl;
cin>>num;
cout<<"这个数是否为素数"<<isPrime(num)<<endl;
}
2、输入一个三位数,将这个三位数反向输出,例如:输入1 2 3 ,输出:3 2 1
#include<iostream>
using namespace std;
int Newnum(int num){
int a = num / 100;//百位
int b = (num % 100)/10;//十位
int c = num % 10;//个位
int d = c * 100 + b * 10 + a * 1;
return d;
}
int main(){
int num = 0;
cout<<"请输入一个数字"<<endl;
cin>>num;
int a = Newnum(num);
cout<<"反转数为:"<<a<<endl;
}
3、交换a,b变量的值
#include<iostream>
using namespace std;
void swap(int &a , int &b){
int temp = a;
a = b;
b = temp;
}
int main(){
int a = 10;
int b = 20;
swap(a,b);
cout<<"a为:"<<a<<endl;
cout<<"b为:"<<b<<endl;
}
4、鸡兔同笼问题,总数量为n,总腿数为m,问鸡和兔子各有多少只?
#include<iostream>
using namespace std;
int RubbitAndSoa(int n, int m){
for(int i = 0;i < n;i++){
if(i*2 + (n-i)*4 == m){
cout<<"鸡有:"<<i<<"只"<<endl;
cout<<"兔子有:"<<n-i<<"只"<<endl;
}
}
return 0;
}
int main(){
int n = 0;
int m = 0;
cout<<"请输入鸡和兔的总数量"<<endl;
cin>>n;
cout<<"请输入总腿数"<<endl;
cin>>m;
RubbitAndSoa(n,m);
}
5、九九乘法表
#include<iostream>
using namespace std;
int NineTable(int n,int i,int j){
int num = 0;
for(i = 1; i<=9;i++){
cout<<endl;;
for(j = 1;j<=i;j++){
n = i * j;
cout<<i<<"*"<<j<<"="<<n<<" ";
}
}
}
int main(){
//九九乘法表
int n,i,j;
NineTable(n,i,j);
system("pause");
return 0;
}
6、输入三个数,按从小到大输出;
#include<iostream>
using namespace std;
void sort(int a, int b ,int c){
int temp = 0;
if(a > b){
temp = a;
a = b;
b = temp;
}
else if(b > c){
temp = b;
b = c;
c = temp;
}
else if(a > c){
temp = a;
a = c;
c = temp;
}
cout<<a<<" "<<b<<" "<<c<<endl;
}
int main(){
cout<<"请输入三个整数"<<endl;
int a ,b,c;
cin>>a;
cin>>b;
cin>>c;
sort(a,b,c);
}
好了,不想写了,其他的有时间整理给大家看,明天整理一下各种排序算法~