LoginSignup
0
0

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?

@anonymously115

paizaラーニングレベルアップ問題集の「辞書順に出力」をやってみた。

Posted at

paizaラーニングレベルアップ問題集の「辞書順に出力」をやってみました。

問題
STEP: 1

STEP: 2

STEP: 3

STEP: 4

C
STEP: 1
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int cmp(const void *a, const void *b) {
	return strcmp((const char*) a, (const char*) b);
}

int main() {
	char S[][6] = {"zaipa", "izapa", "paiza"};
	int n = (int) (sizeof(S) / sizeof(S[0]));
	qsort(S, n, sizeof(S[0]), cmp);
	for (int i = 0; i < n; i++) puts(S[i]);
	return 0;
}
STEP: 2
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int cmp(const void *a, const void *b) {
	return strcmp((const char*) a, (const char*) b);
}

int main() {
	int n = 5;
	char S[n][11];
	for (int i = 0; i < n; i++) scanf("%s", S[i]);	
	qsort(S, n, sizeof(S[0]), cmp);
	for (int i = 0; i < n; i++) puts(S[i]);
	return 0;
}
STEP: 3
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int cmp(const void *a, const void *b) {
	return strcmp((const char*) a, (const char*) b);
}

int main() {
	int n;
	scanf("%d", &n);
	char S[n][11];
	for (int i = 0; i < n; i++) scanf("%s", S[i]);	
	qsort(S, n, sizeof(S[0]), cmp);
	for (int i = 0; i < n; i++) puts(S[i]);
	return 0;
}
STEP: 4
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int cmp(const void *a, const void *b) {
	return strcmp((const char*) a, (const char*) b);
}

int main() {
	int n, k;
	scanf("%d %d", &n, &k);
	char S[n][11];
	for (int i = 0; i < n; i++) scanf("%s", S[i]);	
	qsort(S, n, sizeof(S[0]), cmp);
	puts(S[k-1]);
	return 0;
}
C++
STEP: 1
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	vector<string> S = {"zaipa", "izapa", "paiza"};
	sort(S.begin(), S.end());
	for (string s : S) cout << s << endl;
	return 0;
}
STEP: 2
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	vector<string> S;
	string s;
	cin >> s;
	while (!cin.fail()) {
		S.push_back(s);
		cin >> s;
	}
	sort(S.begin(), S.end());
	for (string s : S) cout << s << endl;
	return 0;
}
STEP: 3
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<string> S(n);
	for (int i = 0; i < n; i++) {
		cin >> S[i];
	}
	sort(S.begin(), S.end());
	for (int i = 0; i < n; i++) cout << S[i] << endl;
	return 0;
}
STEP: 4
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	int n, k;
	cin >> n >> k;
	vector<string> S(n);
	for (int i = 0; i < n; i++) {
		cin >> S[i];
	}
	sort(S.begin(), S.end());
	cout << S[k-1] << endl;
	return 0;
}
C#
STEP: 1
using System;

class Program
{
	public static void Main()
	{
		string[] S = {"zaipa", "izapa", "paiza"};
		Array.Sort(S);
		foreach (string s in S) Console.WriteLine(s);
	}
}
STEP: 2
using System;

class Program
{
	public static void Main()
	{
		string[] S = Console.ReadLine().Split();
		Array.Sort(S);
		foreach (string s in S) Console.WriteLine(s);
	}
}
STEP: 3
using System;

class Program
{
	public static void Main()
	{
		int n = int.Parse(Console.ReadLine());
		string[] S = Console.ReadLine().Split();
		Array.Sort(S);
		for (int i = 0; i < n; i++) Console.WriteLine(S[i]);
	}
}
STEP: 4
using System;

class Program
{
	public static void Main()
	{
		int nk = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
		int k = nk[1];
		string[] S = Console.ReadLine().Split();
		Array.Sort(S);
		Console.WriteLine(S[k-1]);
	}
}
Go
STEP: 1
package main
import (
	"fmt"
	"sort"
)

func main() {
	S := []string{"zaipa", "izapa", "paiza"}
	sort.Strings(S)
	for _, s := range(S) {
		fmt.Println(s)
	}
}
STEP: 2
package main
import (
	"fmt"
	"sort"
)

func main() {
	S := make([]string, 0)
	var t string
	for _, err := fmt.Scan(&t); err == nil; _, err = fmt.Scan(&t) {
		S = append(S, t)
	}
	sort.Strings(S)
	for _, s := range(S) {
		fmt.Println(s)
	}
}
STEP: 3
package main
import (
	"fmt"
	"sort"
)

func main() {
	var n int
	fmt.Scan(&n)
	S := make([]string, n)
	for i := 0; i < n; i++ {
		fmt.Scan(&S[i])
	}
	sort.Strings(S)
	for i := 0; i < n; i++ {
		fmt.Println(S[i])
	}
}
STEP: 4
package main
import (
	"fmt"
	"sort"
)

func main() {
	var n, k int
	fmt.Scan(&n, &k)
	S := make([]string, n)
	for i := 0; i < n; i++ {
		fmt.Scan(&S[i])
	}
	sort.Strings(S)
	fmt.Println(S[k-1])
}
Java
STEP: 1
import java.util.*;

