emu in blogjava

:: 管理 ::

171 隨筆 :: 103 文章 :: 1052 評(píng)論 :: 2 Trackbacks

FactorialSystem (code jam china round2 300分真題)

Problem Statement

In the factorial number system the value of the first digit (from the right) is 1!, the value of the second digit is 2!, ..., and the value of the n-th digit is n!. This means that any decimal number d can be written in this system as: a_na_n-1...a₂a₁, where

d = a_n * n! + a_n-1 * (n-1)! + ... + a₂ * 2! + a₁ * 1! and 0 <= a_i <= i for all i.

Given an int num in decimal, return its representation in the factorial number system.

Definition

Class:	FactorialSystem
Method:	convert
Parameters:	int
Returns:	int
Method signature:	int convert(int num)
(be sure your method is public)

Notes

n! = 1 * 2 * ... * n

Constraints

num will be between 1 and 3628799 (10!-1), inclusive.

Examples

Returns: 1

Returns: 1000

24 = 4!

Returns: 11111

153 = 1! + 2! + 3! + 4! + 5!.

Returns: 10201

Returns: 987654321

Largest possible input.

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.

posted on 2005-12-23 10:26 emu 閱讀(1350) 評(píng)論(4) 編輯收藏所屬分類: google編程大賽模擬題及入圍賽真題

評(píng)論

# re: FactorialSystem (code jam china round2 300分真題) 2006-07-28 08:29 peng he

#include<stdio.h>
void main()
{int i, a;
scanf("%d",&a);
for(i=2;a/i!=0;i++)
{printf("%d",a%i);
a=a/i;

}

} 回復(fù) 更多評(píng)論

# re: FactorialSystem (code jam china round2 300分真題) 2007-06-09 15:39 匿名

@peng he
你這編的什么東西呀

題目意思理解清楚沒有呀回復(fù) 更多評(píng)論

# re: FactorialSystem (code jam china round2 300分真題)[未登錄] 2007-09-08 22:44 a

package factorial;
import java.util.LinkedList;
public class Factorial {

public static void main(String[] args) {
StringBuffer sb=new StringBuffer();
LinkedList<Integer> al=new LinkedList<Integer>();
int m=445;
int z=1;
int fZ=z;
al.add(fZ);
while(m/fZ>0)
{
z++;
al.addLast(al.getLast()*z);
fZ=al.getLast();

}
int n=z-1;
for(int i=n;i>=1;i--)
{

int temp=m/al.get(i-1);
m-=temp*al.get(i-1);
sb.append(temp);
}
System.out.println(sb.toString());

}

}
回復(fù) 更多評(píng)論

# re: FactorialSystem (code jam china round2 300分真題) 2008-10-12 21:45 zgqchina

#include<iostream>
using namespace std;

long factrial(int n) //求階乘,n>0
{
if(n==1) return 1;
else
return n*factrial(n-1);
}

int k=0,a[9]; //全局變量 K用來計(jì)數(shù)，數(shù)組用來存放數(shù)列

void convert(double num) //轉(zhuǎn)換成數(shù)列
{
int n=9;
while((num>0)&&(n>=1))
{
int m=factrial(n);
if(num<m)
a[k]=0;
else
{
for(int p=n;p>=1;p--)
if(num>=p*m)
{
a[k]=p;
break;
}
num=num-p*m;
}
n--;
k++;
}
}

void main()
{
cout<<"please input a number(num will be between 1 and 3628799) :"<<endl;
double temp;
cin>>temp;
cout<<"now the result is :"<<endl;
convert(temp);
int i=0;
while(a[i]==0) i++;
for(i;i<9;i++)
cout<<a[i]<<" ";
} 回復(fù) 更多評(píng)論

新用戶注冊(cè) 刷新評(píng)論列表


只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。




網(wǎng)站導(dǎo)航: 博客園 IT新聞 Chat2DB C++博客博問管理
相關(guān)文章: 沒忍住手癢做了一道題，結(jié)果還沒作對(duì)。差點(diǎn)被燕潘考倒了 1000分模擬題CraneWork 500分模擬題 MaximalPalindromeSubstrings 250分模擬題 SalesRouting SecretSum (code jam china round2 500分真題) FactorialSystem (code jam china round2 300分真題) RecurringNumbers (code jam china 1000分真題) google中國編程挑戰(zhàn)賽入圍賽真題 -- HardDuplicateRemover(1000分) google中國編程挑戰(zhàn)賽入圍賽真題 -- BlockStructure(500分)

emu in blogjava

公告

常用鏈接

留言簿(92)

隨筆分類(20)

隨筆檔案(171)

文章分類(89)

文章檔案(103)

相冊(cè)

收藏夾(46)

友情連接

收藏

搜索

積分與排名

最新評(píng)論

閱讀排行榜

評(píng)論排行榜