diff --git a/1660_n+/Readme.md b/1660_n+/Readme.md new file mode 100644 index 0000000..b4f8d75 --- /dev/null +++ b/1660_n+/Readme.md @@ -0,0 +1,3 @@ +# 标题 + +* 内容 \ No newline at end of file diff --git a/1660_n+/doc/Readme.md b/1660_n+/doc/Readme.md new file mode 100644 index 0000000..afdfd2d --- /dev/null +++ b/1660_n+/doc/Readme.md @@ -0,0 +1,18 @@ +# 『入门』(递归专题)求累加和 +[问题描述] + +教学案例,必须使用递归函数完成求解! + +  编程求解下列式子的值:s=1+2+3+...+n。 + +[输入格式] +  一行,只有一个整数n。(1 <= n <= 1000) + +[输出格式] +  1个整数,即s的值。 + +[输入样例] +100 + +[输出样例] +5050 diff --git a/1660_n+/main.cpp b/1660_n+/main.cpp new file mode 100644 index 0000000..7320cbf --- /dev/null +++ b/1660_n+/main.cpp @@ -0,0 +1,15 @@ +//阶加(超小) +#include +using namespace std; +long long dg(long long n){ + if(n==1){ + return 1; + } + return n+dg(n-1); +} +int main() +{ + int n; + cin>>n; + cout<