# E. Stack Sorting Codeforces（全排列与栈辅助排序）

Educational Codeforces Round 35 (Rated for Div. 2) 题目链接：http://codeforces.com/contest/911/problem/E E. Stack Sorting time limit per test 2 seconds memory limit per test 256 megabytes...

# 欧拉函数 codeforces 776E - The Holmes Children

The Holmes children are fighting over who amongst them is the cleverest. Mycroft asked Sherlock and Eurus to find value of f(n), where f(1) = 1 and for n ≥ 2, f(n) is the number of distinct ordered positive integer pairs (x, y) that satisfy x + y = n and...

# UVa10375（唯一分解定理）

The binomial coefficient C(m, n) is defined as C(m, n) = m! (m − n)! n! Given four natural numbers p, q, r, and s, compute the the result of dividing C(p, q) by C(r, s). Input Input consists of a sequence of lines. Each line contains four non-negative inte...

# UVa12169（拓展欧几里得）

Once upon a time, there was an NWERC judge with a tendency to create slightly too hard problems. As a result, his problems were never solved. As you can image, this made our judge somewhat frustrated. This year, this frustration has culminated, and he has ...

# HDU 6129 just do it（组合数奇偶性）

Just do it Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1411 Accepted Submission(s): 823 Problem Description There is a nonnegative integer sequence a1...n of length n. HazelFan wants to ...

# HDU 4474 同余模定理+BFS

Yet Another Multiple Problem Time Limit: 40000/20000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 6255 Accepted Submission(s): 1451 Problem Description There are tons of problems about integer multiples. Despite...

# 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...

# 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...

# 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...

# 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 ...

# 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)...

# poj2891 Strange Way to Express Integers (中国剩余定理+拓展欧几里得）

Strange Way to Express Integers Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 15855 Accepted: 5242 Description Elina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is describ...

22条 共2页1 2 下一页 尾页
个人资料
• 访问：103698次
• 积分：3019
• 等级：
• 排名：第13770名
• 原创：197篇
• 转载：9篇
• 译文：0篇
• 评论：33条
博客专栏
 ACM算法 文章：17篇 阅读：7004
 ACM荣耀之路 文章：97篇 阅读：46059
阅读排行
最新评论