KadeshiAmbassador

Stigle majice, super su!

Postavili su na kickstarter i deluje jako dobro http://www.kickstart...ve?ref=category

izvor tj reddit

Odgovaram na svoj post pa me izvinite, samo hocu da podelim ovo. Danas mi drugar poslao mail sa nekim predavanjima pa delim dalje: Predavanja pocinju u februaru a neka u Martu. Za februar jos uvek nisu pocela, mislim da pocinju od devetnaestog ili dvadesetog februara, no nisam sasvim siguran. Koliko sam shvatio, vecina ovih predavanja je razbijena u manje delove od po desetak minta ( 8 -12min) i izlazice dnevno. Ukupno ce biti oko 2 sata lekcija nedeljno. Vredi pogledati, mozda vam se nesto dopadne. Prijavite se ako vas neki zanima, odustati mozete i posle :p CS 101: http://www.cs101-class.org/ Machine Learning: http://jan2012.ml-class.org/ Software as a Service: http://www.saas-class.org/ Human-Computer Interaction: http://www.hci-class.org/ Natural Language Processing: http://www.nlp-class.org/ Game Theory: http://www.game-theory-class.org/ Probabilistic Graphical Models: http://www.pgm-class.org/ Criptography: http://www.crypto-class.org/ Design and Analysis of Algorithms I: http://www.algo-class.org/ Computer Security: http://www.security-class.org/ Anatomy: http://www.anatomy-class.org/ Making Green Buildings: http://www.greenbuilding-class.org/ Information Theory: http://www.infotheory-class.org/ Model thinking: http://www.modelthinker-class.org/ Ako sam zeznuo neki od linkova mozete naci na ostalim pri dnu strane. ------------------------------------ Pored toga imate i Google Code University: http://code.google.com/edu/ Nadam se da ce te videti.. mozda i da se prebaci topic u klejbezable? : )

https://www.cs50.net/ Introduction to the intellectual enterprises of computer science and the art of programming. This course teaches students how to think algorithmically and solve problems efficiently. Topics include abstraction, algorithms, encapsulation, data structures, databases, memory management, security, software development, virtualization, and websites. Languages include C, PHP, and JavaScript plus SQL, CSS, and HTML. Problem sets inspired by real-world domains of biology, cryptography, finance, forensics, and gaming. Designed for concentrators and non-concentrators alike, with or without prior programming experience. https://www.cs75.net/ Today's websites are increasingly dynamic. Pages are no longer static HTML files but instead generated by scripts and database calls. User interfaces are more seamless, with technologies like Ajax replacing traditional page reloads. This course teaches students how to build dynamic websites with Ajax and with Linux, Apache, MySQL, and PHP (LAMP), one of today's most popular frameworks. Students learn how to set up domain names with DNS, how to structure pages with XHTML and CSS, how to program in JavaScript and PHP, how to configure Apache and MySQL, how to design and query databases with SQL, how to use Ajax with both XML and JSON, and how to build mashups. The course explores issues of security, scalability, and cross-browser support and also discusses enterprise-level deployments of websites, including third-party hosting, virtualization, colocation in data centers, firewalling, and load-balancing. Starije verzije kurseva postoje na: http://www.cs75.tv http://www.cs50.tv Plus jos neki, pogledajte u meniju, ima za izbor godine kada je predavano i kursa. OpenCourseWare https://en.wikipedia.org/wiki/OpenCourseWare Na youtube-u svaki od vecih fakulteta ima svoj kanal sa dosta kurseva pa pretrazi. Ako trenutno ne daju free kurseve na svojim sajtovima pogledaj za predhodne godine na youtube-u. recimo http://www.youtube.com/user/MIT#p/p https://www.youtube.com/user/Harvard Pdf-ove i materijal za citanje obicno mozes skinuti i free sa sajta kursa. Samo knjige za ucenj nisu free. Materijal sa academicearth uglavnom mozes naci sveziji ako pogledash websajt pojedinih kurseva. Srecno.

