- 博客(12)
- 资源 (1)
- 收藏
- 关注
原创 POJ2785 4 Values whose Sum is 0(二分的力量)
# include <cstdio> # include <string> # include <cstring> # include <iostream> # include <algorithm> using namespace std;int a[4005], b[4005], c[4005], d[4005];int s...
2018-03-30 21:22:40 100
原创 River Hopscotch 二分
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8975 Accepted: 3859DescriptionEvery year the cows hold an event featuring a peculiar version of hopscotch that involves careful...
2018-03-25 13:35:39 129
原创 POJ3045 Cow Acrobats(贪心)
Cow AcrobatsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3639Accepted: 1412DescriptionFarmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away and join the ci...
2018-03-25 13:33:54 123
转载 图案
献给大一或大二的学弟学妹们和在自学 C语言的同志们。 打印自定义行数的矩形 打印效果: 参考代码:[cpp] view plain copy print?#include<stdio.h> int main() { int i,j,n; printf("请输入要打印矩形的行数:"); scanf("%d",&n); for(i=1;...
2018-03-20 21:02:17 155
原创 小Q系列故事——屌丝的逆袭
阿里2018实习生校招直播!看直播,投简历....小Q系列故事——屌丝的逆袭Time Limit: 300/100 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 7586 Accepted Submission(s): 2825Problem Description 毕业...
2018-03-19 22:08:35 183
原创 【字符串模拟】HDU1870愚人节的礼物
Problem Description四月一日快到了,Vayko想了个愚人的好办法——送礼物。嘿嘿,不要想的太好,这礼物可没那么简单,Vayko为了愚人,准备了一堆盒子,其中有一个盒子里面装了礼物。盒子里面可以再放零个或者多个盒子。假设放礼物的盒子里不再放其他盒子。用()表示一个盒子,B表示礼物,Vayko想让你帮她算出愚人指数,即最少需要拆多少个盒子才能拿到礼物。 Input本题目包含多组测试,...
2018-03-19 19:14:11 115
原创 基础队列和栈的应用
ACboy needs your help again!Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4832 Accepted Submission(s): 2473Problem DescriptionACboy was kid...
2018-03-19 19:05:41 107
转载 HDU 2048--神、上帝以及老天爷【错排】
神、上帝以及老天爷Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25478 Accepted Submission(s): 10621Problem DescriptionHDU 2006'10 ACM contest的颁奖晚会隆重...
2018-03-18 22:32:12 119
转载 递推 放苹果
【问题描述】把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。【输入】第一行是测试数据的数目t(0 <= t <= 20)。以下每行均包含二个整数M和N,以空格分开。1<=M,N<=10。【输出】对输入的每组数据M和N,用一行输出相应的K。【问题分析】放苹果的问题乍看之下很复杂,盘子是一样的...
2018-03-18 21:14:08 433
转载 杭电ACM1272(并查集)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1272题目大意:中文题目解题思路:并查集。题目要求的迷宫有两个特点:1:无环、2:单根,因此,若同一边上的两个点拥有相同的父节点,则可以认为有环,最后加一个扫描,判断根节点个数。AC代码:[cpp] view plain copy #include <iostream> using nam...
2018-03-13 21:31:16 214
原创 hdu1325 并查集-好题
A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.There is...
2018-03-13 14:49:35 198
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人