C++常用函数及测试所用
rsy56640
学生
展开
-
计算C(2n, n)
unsigned long long C2nn(int n) { vector<unsigned long long>Catalan(n + 1, 0); Catalan[0] = 1; for (int i = 0; i < n; ++i) { for (int j = 0; j <= i; j++) { Catalan[i + 1]原创 2017-11-09 21:26:34 · 5173 阅读 · 0 评论 -
数组左平移
int gcd(int x, int y) { while (x != 0) { int z = x; x = y; y = z; x %= y; } return y;}void transleft(int *A, int k,int n) { k = (k % n + n) % n;原创 2017-11-09 21:23:25 · 377 阅读 · 0 评论 -
二叉树后序遍历迭代器(仅支持++)
昨天康大佬()优化了一下觉得不错,贴上来#include <iostream>#include <stack>using namespace std;template <class Type> struct BTNode { BTNode *left; Type data; BTNode *right; BTNode(Type x) { data原创 2017-11-28 12:08:14 · 774 阅读 · 0 评论 -
split
void Split(const string& s, const string& delimiter, vector<string>* result){ size_t last = 0; size_t index = s.find_first_of(delimiter, last); while (index != string::npos) {转载 2017-11-09 21:19:33 · 215 阅读 · 0 评论 -
KummerPlus
//return the index of d dividing C(n,m);//d is strictly less than 10201;//n is greater than m;int k = 25;int prime[25] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71原创 2017-11-09 21:22:11 · 228 阅读 · 0 评论 -
Kummer
//return the idex of the prime number p divinding C(n,m);//p is a prime number;//n is greater than m;int Kummer(int n, int m, int p) { int up=0, index = 0; n -= m; while (n != 0 || m !=原创 2017-11-09 21:21:32 · 275 阅读 · 0 评论 -
打印1000以内阶乘
//可以到1111//const int char_len = 5000;const short carry_bit = 4;int ten_pow(int n) { int s = 1; for (int i = 0; i < n; ++i) s *= 10; return s;}void factorial(int n) { int len原创 2017-11-09 21:22:56 · 329 阅读 · 0 评论 -
计算星期(基姆拉尔森公式)
int weekday(int year,int month,int day) { if (month == 1 || month == 2) { month += 12; --year; } int week = -1; week = (day + 2 * month + 3 * (month + 1) / 5 + year + ye原创 2017-11-09 21:24:02 · 268 阅读 · 0 评论 -
【测试】构建二叉树
用来测试一些二叉树的算法BinaryTreeTest.h#pragma once#include #include #include #include using namespace std;ostream_iteratorint> _oit(cout, " ");const int layer = 4;const int MAXN = 1 << layer;co原创 2017-11-13 12:50:03 · 332 阅读 · 0 评论