Write a shell program to test whether the given number is a perfect number or not.
#includeseq 1 2 99
Write a C program to Draw a RAINBOW and fill the suitable colors ...
1. Get any no. 2. Find it factors. 3. Add its factor. 4. If sum of its factors is equal to itself then it is a perfect no. otherwise not
Step 1. Learn the word "Fibonacci"...
you can use strstr()
give description of that then i will send the answer
abhimanyu
k
substracion of any two number program in c
no thanks
use python, shell is stupid
Avogadro's number is a constant. Therefore only one number is equal to Avogadro's number.
You don't need a shell script to do this; use the 'grep' command with the '-c' option to count the number of occurrences of some pattern.
class perfect{public static void main(int n) // input as parameter{int a=0;for(int i=1;i
The future perfect tense of the verb to write is will have written.
seq 1 2 99
"Had written" is the past perfect tense of "write".