Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <queue>
- #include <vector>
- using namespace std;
- int main()
- {
- vector<pair<int, int> > v;
- int n;
- int m;
- int barok;
- queue<vector<pair<int, int> > >q;
- cin>>n>>m;
- cin>>barok;
- int P=n*m;
- int meseci=0;
- char matrica[n][m];
- bool visited[n][m];
- for(int x=0; x<n; x++){
- for(int x1=0; x1<m; x1++){
- visited[x][x1]=false;
- }
- }
- int b;
- cin>>b;
- for(int p1=0; p1<b; p1++){
- int r;
- int c;
- cin>>r;
- cin>>c;
- r -= 1;
- c -= 1;
- v.push_back(make_pair(r, c));
- }
- for(int i =0; i < v.size(); i++) {
- cout << v[i].first << " " << v[i].second << endl;
- }
- return 0;
- }
- /*
- ?X??
- XX??
- XX??
- **/
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement