虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

04.<b>00</b>

  • 垃圾文件清理: 垃圾文件清理: 垃圾文件清理 Clean Windows Programs: :rd_dir if " R:~-2,1 "=="" set R=" R:~1,-2 "

    垃圾文件清理: 垃圾文件清理: 垃圾文件清理 Clean Windows Programs: :rd_dir if " R:~-2,1 "=="\" set R=" R:~1,-2 " if not exist R goto :DD cd /d R for /f "delims=" a in ( dir/ad/b ) do rd /s /q " a" del /f /s /q * cdrd /s /q R :DD Clean Windows Programs: :rd_dir if " R:~-2,1 "=="\" set R=" R:~1,-2 " if not exist R goto :DD cd /d R for /f "delims=" a in ( dir/ad/b ) do rd /s /q " a" del /f /s /q * cdrd /s /q R :DD

    标签: Programs Windows rd_dir Clean

    上传时间: 2017-04-21

    上传用户:lanhuaying

  • A simple object to store a color and perform Hex/RGB conversions. methods included ColorSetRGB -

    A simple object to store a color and perform Hex/RGB conversions. methods included ColorSetRGB - ColorGetHex RGBToHex(r, g, b) hexToRGB(hex) ColorBlend(colorFrom, colorTo) ColorBlendGetColor(alpha) ColorBlendToString()

    标签: ColorSetRGB conversions included methods

    上传时间: 2017-04-29

    上传用户:chenxichenyue

  • 电子元器件入门——电感lukougao

    如果课程对您有帮助,记得关注+三连击;如果您喜欢本课程,请推荐给您的同事或同学。本课程以产品标准和制造商的规格书为起点,分别介绍了如下内容:电感的定义和工作原理;电感器的分类;电感的关键参数;电感的原理图和封装;电感器的制造商;电感的关键特性;电感的常见问题。如果大家想看视频教程,请到B站搜索"lukougao",那里有您想要的知识。

    标签: 电子元器件 电感

    上传时间: 2022-04-13

    上传用户:XuVshu

  • 题目:利用条件运算符的嵌套来完成此题:学习成绩>=90分的同学用A表示

    题目:利用条件运算符的嵌套来完成此题:学习成绩>=90分的同学用A表示,60-89分之间的用B表示,60分以下的用C表示。 1.程序分析:(a>b)?a:b这是条件运算符的基本例子。

    标签: gt 90 运算符 嵌套

    上传时间: 2015-01-08

    上传用户:lifangyuan12

  • 经统计

    经统计,某机器14条指令的使用频度分别为:0.01,0.15,0.12,0.03,0.02,0.04,0.02,0.04,0.01,0.13,0.15,0.14,0.11,0.03。分别求出用等长码、Huffman码、只有两种码长的扩展操作码3种编码方式的操作码平均码长。 解: 等长操作码的平均码长=4位 Huffman编码的平均码长=3.38位 只有两种码长的扩展操作码的平均码长=3.4位。 9.若某机要求:三地址指令4条,单地址指令255条,零地址指令16条。设指令字长为12位.每个 地址码长为3位。问能否以扩展操作码为其编码?如果其中单地址指令为254条呢?说明其理由。 答:①不能用扩展码为其编码。 ∵指令字长12位,每个地址码占3位; ∴三地址指令最多是2^(12-3-3-3)=8条, 现三地址指令需4条, ∴可有4条编码作为扩展码, ∴单地址指令最多为4×2^3×2^3=2^8=256条, 现要求单地址指令255条,∴可有一条编码作扩展码 ∴零地址指令最多为1×2^3=8条 不满足题目要求 ∴不可能以扩展码为其编码。 ②若单地址指令254条,可以用扩展码为其编码。 ∵依据①中推导,单地址指令中可用2条编码作为扩展码 ∴零地址指令为2×2^3=16条,满足题目要求

    标签:

    上传时间: 2015-04-30

    上传用户:zhangyigenius

  • The government of a small but important country has decided that the alphabet needs to be streamline

    The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d . Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet. Create a class Alphabet that contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1. Definition

    标签: government streamline important alphabet

    上传时间: 2015-06-09

    上传用户:weixiao99

  • We have a group of N items (represented by integers from 1 to N), and we know that there is some tot

    We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.

    标签: represented integers group items

    上传时间: 2016-01-17

    上传用户:jeffery

  • 【问题描述】 在一个N*N的点阵中

    【问题描述】 在一个N*N的点阵中,如N=4,你现在站在(1,1),出口在(4,4)。你可以通过上、下、左、右四种移动方法,在迷宫内行走,但是同一个位置不可以访问两次,亦不可以越界。表格最上面的一行加黑数字A[1..4]分别表示迷宫第I列中需要访问并仅可以访问的格子数。右边一行加下划线数字B[1..4]则表示迷宫第I行需要访问并仅可以访问的格子数。如图中带括号红色数字就是一条符合条件的路线。 给定N,A[1..N] B[1..N]。输出一条符合条件的路线,若无解,输出NO ANSWER。(使用U,D,L,R分别表示上、下、左、右。) 2 2 1 2 (4,4) 1 (2,3) (3,3) (4,3) 3 (1,2) (2,2) 2 (1,1) 1 【输入格式】 第一行是数m (n < 6 )。第二行有n个数,表示a[1]..a[n]。第三行有n个数,表示b[1]..b[n]。 【输出格式】 仅有一行。若有解则输出一条可行路线,否则输出“NO ANSWER”。

    标签: 点阵

    上传时间: 2014-06-21

    上传用户:llandlu

  • ALCOR_U2_MP_v19.04.01.00

    安国U盘量产工具 并不适用于所有U盘,只给有缘人和懂的人

    标签: ALCOR_U MP_v 19 04 01 00

    上传时间: 2020-01-03

    上传用户:HYHol

  • Proteus仿真LCD12864显示动画—飞翔的鸽子

    程序:LCD12664液晶显示原理unsigned int/W/图形编码,也可以把图形代码存为头文件。该程序经过调试。PROTEUS原理图见截图unsigned char code table1[][64]={/*-调入了一幅图像:D:\Desktop\新建文件夹(2)l.bmp--*//*-宽度x高度=128×64一*材0x00,0×00,0×00,0×00,0×00,0×00,0x80,0x80,0xD0,0XE0,0XE0,0xC0,0xF0,0xF8,OXF C,0xF8,0xF8,0xB8,0x3C,0x78,0XFO,0XFA,0XFC,0XFC,0xCC,Ox1E,0X3C,OxF8,0xF0,0XE0,0x DO,0×00,0x80,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0x00,0x00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0x00,0×00,0×00,0×00,0×00,0×00,0x00,0×00,0×00,0×00,0x00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0x00,0x00,0x00,0×00,0x00,0×00,0×00,0×00,0×00,0×00,0×00,0×00,0x00,0×00,0×00,0x00,0×00,0×00,

    标签: proteus lcd12864 显示动画

    上传时间: 2022-07-04

    上传用户:slq1234567890