King Arthur's Gold KAG is a game about mining, building castles and destroying your enemies. It is a side-scrolling 2D action multiplayer war game with focus on building, constructing siege machines and intense PvP combat. Some inspirations for the game are Soldat, Minecraft, Dungeon Keeper & Ace of Spades. Currently available on Windows, Linux & soon MacOSX.

Zod Engine Nemojte omašiti cutscens i manual: The Story and Gameplay In Z you were a commander under General Zod in his attempt to conquer the universe. Your team, Brad and Allan, went from site to site and planet to planet pushing back the Blue forces while getting bitched at by General Zod. In the Zod Engine the doors are opened up so that you can play all the levels and make new levels the way you've always wanted to. The Zod Engine is more then just a remake of Z however, it is a fully commercially supported online game that is perpetually running at all times. Players can connect and disconnect at any time. The Zod Engine is a MMORTS / RTS style game. In the game you command an army of robots and vehicles to take over neighboring territories in the ultimate goal of destroying all of your enemies. Unlike traditional RTS (Real Time Strategy) games the Zod Engine does not create units from collected resources but instead construction is constant from preset factories scattered throughout the level. Možda deluje pikselasto i sa malom rezolucijom ali sasvim lepo izgleda na 1680x1050. Radi na Linux-u i Windows-u a mislim da sam negde na forumu video i za iPhone. Screenshots Video

Nisam hteo da kacim slike u post, ostavio sam kao linkove. Probajte 3D pong i Kittys Quest obavezno : ) FreeOrion: http://www.freeorion.org/index.php/Main_Page sshot1 sshot2 sshot3 TripleA ( ima i dosta modova ) http://triplea.sourceforge.net/mywiki/TripleA sshot1 3D pong (flash igra) http://www.newsandentertainment.com/zfcurveball.html Mr.Kittys Quest ^_^ fantasticna samo da je duzha : ( http://www.pixelprospector.com/2010/05/mr-kittys-quest/ sshot 1 sshot 2 sshot 3 Na linku od zadnje igre ima josh gomila igara pa probajte..

Ne traba da bude sramota coveka, pobogu. Za XHTML samo uzmesh neku knjigu ili tutorial i predjesh po primerima. Da par puta predje pa naucio bi i taj mali sto ce ga kroz koju godinu oterati od kompa : ) Nema tu nista preobimno da se uci. Posle ako hoce i ima vremena covek moze da nadogradjuje znanje sa js, css, php-om...al koliko vidim vreme je problem : ) sorry na tome mada ima vremena do 55: )

