UVA - 1586 Molar mass?

UVA - 1586 Molar mass?

题目大意:给一组化学式算出其质量

解题思路:一个一个算就好了

#include <cstdio>
#include <cstring>
#include <cstdlib>
int main() {
    char b[100];
    char a[100];
    int N;
    scanf("%d", &N);
    getchar();
    double s;
    while(N--) {
        memset(a, 0, sizeof (a));
        memset(b, 0, sizeof (b));
        s = 0;
        gets(a);

        for ( int i = 0; i < strlen(a); i++) {
            if (a[i] == 'C' ) {
                if( a[i+1] > '9' || a[i+1] < '0' )
                    s = s + 12.01;
                else if (a[i+1] >= '0' && a[i+1] <= '9') {
                    int k ;
                    b[0] = a[i+1];
                    for (  k = 1 ; k < strlen(a) - i; k++)
                        if (a[i+1+k] < '0' || a[i+1+k] > '9') break;
                        else {b[k] = a[i+1+k];b[k+1] = '\0';}

                    s = s + 12.01*atoi(b);
                    i = i + k;
                    }
            }
            if (a[i] == 'H' ) {
                if( a[i+1] > '9' || a[i+1] < '0' )
                    s = s + 1.008;
                else if (a[i+1] >= '0' && a[i+1] <= '9') {
                    int k ;
                    b[0] = a[i+1];
                    for (  k = 1 ; k < strlen(a) - i; k++)
                        if (a[i+1+k] < '0' || a[i+1+k] > '9') break;
                        else {b[k] = a[i+1+k];b[k+1] = '\0';}
                    s = s + 1.008*atoi(b);
                    i = i  + k;
                    }
            }
            if (a[i] == 'O' ) {
                if( a[i+1] > '9' || a[i+1] < '0' )
                    s = s + 16.00;
                else if (a[i+1] >= '0' && a[i+1] <= '9') {
                    int k ;
                    b[0] = a[i+1];
                    for (  k = 1 ; k < strlen(a) - i; k++)
                        if (a[i+1+k] < '0' || a[i+1+k] > '9') break;
                        else {b[k] = a[i+1+k]; b[k+1] = '\0';};

                    s = s + 16.00*atoi(b);
                    i=i + k;
                    }
            }
            if (a[i] == 'N' ) {
                if( a[i+1] > '9' || a[i+1] < '0' )
                    s = s + 14.01;
                else if (a[i+1] >= '0' && a[i+1] <= '9') {
                    int k ;
                    b[0] = a[i+1];
                    for (  k = 1 ; k < strlen(a) - i; k++)
                        if (a[i+1+k] < '0' || a[i+1+k] > '9') break;
                        else  {b[k] = a[i+1+k]; b[k+1] = '\0';}
                    s = s + 14.01*atoi(b);
                    i=i + k;
                    }
            } 
        }
        printf("%.3lf\n", s);
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值