首先九度1018
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n;
int hash[101];
while(scanf("%d",&n) != EOF && n)
{
//首先给hash 赋值为0
int hash[101] = {0};
int score ; //用来记录每个学生的分数
for (int i = 0 ; i < n ; i++)
{
scanf("%d", &score);
hash[score]++;
}
int ans ;
scanf("%d", &ans); //输入要查询的分数
printf("%d\n", hash[ans]);
}
return 0;
}
九度1031
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n ;
while(scanf("%d", &n)!= EOF &&n)
{
int cnt = 0;
while(n!= 1)
{
if(n%2==0)
{
n/=2;
cnt++;
}
else
{
n = 3*n +1;
n/=2;
cnt++;
}
}
printf("%d\n", cnt);
}
return 0;
}
其次 九度1046
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int max= -1, i = 0;
int number;
while(scanf("%d", &number)!= EOF)
{//这个输入时错误的
if(number > max)
{
max = number ;
}
i++;
if(i%10 == 0)
{
printf("max=%d\n", max);
max = -1; //又重新开始下一轮循环, 因此要重新设-1
}
}
return 0;
}
最后九度1202
#include<iostream>
#include<algorithm>
using namespace std;
bool cmp(int x, int y)
{
return x < y;
}
int main()
{
int n;
int buf[204];
while(cin>>n)
{
for(int i = 0 ; i < n ; i++ )
{
cin>>buf[i];
}
sort(buf, buf + n,cmp);
for(int i = 0 ; i < n ; i++)
{
cout<<buf[i]<<" ";
}
cout<<endl;
}
return 0;
}