WZOI 基础题库题解

入坑网站 wzoi.cc

方便大家复制不写注释了文章有亿点长，建议使用页内跳转快速找到题目

Top Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 9 Page 10 Update

个人访问了我的主页

Page 1

1.Hello World

1
2
3

int main(){
	cout << "Hello World!";
}

2.打印Hello World

1
2
3

int main(){
	cout<<"**************************\n         Very    Good!\n**************************";
}

3.默写数字

int main(){
	int n;
	cin>>n;
	cout<<n;
}

4.A+B Problem

int main(){
	int a,b,c;
	cin>>a>>b;
	cout<<a+b<<endl;
}

5.输出第二个整数

int main(){
	int a,b,c;
	cin>>a>>b>>c;
	cout<<b;
}

6.求一个数的前后两个数

int main(){
	int n,x;
	cin>>n>>x;
	cout<<n-x<<endl<<n+x<<endl;
}

7.竖式计算

int main() {
	int a,b;
	cin>>a>>b;
	printf("%10d\n%4c%6d\n-----------\n%10d",a,'+',b,a+b);
}

8.植树造林

int main(){
	int a,b;
	cin>>a>>b;
	cout<<a*b<<endl;
}

9.求自行车总价

int main(){
	int a;
	cin>>a;
	cout<<a*300;
}

10.正方形面积 Link

int n;
int main(){
	return cin>>n,cout<<n*n,0;
}

11.三位数

int main(){
	int ge,shi,bai;
	cin>>shi;
	bai=shi+1;
	ge=bai*2;
	cout<<bai<<shi<<ge;
}

12.做蛋糕

int main(){
	int a1,a2,a3,b1,b2,b3;
	cin>>a1>>a2>>a3>>b1>>b2>>b3;
	cout<<a1*b1+a2*b2+a3*b3<<endl;
}

13.计算(a+b)*c的值

int main(){
	int a,b,c;
	cin>>a>>b>>c;
	cout<<(a+b)*c;
}

14.求余数

int main(){
	int a,b;
	cin>>a>>b;
	cout<<a%b;
}

15.计算(a+b)/c的值

int main(){
	int a,b,c;
	cin>>a>>b>>c;
	cout<<(a+b)/c;
}

16.小玉买文具

int main(){
	int a,b;
	cin>>a>>b;
	cout<<(a*10+b)/19;
}

17.买苹果

int main(){
	int a,b;
	cin>>a;
	cout<<(a/3)*4+a%3;
}

18.买牛奶

int main(){
	int a,b,c,d;
	cin>>a>>b>>c>>d;
	cout<<d/a*a/b*c+(d/a);
}

19.小鱼的游泳时间

int main(){
	int a,b,c,d;
	cin>>a>>b>>c>>d;
	cout<<((c-a)*60+d-b)/60<<" "<<((c-a)*60+d-b)%60;
}

20.周长与面积

int main(){
	int a,b;
	cin>>a>>b;
	cout<<"perimeter="<<(a+b)*2<<endl<<"area="<<a*b;
}

21.求筝形面积

int main(){
	long long a,b;
	cin>>a>>b;
	cout<<a*b;
}

22.求正立方体表面积

int main(){
	int a;
	cin>>a;
	cout<<a*a*6;
}

23.输出保留3位小数的浮点数

int main(){
	double x;
	cin>>x;
	cout<<fixed<<setprecision(3)<<x;
}

24.工资

int main(){
	int x,y;
	double z;
	cin>>x>>y>>z;
	cout<<"NUMBER = "<<x<<endl<<fixed<<setprecision(2)<<"SALARY = U$ "<<y*z;
}

25.四舍五入

int main(){
	int y;
	double x;
	cin>>x>>y;
	cout<<fixed<<setprecision(y)<<x;
}

26.求梯形面积

int main(){
	double a,b,c;
	cin>>a>>b>>c;
	cout<<fixed<<setprecision(2)<<(a+b)*c/2;
}

27.梯形面积

int main(){   
	double a;
	cout<<fixed<<setprecision(2)<<160.0*2/15*(15+25)/2;
}

28.求圆柱体表面积

int main(){
	double r,h;
	cin>>r>>h;
	cout<<fixed<<setprecision(2)<<2*(3.14*r*r)+2*(3.14*r*h);
}

29.计算总成绩与平均成绩

int main(){
	double a,b,c,d;
	cin>>a>>b>>c>>d;
	cout<<fixed<<setprecision(2)<<a+b+c+d<<endl<<(a+b+c+d)/4;
}

30.新平均成绩

int main(){
	double x,score,n;
	cin>>x>>score>>n;
	cout<<fixed<<setprecision(3)<<(x*n-score)/(n-1);
}

31.歌手大奖赛

注意题目输出需要6.2lf或者setw(6)

int main(){
	double score;
	printf("%6.2lf",((9.6*6)-((9.6*12)-(9.4*5)-(9.8*5)))/4);
}

32.奇葩的饭店

int main(){
	double a,b;
	cin>>a>>b;
	cout<<fixed<<setprecision(4)<<b/(a/100);
}

33.猜数游戏

int main(){
	int x;
	cin>>x;
	cout<<(x*1000+x)/7/11/13;
}

34.求根号x的值

int main(){
	int x;
	cin>>x;
	cout<<fixed<<setprecision(3)<<sqrt(x);
}

35.求logx

int main(){
	double x;
	cin>>x;
	cout<<fixed<<setprecision(3)<<log(x)<<endl<<log10(x)<<endl<<log2(x);
}

36.求两者较大值的max函数的用法

int main(){
	char c;
	int a,b;
	cin>>a>>c>>b;
	cout<<"max="<<max(a,b);
}

37.求自行车和三轮车各是多少辆

int main(){
	int a,b;
	cin>>a>>b;
	cout<<(a*3-b)/(3-2)<<" "<<(b-a*2)/(3-2);
}

38.鸡兔同笼

int main(){
	int x,y,m,n;
	cin>>x>>y;
	cout<<(x-(y*2))/(4-2)<<" "<<((y*4)-x)/(4-2);
}

39.计算路程

int main(){
	double v,t;
	cin>>v>>t;
	cout<<fixed<<setprecision(2)<<v*t;
}

40.带余除法

int main(){
	int a,b;
	cin>>a>>b;
	cout<<a/b<<" "<<a%b;
}

41.交换门牌号

int main(){
	int s;
	cin>>s;
	cout<<s%10<<s/10;
}

42.密码

int main(){
	long long m,s=1,i;
	cin>>m;
	for(i=m;i>m-3;i--)s*=i;
	cout<<s;
}

43.浮点数向零舍入

int main(){
	double n;
	cin>>n;
	cout<<int(n);
}

44.计算浮点数相除的余数

int main(){
	double a,b;
	cin>>a>>b;
	cout<<fixed<<setprecision(4)<<a-b*int(a/b);
}

45.整型数据类型存储空间大小

int main(){
	long long a;
	int b;
	short c;
	cout<<sizeof(a)<<" "<<sizeof(b)<<" "<<sizeof(c);
}

46.浮点型数据类型存储空间大小

int main(){
	float a;
	double b;
	cout<<sizeof(a)<<" "<<sizeof(b);
}

47.其他基本数据类型存储空间大小

int main(){
	bool a;
	char b;
	cout<<sizeof(a)<<" "<<sizeof(c);
}

48.空格分隔输出

int main(){
	char a;	int b;	float c;	double d;
	cin>>a>>b>>c>>d;
	cout<<fixed<<setprecision(6)<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
}

49.整型与布尔型的转换

int main(){
	int a;	bool b;
	cin>>a;
	cout<<int(bool(a));
}

50.字符三角形

int main(){
	char a;
	cin>>a;
	cout<<"  "<<a<<endl<<" "<<a<<a<<a<<endl<<a<<a<<a<<a<<a<<endl;
}

51.字符菱形

int main(){
	char a;
	cin>>a;
	cout<<"  "<<a<<endl<<" "<<a<<a<<a<<endl<<a<<a<<a<<a<<a<<endl<<" "<<a<<a<<a<<endl<<"  "<<a<<endl;
}

52.读取单个字符的getchar()函数

int main(){
	char c;
	c=getchar();
	cout<<c<<endl;
}

53.打印ASCII码

int main(){
	char a;
	cin>>a;
	cout<<int(a);
}

54.打印字符

int main(){
	int b;
	cin>>b;
	cout<<char(b);
}

55.大写字母转小写字母

int main(){
	char a;
	cin>>a;
	cout<<char(a+32);
}

56.特殊输出

int main(){
	int a,b;
	cin>>a>>b;
	printf("%*d\n%0*d\n%-*d\n",b,a,b,a,b,a);
}

57.特殊输出2

int main(){
	double a;
	int b;
	cin>>a>>b;
	printf("%*.3lf\n%0*.3lf\n%-*.3lf\n",b,a,b,a,b,a);
}

58.字符变换

int main(){
	char c1,c2,c3;
	int a1,a2,a3;
	cin>>c1>>c2>>c3>>a1>>a2>>a3;
	cout<<char(c1+pow(2,a1))<<" "<<char(c2+pow(2,a2))<<" "<<char(c3+pow(2,a3))<<" ";
}

59.加密算法

int main(){
	char a;
	cin>>a;
	cout<<char(122-a+97);
}

60.甲流疫情死亡率

int main(){
	double a,b;
	cin>>a>>b;
	cout<<fixed<<setprecision(3)<<b/(a/100)<<"%";
}

61.计算多项式的值

int main(){
	double a,b,c,d,x;
	cin>>x>>a>>b>>c>>d;
		cout<<fixed<<setprecision(7)<<a*x*x*x+b*x*x+c*x+d;
}

62.数列取数

int main(){
	long long a,b,c;
	cin>>a>>b>>c;
	cout<<a*2+b*4+c*8;
}

63.填充矩形

int main(){
	int n,m,a,b,c;
	cin>>n>>m>>a;
	cout<<int(n/a)*int(m/a);
}

64.大象喝水

int main(){
	int h,r;
	cin>>h>>r;
	cout<<ceil(20000/(3.14159*r*r*h));
}

65.求等差为3的数列

int main(){
	int a;
	cin>>a;
	cout<<(2+(a-1)*3+2)*a/2;
}

66.等差数列末项计算

int main(){
	int a,b,c;
	cin>>a>>b>>c;
	cout<<(b-a)*(c-1)+a;
}

67.计算线段长度

int main(){
	int Xa,Ya,Xb,Yb;
	double a;
	cin>>Xa>>Ya>>Xb>>Yb;
	cout<<fixed<<setprecision(3)<<double(abs(sqrt((Xb-Xa)*(Xb-Xa)+(Yb-Ya)*(Yb-Ya))));
}

68.计算折线长度

int main(){
	double Xa,Ya,Xb,Yb,Xc,Yc,a=0;
	cin>>Xa>>Ya>>Xb>>Yb>>Xc>>Yc;
	a+=sqrt(abs((0-Xa)*(0-Xa)+(0-Ya)*(0-Ya)));
	a+=sqrt(abs((Xb-Xa)*(Xb-Xa)+(Yb-Ya)*(Yb-Ya)));
	a+=sqrt(abs((Xc-Xb)*(Xc-Xb)+(Yc-Yb)*(Yc-Yb)));
	cout<<fixed<<setprecision(5)<<a;
}

69.送午饭

