Re: Report Abuse: Cheat Malware Hack Site
Thanks for the report, this project has been dealt with. Lennard On Friday, December 14, 2012 10:50:02 AM UTC-5, Neosankyo wrote: http://cftool.googlecode.com/ The page referring downloads to this site is: http://www.cfpro.biz/p/cfpro-download.html Download link: http://cftool.googlecode.com/files/CFPRO.rar The website using your service is providing third party programs/cheat for an online game CrossFire. The cheat is widely spread and provided by these sites and is affecting all game versions/ servers of the game, namely Philippines, Vietnam, North America and more. The application also includes a malware detected by AVG/ AVIRA. -- You received this message because you are subscribed to the Google Groups Project Hosting on Google Code group. To view this discussion on the web visit https://groups.google.com/d/msg/google-code-hosting/-/fdeCAOn03J4J. To post to this group, send email to google-code-hosting@googlegroups.com. To unsubscribe from this group, send email to google-code-hosting+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/google-code-hosting?hl=en.
[gcj] Re: SPOJ buying apples ,Knapsack
Test cases of the problem are not testing this condition: he will not buy more than n packets of apples. I got a success without putting check for this condition. On Saturday, 15 December 2012 19:39:34 UTC+5:30, Marti wrote: I am having trouble figuring out the reccurrence for the following on SPOJ which I believe is a Knapsack DP problem.Please help me. http://www.spoj.com/problems/ABA12C/ -- You received this message because you are subscribed to the Google Groups Google Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msg/google-code/-/9SX_6gBpceEJ. For more options, visit https://groups.google.com/groups/opt_out.
[gcj] SPOJ - ONEZERO - WA :(
I am trying to solve http://www.spoj.com/problems/ONEZERO/ I referred so many internet posts about this, and they all talk about storing reminders and building a tree. I am running a simple BFS, nothing else... But this gets me WA :( http://ideone.com/SZDn5T Dont know whats wrong with this code. Please help me fix it. -- You received this message because you are subscribed to the Google Groups Google Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
Re: [gcj] SPOJ - ONEZERO - WA :(
Hi thefourtheye dIVi, Basically your idea is correct and this problem can be solved using BFS. However, it is not sufficient to use unsigned long long to solve this problem because the answer to 19998 is 0 which is much larger than the maximum number that could be represented using unsigned long long. One more thing to note, you can keep track of all the possible remainder and no need to process the remainder that has appeared before. The reason for that is left for your exercise. :) Here is the accepted code which I adapted from yours. http://ideone.com/7ziUxy If you have any more questions, fell free to ask. Parker On 2012/12/16 22:42, thefourtheye dIVi wrote: I am trying to solve http://www.spoj.com/problems/ONEZERO/ I referred so many internet posts about this, and they all talk about storing reminders and building a tree. I am running a simple BFS, nothing else... But this gets me WA :( http://ideone.com/SZDn5T Dont know whats wrong with this code. Please help me fix it. -- You received this message because you are subscribed to the Google Groups Google Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out. -- You received this message because you are subscribed to the Google Groups Google Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
[gcj] optimized algo for LCS0
hey can any one tell me the optimized method of solving LCS problem. I hv optimized still it show TLE... here is the link www.spoj.com/problems/LCS0/ -- You received this message because you are subscribed to the Google Groups Google Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msg/google-code/-/v4Fmk_-athsJ. For more options, visit https://groups.google.com/groups/opt_out.
Re: [gcj] optimized algo for LCS0
Check the links below. http://www.cc.gatech.edu/~ninamf/Algos11/lectures/lect0311.pdf http://en.wikibooks.org/wiki/Algorithm_implementation/Strings/Longest_common_subsequence -- You received this message because you are subscribed to the Google Groups Google Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
Re: [gcj] optimized algo for LCS0
Use brute-force methods to devise an algorithm, then and then, use dynamic programming techniques to tweak your code to achieve an optimized one, depending on what you want to do. On Sun, Dec 16, 2012 at 6:20 PM, Faisal Dirie vranz...@gmail.com wrote: Check the links below. http://www.cc.gatech.edu/~ninamf/Algos11/lectures/lect0311.pdf http://en.wikibooks.org/wiki/Algorithm_implementation/Strings/Longest_common_subsequence -- You received this message because you are subscribed to the Google Groups Google Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
Re: [gcj] optimized algo for LCS0
The concatenating of list(si) would have a size of O(mn) at worst case and even the O(n logn) algorithm for solving the longest increasing subsequence will not be fast enough. Please tell me I am wrong. =w= Parker On 2012/12/17 9:28, Luís Fernando Dorelli de Abreu wrote: Given the limits, those ideas are going to TLE I guess. You can get an idea of a reduction that might work here : http://www.cs.ucf.edu/courses/cap5510/fall2009/SeqAlign/LCS.efficient.pdf 2012/12/16 Faisal Dirie vranz...@gmail.com mailto:vranz...@gmail.com Use brute-force methods to devise an algorithm, then and then, use dynamic programming techniques to tweak your code to achieve an optimized one, depending on what you want to do. On Sun, Dec 16, 2012 at 6:20 PM, Faisal Dirie vranz...@gmail.com mailto:vranz...@gmail.com wrote: Check the links below. http://www.cc.gatech.edu/~ninamf/Algos11/lectures/lect0311.pdf http://www.cc.gatech.edu/%7Eninamf/Algos11/lectures/lect0311.pdf http://en.wikibooks.org/wiki/Algorithm_implementation/Strings/Longest_common_subsequence -- You received this message because you are subscribed to the Google Groups Google Code Jam group. To post to this group, send email to google-code@googlegroups.com mailto:google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com mailto:google-code%2bunsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out. -- You received this message because you are subscribed to the Google Groups Google Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out. -- You received this message because you are subscribed to the Google Groups Google Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
