8 条题解
-
1
202502cj14周子祥 (周子祥) LV 8 @ 2025-03-30 17:53:21
#include<bits/stdc++.h>
#define N 110
using namespace std;
char c[N][N], d[N][N];
int main(){
ios::sync_with_stdio(false);
int cnt = 0, n, m;
cin >> n;
for(int i = n+1; i >= 0; i--){
for(int j = n+1; j >= 0; j--)d[i][j] = '#';
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++)cin >> c[i][j];
}
cin >> m;
for(int ii = 1; ii < m; ii++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(c[i][j] == '@'){
if(c[i][j-1] == '.')d[i][j-1] = 'q';
if(c[i][j+1] == '.')d[i][j+1] = 'q';
if(c[i-1][j] == '.')d[i-1][j] = 'q';
if(c[i+1][j] == '.')d[i+1][j] = 'q';
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(d[i][j] == 'q')c[i][j] = '@';
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(c[i][j] == '@')cnt++;
}
}
cout << cnt;
return 0;
} -
1
#include<bits/stdc++.h>
#define N 110
using namespace std;
char c[N][N], d[N][N];
int main(){
ios::sync_with_stdio(false);
int cnt = 0, n, m;
cin >> n;
for(int i = n+1; i >= 0; i--){
for(int j = n+1; j >= 0; j--)d[i][j] = '#';
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++)cin >> c[i][j];
}
cin >> m;
for(int ii = 1; ii < m; ii++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(c[i][j] == '@'){
if(c[i][j-1] == '.')d[i][j-1] = 'q';
if(c[i][j+1] == '.')d[i][j+1] = 'q';
if(c[i-1][j] == '.')d[i-1][j] = 'q';
if(c[i+1][j] == '.')d[i+1][j] = 'q';
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(d[i][j] == 'q')c[i][j] = '@';
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(c[i][j] == '@')cnt++;
}
}
cout << cnt;
return 0;
} -
1
#include<bits/stdc++.h>
#define N 110
using namespace std;
char c[N][N], d[N][N];
int main(){
ios::sync_with_stdio(false);
int cnt = 0, n, m;
cin >> n;
for(int i = n+1; i >= 0; i--){
for(int j = n+1; j >= 0; j--)d[i][j] = '#';
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++)cin >> c[i][j];
}
cin >> m;
for(int ii = 1; ii < m; ii++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(c[i][j] == '@'){
if(c[i][j-1] == '.')d[i][j-1] = 'q';
if(c[i][j+1] == '.')d[i][j+1] = 'q';
if(c[i-1][j] == '.')d[i-1][j] = 'q';
if(c[i+1][j] == '.')d[i+1][j] = 'q';
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(d[i][j] == 'q')c[i][j] = '@';
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(c[i][j] == '@')cnt++;
}
}
cout << cnt;
return 0;
} -
1
6666666666666666
666
66
6
66
66
6
66
6
6
66
6
6
66
6
66
6 -
1
你以为我们会被你骗到吗？
-
-2
#include<bits/stdc++.h>
#define N 110
using namespace std;
char c[N][N], d[N][N];
int main(){
ios::sync_with_stdio(false);
int cnt = 0, n, m;
cin >> n;
for(int i = n+1; i >= 0; i--){
for(int j = n+1; j >= 0; j--)d[i][j] = '#';
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++)cin >> c[i][j];
}
cin >> m;
for(int ii = 1; ii < m; ii++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(c[i][j] == '@'){
if(c[i][j-1] == '.')d[i][j-1] = 'q';
if(c[i][j+1] == '.')d[i][j+1] = 'q';
if(c[i-1][j] == '.')d[i-1][j] = 'q';
if(c[i+1][j] == '.')d[i+1][j] = 'q';
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(d[i][j] == 'q')c[i][j] = '@';
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(c[i][j] == '@')cnt++;
}
}
cout << cnt;
return 0;
} -
-2
202502zj29袁昊轩 (袁昊轩) LV 8 @ 2025-03-15 12:56:06
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int N,f,z=0,i=1;
cin>>N;
for(;i<=N;i++)
{
cin>>f;
if(f<60)
z++;
}
cout<<z;
return 0;
}//专坑双胞胎
202502cj14周子祥 (周子祥)
LV 8
@ 2025-03-30 17:53:21
- 1
信息
- ID
- 1108
- 难度
- 1
- 分类
- (无)
- 标签
- 递交数
- 38
- 已通过
- 26
- 通过率
- 68%
- 上传者
-
金老师 (zfkin)
