u013599426的专栏

GridlandTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8258 Accepted: 4185DescriptionBackground For years, computer scientists have been trying to

DescriptionBill and Ted are taking a road trip. But the odometer in their car is broken, so they don't know how many miles they have driven. Fortunately, Bill has a working stopwatch, so they can

#include using namespace std;int main(){    int n,p,i,m2,m3,m5;    int a[1505],t;    while(cin>>n&&n!=0)    {        m2=0;        m3=0;        m5=0;        a[0]=1;        for(i

SubmitStatusDescriptionIn 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define d(n) to be n plus the sum of the dig

DescriptionFred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is actually shrinkin

#include #include #include using namespace std;int main(){    char M=0,N=0;    while(cin>>M && M!='E')    {        float m=0,n=0;        cin>>m>>N>>n;        if((M=='T' && N=='D'

Cryptanalysis is the process of breaking someone else's cryptographic writing. This sometimes involves some kind of statistical analysis of a passage of (encrypted) text. Your task is to write a pro

C - Maya CalendarTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionDuring his last sabbatical, professor M. A. Ya made a surpris

D - Factoring a PolynomialTime Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionRecently Georgie has learned about polynomials. A po

DescriptionDo you know stack and queue? They're both important data structures. A stack is a "first in last out" (FILO) data structure and a queue is a "first in first out" (FIFO) one.  Here com

DescriptionMany graduate students of Peking University are living in Wanliu Campus, which is 4.5 kilometers from the main campus – Yanyuan. Students in Wanliu have to either take a bus or ride a b

DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent til

A - ZipperTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven three strings, you are to determine whether the third string c

C - Message DecowdingTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe cows are thrilled because they've just learned about

B - Inglish-Number TranslatorTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIn this problem, you will be given one or more in

DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an a

DescriptionIn your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing a program whose output is a list of names in nondescending order by lengt

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 us

#include #include using namespace std;bool prime(int n){    int i;    double m;    m=sqrt(double(n)); if(n==1)  return 0;    for(i=2;i {        if(n%i==0) break; }    if(i>m)

DescriptionWrite a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that sho

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) no

DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the seq

DescriptionHardwoods are the botanical group of trees that have broad leaves, produce a fruit or nut, and generally go dormant in the winter.America's temperate climates produce forests with h

不容易系列之(4)——考新郎 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 37   Accepted Submission(s) : 8Font: Times New Roman | Verdana | GeorgiaF

Number Sequence Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 50   Accepted Submission(s) : 10Font: Times New Roman | Verdana | Georgia

神、上帝以及老天爷 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 7   Accepted Submission(s) : 5Font: Times New Roman | Verdana | Georgia Font S

人见人爱A^BTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20391    Accepted Submission(s): 14204Problem Description求A^B的最后三位数表示的整数。说明：A

Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29473    Accepted Submission(s): 11243Problem DescriptionGiven a po

A Mathematical CuriosityTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 87   Accepted Submission(s) : 23Font: Times New Roman | Verdana | Ge

Children’s Queue Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 75   Accepted Submission(s) : 19Font: Times New Roman | Verdana | Georgia

母牛的故事 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 44   Accepted Submission(s) : 35Font: Times New Roman | Verdana | GeorgiaFont Size

DescriptionA fractal is an object or quantity that displays self-similarity, in a somewhat technical sense, on all scales. The object need not exhibit exactly the same structure at all scales, but

DescriptionThe Antique Comedians of Malidinesia prefer comedies to tragedies. Unfortunately, most of the ancient plays are tragedies. Therefore the dramatic advisor of ACM has decided to transfigure

SubmitStatusDescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help yo

DescriptionYour task is to find the sum of all integer numberslying between 1 andN inclusive.InputThe input consists of a single integer N that isnot greater than 10000 by it's

DescriptionConsider polynomials whose coefficients are 0 and 1. Addition of two polynomials is achieved by 'adding' the coefficients for the corresponding powers in the polynomials. The addition o

Description题目描述：大家知道，给出正整数n，则1到n这n个数可以构成n！种排列，把这些排列按照从小到大的顺序（字典顺序）列出，如n=3时，列出1 2 3，1 3 2，2 1 3，2 3 1，3 1 2，3 2 1六个排列。任务描述：给出某个排列，求出这个排列的下k个排列，如果遇到最后一个排列，则下1排列为第1个排列，即排列1 2 3…n。比如：n = 3，k

DescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth w

DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendic

//先打素数的表#include #include using namespace std;const int maxp=200,n=10000;int prime[maxp],total=0;bool isprime(int n1){    int k;    for(int i=0;i    {        if(n1%prime[i]==0)