Advertisement
Guest User

Untitled

a guest
Nov 28th, 2014
177
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.16 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. #include <iomanip>
  4.  
  5. using namespace std;
  6.  
  7. ifstream f("date.in");
  8. ofstream g("date.out");
  9.  
  10. int t[10][10];
  11. void scrie (int n,int m,int t[][10])
  12. {
  13. int i,j;
  14. for (i=1;i<=n;i++)
  15. {
  16. for (j=1;j<=m;j++)
  17. g<<setw(4)<<t[i][j]<<' ';
  18. g<<endl;
  19. }
  20. g<<endl;
  21. }
  22. void traseu (int n,int m,int t[][10],int i,int j,int pas,int l[][10])
  23. {
  24. int k,in,jn,x[5]={0,0,1,0,-1},y[5]={0,1,0,-1,0};
  25. for (k=1;k<=4;k++)
  26. {
  27. in=i+x[k];
  28. jn=j+y[k];
  29. if (in>=1 && in<=n && jn>=1 && jn<=n)
  30. if (t[in][jn]==0 && l[in][jn]==1)
  31. {
  32. t[in][jn]=pas;
  33. if (in==1 || in==n || jn==1 || jn==m )
  34. scrie (n,m,t);
  35. else
  36. traseu (n,m,t,in,jn,pas+1,l);
  37. t[in][jn]=0;
  38. }
  39. }
  40. }
  41. int main()
  42. {
  43. int n,m,i,j,l[10][10],i1,j1;
  44. f>>n>>m;
  45. f>>i>>j;
  46. for (i1=1;i1<=n;i1++)
  47. for (j1=1;j1<=m;j1++)
  48. f>>l[i1][j1];
  49. t[i][j]=1;
  50. if (l[i][j]==1)
  51. traseu (n,m,t,i,j,2,l);
  52. f.close();
  53. g.close();
  54. return 0;
  55. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement