Welcome to the new platform of Programmers Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use it's exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
Hi people. I am not so good with pascal programing so I need to ask for help here. I have to write a program for the next example:
Whole number is symmetrical if is read from left to right, an from right to left.
Number is almost symmetrical if there is a digit of that number with which deletion this number becomes symmetrical.
Write a program which will: for given N (N less or equal 20) count how many almost symmetrical N-digit numbers are there.
Time limit is 10 seconds.
So if anybody can help me with this it would be great. Thank's forward