NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #211944 | #3815. 种树 | xiaoxueshen | 10 | 0ms | 1200kb | C++ | 679b | 2024-10-13 09:00:57 | 2024-10-13 12:52:13 |
answer
#include<bits/stdc++.h>
using namespace std;
bool arr[20][20];
int n,m,k,ans;
int fun(int k)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(arr[i][j]==0)
{
arr[i][j]=1;
arr[i+1][j]=1;
arr[i-1][j]=1;
arr[i][j+1]=1;
arr[i][j-1]=1;
if(k==0)
{
ans++;
arr[i][j]=0;
arr[i+1][j]=0;
arr[i-1][j]=0;
arr[i][j+1]=0;
arr[i][j-1]=0;
return 0;
}
else fun(k-1);
arr[i][j]=0;
arr[i+1][j]=0;
arr[i-1][j]=0;
arr[i][j+1]=0;
arr[i][j-1]=0;
}
}
}
return 0;
}
int main()
{
cin>>n>>m>>k;
fun(k);
while(k>1)
{
ans/=k;
}
cout<<ans;
}
详细
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 0ms
memory: 1200kb
input:
2 2 1
output:
4
result:
ok 1 number(s): "4"
Test #2:
score: 0
Time Limit Exceeded
input:
2 3 2
output:
result:
Test #3:
score: 0
Time Limit Exceeded
input:
4 4 2
output:
result:
Test #4:
score: 0
Time Limit Exceeded
input:
4 4 5
output:
result:
Test #5:
score: 0
Time Limit Exceeded
input:
3 4 3
output:
result:
Test #6:
score: 0
Time Limit Exceeded
input:
3 5 2
output:
result:
Test #7:
score: 0
Time Limit Exceeded
input:
3 5 3
output:
result:
Test #8:
score: 0
Time Limit Exceeded
input:
3 5 4
output:
result:
Test #9:
score: 0
Time Limit Exceeded
input:
3 5 5
output:
result:
Test #10:
score: 0
Time Limit Exceeded
input:
4 3 5
