A13299 | Bad Ugly Numbers
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a integer $n$ ( $n > 0$ ). Find any integer $s$ which satisfies these conditions, or report that there are no such numbers:
In the decimal representation of $s$ :
- $s > 0$ ,
- $s$ consists of $n$ digits,
- no digit in $s$ equals $0$ ,
- $s$ is not divisible by any of it's digits.
In the decimal representation of $s$ :
- $s > 0$ ,
- $s$ consists of $n$ digits,
- no digit in $s$ equals $0$ ,
- $s$ is not divisible by any of it's digits.
输入格式
The input consists of multiple test cases. The first line of the input contains a single integer $t$ ( $1 \leq t \leq 400$ ), the number of test cases. The next $t$ lines each describe a test case.
Each test case contains one positive integer $n$ ( $1 \leq n \leq 10^5$ ).
It is guaranteed that the sum of $n$ for all test cases does not exceed $10^5$ .
Each test case contains one positive integer $n$ ( $1 \leq n \leq 10^5$ ).
It is guaranteed that the sum of $n$ for all test cases does not exceed $10^5$ .
输出格式
For each test case, print an integer $s$ which satisfies the conditions described above, or "-1" (without quotes), if no such number exists. If there are multiple possible solutions for $s$ , print any solution.
输入输出样例
输入 #1
4 1 2 3 4
输出 #1
-1 57 239 6789
In the first test case, there are no possible solutions for $s$ consisting of one digit, because any such solution is divisible by itself.
For the second test case, the possible solutions are: $23$ , $27$ , $29$ , $34$ , $37$ , $38$ , $43$ , $46$ , $47$ , $49$ , $53$ , $54$ , $56$ , $57$ , $58$ , $59$ , $67$ , $68$ , $69$ , $73$ , $74$ , $76$ , $78$ , $79$ , $83$ , $86$ , $87$ , $89$ , $94$ , $97$ , and $98$ .
For the third test case, one possible solution is $239$ because $239$ is not divisible by $2$ , $3$ or $9$ and has three digits (none of which equals zero).
For the second test case, the possible solutions are: $23$ , $27$ , $29$ , $34$ , $37$ , $38$ , $43$ , $46$ , $47$ , $49$ , $53$ , $54$ , $56$ , $57$ , $58$ , $59$ , $67$ , $68$ , $69$ , $73$ , $74$ , $76$ , $78$ , $79$ , $83$ , $86$ , $87$ , $89$ , $94$ , $97$ , and $98$ .
For the third test case, one possible solution is $239$ because $239$ is not divisible by $2$ , $3$ or $9$ and has three digits (none of which equals zero).
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted