登录
首页 » C# » C80f020的字库文件,包含有字母、数字、符号和200多汉字,调用是只需调用他们的代码即可。...

C80f020的字库文件,包含有字母、数字、符号和200多汉字,调用是只需调用他们的代码即可。...

于 2023-04-01 发布 文件大小:8.57 kB
0 127
下载积分: 2 下载次数: 1

代码说明:

C80f020的字库文件,包含有字母、数字、符号和200多汉字,调用是只需调用他们的代码即可。-C80f020 the font document contains letters, numbers, symbols and more than 200 Chinese characters, Calling is the only call they can code.

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

发表评论

0 个回复

  • TFT240320
    TFT240320彩色液晶显示屏显示程序,库文件中定义了其常用的操作函数,可直接在主函数中调用(TFT240320 color LCD display program, the library file defines its common operating functions that can be invoked directly in the main function)
    2013-07-21 11:16:42下载
    积分:1
  • can232
    给出了基于MFC的can232接口的调试程序(MFC-can232 given based debugger interface)
    2010-12-03 17:30:41下载
    积分:1
  • stm8l寄存器例程
    说明:  常见的单片机操作,IO,中断,定时器,低功耗模式等(io, interrupt, timer, low power mode and so on)
    2019-05-24 23:00:01下载
    积分:1
  • RadarDataShow
    这是有关综合实例——雷达工程数据的可视化与处理(This is the comprehensive example, the radar engineering data visualization and processing)
    2012-04-27 14:43:43下载
    积分:1
  • 视频关键帧提取
    视频关键帧提取,通过聚类方法时间关键帧的提取,存储
    2023-04-12 04:55:09下载
    积分:1
  • The-CPP-Programming-Language--Third-Edition
    Fantastically a good book on C++
    2015-01-10 01:46:59下载
    积分:1
  • 聪明的程序员用Delphi大家都知道吧,学习Delphi的人你一定知道吧,想检验你的Delphi学的怎么样么?看看吧!对你可能有帮助!...
    聪明的程序员用Delphi大家都知道吧,学习Delphi的人你一定知道吧,想检验你的Delphi学的怎么样么?看看吧!对你可能有帮助!-clever programmers with Delphi everyone you know, learning Delphi certain people you know you, you want to test the Delphi learn how kind? Let"s see it! You may have to help!
    2022-03-05 11:14:02下载
    积分:1
  • (适合初学者)MFC基础教程
    MFC的基础教程,适合懂得C++的想学习MFC的初学者。(The basic course of MF C is suitable for beginners who know C++ and want to learn MFC.)
    2020-06-24 08:00:02下载
    积分:1
  • lr0
    lr(0)文法及其预测分析表 lr(0)文法及其预测分析表 lr(0)文法及其预测分析表(lr (0) Analysis and prediction of grammar lr (0) Analysis and prediction of grammar lr (0) grammar analysis and forecast table)
    2009-06-04 20:55:10下载
    积分:1
  • Matching-2
    //给定整数n,产生所有[2n]上的匹配(matching) //将其视为一个所有块大小均为2的集合分拆 //以a_i表示其第i个元素所在的集合号 //输出格式为 a1 a2 a3 ... //满足 //a_{i+1} <= max { a1,a2,...a_i } + 1 (//a given integer n, have all [2n] on the matching (matching)// will be considered as an all pieces are two sets of a split// a_i said in its i elements of a collection of lies// output format for a1 a2 a3 ...// meet// a_ i (a))
    2007-06-13 22:14:46下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载