关闭

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)

codeforces Masha and geometric depression(set模拟,等比数列)

B. Masha and geometric depression time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Masha really loves algebra. On the last lesson, her strict teacher Dvastan gave she new exercise. You are given geom...
阅读(272) 评论(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)

拓扑排序例题 hdu1285 hdu3342

HDU1285 确定比赛名次 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 28138 Accepted Submission(s): 11215 Problem Description 有N个比赛队(1<=N<=500),编号依次为1,2,3,。。。。,N进行比赛,比赛结束后,裁判委员会要将所有参赛队伍从前往后依次排名,但现在裁判委员...
阅读(527) 评论(0)

ACM高斯消元法 亦或方程组求秩 (HDU5833 Zhu and 772002)

#include #include #include #include #define set(a,i) memset(a,i,sizeof(a)) using namespace std; typedef long long ll; const int mod=1e9+7; ll qpow(ll n,ll m){n%=mod;ll ans=1;while(m){if(m%2)...
阅读(469) 评论(0)
146条 共30页首页 上一页 ... 6 7 8 9 10 ... 下一页 尾页
    个人资料
    • 访问:41939次
    • 积分:1791
    • 等级:
    • 排名:千里之外
    • 原创:125篇
    • 转载:9篇
    • 译文:0篇
    • 评论:28条
    博客专栏
    最新评论