IITB Coding Contest #1

[Ranveer Aggarwal]

Today, we're having our first competition, which will commence today at 9:00 PM and will last for 24 hours. This will happen on SPOJ and there will be a rank-list, which will be local to our insti junta. So, you're all encouraged to participate.

To participate, firstly, join this group after logging in with your spoj ID: http://www.spoj.com/groups/3328/

Then, go to this link to take part (It's disabled as of now, will commence at 9): http://www.spoj.com/TC1/

The questions have been set by Piyush Kumar.

Happy Debugging!

Regards,

Ranveer Aggarwal

Manager WnCC

[Ranveer Aggarwal]

A gentle reminder!

The contest has started with one problem already solved by 3 users. 

Here's the link: http://www.spoj.com/TC1/problems/main/

On Sat, Aug 16, 2014 at 9:12 PM, Utkarsh Kumar <kumar.ut...@gmail.com> wrote:

Ignore the last mail!

Sorry.

On Sat, Aug 16, 2014 at 9:11 PM, Utkarsh Kumar <kumar.ut...@gmail.com> wrote:

Its past 9, I dont see the link enabled?

--
You received this message because you are subscribed to the Google Groups "Competitive Programming at WnCC" group.
To unsubscribe from this group and stop receiving emails from it, send an email to wncc-procon...@googlegroups.com.
To post to this group, send email to wncc-...@googlegroups.com.
To view this discussion on the web, visit https://groups.google.com/d/msgid/wncc-procon/f8fcdddd-d097-469f-b947-33a24931f5b2%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

--

Sincerely,
Utkarsh Kumar,
Second Year Student
Computer Science Department,
IIT Bombay.

--

Sincerely,
Utkarsh Kumar,
Second Year Student
Computer Science Department,
IIT Bombay.

--
Ranveer Aggarwal

[Piyush Kumar]

Training contest 1 has ended. 8 people managed to solve all 8 problems, congratulations! Participation was 60+, which was more than what we anticipated :)

Problem distribution this time was : 4 easy, 4 easy-medium; so that everyone can solve something. Difficulty level will increase with contests.

If you still want to try out these problems, you can do it via the main SPOJ problemset. E.g., the problem that was http://www.spoj.com/TC1/problems/MAIN12A can be accessed in the main problemset at http://www.spoj.com/problems/MAIN12A/.

Few of you already solved some of the problems in the main problemset before the contest. It's all right, after all it's just meant for practice.

Also, your feedback will help shape the future contests. Any suggestions are welcome. If you want to contact privately, the team members are cc'ed in this mail.

Regards,

Piyush Kumar

To view this discussion on the web, visit https://groups.google.com/d/msgid/wncc-procon/CAFG5acoXin%3DvOykSoS35LvdRS3GLaJH2xbh35aCyM96tN0DoDw%40mail.gmail.com.

[Sai Sandeep]

http://www.spoj.com/TC1/problems/MAIN12A/

 I felt this question is pretty vague.It took lot of time to understand .
http://www.spoj.com/TC1/problems/IITKWPCI/

This is really nice. :)

...................

Sai Sandeep Reddy

Fresher,

Computer Science and Engineering Department,

IIT Bombay.

To view this discussion on the web, visit https://groups.google.com/d/msgid/wncc-procon/CAC96C1UVXBjkLtnjcYwvfLv%3DybX7-mFtKLtxX1VNWcR%3Deo7egA%40mail.gmail.com.

[Sai Sandeep]

In case anyone wants to know solution to problem "Lexicographically Smallest Permutation" see this.
http://saisandeepreddy.wordpress.com/2014/08/18/spoj-lexicographically-smallest-permutation/