#include<stdio.h>
main(){
    int a, b, c;
    int P = 0, kase = 0;
    while((scanf("%d%d%d", &a, &b, &c) == 1) && a != EOF){
        
        P = a*70 + b*21 + c*15;
        for(;P > 100;P = P - 105);
        
        if((P >= 10) && (P <= 100))
            printf("Case %d: %d\n", ++kase, P);
        else
            printf("Case %d: No.answer", ++kase);   
        
    }
    return 0;
}

sorry，没说明白韩信点兵算法

[ 本帖最后由 B丙乙Y彡 于 2015-8-4 14:22 编辑 ]

谢谢

韩信点兵，我国很古典的算法之一。没说明白，sorry