Codeforces Global Round 7 A. Bad Ugly Numbers
A. Bad Ugly Numbers
作者：Fiveneves
题目链接-A. Bad Ugly Numbers
题目大意
输出一个位数为n的数s，且该数每一位数字都不能被s整除
解题思路
贪心
附上代码
#include
#define int long long
#define lowbit(x) (x &(-x))
using namespace std;
const int INF=0x3f3f3f3f;
const int dir[4][2]={-1,0,1,0,0,-1,0,1};
const double PI=acos(-1.0);
const double eps=1e-10;
const int M=1e9+7;
const int N=1e5+5;
typedef long long ll;
typedef pair PII;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
if(n==1){
cout<<"-1"<<endl;
continue;
}
cout<<5;
for(int i=1;i<n;i++){
cout<<7;
}
cout<<endl;
}
return 0;
}
作者：Fiveneves
