c++作业7

来源：互联网发布：mac os x office 编辑：程序博客网时间：2024/05/21 10:06

项目2-最大公约数和最小公倍数

#include<iostream.h>int leasemul;//定义全局变量void F1(int a,int b){int c;if(a<b){F1(b,a);}else{while(b!=0){c=a%b;a=b;b=c;}leasemul=a;}}int F2(int a,int b){int c;c=(a*b)/leasemul;return c;}void main(){int a,b;cout<<"请输入两个整数：";cin>>a>>b;F1(a,b);cout<<a<<"与"<<b<<"的最大公约数为："<<leasemul<<endl;F2(a,b);cout<<a<<"与"<<b<<"的最小公倍数为："<<F2(a,b)<<endl;}

项目4-数组素数排序

#include<iostream.h>void sort(int p[],int n);//数组排序bool prime(int x);//素数判断void print(int p[],int n);//输出数组void main(){int a[10]={2,13,5,47,19,53,27,23,28,11};int b[10],i,j=0,k=0;for(i=0;i<10;i++){prime(a[i]);if(prime(a[i])==true){b[j]=a[i];j++;}}cout<<"排序前的b数组为：";print(b,j);//输出排序前的b数组sort(b,j);//对数组b排序cout<<"排序后的b数组为：";print(b,j);//输出排序后的b数组}  void sort(int p[], int n){int i,j,t;for(i=0;i<n-1;i++)for(j=0;j<n-i-1;j++){if(p[j]>p[j+1]){t=p[j];p[j]=p[j+1];p[j+1]=t;}}}bool prime(int x){int i;if(x<2)return false;for(i=2;i*i<=x;i++){if(x%i==0)return false;}return true;}void print(int p[],int n){int i;for(i=0;i<n;i++)cout<<p[i]<<"  ";cout<<endl;}

0 0