欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF1455A.Strange Functions
Strange Functions
Let's define a function ( is a positive integer) as follows: write all digits of the decimal representation of backwards, then get rid of the leading zeroes. For example, , , , .
Let's define another function ( is a positive integer as well).
Your task is the following: for the given positive integer , calculate the number of different values of among all numbers such that .
Input
The first line contains one integer () — the number of test cases.
Each test case consists of one line containing one integer (). This integer is given without leading zeroes.
Output
For each test case, print one integer — the number of different values of the function , if can be any integer from .
Note
Explanations for the two first test cases of the example:
- if , then for every integer such that , ;
- if , then for some integers such that , (for example, if , ,); and for other values of , (for example, if , , ). So, there are two different values of .
Samples
5
4
37
998244353
1000000007
12345678901337426966631415
1
2
9
10
26
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |