Stay fooooooooolish

emmm……实不相瞒,我也想成为大佬

word2016 添加参考文献的方法

前言 网上关于word参考文献的总结,其实挺多的,但是大多数教程阅读体验很差,而且版本不一样,流程不完整、不详细。我总结了一下参考文献从头到尾的添加方法,尽可能详细的展现整个添加流程。 参考文献的标准格式 参考文献的引用标准,是有一套严格的定义的。根据论文的需求先把自己要引用的文献写好,当然...

2019-01-15 20:10:05

阅读数:119

评论数:2

C/C++ 字符判断函数总结

前言   在做诸如字符串处理这种类型的题目的时候,总是要涉及到字符判断这种问题,尤其是在数字与字符之间进行转换时。初学者总会自然而然的手动去实现这个功能,比如判断字符是否是一个数字—— // 判断字符是否在 0~9之间 bool isnum(const char&c){ ...

2019-01-08 21:56:27

阅读数:44

评论数:0

1071 Speech Patterns (25 分)哈希表统计最多的单词

题目 People often have a preference among synonyms of the same word. For example, some may prefer “the police”, while others may prefer “the cops”. Ana...

2019-01-08 21:02:07

阅读数:29

评论数:0

1070 Mooncake (25 分)贪心算法

题目 Mooncake is a Chinese bakery product traditionally eaten during the Mid-Autumn Festival. Many types of fillings and crusts can be found in traditi...

2019-01-08 15:10:38

阅读数:31

评论数:0

1069 The Black Hole of Numbers (20 分)字符串数字加减

题目 For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-d...

2019-01-08 11:25:43

阅读数:27

评论数:0

1068 Find More Coins (30 分)背包问题

题目 Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which...

2019-01-07 22:57:08

阅读数:31

评论数:0

1067 Sort with Swap(0, i) (25 分)贪心策略计算交换排序的最少次数

题目 Given any permutation of the numbers {0, 1, 2,…, N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation t...

2019-01-07 20:22:33

阅读数:30

评论数:0

std::stack使用总结

Stack(堆栈)   stack是一种简单而常用的数据结构,stl库中提供了现成的实现方案。   在使用stack的时候,需要包含头文件stack,其在std中的定义如下: template< class T, class Containe...

2019-01-07 14:31:21

阅读数:42

评论数:0

1066 Root of AVL Tree (25 分)AVL树

题目 An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at...

2018-12-31 15:55:10

阅读数:64

评论数:0

1065 A+B and C (64bit) (20 分)溢出判定

题目 Given three integers A, B and C in [−263,263][−2^{63},2^{63}][−263,263], you are supposed to tell whether A+B>CA+B>C...

2018-12-29 11:30:23

阅读数:67

评论数:0

1064 Complete Binary Search Tree (30 分)完全二叉搜索树

题目 A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only no...

2018-12-28 22:26:52

阅读数:24

评论数:0

1063 Set Similarity (25 分)求集合交集并集比值

题目 Given two sets of integers, the similarity of the sets is defined to be Nc/Nt×100N_c/N_t\times 100%Nc​/Nt​×100, where NcN_cNc​ is the number of di...

2018-12-28 17:54:47

阅读数:26

评论数:0

1062 Talent and Virtue (25 分)排序(水题)

题目 About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about people’s talent and virtue. According to his t...

2018-12-28 16:41:27

阅读数:51

评论数:0

1061 Dating (20 分)字符串的处理

题目 Sherlock Holmes received a note with some strange strings: Let’s date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&a...

2018-12-28 11:22:05

阅读数:37

评论数:0

1060 Are They Equal (25 分)字符串转换浮点型数值

题目 If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as 0.123×1050....

2018-12-27 20:27:03

阅读数:27

评论数:0

厄拉多塞素数筛选法

  厄拉多塞是一位古希腊数学家,他在寻找素数时,采用了一种与众不同的方法——   先将2-N的各数放入表中,然后在2的上面画一个圆圈,然后划去2的其他倍数;第一个既未画圈又没有被划去的数是3,将它画圈,再划去3的其他倍数;现在既未画圈又没有被划去的第一个数 是5,将它画圈,并划去5的其他倍数……依...

2018-12-27 15:18:59

阅读数:32

评论数:0

1059 Prime Factors (25 分)厄拉多塞素数筛选法

题目 Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N=p1k1×p2k2×⋯×pmkmN=p_1^{k_1} \times...

2018-12-27 14:54:56

阅读数:61

评论数:0

C/C++:long int与long long的区别

long int   long int即long,给人的感觉好像是长整型,但实际上,它和int一样,只有32位。cppreference给出的定义是—— int - basic integer type. The keyword int may be omitted if any of the ...

2018-12-25 11:07:02

阅读数:67

评论数:0

1058 A+B in Hogwarts (20 分)混合进制

题目 If you are a fan of Harry Potter, you would know the world of magic has its own currency system – as Hagrid explained it to Harry, “Seventeen silv...

2018-12-24 22:15:25

阅读数:40

评论数:0

1057 Stack (30 分)树状数组求堆栈中位数

题目 Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Pu...

2018-12-24 22:00:33

阅读数:42

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