Time Limit:1000MS Memory Limit:32768K
Description:
鏈変竴浜涙暣鏁扮粍錛屾瘡涓変釜鏁版垚涓緇勩傚鏋滀笁涓暟緇忚繃鍥涘垯榪愮畻(+銆?銆?#215;銆?#247;)寰楀嚭緇撴灉0錛屽垯杈撳嚭“yes”錛屽惁鍒欒緭鍑?#8220;no”銆傚綋涓変釜鏁頒負鍏?鏃惰〃紺鴻緭鍏ョ粨鏉熴?
Sample Input:
1 2 3 3 8 10 100 210 7 900 1 0 0銆0銆0
Sample Output:
yes no no yes
================================================================================
鎻愪氦娌掓湁鎴愬姛
#include <cstdlib>#include <iostream>using namespace std;#define MAX_ROW 50string out[MAX_ROW];int num[MAX_ROW][3];int index=0;void output()
{
for(int i=0;i<index;++i)
{ cout<<out[i].c_str(); cout<<endl;
}
}//娣辨悳鐩村埌絎笁灞わ紝鍒ゆ柗鍊兼槸鍚︾偤0
bool dfs(float number,int n){ if(n>=3) return number==0; if(dfs(number+num[index][n],n+1)) return true; if(dfs(number-num[index][n],n+1)) return true; if(dfs(number*num[index][n],n+1)) return true; if(dfs(number/num[index][n],n+1)) return true; return false; } int main(int argc, char *argv[]){ while(1) { for(int i=0;i<3;++i) cin>>num[index][i]; if(num[index][0]==0&& num[index][1]==0&& num[index][2]==0) { break; } if(dfs(num[index][0],1)) out[index]="yes"; else out[index]="no"; index++; } output(); system("PAUSE"); return 0;}]]>
銆愯瘯棰樸?鐜版湁 N (N≤8) 浠跺伐浣? 鍒嗗埆鐢?N 涓漢瀹屾垚, 姣忎漢閮藉畬鎴愪竴浠?涓斿彧瀹屾垚涓 浠?
姣忎漢瀹屾垚涓嶅悓宸ヤ綔鐨勬椂闂翠笉鍚? 璇曡璁′竴縐嶅垎閰嶅伐浣滄柟妗? 浣垮畬鎴?N 浠跺伐浣滄墍闇鐨勬繪椂闂?br>
鏈灝?
鍘熷鏁版嵁鐢辨枃鏈枃浠?EXAM1.TXT 緇欏嚭, 鍏舵牸寮忓涓?
絎?1 琛? 宸ヤ綔浠誨姟鏁?N)
絎?2 -- N+1 琛? 絎?i+1 琛屼負絎?i 涓漢瀹屾垚鍚勪歡宸ヤ綔鎵闇鐨勬椂闂? 浠?br>
涓婂悇鏁板潎涓轟笉瓚呰繃 1000 鐨勬鏁存暟.
璁＄畻緇撴灉鍙洿鎺ュ湪灞忓箷涓婅緭鍑? 絎竴琛屼負宸ヤ綔鍒嗛厤鏂規, 鍏?N 緇? 姣忕粍鏁?br>
鎹殑褰㈠紡涓?a-b, 鍏朵腑 a 涓哄伐浣滀漢鍛樼紪鍙? b 涓轟粬搴斿畬鎴愮殑宸ヤ綔搴忓彿.
渚? 璁?EXAM1.TXT 鐨勬暟鎹負:
4
2 15 13 4
10 4 14 15
9 14 16 13
7 8 11 9
瀵規, 涓涓紜殑杈撳嚭鍙互鏄?br>
1-4, 2-2, 3-1, 4-3
TOTAL=28
/**//*** Author:cjz** Create Date:2008/04/07*/#include "stdafx.h"#include <iostream>#include <fstream>#include <vector>#include <algorithm>using namespace std;vector<vector<int> > arr;int n;vector<int> min_vec;int min_total=9999999;void print_array(int n);void solve(vector<int> temp);int _tmain(int argc, _TCHAR* argv[]){ ifstream in("c:\\aa.txt"); in>>n; for(int i=0;i<n;i++) { vector<int> tmp; for(int j=0;j<n;j++) { tmp.push_back(0); in>>tmp[j]; } arr.push_back(tmp); } print_array(n); vector<int> vec; solve(vec); cout<<"----------------------------------------------------------------------------"<<endl; for(int i=0;i<min_vec.size();i++) { cout<<(min_vec[i])<<" "; } in.close(); system("pause"); return 0;}void print_array(int n){ for(int i=0;i<n;++i) { for(int j=0;j<n;j++) printf("%3d",arr[i][j]); cout<<endl; }}void solve(vector<int> vec){ if(vec.size()==n) { //寰楀嚭涓鍊嬭В int total=0; for(int i=0;i<vec.size();i++) { total+=arr[i][vec[i]]; cout<<(vec[i])<<" "; } cout<<endl; if(total<min_total) { min_vec=vec; min_total=total; } return; } int index=-1; int size=vec.size(); if(size>0) index=vec[size-1]; for(int i=0;i<n;i++) { vector<int>::iterator iter=find(vec.begin(),vec.end(),i); if(iter==vec.end()) { vec.push_back(i); solve(vec); vec.pop_back(); } }}]]>
]]>
]]>
]]>