Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <stdlib.h>
- #include <string>
- using namespace std;
- int main()
- {
- int N = 1233;
- int claims[N][4]={0};
- int temp = 0;
- int PlayingField[10][10]={0};
- ifstream ReadingFile;
- ReadingFile.open("D:\\Programming\\AOP2018\\Day3\\input.txt");
- if(ReadingFile.is_open()){
- string line;
- int intLine;
- int i = 0;
- while (getline(ReadingFile,line)){
- int pos = line.find('@');
- line = line.substr(pos+2, string::npos); //remove unnecessary header.
- pos = line.find(',');
- int pos2 = line.find(':');
- int pos3 = line.find('x');
- claims[i][0] = atoi(line.substr(0,pos).c_str());
- claims[i][1] = atoi(line.substr(pos+1, pos2-pos).c_str());
- claims[i][2] = atoi(line.substr(pos2+2, pos3-2-pos2).c_str());
- claims[i][3] = atoi(line.substr(pos3+1, string::npos).c_str());
- cout << claims [i][0] << "," << claims [i][1] << "," << claims [i][2] << "," << claims [i][3] << endl;
- i++;
- }
- }
- int count=0;
- for (int i=0; i<N; i++){
- for(int j=claims[i][1]; j<claims[i][1]+claims[i][3]; j++){
- for(int k=claims[i][2]; k<claims[i][2]+claims[i][4]; k++){
- PlayingField[j][k]++;
- }
- }
- }
- for(int i=0; i<10; i++){
- for(int j=0; j<10; j++){
- if(PlayingField[i][j]<=2){
- count++;
- }
- }
- }
- cout << count << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement