1.4分支结构设计
#include<stdio.h>
int main(){
/*已知鸡和兔的总数量为n,总腿数为m。输入n和m,依次输出鸡的数目和兔的数目。如
果无解,则输出No answer*/
/*样例输出:
12 2
样例输入:
10 16
样例输出:
No answer*/
int a,b,n,m;
scanf("%d %d",&n,&m);
a= (4*n-m) /2;
b=n-a;
if(m%2==1||a<0||b<0) //m不为奇数, 数量不为负值
printf("No answer");
else
printf("%d %d\n",a,b);
}
排序
#include<stdio.h>
int main()
{ /*数字排序*/
int a, b, c, t;
scanf("%d%d%d", &a, &b, &c);
if(a > b) { t = a; a = b; b = t; } //执行完毕之后a≤b
if(a > c) { t = a; a = c; c = t; } //执行完毕之后a≤c,且a≤b依然成立
if(b > c) { t = b; b = c; c = t; }
printf("%d %d %d\n", a, b, c);
return 0;
}