You are to write a program that receives an integer
n as input (from the command line), and embeds itself (the program)
n directories down the directory tree. Example with
The folder names may be whatever you wish. The only requirements are that the depth is correct, and that the program can then be ran again from its new spot in the directory tree, and that the new source file retains the same filename.
- Score * 0.9 If the directories all have a different name (must be true at least to depth 1 000 000)
- Score * 0.5 If you do not directly or indirectly read or move the source file, or access the source code of the program
lncommand in *nix? If I'm not mistaken, it's just creating another entry to the file inode, and no content is read at all. \$\endgroup\$