这题还没搞清楚那个输出格式是什么意思。。把格式输出摘了别人了。计算自己实现的。惭愧
#include <iostream>
using namespace std;
int    n;
__int64   f[6000];
void  init( )
{
f[1] = 1;
int  a, b, c, d;
a = b = c = d = 1;
for (int i=2; i<=5842; i++)
{
f[i] = min( min(2*f[a], 3*f[b]), min(5*f[c], 7*f[d]));
while (2*f[a]<=f[i]) a++;
while (3*f[b]<=f[i]) b++;
while (5*f[c]<=f[i]) c++;
whi

http://acm.swjtu.edu.cn/JudgeOnline/showproblem?problem_id=1617

我先开始对每种情况进行递归从前往后推：

#include<stdio.h>
#include<string.h>
int m, n, i, j, k;
double f[101][101];
int main()
{
 while(scanf("%d%d",&m, &n)!=EOF)
 {
  memset(f, 0, sizeof(f));
  f[1][1] = 1;
  for (i=2;i<=n; i++)
   for (j=1;j<=m; j++)
   {
    for (k=1; k<=m; k++)
    {