<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0"><channel><atom:link rel="hub" href="http://tumblr.superfeedr.com/" xmlns:atom="http://www.w3.org/2005/Atom"/><description>A Taken 30yo SW engineer, a sitcom fanatic, an amateur artist and a bison from North Dakota State University.</description><title>Perceptions + dietCoke</title><generator>Tumblr (3.0; @perceptions)</generator><link>http://nestorbenavidez.com/</link><item><title>What about Liferay Sync? Nice, hmm?</title><description>&lt;a href="http://www.liferay.com/products/liferay-sync/features"&gt;What about Liferay Sync? Nice, hmm?&lt;/a&gt;</description><link>http://nestorbenavidez.com/post/16882922347</link><guid>http://nestorbenavidez.com/post/16882922347</guid><pubDate>Wed, 01 Feb 2012 16:15:54 -0600</pubDate></item><item><title>MDIChild form from an MDIChild form in C #</title><description>&lt;p&gt;I was working in a MDI Desktop Application, and I was looking for a way to open a new form (send some parameters) and make this new form a child of my MDIControl Form or main Form. I didn’t have to much luck looking around for an answer on Forums so here I post a very simple solution that I came up with.&lt;/p&gt;
&lt;blockquote&gt;

&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_lypd5csfFH1qz9lvr.png"/&gt;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;I hope this help someone in need out there :)&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/16855353368</link><guid>http://nestorbenavidez.com/post/16855353368</guid><pubDate>Wed, 01 Feb 2012 00:59:00 -0600</pubDate><category>c sharp</category><category>microsoft</category><category>programming</category><category>job</category></item><item><title>Steve Jobs 1955-2011</title><description>&lt;a href="http://blog.laptopmag.com/steve-jobs-politicians-celebrities-and-luminaries-react"&gt;Steve Jobs 1955-2011&lt;/a&gt;: &lt;p&gt;&lt;img src="http://files.myopera.com/nhattm/albums/402429/Steve%20Jobs%20and%20Steve%20Wozniak.jpg" height="286" width="496"/&gt;&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/11094019134</link><guid>http://nestorbenavidez.com/post/11094019134</guid><pubDate>Thu, 06 Oct 2011 01:46:42 -0500</pubDate></item><item><title>"Get a chicken, hijack its DNA, and stand back!"</title><description>“Get a chicken, hijack its DNA, and stand back!”&lt;br/&gt;&lt;br/&gt; - &lt;em&gt;&lt;a href="http://www.wired.com/magazine/2011/09/ff_chickensaurus/" target="_blank"&gt;How to Hatch a Dinosaur | Magazine&lt;/a&gt;&lt;/em&gt;</description><link>http://nestorbenavidez.com/post/10777296520</link><guid>http://nestorbenavidez.com/post/10777296520</guid><pubDate>Wed, 28 Sep 2011 15:50:27 -0500</pubDate></item><item><title>Backing up files in Windows with a .bat file</title><description>&lt;p&gt;I was asked to write a batch file or script to backup some files in one of the servers. Here I attached an image of the batch file. It used xcopy and /I if the destination does’t exist and there is more than one file to copy assume that is a folder, /E Copy directories and and subdirectories, including empty ones. You set up the scheduler to run this batch one a day and voila! I hope this can help someone out there.&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_lr9nmrkE1K1qz9lvr.png"/&gt;&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/9999402369</link><guid>http://nestorbenavidez.com/post/9999402369</guid><pubDate>Fri, 09 Sep 2011 12:38:00 -0500</pubDate><category>windows</category><category>work</category><category>job</category><category>batch</category><category>bat</category><category>backup</category><category>programming</category></item><item><title>Rework - by the 37 signals' guys</title><description>&lt;p&gt;&lt;img alt="ReWork Book" src="http://1.bp.blogspot.com/_p3CZftDmtHM/TA8YaK9bS5I/AAAAAAAAACI/kUtmn5C5qKk/s320/IMG_3955.JPG" height="320" width="240"/&gt;&lt;/p&gt;
&lt;p&gt;I was reading rework a few weeks ago, I just got the time to finish it today morning. Interesting stuff, if you have the time and interest in Biz topics Rework is a fresh and controversial alternative.&lt;/p&gt;
&lt;p&gt;I’m not a biz guy myself, but after work in freelance projects for a while sometimes there is a necessity of understand topics that are covered in this book. It is fun to see how a technical team undergoes in this harsh field for a lot firms and does it so gracefully.&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/9039410319</link><guid>http://nestorbenavidez.com/post/9039410319</guid><pubDate>Wed, 17 Aug 2011 10:17:00 -0500</pubDate><category>book</category><category>work</category><category>fun</category><category>37 signals</category></item><item><title>Here is an answer based on a pattern of the robot in...</title><description>&lt;img src="http://26.media.tumblr.com/tumblr_lq1ip1AJep1qzn5s8o1_500.png"/&gt;&lt;br/&gt;&lt;br/&gt;&lt;p&gt;Here is an answer based on a pattern of the robot in Machinarium’s 5 in a row game… Via Lamkin. Good Luck!&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/9010942806</link><guid>http://nestorbenavidez.com/post/9010942806</guid><pubDate>Tue, 16 Aug 2011 16:36:00 -0500</pubDate><category>game</category><category>machinarium</category><category>fun</category><category>flash</category></item><item><title>Sorting Arrays by object attribute (C# / Ruby)</title><description>&lt;p&gt;I was working in one of the chef contest problems this morning and I found the need of sort an array by an object attribute, I thought it was pretty neat. Here I attached the code in C#&lt;/p&gt;
&lt;p&gt;The class:&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_lmfwaftBcT1qz9lvr.png"/&gt;&lt;/p&gt;
&lt;p&gt;Sorting the array… (yc is an array)&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_lmfwhaA8nr1qz9lvr.png"/&gt;&lt;/p&gt;
&lt;p&gt;The Ruby version :&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_lmfwsqDen61qz9lvr.png"/&gt;&lt;/p&gt;
&lt;p&gt;———————————————————————————————&lt;/p&gt;
&lt;p&gt;Note: Ages are unique as in the Codechef problem &lt;a href="http://www.codechef.com/JUNE11/problems/CTEAMS/" target="_blank"&gt;CTEAMS&lt;/a&gt;&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/6296852307</link><guid>http://nestorbenavidez.com/post/6296852307</guid><pubDate>Tue, 07 Jun 2011 16:54:00 -0500</pubDate><category>ruby</category><category>c sharp</category><category>programming</category><category>fun</category><category>codechef</category></item><item><title>CodeChef, Easy Factorial</title><description>&lt;h3&gt;All submissions for this problem are available.&lt;/h3&gt;
&lt;p&gt;The most important part of a GSM network is so called &lt;em&gt;Base Transceiver Station&lt;/em&gt; (&lt;em&gt;BTS&lt;/em&gt;). These transceivers form the areas called &lt;em&gt;cells&lt;/em&gt; (this term gave the name to the cellular phone) and every phone  connects to the BTS with the strongest signal (in a little simplified  view). Of course, BTSes need some attention and technicians need to  check their function periodically.&lt;/p&gt;
&lt;p&gt;The technicians faced a very interesting problem recently. Given a  set of BTSes to visit, they needed to find the shortest path to visit  all of the given points and return back to the central company building.  Programmers have spent several months studying this problem but with no  results. They were unable to find the solution fast enough. After a  long time, one of the programmers found this problem in a conference  article. Unfortunately, he found that the problem is so called  “Traveling Salesman Problem” and it is very hard to solve. If we have N BTSes to be visited, we can visit them in any order, giving us N! possibilities to examine. The function expressing that number is called factorial and can be computed as a product 1.2.3.4….N. The number is very high even for a relatively small N.&lt;/p&gt;
&lt;p&gt;The programmers understood they had no chance to solve the problem.  But because they have already received the research grant from the  government, they needed to continue with their studies and produce at  least &lt;em&gt;some&lt;/em&gt; results. So they started to study behavior of the factorial function.&lt;/p&gt;
&lt;p&gt;For example, they defined the function Z. For any positive integer N, Z(N) is the number of zeros at the end of the decimal form of number N!. They noticed that this function never decreases. If we have two numbers N&lt;sub&gt;1&lt;/sub&gt;&lt;N&lt;sub&gt;2&lt;/sub&gt;, then  Z(N&lt;sub&gt;1&lt;/sub&gt;) &lt;= Z(N&lt;sub&gt;2&lt;/sub&gt;).  It is because we can never “lose” any trailing zero by multiplying by  any positive number. We can only get new and new zeros. The function Z is very interesting, so we need a computer program that can determine its value efficiently.&lt;/p&gt;

