“蓝桥杯”练习系统试题集入门训练

BEGIN-1 A+B问题

//输入A、B，输出A+B
#include<iostream>
using namespace std;
int main(){
	int A,B;cin >> A >> B;
	cout << A + B << endl;
	return 0;
}

BEGIN-2 序列求和

//求1+2+3+...+n的值
#include<iostream>
using namespace std;
int main(){
	long long n,sum;cin >> n;
	sum = n * (n+1) / 2;
	cout << sum << endl;
	return 0;
}

BEGIN-3 圆的面积

//给定圆的半径r，求圆的面积
#include<iostream>
#include<cmath>//用PI=atan(1.0)*4
#include<iomanip>//用cout格式化输出
using namespace std;
int main(){
	double PI = atan(1.0)*4;//Π的常量值
	int r;cin >> r;//圆的半径
	double s;//圆的面积
	s = PI * r * r;
	cout << setiosflags(ios::fixed) << setprecision(7) << s << endl;
	return 0;
}

BEGIN-4 Fibonacci数列

//Fibonacci数列的递推公式为：Fn = Fn-1 + Fn+2,其中F1 = F2 = 1
//当n比较大时，Fn也非常大，现在我们想知道，Fn除以10007的余数是多少 
#include<iostream>
#include<stdlib.h>
#define M 10007//定义宏常量M = 10007
int main(int argc,char *argv[]){
	long long a1,a2,n,fn,i;
	a1 = a2 = 1;
	scanf("%lld",&n);
	if(n <= 2) printf("%lld",a1);
	else{
		for(int i = 3;i <= n;i++){
			fn = (a1 + a2) % M;
			a1 = a2;
			a2 = fn;
		}
		printf("%lld",fn);
	}
	return 0;
}