# 蓝桥杯刷题（入门）--java实现

/**
斐波那契数列数列，递归超时
采用数组解决。
*/
import java.util.*;
public class Main{
public static long Fib(long i) {
if(i==1)
return 1;
else if(i==2)
return 1;
else {
return (Fib(i-1)+Fib(i-2))%10007;
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int data[] = new int[N];
data[0] = 1;
if(N>1)
data[1] = 1;
for(int i=2;i<N;i++)
data[i] = (data[i-1]+data[i-2])%10007;
System.out.println(data[N-1]);

}
}
/**
注意输出格式以及常量的定义
*/
import java.util.*;
public class Main{
public static final double PI = 3.14159265358979323;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double r = sc.nextDouble();
System.out.printf("%.7f\n", r*PI*r);
}
}
/**
注意数据输入的范围
1 <= n <= 1,000,000,000。
*/
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long N = sc.nextInt();
System.out.println(N*(N+1)/2);
}
}


11-05 1875

06-03 3076
04-15 1万+
04-23 121
06-04 1万+
01-03 591
01-13 183
01-28 2539
03-06 4109