代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/481966/6634144
cpp 2386.cpp
/* This Code is Submitted by wywcgs for Problem 2386 on 2006-09-28 at 15:52:05 */
#include
#include
using namespace std;
const int N = 10240;
int main()
{
int num[N]
www.eeworm.com/read/481966/6634194
cpp 2117.cpp
/* This Code is Submitted by wywcgs for Problem 2117 on 2005-10-13 at 21:00:49 */
#include
#define LENGTH 35
int main()
{
long num, den;
int i;
while(scanf("%ld %ld", &num
www.eeworm.com/read/481966/6634220
cpp 1058.cpp
/* This Code is Submitted by wywcgs for Problem 1058 on 2006-01-19 at 04:17:01 */
#include
#include
using namespace std;
const int MAX = 1024;
int main()
{
int n,
www.eeworm.com/read/481966/6634247
cpp 1148.cpp
/* This Code is Submitted by wywcgs for Problem 1148 on 2005-12-27 at 13:10:37 */
#include
int main()
{
int t, T, n, m;
scanf("%d", &T);
for(t = 1; t
www.eeworm.com/read/481966/6634271
cpp 2364.cpp
/* This Code is Submitted by wywcgs for Problem 2364 on 2006-09-22 at 21:08:17 */
#include
#include
#include
using namespace std;
const int N = 1024;
int ma
www.eeworm.com/read/481966/6634278
cpp 1090.cpp
/* This Code is Submitted by wywcgs for Problem 1090 on 2005-10-27 at 21:54:26 */
#include
const int MAX = 512;
int main()
{
long long c[MAX] = {0};
int i, j, n;
for(i = MAX
www.eeworm.com/read/481966/6634280
cpp 2012.cpp
/* This Code is Submitted by wywcgs for Problem 2012 on 2005-09-30 at 12:30:57 */
#include
int main()
{
int n, i, ad;
long sum, result;
while(scanf("%d", &n) == 1) {
sum =
www.eeworm.com/read/481966/6634292
cpp 2258.cpp
/* This Code is Submitted by wywcgs for Problem 2258 on 2006-05-29 at 10:26:02 */
#include
#include
const int VN = 1024;
int main()
{
double total[VN] = { 0 };
int n, m
www.eeworm.com/read/481368/6639457
m ispanneal.m
%function [e,f]=ISPanneal(L,s,t,dt,lamda,w,N)
%
%独立集问题(Independent Set Problem)的退火算法
%设有图G=(V,E),要找V的最大独立集，即找最大的V'属于V,
%满足其中的任意两点都不关联
%
%N为问题规模，即节点个数；w为权矩阵
%e为以0、1为元素的数组，来表示两个子集
%lamda是一个大于1的罚
www.eeworm.com/read/481368/6639461
m mcpanneal.m
%function [e,f]=MCPanneal(L,s,t,dt,w,N)
%最大截问题(Max Cut Problem)的退火算法
%由于算法的缺陷，当f值在较长时间内不再改变时，可用cl+c停止程序
%N为问题规模，即节点个数；w为权矩阵
%L可取较大值，如500、1000；
%s取1、2等；t为初始温度，参考范围为0.5--2；
%dt为衰减因子，一般不小于0.9;
%e为