登录
首页 » 数据结构 » Latest noi2099 problem

Latest noi2099 problem

于 2022-09-17 发布 文件大小:44.86 kB
0 244
下载积分: 2 下载次数: 1

代码说明:

最新noi2099解题报告.包含源程序.标注以及解答.-Latest noi2099 problem-solving report. Contains source. Callout and answer.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • network message boards No. 2004 v1.0
    睿网留言版 2004 v1.0-network message boards No. 2004 v1.0
    2022-03-01 13:59:50下载
    积分:1
  • source code
    2022-01-26 03:08:46下载
    积分:1
  • Enterprise Information Management System contains information input, information...
    企业信息管理系统包含信息录入,信息查询,信息统计等多项功能。-Enterprise Information Management System contains information input, information inquiry, information statistics and many other features.
    2022-10-21 04:30:05下载
    积分:1
  • 演示(tc版)
    数据结构演示(tc版)-data structure demo (tc version)
    2022-04-07 19:45:14下载
    积分:1
  • 基于MATLAB的工程是一个很好的初学者和# 39;指南,介绍了…
    Matlab基础篇是Matlab初学者的一个很好的向导,它介绍了Matlab的安装及初等的使用方法-Matlab Matlab for the project is a good beginner"s guide, it introduced the Matlab the installation and use of primary
    2022-04-22 12:12:11下载
    积分:1
  • This program implements the transformation of string to integer.This module is o...
    这是一个字符串到整型的转换,在很多程序设计中,这个小模块被频繁使用到。-This program implements the transformation of string to integer.This module is often used in many other program.
    2023-05-16 15:25:03下载
    积分:1
  • /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
    迷宫算法(maze) /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.
    2022-08-08 06:28:42下载
    积分:1
  • DELPHI processing data on the use EXCEL, it would be imported into the database...
    关于用DELPHI处理EXCEL数据,将它导入进数据库和从数据库导出到EXCEL文件,对初学者很有帮助。-DELPHI processing data on the use EXCEL, it would be imported into the database and exported to the EXCEL file from the database, useful for the beginner.
    2022-06-28 10:50:26下载
    积分:1
  • Given a (undirected) graph G, and G in two points s, t, determined from s to t o...
    给定一个(无向)图G,及G中的两点s、t,确定一条从s到t的最短路径。-Given a (undirected) graph G, and G in two points s, t, determined from s to t of a shortest path.
    2022-01-30 21:36:58下载
    积分:1
  • 这是一个好用的MD5的C++类;这个类可以加在控制台 程序中也可用在MFC中, 并且提供了详细的错误处理 函,是一个安全的类。例程是一个MD5的MFC程序,...
    这是一个好用的MD5的C++类;这个类可以加在控制台 程序中也可用在MFC中, 并且提供了详细的错误处理 函数,是一个安全的类。例程是一个MD5的MFC程序, 支持字符串和文件两种输入。 LPCSTR TargetFile(char *filename=NULL) //计算文件的MD5值 void TargetStr(LPCSTR str) //计算字符串的MD5值 LPCSTR GetDigestKey() //取MD5运算后的结果 LPCSTR GetErr() //如果有错误,取错误字串-This a user-friendly MD5 C; This category can be added to the Console program is available in MFC, and provided a detailed error handling function, is a safety class. MD5 is a routine MFC procedures, and documentation to support a string of two input. LPCSTR TargetFile (char* filename = NULL)// calculate MD5 value of the document void TargetStr (LPCSTR str)// calculate MD5 string value LPCSTR GetDigestKey ()// Operational MD5 from the results LPCSTR GetErr ()// If there were mistakes from the wrong string
    2022-07-10 22:20:11下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载