原创 10041 - Vito's Family
Problem C: Vito's family Background The world-known gangster Vito Deadstone is moving to New York. He has a very
原创 uva 10085 - The most distant state
Problem A The Most Distant State Input: standard input Output: standard output The 8-puzzle is a square tray in which
原创 uva 10905 - Children's Game
4thIIUC Inter-University Programming Contest, 2005 A Children’s Game Input: standard inputOutput: standard outpu
原创 uva 11054 - Wine trading in Gergovia
2006/2007 ACM International Collegiate Programming Contest University of Ulm Local Contest Wine trading in Gergovia
原创 uva 10340 - All in All
Problem E All in All Input: standard input Output: standard output Time Limit: 2 seconds Memory Limit: 32 MB You have d
原创 uva 321 - The New Villa
The New Villa Mr. Black recently bought a villa in the countryside. Only one thing bothers him: although there are
原创 uva 10720 - Graph Construction
Problem C Graph Construction Time Limit 2 Seconds Graph is a collection of edges E and vertices V. Graph has a
原创 uva 165 - Stamps
Stamps The government of Nova Mareterrania requires that various legal documents have stamps attached to them so that
原创 uva 10718 - Bit Mask
Problem A Bit Mask Time Limit 1 Second In bit-wise expression, mask is a common term. You can get a certain bit
原创 uva 10400 - Game Show Math
Problem HGame Show Math Input: standard inputOutput: standard outputTime Limit: 15 seconds A game show in Britain has a
原创 uva 10382 - Watering Grass
Problem EWatering Grass Input: standard inputOutput: standard outputTime Limit: 3 seconds n sprinklers are installed in
原创 uva 10763 - Foreign Exchange
Problem EForeign ExchangeInput: standard inputOutput: standard outputTime Limit: 1 second Your non-profit organization
原创 uva 10700 - Camel trading
Problem E - Camel trading Time Limit: 1 second Background Aroud 800 A.D., El Mamum, Calif of Baghdad was presented
原创 uva 311 - Packets
Packets A factory produces products packed in square packets of the same height h and of the sizes , , , , , .
原创 uva 10026 - Shoemaker's Problem
Shoemaker's Problem Shoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one