#include<stdio.h>
#include<conio.h>
void main()
{
int no, ans;
clrscr();
printf(input no. \n");
scanf("%d", &no);
while(no!=0)
{
n=no%10;
no=no/10;
printf("%d",n);
}
getch();
}
[object Object]
file is a set of data and program that has been given a name
If they are being kept in case there is a chance of losing the originals, they are called backups. Otherwise they can just be referred to as copies.
Fan-in and Fan-out metrics are structural metrics which measure inter-module complexities. Fan-in: the number of modules that call a given module Fan-out: the numbers of modules that called by a given module
a page
At the lowest level, "machine code". At the Highest level, "a program".
reverse programe in fox pro
write the javascript code to display the reverse no. of given no. (e.g. 247 reverse of 742)
123
echo "enter the number" if [ $# -ne 1 ] then echo "Usage: $0 number" echo " I will find reverse of given number" echo " For eg. $0 12321, I will print 12321" exit 1 fi n=$1 rev=0 sd=0 while [ $n -gt 0 ] do sd=`expr $n % 10` rev=`expr $rev \* 10 + $sd` n=`expr $n / 10` done echo "Reverse number is $rev"
You write the number and then follow it with the digits in reverse order.
The reverse lookup is a telephone number data base. Instead of looking up a phone number based on a given name, a name can be looked up based on a given phone number. It is useful when receiving phone calls from an unknown phone number.
#include #include void main() { int rev num=0; while(num>0) { rev num=rev num*10+num%10; num=num%10; } return rev_num; } int main(); { int num=4562; printf("reverse of number is%d",reverse digit(num)); getch(); return o; }
sdfsdfsfsggbcvbg
A mirror prime.
#include <stdio.h> #include<conio.h> void main () { int a,r,n,sum=0; clrscr(); printf("enter the number"); scanf("%d",& n); c=n while (n!=0) { a=n%10; n=n/10; sum=sum*a+a } printf("the reverse is %d \n",sum); if(c==sum) printf("\n the given number is palindrome"); else printf("\n the given number is not a palindrome"); getch(); }
8086 assembly language program to check wether given number is perfect or not
To reverse a number, first convert the number to a string, then reverse the string. Given your number consists of alphanumeric characters, the number must already be a string so simply reverse the string: #include<string> using std::string; string reverse (const string& s) { string str {}; for (auto c : s) str.insert (str.begin(), c); return str; } int main () { std::cout << "Enter a number: "; string s {}; std::cin >> s; std::cout << "The number in reverse is: " << reverse (s); }