这是一首很感动的主内歌曲,听了无首次,还是很感动,这里把歌词贴出来,一方面是为了记忆歌词,另一方面是为以后怀念记忆.(20:44:38) Bless the lord,oh my soul oh my soul worship his holy name sing like never before oh my soul I'll worship your holy name the sun comes up ,it's a new day dawning it's time to sing…

题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=5112 A Curious Matt Description There is a curious man called Matt. One day, Matt's best friend Ted is wandering on the non-negative half of the number line. Matt finds it interesting to know the maximal…

A Curious Matt Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=5112 Description There is a curious man called Matt. One day, Matt's best friend Ted is wandering on the non-negative half of the number line. Matt f…

A Curious Matt Time Limit: 2000/2000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1338    Accepted Submission(s): 735 Problem Description There is a curious man called Matt. One day, Matt's best friend Ted is wa…

Description There is a curious man called Matt. One day, Matt's best friend Ted is wandering on the non-negative half of the number line. Matt finds it interesting to know the maximal speed Ted may reach. In order to do so, Matt takes records of Ted'…

Happy Matt Friends Time Limit: 6000/6000 MS (Java/Others)    Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 1810    Accepted Submission(s): 715 Problem Description Matt has N friends. They are playing a game together. Each of Matt’s…

A Curious Matt Time Limit: 2000/2000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3058    Accepted Submission(s): 1716 Problem Description There is a curious man called Matt. One day, Matt's best friend Ted is w…

原文链接:http://lesseesadvocate.com/7-compelling-reasons-need-start-business-youve-always-wanted/ Don’t Wait Any Longer – Start Your Own Business and Stop Building Someone Else’s Empire The Autonomy and freedom you’ll gain by working for yourself is some…

http://www.grymoire.com/Unix/CshTop10.txt ======================================================================        Top Ten Reasons not to use the C shell======================================================================    Written by Bruce B…

14:求10000以内n的阶乘 总时间限制:  5000ms 内存限制:  655360kB 描述 求10000以内n的阶乘. 输入 只有一行输入,整数n(0<=n<=10000). 输出 一行,即n!的值. 样例输入 100 样例输出 9332621544394415268169923885626670049071596826438162146859296389521759999322991560894146397615651828625369792082722375825118521091…

最近用 codeigniter 写一个小系统,引用了session 库,codeigniter默认的session存储方式为files.鉴于安全性,文件即肯定涉及到权限问题. 在类 UNIX 操作系统中,这可以通过在该目录上执行 chmod 命令,将权限设置为 0700 来实现, 这样就可以只允许目录的所有者执行读取和写入操作.但是要注意的是,脚本的执行者通常不是你自己, 而是类似于 'www-data' 这样的用户,所以只设置权限可能会破坏你的程序. 但用户买的是万网的虚拟主机,默认是没有开启…

方法一: #coding=utf-8 import urllib2 import threading from time import ctime,sleep print "Start-Time : %s" %ctime() f = open("ip.txt","r") lines = f.readlines() for line in lines:     url = 'http://'+line.strip('\n')+':10000'   …

Matt Pietrek October 1996 MSJ Matt Pietrek is the author of Windows 95 System Programming Secrets (IDG Books, 1995). He works at NuMega Technologies Inc., and can be reached at 71774.362@compuserve.com. QWay back in your July 1994 column, you wrote a…

在ubuntu下面安装了一个wordpress程序,在后台什么都没干,编辑主题时,发现页面中报下面的错误. notice: /home/wwwroot/test.localhost/wordpress/wp-content/themes Warning: scandir() has been disabled 这个是什么情况呢,赶快到网上搜了一下. 原来是scandir被禁用了.通过lnmp探针也可以看到. 很简单,编辑php.ini文件 disable_functions = scandir,…

一. 1985年,芝加哥大学的Benjamin Bloom教授,出版了一本重要著作<如何培养天才>(Developing Talent in Young People). 他研究的是,如何在青少年中发现未来的天才? 他调查了120个各行各业的精英人物,包括音乐家.科学家.艺术家.工程师,却得到了一个有点令人尴尬的结论:天才无法在青少年时期发现. 你找不到任何一个普遍适用的指标,暗示这个孩子将来会成才.智商IQ测试与将来的成就,根本就没有相关性. 但是,有一个变量除外.它与个人成就的大小,呈现强…

总时间限制:  5000ms 内存限制:  655360kB 描述 求10000以内n的阶乘. 输入 只有一行输入,整数n(0<=n<=10000). 输出 一行,即n!的值. 样例输入 100 样例输出 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000…

