Summary Files Commits Branches @commit @diff @stats
path: root / Year 2 / Structures and data algorithms / Project / exb / main.cpp
blob: 8ab5aec39bc17ccaade6964b1eeb00684123d092 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include "CityVisit.h"
#include <iostream>

/* Самото решение се намира в visitTheMostInTimeRec в City.cpp */

int main() {
	std::cout << "Име на град: ";
	std::string fileName;
	std::cin >> fileName;

	std::ifstream inFile(fileName + ".txt");
	if (!inFile.is_open())
		throw std::logic_error("The given city has no .txt file!");

	CityVisit cv;
	std::deque<std::string> visited = cv.visitTheMostInTime(inFile);
	inFile.close();
	for (std::string v : visited)
		std::cout << v << " ";
	std::cout << std::endl;
}