LAB: Phone number breakdown Given a long long integer representing a 10-digit phone number, output the area code, prefix, and li
1 answer:
The program illustrates the use of modulo operator.
The modulo operator (%) returns the remainder of a division.
<u>Take for instance: </u>
<em>The result of 4 % 3 is 1, because when 4 is divided by 3, the remainder is 1</em>
So, the program in C is as follows, where comments are used to explain each line
#include <stdio.h>
int main(){
//This declares all variables as integer
long phoneNumber, prefix,areaNum, lineNum;
//This gets input for phoneNumber
scanf("%ld", &phoneNumber);
//This prints the input for phoneNumber
printf("%ld", phoneNumber);
//This calculates the area code
areaNum = phoneNumber/10000000;
//This calculates the prefix
prefix = (phoneNumber/10000)%1000;
//This calculates the line numbers
lineNum = phoneNumber%10000;
#This prints the required area code
printf("\n(%ld)%ld-%ld\n", areaNum, prefix, lineNum);
return 0;
}
At the end of the program, the phone number breakdown is printed
See attachment for sample run
Read more about C programs at:
You might be interested in
Answer:
The function in C++ is as follows:
int isSorted(int ar[], int n){
if ( ||
){
return 1;}
if ( <
){
return 0;}
return isSorted(ar, n - 1);}
Explanation:
This defines the function
int isSorted(int ar[], int n){
This represents the base case; n = 1 or 0 will return 1 (i.e. the array is sorted)
if ( ||
){
return 1;}
This checks if the current element is less than the previous array element; If yes, the array is not sorted
if ( <
){
return 0;}
This calls the function, recursively
return isSorted(ar, n - 1);
}