#include <stdio.h>
void fun(int *a, int n)
{
int t;
for (int i = 0; i < n-1; i++)
for (int j = 0; j < n-1-i; j++)
if (a[j]<a[j+1])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
int main()
{
int a[3];
int n = 3;
for (int i = 0; i < 3; i++)
scanf("%d", &a[i]);
fun(a, n);
for (int i = 0; i < n; i++)
printf("%d ", a[i]);
}
第一题:
double mypow(double x,int y)
{
int i;
double s = 1;
if(y==0)
return 1;
for(i=1;i<=y;i++)
s = s*x;
return s;
}
第二题:
#include <stdio.h>
void fun(int *a,int *b,int *c)
{
int max,min;
max = *a>(*b>*c?*b:*c)?*a:(*b>*c?*b:*c);
min = *a<(*b<*c?*b:*c)?*a:(*b<*c?*b:*c);
*b = *a + *b + *c - max - min;
*a = max;
*c = min;
}
int main()
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
fun(&a,&b,&c);
printf("从大到小:%d %d %d\n",a,b,c);
return 0;
}
#include <stdio.h>
double mypow(double x, int y)
{
double p = 1;
while (y)
{
p *= x;
y--;
}
return p;
}
int main()
{
double a = 5.0;
int n = 5;
printf("%lf\n", mypow(a, n));
return 0;
}
#include <stdio.h>
void fun(int *a, int n)
{
int t;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (a[i] > a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
for (int i = 0; i < n; i++)
printf("%d ", a[i]);
printf("\n");
}
int main()
{
int a[3];
int n = 3;
for (int i = 0; i < 3; i++)
scanf("%d", &a[i]);
fun(a, n);
return 0;
}