紫书,练习题. - 随笔分类 - X-POWER

摘要：阅读全文

posted @ 2016-03-13 17:32 X-POWER 阅读(276) 评论(0) 推荐(0)

摘要：A number of K balls are dropped one by one from the root of a fully binary tree structure FBT. Each time the ball being dropped first visits a non-ter 阅读全文

posted @ 2016-03-06 14:35 X-POWER 阅读(218) 评论(0) 推荐(0)

例题 3-5 谜题 uva227 Puzzle

摘要：A children’s puzzle that was popular 30 years ago consisted of a 5×5 frame which contained 24 small squares of equal size. A unique letter of the alph 阅读全文

posted @ 2016-02-25 20:59 X-POWER 阅读(473) 评论(0) 推荐(0)

例题3-4 周期串

摘要：UVA - 455 Periodic Strings Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu Description Periodic Strings A character string is sa 阅读全文

posted @ 2016-02-25 17:12 X-POWER 阅读(414) 评论(0) 推荐(0)

----堆栈 STL 函数库 ----有待补充

摘要：#include<cstdio> #include<string> #include<vector> #include<iostream> using namespace std; int main() { vector<int> a; int i,b; for(i=0;i<56;i++) a.pu 阅读全文

posted @ 2016-01-30 22:14 X-POWER 阅读(206) 评论(0) 推荐(0)

UVa 101 - The Blocks Problem STL

摘要：题目：给你n个方块，有四种操作： 1.move a onto b，把a和b上面的方块都放回原来位置，然后把a放到b上面； 2.move a over b，把a上面的放回原处，然后把a放在b所在的方块堆的上面； 3.pile a onto b，把b上面的放回原来位置，然后把a和a上面的方块整体放到b上阅读全文

posted @ 2016-01-29 17:36 X-POWER 阅读(200) 评论(0) 推荐(0)

例题 5-1 STL

摘要：Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. At the beginning, Raju would place the marbles 阅读全文

posted @ 2016-01-29 17:10 X-POWER 阅读(240) 评论(0) 推荐(0)

课后题 3-3 水题

摘要：Digit Counting Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu Submit Status Description Download as PDF Trung is bored with his 阅读全文

posted @ 2016-01-29 09:25 X-POWER 阅读(246) 评论(0) 推荐(0)

课后题--------求分子量-----Molar mass------

摘要：简单的化学式求分子量问题下面附上代码和解析. 1 #include<stdio.h> 2 #include<algorithm> 3 #include<string.h> 4 #include<math.h> 5 using namespace std ; 6 int main() 7 { 8 阅读全文

posted @ 2016-01-28 08:50 X-POWER 阅读(396) 评论(0) 推荐(0)

课后题3-1

摘要：There is an objective test result such as ``OOXXOXXOOO". An `O' means a correct answer of a problem and an `X' means a wrong answer. The score of each 阅读全文

posted @ 2016-01-27 18:18 X-POWER 阅读(373) 评论(0) 推荐(0)

进位制与成熟表示

摘要：1:移位运算符#includeint main(){ printf("%d ",18>>1); // 移位运算符也就是乘以2^? 后面的是进位的位数. printf("%d ",18<<1); // 除以2... 阅读全文

posted @ 2016-01-22 20:07 X-POWER 阅读(195) 评论(0) 推荐(0)

例题 3-6 环状序列

摘要：以后你们可以叫我袁大婶没错就是这么猛.------下面附上我的代码/*给一个长度为n的DNA环状串,请你输出字典序最小的那个序列*//*你怎么想? 不开字符串尽量减少时间空间复杂度打败刘大婶*//* 用两个标记变量一个字母然后比较大小 ... 阅读全文

posted @ 2016-01-22 19:51 X-POWER 阅读(896) 评论(0) 推荐(0)

-------------------开启我的手残之旅---------我就是喜欢写笔记-------咋滴啦?-----

摘要：开始吧. 阅读全文

posted @ 2016-01-22 17:12 X-POWER 阅读(175) 评论(0) 推荐(0)

例题 3-5 生成元 digit generator

摘要：1 #include 2 #include 3 #define maxn 100005 4 int ans[maxn]; //类似于比较大的数组还是开导外面比较好一点,防止报错. 5 int main() 6 { 7 int x,y,m,T,n; 8 mems... 阅读全文

posted @ 2016-01-05 11:36 X-POWER 阅读(286) 评论(0) 推荐(0)

例题3-4 master-mind hints

摘要：下面先附上我的水货代码,,,,一会附上,,,刘大婶给的代码///////3ms#include#includeint main(){ int A,B,W=0,t,n,m,i,j,q,a[1111],b[1111],c[1111]; while(scanf("%d",&t),t) {... 阅读全文

posted @ 2016-01-04 20:19 X-POWER 阅读(173) 评论(0) 推荐(0)

程序3-3 Palindromes

摘要：刘大婶说这个比较难,哈哈,我感觉自己写的代码还是比较简单的.#include#include#includeint is_palindrome(char x[],int n);//用于判断是否回文 //如果回文的话,返回值为1,反之为0int is_mirrored(char x[],int n)... 阅读全文

posted @ 2016-01-04 13:56 X-POWER 阅读(219) 评论(0) 推荐(0)

3-2 -------WERTYU------题挺水的

摘要：//题目的意思就是-----键盘上面你输入一个字符,就要输出该字符左边的字符.//空格和回车原样输出.#includeint main(){ char a[]={"`1234567890-=QWERTYUIOP[]ASDFGHJKL;'\ZXCVBNM,./"},b; int n,i; ... 阅读全文

posted @ 2016-01-03 20:07 X-POWER 阅读(372) 评论(0) 推荐(0)

例题3-1

摘要：TEX QuotesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9698 Accepted: 5085DescriptionTEX is a typesetting language develope... 阅读全文

posted @ 2016-01-03 12:35 X-POWER 阅读(321) 评论(0) 推荐(0)

随笔分类 - 紫书,练习题.

公告