//这道题一开始无法确定k什么时候不存在解,后来在网上参考了别人的代码才做出来的
//题目:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=537
#include<iostream> using namespace std; int main() { int m, i, j, k; while (cin >> k) { int flag = 0; for (i = 1; i <= 9; i++) { m = 0; for (j = 1; j <= k; j++) { m = (m * 10 + i) % k; if (m == 0) { flag = 1; break; } } if (flag)break; } if (flag)cout << i << " " << j << endl; else cout << "-1" << endl; } return 0; }