Programming Challenge -- Your chance to win an Ultra 20 Workstation.

In order to celebrate our first ever release of early Alpha bits of Sun Studio
Compilers for Linux OS we've decided to give all of you a chance to experience
first hand how indispensable our tools can be in the most challenging situations
when you have to tune the last possible drop of performance out of your app and
also to have an opportunity to win a blazing fast x64 Sun Ultra 20 Workstation.
Here's how: you participate in the programming challenge by developing
an application that reads alphanumeric strings from standard input
and prints out the top 1000 string occurrences to standard output. The output
of your application should be identical to the output produced by the following
command:
$ cat input_file | sort | tail -1000
Turn in your source code, build instructions and binary to the Sun Studio
booth at LinuxWorld 2005 Conference and Expo in Moscone, San Francisco
by Thursday, August 11 at 3pm. If your application executes faster than
all other solutions, including our own, you win Sun Ultra 20 Workstation!
Of course, we'll be also glad to explain to you how by using our tools
you can tune your app into a wild performer.
Please check the special forum dedicated to Sun Studio for Linux for
the latest scoop on the challenge and what's up with compilers on
Linux in general:
http://developers.sun.com/prodtech/cc/linux_index.html
If you want to chat with us in person -- go the the Linux World 2005:
http://www.linuxworldexpo.com
and register using this promotion code: N0388.
Thanks and have fun,
Compiler team @ Sun microsystems.
P.S. A copy of the Official Rules will be available at the Sun
Microsystems Booth.

It's saying my password is wrong, but it's not. When I try to reset the password the form won't submit. So I guess i'm out

Similar Messages

Programming Challenge -- Your chance to win an Ulra 20 Workstation

In order to celebrate our first ever release of early Aplpha bits of Sun Studio
Compilers for Linux OS we've decided to give all of you a chance to experience
first hand how indispensable our tools can be in the most challenging situations
when you have to tune the last possible drop of performance out of your app and
also to have an opportunity to win a blazing fast x64 Sun Ultra 20 Workstation.
Here's how: you participate in the programming challenge by developing
and application that reads alphanumeric strings from standard input
and prints out the top 1000 string occurrences to standard output. The output
of your application should be identical to the output produced by the following
command:
$ cat input_file | sort | tail -1000
Turn in your source code, build instructions and binary to the Sun Studio
booth at LinuxWorld 2005 Conference and Expo in Moscone, San Francisco
by Thursday, August 11 at 3pm. If your application executes faster than
all other solutions, including our ow, you win a Sun Ultra 20 Workstation!
Of course, we'll be also glad to explain to you how by using our tools
you can tune your app into a wild performer.
We will be also using this forum for discussing some of the entries and hear
what you have to say -- so check back early, check back often!
Oh yeah, and one more thing:
if you want to get the latest scoop on Sun Stduio Compilers for the Linux OS go right here:
http://developers.sun.com/prodtech/cc/linux_index.html
or if you want to chat with us in person -- go the the Linux World 2005:
http://www.linuxworldexpo.com
and register using this promotion code: N0388.
Thanks and have fun,
Compiler team @ Sun microsystems.
P.S. A copy of the Official Rules will be available at the Sun
Microsystems Booth.

In order to celebrate our first ever release of early Aplpha bits of Sun Studio
Compilers for Linux OS we've decided to give all of you a chance to experience
first hand how indispensable our tools can be in the most challenging situations
when you have to tune the last possible drop of performance out of your app and
also to have an opportunity to win a blazing fast x64 Sun Ultra 20 Workstation.
Here's how: you participate in the programming challenge by developing
and application that reads alphanumeric strings from standard input
and prints out the top 1000 string occurrences to standard output. The output
of your application should be identical to the output produced by the following
command:
$ cat input_file | sort | tail -1000
Turn in your source code, build instructions and binary to the Sun Studio
booth at LinuxWorld 2005 Conference and Expo in Moscone, San Francisco
by Thursday, August 11 at 3pm. If your application executes faster than
all other solutions, including our ow, you win a Sun Ultra 20 Workstation!
Of course, we'll be also glad to explain to you how by using our tools
you can tune your app into a wild performer.
We will be also using this forum for discussing some of the entries and hear
what you have to say -- so check back early, check back often!
Oh yeah, and one more thing:
if you want to get the latest scoop on Sun Stduio Compilers for the Linux OS go right here:
http://developers.sun.com/prodtech/cc/linux_index.html
or if you want to chat with us in person -- go the the Linux World 2005:
http://www.linuxworldexpo.com
and register using this promotion code: N0388.
Thanks and have fun,
Compiler team @ Sun microsystems.
P.S. A copy of the Official Rules will be available at the Sun
Microsystems Booth.

