1 #include <iostream>
  2 #include <cassert>
  3 using namespace std;
  4
  5 const size_t SIZE = 1000;
  6
  7 void CheckValidInput(const char *pStrState)
  8 {
  9     assert(pStrState != NULL);
 10     char *pCur = (char *)pStrState;
 11
 12     while (*pCur)
 13     {
 14         assert(*pCur >= '0' && *pCur <= '2');
 15         ++pCur;
 16     }
 17 }
 18
 19 void CountLamp(const char *pStrState,char &state,size_t &count)
 20 {
 21     CheckValidInput(pStrState);
 22
 23     count = 0;
 24     state = '\0';
 25
 26     char *pCur = (char *)pStrState;
 27     char curChar = '\0';
 28     size_t curTimes = 0;
 29
 30     while (*pCur)   //对非法状态的处理？？？
 31     {
 32         curTimes = 0;
 33         curChar = *pCur;
 34
 35         while (*pCur && *pCur == curChar)
 36         {
 37             ++curTimes;
 38             ++pCur;
 39         }
 40
 41         if (curTimes > count)
 42         {
 43             state = curChar;
 44             count = curTimes;
 45         }
 46     }
 47 }
 48
 49 const size_t BitWidth = 16;
 50 const int Max = 65535;
 51 const int MaxPositiveNum = 32767;  //2^15 - 1,是2与15异或的结果减1
 52 const int MinNegativeNum = -32768;
 53
 54 //需要溢出处理，直接定义为short类型不能按照
 55 //当结果大于32767（0x7fff）时，输出32767；当计算结果小于-32768（0x8000）时，输出-32768
 56 //的方式处理
 57 short HandleOverFlow(int num)  //返回值类型
 58 {
 59     if (num < MinNegativeNum)
 60     {
 61         return MinNegativeNum;
 62     }
 63     else if (num > MaxPositiveNum)
 64     {
 65         return MaxPositiveNum;
 66     }
 67
 68     return num;
 69 }
 70
 71 int ComplexAdd(const int compNum1,const int compNum2)
 72 {
 73     short ar = compNum1 >> BitWidth;
 74     short ai = compNum1 & Max;
 75     short br = compNum2 >> BitWidth;
 76     short bi = compNum2 & Max;
 77
 78     cout<<"("<<ar<<" + j*"<<ai<<") + ("<<br<<" + j*"<<bi<<") = ";
 79
 80     int sumr = ar + br;   //需定义为int类型，保证溢出处理时按要求的
 81     int sumi = ai + bi;
 82
 83     sumr = HandleOverFlow(sumr);  //HandleOverFlow返回即为short类型的
 84     sumi = HandleOverFlow(sumi);
 85
 86     cout<<sumr<<" + j* "<<sumi<<endl;
 87     return ((sumr << BitWidth) | (sumi & Max) );
 88 }
 89
 90 int ComplexMult(const int compNum1,const int compNum2)
 91 {
 92     short ar = compNum1 >> BitWidth;   //定义为short类型即可
 93     short ai = compNum1 & Max;
 94     short br = compNum2 >> BitWidth;
 95     short bi = compNum2 & Max;
 96
 97     cout<<"("<<ar<<" + j*"<<ai<<") * ("<<br<<" + j*"<<bi<<") = ";
 98
 99     int multr = ar * br - ai * bi;  //要定义为int类型，而非short类型，否则在溢出时，不能按照要求的溢出处理输出
100     int multi = ar * bi + ai * br;
101
102     multr = HandleOverFlow(multr);
103     multi = HandleOverFlow(multi);
104
105     cout<<multr<<" + j* "<<multi<<endl;
106
107     return ((multr << BitWidth) | (multi & Max) );
108 }
109
110 int  ComplexDivideN(const int  compNum1,const int N)
111 {
112     short ar = compNum1 >> BitWidth;
113     short ai = compNum1 & Max;
114
115     cout<<"("<<ar<<" + j*"<<ai<<") / "<<N<<" = ";
116
117     int divider =  (short)ar / N;   //divider、dividei定义为int、short都可
118     int dividei =  (short)ai / N;
119
120     cout<<"("<<divider<<" + j* "<<dividei<<")"<<endl;
121
122     return ( (divider << BitWidth) | (dividei & Max) );
123 }
124
125 int ComplexMultAddDivide(const int *compArray,const int n)
126 {
127     assert(compArray != NULL);
128     assert(n > 0 && n <= 1000 && (n % 2 == 0));
129
130     int index;
131     long long sum = 0;
132
133     for (index = 0;index < n;index += 2)
134     {
135         sum = ComplexAdd( sum,ComplexMult(compArray[index],compArray[index + 1]) );
136     }
137
138     return ComplexDivideN(sum,n);
139 }
140
141 void TestDriver()
142 {
143     //char *pStrState = "112200111";
144     //char *pStrState = "112200";
145     //char *pStrState = "12200";
146     //char *pStrState = "1200";
147     /*char *pStrState = "";
148     char state = '\0';
149     size_t count = 0;
150     CountLamp(pStrState,state,count);
151
152     cout<<"the state appears most is : "<<state<<endl;
153     cout<<"the times is : "<<count<<endl;*/
154
155
156     //int compArray[SIZE] = {1,0xff00ff};
157     int compArray[SIZE] = { 262149,393223,524297,655371 };
158     //int compArray[SIZE] = { -196613,393223,-458761,655371 };
159     //int compArray[SIZE] = { 32767,32767,-32767,32767 };  //溢出测试
160     //int compArray[SIZE] = {524297,655371};
161     int n = 4;
162     int average = 0;
163     average = ComplexMultAddDivide(compArray,n);
164
165     cout<<"the average is : "<<average<<endl;
166 }
167
168 int main()
169 {
170     TestDriver();
171     return 0;
172 }

(4 + j*5) * (6 + j*7) = -11 + j* 58
(0 + j*0) + (-11 + j*58) = -11 + j* 58
(8 + j*9) * (10 + j*11) = -19 + j* 178
(-11 + j*58) + (-19 + j*178) = -30 + j* 236
(-30 + j*236) / 4 = (-7 + j* 59)
the average is : -458693
请按任意键继续. . .