Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- const int N = 1e4;
- int campo[4*N+5][4*N+5];
- /*void fieldWaste(int a, int b){
- campo[a][b] = 1;
- }
- void colorfulField(int n, int m){
- int aux = 2;
- for(int i = 1; i <= n; i++){
- for(int j = 1; i <= m; j++){
- if(campo[i][j] != 1) campo[i][j] = aux;
- if(campo[i-1][j-1] == 2){
- aux = 3;
- }else if(campo[i-1][j-1] == 3){
- aux = 4;
- }else if(campo[i-1][j-1] == 4){
- aux = 2;
- }
- }
- }
- }
- void query( int i, int j){
- if(campo[i][j] == 2){
- cout << "Carrots";
- }else if(campo[i][j] == 3){
- cout << "Kiwis";
- }else if(campo[i][j] == 4){
- cout << "Grapes";
- }else if (campo[i][j] == 1){
- cout << "Waste";
- }
- }*/
- int main(){
- int n, m, k, t; cin >> n >> m >> k >> t;
- for(int i = 1; i <= n; i++){
- for(int j = 1; i <= m; j++){
- campo[i][j] = 0;
- cout << campo[i][j] << " ";
- }
- }
- /* while(k--){
- int a, b;
- cin >> a >> b;
- fieldWaste(a, b);
- }
- colorfulField(n, m);
- while(t--){
- int i, j;
- cin >> i >> j;
- query(i, j);
- cout << endl;
- }
- */
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement