Advertisement
Guest User

Untitled

a guest
Dec 10th, 2018
73
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.57 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. #include <stdlib.h>
  4. #include <string>
  5. using namespace std;
  6.  
  7. int main()
  8. {
  9.     int N = 1233;
  10.     int claims[N][4]={0};
  11.     int temp = 0;
  12.     int PlayingField[10][10]={0};
  13.     ifstream ReadingFile;
  14.     ReadingFile.open("D:\\Programming\\AOP2018\\Day3\\input.txt");
  15.     if(ReadingFile.is_open()){
  16.         string line;
  17.         int intLine;
  18.         int i = 0;
  19.         while (getline(ReadingFile,line)){
  20.             int pos = line.find('@');
  21.             line = line.substr(pos+2, string::npos); //remove unnecessary header.
  22.             pos = line.find(',');
  23.             int pos2 = line.find(':');
  24.             int pos3 = line.find('x');
  25.             claims[i][0] = atoi(line.substr(0,pos).c_str());
  26.             claims[i][1] = atoi(line.substr(pos+1, pos2-pos).c_str());
  27.             claims[i][2] = atoi(line.substr(pos2+2, pos3-2-pos2).c_str());
  28.             claims[i][3] = atoi(line.substr(pos3+1, string::npos).c_str());
  29.             cout << claims [i][0] << "," << claims [i][1] << "," << claims [i][2] << "," << claims [i][3] << endl;
  30.             i++;
  31.             }
  32.  
  33.  
  34.     }
  35.     int count=0;
  36.     for (int i=0; i<N; i++){
  37.         for(int j=claims[i][1]; j<claims[i][1]+claims[i][3]; j++){
  38.             for(int k=claims[i][2]; k<claims[i][2]+claims[i][4]; k++){
  39.                 PlayingField[j][k]++;
  40.             }
  41.         }
  42.     }
  43.  
  44.  
  45.     for(int i=0; i<10; i++){
  46.         for(int j=0; j<10; j++){
  47.             if(PlayingField[i][j]<=2){
  48.                 count++;
  49.             }
  50.         }
  51.     }
  52.     cout << count << endl;
  53.     return 0;
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement