lilisalo
- 浏览: 1109634 次
-
最新评论
-
560130911：
100w,你的代码也不行吧！数组不能定义太大
POJ 1207 HDOJ/HDU 1032 3n+1数链问题 绝对不水的解法 -
revice：
how did you solve this problem? ...
ffmpeg ffmpeg 音频采集发送命令,以及播放的结果－－－－－错误 -
shirne：
博主是用ubuntu吗
javascript 杂谈之哪种写法你更喜欢？ -
mzc200803：
加油，相信你明年会找份好工作的。
实习改变了我什么 -
该用户名已经存在：
java类的实例化探究
文章列表
Self Numbers
Source : ACM ICPC Mid-Central USA 1998
Time limit : 5 sec
Memory limit : 32 M
Submitted : 1119, Accepted : 448
In 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define d(n) to ...
- 2011-10-31 20:37
- 浏览 848
- 评论(0)
Ordered Fractions
Source : Unknown
Time limit : 3 sec
Memory limit : 32 M
Submitted : 1140, Accepted : 349
Consider the set of all reduced fractions between 0 and 1 inclusive with denominators less than or equal to N.
Here is the set when N = 5:
0/1 1/5 1/4 ...
- 2011-10-31 20:10
- 浏览 953
- 评论(0)
Prime Land
Source : ACM ICPC Central European Regional 1997
Time limit : 1 sec
Memory limit : 32 M
Submitted : 238, Accepted : 133
Everybody in the Prime Land is using a prime base number system. In this system, each positive integer x is represented as follows: ...
- 2011-10-31 19:57
- 浏览 808
- 评论(0)
分享Silverlight/WPF/Windows Phone一周学习导读(10月22日-10月29日)
本周Silverlight学习资源更新
【Silverlight】支持GB2312编码
Aimeast
Silverlight之out of Browser模式
KenshinCui
Silverlight的多媒体功能——音频和视频
daizhongkai0611
Silverlight中的InkPresenter(可以保存、加载)
wangyafei_it
框架页中Silverlight和Web页面之间跳转和返回
taomanm ...
- 2011-10-31 05:03
- 浏览 907
- 评论(0)
Virtual Dispatch
首先从字节码中对方法的调用说起。
java的bytecode中对方法的调用实现分为四种情况：
1.invokevirtual 为最常见的情况，包含virtual dispatch机制；
2.invokespecial是作为private和构造方法的调用，绕过了virtual dispatch；
3.invokeinterface的实现跟invokevirtual类似。
- 2011-10-31 04:40
- 浏览 1037
- 评论(0)
本文不涉及一些微妙蛋疼的语法比较, 关注的是宏观方面, 当然后期逐步更新如果, 如果觉得必要, 可能会加上.
议题之一: 初始化的比较
1．CPP基类的任何类构造函数会默认调用父类的不带参数的构造函数, 这点Java也是同样处理的. 子类调用父类的构造函数方式会不同, C++中这样做:
Son::Son(int id):Father(id) {
//Father(10); //注意，这样虽然编译通过，但事实上在构造一个Father类，完了( 出了作用域)之后就立即销毁. 危害非常之大.
cout<<"in Sonconstructor Son(int id ...
- 2011-10-30 22:22
- 浏览 748
- 评论(0)
Discount
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 89Accepted Submission(s): 70Problem Description
All the shops use discount to attract customers, but some shops doesn’t give direct discount on their goods, instead, they give discou ...
- 2011-10-30 20:45
- 浏览 849
- 评论(0)
土人比较落后，直到前几天才看了黑客帝国 = =。
真是很经典的片子，囊括了哲学和计算机科学。特别适合咱们程序员～其中许多思想都能真正跟AI对接吧～～
或许以前看不会感触那么深，包括the Matrix系统中“杀 ...
- 2011-10-30 10:56
- 浏览 1066
- 评论(0)
学计算机11年
从2000年进入大学至今学习计算机已经有11年余，本科的专业是计算机科学与技术，初接触计算机学的内容是c程序设计和汇编语言，好多专业术语都不懂，当时大家普遍感到吃力的很，因为之前并没有接触过计算机，没有学习过计算机基础，连基本的操作都不会，当时的计算机还没有现在这么普及。于是，在国庆节期间，找老师补习了几天的计算机基础，在前2-3个月学习汇编，和c程序设计，感觉都是似懂非懂，不懂的专业术语赶快找宿舍的冲哥问，随着时间流逝，慢慢才入了门。第一学期可以说是非常艰难。到了第二学期，我们开设的是数据结构，操作系统，由于在前一学期c语言没有学好，基础不扎实，数据结构用的是严蔚敏的教材，里 ...
- 2011-10-30 08:54
- 浏览 744
- 评论(0)
How Many Sets II
Time Limit: 2 Seconds
Memory Limit: 65536 KB
Given a set S = {1, 2, ..., n}, number m and p, your job is to count how many set
T satisfies the following condition:
T is a subset of S
|T| = m
T does not contain continuous numbers, that is to say x and
x+1 can not bot ...
- 2011-10-29 22:57
- 浏览 1027
- 评论(0)
How Many Sets I
Time Limit: 2 Seconds
Memory Limit: 65536 KB
Give a set S, |S| = n, then how many ordered set group (S1, S2, ..., Sk) satisfies S1 ∩ S2 ∩ ... ∩ Sk = ∅. (Si is a subset of S, (1 <=
i <= k))
Input
The input contains multiple cases, each case have 2 integers in one line ...
- 2011-10-29 22:54
- 浏览 1476
- 评论(0)
Little Keng
Time Limit: 2 Seconds
Memory Limit: 65536 KB
Calculate how many 0s at the end of the value below:
1n + 2n + 3n + ... + mn
Input
There are multiple cases. For each cases, the input containing two integers
m, n. (1 <= m <= 100 , 1 <= n <= 1000000)
Output
One lin ...
- 2011-10-29 22:52
- 浏览 820
- 评论(0)
Niven Numbers
Source : Unknown
Time limit : 1 sec
Memory limit : 32 M
Submitted : 4166, Accepted : 681
A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides ...
- 2011-10-29 20:19
- 浏览 618
- 评论(0)
How many N
Source : xy
Time limit : 15 sec
Memory limit : 32 M
Submitted : 5977, Accepted : 1136
Find a minimal interger K which is merely comprised of N and can be divided by M.
For example,11 is the minimal number that and be divided by 11, and it is compris ...
- 2011-10-28 20:38
- 浏览 664
- 评论(0)