//ææé¢ççæ¡
1.
import java.util.Random;
public class Test33 {
public static void main(String[] args) {
Random rand = new Random();
int a, b, c;
int max, min;
a = rand.nextInt();
b = rand.nextInt();
c = rand.nextInt();
max = a>b?(a>c?a:c):(b>c?b:c);
min = a<b?(a<c?a:c):(b<c?b:c);
System.out.printf("ä¸ä¸ªæ´æ°ï¼%d, %d, %d\n", a, b, c);
System.out.printf("æ大æ°ï¼%d\n", max);
System.out.printf("æå°æ°ï¼%d\n", min);
}
}
2.
import java.util.Scanner;
public class Test33 {
public static void main(String[] args) {
int num;
int sum = 0; //å
double avg; //å¹³åæ°
int count = 0;
Scanner scan = new Scanner(System.in);
System.out.println("请è¾å
¥æ´æ°(-1ç»æ)ï¼");
while(true){
System.out.printf("No. %dï¼", count+1);
num = scan.nextInt();
if(num==-1){
break;
}
if(num<1 || num>100){
continue;
}
if(!(num%3==0 && num%5!=0 && num%9!=0)){
continue;
}
sum += num;
count++;
}
avg = 1.0 * sum / count;
System.out.printf("æææ°çåï¼%d\n", sum);
System.out.printf("æææ°çå¹³åå¼ï¼%.2f\n", avg);
}
}
3.
public class Test33 {
public static void main(String[] args) {
int num;
int count = 0;
int i, j;
for(i=0; i<=9; i++){
for(j=0; j<=9; j++){
num = 10023 + 1000 * i + 100 * j;
if(num%57==0 || num%67==0){
System.out.printf("第%2dç§å¯è½ : %d\n", ++count, num);
}
}
}
}
4.
/
5.
public class Test33 {
public static void main(String[] args) {
int num;
int count = 0;
System.out.println("100以å
çææç´ æ°ï¼");
for(num=2; num<=100; num++){
if(isPrime(num) == true){
count++;
System.out.printf("%6d", num);
}
}
System.out.println("\nç´ æ°æ»æ°ï¼" + count);
}
public static boolean isPrime(int num){
int i, k;
if(num == 2){
return true;
}
k = (int)Math.sqrt(num);
for(i=2; i<=k; i++){
if(num%i == 0){
return false;
}
}
return true;
}
}
6.
public class Test33 {
public static void main(String[] args) {
int total = 100;
int num1; //ä¸å硬å¸æ°
int num2; //äºå硬å¸æ°
int num5; //äºå硬å¸æ°
int count = 0; //æ¢æ³æ»æ°
for(num1=1; num1<=total; num1++){
for(num2=1; num2<=total/2; num2++){
for(num5=1; num5<=total/5; num5++){
if(num1+2*num2+5*num5 == total){
count++;
System.out.printf("æ¢æ³%-3dï¼ä¸å硬å¸æ°ï¼%2dï¼äºå硬å¸æ°ï¼%2dï¼äºå硬å¸æ°ï¼%2d\n", count, num1, num2, num5);
}
}
}
}
System.out.println("å
±æ" + count + "ç§æ¢æ³");
}
}
7.
import java.util.Scanner;
public class Test33 {
public static void main(String[] args) {
int n;
Scanner scan = new Scanner(System.in);
System.out.print("è¾å
¥æ°åç大å°(n)ï¼");
n = scan.nextInt();
System.out.println("Fibonacciæ°å");
for(int i=1; i<n; i++){
System.out.print(fabonacci(i) + ", ");
}
System.out.print(fabonacci(n));
}
public static long fabonacci(int num){
if(num==1 || num==2){
return 1;
}
return fabonacci(num-1) + fabonacci(num-2);
}
}
8.
public class Test33 {
public static void main(String[] args) {
int num;
int a, b, c;
System.out.println("满足æ¡ä»¶çææä¸ä½èªç¶æ°ï¼");
for(num=100; num<1000; num++){
a = num/100;
b = num/10%10;
c = num%10;
if(a*a*a+b*b*b+c*c*c == num){
System.out.println(num);
}
}
}
}
9.
import java.util.Scanner;
public class Test33 {
public static void main(String[] args) {
int n;
long sum;
Scanner scan = new Scanner(System.in);
System.out.print("è¾å
¥æ£æ´æ°(n)ï¼");
n = scan.nextInt();
sum = summary(n);
System.out.printf("1!+2!+...+%d! = %d\n", n, sum);
}
public static long fact(int num){
long f = 1;
for(int i=2; i<=num; i++){
f *= i;
}
return f;
}
public static long summary(int num){
long sum = 0;
for(int i=1; i<=num; i++){
sum += fact(i);
}
return sum;
}
}
10.
import java.util.Scanner;
public class Test33 {
public static void main(String[] args) {
double a, b, c;
double x1, x2;
double delta;
Scanner scan = new Scanner(System.in);
System.out.print("a = ");
a = scan.nextDouble();
System.out.print("b = ");
b = scan.nextDouble();
System.out.print("c = ");
c = scan.nextDouble();
delta = b*b-4*a*c;
if(a == 0){
if(b == 0){
System.out.println("ä¸å
ä¸æ¬¡æ¹ç¨æ 解!");
}
else{
System.out.printf("ä¸å
ä¸æ¬¡æ¹ç¨ x = %.4f\n", 1.0 * c / b);
}
}
else {
if(delta < 0){
System.out.println("ä¸å
äºæ¬¡æ¹ç¨æ å®æ ¹!");
}
else if(delta == 0){
x1 = -1.0 * b / (2*a);
System.out.printf("ä¸å
äºæ¬¡æ¹ç¨æ两个ç¸çå®æ ¹ x1 = x2 = %.4f\n", x1);
}
else{
x1 = (-1.0 * b + Math.sqrt(delta)) / (2*a);
x2 = (-1.0 * b - Math.sqrt(delta)) / (2*a);
System.out.printf("ä¸å
äºæ¬¡æ¹ç¨æ两个ä¸åçå®æ ¹ x1 = %.4f, x2 = %.4f\n", x1, x2);
}
}
}
}
11.
public class Test33 {
public static void main(String[] args) {
int a, b, c;
int num;
int count = 0;
for(a=1; a<=4; a++){
for(b=1; b<=4; b++){
for(c=1; c<=4; c++){
num = 100*a + 10*b + c;
count++;
System.out.printf("%4d", num);
if(count%10==0){
System.out.println();
}
}
}
}
System.out.println("\nå
±ææ éå¤çä¸ä½æ° " + count + " 个");
}
}
12.
import java.util.Scanner;
public class Test33 {
public static void main(String[] args) {
int n;
int sign = 1;
int sum = 0;
Scanner scan = new Scanner(System.in);
while(true){
System.out.print("è¾å
¥å¥æ°(n)ï¼");
n = scan.nextInt();
if(n>0 && n%2==1){
break;
}
}
for(int i=1; i<=n; i+=2){
sum += sign * i;
sign *= -1;
}
System.out.println("1-3+5-7+...+n = " + sum);
}
}
13.
import java.util.Random;
import java.util.Scanner;
public class Test33 {
public static void main(String[] args) {
//å©ç¨éæºæ°çæä¸ä¸ªå
å«n(n<50)个äºä½æ´æ°çæ°ç»ï¼äºä½æ´æ°çæ°ç»çæ°å¼å¨[10ï¼60]ï¼è¾åºæ°ç»ã
//并æ±åºæ大æ°åæå°æ°ï¼å¹¶æ¾ç¤ºåºç»æã
int i, n;
int[] arr;
int max, min;
Random rand = new Random();
Scanner scan = new Scanner(System.in);
while(true){
System.out.print("è¾å
¥æ°ç»å¤§å°(0<n<50)ï¼");
n = scan.nextInt();
if(n>0 && n<50){
break;
}
}
arr = new int[n];
for(i=1; i<n; i++){
arr[i] = rand.nextInt(60);
if(arr[i] < 10){
arr[i] += 10;
}
}
max = min = arr[0];
for(i=1; i<n; i++){
if(arr[i] > max){
max = arr[i];
}
else if(arr[i] < min){
min = arr[i];
}
}
System.out.println("ææäºä½æ´æ°ï¼");
for(i=1; i<=n; i++){
System.out.printf("%3d", arr[i-1]);
if(i%10==0){
System.out.println();
}
}
System.out.printf("\næ大æ°ï¼%dï¼æå°æ°ï¼%d\n", max, min);
}
}
14.
import java.util.Scanner;
public class Test33 {
public static void main(String[] args) {
int i, n;
int f1=1, f2=2;
double sum = 0;
Scanner scan = new Scanner(System.in);
while(true){
System.out.print("è¾å
¥æ°åçån项(n>0)ï¼");
n = scan.nextInt();
if(n>0){
break;
}
}
for(i=1; i<=n; i++){
sum += 1.0 * f2 / f1;
f2 = f1 + f2;
f1 = f2 - f1;
}
System.out.printf("æ°åå%d项çå = %.4f\n", n, sum);
}
}
15.
public class Test33 {
public static void main(String[] args) {
int total = 100; //æ»éé¢
int cock; //å
¬é¸¡æ°
int hen; //æ¯é¸¡æ°
int chicken; //å°é¸¡æ°
int count = 0; //æ¹æ¡æ»æ°
for(cock=0; cock<=total/5; cock++){
for(hen=0; hen<=total/3; hen++){
for(chicken=0; chicken<=total*3; chicken++){
if(cock*5+hen*3+chicken/3.0 == total){
System.out.printf("æ¹æ¡%-3d\tå
¬é¸¡ï¼%2dåªï¼æ¯é¸¡ï¼ %2dåªï¼å°é¸¡ï¼ %2dåª\n", ++count, cock, hen, chicken);
}
}
}
}
System.out.println("å
±æ" + count + "ç§è´ä¹°æ¹æ¡");
}
}
16.
public class Test33 {
public static void main(String[] args) {
int i, num, sum;
System.out.println("1000以å
ææå®æ°ï¼");
for(num=1; num<=1000; num++){
for(sum=1,i=2; i<=num/2; i++){
if(num%i == 0){
sum += i;
}
}
if(sum == num){
System.out.println(num);
}
}
}
}
17.
public class Test33 {
public static void main(String[] args) {
int total = 1000;
int a, b, c; //åä»·åå«ä¸º50ã40ã30å
ç3ç§ååçæ°é
int count = 0; //è´ä¹°æ¹æ¡æ»æ°
System.out.println("ææçè´ä¹°æ¹æ¡ï¼");
for(a=1; a<=total/50; a++){
for(b=1; b<=total/40; b++){
for(c=1; c<=total/30; c++){
if(a+b+c==30 && 50*a+40*b+30*c==total){
System.out.printf("è´ä¹°æ¹æ¡%2dï¼50å
åå %2d件ï¼40å
åå %2d件ï¼30å
åå %2d件\n", ++count, a, b, c);
}
}
}
}
System.out.printf("è´ä¹°æ¹æ¡æ»æ°%2d\n", count);
}
}
18.
/
19.
/
20.
public class Test33 {
public static void main(String[] args) {
int num;
int count = 0;
System.out.println("ææ满足æ¡ä»¶ç5ä½æ°ï¼");
for(num=10000; num<100000; num++){
if(num%10==6 && num%3==0) {
System.out.printf("No.%5dï¼%d\n", ++count, num);
}
}
System.out.printf("è¿æ ·ç5ä½æ°å
񑋬%d\n", count);
}
}
21.
public class Test33 {
public static void main(String[] args) {
int total;
for(total=1; ;total++){
if(total%2==1 && total%3==2 && total%5==4 && total%6==5 && total%7==0){
break;
}
}
System.out.println("è¿æ¡é¶æ¢¯æå°å
±æ" + total + "é¶");
}
}
22.
public class Test33 {
public static void main(String[] args) {
int num;
int a, b, c, d; //åãç¾ãåã个ä½æ°
int m;
for(num=1000; num<10000; num++){
a = num/1000;
b = num/100%10;
c = num/10%10;
d = num%10;
m = (int)Math.sqrt(num);
if(a==b && c==d && a!=c && m*m==num){
System.out.println(num);
}
}
}
}
温馨提示:答案为网友推荐,仅供参考