1 条题解

  • 0
    @ 2023-10-22 14:12:44
    #include <bits/stdc++.h>
    using namespace std;
    int main()
    {
        char map[102][102];
        memset(map,'N',sizeof(map));
        int n,m;
        cin>>n>>m;
        for (int i = 1;i <= n;i++)
        {
            for (int a = 1;a <= m;a++)
            {
                cin>>map[i][a];
            }
        }
        for (int i = 1;i <= n;i++)
        {
            for (int a = 1;a <= m;a++)
            {
                if (map[i][a] == '*')
                {
                    cout<<"*";
                }
                else
                {
                    int sum = 0;
                    if (map[i-1][a-1] == '*')
                    {
                    	sum += 1;
    				}
    				if (map[i-1][a] == '*')
    				{
    					sum += 1;
    				}
    				if (map[i-1][a+1] == '*')
    				{
    					sum += 1;
    				}
    				if (map[i][a-1] == '*')
                    {
                    	sum += 1;
    				}
    				if (map[i][a] == '*')
    				{
    					sum += 1;
    				}
    				if (map[i][a+1] == '*')
    				{
    					sum += 1;
    				}
    				if (map[i+1][a-1] == '*')
                    {
                    	sum += 1;
    				}
    				if (map[i+1][a] == '*')
    				{
    					sum += 1;
    				}
    				if (map[i+1][a+1] == '*')
    				{
    					sum += 1;
    				}
                    cout<<sum;
                }
            }
            cout<<endl;
        }
        return 0;
    }
    
    • 1

    信息

    ID
    164
    时间
    1000ms
    内存
    256MiB
    难度
    8
    标签
    递交数
    12
    已通过
    10
    上传者