陶永攀

圆桶排序 下面是代码： #include int main() { int a[11],i,j,n,t; for(i=0;i

输入两个正整数m和n求其最大公约数和最小公倍数 用辗转相除法进行求解 #include int main() { int m,n,r,p,t; while(~scanf("%d %d",&n,&m))//输入多组值 { p=m*n;//科普：n个数的乘积与他们的最小公约数和最大公倍数的值相等 if(n>m)//将简答...

冒泡排序代码 #include #define N 100 int a[N];//定义一位数组a[N] int main() { int i,n,j,t; while(~scanf("%d",&n)) //可输入多组数据 { printf("请输入n个整数\n"); for(i=0;i...

快速排序的效率较冒泡排序的较高 我也不是真的非常理解，我就把我的想法写下来吧。 下面是代码，我会根据我的理解进行注释~ #include int a[101],n; int quicksort(int left ,int right) { int i,j,t,temp; temp=a[left];//将最左边的作为基准数 i=left; j=ri...

#include int main() { int n,i; scanf("%d",&n); for(i=1;i

Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are ...

#include #include double cha(double x) { return 8*pow(x,4) + 7*pow(x,3) + 2*pow(x,2) + 3*x + 6; } int main() { int t; double left,right,mid; scanf("%d",&t); int y; ...

Problem Description Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+...

#include #include #include #include #include using namespace std; double cal(double x,double y) { return 6*pow(x,7)+8*pow(x,6)+7*pow(x,3)+5*pow(x,2)-y*x ; } int main() { int t; ...