?
# | Author | Problem | Lang | Verdict | Time | Memory | Sent | Judged | |
---|---|---|---|---|---|---|---|---|---|
188566640 |
Practice: DaiRuiChen007 |
1485D - 16 | C++14 (GCC 6-32) | Accepted | 93 ms | 1972 KB | 2023-01-09 12:38:16 | 2023-01-09 12:38:16 |
// LUOGU_RID: 99151378 #include<bits/stdc++.h> using namespace std; const int MAXN=501,B=720720; int a[MAXN][MAXN],b[MAXN][MAXN]; inline int sqr(int x) { return x*x*x*x; } signed main() { int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;++i) { for(int j=1;j<=m;++j) { scanf("%d",&a[i][j]); b[i][j]=B+(((i+j)%2==0)?sqr(a[i][j]):0); } } for(int i=1;i<=n;++i) { for(int j=1;j<=m;++j) { printf("%d ",b[i][j]); } puts(""); } return 0; }
?
?
?
?