1 小理的计算邮资
代码:
#include<cstdio>
int main()
{
int n, yf, zl; //yf邮费 zl重量
char c;
scanf("%d %c", &n, &c);
if(n>1000){
n -= 1000;
zl = n - n / 500 * 500;
if( zl > 0 ) yf = 8 + ( n / 500 + 1 ) * 4;
else yf = 8 + n / 500 * 4;
}
else if(n<=1000){
yf = 8;
}
if( c == 'y' ) yf += 5;
printf("%d", yf);
return 0;
}
2 最大数输出
代码:
#include<cstdio>
int main()
{
int a, b, c, max;
scanf("%d %d %d", &a, &b, &c);
max = a;
if(b>max) max=b;
if(c>max) max=c;
printf("%d", max);
return 0;
}
3 三角形判断
代码:
#include<cstdio>
int main()
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if(a+b>c && a+c>b && b+c>a)
printf("yes");
else
printf("no");
return 0;
}
4 判断点在第几象限
代码:
#include<cstdio>
int main()
{
float x1, y1;
scanf("%f %f", &x1, &y1);
if(x1>0)
if(y1>0) printf("1");
else printf("4");
else if(x1<0)
if(y1>0) printf("2");
else printf("3");
return 0;
}
5 点和正方形的关系
代码:
#include<cstdio>
int main()
{
int x, y;
scanf("%d %d", &x, &y);
if(x>=-1 && x<=1 && y>=-1 && y<=1)
printf("yes");
else
printf("no");
return 0;
}
6 奇数字之和偶数字之和
代码:
#include<cstdio>
int main()
{
int n, ge, shi, bai, qian, wan, jihe=0, ouhe=0;//jihe奇数之和,ouhe偶数之和
scanf("%d", &n);
ge = n % 10;
shi = n % 100 / 10;
bai = n % 1000 / 100;
qian = n % 10000 / 1000;
wan = n / 10000;
if( ge % 2 == 0) ouhe+=ge;
else jihe+=ge;
if( shi % 2 == 0) ouhe+=shi;
else jihe+=shi;
if( bai % 2 == 0) ouhe+=bai;
else jihe+=bai;
if( qian % 2 == 0) ouhe+=qian;
else jihe+=qian;
if( wan % 2 == 0) ouhe+=wan;
else jihe+=wan;
printf("%d\n%d", jihe, ouhe);
return 0;
}
7 月份有几天
代码:
#include<cstdio>
int main()
{
int nian, yue;
scanf("%d %d", &nian, &yue);
if(yue==1 || yue==3 || yue==5 || yue==7 || yue==8 || yue==10 || yue==12) printf("31");
else if(yue==2)
if(nian%4==0 && nian%100!=0 || nian%400==0 ) printf("29");
else printf("28");
else printf("30");
return 0;
}
8 输出前趋或后继字符
代码:
#include<cstdio>
int main()
{
char a, b;
scanf("%c%c", &a, &b);
if((b-a)%2==0) printf("%c%c", a-1, b-1);
else printf("%c%c", a+1, b+1);
return 0;
}
9 买铅笔
代码:
#include<cstdio>
int main()
{
int n, sl, jg, qian[4];//sl一包的数量 jg价格 qian钱
scanf("%d", &n);
for(int i=1; i<=3; i++)
{
int gs, zj;//gs总个数
scanf("%d %d", &sl, &jg);
gs = sl;
while(gs<n) gs+=sl;
if(gs%sl==0) qian[i]=gs/sl*jg;
else qian[i]=(gs/sl+1)*jg;
}
qian[0] = qian[1];
if(qian[2]<qian[0]) qian[0]=qian[2];
if(qian[3]<qian[0]) qian[0]=qian[3];
printf("%d", qian[0]);
return 0;
}
10 判断是否为水仙花数
代码:
#include<cstdio>
int main()
{
int n, ge, shi, bai;
scanf("%d", &n);
ge = n % 10;
shi = n % 100 / 10;
bai = n / 100;
if(ge*ge*ge+shi*shi*shi+bai*bai*bai==n) printf("yes");
else printf("no");
return 0;
}
11 子数的整除
代码:
#include<cstdio>
int main()
{
int n, k, ge, shi, bai, qian, wan, a, b, c, t=0;
scanf("%d %d", &n, &k);
ge = n % 10;
shi = n % 100 / 10;
bai = n % 1000 / 100;
qian = n % 10000 / 1000;
wan = n / 10000;
a = wan * 100 + qian * 10 + bai;
b = qian * 100 + bai * 10 + shi;
c = bai * 100 + shi * 10 + ge;
if(a % k == 0) t++;
if(b % k == 0) t++;
if(c % k == 0) t++;
printf("%d", t);
return 0;
}
12 判断是否为回文数
代码:
#include<cstdio>
int main()
{
int n, ge, shi, bai, qian;
scanf("%d", &n);
ge = n % 10;
shi = n % 100 / 10;
bai = n % 1000 / 100;
qian = n % 10000 / 1000;
if(qian!=0)
if(qian==ge && bai==shi) printf("Palindrome number");
else printf("Error");
else if(bai!=0)
if(bai==ge) printf("Palindrome number");
else printf("Error");
else if(shi!=0)
if(shi==ge) printf("Palindrome number");
else printf("Error");
return 0;
}
13 分糖果
代码(目前不是最完美的):
#include<cstdio>
int main()
{
int n, L, R, t=0; //t糖
scanf("%d %d %d", &n, &L, &R);
for(int i=L; i<=R; i++){
int j=i;
while(j>=n) j-=n;
if(j>t) t=j;
}
printf("%d", t);
return 0;
}
14 字符串游戏
代码:
#include<cstdio>
int main()
{
char c[9], num=0;
for(int i=1; i<=8; i++)
{
scanf("%c", &c[i]);
if(c[i]=='1') num++;
}
printf("%d", num);
return 0;
}
15 面积比较
代码:
#include<cstdio>
int main()
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if(a*a > b*c) printf("Alice");
if(a*a < b*c) printf("Bob");
return 0;
}