24h購物| | PChome| 登入
2014-04-18 22:56:27
2012-03-16 07:41:06

[UVA] 10922 - 2 the 9s

Problem C - 2 the 9sTime Limit: 1 second Introduction to the problem A well-known trick to know if an integer N is a multiple of nine is to compute the sum S of its digits. If S is a multi...

2012-03-16 07:00:00

[UVA] 10929 - You can say 11

Problem C - You can say 11Time Limite: 1 second Introduction to the problem Your job is, given a positive number N, determine if it is a multiple of eleven. Description of the input Th...

2012-03-15 22:08:31

[UVA] 10127 - Ones

Problem E - Ones Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1's. How many digits are in the smalles...

2012-03-15 21:49:54

[UVA] 623 - 500!

500! In these days you can more and more often happen to see programs which perform some useful calculations being executed rather then trivial screen savers. Some of them check the system me...

2012-03-09 22:33:53

[UVA] 838 - Worm World


Worm World The WormWold puzzle was initially proposed by Cliff Pickover in the Discover Magazine, issue of November 1994 (a visit to his home page is highly recommended!). The WormWorld is a ...

2012-03-08 23:39:03

[UVA] 10305 - Ordering Tasks

Problem F Ordering Tasks Input: standard input Output: standard output Time Limit: 1 second Memory Limit: 32 MB John has n tasks to do. Unfortunately, the tasks are not inde...

2012-03-08 22:35:49

[UVA] 10000 - Longest Paths


Longest Paths It is a well known fact that some people do not have their social abilities completely enabled. One example is the lack of talent for calculating distances and intervals of tim...

2012-03-05 20:30:41

[2012/3/5] 中興近況


原本資工系很少得可憐只有 29 人, 其中 2 人是本班唯一的女生,現在又再次要少 1 人哩, 要轉系轉走了, 當然是恭喜他囉 ! 在這墮落的資工系, 我認為越少人越好, 這樣會不會有人志願不選中興資工了 !下學期上的課程是物...

2012-03-05 19:13:45

[UVA][JAVA][System.in.read] 371 - Ackermann Functions

public class Main { public static void main(String[] args) { int L, H, i, tmp; while(true) { L = parseInt(); H = parseInt(); if(L > H) { tmp = L; L = H; H = tmp; } if(L == 0 &a...

2012-03-05 18:59:37

[UVA][JAVA][Sanner] 371 - Ackermann Functions


Ackermann Functions An Ackermann function has the characteristic that the length of the sequence of numbers generated by the function cannot be computed directly from the input value. One p...

2012-03-05 14:11:12

[UVA][JAVA][Biginteger] 619 - Numerically Speaking

Numerically Speaking A developer of crossword puzzles (and other similar word games) has decided to develop a mapping between every possible word with from one to twenty characters and unique...

2012-03-05 07:43:41

[UVA][JAVA][BigNumber] 10083 - Division

Problem D: Division Given t, a, b positive integers not bigger than 2147483647, establish whether (t^a - 1)/(t^b -1) is an integer with less than 100 digits. Each line of input contains t, a, b...

2012-03-03 08:10:21

[UVA] 12385 - Interesting Sequences

I - Interesting Sequences For a sequence of integer numbers <x1,x2,…,xn>, a contiguous subsequence <xi,xi+1,…,xj> where i<j≤n, is called "interesting" if its first and last ele...

2012-03-02 21:50:04

[UVA] 1099 - Sharing Chocolate


Chocolate in its many forms is enjoyed by millions of people around the world every day. It is a truly universal candy available in virtually every country around the world. You find that the ...

2012-02-29 12:15:51

[UVA] 193 - Graph Coloring


Graph Coloring You are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the only available colors are black and white....

第一頁      ‹上一頁       101 .  102 .  103 .  104 .  105 .  106 .  107 .  108 .  109 .  110 .      下一頁›      最末頁
«上十頁      第 110 / 142 頁 , 共 2116 筆       下十頁»      
TOP