&lt;h3&gt;Input&lt;/h3&gt;
&lt;p&gt;There is a single positive integer T on the first line of input (equal to about 100000). It stands for the number of numbers to follow. Then there are T lines, each containing exactly one positive integer number N,  1 &lt;= N &lt;= 1000000000.&lt;/p&gt;

&lt;h3&gt;Output&lt;/h3&gt;
&lt;p&gt;For every number N, output a single line containing the single non-negative integer Z(N).&lt;/p&gt;
&lt;h3&gt;Example&lt;/h3&gt;
&lt;p&gt;Sample Input:&lt;/p&gt;
&lt;pre&gt;6&lt;br/&gt;3&lt;br/&gt;60&lt;br/&gt;100&lt;br/&gt;1024&lt;br/&gt;23456&lt;br/&gt;8735373&lt;br/&gt;&lt;/pre&gt;
&lt;p&gt;Sample Output:&lt;/p&gt;
&lt;pre&gt;0&lt;br/&gt;14&lt;br/&gt;24&lt;br/&gt;253&lt;br/&gt;5861&lt;br/&gt;2183837&lt;br/&gt;&lt;br/&gt;&lt;/pre&gt;
&lt;h3&gt;Answer in Ruby&lt;/h3&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_lm6ocmCvLv1qz9lvr.png"/&gt;&lt;/p&gt;

