关闭

RMRC2016问题 B: Election(概率计算)

问题 B: Election 时间限制: 1 Sec 内存限制: 128 MB 提交: 83 解决: 12 [提交][状态][讨论版] 题目描述 After all the fundraising, campaigning and debating, the election day has finally arrived. Only two candidates remain on the ballot and you work as an aide to one of them. Reports ...
阅读(519) 评论(0)

Codeforces 785D - Anton and School - 2(范德蒙恒等式+逆元)

D. Anton and School - 2 time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output As you probably know, Anton goes to school. One of the school subjects that Anton studies is Bracketology. On the Bracketo...
阅读(367) 评论(0)

poj3281 Dining 网络流匹配问题(拆点建图+Edmond-Karp算法)

Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19183 Accepted: 8556 Description Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others. Farmer John has cooked fabulous mea...
阅读(618) 评论(0)

poj2947 Widget Factory (高斯消元解模线性方程组)

Widget Factory Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 6261 Accepted: 2207 Description The widget factory produces several different kinds of widgets. Each widget is carefully built by a skilled widgeteer. The time required to build a...
阅读(294) 评论(0)

275. To xor or not to xor(高斯消元求最大亦或值)

275. To xor or not to xor time limit per test: 0.25 sec. memory limit per test: 65536 KB input: standard output: standard The sequence of non-negative integers A1, A2, ..., AN is given. You are to find some subsequence Ai1, Ai2, ..., Aik (1 <= i1 < i2 ...
阅读(270) 评论(0)
16条 共4页1 2 3 4 下一页 尾页
    个人资料
    • 访问:41939次
    • 积分:1791
    • 等级:
    • 排名:千里之外
    • 原创:125篇
    • 转载:9篇
    • 译文:0篇
    • 评论:28条
    博客专栏
    最新评论