while 循环法:
#include<iostream>
using namespace std ;
int main()
{
int n;
long long ans=0;
cin>>n;
while(n)
{
ans+=n;
n--;
}
cout<<ans<<endl;
return 0;
}
do while循环:
#include<iostream>
using namespace std ;
int main()
{
int n;
long long ans=0;
cin>>n;
do
{
ans+=n;
n--;
}while(n);
cout<<ans<<endl;
return 0;
}
for循环:
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++)
{
ans += i;
}
cout << ans << endl;
return 0;
}
等差数列公式法(最优):
#include<iostream>
using namespace std ;
int main()
{
int n;
cin>>n;
cout<<(1+n)*n/2<<endl;
return 0;
}