lwy_kitty

摘要： 其实自己只会做很简单的题，有时都不想写解题报告，觉得不值得一写，但是又想到今后也许就不会做ACM了，能留下来的东西只有解题报告了，所以要好好写，很渣的题也要写，是今后的纪念。B -BTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 313ADescriptionIlya is a very clever lion, he lives in an unusual city ZooVille. In this city all the anima 阅读全文

摘要： 这是做的最好的一次了一共做了4道题 嘻嘻~A -Game OutcomeTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 157ADescriptionSherlock Holmes and Dr. Watson played some game on a checkered boardn × nin size. During the game they put numbers on the board's squares 阅读全文

摘要： B -Find The MultipleTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and ther 阅读全文

摘要： B -确定比赛名次Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescription有N个比赛队（1 3 #include 4 const int N = 505; 5 6 bool g[N][N]; 7 int n, m,t,max = 1; 8 int main() 9 { int c[N];10 int i, x, y,j; 11 while(scanf("%d%d", &n, &m) != EOF) 12 { 13 memset(g, fal... 阅读全文

摘要： http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26100#problem/AA -ATime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1936DescriptionYou have devised a new encryption technique which encodes a message by inserting between its characters randomly gener 阅读全文

摘要： Time Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uDescription"Hey, it's homework time" — thought Polycarpus and of course he started with his favourite subject, IT. Polycarpus managed to solve all tasks but for the last one in 20 minutes. However, as he failed to s 阅读全文

摘要： Time Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uDescriptionPolycarpus has postcards and photos hung in a row on the wall. He decided to put them away to the closet and hang on the wall a famous painter's picture. Polycarpus does it like that: he goes from the left to the r 阅读全文

摘要： DescriptionUgly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence1, 2, 3, 4, 5, 6, 8, 9, 10, 12, ...shows the first 10 ugly numbers. By convention, 1 is included.Given the integer n,write a program to find and print the n'th ugly number.InputEach line of the input contains 阅读全文