3 solutions
-
1
#include <bits/stdc++.h> using namespace std; int s[5],cnt[10]; int main(){ int a,b,c,f=0; scanf("%d%d%d",&a,&b,&c); for(int i=1,j=1;ic<=987;i++){ s[1]=ia,s[2]=ib,s[3]=ic; memset(cnt,0,sizeof cnt) ; for(j=1;j<=3;j++){ int t=s[j]; if(t>987 || t<123) break; cnt[t%10]++,cnt[t/10%10]++,cnt[t/100]++; } if(j!=4) continue; for(j=1;j<=9;j++) if(!cnt[j] || cnt[j]!=1) break;//没有出现或出现多次直接break if(j==10){ f=1; printf("%d %d %d\n",s[1],s[2],s[3]); } } if(!f) printf("No!!!") ; return 0; }
Information
- ID
- 2878
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 3
- Tags
- # Submissions
- 38
- Accepted
- 11
- Uploaded By