#include<iostream>
#include<stdio.h>
usingnamespacestd;
intmain()
{
inta,b,c,d;
intn;
printf("请输入第一个区间:");
scanf("%d%d",&a,&b);
printf("请输入第二个区间:");
scanf("%d%d",&c,&d);
printf("请输入需要判断数字的个数:");
scanf("%d",&n);
intx[n];
for(inti=0;i<n;i++)
{
scanf("%d",&x[i]);
}
for(inti=0;i<n;i++)
{
if(b>=c)
{
//if((x[i]>=a&&x[i]<c)||(x[i]>b&&x[i]<=d))
//printf("只存在于1个区间\n");
if(x[i]>=a&&x[i]<c)printf("11\n");
elseif(x[i]>b&&x[i]<=d)printf("12\n");
elseif((x[i]>=c)&&(x[i]<=b))
printf("212\n");
else
printf("0");
}
else
{
if(x[i]>=a&&x[i]<=b)printf("11\n");
elseif(x[i]>=c&&x[i]<=d)printf("21");
else
printf("不存在于任何区间");
}
}
return0;
}
扩展资料
JS判断一个数字在某一个区间内
varrange=[350,450,550,650,850,1000,1100,1250,1500];
varreward=[30,40,50,100,200,240,300,400];
functionbinarySearch(arr,findVal,leftIndex,rightIndex){
if(leftIndex>rightIndex){
varfind=leftIndex-1
returnfind;
}
varmidIndex=Math.floor((leftIndex+rightIndex)/2);
varmidVal=arr[midIndex];
if(midVal>findVal){
returnbinarySearch(arr,findVal,leftIndex,midIndex-1);
}elseif(midVal<findVal){
returnbinarySearch(arr,findVal,midIndex+1,rightIndex);
}else{
varfind=midIndex+1;
returnfind;
}
}
functionward(a){
if(a<0){
return'no';
}
if(a>7){
a=7;
}
returnreward[a];
}
var$a=binarySearch(range,800,0,9);
var$ward=ward($a);
C语言
//比如要判断一个int型整数Num是否在1~100之间