标签:otto using 题解 txt 而且 code scanf 根据 同时存在
1 #include <iostream> 2 #include <algorithm> 3 #include <stdlib.h> 4 #include <string> 5 #include <string.h> 6 #include <set> 7 #include <queue> 8 #include <math.h> 9 #include <stdbool.h> 10 11 #define LL long long 12 #define inf 0x3f3f3f3f 13 using namespace std; 14 const int MAXN=1000005; 15 16 typedef struct Node{ 17 int a; 18 int b; 19 int c; 20 }Node; 21 22 Node node[100]; 23 int n; 24 25 bool judge(int i,int num) 26 { 27 int num1[5],num2[5]; 28 bool vis[5]; 29 for(int j=1;j<=4;j++) 30 vis[j]=false; 31 num1[1] = node[i].a/1000; 32 num1[2] = (node[i].a%1000)/100; 33 num1[3] = (node[i].a%100)/10; 34 num1[4] = (node[i].a%10); 35 36 num2[1] = num/1000; 37 num2[2] = (num%1000)/100; 38 num2[3] = (num%100)/10; 39 num2[4] = (num%10); 40 41 int cnt = 0; 42 for (int j=1;j<=4;j++) 43 { 44 if (num1[j] == num2[j]) 45 cnt++; 46 } 47 if (cnt != node[i].c) 48 return false; 49 50 cnt = 0; 51 for (int j=1;j<=4;j++) 52 { 53 for (int k=1;k<=4;k++) 54 { 55 if (num1[j] == num2[k] && !vis[k]) 56 { 57 vis[k] = true; 58 cnt++; 59 break; 60 } 61 } 62 } 63 if (cnt != node[i].b) 64 return false; 65 return true; 66 } 67 68 69 70 int main() 71 { 72 //freopen("../in.txt","r",stdin); 73 while (~scanf("%d",&n)) 74 { 75 if (n == 0) 76 break; 77 for (int i=1;i<=n;i++) 78 { 79 scanf("%d%d%d",&node[i].a,&node[i].b,&node[i].c); 80 } 81 int count = 0; 82 bool flag = true; 83 int result = 0; 84 for (int num=1000;num<=9999;num++) 85 { 86 for (int i=1;i<=n;i++) 87 { 88 flag = judge(i,num); 89 if (!flag) 90 break; 91 } 92 if (flag) 93 { 94 count++; 95 result = num; 96 } 97 } 98 if (count == 1) 99 printf("%d\n",result); 100 else 101 printf("Not sure\n"); 102 } 103 return 0; 104 }
标签:otto using 题解 txt 而且 code scanf 根据 同时存在
原文地址:https://www.cnblogs.com/-Ackerman/p/11221825.html