k上升段(有误)
This commit is contained in:
parent
c59e060917
commit
2d2b47caec
|
@ -0,0 +1,3 @@
|
|||
# 标题
|
||||
|
||||
* 内容
|
|
@ -0,0 +1,3 @@
|
|||
# 标题
|
||||
|
||||
* 内容
|
Binary file not shown.
After Width: | Height: | Size: 117 KiB |
|
@ -0,0 +1,6 @@
|
|||
#include <iostream>
|
||||
|
||||
int main()
|
||||
{
|
||||
std::cout << "Hello Easy C++ project!" << std::endl;
|
||||
}
|
Binary file not shown.
|
@ -0,0 +1,7 @@
|
|||
## z:\Chao\src\Template\test\in.txt
|
||||
2020/03/14 ÖÜÁù 11:41:28.68
|
||||
Hello Easy C++ project!
|
||||
|
||||
-----------------------------------------------
|
||||
Process exited after 200 ms with return value 0
|
||||
|
|
@ -0,0 +1,3 @@
|
|||
# 标题
|
||||
|
||||
* 内容
|
|
@ -0,0 +1,3 @@
|
|||
# 标题
|
||||
|
||||
* 内容
|
Binary file not shown.
After Width: | Height: | Size: 112 KiB |
|
@ -0,0 +1,13 @@
|
|||
#include<iostream>
|
||||
using namespace std;
|
||||
int main(){
|
||||
int n,k,f[21][21]={1};
|
||||
cin>>n>>k;
|
||||
for(int i=1;i<=n;i++){
|
||||
for(int j=1;j<=i;j++){
|
||||
f[i][j]=f[i-1][j]+f[i-1][j-1]*j;
|
||||
if(j==k) break;
|
||||
}
|
||||
}
|
||||
cout<<f[n][k];
|
||||
}
|
Binary file not shown.
|
@ -0,0 +1,6 @@
|
|||
#include <iostream>
|
||||
|
||||
int main()
|
||||
{
|
||||
std::cout << "Hello Easy C++ project!" << std::endl;
|
||||
}
|
Binary file not shown.
|
@ -0,0 +1 @@
|
|||
6 4
|
|
@ -0,0 +1 @@
|
|||
3 2
|
|
@ -0,0 +1,12 @@
|
|||
## z:\Chao\src\1805_kclimb\test\in.txt
|
||||
2020/03/21 ÖÜÁù 18:00:22.81
|
||||
4
|
||||
-----------------------------------------------
|
||||
Process exited after 160 ms with return value 0
|
||||
|
||||
## z:\Chao\src\1805_kclimb\test\In0 (4).txt
|
||||
2020/03/21 ÖÜÁù 18:00:22.81
|
||||
240
|
||||
-----------------------------------------------
|
||||
Process exited after 100 ms with return value 0
|
||||
|
Loading…
Reference in New Issue