## 중국 관광 홍보물 『黃山精華』에 보이는 한국어 번역의 문제점 고찰

本文主要考察了在中?出版?行的《?山精?》旅游宣??中收?的. 的弊端。通?分析得出的??有以下四点：第一，冗?句子；第二，?繁的名?句；第三，用?不?；第四，?法??等。‘冗?句子’和‘?繁的名?句’可以?于??腔的??。其主要原因在于?于拘泥于中文的句法特点，因而不能??成通俗的. 文章。‘用?不?’和‘?法??’是因缺乏??文的知?而引起的。本文的宗旨不?是??事中. 工作的??人、朝?族及?族提供?考，而且?正在?起. 潮的中?人. 准的. 而做出??。

## 代码先锋网 代码片段及技术文章聚合

Everybody knows that the Berland citizens are keen on health, especially students. Berland students are so tough that all they drink is orange juice!

Yesterday one student, Vasya and his mates made some barbecue and they drank this healthy drink only. After they ran out of the first barrel 在外汇中使用RSI的弊端 of juice, they decided to play a simple game. All *n* people who came to the barbecue sat in a circle (thus each *在外汇中使用RSI的弊端* person received a unique index *b*_{i} from 0 to *n* - 在外汇中使用RSI的弊端 1 ). The person number 0 started the game (this time it was Vasya). All turns in the game were numbered by integers starting from 在外汇中使用RSI的弊端 1. If the *j* -th turn was made by the person with index *b*_{i} , then this person acted like that:

- he pointed at the person with index (
*b*_{i}+ 1)*mod n*either 在外汇中使用RSI的弊端 with an elbow or with a nod (*x mod y*is the remainder after dividing*x*by*y*); - if
*j*≥ 4 and the players who had turns number*j*- 1 ,*j*- 2 ,*j*- 3 , made during their turns the same moves as player*b*_{i}on the current turn, then he had drunk a glass of juice; - the turn went to person number (
*b*_{i}+ 1)*mod n*.

The person who was pointed on the last turn did not make any actions.

The problem was, Vasya's drunk too much juice and can't remember the goal of the game. However, 在外汇中使用RSI的弊端 Vasya's got the recorded sequence of all the participants' actions (including himself). Now Vasya wants to find out the maximum amount of juice he could drink if he played optimally well (the 在外汇中使用RSI的弊端 other players' actions do not change). Help him.

You can assume that in any scenario, there is enough juice for everybody.

The first line contains a single integer *n* ( 4 ≤ *n* ≤ 2000 ) — the number of participants in the game. The second line describes the actual game: the *i* -th character of this line equals ' a ', **在外汇中使用RSI的弊端** if the participant who moved *i* -th pointed at the next person 在外汇中使用RSI的弊端 with his elbow, and ' b ', if the participant pointed with a nod. The game continued for at least 1 and at most 2000 在外汇中使用RSI的弊端 turns.

Print a single integer — the number of glasses of juice Vasya could have drunk if he had played optimally well.

## 代码先锋网 代码片段及技术文章聚合

This is a basic question asking to calculate the **"peak achievable performance**" (in MFLOPS) of vector-vector, vector-matrix, and matrix-matrix multiplication, given certain information about the memory system. The following is the set-up of the question:

- memory system with a level 1 cache of 32 KB and DRAM of 512 MB with the processor operating at 1 GHz
- The latency to L1 cache is one cycle and the latency to DRAM is 100 cycles
- In each memory cycle, the processor fetches four words (i.e. cache line size is four words)
- The matrices are of dimension 4K x 4K. (Each row of 在外汇中使用RSI的弊端 the matrix takes 16 KB of storage) and laid out in row-order fashion

#### Part a:

For arbitrary vectors **a** and **b**, what the is the peak performance, given the following code:

#### Part b:

What is the peak performance of the matrix-vector multiplication given by the following code:

#### Part c:

What is the performance of the matrix-matrix multiplication given by the following code:

### Solution:

We can consider that this problem is memory *在外汇中使用RSI的弊端* bound and consider only cache and memory access to solve this 在外汇中使用RSI的弊端 problem.

The first iteration creates a cache miss. The next 3 iterations access to a[i] and b[i] only refers to in cache data. Hence, every 4 iterations, there 2 cache misses for a[i] and b[i]. So 4 iterations last 2*100 cycles (memory latency). In 4 iterations, we 在外汇中使用RSI的弊端 perform 4*2 ops (***** and **+=**).

So 8 ops every 200ns is [8/(2*10^) ops/s=40M Flops]

After the warm up phase, vector b remains 在外汇中使用RSI的弊端 在外汇中使用RSI的弊端 in the cache and will no longer create cache misses. Similarly, misses for c are once every 4N operations and can be neglected. So Every 4 iterations, there is 1 cache miss. 4 iterations last 在外汇中使用RSI的弊端 100 cycles and perform 4*2 ops.

## 代码先锋网 代码片段及技术文章聚合

Inhabitants of the Wonderland 在外汇中使用RSI的弊端 have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to connect computers for the contestants using a “star” topology - i.e. connect them all to a single central hub. To organize a truly honest contest, the Head of the Judging Committee has decreed to place all contestants evenly around the hub on an equal distance from it.

To buy network cables, the Judging Committee has contacted a local network solutions provider with a request to sell for them a specified number of cables with equal lengths. The *在外汇中使用RSI的弊端<在外汇中使用RSI的弊端 /i> Judging Committee wants the cables to be as long as possible to sit contestants as far from each other as possible. The Cable Master of the company was assigned to the task. He knows the length of each cable in the stock up to a centimeter,and he can cut them with a centimeter precision being told the length of the pieces he must cut. However, this time, the length is not known and the Cable Master is completely puzzled. You 在外汇中使用RSI的弊端 are to help the Cable Master, by writing a program that will determine the maximal possible length of a cable piece that can be cut from the cables in the stock, to get the specified number of pieces.*

**Input**

The first line of the input file contains two integer numb ers N and K, separated by a space. N (1≤N≤10000) is the number of cables in the stock, and K (1≤K≤10000) is the number of requested pieces. The first line is followed by N lines with one number per line, that specify the length of each cable in the stock in meters. All cables are at least 1 meter and at most 100 kilometers in length. All lengths in the input file are written with a centimeter precision, with exactly two digits after a decimal point.

**Output**

Write to the output file the maximal length (in meters) of the pieces that Cable 在外汇中使用RSI的弊端 Master may cut from the cables in the stock to get the requested number of pieces. The number must be written with a 在外汇中使用RSI的弊端 centimeter precision, with exactly two digits after a decimal point.

If it is not possible to cut the requested number of pieces each one being at least one centimeter long, then the output file must contain the single number “0.00” (without quotes).

**Sample Input**

**Sample Output**

**题目大意**：给定n段较长的绳子，需要将这些绳子均等分割成k段。求每段最大长度

**Solution**：每段长度最小为1米，最大为100000米 在这个范围内进行二分即可,可以把米转换成厘米，也可以直接对小数进行二分。保留小数点后两位，也就是说1个单位长度的绳子可以分100次。