Skip to main content

Write a program to take a number and display highest factor for that number.

    1:  using System;
   2:  namespace st
   3:  {
   4:      class HighestFactor
   5:      {
   6:          static void Main()
   7:          {
   8:              Console.Write("Enter a number :");
   9:              string input = Console.ReadLine();
  10:              int num = Int32.Parse(input);
  11:              for (int i = num / 2; i > 0; i--)
  12:              {
  13:                 if (num % i == 0)
  14:                 {
  15:                   Console.WriteLine("Highest factor for {0} is {1}", num, i);
  16:                   break;
  17:                 }
  18:              } // for
  19:          } // main
  20:     } // class
  21:  } // namespace




Technorati Tags:

Comments

Popular posts from this blog

WAP to calculate the monthly telephone bills as per the following rule: Minimum Rs. 200 for upto 100 calls. Plus Rs. 0.60 per call for next 50 calls. Plus Rs. 0.50 per call for next 50 calls. Plus Rs. 0.40 per call for any call beyond 200 calls.

  #include<iostream.h> #include<conio.h> void main() { int calls; float bill; cout<<" Enter number of calls : "; cin>>calls; if (calls<=100) bill=200; else if (calls>100 && calls<=150) { calls=calls-100; bill=200+(0.60*calls); } else if (calls>150 && calls<=200) { calls=calls-150; bill=200+(0.60*50)+(0.50*calls); } else { calls=calls-200; bill=200+(0.60*50)+(0.50*50)+(0.40*calls); } cout<<" Your bill is Rs. "<<bill; getch(); }   Output: Enter number of calls : 190 Your bill is Rs.250

Write a program to calculate the total expenses. Quantity and price per item are input by the user and discount of 10% is offered if the expense is more than 7000.

  #include<iostream.h> #include<conio.h> void main() { int totalexp, qty, price, discount; cout<<" Enter quantity: "; cin>>qty; cout<<" Enter price: "; cin>>price; totalexp=qty*price; if (totalexp>7000) { discount=(totalexp*0.1); totalexp=totalexp-discount; } cout<<" Total Expense is Rs. "<<totalexp; getch(); }