大家都知道π=3.1415926……无穷多位, 历史上很多人都在计算这个数, 一直认为是一个非常复杂的问题.现在有了电脑, 这个问题就简单了.电脑可以利用级数计算出很多高精度的值, 有关级数的问题请参考<高等数学>,以下是比较有名的有关π的级数: 其中有些计算起来很复杂, 我们可以选用第三个, 比较简单, 并且收敛的非常快.因为计算π值, 而这个公式是计算π/2的, 我们把它变形:π = 2 + 2/3 + 2/3*2/5 + 2/3*2/5*3/7 + ... 对于级数, 我们先做个简单测试…

给定两个数m,n,其中m是一个素数. 将n(0<=n<=10000)的阶乘分解质因数,求其中有多少个m. 输入 第一行是一个整数s(0<s<=100),表示测试数据的组数 随后的s行, 每行有两个整数n,m. 输出 输出m的个数. 样例输入 100 5 16 2 样例输出 /*给定两个数m,n 求m!分解质因数后因子n的个数. 这道题涉及到了大数问题,如果相乘直接求的话会超出数据类型的范围. 下面给出一种效率比较高的算法,我们一步一步来. m!=1*2*3*……*(m-2)*(m-…

Happy Matt Friends Time Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others) Total Submission(s): 3215 Accepted Submission(s): 1261 Problem Description Matt has N friends. They are playing a game together. Each of Matt's frie…

Benefits of Cold Showers: 7 Reasons Why Taking Cool Showers Is Good For Your Health Most of us have been caught in that skin-cringing, and often dreaded moment of being the last one to shower. If you haven't then chances are that you've had someone w…

Matt has N friends. They are playing a game together.Each of Matt's friends has a magic number. In the game, Matt selects some (could be zero) of his friends. If the xor (exclusive-or) sum of the selected friends'magic numbers is no less than M , Mat…

Google的人力运营高级副总裁Laszlo Bock在一次采访中说Google发现在面试程序员时问智力题完全是浪费时间,Matt Rogish在他的这篇博客How to Interview Programmers - Rogish Reading Writing中有感而发,介绍了他认为正确的面试程序员的方法. 先决条件 在你雇佣第一个员工之前 想好你的企业文化 让你团队中的每个人都面试应聘者 确保你的团队中每个人都知道如何面试,制定面试计划和清单. 每个人都写下来他要问什么问题,然后大家坐在一…

今天再测试一个存储过程时,用DBMS_OUTPUT.PUT_LINE输出时,报 ORA-20000:ORU-10027:buffer overflow,limit of 10000 bytes SQL> desc dbms_outputPROCEDURE DISABLEPROCEDURE ENABLE参数名称                       类型                    输入/输出默认值?------------------------------ ----------…

    要用dbms_output.put_line来输出语句,遇到以下错误: ERROR 位于第 1 行: ORA-20000: ORU-10027: buffer overflow, limit of 10000 bytes ORA-06512: 在"SYS.DBMS_OUTPUT", line 32 ORA-06512: 在"SYS.DBMS_OUTPUT", line 97 ORA-06512: 在"SYS.DBMS_OUTPUT", l…

timeout connect <timeout> timeout contimeout <timeout> (deprecated) Set the maximum time to wait for a connection attempt to a server to succeed. 设置最大值来等待一个连接尝试成功连接到一个服务器 如果serber 是和haproxy 在同一个LAN里,连接应该是立即的( 小于几毫秒). 无论如何, 这是一个很好的实践来覆盖一个或者多个TC…

Dan计划:重新定义人生的10000个小时 - 阮一峰的网络日志 Dan计划:重新定义人生的10000个小时…

Happy Matt Friends Time Limit: 6000/6000 MS (Java/Others)    Memory Limit: 510000/510000 K (Java/Others) Problem Description Matt has N friends. They are playing a game together. Each of Matt’s friends has a magic number. In the game, Matt selects so…

sy@sy-Aspire-:~$ .0_155965261/configuration/.log !SESSION -- ::39.595 ----------------------------------------------- eclipse.buildId=I20110613- java.version=1.6.0_35 java.vendor=Sun Microsystems Inc. BootLoader constants: OS=linux, ARCH=x86_64, WS=g…

今天在做EXCEL打印读取模板时报错了,错误信息如下: Microsoft Excel cannot access the file 'D:\xx.xlsx'. There are several possible reasons: • The file name or path does not exist. • The file is being used by another program. • The workbook you are trying to save has the sa…

前两天面试3面学长问我的这个问题(想说TEG的3个面试学长都是好和蔼,希望能完成最后一面,各方面原因造成我无比想去鹅场的心已经按捺不住了),这个问题还是建立最小堆比较好一些. 先拿10000个数建堆,然后一次添加剩余元素,如果大于堆顶的数(10000中最小的),将这个数替换堆顶,并调整结构使之仍然是一个最小堆,这样,遍历完后,堆中的10000个数就是所需的最大的10000个.建堆时间复杂度是O(mlogm),算法的时间复杂度为O(nmlogm)(n为10亿,m为10000). 优化的方法:可以把…