#include<iostream>
using namespace std;
int main()
{
int a;
cin >> a; int mid = 0;mid = a / 2;
int cnt = 0;
if (a%2==0)
{
cnt = mid * (1 + a);
}
else
{
cnt =mid* (a + 1) +mid+1;
}
cout << cnt;
}
#include<iostream>
using namespace std;
int main()
{
/*int a;
cin >> a; int mid = 0;mid = a / 2;
int cnt = 0;
if (a%2==0)
{
cnt = mid * (1 + a);
}
else
{
cnt =mid* (a + 1) +mid+1;
}
cout << cnt;*/
int a;
cin >> a; int mid = 0;
int cnt = 0;
for (int i = 1; i <= a; i++)
{
cnt += a;
}
cout << a;
}
对比高斯求和法和普通的算法, 明显上面的算法更高效.