Give us feedback and have a chance to win an Ultra 20!

Want a chance to give your feedback on Sun's Java ME development tools? Do you also want a chance to win an Ultra 20 or other great prizes for 10 minutes of your time?
Go to http://developers.sun.com/techtopics/mobility/devtool_survey.html for more details and to access the survey.
Your feedback is very valuable to us, and we'd love to hear from you.
Thanks!
Java ME Developer Tools team

Hello,
This most likely (almost certainly actually) is a scam. Mozilla would never ask you for your home location - and not through an ad. Please don't click the link or provide your personal details.
Thank you for reporting this issue.

Calling all T-SQL fans! Your chance to win love and glory! Be our November TechNet Guru!

November has been designated National
Novel Writing Month and
National Blog Posting Month.
But we don't want that! We want a professional wiki article!
TechNet Wiki provides anyone the chance to contribute Microsoft technology related content to the community!
And we'll love it, and tweak it, and show the world!
Everyone has an equal chance of becoming our TechNet technology Guru, every month.
Separate teams of judges (6-8 per category) read every article submitted.
Some of the most influential members of Microsoft in your favourite technologies contribute their judging time to this competition.
TechNet Guru awards also help to promote your progress within the community... and its inner circles.
These competitions also help towards real awards, even
MVP recognition!
All you have to do is add an article to TechNet Wiki from your own specialist field. Something that fits into one of the categories listed on the submissions page. Copy in your own blog posts, a forum solution, a white paper, or just something
you had to solve for your own day's work today.
Drop us some nifty knowledge, or superb snippets, and become MICROSOFT TECHNOLOGY GURU OF THE MONTH!
This is an official Microsoft TechNet recognition, where people such as yourselves can truly get noticed!
HOW TO WIN
1) Please copy over your Microsoft technical solutions and revelations to
TechNet Wiki.
2) Add a link to it on
THIS WIKI COMPETITION PAGE (so we know you've contributed)
3) Every month, we will highlight your contributions, and select a "Guru of the Month" in each technology.
If you win, we will sing your praises in blogs and forums, similar to the
weekly contributor awards. Once "on our radar" and making your mark, you will probably be
interviewed for your greatness, and maybe eventually even invited into other inner TechNet/MSDN circles!
Winning this award in your favoured technology will help us learn the active members in each community.
Feel free to ask any questions below.
More about TechNet Guru Awards
Thanks in advance!
Pete Laker
#PEJL
Got any nice code? If you invest time in coding an elegant, novel or impressive answer on MSDN forums, why not copy it over to
TechNet Wiki, for future generations to benefit from! You'll never get archived again, and
you could win weekly awards!
Have you got what it takes o become this month's
TechNet Technical Guru? Join a long list of well known community big hitters, show your knowledge and prowess in your favoured technologies!

We're up to 2 articles and 2 days to go:
T-SQL: Safely Concatenate Values Into a Scalar Variable by Kev
Riley
T-SQL Tips : Search
and Replace String From Multiple Nodes Within a XML Document by Visakh16
Ed Price, Azure & Power BI Customer Program Manager (Blog,
Small Basic,
Wiki Ninjas,
Wiki)
Answer an interesting question?
Create a wiki article about it!

Last Call: Enter For Your Chance To Win $1 Million To Develop Your Powerful Solution

Verizon's third annual Powerful Answers Award program is accepting ideas until June 18. The program offers innovators, developers and entrepreneurs $6 million in cash prizes, plus the opportunity for winners to participate in an Accelerator program designed to help develop their ideas and bring solutions to market faster.
The Verizon Powerful Answers Award program seeks ideas that leverage cutting-edge technology to create solutions that deliver social good. The 2015 program is seeking ideas in three core categories, each with three subcategories:
Transportation: How can technology enable better, more efficient ways to reduce the complexities of transportation and distribution in the physical world?
o Smarter Driving
o Public Transport & Sharing
o Logistics and Distribution
Emergency Response: How can technology enable first responders and emergency crews to locate and save lives faster; what solutions can improve long-term recovery for survivors?
o First Responders
o Search and Rescue
o Long Term Relief
Internet of Things: How can using technology behind the Internet of Things (IoT) enable new intelligent actions that will have wide-scale and beneficial impacts in the following areas?
o Connected Health
o Smart Cities
o Smart Agriculture
For more information or to submit your idea visit www.powerfulanswersaward.com.
Submissions will be judged by panels of industry experts, and winners will be announced later this year.
Verizon will award cash prizes of $1 million to the top winner in each of the three core categories. The second prize winner in each category will receive $500,000 and two third-prize winners in each category will receive $250,000, for a total of $6 million. If you are on Twitter search for #VZPAA for updates and information.

