1find the minimum value and swap with the first one;find the maximum value and swap with the last one.
#include <stdio.h>
int main(void) {
int a[10],n,max,min,i,temp,j,k;
printf("please input n equal to:");
scanf("%d",&n);
printf("please input a[n]:");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
printf("output a[n]:");
for(i=0;i<n;i++){
printf("%d\t",a[i]);
}
min = a[0];
max = a[0];
for(i=0;i<n;i++){
if(a[i]<=min){
min = a[i];
j = i;
}
else{
continue;
}
}
temp = a[j];
a[j] = a[0];
a[0] = temp;
printf("output swapped sequence1:");
for(i=0;i<n;i++){
printf("%d\t",a[i]);
}
for(i=0;i<n;i++){
if(a[i]>=max){
max = a[i];
k=i;
}
else{
continue;
}
}
temp = a[k];
a[k] = a[n-1];
a[n-1] = temp;
printf("output swapped sequence2:");
for(i=0;i<n;i++){
printf("%d\t",a[i]);
}
}
2output prime number between 100 and 200
#include <stdio.h>
#include<math.h>
int main(void) {
int i,j,k;
for(i=100;i<=200;i++){
j = sqrt(i);
for(k=2;k<=j;k++){
if(i%k==0){
break;
}
else if(i%k!=0){
printf("%d is prime number",i);
continue;
}
}
}
}
3monkey eat peach
#include <stdio.h>
int eat(int k){
return k;
}
int main(void) {
int i,j=1,n,k=1;
printf("n equal to:");
scanf("%d",&n);
for(i=1;i<=n;i++){
k = (k+1)*2;
}
printf("k equal to %d",k);
}
4english characters case swap
#include<stdio.h>
#include<string.h>
int main()
{
char s[51];
int i;
scanf("%s",s);
for(i=0;s[i]!='\0';i++){
if(s[i]>='A'&&s[i]<='Z')
s[i]+=32;
else if(s[i]>='a'&&s[i]<='z')
s[i]-=32;
}
for(i=0;s[i]!='\0';i++)
printf("%c",s[i]);
return 0;
}
5output diamond
#include <stdio.h>
int main(void) {
int n;
printf("please input n equal to:");
scanf("%d",&n);
switch(n){
case 1:
printf(" * \n");
break;
case 2:
printf(" * \n");
printf(" *** \n");
break;
case 3:
printf(" * \n");
printf(" *** \n");
printf(" ***** \n");
break;
case 4:
printf(" * \n");
printf(" *** \n");
printf(" ***** \n");
printf(" ******* \n");
break;
case 5:
printf(" * \n");
printf(" *** \n");
printf(" ***** \n");
printf(" ******* \n");
printf("*********\n");
break;
case 6:
printf(" * \n");
printf(" *** \n");
printf(" ***** \n");
printf(" ******* \n");
printf("*********\n");
printf(" ******* \n");
break;
case 7:
printf(" * \n");
printf(" *** \n");
printf(" ***** \n");
printf(" ******* \n");
printf("*********\n");
printf(" ******* \n");
printf(" ***** \n");
break;
case 8:
printf(" * \n");
printf(" *** \n");
printf(" ***** \n");
printf(" ******* \n");
printf("*********\n");
printf(" ******* \n");
printf(" ***** \n");
printf(" *** \n");
break;
case 9:
printf(" * \n");
printf(" *** \n");
printf(" ***** \n");
printf(" ******* \n");
printf("*********\n");
printf(" ******* \n");
printf(" ***** \n");
printf(" *** \n");
printf(" * \n");
break;
}
}
although this code also solves the problem ,it is very complicated ,and it is better to use another methed
#include <stdio.h>
int main()
{
int n,a,b,c;
printf("输入一个正奇数n,输出最中间一行'*'个数为n的菱形。\n");
printf("请输入一个数。\n");
scanf("%d",&n);
if(n%2==0||n<=0)
printf("输入数据错误");
else
{ for(a=1;a<=(n+1)/2;a++)
{//中间及以上的行数为(n+1)/2,所以上半部分循环的次数为(n+1)/2
for(b=1;b<=(n+1)/2-a;b++) //每一行左半边的空格数为(n+1)/2-所在行数*
printf(" ");
for(c=1;c<=2*a-1;c++) //*的个数为行数的二倍减一*
printf("*");
printf("\n");
}
for(a=1;a<=(n-1)/2;a++) //下半部分的行数比上半部分少一*
{
for(b=1;b<=a;b++) //空格数依次增加*
printf(" ");
for(c=1;c<=n-2*a;c++) //*数依次减少*
printf("*");
printf("\n");
}
}
return 0;
}