摘要： EqsTime Limit:5000MSMemory Limit:65536KTotal Submissions:7827Accepted:3811DescriptionConsider equations having the following form: a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0 The coefficients are given integers from the interval [-50,50]. It is consider a solution a system (x1, x2, x3, x4, x5) that verifies 阅读全文

摘要： Wine Trading in GergoviaTime Limit:1000MSMemory Limit:65536KTotal Submissions:2653Accepted:1183DescriptionAs you may know from the comic “Asterix and the Chieftain’s Shield”, Gergovia consists of one street, and every inhabitant of the city is a wine salesman. You wonder how this economy works? Simp 阅读全文

摘要： 编辑器加载中...A. Rank List2 seconds256 megabytesAnother programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are shown its fi 阅读全文

摘要： Automatic Correction of MisspellingsTime Limit:1000MSMemory Limit:65536KTotal Submissions:1991Accepted:608DescriptionSome text editors offer a feature to correct words which seem to be written incorrectly. In this problem you are asked to implement a simpleAutomatic Correction of Misspellings (ACM). 阅读全文