How to make an nxn table program in python

................

Google is your friend.

Is this homework?

........

You did ask this question already here: http://forums.devshed.com/python-pr...our-524005.html

And I did give you a long and fairly complete answer there. What are you still having trouble with exactly?

Detailed explanation of looping in Python, using both recursion and iteration. HTH.

What have you tried with this problem so far? If you can post any code you've already written, we could give you advice on how to fix it, but we really can't do much for you without seeing what you've tried so far.

Final note: if and when you poat any code, remember to use code tags to preserve indentation. This is even more important in Python that in most languages, because indentation is used in the language itself rather than just being a programming convention.

Whats the code in python that would allow me to make an n x n times table. The program should get n from the user.could be like this.please suggest a less complicated code clearly

| 1 2 3 4
-------------------------
1 | 1 2 3 4
2 | 2 4 6 8
3 | 3 6 9 12
4 | 4 8 12 16

2. Write a function that given the string “original” create a new string “dramatic’ that has two consecutive copies of each letter from the original string. For example the string “argh” would appear “aarrgghh”

3. Write a function, sliding(word, num)that behaves as follows. It should print out each slice of the original word having length num, aligned vertically as shown below. A call to sliding(examples, 4) would produce:
exam
xamp
ampl
ples

1. Write a program that prints an n-level stair case made of text. The user should choose the text character and the number of stairs in the stair case
*
**
***
****

5. Write a function with a signature cheerlead(word) that prints a typical cheer as follows. The word robot:
Gimme an R
Gimme an O
Gimme a B
Gimme an O
Gimme a T
What did you give me?
ROBOT!!!

6. Write a program that reads a file named famous.txt and prints out the line with the longest length. In the case of a tie, you may print out only one of them. For example in the file:
Alan Turing
John von Neumann
Donald Knuth
Charles Babbage
Grace Hopper
your program should print out John von Neumann

Write robust exception handling so the program does not crash if the file is not available.

Find and print out all occurrences of the longest line.
For example if the file held:
Alan Turing
Jonn von Neumann
Donald Knuth
Charles Babbage
Grace Hopper
Pete van de Beck
your program should print out:
John von Neumann
Pete van de Beck

Don't make me call the mods