Module: 数论


Problem

1 /2


将数字分解为 5 和 3

Problem

一个数可以展开多少个五和三，这样展开的次数最少。

输入
输入是单个自然数 N (\(7 < N < 1000\)).

印记
打印两个以空格分隔的整数：五的个数和三的个数。
<分区> 

 

例子
<头> <正文>

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!

# 输入 输出
1 8 1 1
2 11 1 2
3 15  3 0