Just do it

题目链接http://codeforces.com/gym/100299/attachments/download/2035/20132014-acm-icpc-central-european-regional-contest-cerc-13-en.pdf字符串处理，之前都是用的很麻烦的方式处理这次用的strtok，处理那些用逗号或者空格分开的多个字符串十分方便，要注意用法#incl

概率DP，长春现场赛的题，当时没看，现在补上...f[i][j]代表答对前i道题得j分的概率转移方程f[i][j]+=f[i-1][j]/2;f[i][j+a[i]]+=f[i-1][j]/2; a[i]是第i道题的分数#include #include#includeusing namespace std;int T,a[40010],n;double p,f[50][40

大意就是给定一个有向图,求有多少个顶点是由任何顶点出发都可达的。顶点数定理 有向无环图中唯一出度为0的点,一定可以由任何点出发均可达由于无环,所以从任何点出发往前走,必然终止于一个出度为0的点tarjan缩点后找是否有唯一出度为0的点存在#include #include#include#include#includeusing namespace std;ve

大意模拟数=树的遍历过程

一个由b w组成的字符串 两种操作 一是查询给定区间内

Sum of divisorsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2960    Accepted Submission(s): 1044Problem Descriptionmmm is learnin

HuntersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 989    Accepted Submission(s): 756Problem DescriptionAlice and Bob are the to

str2intTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1208    Accepted Submission(s): 411Problem DescriptionIn this problem, you