继续
P1085 不高兴的津津
循环遍历即可
#include<bits/stdc++.h>
using namespace std;
int a[10];
int main()
{
int x1,x2,ans=0,cnt=0;
for(int i=0;i<7;i++)
{
cin >> x1 >> x2;
a[i] = x1 + x2;
if(a[i]>ans)
{
ans = a[i];
cnt = i;
}
}
if(a[cnt]<=8)
cout << 0;
else
cout << cnt+1;
}
P1909 买铅笔
数学处理
#include<bits/stdc++.h>
using namespace std;
int main()
{
double n;
cin >> n;
double a1,a2,b1,b2,c1,c2;
cin >> a1 >> a2;
cin >> b1 >> b2;
cin >> c1 >> c2;
int s1 = ceil(n/a1)*a2;
int s2 = ceil(n/b1)*b2;
int s3 = ceil(n/c1)*c2;
cout << min(min(s1,s2),s3);
return 0;
}
P1422 小玉家的电费
if else 判断语句
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
if(n<=150)
printf("%.1f",n*0.4463);
else if(n<=400)
printf("%.1f",150*0.4463+(n-150)*0.4663);
else
printf("%.1f",150*0.4463+(400-150)*0.4663+(n-400)*0.5663);
return 0;
}
P1424 小鱼的航程(改进版)
循环
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x, n;
int ans;
cin >> x >> n;
while(n--)
{
if(x>=1&&x<=5)
{
ans+=250;
}
x++;
x%=7;
}
cout << ans;
return 0;
}
P1888 三角函数
注意最大公约数的化简
#include<bits/stdc++.h>
using namespace std;
int gcd(int x,int y)
{
return y==0?x:gcd(y,x%y);
}
int main()
{
int a,b,c;
cin >> a >> b >> c;
int up = min(min(a,b),c);
int down = max(max(a,b),c);
int g = gcd(up,down);
cout << up/g;
cout << "/";
cout << down/g;
return 0;
}
P1046 陶陶摘苹果
遍历
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[10];
for(int i=0;i<10;i++)
cin >> a[i];
int x;
cin >> x;
x+=30;
int ans=0;
for(int i=0;i<10;i++)
{
if(a[i]<=x)
ans++;
}
cout << ans;
return 0;
}
P5717 三角形分类
判断语句
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if(a>b)
{
int temp = a;
a = b;
b = temp;
}
if(b>c)
{
int temp = b;
b = c;
c = temp;
}
if(a>c)
{
int temp = a;
a = c;
c = temp;
}
if(a+b<=c)
{
cout << "Not triangle"<<endl;
return 0;
}
if(a*a+b*b==c*c)
cout << "Right triangle"<<endl;
if(a*a+b*b>c*c)
cout << "Acute triangle"<<endl;
if(a*a+b*b<c*c)
cout << "Obtuse triangle"<<endl;
if(a==b)
cout << "Isosceles triangle"<<endl;
if(a==b&&a==c)
cout << "Equilateral triangle"<<endl;
return 0;
}