QOJ.ac

QOJ

时间限制: 1 s 内存限制: 1024 MB 总分: 100

#3754. 数字

统计

Bobo 有 $n$ 个互不相同的整数 $a_1, a_2, \dots, a_n$,且每个整数都在 $[0, 99]$ 范围内。 他将这些整数按十进制表示法(无前导零)依次写成一行,得到一个字符串 $s$。

给定字符串 $s$,求可能的整数数组 $a_1, a_2, \dots, a_n$ 的数量。

输入格式

输入包含多组测试数据,以文件结束符(EOF)结束。

每个测试用例包含一个字符串 $s$。

  • $1 \leq |s| \leq 50$
  • 最多有 $100$ 组测试数据。

输出格式

对于每个测试用例,输出一个整数,表示结果。

样例

输入格式 1

999

输出格式 1

2

输入格式 2

233333

输出格式 2

0

输入格式 3

0123456789

输出格式 3

55

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.