import java.util.Scanner;
import java.util.Arrays;
public class Main
{
public static void main(String[] args) {
int n;
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
int[] nlist= new int[n];
for (int i=0;i<n;i++){
nlist[i] = sc.nextInt();
}
Arrays.sort(nlist);
System.out.println(nlist[0]+" "+ nlist[n-1]);
}
}
import java.util.Scanner;
public class Main
{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n1;
int n2;
int n3;
n1 = sc.nextInt();
for(int i=0;i<n1;i++){
n2 = sc.nextInt();
int[] nlist = new int[n2];
int hap = 0;
double result = 0;
for(int j=0;j<n2;j++){
n3 = sc.nextInt();
nlist[j] = n3;
hap += n3;
}
for(int j=0;j<n2;j++){
if(nlist[j]>(hap/n2)){
result+=1;
}
}
System.out.printf("%.3f%%\n", (result/n2)*100);
}
}
}
import java.util.Scanner;
public class Main
{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n1;
n1 = sc.nextInt();
String slist;
for(int i=0;i<n1;i++){
slist = sc.next();
int count = 0;
int result = 0;
for(int j=0;j<slist.length();j++){
if(slist.charAt(j) == 'O'){
count +=1;
}
else{
count = 0;
}
result += count;
}
System.out.println(result);
}
}
}
import java.util.Scanner;
public class Main
{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n1[] = new int[10];
int result = 0;
for(int i=0;i<10;i++){
n1[i] = sc.nextInt() % 42;
}
for(int i=0;i<10;i++){
int n2=0;
for(int j=i+1; j<10; j++){
if(n1[i] == n1[j]){
n2+=1;
}
}
if (n2 == 0){
result +=1;
}
}
System.out.println(result);
}
}
15596번: 정수 N개의 합 (acmicpc.net)
class Test
{
long sum(int[] nlist){
long result=0;
for (int i=0;i<nlist.length;i++){
result += nlist[i];
}
return result;
}
}
'JAVA' 카테고리의 다른 글
ep 05-2. 문제 풀이 (0) | 2022.12.02 |
---|---|
ep 05-1.추상 클래스 (0) | 2022.12.02 |
ep 04-2. 상속과 다형성 (0) | 2022.11.27 |
ep 04-1. 배열과 ArrayList (0) | 2022.11.27 |
ep 03-4. 문제 풀이2 (0) | 2022.11.20 |