24h購物| | PChome| 登入
2014-04-18 22:56:27
2012-05-20 19:54:14

[JAVA] 物件排序實作 Comparable

import java.util.Arrays;import java.util.Scanner;public class A { public static class item implements Comparable{ String name; int num; public int compareTo(Object obj) { item a; a = (item) obj...

2012-05-20 19:22:38

[JAVA] Exception 例外處理實驗

public class A { public static void main(String[] args) { try { method(50); } catch(Exception e) { System.out.println("main catch block"); } System.out.println("main block"); } public static v...

2012-05-20 12:59:22

[UVA][zkw式ST] 10015 - Joseph's Cousin

The Problem The Joseph’s problem is notoriously known. For those who are not familiar with the problem, among n people numbered 1,2…n, standing in circle every mth is going to be executed and onl...

2012-05-20 12:31:51

[UVA][離散化] 11402 - Ahoy, Pirates!

Problem H Ahoy, Pirates! Input: Standard Input Output: Standard Output In the ancient pirate ages, the Pirate Land was divided into two teams of pirates, namely, the Buccaneer ...

2012-05-20 07:37:33

[UVA][ST線段樹][TLE邊緣, 待修] 11402 - Ahoy, Pirates!

Problem H Ahoy, Pirates! Input: Standard Input Output: Standard Output In the ancient pirate ages, the Pirate Land was divided into two teams of pirates, namely, the Buccaneer ...

2012-05-19 21:16:32

[UVA] 10474 - Where is the Marble?

Where is the Marble? Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. At the beginning, Raju would place the marbles one after another in...

2012-05-19 19:30:30

[UVA][Tree] 11350 - Stern-Brocot Tree


K - Stern-Brocot Tree Time Limit: 1 sec Memory Limit: 16MB In number theory, the Stern-Brocot tree is a method of listing all non-negative rational numbers as well as a point representing ...

2012-05-19 19:05:39

[UVA][zkw式ST] 11525 - Permutation


Problem F Permutation Input: Standard Input Output: Standard Output Given N and K find the N’th permutation of the integers from 1 to K when those permutations are lexicographically o...

2012-05-19 18:36:04

[UVA][BIT] 11525 - Permutation


Problem F Permutation Input: Standard Input Output: Standard Output Given N and K find the N’th permutation of the integers from 1 to K when those permutations are lexicographically o...

2012-05-19 17:32:59

[UVA] 498 - Polly the Polynomial


Polly the Polynomial Algebra! Remember algebra? There is a theory that as engineers progresses further and further in their studies, they lose basic math skills. This problem is designed to hel...

2012-05-19 17:14:47

[UVA][priority_queue] 11926 - Multitasking


Multitasking Calendars control our daily lives. For people like me, who are bad at multitasking, it is important to have at most one task planned for any minute of my life. Your job is to m...

2012-05-19 17:03:41

[UVA][模擬] 11926 - Multitasking


Multitasking Calendars control our daily lives. For people like me, who are bad at multitasking, it is important to have at most one task planned for any minute of my life. Your job is to m...

2012-05-19 13:14:39

[UVA][Math] 10427 - Naughty Sleepy Boys

Problem I Naughty Sleepy Boys Input: standard input Output: standard output Time Limit: 2 seconds Hasan and Tanveer are two naughty boys of the class. They spent most of their class tim...

2012-05-19 12:58:20

[UVA][Stack] 120 - Stacks of Flapjacks

Stacks of Flapjacks Background Stacks and Queues are often considered the bread and butter of data structures and find use in architecture, parsing, operating systems, and discrete event simul...

2012-05-19 10:27:24

[UVA][Tree] 699 - The Falling Leaves


The Falling Leaves Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the...

第一頁      ‹上一頁       91 .  92 .  93 .  94 .  95 .  96 .  97 .  98 .  99 .  100 .      下一頁›      最末頁
«上十頁      第 93 / 142 頁 , 共 2116 筆       下十頁»      
TOP