# Author Archives: admin - Page 2

## 滑雪

Time Limit: 1000MS Memory Limit: 65536K

### Description

Michael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子

 1 2 3 4 5   16 17 18 19 6   15 24 25 20 7   14 23 22 21 8   13 12 11 10 9

### Sample Input

5 5 1 2 3 4 5 16 17 18 19 6 15 24 25 20 7 14 23 22 21 8 13 12 11 10 9

### Sample Output

25

### Source

SHTSC 2002

......

## 混凝土浇筑模板侧压力计算

$F = 0.22 \gamma_c t_0 \beta _1 \beta _2 V^\frac{1}{2}$

$F = \gamma _c H$

$F$－新浇混凝土对模板产生的最大侧压力(kN/m2);

$H$－有效压头高度(m);

$V$－混凝土浇筑速度(m/h);

$t_0$－混凝土入模时的温度(℃);

$\gamma_c$－混凝土的容重(kN/m3);

$K$－外加剂影响修正系数,不掺外加剂时取k=1.0,掺缓凝作用的外加剂时k=1.2;

$\beta _1$-外加剂影响修正系数,不掺外加剂时取1.0;掺具有缓凝作用的外加剂时取1.2;

$\beta _2$-塌落度影响修正系数,当塌落度小于30mm时,取0.85;50-90mm时,取1.0;110-150时,取1.15.

$V/t_0<0.035$时,$H=0.22+24.9V/t_0$;

$V/t_0>0.035$时,$H=1.53+3.8V/t_0$;

......

## Goodbye Dennis Ritchie!

#include<stdio.h>   int main() { printf("Goodbye Dennis Ritchie!n"); return 0; }

## SDCC编译器简明使用教程

### 源代码与Keil C的稍许不同

//SDCC Keil C __sbit __at 0x94 blackLineLeft; sbit blackLineLeft=P1^4; __sbit __at 0x95 blackLineRight; sbit blackLineRight=P1^5; __sbit __at 0x80 in1; sbit in1=P1^0; __sbit __at 0x81 in2; sbit in2=P1^1; __sbit __at 0x82 in3 sbit in3=P1^2; __sbit __at 0x83 in4; sbit in4=P1^3;

void delay0_1(uint n) { for(i=0;i<n;++i) { for(j=0;j<10000;++j) { __asm nop __endasm; } } }

......

## Fake Tickets

Time Limit: 1 Seconds Memory Limit: 32768 KB

Your school organized a big party to celebrate your team brilliant win in the prestigious, worldfamous ICPC (International Collegiate Poetry Contest). Everyone in your school was invited for an evening which included cocktail, dinner and a session where your team work was read to the audience. The evening was a success - many more people than you expected showed interested in your poetry - although some critics of yours said it was food rather than words that attracted such an audience.

Whatever the reason, the next day you found out why the school hall had seemed so full: the school director confided he had discovered that several of the tickets used by the guests were fake. The real tickets were numbered sequentially from 1 to N (N <= 10000). The director suspects some people had used the school scanner and printer from the Computer Room to produce copies of the real tickets. The director gave you a pack with all tickets collected from the guests at the party's entrance, and asked you to determine how many tickets in the pack had 'clones', that is, another ticket with the same sequence number.

Input

The input contains data for several test cases. Each test case has two lines. The first line contains two integers N and M which indicate respectively the number of original tickets and the number of persons attending the party (1 <= N <= 10000 and 1 <= M <= 20000). The second line of a test case contains M integers Ti representing the ticket numbers in the pack the director gave you (1 <= Ti <= N). The end of input is indicated by N = M = 0.

Output

For each test case your program should print one line, containing the number of tickets in the pack that had another ticket with the same sequence number.