密码锁

最新推荐文章于 2022-06-22 20:00:50 发布

xuhang513

最新推荐文章于 2022-06-22 20:00:50 发布

阅读量190

点赞数

本文链接：https://blog.csdn.net/xuhang513/article/details/109080389

版权

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

struct node{
	int val;
	int a;
	int b;
}arr[10];
bool solve(int u){
	int a, b, x,y,z, tx, ty, tz;
	x = u/100;
	y = u/10%10;
	z = u%10;
	for(int i = 1; i <= 5; i ++){
		a = 0, b = 0;
		tx = arr[i].val/100;
		ty = arr[i].val/10%10;
		tz = arr[i].val%10;
		
		if(x==tx||x==ty||x==tz)a++;
		if(y==tx||y==ty||y==tz)a++;
		if(z==tx||z==ty||z==tz)a++;
		
		if(x==tx)b++;
		if(y==ty)b++;
		if(z==tz)b++;
		
		
		if(a!=arr[i].a || b!=arr[i].b)return 0;
	}
	return 1;
}
int main(){
	ios::sync_with_stdio(false);
	arr[1] = {246,1,1};
	arr[2] = {258,1,0};
	arr[3] = {692,2,0};
	arr[4] = {174,0,0};
	arr[5] = {419,1,0};
	for(int i = 100; i <= 999; i ++){
		if(solve(i))cout << i << endl;
	}
	return 0;
}