Lightoj 1024 - Eid
摘要:求n个数的最小公倍数。 得用 手动释放内存...
阅读全文
posted @
2016-06-29 23:59
Beserious
阅读(290)
推荐(0) 编辑
Lightoj 1023 - Discovering Permutations
摘要:1023 - Discovering Permutations PDF (English) Statistics Forum Time Limit: 0.5 second(s) Memory Limit: 32 MB In this problem you have to find the perm
阅读全文
posted @
2016-06-28 14:59
Beserious
阅读(409)
推荐(0) 编辑
Tju 4119. HDFS
摘要:In HDFS( Hadoop Distributed File System), each data may have a lot of copies in case of data lose.This problem, every data has its own id, from 1 to n
阅读全文
posted @
2016-06-25 23:39
Beserious
阅读(327)
推荐(0) 编辑
Lightoj 1020 - A Childhood Game
摘要:Allice先拿,最后拿球的输。 Bob先拿,最后拿球的赢。 考虑Alice先拿球,当n=1时 Alice输 记dp[1]=0; n=2, dp[2]=1 n=3, dp[3]=1 因为n=1,2的时候先手是A,所以A可以通过选一个还是两个球使得B在n=2,3时输。 n=4, dp[4]=0 因为n
阅读全文
posted @
2016-06-25 00:24
Beserious
阅读(244)
推荐(0) 编辑
Lightoj 1018 - Brush (IV)
摘要:1018 - Brush (IV) PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Mubashwir returned home from the contest and got angry af
阅读全文
posted @
2016-06-22 21:40
Beserious
阅读(298)
推荐(0) 编辑
Lightoj 1017 - Brush (III)
摘要:1017 - Brush (III) PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Samir returned home from the contest and got angry after
阅读全文
posted @
2016-06-20 21:27
Beserious
阅读(241)
推荐(0) 编辑
Knn算法C++实现
摘要:相对简单的模拟。C++11 训练数据: 0 0 0 0 0 very_low0.08 0.08 0.1 0.24 0.9 High0.06 0.06 0.05 0.25 0.33 Low0.1 0.1 0.15 0.65 0.3 Middle0.08 0.08 0.08 0.98 0.24 Low0
阅读全文
posted @
2016-06-20 20:26
Beserious
阅读(1901)
推荐(0) 编辑
Lightoj 1016 - Brush (II)
摘要:After the long contest, Samee returned home and got angry after seeing his room dusty. Who likes to see a dusty room after a brain storming programmin
阅读全文
posted @
2016-06-19 20:09
Beserious
阅读(285)
推荐(0) 编辑
Lightoj 1014 - Ifter Party
摘要:I have an Ifter party at the 5th day of Ramadan for the contestants. For this reason I have invited C contestants and arranged P piaju's (some kind of
阅读全文
posted @
2016-06-18 23:00
Beserious
阅读(252)
推荐(0) 编辑
Lightoj 1011 - Marriage Ceremonies
摘要:You work in a company which organizes marriages. Marriages are not that easy to be made, so, the job is quite hard for you. The job gets more difficul
阅读全文
posted @
2016-06-15 07:38
Beserious
阅读(442)
推荐(0) 编辑
Lightoj 1010 - Knights in Chessboard
摘要:1010 - Knights in Chessboard PDF (English) Statistics Forum Time Limit: 1 second(s) Memory Limit: 32 MB Given an m x n chessboard where you want to pl
阅读全文
posted @
2016-06-13 21:44
Beserious
阅读(861)
推荐(0) 编辑
HDU 2512 一卡通大冒险(dp)
摘要:一卡通大冒险 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2137 Accepted Submission(s): 1430 Problem
阅读全文
posted @
2016-06-12 21:27
Beserious
阅读(251)
推荐(0) 编辑
Lightoj 1009 - Back to Underworld
摘要:1009 - Back to Underworld PDF (English) Statistics Forum Time Limit: 4 second(s) Memory Limit: 32 MB The Vampires and Lykans are fighting each other t
阅读全文
posted @
2016-06-12 16:30
Beserious
阅读(343)
推荐(0) 编辑
Lightoj 1007 - Mathematically Hard
摘要:1007 - Mathematically Hard PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 64 MB Mathematically some problems look hard. But with
阅读全文
posted @
2016-06-10 19:58
Beserious
阅读(385)
推荐(0) 编辑
Lightoj 1006 Hex-a-bonacci
摘要:Given a code (not optimized), and necessary inputs, you have to find the output of the code for the inputs. The code is as follows: int a, b, c, d, e,
阅读全文
posted @
2016-06-10 11:05
Beserious
阅读(311)
推荐(0) 编辑
Lightoj 1005 Rooks(DP)
摘要:A rook is a piece used in the game of chess which is played on a board of square grids. A rook can only move vertically or horizontally from its curre
阅读全文
posted @
2016-06-09 16:18
Beserious
阅读(440)
推荐(0) 编辑
Lightoj 1004 - Monkey Banana Problem
摘要:1004 - Monkey Banana Problem PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB You are in the world of mathematics to solve t
阅读全文
posted @
2016-06-08 11:17
Beserious
阅读(597)
推荐(0) 编辑
Lightoj 1003 - Drunk(拓扑排序)
摘要:One of my friends is always drunk. So, sometimes I get a bit confused whether he is drunk or not. So, one day I was talking to him, about his drinks!
阅读全文
posted @
2016-06-07 20:41
Beserious
阅读(290)
推荐(0) 编辑
Lightoj 1002 - Country Roads(prim算法)
摘要:I am going to my home. There are many cities and many bi-directional roads between them. The cities are numbered from 0 to n-1 and each road has a cos
阅读全文
posted @
2016-06-06 19:27
Beserious
阅读(310)
推荐(0) 编辑
SRM691 Sunnygraphs2
摘要:Problem Statement Hero has just constructed a very specific graph. He started with n isolated vertices, labeled 0 through n-1. For each vertex i Hero
阅读全文
posted @
2016-06-01 21:12
Beserious
阅读(225)
推荐(0) 编辑