Advertisement
MatveyL

wer

Jan 17th, 2017
134
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.87 KB | None | 0 0
  1. #include <iostream>
  2. #include <vector>
  3. #include <cmath>
  4. using namespace std;
  5.  
  6.  
  7.  
  8. vector<vector<int>>B1;
  9. int lelus,it;
  10.  
  11.  
  12.  
  13.  
  14.  
  15.  
  16.  
  17.  
  18.  
  19. int main(){
  20. int a,b,c,d,e,f,g,h;
  21.  
  22.  
  23. cin>> h;
  24.  
  25.  
  26. vector<vector<int>>A(h);
  27. vector<vector<int>>A1(h);
  28. vector<vector<int>>B(h);
  29.  
  30. for(int i = 0 ; i < h ; i++){
  31. cin>> a>>b>>c>>d;
  32. A[i] = {a, b, c, d};
  33. }
  34.  
  35.  
  36. for(int i = 0 ; i < h ; i++){
  37. A1[i].push_back(A[i][0]*60 + A[i][1]);
  38. A1[i].push_back(A[i][2]*60 + A[i][3]);
  39. }
  40.  
  41. for(int i = 0 ; i < h ; i++){
  42. cout<<A1[i][0]<<" "<<A1[i][1]<<endl;
  43. }
  44.  
  45.  
  46.  
  47. b = 0;
  48. a = 0;
  49. for(int i = 0 ; i < h ; i++){
  50.  
  51. if(A1[i][0]==A1[i][1]){
  52. for(int g = 0 ; g < 1440 ; g++){
  53. B[i].push_back(1);
  54. }
  55. }
  56.  
  57.  
  58. if(A1[i][0]>A1[i][1]){
  59. for(int g = 0 ; g < 1440 ; g++){
  60. if(g<A1[i][0]){
  61. B[i].push_back(1);
  62. }
  63. else{
  64. if(g+1>A1[i][1]){
  65. B[i].push_back(1);
  66. }
  67. else{
  68. B[i].push_back(0);
  69. }
  70. }
  71. }
  72. }
  73.  
  74.  
  75.  
  76. if(A1[i][0] < A1[i][1]){
  77. for(int g = 0 ; g < 1440 ; g++){
  78. if(A1[i][0] < g && A1[i][1] > g+1){
  79. B[i].push_back(1);
  80. }
  81. else{
  82. B[i].push_back(0);
  83. }
  84. }
  85. }
  86.  
  87. }
  88.  
  89. for(int i = 0 ; i < h ; i++){
  90. for(int g = 0 ; g < 1440 ; g++){
  91. cout<<B[i][g]<<" ";
  92. }
  93. cout<<endl;
  94. }
  95.  
  96.  
  97.  
  98. cout<<endl;
  99. return 0;
  100. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement