fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. struct qwe
  5. {
  6. int x, y, x1, y1;
  7. };
  8.  
  9. int main()
  10. {
  11. int n[202][202] = { 0 }, i, j, q, w=0;
  12. qwe a, b, c;
  13. cin >> a.x >> a.y >> a.x1 >> a.y1 >> b.x >> b.y >> b.x1 >> b.y1 >> c.x >> c.y >> c.x1 >> c.y1;
  14.  
  15. q = min(a.x, a.x1);
  16. a.x1 = max(a.x, a.x1);
  17. a.x = q;
  18. q = min(a.y, a.y1);
  19. a.y1 = max(a.y, a.y1);
  20. a.y = q;
  21.  
  22. q = min(b.x, b.x1);
  23. b.x1 = max(b.x, b.x1);
  24. b.x = q;
  25. q = min(b.y, b.y1);
  26. b.y1 = max(b.y, b.y1);
  27. b.y = q;
  28.  
  29. q = min(c.x, c.x1);
  30. c.x1 = max(c.x, c.x1);
  31. c.x = q;
  32. q = min(c.y, c.y1);
  33. c.y1 = max(c.y, c.y1);
  34. c.y = q;
  35.  
  36. for (i = a.x; i <= a.x1; i++)
  37. for (j = a.y; j <= a.y1; j++)
  38. n[i+101][j+101] = 1;
  39.  
  40. for (i = b.x; i <= b.x1; i++)
  41. for (j = b.y; j <= b.y1; j++)
  42. n[i+101][j+101] = 1;
  43.  
  44. for (i = b.x; i <= b.x1; i++)
  45. for (j = b.y; j <= b.y1; j++)
  46. n[i+101][j+101] = 1;
  47.  
  48. for (i = 1; i <= 16; i++)
  49. {
  50. for (j = 1; j <= 16; j++)
  51. {
  52. w += n[i][j];
  53. cout<<n[i][j];
  54. }
  55. cout<<endl;
  56. }
  57.  
  58. cout << w;
  59. }
Success #stdin #stdout 0s 2780KB
stdin
2 2 5 6
3 3 7 1
6 4 4 7
stdout
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0000000000000000
0