Time limit 1000 ms Memory limit 131072 kB It is widely known that any two strangers can get to know each other through at most six other people. Now let’s prove this. In the country Intermediary Conducts Personal Communications (ICPC), there are up t…

Time limit  1000 ms Memory limit  131072 kB The National Intelligence Council of X Nation receives a piece of credible information that Nation Y will send spies to steal Nation X’s confidential paper. So the commander of The National Intelligence Cou…

Time limit   1000 ms Memory limit   131072 kB Digital clock use 4 digits to express time, each digit is described by 3*3 characters (including”|”,”_”and” “).now given the current time, please tell us how can it be expressed by the digital clock.   In…

Time limit  1000 ms Memory limit  32768 kB Little A is one member of ACM team. He had just won the gold in World Final. To celebrate, he decided to invite all to have one meal. As bowl, knife and other tableware is not enough in the kitchen, Little A…

Time limit 1000 ms Memory limit 131072 kB The life of Little A is good, and, he managed to get enough money to run a hotel. The best for him is that he need not go to work outside, just wait for the money to go into his pocket. Little A wants everyth…

Time limit 1000 ms Memory limit 131072 kB This English game is a simple English words connection game. The rules are as follows: there are N English words in a dictionary, and every word has its own weight v. There is a weight if the corresponding wo…

Time limit  1000 ms Memory limit  131072 kB Little A has became fascinated with the game Dota recently, but he is not a good player. In all the modes, the rdsp Mode is popular on online, in this mode, little A always loses games if he gets strange he…

Time limit 1000 ms Memory limit 131072 kB Little A gets to know a new friend, Little B, recently. One day, they realize that they are family 500 years ago. Now, Little A wants to know whether Little B is his elder, younger or brother.   Input There a…

Time limit  1000 ms Memory limit   131072 kB Paula and Tai are couple. There are many stories between them. The day Paula left by airplane, Tai send one message to telephone 2200284, then, everything is changing… (The story in “the snow queen”). Afte…

Largest Rectangle in a Histogram Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 21204   Accepted: 6831 Description A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal wi…

最短路,三进制状态压缩. $dis[i][j]$表示到$i$节点,每个中介用了几次的情况下的最小花费,跑最短路即可. #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #include<map> #include<queue> #include<string> #include<i…

#include<bits/stdc++.h>using namespace std;const int inf=0x3f3f3f3f;struct node{    int v,z,d,next;//存可以连接的点,用next存邻接表}a[10010];struct road{    int u,cnt,dis;//dis储存当前需要的钱数,即最短路算法里的权,u储存顶点,cnt储存组合数即状态压缩dp    road(int uu,int cntt,int diss)    {      …

#include<bits/stdc++.h>using namespace std;int n,x;char s[10010];char a[31010];int val[100010];int ch[100010][30];int dp[100010];int main(){    while(~scanf("%d",&n))    {        scanf("%s",s+1);        int len=strlen(s+1);  …

#include <iostream> #include <stdio.h> #include <string.h> #include <algorithm> #include <math.h> using namespace std;   int can[1005] = {0}; int a[10005][605]= {0}; int x[6005], y[6005], t[6005]; int h1,h2; int bb, ee, xx, y…

