原创 TOJ1801 Crashing Robots(模擬題)

In a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots re

原创 [TOJ1133]Eeny Meeny Moo 約瑟夫問題

Surely you have made the experience that when too many people use the Internet simultaneously, the net becomes very, ve

原创 TOJ2838 The Eating Puzzle (01揹包)

Bessie is on a diet where she can eat no more than C (10 ≤ C ≤ 35,000) calories per day. Farmer John is teasing her by

原创 TOJ1003 Transportation(DFS)

Ruratania is just entering capitalism and is establishing new enterprising activities in many fields including transpor

原创 TOJ1065Factorial

The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas

原创 TOJ3976 Change 完全揹包 || 找規律

After Shawn sees the following picture, he decides to give up his career i

原创 TOJ2470 Robot in Maze(寬搜)

There is a robot trapped in the maze. Now you have to send out some instructions, telling it how to reach its destina

原创 TOJ3455 Diamonds

John and Kate found 10 diamonds, each of which has an integer value. They want to divide these diamonds into two parts,

原创 TOJ4132 Hanoi tower 漢諾塔(遞歸入門)

簡單的遞歸入門 move(n,from,buffer,to)表示把n個圓盤從from以buffer爲中間柱移到to #include <cstdio> #include <iostream> using namespace std; v

原创 TOJ3772 Rupxup's Math Problem

Description Rupxup has learned a new function called function "F(n)", where F(n) equals to the number of factors of n 

原创 TOJ1036

1036.   Rails Time Limit: 1.0 Seconds   Memory Limit: 65536KTotal Runs: 9718   Accepted Runs: 3028    Multiple test fi

原创 TOJ3293 A Sequence of Numbers(快速冪取餘)

Xinlv wrote some sequences on the paper a long time ago, they might be arithmetic or geometric sequences. The numbers a

原创 poj2299 歸併排序求逆序對

In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct i

原创 POJ 3784 Running Median 動態求中位數 堆

轉自點擊打開鏈接For this problem, you will write a program that reads in a sequence of 32-bit signed integers. After each odd-i

原创 第13屆景馳-埃森哲杯廣東工業大學ACM程序設計大賽

A.跳臺階鏈接:https://www.nowcoder.com/acm/contest/90/A來源:牛客網有一個n級臺階的樓梯,小明一次可以向上跳1步,兩步,甚至是n步,請問小明跳到n級臺階有多少種跳法? 輸入描述:第一行輸入一個整數