&lt;pre&gt;&lt;/pre&gt;</description><link>http://nestorbenavidez.com/post/6119710744</link><guid>http://nestorbenavidez.com/post/6119710744</guid><pubDate>Thu, 02 Jun 2011 17:12:58 -0500</pubDate><category>fun</category><category>programming</category><category>ruby</category><category>codechef</category></item><item><title>JRuby 1.6.2 + Netbeans 7 + Windows 7</title><description>&lt;p&gt;As everyone knows now, there is not official support for ruby in the new &lt;a href="http://netbeans.org/" target="_blank"&gt;Netbeans 7&lt;/a&gt;. That’s sad, but there is a way (at your own risk) that we can make this combo works:&lt;/p&gt;
&lt;p&gt;1. Click Tools &gt; Settings Tab &gt; Add&lt;/p&gt;
&lt;p&gt;2. Set name to “beta 1”&lt;/p&gt;
&lt;p&gt;3. Set URL to ‘http://updates.netbeans.org/netbeans/updates/7.0/uc/beta/stable/catalog.xml.gz’&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_llv6gzUueQ1qz9lvr.png"/&gt;&lt;/p&gt;
&lt;p&gt;4. Press ‘OK’ and click on available plugins tab, reload catalog.&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_llv6k52GtR1qz9lvr.png"/&gt;&lt;/p&gt;
&lt;p&gt;5. Install Ruby and Rails&lt;/p&gt;
&lt;p&gt;6. Download and Install &lt;a href="http://jruby.org.s3.amazonaws.com/downloads/1.6.2/jruby_windows_1_6_2.exe" target="_blank"&gt;Jruby&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_llv6npyBSi1qz9lvr.png"/&gt;&lt;/p&gt;
&lt;p&gt;7. Restart Netbeans and create a new Ruby Application, on Ruby Platform, click on ‘Manage’ and search for bin/Jruby.exe on your Jruby folder&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_llv6sloWSH1qz9lvr.png"/&gt;&lt;/p&gt;
&lt;p&gt;8. You are ready to try, here is a shot of my Hello world program. Enjoy!&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_llv6tzWO6o1qz9lvr.png"/&gt;&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/5901383095</link><guid>http://nestorbenavidez.com/post/5901383095</guid><pubDate>Fri, 27 May 2011 12:20:00 -0500</pubDate><category>java</category><category>netbeans</category><category>programming</category><category>ruby</category><category>microsoft</category></item><item><title>Is my childForm already running in MDIForm(parent)? (C#)</title><description>&lt;p&gt;I want to run one childForm a kind to run once at a time, here is a way  to verify id there is another one already running. I used to do that because I don’t want my users to open two Forms of the same kind at the time because they found it confusing at a time.&lt;/p&gt;
&lt;p&gt;This code is inside my MDI parent Form:&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_llrqebXisw1qz9lvr.png"/&gt;&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/5841565458</link><guid>http://nestorbenavidez.com/post/5841565458</guid><pubDate>Wed, 25 May 2011 15:33:00 -0500</pubDate><category>c sharp</category><category>job</category><category>microsoft</category><category>programming</category></item><item><title>Is my program already running? (C#)</title><description>&lt;p&gt;Sometimes to protect data integrity, specially if we are accessing a remote DB. I just want one instance of my program running, here is a way to determinate the number of processes running. Be careful where you write this piece of code. I added it up to program.cs.&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_llrgunWLCe1qz9lvr.png"/&gt;&lt;/p&gt;
&lt;p&gt;The form is not on production yet, but it works checking your processes!&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/5835285551</link><guid>http://nestorbenavidez.com/post/5835285551</guid><pubDate>Wed, 25 May 2011 11:15:00 -0500</pubDate><category>c sharp</category><category>job</category><category>programming</category><category>microsoft</category></item><item><title>CodeChef, Medium Prime Generator Prime1</title><description>&lt;h3&gt;All submissions for this problem are available.&lt;/h3&gt;
&lt;p&gt;Shridhar wants to generate some prime numbers for his cryptosystem. Help him!&lt;br/&gt; Your task is to generate all prime numbers between two given numbers.&lt;/p&gt;
&lt;h3&gt;Input&lt;/h3&gt;
&lt;p&gt;The first line contains t, the number of test cases (less then or equal to 10).&lt;/p&gt;
&lt;p&gt;Followed by t lines which contain two numbers m and n (1 &lt;= m &lt;= n &lt;= 1000000000, n-m&lt;=100000) separated by a space.&lt;/p&gt;
&lt;h3&gt;Output&lt;/h3&gt;
&lt;p&gt;For every test case print all prime numbers p such that m &lt;= p &lt;= n,&lt;br/&gt; one number per line.  Separate the answers for each test case by an empty line.&lt;/p&gt;
&lt;h3&gt;Example&lt;/h3&gt;
&lt;pre&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;br/&gt;2&lt;br/&gt;1 10&lt;br/&gt;3 5&lt;br/&gt;&lt;br/&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;br/&gt;2&lt;br/&gt;3&lt;br/&gt;5&lt;br/&gt;7&lt;br/&gt;&lt;br/&gt;3&lt;br/&gt;5&lt;br/&gt;&lt;/pre&gt;
&lt;p&gt;&lt;strong&gt;Warning: large Input/Output data, be careful with certain languages (though most should be OK if the algorithm is well designed)&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;I came up with this &lt;strike&gt;answer&lt;/strike&gt;, but It is giving me a runtime error, the problem is that my method for checking the prime takes to much memory, I’ll work on it over the weekend. The algorithm should be fine, I saw several answers with similar Algos, altho none of them in Ruby.&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_ll6ksh4NSw1qz9lvr.png"/&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;&lt;br/&gt;&lt;/strong&gt;&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/5476194832</link><guid>http://nestorbenavidez.com/post/5476194832</guid><pubDate>Sat, 14 May 2011 05:22:00 -0500</pubDate><category>ruby</category><category>programming</category><category>codechef</category><category>fun</category></item><item><title>CodeChef, Peer Problem 1</title><description>&lt;h3&gt;All submissions for this problem are available.&lt;/h3&gt;
&lt;p&gt;Reversed number is a number written in arabic numerals but the order of digits is reversed.  The first digit becomes last and vice versa. For example, if the number is 1245,it will become  5421 .Note that all the leading zeros are omitted. That means if the number ends with a zero,   the zero is lost by reversing (e.g. 1200 gives 21). Also note that the reversed number never has  any trailing zeros. Your task is to add two reversed numbers and output their reversed sum. Of   course, the result is not unique because any particular number is a reversed form of several   numbers (e.g. 21 could be 12, 120 or 1200 before reversing). Thus we must assume that no zeros   were lost by reversing (e.g. assume that the original number was 12).&lt;/p&gt;
&lt;h3&gt;Input&lt;/h3&gt;
&lt;p&gt;The input consists of N cases (equal to about 10000). The first line of the input contains   only positive integer N. Then follow the cases. Each case consists of exactly one line with   two positive integers separated by space. These are the reversed numbers you are to add.&lt;/p&gt;
&lt;h3&gt;Output&lt;/h3&gt;
&lt;p&gt;For each case, print exactly one line containing only one integer - the reversed sum of   two reversed numbers. Omit any leading zeros in the output.&lt;/p&gt;
&lt;h3&gt;Example&lt;/h3&gt;
&lt;pre&gt;&lt;strong&gt;Input:&lt;/strong&gt;&lt;br/&gt;1&lt;br/&gt;24 1&lt;br/&gt;&lt;br/&gt;&lt;strong&gt;Output:&lt;/strong&gt;&lt;br/&gt;34&lt;br/&gt;&lt;br/&gt;&lt;br/&gt;&lt;/pre&gt;
&lt;h3&gt;Answer in Ruby&lt;/h3&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_llvkc4tno51qz9lvr.png"/&gt;&lt;/p&gt;
&lt;pre&gt;&lt;br/&gt;&lt;/pre&gt;</description><link>http://nestorbenavidez.com/post/5475164471</link><guid>http://nestorbenavidez.com/post/5475164471</guid><pubDate>Sat, 14 May 2011 03:48:00 -0500</pubDate><category>codechef</category><category>ruby</category><category>programming</category><category>fun</category></item><item><title>9rules, independent bloggers</title><description>&lt;a href="http://9rules.com/"&gt;9rules, independent bloggers&lt;/a&gt;</description><link>http://nestorbenavidez.com/post/5460405921</link><guid>http://nestorbenavidez.com/post/5460405921</guid><pubDate>Fri, 13 May 2011 16:59:45 -0500</pubDate></item><item><title>From DB to datagridview, no wizards allowed</title><description>&lt;p&gt;&lt;br/&gt;I was looking for an easy way to populate my datagridview, keeping my column headers and without playing around with the properties too much. Here i wrote a method that grab data from a DB, and I used it here to pass it through the screen.&lt;br/&gt;&lt;br/&gt;First, I get the data from the DB to a Dataset, so I use a Datatable to order my data and then I used a double for-loop to fill the DGV up.&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_ll6dmoh5mU1qz9lvr.png"/&gt;&lt;/p&gt;
&lt;p&gt;The only thing missing here is the method inside ConnTool that I used to run my query, here I add a pic of it.&lt;/p&gt;
&lt;p&gt;&lt;img src="http://media.tumblr.com/tumblr_ll5bhqzDgc1qz9lvr.png"/&gt;&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/5454687674</link><guid>http://nestorbenavidez.com/post/5454687674</guid><pubDate>Fri, 13 May 2011 13:05:00 -0500</pubDate><category>C sharp</category><category>job</category><category>programming</category><category>.net</category></item><item><title>Well, I just started to work for the government this week (INTA...</title><description>&lt;img src="http://24.media.tumblr.com/tumblr_ll54wdrsIv1qzn5s8o1_500.png"/&gt;&lt;br/&gt;&lt;br/&gt;&lt;p&gt;Well, I just started to work for the government this week (INTA - Nicaraguan Institute of Agro-Technology ). It is not my first experience working for the Nicaraguan government, I used to work for DGI. DGI is the Nicaraguan version of the IRS (When I use my DGI T-shirt sure as hell I still get very good service at restaurants :) ). So, everything is going nice at my new job: Friendly ppl, small department, and everything is done from scratch! Now, I will be upgrading and updating some of the systems. Did you see the little and cute icon in the top of the screen? That´s  a &lt;a href="http://en.wikipedia.org/wiki/FoxPro_2" target="_blank"&gt;Foxpro 2&lt;/a&gt; program ppl! We are talking 1991, I was like 11 years old at that time. So, I have to migrate this systems to .NET. I like it: redesign, implement and test, and everything in between. Very cool projects!&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/5451739761</link><guid>http://nestorbenavidez.com/post/5451739761</guid><pubDate>Fri, 13 May 2011 10:45:40 -0500</pubDate><category>job</category><category>work</category><category>.net</category><category>foxpro</category><category>microsoft</category></item><item><title>Emancipate yourselves!! I love tattoos. I had been thinking...</title><description>&lt;img src="http://24.media.tumblr.com/ZpTxFL19Wbcjdan2NrFQ1OTL_500.jpg"/&gt;&lt;br/&gt;&lt;br/&gt;&lt;p&gt;Emancipate yourselves!! I love tattoos. I had been thinking about getting one, actually I’m thinking about it too much. Maybe a religious tattoo like a David’s star or something like that, maybe something (like a quote) in hebrew.&lt;/p&gt;
&lt;p&gt;I found this pic browsing at Flikr, and just loved the expression on her face, so confident… The colors on the tattoos are amazing also, well her skin is very beautiful, nice canvas.&lt;/p&gt;</description><link>http://nestorbenavidez.com/post/42048349</link><guid>http://nestorbenavidez.com/post/42048349</guid><pubDate>Sat, 12 Jul 2008 20:46:00 -0500</pubDate><category>beautiful</category><category>tattoos</category><category>girl</category></item></channel></rss>

