1、实现一个函数,判断整数是否是素数,调用该函数显示出100~10000之间的所有素数
#include <stdio.h>
int sushu(int a);
int main(int argc,const char* argv[])
{
int i,sum=0,a;
for(i=100;i<10000;i++)
{
a=sushu(i);
if(a==1)
{
printf("%d ",i);
sum++;
}
}
printf("\n%d",sum);
}
int sushu(int a)
{
int i,result;
for(i=2;i<=a/2;i++)
{
if(a%i==0) break;
}
if(i>a/2)
{
result=1;
}
else result=0;
return result;
}
2、输入两个日期,计算两个日期之间间隔了多少天
#include <stdio.h>
int time(int year,int month,int day);
int main(int argc,const char* argv[])
{
int i,year1,month1,day1,n,year2,month2,day2,days;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d-%d-%d",&year1,&month1,&day1);
scanf("%d-%d-%d",&year2,&month2,&day2);
days=(year2-year1)*365+(year2-year1)/4-(year2-year1)/100+(year2-year1)/400-time(year1,month1,day1)+time(year2,month2,day2);
if(days<0) days=-days;
printf("%d\n",days);
}
}
int time(int year,int month,int day)
{
int sum,i;
sum=0;
int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
for(i=1;i<month;i++)
{
sum=sum+a[i];
}
if(year%4==0&&year%100!=0&&year%400==0)
{
if(month>2||month==2&&day>28) sum=sum+1;
}
sum=sum+day;
return sum;
}
3、实现一个函数,判断整数是否是回文数,调用该函数显示出1亿-10亿之间的所有回文数
#include <stdio.h>
int back(int num);
int main(int argc,const char* argv[])
{
int i,sum=0;
for(i=100000000;i<1000000000;i++)
{
if(back(i)==1)
{
printf("%d ",i);
sum++;
}
}
printf("\n%d",sum);
}
int back(int num)
{
int i=0,a[12],j,result=1;
while(num!=0)
{
a[i]=num%10;
num=num/10;
i++;
}
for(j=i-1;j>i/2;j--)
{
if(a[j]!=a[i-j-1]) result=0;
}
return result;
}
4、计算出100的阶乘
#include <stdio.h>
int num(int n);
int a[256]={1,0};
int main(int argc,const char* argv[])
{
int n,i;
int sum;
while(scanf("%d",&n)!=EOF)
{
a[0]=1;
for(i=1;i<256;i++) a[i]=0;
sum=num(n);
for(i=sum-1;i>=0;i--)
{
printf("%d",a[i]);
}
printf("\n%d\n",sum);
}
}
int num(int n)
{
int i,wei,j,sum=1;
for(i=1;i<=n;i++)
{
for(j=0;j<256;j++)
{
a[j]=a[j]*i;
}
for(j=0;j<256;j++)
{
if(a[j]>100)
{
a[j+2]=a[j+2]+a[j]/100;
a[j]=a[j]%100;
}
if(a[j]>10)
{
a[j+1]=a[j+1]+a[j]/10;
a[j]=a[j]%10;
}
}
}
for(i=256;i>=0;i--)
{
if(a[i]!=0)
{
sum=i+1;break;
}
}
return sum;
}