2016年06月_superxtong

原创 USACO-Fractions to Decimals

Write a program that will accept a fraction of the form N/D, where N is the numerator and D is the denominator and print the decimal representation. If the decimal representation has a repeating sequen

2016-06-21 11:29:23 273

原创 USACO-Overfencing

Farmer John went crazy and created a huge maze of fences out in a field. Happily, he left out two fence segments on the edges, and thus created two “exits” for the maze. Even more happily, the maze he

2016-06-17 15:55:00 327

原创 USACO-The Tamworth Two

A pair of cows is loose somewhere in the forest. Farmer John is lending his expertise to their capture. Your task is to model their behavior.The chase takes place on a 10 by 10 planar grid. Squares can

2016-06-17 01:13:50 239

原创 USACO-Controlling Companies

Some companies are partial owners of other companies because they have acquired part of their total shares of stock. For example, Ford at one point owned 12% of Mazda. It is said that a company A contr

2016-06-12 13:50:19 696

原创 USACO-Money Systems

The cows have not only created their own government but they have chosen to create their own money system. In their own rebellious way, they are curious about values of coinage. Traditionally, coins co

2016-06-11 23:17:15 508

原创 USACO-Zero Sum

Consider the sequence of digits from 1 through N (where N=9) in increasing order: 1 2 3 … N.Now insert either a +' for addition or a-’ for subtraction or a ` ’ [blank] to run the digits together betwee

2016-06-10 01:03:26 291

原创 hdu1532-Drainage Ditches

Problem Description Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time

2016-06-07 23:52:27 219

原创 Gym 100269E-Energy Tycoon

Input file: energy.in Output file: energy.out Time limit: 2 seconds Memory limit: 256 megabytes Little Vasya is playing a new computer game — turn-based strategy “Energy Tycoon”. The rules of the

2016-06-06 00:20:33 475

原创 USACO-Longest Prefix

The structure of some biological objects is represented by the sequence of their constituents, where each part is denoted by an uppercase letter. Biologists are interested in decomposing a long sequenc

2016-06-05 17:44:22 250

原创 USACO-Party Lamps

Party Lamps IOI 98 To brighten up the gala dinner of the IOI’98 we have a set of N (10 <= N <= 100) colored lamps numbered from 1 to N.The lamps are connected to four buttons:Button 1: When this butt

2016-06-05 15:15:36 330

原创 FZU 2111J - Min Number

Description Now you are given one non-negative integer n in 10-base notation, it will only contain digits (‘0’-‘9’). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i#include <cstdio>

2016-06-03 15:12:58 312

原创 FZU 2107F - Hua Rong Dao

F - Hua Rong Dao Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeFZU 2107 Description Cao Cao was hunted down by thousands of enemy soldiers when he

2016-06-03 15:05:00 378

原创 FZU 2112K - Tickets

K - Tickets Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeFZU 2112 Description You have won a collection of tickets on luxury cruisers. Each ticke

2016-06-03 15:01:56 358

原创 Gym 100269B－Ballot Analyzing Device

Input file: bad.in Output file: bad.out Time limit: 2 seconds Memory limit: 256 megabytes Election committee of Flatland is preparing for presidential elections. To minimize human factor in ballot

2016-06-03 14:42:18 355

原创 Gym 100269G-Garage

Problem G. Garage Input file: garage.in Output file: garage.out Time limit: 2 seconds Memory limit: 256 megabytes Wow! What a lucky day! Your company has just won a social contract for building a

2016-06-03 14:30:09 436

原创 USACO－Runaround Numbers

Runaround numbers are integers with unique digits, none of which is zero (e.g., 81362) that also have an interesting property, exemplified by this demonstration:If you start at the left digit (8 in our

2016-06-03 01:19:41 343

原创 USACO－Subset Sums

For many sets of consecutive integers from 1 through N (1 <= N <= 39), one can partition the set into two sets whose sums are identical.For example, if N=3, one can partition the set {1, 2, 3} in one w

2016-06-02 21:39:21 278

转载 LightOJ 1045 I - Digits of Factorial

Description Factorial of an integer is defined by the following functionf(0) = 1 f(n) = f(n - 1) * n, if(n > 0)So, factorial of 5 is 120. But in different bases, the factorial may be different. For e

2016-06-02 00:43:35 282

原创 HDU 1059- Dividing

Description Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles ha

2016-06-01 23:07:56 567

原创 UESTC 802 E - Just a Line

Description There are NN points on a plane, among them N−1N-1 points will form a line, your task is to find the point that is not on the line.Input The first line contains a single number NN, the num

2016-06-01 22:38:09 337

原创 HDU 3711 D - Binary Number

Description For 2 non-negative integers x and y, f(x, y) is defined as the number of different bits in the binary format of x and y. For example, f(2, 3)=1,f(0, 3)=2, f(5, 10)=4. Now given 2 sets of n

2016-06-01 22:22:00 315

superxtong的博客