【深基4.例11】数列求和/杂七杂八的东西...

【深基4.例11】数列求和

杂七杂八:
打表:暴力打出所有答案,复制答案,开数组存入,删掉暴力代码(面向结果编程)
return !(cout<<)先执行cout,打出了多少东西返回多少,然后!取反,return 0;
觉着挺有趣的

题目描述

计算 $1+2+3+\cdots +(n-1)+n$ 的值，其中正整数 $n$ 不大于 100。由于你没有高斯聪明，所以你不被允许使用等差数列求和公式直接求出答案。

提示

数据保证，$1\le n\le 100$。

#include<bits/stdc++.h>
using namespace std;
//法1将for1-n程序运行结果打印下来,然后打表 
//int sum[]={0,1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,231,253,276,300,325,351,378,406,435,465,496,528,561,595,630,666,703,741,780,820,861,903,946,990,1035,1081,1128,1176,1225,1275,1326,1378,1431,1485,1540,1596,1653,1711,1770,1830,1891,1953,2016,2080,2145,2211,2278,2346,2415,2485,2556,2628,2701,2775,2850,2926,3003,3081,3160,3240,3321,3403,3486,3570,3655,3741,3828,3916,4005,4095,4186,4278,4371,4465,4560,4656,4753,4851,4950,5050};
//法2
int arr[101];
int main(){
	ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
	int n;cin>>n;
	//法1:打表 
//	cout<<sum[n];
	//法2:accumulate
	for(int i=1;i<=n;i++)arr[i]=i;
	return !(cout<<accumulate(arr+1,arr+n+1,0));
}