hackercup

Title Link: https://www.facebook.com/hackercup/problems.php?pid=688426044611322round=344496159068801The main topic: Two kinds of win, one is called Stress-free, the other is called stressful. Ask you what the number of stress-free and stressful will be given for the final result.Established status: Dp[i][j] represents the score for I-J when the number of stress-free, a state shift: dp[i][j] = dp[i-1][j]+dp[i][j-1]Because if the score is i-1:j, then we

Title Link: https://www.facebook.com/hackercup/problems.php?pid=313229895540583round=344496159068801The main idea: see for yourself (in fact I don't know)Bare trie tree, directly see if there is a node that must be inserted.The code is too lame. Let's see.1#include 2#include 3#include 4#include 5#include 6 using namespacestd;7 #defineCHARSET 268 9 Const intMax_node =10000000;Ten One structtrienode{ A intCh[charset]; - }; - Trienode Trie[max_node]

; [2,4,6]60 Character Resolution FizzbuzzA short time ago Jeff Atwood promoted a simple programming exercise called Fizzbuzz, which referred to the following questions:Write a program that prints the number 1 to 100, 3 multiples print "Fizz" to replace this number, 5 multiples print "Buzz", for a number that is both a multiples of 3 and a multiples of 5 to print "Fizzbuzz".Here is a short, interesting way to solve this problem:For x in range (101):p rint "Fizz" [x%3*4::]+ "Buzz" [X%5*4::]or XCol

Original question:pid=688426044611322round=344496159068801 ">https://www.facebook.com/hackercup/problems.php?pid= 688426044611322round=344496159068801Test instructions: You play football with a friend, the score starts at 0-0, and you always win. And you have two main ways to win, the first stressfree way you must be in the first ball and always higher than your friends score, another way of stressfull in addition to your friends to reach the end of t

print x[::2]>>> [1,3,5] #偶数项print x[1::2]>>> [2,4,6] 60 Character Resolution Fizzbuzz A short time ago Jeff Atwood promoted a simple programming exercise called Fizzbuzz, which referred to the following questions: Write a program that prints the number 1 to 100, 3 multiples print "Fizz" to replace this number, 5 multiples print "Buzz", for a number that is both a multiples of 3 and a multiples of 5 to print "Fizzbuzz". Here is a short, interesting way to solve this problem: For x in ra

; [,] # The last three print x [-3:] >>>>, 6] # print x [: 2] >>> [1, 3, 5] # print x [1: 2] >>>> [2, 4, 6] Fix FizzBuzz with 60 characters Some time ago, Jeff Atwood promoted a simple programming exercise called FizzBuzz. The problem is referenced as follows: Write a program, print the numbers 1 to, and print "Fizz" in multiples of 3 to replace this number, and print "Buzz" in multiples of 5 ", print "FizzBuzz" for numbers that are multiples of 3 and multiples of 5 ". Here is a short and inter

list subset. X = [1, 2, 3, 4, 5, 6] # The first three print x [: 3] >>> [1, 2, 3] # four print x []> [,] # The last three print x [3:] >>>, 6] # print x [: 2] >>> [1, 3, 5] # print x [1: 2] >>>> [2, 4, 6]Fix FizzBuzz with 60 characters Some time ago, Jeff Atwood promoted a simple programming exercise called FizzBuzz. The problem is referenced as follows: Write a program, print the numbers 1 to, and print "Fizz" in multiples of 3 to replace this number, and print "Buzz" in multiples of 5 ", prin

;>>> [2, 4, 6] Fix FizzBuzz with 60 characters Some time ago, Jeff Atwood promoted a simple programming exercise called FizzBuzz. The problem is referenced as follows: Write a program, print the numbers 1 to, and print "Fizz" in multiples of 3 to replace this number, and print "Buzz" in multiples of 5 ", print "FizzBuzz" for numbers that are multiples of 3 and multiples of 5 ". Here is a short and interesting way to solve this problem: for x in range(101):print"fizz"[x%3*4::]+"buzz"[x%5*4::]o

Original title: https://www.facebook.com/hackercup/problems.php?pid=759650454070547round=344496159068801Test instructions: Given a root tree, the nodes in the lower layer of the tree to give the upper node gifts, the root node of the gift to the charity, but the gift of a condition is that you can not send your parent node has been sent gifts. Ask for the minimum cost of meeting the requirements.Solution: This problem card for a period of time, simila

Types of vegetarian factors:For an n, what is his total number of elements? Facebook Hackercup Round1 Homework question, 10ptsUse Sieve method, then p[j]=i->p[j]++int getprimefactortypetimes (int n) { memset (p, 0, sizeof p); for (int i=2;2*iTypes of vegetarian factors:For a n, what is the total number of his factors? Codeforces Http://codeforces.com/contest/546/problem/DThe first sieve method to calculate a factor of each j, as long as any one

http://blog.csdn.net/pipisorry/article/details/45830941Collection Library CollectionSome special use cases, counter are very practical in some situations. If you've been in this year's Facebook Hackercup, you can even find out what's practical about him.From collections Import CounterPrint Counter ("Hello")>>> Counter ({' L ': 2, ' h ': 1, ' E ': 1, ' O ': 1})Iterative Tools Library ItertoolsAs with the collections library, there is a library called

subset of the list. x = [1,2,3,4,5,6] #前3个 print X[:3] >>> [1,2,3] #中间4个 print X[1:5] >>> [ 2,3,4,5] #最后3个 print x[-3:] >>> [4,5,6] #奇数项 print x[::2] >>> [ 1,3,5] #偶数项 print x[1::2] >>> [2,4,6] 60 characters to solve Fizzbuzz Some time ago Jeff Atwood promoted a simple programming exercise called Fizzbuzz, citing the following questions: Write a program that prints numbers 1 to 100, multiples of 3, prints "fizz" to replace this number, 5 multiples print "Buzz", and Prints "fizz