乐胖代购免代理版

HDU 1022 Train Problem I (栈)

Train Problem Ihttp://acm.hdu.edu.cn/showproblem.php?pid=1022Time Lim

acm

栈

Java

ide

#include

原创 2023-04-11 16:41:48 131 阅读

POJ 3233 Matrix Power Series (矩阵&快速等比数列求和取模)

Matrix Power Serieshttp://poj.org/problem?id=3233Time Limit: 3000MSMemory Limit: 13+

数论

POJ

acm

矩阵

i++

原创 2023-04-11 16:41:43 71 阅读

Codeforces Round #147 (Div. 2) / 237B Young Table (搜索)

B. Young Tablehttp://codeforces.com/problemset/problem/237%2FBtime limi

codeforces

acm

ci

#include

i++

原创 2023-04-11 16:41:36 99 阅读

Codeforces Round #121 (Div. 1) / 191A Dynasty Puzzles (dp&优化)

A. Dynasty Puzzleshttp://codeforces.com/problemset/problem/191/Atime limit

codeforces

c++

dp

bc

ide

原创 2023-04-11 16:41:31 83 阅读

C语言中内存堆和栈的区别

在计算机领域，堆栈是一个不容忽视的概念，我们编写的C语言程序基

c语言

内存分配

内存

堆

栈

转载 2023-04-11 16:41:25 62 阅读

HDU 1061 Rightmost Digit (数学&三种解法)

Rightmost Digithttp://acm.hdu.edu.cn/showproblem.php?pid=1061Time Limit: DescriptionGiven

acm

HDU

git

#include

Java

原创 2023-04-11 16:41:19 89 阅读

Codeforces Bayan 2012-2013 Elimination Round / 241A Old Peykan (贪心)

A. Old Peykanhttp://codeforces.com/contest/241/problem/Atime limit pe

codeforces

acm

c++

ci

#include

原创 2023-04-11 16:41:15 66 阅读

UVa 11054/HDU 1489/POJ 2940 Wine trading in Gergovia(贪心&双向队列)

11054 - Wine trading in GergoviaTime limit: 3.000 secondshttp://uva.onl

acm

贪心

#include

ci

双向队列

原创 2023-04-11 16:40:57 77 阅读

UVa 10943 How do you add? (组合数学)

10943 - How do you add?Time limit: 3.000 secondshttp://uva.onlinejudge.org

acm

i++

ide

#include

原创 2023-04-11 16:40:53 104 阅读

POJ 1258 Agri-Net(MST)

Agri-Nethttp://poj.org/problem?id=1258Time Limit: 1000MSMemory Limit: 10000KDescriptionFawas to bring

Prim

图论

acm

#include

i++

原创 2023-04-11 16:40:38 73 阅读

UVa 10282 / POJ 2503 Babelfish / ZOJ 1109 Language of FatMouse (STL&map)

10282 - BabelfishTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1223http://acm.zju.edu.cn/online

acm

数据结构

结题报告

查找树

#include

原创 2023-04-11 16:38:00 84 阅读

POJ 3067 Japan（树状数组求逆序对）

Japanhttp://poj.org/problem?id=3067Time Limit: 1000MSMemory Limit: 65536KDescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must b

acm

数据结构

树状数组

解题报告

ci

原创 2023-04-11 16:37:56 68 阅读

Beijing 2004 / UVa 1203 / UVALive 3135 / ZOJ 2212 Argus (优先队列)

ArgusTime Limit: 2 Seconds Memory Limit: 65536 KBA data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Internet traffic, financial ticker

UVa

zoj

acm

c++

Time

原创 2023-04-11 16:37:47 58 阅读

POJ 2524 Ubiquitous Religions (并查集)

Ubiquitous ReligionsTime Limit: 5000MSMemory Limit: 65536KDescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interest

acm

数据结构

并查集

解题报告

ci

原创 2023-04-11 16:37:39 51 阅读

Codeforces Beta Round #91 (Div. 2) / 122A Lucky Division (数论)

A. Lucky Divisionhttp://codeforces.com/problemset/problem/122/Atime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outpu

codeforces

acm

ide

#include

git

原创 2023-04-11 15:59:03 147 阅读

Codeforces Beta Round #92 (Div. 2) / 124A The number of positions (简单数学)

