10 Time Exceeded
# | 状态 分数 | 耗时 | 内存占用 |
---|---|---|---|
#1 | Time Exceeded 0 | ≥1001ms | ≥504 KiB |
#2 | Time Exceeded 0 | ≥1001ms | ≥504 KiB |
#3 | Time Exceeded 0 | ≥1001ms | ≥504 KiB |
#4 | Time Exceeded 0 | ≥1065ms | ≥504 KiB |
#5 | Time Exceeded 0 | ≥1001ms | ≥504 KiB |
#6 | Time Exceeded 0 | ≥1065ms | ≥760 KiB |
#7 | Time Exceeded 0 | ≥1001ms | ≥504 KiB |
#8 | Time Exceeded 0 | ≥1001ms | ≥504 KiB |
#9 | Time Exceeded 0 | ≥1002ms | ≥504 KiB |
#10 | Accepted 10 | 3ms | 504 KiB |
代码
#include<cstdio>
#include<iostream>
using namespace std;
int com(int c)
{ int cnt=1;
int x=1;
while(cnt<c)
{
x+=2;
}
return x;
}
int main()
{
int n,a[18][18];
cin>>n;
a[n-1][0]=1;
for(int i=n-2;i>=0;i--)
{ int i1=i+1;int j=0;
a[i][0]=a[i+1][0]+com(n-1-i);//错了
for(j=1;j<n-(i);j++)
{
a[i][j]=a[i][j-1]+1;
}
for(i1;i1<=n-1;i1++)
{
a[i1][j]=a[i1-1][j]+1;
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
printf("%4d",a[i][j]);
}cout<<'\n';
}
return 0;
}
信息
- 递交者
- 题目
- P369 练63.3 迂回方阵
- 语言
- C++98
- 代码长度
- 610 Bytes
- 递交时间
- 2025-4-5 13:50:46
- 评测时间
- 2025-4-5 13:50:54
- 分数
- 10
- 总耗时
- ≥9141ms
- 峰值时间
- ≥1065ms
- 峰值内存
- ≥760 KiB