C++計數問題 [20點贈送!]

Question

我要求出以下各個數字各有幾筆
1
1
1
2
2
2
3
3
3
4
4
4
5
5
5
6
6
6
7
7
7
8
8
8
9
10
11
12
13
14
15
16
17
17
17
18
18
18
18
19
19
19
20
20
20
21
21
21
21
22
22
22
23
23
23
23
24
24
24
24
25
25
25
25
25
26
26
27
27
27
28
28
29
29
29
30
30
30
30
31
31
31
32
32
32
33
33
34
34
35
35
35
36
36
36
36
37
37
37
37
38
38
38
38
39
39
39
39
40
40
41
41
41
42
42
43
43
44
44
44
44
45
45
45
46
46
46
47
47
47
48
48
48
48
49
49
49
50
50
51
52
52
52
53
53
53
54
54
54
55
55
55
55
56
56
56
56
56
56
57
57
57
58
58
58
59
59
59
59
60
60
60
60
61
61
61
61
62
62
62
62
63
63
64
64
64
64
65
65
65
66
66
66
67
67
67
67
67
68
68
68
68
68
68
69
69
69
70
70
70
70
70
71
71
71
71
72
72
72
73
73
73
74
74
74
74
75
75
75
76
76
77
77
77
77
78
78
78
78
79
79
79
80
80
80
81
81
81
81
82
82
82
82
83
83
83
83
84
84
84
84
84
84
85
85
85
85
85
86
86
86
86
87
87
87
88
88
88
89
89
89
89
89
89
90
90
90
90
90
91
91
91
91
91
91
92
92
92
92
93
93
93
93
94
94
94
94
95
95
95
95
96
96
96
97
97
97
98
98
99
99
99
99
99
100
100
100
101
101
101
101
102
102
102
103
103
103
104
104
105
105
105
105
105
106
106
106
107
107
107
108
108
108
109
109
109
109
110
110
110
111
111
111
112
112
112
113
113
113
113
114
114
114
114
115
115
115
115
116
116
116
117
117
117
118
118
118
118
119
119
119
119
120
120
120
121
121
121
122
122
122
123
123
123
124
124
124
124
125
125
125
126
126
126
127
127
127
127
128
128
128
129
129
129
130
130
130
131
131
131
132
132
132
133
133
133
133
134
134
134
134
135
135
135
136
136
136
136
137
137
137
138
138
138
139
139
139

======================================
我的程式碼是:
//A[] 路徑矩陣讀取
int A[139]={0};
int vaule[]; <=======顯示是錯誤的
k=1;
for(i=1;i<=node;i++) <=======顯示是錯誤的
{
if(fn[i]==fn[i+1])
count=count+1;
vaule [K]=fn[i]; <=======顯示是錯誤的
else <=======顯示是錯誤的
A[K]=count;
count=0;
}

請幫我看看哪裡有問題!

Answer 1

#include
#include
using namespace std;
main()
{
int data[] = { 1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,10,11,12,13,14,15,16,17,17,17,18,18,18,18,19,19,
19,20,20,20,21,21,21,21,22,22,22,23,23,23,23,24,24,24,24,25,25,25,25,25,26,26,27,27,27,28,28,29,29,
29,30,30,30,30,31,31,31,32,32,32,33,33,34,34,35,35,35,36,36,36,36,37,37,37,37,38,38,38,38,39,39,39,
39,40,40,41,41,41,42,42,43,43,44,44,44,44,45,45,45,46,46,46,47,47,47,48,48,48,48,49,49,49,50,50,51,
52,52,52,53,53,53,54,54,54,55,55,55,55,56,56,56,56,56,56,57,57,57,58,58,58,59,59,59,59,60,60,60,60,
61,61,61,61,62,62,62,62,63,63,64,64,64,64,65,65,65,66,66,66,67,67,67,67,67,68,68,68,68,68,68,69,69,
69,70,70,70,70,70,71,71,71,71,72,72,72,73,73,73,74,74,74,74,75,75,75,76,76,77,77,77,77,78,78,78,78,
79,79,79,80,80,80,81,81,81,81,82,82,82,82,83,83,83,83,84,84,84,84,84,84,85,85,85,85,85,86,86,86,86,
87,87,87,88,88,88,89,89,89,89,89,89,90,90,90,90,90,91,91,91,91,91,91,92,92,92,92,93,93,93,93,94,94,
94,94,95,95,95,95,96,96,96,97,97,97,98,98,99,99,99,99,99,100,100,100,101,101,101,101,102,102,102,
103,103,103,104,104,105,105,105,105,105,106,106,106,107,107,107,108,108,108,109,109,109,109,110,
110,110,111,111,111,112,112,112,113,113,113,113,114,114,114,114,115,115,115,115,116,116,116,117,117,
117,118,118,118,118,119,119,119,119,120,120,120,121,121,121,122,122,122,123,123,123,124,124,124,124,
125,125,125,126,126,126,127,127,127,127,128,128,128,129,129,129,130,130,130,131,131,131,132,132,132,
133,133,133,133,134,134,134,134,135,135,135,136,136,136,136,137,137,137,138,138,138,139,139,139, 0 };
int i;
int Value[140];

// 先把統計的陣列清空為 0
for(i = 0; i < 140; i++) Value[i] = 0;
// 開始正式統計資料
for( i = 0; data[i] > 0; i++)
{
Value[ data[i] ]++; // <== 這個地方對新手來說有點難，你自己再思考一下，為什麼這樣寫
}

// 螢幕輸出結果
for( i = 1; i < 140; i++)
{
cout<< i << "共有" << Value[i] << "筆資料" << endl;
}

system("PAUSE");
return 0;
}

Answer 2

#include
#include
void sort(int Len, int *Number){
int i,j,temp;
for(i=0;i for(j=i;j if(Number[i]>Number[j])
temp=Number[i],Number[i]=Number[j],Number[j]=temp;
}
int main(int argc, char* argv[]){
//=====START=====//
//儲存為一個文字檔，在 d 糟底下
char fn[]="d:\\data.txt";
FILE *f;
int i,counter=0;
int temp,*p,*pCtr,MAX;
f=fopen(fn,"r");
if(f!=NULL){
//計算總資料數
while(!feof(f)){
fscanf(f,"%d",&temp);
if(temp>0){
counter++;
}
}
//配置資料空間
p=(int*)malloc(counter*sizeof(int));
fseek(f,0,SEEK_SET);
//讀入資料
for(i=0;i fscanf(f,"%d",(p+i));
}
//關閉檔案
fclose(f);
//排序資料
sort(counter,p);
MAX=*(p+counter-1);
pCtr=(int*)malloc(MAX*sizeof(int));
//初始化記憶體
for(i=0;i pCtr[i]=0;
}
//記錄資料筆數
for(i=0;i pCtr[p[i]-1]++;
}
//列印
for(i=0;i printf("(%3d)= %d\n",i+1,pCtr[i]);
}
//釋放記憶體
free(pCtr),free(p);
}
//=====END=====//
system("PAUSE");
return 0;
}