ToF君
这个作者很懒,什么都没留下…
展开
-
车型诊断框架的搭建系列_故障码(PCBU)库
车型诊断基本都是通过读取故障码,获取故障码的信息在有的放矢去解决车辆故障,所以说集成一个故障码库是一个ODM厂核心技术,同时也是一个不断积累的过程,并且一般故障码是增加扩容的过程,以前的故障码是不允许修改,他们很经常以固定的故障信息反馈给维修人员。作为一个维修人员,肯定希望获取更多的信息的,有些DTC没有用PCBU的格式给出来,特别在一些国产车上面不按常理出牌,故障码都是残缺不全的而且还不标准,因为国产车很多都是生搬硬套,多种ECU拼凑一起,甚至发动机都是拼凑的,强行组装一起。比如FIAT的故障码库如下。原创 2023-02-05 20:01:19 · 701 阅读 · 0 评论 -
北京大学ACM Problems 1028: Web Navigation
Web NavigationTime Limit:1000MS Memory Limit:10000K Total Submissions:40470 Accepted:18054 DescriptionStandard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these...原创 2022-05-21 06:40:44 · 252 阅读 · 0 评论 -
北京大学ACM Problems 1027: The Same Game
The Same GameTime Limit:1000MS Memory Limit:10000K Total Submissions:7632 Accepted:2713 DescriptionThe game named "Same" is a single person game played on a 10 \Theta 15 board. Each square contains a ball colored red (R), green (G...原创 2022-05-21 06:39:09 · 228 阅读 · 0 评论 -
北京大学ACM Problems 1026:Cipher
CipherTime Limit:1000MS Memory Limit:10000K Total Submissions:24703 Accepted:6949 DescriptionBob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decodi...原创 2022-05-21 06:37:27 · 256 阅读 · 0 评论 -
北京大学ACM Problems 1025: Department
DepartmentTime Limit:1000MS Memory Limit:10000K Total Submissions:2377 Accepted:590 DescriptionThe Department of Security has a new headquarters building. The building has several floors, and on each floor there are rooms numbered...原创 2022-05-21 06:35:59 · 246 阅读 · 0 评论 -
北京大学ACM Problems 1024: Tester Program
Tester ProgramTime Limit:1000MS Memory Limit:10000K Total Submissions:3317 Accepted:1217 DescriptionTester ProgramFor this contest, we first designed the following problem (note that you do not have to solve it!):Another Wall...原创 2022-05-21 06:33:38 · 255 阅读 · 0 评论 -
北京大学ACM Problems 1023:
The Fun Number SystemTime Limit:1000MS Memory Limit:10000K Total Submissions:12356 Accepted:4295 DescriptionIn a k bit 2's complement number, where the bits are indexed from 0 to k-1, the weight of the most significant bit (i.e., ...原创 2022-05-04 14:24:43 · 375 阅读 · 0 评论 -
北京大学ACM Problems 1022: Packing Unit 4D Cubes
Packing Unit 4D CubesTime Limit:1000MS Memory Limit:10000K Total Submissions:2965 Accepted:1059 DescriptionWe usually think that there are three geometric dimensions; the fourth dimension is usually time. However, the Associati...原创 2022-05-05 00:29:56 · 289 阅读 · 0 评论 -
北京大学ACM Problems 1021:2D-Nim
2D-NimTime Limit:1000MS Memory Limit:10000K Total Submissions:4709 Accepted:2153 DescriptionThe 2D-Nim board game is played on a grid, with pieces on the grid points. On each move, a player may remove any positive number of contig...原创 2022-05-04 14:15:28 · 518 阅读 · 0 评论 -
北京大学ACM Problems 1020:Number Sequence
Anniversary CakeTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19925 Accepted: 6534DescriptionNahid Khaleh decides to invite the kids of the "Shahr-e Ghashang" to her wedding anniversary. She wants to prepare a square-shaped c...原创 2022-05-04 14:13:08 · 342 阅读 · 0 评论 -
北京大学ACM Problems 1019:Number Sequence
Number SequenceTime Limit:1000MS Memory Limit:10000K Total Submissions:46616 Accepted:13519 DescriptionA single positive integer i is given. Write a program to find the digit located in the position i in the sequence of number gro...原创 2022-05-03 18:07:04 · 1304 阅读 · 0 评论 -
北京大学ACM Problems 1018:Communication System
Communication SystemTime Limit:1000MS Memory Limit:10000K Total Submissions:35638 Accepted:12635 DescriptionWe have received an order from Pizoor Communications Inc. for a special communication system. The system consists of sever...原创 2022-05-03 18:05:16 · 222 阅读 · 0 评论 -
北京大学ACM Problems 1017:Packets
PacketsTime Limit:1000MS Memory Limit:10000K Total Submissions:74434 Accepted:25467 DescriptionA factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products...原创 2022-05-03 17:55:54 · 299 阅读 · 0 评论 -
北京大学ACM Problems 1016:Numbers That Count
Numbers That CountTime Limit:1000MS Memory Limit:10000K Total Submissions:23538 Accepted:8044 Description"Kronecker's Knumbers" is a little company that manufactures plastic digits for use in signs (theater marquees, gas station p...原创 2022-05-03 17:53:04 · 352 阅读 · 0 评论 -
北京大学ACM Problems 1015:Jury Compromise
Jury CompromiseTime Limit:1000MS Memory Limit:65536K Total Submissions:39580 Accepted:10718 Special Judge DescriptionIn Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of member...原创 2022-05-15 05:06:56 · 375 阅读 · 0 评论 -
北京大学ACM Problems 1007:DNA Sorting
DNA SortingTime Limit:1000MS Memory Limit:10000K Total Submissions:123524 Accepted:49161 DescriptionOne measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. ...原创 2022-04-15 02:55:16 · 353 阅读 · 0 评论 -
北京大学ACM Problems 1006:Biorhythms
BiorhythmsTime Limit:1000MS Memory Limit:10000K Total Submissions:161776 Accepted:52760 DescriptionSome people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the...原创 2022-04-15 02:48:03 · 425 阅读 · 0 评论 -
北京大学ACM Problems 1005:I Think I Need a Houseboat
DescriptionFred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is actually shrinking by 50 square miles each year, due to erosion caused by t原创 2022-04-15 02:44:16 · 274 阅读 · 0 评论 -
北京大学ACM Problems 1004:Financial Management
Financial ManagementTime Limit:1000MS Memory Limit:10000K Total Submissions:230826 Accepted:85980 DescriptionLarry graduated this year and finally has a job. He's making a lot of money, but somehow never seems to have enough. Larr...原创 2022-04-15 02:40:31 · 289 阅读 · 0 评论 -
北京大学ACM Problems 1003:Hangover
HangoverTime Limit:1000MS Memory Limit:10000K Total Submissions:151964 Accepted:73383 DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length...原创 2022-04-13 22:06:52 · 314 阅读 · 0 评论 -
北京大学ACM Problems 1002:487-3279
487-3279Time Limit:2000MS Memory Limit:65536K Total Submissions:333498 Accepted:59114 DescriptionBusinesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable wor...原创 2022-04-13 22:00:39 · 278 阅读 · 0 评论 -
北京大学ACM Problems 1001:Exponentiation
ExponentiationTime Limit:500MS Memory Limit:10000K Total Submissions:199590 Accepted:47682 DescriptionProblems involving the computation of exact values of very large magnitude and precision are common. For example, the computatio...原创 2022-04-13 21:51:37 · 297 阅读 · 0 评论 -
北京大学ACM Problems 1000:A+B Problem
DescriptionCalculate a+bInputTwo integer a,b (0<=a,b<=10)OutputOutput a+bSample Input1 2Sample Output3#include <iostream>using namespace std;int main(){ int a,b; cin >> a >> b; cout <<原创 2022-04-13 21:15:15 · 381 阅读 · 0 评论 -
strcpy和memcpy的区别
面试题目:strcpy和memcpy的区别?(这种题目难度不大,侮辱性极强)答:两者都是C语言里的库函数。strcpy 只能拷贝字符串,它遇到'\0'就结束拷贝。memset 用来对一段内存空间全部设置为某个字符,一般用于在对定义的字符串初始化为' '或者'\0';memcpy 是用来做内存拷贝,可以用来拷贝任何数据类型的对象,可以指定拷贝的数据长度。memcpy提供了一般内存的复制,对于需要复制的内容没有限制,用途更广。strcpy的函数原型(前缀带str的都是针对字符串)me..原创 2022-01-09 03:18:17 · 554 阅读 · 0 评论 -
谈acm大赛
ACM (Association for Computing Machinery ) 中文:国际计算机学会。这是一个神奇的学会,他是很多计算机大神封神的神坛,刚上大学那会儿,总能听到某位大神亚洲acm大赛获奖,蓝桥杯获奖等,就是有这样的新闻吸引着无数大一的新生挤进去参加报名,然而后来的结果大家也都知道,能留下来的凤毛麟角,甚至有可能到最后一个苗子也没有。因为acm需要有一定的计算机天赋,需要你在数学和算法上有造诣的一面。a所以不一定每个人都能获奖,不是每个人都能坚持到最后。但是这个比赛收获跟付出有时原创 2021-10-25 16:45:02 · 4592 阅读 · 0 评论 -
FAFU OJ 全排列
全排列Time Limit:2000MSMemory Limit:65535KBTotal Submissions:425Accepted:150ShareDescription: 对1-n的数进行全排列,例如n为2的时候,应该输出1 2,2 1。Input:原创 2017-08-07 19:57:53 · 935 阅读 · 0 评论 -
FAFU OJ 纸牌排序
纸牌排序Time Limit:1000MSMemory Limit:65536KBTotal Submissions:149Accepted:66ShareDescription: 给纸牌排序,不过一定不是一整副哦。而是一副中的部分纸牌,你只要按顺序输出你所读到的纸牌就行了。原创 2017-07-08 14:50:26 · 561 阅读 · 0 评论 -
codevs 选数
题目描述 Description已知 n 个整数 x1,x2,…,xn,以及一个整数 k(k<n)。从 n 个整数中任选 k 个整数相加,可分别得到一系列的和。例如当 n=4,k=3,4 个整数分别为 3,7,12,19 时,可得全部的组合与它们的和为: 3+7+12=22 3+7+19=29 7+12+19=38 3+12+19=34。 现在,要求你计算出和为素数共原创 2017-06-15 17:52:13 · 554 阅读 · 0 评论 -
FAFU OJ AC
A CTime Limit:1000MSMemory Limit:65536KBTotal Submissions:86Accepted:57ShareDescription: Are you excited when you see the title "AC" ? If the ans原创 2017-06-19 16:58:56 · 648 阅读 · 0 评论 -
FAFU OJ 今年暑假不ac
今年暑假不acTime Limit:1000MSMemory Limit:65536KBTotal Submissions:416Accepted:97ShareDescription: “今年暑假不AC?” “是的。” “那你干什么呢?”原创 2017-08-07 20:05:43 · 556 阅读 · 0 评论 -
FAFU OJ 纸牌排序
纸牌排序Time Limit:1000MSMemory Limit:65536KBTotal Submissions:149Accepted:66ShareDescription: 给纸牌排序,不过一定不是一整副哦。而是一副中的部分纸牌,你只要按顺序输出你所读到的纸牌就行了。原创 2017-08-07 20:16:55 · 608 阅读 · 0 评论 -
FAFU OJ 求幂模
求幂模Time Limit:1000MSMemory Limit:65536KBTotal Submissions:118Accepted:53ShareDescription: 求c^e÷n的余数(c的e次方除以n的模)。 Input:原创 2017-08-08 19:04:14 · 601 阅读 · 0 评论 -
FAFU OJ 素数环
素数环Time Limit:4000MSMemory Limit:65536KBTotal Submissions:172Accepted:79ShareDescription: 给定数n,在n的所有排列中,记a[1],a[2],...,a[n],求满足a[i]+a[i+1](1原创 2017-08-05 09:45:24 · 593 阅读 · 0 评论 -
FAFU OJ 变形课
变形课Time Limit:1000MSMemory Limit:65536KBTotal Submissions:193Accepted:82ShareDescription: 呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将原创 2017-08-05 16:24:39 · 499 阅读 · 0 评论 -
FAFU OJ 寻路问题
寻路问题Time Limit:2000MSMemory Limit:65536KBTotal Submissions:183Accepted:89ShareDescription: 某国的一个网络使用若干条线路连接若干个节点。节点间的通信是双向的。某重要数据包,为了安全起见,必须恰好被转发原创 2017-08-05 16:39:41 · 659 阅读 · 1 评论 -
FAFU OJ 组合
组合Time Limit:1000MSMemory Limit:65536KBTotal Submissions:445Accepted:251ShareDescription: 问题很简单,给你n个正整数,求出这n个正整数中所有任选k个相乘后的和。Input:原创 2017-06-15 17:42:44 · 701 阅读 · 0 评论 -
FAFU OJ 最大的偶数
最大偶数Time Limit:1000MSMemory Limit:65536KBTotal Submissions:631Accepted:325ShareDescription: 给你15个(0~1000)的整数,你只要找到一个最大的偶数并把它输出来。Input:原创 2017-06-15 17:39:29 · 650 阅读 · 0 评论 -
FAFU OJ 多项式相乘
多项式相乘Time Limit:1000MSMemory Limit:65536KBTotal Submissions:311Accepted:119ShareDescription: 编程实现若干个多项式相乘。多项式的输入输出格式为:系数在前,指数在后,各项按指数递增排列,每个多项式输入原创 2017-06-15 17:36:35 · 872 阅读 · 0 评论 -
FAFU OJ 求幂模
Description: 求c^e÷n的余数(c的e次方除以n的模)。 Input:输入有一行三个整数c,e,n。Output:输出只有一个整数,即所求结果。Sample Input:2 10 100Sample Output:原创 2017-06-22 20:07:24 · 496 阅读 · 0 评论 -
FAFU OJ 子串
子串Time Limit:1000MSMemory Limit:65536KBTotal Submissions:196Accepted:80ShareDescription: 给你一个字符串s1,在给你一个字符串s2,判断一下字符串s2是不是s1的子串!原创 2017-06-22 20:04:23 · 532 阅读 · 0 评论