1、求int的上限与下限
#include
2、
}
fprintf(fout,"%d\n",max-1);
fclose(fin);
fclose(fout);
return 0;
}
1-1
#include
3、return 0;
}
1-2
#include
4、f("%d\n",(1+n)*n/2) ;
system("pause");
return 0;
}
1-4
#include
5、
}
printf("正弦:%lf\n余弦:%lf",sin(n*pi/180),cos(n*pi/180));
system("pause");
return 0;
}
1-5
#include
6、f%lf",&x2,&y2);
double d;
d=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
printf("%.3lf\n",d);
system("pause");
return 0;
}
1-6
#include
7、
return 0;
}
1-7
#include
8、 0;
}
1-8
#include
9、d%d",&a,&b,&c); while(a<0||b<0||c<0) { printf("三边必须都是大于零的正整数"); scanf("%d%d%d",&a,&b,&c); } min=a;if(a>b)min=b;if(a>c)min=c; max=a;if(amax)printf("yes"); else pri
10、ntf("no");
system("pause");
return 0;
}
1-9(方法二)
#include
11、a;a=b;b=t;}
if(a>c){t=a;a=c;c=t;}
if(b>c){t=b;b=c;c=t;}
if(a+b>c)printf("yes");
else printf("no");
system("pause");
return 0;
}
1-10
#include
12、f(n%400==0)
{
printf("yes");
}
else printf("no");
}
else printf("yes");
}
else printf("no");
system("pause");
return 0;
}
3n+1解决篇1
#include
13、 scanf("%lf",&i);
for(;i>1;)
{
m=i/2;
if(floor(m+0.5)!=m){i=3*i+1;i/=2;count+=2;}//floor(x)取x的整数部分.
else {i/=2;count++;}
}
printf("%d\n",count);
system("pause");
return 0;
}
3n+1解决篇2
#include
14、 n, count = 0;//long long 的取值范围:-2^63~2^63-1
scanf("%I64d", &n);
while(n > 1) {
if(n % 2 == 1) n = n*3+1;
else n /= 2;
count++;
}
printf("%I64d\n", count);
return 0;
}
数据统计解决篇
#include
15、1)
{
if(n==0){min=max=x;}//读取第一个数的时候将第一个数赋值给min和max
s+=x;
if(x
16、n=fopen("digit.in","rb"); fout=fopen("digit.out","wb"); /*fin=stdin; fout=stdout;*/ int a,i=0; fscanf(fin,"%d",&a); while(1) { a/=10; i++; if(a<1)break; } fprintf(fout,"%d\r\n",i); fclose(fin); fclose(fout);
17、 //system("pause");
return 0;
}
2-1(freopen)
#include
18、10;
i++;
if(a<1)break;
}
printf("%d\n",i);
return 0;
}
2-2(freopen)
#include
19、r(b=0;b<=9;b++)
{
for (c=0;c<=9;c++)
{
m=a*100+b*10+c;
if(m==a*a*a+b*b*b+c*c*c)printf("%d\n",m);
}
}
}
//system("pause");
return 0;
}
2-2(fin)
#include
20、 fout=fopen("daffodil.out","wb"); int a,b,c,m; for(a=1;a<=9;a++) { for(b=0;b<=9;b++) { for(c=0;c<=9;c++) { m=a*a*a+b*b*b+c*c*c; if(m==a*100+b*10+c) fprintf(fout,"%d\r\n",m
21、);
}
}
}
fclose(fout);
return 0;
}
2-3(fin)
#include
22、 fscanf(fin,"%d%d%d",&a,&b,&c); for(x=10;x<=100;x++) { if(x%3==a&&x%5==b&&x%7==c) { fprintf(fout,"%d\r\n",x); temp=1; break; } } if(!temp)fprintf(fout,"No answer\r\n"); fclose(fin); fclose(fout); return 0; } 2-3(freopen) #in
23、clude
24、 {
printf("%d\n",x);
temp=1;
break;
}
}
if(!temp)printf("No answer\n");
return 0;
}
2-4(fin)
#include
25、gle.out","wb"); //fin=stdin; //fout=stdout; int n,i,j,k; fscanf(fin,"%d\r\n",&n); for(i=1;i<=n;i++) { for(j=1;j=1;k--)fprintf(fout,"*"); fprintf(fout,"\r\n");
26、
}
fclose(fin);
fclose(fout);
return 0;
}
2-4(freopen)
#include
27、)
{
for(j=1;j=1;k--)printf("*");
printf("\n");
}
return 0;
}
2-5(fin)
#include
28、unt=0; fscanf(fin,"%d",&n); for(i=1;i<=n+1;i++) { fscanf(fin,"%d",&a); if(i==n+1)m=a; } fclose(fin); fin=fopen("stat.in","rb"); for(i=0;i<=n;i++) { fscanf(fin,"%d",&a);
29、 if(i!=0)
{
if(a 30、h>
int main()
{
freopen("stat.in","r",stdin);
freopen("stat.out","w",stdout);
int n,a,i,m,count=0;
scanf("%d",&n);
for(i=1;i<=n+1;i++)
{
scanf("%d",&a);
if(i==n+1)m=a;
}
freopen("stat.in","r",stdin);
31、
for(i=0;i<=n;i++)
{
scanf("%d",&a);
if(i!=0)
{
if(a 32、o.h>
int main()
{
FILE *fin,*fout;
fin=fopen("harmony.in","rb");
int n,i;
double H=0;
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++)
{
H+=(double)1/i;
}
fclose(fin);
fout=fopen("harmony.out","wb");
fprintf(fout,"%.3lf\r\n",H);
33、 fclose(fout);
return 0;
}
2-6(freopen)
#include 34、ouble/i;
}
printf("%.3lf",H);
return 0;
}
2-7(fin)
#include 35、 fout=fopen("approximation.out","wb");
fprintf(fout,"%lf\r\n",H);
return 0;
}
2-7(freopen)
#include 36、i-1<1000000;i++)
{
if(i%2==1)H+=(double)1/(2*i-1);
else H-=(double)1/(2*i-1);
}
printf("%lf",H);
return 0;
}
2-8(fin,double)
#include 37、"rb");
fout=fopen("subsequence.out","wb");
int n,m,i;
double H=0;
double ii;
fscanf(fin,"%d%d",&n,&m);
for(i=n;i<=m;i++)
{
ii=(double)i*i;
H+=1/ii;
}
fprintf(fout,"%.5lf\r\n",H);
fprintf(fout,"%.2lf\r\n 38、",(double)clock()/CLOCKS_PER_SEC);//比较double和long long运行效率
fclose(fin);
fclose(fout);
return 0;
}
2-8(fin,long long)
#include 39、int n,m,i;
double H=0;
fscanf(fin,"%d%d",&n,&m);
for(i=n;i<=m;i++)
{
long long ii=1;//定义
ii=ii*i*i; //不用ii=i*i也不是ii*=i*i,这样做是为了防止i*i溢出; 可以认为这一步将int型转化为long long 型
H+=1/(double)ii;//不是(double)1/ii
}
f 40、printf(fout,"%.5lf\r\n",H);
fprintf(fout,"%.2lf\r\n",(double)clock()/CLOCKS_PER_SEC); ////比较double和long long运行效率
fclose(fin);
fclose(fout);
return 0;
}
2-8(freopen)
#include 41、);
freopen("subsequence.out","w",stdout);
#endif
int n,m,i;
double H=0,ii;
scanf("%d%d",&n,&m);
for(i=n;i<=m;i++)
{
H+=1/((double)i*i);
}
printf("%.5lf\n",H);
return 0;
}
2-9(fin)
#include 42、)
{
FILE *fin,*fout;
fin=fopen("decimal.in","rb");
fout=fopen("decimal.out","wb");
int a,b,c;
fscanf(fin,"%d%d%d",&a,&b,&c);
fprintf(fout,"%.*lf\r\n",c,(double)a/b);
fclose(fin);
fclose(fout);
return 0;
}
2-9(freopen)
#include 43、
#ifdef LOCAL
freopen("decimal.in","r",stdin);
freopen("decimal.out","w",stdout);
#endif
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
printf("%.*lf",c,(double)a/b);
return 0;
}
2-10(全书看完再看这段代码)
#include






