nealgavin的专栏

The Beautiful RoadTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 229    Accepted Submission(s): 122Problem DescriptionThere is

D - Dividing IslandTime Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 63DDescriptionA revolution took place on the Buk

D - Seller BobCrawling in process...Crawling failedTime Limit:2000MS    Memory Limit:131072KB   64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 18DDescriptionLast year

C - ParquetCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice CodeForces 26C DescriptionOnce

C - Roads in BerlandCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice CodeForces 25C Descriptio

C - Four SegmentsCrawling in process...Crawling failedTime Limit:2000MS    Memory Limit:65536KB   64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 14CDescriptionSeveral

The Drunk JailerTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 821    Accepted Submission(s): 677Problem DescriptionA certain pri

SafecrackerTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5180    Accepted Submission(s): 2600Problem Description=== Op tech brie

Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14615    Accepted Submission(s): 6145Problem Descrip

E - Start of the seasonCrawling in process...Crawling failedTime Limit:2000MS    Memory Limit:262144KB   64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 12EDescriptionB

Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14714    Accepted Submission(s): 6106Problem DescriptionA subseq

Employment PlanningTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2597    Accepted Submission(s): 1013Problem DescriptionA projec

C - Bulls and CowsTime Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 63CDescriptionThe "Bulls and Cows" game needs two

B - bHTML Tables AnalisysTime Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 51BDescriptionIn this problem is used an e

威威猫系列故事——过生日Time Limit: 500/200 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 640    Accepted Submission(s): 160Problem Description　　2月29号是威威猫的生日，由于

Meeting point-2Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 866    Accepted Submission(s): 472Problem DescriptionIt has been ten

Problem HHelp is needed for DexterTime Limit: 3 Second Dexter is tired of Dee Dee. So he decided to keep Dee Dee busy in a game. The game he planned for her is quite easy to play but not easy

Your new company is building a robot that can hold small lightweight objects. The robot will have the intelligence to determine if an object is light enough to hold. It does this by taking pictures of

DEven ParityInput: Standard InputOutput: Standard OutputWe have a grid of size N x N. Each cell of the grid initially contains a zero(0) or a one(1). The parity of a cell

Programming contests became so popular in the year 2397 that the governor of New Earck -- the largest human-inhabited planet of the galaxy -- opened a special Alley of Contestant Memories (ACM) at the

F. Spreading the Wealth ProblemA Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has c

GCommando WarInput: Standard InputOutput: Standard Output  “Waiting for orders we held in the wood, word from the front never cameBy evening the sound of the gunfire was

Problem C: The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shores of Rellau Creek in central Loowater had always been a prime

A Different Task The (Three peg) Tower of Hanoi problem is a popular one in computer science. Briefly the problem is to transfer all the disks from peg-A to peg-C using peg-B as in

GridsTime Limit 1000msMemory Limit 65536KdescriptionOn an 1 × 1 grid,partition the length and width into 50 parts,forming 2500 unit grids with

B - Tyndex.BromeTime Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 62BDescriptionTyndex is again well ahead of the rival

Home on the RangeFarmer John grazes his cows on a large, square field N (2 <= N <= 250) miles on a side (because, for some reason, his cows will only graze on precisely square land segments). Regr

Quoit DesignTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17773    Accepted Submission(s): 4563Problem DescriptionHave you ever p

Hamming CodesRob Kolstad Given N, B, and D: Find a set of N codewords (1 <= N <= 64), each of length B bits (1 <= B <= 8), such that each of the codewords is at least Hamming distance of D (1 <= D

Ordered FractionsConsider the set of all reduced fractions between 0 and 1 inclusive with denominators less than or equal to N.Here is the set when N = 5: 0/1 1/5 1/4 1/3 2/5 1/2 3/5 2/3 3/4

Sorting a Three-Valued Sequence IOI'96 - Day 2 Sorting is one of the most frequently performed computational tasks. Consider the special sorting problem in which the records to be sorted have

Prime PalindromesThe number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program that finds all prime pal

Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3726    Accepted Submission(s): 1252Problem DescriptionA Fibonacci se

N!Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33314    Accepted Submission(s): 9234Problem Description                Given an in

Mixing MilkSince milk packaging is such a low margin business, it is important to keep the price of the raw product (milk) as low as possible. Help Merry Milk Makers get the milk they need in the

公式 p+q-gcd(p,q)就是所求值 #include#include#includeusing namespace std;int gcd(int n,int m){  if(m==0)  return n;  gcd(m,n%m);}int main(){  int m,n;  while(cin>>m>>n)  {

TransformationsA square pattern of size N x N (1 #1: 90 Degree Rotation: The pattern was rotated clockwise 90 degrees. #2: 180 Degree Rotation: The pattern was rotated clockwise 180 degrees. #3: 270

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3266    Accepted Submission(s): 1519Problem DescriptionA robot has been programmed

/*ID:nealgav1PROG:fridayLANG:C++*/#include#include#define N 403int week[N][7];void search(){ memset(week,0,sizeof(week)); int i,j,k,year,ri,count=0; bool flag=0; for(i=1900,year=0;i<190

Runaround NumbersRunaround 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