public class Main {
	public static void main(String[] args) {
		String[] S = {"zaipa", "izapa", "paiza"};
		Arrays.sort(S);
		for (String s : S) System.out.println(s);
	}
}
STEP: 2
import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String[] S = sc.nextLine().split(" ");
		sc.close();
		Arrays.sort(S);
		for (String s : S) System.out.println(s);
	}
}
STEP: 3
import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		sc.nextLine();
		String[] S = sc.nextLine().split(" ");
		sc.close();
		Arrays.sort(S);
		for (int i = 0; i < n; i++) System.out.println(S[i]);
	}
}
STEP: 4
import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		sc.nextLine();
		String[] S = sc.nextLine().split(" ");
		sc.close();
		Arrays.sort(S);
		System.out.println(S[k-1]);
	}
}
JavaScript
STEP: 1
const S = ["zaipa", "izapa", "paiza"];
S.sort();
S.forEach(s => console.log(s));
STEP: 2
const S = require("fs").readFileSync("/dev/stdin", "utf8").trim().split(' ');
S.sort();
S.forEach(s => console.log(s));
STEP: 3
const [n, S] = require("fs").readFileSync("/dev/stdin", "utf8").trim().split('\n').map((s, i) => i ? s.split(' ') : Number(s));
S.sort();
for (var i = 0; i < n; i++) console.log(S[i]);
STEP: 4
const [[n, k], S] = require("fs").readFileSync("/dev/stdin", "utf8").trim().split('\n').map((s, i) => i ? s.split(' ') : s.split(' ').map(Number));
S.sort();
console.log(S[k-1]);
Kotlin
STEP: 1
fun main() {
	var S = arrayOf("zaipa", "izapa", "paiza")
	S.sort()
	for (s in S) println(s)
}
STEP: 2
fun main() {
	var S = readLine()!!.split(' ').toTypedArray()
	S.sort()
	for (s in S) println(s)
}
STEP: 3
fun main() {
	val n = readLine()!!.toInt()
	var S = readLine()!!.split(' ').toTypedArray()
	S.sort()
	for (i in 0 until n) println(S[i])
}
STEP: 4
fun main() {
	val (_, k) = readLine()!!.split(' ').map { it.toInt() }
	var S = readLine()!!.split(' ').toTypedArray()
	S.sort()
	println(S[k-1])
}
PHP
STEP: 1
<?php
	$S = ["zaipa", "izapa", "paiza"];
	sort($S);
	foreach ($S as $s) echo $s, PHP_EOL;
?>
STEP: 2
<?php
	$S = explode(' ', trim(fgets(STDIN)));
	sort($S);
	foreach ($S as $s) echo $s, PHP_EOL;
?>
STEP: 3
<?php
	$n = intval(fgets(STDIN));
	$S = explode(' ', trim(fgets(STDIN)));
	sort($S);
	for ($i = 0; $i < $n; $i++) echo $S[$i], PHP_EOL;
?>
STEP: 4
<?php
	[$n, $k] = array_map("intval", explode(' ', fgets(STDIN)));
	$S = explode(' ', trim(fgets(STDIN)));
	sort($S);
	echo $S[$k-1], PHP_EOL;
?>
Perl
STEP: 1
my @S = ("zaipa", "izapa", "paiza");
my @T = sort @S;
foreach $t (@T) {
	print "$t$/";
}
STEP: 2
my @S = split ' ', <STDIN>;
my @T = sort @S;
foreach $t (@T) {
	print "$t$/";
}
STEP: 3
my $n = int(<STDIN>);
my @S = split ' ', <STDIN>;
my @T = sort @S;
for (my $i = 0; $i < $n; $i++) {
	print "$T[$i]$/";
}
STEP: 4
my ($n, $k) = map { int($_)} split ' ', <STDIN>;
my @S = split ' ', <STDIN>;
my @T = sort @S;
print "$T[$k-1]$/";
Python3
STEP: 1
S = ["zaipa", "izapa", "paiza"]
S.sort()
for s in S:
	print(s)
STEP: 2
S = input().split()
S.sort()
for s in S:
	print(s)
STEP: 3
n = int(input())
S = input().split()
S.sort()
for i in range(n):
	print(S[i])
STEP: 4
n, k = map(int, input().split())
S = input().split()
S.sort()
print(S[k-1])
Ruby
STEP: 1
S = ["zaipa", "izapa", "paiza"]
S.sort!()
S.each do |s|
	puts s
end
STEP: 2
S = gets.chomp.split
S.sort!()
S.each do |s|
	puts s
end
STEP: 3
n = gets.to_i
S = gets.chomp.split
S.sort!()
n.times do |i|
	puts S[i]
end
STEP: 4
n, k = gets.split.map(&:to_i)
S = gets.chomp.split
S.sort!()
puts S[k-1]
Scala
STEP: 1
import scala.io.StdIn._

object Main extends App{
	val S = Array("zaipa", "izapa", "paiza")
	val T = S.sorted
	for (t <- T) println(t)
}
STEP: 2
import scala.io.StdIn._

object Main extends App{
	val S = readLine().split(' ')
	val T = S.sorted
	for (t <- T) println(t)
}
STEP: 3
import scala.io.StdIn._

object Main extends App{
	val n = readLine().toInt
	val S = readLine().split(' ')
	val T = S.sorted
	for (i <- 0 until n) println(T(i))
}
STEP: 4
import scala.io.StdIn._

object Main extends App{
	val Array(n, k) = readLine().split(' ').map { _.toInt }
	val S = readLine().split(' ')
	val T = S.sorted
	println(T(k-1))
}
Swift
STEP: 1
var S = ["zaipa", "izapa", "paiza"]
S.sort()
for s in S {
	print(s)
}
STEP: 2
var S = readLine()!.split(separator: " ")
S.sort()
for s in S {
	print(s)
}
STEP: 3
let n = Int(readLine()!)!
var S = readLine()!.split(separator: " ")
S.sort()
for i in 0..<n {
	print(S[i])
}
STEP: 4
let nk = readLine()!.split(separator: " ").compactMap { Int($0) }
let k = nk[1]
var S = readLine()!.split(separator: " ")
S.sort()
print(S[k-1])
0
0
0

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
Sign upLogin
0
0

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?