#include <iostream>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int a[5][5],k,n,sum=0;
    for (int i = 0; i < 5; i++)
    {
        for (int j = 0; j < 5; j++)
        {
            cin>>a[i][j];
        }
        
    }
    cin>>k>>n;
    for (int i = 0; i < n; i++)
    {
        int x,y;
        cin>>x>>y;
        if (x < 0 || x >= 5 || y < 0 || y >= 5) 
        {
            continue;
        }
        else
        {
            a[x][y]-=k;
            if(x>0)a[x-1][y]-=k;
            if(x<4)a[x+1][y]-=k;
            if(y>0)a[x][y-1]-=k;
            if(y<4)a[x][y+1]-=k;
        }
    }
    for (int i = 0; i < 5; i++)
    {
        for (int j = 0; j < 5; j++)
        {
            if(a[i][j]<0)
            {
                a[i][j]=0;
            }
            sum+=a[i][j];
            cout<<a[i][j] << (j < 4 ? " " : "");
        }
        cout<<'\n';
        
    }
    cout<<sum<<'\n';   
    
return 0;  
}

陳又寧

巫伊璐

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int a[5][5];
    for(int i=0;i<5;i++){
        for(int j=0;j<5;j++){
            cin>>a[i][j];
        }
    }
    int k,n;
    cin>>k>>n; 
    for(int i=0;i<n;i++){
        int c,d;
        cin>>c>>d;
        a[c][d]=max(0,a[c][d]-k);
        if (c+1<5) a[c+1][d]=max(0,a[c+1][d]-k);
        if (c-1>=0) a[c-1][d]=max(0,a[c-1][d]-k);
        if (d+1<5) a[c][d+1]=max(0,a[c][d+1]-k);
        if (d-1>=0) a[c][d-1]=max(0,a[c][d-1]-k);
    }
    int s=0;
    for (int i=0;i<5;i++){
        for (int j=0;j<5;j++){
            cout<<a[i][j]<<" ";
            s+=a[i][j];
        }
        cout<<endl;
    }
    cout<<s<<endl;
    return 0;
}

林卉家

#include <iostream>
using namespace std;


int main()
{
    int list1[5][5]={0};
    for (int i=0;i<5;i++)
        for(int j=0;j<5;j++)
            cin>>list1[i][j];
            
            
    int k,n;
    cin>>k>>n;
    
    
    while(n>0){
     
        int x,y;
        
        cin>>x>>y;
        
        list1[x][y]-=k;
        if (x!=0)list1[x-1][y]-=k;//上
        if (x!=4)list1[x+1][y]-=k;//下
        if (y!=0)list1[x][y-1]-=k;//左
        if (y!=4)list1[x][y+1]-=k;//右
        
    
        n-=1;
    }
    
    
    
    int sum=0;
    
    for (int i=0;i<5;i++){
        for(int j=0;j<5;j++){
            if (list1[i][j]>=0)
                cout<<list1[i][j]<<" ";
            
            else {//可能減成負的
                list1[i][j]=0;
                cout<<list1[i][j]<<" ";
                
            }    
            sum+=list1[i][j];    
            
        }
        cout<<endl;
    }
    
    cout<<sum;
    
    
    return 0;
    
    
}

#include <iostream>
using namespace std;
int main(){
    int arr[5][5];
    for(int i=0; i<5; i++){
        for(int j=0; j<5; j++){
            cin >> arr[i][j];
        }
    }

    int k,n;
    cin >> k >> n;
    
    for(int i=0; i<n; i++){
        int x,y;
        cin >> x >> y;
        
        arr[x][y] -= k;
        if(arr[x][y]<0) arr[x][y] = 0;
        
        if(x>0){
            arr[x-1][y] -= k;
            if(arr[x-1][y]<0) arr[x-1][y] = 0;
        }
        
        if(y>0){
            arr[x][y-1] -= k;
            if(arr[x][y-1]<0) arr[x][y-1] = 0;
        }
        
        if(x<4){
            arr[x+1][y] -= k;
            if(arr[x+1][y]<0) arr[x+1][y] = 0;
        }
        
        if(y<4){
            arr[x][y+1] -= k;
            if(arr[x][y+1]<0) arr[x][y+1] = 0;
        }
        
    }
    int t = 0;
    for(int i=0; i<5; i++){
        for(int j=0; j<5; j++){
            cout << arr[i][j] << " ";
            t += arr[i][j];
        }
        cout << endl;
    }
    cout << t << endl;
    
    return 0;
}

??

??

chainy

??

More from chainy