一 和差积商
#include "stdio.h"
int add(int a,int b)
{
int c;
c=b+a;
return c;
}
int minus(int a,int b)
{
int c;
c=a-b;
return c;
}
int multip(int a,int b)
{
int c;
c=a*b;
return c;
}
int quotient(int a,int b)
{
int c;
c=a/b;
return c;
}
int mod(int a,int b)
{
int c;
c=a%b;
return c;
}
int main()
{
int x,y;
scanf("%d %d",&x,&y);
int z1,z2,z3,z4,z5;
z1=add(x,y);
z2=minus(x,y);
z3=multip(x,y);
z4=quotient(x,y);
z5=mod(x,y);
printf("%d\n%d\n%d\n%d\n%d\n",z1,z2,z3,z4,z5);
return 0;
}
‘
二 判断素数’
#include<stdio.h>
int prime(int n){
int i,j,k;
k=n/2;
if (n==1)
return 0;
for (i=2;i<=k;i++)
{
if (n%i==0)
return 0;
}
return 1;
}
int main()
{
int n;
while (scanf("%d",&n)==1)
{if (prime(n)==1)
printf("YES\n");
else if (prime(n)==0)
printf("NO\n");}
return 0;
}
三 比大小
#include "stdio.h"
int max2(int a,int b)
{
if(a>b)
return a;
else
return b;
}
int max4(int a,int b,int c,int d)
{
int max2(int,int);
int m;
m=max2(a,b);
m=max2(m,c);
m=max2(m,d);
return m;
}
int main(int argc, char* argv[])
{
int a,b,c,d;
int max;
scanf("%d%d%d%d",&a,&b,&c,&d);
max=max4(a,b,c,d);
printf("max=%d\n",max);
return 0;
}
、
四 递归法求n！
# include "stdio.h"
int x(int n)
{
if(n==1||n==2)
return n;
else
return n*x(n-1);
}
int main()
{
int n,sum;
scanf("%d",&n);
sum=x(n);
printf("%d\n",sum);
return 0;
}
