其他

Problem DescriptionDo you own an ID card?You must have a identity card number in your family's Household Register. From the ID card you can get specific personal information of everyone. The number has 18 bits,the first 17 bits contain special

DescriptionThe little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the fame. In order to escape from such

   題目大意：一顆有n個結點的樹，根只有一個，下面的處在一層的子節點相同。   題目地址：Count/* 打積分賽的時候，這個題目是我一直在看。 其實那個什麼i-1什麼約數的當時都寫了，只不過沒有想到用dp， 而如果i-1為質數的話，只能加1+前面的一項。然後在判斷它能怎麼拆分，真心想麻煩了。 真的是dp的水題啊！！！*/#include<iostream>#include<cstdio>using namespace

Problem

A. Down the Hatch!time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEverybody knows that the Berland citizens are keen on health, especially students. Berland students are so tough that all they

Problem Description人隨著歲數的增長是越大越聰明還是越大越笨，這是一個值得全世界科學家思考的問題,同樣的問題Eddy也一直在思考，因為他在很小的時候就知道親和串如何判斷了，但是發現，現在長大了卻不知道怎麼去判斷親和串了，於是他只好又再一次來請教聰明且樂於助人的你來解決這個問題。親和串的定義是這樣的：給定兩個字串s1和s2,如果能通過s1迴圈移位，使s2包含在s1中，那麼我們就說s2

剪花布條Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6221    Accepted Submission(s): 4131Problem Description一塊花布條，裡面有些圖案，另有一塊直接可用的小飾條，裡面也有一些圖案。對於給定的花布條和小飾條，計算一下能從花布條中儘可能剪出幾塊小飾條來呢？ Input輸入中含有一些資料，

Problem Description有三個正整數a,b,c(0<a,b,c<10^6)，其中c不等於b。若a和c的最大公約數為b，現已知a和b，求滿足條件的最小的c。  Input第一行輸入一個n，表示有n組測試資料，接下來的n行，每行輸入兩個正整數a,b。  Output輸出對應的c，每組測試資料佔一行。  Sample Input2 6 2 12 4  Sample Output4 8  #includeusing namespace std;int main(){

Problem Description北宋末年，奸臣當道，宦官掌權，外侮日亟，遼軍再犯。時下戰火連連，烽煙四起，哀鴻遍野，民不聊生，又有眾多能人異士群起而反，天下志士雲集響應,景糧影從。值此危急存亡之秋，在一個與世隔絕的地方---MCA山上一位江湖人稱<英雄哪裡出來>的人正在為抗擊遼賊研究劍法，終于于一雷電交加之夜精確計算出了蕩劍回鋒的劍氣傷害公式。定義 f(x, y, m, n) = sqrt(x*x + y*y + m*m + n*n - 2*m*x - 2*n*y);hint

題意：生日蛋糕有m層，總體積是V。從下向上，每一層的半徑r和高度h都是遞減的。給m、v，求最小的表面積s。（不算底面接地的面積）題目連結：poj1190剪枝都還沒加。。範例輸出都是錯的。。。還沒找到問題。。。#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <cmath>#include

Problem DescriptionFind and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals the sum of its digits when represented in hexadecimal (base 16) notation and also equals the sum of its digits

Problem DescriptionA checksum is an algorithm that scans a packet of data and returns a single number. The idea is that if the packet is changed, the checksum will also change, so checksums are often used for detecting transmission errors,

枚舉所有兩點，在此之上加上第三點，判斷這三點是否共線嘎嘎soeasy！#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <cmath>#include <algorithm>#include <vector>#include <map>#define inf 0x3f3f3f3fusing

Problem Description  This is an easy problem, just for you to warm up.  Give you three edges of a triangle. Can you tell me which kind of triangle it stands for?If it’s a right triangle(直角三角形), please output “good”. If it’s a isosceles

Problem DescriptionEvery body knew that 15 = 1+2+3+4+5 = 4+5+6 = 7+8. Now give you a number N, tell me how many ways to represent N as a sum of consecutive positive integers. For example, 15 have 3 ways to be found. InputEach line will contain an

話說這次整場比賽下來狀態都不錯 也算不上進步  因為如果早點過掉C那道水題的話 大概後面又沒什麼激情了還是有問題1、比賽時候選題下手的順序很重要 這次還好  一定要跟榜 只要把基本題最快速度完成就不會太差。。2、消化題目的時間效率不夠高  比賽之外做的題還是太少3、比賽裡面難的dp都看不出來 狀態方程搞不出來 是時候總結下dp的規律了。。話說這次好不容易趕了一名回來 剩下的時間不多啦  要逆襲逆襲啊加油隊友們！

Problem

Problem Description開學了，杭電又迎來了好多新生。ACMer想為新生準備一個節目。來報名要表演節目的人很多，多達N個，但是只需要從這N個人中選M個就夠了，一共有多少種選擇方法？ Input資料的第一行包括一個正整數T，接下來有T組資料，每組資料佔一行。每組資料包含兩個整數N（來報名的人數,1<=N<=30），M（節目需要的人數0<=M<=30） Output每組資料輸出一個整數，每個輸出佔一行 Sample Input5 3 2 5 3 4 4 3 6

1794. Masterpieces of World ArchitectureTime limit: 1.0 secondMemory limit: 64 MBMaria Ivanovna informed all of her fifth-graders that in a month they would have a class on the topic “Masterpieces of World Architecture.” Each of the students had to

Problem