Your posted o/p does not match with the problem's o/p section.Output will consist of a series of blocks of lines, one block for each line of the input. Each block will start with the number N, right justified in a field of width 3, and the chracters `!', space, and `='. This will be followed by a list of the number of times each prime number occurs in N!.
Code: Select all
Code DeletedCode: Select all
80
70
30
50
100
0
Code: Select all
80! = 78 36 19 12 7 6 4 4 3 2 2 2 1 1 1
1 1 1 1 1 1 1
70! = 67 32 16 11 6 5 4 3 3 2 2 1 1 1 1
1 1 1 1
30! = 26 14 7 4 2 2 1 1 1 1
50! = 47 22 12 8 4 3 2 2 2 1 1 1 1 1 1
100! = 97 48 24 16 9 7 5 5 4 3 3 2 2 2 2
1 1 1 1 1 1 1 1 1 1
Thx for considering my problem. However, I still can't find out wt's wrong with my output section - and for the test case you've given, my program gives exactly the same output.abdullah<cse du> wrote:henry1007,
Your output section is not correct. Another wrong is that- you take all the input and after getting the zero input you give output. It is not necessary. Take a input and give output. I give some input for test.
Code: Select all
80 70 30 50 100 0Code: Select all
80! = 78 36 19 12 7 6 4 4 3 2 2 2 1 1 1 1 1 1 1 1 1 1 70! = 67 32 16 11 6 5 4 3 3 2 2 1 1 1 1 1 1 1 1 30! = 26 14 7 4 2 2 1 1 1 1 50! = 47 22 12 8 4 3 2 2 2 1 1 1 1 1 1 100! = 97 48 24 16 9 7 5 5 4 3 3 2 2 2 2 1 1 1 1 1 1 1 1 1 1
Code: Select all
#include<stdio.h>
#include<math.h>
int prime[10000]={0};
void gen()
{
long i=0,j=0,chk=1,index=3;
prime[0]=1;
prime[1]=2;
prime[2]=3;
for(j=5;j<=10000;j++)
{
for(i=1;prime[i]<=sqrt(j);i++)
{
chk=j%prime[i];
if(chk==0)
break;
}
if(chk)
prime[index++]=j;
}
}
int main()
{
int i,k,p,j;
int fact,sum=0,count=0;
gen();
while(scanf("%d",&fact)&&fact!=0)
{
count=0;
printf("%3d ! = ",fact);
for(i=1;prime[i]<=fact;i++)
{
sum=0;
for(j=1;j<10000;j++)
{
p=pow(prime[i],j);
if(p>fact)break;
else
{
sum+=floor(fact/p);
}
}
if(count>=15)
{
printf("\n");
printf(" ");
count=0;
}
printf("%3d ",sum);
count++;
}
printf("\n");
}
return 0;
}Code: Select all
#include <iostream>
#include <vector>
#include <map>
#include <iomanip>
#include <list>
using namespace std;
void get_prime_factors(const int& n, vector<int>& v)
{
int k(n);
for(int i=2; k!=1; ++i)
{
while(k%i == 0)
{
v.push_back(i);
k/=i;
}
}
}
map<int, map<int, int> > _dec;
void set_dec()
{
_dec[1][2] = 0;
_dec[2][2] = 1;
vector<int> v;
for(int n=3; n<=100; ++n)
{
get_prime_factors(n, v);
const int SIZE(v.size());
_dec[n] = _dec[n-1];
for(int j=0; j<SIZE; ++j)
{
_dec[n][v[j]]++;
}
v.clear();
}
}
int main()
{
set_dec();
int n;
cin >> n;
vector<int> v;
while(n!=0)
{
v.push_back(n);
cin >> n;
}
const int SIZE(v.size());
for(n=0; n<SIZE; ++n)
{
cout.setf(ios::right);
cout << setw(3) << v[n] << "! =";
int count(0);
int space(3);
for(map<int, int>::iterator i(_dec[v[n]].begin());
i!= _dec[v[n]].end(); ++i)
{
cout << setw(space) << i->second << flush;
count++;
if(count % 15 == 0)
{
cout << endl;
space = 9;
}
else
{
space = 3;
}
}
cout << endl;
cout.unsetf(ios::right);
}
return 0;
}