I am heretic I guess as I have zero interest in the Olympics...........
Life | 1967 Plus Radio | 1000 Classical Hits | Kafka's World
Someone Solved Your Question?
Please let other members know by clicking on ’Mark as Accepted Solution’
Helpful Post?
If a post has been helpful, say thanks by clicking the ratings star.

Win an Ultra 20!

Want a chance to give your feedback on Sun's Java ME development tools? Do you also want a chance to win an Ultra 20 or other great prizes for 10 minutes of your time?
Go to http://developers.sun.com/techtopics/mobility/devtool_survey.html for more details and to access the survey.
Your feedback is very valuable to us, and we'd love to hear from you.
Thanks!
Java ME Developer Tools team

Hello Monarch,
if we're talking Linux:
on your bootserver, change the bootfile in /tftpboot/pxelinux.cfg to something like
DEFAULT localhost
LABEL localhost
LOCALBOOT 0after machine boots to install. It will boot from disk the next time. There are packages which do this by themselves automatically, like systemimager.
Cheers, Peter.
PS: Can you do me a favour and check if the output of dmidecode run as root tells something about IPMI?

Chance to win tickets to Chelsea v Spurs on 30th A...

Hey Everyone…well the footie fans out there anyway!
I’ve got details of a great competition from our BT Life Blog. Details below…or click here to read the full blog article.
Want to watch Chelsea v Spurs live from the stands at Stamford Bridge on 30th April? Just use your free BT wi-fi broadband by Friday 1st April for your chance to win two tickets!
For your chance to enter, simply use your BT Broadband on the go with your free BT wi-fi before 1st April 2011 and we’ll automatically enter you for the prize draw. That’s all you have to do!
If you’re a BT Broadband customer, but haven’t used your free BT wi-fi yet, it’s easy to get started. Find out how to get started with free BT wi-fi broadband now
Read the prize draw terms and conditions
Good Luck if you enter!
Kerry
Retired BTCare Community Manager - StephanieG and SeanD are your new Community Managers
If you like a post, or want to say thanks for a helpful answer, please click on the Ratings star on the left-hand side of the post.
If someone answers your question correctly please let other members know by clicking on ’Mark as Accepted Solution’.

I am heretic I guess as I have zero interest in the Olympics...........
Life | 1967 Plus Radio | 1000 Classical Hits | Kafka's World
Someone Solved Your Question?
Please let other members know by clicking on ’Mark as Accepted Solution’
Helpful Post?
If a post has been helpful, say thanks by clicking the ratings star.

Share your opinion on Adobe Contribute for a chance to win $500USD!

Share your opinion on Adobe Contribute for a chance to win
one of five $100USD gift checks or one $500USD gift check!
Take the survey now:
http://direct.adobe.com/r?xJvPqWTEJcqTHEcHqTJlH
In exchange for taking a short survey about your opinions of
Adobe Contribute, you will have the option of participating in a
drawing for a chance to win one of five $100USD gift checks or one
$500USD gift check.
Your responses will remain confidential. No information about
you will be sold or furnished to any other company whatsoever, nor
will you receive unsolicited emails because of your participation
in this survey.
Full list of rules:
http://direct.adobe.com/r?xJvPqWTEJcqTcEcHqTJlc
To take the survey, please visit:
http://direct.adobe.com/r?xJvPqWTEJcqTHEcHqTJlH
Ramesh Gopalakrishna
Product Manager
Adobe Contribute Team

Hey SpiceHeads! We know you’re often running around saving the day for your company, and your valiant efforts are sometimes overlooked. At Brother we’d love to reward your hard work and innovative thinking! Share one of your heroic IT acts in the comment section below for a chance to win one of two gaming prizes!First prize will get aMicrosoft Xbox One with Kinect.Runner up will get aSony PlayStation 4 Console.The prizes don’t stop there! We’re also giving anEVGAGeForce GTX TITAN X Suplerclocked graphics card!For a chance to win the grand prize,simply fill out the form located here.Also, the first 10 SpiceHeads to post their story and complete the form will be given a special mystery swag bag from Brother.May the odds be in your favor!End date: 8/14 US only.Terms & Conditions
This topic first appeared in the Spiceworks Community

