上一页 1 2 3 4 5 6 ··· 8 下一页
摘要: Python入门的书并没有多少,但其实python也不需要特别像学习C语言一样一板一眼的学,完全可以通过写小程序或者看一些速成的教程(前提是你已经有了程序设计基础)学。我是通过Google Python Class进行学习,在这里记录一下学习笔记。====================================================================================Environment Ubuntu12.04 LTS 32-bitAuthor:majieGoogle Python class:https://code.google.com/.. 阅读全文
posted @ 2012-05-12 21:56 漂木 阅读(1284) 评论(0) 推荐(0) 编辑
摘要: 一直想写个小游戏什么的,俄罗斯方块是个不错的选择,遂在网上查找了相应资料。 这里推荐大郑同学写得教程(http://iask.sina.com.cn/u/2172782541/ish?folderid=567144) 很不错,一步一步循序渐进地讲解了俄罗斯方块需要的各个函数怎么实现。效果图(其实我基本上就是照着敲了大郑同学的做图的各个函数,略加入了少许自己的东西):代码太丑了,就不贴了。神化模式我的设想是让程序自己判定落在哪里合适,尝试用枚举写了一下,不过好像有些复杂,而且智商有点低。CSDN上有同学说要用到人工智能的一些知识(个人觉得不至于吧...),这个暂时不会。以后再研究。 阅读全文
posted @ 2012-05-12 18:33 漂木 阅读(1589) 评论(0) 推荐(0) 编辑
摘要: 1968: Common SubsequenceResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s4096K781227StandardA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a subse 阅读全文
posted @ 2012-05-08 10:35 漂木 阅读(186) 评论(0) 推荐(0) 编辑
摘要: 2511: Number triangleResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s65536K467233Standard 5 3 4 8 1 2 5 4 3 62 1 7 9 8A number trangle is composed of N(N<=100) line numbers, the i-th line contains i positive integers(<=100). A chess can walk from the top line ... 阅读全文
posted @ 2012-05-07 22:40 漂木 阅读(376) 评论(0) 推荐(0) 编辑
摘要: 1148: Prime CutsResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K1346447StandardA prime number is a counting number (1, 2, 3, ...) that is evenly divisible only by 1 and itself. In this problem you are to write a program that will cut some number of prime numbers from the list of prime numbe 阅读全文
posted @ 2012-05-06 20:24 漂木 阅读(216) 评论(0) 推荐(0) 编辑
摘要: 1196: GoldbachResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K2275745StandardIn 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:Every even number greater than 4 can be written as the sum of two odd prime num 阅读全文
posted @ 2012-05-06 19:11 漂木 阅读(387) 评论(0) 推荐(0) 编辑
摘要: 2573: Product of two primesResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s65536K929287Standard输出所有在10000 – 20000之间,恰好可以分解为两个素数乘积的整数。将这些数从小到大输出。Input无Output每一行输出一个符合要求的数,按照从小到大排列。下面是输出的头和尾,中间部分需自行计算10001.........19999Problem Source:skywindThis problem is used for contest:131Submit/Problem List/S 阅读全文
posted @ 2012-05-06 18:37 漂木 阅读(259) 评论(0) 推荐(0) 编辑
摘要: 1483: ExponentiationResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K365109StandardProblems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.This prob 阅读全文
posted @ 2012-05-05 23:02 漂木 阅读(222) 评论(0) 推荐(0) 编辑
摘要: 1920: JojerResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K784242StandardMr Jojer is a teacher, and he is crazy in programming, he wants the computer to do every thing for him, one day, one of his colleague Mr NEtiger asks him to write a procedure for him. But Mr Jojer has another difficult 阅读全文
posted @ 2012-05-04 22:20 漂木 阅读(326) 评论(0) 推荐(0) 编辑
摘要: 2154: Hungry RabbitsResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K1231423StandardA group of hungry rabbits had got a basket of carrots, but these carrots isn't enough for all the rabbits to stay alive. So they had a meeting to solve the problem. They determined to drive off some rabbi 阅读全文
posted @ 2012-05-03 22:33 漂木 阅读(328) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 ··· 8 下一页