- 博客(246)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 阿帕奇00-default配置文件（备忘）
# The ServerName directive sets the request scheme, hostname and port that# the server uses to identify itself. This is used when creating# redirection URLs. In the context of virtual hosts, the Ser
2014-10-15 16:45:43
1450
1
原创 php抓取网页
用php抓取页面的内容在实际的开发当中是非常有用的，如作一个简单的内容采集器，提取网页中的部分内容等等，抓取到的内容在通过正则表达式做一下过滤就得到了你想要的内容，以下就是几种常用的用php抓取网页中的内容的方法。1.file_get_contents PHP代码$url = "http://www.phpzixue.cn"; $contents = file
2014-06-14 00:21:36
1275
原创 笔记本简易分网软件
软件名称：笔记本简易分网系统软件类别：国产软件/网络共享软件授权：免费版使用系统：windows7/8/XP软件大小：890K软件语言：简体中文下载地址：http://pan.baidu.com/share/link?shareid=1608915485&uk=741732084软件优点：相比市面上流行的金山、魔方等开启笔记本wifi热点软件，占用内存小（整个软件只有8
2013-12-21 10:26:22
10059
3
原创 FZU2138-久违的月赛之一
Problem Description好久没举月赛了，这次lqw给大家出了5道题，因为hsy学长宣传的很到位，吸引了n个DDMM们来做，另一位kk学长说，全做对的要给金奖，做对4题要给银奖，做对3题要给铜奖。统计数据的时候，发现每题分别在n个人中有n1、n2、n3、n4、n5个人通过，lqw灵机一动，问kk：“你猜，这次至少会有多少个人获奖？”由于题目太简单了，每题的通过人数一定大于等于最
2013-12-15 21:07:19
9697
原创 FZU2132 - LQX的作业（概率论）
Problem DescriptionLQX在做作业时遇到一个难题不会做，请你帮她计算一下：在N个独立地分布于0和1之间的随机变量排为非递减顺序之后，这些变量中第M个小于等于x的概率是多少？ Input第一行一个整数T（T每组数据一行，依次是N M x(1 Output每组数据对应一行输出，即概率是多少，四舍五入保留4位小数。 Sample
2013-12-15 21:02:56
9685
原创 Codeforces Round ＃219 （Div. 2） Counting Kangaroos is Fun
There are n kangaroos with pockets. Each kangaroo has a size (integer number). A kangaroo can go into another kangaroo's pocket if and only if the size of kangaroo who hold the kangaroo is at least tw
2013-12-14 10:23:32
10151
1
原创 Codeforces Round ＃219 （Div. 2）A. Collecting Beats is Fun
Cucumber boy is fan of Kyubeat, a famous music game.Kyubeat has 16 panels for playing arranged in 4 × 4 table. When a panel lights up, he has to press that panel.Each panel has a timing to press
2013-12-14 09:35:47
9678
原创 SQL数据类型
MySQL 数据类型在 MySQL 中，有三种主要的类型：文本、数字和日期/时间类型。Text 类型：数据类型描述CHAR(size)保存固定长度的字符串（可包含字母、数字以及特殊字符）。在括号中指定字符串的长度。最多 255 个字符。VARCHAR(size)保存可变长度的字符串（可包含字母、数字以及特殊字符）。在括号中指定字符串的
2013-12-12 15:45:52
9241
原创 java连接数据库
刚刚学习了用java连接数据库，明白了一些基础知识。过程如下： 1、加载JDBC驱动程序： 2、提供JDBC连接的URL 3、创建数据库的连接 4、创建一个Statement •要执行SQL语句，必须获得java.sql.Statement实例，Statement实例分为以下3 种类型： 1、执行
2013-12-12 15:32:17
9751
原创 SGU175-Encoding
Let phi(W) is the result of encoding for algorithm: 1. If the length of W is 1 then phi(W) is W; 2. Let coded word is W = w1w2...wN and K = N / 2 (rounded down); 3. phi(W) = phi(wNwN-1...wK+1) +
2013-12-09 22:13:48
9627
原创 FZU-竞技游戏
DescriptionJohn和Smith在玩一种竞技游戏。在游戏中，John给Smith由n个正整数组成的序列以及m条操作指令，需要Smith按照指令来对n个整数进行操作。其中每条指令都包括二个整数(a, b)，意义如下：如果a大于0，表示将序列中第b个数乘于2；如果a小于0，表示将序列中第b个数加上2；如果a等于0，则忽略此条指令。游戏结束后，Smith需要求出序列
2013-12-08 20:17:00
9376
原创 SGU144-Meeting（几何概型）
144. Meeting time limit per test: 0.5 sec. memory limit per test: 4096 KB Two of the three members of the winning team of one of the ACM regional contests are going to meet in order to train
2013-12-07 10:24:39
9611
原创 SGU133-Border （Sort）
133. Border time limit per test: 0.5 sec. memory limit per test: 4096 KB Along the border between states A and B there are N defence outposts. For every outpost k, the interval [Ak,Bk] w
2013-12-06 15:50:28
9104
原创 SGU231-Prime Sum 还是素数
231. Prime Sum time limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardFind all pairs of prime numbers (A, B) such that A<=B and their sum is also a
2013-12-05 22:48:40
9670
原创 STL归并排序
#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int n; int a[99999]; while(scanf("%d"
2013-12-04 23:48:39
10597
原创 SGU114-Telecasting station
114. Telecasting station time limit per test: 0.5 sec. memory limit per test: 4096 KB Every city in Berland is situated on Ox axis. The government of the country decided to build new telecas
2013-12-04 21:15:40
9469
原创 SGU130-circle
130. Circle time limit per test: 0.5 sec. memory limit per test: 4096 KB On a circle border there are 2k different points A1, A2, ..., A2k, located contiguously. These points connect k chord
2013-12-04 00:28:31
9682
原创 SGU154——Factorial （poj1401变形题——数论+二分）
154. Factorial time limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputYou task is to find minimal natural number N, so that N! contain
2013-12-03 18:33:31
10196
原创 POJ1401-Factorial
DescriptionThe most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone) and ev
2013-12-03 17:09:49
9841
原创 SGU276-Andrew's Troubles
Famous Berland ACM-ICPC team Anisovka consists of three programmers: Andrew, Michael and Ilya. A long time ago, during the first few months the team was founded, Andrew was very often late to the trai
2013-12-02 21:32:15
9155
原创 SGU126-Boxes
126. Boxes time limit per test: 0.5 sec. memory limit per test: 4096 KB There are two boxes. There are A balls in the first box, and B balls in the second box (0 < A + B < 2147483648). It is
2013-12-02 21:27:51
9427
原创 SGU118——Digital Root
118. Digital Root time limit per test: 0.5 sec. memory limit per test: 4096 KB Let f(n) be a sum of digits for positive integer n. If f(n) is one-digit number then it is a digital root for
2013-12-02 21:24:15
1380
原创 SGU117—Counting （快速幂取模）
117. Counting time limit per test: 0.5 sec. memory limit per test: 4096 KB Find amount of numbers for given sequence of integer numbers such that after raising them to theM-th power they w
2013-11-28 20:36:28
1526
原创 SGU127-Telephone directory
127. Telephone directorytime limit per test: 0.5 sec. memory limit per test: 4096 KB CIA has decided to create a special telephone directory for its agents. The first 2 pages of the directory
2013-11-27 15:51:11
1137
原创 Codeforces Round #215 (Div. 2) -B. Sereja and Suffixes
B. Sereja and Suffixestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSereja has an array a, consisting of n intege
2013-11-27 11:05:21
1248
原创 Codeforces Round #215 (Div. 2) -A. Sereja and Coat Rack
Sereja owns a restaurant for n people. The restaurant hall has a coat rack withn hooks. Each restaurant visitor can use a hook to hang his clothes on it. Using thei-th hook costs ai rubles. Only o
2013-11-27 00:43:43
1699
原创 SGU112-a^b-b^a (BigNum)
You are given natural numbers a and b. Find ab-ba.InputInput contains numbers a and b (1≤a,b≤100). OutputWrite answer to output. Sample Input2 3Sample Output-1 分析
2013-11-26 08:22:40
1402
原创 Java大数处理
Ⅰ基本函数：1.valueOf(parament); 将参数转换为制定的类型 比如 int a=3; BigInteger b=BigInteger.valueOf(a); 则b=3; String s=”12345”; BigInteger c=BigInteger.value
2013-11-25 22:31:32
1993
原创 SGU113—— Nearly prime numbers
Nearly prime number is an integer positive number for which it is possible to find such primesP1 and P2 that given number is equal to P1*P2. There is given a sequence on N integer positive numbers
2013-11-22 22:02:02
1912
原创 SGU135——Drawing Lines（math）
Little Johnny likes to draw a lot. A few days ago he painted lots of straight lines on his sheet of paper. Then he counted in how many zones the sheet of paper was split by these lines. He noticed tha
2013-11-21 14:53:52
1617
原创 SGU107——987654321 problem
For given number N you must output amount of N-digit numbers, such, that last digits of their square is equal to 987654321. InputInput contains integer number N (16) OutputWrite answer
2013-11-21 11:31:05
2067
原创 SGU184——Patties
Petya is well-known with his famous cabbage patties. Petya's birthday will come very soon, and he wants to invite as many guests as possible. But the boy wants everybody to try his specialty of the ho
2013-11-20 11:27:15
1315
原创 SGU123——The sum（又见斐波那契）
The Fibonacci sequence of numbers is known: F1 = 1; F2 = 1; Fn+1 = Fn + Fn-1, for n>1.You have to find S - the sum of the first K Fibonacci numbers.InputFirst line contains natural number
2013-11-20 11:14:31
1446
原创 codeforces 365A——Good Number
Let's call a number k-good if it contains all digits not exceedingk (0, ..., k). You've got a numberk and an array a containingn numbers. Find out how many k-good numbers are in a (count each
2013-11-20 10:13:54
1757
原创 SGU105—— Div 3
105. Div 3 time limit per test: 0.5 sec. memory limit per test: 4096 KB There is sequence 1, 12, 123, 1234, ..., 12345678910, ... . Given first N elements of that sequence. You must determin
2013-11-19 16:55:49
1334
原创 SGU102——Coprimes （又见欧几里得）
102. Coprimes time limit per test: 0.5 sec. memory limit per test: 4096 KB For given integer N (1N104) find amount of positive numbers not greater than N that coprime with N. Let us call tw
2013-11-19 16:08:06
1438
原创 LA3135——Argus（优先队列）
DescriptionA data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Internet traffic, financial tickers, on-line auctions, and transaction logs s
2013-11-19 08:21:00
1607
原创 UVA11991——Easy Problem from Rujia Liu?（map+vector）
Though Rujia Liu usually sets hard problems for contests (for example, regional contests like Xi'an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contests like Rujia Liu's Presents 1 and 2), he occasio
2013-11-18 22:40:11
1500
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人