Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

疯狂TLE阿本地431 215都能很快拿到答案阿。。。郁闷

Posted by Asp at 2006-09-16 14:06:04 on Problem 2992

Followed by:

Re:疯狂TLE阿本地431 215都能很快拿到答案阿。。。郁闷 (9) Asp 2006-09-16 14:09:10
Re:疯狂TLE阿本地431 215都能很快拿到答案阿。。。郁闷 (12) ACM06019 2006-09-16 14:09:23
Re:疯狂TLE阿本地431 215都能很快拿到答案阿。。。郁闷 (57) ACM06019 2006-09-16 14:11:18
- 和你一样.. (65) Acsaga 2006-09-16 14:11:59
- Re:疯狂TLE阿本地431 215都能很快拿到答案阿。。。郁闷 (24) Csea 2006-09-16 14:14:40
- Re:疯狂TLE阿本地431 215都能很快拿到答案阿。。。郁闷 (103) janon 2006-09-16 14:23:33
- Re:疯狂TLE阿本地431 215都能很快拿到答案阿。。。郁闷 (17) tbaitm 2006-09-16 19:53:36
Re:me too... (0) Csea 2006-09-16 14:13:36
- maybe the algorithm is not right.talk about your algorithm.Re:me too... (0) ACM06019 2006-09-16 14:15:03
  - Re:maybe the algorithm is not right.talk about your algorithm.Re:me too... (15) Csea 2006-09-16 14:18:05
    - Re:maybe the algorithm is not right.talk about your algorithm.Re:me too... (37) ACM06019 2006-09-16 14:19:43
      - Re:maybe the algorithm is not right.talk about your algorithm.Re:me too... (34) janon 2006-09-16 14:24:48
900多MS才过, 那些300多MS的是如何做的啊 (0) daringQQ 2006-09-16 14:15:52
- Re:900多MS才过, 那些300多MS的是如何做的啊 (12) ACM06019 2006-09-16 14:20:18
- Re:900多MS才过, 那些300多MS的是如何做的啊 (10) Csea 2006-09-16 14:21:33
  - 就是把1到500的数的质因数先保存起来啊 (14) daringQQ 2006-09-16 14:36:32
    - Re:就是把1到500的数的质因数先保存起来啊 (9) Csea 2006-09-16 14:39:38
      - 如果k>n/2那么k=n-k; (13) daringQQ 2006-09-16 14:42:02
  - 比赛刚完就AC了,郁闷啊 (117) yiyiyi4321 2006-09-16 14:40:34
    - Re:比赛刚完就AC了,郁闷啊 (180) snuc 2006-09-16 15:51:49
- 用G++好象要快 (0) daringQQ 2006-09-16 14:22:14
  - 我的C++比G++要快，内存也小阿 (0) kevinew 2006-09-25 20:55:21
据说要优化啊优化...... (0) mixter 2006-09-16 14:23:19
- 那些快的内存都大一些.不知道要存些什么东西 (0) daringQQ 2006-09-16 14:24:21
  - 记录一个数的素因子分解情况 (2) honghu 2006-09-16 14:42:35
    - 你200MS怎么做出来地:) (6) daringQQ 2006-09-16 14:46:30
      - Re:你200MS怎么做出来地:) (44) honghu 2006-09-16 15:00:41
      - a[i][j] 表示 i! 中 j 的最高次幂 (0) sunmoonstar_love 2006-09-16 15:56:36
        能说说你的复杂度么？O( 质数个数 * Log431 ) 这个方法也会超么？质数个数为83 (0) forgotten 2006-09-16 17:02:46
        这种DP果然好啊 (0) ecjtunh 2006-09-16 17:28:26
    - rt (6) LiZhiXu 2006-09-16 14:49:41

Post your reply here:

Home Page Go Back To top

疯狂TLE阿 本地431 215都能很快拿到答案阿。。。 郁闷

疯狂TLE阿本地431 215都能很快拿到答案阿。。。郁闷