# Invitation to Blueprint contest on CodeChef

Hello CodeChef community,

We all at IIIT Bhubaneswar are extremely happy to announce a new round on CodeChef, we will be starting our Tech Fest Advaita officially through our first contest Blueprint. I invite everyone to participate in the contest. We hope you’ll love the problems and would enjoy the contest.

I would like to thank everyone in the problem setting team along with me:

Tester: Teja Vardhan Reddy

### Contest Prizes:

In addition to CodeChef laddus we’ve arranged some cash prizes as well. Following are the details for the same:

• Rank 1: Rs. 5000 + 250 CodeChef laddus.
• Rank 2: Rs. 3000 + 250 CodeChef laddus.
• Rank 3: Rs. 2000 + 250 CodeChef laddus.

### Registration

The contest is free for all to participate. But it is mandatory to register on Advaita and then on Blueprint event to be eligible for any of the prizes.

Note: The contest is unrated.

1 Like

On Contest page, duration is written 3 hours but end time - start time given here is 2 hours!

@shivam_g1470 My apologies, it is fixed now. Thanks for reporting

regarding question https://www.codechef.com/BLUP2019/problems/GRAPHCOL

my solution approach is to find the no of sccs and check if k<(no of sccs) then answer is -1

else ans=ncr(k,no of sccs )*factorial[no of sccs]

can anybody check what is wrong in my approach https://www.codechef.com/viewsolution/22917799

@raman3217, your code is giving wrong no of scc’s. For e.g

``````1
3 6 7
1 2
2 3
3 1
2 4
4 5
5 6
6 4
``````

no of scc are 2, whereas your code gives 6.

1 Like

Thank you!!

found my error!!

I was Checking vis[x]!=0 in my dfs1() instead of its neighbours.