![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
简单算法
fuekU
这个作者很懒,什么都没留下…
展开
-
mark
//b > 0int fn(int a, int b, int c){ return b > 1 ? fn(a, b / 2, c) * fn(a, b - b / 2, c) % c : a % c;}int mp[100][100];int n;void floyd(){ int i, j, k; for(k = 1; k <= n; k++) for(i = 1; i原创 2014-04-14 12:15:09 · 360 阅读 · 0 评论 -
poj 1163 The Triangle 数字三角形问题
#include #include using namespace std;int dat[101];void solve(){ int n, i, j, t, tmp; cin >> n; for (i = 0; i < n; i++) { for (j = 0; j < i + 1; j++) { cin >> tmp; t = n - i + j - 1原创 2014-07-06 21:53:08 · 339 阅读 · 0 评论 -
poj1129 m着色
#include#include#includebool G[256][256];int x[256];int ans;bool NextColor(int m, int n, int k){ int i; while(1) { x[k] = (x[k] + 1) % (m + 1); if(0 == x[k]) return false; for(i =原创 2014-07-03 14:00:28 · 315 阅读 · 0 评论 -
stl heap sort
#include#include#includeusing namespace std;vector dat;void print(int n){ int i; for(i=0;i<n;i++){ cout<<dat[i]<<' '; } cout<<endl;}int main(){ dat.push_back(1); dat.push_back(3); dat.原创 2014-07-02 23:37:57 · 284 阅读 · 0 评论 -
全排列
#includeusing namespace std;const int MAXN = 100;int x[MAXN];int ok(int k){ int i; for (i = 0; i < k; i++) { if (x[i] == x[k]) return 0; } return 1;}void print(int n){ int i; for (原创 2014-07-01 23:07:06 · 279 阅读 · 0 评论 -
sumofsub
#include #include #include using namespace std;int x[256], w[256];int M, n;void print(int n){ int i; for (i = 1; i <= n; i++) { if (x[i]) { cout << w[i] << ' '; } } cout << endl;原创 2014-07-02 12:04:24 · 1396 阅读 · 0 评论 -
max sum
http://acm.hdu.edu.cn/showproblem.php?pid=1003原创 2014-05-25 02:06:53 · 345 阅读 · 0 评论 -
rails
http://hz.wkjsj.org/oj/problem.php?id=1011原创 2014-06-24 21:32:28 · 338 阅读 · 0 评论 -
字典树
http://acm.hdu.edu.cn/showproblem.php?pid=1251#include#include#include#include#include#includeusing namespace std;class Node{public: Node(char c) { s = c; prefix = 0; isword = false原创 2014-05-22 23:50:26 · 278 阅读 · 0 评论 -
HDU 1166树状数组
#include#includeconst int MAXN= 50001;int dat[MAXN];int n; inline int Lowbit(int x) { return x & (-x);} inline void Update(int pos, int val) { while (pos <= n) { dat[pos] += v原创 2014-06-24 23:09:41 · 273 阅读 · 0 评论 -
二叉搜索树 二叉查找树 二叉排序树
#include using namespace std;struct Node{ int data; Node * left, * right;};void Insert(Node * & p, int data){ if(NULL == p) { p = new Node(); p->data = data; p->left = p->right = NULL原创 2014-05-14 14:04:33 · 307 阅读 · 0 评论 -
无题
#include #include #include #includeusing namespace std;const int MAXN = 5;int a[MAXN] = {1, 3, 5, 7, 9};int b[MAXN];void print(int a[], int n){ int i; for(i = 0; i < n; i++) cout << a[i]原创 2014-05-20 09:06:25 · 322 阅读 · 0 评论 -
数组中只出现1次的两个数字
在一个数组中除两个数字只出现1次外,其它数字都出现了2次, 要求尽快找出这两个数字。原创 2014-05-13 14:21:30 · 270 阅读 · 0 评论 -
hanoi
#include using namespace std;void mov(char a, char b){ cout " << b << endl;}void hanoi(int n, char a, char b, char c){ if (1 == n) { mov(a, c); } else { hanoi(n - 1, a, c, b); mov(a,原创 2014-04-13 21:19:32 · 234 阅读 · 0 评论 -
二分查找
int bsearch(int a[], int n, int x){ int s = 0, e = n - 1; int mid; while(s <= e) { mid = (s + e) / 2; if(a[mid] == x) return mid; else if(a[mid] > x) e = mid - 1; else s = mid +原创 2014-04-26 11:21:18 · 282 阅读 · 0 评论 -
随机生成和为S的N个数
#include #include #include #includeusing namespace std;const int n = 10;int total = 1000;int x[n];void fn(){ srand(time(NULL)); int i; for(i = 0; i < n - 1; i++) { x[i] = rand() % tota原创 2014-05-19 14:18:57 · 386 阅读 · 0 评论 -
n皇后
#include#includeint x[100];int place(int k){ int i=1; while(i<k){ if(x[i]==x[k] || abs(k-i)==abs(x[k]-x[i])) return 0; i++; } return 1;}void nQueens(int n){ x[1]=0; int k=1; int i;原创 2014-05-18 23:15:20 · 284 阅读 · 0 评论 -
堆排序
void maxHeap(int a[], int n, int i){ int left = i * 2, right = i * 2 + 1; if(left > n) return; int large = left; if(right a[large]) large = right; if(a[i] < a[large]) { swap(a[i], a[larg原创 2014-04-26 14:59:36 · 288 阅读 · 0 评论 -
HDU 1166线段树
敌兵布阵Time Limit: 2000/1000 MS(Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9271 AcceptedSubmission(s): 3904Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍原创 2014-06-22 23:08:02 · 386 阅读 · 0 评论