Gde ti je mladost coveche. 36?... hajde bre dechache vataj se knjige nema izgovora. Ako vec nisi u tim vodama tesko da bi od tebe trazili da ucish sistemsko programiranje : ) verovatno je nesto vezano za administraciju sistema, sitne skriptice i tako to..ako je vec u unixu/linuxu verovatno se radi o osnovnim komandicama, bash-u, python-u.. sta li vec. Nista strasno u sushtini. Ako vec i hocesh neki jezik da radish pogledaj Javu : ) Za uvod u javu pogledaj ove video lekcije: http://www.academicearth.org/courses/programming-methodology Mozes preskociti prvu lekciju ili je pregledaj na preskoke.. Sledece dve-tri lekcije su neki osnovni uvod u programiranje uopste sa Karel-om. Ako si bash dosta zardjao to ce mnogo pomoci,kao i pocetnicima. Karel je mini jezik sa malo komandi i jako slican javi, skonta se za sat-dva. Mislim da je jako dobar nacin za ucenje, barem osnovnih stvari. A i od pocetka ti postane zanimljivo..progledaj prve dve strane ovog malenog pdf-a i videces o cemu se radi. http://lia.deis.unibo.it/Courses/FondA0809-AUT/materiale/karellearnsjava.pdf Na poslednjoj strani imash pregled celog jezik od prilike. Posle te 2-3 lekcije se prelazi na javu i radi se do kraja kursa. Mislim da kurs daje jako dobru osnovu i da je posle lako preci na neki drugi jezik. Pogledaj zadnju lekciju i videcesh sta su ljudi na kraju kursa odradili. Ako te zainteresuje na sledecem linku mozes naci sve lekcije za download. +sav dodatni materijal u jednom zip-u(na dnu strane): http://see.stanford.edu/see/courseinfo.aspx?coll=824a47e1-135f-4508-a5aa-866adcae1111 Jedino sto nema u tom dodatnom materijalu je knjiga iz koje se uci.. a to je ova: http://www-cs-faculty.stanford.edu/~eroberts/books/ArtAndScienceOfJava/ mada se to izdanje ne moze naci na netu vec neka draft verzija iz 2005 u kojoj fali moza 5-10% materijala. Sve u svemu pogledaj, kurs je po meni ok, trenutno sam presao dve trecine i mogu reci da ide fino.. Sto se web-a tice kao sto trooper rece mozes XHTML savladati za jedan dan/vikend, mada bi ti i sa CSS-om brzo ishlo. Za ostalo stvari na web-u imash materijala na academicearth.org(lekcije su dvocasovne): http://www.academicearth.org/courses/building-dynamic-websites evo i zvanicne stranice kursa: http://www.cs75.net/ Deluje mi zanimljivo..doduse cini mi se da prelazi suvishe stvari u malo predavanja. Python Ovo je prvi jezik koji sam naucio, i to relativno lako.. Mislim da sam vec ovde kacio link do ove knjige ali evo opet http://www.swaroopch.com/notes/Python Knjiga je meni mnogo pomogla, nije preobimna i vodi te lagano kroz python. Kada predjesh knjigu i uz malo dodatnog rada komotno cesh se osecati sa pitonom : ) Ako te Karel ne uvuche u javu sa pitonom se barem mozesh poigrati : ) Glavu gore i srecno : )

Pirates of Silicon Valley http://www.imdb.com/title/tt0168122/

Mozda ti se svidi StarWolves i StarWolves2: http://www.excalibur-publishing.com/starwscr.htm http://www.1cpublishing.eu/game/star-wolves-2/gallery Prvi deo sam odigrao sa uzivanjem, jako mi se svideo. A dvojku sam igrao demo.. nisam imao vremena da krenem ozbiljno da igram.

Aimp

Mislim da morash sve iz dist foldera da prekopirash sa tim exe fajlom. Kod mene ne radi iako imam python instaliran : ) Medjutim kada propustim kroz py2exe radi sve dok se programcic nalazi u tom dist folderu, tj dok su uz njega python26.dll i library.zip

Mozda i ovo pomogne: www.py2exe.org

Ako vec hoce da uci python neka pogleda ovu knjigu: http://www.swaroopch.com/notes/Python Meni je pomogla da se skontam brzo.

