南阳OJ 阶乘因式分解

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
	int n,m;
	while( scanf("%d%d",&n,&m)!=EOF )
	{
		int cnt=0;
		int i;
		for(i=1;i<=n;i++)
		{
			if(i%m==0)
			{
				int k=i;
				while(k>=m&&k%m==0)
				{
					k=k/m;
					cnt++;
				}
			}
		}
		printf("%d\n",cnt);
	}
	return 0;
}下面是方法二

<pre name="code" class="cpp">#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;

int main()
{
	int n,m;
	int k;
	while( scanf("%d%d",&n,&m)!=EOF )
	{
		int sum=0;
		for( k=n/m;k!=0; )
	    {
	 	  n=k;
		  sum+=k;
		  k=n/m;
	    }
		printf("%d\n",sum);
	}
	return 0;
}