蓝桥——入门练习(JAVA)

最新推荐文章于 2024-06-20 20:20:21 发布

倾听彼岸

最新推荐文章于 2024-06-20 20:20:21 发布

阅读量158

点赞数

分类专栏：蓝桥 Java 文章标签： java

本文链接：https://blog.csdn.net/qq_46031627/article/details/112055100

版权

Java 同时被 2 个专栏收录

11 篇文章 0 订阅

订阅专栏

蓝桥

4 篇文章 0 订阅

订阅专栏

2020年12月31日
梦幻一年的最后一天
注意细节，此处指数据类型问题

文章目录

本试题集共四道练习题如下

A+B问题

import java.util.*;
public class Main
{
    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        Integer a = sc.nextInt();
        Integer b = sc.nextInt();
        System.out.println(a + b);
    }
}

序列求和

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextInt();
        long m = 0;
        for (int i = 1;i <= n;i ++){
            m += i;
        }
        System.out.println(m);
    }
}

圆的面积

import java.util.Scanner;
public class Main{
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        double PI=Math.atan(1.0)*4;
        int r = in.nextInt();
        double area = PI*r*r;
        System.out.printf("%.7f",area);
    }
}

Fibonacci数列

全是数据类型出的问题，90分一次是忽略了n=1或2时的情况

30分答案

import java.util.Scanner;
public class Main{
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a,b,c,f;
        a=b=c=1;
        for(int i = 3;i <= n;i++){
            c = a + b;
            a = b;
            b = c;
        }
        f = c%10007;
        System.out.println(f);
    }
}

40分答案

import java.util.Scanner;
public class Main{
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long a,b,c,f;
        a=b=c=1;
        for(int i = 3;i <= n;i++){
            c = a + b;
            a = b;
            b = c;
        }
        f = c%10007;
        System.out.println(f);
    }
}

100分答案

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        fibonacci(n);
    }
    private static void fibonacci(int n) {
        int a = 1, b = 1, c = 0;
        if (n>=3) {
            for (int i = 3; i <= n; i++) {
                c = (b + a) % 10007;
                a = b;
                b = c;
            }
            System.out.println(c);
        }else{
            System.out.println(a);
        }
    }
}