mb63dd04d4d8713的博客_USCAO_51CTO博客

开源基础软件社区

WOT全球技术创新大会

公众号矩阵

移动端

短视频免费课程课程排行直播课软考学堂

精品班厂商认证 IT技术 2023年软考 PMP项目管理

在线学习企业服务

CTO训练营技术经理研习营 LeaTech峰会

文章资源问答开源课堂专栏直播

51CTO

开源基础软件社区

51CTO技术栈

51CTO官微

51CTO学堂

51CTO博客

CTO训练营

开源基础软件社区订阅号

51CTO学堂APP

51CTO学堂企业版APP

开源基础软件社区视频号

51CTO博客

搜索历史清空

热门搜索

查看【】的结果
写文章
创作中心
登录注册

# USCAO

USACO section 3.3 A Game(DP)

A GameIOI'96 - Day 1 Consider the following two-player game played with a sequence of N positive integers (2

Test

#include

i++

原创 3月前 59 阅读

USACO section 2.4 Fractions to Decimals(小数处理)

Fractions to DecimalsWrite a program that will accept a fraction of the form N/D, where N is the nume

output

360

integer

numbers

file

原创 3月前 10 阅读

USACO section 3.1 Humble Numbers（DP）

Humble NumbersFor a given set of K prime numbers S = {p1, p2, ..., pK}, consider the set of all numbers whose prim

numbers

output

file

input

each

原创 3月前 6 阅读

USACO section 3.1 Stamps(dp)

StampsGiven a set of N stamp values (e.g., {1 cent, 3 cents}) and an upper limit K to the number of stamps that ca

string

output

each

integer

file

原创 3月前 13 阅读

USACO section 3.1 Contact(AC自动机)

ContactIOI'98 The cows have developed a new interest in scanning the universe outside their farm with radiotel

ci

#include

i++

原创 3月前 158 阅读

USACO section 3.2 Stringsobits(组合数学)

StringsobitsKim Schrijvers Consider an ordered set S of strings of N (1 <= N <= 31) bits. Bits, of course, are either 0 contai

Test

#include

ci

原创 3月前 24 阅读

USACO section 3.2 Spinning Wheels(模拟)

Spinning Wheels1998 ACM NE Regionals Each of five opaque spinning wheels has one or more wedges cut out of its ed

ci

Test

#include

原创 3月前 41 阅读

USACO section 3.2 Sweet Butter（SPFA）

Sweet ButterGreg Galperin -- 2001Farmer John has discovered the secret to making the sweetest butter in all of Wisconsin: su

ci

#include

i++

原创 3月前 50 阅读

USACO section 3.2 Magic Squares(STL+广搜)

Magic SquaresIOI'96 Following the success of the magic cube, Mr. Rubik invented its planar version, called mag

Test

#include

sed

原创 3月前 15 阅读

USACO section 3.3 Shopping Offers(DP或最短路)

Shopping OffersIOI'95 In a certain shop, each kind of product has an integer price. For example, the price of a flower is 2 zork

ci

#include

sed

原创 3月前 35 阅读

USACO section Camelot(枚举+队列优化)

CamelotIOI 98 Centuries ago, King Arthur and the Knights of the Round Table used to meet every year on New Year's Day to

#include

i++

ide

原创 3月前 27 阅读

USACO section3.3 Home on the Range(压缩+枚举)

