由于比较简单,就直接贴代码了
Fibonacci数列
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
int f1=1;
int f2=1;
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
for(int i=3;i<=n;i++)
{
int t=f2;
f2=(f1+f2)%10007;
f1=t;
}
System.out.println(f2);
scan.close();
}
}
圆的面积
import java.util.Scanner;
public class Main {
final static double PI=Math.atan(1.0)*4;
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
int r=scan.nextInt();
System.out.println(String.format("%.7f", PI*r*r));
scan.close();
}
}
序列求和
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
long n=scan.nextInt();
long sum=0;
for(long i=1;i<=n;i++)
{
sum+=i;
}
System.out.print(sum);
scan.close();
}
}
A+B问题
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
int a=scan.nextInt();
int b=scan.nextInt();
System.out.println(a+b);
scan.close();
}
}