代码搜索：solved
找到约 243 项符合「solved」的源代码
代码结果 243
www.eeworm.com/read/147693/12538526
pl fig12_13.pl
% Figure 12.13 A best-first search program that only requires
% space linear in the depth of search (RBFS algorithm).
% Linear-space best-first search; the RBFS algorithm
% The program assu
www.eeworm.com/read/300587/13904282
cpp 1028 ignatius and the princess iii.cpp
/*
1028 Ignatius and the Princess III
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 1024 K
15 MS 364 KB 1096 B
GUN C++
*/
/*
采用二维数组存储信息
列表示解决的数据
行表示产生的各种对中最小值为行值的数目
难度在于会出现
www.eeworm.com/read/109230/15561665
txt comments.txt
in the name of ALLAH
Some bugs removed :
1. Memory Leak Solved.
2. Sometimes graph my be disappeared.
3. To some extent flicker removed.
Hossein Khosravi 83.06.16
www.eeworm.com/read/383116/8972522
h listboxitem_zz.h
#ifndef HEADER_LIST_BOX_ITEM_ZZ_H
#define HEADER_LIST_BOX_ITEM_ZZ_H
#pragma once
#include
#include
class CL_ListBoxItem_ZZ : public CL_ListItem
{
public:
CL_ListBoxItem_ZZ
www.eeworm.com/read/255577/12072347
asv f_problems.asv
function [problems,secs,nums] = f_problems
%F_PROBLEMS: Generate cell array containing FDSP homework problem data
%
% Usage: [problems,secs,nums] = f_problems;
%
% Outputs:
% problems
www.eeworm.com/read/255577/12072759
m f_problems.m
function [problems,secs,nums] = f_problems
%F_PROBLEMS: Generate cell array containing FDSP homework problem data
%
% Usage: [problems,secs,nums] = f_problems;
%
% Outputs:
% problems
www.eeworm.com/read/453140/7425736
cs dlfordefault.ascx.cs
namespace doughty_cn
{
using System;
using System.Data;
using System.Drawing;
using System.Web;
using System.Web.UI.WebControls;
using System.Web.UI.HtmlControls;
///
///
www.eeworm.com/read/445764/7590909
cs dlfordefault.ascx.cs
namespace doughty_cn
{
using System;
using System.Data;
using System.Drawing;
using System.Web;
using System.Web.UI.WebControls;
using System.Web.UI.HtmlControls;
///
///
www.eeworm.com/read/147693/12538675
pl fig12_3.pl
% Figure 12.3 A best-first search program.
% bestfirst( Start, Solution): Solution is a path from Start to a goal
bestfirst( Start, Solution) :-
expand( [], l( Start, 0/0), 9999, _, yes,
www.eeworm.com/read/158392/5597454
m reso_propa_mmusic.m
function resoluted_propability=reso_propa_mmusic(R,initial_length,antenna_number,samplepoint_number,antenna_space,lambda_bochang,measured_number)
resoluted_number=zeros(1,initial