Home on the RangeFarmer John grazes his cows on a large, square field N (2 <= N <= 250) miles on a side (because

i++

Test

#include

原创 3月前 40 阅读

USCAO section 1.1 Transformations

Transformations

transformation

structure

c

file

reference

原创 3月前 48 阅读

USCAO section 1.2 Name That Number

Name That Number th

dictionary

numbers

file

newline

character

原创 3月前 46 阅读

USCAO section1.2 Palindromic Squares

Palindromic Squares

integer

struct

output

numbers

file

原创 3月前 16 阅读

USCAO section 1.3 Mixing Milk

each

input

file

output

integer

原创 3月前 60 阅读

USCAO section1.3 Prime Cryptarithm(感觉思路挺好)

Prime Cryptarithm

constraints

input

output

numbers

file

原创 3月前 20 阅读

USACO section 2.1 Sorting a Three-Valued Sequence

Sorting a Three-Valued Sequence IOI'96 - Day 2 Sorting is one of the most frequently performed compu

i++

#include

Test

原创 3月前 37 阅读

USACO section 3.4 American Heritage（二叉树序列）

American HeritageFarmer John takes the heritage of his cows very seriously. He is not, however, a truly fine bookkeeper. He keeps his cow genealogies as binary trees and, instead of writing them

#include

Test

子树

原创 3月前 18 阅读

USACO section 2.2 Subset Sums(DP,背包)

Subset SumsJRM For many sets of consecutive integers from 1 through N (1 For example, if N=3, one can partition the set {1, 2, 3} in one way so that the sums of both subsets are identical: {3} and {

output

integer

file

input

c++

原创 3月前 8 阅读

USACO section 2.1 Hamming Codes(直接枚举暴搜)

Hamming CodesRob Kolstad Given N, B, and D: Find a set of N codewords (1 <= N <= 64), each of length B bits (1 <= B <= 8), such that each of the codewords is at least Hamming distance of D (1 <= D

distance

numbers

output

each

pair

原创 3月前 19 阅读

USACO section 2.2 Runaround Numbers

Runaround NumbersRunaround numbers are integers with unique digits, none of which is zero (e.g., 81362) that also have an interesting property, exemplified by this demonstration:If you start

numbers

permutation

iterator

integer

output

原创 3月前 38 阅读

USACO section 2.1 The Castle(dfs)

The CastleIOI'94 - Day 1 In a stroke of luck almost beyond imagination, Farmer John was sent a ticket to the Irish Sweepstakes (really a lottery) for his birthday. This ticket turned out to have o

module

numbers

output

each

file

原创 3月前 35 阅读

USACO section 1.5 Checker Challenge(dfs深搜)

Checker ChallengeExamine the 6x6 checkerboard below and note that the six checkers are arranged on the board so that one and only one is place

search

recursion

output

each

cheating

原创 3月前 24 阅读

USCAO section Mother's Milk（搜索）

Mother's MilkFarmer John has three milking buckets of capacity A, B, and C liters. Each of the numbers A, B, and C is an integer from 1 through 20, inclusive. Initially, buckets A and B are empty

search

file

c

output

input

原创 3月前 40 阅读

USACO section 2.4 Bessie Come Home(最短路)

Bessie Come HomeKolstad & Burch It's dinner time, and the cows are out in their separate pastures. Farmer John rings the bell so they will start walking to the barn. Your job is to figure out whic

distance

algorithm

path

integer

matrix

原创 4月前 53 阅读

USACO section 1.5 Superprime Rib（深搜）

Superprime RibButchering Farmer John's cows always yields the best prime rib. You can tell prime ribs by looking at the digits lovingly stamped across them, one by one, by FJ and the USDA. Farmer John

numbers

output

null

file

search

原创 4月前 14 阅读

USACO section 2.1 Healthy Holsteins（枚举，二进制存储）

Healthy HolsteinsBurch & Kolstad Farmer John prides himself on having th

存储

combinations

each

integer

output

原创 5月前 85 阅读

USACO section 2.3 Longest Prefix（dp）

Longest PrefixIOI'96 The structure of some biological objects is represente

primitive

dictionary

each

integer

concatenation

原创 5月前 59 阅读

USACO section 3.4 Closed Fences(计算几何+叉积+二分)

N corners (3 i, yi}, i in (1..N).Every pair of adjacent vertices defines a side of the fence.

ide

Test

#include

原创 5月前 39 阅读

首页
1
2
共32条记录