giuniu

import math._

object PythagoraSwitch {

  def main(args: Array[String]): Unit = {
    val max = Integer.parseInt(args(0))
    val start = System.nanoTime()
    /*
    val result = for (
      c <- 3 to max by 2;

giuniu

import java.util.ArrayList;
import java.util.List;

public class PythagoraSwitch2 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        final int MAX = Integer.parseInt(args[0]);

giuniu

import java.util.ArrayList;
import java.util.List;

public class PythagoraSwitch {

    public static void main(String[] args) {
        final int MAX = Integer.parseInt(args[0]);
        long start = System.nanoTime();
        List<PythagorasNum> result = new ArrayList<>();
        for (int c = 3; c <= MAX; c += 2) {

giuniu

package exercise;

import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.SortedSet;
import java.util.TreeSet;

public class SortWordsJ {

giuniu

object SortWords {

  def main(args: Array[String]): Unit = {
    val list = args.toList sort (_ > _)
    val foldList = (List((1, list.head)) /: list.tail) {
      case (x, y) if (x.head._2 == y) => (x.head._1 + 1, x.head._2) :: x.tail
      case (x, y) => (1, y) :: x
    }
    val result = foldList sort ((a, b) => a._1 > b._1 || a._1 == b._1 && a._2 < b._2) map (_._2)
    println(result)

giuniu

import java.util.List;
import java.util.ArrayList;
import java.util.Set;
import java.util.HashSet;
import java.util.Collections;

public class Exercise {
    public static void main(String[] args) {
        List<Integer> nums = new ArrayList<>();
        for (String str : args)

giuniu

コレが中身。