滑头鬼之亨-CSDN博客

原创公司考试记（Y-Y)

好久没有做题了，水平真的会退步。上机考个试做题都累，考试感悟如下：第一题：水题，给16组目标（R,G,B），再输入多组（R’,G' , B'），距离定义为欧式距离，求输入每组（R’,G' , B'）与前面16个距离最小的并输出。第二题：水题：题目描转。两人报数，数可能是虚报的，报数小的一定会检查报数大的，检查规则为数是否可有1-100内的数字相乘获得，1个数字只能用一次，（49不能为7x7），若两...

2018-06-24 14:35:15 391

转载 MySQL 5.6 for Windows 解压缩版配置安装

MySQL 5.6 for Windows 解压缩版配置安装|浏览：21782|更新：2014-03-05 12:281234567分步阅读方法/步骤MySQL安装文件分为两种，一种是msi格式的，一种是

2015-09-19 11:07:23 1804

转载文件夹隐藏项灰色

舍友的电脑不能乱插啊，手机sd卡中招了。计算机中毒后，病毒会对“受害者”进行各种各样的“恶搞”。其中令人头疼的“恶搞”之一就是：强行将磁盘的部分或全部文件夹(包括其中的子文件夹和全部文件)设置为“隐藏”，而不能通过“勾选”有关选项(文件夹/属性)归于正常状态。下面，向各位网友提供一组可以彻底解决上述疑难的“命令提示符”命令(业经实践证明有效)，以备大家不时之需——1。解除对某磁盘

2015-06-02 22:17:20 1952

原创递归下降分析法

各类参看书都会给的一个例子：LL（0）文法 G[E]：其中E→TG G为E’G→+TG|∧ ∧为εT→FS S为T’S→*FS|∧ F→i|(E) 递归向分析法为每一个非终结符建立相应的子程序,然后模拟语法树自动向下推倒，在推倒过程中遇到终结符则检查是否匹配，遇到非终结符则调用相应的

2013-11-06 15:47:07 9219

原创 uva 674 - Coin Change

Coin Change Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money.For example, if we

2012-11-12 19:42:14 2151

原创 uva 103 - Stacking Boxes

Stacking BoxesBackgroundSome concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when extended to arbitrary dimensions. Consider

2012-11-01 20:38:49 2549 1

原创 uva 10405 - Longest Common Subsequence

Problem C: Longest Common SubsequenceSequence 1: Sequence 2: Given two sequences of characters, print the length of the longest

2012-10-27 21:45:31 2164

原创 uva 10827 - Maximum sum on a torus

Problem HMaximum sum on a torusInput: Standard InputOutput:Standard OutputA grid that wraps both horizontally and vertically is called a torus. Given a torus where each cell contains an in

2012-10-23 20:14:27 2422

原创 uva 108 - Maximum Sum

Maximum SumBackgroundA problem that is simple to solve in one dimension is often much more difficult to solve in more than one dimension. Consider satisfying a boolean expression i

2012-10-23 18:57:56 2591

原创 uva 507 - Jill Rides Again

Jill Rides AgainJill likes to ride her bicycle, but since the pretty city of Greenhills where she lives has grown, Jill often uses the excellent public bus system for part of her journey. Sh

2012-10-15 21:11:19 2551

原创 uva 714 - Copying Books

Copying BooksBefore the invention of book-printing, it was very hard to make a copy of a book. All the contents had to be re-written by hand by so calledscribers. The scriber had been gi

2012-10-08 20:51:42 2882

原创实验二线性表的链式表示与实现

#include#includetypedef int elemtype;typedef struct node{ elemtype data; struct node *next;}node;struct node *head;int n;void bulid1()//尾插法{ struct node *p,*q; q=head; int

2012-09-21 11:24:28 3020

原创 uva 357 - Let Me Count The Ways

Let Me Count The WaysAfter making a purchase at a large department store, Mel's change was 17 cents. He received 1 dime, 1 nickel, and 2 pennies. Later that day, he was shopping at a con

2012-09-15 19:41:44 2401

原创实验一线性表的顺序表示与实现

实验一线性表的顺序表示与实现#include #include #include #define OVERFLOW -2#define OK 1#define ERROR 0#define LIST_INIT_SIZE 1000#define Elemtype int// typedef int Elemtypetypedef struct{

2012-09-12 17:42:32 3571 1

原创 2012 ACM/ICPC Asia Regional Tianjin Online

A very hard mathematic problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1455 Accepted Submission(s): 440Problem Description　　Haor

2012-09-11 18:14:10 2949

原创 2012 ACM/ICPC Asia Regional Changchun Online

1006LianLianKanTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionI like playing game with

2012-09-08 19:14:54 3016 1

原创 uva 11100 - The Trip, 2007

Problem A: The Trip, 2007A number of students are members of a club that travels annually to exotic locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadel

2012-09-08 09:40:51 3260 1

原创 uva 10714 - Ants

Problem B: AntsAn army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two a

2012-09-07 15:15:20 2387

原创 uva 10020 - Minimal coverage

Minimal coverageThe ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cover th

2012-09-06 21:32:36 3298

