#include <stdio.h>
int main(int argc, char **argv)
{
if (argc<1) {
printf("Usage: %s number\n",argv[0]);
return -1;
}
int digits=1, i=atoi(argv[1]);
while (i/=10) ++digits;
printf("%d\n",digits);
}
no thanks
One way to do this is to convert the number to a String, then use the corresponding String method to find out the length of the String.
5
There are many shell programs that will find the sum of the square of individual digits of a number. A small example is: SD=3n=2, sum=2, and SD=2.
k
An Armstrong number (or narcissistic number) for a given number of digits is a number that is equal to the sum of its own digits raised to the power of the number of digits. Here’s a simple Visual Basic 10 program that checks for Armstrong numbers: Module ArmstrongNumber Sub Main() Dim num As Integer Dim sum As Integer = 0 Console.Write("Enter a number: ") num = Convert.ToInt32(Console.ReadLine()) Dim temp As Integer = num Dim digits As Integer = num.ToString().Length While temp > 0 Dim digit As Integer = temp Mod 10 sum += Math.Pow(digit, digits) temp \= 10 End While If sum = num Then Console.WriteLine(num & " is an Armstrong number.") Else Console.WriteLine(num & " is not an Armstrong number.") End If End Sub End Module This program takes a number as input, calculates the sum of its digits raised to the power of the number of digits, and checks if the sum equals the original number.
class Sum_Of_Digits { public static void printSumandnoofdigits(int n) { int temp = n; int count = 0; int sum = 0; while ( n > 0 ) { sum = sum + n % 10; n = n / 10; count ++; } System.out.println("The number is..." + temp ); System.out.println("The sum of digits is..." + sum); System.out.println("The number of digits is..." + count); } }
Shell problems are programs that can be run to find out information about numbers. The problem can help find an even or odd number, or what the sum of a cube is.
You can use the Math.sqrt() method.
You can create a Shell script to find the smallest digit of a number by iterating through its digits. Here's a simple example: #!/bin/bash read -p "Enter a number: " number smallest=9 for (( i=0; i<${#number}; i++ )); do digit=${number:$i:1} if (( digit < smallest )); then smallest=$digit fi done echo "The smallest digit is: $smallest" This script prompts the user for a number, checks each digit, and prints the smallest one.
Yes, do write, or if you're too lazy to your homework, use google.
Write your own prime number program and find out.