DCing algorithm

[Mesujin]

Gravedigging aye. This thread was the 3rd in the list before i post this, so... ;-;

No one yet shared the C++ version, so im here to share it '-'.

C++-Code: #include <iostream>   std::string Key = "SiuHungIsAGoodBearBecauseHeIsVeryGood"; void ReadLF2DAT(std::string &Input, std::string &Output) { std::ifstream In(Input); std::stringstream Data; Data << In.rdbuf(); In.close();   std::string DataManage = Data.str(); unsigned int LoopS = DataManage.size(); unsigned int LoopK = 12; unsigned int LoopKS = Key.size(); for(unsigned int Loop = 123; Loop < LoopS; ++Loop){DataManage[Loop] -= Key[LoopK]; LoopK += 1; if(LoopK == LoopKS) LoopK = 0;}   std::ofstream Out(Output); DataManage.erase(0, 123); Out << DataManage; Out.close(); }   int main() { ReadLF2DAT("data\\template.dat", "data\\temporary.txt"); return 0; }

Fast and easy to understand ;3 ...well my coding format are crowded, but i'm used to it.



Anyway..
According to Leviaz, said that before the first DC tool by Jinquera, DCing was nothing but just a DATA Changing.
The question is, you know.. that those datas will got moved into "temporary.txt", is no one realized that DCing could be learned from there before that? (Me either won't know about DCing without 'ancestors', ofc, definitely. Never meant to be bad, just questioning, quite curious.)

and anyway, importing all .dat(s) into .txt(s) will make the loading become even more faster. So... Decoding back into .dat file is just ... baka >///<

(off) last anyway, you'll see the reason why im posting something like this, "soon".