Get Your Free Iphone App & A Chance To Win An Ipad Or Itouch!

This is an incredible new app that will allow you to list any item you have for sale on the best new online auction service all from your iphone.The app is absolutely free and along with the app you can register for a chance to win a Ipad or Itouch.
Nothing to buy just an opportunity to get an innovative new app before anyone else.
Get it here for free: http://valuableproductsonline.com/freeiphoneapp

The submission deadline has been extended to Monday, October 25

Any giveaways or chances to win one of these phone...

I've searched google and can't find any giveaways or contests that support the lumia 920 I had tried to get one threw at&t but, have been denied due to past medical bills on my credit and never having a credit score. I found this program called straight talk and will love to activate one with this feature i'd buy the phone outright but, there is no way i can afford $600! for a no service phone so i'm persuing to see if i can find a chance to win it or earn it threw a giveaway online but, havn't found one. will there be any contest's or giveaway's in the upcoming months?

think there is a Vote for your favourite app over at Microsoft website where u can win a Lumia 920 each day for a while. Keep an eye on Nokia Conversations for any competitions that may pop up.

Is the Mozilla Reward Center, offering VIP customers the chance to win an iPad and requesting my home address, genuine or a scam?

On my Google Nexus 5, when I access the app ASTRO file manager, I am daily receiving an ad from the "Mozilla Reward Center", offering VIP customers the chance to win an iPad and requesting my home address for shipping should I win.
It looks to me like a scam.
I have saved a pdf of the screen if anyone wishes to see it.
If anyone knows how to block the ads in ASTRO file manager, I would be grateful for help, but I suspect this is not possible.

Hello,
This most likely (almost certainly actually) is a scam. Mozilla would never ask you for your home location - and not through an ad. Please don't click the link or provide your personal details.
Thank you for reporting this issue.

Programming challenges

This thread serves as a collection of small (solvable in less than 1 hour), but yet not trivial programming challenges. Please feel free to post your solution below, but try to avoid lengthy discussions.
1. Challenge:
Create a program to print the solution for any given (solvable, i.e. no guessing is needed) sudoku puzzle. Puzzles are represented as follows:
5 3 0 0 7 0 0 0 0
6 0 0 1 9 5 0 0 0
0 9 8 0 0 0 0 6 0
8 0 0 0 6 0 0 0 3
4 0 0 8 0 3 0 0 1
7 0 0 0 2 0 0 0 6
0 6 0 0 0 0 2 8 0
0 0 0 4 1 9 0 0 5
0 0 0 0 8 0 0 7 9
2. Challenge:
Create a program which takes a conjugated (regular) verb from in the present tense in various languages and tells you the language and the infinitive of the verb.
For simplicity's sake, I'll narrow it down a bit further: The program should be able to recognize German regular verbs (see "spielen"), Portuguese verbs on -ar (see "falar") and French verbs on -ir (see "choisir")
Example session:
$ ./lang kennst
German: kennen
./lang cantam
Portuguese: cantar
./lang finit
French: finir
If you want to suggest another challenge, please write me a mail. Remarkable solutions (very fast, small or elegant) for each challenge will be highlighted.
Last edited by wuischke (2008-03-02 13:12:33)

