题目:https://vjudge.net/problem/UVA-725
ac代码:
#include <iostream>
#include <cmath>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <sstream>
using namespace std;
typedef long long ll;
int s[10];
bool judge(int a)
{
int k=a,c=10000;
if(k/100000) return false;//超过五位数
while(c!=0)
{
s[k/c]++;
if(s[k/c]>1) return false;
k%=c;
c/=10;
}
return true;
}
int main()
{
int n,num=0;
//freopen("/Users/zhangkanqi/Desktop/11.txt","r",stdin);
while(scanf("%d",&n)==1&&n!=0)
{
num++;
if(num!=1)
printf("\