习题2-2

2019-11-08 02:08:00

字体：大中小

来源：转载

供稿：网友

//习题2-2韩信点兵#include <stdio.h>int main(){ int n; int count = 0; int i = 0; int a[100],b[100]; int num;while (scanf("%d",&n)==1&&n) { for(i = 0;i<2;i++){ scanf("%d",&a[i]); } b[0+count*3]=n; b[1+count*3]=a[0]; b[2+count*3]=a[1]; count++; } //PRintf("%d",count); -> count is ture; for(i = 0;i<count;i++){ if(b[0+i*3]>=0&&b[1+i*3]>=0&&b[2+i*3]>=0){ if(b[0+i*3]<3&&b[1+i*3]<5&&b[2+i*3]<7){ for(num = 10;num<=100;num++){ if(num%3==b[0+i*3]&&num%5==b[1+i*3]&&num%7==b[2+i*3]){ printf("Case %d: %d/n",i+1,num); break; } if(num==100){ printf("Case %d: No answer/n",i+1); } } }else{ printf("Case %d: No answer/n",i+1); } }else{ printf("Case %d: No answer/n",i+1); } }} //finish it

上一篇：Sping-MVC

下一篇：每日四个小算法 --- day1