算法爱好者

摘要： A simple problemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1946Accepted Submission(s): 665Problem DescriptionZty很痴迷数学问题.。一天，yifenfei出了个数学题想难倒他，让他回答1 / n。但Zty却回答不了^_^. 请大家编程帮助他.Input第一行整数T，表示测试组数。后面T行，每行一个整数 n (1#include int hash[100000];int m. 阅读全文

摘要： EquationsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2879Accepted Submission(s): 1114Problem DescriptionConsider equations having the following form: a*x1^2+b*x2^2+c*x3^2+d*x4^2=0a, b, c, d are integers from the interval [-50,50] and any of the 阅读全文

摘要： 命运Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3941Accepted Submission(s): 1408Problem Description穿过幽谷意味着离大魔王lemon已经无限接近了！可谁能想到，yifenfei在斩杀了一些虾兵蟹将后，却再次面临命运大迷宫的考验，这是魔王lemon设下的又一个机关。要知道，不论何人，若在迷宫中被困1小时以上，则必死无疑！可怜的yifenfei为了去救MM，义无返顾地跳进了迷宫。让我们一起帮帮执 阅读全文

摘要： 于PAT/ACM培训的报名通知~ AssignmentsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1075Accepted Submission(s): 488Problem DescriptionIn a factory, there are N workers to finish two types of tasks (A and B). Each type has N tasks. Each task of type A needs 阅读全文

摘要： FriendshipTime Limit: 3 Seconds Memory Limit: 32768 KB A friend is like a flower,a rose to be exact,Or maybe like a brand new gatethat never comes unlatched.A friend is like an owl,both beautiful and wise.Or perhaps a friend is like a ghost,whose spirit never dies.A friend is like a heart that go... 阅读全文

摘要： FrecklesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5217Accepted: 2706DescriptionIn an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles turns out to be a scar, so his Ripley' 阅读全文

摘要： Find them, Catch themTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21108Accepted: 6259DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify 阅读全文

摘要： NetworkTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 10104Accepted: 3796Special JudgeDescriptionAndrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since 阅读全文

摘要： 食物链Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 29454Accepted: 8591Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述：第一种说法是"1 X Y"，表示X和Y是同类。第二种说法是"2 X Y"，表示X吃Y。此人对N个动物，用上述两种说法，一句接一句地说出K句 阅读全文

摘要： Cube StackingTime Limit: 2000MSMemory Limit: 30000KTotal Submissions: 14175Accepted: 4773Case Time Limit: 1000MSDescriptionFarmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, each containing a single cube. Farmer John 阅读全文