题目1:
#include <stdio.h>
#include<iostream>
#include<math.h>
using namespace std;
void num1()
{
int i=0;
int x;
while(scanf("d",&x)!=EOF)
{
i++;
}
cout<<i<<endl;
}
void num2()
{
int max,min,avg,sum=0;
int flag=1;
int n;
int x;
while(1==scanf("%d",&n))
{
if(flag==1)
{
max=min=n;
flag=0;
}
if(max<n)
{
max=n;
}
if(min>n)
{
min=n;
}
sum+=n;
x++;
}
avg=sum/x;
printf("min is %d,max is %d,average is %d",min,max,avg) ;
}
void num3()
{
int nums[100],i=0;
while(1==scanf("%d",&nums[i]))
{
i++;
}
int x,y;
int temp;
int a=nums[0],b=nums[1];
int distance=a-b;
for(x=0;x<i;x++)
{
for(y=x+1;y<i;y++)
{
if(abs(nums[x]-nums[y])<distance)
{
distance=abs(nums[x]-nums[y]);
a=nums[x];
b=nums[y];
}
}
}
printf("%d and %d",a,b);
}
void num4()
{
int max,secondmax,n;
scanf("%d%d",&max,&secondmax);
int t1=max>secondmax ? max:secondmax;
int t2=max<secondmax ? max:secondmax;
max=t1;
secondmax=t2;
while(1==scanf("%d",&n))
{
if(n>max)
{
secondmax=max;
max=n;
continue;
}
if(n>secondmax &&n!=max)
{
secondmax=n;
}
}
printf("max=%d,secondmax=%d",max,secondmax);
}
void num41()
{
int i=0;
int nums[100];
while(1==scanf("%d",&nums[i]))
{
++i;
}
int x,y;
for(x=0;x<i;x++)
{
for(y=x+1;y<i;y++)
{
if(nums[x]>nums[x+1])
{
int temp=nums[x+1];
nums[x+1]=nums[x];
nums[x]=temp;
}
}
}
printf("%d",nums[i-2]);
}
void num5()
{
int nums[100];
int ct=0,n,i;
double ave=0.0,sum=0.0,psum=0.0;
while(1==scanf("%d",&n))
{
nums[ct++]=n;
sum+=n;
}
ave=sum/ct;
for(i=0;i<ct;i++)
{
psum+=pow((nums[i]-ave),2);
}
psum/=ct;
printf("variance:%.3f\n",psum);
}
void num6()
{
int nums[100];
int ct=0,n,i;
int sct=0;
double ave=0.0,sum=0.0;
while(1==scanf("%d",&n))
{
nums[ct++]==n;
sum+=n;
}
ave=sum/ct;
for(i=0;i<ct;i++)
{
if(nums[i]<ave)
{
sct++;
}
}
printf("%d numbers smaller than average %f\n",sct,ave);
}
int main()
{
num6();
}
题目2:
#include <stdio.h>
#include<string.h>
#define maxn 1000000+10
int main()
{
char s[maxn];
scanf("%s",s);
int tot=0;
int n=strlen(s);
for (int i=0;i<n;i++)
{
if (s[i]== '1')
tot++;
}
printf("%d\n",tot);
}
回答:
- 引用string.h
- s是’char’型, 而原来的1是’int’型
- strlen(i)多进行了一次遍历.