Answer: Following code is in python
n=input()
num='1'
while int(num)<=int(n): //loop from 1 to n
flag=1 //if an unequal element will be found it will be 0
l=len(num)
if num[0]=='3':
j=0
k=l-1
while j<k: //loop till middle of number
if num[j]==num[k]:
j+=1 //from beginning
k-=1 //from end
else:
flag=0
break
if flag==1:
print(int(num))
num=str(int(num)+1) //number will be incremented as integer
INPUT :
1000
OUTPUT :
3
33
303
313
323
333
343
353
363
373
383
393
Explanation:
In the above code, a loop is executed till num is equal to n which is entered by the user. num is treated as a string so that to ease the process of checking first character is 3 or not. If it is 3 then another loop executes which checks if an element from starting is equal to the corresponding element from the end. If an element is not equal then the flag is changed and then we break out of the loop and prints the number if the flag isn't changed.
I think it's the lest one: Rights given to original authors and creators to protect their work from unlawful use
The Fill color tab. Hope this helps!
Answer:
True
Explanation:
<u>Algorithm for push function</u>
The method of placing data on a stack is called a push operation.
It involves these steps −
- Check that the stack is complete.
- If the stack is complete, it will cause an error .
- Increases top to point next empty room if the stack is not complete.
- Adds the data component to the place of the stack where top is pointing.
<u>Algorithm for Insertfirst function</u>
- Create a new Link with provided data.
- Point New Link to old First Link.
- Point First Link to this New Link.
As we can see that in both algorithms ,we are inserting data to a new nodes and incrementing/pointing to a new node for inserting data.Both algorithms uses the same approach.
