Tag - Online Judge

68 tags

A tag is a keyword or label that categorizes problem or topic with other, similar problem or topic. Using the right tags makes it easier for others to find and reply your problem or topic.

Tag

dfs

Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.

22 problems , 0 topics, Create at 12 years ago

implementation

按照业务流程模拟实现

19 problems , 0 topics, Create at 12 years ago

动态规划（英语：Dynamic programming，简称 DP）是一种在数学、管理科学、计算机科学、经济学和生物信息学中使用的，通过把原问题分解为相对简单的子问题的方式求解复杂问题的方法。动态规划常常适用于有重叠子问题和最优子结构性质的问题，并且记录所有子问题的结果，因此动态规划方法所耗时间往往远少于朴素解法。动态规划有自底向上和自顶向下两种解决问题的方式。自顶向下即记忆化递归，自底向上就是递推。使用动态规划解决的问题有个明显的特点，一旦一个子问题的求解得到结果，以后的计算过程就不会修改它，这样的特点叫做无后效性，求解问题的过程形成了一张有向无环图。动态规划只解决每个子问题一次，具有天然剪枝的功能，从而减少计算量。

15 problems , 0 topics, Create at 12 years ago

蓝桥

蓝桥杯全国软件和信息技术专业人才大赛是由中华人民共和国工业和信息化部人才交流中心主办，国信蓝桥教育科技（北京）股份有限公司承办的计算机类学科竞赛

14 problems , 0 topics, Create at 6 months ago

string

字符串是由零个或多个字符组成的有限序列。

11 problems , 0 topics, Create at 12 years ago

math

数学是利用符号语言研究数量、结构、变化以及空间等概念的一门学科，从某种角度看属于形式科学的一种。数学透过抽象化和逻辑推理的使用，由计数、计算、量度和对物体形状及运动的观察而产生。数学家们拓展这些概念，为了公式化新的猜想以及从选定的公理及定义中建立起严谨推导出的定理。

11 problems , 0 topics, Create at 12 years ago

big number

10 problems , 0 topics, Create at 12 years ago

number theory

9 problems , 0 topics, Create at 12 years ago

combinatorics

9 problems , 0 topics, Create at 12 years ago

happyoj

HappyOJ是由Jungle开发的跨平台在线判题系统，支持在线IDE，在线竞赛，在线论坛。

0 problems , 5 topics, Create at 1 years ago

brute force

4 problems , 0 topics, Create at 12 years ago

springboot

Spring Boot is a framework that allows to easily create Spring-powered, production-grade applications and services with the absolute minimum fuss. It takes an opinionated view of the Spring platform designed to work for new and experienced users of Spring.

0 problems , 4 topics, Create at 1 years ago

bfs

In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal.

3 problems , 0 topics, Create at 12 years ago

greedy

3 problems , 0 topics, Create at 12 years ago

如梦令

如梦令，词牌名。又名“忆仙姿”“宴桃源”“无梦令”等。以李存勗《忆仙姿·曾宴桃源深洞》为正体，单调三十三字，七句五仄一叠韵。另有三十三字六仄韵，三十三字四仄韵一叠韵，三十三字五平韵一叠韵，以及六十六字五仄韵一叠韵的变体。代表作有李清照《如梦令·常记溪亭日暮》、厉声教《西溪小令二首》等。

0 problems , 3 topics, Create at 1 years ago

javascript

0 problems , 3 topics, Create at 1 years ago

xor

2 problems , 0 topics, Create at 12 years ago

data structures

2 problems , 0 topics, Create at 12 years ago

sortings

2 problems , 0 topics, Create at 12 years ago

probabilities

2 problems , 0 topics, Create at 12 years ago

divide and conquer

2 problems , 0 topics, Create at 12 years ago

graph

2 problems , 0 topics, Create at 12 years ago

linux

0 problems , 2 topics, Create at 1 years ago

Copilot

0 problems , 2 topics, Create at 11 months ago

MACSec

0 problems , 2 topics, Create at 4 months ago

suse