Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
C Program for DIVISER
void main()
{
int result,number,min;
clrscr();
printf("ENTER THE NUMBER=");
flushall();
scanf("%d",&number);
min=1;
while (min<=number)
result=number%min;
if(result==0)
printf("THE NUMBER IS DIVISIBLE BY=%d\n",min);
}
min=min+1;
getch();
OUTPUT :
ENTER THE NO: 10
THE NO IS DIVISIBLE BY : 1
THE NO IS DIVISIBLE BY : 2
THE NO IS DIVISIBLE BY : 5
THE NO IS DIVISIBLE BY : 10
Write a function that has int parameter n, makes another type of mask having n bit 1's from the left most bit and 32- n bit 0's next. The mask is called netmask in this seminar, an
Imagine that the server program is a setuid program owned by the root, then after you penetrate the program with a shell running, you become the ROOT and you can remove the whole f
how to write a program using arrays
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with thes
1. Jewels can only be removed for polishing from either end of the necklace (i.e. head or tail) 2. Once a jewel type is removed from the necklace, all other instances of the same j
write a program to find the minimum number of shelves
For the circuit shown in Figure, verify the p.d. across resistor R3. If the total resistance of the circuit is 100Ω, verify the current flowing by resistor R1. Find also the
how yo use the friend function?
#questionHi, I am looking for help with the assignment, can you help..
how to write c code to solve assignment problem?
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd