color version - PET: Python Entre Todos - Python Argentina

PET Challenge
Authors: Juanjo Conti y Alejandro Santos
In the previous PET issue we presented our first challenge: provide the shortest program
capable of factoring a number (taking some rules into account). We received a lot or
responses, the first ones around 500-characters long, the last ones squeezing every byte
out of the code to get the shortest solution.
From the 58 participants we had, we are proud to tell that we had 3 winners. What’s
more, their 111-character long solutions get the same results in different ways, cutting,
massaging and perfecting their original solutions.
The winners
Without further ado, the winners and their solutions are:
Chema Cortes with pet1-pych3m4.py:
n=input();d=1;r=""
while di:
c=0;i+=1
while 1>s%i:c+=1;s/=i
if c:_+=' x '+`i`+'^%i'%c*(c>1)
Oswaldo Hernández with pet1-hdzos.py:
n=input()
d,f="",1
while n>1:
f+=1;r=0
while n%f1)
Special mention
In this opportunity we have considered awarding the “most cheating” award to Darni,
that asked us not to rename his file “pet1-darni.py” but use his artistic pseudonym:
ZT1pbnB1dCgpCnM9JycKZD0xCndoaWxlIGU+MToKCXA9MDtkKz0xCgl3aGlsZSBlJWQ8MTplLz1kO
So this is the content of the file
pet1-ZT1pbnB1dCgpCnM9JycKZD0xCndoaWxlIGU+MToKCXA9MDtkKz0xCgl3aGlsZSBlJWQ8MTplL
import base64;exec(base64.decodestring(__file__[5:-3]))
Additional information about the competition can be found at
http://python.org.ar/pyar/Proyectos/RevistaPythonComunidad/PET1/Desafio
New challenge
This new challenge was written by Alejandro Santos, who loves problem solving and
spent the last week sending several puzzles to the PyAr list.
Thanks to Matías “Tuute” Bellone for his revision of the problem’s first draft.
The QQQ number
QQQ is the most popular social network of the Ainohtyp country. Microblogging-style
QQQ is a social network where users can only post the word “QQQ”. The users can also
have other users as contacts, but the other user has to do so too.
The network’s administrators built a list with the user sorted by the amount of contact.
Curly is at the top of the list with the most contacts.
Your job is to create a program that finds the minimum distance between each user and
Curly. That is, the minimum amount of hops between Curly and the rest of the users. If
there is more than one way, the shortest is chosen.
For example, lets say Curly is friends with Larry and Moe, Larry is friends with Sue and
Sue is friends with Curly. Sue has a distance of 1 with Curly and Larry and Moe have a
distance of 1 as well.
It is possible to get from Curly to Sue through Larry, but as Sue is friends with Curly the
minimum distance is 1. But if Howard is friends with Moe then the minimum distance
from Curly to Howard is 2 as you need to jump through Moe.
Input data
All data must be read through standard input.