Wireless 512/256k 2.4 GHz. Provajder www.gromnet.net Pinging www.l.google.com [209.85.129.99] with 32 bytes of data: Reply from 209.85.129.99: bytes=32 time=50ms TTL=51 Reply from 209.85.129.99: bytes=32 time=53ms TTL=51 Reply from 209.85.129.99: bytes=32 time=59ms TTL=51 Reply from 209.85.129.99: bytes=32 time=54ms TTL=51 Ping statistics for 209.85.129.99: Packets: Sent = 4, Received = 4, Lost = 0 (0% loss), Approximate round trip times in milli-seconds: Minimum = 50ms, Maximum = 59ms, Average = 54ms [/codebox] [u]» Click to show Spoiler - click again to hide... «[/u] Mozda bude vise koristi od ovoga: [codebox] Pinging www.l.google.com [74.125.43.105] with 32 bytes of data: Reply from 74.125.43.105: bytes=32 time=97ms TTL=50 Reply from 74.125.43.105: bytes=32 time=56ms TTL=50 Reply from 74.125.43.105: bytes=32 time=73ms TTL=50 Reply from 74.125.43.105: bytes=32 time=78ms TTL=50 Reply from 74.125.43.105: bytes=32 time=69ms TTL=50 Reply from 74.125.43.105: bytes=32 time=69ms TTL=50 Reply from 74.125.43.105: bytes=32 time=97ms TTL=50 Reply from 74.125.43.105: bytes=32 time=58ms TTL=50 Reply from 74.125.43.105: bytes=32 time=77ms TTL=50 Reply from 74.125.43.105: bytes=32 time=75ms TTL=50 Reply from 74.125.43.105: bytes=32 time=69ms TTL=50 Reply from 74.125.43.105: bytes=32 time=65ms TTL=50 Reply from 74.125.43.105: bytes=32 time=68ms TTL=50 Reply from 74.125.43.105: bytes=32 time=75ms TTL=50 Reply from 74.125.43.105: bytes=32 time=75ms TTL=50 Reply from 74.125.43.105: bytes=32 time=62ms TTL=50 Reply from 74.125.43.105: bytes=32 time=55ms TTL=50 Reply from 74.125.43.105: bytes=32 time=96ms TTL=50 Reply from 74.125.43.105: bytes=32 time=47ms TTL=50 Reply from 74.125.43.105: bytes=32 time=68ms TTL=50 Reply from 74.125.43.105: bytes=32 time=74ms TTL=50 Reply from 74.125.43.105: bytes=32 time=63ms TTL=50 Reply from 74.125.43.105: bytes=32 time=76ms TTL=50 Reply from 74.125.43.105: bytes=32 time=90ms TTL=50 Reply from 74.125.43.105: bytes=32 time=98ms TTL=50 Reply from 74.125.43.105: bytes=32 time=95ms TTL=50 Reply from 74.125.43.105: bytes=32 time=54ms TTL=50 Reply from 74.125.43.105: bytes=32 time=90ms TTL=50 Reply from 74.125.43.105: bytes=32 time=57ms TTL=50 Reply from 74.125.43.105: bytes=32 time=63ms TTL=50 Reply from 74.125.43.105: bytes=32 time=48ms TTL=50 Reply from 74.125.43.105: bytes=32 time=69ms TTL=50 Reply from 74.125.43.105: bytes=32 time=59ms TTL=50 Reply from 74.125.43.105: bytes=32 time=51ms TTL=50 Reply from 74.125.43.105: bytes=32 time=93ms TTL=50 Reply from 74.125.43.105: bytes=32 time=85ms TTL=50 Reply from 74.125.43.105: bytes=32 time=68ms TTL=50 Reply from 74.125.43.105: bytes=32 time=67ms TTL=50 Reply from 74.125.43.105: bytes=32 time=93ms TTL=50 Reply from 74.125.43.105: bytes=32 time=59ms TTL=50 Reply from 74.125.43.105: bytes=32 time=73ms TTL=50 Reply from 74.125.43.105: bytes=32 time=70ms TTL=50 Reply from 74.125.43.105: bytes=32 time=76ms TTL=50 Reply from 74.125.43.105: bytes=32 time=74ms TTL=50 Reply from 74.125.43.105: bytes=32 time=65ms TTL=50 Reply from 74.125.43.105: bytes=32 time=105ms TTL=50 Reply from 74.125.43.105: bytes=32 time=71ms TTL=50 Reply from 74.125.43.105: bytes=32 time=71ms TTL=50 Reply from 74.125.43.105: bytes=32 time=76ms TTL=50 Reply from 74.125.43.105: bytes=32 time=67ms TTL=50 Reply from 74.125.43.105: bytes=32 time=59ms TTL=50 Reply from 74.125.43.105: bytes=32 time=98ms TTL=50 Reply from 74.125.43.105: bytes=32 time=67ms TTL=50 Reply from 74.125.43.105: bytes=32 time=70ms TTL=50 Reply from 74.125.43.105: bytes=32 time=77ms TTL=50 Reply from 74.125.43.105: bytes=32 time=66ms TTL=50 Reply from 74.125.43.105: bytes=32 time=87ms TTL=50 Reply from 74.125.43.105: bytes=32 time=77ms TTL=50 Reply from 74.125.43.105: bytes=32 time=75ms TTL=50 Reply from 74.125.43.105: bytes=32 time=55ms TTL=50 Reply from 74.125.43.105: bytes=32 time=80ms TTL=50 Reply from 74.125.43.105: bytes=32 time=49ms TTL=50 Reply from 74.125.43.105: bytes=32 time=90ms TTL=50 Reply from 74.125.43.105: bytes=32 time=61ms TTL=50 Reply from 74.125.43.105: bytes=32 time=60ms TTL=50 Reply from 74.125.43.105: bytes=32 time=68ms TTL=50 Reply from 74.125.43.105: bytes=32 time=62ms TTL=50 Reply from 74.125.43.105: bytes=32 time=63ms TTL=50 Reply from 74.125.43.105: bytes=32 time=54ms TTL=50 Reply from 74.125.43.105: bytes=32 time=59ms TTL=50 Reply from 74.125.43.105: bytes=32 time=79ms TTL=50 Reply from 74.125.43.105: bytes=32 time=56ms TTL=50 Reply from 74.125.43.105: bytes=32 time=73ms TTL=50 Reply from 74.125.43.105: bytes=32 time=64ms TTL=50 Reply from 74.125.43.105: bytes=32 time=70ms TTL=50 Reply from 74.125.43.105: bytes=32 time=63ms TTL=50 Reply from 74.125.43.105: bytes=32 time=70ms TTL=50 Reply from 74.125.43.105: bytes=32 time=68ms TTL=50 Reply from 74.125.43.105: bytes=32 time=82ms TTL=50 Reply from 74.125.43.105: bytes=32 time=58ms TTL=50 Reply from 74.125.43.105: bytes=32 time=69ms TTL=50 Reply from 74.125.43.105: bytes=32 time=71ms TTL=50 Reply from 74.125.43.105: bytes=32 time=122ms TTL=50 Reply from 74.125.43.105: bytes=32 time=70ms TTL=50 Reply from 74.125.43.105: bytes=32 time=58ms TTL=50 Reply from 74.125.43.105: bytes=32 time=70ms TTL=50 Reply from 74.125.43.105: bytes=32 time=66ms TTL=50 Reply from 74.125.43.105: bytes=32 time=76ms TTL=50 Reply from 74.125.43.105: bytes=32 time=59ms TTL=50 Reply from 74.125.43.105: bytes=32 time=150ms TTL=50 Reply from 74.125.43.105: bytes=32 time=83ms TTL=50 Reply from 74.125.43.105: bytes=32 time=57ms TTL=50 Reply from 74.125.43.105: bytes=32 time=86ms TTL=50 Reply from 74.125.43.105: bytes=32 time=76ms TTL=50 Reply from 74.125.43.105: bytes=32 time=69ms TTL=50 Reply from 74.125.43.105: bytes=32 time=97ms TTL=50 Reply from 74.125.43.105: bytes=32 time=71ms TTL=50 Reply from 74.125.43.105: bytes=32 time=77ms TTL=50 Reply from 74.125.43.105: bytes=32 time=69ms TTL=50 Reply from 74.125.43.105: bytes=32 time=86ms TTL=50 Ping statistics for 74.125.43.105: Packets: Sent = 100, Received = 100, Lost = 0 (0% loss), Approximate round trip times in milli-seconds: Minimum = 47ms, Maximum = 150ms, Average = 72ms Pinging www.l.google.com [209.85.129.103] with 32 bytes of data: Reply from 209.85.129.103: bytes=32 time=112ms TTL=51 Reply from 209.85.129.103: bytes=32 time=78ms TTL=51 Reply from 209.85.129.103: bytes=32 time=60ms TTL=51 Reply from 209.85.129.103: bytes=32 time=70ms TTL=51 Reply from 209.85.129.103: bytes=32 time=46ms TTL=51 Reply from 209.85.129.103: bytes=32 time=54ms TTL=51 Reply from 209.85.129.103: bytes=32 time=88ms TTL=51 Reply from 209.85.129.103: bytes=32 time=71ms TTL=51 Reply from 209.85.129.103: bytes=32 time=74ms TTL=51 Reply from 209.85.129.103: bytes=32 time=61ms TTL=51 Reply from 209.85.129.103: bytes=32 time=106ms TTL=51 Reply from 209.85.129.103: bytes=32 time=57ms TTL=51 Reply from 209.85.129.103: bytes=32 time=59ms TTL=51 Reply from 209.85.129.103: bytes=32 time=48ms TTL=51 Reply from 209.85.129.103: bytes=32 time=55ms TTL=51 Reply from 209.85.129.103: bytes=32 time=48ms TTL=51 Reply from 209.85.129.103: bytes=32 time=47ms TTL=51 Reply from 209.85.129.103: bytes=32 time=51ms TTL=51 Reply from 209.85.129.103: bytes=32 time=82ms TTL=51 Reply from 209.85.129.103: bytes=32 time=65ms TTL=51 Reply from 209.85.129.103: bytes=32 time=71ms TTL=51 Reply from 209.85.129.103: bytes=32 time=110ms TTL=51 Reply from 209.85.129.103: bytes=32 time=68ms TTL=51 Reply from 209.85.129.103: bytes=32 time=105ms TTL=51 Reply from 209.85.129.103: bytes=32 time=62ms TTL=51 Reply from 209.85.129.103: bytes=32 time=62ms TTL=51 Reply from 209.85.129.103: bytes=32 time=45ms TTL=51 Reply from 209.85.129.103: bytes=32 time=77ms TTL=51 Reply from 209.85.129.103: bytes=32 time=75ms TTL=51 Reply from 209.85.129.103: bytes=32 time=49ms TTL=51 Reply from 209.85.129.103: bytes=32 time=78ms TTL=51 Reply from 209.85.129.103: bytes=32 time=64ms TTL=51 Reply from 209.85.129.103: bytes=32 time=48ms TTL=51 Reply from 209.85.129.103: bytes=32 time=103ms TTL=51 Reply from 209.85.129.103: bytes=32 time=45ms TTL=51 Reply from 209.85.129.103: bytes=32 time=54ms TTL=51 Reply from 209.85.129.103: bytes=32 time=45ms TTL=51 Reply from 209.85.129.103: bytes=32 time=53ms TTL=51 Reply from 209.85.129.103: bytes=32 time=62ms TTL=51 Reply from 209.85.129.103: bytes=32 time=68ms TTL=51 Reply from 209.85.129.103: bytes=32 time=65ms TTL=51 Reply from 209.85.129.103: bytes=32 time=48ms TTL=51 Reply from 209.85.129.103: bytes=32 time=69ms TTL=51 Reply from 209.85.129.103: bytes=32 time=81ms TTL=51 Reply from 209.85.129.103: bytes=32 time=60ms TTL=51 Reply from 209.85.129.103: bytes=32 time=73ms TTL=51 Reply from 209.85.129.103: bytes=32 time=55ms TTL=51 Reply from 209.85.129.103: bytes=32 time=49ms TTL=51 Reply from 209.85.129.103: bytes=32 time=61ms TTL=51 Reply from 209.85.129.103: bytes=32 time=36ms TTL=51 Reply from 209.85.129.103: bytes=32 time=56ms TTL=51 Reply from 209.85.129.103: bytes=32 time=82ms TTL=51 Reply from 209.85.129.103: bytes=32 time=56ms TTL=51 Reply from 209.85.129.103: bytes=32 time=62ms TTL=51 Reply from 209.85.129.103: bytes=32 time=69ms TTL=51 Reply from 209.85.129.103: bytes=32 time=64ms TTL=51 Reply from 209.85.129.103: bytes=32 time=58ms TTL=51 Reply from 209.85.129.103: bytes=32 time=47ms TTL=51 Reply from 209.85.129.103: bytes=32 time=43ms TTL=51 Reply from 209.85.129.103: bytes=32 time=73ms TTL=51 Reply from 209.85.129.103: bytes=32 time=69ms TTL=51 Reply from 209.85.129.103: bytes=32 time=45ms TTL=51 Reply from 209.85.129.103: bytes=32 time=64ms TTL=51 Reply from 209.85.129.103: bytes=32 time=63ms TTL=51 Reply from 209.85.129.103: bytes=32 time=56ms TTL=51 Reply from 209.85.129.103: bytes=32 time=51ms TTL=51 Reply from 209.85.129.103: bytes=32 time=81ms TTL=51 Reply from 209.85.129.103: bytes=32 time=60ms TTL=51 Reply from 209.85.129.103: bytes=32 time=84ms TTL=51 Reply from 209.85.129.103: bytes=32 time=68ms TTL=51 Reply from 209.85.129.103: bytes=32 time=88ms TTL=51 Reply from 209.85.129.103: bytes=32 time=81ms TTL=51 Reply from 209.85.129.103: bytes=32 time=55ms TTL=51 Reply from 209.85.129.103: bytes=32 time=71ms TTL=51 Reply from 209.85.129.103: bytes=32 time=71ms TTL=51 Reply from 209.85.129.103: bytes=32 time=74ms TTL=51 Reply from 209.85.129.103: bytes=32 time=49ms TTL=51 Reply from 209.85.129.103: bytes=32 time=81ms TTL=51 Reply from 209.85.129.103: bytes=32 time=53ms TTL=51 Reply from 209.85.129.103: bytes=32 time=56ms TTL=51 Reply from 209.85.129.103: bytes=32 time=44ms TTL=51 Reply from 209.85.129.103: bytes=32 time=60ms TTL=51 Reply from 209.85.129.103: bytes=32 time=67ms TTL=51 Reply from 209.85.129.103: bytes=32 time=50ms TTL=51 Reply from 209.85.129.103: bytes=32 time=52ms TTL=51 Reply from 209.85.129.103: bytes=32 time=50ms TTL=51 Reply from 209.85.129.103: bytes=32 time=57ms TTL=51 Reply from 209.85.129.103: bytes=32 time=44ms TTL=51 Reply from 209.85.129.103: bytes=32 time=53ms TTL=51 Reply from 209.85.129.103: bytes=32 time=72ms TTL=51 Reply from 209.85.129.103: bytes=32 time=50ms TTL=51 Reply from 209.85.129.103: bytes=32 time=57ms TTL=51 Reply from 209.85.129.103: bytes=32 time=42ms TTL=51 Reply from 209.85.129.103: bytes=32 time=54ms TTL=51 Reply from 209.85.129.103: bytes=32 time=70ms TTL=51 Reply from 209.85.129.103: bytes=32 time=44ms TTL=51 Reply from 209.85.129.103: bytes=32 time=55ms TTL=51 Reply from 209.85.129.103: bytes=32 time=78ms TTL=51 Reply from 209.85.129.103: bytes=32 time=59ms TTL=51 Reply from 209.85.129.103: bytes=32 time=60ms TTL=51 Ping statistics for 209.85.129.103: Packets: Sent = 100, Received = 100, Lost = 0 (0% loss), Approximate round trip times in milli-seconds: Minimum = 36ms, Maximum = 112ms, Average = 63ms

Jel moze update stanja majica?

Od 25 do 35. Tako da 4 i 5 od mene.. preko 35 nisam ishao.

Da li je ostalo jos majica? Tj jel stanje iz prvog posta jos vazi? Hoce li biti jos tura za narucivanje?

Niksicki Supermen Kako dobra fora : ))))

Upravo stigle maje : )) Hvala

Ja bih porudzbinom: Sve su iste - crvena - XL Samo Rejv - crna - XL Saljem pm sa adresom

Are Women Born This Way Men Are Born This Way Proof that men are pervs right from infancy. http://www.youtube.com/watch?v=KjTXLgCz-SY

Stvarno dobar film.