摘要:
Math MagicTime Limit:3000MSMemory Limit:32768KB64bit IO Format:%lld & %lluSubmitStatusDescriptionYesterday, my teacher taught us about math: +, -, *, ... 阅读全文
摘要:
Charlie's ChangeTime Limit:1000MSMemory Limit:30000KTotal Submissions:3176Accepted:913DescriptionCharlie is a driver of Advanced Cargo Movement, Ltd. ... 阅读全文
摘要:
>>什么是01背包>题目链接#includeusing namespace std;int main(){ int N,V,T; int w[1005]; int c[1005]; int i,j,k; scanf("%d",&T); while(T--) ... 阅读全文
摘要:
P01: 01背包问题题目有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使价值总和最大。基本思路这是最基础的背包问题,特点是:每种物品仅有一件,可以选择放或不放。用子问题定义状态:即f[i][v]表示前i件物品恰放入一个容量为v的背包可以获得的最... 阅读全文
摘要:
I -Proud MerchantsTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uDescriptionRecently, iSea went to an ancient country. For such a l... 阅读全文
摘要:
面积最大的全1子矩阵时间限制:1 秒内存限制:128 兆特殊判题:否提交:859解决:179题目描述:在一个M * N的矩阵中,所有的元素只有0和1,从这个矩阵中找出一个面积最大的全1子矩阵,所谓最大是指元素1的个数最多。输入:输入可能包含多个测试样例。对于每个测试案例,输入的第一行是两个整数m、n... 阅读全文
摘要:
A - Solve equationCrawling in process... Crawling failed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Time Limit:1000MS Memory... 阅读全文
摘要:
JAVASCRIPT:JAVASCRIPT: 阅读全文
摘要:
计算某一段代码的执行时间,下面给出两种常用的方式:第一种:使用GetTickCount函数#include#includeint main(){ DWORD start_time=GetTickCount(); { //此处为被测试代码 } DWORD e... 阅读全文
摘要:
这是oracle实验的部分代码,我花了一中午做的。第一次上机内容实验目的:熟悉ORACLE11G的环境实验内容:第二次上机内容实验目标:掌握oracle体系结构,掌握sqlplus的运行环境,并对环境进行格式化实验任务:(1)尝试通过配置助手创建一个叫做student的数据库,并观察控制面板中服务的... 阅读全文
摘要:
数据库的设计范式是数据库设计所需要满足的规范,满足这些规范的数据库是简洁的、结构明晰的,同时,不会发生插入(insert)、删除(delete)和更新(update)操作异常。反之则是乱七八糟,不仅给数据库的编程人员制造麻烦,而且面目可憎,可能存储了大量不需要的冗余信息。范式说明1.1第一范式(1N... 阅读全文
摘要:
UML类图符号 各种关系说明以及举例UML中描述对象和类之间相互关系的方式包括:依赖(Dependency),关联(Association),聚合(Aggregation),组合(Composition),泛化(Generalization),实现(Realization)等。依赖(Dependen... 阅读全文
摘要:
GPATime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1206 Accepted Submission(s): 748Problem Des... 阅读全文
摘要:
关于__int64的使用!类型long long__int64intmax_t格式%lld%I64d%I64d在Dev C++中,三种类型均需用%I64d格式输出 ,c语言中intmax_t需要用到头文件stdint.hC++采用cin输入时,两种类型均可。eg1eg2eg3#includeint ... 阅读全文
该文被密码保护。 阅读全文
摘要:
The 2014 ACM-ICPC Asia Mudanjiang Regional First Round - AThe HimalayasTime Limit: 2 Seconds Memory Limit: 65536 KBAs an artist, Bob usually need to t... 阅读全文
摘要:
最小公倍数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... 阅读全文
摘要:
Alice and BobTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 20, Accepted users: 10Problem 11499 : No special j... 阅读全文
摘要:
Problem B:Cuckoo for HashingAn integer hash table is a data structure that supports insert, delete and lookup of integer values inconstant time. Tradi... 阅读全文
该文被密码保护。 阅读全文
摘要:
MedianTime Limit: 5 Seconds Memory Limit: 65536 KBThe median of m numbers is after sorting them in order, the middle one number of them if m is even o... 阅读全文
摘要:
11078 - Open Credit SystemTime limit: 3.000 secondsProblem EOpen Credit SystemInput:Standard InputOutput:Standard OutputIn an open credit system, the ... 阅读全文
摘要:
First DateTime Limit: 3000ms, Special Time Limit:7500ms, Memory Limit:65536KBTotal submit users: 77, Accepted users: 46Problem 12952 : No special judg... 阅读全文
摘要:
Inviting FriendsTime Limit: 1 Second Memory Limit: 32768 KBYou want to hold a birthday party, inviting as many friends as possible, but you have to pr... 阅读全文
摘要:
Factorial Problem in Base KTime Limit: 2 Seconds Memory Limit: 65536 KBHow many zeros are there in the end of s! if both s and s! are written in base ... 阅读全文
摘要:
吉哥系列故事——临时工计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3046 Accepted Submission(s): 1197... 阅读全文
摘要:
Beans GameTime Limit: 5 Seconds Memory Limit: 32768 KBThere are three piles of beans. TT and DD pick any number of beans from any pile or the same num... 阅读全文
摘要:
Incircle and CircumcircleTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeA triangle is one the basic shapes in geometry. It's a polygon with... 阅读全文