A. The number of positionshttp://codeforces.com/problemset/problem/124/Atime limit per test0.5 secondmemory limit per test256 megabytesinputstandard inputoutputstan

codeforces

acm

#include

原创 2023-04-11 15:58:53 63 阅读

快速幂取模讲解&模板

对于给定的a，b，如何在O(log b)时间内求出a^b mod M？首先我们来看看3^14 mod M，我们可以将其转化为3^2 * 3^4 * 3^8 mod M，然后写一个while循环，先计算3^2 mod M ，随后用该值计算3^4 mod M，……那么，3^2 * 3^4 * 3^8是怎么得到的呢？我们可以用二进制作一个中间转换：1. 将14化为2进制，得111

acm

快速幂

模板

进制

while循环

原创 2023-04-11 15:58:39 91 阅读

HDU 4602 Partition (整数拆分&找规律&快速幂取模)

Partitionhttp://acm.hdu.edu.cn/showproblem.php?pid=4602Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionDefine f(

HDU

acm

Java

Memory

快速幂取模

原创 2023-04-11 15:58:30 100 阅读

Codeforces Beta Round #70 (Div. 2) / 78A Haiku (字符串处理)

A. Haikuhttp://codeforces.com/problemset/problem/78/Atime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputH

codeforces

acm

#include

#define

ci

原创 2023-04-11 15:58:22 151 阅读

acm

bfs

#include

初始化

连通分量

原创 2023-04-11 15:58:14 76 阅读

【优化&“调整”思想】VK Cup 2012 Qualification Round 1 / 158B Taxi(贪心)

B. Taxihttp://codeforces.com/problemset/problem/158/Btime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA

codeforces

acm

贪心

#include

ide

原创 2023-04-11 15:58:06 90 阅读

Codeforces Beta Round #89 (Div. 2) / 118A String Task(字符串操作)

A. String Taskhttp://codeforces.com/problemset/problem/118/Atime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

acm

codeforces

#include

sed

原创 2023-04-11 15:57:55 62 阅读

Codeforces Beta Round #65 (Div. 2) / 71A Way Too Long Words(字符串操作)

A. Way Too Long Wordshttp://codeforces.com/problemset/problem/71/Atime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard ou

codeforces

acm

#include

ios

ci

原创 2023-04-11 15:57:40 76 阅读

Codeforces Round #136 (Div. 2) / 221B Little Elephant and Numbers (数论)

a

codeforces

acm

#include

数组

git

原创 2023-04-11 15:57:27 69 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

HDU 1022 Train Problem I (栈)

POJ 3233 Matrix Power Series (矩阵&快速等比数列求和取模)

Codeforces Round #147 (Div. 2) / 237B Young Table (搜索)

Codeforces Round #121 (Div. 1) / 191A Dynasty Puzzles (dp&优化)

C语言中内存堆和栈的区别

HDU 1061 Rightmost Digit (数学&三种解法)

Codeforces Bayan 2012-2013 Elimination Round / 241A Old Peykan (贪心)

UVa 11054/HDU 1489/POJ 2940 Wine trading in Gergovia(贪心&双向队列)

UVa 10943 How do you add? (组合数学)

POJ 1258 Agri-Net(MST)

UVa 10282 / POJ 2503 Babelfish / ZOJ 1109 Language of FatMouse (STL&map)

POJ 3067 Japan（树状数组求逆序对）

Beijing 2004 / UVa 1203 / UVALive 3135 / ZOJ 2212 Argus (优先队列)

POJ 2524 Ubiquitous Religions (并查集)

Codeforces Beta Round #91 (Div. 2) / 122A Lucky Division (数论)

Codeforces Beta Round #92 (Div. 2) / 124A The number of positions (简单数学)

快速幂取模讲解&模板

HDU 4602 Partition (整数拆分&找规律&快速幂取模)

Codeforces Beta Round #70 (Div. 2) / 78A Haiku (字符串处理)

BFS相关的一些模板

【优化&“调整”思想】VK Cup 2012 Qualification Round 1 / 158B Taxi(贪心)

Codeforces Beta Round #89 (Div. 2) / 118A String Task(字符串操作)

Codeforces Beta Round #65 (Div. 2) / 71A Way Too Long Words(字符串操作)

Codeforces Round #136 (Div. 2) / 221B Little Elephant and Numbers (数论)

欢迎