Indian Dancing Video Clips

Nhạc Ấn Độ

Ấn Độ là đất nước cũa những lễ hội và điệu nhảy bất tận. Sau đây là những điệu nhảy đẹp mê hồn, nóng bỏng mang đậm bản sắc văn hóa — lễ hội Ấn, cùng những bản tình ca bất diệt được thể hiện qua những điệu nhảy này.

The fol­low­ing is some of my favorite danc­ing video clips fea­tur­ing the cul­ture and fes­ti­val of the coun­try of India. You will love these → more »

A story of Tree, Leaf, and Wind

I read this story sev­eral years ago, and still enjoy it. It was told that the story was orig­i­nally from a stu­dent in Tai­wan, yet I don’t know. Here it is…

Leaf depar­ture is because of Wind pur­suit. Or because Tree didn’t ask her to stay?

Tree

The rea­son I’m called Tree is because I’m good at paint­ing trees. Over time, I started to use a tree on the right hand cor­ner as a trade­mark for all my water­color paint­ings. I dated five girls when I was in Pre-University. There’s one girl whom I really love a lot. How­ever, I never dared to woo her. She doesn’t have a pretty face, a good fig­ure or out­stand­ing charm. She is just a very ordi­nary girl. more »

Tower of Hanoi

1. Intro

Tower of Hanoi’ is a well-known puz­zle pre­sented in many CS text­books. These the rules:
– The are 3 poles A, B, and C.
– n disks are on pole A with the con­i­cal shape (the largest disk is at the bot­tom, then the smaller ones upper, and the small­est on top).
– You job is to move the entire n disks from pole A to pole C (the same con­i­cal shape as the final result) using 3 poles while obey­ing the rules:

+ only one disk is moved at a time
+ no disk is allowed to be placed on top of a smaller one

2. Tips to solve the game

This sim­ple and easy-to-follow guide will guar­an­tee you the least moves (and time if you prac­tice) to achieve the result:

[ Don’t look at this if you pre­fer try­ing the game first ] more »