# Digi Comp II UVALive - 6953 (bfs/拓扑)

Uva https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4965 vjudge https://vjudge.net/problem/UVALive-6953 雾草 一波瞎优化从2000ms跑到800ms........

# Instant Complexity poj1472 (递归模拟)

Instant Complexity Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 2157   Accepted: 747 Description Analyzing the run-time complexity of algorithms is an imp...

# Sudoku poj2676 （dfs）

Sudoku Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 19520   Accepted: 9359   Special Judge Description Sudoku is a very simple task. A square table wi...

# Channel Allocation poj1129 （深搜/四色/枚举）

Channel Allocation Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 15064   Accepted: 7655 Description When a radio station is broadcasting over a very larg...

# Area poj1265 （pick公式+网格）

Area Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 6457   Accepted: 2823 Description Being well known for its highly innovative products, Merck would def...

# Number Sequence poj1019（数学方法）

Number Sequence Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 39182   Accepted: 11366 Description A single positive integer i is given. Write a program t...

# The Moronic Cowmpouter poj3191（负进制转换以及其他进制转换模板）

The Moronic Cowmpouter Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4078   Accepted: 2111 Description Inexperienced in the digital arts, the cows tried ...

# Codeforces 762 A.k-th divisor (简单有关因子的问题)

A. k-th divisor You are given two integers n and k. Find k-th smallest divisor of n, or report that it doesn’t exist. Divisor of n is any such natural number, that n can be divided by it without...

# Semi-prime H-numbers poj3292 (类比欧拉筛)

Semi-prime H-numbers Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9171   Accepted: 4055 Description This problem is based on an exercise of David Hilber...

# poj1506 Tiling 递推 简单大数

#include #include #include using namespace std; int s[1010][110]; void reset() { s[0][0]=1; ///s[X][0] 表示这个数一共多少位 注意逆序打印 s[0][1]=1; s[1][0]=1; s[1][1]=1; int j,k,i,n,sum,num;...

# Find The Multiple poj1426 (DFS)

Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 28038   Accepted: 11640   Special Judge Description Given a positive integer n, write a p...

# Message Flood sdutoj 1500 (STL map 的使用)

Message Flood Time Limit: 1500MS Memory Limit: 65536KB Problem Description Well, how do you feel about mobile phone? Your answer would probably be something like that "It's so convenient and b...

# 暑假集训 8.16 数据结构实验之排序三：bucket sort (简单的桶排序)

21条 共2页1 2 下一页 尾页
个人资料
• 访问：35351次
• 积分：1550
• 等级：
• 排名：千里之外
• 原创：115篇
• 转载：2篇
• 译文：0篇
• 评论：7条
博客专栏
 数据结构 in SDUT 文章：0篇 阅读：0
 机器学习实战 文章：13篇 阅读：4471
阅读排行