Friday, May 22, 2009
A bookie calls Shane Warne before the match between Kolkata KnightRiders and Rajasthan Royals.
Cell phone rings. Warne picks up.
Warne : hello
Bookie : I am ….... Here.
Warne : yes tell me
Bookie : how is the pitch
Warne : ya dry and good for batting
Bookie : I want u to loose today’s match
Warne : impossible
Bookie : I will pay u $200,000
Warne : will be difficult to make KKR win.
Bookie : I will pay u $250,000
Warne : May be I could help you by reducing the margin… u tell by what margin we should win… will be much more easier
Bookie : no KKR should win
Warne : OK. I will try my best
Bookie : no make it.
Warne : OK.
Bookie : what will be the score
Warne : 200, if we bat first
Bookie : no make it 120
Warne : Impossible. Agarkar and Kartik are playing.
Bookie : 120 no change.
Warne : I will try
Bookie : OK. If KKR bat first
Warne : 110
Bookie : no make it 175
Warne : no u are asking too much. Ganguli is playing.
Bookie : OK make it $300,000
Warne : This would be the toughest match in my life
Bookie : OK, deal is made.
Warne : yes
Bookie : bye.
Match starts KKR bats first. KKR score only 120 in 20 overs. During the lunch break Shane’s cell rings.
Warne : hello
Bookie : its me. why did KKR score only 120. Our deal was 175.
Warne : What can I do ? They run one when they could run three, defend full toss, get out on wide balls, all catches and shots… I mean, if there is any… exactly directed to the fielders. But I will tell you this, Knight Riders are too good at this , I tried re-arranging the field…but they never miss a fielder.
Bookie : still u could bowl more no-balls. We got only 53 extras.
Warne : I asked all my bowlers to bowl badly. I also made Smith and Asnodkar bowl.
Bookie : Okay… leave that… I want u to loose the match.
Warne : I will try.
Bookie : Rajasthan Royals should be all out for 110
Warne : OK.
Bookie : bye.
Warne is ready to face the last over his cell rings (he plays with his cell).
Warne : hello
Bookie : its me! . What are you upto ?
Warne : We tried the best we could
Bookie : OK forget it. I want u to loose the match
Warne : what can I do. Fate !!! Agarkar is bowling
Bookie : I don’t know… u are loosing
Agarkar bowls… Warne tries to hide his bat behind his back. But the ball hits the bat and goes to third man. So they take a single.
(cell rings)
Warne : sorry what can I do I was hiding my bat but still the ball comes and hit my bat. If I play much worse than this everybody will find out.
Bookie : (gets really tensed). OK I can understand. But please don’t take last two runs.
Warne talks to Carseldine. Agarkar bowls… a juicy full toss. Carseldine uses all his batting skills to restrict that one to a single. Scores are level.
(cell rings)
Bookie : OK. Past is past. Atleast finish it in a tie. I don’t know what u are going to do u are not taking a single or u give u’r bat to the umpire.
Warne : OK. OK. Don’t worry this time I will! see to it we are not taking the single. Let it be obvious also. I am not taking the single.
Agarkar bowls, unfortunately he bowls a no ball. RR wins the match.
Bookie goes mad and Shane warne faints in the field itself.
Moral – With a team like KKR, who needs to fix a match
Thursday, May 21, 2009
Lord Shiva in my dream
I had a pretty strange dream today morning which I remember well. I could very well conceive a story from that dream. The dream started with me planning to watch a movie called Arundhathi(I have not watched it till now) along with my family in my grandma's home. But a different movie plays up on the screen. The story was about Lord Shiva in some city(I don't remember the names in my dream) who's eyes are closed. He's meditating. His temple was the cynosure for foreign visitors. I happened to be in the movie as well. I want the Lord to open his eyes. And make him see this world. When I reach the temple, to my surprise he does open his eyes, and speaks something in English! That's when couple of foreigners appear out of nowhere. They inform me and a person with me(must be my friend) that, the specialty of the this God is that, God opens the eyes and speaks whatever they speak at a particular location in the temple. I couldn't believe it. And the Statue of the Lord fell down and shattered into pieces at the end of the dream.
Well, the story might appear raw. But when I spruce it up, it might turn into an intriguing story. May be a part of Time to Live.
Friday, May 15, 2009
Dr. Prince is the dean of computer science dept at Mistian University in Florida. He asks his students, Sam, Benny and Harry to find a book titled Time to Live and bring it to him. They find the book and take it to his home. To their surprise, they find Prince dead. They read the book, to find out what the professor had in his mind. The book starts with a professor asking his three trustable students to bring him a book and the three characters resemble them. In the book those three characters go in search of a treasure. Sam, Benny and Harry decide that, they should also try that fortune and follow the path of the characters in that book. What happens to them? Was this book a coincidence? Was their fate pre-written in a story book? All this unfolds in a gripping climax which goes back to the second world war era!
Hope I start this story next sem and finish it by the end of this year!
MySQL is a much more stable and faster database than Microsoft Access. MySQL is also open-source, which means that it is free.
And I have completed the project using MySQL. MySQL had become My SQL. Its much better than MS Access.
Thursday, April 23, 2009
This is my first worthy flash animation.
Have a check and do comment!
I know its pretty bad...
I was just checking the concept of onion(in flash) in this animation.
Monday, April 13, 2009
How to have different headers for different pages in the Same word document?
0 comments Posted by Deepak at 6:05 PM
It' pretty simple, Page Layout--->Break--->Section Break-->Next page.
Now in header, the link to previous check box becomes enabled. By unchecking it, I could have different headers for different pages.
Hope it was useful, if you were toying with so many complicated ideas instead of having different headers!
Sunday, April 12, 2009
The mule answered, "To live like this for 50 years is too much. Please, give me no more than 20." And it was so.
Then God created the dog, and told him, "You will hold vigilance over the dwellings of Man, to whom you will be his greatest companion. You will eat his table scraps and live for 25 years."
And the dog responded, "Lord, to live 25 years as a dog like that is too much. Please, no more than 10 years." And it was so.
God then created the monkey, and told him, "You are monkey. You shall swing from tree to tree, acting like an idiot. You will be funny, and you shall live for 20 years."
And the monkey responded, "Lord, to live 20 years as the clown of the world is too much. Please, Lord, give me no more than 10 years." And it was so.
Finally, God created Man and told him, "You are Man, the only rational being that walks the earth. You will use your intelligence to have mastery over the creatures of the world. You will dominate the earth and live for 20 years."
And the man responded, "Lord, to be Man for only 20 years is too little. Please, Lord, give me the 30 years the mule refused, the 15 years the dog refused, and the 10 years the monkey rejected." And it was so.
And so God made Man to live 20 years as a man, then marry and live 30 years like a mule working and carrying heavy loads on his back. Then, he is to have children and live 15 years as a dog, guarding his house and eating the leftovers after they empty the pantry; then, in his old age, to live 10 years as a monkey, acting like an idiot to amuse his grand children.
Tuesday, April 7, 2009
#include<stdio.h>
#include<conio.h>
void findpath(int);//function to find the path
void printpath();//function to print the path
int graph[13][13]=
//0 1 2 3 4 5 6 7 8 9 10 11 12
{0,1,0,0,0,0,0,0,0,0,0 ,0 ,0,//0
0,0,1,1,0,0,0,0,0,0,0 ,0 ,0,//1
0,0,0,0,0,0,0,0,0,0,0 ,1 ,0,//2
0,0,0,0,1,1,1,0,0,0,0 ,0 ,0,//3
0,0,0,0,0,0,0,0,0,0,0 ,1 ,0,//4
0,0,0,0,0,0,0,0,0,0,0 ,1 ,0,//5
0,0,0,0,0,0,0,1,0,0,0 ,0 ,0,//6
0,0,0,0,0,0,0,0,1,0,0 ,0 ,0,//7
0,0,0,0,0,0,1,0,0,1,1 ,0 ,0,//8
0,0,1,0,0,0,0,0,0,0,0 ,1 ,0,//9
0,0,0,0,0,0,0,0,0,0,0 ,0 ,1,//10
0,0,0,0,0,0,0,0,0,0,0 ,0 ,0,//11
0,0,0,0,0,0,0,0,0,0,0 ,0 ,0};//12
int i=0,j=0,k=0,temp=0;//k--->acts as a pointer to the queue cur path
int start_node=0;//stores the start node
int path[13][13];//stores the paths available
int curpath[13]={0,0,0,0,0,0,0,0,0,0,0,0,0};//queue of the path formed
int final[13]={0,0,0,0,0,0,0,0,0,0,0,1,1};//final state or not
int tot_paths[13]={0,0,0,0,0,0,0,0,0,0,0,0,0};//total paths available from a state
int path_count[13]={0,0,0,0,0,0,0,0,0,0,0,0,0};//paths that have been traversed
int flag_cycle;//it is a flag which is set to 1 if the current path has a cycle
int previ;
void main()
{
clrscr();
for(i=0;i<13;i++)
{
printf("\nPath %d:",i);
k=0;
for(j=0;j<13;j++)
{
path[i][j]=0;
if(graph[i][j]!=0)
{
printf("%d,",j);
tot_paths[i]++;
path[i][k++]=j;
}
}
}
printf("\n\n\nThe paths available are:\n");
findpath(start_node);
printpath();
for(temp=k-1;temp>=0;temp--)
{
if(tot_paths[curpath[temp]]<=path_count[curpath[temp]])
{
path_count[curpath[temp]]=0;
curpath[temp]=0;
k--;
}
else
{
k--;
findpath(curpath[temp]);
printpath();
}
}
getch();
}
void findpath(int start)
{
int count;
i=start;
count=path_count[i];
while(!final[i])//while final state is not reached
{
//check whether there is a cycle in the graph,if so skip it
if(checkpath(i))
{
curpath[k]=i;
i=previ;
return;
}
curpath[k++]=i;//add the node in the queue
path_count[i]++;//increment the path count
previ=i;
i=path[i][count];//move to the next node
count=path_count[i];//update count
}
//the same process is repeated for the final state
curpath[k++]=i;
path_count[i]++;
i=path[i][count];
count=path_count[i];
k--;
}
void printpath()//when this fn. ends temp should be equal to k
{
int temp1;
//check whether this path contains a cycle
//if so skip it
for(temp1=0;temp1<k;temp1++)
{
if(curpath[k]==curpath[temp1])
{
temp=k;
return;
}
}
printf("\n");
for(temp=0;temp<k;temp++)//don't change this variable temp,it is a global
variable!
{
printf("%d--->",curpath[tem]);
}
printf("%d",curpath[temp]);
}
int checkpath(int value)//checks whether there is a cycle
{
int temp1;
for(temp1=0;temp1<k;temp1++)
{
if(value==curpath[temp1])
return 1;
}
return 0;
}
