69,369
社区成员
发帖
与我相关
我的任务
分享
#include <stdio.h>
#define SIZE 6
int main (void) {
int number[SIZE],i,k,value;
int score;
value=0;
k =1;
i = 0;
while (i < SIZE) {
scanf("%d", &number[i]);
i++;
}
i=0;
while(i<SIZE-1) {
if (number[i]==number[i+1]) {
value = number[i];
k++;
}
i++;
}
printf("value=%d, 相同个数为%d\n", value, k);
k=0;
i=0;
while(i<SIZE-1) {
if (number[i]==number[i+1]) {
value = number[i];
}
i++;
}
for(i=0;i<SIZE;i++) {
if(number[i]==value) {
k++;
}
}
printf("value=%d, 相同个数为%d\n", value, k);
输入6个从小到大排列的数字
#include<stdio.h>
int main()
{
int max_value,cur_value,old_value,max_count=0,cur_count,i;
const int SIZE=6;
for(i=0;i<SIZE;++i)
{
scanf("%d",&cur_value);
if(!i)
{
old_value=cur_value;
cur_count=1;
}
else if(old_value==cur_value)
++cur_count;
else
{
if(cur_count>=max_count)
{
max_value=old_value;
max_count=cur_count;
}
old_value=cur_value;
cur_count=1;
}
}
if(cur_count>=max_count)
{
max_value=old_value;
max_count=cur_count;
}
printf("value=%d,count=%d\n",max_value,max_count);
return 0;
}
#include <memory.h>
#include <stdio.h>
#define SIZE 6
struct MyNode
{
int value;//值
int count;//出现次数
int valid; //是否有效,1有效,0无效
};
int main (void) {
MyNode nodes[SIZE];
memset(nodes,0,sizeof(nodes));
int i=0,j=0,temp=0;
for(i=0;i<SIZE;++i)
{
scanf("%d",&temp);
for(j=0;j<SIZE;++j)
{
if(nodes[j].value==temp&&nodes[j].valid==1)
{
nodes[j].count++;
}
else if (nodes[j].valid==0)
{
nodes[j].value=temp;
nodes[j].valid=1;
nodes[j].count=1;
break;
}
}
}
MyNode nd=nodes[0];
for(i=0;i<SIZE;++i)
{
if(nodes[i].valid==1)
{
if(nd.count<nodes[i].count)
{
nd=nodes[i];
}
else if(nd.count==nodes[i].count&&nd.value<nodes[i].value)
{
nd=nodes[i];
}
}
}
printf("value=%d,相同个数为%d\n",nd.value,nd.count);
}
#include <stdio.h>
#define SIZE 6
int main () {
int number[SIZE],i,last,j,t,k;
int times[SIZE],n[SIZE];
for (i=0;i<SIZE;i++) {
n[i]=i;
scanf("%d", &number[i]);
if (i==0) {
last=number[i];
times[i]=1;
k=0;
} else {
if (last==number[i]) {
t=times[i-1];
for (j=i;j>=k;j--) times[j]=t+1;
} else {
last=number[i];
times[i]=1;
k=i;
}
}
}
for (i=0;i<SIZE-1;i++) {
for (j=i+1;j<SIZE;j++) {
if (times[i]<times[j]) {
t=times[i];times[i]=times[j];times[j]=t;
t=n[i];n[i]=n[j];n[j]=t;
}
}
}
if (times[0]>times[1]) {
printf("value=%d, 相同个数为%d\n",number[n[0]],times[0]);
} else {
t=times[0];
for (i=1;i<SIZE;i++) {
if (t!=times[i]) break;
}
t=number[n[0]];
k=0;
for (j=0;j<i;j++) {
if (number[n[j]]>t) {
t=number[n[j]];
k=j;
}
}
printf("value=%d, 相同个数为%d\n",t,times[n[k]]);
}
return 0;
}