wuischke wrote:
OK, I'll post my solution as well. Written in ansi-C. It's sometimes very ugly (particularly the code to clear the square), well, but it works. You can add a call to the "PrintField" function before adding each value to see how this solver works.
I've seen incredibly small solvers written in Haskell - anyone here who knows functional programming languages well enough to post a nice solution?
This is a late solution to the first one.
This haskell solver isn't too small, but it is fast, and does guess when it gets stuck.
I used a similar strategy to yours: fill a list of lists with lists of candidates, and repeatedly check rows, columns, 3x3 squares (with wheel), and eliminate taken numbers (which also including 1 if we already have [1,2] in two spots).
It's a bit long, but it does guess once the above strategy stops changing the square, which solves all the newspaper problems I've tried (some of which end up taking the algorithm to maybe 15 dead ends: without guessing, those could probably be solved more intelligently using linear algebra (the problem is still np) (since each row,col,3x3 totals 45, giving at least as many equations as knowns), which would be elegant, but probably less efficient and more confusing)
My parser takes files without spaces, since I like it that way.
Ex:
53__7____
6__195___
_98____6_
8___6___3
4__8_3__1
7___2___6
_6____28_
___419__5
____8__79
Here it is:
module Main where
import Control.Monad
import Data.Maybe
import Data.Char (digitToInt,intToDigit)
import Data.List (nub,transpose,group,sort)
import Debug.Trace
import System.Environment
type MagicSq = [[[Int]]]
main = do f <- getArgs
if null f then error "specify one or more sudoku problem files to solve"
else mapM (\x -> unparseSq . solPret . rowsPar =<< readFile x) f
sol :: (Monad m) => [MagicSq] -> m [MagicSq]
sol = liftM (concat) . mapM sol'
sol' :: (Monad m) => MagicSq -> m [MagicSq]
sol' = let y x = mapMaybe wheel $ x
ty x = let yx = y x in trace ("branch of: " ++ show (length yx)) yx
in return . y . branch
solPret x = let f x = untillSame $ scanl (>>=) (sol x) $ repeat sol
-- somewhere magicSq is reversed... corrected here
goodSol x = if length x == 1 then return $ reverse $ head x
else fail "multiple, possibly incomplete solution found"
in join $ goodSol =<< f (wheel' x)
branch :: MagicSq -> [MagicSq]
branch x = if isSolved x then [x]
else map (unConcat x) $ branchRow $ concat x
where
unConcat o = segment $ length o
branchRow = bR []
bR a [] = []
bR a (l:ls)
| length l == min = map (\split -> (reverse a) ++ [split]:ls) l
| otherwise = bR (l:a) ls
where min = minimum $ filter (1/=) $ map length (l:ls)
wheel x = untillSame $ scanl (>>=) (wheel' x) $ repeat wheel'
wheel' x = rowCk x >>= zoneApp rowCk >>= colCk
untillSame (l:m:ms) = if l == m then l else untillSame (m:ms)
rowCk,colCk :: (Ord a, Show a, Monad m) => [[[a]]] -> m [[[a]]]
rowCk x = let exclCks x = foldr (=<<) (return x) $ map (exclusionCk) [1..2]
y = map (exclCks) x
--y = map (totalOneCk) x
in if Nothing `elem` y then fail "A row failed"
else return (map fromJust $ y)
colCk = liftM transpose . rowCk . transpose
zoneApp f = liftM (zC 3) . f . zC 3
zC _ [] = []
zC _ [[[]]] = [[[]]]
zC z l = let (i,ls) = splitAt z l
nrs = map (segment z) i
headGr x | null $ concat $ concat x = []
| otherwise = concatMap (head) x : headGr (map tail x)
in if length l `mod` z == 0
then headGr nrs ++ (zC z ls)
else error $ "square edge length:" ++ show (length l)
++ "does not divide by: " ++ show z
segment n l = let (a,as) = splitAt n l
in if null as then [a] else a:segment n as
rowsPar = parseSq . par' [] []
where
par' a b [] = (a)
par' a b ('\n':xs) = par' (reverse b :a) [] xs
par' a b (x:xs) = par' a (x:b) xs
parseSq :: [String] -> MagicSq
parseSq p@(m:ms) = if length m /= length p
then error "Must use a square grid"
else map (\x -> map (options) x) p
where
options x | x `elem` ['1'..intToDigit (length m)] = [digitToInt x]
| otherwise = [1..length m ]
unparseSq x = if isSolved x
then putStrLn $ unlines $ map show $ map (concatMap (map intToDigit)) x
else putStrLn $ unlines $ map show $ map (map (map intToDigit)) x
isSolved x = (length x)^2 == (length $ concat $ concat x)
totalOneCk l = let decided = concat $ filter (\x -> 1 == length x) l
uniqueL x = length x == length (nub x)
f x = if length x == 1 then x
else filter (\x -> x `notElem` decided) x
in if uniqueL decided then return $ map (f) l
else fail $ "Invalid row: " ++ show decided
-- this is a generalization of the totalOneCk; candidates are eliminated
-- based on the values in n same candidate lists of n length
exclusionCk :: (Monad m, Ord a, Show a) => Int -> [[a]] -> m [[a]]
exclusionCk n l =
let areLen = filter (\x -> n == length x)
ggs = group $ sort $ areLen l
ugPairs = areLen ggs
removals = map (head) ugPairs
maxGG = maximum $ map length $ ggs
errPP = fail $ "Length " ++ show n
++ " overbooked: " ++ show ggs
++ "\nIn: " ++ show l
-- The actual filter
f l [] = l
f l (r:rs)
| length l == 1 = l
| l == r = l
| otherwise = f (filter (\x -> x `notElem` r) l) rs
manage | null ugPairs = return l
| maxGG > n = errPP
| otherwise = return $ map (\l -> f l removals) l
in manage
edit: changed branch (guessing) to take the first smallest branch.
Last edited by vogt (2008-08-08 00:56:00)

Play the Game of Do, and stand a chance to win an Ultrabook

Good news!
Want to stand a chance to win one of our new Ultrabooks? Play the Game of Do, earn badges on Facebook, score points and bragging rights.
Click to Play and Win
Good luck!
Community Advocate Program Manager
English Community Deutsche Community Comunidad en Español Русскоязычное Сообщество

The submission deadline has been extended to Monday, October 25

Ask MOA PROS! Chance to win MSI Z97 MPOWER

Winner Announcement!
Thanks for all of your submissions to the event of “Ask MOA PROS!”
Congratulations Jpowers99 on winning the MSI Z97 MPOWER motherboard which also got the most recommendations from MOA PROS.
Check out our hero product here: http://www.msi.com/product/mb/Z97-MPOWER.html#hero-overview
Winner should send the private message to our MSI Fan Club (https://www.facebook.com/MSIHQFANCLUB) with the details of your Full Name, Address (includes the post code), phone number and E-mail within 7 days, or winner will be disqualified to prize. Also, please noted that which event you had participation.
Please go to MSI Youtube channel and enjoy these MOA PRO videos.
More videos please go to MSI Youtube channel: www.youtube.com/user/MSI
There are some videos still producing, please stay tuned!
But some of PROS were benching so hard during the contests that caused they didn't have enough time to join the interview. MSI will try to contact with these PROS and use another way to reply fans from MSI forum. Thanks for participated this event again!
MSI will be holding the MOA (Master Overclocking Arena) 2014 Grand Finals on October 18-19 in Taipei. Besides the ongoing Champion Prediction event, now we also would like invite MSI Forum users to ask related overclocking questions to MOA PORS. Everyone who joins this event till now to October 12nd have a chance on winning a MSI Z97 MPOWER motherboard.
The event is quite easy. You just need to pick up a MOA PRO who in the following image and ask him an overclocking question in the forum, kind of: To bboyjezz #1: "your question". Questions once registered, MSI will conduct a random drawing among all participants. In the end, these questions will be collected and pass to chosen PROS, and then they are going to answer the questions via video. Have fun and good luck to all you!

To rbuass (Brazil) #11,
1. When did you start overclocking?
2. How many CPU did you burn / fail?
3. What was your first CPU frequency target?
4. What's the highest CPU frequency you achieved?
5. What was your motivation?
6. How does it feel to belong in such contest and compete with other professional overclokers?
7. If you could rate yourself 1 to 10, 10 being the highest, what would it be?
That'll be all. Thank you MSI for another great opportunity.

"Summer Fun" Chance to win awesome gaming gears

Want to upgrade your gaming PC?
Just following few steps,
then you may have chance to win the awesome gaming motherboard!
Start Date: July 14th, 2014
End Date: July 28th, 2014
Step 1. Press "Like" on our MSI Fan Club Facebook http://goo.gl/65kuSK
Step 2. Join the Sweepstakes http://woobox.com/gr2btr
[Winner Announcement]
We announce the lucky winner of our Facebook Summer Fun Sweepstakes.
*** The Winners ***
Prize: MSI Z97 GAMING 7 Motherboard
Shawn Mason
Robert LaRocque Green
Eben Louw
Bonus Prize: Watch Dogs Limited edition
Racel Nicole Magbalana Manalo
Congratulations & Thanks for your participartion!
About MSI Z97 GAMING 7: http://goo.gl/hdKXqh

Quote from: Nichrome on 24-July-14, 23:00:22
Just wanted to ask if the girl comes together with my prize(crap, didn't signup..)? I still want the girl tho!
Sorry but the girl in red shirt is taken!
But because this topic is about "Summer Fun Chance to win awesome gaming girls" (that "gears" must be a typo), and because you are a nice guy,
I have a gift for you: the best MSI girls ever (in my opinion)
They are from CeBIT 2008, so they're 6 years older now, but I'm sure you don't have any problem with that.

Programming Challenge -- Your chance to win an Ultra 20 Workstation.

Similar Messages

Maybe you are looking for