cmonkey

Paths on a GridTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16218 Accepted: 3885DescriptionImagine you are attending your math lesson at school. Once again, you are bored be

Check the difficulty of problemsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2674 Accepted: 1163DescriptionOrganizing a programming contest is not an easy job. To avoid making

Snowflake Snow SnowflakesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 20205 Accepted: 5269DescriptionYou may have heard that no two snowflakes are alike. Your task is to wri

Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 24310 Accepted: 8696DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm p

Rhyme SchemesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1175 Accepted: 645 Special JudgeDescriptionThe rhyme scheme for a poem (or stanza o

Problem DescriptionOregon Maple was waiting for Bob When Bob go back home. Oregon Maple asks Bob a problem that as a Positive number N, if there are only four Positive number M makes Gcd(N, M) == M

概率题 面试 笔试本文总结了面试或笔试中可能考到的概率题。第1题 一个桶里面有白球、黑球各100个，现在按下述规则取球： - i 、每次从通里面拿出来两个球； - ii、如果取出的是两个同色的求，就再放入一个黑球； - iii、如果取出的是两个异色的求，就再放入一个白球。 问：最后桶里面只剩下一个黑球的概率是多少？答： 动态规划，令f[i,j]表示有i个白球，j个