Combination Lock

http://train.usaco.org/usacoprob2?a=LqcgyaE9N7d&S=combo

题目大意:

N个字母组成的3位密码锁,有2种标准密码可以打开锁

锁具有容错性,允许每个位置的数字在标准密码对应的数字+/-2的范围内打开锁

输入N和2中标准密码,输出有多少种密码可以打开锁


分析:

N<=5时:N³种

N>5时:250(5³)— 重复的接近2中密码的组合(即既可视为接近第一种密码,又可视为接近第二种密码)


#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
int a[4][15];
int p[4];
int main()
{
	ifstream fin("combo.in");
	ofstream fout("combo.out");
	int n, t, k;
	while(fin >> n)
	{
		p[1] = p[2] =p[3] = 0;
		for(int i = 0; i < 2; i++)			//2次输入 
		{
			for(int j = 1; j <= 3; j++)		//每次输入3个数字 
			{
				fin >> t;
				int x;
				for(int m = 0; m < 5; m++) 
				{
					x = (t + n - 2 + m)%n == 0 ? n : (t + 2*n - 2 + m)%n;
					for(k = 0; k < p[j]; k++)
						if(x == a[j][k]) break;
					if(k == p[j]) a[j][p[j]++] = x;
				}
			}
		}
		if(n <= 5) fout << n*n*n << endl;
		else fout << 250 - (10 - p[1])*(10 - p[2])*(10 - p[3]) << endl;	
	}
	fout.close();
	return 0;
}


Sure, I can help you with that! Here's a C++ program that uses recursion and backtracking to find the correct lock combination: ```cpp #include <iostream> #include <vector> #include <cstdlib> #include <ctime> using namespace std; const int NUM_DIGITS = 5; void generateRandomCombination(vector<int>& combination) { for (int i = 0; i < NUM_DIGITS; i++) { combination.push_back(rand() % 10); } } void printCombination(const vector<int>& combination) { for (int i = 0; i < NUM_DIGITS; i++) { cout << combination[i]; } cout << endl; } bool tryCombination(vector<int>& currentCombination, const vector<int>& targetCombination, int digitIndex) { if (digitIndex == NUM_DIGITS) { return currentCombination == targetCombination; } for (int i = 0; i < 10; i++) { currentCombination[digitIndex] = i; if (tryCombination(currentCombination, targetCombination, digitIndex + 1)) { return true; } } return false; } int main() { srand(time(0)); vector<int> targetCombination; generateRandomCombination(targetCombination); cout << "Target combination: "; printCombination(targetCombination); vector<int> currentCombination(NUM_DIGITS, 0); if (tryCombination(currentCombination, targetCombination, 0)) { cout << "Found the correct combination: "; printCombination(currentCombination); } else { cout << "Unable to find the correct combination." << endl; } return 0; } ``` The `generateRandomCombination` function generates a random lock combination and stores it in a vector. The `printCombination` function simply prints out a given combination. The `tryCombination` function takes in the current combination being tested, the target combination to be found, and the current digit index that is being tested. It recursively tries all possible combinations of digits for the current index, and returns true if the correct combination is found. In the `main` function, we first generate a random target combination, print it out, and initialize the current combination to all zeros. We then call `tryCombination` with the current combination, target combination, and starting index of 0. If the correct combination is found, we print it out. Otherwise, we print a message saying that we were unable to find the correct combination. Here are three example recursive level calls for the recursion tree call with input values: ``` tryCombination({0, 0, 0, 0, 0}, {3, 2, 5, 8, 1}, 0) ├──tryCombination({0, 0, 0, 0, 3}, {3, 2, 5, 8, 1}, 1) │ ├──tryCombination({0, 0, 0, 2, 3}, {3, 2, 5, 8, 1}, 2) │ │ ├──tryCombination({0, 0, 5, 2, 3}, {3, 2, 5, 8, 1}, 3) │ │ │ ├──tryCombination({3, 0, 5, 2, 3}, {3, 2, 5, 8, 1}, 4) // returns true │ │ │ └──tryCombination({4, 0, 5, 2, 3}, {3, 2, 5, 8, 1}, 4) │ │ └──tryCombination({0, 1, 5, 2, 3}, {3, 2, 5, 8, 1}, 3) │ │ ├──tryCombination({3, 1, 5, 2, 3}, {3, 2, 5, 8, 1}, 4) // returns true │ │ └──tryCombination({4, 1, 5, 2, 3}, {3, 2, 5, 8, 1}, 4) │ └──tryCombination({0, 2, 5, 2, 3}, {3, 2, 5, 8, 1}, 3) │ ├──tryCombination({3, 2, 5, 2, 3}, {3, 2, 5, 8, 1}, 4) // returns true │ └──tryCombination({4, 2, 5, 2, 3}, {3, 2, 5, 8, 1}, 4) ├──tryCombination({0, 0, 0, 0, 4}, {3, 2, 5, 8, 1}, 1) │ ├──tryCombination({0, 0, 0, 2, 4}, {3, 2, 5, 8, 1}, 2) │ │ ├──tryCombination({0, 0, 5, 2, 4}, {3, 2, 5, 8, 1}, 3) │ │ │ ├──tryCombination({3, 0, 5, 2, 4}, {3, 2, 5, 8, 1}, 4) // returns true │ │ │ └──tryCombination({4, 0, 5, 2, 4}, {3, 2, 5, 8, 1}, 4) │ │ └──tryCombination({0, 1, 5, 2, 4}, {3, 2, 5, 8, 1}, 3) │ │ ├──tryCombination({3, 1, 5, 2, 4}, {3, 2, 5, 8, 1}, 4) // returns true │ │ └──tryCombination({4, 1, 5, 2, 4}, {3, 2, 5, 8, 1}, 4) │ └──tryCombination({0, 2, 5, 2, 4}, {3, 2, 5, 8, 1}, 3) │ ├──tryCombination({3, 2, 5, 2, 4}, {3, 2, 5, 8, 1}, 4) // returns true │ └──tryCombination({4, 2, 5, 2, 4}, {3, 2, 5, 8, 1}, 4) └──tryCombination({0, 0, 0, 0, 5}, {3, 2, 5, 8, 1}, 1) ├──tryCombination({0, 0, 0, 2, 5}, {3, 2, 5, 8, 1}, 2) │ ├──tryCombination({0, 0, 5, 2, 5}, {3, 2, 5, 8, 1}, 3) │ │ ├──tryCombination({3, 0, 5, 2, 5}, {3, 2, 5, 8, 1}, 4) // returns true │ │ └──tryCombination({4, 0, 5, 2, 5}, {3, 2, 5, 8, 1}, 4) │ └──tryCombination({0, 1, 5, 2, 5}, {3, 2, 5, 8, 1}, 3) │ ├──tryCombination({3, 1, 5, 2, 5}, {3, 2, 5, 8, 1}, 4) // returns true │ └──tryCombination({4, 1, 5, 2, 5}, {3, 2, 5, 8, 1}, 4) └──tryCombination({0, 2, 5, 2, 5}, {3, 2, 5, 8, 1}, 3) ├──tryCombination({3, 2, 5, 2, 5}, {3, 2, 5, 8, 1}, 4) // returns true └──tryCombination({4, 2, 5, 2, 5}, {3, 2, 5, 8, 1}, 4) ``` In this example, we're trying to find the correct combination for the lock with the target combination {3, 2, 5, 8, 1}. The recursion tree shows the different combinations being tried at each recursive call. At each level, the function tries all possible digits for the current index, and recursively calls itself with the next digit index. If a combination is found that matches the target combination, the function returns true and stops recursing.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值