C++Primer练习3.13疑问？

读一组整数到vector对象，计算并输出没对相邻元素的和。如果读入元素个数为奇数，则提示用户最后一个元素没有求和，并输出值。

#include<iostream>
#include<vector>


using namespace std;
int main()
{
vector<int> svec;//svec为空
int value, sum = 0;
cout << "Enter some numbers:" << endl;
while(cin >> value)
svec.push_back(value);

//int count = svec.size() % 2 ? svec.size() - 1 : svec.size();
//for(vector<int>::size_type ix = 0; ix != count; ix += 2)
for(vector<int>::size_type ix = 0; ix != svec.size() % 2 ? svec.size() - 1 : svec.size(); ix += 2)
cout << svec[ix] + svec[ix+1] << "\t";
if(svec.size() % 2)
cout << "The last element has no partenner!" << endl;
cout << endl;
return 0;
}

以上代码错误：结果如下

但是修改for循环为

int count = svec.size() % 2 ? svec.size() - 1 : svec.size();

for(vector<int>::size_type ix = 0; ix != count; ix += 2)时，结果就正确，why……

附赠答案：

#include<iostream>
#include<vector>


using namespace std;
int main()
{
vector<int> svec;
int value;
cout << "Enter numbers(Ctr+Z to end):" << endl;
while(cin >> value)
svec.push_back(value);
if(svec.size() == 0){
cout << "No element?!" << endl;
return -1;
}
cout << "Sum of each pair of adjacent elements in the vector:" << endl;
for(vector<int>::size_type ix = 0; ix < svec.size()-1;ix += 2){
cout << svec[ix] +svec[ix+1] << "\t";
if ((ix + 1) %  6 == 0)
cout << endl;
}
if(svec.size() % 2 != 0)
cout << endl
<< "The lase element is not been summed "
<< "and its value is "
<< svec[svec.size()-1]
<< endl;
return 0;
}

如果您对本文满意，请回复，谢谢^ . ^ . ^ . ^

同时欢迎提出宝贵意见，以帮助我改进，不胜感激！！！

——桑海整理