- 博客(91)
- 资源 (20)
- 收藏
- 关注
原创 子序列个数(fzu2129)
子序列个数Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice FZU 2129Description子序列的定义:对于一个序列a=a[1],a[2],......a[n]。则非空序列a'=a[p1],a[p2]....
2015-03-29 22:54:14 977
原创 Contest2071 - 湖南多校对抗赛(2015.03.28)
Contest2071 - 湖南多校对抗赛(2015.03.28) 本次比赛试题由湖南大学ACM校队原创 http://acm.csu.edu.cn/OnlineJudge/contest.php?cid=2071Problem A: RectangleTime Limit: 1 Sec Memory Limit: 256 MBSubmit: 210 S
2015-03-28 23:17:31 2072
原创 青蛙的约会(poj1061+欧几里德+同余方程)
**青蛙的约会**Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 94174 Accepted: 17412 Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要
2015-03-27 19:34:24 4759 1
原创 Romantic(hdu2699+欧几里德)
RomanticTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3218 Accepted Submission(s): 1274Problem Description The Sky is Sprite. The Birds
2015-03-26 13:21:09 1044
原创 Biorhythms(poj1006欧几里德)
BiorhythmsTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 117973 Accepted: 37026 DescriptionSome people believe that there are three cycles in a person’s life that start the day
2015-03-25 22:02:41 750
转载 欧几里得算法和扩展欧几里得算法
欧几里得算法作用:计算两个数的最大公约数。算法:欧几里德算法又称辗转相除法,用于计算两个整数a,b的最大公约数。用gcd(a, b)表示a和b的最大公约数。gcd函数的基本性质:gcd(a,b)=gcd(b,a)=gcd(-a,b)=gcd(|a|,|b|)=gcd(a,b-a)C实现:1 typedef long lon
2015-03-24 23:21:08 657
转载 扩展欧几里德求逆元模板
扩展欧几里德求逆元模板:#include<iostream>#define __int64 long longusing namespace std;//举例 3x+4y=1 ax+by=1//得到一组解x0=-1,y0=1 通解为x=-1+4k,y=1-3kinline __int64 extend_gcd(__int64 a,__int64 b,__int64 &x,__int64
2015-03-23 22:55:52 991
原创 Gold Rush(hnu13249)
Gold RushTime Limit: 2000ms, Special Time Limit:5000ms, Memory Limit:65536KBTotal submit users: 15, Accepted users: 10Problem 13249 : No special judgementProblem description
2015-03-23 11:33:14 821
原创 Biorhythms(poj1006+中国剩余定理)
生理周期Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 117861 Accepted: 36978Description人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相
2015-03-23 11:33:10 564
原创 Bell(矩阵快速幂+中国剩余定理)
BellTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4767Appoint description: System Crawler (2015-03-15)DescriptionWhat? M
2015-03-23 11:33:05 700
原创 Power of Matrix(uva11149+矩阵快速幂)
Power of MatrixTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 11149Appoint description: System Crawler (2015-03-15)Description
2015-03-23 11:33:01 697
原创 Training little cats(poj3735,矩阵快速幂)
Training little catsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10737 Accepted: 2563DescriptionFacer's pet cat just gave birth to a brood of little
2015-03-23 11:32:56 630
原创 233 Matrix(hdu5015 矩阵)
233 MatrixTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1190 Accepted Submission(s): 700Problem DescriptionIn our daily life we ofte
2015-03-23 11:32:51 763
原创 Contemplation! Algebra(矩阵快速幂,uva10655)
Problem EContemplation! AlgebraInput: Standard InputOutput: Standard OutputTime Limit: 1 Second Given the value of a+b and ab you will have to find the value of an+bn InputThe input file
2015-03-23 11:32:47 586
原创 Another kind of Fibonacci(矩阵)
Another kind of FibonacciTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1919 Accepted Submission(s): 738Problem DescriptionAs we all k
2015-03-23 11:32:41 750
原创 M斐波那契数列(矩阵快速幂+费马小定理)
M斐波那契数列Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1672 Accepted Submission(s): 482Problem DescriptionM斐波那契数列F[n]是一种整数数列,它的定义如下:F[0
2015-03-23 11:32:36 1265
原创 Fibonacci(矩阵)
FibonacciTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2.
2015-03-23 11:32:34 602
原创 常系数线性递推的第n项及前n项和 (Fibonacci数列,矩阵)
(一)Fibonacci数列f[n]=f[n-1]+f[n-2],f[1]=f[2]=1的第n项的快速求法(不考虑高精度).解法:考虑1×2的矩阵【f[n-2],f[n-1]】。根据fibonacci数列的递推关系,我们希望通过乘以一个2×2的矩阵,得到矩阵【f[n-1],f[n]】=【f[n-1],f[n-1]+f[n-2]】很容易构造出这个2×2矩阵A,即:01
2015-03-23 11:32:29 675 1
原创 Evolution(矩阵快速幂)
EvolutionTime Limit: 5 Seconds Memory Limit: 32768 KB DescriptionEvolution is a long, long process with extreme complexity and involves many species. Dr. C. P. Lottery is currently invest
2015-03-23 11:32:25 548
原创 BestCoder Round #29——A--GTY's math problem(快速幂(对数法))、B--GTY's birthday gift(矩阵快速幂)
GTY's math problemTime Limit: 1000/1000 MS(Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionGTY is a G
2015-03-23 11:32:18 793
原创 Crazy Shopping(拓扑排序+完全背包)
Crazy Shopping(拓扑排序+完全背包)Because of the 90th anniversary of the Coherent & Cute Patchouli (C.C.P), Kawashiro Nitori decides to buy a lot of rare things to celebrate. Kawashiro Nitori is a v
2015-03-23 11:32:14 772
原创 BestCoder Round #27
Jump and Jump...Time Limit: 2000/1000 MS(Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionThere are n
2015-03-23 11:32:09 640
原创 Math Magic(完全背包)
Math MagicTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionYesterday, my teacher taught us about math: +, -, *, /, GCD, LCM... As you k
2015-03-23 11:32:05 779
原创 Charlie's Change(完全背包+路径记忆)
Charlie's ChangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3176 Accepted: 913DescriptionCharlie is a driver of Advanced Cargo Movement, Ltd. Charlie
2015-03-23 11:32:00 608
原创 01背包专题
>>什么是01背包A - Bone CollectorTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMany years ago , in Teddy’s hometown there was a man
2015-03-23 11:31:56 606
原创 01背包
P01: 01背包问题题目有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使价值总和最大。基本思路这是最基础的背包问题,特点是:每种物品仅有一件,可以选择放或不放。用子问题定义状态:即f[i][v]表示前i件物品恰放入一个容量为v的背包可以获得的最大价值。则其状态转移方程便是:f[i][v]=max{f[i-1][v],f
2015-03-23 11:31:53 479
原创 Proud Merchants(01背包变形)
I - Proud MerchantsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescriptionRecently, iSea went to an ancient country. For such a long time, it was the most w
2015-03-23 11:31:49 574
原创 面积最大的全1子矩阵
面积最大的全1子矩阵时间限制:1 秒内存限制:128 兆特殊判题:否提交:859解决:179题目描述:在一个M * N的矩阵中,所有的元素只有0和1,从这个矩阵中找出一个面积最大的全1子矩阵,所谓最大是指元素1的个数最多。 输入:输入可能包含多个测试样例。对于每个测试案例,输入的第一行是两个整数m、n(1矩阵共有m行,每行有n个整数,分别是0或1,相
2015-03-23 11:31:44 627
原创 最后的日子-训练2
A - Solve equationCrawling in process... Crawling failed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Time Limit:1000MS Memory L
2015-03-23 11:31:39 776
原创 wei
JAVASCRIPT: charset="Shift_JIS" src="http://chabudai.sakura.ne.jp/blogparts/honehoneclock/honehone_clock_tr.js"> JAVASCRIPT:charset="Shift_JIS" src="http://chabudai.sakura.
2015-03-23 11:31:34 537
原创 程序执行时间
计算某一段代码的执行时间,下面给出两种常用的方式:第一种:使用GetTickCount函数#include#includeint main(){ DWORD start_time=GetTickCount(); { //此处为被测试代码 } DWORD end_time=GetTickCount();
2015-03-23 11:31:32 657
原创 oracle上机实验内容
这是oracle实验的部分代码,我花了一中午做的。我能给你们的只有这些,我不喜欢给别人不劳而获的的东西。。。接下来你们自己加油!!!第一次上机内容实验目的:熟悉ORACLE11G的环境实验内容: 第二次上机内容实验目标:掌握oracle体系结构,掌握sqlplus的运行环境,并对环境进行格式化实验任务:(1)尝试通过配置助手创建一个叫做student的数据库,并
2015-03-23 11:31:27 684
原创 数据库范式(1NF 2NF 3NF BCNF)
数据库的设计范式是数据库设计所需要满足的规范,满足这些规范的数据库是简洁的、结构明晰的,同时,不会发生插入(insert)、删除(delete)和更新(update)操作异常。反之则是乱七八糟,不仅给数据库的编程人员制造麻烦,而且面目可憎,可能存储了大量不需要的冗余信息。 范式说明 1.1 第一范式(1NF)无重复的列 所谓第一范式(1NF)是指数据库表的每一列都是
2015-03-23 11:31:22 511
原创 UML类图符号 各种关系说明以及举例
UML类图符号 各种关系说明以及举例UML中描述对象和类之间相互关系的方式包括:依赖(Dependency),关联(Association),聚合(Aggregation),组合(Composition),泛化(Generalization),实现(Realization)等。依赖(Dependency):元素A的变化会影响元素B,但反之不成立,那么B和A的关系是依赖关系,B依赖A
2015-03-23 11:31:18 557
原创 2013ACM/ICPC亚洲区南京站现场赛——题目重现
GPATime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1206 Accepted Submission(s): 748Problem DescriptionIn college, a student may take sev
2015-03-23 11:31:13 1110
原创 关于__int64的使用!
关于__int64的使用! 类型 long long__int64intmax_t格式%lld%I64d%I64d 在Dev C++中,三种类型均需用%I64d格式输出 ,c语言中intmax_t需要用到头文件stdint.hC++采用cin输入时,两种类型均可。eg1eg2eg3
2015-03-23 11:31:07 690
原创 The 2014 ACM-ICPC Asia Mudanjiang Regional First Round
The 2014 ACM-ICPC Asia Mudanjiang Regional First Round - AThe HimalayasTime Limit: 2 Seconds Memory Limit: 65536 KBAs an artist, Bob usually need to travel around the world. He made a lot of
2015-03-23 11:31:00 901
原创 最小公倍数(BNUOJ30195)
最小公倍数Time Limit: 0 ms Case Time Limit: 0 ms Memory Limit: 0 KBSubmit: 17 Accepted: 1 This problem will be judged on SCU. Original ID: 1630. [Prev][Next]Description 求N个正整数
2015-03-23 11:30:55 554
原创 Alice and Bob(博弈)
Alice and BobTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 20, Accepted users: 10Problem 11499 : No special judgementProblem descriptio
2015-03-23 11:30:50 892
原创 Cuckoo for Hashing(hash)
Problem B:Cuckoo for HashingAn integer hash table is a data structure that supports insert, delete and lookup of integer values inconstant time. Traditional hash structures consist of an array (the ha
2015-03-23 11:30:46 875
批量压缩图片(tinifypng.com)
2018-02-28
2004-2013软件设计师历年真题及答案
2015-08-22
原根(扩展欧几里得的应用)
2015-08-12
Java算法之经典题目篇
2015-04-04
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人