A14349 | I Hate 1111
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an integer $x$ . Can you make $x$ by summing up some number of $11, 111, 1111, 11111, \ldots$ ? (You can use any number among them any number of times).
For instance,
- $33=11+11+11$
- $144=111+11+11+11$
For instance,
- $33=11+11+11$
- $144=111+11+11+11$
输入格式
The first line of input contains a single integer $t$ $(1 \leq t \leq 10000)$ — the number of testcases.
The first and only line of each testcase contains a single integer $x$ $(1 \leq x \leq 10^9)$ — the number you have to make.
The first and only line of each testcase contains a single integer $x$ $(1 \leq x \leq 10^9)$ — the number you have to make.
输出格式
For each testcase, you should output a single string. If you can make $x$ , output "YES" (without quotes). Otherwise, output "NO".
You can print each letter of "YES" and "NO" in any case (upper or lower).
You can print each letter of "YES" and "NO" in any case (upper or lower).
输入输出样例
输入 #1
3 33 144 69
输出 #1
YES YES NO
Ways to make $33$ and $144$ were presented in the statement. It can be proved that we can't present $69$ this way.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted