- 博客(37)
- 资源 (192)
- 收藏
- 关注
原创 Hotel ----线段树并查集,区间合并
HotelTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 11223 Accepted: 4855DescriptionThe cows are journeying north to Thunder Bay in Canada to gain cultu
2014-06-29 15:15:38 1145
原创 Help with Intervals 线段树并查集
Time Limit: 6000MS Memory Limit: 131072KTotal Submissions: 9784 Accepted: 2320Case Time Limit: 2000MSDescriptionLogLoader, Inc. is a company specialized in providin
2014-06-27 07:50:10 1137
原创 JAVA ----socket学习
服务器:/* *第一个服务器端程序,让它在9999端口监听 *作者:杨鑫 *日期:2014.06.20 * */package com.test1;import java.net.*;import java.io.*;public class MyServer1 { public static void main(String[] args){
2014-06-21 19:46:26 868
原创 Mayor's posters --- 线段树成段更新,离散化
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 39339 Accepted: 11422DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral e
2014-06-20 21:56:31 973
原创 Lake Counting --- 深度优先搜索
这道题很坑很坑,具体在哪里我接下来给大家分析:Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19318 Accepted: 9714DescriptionDue to recent rains, water ha
2014-06-19 10:10:36 1102
原创 C++二进制文件的读写
#include #include #include #include using namespace std;class CStudent{public:char szName[20];int nSore;};int main(){CStudent s;ofstream OutFile("D:\\student.dat",ios::out|io
2014-06-15 16:28:41 918
原创 奈氏准则 && 香农公式 && 信噪比
码元:在数字通信中常常用时间间隔相同的符号来表示一位二进制数字,这样的时间间隔内的信号称为二进制码元。 而这个间隔被称为码元长度。 1码元可以携带nbit的信息量。码元传输速率,又称为码元速率或传码率。其定义为每秒钟传送码元的数目,单位为"波特",常用符号"Baud"表示,简写为"B"。例题1:假定某信道受奈氏准则限制的最高码元速率为20000码元/秒。如果采用振幅调制,把码元的振
2014-06-13 16:15:37 5007 2
原创 C++ this指针的使用
#include #include using namespace std;class Complex{public:double real,imag;void Print(){cout}Complex(double r,double i):real(r),imag(i){}Complex Addone(){this->real++;th
2014-06-12 23:11:53 987
原创 深度优先搜索----部分和问题
/* *题意:提供正数a1,a2,....an。判断从这些书中选几个数的和能否刚好等于k。 1 -10^8 -10^8 * */#include #include #define MAXN 20using namespace std;int a[MAXN];int n,k;bool DFS(int i,int sum){if(i==n
2014-06-11 10:51:55 1083
原创 线段树成段更新----A Simple Problem with Integers
Time Limit: 5000MS Memory Limit: 131072KTotal Submissions: 56841 Accepted: 17230Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... , AN. You need to d
2014-06-11 10:10:47 991
原创 POJ2249Binomial Showdown
Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17617Accepted: 5363DescriptionIn how many ways can you choose k elements out of n elements, not taking order into
2014-06-10 10:29:22 890
原创 POJ1658Eva's Problem
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17152 Accepted: 10476DescriptionEva的家庭作业里有很多数列填空练习。填空练习的要求是:已知数列的前四项,填出第五项。因为已经知道这些数列只可能是等差或等比数列,她决定写一个程序来完成这些练习。
2014-06-10 10:00:29 1026
原创 POJ 3032Card Trick
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3766 Accepted: 2691DescriptionThe magician shuffles a small pack of cards, holds it face down and performs the f
2014-06-10 09:39:34 875
原创 POJ 2602Superlong sums
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22108 Accepted: 6509DescriptionThe creators of a new programming language D++ have found out that whatever limit f
2014-06-10 08:44:13 887
原创 POJ 2316 SPIN
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6241 Accepted: 3227DescriptionSimulate a locked spinner puzzle. A locked spinner puzzle is a puzzle where you
2014-06-09 23:58:40 1186
原创 POJ2453An Easy Problem
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7763 Accepted: 4633DescriptionAs we known, data stored in the computers is in binary form. The problem we discuss
2014-06-09 22:03:28 971
原创 POJ 2141Message Decowding
Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11684Accepted: 6502DescriptionThe cows are thrilled because they've just learned about encrypting messages. They
2014-06-09 21:50:10 900
原创 ROADS ----- 深度优先搜索
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10335 Accepted: 3819DescriptionN cities named with numbers 1 ... N are connected with one-way roads. Each road has
2014-06-09 17:49:57 1420
原创 城堡问题 ------ 深度优先搜索
总Time Limit: 1000ms Memory Limit: 65536kBDescription 1 2 3 4 5 6 7 ############################# 1 # | # | # | | # #####---#####---#---#####---# 2 # #
2014-06-09 16:17:19 2083
原创 Catch That Cow-----广度优先搜索
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 44027 Accepted: 13742DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch
2014-06-04 21:21:56 2295
原创 poj2309BST
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8322 Accepted: 5028DescriptionConsider an infinite full binary search tree (see the figure below), the numbers in
2014-06-03 20:46:58 1051
原创 poj3086Triangular Sums
Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6286Accepted: 4466DescriptionThe nth Triangular number, T(n) = 1 + … + n, is the sum of the first n integers. I
2014-06-03 20:12:37 806
原创 POJ 2190ISBN
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15039 Accepted: 5307DescriptionFarmer John's cows enjoy reading books, and FJ has discovered that his cows produce
2014-06-03 12:07:31 1063
原创 POJ1032 Parliament
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16685 Accepted: 7038DescriptionNew convocation of The Fool Land's Parliament consists of N delegates. According to
2014-06-02 16:46:57 947
原创 POJ1298 The Hardest Problem Ever
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22030 Accepted: 12103DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar
2014-06-02 15:04:14 989
原创 POJ2368 Buttons
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2903 Accepted: 734DescriptionAs you surely already know, Yekaterinburg has gotten its right to hold The Summer Oly
2014-06-02 14:39:24 1093
原创 POJ 2365Rope
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6306 Accepted: 2252DescriptionPlotters have barberically hammered N nails into an innocent plane shape, so that on
2014-06-02 14:13:22 1075
原创 POJ Beavergnaw
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6183 Accepted: 4079DescriptionWhen chomping a tree the beaver cuts a very specific shape out of the tree trunk.
2014-06-02 13:55:28 1183
原创 POJ1546 Basically Speaking
#include #include #include int main(){char s[99];int a,b;for(;~scanf("%s%d%d",s,&a,&b);){int n=strtol(s,0,a);itoa(n,s,b);printf("%7s\n",strlen(s)>7?"ERROR":strupr(s));}return
2014-06-02 10:46:19 880
原创 POJ2305 Basic remains
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4713 Accepted: 1997DescriptionGiven a base b and two non-negative base b integers p and m, compute p mod m and pri
2014-06-02 10:22:37 990
原创 Linux下终端怎么进去Root
首先在桌面上任意一处按一下键盘上的,CTRL+ALT+T调出终端。接着在终端窗口里,输入sudo su 并回车一下再接着输入ROOT的密码这样就可以进入终端下的ROOT权限了呵呵简单吧
2014-06-01 10:35:44 14505
深入浅出Otter与Canal.pdf
2020-02-29
weworkapi_python-master.zip
2020-01-20
基础算法-LP算法_线性规划问题.pptx
2019-10-17
基础算法-递归-杨鑫20191010.pptx
2019-10-17
基础算法 - 动态规划-2019-08-01.pptx
2019-10-17
Confluence-5.6.6-language-pack-zh_CN.jar
2018-09-30
Goods: Organizing Google’s Datasets
2018-09-06
Kudu- Storage for Fast Analytics on Fast Data
2017-12-21
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人