Udit Sanghi | Commonlounge

Follow

Udit Sanghi

I am Udit. I am 13. I love maths and programming. I hate school.

Tutorial

Discussions

Replies

Followers

Active In

International Olympiad in Informatics

96 replies. 8 discussions. Member

Competitive Programming

29 replies. 3 discussions. Member

Indian Computing Olympiad (ICO)

15 replies. 2 discussions. Member

Game Development

1 reply. Member

Python

1 discussion. Member

Sphere Online Judge (SPOJ)

5 replies. Member

Algorithms and Computer Programming

Member

International Mathematics Olympiad

Member

Unschooling & Open Learning

Member

ACM International Collegiate Programming Contest

Member

Featured Contributions

NaN.

discussion

Stunning SuhailIndian Computing Olympiad (ICO)6w

by Stunning Suhail

Hii, I got selected to IOITC this year. I only know topics of INOI like dp and bit of graph theory(since i got to know about ZIO & ZCO this year only and managed to get into INOI through ZIO. Can anybody suggest what should i do to prepare for IOITC

and please soon due to lack of time.

Read more…(68 words)

Copied

reply in this discussion

Udit SanghiAiming for gold. · 3w

IOITC syllabus > IOI syllabus

Read more… (5 words)

Copied

Contributed 100%

3.

tutorial

TutorialCompetitive ProgrammingLast updated 3 months ago

Tries Tutorial

Tries are some kind of rooted trees in which each edge has a character on it. For a bunch of strings, their trie is the smallest rooted tree with a character on each edge and each of these strings can be build by writing down the characters in the path from the root to some node.

This is a nice tutorial for tries - Trie (Keyword Tree) Tutorials & Notes

After reading this read this amazing tutorial here for tries on bits - Tutorial on Trie and example problems

Solve these problems now -

Problem DISUBSTR (classical)

Problem SUBXOR (explained in the blog)

Codeforces (nice)

Read more…(116 words)

Trie (Keyword Tree) Tutorials & Notes

https://hackerearth.com/practice/data-structures/advanced-data-structures/trie-keyword-tree/tutorial/

Tutorial on Trie and example problems

Given a Y, find maximum XOR of Y with all numbers that have been inserted till now. Let's say our subarray with maximum XOR ended at position i. If we have this data structure, we'll insert integers as we go, and with query of 2nd type we'll find the

https://threads-iiith.quora.com/Tutorial-on-Trie-and-example-problems

Problem DISUBSTR

http://spoj.com/problems/DISUBSTR/

Problem ORDERSET

http://spoj.com/problems/ORDERSET/

http://spoj.com/problems/SUBXOR/

http://codeforces.com/problemset/problem/271/D

http://codeforces.com/problemset/problem/455/B

http://codeforces.com/problemset/problem/282/E

http://codeforces.com/problemset/problem/842/D

http://codeforces.com/problemset/problem/665/E

Copied

4.

discussion

Udit SanghiInternational Olympiad in InformaticsLast updated 5 months ago

Fake organisations depreciating the value of olympiads

I'm signing because these money making fake organisations(SOF/Silverzone) have completely depreciated the value of real olympiads. Such a step was greatly needed and is finally initiated.

Petition · Organizations bringing down the prestige of "Olympiads" in India · Change.org

Read more…(39 words)

Petition · Organizations bringing down the prestige of "Olympiads" in India · Change.org

https://change.org/p/science-olympiad-foundation-organizations-bringing-down-the-prestige-of-olympiads-in-india

Copied

NaN.

discussion

Rishik SoodCompetitive Programming24w

Zco 2018by Rishik Sood

Zco 2018 questions:

1) You have C cakes and N children and k. Each child has a range between Si and Ei inclusive. A child will eat all the cak...

Read more…(324 words)

Copied

reply in this discussion

Udit SanghiPurple on cf. · 23w

I think around 200.

Read more… (4 words)

Copied

NaN.

discussion

Rishik SoodCompetitive Programming24w

Zco 2018by Rishik Sood

Zco 2018 questions:

1) You have C cakes and N children and k. Each child has a range between Si and Ei inclusive. A child will eat all the cak...

Read more…(324 words)

Copied

reply in this discussion

Udit SanghiPurple on cf. · 24w

I think it will be around 10-50

Read more… (7 words)

Copied

NaN.

discussion

Rishik SoodCompetitive Programming24w

Zco 2018by Rishik Sood

Zco 2018 questions:

1) You have C cakes and N children and k. Each child has a range between Si and Ei inclusive. A child will eat all the cak...

Read more…(324 words)

Copied

reply in this discussion

Udit SanghiPurple on cf. · 24w

Everyone pls update your scores here- Google Sheets

Read more… (8 words)

Copied

NaN.

discussion

Keshav DhandhaniaInternatio…2y

Chewing (ZCO 2013: India)by Keshav Dhandhania

Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.

Read more…(17 words)

Copied

reply in this discussion

Udit SanghiAiming for gold. · 25w

Just use 2-pointer technique instead of binary search

Read more… (8 words)

Copied

NaN.

discussion

IOITC BotIndian Com…1y

Tree Man (IOITC 2015, Test 4)by IOITC Bot

Read more…

Copied

reply in this discussion

Udit SanghiAiming for gold. · 27w

Any hints?

Read more… (2 words)

Copied

NaN.

discussion

Keshav DhandhaniaInternatio…2y

Catering Contracts: Version 2π (IOI Training Camp 2008: India)by Keshav Dhandhania

Problem in short:

Given a tree with N vertices, and 1 ≤ K ≤ N, we want...

Read more…(47 words)

Copied

reply in this discussion

Udit SanghiAiming for gold. · 27w

Can u explain ur approach for these constraints?

Read more… (8 words)

Copied

NaN.

discussion

Bhuwan ChandraInternational Olympiad in Informatics28w

My experience with ICO prep series #1by Bhuwan Chandra

Yesterday night I went to the nearby cyber cafe to attend the first programming contest of my life. But I had to complete ...

Read more…(255 words)

Copied

reply in this discussion

Udit SanghiAiming for gold. · 28w

Actually we debated long on this topic. I wanted for it to be the same as LTIME that is 7:30-10:30 but I was out voted.

Read more… (25 words)

Copied

Load More