3 solutions
-
1
#include<bits/stdc++.h> using namespace std; const int N=4,M=10; int a[N]; int cnt[M]; int main(){ int A,B,C,s=0; scanf("%d%d%d",&A,&B,&C); for(int i=1;iC<=987;i++){ memset(cnt,0,sizeof cnt); a[0]=iA,a[1]=iB,a[2]=iC; for(int j=0;j<=2;j++){ int k=a[j]; while(k){ cnt[k%10]++; k/=10; }
} int j; for(j=1;j<=9;j++){ if(cnt[j]!=1) break; } if(j==10) { s=1; cout<<a[0]<<' '<<a[1]<<' '<<a[2]<<endl; } } if(s==0) cout<<"No!!!"; return 0;}
Information
- ID
- 2878
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 3
- Tags
- # Submissions
- 38
- Accepted
- 11
- Uploaded By