2 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=510; int g[N][N]; //棋盘硬币 struct Node{ //表示一次操作 int x1,y1,x2,y2; }op[N*N]; int main() { int n,m; cin>>n>>m; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { cin>>g[i][j]; } } int cnt=0; for(int i=1;i<=n;i++) { for(int j=1;j<m;j++) { if(g[i][j]%2!=0) //说明当前格子是奇数 { g[i][j+1]++;//移动一个硬币到右边去 op[++cnt]={i,j,i,j+1}; } } } for(int i=1;i<n;i++) { if(g[i][m]%2!=0) //说明当前格子是奇数个 { g[i+1][m]++; //移动一个硬币到下面 op[++cnt]={i,m,i+1,m}; } } cout<<cnt<<endl; for(int i=1;i<=cnt;i++) { cout<<op[i].x1<<" "<<op[i].y1<<" "<<op[i].x2<<" "<<op[i].y2<<endl; } return 0; }
Information
- ID
- 1716
- Time
- 2000ms
- Memory
- 1024MiB
- Difficulty
- 5
- Tags
- (None)
- # Submissions
- 26
- Accepted
- 9
- Uploaded By