2012年10月_fanlinqiang

12月 11月 10月 09月 08月 07月 06月 05月

转载 LCM Challenge(最小公倍数）

LCM ChallengeCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionSome days ago, I learned the concept of LCM (least co

2012-10-28 14:40:59 984

原创 Easy Number Challenge（求因子个数）

Crawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionLet's denote d(n) as the number of divisors of a positive integer

2012-10-28 10:46:06 580

原创 Stars(树状数组）

Stars Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6 Accepted Submission(s) : 4Problem DescriptionAstronomers often examine star maps whe

2012-10-27 15:47:15 875

原创读数

#includeusing namespace std;int main(){ string str[10]={"","shi","bai","qian","wan","shi wan","bai wan","qian wan","yi"}; string num[10]={"ling","yi","er","san","si","wu","liu","qi","ba","j

2012-10-26 12:39:19 534

原创十进制转十六进制

#includeusing namespace std;int main(){ int n; while(cin>>n) { int tmp,i=0,arr[101]; while(n>0) { tmp=n%16; arr[++i]=tmp; n/=16;

2012-10-25 21:16:03 332

原创给出年月日输出下一天的日期

//给出年月日输出下一天的日期#includeusing namespace std;const int num[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};bool check(int x)//判断是否是闰年{ if((x%4==0&&x%100!=0)||x%400==0) return true; return

2012-10-25 21:04:30 2962

原创 1

//求n以内（不包括n）同时能被3和7整除的所有自然数之和的平方根s，//并作为函数值返回。例如若n为1000时，函数值应为：s=153.909064。#include#include#includeusing namespace std;double f(int x){ double sum=0; for(int i=3;i<x;i++) { if(i%

2012-10-25 20:43:05 360

原创 Boy or Girl

Boy or GirlCrawling in process...Crawling failedTime Limit:1000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionThose days, many boys use beautiful girls' photos as av

2012-10-24 21:08:23 815

原创 GCD Again(欧拉函数）

GCD Again Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 13 Accepted Submission(s) : 6Problem DescriptionDo you have spent some time to thi

2012-10-23 21:38:02 893 1

转载 The Euler function(欧拉函数）

Problem Description　　The Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbers which are smaller than n and coprime to n, and this function

2012-10-21 22:45:23 850

转载 Dragon Balls(并查集）

Dragon Balls Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 9 Accepted Submission(s) : 5Problem DescriptionFive hundred years later, the nu

2012-10-20 11:34:12 394

原创 STL学习

1>multiset的使用默认排序：从大到小方法：begin，insert，eraser 实例：http://blog.csdn.net/flqbestboy/article/details/8091383

2012-10-19 21:23:38 418

原创 Safe Or Unsafe（multiset、哈夫曼编码）

Safe Or Unsafe Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 8 Accepted Submission(s) : 7Problem DescriptionJavac++ 一天在看计算机的书籍的时候，看到了一个有

2012-10-19 21:18:54 977

转载哈夫曼编码简介

哈弗曼编码几乎是所有压缩算法的基础，其实这个算法并不复杂，简单的理解就是，如何用更短的bit来编码数据。我们知道普通的编码都是定长的，比如常用的ASCII编码,每个字符都是8个bit:字符编码A00101001B00101010C00101011……这样，计算机就能很方便的把由0和1组成的数据流

2012-10-19 20:24:32 764

转载 map、set、multimap、multiset（转）

概述关联容器(Associative Container)与顺序容器(Sequential Container)的本质区别在于：关联容器是通过键(key)存储和读取元素的，而顺序容器则通过元素在容器中的位置顺序存储和访问元素。关联容器支持通过键来高效地查找和读取元素，两个基本的关联容器是map和set。map的元素是“键-值”对的二元组形式：键用作元素在map中的索引，而值则表示所存储和读

2012-10-19 19:42:21 720

原创 What Are You Talking About（map）

What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 7846 Accepted Submission(s): 2448Problem DescriptionIgna

2012-10-17 21:52:07 370

转载 The Little Girl who Picks Mushrooms

The Little Girl who Picks MushroomsCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:32768KB 64bit IO Format:%lld & %lluDescriptionIt's yet another festival season i

2012-10-17 21:11:22 464

转载 Perfect Permutation

Perfect PermutationCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionA permutation is a sequence of integers p1, p

2012-10-17 21:05:10 530

原创 Is your horseshoe on the other hoof?

Is your horseshoe on the other hoof?Crawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionValera the Horse is going to t

2012-10-17 20:33:17 526

原创敌兵布阵(树状数组、线段树）

敌兵布阵 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 17 Accepted Submission(s) : 9Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下T

2012-10-15 21:07:53 506

转载初级线段树讲解

转载关于线段树的讲解好久没写过算法了，添一个吧，写一个线段树的入门知识，比较大众化。上次在湖大，其中的一道题数据很强，我试了好多种优化都TLE，相信只能用线段树才能过。回来之后暗暗又学了一次线段树，想想好像是第三次学了，像网络流一样每学一次都有新的体会。把问题简化一下：在自然数，且所有的数不大于30000的范围内讨论一个问题：现在已知n条线段，把端点依次输入告诉你，然后有m个询问，

2012-10-15 09:04:30 421

转载统计难题（字典树）

统计难题 Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131070/65535K (Java/Other)Total Submission(s) : 15 Accepted Submission(s) : 9Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会

2012-10-14 21:07:01 417

转载 Junk-Mail Filter（并查集）

Junk-Mail Filter Time Limit : 15000/8000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 20 Accepted Submission(s) : 6Problem DescriptionRecognizing junk mails i

2012-10-14 20:02:41 701

原创 Zjnu Stadium(并查集）

Zjnu Stadium Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 6 Accepted Submission(s) : 6Problem DescriptionIn 12th Zhejiang College Student

2012-10-14 15:54:48 411

转载 Is It A Tree?（并查集）

Is It A Tree? Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 13 Accepted Submission(s) : 7Problem DescriptionA tree is a well-known data st

2012-10-14 10:31:08 362

原创 Flying to the Mars（排序)

Flying to the Mars Time Limit : 5000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 13 Accepted Submission(s) : 6Problem DescriptionIn the year 8888,

2012-10-08 09:26:02 353

原创 Windows Message Queue(priority_queue优先队列）

Windows Message Queue Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 17 Accepted Submission(s) : 8Problem DescriptionMessage queue is the

2012-10-07 20:56:18 446

原创 Dragons

DragonsCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionKirito is stuck on a level of the MMORPG he is playing now.

2012-10-07 19:58:30 349

原创 Flipper(栈）

FlipperTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 12 Accepted Submission(s) : 8Problem DescriptionLittle Bobby Roberts (son of Big Bob,

2012-10-07 11:01:10 444

转载 C语言中->

->是一个整体，它是用于指向结构体、C++中的class等含有子数据的指针用来取子数据。换种说法，如果我们在C语言中定义了一个结构体，然后申明一个指针指向这个结构体，那么我们要用指针取出结构体中的数据，就要用到“->”.举个例子：struct Data{ int a,b,c;}; /*定义结构体*/struct Data * p;/*定义结构体指针*/s

2012-10-07 09:18:25 908

转载字典树 (解析加模版)

字典树：又叫trie树，单词查找树。是一种树形结构，典型的用于统计。经常用于统计一片文章当中出现确定的单词的次数，它的优点就在于：省略了相同前缀的比较。以下图为例：用单词carbohy,carhure,english,englnee来构造的trie树。当你用trie树来查找一个单词的时候，就像查字典是一样的，先查第一个单词，然后查第二个，在树中我们用深度遍历就可以实

2012-10-07 08:46:06 520

原创确定比赛名次(拓扑排序）

确定比赛名次 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 10 Accepted Submission(s) : 6Problem Description有N个比赛队（1Input输入有若干组，每组中的第

2012-10-06 21:50:18 453

原创 Train Problem I(栈）

Train Problem I Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 9 Accepted Submission(s) : 8Problem DescriptionAs the new term comes, the

2012-10-05 21:40:04 298

原创简单计算器

简单计算器 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 17 Accepted Submission(s) : 9Problem Description读入一个只包含 +, -, *, / 的非负整数计算表达式，计算该表达式的值

2012-10-01 10:16:02 487

原创 ACboy needs your help again!（堆栈的简单应用）

ACboy needs your help again!Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 14 Accepted Submission(s) : 10Problem DescriptionACboy was kid

2012-10-01 09:40:30 900