_李宇-CSDN博客

原创 Project Euler Q5 解法

-- 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. -- What is the smallest positive number that is evenly divisible by all of the numbers fro

2014-05-21 01:14:10 1126

原创 Project Euler Q4 解法

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99. Find the largest palindrome made from the product of two 3-digit n

2014-05-21 00:57:26 699

原创 Project Euler Q3 解法

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99. Find the largest palindrome made from the product of two 3-digit n

2014-05-20 10:12:45 584

原创 Project Euler Q2 解法

原题 https://projecteuler.net/problem=2 Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8,

2014-05-19 12:53:44 838

原创 Project Euler Q1 解法

https://projecteuler.net/problem=1 If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multi

2014-05-19 12:26:27 894

原创大一 PROJECT REPORT#1 设计一个基于C的简单语言，并为其写编译器，汇编器，虚拟机

（*注，这个不是教程，只是项目报告，必须会汇编才能看懂，以后有时间我会写教程） SIMP-C语言现在是大一第二学期，跟着学校的进度，这学期用Scheme写了一个新的编程语言，叫SIMP，取义Simple Imperative Programming Language。觉得过程非常爽，同时也了解了机器底层的数据架构。现在这个学期快结束了，我想把这个SIMP语

2014-03-21 02:43:25 1726 1

转载 #英文版 CS145 1#

▼ CS 145 Lecture Summaries 1 Introduction 2 Racket 3 Sets 4 Functional Abstraction 5 Binary 6 Trees 7 Interpreters

2014-03-19 02:05:59 1689

原创 CS145 #序# //大一第一学期 lisp函数式编程

序 ←_← 这个题目好像广告... nah, 总之, 今天2013年9月, 我来到了University of Waterloo这个大神辈出的地方。数学系CS(Computer Science)专业, 之前没有编过任何程序, 但是怀着对这个事业的热爱和向往, 选课的时候毅然决然地选了CS145(advantage level)的自杀式科目。结果第一个期中得了8.5/40，惨挂，班里

2014-03-19 01:40:57 1364

滑铁卢大学渣