计算临界元素的和并输出
#include <iostream> #include <vector> using namespace std; int main() { vector<int> ivec; int i = 0; while(cin >> i) ivec.push_back(i); size_t len = ivec.size(), j = 0; for (; j != len-1; ++j) { cout << ivec[j]+ivec[j+1] << " "; } if ((j+1)%2) { cout << "The last num is not calculated his value"<<endl; } }

计算头尾元素两辆配对

#include <iostream>
#include <vector>
using namespace std;

int main()
{
	vector<int> ivec;
	int i = 0;
	while(cin >> i)
		ivec.push_back(i);
	size_t len = ivec.size(), j = 0;
	for (; j != len/2; ++j)
	{
	   cout << ivec[j]+ivec[len-j-1] << " ";
	}
	if ((j+1)%2)
	{
		cout << "no match" << endl;
	}
}

相关文章:

  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-01-29
  • 2021-08-07
猜你喜欢
  • 2021-10-07
  • 2021-06-28
  • 2021-10-01
  • 2022-02-20
  • 2021-06-15
  • 2021-06-18
  • 2022-12-23
相关资源
相似解决方案