Click here to read interesting article

Click Here

It appeared 2day. Anyone wanna go ??? Rush, Last date for registration is 18th Jan
Delhi Times, Jan 15 2005

Click here to read

–Karan

Seems like Apple had finally started to target the masses. Unveiled at the Macworld Conference in San Franciso were two products – the must speculated flash iPod – named the iPod shuffle and a $499 computer. The iPod Shuffle has no display. The 512 MB version costs $99 while the 1 GB version costs $149. You have to get your own monitor, keyboard and mouse for the Mac Mini

Mac Mini



iPod Shuffle

For more photos, take a look at CNET’s photo galleries

iPod Shuffle

Mac Mini

or visit Apple

– Bharat

Can Mr. Gopal Kumar kindly explain why there is a sign on Egurucool lab, which in expensive glossy color print out says “Exun is ON” ??

I mean, seriously, what’s the point? This isn’t some faaltu wasteful club we are in.

Abhishyk Gaur’s views on this were accurate enough, but should not be repeated in decent public.

I have been thinking.First of all, gaming competitions are there in generally every symposium and carry many points. Exun has been exceptional in every kind of event this session except gaming. Therefore, the dormancy of Domain Square has to end. Domain square is dormant throughout the session except the time when the intra school competition is hosted. This year many gamers flocked Computer Lab 6 and played Unreal Tournament. In the upcoming session, DomainSquare members will be recruited in two fields. One will be The FPS field which will also consist of racing and the other the RTS field. Members can be Exun or non-Exun(preferably non-Exun). It is seen that the most unexpected people turn out to be great gamers. Existing members do note this post and prepare yourself!!!

–Cheerio

Manas Gautam(IX-B)

We bagged the overall trophy! A magnificent achievement considering the strength of the team we had there.

SP – 1st

* Raman

* Nikhil

JP – 1st

* Rahul Bhatnagar

Quiz – 2nd

* Bharat

* Ishaan

Crossword – 2nd

* Bharat

* Ishaan

Gaming – 2nd

* Varun Kumar

GD – 3rd

* Varun Kumar

A magnificent effort considering that he was informed at the last moment.

This guy should be in exun. as it is, we are a little short on gamers

Ringtone Composition – 2nd

* Akul

* Saumya

Surprise Event – 2nd

* Whole Team

The surprise event was weird, with us having to go around with the help of clues, find a CD which contained Earth v3.14, which was in a parallel universe. Ramjas Pusa Road just pipped us. I am not in favour of such Tecathlon type events.

Congratulations Everyone! Once again, i wish we had more victories instead of 2nd places.

We also got a wireless logitech keyboard and mouse for our efforts.

Quiz – 2nd

* Bharat & Ishaan

MIS came first. very disappointed.

Srajan and Akshay also qualified, but they came 4th.

The quiz was pathetic, it had only 4 rounds and was over in half an hour. The quizmaster wasn’t the best ever and the questions weren’t anything to ride home about.

Crossword – Both teams qualified

* Bharat & Ishaan

* Vansh & Srajan

Gaming – 2nd

* Varun Kumar

GD – 2nd

* Varun Kumar

I am not so sure about this event though.

Ishita was absent from the event.

Jr Presentation – No position

* Vansh & Rijul

Jr Programming – 1st

* Rahul Bhatnagar

Mohit Deep Singh was not present at the event.

Now for the Surprise Event

It’s the same as the Techathlon… but we are making very good progress in it. It’s all based on H2G2. The only differnce is that the clues are everywhere, not just the events.

I am a little disappointed with the no of 2nd finishes, winning it makes it so much better

First of all, a happy new year to all of you

Now, here is program which should be tried by junior as well as senior programmers(though they might too busy even to visit the site)

This problem is about sequences of positive integers a1,a2,…,aN.

A subsequence of a sequence is anything obtained by dropping some

of the elements. For example, 3,7,11,3 is a subsequence of

6,3,11,5,7,4,3,11,5,3 , but 3,3,7 is not a subsequence of

6,3,11,5,7,4,3,11,5,3 .

A fully dividing sequence is a sequence a1,a2,…,aN where ai divides aj whenever i < j. For example, 3,15,60,720 is a fully dividing
sequence.

Given a sequence of integers your aim is to find the length of the

longest fully dividing subsequence of this sequence.

Consider the sequence 2,11,16,12,36,60,71,17,29,144,288,129,432,993 .

It has two fully dividing subsequences of length 5,

2,11,16,12,36,60,71,17,29,144,288,129,432,993 and

2,11,16,12,36,60,71,17,29,144,288,129,432,993

and none of length 6 or greater.

Input format

The first line of input contains a single positive integer

N indicating the length of the input sequence. Lines 2,…,N+1

contain one integer each. The integer on line i+1 is ai.

Output format

Your output should consist of a single integer indicating

the length of the longest fully dividing subsequence of

the input sequence.

Test Data

You may assume that N = 10000.

Example:

Here are the inputs and outputs corresponding to the two examples

discussed above.

Sample input 1:

9

2

3

7

8

14

39

145

76

320

Sample output 1:

3

Sample input 2:

5

2

4

6

18

54

Sample output 2:

4

For test data and hints send me an email at ramankhatri@indiatimes.com.

—————————————————————–

PS:I have test data which contain as many as 10000 numbers. To check

my program for these large inputs , I need to read them directly

from the *.dat files(i bet nobody can type 10000 nos) .

Can somebody tell me how to do this???