int main(){
	int x1,y1,x2,y2,h,v;
	double a=0;
	cin>>h>>v>>x1>>y1>>x2>>y2;
	a+=abs(sqrt((x1-0)*(x1-0)+(y1-0)*(y1-0)));
	a+=abs(sqrt((x2-0)*(x2-0)+(y2-0)*(y2-0)));
	a+=h;`a/=v;
	cout<<fixed<<setprecision(2)<<a;
}

70.计算曼哈顿距离

int main(){
	double x1,y1,x2,y2,a=0;
	cin>>x1>>y1>>x2>>y2;
	a=abs(x1-x2)+abs(y1-y2);
	cout<<fixed<<setprecision(3)<<abs(x1-x2)+abs(y1-y2);
}

71.计算球的体积

int main(){
	double x;
	cin>>x;
	cout<<fixed<<setprecision(2)<<4.0/3*3.14*x*x*x;
}

72.计算并联电阻的阻值

int main(){
	double r1,r2;
	cin>>r1>>r2; 
	cout<<fixed<<setprecision(2)<<1/(1/r1+1/r2);
}

73.求面积差

寻求老师的帮忙……

1
2
3

int main() {
	cout<<0.1642;
}

74.整数反转

第40题的加强版

int main(){
	char a,b,c;
	cin>>a>>b>>c; 
	cout<<c<<b<<a;
}

75.变量交换

swap()函数

int main(){
	int a,b;
	cin>>a>>b;
	swap(a,b);
	cout<<a<<" "<<b;
}

76.交换三个字符并输出

int main(){
	char a,b,c;
	cin>>a>>b>>c;
	cout<<c<<b<<a;
}

77.计算塔高

寻求老师的帮助……

int main(){
	double l,a,b,m;
	const double PI=3.14159;
	cin>>l>>a>>b;
	a=a/180*PI;
	b=b/180*PI;
	m=l/(1/tan(b)-1/tan(a));
	printf("%.3f", m);
}

78.判断奇偶

int main(){
	int a;
	cin>>a;
	if(a%2==0)cout<<"even";
	else cout<<"odd";
}

79.判断是否被5整除

int main(){
	int a,b,c;
	cin>>a>>b>>c;
	if(a%5==0 && b%5==0 && c%5==0)cout<<"Y es.";
	else cout<<"No_";
}

80.判断一个数能否同时被3和5整除

int main(){
	int n;
	cin>>n;
	if(n%5==0&&n%3==0)cout<<"YES";
	else cout<<"NO";
}

81.打车费用

int main() {
	double lucheng,shijian,feiyong=0;
	cin>>lucheng>>shijian;
	if(lucheng>10)feiyong=11+(10-2)*1.8+(lucheng-10)*1.8*1.5;
	else if(lucheng>2)feiyong=11+(lucheng-2)*1.8;
	else feiyong=11;
	feiyong+=int(shijian/3);
	cout<<fixed<<setprecision(1)<<feiyong;
}

82.登录程序

int main(){   
	int username=0,password=0;
	cin>>username>>password;
	if(username==202201)
		if(password==123456)cout<<"welcome!";
		else cout<<"wrong password!"; 
	else cout<<"wrong user!";
}

83.旅游景点

int main(){
	double m;
	cin>>m;
	if(m<1.2) cout<<"free";
	else if(m>=1.2 && m<=1.5) cout<<"half-price ticket";
	else if(m>1.5) cout<<"full ticket";
}

84.小明学编程

int main(){
	int day;	char s;
	cin>>day>>s;
	if(day==3&&s=='N'||day==6&&s=='N')puts("Happy");
	else puts("Sad");
	return 0;
}

85.字符判断

char c;
signed main(){
	scanf("%c",&c);
	if(isupper(c))puts("capital");
	else if(islower(c))puts("lowercase");
	else if(isdigit(c))puts("number");
	else puts("others");
	return 0;
}

86.判断超速

int main(){   
    double s,t;
    cin>>s>>t;
    if(3600/t*s>=100) cout<<fixed<<setprecision(2)<<"yes"<<endl<<3600/t*s;
    else cout<<"no";
}

87.区间测速

int main(){   
    double s,t;
    cin>>s>>t;
    if(3600/t*s>=100){
      cout<<fixed<<setprecision(2);
      if(3600/t*s>100 && 3600/t*s<120) cout<<"<20%";
      else if(3600/t*s>=120 && 3600/t*s<150) cout<<"<50%";
      else if(3600/t*s>=150 && 3600/t*s<170) cout<<"<70%";
      else if(3600/t*s>=170) cout<<">=70%";
      cout<<endl<<3600/t*s;
    }
    else cout<<"no";
}

88.收集瓶盖赢大奖

int main(){
	int a,b;
	cin>>a>>b;
	cout<<(a>=10||b>=20);
	return 0;
}//by jcf666

89.判断闰年

int main(){   
    int nian;
    cin>>nian;
    if(nian%4==0&&nian%100||nian%400==0) cout<<"Y";
    else cout<<"N";
}

90.奇偶ASCII值判断

int main(){   
    char a;
    cin>>a;
    if(int(a)%2==0)cout<<"NO";
    else cout<<"YES";
}

91.整数大小比较

int main(){   
    long long a,b;
    cin>>a>>b;
    if(a>b) cout<<">";
    else if(a==b) cout<<"=";
    else if(a<b) cout<<"<";
}

88.判断是否为两位数

int main(){   
    long long a;
    cin>>a;
    cout<<a>=10&&a<=99;
}

92.判断是否为两位数

int main(){   
	long long a;
	cin>>a;
	if(a>=10 && a<=99)cout<<"1";
	else cout<<"0";
}

93.测量体温

int main(){
	double t;
	cin>>t;
	if(t>=36.5 && t<=37.5) cout<<"Yes";
	else cout<<"No";
}

94.奇数偶数

int main(){
	int a;
	cin>>a;
	if(a%2==0)cout<<a-1;
	else cout<<a*2;
}

95.小明当考官

int main(){
	int a,c,d,sum;
	char b;
	cin>>a>>b>>c>>d;
	switch(b){
		case '+':sum=a+c;break;
		case '-':sum=a-c;break;
		case '*':sum=a*c;break;
		case '/':sum=a/c;break;
		case '%':sum=a%c;break;
	}
	if(sum==d)cout<<"right";
	else cout<<sum;
}//by jcf666

96.个税改革

double a,b,sum,tax;
int main(){
	cin>>a>>b;
	sum=a-b-5000;
	if(sum<=0)tax=0;
	else if(sum<=1500)tax=sum*0.03;
	else if(sum<=4500)tax=sum*0.1-105;
	else if(sum<=9000)tax=sum*0.2-555;
	else if(sum<=35000)tax=sum*0.25-1005;
	else if(sum<=55000)tax=sum*0.3-2755;
	else if(sum<=80000)tax=sum*0.35-5505;
	else tax=sum*0.45-13505;
	printf("%.2lf",tax);
}

97.计算BMI指数

int main(){
	int kg;
	double m,BMI;
	cin>>kg>>m;
	BMI=kg/m/m;
	if(BMI<18.5) cout<<"thin!";
	else if(BMI>=18.5&&BMI<=25) cout<<"normal!";
	else cout<<"fat!";
}

98.运动打卡

int main(){
	int h;
	cin>>h;
	if(h<0) cout<<"error!";
	else if(h<30) cout<<"0";
	else if(h<45) cout<<"300";
	else if(h<60) cout<<"450";
	else cout<<"500";
}

99.刷电视剧

int n,m,num,sum=46,ans;
int main(){
	cin>>n>>m,num=n*60;
	while(1){
		if(sum<=0)break;
		ans++,sum-=num/m;
	} cout<<ans; return 0;
}

100.21点扑克牌之策略

int a,sum;
int main(){
	for(int i=0;i<5;i++){
		cin>>a,sum+=a;
		if(sum>21){
			cout<<"Bomb";	break;
		} else if(sum>=16){
			cout<<sum;	break;
		}
	} if(sum<16)cout<<sum;
	return 0;
}//by jcf666

Page 2

101.星期几

int main(){
	int h;
	cin>>h;
	if(h<1||h>7)cout<<"input error!";
	else if(h==1) cout<<"Monday";
	else if(h==2) cout<<"Tuesday";
	else if(h==3) cout<<"Wednesday";
	else if(h==4) cout<<"Thursday";
	else if(h==5) cout<<"Friday";
	else if(h==6) cout<<"Saturday";
	else cout<<"Sunday";
}

102.晶晶赴约会

int main(){
	int d;
	cin>>d;
	if(d==1||d==3||d==5)cout<<"NO";
	else cout<<"YES";
}

103.买铅笔

int main() {
	int a1,a2,b1,b2,c1,c2,am,bm,cm;
	double n;
	cin>>n>>a1>>a2>>b1>>b2>>c1>>c2;
	am=ceil(n/a1)*a2;
	bm=ceil(n/b1)*b2;
	cm=ceil(n/c1)*c2;
	cout<<min(min(am,bm),cm);
}

104.过山车

int main(){
	int h1,h2,a,b,c,x=0;
	cin>>h1>>h2>>a>>b>>c;
	if(a<h1 && a>h2)x++;
	if(b<h1 && b>h2)x++;
	if(c<h1 && c>h2)x++;
	if(x)cout<<x;
	else cout<<-1;
}

105.拯救暴风城

int main(){
	int n,x,m;
	cin>>n>>x>>m;
	if(x*m>=n) cout<<"juruo pks!";
	else cout<<"ruoji cchuan!";
}

106.次方比较

int main(){
	int a,b,c;
	cin>>a>>b>>c;
	if(pow(a,b)<c) cout<<"Pks dalao!";
	else if(pow(a,b)==c) cout<<"pKs dalao!!";
	else cout<<"pkS dalao!!!";
}

107.托运价格

int main(){
	double w,a,b;
	scanf("%lf,%lf",&w,&a); 
	w*=1000;
	if(w==0)b=0;
	else if(w<=10)b=2.33;
	else if(w>10)b=2.33+(w-10)*1.165;
	cout<<fixed<<setprecision(3)<<b<<endl<<a-b;
}

108.计算甜甜圈面积

int main(){
	long double a,R,r;
	cin>>R>>r;
	if(R<=r)cout<<0;
	else cout<<fixed<<setprecision(11)<<3.14159265359*(pow(R,2)-pow(r,2));
}

109.苹果和虫子

int main() {
	int n,x,y,b;
	cin>>n>>x>>y;
	b=y/x;
	if(y%x!=0)b+=1;
	if(n-b<0)b=n;
	cout<<n-b;
}

110.计算比例

int main(){
	double a,na,b,nb,c,nc,x,y;
	cin>>a>>na>>b>>nb>>c>>nc;
	x=(na-a)/a,y=(na-a+nb/(1+b)*b+c)/(a+nb/(1+b)+nc-c);
	if (x>=y)printf("%.2f",x-y);
	else cout<<"tan90";
}

111.选举

int main() {
	int n,m,a=0,b=0;
	for(int i=0;i<4;i++)
		cin>>n>>m,a+=n,b+=m;
	if(a>b)cout<<"qindingla!";
	else cout<<"too naive!";
}

112.说谎

int main(){
	bool a,b,c,d,a1,a2,a3,a4;
	cin>>a>>b>>c>>d,a4=1;
	if(a4==d)a3=1;
	else a3=0;
	if(a3==c)a2=1;
	else a2=0;
	if(a2==b)a1=1;
	else a1=0;
	cout<<a1<<" "<<a2<<" "<<a3<<" "<<a4;
}

113.装修

int main(){
	int n,m,k;
	cin>>n>>m>>k;
	if(m<k)cout<<m*n;
	else cout<<k*n;
}

114.英雄战士

int main() {
	int a,b,m,h;
	cin>>a>>b>>m>>h;
	if(min(h,m)>=min(a,b))cout<<"terrorist win";
	else cout<<"counter terrorist win";
}

115.追赶问题

int main(){
	int v1,v2;
    double x,t;
    cin>>x>>v1>>v2>>t;
    cout<<fixed<<setprecision(2);
    if(x/(v1-v2)<t)cout<<"Yes"<<" "<<x/(v1-v2);
    else cout<<"No";
}

116.撕票

int main(){
	long long time,ph,n,i;
	cin>>time>>ph>>n;
	if(n*time>ph)cout<<"\"PKS has been killed!\"";
	else cout<<"\"You have been killed by PKS!\"";
}

117.四叶玫瑰

int main() {
	int ge,shi,bai,qian,shu;
	cin>>shu;
	qian=shu/1000,bai=(shu/10)%10,shi=(shu/100)%10,ge=shu%10;
	if(pow(qian,4)+pow(bai,4)+pow(shi,4)+pow(ge,4)==shu)cout<<"yes";
	else cout<<"no";
}

118.判断分数

int main(){ 
	long long n,m,a,x,b,y;
	cin>>n>>m>>a>>x>>b>>y;
	if(a==x/m&&b==y/m)cout<<2333;
	else cout<<((abs(a-x/m)>abs(b-y/m))?abs(a-x/m)*m:abs(b-y/m)*m);
}

119.天命数

int main(){
	long long k,n,m,shu;
	cin>>n>>m>>k;
	if(k==1)shu=max(n,m)/min(n,m);
	if(k==2)shu=n+m;
	if(k==3)shu=(max(n,m)/min(n,m)*(n+m))/max(n,m)%min(n,m);
	if(shu==0)cout<<"cangtianyisi,huangtiandangli";
	else cout<<shu;
}

120.分段函数

int main(){
	int x;
	cin>>x;
	if(x>0)cout<<1<<endl;
	else if(x==0)cout<<0<<endl;
	else if(x<0)cout<<-1<<endl;
}

121.商场折扣

int main() {
	double x;
	cin>>x;
	cout<<fixed<<setprecision(2);
	if(x<250)cout<<x;
	if(x>=250 && x<500)cout<<x*0.95;
	if(x>=500 && x<1000)cout<<x*0.9;
	if(x>=1000 && x<2000)cout<<x*0.85;
	if(x>=2000)cout<<x*0.8;
}

122.成绩评定

int main() {
	int a;
	cin>>a;
	if(a>=85)cout<<"A";
	else if(a>=60&&a<85)cout<<"P";
	else cout<<"E";
}

123.求方程的解(简化版)

int main() {
	double x1,x2,A,B,C,disc;
	cin>>A>>B>>C;
	disc=B*B-4*A*C;
	if(disc>0)
		x1=(-B+sqrt(disc))/(2*A),x2=(-B-sqrt(disc))/(2*A),
		cout<<fixed<<setprecision(2),
		cout<<max(x1,x2)<<" "<<min(x1,x2)<<endl;
}

124.求直角梯形最长对角线

int main() {
	long double a,b,c,d,e;
	cin>>a>>b>>c;
	d=max(a,b),e=sqrt(d*d+c*c);
	cout<<fixed<<setprecision(1)<<e;
}

125.重组最大数

int main() {
	int x,a,b,c;
	cin>>x;
	a=x/100,b=(x/10)%10,c=x%10;
	for(x=0;x<2;x++){
		if(b>a)swap(a,b);
		if(c>b)swap(b,c);
	} cout<<a<<b<<c;
}

126.求三角形面积

int main() {
	double a,b,c,p,s;
	cin>>a>>b>>c;
	if(a+b>c&&a+c>b&&b+c>a) {
		p=(a+b+c)/2,
		s=sqrt(p*(p-a)*(p-b)*(p-c)),
		cout<<fixed<<setprecision(2)<<s;
	}else cout<<"Can't";
}

127.计算邮件收费

int main() {
	double kg,sum=0;
	cin>>kg;
	if(kg>1) sum=1.5+(kg-1)*0.8;
	else sum=1.5*kg;
	cout<<fixed<<setprecision(2)<<sum;
}

128.称号

int main() {
	int n;
	cin>>n;
	if(n>=0 && n<3)n=2;
	switch(n){
		case 2: cout<<"You are a Foolish Man."; break;
		case 3: cout<<"You are on a Killing Spree."; break;
		case 4: cout<<"You are Dominating."; break;
		case 5: cout<<"You have a Mega-Kill."; break;
		case 6: cout<<"You are Unstoppable."; break;
		case 7: cout<<"You are Wicked Sick."; break;
		case 8: cout<<"You have a M-m-m-m....Monster Kill."; break;
		case 9: cout<<"You are Godlike."; break;
		default: cout<<"You are Beyond Godlike (Somebody kill him!).";
	}
}

129.有一门课不及格的学生

int main(){
	int a,b;
	cin>>a>>b;
	cout<<int(a<60&&b>=60||a>=60&&b<60);
}

130.计算火柴棒个数

int main() {
	int x;
	cin>>x;
	switch(x){
		case 0: cout<<"6"; break;
		case 1: cout<<"2"; break;
		case 2: cout<<"5"; break;
		case 3: cout<<"5"; break;
		case 4: cout<<"4"; break;
		case 5: cout<<"5"; break;
		case 6: cout<<"6"; break;
		case 7: cout<<"3"; break;
		case 8: cout<<"7"; break;
		default:cout<<"6";
	}
}

131.最大数输出

int main(){
	int a,b,c,d;
	cin>>a>>b>>c;
    d=max(a,b);
    d=max(d,c);
    cout<<d;
}

132.点和正方形的关系

int main(){
	int x,y;
	cin>>x>>y;
	if(x<=1 && x>=-1 && y<=1 && y>=-1)cout<<"yes";
	else cout<<"no";
}

133.三角形判断

int main(){
	int a,b,c,d;
	cin>>a>>b>>c;
    if(a+b>c && a+c>b && b+c>a)cout<<"yes";
    else cout<<"no";
}

134.识别三角形

int main(){
	int a,b,c,d;
	cin>>a>>b>>c;
	if(a+b<=c || a+c<=b || b+c<=a)cout<<"NO";
  	else if(a==b && b==c)cout<<"Equilateral";
	else if(a==b&&a!=c || a==c&&a!=b || b==c&&c!=a)cout<<"Isosceles";
	else if(pow(a,2)+pow(b,2)==pow(c,2) || pow(a,2)+pow(c,2)==pow(b,2) || pow(b,2)+pow(c,2)==pow(a,2))cout<<"Right";
	else cout<<"General";
}

135.骑车与走路

int main(){
	double a,b,c;
	cin>>a;
	b=a/3.0+27+30;
	c=a/1.2;
	if(b>c)cout<<"Walk";
	else cout<<"Bike";
}

136.分段函数

int main(){
	double x,y;
	cin>>x;
	if(x<5 && x>=0)y=-x+2.5;
	else if(x>=5 && x<10)y=2-1.5*(x-3)*(x-3);
	else y=x/2-1.5;
	cout<<fixed<<setprecision(3)<<y;
}

137.简单算术表达式求值

int main(){
	long long a,b;
	char c;
	cin>>a>>c>>b;
	if(c=='+')cout<<a+b;
	if(c=='-')cout<<a-b;
	if(c=='*')cout<<a*b;
	if(c=='/')cout<<a/b;
	if(c=='%')cout<<a%b;
}

138.计算器（简易版）

int main(){
	long long a,b;
	char c;
	cin>>a>>b;
	cin>>c;
	if(c=='/' && b==0)
	  cout<<"Error!";
	else {
		if(c=='+')cout<<a+b;
		if(c=='-')cout<<a-b;
		if(c=='*')cout<<a*b;
		if(c=='/')cout<<a/b;
	}
}

139.贪吃的代价

int main() {
	int n,a,b,a1=0,b1=0;
	cin>>n>>a>>b;
	if(n/min(a,b)==n/max(a,b)){
		if(max(a,b)==a)a1=n/a;
		else b1=n/a;
		cout<<a1<<" "<<b1,exit(0);
	}else if(min(a,b)==a)a1=n/a;
	else b1=n/b;
	while(1) {
		if(n-(a1*a+b1*b)>=abs(a-b)){
			if(min(a,b)==a && a1>0)
				a1--,b1++;
			else if(min(a,b)==b && b1>0)
				b1--,a1++;
		} else cout<<a1<<" "<<b1,exit(0);
	}
}

140.求一元二次方程的根

int main(){
	double a,b,c,x,y;
	scanf("%lf%lf%lf",&a,&b,&c);
	x=(-b+sqrt(b*b-4*a*c))/(2*a);
	y=(-b-sqrt(b*b-4*a*c))/(2*a);
	cout<<fixed<<setprecision(5);
	if(x==y)printf("x1=x2=%.5lf",x);
	else if(x>y)printf("x1=%.5lf;x2=%.5lf",x,y);
	else if(b==0)cout<<"x1="<<b/(2*a)<<'+'<<sqrt(4*a*c-b*b)/(2*a),
	cout<<"i;x2="<<b/(2*a)<<"-"<<sqrt(4*a*c-b*b)/(2*a)<<"i"<<endl;
	else cout<<"x1="<<-b/(2*a)<<'+'<<sqrt(4*a*c-b*b)/(2*a),
	cout<<"i;x2="<<-b/(2*a)<<"-"<<sqrt(4*a*c-b*b)/(2*a)<<"i"<<endl;
	return 0;
}

141.基本运算1

int main(){
	int a;
	cin>>a;
	cout<<a-2<<endl;
}

142.基本运算2

int main(){
	int a;
	cin>>a;
	cout<<a*(2+3)<<endl;
}

143.基本运算3

int main(){
	int a,n;
	cin>>a>>n;
	cout<<a%(n%=2)<<endl;
}

144.基本运算4

int main(){
	int a;
	cin>>a;
	a+=a-=a*=a;
	cout<<a<<endl;
}

145.老狼老狼几点了？

int main(){
	for(int i=1;i<=12;i++)
		cout<<"What time is it, old wolf? "<<i<<" o'clock."<<endl;
}

146.叮叮当当

int main(){
	int a,b;
	cin>>a>>b;
	for(int i=a;i<=b;i++){
		if(i%2==0&&i%3==0)cout<<i<<": ding ding,dang dang"<<endl;
		else{
			if(i%2==0)cout<<i<<": ding ding"<<endl;
			if(i%3==0)cout<<i<<": dang dang"<<endl;
		}
	}
}

147.计算运动消耗量

int main(){
	int a,b,c;
	cin>>c;
	for(int i=0;i<c;i++)
		cin>>a,b+=a;
	cout<<b;
}

148.ZZQ的难题

int main(){
	long long n;
	cin>>n;
	n=pow(2,n);
	cout<<n;
}

149.1到n的累加和

int main(){
	int n,a;
	cin>>n;
	for(int i=1;i<=n;i++)a+=i;
	cout<<a;
}

150.求阶乘n!

int main(){
	long long n,a=1;
	cin>>n;
	for(int i=1;i<=n;i++)a*=i;
	if(n==0)a=1;
	cout<<a;
}

151.小明存钱

int main(){
	int a,b,c;
	cin>>c;
	for(int i=0;i<c;++i)
		cin>>a,b+=a;
	cout<<b;
}

152.求平均年龄

int main(){
	int a,c;
	double b;
	cin>>c;
	for(int i=0; i<c; i++) {
		cin>>a;	b+=a;
	} cout<<fixed<<setprecision(2)<<b/c;
}

153.财务管理

int main(){
	double a,b;
	for(int i=0;i<12;i++){
		cin>>a;	b+=a;
	} cout<<fixed<<setprecision(2)<<"$"<<b/12;
}

154.均值

int main(){
	int c;
	double a,b;
	cin>>c;
	for(int i=0;i<c;i++) {
		cin>>a;	b+=a;
	} cout<<fixed<<setprecision(4)<<b/c;
}

155.求整数的和与均值

int main() {
	int a,c;
	double b;
	cin>>c;
	for(int i=0;i<c;i++) {
		cin>>a;	b+=a;
	} cout<<b<<" "<<fixed<<setprecision(5)<<b/c;
}

156.温度转换

int main() {
	double a,b;
	cin>>a>>b;
	if(a<b) {
		for(int i=a;i<=b;i+=2){
			cout<<i<<" "<<fixed<<setprecision(1)<<9*i/5.0+32<<endl;
		}
	} else {
		for(int i=b; i<=a; i=i+2) {
			cout<<i<<" "<<fixed<<setprecision(1)<<9*i/5.0+32<<endl;
		}
	}
}

157.最高的分数

int main() {
	int a,b,c;
	cin>>c;
	for(int i=0;i<c;i++){
		cin>>a;	b=max(a,b);
	} cout<<b;
}

158.求最大值和最小值

int main() {
	int a,b,c,d;
	cin>>c;
	for(int i=0;i<c;i++){
		cin>>a;
		b=max(a,b);
		d=min(a,d);
	} cout<<b<<" "<<d;
}

159.整数序列的元素最大跨度值

int main() {
	int a,b,c,d=100000000;
	cin>>c;
	for(int i=0;i<c;i++){
		cin>>a;
		b=max(a,b);
		d=min(a,d);
	} cout<<b-d;
}

160.一个字符三角形

char c;
int main(){
	scanf("%c",&c);
	for(int i=6;i+1;--i){
		for(int j=1;j<=(7-i)*2-1;++j)printf("%c",c);
		puts("");
	} return 0;
}

161.小明买香蕉

int a,b,sum;
int main(){
	cin>>a;
	for(int i=0;i<a;i++){
		cin>>b;
		if(b<20&&b%6==0||b<20&&b%7==0)sum++;
	}
	cout<<sum;
}//by jcf666

162.多边形内角和

int main() {
	int a,b,c;
	cin>>c;
	for(int i=1;i<c;i++)
		cin>>a,	b+=a;
	cout<<(c-2)*180-b;
}

163.奇数求和

int main(){
	int a,b,c=0;
	cin>>a>>b;
	for(int i=a;i<=b;i++)
		if(i%2==1)c+=i;
	cout<<c;
}

164.满足条件的数累加

int main(){
	int a,b,c=0;
	cin>>a>>b;
	for(int i=a;i<=b;i++)
		if(i%17==0)c+=i;
	cout<<c;
}

165.统计数字

int main(){
	char x;
	int a,b,c=0;
	cin>>x>>a>>x>>b>>x;
	for(int i=a;i<=b;i++)
		if(i%10==6&&i%3==0)c++;
	cout<<c;
}

166.整数的个数

int main(){
	int a,b,c,s1=0,s5=0,s10=0;
	cin>>c;
	for(int i=0;i<c;i++) {
		cin>>a;
		if(a==1)s1++;
		if(a==5)s5++;
		if(a==10)s10++;
	} cout<<s1<<endl<<s5<<endl<<s10;
}

167.与指定数字相同的数的个数

int main(){
	int n,m,a,m1=0;
	cin>>n>>m;
	for(int i=0;i<n;i++) {
		cin>>a;
		if(a==m)m1++;
	} cout<<m1;
}

168.与众不同的那个数

int n,a[10005],one[2],zero[2];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]&1)one[0]++,one[1]=i;
		else zero[0]++,zero[1]=i;
	} if(one[0]==1)cout<<one[1];
	else cout<<zero[1];
}//by jcf666

169.统计期中成绩

170.乘方计算

int main() {
	int a,n;
	long long b=1;
	cin>>a>>n;
	for(int i=0;i<n;i++)b*=a;
	cout<<b;
}

171.完全平方数

int main() {
	int x,y,n;
	for(n=-100; n<10000; n++) {
		x=int(sqrt(100+n));
		y=int(sqrt(100+168+n));
		if(100+n==x*x && 100+168+n==y*y)
			cout<<n<<endl;
	}
}

172.计算组合数

int main() {
	long double a=1,b=1,c=1,d,n,m;
	cin>>n>>m;
	for(int i=n;i>n-m;i--)a*=i;
	for(int i=1;i<=m;i++)b*=i;
	cout<<fixed<<setprecision(0)<<a/b;
}

173.求西格玛 $(\sum)$ 累加和

int main(){
	double a=0;
	for(int i=1;i<=100;++i)a+=i;
	for(int i=1;i<=50;++i)a+=i*i;
	for(int i=1;i<=10;++i)a+=1.0/i;
	printf("%.4lf",a);
}

174.奥运奖牌计数

int main(){
	int a,b,c,d,a1=0,b1=0,c1=0;
	cin>>d;
	for(int i=0;i<d;i++) {
		cin>>a>>b>>c;
		a1+=a;	b1+=b;	c1+=c;
	} cout<<a1<<" "<<b1<<" "<<c1<<" "<<a1+b1+c1;
}

175.地狱飞龙

int main(){
	long long x,y;	char a;
	cin>>x>>a>>y;
	for(int i=0;i<x;i++) y*=2;
	cout<<y;
}

176.人口增长问题

int main(){
	int x,n;
	double c;
	cin>>x>>n,c=x;
	for(int i=0;i<n;i++)c*=1.001;
	cout<<fixed<<setprecision(4)<<c;
}

177.银行利息

int main(){
	double R,M,Y,yuan;
	int a;
	cin>>R>>M>>Y;
	yuan=M;
	for(int i=0;i<Y;i++)
		yuan+=yuan*(R/100);
	cout<<int(yuan);
}

178.小明买口罩

int a,b,c,max=-1;
int main(){
	cin>>a>>b>>c;
	for(int i=1;i<=100/a;i++)
		for(int j=1;j<=100/b;j++)
			for(int k=1;k<=100/c;k++)
				if(a*i+b*j+c*k==100&&i+j+k>max)max=i+j+k;
	cout<<max;
}//by jcf666

179.菲波那契数列

int main(){
	int a,b,c,k;
	cin>>k,a=1,b=1;
	for(int i=0;i<k-2;i++)
		c=a+b,a=b,b=c;
	cout<<c;
}

180.鸡尾酒疗法

int main(){
	int n,a,b;
	double s1,sn;
	cin>>n;
	cin>>a>>b;
	s1=b/(a*1.00);
	for(int i=1;i<n;i++){
		cin>>a>>b;
		sn=b/(a*1.00);
		if ((sn-0.05)>s1)cout<<"better"<<endl;
		else if ((s1-0.05)>sn)cout<<"worse"<<endl;
		else cout<<"same"<<endl;
	} return 0;
}

181.救援

double t,x,y;
int main(){
	int a,r;
	cin>>a;
	for(int i=0;i<a;i++){
		cin>>x>>y>>r;
		t+=sqrt(y*y+x*x)/50.0*2;
		for(int i=0;i<r;i++)
			t+=1+0.5;
	} cout<<ceil(t);
}

182.买房子

int main(){
	double n,k,m,f=200;
	cin>>n>>k,m=n;
	for(int i=1;i<=20;i++){
		f*=k/100+1,m+=n;
		if(m>f)cout<<i+1,exit(0);
	} cout<<"Impossible";
}

183.球弹跳高度的计算

int main() {
	double a,b,m;
	cin>>m,b=m;
	for(int i=0;i<10;i++)
		a+=b*2,b=b/2;
	a-=m;
	cout<<fixed<<setprecision(6)<<a<<endl<<b;
}

184.津津的储蓄计划

int c,s,h;
int main(){
	for(int i=1;i<=12;i++){
		cin>>c;
		s-=c-300;
		if(s<0){
			cout<<-1*i;
			return 0;
		} else h+=s/100;s%=100;
	} cout<<120*h+s;
}

185.药房管理

int n,m,s,sum;
int main(){
	cin>>m>>n;
	for(int i=1;i<=n;i++){
		cin>>s;
		if(s>m)sum++;
		else m-=s;
	} cout<<sum;
}

186.正常血压

int n,g,d,sum,maxn;
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>g>>d;
		if(g<=140&&g>=90&&d>=60&&d<=90)sum++;
		else sum=0;
		maxn=max(maxn,sum);
	} cout<<maxn;
}

187.求特殊自然数

1
2
3

int main(){
	cout<<248<<endl<<503<<endl<<305;
}

188.统计满足条件的4位数个数

int main(){
	int a,b,c;
	cin>>a;
	for(int i=0;i<a;i++)
		cin>>b,c+=(b%10-b/1000-b/100%10-b/10%10>0);
	cout<<c;
}

189.分类求和

int x,a,b,c,d;
int main(){
	while(cin>>x){
		if(x>0)a++,c+=x;
		if(x<0)b++,d+=x;
	} cout<<a<<" "<<b<<" "<<c<<" "<<d;
}

190.分离整数的各个数位

char a[10];
int i;
int main() {
	cin.get(a,9);
	while(a[i]!='\0')i++;	i--;
	for(;i>=0;i--)cout<<a[i]<<" ";
}

191.数字之和

char a[12];
int main() {
	int sum;
	cin.get(a,11);
	for(int i=0;a[i]!='\0';i++)
		if(a[i]>'0'&&a[i]<='9')sum+=a[i]-'0';
	cout<<sum;
}

192.数字反转

int n,s;
int main(){
	for(cin>>n;n;n/=10)s*=10,s+=n%10;
	cout<<s;
}

193.含k个3的数

int main() {
	long long m,a,k,sum=0;
	cin>>m>>k;
	a=m;
	for(;a!=0;a/=10)if(a%10==3)sum++;
	if(m%19==0&&sum==k)cout<<"YES";
	else cout<<"NO";
}

194.判断回文数

int n[10];
int main(){
	int a,sum;
	bool x=1;
	cin>>a;
	for(int i=0;a!=0;a/=10,i++)n[i]=a%10;
	for(int i=0;n[i]!='\0';i++,sum++);
	for(int i=0;i<sum/2;i++)if(n[i]!=n[sum-i-1])x=0;
	if(x&&sum>1)cout<<"yes";
	else cout<<"no";
}

195.迭代法求值

int main(){
	int a;
	cin>>a;
	cout<<fixed<<setprecision(4)<<sqrt(a)<<endl;
}

196.级数求和

int main(){
	int k,i=0;
	double n=0;
	cin>>k;
	while(n<=k)i++,n+=1.0/i;
	cout<<i;
}

197.角谷猜想

int main(){
	int a;
	cin>>a;
	while(a>1) {
		if(a%2==1)
			cout<<a<<"*3+1="<<a*3+1,a=a*3+1;
		else cout<<a<<"/2="<<a/2,a>>=12;
		cout<<"\n";
	} cout<<"End";
}

198.对对交换

int main() {
	int n;
	cin>>n;
	for(int i=1;i<=n/2;i++)cout<<i*2<<" ",cout<<i*2-1<<" ";
}

199.蜗牛历险记

int a,b,c,d,ans;
int main(){
	while(cin>>a>>b>>c>>d){
		ans=0;
		for(int i=1;i<=d;i++){
			if(i&1)ans+=b;
			else ans-=c;
			if(ans>=a)break;
		} if(ans>=a)cout<<"yes\n";
		else cout<<"no\n";
	} return 0;
}//by jcf666

200.找规律填数字

int main() {
	int a,b,c,d,e;
	while(cin>>a>>b>>c>>d>>e){
		if(a==0&b==0&&c==0&&d==0&&e==0)
			break;
		if((b-a)==(c-b)&&(d-c)==(c-b)&&(d-c)==(e-d)){
			int t=b-a;
			for(int i=1;i<=5;i++)
				cout<<e+i*t<<" ";
		}
		if((b/a)==(c/b)&&(c/b)==(d/c)&&(d/c)==(e/d)&&(b/a)!=1){
			int t=b/a;
			for(int i=1;i<=5;i++)
				cout<<e*int(pow(t,i))<<" ";
		}
		if(a+b==c&&b+c==d&&c+d==e){
			int t1=d,t2=e,s=0;
			for(int i=6;i<11;i++){
				s=t1+t2,t1=t2,t2=s;
				cout<<s<<" ";
			}
		} cout<<endl;
	}
}

Page 3

201.求分数序列和

int main() {
	double n,sum=0,p=1,q=2,p1,q1;
	cin>>n;
	for(int i=0;i<n;i++){
		sum+=q/p;
		q1=q+p,p1=q;
		q=q1,p=p1;
	} cout<<fixed<<setprecision(4)<<sum;
}

202.计算分数加减表达式的值

int main() {
	int n,a=1;
	double sum=0;
	cin>>n;
	for(;a<=n;a++){
		if(a%2==1)sum+=1.0/a;
		else sum-=1.0/a;
	} cout<<fixed<<setprecision(4)<<sum;
}

203.求阶乘的和

int main() {
	int a,b=1,c=0;
	cin>>a;
	for(int x=1;x<=a;x++) {
		for(int i=1;i<=x;i++)b*=i;
		c+=b,b=1;
	} cout<<c;
}

204.求出e的值

int main() {
	long double n,a=1,sum=1,w=0;
	cin>>n;
	for(;a<=n;a++){
		w=1;
		for(int j=1;j<=a;j++)w*=j;
		sum+=1.0/w;
	} cout<<fixed<<setprecision(10)<<sum;
}

205.计算多项式的值

int main(){
	int n;
	long double a=0,x;
	cin>>x>>n;
	for(int i=n;i>=1;i--)
		a+=pow(x,i);
	if(n==0)a=1;
	a+=1;
	cout<<fixed<<setprecision(2)<<a;
}

206.年龄与疾病

int x,n,a,b,c,d;
int main(){
	cin>>x;
	for(int i=0;i<x;i++){
		cin>>n;
		if(n>=0 && n<=18)a++;
		if(n>=19 && n<=35)b++;
		if(n>=36 && n<=60)c++;
		if(n>=61)d++;
	} cout<<fixed<<setprecision(2);
	cout<<float(a*100.0/x)<<"%"<<endl;
	cout<<float(b*100.0/x)<<"%"<<endl;
	cout<<float(c*100.0/x)<<"%"<<endl;
	cout<<float(d*100.0/x)<<"%"<<endl;
}

207.不高兴的津津

int a[8][2],maxn=0;
int main() {
	for(int i=0;i<7;i++){
		cin>>a[i][0]>>a[i][1];
		maxn=max(maxn,a[i][0]+a[i][1]);
	}
	if(maxn<=8) cout<<0;
	else for(int i=0;i<7;i++)
			if(a[i][0]+a[i][1]==maxn)
				cout<<i+1,exit(0)
}

208.小明的绩点

double a,b,sum,sumx;
int main(){
	int n;	cin>>n;
	for(int i=0;i<n;i++)
		cin>>a>>b,sumx+=b,sum+=(a-50)*b*(a>=50);
	printf("%.2lf",sum/10/sumx);
}//by jcf666

209.最长平台

int main() {
	int n,x,y,a=1,m=0;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>x;
		if(x==y)a++;
		else a=1;
		m=max(m,a),y=x;
	} cout<<m;
}

210.雇佣兵

int main() {
	int m,t=0,n,x,maxn=0;
	cin>>m>>n>>x;
	for(;x>0;){
		if(t>=m) n+=m/n,t=0;
		else x--,t+=n-1;
	} cout<<n;
}

211.计算多项式的导函数

int n,m,in;
string no="no",NO="NO",yes="yes",YES="YES";
int main(){
	cin>>n;
	if(n==0)cout<<0,exit(0);
	for(int i=n;i;--i){
		cin>>m;
		if(in==0)cout<<i*m;
		else cout<<" "<<i*m;
		in++;
	} return 0;
}

212.与7无关的数

int n,sum;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
		if(i%10!=7&&i%7!=0&&i/10!=7)sum+=i*i;
	cout<<sum;
}

213.数1的个数

int n,sum;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
		for(int j=i;j;j/=10)
			if(j%10==1)sum++;
	cout<<sum;
}

214.数字统计

int a,b,sum;
int main(){
	cin>>a>>b;
	for(int i=a;i<=b;i++){
		if(i/10000==2)	sum++;
		if(i/1000%10==2)sum++;
		if(i/100%10==2)	sum++;
		if(i/10%10==2)	sum++;
		if(i%10==2)		sum++;
	} cout<<sum;
}

215.正整数分解

ps：wangyifan 大牛就是我

long long n,sum;
int main(){
	cin>>n;
	for(long long x=1,y=1;x<n;x++,y=n-x)
		if(x%7==0&&y%3==0)
			cout<<x<<' '<<y<<"\n",sum++;
	cout<<sum;
}

216.质因数分解

long long n,maxn=0;
int main(){
	cin>>n;
	for(long long i=2;i*i<=n;++i)
		if(n%i==0)return cout<<n/i,0;
}

217.数数小木块

long long a,b,c;
int main(){
	cin>>a;
	for(int i=0;i<a;i++){
		cin>>b;
		for(int j=1;j<=b;j++)
			for(int k=1;k<=j;k++)c+=k;
		cout<<c<<"\n",c=0;
	}
}//by jcf666

218.去除圆括号

char a[1001],len;
int s=1;
int main(){
	cin.getline(a,1001);
	for(int i=0;i<strlen(a)-1;i++){
		if(a[i]=='(')s=0;
		if(s)cout<<a[i];
		if(a[i]==')')s=1;
	}
}//by jcf666

219.英文加密

char a[1001]; int s=1;
int main(){
	cin.getline(a,1001);
	for(int i=0;i<strlen(a)-1;i++){
		if(a[i]>='a'&&a[i]<='z')a[i]=char(a[i]-32+int('z'-int(a[i])-(a[i]-'a')));
		else if(a[i]>='A'&&a[i]<='Z')a[i]=char(a[i]+32+int('Z'-int(a[i])-(a[i]-'A')));
		cout<<a[i];
	}
}//by jcf666

220.从大到小列出因子

int main(){
	int n;	cin>>n;
	for(int i=n;i;i--)
		if(n%i==0)cout<<i<<" ";
}//by jcf666

221.判断质数

int main(){
	long long a,s=2;
	cin>>a;
	if(a!=0&&a!=1){
		for(int i=2;i*i<a;i++){
			if(a%i==0){
				s=1; break;
			}
		} puts(s?"No":"Yes");
	} else cout<<"No";
}//by jcf666

222.第n小的质数

long long a,b,d;
int main(){
	cin>>a;
	for(int i=2;;i++){
		d=0;
		for(int j=2;j*j<=i;j++)
			if(i%j==0)d++;
		if(d==0)b++;
		if(b==a){
			cout<<i;
			break;
		}
	}
}//by jcf666

223.绝对素数

int s,s1;
int main(){
	for(int i=10;i<=99;i++){
		for(int j=2;j*j<i;j++)
			if(i%j==0)s++;
		for(int j=2;j*j<i/10+i%10*10;j++)
			if((i/10+i%10*10)%j==0)s1++;
		if(s1==0&&s==0)cout<<i<<"\n";
		s1=0,s=0;
	}
}//by jcf666

224.双胞胎数

int a[1000],s,len,n,n1;
int main(){
	for(int i=2;i<1000;i++){
		for(int j=2;j<i;j++)
			if(i%j==0)s++;
		if(s==0)a[len++]=i;
		s=0;
	} cin>>n;
	for(int i=0;i<len-1;i++){
		if(a[i+1]>n)break;
		if(a[i]+2==a[i+1])
			cout<<a[i]<<" "<<a[i+1]<<"\n",n1++;
	} cout<<n1;
	return 0;
}//jcf666

225.哥德巴赫猜想

int zhishu(int n){
	bool s=0;
	for(int i=2;i*i<=n;i++){
		if(n%i==0){
			s=1; break;
		}
	} return s;
}
long long n,s;
int main(){
	while(cin>>n,n!=0){
		for(int i=2;i<=n/2;i++)
			if(zhishu(i)&&zhishu(n-i))s++;
		cout<<s<<"\n",s=0;
	} return 0;
}//jcf666

226.超越路人甲

int x,y,z,x1,y1;
int main(){
	cin>>x>>y>>z;
	for(int i=1;i<=50;i++){
		x1+=x,y1+=y;
		cout<<"NO."<<i<<" "<<x1<<" "<<y1<<"\n";
		if(y1>x1){
			cout<<i;
			break;
		} y+=z;
	} if(x1>=y1)cout<<"NO";
}//jcf666

227.收集金币

int n,x=1,y=1,s;
int main(){
	cin>>n;
	while(n){
		n--,s+=y,x++;
		if(x>y)x=1,y++;
	} cout<<s;
}//jcf666

228.数0

int n,cnt; 
int main(){ 
    cin>>n;
    for(int i=5;n/i>=1;i*=5)cnt+=n/i;
    cout<<cnt;
}//jcf666

229.素数判定

int a,b,c,s;
int main(){
	cin>>a>>b;
	for(int i=a;i<=b;i++){
		s=pow(i,2)+i+41;
		for(int j=2;j<s;j++)
			if(s%j==0)c++;
	} puts(c>0?"Sorry":"OK");
}//jcf666

230.求因子和

int n,s;
int main(){
	cin>>n;
	for(int i=1;i*i<=n;i++){
		if(n%i==0)s+=i+n/i;
		if(n==i*i)s-=i;
	} cout<<s-n;
}//jcf666

231.走台阶

long long a,b,c=1,d=2,e=4;
int main(){
	cin>>a;
	if(a==1)cout<<c;
	else if(a==2)cout<<d;
	else if(a==3)cout<<e;
	else {
		for(int i=4;i<=a;i++)
			b=c+d+e,c=d,d=e,e=b;
		cout<<b;
	}
}//jcf666

232.分数统计

double s,sum;
int a,b,c,d,n;
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>s,sum+=s;
		if(s>=90)a++;
		else if(s>=80)b++;
		else if(s>=70)c++;
		else if(s>=60)d++;
	} printf("%d\n%d\n%d\n%d\n%.2lf",a,b,c,d,sum/n);
	return 0;
}

233.猴子吃桃

long long n,s=1;
int main(){
	cin>>n;
	for(int i=1;i<n;i++)s=(1+s)*2%100007;
	cout<<s;
}//jcf666

234.棋盘中的米粒

long long n,s=1;
int main(){
	cin>>n;
	for(int i=1;i<n;i++)(s<<=1)%=10007;
	cout<<s;
}//jcf666

235.疯狂吃鸡腿1

long long n,a[10005];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+1+n);
	cout<<a[n]+a[n-1];
}//jcf666

236.短信计费

double n,a,s;
int main(){
	cin>>n;
	for(int i=0;i<n;i++)
		cin>>a,s+=ceil(a/70)*0.1;
	printf("%.1lf",s);
}//jcf666

237.勇者买剑

int n,j[10005],m[10005],c;
double mx,s;
int main(){
	cin>>n;
	for(int i=0;i<n;i++)cin>>j[i]>>m[i];
	for(int i=0;i<n;i++){
		s=j[i]*1./m[i];
		printf("%.3lf",s);
		if(i!=n-1)putchar(' ');
		if(s>mx)mx=s,c=j[i];
	} printf("\n%.3lf %d",mx,c);
}//by jcf666

238.判断互质

long long a,b,i;
int main(){
	cin>>a>>b;
	for(i=2;i*i<=max(a,b);i++)
		if(a%i==0&&b%i==0){
			cout<<"No";
			break;
		}
	if(i*i>=max(a,b))cout<<"Yes";
}//by jcf666

239.最小公倍数

long long a,b;
int main(){
	cin>>a>>b;
	cout<<a*b/__gcd(a,b);
}//by jcf666

240.最大公约数和最小公倍数问题

int n,m,s,cnt;
int main(){
	cin>>n>>m,s=n*m;
	for(int i=n;i<=m;i++){
		int k=__gcd(i,s/i);
		if(k==n&&s/k==m&&m%i==0&&m%(s/i)==0&&i%n==0&&(s/i)%n==0)cnt++;
	} cout<<cnt;
}//by jcf666

241.求1数码

long long a,s;
int main(){
	cin>>a;
	for(int i=0;;i++){
		if(a&1){
			s++;
			if(a==1)break;
		} a>>=1;
	} cout<<s;
}//by jcf666

242.乘法口诀

long long a;
int main(){
	cin>>a;
	for(int i=1;i<=a;i++){
		for(int j=1;j<=i;j++)printf("%d*%d=%d ",j,i,i*j);
		puts("");
	}
}//by jcf666

243.Y三角形

int n;
string s;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<i;j++)cout<<" ";
		for(int j=1;j<=(n-i+1)*2-1;j++)cout<<"Y";
		puts("");
	}
}//by jcf666

244.打印数字图形

void print(int a,int b,int c){
	if(c>0)for(int i=a;i<=b;i+=c)cout<<i;
	else for(int i=a;i>=b;i+=c)cout<<i;
}
int main(){
	int n;
	while(cin>>n){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n-i;j++)cout<<" ";
			print(1,i,1),print(i-1,1,-1);
			cout<<"\n";
		}
		for(int i=n-1;i>=1;i--){
			for(int j=1;j<=n-i;j++)cout<<" ";
			print(1,i,1),print(i-1,1,-1);
			cout<<"\n";
		}
	}
}//by jcf666

245.百钱百鸡

int n,s;
int main(){
	cin>>n;
	for(int i=0;i<=n/5;i++)
		for(int j=0;j<=n/3;j++)
			if(i+j+(n-i*5-j*3)*3==n)s++;
	cout<<s;
}//by jcf666

246.我家的门牌号

int main(){
	int n,s,x;
	cin>>n,s=sqrt(6+2*n)-1;
	for(int i=s;;i++)
		if((i*i+i-2*n)%6==0){
			x=(i*i+i-2*n)/6;
			if(x<=0)continue;
			if(x>0){
				cout<<x<<" "<<i;
				break;
			}
		}
	return 0;
}//by jcf666

247.一个数学问题

double a,b,i=1,sum;
int main(){
	while(1){
		cin>>a>>b;
		if(!a&&!b)break;
		for(int i=1;i<a;i++)
			for(int j=i;j<a;j++)
				if((i*i+j*j+b)/(i*j)==int((i*i+j*j+b)/(i*j))&&i!=j)sum++;
		cout<<"Case "<<i++<<": "<<sum<<'\n',sum=0;
	}
}//by jcf666

248.水仙花数

int main(){
	long long m,n,b,s,g;
	char c;
	cin>>m>>c>>n;
	for(int i=m;i<=n;i++){
		b=i/100,s=i/10%10,g=i%10;
		if(b*b*b+s*s*s+g*g*g==i)cout<<i<<endl;
	}
}//by jcf666

249.质因子表示

long long n,s,i=2;
int main(){
	cin>>n;
	cout<<n<<"=";
	while(n!=1){
		if(n%i==0){
			cout<<i,n/=i;
			if(n!=1)cout<<"*";
			i=2;
		} else i++;
	}
}//by jcf666

250.解渴

long long n,m,a,b,max_water;
int main(){
	cin>>n>>m;
	for(int i=0;i<n;i++)
		cin>>a>>b,
		max_water=max(max_water,m/a*b);
	cout<<max_water;
}//by jcf666

251.开车

double s,x,y,a,b,m,t;
int n;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		cin>>x>>y,
		s+=sqrt((x-a)*(x-a)+(y-b)*(y-b)),a=x,b=y;
	t=sqrt(2*s/m);
	printf("%.0lf",t);
}//by jcf666

252.亲和数

long long n,a,b,cnt;
int f(int x){
	int sum=0;
	for(int i=1;i*i<=x;i++)
		if(x%i==0)sum+=x/i,sum+=i;
	return sum-x;
}
int main() {
	cin>>n;
	for(int i=3;cnt<n;i++){
		a=f(i),b=f(a);
		if(b==i)cnt++,cout<<i<<" "<<a<<"\n";
	} return 0;
}//by jcf666

253.3.2.1 Factorials阶乘

int main(){
	long long n,ge=1;
	cin>>n;
	for(int i=1;i<=n;i++){
		ge*=i;
		while(ge%10==0)ge/=10;
		ge%=1000000;
	} cout<<ge%10;
}//by jcf666

254.被涂抹的数字

int n=25006,len;
int main(){
	for(int i=0;i<=9;i++)
		for(int j=0;j<=9;j++)
			if((n+i*100+j*10)%37==0||(n+i*100+j*10)%67==0)
				len++,cout<<n+i*100+j*10<<endl;
	cout<<len;
}//by jcf666

255. 最小长方形

long long maxx=-1e10,maxy=-1e10,minx=1e10,miny=1e10,x,y,flag;
int main(){
	for(int i=0;;i++){
		cin>>x>>y;
		if(!x&&!y&&!flag)break;
		else if(x==0&&y==0){
			cout<<minx<<" "<<miny<<" "<<maxx<<" "<<maxy<<endl;
			maxx=-10e9,maxy=-10e9,minx=10e9,miny=10e9,flag=0;
		}
		if(x)minx=min(minx,x),maxx=max(maxx,x);
		if(y)miny=min(miny,y),maxy=max(maxy,y);
		if(x&&y)flag++;
	}
}//by jcf666

256.收款收据

int main(){
	for(int k=0;k<10;k++){
		int m=1401+k*10;
		if(m%17==0){
			cout<<"total is :"<<m<<"\n";
			for(int i=1;i<=m/13;i++)
				for(int j=1;j<=m/8;j++)
					if(i*13+j*8==m)cout<<"No.1: "<<i<<", NO.2: "<<j<< "\n";
		}
	}
}//by jcf666

257.寻找金蝉素数

int cnt;
int main(){
	cout<<"Golden Cicada Prime: 13597 53791 79531 91573 95713";
	cout<<"\nThe sum is: 5";
}//by jcf666

258.猜猜谁是冠军

1
2
3

int main(){
	cout<<"C";
}//by jcf666

259.连续自然数之和

int n,sum;
int main(){
	cin>>n;
	for(int i=1;i<=n/2;i++){
		sum=i;
		for(int j=i+1;sum<=n;j++){
			sum+=j;
			if(sum==n)cout<<i<<"--"<<j<<endl;
		}
	}
}//by jcf666

260.神奇的异或，寻找独一无二的数

long long n,a,s;
int main(){
	while(cin>>n,n){
		for(int i=1;i<=n;i++)
			cin>>a,s^=a;
		cout<<s<<"\n";	
	}
}//by jcf666

261.三进制异或

long long a,n,m,s,i,temp,j,b,flag;
long long f(long long n){
	long long s=0,m=1;
	while(n)s+=(n%3)*m,n/=3,m*=10;
	return s;
}
int main(){
	cin>>n>>m;
	n=f(n),m=f(m);
	for(i=1;;i++){
		temp=f(i),a=n+temp,b=m,flag=0;
		while(a||b){
			if(a%10%3!=b%10){
				flag=1;
				break;
			}
			a/=10,b/=10;
		}
		if(!flag)return cout<<i,0;
	}
	return 0;
}//by jcf666

262.输出成绩

int n,a[10000];
double sum;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		sum+=a[i];
	} sum/=n;
	printf("%.3lf\n",sum);
	for(int i=1;i<=n;i++)
		if(a[i]>sum)cout<<a[i]<<endl;
}//by jcf666

263.数组逆序重放

int n,a[10000];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	reverse(a.begin(),a.end());
	for(int i=1;i<=n;i++)cout<<a[i]<<" ";
}//by jcf666

264.数组间的比较大小

int n=10,x,d,deng,a[11],b[11];
int main(){
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++){
		cin>>b[i];
		if(b[i]>a[i])x++;
		else if(b[i]<a[i])d++;
		else deng++;
	}
	cout<<d<<" "<<deng<<" "<<x<<"\n"<<"a";
	if(x>d)cout<<"<";
	else if(x<d)cout<<">";
	else if(x==d)cout<<"=";
	cout<<"b";
}//by jcf666

265.数组练习1

int a[100001],n,m,s1;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=0;i<m;i++)cin>>s1,cout<<a[s1]<<endl;
}//by jcf666

266.数组练习2

int a[100001],n,m,s1;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=0;i<m;i++){
		cin>>s1;
		int maxn=-1e9;
		for(int j=1;j<=s1;j++)maxn=max(maxn,a[j]);
		cout<<maxn<<endl;
	}
}//by jcf666

267.选题

long long b[1000001],n,a,s,s1,s2;
int main(){
	cin>>n>>a;
	for(int i=0;i<n;i++){
		cin>>b[i];
		if(b[i]==a)s++;
		if(b[i]>a)s1++;
		if(b[i]<a)s2++;
	}
	if(s+s2==n)return cout<<"all",0;
	else if(s==n)return cout<<"all",0;
	else if(s1+s==n)return cout<<-1,0;
	cout<<s2<<"\n";
	for(int i=0;i<n;i++){
		if(b[i]<a)cout<<i+1<<" "<<b[i]<<endl;
	}
}//by jcf666

268.计算书费

double a[100]={28.9,32.7,45.6,78,35,86.2,27.8,43,56,65},sum,n;
int main(){
	for(int i=0;i<10;i++){
		cin>>n;
		sum+=n*a[i];
	}
	printf("%.1lf",sum);
}//by jcf666

269.查找特定的值

int a[100000],sum,n,fd,flag;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	cin>>fd;
	for(int i=1;i<=n;i++){
		if(a[i]==fd)return cout<<i,0;
	}
	if(!flag)cout<<-1;
}//by jcf666

270.不与最大数相同的数字之和

int n,a[101],maxn,sum;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++)maxn=max(maxn,a[i]);
    for(int i=1;i<=n;i++){
        if(a[i]!=maxn)sum+=a[i];
    }
    cout<<sum;
}//by jcf666

271.陶陶摘苹果

int n,a[10],s;
int main(){
	for(int i=0;i<10;i++)cin>>a[i];
	cin>>n;
	for(int i=0;i<10;i++)
		if(n+30>=a[i])s++;
	cout<<s;
}//by jcf666

272.珠心算测验

int n,sum,a[101];
int main(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++){
        int flag=0;
        for(int j=1;j<=n;j++)
            for(int k=1;k<=n;k++)
                if(j!=k)
                    if(a[i]==a[j]+a[k])flag=1;
       if(flag)sum++;
    }cout<<sum;
}//by jcf666

273.平移数据

long long n,a[1000001];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	a[0]=a[n];
	for(int i=0;i<n;i++)cout<<a[i]<<" ";
}//by jcf666

274.向量点积计算

long long a[100001],b,n,sum;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++){
		cin>>b;
		sum+=a[i]*b;
	}
	cout<<sum;
}//by jcf666

275.疯狂求和

long long a[100001],n,m,a1,b1;
int main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++)cin>>a[i];
	for(int i=1;i<n;i++)
		for(int j=i+1;j<=n;j++)
			if(a[i]+a[j]==n)a1=a[i],b1=a[j];
	if(a1==0&&b1==0)cout<<"No Answer";
	else cout<<a1<<" "<<b1;
}//by jcf666

276.买铅笔

long long a[100001],n,m,mina=10e9;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<n;i++)
		for(int j=i+1;j<=n;j++)
			if(i+j==n)mina=min(mina,a[i]+a[j]);
	mina=min(mina,a[n]);
	cout<<mina;
}//by jcf666

277.插队

int n,a[201],c,b,s=-1;
int main(){
	cin>>n;
	for(int i=0;i<n;i++)cin>>a[i];
	cin>>c>>b;
	for(int i=n-1;i>=c;i--)a[i+1]=a[i];
	n++;
	a[c]=b;
	for(int i=0;i<n;i++)cout<<a[i]<<" ";
}//by jcf666

278.奇怪的数列

long long n,sum;
string a1,a,b="123456789";
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a1;
		a+=a1;
	}
	for(int i=0;i<9;i++)
		if(int(a.find(b[i]))==-1)sum+=b[i]-'0';
	cout<<sum;
}//by jcf666

279.小明吃奶糖

int a[1000001],n,maxn=-10000,o,r,e;
int main(){
	cin>>n;
	for(int i=0;i<n;i++)cin>>a[i];
	for(int i=0;i<n-2;i++)
		if(a[i]+a[i+1]+a[i+2]>maxn)o=i+1,r=i+2,e=i+3,maxn=a[i]+a[i+1]+a[i+2];
	cout<<o<<" "<<r<<" "<<e;
}

280.校门外的树

int n,m,a[10000],x,y,s;
int main(){
	cin>>n>>m;
	for(int i=0;i<=n;i++)a[i]=1;
	for(int j=0;j<m;j++){
		cin>>x>>y;
		for(int i=x;i<=y;i++)a[i]=0;
	}
	for(int i=0;i<=n;i++)
		if(a[i]==1)s++;
	cout<<s;
}//by jcf666

281.找最小的数

long long n,a[10001],ming=10e9,num;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]<ming){
			ming=a[i];
			num=i;
		}
	}
	swap(a[1],a[num]);
	for(int i=1;i<=n;i++)cout<<a[i]<<" ";
}//by jcf666

282.近在咫尺

int n,a[10005],min=10e9,k;
int main(){
	cin>>n;
	for(int i=0;i<n;i++)cin>>a[i];
	for(int i=0;i<n-1;i++)
		if(a[i+1]-a[i]<min)min=a[i+1]-a[i],k=i;
	cout<<a[k]<<" "<<a[k+1]<<" "<<a[k+1]-a[k]<<"\n"<<a[0]<<" "<<a[n-1]<<" "<<a[n-1]-a[0];
}

283.疯狂吃鸡腿2

double n,a[10001],b[10001],sum;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++){
		cin>>b[i];
		if(b[i]==a[i])sum++;
	}
	printf("%.2lf",sum/n);
}//by jcf666

284.时间之流

long long n,a[1001],s1=1,s,flag;
int main(){
	cin>>n; 
	for(int i=0;i<n;i++){
		cin>>a[i];
		if(a[i]<0)s=i;
		if(a[i]>0)s1=s1*a[i],flag++;
	}
	if(n==1)return cout<<a[0],0;
	for(int i=0;i<s;i+=2)s1*=a[i]*a[i+1],flag++;
	if(flag==0)cout<<0;
	else cout<<s1;
}

285.细菌繁殖

long long d,m1,d1,m2,d2,n,m[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int main(){
	cin>>m1>>d1>>n>>m2>>d2;
	for(int i=m1-1;i<m2-1;i++)d+=m[i];
	d=d-d1+d2;
	for(int i=0;i<d;i++)n*=2;
	cout<<n;
}//by jcf666

286.合唱队形

#include<bits/stdc++.h>
using namespace std;
int maxj,n,a[100001];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		if(a[i]>a[maxj])maxj=i;
	}
	for(int i=1;i<=n;i++)
		if(i>=maxj&&a[i]<a[i+1]||i<maxj&&a[i]>a[i+1])return cout<<"NoAnsweR!",0; 
	cout<<maxj;
}//by jcf666

287.合并有序数列

#include<bits/stdc++.h>
using namespace std;
int a[1500001],b[1500001],c[1500001],m,n,x,s,s1,z;
int main(){
	cin>>m>>n;
	for(int i=0;i<m;i++)scanf("%d",&a[i]);
	for(int i=0;i<n;i++)scanf("%d",&b[i]);
	for(int i=0;i<m+n;i++)
		if(s>=m)c[z]=b[s1],s1++,z++;
		else if(s1>=n)c[z]=a[s],s++,z++; 
		else if(a[s]<=b[s1])c[z]=a[s],s++,z++;
		else if(a[s]>b[s1])c[z]=b[s1],s1++,z++;
	for(int i=0;i<m+n;i++)printf("%d ",c[i]);
}//by jcf666

288.石头剪刀布

int n,na,nb,a[101],b[101],a1,b1;
int main(){
	cin>>n>>na>>nb;
	for(int i=1;i<=na;i++)cin>>a[i];
	for(int i=1;i<=nb;i++)cin>>b[i];
	for(int i=1;i<=n;i++){
		int tmp=i%na,tmp2=i%nb;
		if(!tmp)tmp=na;
		if(!tmp2)tmp2=nb;
     		if(a[tmp]==2&&b[tmp2]==5||a[tmp]==5&&b[tmp2]==0||a[tmp]==0&&b[tmp2]==2)a1++;
		else if(a[tmp]==b[tmp2])continue;
		else b1++;
	}
	if(a1>b1)cout<<"A";
	else if(a1<b1)cout<<"B";
	else if(a1==b1)cout<<"draw";
}//by jcf666

289.插入数值

主打一个不听劝

int n,k,a[100002];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	cin>>a[n+1];
	sort(a+1,a+n+2);
	for(int i=1;i<=n+1;i++)cout<<a[i]<<" ";
}//by jcf666

290.数组操作

int n,m,a[100002],k,x,y,l;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)a[i]=i,cout<<a[i]<<" ";
	cout<<endl;
	for(int i=1;i<=m;i++){
		cin>>k;
		if(k==1){
			cin>>x>>y;
			swap(a[x],a[y]);
			for(int i=1;i<=n;i++)cout<<a[i]<<" ";
			cout<<"\n";
		}
		else if(k==2){
			cin>>l;
			a[l]=0;
			for(int i=l;i<n;i++)swap(a[i],a[i+1]);
			n--;
			for(int i=1;i<=n;i++)cout<<a[i]<<" ";
			cout<<"\n";
		}
	}
}//by jcf666

291.Zyn的数列

int n,m,a[100002],k,x,y,l,r;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=m;i++){
		cin>>k;
		if(k==1)cin>>x>>y,a[x]+=y;
		else if(k==2)cin>>x>>y,swap(a[x],a[y]);
		else if(k==3){
			cin>>l>>r>>x;
			for(int j=l;j<=r;j++)swap(a[j+x],a[j]);
		}
	}
	for(int i=1;i<=n;i++)cout<<a[i]<<" ";
}//by jcf666

292.做作业

int n,a[1000001];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+1+n,greater<>());
	for(int i=1;i<=n;i++)cout<<a[i]<<" ";
}//by jcf666

293.勇者的冒险

double x,y,s;
int n,xun;
struct cunzhuang{
	double x;
	double y;
	int xu;
}a[10005];
double f(double x1,double y1,double x2,double y2){
	return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y;
		a[i].xu=i;
	}
	for(int i=1;i<=n;i++){
		cin>>xun;
		s+=f(x,y,a[xun].x,a[xun].y);
		x=a[xun].x;
		y=a[xun].y;
	}
	printf("%.3lf",s);
	return 0;
}//by jcf666

294.友谊

int n,a[10001],b[10001],c[10001],d[10001],e[10001],f[10001],wmk,cc;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++)cin>>b[i];
	for(int i=1;i<=n;i++)cin>>c[i];
	for(int i=1;i<=n;i++)cin>>d[i];
	for(int i=1;i<=n;i++)cin>>e[i];
	for(int i=1;i<=n;i++){
		if(b[i]>=a[i]&&d[i]>=80)wmk=1;
		if(c[i]>=a[i]&&e[i]>=80)cc=1;
	}
	if(wmk&&cc)cout<<"fire";
	else if(wmk)cout<<"wmk";
	else if(cc)cout<<"cc";
	else cout<<"chinese";
	return 0;
}//by jcf666

295.坐标统计

int n,x[100001],y[100001],cnt,maxn=-1,maxj;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)scanf("%d %d",&x[i],&y[i]);
	for(int i=1;i<=n;i++){
		cnt=0;
		for(int j=1;j<=n;j++)
			if(x[i]>x[j]&&y[i]>y[j])cnt++;
		printf("%d\n",cnt);
		if(cnt>=maxn)maxn=cnt,maxj=i;
	}
	cout<<maxj;
	return 0;
}//by jcf666

296.数组去重

long long n,m,maxn=-10e9,a[200005],b[100005];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++)
		if(b[a[i]]==0)cout<<a[i]<<" ",b[a[i]]=1;
	return 0;
}//by jcf666

297.开关灯

long long n,m,maxn=-10e9,a[100005];
int main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++)
		for(int j=1;j<=n;j++)
			if(j%i==0)a[j]++,a[j]%=2;
	for(int i=1;i<=n;i++)
		if(a[i]){
			if(i!=1)cout<<",";
			cout<<i;
		}
	return 0;
}//by jcf666

298.张灯结彩

long long a[100001],n,m,k,s;
int main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++)cin>>k,a[k]++,a[k]%=3;
	for(int i=1;i<=n-2;i++)
		if(a[i]!=a[i+1]&&a[i+1]!=a[i+2]&&a[i]!=a[i+2])s++;
	cout<<s;
	return 0;
}//by jcf666

299.直方图

long long n,maxn=-10e9,a[100005],b[100005];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i],b[a[i]]++,maxn=max(maxn,a[i]);
	for(int i=0;i<=maxn;i++)cout<<b[i]<<"\n";
	return 0;
}//by jcf666

300.白细胞计数

double n,a[100001],sum=0,maxn,minn=10e9;
int maxj,minj;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		scanf("%lf",&a[i]);
		if(a[i]>maxn)maxn=a[i],maxj=i;
		if(a[i]<minn)minn=a[i],minj=i;
		sum=sum+a[i];
	}
	maxn=0;
	sum=(sum-a[minj]-a[maxj])/(n-2);
	printf("%.2lf ",sum);
	for(int i=1;i<=n;i++)
		if(i!=maxj&&i!=minj)
			if(maxn<abs(a[i]-sum))maxn=abs(a[i]-sum);
	printf("%.2lf",maxn);
	return 0;
}//by jcf666

Page 4

301.01数字串

string s;
int n,ans,cnt,sum;
void max(int &a,int b,int i){
	if(b>a)a=b,sum=i;
}
int main(){
	cin>>s;
	for(int i=0;i<s.size();++i){
		int a[2];	a[0]=a[1]=0;
		for(int j=0;i+j<s.size();++j){
			a[s[i+j]-'0']++;
			if(a[0]==a[1])max(ans,j+1,i);
		}
	} cout<<ans<<"\n"<<sum<<" "<<sum+ans-1;
	return 0;
}

302.批量求素数

int n,prime[1000001],len;
bool vis[1000001];
int main(){
	cin>>n;
	for(int i=2;i<=n;i++)
		if(!vis[i])
			for(int j=i+i;j<=n;j+=i)vis[j]=1;
	for(int i=2;i<=n;i++)
		if(!vis[i])prime[++len]=i;
	cout<<len<<'\n';
	for(int i=1;i<=len;i++)cout<<prime[i]<<' ';
	return 0;
} //by jcf666

306.高低位交换

unsigned int n;
int main(){
	cin>>n;
	cout<<(n>>16)+(n<<16);
	return 0;
}//by jcf666

314.火星A+B

int prime[101],a[101],b[101],c[101],lena,lenb,lenc,k=1,vis[1001];
string s1,s2,ans;
int E_sieve(int n){		//埃氏筛
	for(int i=2;i*i<=n;i++)
		if(!vis[i])for(int j=i*i;j<=n;j+=i)vis[j]=1;
	for(int i=2;i<=n;i++)
		if(!vis[i])prime[k++]=i;
	return k;
}
int main(){
	E_sieve(100);
	while(1){
		cin>>s1>>s2;
		if(s1=="0"&&s2=="0")return 0;
		s1+=",",s2+=",";
		memset(a,0,sizeof a);
		memset(b,0,sizeof b);
		memset(c,0,sizeof c);
		lenc=lenb=lena=0;
		int num=0;
		for(int i=0;i<s1.size();i++){
			if(s1[i]==',')a[++lena]=num,num=0;
			else num*=10,num+=s1[i]-'0';
		} num=0;
		for(int i=0;i<s2.size();i++){
			if(s2[i]==',')b[++lenb]=num,num=0;
			else num*=10,num+=s2[i]-'0';
		}
		for(int i=1;i<=ceil(lena/2.0);i++)swap(a[i],a[lena+1-i]);
		for(int i=1;i<=ceil(lenb/2.0);i++)swap(b[i],b[lenb+1-i]);
		lenc=max(lena,lenb);
		for(int i=1;i<=lenc;i++){
			c[i]+=a[i]+b[i];
			if(c[i]>=prime[i])c[i+1]=c[i]/prime[i],c[i]%=prime[i];
		}
		if(c[lenc+1]==1)lenc++;
		for(int i=lenc;i>=1;i--){
			if(i!=lenc)printf(",");
			printf("%d",c[i]);
		} puts("");
	} return 0;
}//by jcf666

317.数组练习2–加强版

long long a[50001],n,m,k,q;
int main(){ 
	cin>>n>>m; 
	for(int i=1;i<=n;i++){
		scanf("%lld",&k);
		a[i]=max(a[i-1],k);
	}
	for(int i=1;i<=m;i++){
		scanf("%lld",&q);
		cout<<a[q]<<"\n";
	} return 0;  
}//by jcf666

322.游戏闯关

int n,t,a[1000005],b[10000005],tmp,ans;
int main(){
	cin>>n>>t;
	for(int i=1;i<=n;i++)cin>>a[i],a[i]+=a[i-1];
	for(int j=1;j<=n;j++)cin>>b[j],b[j]+=b[j-1];
	for(int i=1;i<=n;i++)
		if(a[i]<=t)
			tmp=upper_bound(b,b+1+n,t-a[i])-b-1,
			ans=max(ans,tmp+i);
	for(int i=1;i<=n;i++){
		if(b[i]<=t)
			tmp=upper_bound(a,a+1+n,t-b[i])-a-1,
			ans=max(ans,tmp+i);
	} return cout<<ans,0;
}//by jcf666

Page 5

408.对弈

long long n,m,a[105][105],A,B;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n/2;i++)
		for(int j=1;j<=m;j++)scanf("%lld",&a[i][j]);
	for(int i=n/2+1;i<=n;i++){
		for(int j=1;j<=m;j++){
			scanf("%lld",&a[i][j]);
			if(n&1&&i!=n/2+1||n%2==0){
				A+=(a[n-i+1][j]>a[i][j]);
				B+=(a[n-i+1][j]<a[i][j]);
			}
		}
	}
	cout<<A<<":"<<B<<" ";
	if(A>B)cout<<"A is winner";
	else if(A<B)cout<<"B is winner";
	else cout<<"In a draw";
	return 0;
}//by jcf666

436.肿瘤面积

long long m,n,a[1001][1001],tot,f,w[]={0,0,1,0,-1},u[]={0,1,0,-1,0},ans=1e9;
void dfs(long long x,long long y){
	if(x==0||x==n+1||y==0||y==m+1){
		f=0;	return;
	} a[x][y]=0,tot++;
	for(int i=1;i<=4;i++){
		int x1=x+w[i],y1=y+u[i];
		if(a[x1][y1]==255)dfs(x1,y1);
	} return;
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)cin>>a[i][j];
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]==255){
				tot=0,f=1,dfs(i,j);
				if(f)ans=min(ans,tot);
			}
		}
	} return cout<<ans,0;
}//by jcf666

Page 6

501.快递中转点

int n,a[100001],ans,sum;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+1+n);
	if(n&1)ans=n/2+1;
	else ans=n>>1;
	for(int i=1;i<=n;i++)sum+=abs(a[i]-a[ans]);
	return cout<<sum,0;
}//by jcf666

502.给oliver的情书

long long n,m,a[10001][1001],b[10001],flag=0,minn=1e10,t,lenb;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)cin>>a[i][j];
	for(int i=1;i<=m;i++){
		lenb=1,flag=0;
		for(int j=1;j<=n;j++)b[j]=a[j][i];
		sort(b+1,b+n+1);
		for(int j=1;j<=n;j++){
			t=b[2]-b[1];
			if(j>2){
				if(b[j]-t!=b[j-1])
					flag=1;	break;
				}
		} if(!flag)minn=min(minn,t);
		memset(b,0,lenb+1);
	}
	if(minn==10e9)cout<<"NO";
	else cout<<minn;
	return 0;
}//by jcf666

503.求平均数、中位数、众数

int a[41],cnt,sum,maxn,c,b[41];
int main(){
	for(int i=1;i<=40;i++)cin>>a[i],sum+=a[i],b[a[i]]++;
	cout<<sum/40<<"\n";
	sort(a+1,a+1+40);
	cout<<a[21]<<"\n";
	for(int i=1;i<=10;i++)
		if(b[i]>maxn)
			maxn=b[i],c=i;
	return cout<<c,0;
}//by jcf666

543.计算概率

long long n,k,ans,a[100005];
int main(){
	cin>>n>>k;
	for(int i=1;i<=n;++i)cin>>a[i];
	stable_sort(a+1,a+1+n);
	for(int i=1;i<=n;++i){
		int t=upper_bound(a+1,a+1+n,k-a[i])-a-1;
		if(t>=i)t--;	ans+=t;
	} cout<<fixed<<setprecision(2)<<1.*ans/(n*(n-1));
	return 0;
}

550.最少操作次数

long long a,b,k,cnt;
int main(){
	cin>>a>>b>>k;
	if(k<=1)
		return cout<<b-a,0;
	else {
		while(a<=b/k)cnt+=b%k+1,b/=k;
		cout<<cnt+b-a;
	} return 0;
}//by jcf666

551.飞行员的工资

long long ans,a[100001],b[10001],n,x,y;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>x>>y;
		ans+=x,a[i]=x-y;
	for (int i=1;i<n;i+=2){
		int k=0;
		for(int j=1;j<=i;j++)
			if(b[j]==0&&a[j]>a[k])k=j;
		b[k]=1;
		ans-=a[k];
	} cout<<ans;
	return 0;
}//by jcf666

552.智力大冲浪

struct data{
    int x,y;
}a[505];
bool cmp(data a,data b){
    return a.y>b.y;
} int m,n,s[505],num=0,sum=0,maxn=0;
int main(){
    while(cin>>m){
        num=maxn=sum=0;	cin>>n;
        for(int i=1;i<=n;i++){
        	cin>>a[i].x;
        	if(a[i].x>maxn)maxn=a[i].x;
		} for(int i=1;i<=n;i++)
			cin>>a[i].y,num+=a[i].y;
		sort(a+1,a+1+n,cmp);
        for(int i=1;i<=n;i++)for(int j=a[i].x;j;j--)
            if(s[j]==0){ s[j]=a[i].y; break;}
        for(int i=1;i<=maxn;i++)sum+=s[i];
        cout<<m-(num-sum)<<endl;
    } return 0;
}

553.两人过河

int n,ans,a[1001];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+1+n);
	while(n>3){		
		ans+=min(a[2]+a[2]+a[1]+a[n],a[n-1]+a[1]+a[n]+a[1]);
		n-=2;
	}
	if(n==2)ans+=a[2];
	if(n==3)ans+=a[1]+a[2]+a[3];
	cout<<ans;
	return 0;
}//by jcf666

568.编辑

string s;
long long T,l;
char c,m;
int main(){
	cin>>s>>T;
	l=s.size();
	while(T--){
		cin>>c;
		if(c=='B'){
			if(l>0)s.erase(l-1,1),l--;
		}
		if(c=='L'){
			if(l>0)l--;
		}
		if(c=='D'){
			if(l<s.size())l++;
		}
		if(c=='P'){
			cin>>m;
			s.insert(s.begin()+l,m);
			l++;
		}
	}
	cout<<s;
	return 0;
}//by jcf666

Page 9

802.没有上司的舞会

树形动态规划模板题

int f[6005][2],u,v,n;
bool h[6005],vis[6005];
vector<int>g[6005];
void solve(int x){
	vis[x]=1;
	for(auto y:g[x]){
		if(vis[y])continue;
		solve(y);
		f[x][1]+=f[y][0];
		f[x][0]+=max(f[y][0],f[y][1]);
	} return;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;++i)cin>>f[i][1];
	for(int i=1;i<n;++i)cin>>u>>v,h[u]=1,g[v].push_back(u);
	for(int i=1;i<=n;++i)
		if(!h[i])solve(i),cout<<max(f[i][1],f[i][0]),exit(0);
	return 0;
}

Page 10

944.树状数组模板1【单点修改，区间询问】

const int M=1e6+5;
int n,m;
struct BIT{
	int a[M];
	int lowbit(int x){
		return x&-x;
	} int query(int x){
		int res=0;
		while(x)res+=a[x],x-=lowbit(x);
		return res;
	} void add(int x,int k){
		while(x<=n)a[x]+=k,x+=lowbit(x);
		return;
	}
}t;
signed main(){
	scanf("%d%d",&n,&m);
	for(int i=1,x;i<=n;++i)
		scanf("%d",&x),t.add(i,x);
	for(int i=1,op,x,y;i<=m;++i){
		scanf("%d%d%d",&op,&x,&y);
		if(op==1)t.add(x,y);
		else printf("%d\n",t.query(y)-t.query(x-1));
	} return 0;
}

974.欧拉回路

使用 bfs 来判断图是否连通，通过小学奥数可知，没有奇点的图可以形成欧拉回路，有 2 个奇点的图可以 1 笔画完所有路径

#define int long long
const int M=1e5+5;
int n,m;
vector<int>g[M];
inline bool bfs(){
	bitset<M>vis;	queue<int>q;
	q.push(1),vis[1]=1;
	while(q.size()){
		int x=q.front(); q.pop();
		for(auto y:g[x])
			if(!vis[y])vis[y]=1,q.push(y);
	} return vis.count()==n;
}
signed main(){
	while(scanf("%lld",&n),n){
		scanf("%lld",&m);
		for(int i=1,u,v;i<=m;++i){
			scanf("%lld%lld",&u,&v),
			g[u].push_back(v),
			g[v].push_back(u);
		} bool res=1;
		if(!bfs())res=0;
		for(int i=1;i<=n&&res;++i)
			if(g[i].size()&1)res=0;
		printf("%d\n",res);
		for(int i=1;i<=n;++i)
			g[i].clear();
	} return 0;
}

979.逃生

为了保证排队的顺序，需要使用优先队列来进行拓扑排序

#define int long long
priority_queue<int>q;
vector<int>g[30005],ans;
int deg[30005],n,m,x,y,T;
signed main(){
	scanf("%lld",&T);
	while(T--){
		scanf("%lld%lld",&n,&m);
		memset(deg,0,sizeof deg);
		while(m--)
			scanf("%lld%lld",&x,&y),
			g[y].push_back(x),deg[x]++;
		for(int i=1;i<=n;++i)
			if(!deg[i])q.push(i);
		while(q.size()){
			int tmp=q.top(); q.pop();
			ans.push_back(tmp);
			for(auto p:g[tmp])
				if(--deg[p]==0)q.push(p);
		} reverse(ans.begin(),ans.end());
		for(auto i:ans)
			printf("%lld ",i);
		puts(""),ans.clear();
		for(int i=1;i<=n;++i)g[i].clear();
	} return 0;
}

Update

日期	更新内容	源码长度
2022 12 17	基础题库前 100 题发布至洛谷博客	Unknown
2023 01 21	更新至基础题库前 130 题	1236 Lines
2023 08 21	更新至基础题库前 180 题	1786 Lines
2023 08 24	更新至基础题库前 200 题	2051 Lines
2024 08 21	增加约 40 题题解编写 Blog 页内跳转	2417 Lines
2024 08 22	增加约 49 题题解修改部分远古码风	3221 Lines
2024 08 24	增加约 9 篇题解	3324 Lines
2024 08 25	增加 T261-300 共 40 篇题解	3927 Lines

入坑网站 wzoi.cc

方便大家复制 不写注释了 文章有亿点长，建议使用页内跳转快速找到题目

Page 1

1.Hello World

2.打印Hello World

3.默写数字

4.A+B Problem

5.输出第二个整数

6.求一个数的前后两个数

7.竖式计算

8.植树造林

9.求自行车总价

10.正方形面积 Link

11.三位数

12.做蛋糕

13.计算(a+b)*c的值

14.求余数

15.计算(a+b)/c的值

16.小玉买文具

17.买苹果

18.买牛奶

19.小鱼的游泳时间

20.周长与面积

21.求筝形面积

22.求正立方体表面积

23.输出保留3位小数的浮点数

24.工资

25.四舍五入

26.求梯形面积

27.梯形面积

28.求圆柱体表面积

29.计算总成绩与平均成绩

30.新平均成绩

31.歌手大奖赛

注意题目输出需要6.2lf或者setw(6)

32.奇葩的饭店

33.猜数游戏

34.求根号x的值

35.求logx

36.求两者较大值的max函数的用法

37.求自行车和三轮车各是多少辆

38.鸡兔同笼

39.计算路程

40.带余除法

41.交换门牌号

42.密码

43.浮点数向零舍入

44.计算浮点数相除的余数

45.整型数据类型存储空间大小

46.浮点型数据类型存储空间大小

47.其他基本数据类型存储空间大小

48.空格分隔输出

49.整型与布尔型的转换

50.字符三角形

51.字符菱形

52.读取单个字符的getchar()函数

53.打印ASCII码

54.打印字符

55.大写字母转小写字母

56.特殊输出

57.特殊输出2

58.字符变换

59.加密算法

60.甲流疫情死亡率

61.计算多项式的值

62.数列取数

63.填充矩形

64.大象喝水

65.求等差为3的数列

66.等差数列末项计算

67.计算线段长度

68.计算折线长度

69.送午饭

70.计算曼哈顿距离

71.计算球的体积

72.计算并联电阻的阻值

73.求面积差

寻求老师的帮忙……

74.整数反转

第40题的加强版

方便大家复制不写注释了文章有亿点长，建议使用页内跳转快速找到题目