main(){int a[]={0,31,28,31,30,31,30,31,31,30,31,30,31};/*平年的每月最后一天*/int b[]={0,31,29,31,30,31,30,31,31,30,31,30,31};/*闰年的每月最后一天*/int year,month,date;int year1,month1,date1;int year2,month2,date2;int d,m,day,i=1;lon

来源:学生作业帮助网 编辑:作业帮 时间:2024/04/30 09:48:12
main(){int a[]={0,31,28,31,30,31,30,31,31,30,31,30,31};/*平年的每月最后一天*/int b[]={0,31,29,31,30,31,30,31,31,30,31,30,31};/*闰年的每月最后一天*/int year,month,date;int year1,month1,date1;int year2,month2,date2;int d,m,day,i=1;lon

main(){int a[]={0,31,28,31,30,31,30,31,31,30,31,30,31};/*平年的每月最后一天*/int b[]={0,31,29,31,30,31,30,31,31,30,31,30,31};/*闰年的每月最后一天*/int year,month,date;int year1,month1,date1;int year2,month2,date2;int d,m,day,i=1;lon
main()
{
int a[]={0,31,28,31,30,31,30,31,31,30,31,30,31};/*平年的每月最后一天*/
int b[]={0,31,29,31,30,31,30,31,31,30,31,30,31};/*闰年的每月最后一天*/
int year,month,date;
int year1,month1,date1;
int year2,month2,date2;
int d,m,day,i=1;
long count=0;
printf("按照年 月 日的格式输入起始日期");
scanf("%d %d %d",&year1,&month1,&date1);
if(0==(check(year1,month1,date1))) {printf("intput error\n");exit(0);}
printf("按照年 月 日的格式输入结束日期");
scanf("%d %d %d",&year2,&month2,&date2);
if(0==(check(year2,month2,date2))) {printf("intput error\n");exit(0);}
if(change(year1,month1,date1)>change(year2,month2,date2))
{year=year1;year1=year2;year2=year;
month=month1;month1=month2;month2=month;
date=date1;date1=date2;date2=date;}
printf("\n%d-%d-%d,%d-%d-%d之间的素日期是:\n",year1,month1,date1,year2,month2,date2);
for(year=year1;year

main(){int a[]={0,31,28,31,30,31,30,31,31,30,31,30,31};/*平年的每月最后一天*/int b[]={0,31,29,31,30,31,30,31,31,30,31,30,31};/*闰年的每月最后一天*/int year,month,date;int year1,month1,date1;int year2,month2,date2;int d,m,day,i=1;lon
#include
#include
int leap(int year)
{
int l;
if (((year%4==0)&&(year%100!=0))||(year%400==0))
l=1;
else
l=0;
return (l);
}
long change(int year,int month,int date)
{
long n;
n=10000*year+100*month+date;
return (n);
}
int prime(long x)
{
long i,k;
int j;
k=sqrt(x);
for(i=2;i=k+1) j=1;
else j=0;
return (j);
}
int check(int year,int month,int date)
{
int day,r;
int a[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int b[]={0,31,29,31,30,31,30,31,31,30,31,30,31};
if(leap(year)) day=b[month];
else day=a[month];
if((yearchange(year2,month2,date2))//使较小的年月日放在开头,较大的年月日放在结束
{year=year1;year1=year2;year2=year;
month=month1;month1=month2;month2=month;
date=date1;date1=date2;date2=date;}
printf("\n%d-%d-%d,%d-%d-%d之间的素日期是:\n",year1,month1,date1,year2,month2,date2);
for(year=year1;year

main() {int m[10],a;for(a=0,a #define MAX 10 int a[MAX],i; int main( ) sub1( ) { for(i=0;i #include void main(){int a[30];int i;for (i=0,i void main() {int t=1;fun(fun(t));} fun(int h) {stvoid main(){int t=1;fun(fun(t));}fun(int h){static int a[3]={1,2,3}; int k; for(k=0;k error C2065:'a' :undeclared identifier#includeint main(){int print_shang();int print_xia();print_shang();print_xia();return 0;}int print_shang(){int a,b;for(a=1;a int main(void) { int k=0; while(k++ int f() { static int i=0; int s=1; s+=i; i++; return s; }main() { int i,a=0; for(i=0;i c++求2+22+222+2222+22222.#includevoid main(){int sum=0;int a=2;int n;coutn;for(int i=1;i main() {int t=1;fun(fun(t));} fun(int h){static int a[3]={1,2,3};int k; for(k=0;k #include void main() { int a,c; a=0; if (a main() { int a; for(a=1;a int a=3; main(){int s=0;{int a=5;s+=a++;}s+=a++;printf(%d ,s);} 打印出杨辉三角形main() {int i,j; int a[10][10]; printf( ); for(i=0;i void fun(int a,int b) { int t; t=a;a=b;b=t; } main()void fun(int a,int b){ int t; t=a;a=b;b=t; } main() { int c[10]={1,2,3,4,5,6,7,8,9,0}.i; for(i=0;i 37、有以下程序 int a=2; int f(int *a) {return (*a)++;} main( ) { int s=0; { int a=5; s+=f(&a); } s+答案为什么是C,37、有以下程序 int a=2; int f(int *a) {return (*a)++;} main( ) { int s=0; { int a=5; s+=f(&a); } s+=f(&a); printf(%d c语言 不知怎么改 error C2017:illegal escape sequence#include stdio.hint main(){int sum;char a[80];gets(a);for (int i=0;i 矩阵相加(C++)#include using namespace std; const int rows=3;const int cols=3;void matrixadd(int *,int *,int *,int,int);int main(){int a[rows][cols]={{1,3,5},{7,8,11},{13,15,17}};int b[rows][cols]={{9,8,7},{6,5,4},{3,2,1}};int c[rows][cols]={0 #include int call(int s[],int y) { static int t=3; y=s[t--]; return(y); } void main() { in#includeint call(int s[],int y){static int t=3;y=s[t--];return(y);}void main(){int a[]={3,8,4,2},n,x=0;for(n=0;n