diff options
| author | Tom Li Dobnik <tomlidobnik1@gmail.com> | 2026-03-30 11:15:21 +0200 |
|---|---|---|
| committer | Tom Li Dobnik <tomlidobnik1@gmail.com> | 2026-03-30 11:15:21 +0200 |
| commit | 06b004fcfefbba9bafd30752be1dfc0a01a8cea4 (patch) | |
| tree | b4b9bdf7d2eb68af13528a64d66037335a7f797b /main.cpp | |
Diffstat (limited to 'main.cpp')
| -rw-r--r-- | main.cpp | 20 |
1 files changed, 20 insertions, 0 deletions
diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..fe802a8 --- /dev/null +++ b/main.cpp @@ -0,0 +1,20 @@ +#include <fstream> +#include <iostream> +#include <string> +/* + prvo prebrat datoteko in sestavit 2d array + najdi index za zacetek in konec + brute force: zacni na zacetnem indeksu, preveri vsako pod v 4 smeri in za + vsako smer shrani mozne poti optimalen algoritem?: sestavit drevo, preko + drevesa sproti leksikografsko sortirati in ko pridemo do K-te poti koncamo + iskanje + */ +int main() { + int N, M, K; + std::ifstream input("./test/spust01.in"); + std::string line; + getline(input, line); + // std::cout << N << " " << M << " " << K << std::endl; + std::cout << line; + return 0; +} |