数字分类(1002)
#include <stdio.h>
int main()
{
int n,a[1000];
int a1=0,a2=0,a3=0,a5=0,c2=0,c4=0;
double a4=0.0;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",a+i);
}
for(int i=0;i<n;i++){
if(a[i]%10==0)
a1+=a[i];
else if(a[i]%5==1){
c2++;
if(c2%2!=0)
a2+=a[i];
else
a2-=a[i];
}
else if(a[i]%5==2)
a3++;
else if(a[i]%5==3){
c4++;
a4+=a[i];
}
else if(a[i]%5==4){
if(a[i]>a5)
a5=a[i];
}
}
if(a1==0)
printf("N ");
else
printf("%d ",a1);
if(a2==0)
printf("N ");
else
printf("%d ",a2);
if(a3==0)
printf("N ");
else
printf("%d ",a3);
if(a4==0.0)
printf("N ");
else
printf("%.1f ",a4/c4);
if(a5==0)
printf("N");
else
printf("%d",a5);
return 0;
}
(未完善)锤子剪刀布(1008)
#include <stdio.h>
int main()
{
int n;
int w[2]={0},f[2]={0},p[2]={0};
char a,b;
scanf("%d",&n);
for(int i=0;i<n;i++){
getchar();//吸收空格
scanf("%c %c",&a,&b);
if((a=='C'&&b=='J')||(a=='J'&&b=='B')||(a=='B'&&b=='C')){
w[0]++;
f[1]++;
}else if((a=='J'&&b=='C')||(a=='B'&&b=='J')||(a=='C'&&b=='B')){
w[1]++;
f[0]++;
}else{
p[0]++;
p[1]++;
}
}
printf("%d %d %d\n",w[0],p[0],f[0]);
printf("%d %d %d\n",w[1],p[1],f[1]);
return 0;
}
一元多项式求导(模拟1042)
#include <stdio.h>
int main()
{
int a,b,a1,b1,count=0;
while(scanf("%d%d",&a,&b)==2){
a1=a*b;
b1=b-1;
if(a1){
count++;
if(b!=1)
printf("%d %d ",a1,b1);
else{
printf("%d %d",a1,b1);
}
}
if(count==0)
printf("0 0");
}
return 0;
}