Content Preview: rss
19 days ago
set ai set autochdir set autoindent set awa set cindent set cinoptions={0,1s,t0,n-2,p2s,(03s,=.5s,>1s,=1s,:1s set expandtab set fileencodings=ucs-bom,utf8,GB18030,Big5,latin1 set history=50 set hlsearch set ignorecase set incsearch set laststatus=2 set nobackup set nocompatible set number set paste set ruler set shiftwidth=4 set showcmd set showmatch set smartcase set smartindent set softtabstop=4 set statusline=%F%m%r,\ %Y,\ %{&fileformat}\ \ \ ASCII=\%b,HEX=\0x\%B\ \ \ %l,%c%V\ \ %p%% set tabstop=4 :map <F5> :tabprevious<CR> :map <F6> :tabnew<CR> :map <F7> :tabnext<CR> :map <F2> :!g++ % -o %<<CR> :map <F3> :!%<<CR> :map <F4> :!clear<CR> :imap <F5> <ESC>:tabprevious<CR>i :imap <F6> <ESC>:tabnew<CR>i :imap <F7> <ESC>:tabnext<CR>i :imap ...
27 days ago
A:A Very Easy Problem! Description In A speech contest, when a contestant finishes his speech, the judges will then grade his performance. The staffs remove the highest grade and the lowest grade and compute the average of the rest as the contestant’s final grade. This is an easy problem because usually there are only several judges. Let’s consider a generalized form of the problem above. Given n positive integers, remove the greatest n 1 ones and the least n 2 ones, and compute the average of the rest. Input The input consists of several test cases. Each test case consists two lines. The first line contains three integers n and n 1 , n 2 (1<=n 1 , n 2 <=10,n 1 +n 2 <n<=5000) separate by a single space. The second line contains n non-descending positive integers a i (1<=a 1 <=a 2 …<=a n-1 <=a n <=10^3 for all i s.t. 1<=i<=n) separated by a single space. The last test case is followed by three zeroes. ...
29 days ago
首先给出原题以及 NOCOW 的翻译: Your Ride Is Here It is a well-known fact that behind every good comet is a UFO. These UFOs often come to collect loyal supporters from here on Earth. Unfortunately, they only have room to pick up one group of followers on each trip. They do, however, let the groups know ahead of time which will be picked up for each comet by a clever scheme: they pick a name for the comet which, along with the name of the group, can be used to determine if it is a particular group's turn to go (who do you think names the comets?). The details of the matching scheme are given below; your job is to write a program which takes the names of a group and a comet and then determines whether the group should go with the UFO behind that comet. Both the name of the group and the name of the comet are converted into a number in the following manner: the final number is just the product of all the letters in the name, where "A" is 1 and "Z" ...
559 days ago
回梦游仙 （歌词） 神州四月天 大地颠 震后巴蜀忧可怜 汶川县 都江堰 废墟一片 叠纸鸢 蜡烛点 举国上下心相连 夜无眠 只是叹流年 抗震救灾 你我紧上弦 有钱出钱 有力出力 上下一心 全力扭转乾坤 爱的歌声在回旋 先前千阡灰飞烟灭 大家重建家园 四月天 大地颠 震后巴蜀忧可怜 汶川县 都江堰 废墟一片 叠纸鸢 蜡烛点 举国上下心相连 夜无眠 只是叹流年 叹流年 本诗系 Icyblade Wise 原创。 若要转载请署上作者姓名，谢谢合作！
565 days ago
七律 离殇 闻道汶川震滔滔 军民抗灾气势豪 万家破亡人轮回 举国上下悲寂寥 谁言重担不可挑 神州大地尽舜尧 深知情在身长在 祥云御剑彩云飘 作于 二〇〇八年 四月 初十 本诗系 Icyblade Wise 原创。 若要转载请署上作者姓名，谢谢合作！
