- 博客(9)
- 资源 (1)
- 收藏
- 关注
原创 HDU1061Rightmost Digit题解
Rightmost Digit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 39128 Accepted Submission(s): 14753 Problem Description Given a
2015-07-19 22:00:19 557
原创 左偏树
#include #include typedef struct node { int key,dist; struct node *Left,*Right; }LeftistTree; void Swap(LeftistTree** a,LeftistTree** b) { LeftistTree *tmp; tmp = *a; *a = *b; *b = tmp; } Leftis
2015-07-10 00:19:48 749
原创 二叉堆
#include #include int lowbit(int x) { int z; z = ~x; z++; return (x & z); } //测试 /*int main(void) { int n,t; n = 50; while(n) { t = lowbit(n); printf("%d\n",t); n -= t; } return 0; }
2015-07-09 22:25:05 1157
原创 poj3253Fence Repair 解题题解
Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 30807 Accepted: 9947 Description Farmer John wants to repair a small length of the fence aroun
2015-07-09 22:22:01 822
原创 HDU 2032 杨辉三角
杨辉三角 Problem Description 还记得中学时候学过的杨辉三角吗?具体的定义这里不再描述,你可以参考以下的图形: 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 Input 输入数据包含多个测试实例,每个测试实例的输入只包含一个正整数n(1 Output 对应
2015-07-05 16:26:36 800
原创 HDU 2028 Lowest Common Multiple Plus
Lowest Common Multiple Plus Problem Description 求n个数的最小公倍数。 Input 输入包含多个测试实例,每个测试实例的开始是一个正整数n,然后是n个正整数。 Output 为每组测试数据输出它们的最小公倍数,每个测试实例的输出占一行。你可以假设最后的输出是一个32位的整数。
2015-07-05 14:34:20 682
原创 C语言 非打印字符
#include int main(void) { char ch; ch = 7; int count = 20; /*printf("%c",ch); printf("\007"); printf("\a"); printf("\7"); printf("\x7"); printf("%c",'\7');*/ printf("Hello\073\n"); print
2015-07-04 21:29:07 3303
原创 整数溢出
#include int main(void) { int i,a = 1; long int b = 1; unsigned int c = 1; short d = 1; for(i = 1;i <= 31;i ++) { a *= 2; } a = a - 1; printf("a = %d\n",a); a += 1; printf("a = %d\n",a)
2015-07-03 19:47:51 505
原创 简单的学籍管理系统
#include #include typedef struct student { int num; //学号 char name[20]; //姓名 float Chinese; //语数外成绩 float Math; float English; float Average;
2015-07-01 21:39:38 909
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人