Showing posts with label maths. Show all posts
Showing posts with label maths. Show all posts

Monday, December 3, 2012

Find the factorial of given number

The trick here is to realize that the limiting case is the number of times five will be a factor of X!, as 5*2 = 10, and any time the number is multiplied by 10, there will be an additional trailing zero. Due to the abundance of even numbers, there are plenty of spare twos that are factors of any number. The trick is that the number of trailing zeros in X! is the number of times five divides into the number, plus the number of times 25 divides into the number, plus the number of times 125 divides into the number, and so forth. (25 is 5*5, so when five is divided into the number, that still leaves a single 5 remaining as a factor.) 

#include <iostream>
using namespace std;

int main()
{
 int factorialnumber = 0;
 cout<<"Please enter a number: ";
 cin>>factorialnumber;
 int zero_count = 0;
 for(int five_factor=5; 
     five_factor<=factorialnumber; 
     five_factor*=5)
 {
  zero_count += factorialnumber/five_factor;
 }
 cout<<"Trailing zeros of "<<factorialnumber;
 cout<<"! is "<<zero_count<<endl;
}
Many other solutions exist! If yours doesn't match the Learn4Develop key, but it still works, let us know and we'll upload it as an alternative answer.

String Permutation programm using c++

First of all i like to say this is a little bit advanced programme for beginners who can't understand the code looking at that.. You try to understand the code than definitely you will write code without plagiarism. :) 

The trick to string permutations is to find all permutations that begin with one letter, then all permutations that begin with a second letter, and so forth. This might suggest a recursive solution: in order to find all permutations that begin with a given letter, call permute on the remainder of the string, thereby finding all permutations of the substring using the same algorithm.

permute string
and output should be a word per line.
Here is a sample for the input cat:
cat
cta
act
atc
tac
tca

#include <iostream>
#include <string>
using namespace std;

string swtch(string topermute, int x, int y)
{
 string newstring = topermute;
 newstring[x] = newstring[y];
 newstring[y] = topermute[x]; //avoids temp variable
 return newstring;
}
void permute(string topermute, int place)
{
 if(place == topermute.length() - 1)
 {
  cout<<topermute<<endl;
 }
 for(int nextchar = place; nextchar < 
     topermute.length(); nextchar++)
 {
  permute(swtch(topermute, place, nextchar),
          place+1);
 }
}

int main(int argc, char* argv[])
{
 if(argc!=2)
 {
  cout<<"Proper input is 'permute string'";
                return 1;
 }
        permute(argv[1], 0);
}
Many other solutions exist! If yours doesn't match the Learn4Develop key, but it still works, let us know and we'll upload it as an alternative answer. For instance, if you have a solution that doesn't use the string library, or if you use only C++ i/o, let us know so that we can upload it as an example for those who haven't learned about certain topics.