Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int a[101][101] , n , m , x , y , r , im = 0 , v[101];
- ifstream fin("iesire.in");
- ofstream fout("iesire.out");
- const int di[]={0 , 0 , 1 , -1},
- dj[]={1 , -1 , 0 , 0};
- void Fill( int i , int j , int val_veche , int val_noua )
- {
- if( i >= 1 && i <=n && j >= 1 && j <= n && a[i][j] == val_veche )
- {
- a[i][j] = val_noua;
- if( i == 1 || i == n || j == 1 || j == n )
- r = 9;
- for( int k = 0 ; k < 4 ; k++)
- Fill( i + di[k], j + dj[k], val_veche, val_noua);
- }
- }
- int main()
- {
- fin >> n >> m;
- for(int i =1 ; i <= n ; i++)
- for(int j =1 ; j <= n ; j++)
- fin >> a[i][j];
- for( int i = 1; i <= m ; i++)
- v[i]= 0;
- for( int i = 1 ; i<= m ; i++)
- {
- fin >> x >> y;
- r = 0;
- Fill( x , y, 0 , 2);
- if(r != 0)
- fout << "da\n";
- else
- fout << "nu\n";
- Fill(x, y, 2 , 0);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement