As always, the long contests will start on first Friday of every month and last for 10 days. This ensures that two weekends are covered.

The July 2015 Algorithm Challenge will be taking place on http://www.codechef.com/JULY15.

Here are the details:

Date: 3rd July 2015 to 13th July 2015

Duration: 10 days

Problems: 9 binary problems of varying difficulty levels + 1 challenge problem.

Problem Setters:

• Surya Kiran(adurysk),

• Sunny Aggarwal(ma5termind),

• Nazarbek Altybay(Na2a),

• Mugurel Ionut Andreica(mugurelionut),

• Sergey Nagin(Sereja),

• Jakub Safin(Xellos),

• Pavel Sheftelevich (shef_2318),

• Devendra Agarwal(devu),

• Egor Bobyk(EG0R),

• Vasia Antoniuk(Antoniuk)

Problem Tester:

Mugurel Ionut Andreica (mugurelionut)

Editorialist:

Lalit Kundu (darkshadows)

Russian Translator:

Sergey Kulik (CherryTree)

Mandarin Translator:

Gedi Zheng (gediiiiiii)

Contest Admin:

Praveen Dhinwa (PraveenDhinwa)

It promises to deliver on an interesting set of algorithmic problems with prizes up for grabs. The contest is open for all and those, who are interested, are requested to register in order to participate.

Check out the local time in your City/Time Zone here.

Good Luck! Hope to see you all on the scoreboard.

How to find length of cycle in undirected graph?

1 -------2-------3

|       |

     |       |

     4-------5

Here nodes 2,3,4 and 5 form cycle, so length of cycle is 4. Plz provide an algorithm to find length of cycle. I am unable to reach a solution for it.

vector<pair<int, int> > adj[105];

I am assigning the adjacent vertex of u : v and the weight of edge uv : w by adj[u].push_back(make_pair(v,w)). Now how to access the elements( first and second of pair). Plz expain this in detail as I did not get much useful on net.