Notepad++

1

cmd /k g++ -o $(CURRENT_DIRECTORY)\$(NAME_PART).exe "$(FULL_CURRENT_PATH)" & PAUSE & EXIT

1

cmd /k "$(CURRENT_DIRECTORY)\$(NAME_PART)" & PAUSE & EXIT

1

cmd /k g++ -o $(CURRENT_DIRECTORY)\$(NAME_PART).exe "$(FULL_CURRENT_PATH)" &cmd /k "$(CURRENT_DIRECTORY)\$(NAME_PART)" & PAUSE & EXIT

原理

未完待续

题目

未完待续

原理

欧几里得算法据说是最早的算法，用于计算最大公约数，也是数论的基础算法之一。

题目

51Nod 1011：https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1011

哈夫曼编码

以下为数据结构作业
如有错误，请指出，谢谢！

Descript

Given two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a is divisible by an integer b if and only if there exists an integer c such that a = b * c.