原创 uva 10487 - Closest Sums

Problem DClosest SumsInput: standard inputOutput: standard outputTime Limit: 3 secondsGiven is a set of integers and then a sequence of queries. A query gives you a number and asks to find

2012-09-06 19:31:57 2035

原创 uva 311 - Packets

PacketsA factory produces products packed in square packets of the same height h and of the sizes , , , , , . These products are always delivered to customers in the square p

2012-09-06 19:04:21 2503

原创 uva 10382 - Watering Grass

Problem EWatering GrassInput: standard inputOutput: standard outputTime Limit: 3 secondsn sprinklers are installed in a horizontal strip of grassl meters long and w meters wide. Each s

2012-09-05 21:29:41 1552

原创 uva 11054 - Wine trading in Gergovia

2006/2007 ACM International Collegiate Programming Contest University of Ulm Local ContestWine trading in GergoviaAs you may know from the comic "Asterix and the Chieftain's Shield", Gergovi

2012-09-05 19:32:01 1072

原创 uva 10718 - Bit Mask

Problem ABit MaskTime Limit1 SecondIn bit-wise expression, mask is a common term. You can get a certain bit-pattern using mask. For example, if you want to make first 4

2012-09-05 19:20:04 806

原创 uva 10400 - Game Show Math

Problem HGame Show MathInput: standard inputOutput: standard outputTime Limit: 15 secondsA game show in Britain has a segment where it gives its contestants a sequence of positive number

2012-09-04 19:57:18 905

原创 uva 10026 - Shoemaker's Problem

Shoemaker's ProblemShoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one job in each day. For each ith job, it is known the integer Ti (1i<=1000),

2012-09-03 21:53:01 1924

原创 uva 993 - Product of digits

Product of digitsFor a given non-negative integer number N , find the minimal naturalQ such that the product of all digits of Q is equal N . InputThe first line of input co

2012-09-03 21:02:05 1164

原创 10041 - Vito's Family

Problem C: Vito's familyBackgroundThe world-known gangster Vito Deadstone is moving to New York. He has a very big family there, all of them living in Lamafia Avenue. Since he will

2012-09-03 18:32:39 1309

原创 uva 10954 - Add All

Problem FAdd AllInput: standard inputOutput: standard outputYup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves condescended, to write a C/C++

2012-08-27 20:45:38 2096

原创 uva 10720 - Graph Construction

Problem CGraph ConstructionTime Limit2 SecondsGraph is a collection of edges E and verticesV. Graph has a wide variety of applications in computer. There are differen

2012-08-24 20:50:00 1481

原创 uva 10700 - Camel trading

Problem E - Camel tradingTime Limit: 1 secondBackground Aroud 800 A.D., El Mamum, Calif of Baghdad was presented the formula 1+2*3*4+5, which had its origin in the financial accounts of a

2012-08-24 10:33:29 1247

原创 uva 10340 - All in All

Problem EAll in AllInput:standard inputOutput:standard outputTime Limit: 2 secondsMemory Limit:32 MBYou have devised a new encryption technique which encodes a message by inserting b

2012-08-23 17:13:58 903

原创 uva 10057 - A mid-summer night's dream.

Problem CA mid-summer night’s dreamInput:standard inputOutput:standard output This is year 2200AD. Science has progressed a lot in two hundred years. Two hundred years is mentioned here be

2012-08-22 20:36:40 2027 1

原创 uva 10341 - Solve It

Problem FSolve ItInput:standard inputOutput:standard outputTime Limit: 1 secondMemory Limit: 32 MBSolve the equation: p*e-x+ q*sin(x) + r*cos(x) + s*tan(x) +t*x2 + u = 0

2012-08-22 17:17:33 1050

原创 uva 10132 - File Fragmentation

Question 2: File FragmentationThe ProblemYour friend, a biochemistry major, tripped while carrying a tray of computer files through the lab. All of the files fell to the ground and broke. Your fri

2012-08-21 16:12:44 902

原创 uva 10763 - Foreign Exchange

Problem EForeign ExchangeInput: standard inputOutput: standard outputTime Limit: 1 secondYour non-profit organization (iCORE -international Confederation of RevolverEnthusiasts) coor

2012-08-21 11:16:46 1046

原创 uva 10905 - Children's Game

4thIIUCInter-University Programming Contest, 2005AChildren’s GameInput: standard inputOutput: standard outputProblemsetter: Md. KamruzzamanThere a

2012-08-20 09:47:04 1215

原创 uva 321 - The New Villa

The New Villa Mr. Black recently bought a villa in the countryside. Only one thing bothers him: although there are light switches in most rooms, the lights they control are often in other ro

2012-08-18 20:40:43 1011

原创 uva 10085 - The most distant state

Problem AThe Most Distant StateInput:standard inputOutput:standard output The 8-puzzle is a square tray in which eight square tiles are placed. The remaining ninth square is uncovered. E

2012-08-18 16:19:20 1134

原创 uva 165 - Stamps

Stamps The government of Nova Mareterrania requires that various legal documents have stamps attached to them so that the government can derive revenue from them. In terms of recent legislation, eac

2012-08-17 15:11:47 1149 2