2015 1
#include<stdio.h>
#include<stdlib.h>
int main(void)
{
int n,i,j,k,temp,flag=1;
float total=0;
printf("Input n(0<n<1000)\n");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
if(i>0)
{
if(i<10)
{
for(j=i%10,k=0,temp=i;k<1;k++,j=i%10,i=i/10)
{
if(j==6&&flag==1)
{
total+=1.0/temp;
flag=0;
}
}
flag=1;
i=temp;
}
else if(i<100)
{
for(j=i%10,k=0,temp=i;k<2;k++,i=i/10,j=i%10)
{
if(j==6&&flag==1)
{
total+=1.0/temp;
flag=0;
}
}
flag=1;
i=temp;
}
else if(i<1000)
{
for(j=i%10,k=0,temp=i;k<3;k++,i=i/10,j=i%10)
{
if(j==6&&flag==1)
{
total+=1.0/temp;
flag=0;
}
}
flag=1;
i=temp;
}
}
}
printf("%.2f\n",total);
return 0;
}
2015 2
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void Insert(char s[])
{
int i,n=strlen(s);
s[2*n]='\0';
for(i=n;i>0;i=i-1)
{
s[i+i-1]=' ';
s[i+i-2]=s[i-1];
}
}
int main(void)
{
char s[80];
printf("Input a string:\n");
gets(s);
Insert(s);
printf("%s\n",s);
return 0;
}
2015 3
#include<stdio.h>
#define M 5
void ReadScore(float score[][M],int n,int m)
{
int i,j;
printf("Input %d judges' scores for %d athletes\n",m,n);
for(i=0;i<n;i++)
for(j=0;j<m;j++)
{
scanf("%f",&score[i][j]);
}
}
void FindMaxMin(int *Max,int *Min,float score[][M],int n,int m)
{//FindMaxMin找到score数组里第n行的最大元素和最小元素的下标
int i;
*Max=0;
*Min=0;
for(i=1;i<m;i++)
{
if(score[n][*Max]<score[n][i])
{
*Max=i;
}
if(score[n][*Min]>score[n][i])
{
*Min=i;
}
}
}
void CountScore(float averagescore[],float score[][M],int n,int m)
{
int i,j,max=0,min=0;
float total=0;
for(i=0;i<n;i++)
{
FindMaxMin(&max,&min,score,i,m);
for(j=0;j<m;j++)
{
if((j!=max)&&(j!=min))
{
total=total+score[i][j];
}
}
averagescore[i]=total/(m-2);
total=0;
}
}
void PrintScore(float averagescore[],int n)
{
int i;
printf("The final scores for each althltets\n");
for(i=0;i<n;i++)
{
printf("%0.2f\n",averagescore[i]);
}
}
int main(void)
{
int n,m;
float score[20][5],averagescore[5];
printf("Input the number of athletes\n");
scanf("%d",&n);
printf("Input the number of judges\n");
scanf("%d",&m);
ReadScore(score,n,m);
CountScore(averagescore,score,n,m);
PrintScore(averagescore, n);
return 0;
}
2014 1
#include<stdio.h>
void YHTriangle(int a[][15],int n)
{
int i,j;
for(i=0;i<n;i++)
{
a[i][0]=1;
a[i][i]=1;
}
for(i=2;i<n;i++)
{
for(j=1;j<i;j++)
{
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
}
}
void PrintYHTriangle(int a[][15],int n)
{
int i,j;
for(i=0;i<n;i++)
{
for(j=0;j<=i;j++)
{
printf("%5d",a[i][j]);
}
printf("\n");
}
}
int main(void)
{
int a[15][15],n;
printf("Input n(n<=15):\n");
scanf("%d",&n);
YHTriangle(a,n);
PrintYHTriangle(a,n);
return 0;
}
2014 2
#include<stdio.h>
#include<math.h>
#define CONST 1.42e8
int main(void)
{
int n;
double sum=0,term;
for(n=1;n<=64;n++)
{
term=pow(2,n-1);
sum=sum+term;
}
printf("sum = %e\nvolum=%e\n",sum,sum/CONST);
return 0;
}
2014 3
#include<stdio.h>
#include<string.h>
int CountWords(char str[]);
int main(void)
{
int str[81],number;
printf("Input a string:\n");
gets(str);//scanf("%s",str);
number=CountWords(str);
printf("Numbers of words = %d\n",number);
return 0;
}
int CountWords(char str[])
{
int i,wordsnum=1;
for(i=0;str[i]!='\0';i++)
if(str[i]==' ')
wordsnum++;
return wordsnum;
}
2014 改错题
#include <string.h>
struct person
{
char name[20];
int count;
}leader[3] = {
{"Li",0},
{"Zhang",0},
{"Fun",0}};
int main()
{
int i, j,n;
char leader_name[20];
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%s", leader_name);
for (j = 0; j < 3; j++)
if (strcmp(leader_name,leader[j].name)==0)
leader[j].count++;
}
printf("\n");
for (i = 0; i < 3; i++)
printf("%5s:%d\n", leader[i].name, leader[i].count);
return 0;
}
2014 改错题2
#include <stdio.h>
#include <stdlib.h>
#define SIZE 51
int BigFact(int m, int data[]);
int main()
{
int data[SIZE]; /* 存储50位数，为了方便记忆，不使用data[0] */
int index; /* 表示阶乘值的位数 */
int n;
int i, j;
printf("Input n:\n");
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
index = BigFact(i, data);
if (index != 0)
{
printf("%d! = ", i);
for (j = index; j > 0; j--)
{
printf("%d", data[j]);
}
printf("\n");
}
else
{
printf("Over flow!\n");
exit(1);
}
}
return 0;
}
/*函数功能：计算m!，存于数组data中，若数组未溢出，则返回阶乘值的位数，否则返回0*/
int BigFact(int m, int data[])
{
int i;
int j, k;
int index = 1;
for (i = 0; i < SIZE; i++)
{
data[i] = 0;
}
data[1] = 1;
for (i = 1; i <= m; i++)
{
for (j = 1; j <= index; j++)
{
data[j] = data[j] * i;
}
for (k = 1; k < index; k++)
{
if (data[k] >= 10)
{
data[k + 1] = data[k + 1] + data[k] / 10;
data[k] = data[k] % 10;//data[k] = data[k] / 10;
}
}
while (data[index] >= 10 && index <= SIZE - 1)
{
data[index + 1] = data[index] / 10;
data[index] = data[index] % 10;//data[index] = data[index] / 10
index++;//新增项
}
}
if (index <= SIZE)
{
return index;
}
else
{
return 0;
}
}
2013 1
#include<stdio.h>
int main(void)
{
int i,total=1;
for(i=0;i<10;i++)
{
total=(total+1)*2;
}
printf("%d\n",total);
return 0;
}
2013 2
#include<stdio.h>
void DataSort(int a[],int n);
int Median(int answer[],int n);
void GetData(int arr[],int n);
int main(void)
{
int feedbacks[20],n=0;
printf("Input total number of feedbacks\n");
scanf("%d",&n);
printf("Input feedbacks\n");
GetData(feedbacks,n);
printf("Median value=%d\n",Median(feedbacks,n));
return 0;
}
void GetData(int arr[],int n)
{
int i;
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
}
int Median(int answer[],int n)
{
DataSort(answer,n);
if(n%2==1)
{
return answer[n/2];
}
else
{
return (answer[n/2]+answer[n/2-1])/2;
}
}
void DataSort(int a[],int n)
{
int i,j,temp;
for(i=n-1;i>0;i--)
for(j=0;j<i;j++)
{
if(a[j]>a[i])
{
temp=a[i];
a[i]=a[j];
