import java.util.Scanner;
public class JPA310 {
static Scanner keyboard = new Scanner(System.in);
public static void main(String[] args) {
int n;
int sum=0;
do{
System.out.print("請輸入 n 的值(n>0,且為偶數):");
n = keyboard.nextInt();
}while(n<0||n%2==1);
for(int i = 0; i<=n;i=i+2){
sum+=i;
}
System.out.println("2+4+...+"+n+"="+sum);
}
}
310 迴圈正偶數相加
309 迴圈倍數判斷
import java.io.*;
import java.util.*;
class JPA309 {
public static void main(String argv[]) throws IOException {
Scanner keyboard = new Scanner(System.in);
int sum=0;
int n = keyboard.nextInt();
for(int i=0;i<=n;i++){
if(i%3==0||i%5==0){
if(i%7!=0){
sum+=i;
}
}
}
System.out.println("Answer: " + sum);
}
}
308 電腦週邊費用總計
import java.util.Scanner;
public class JPA308 {
static Scanner keyboard = new Scanner(System.in);
static int i = -1;
public static void main(String[] args) {
int total = 0, s = 0;
do{
s+=i;
System.out.print("請輸入消費金額,或輸入-1結束:");
i=keyboard.nextInt();
}while(i!=-1);
System.out.println("電腦周邊總消費 : "+(s+1));
}
}
307 迴圈最大公因數
import java.io.*;
import java.util.*;
public class JPA307 {
public static void main (String argv[]) throws IOException {
int num1, num2;
Scanner input = new Scanner(System.in);
System.out.println("Input:");
num1=input.nextInt();
while (num1!=999) {
num2=input.nextInt();
System.out.println(gcd(num1,num2));
System.out.println("Input:");
num1=input.nextInt();
}
}
static int gcd (int m, int n) {
int result;
while (n!=0){
result=m%n;
m=n;
n=result;
}
return m;
}
}
306 迴圈次方計算
import java.util.*;
import java.io.*;
public class JPA306 {
public static void main (String argv[]) throws IOException {
int num1, num2;
Scanner input = new Scanner(System.in);
System.out.println("Input:");
num1 = input.nextInt();
while (num1 != 999) {
num2 = input.nextInt();
System.out.println(powerOf(num1, num2));
System.out.println("Input:");
num1 = input.nextInt();
}
}
static int powerOf (int m, int n) {
int sum=1;
for(int i=1;i<=n;i++){
sum=sum*m;
}
return sum;
}
}
305 迴圈階乘計算
import java.util.Scanner;
public class JPA305 {
static Scanner keyboard = new Scanner(System.in);
public static void main(String[] args) {
test();
test();
test();
}
public static void test() {
int n;
int tmp;
System.out.print("Please enter one value:");
n=keyboard.nextInt();
if(n<=10&&n>=1){
tmp=1;
for(int i=1;i<=n;i++)
{
tmp=tmp*i;
}
System.out.println(n+"!:"+tmp);
}
else{
System.out.println("Error, the value is out of range.");
}
}
}
304 餐點費用
import java.util.Scanner;
public class JPA304 {
public static void main(String[] args) {
int total = 0;
int s = 0;
int count = 0;
double average;
Scanner input = new Scanner(System.in);
do{
total+=s;
count++;
System.out.print("Please enter meal dollars or enter -1 to stop: ");
s=input.nextInt();
}while(s!=-1);
average=total/(double)(count-1);
System.out.println("餐點總費用:"+total);
System.out.printf(" %d 道餐點平均費用為: %.2f %n",count-1,average);
}
}
303 完美數
import java.util.Scanner;
public class JPA303 {
public static void main(String[] args) {
int i, num, sum = 0;
System.out.printf("1~1000中的完美數有: ");
for(i=1;i<=1000;i++){
num=i;
sum=0;
for(int j=1;j<i;j++){
if(i%j==0){
sum=sum+j;
}
}
if(num==sum){
System.out.printf("%d ",num);
}
}
System.out.printf("\n");
}
}
302 巢狀迴圈
import java.util.Scanner;
public class JPA302 {
public static void main(String[] args) {
int i = 1, j = 1, count = 0;
for (i = 1; i <= 3; i++) { //第一個迴圈,i從1到3
for (j = 1; j <= 9; j++) { //第一個迴圈,i從1到3
count=count+1;
}
}
System.out.printf("count = %d\n", count);
}
}
301 整數連加
import java.util.*;
class JPA301 {
public static void main(String argv[]) {
Scanner input = new Scanner(System.in);
System.out.println("Input:");
int n= input.nextInt();
int sum=0;
for (int i=1;i<=n;i++) {
sum=sum+i;
}
System.out.println("1+ ... + "+n+" = "+sum);
}
}
訂閱:
文章 (Atom)