省赛之于ACM 就是让省内的队伍互相比较而已~~~(何况弱省(本渣校  四个二等四个三等(其实是六个三道题 两个两道题,是院长后来和主办方沟通了下- - (本弱很水,但还是要吐槽:好水的省赛啊!!…

题目描述 Recently, Miss Huang want to receive a Tree as her birthday gift! (What a interesting person!)  As a interesting person, Miss Huang likes interesting tree. The interesting tree is a tree with the Max interesting degree. The interesting degree eq…

问题 C: Repeat Number 时间限制: 1 Sec  内存限制: 128 MB [cid=1073&pid=2&langmask=0">提交][状态][论坛] 题目描写叙述 Definition: a+b = c, if all the digits of c are same ( c is more than ten).then we call a and b are Repeat Number. My question is How many Repeat …

1006: Intermediary 时间限制: 1 Sec  内存限制: 128 MB提交: 261  解决: 25[提交][状态][讨论版] 题目描述 It is widely known that any two strangers can get to know each other through at most six other people. Now let’s prove this. In the country Intermediary Conducts Personal C…

[1217] Dinner 时间限制: 1000 ms 内存限制: 32768 K 问题描写叙述 Little A is one member of ACM team. He had just won the gold in World Final. To celebrate, he decided to invite all to have one meal. As bowl, knife and other tableware is not enough in the kitchen, Li…

问题描述 Little A gets to know a new friend, Little B, recently. One day, they realize that they are family 500 years ago. Now, Little A wants to know whether Little B is his elder, younger or brother. 输入 There are multiple test cases. For each test case…

1009: Happiness Hotel 时间限制: 1 Sec  内存限制: 128 MB提交: 173  解决: 19[提交][状态][讨论版] 题目描述 The life of Little A is good, and, he managed to get enough money to run a hotel. The best for him is that he need not go to work outside, just wait for the money to go…

1456: 逃票的chanming(3) 时间限制: 2 Sec  内存限制: 128 MB提交: 326  解决: 48[提交][状态][讨论版] 题目描述 这是一个神奇的国度.     这个国度一共有N个城市组成,让我们将他们编号为1~N,     这一天,chanming带着他的第一个月的工资K元来到了城市1.他想到城市N去寻找宝藏.经历了艰难险阻,上刀锅下油山,他终于来到了N市.在这里,他发现了n种宝藏.每一种宝藏有a[i]个.     Chanming是个有情有义的人,他怎么会忘记自己…

G - Go Deeper Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Description Here is a procedure's pseudocode:   go(int dep, int n, int m) begin output the value of dep. if dep < m and x[a[dep]] + x[b[dep]] != c[dep] then go(dep…

F - Error Curves Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Description Josephina is a clever girl and addicted to Machine Learning recently. She pays much attention to a method called Linear Discriminant Analysis, which h…

Problem J: Alex’s Foolish Function Time Limit: 8 Sec  Memory Limit: 128 MB Submit: 18  Solved: 2 Description Alex has an array F which size is n, initially each element’s value is zero. Now he wants to operate the array, he has 4 different functions:…

以前写过一篇文章介绍过Symantec Backup Exec 2012 Agent For Linux安装安装,今天介绍一下Symantec Backup Exec 2010 Agent For Linux安装,关于赛门铁克的Backup Exec的功能请看下面主要功能和主要优势介绍.有兴趣的可以参考官网介绍:http://www.symantec.com/zh/cn/backup-exec. 现在最新的版本是Symantec Backup Exec 2014. 主要功能 使用单个解决方案保护…

Fruit Ninja II Time Limit: 5000MS Memory limit: 65536K 题目描述 Have you ever played a popular game named "Fruit Ninja"? Fruit Ninja (known as Fruit Ninja HD on the iPad and Fruit Ninja THD for Nvidia Tegra 2 based Android devices) is a video game d…

这题是某年成都区域赛网络赛的一题. 这题思路非常easy,可是从时间上考虑,不妨不要用矩阵存储,我用的链式前向星. 採用线上查询.利用map对字符串编号,由于非常方便.要推荐的朋友,事实上就是朋友的朋友(这里指的是直接朋友,图中即指有直接边相连的). 所以在寻找时,仅仅须要查找朋友的朋友,并计数. 注意:在输出时不能有对于的空格. 附代码: #include<iostream> using namespace std; #include<cstdio> #include<cs…

G.Code the Tree Time Limit: 2 Sec  Memory Limit: 128 MB Submit: 35  Solved: 18 [Submit][Status][Web Board] Description A tree (i.e. a connected graph without cycles) with vertices numbered by the integers 1, 2, ..., n is given. The "Prufer" code…

[题目链接] http://www.lydsy.com/JudgeOnline/problem.php?id=1221 [题目大意] 每天对毛巾都有一定的需求ni,每天可以花f价值每条购买毛巾, 当天用完的毛巾可以花费fA价值每条通过快消毒在A天之后得到一条可用的, 也可以通过花费fB价值每条,通过慢消毒在B天之后获得可用的 问满足每天需求所用的最小花费. [题解] 首先,我们建立X集合,表示每天用完之后需要消毒的毛巾,显然第i个点值为ni, 建立Y集合表示每天需要的毛巾数量,第i个点为ni,…