id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
5,500 | int main()
{
int i=0,j=0,x=0,m=0;
int a[20];
while(scanf("%d",&a[i]),a[i]!=-1)
{while(scanf("%d",&a[i+1]),a[i+1]!=0)
{i++;}
for(m=0;a[m]!=0;m++)
for(j=m;a[j]!=0;j++)
{
if(a[m]==2*a[j]||a[j]==2*a[m])
x=x+1;
}
printf("%d\n",x);
x=0;
i=0;
}
return 0;
}
| 12 |
5,501 |
//??, bingxue_ningyan@sina.com
int main()
{
int n[100][100],i,k,j,s[100],num[100],t,p,m;
//double a;
for(i=0;i<100;i++)
{
scanf("%d",&n[i][0]);
if(n[i][0]==-1) break;
else
{
for(j=1;j<100;j++)
{
scanf("%d",&n[i][j]);
if(n[i][j]==0){
num[i] = j;
break;
}
}
}
}
for(k=0;k<i;k++)
{
s[k]=0;
for(t=0;t<j;t++)
{
for(m=t;m<num[k];m++)
{
if( (2*n[k][t]==n[k][m]) || (2*n[k][m]==n[k][t]) )
{
s[k]=s[k]+1;
}
//if(a==2.0||a==0.5) s[k]=s[k]+1;
}
}
}
for(p=0;p<i;p++)
printf("%d\n",s[p]);
return 0;
}
| 12 |
5,502 |
int main(int argc, char* argv[])
{
int p[50][15],n[50],line,sum,i,k,j;
for(i=0;;i++)
{
for(k=0;;k++)
{
scanf("%d",&p[i][k]);
if(p[i][k]==0||p[i][k]==-1)
{
n[i]=k;
break;
}
}
if(p[i][k]==-1)
{
line=i;
break;
}
}
for(i=0;i<line;i++)
{
sum=0;
for(k=0;k<n[i];k++)
{
for(j=k+1;j<n[i];j++)
{
if(p[i][k]==p[i][j]*2||p[i][j]==p[i][k]*2)
sum=sum+1;
}
}
printf("%d\n",sum);
}
return 0;
}
| 12 |
5,503 | //***********************************************************
//* ? ??1.cpp *
//* ? ??? ? 1200012916 *
//* ? ??2012?10?31? *
//* ? ???? *
//***********************************************************
int main()
{
//??????i, j, k,????a[15], ?????
//?????????????sum
int i, j, k, a[16] = {0}, sum;
while (cin >> a[0]) //?????????
{
if (a[0] == -1)
break;
i = 0; //????????
sum = 0;
do //?do? while???????????
{ //????????
i++;
cin >> a[i];
}
while (a[i] != 0);
for (j = 0; j < i; j++) //???for??????????
{ //???????????sum??
for (k = 0; k < i; k++)
{
if (k != j && a[k] == 2 * a[j])
sum += 1;
}
}
cout << sum << endl;
}
return 0;
}
| 12 |
5,504 | int main()
{
int a[20],i,j,k,count;
while(cin>>a[0])
{
if(a[ 0 ]==-1)
break;
count=0;
for(i=1;;i++)
{
cin>>a[i];
if(a[i]==0) break;
}
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(a[k]==2*a[j])
{
count+=1;
}
}
}
cout<<count<<endl;
}
return 0;
}
| 12 |
5,505 | int main()
{
int n,k,i,a[15],l,p=0,t;
for(i=1;;i++)
{scanf("%d",&a[0]);
if (a[0]==-1 ) break;
else{
p=0;
for(k=1;k<=15;k++)
{
scanf("%d",&a[k]);
if (a[k]==0) break;
}
for(t=0;t<=k;t++)
for(l=0;l<=k;l++)
{
if(a[l]==a[t]*2) p=p+1;
}
p=p-1;
printf("%d\n",p);}
}
return 0;
} | 12 |
5,506 | int main()
{
int a[16],i,j,m,n,t;
while(a[0]!=-1){
t=0;n=0;
for(i=0;;i++){
scanf("%d",&a[i]);
if(a[i]<=0){
break;
}
else{
t++;
}
}
if(a[0]==-1){
break;
}
else{
for(j=0;j<t;j++){
for(m=0;m<t;m++){
if(a[j]==2*a[m]){
n++;
}
}
}
printf("%d\n",n);
}
}
return 0;
}
| 12 |
5,507 | //*******************************
//????1.cpp *
//????? 1? 1200012895 *
//???2012?10?29? *
//?????????????? *
//*******************************
int main()
{
int x, a[16], i, j, n = 0, num= 0, m; //x????????????a[]?x????i?j??????n????????
//num???????????m????????
while (1)
{
cin >> m;
if (m == -1) //?????-1?????
break;
else
{
a[1] = m; //??????????????????1
n = 1;
}
for(i = 2; ; i++)
{
cin >> x; //??????????????0?????????????1
if (x == 0)
break;
else
{
a[i] = x;
n = n + 1;
}
}
for (i = 1; i <= n; i++) //????????????????????????1
{
for (j = 1; j <= n; j++)
{
if (a[i] == (2 * a[j]))
num = num + 1;
}
}
cout << num << endl; //???????????
num = 0;
}
return 0;
}
| 12 |
5,508 | void main()
{
int a[20][16],s[20]={0},i,j,k,p=0,n[20]={0};
for(i=0;i<20;i++)
{
scanf("%d",&a[i][0]);
if(a[i][0]==-1) break;
p=p+1;
for(j=1;j<16;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0) break;
s[i]=s[i]+1;
}
}
for(i=0;i<p;i++)
for(j=0;j<=s[i];j++)
for(k=0;k<=s[i];k++)
if(a[i][j]==2*a[i][k]) n[i]=n[i]+1;
for(i=0;i<p;i++)
printf("%d\n",n[i]);
} | 12 |
5,509 | main()
{
int a[16],i,j,k,n,x,y;
for(;;)
{
j=0,n=0;
scanf("%d",&a[0]);
if(a[0]==-1)
break;
for(i=1;i<16;i++)
{
scanf("%d",&a[i]);
j++;
if(a[i]==0)
break;
}
for(i=0;i<j;i++)
{
for(k=i+1;k<j;k++)
{
x=a[i]%a[k];
y=a[i]/a[k];
if((x==0)&&(y==2))
n++;
}
}
for(i=j-1;i>=0;i--)
{
for(k=i-1;k>=0;k--)
{
x=a[i]%a[k];
y=a[i]/a[k];
if((x==0)&&(y==2))
n++;
}
}
printf("%d\n",n);
}
return 0;
} | 12 |
5,510 |
int main(int argc, char* argv[])
{
int i, num;
int sz[100] = {0};
int j,k;
int geshu=-1;
while(1)
{
i = 0;
scanf("%d",&num);
if ( num == -1 )
break;
sz[0] = num;
while(1)
{
if ( sz[i] == 0 )
break;
i++;
scanf("%d",&sz[i]);
}
for(k=0;k<=i;k++){
for(j=0;j<=i;j++){
if(sz[j]==2*sz[k]){
geshu=geshu+1;
}
}
}
printf("%d\n",geshu);
geshu=-1;
}
return 0;
}
| 12 |
5,511 | int main()
{
int a[16] = {0}, i = 1, num[16] = {0}, s, k = 0;
while (cin >> s)
{
a[i] = s;
if (a[i] == 0) {i = 0; k++; continue;}
if (a[i] == -1) break;
for (int j = 0 ; j <= i ; j++)
{
if (a[i] == 2 * a[j] || a[j] == 2 * a[i])
num[k]++;
}
i++;
}
for (i = 0 ; i < k ; i++)
{
cout << num[i] <<endl;
}
return 0;
} | 12 |
5,512 | int main()
{
int a[16], i, j, k, count = 0;
while(1)
{
cin >> a[0];
if (a[0] == -1)
break;
for (i = 1; i <= 15; i++)
{
cin >> a[i];
if (a[i] == 0)
break;
}
for (j = 0; j <= i - 2; j++)
{
for (k = j + 1; k <= i - 1; k++)
{
if (a[k] / a[j] == 2 && a[k] % a[j] == 0 || a[j] % a[k] == 0 && a[j] / a[k] == 2)
count++;
}
}
cout << count << endl;
count = 0;
}
return 0;
}
| 12 |
5,513 | //*********************************
//* ?????? **
//* ???1.cpp **
//* ????????? **
//* ???2012.10.31 **
//*********************************
int main()
{
int i = 0, j, k, n, t = 0;
int a[16]; //??????
while (cin >> n) //???n?????????
{
if (n != 0) //???????0?????????????
{
a[i] = n;
i++;
}
else //??????0????????
{
for (j = 0; j < i - 1; j++) //??????????????????
{
for (k = j + 1; k <= i - 1; k++) //??????????????????
{
if (a[k] == 2 * a[j] || a[j] == 2 * a[k]) //????2?????t?1
t ++;
}
}
cout << t << endl; //??t???
t = 0; //???????????t???0
i = 0; //i???0
}
}
return 0;
}
| 12 |
5,514 | int main()
{
int a[20]={0};
int i,j,k;
while(1)
{
int num=0;
cin>>a[1];
if(a[1]==-1) break;
for(i=2;;i++)
{
cin>>a[i];
if(a[i]==0) break;
}
for(j=1;j<i;j++)
{
for(k=j;k<i;k++)
{
if(a[j]==2*a[k]||a[k]==2*a[j])
num++;
}
}
cout<<num<<endl;
}
return 0;
} | 12 |
5,515 | int main()
{
int i,j;
while(1)
{
int array[16]={0};
int n=0,sum=0;
while(1)
{
cin>>array[n];
if(array[n]==0 || array[n]==-1)
{
n--;
break;
}
n++;
}
if(array[0]==-1)
break;
for(i=0;i<=n;++i)
{
for(j=i;j<=n;++j)
{
if((array[i]==array[j]*2) || (array[j]==array[i]*2))
{
sum++;
}
}
}
cout<<sum<<endl;
}
return 0;
}
| 12 |
5,516 |
main()
{
int c[100];
int m,z;
for(m=0;;m++){
int i,j,k,n;
int a[17],b[17];
n=0;
scanf("%d",&a[0]);
b[0]=2*a[0];
if(a[0]==-1){
goto end;
}
else{
for(i=1;a[i-1]!=0;i++){
scanf("%d",&a[i]);
if(a[i]==-1){
goto end;
}
b[i]=2*a[i];
}
for(j=0;j<i-1;j++){
for(k=0;k<i-1;k++){
if(b[k]==a[j])
n++;
}
c[m]=n;
}
}
}
end: for(z=0;z<m;z++)
printf("%d\n",c[z]);
} | 12 |
5,517 |
int main(){
int n=0,a[16],i=0,count=0;
for(;;n++){
scanf("%d",&a[n]);
if(a[n]==0){
printf("%d\n",count);
memset(a,0,sizeof(a));
n=0;
count=0;}
if(a[n]==-1)
break;
int ifOdd = a[n]%2;
for(i=0;i<n;++i){
if(ifOdd == 0)
if(a[i]==a[n]/2)
count++;
if(a[i]==a[n]*2)
count++;
}
}
} | 12 |
5,518 | /***************************
No.1200012819
Name ???
Date 2012-10-31
***************************/
int main()
{
int a[16] = {0}; //?????16????????????0?
while (1) //????????????-1??????
{
int i = 0,num = 0,p = 0; //?????????????????????
while (1) //??????????a?????????????0??????
{
cin >> a[i];
if (a[i] <= 0) //????????????????
break;
i++; //??i???
}
if (a[0] == -1) //??????-1??????
break;
for (int j = 0;j < i;j++) //??a[0]?a[i-1]????????????a[0]?a[i-1]????????
{
p = j;
for (int k = 0;k < i;k++)
{
if (a[p] * 2 == a[k])//??????nun ?1?
num++;
}
}
cout << num << endl;
}
return 0;
}
| 12 |
5,519 |
int main()
{
int i, j, end, k;
float a[1000];
int n[100];
int num[100];
for(i=0; i<100; i++)
{
num[i]=-1;
}
i=0;
j=1;
n[0]=-1;
for(i=1; i<100; i++)
{
n[i]=0;
}
end=0;
for(i=0; i<1000; i++)
{
scanf("%f", &a[i]);
if(a[i]==-1)
{
end=i;
break;
}
}
for(i=0; i<end; i++)
{
if(a[i]==0)
{
n[j]=i;
j++;
}
}
k=1;
while(n[k]!=0)
{
num[k]=0;
for(i=n[k-1]+1; i<n[k]; i++)
{
for(j=n[k-1]+1; j<n[k]; j++)
{
if(a[i]/a[j]==2)
{
num[k]++;
}
}
}
k++;
}
k=1;
while(num[k]!=-1)
{
printf("%d\n", num[k]);
k++;
}
return 0;
} | 12 |
5,520 |
int main()
{
int i,j,c,m,a[17];
while (1)
{
for (i=1;i<=16;i++)
{
a[i]=0;
m=0;
}
for (i=1;i<=16;i++)
{
scanf("%d",&a[i]);
if (a[i]==-1) return 0;
if (a[i]==0)
{
c=i;
break;
}
}
for (i=1;i<c;i++)
for (j=i;j<c;j++)
{
if (a[i]==2*a[j]||a[j]==2*a[i]) m++;
}
printf("%d\n",m);
}
return 0;
}
| 12 |
5,521 | int main()
{
int a[15],i=1,j,k,*p,count=0;
scanf("%d",&a[0]);
while(a[0]!=-1)
{
for(i=1;;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
break;
}
p=a;
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(p[j]==p[k]*2)
count++;
}
}
printf("%d\n",count);
count=0;
scanf("%d",&a[0]);
}
return 0;
} | 12 |
5,522 | int main()
{
float a[100];
int i,j,t;
do{
t=0;
for(i=0;i<=99;i++)
{
scanf("%f",&a[i]);
if(i>=1)
{
if(a[i]==0)
break;
for(j=0;j<=i-1;j++)
{
if((a[i]==2*a[j])||(a[i]==a[j]/2))
t=t+1;
}
}
}
if(a[0]!=-1)
printf("%d\n",t);
}while(a[0]!=-1);
return 0;
}
| 12 |
5,523 | //********************************
//*????? **
//*?????? **
//*???2012.10.29**
//********************************
int main()
{
int a[16], whether, number = 0, numofpairs = 0;
//????a[16]?????NumOfPairs
//whether?????????number?????????
do
{
for ( int i = 0; i < 16; i++)
{
cin >> a[i]; //????
if (a[i] == -1)
{
whether = 0; break;
} //???-1?????????????
else if (a[i] == 0)
{
whether = 1; break;
} //???0???????????
number++; //??????
} //end??
if (whether) //????-1???????
{
for (int j = 0; j < number; j++)
{
for (int k = 0; k < number; k++)
{
if (a[k] == 2 * a[j]) numofpairs++;
} //??????????
}
cout << numofpairs << endl; //??????
}
numofpairs = 0; number = 0; //?????????
} while (whether == 1); //???-1?????
return 0;
}
| 12 |
5,524 | int main()
{
int a[17];
int i, j, n, nn, count;
nn=0;
while(cin >> a[1] && a[1] != -1)
{
nn++;
count = 0;
for (n = 2; n <= 16; n++)
{
cin >> a[n];
if (a[n] == 0)
break;
}
for (i = 1; i <= n - 1; i++)
{
if (a[i] % 2 == 0)
for (j = 1; j <= n - 1; j++)
if (a[j] * 2 == a[i])
count++;
}
cout << count << endl;
}
return 0;
} | 12 |
5,525 | int main()
{
int a[16],i,k,j,sum=0,m;
for(k=1; ;k++)
{
sum=0;
scanf("%d",&a[0]);
if(a[0]==-1) break;
if(a[0]!=-1)
{
for(i=1; ;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{
m=i;
break;
}
}
}
for(i=0;i<m-1;i++)
{
for(j=i+1;j<m;j++)
{
if(a[i]==2*a[j]||a[j]==2*a[i])
sum=sum+1;
}
}
printf("%d\n",sum);
}
return 0;
} | 12 |
5,526 | int main()
{
int i, num, s, a[101];
while(1)
{
scanf("%d",&s);
if(s==-1) break;
num=0;
for(i=0;i<101;i++)
a[i]=0;
a[s]=1;
while(scanf("%d",&s)==1&&s!=0)
a[s] = 1;
for(i=0;i<50;i++)
if(a[i]==1&&a[2*i]==1)
num++;
printf("%d\n",num);
}
return 0;
} | 12 |
5,527 | int a[16], n=0;
int do_LB(){
int i, j, c=0;
for(i=0; i<n; ++i)
for(j=i+1; j<n; ++j)
if(a[i]==a[j]+a[j] || a[j]==a[i]+a[i]) c++;
n=0;
return c;
}
int main(){
int cin;
do{
scanf("%d", &cin);
if(cin == -1) return;
if(cin == 0) printf("%d\n", do_LB());
a[n++] = cin;
}while(1);
}
| 12 |
5,528 |
int main()
{
int a[20],i=0,j,count=0;
while(cin>>a[i])
{
if(a[i]==0)
{
cout<<count<<endl;
count=0;
i=0;
continue;
}
if(i!=0)
{
for(j=0;j<i;j++)
{
if( a[j]==2*a[i]||a[i]==2*a[j])
{count++;}
}
}
i++;
}
return 0;
}
| 12 |
5,529 | int main()
{
int i,j,k=1,flag=1;
int a[16]={0};
int c[100]={0};
while(flag)
{
for(i=1;i<16;i++)
{
scanf("%d",&a[i]);
if(a[i]==-1){flag=0;break;}
if(a[i]==0){k++;break;}
for(j=i-1;j>0;j--)
{
if(a[i]==2*a[j]||2*a[i]==a[j])c[k]++;
}
}
}
for(i=1;k>0&&i<k;i++)printf("%d\n",c[i]);
return 0;
} | 12 |
5,530 | int main()
{
int a[16], i, j, k, count; //????a???????count????????????
while(1)
{
for ( i = 0; ; i++ )
{
cin>>a[i]; //????
if ( a[i] == 0 ) //????0?????????
break;
if ( a[0] == -1)
break;
}
if ( a[0] == -1 ) //????????-1???????
break;
count = 0; //?count??0
for ( k = 0; k < i; k++ )
for ( j = 0; j < i; j++ )
if ( ( a[k] == 2 * a[j] ) || ( a[j] == a[k] * 2 ) )
count++; //????????????
cout<<count/2<<endl;
}
return 0;
}
| 12 |
5,531 | void main()
{
int a[16],i,sum=0,b,j,k,m;
scanf("%d ",&b);
while(b!=-1)
{
a[0]=b;i=0;
while(a[i]!=0)
{
i++;
scanf("%d ",&a[i]);
}
for(j=1;j<i;j++)
{
for(k=0;k<i-j;k++)
{
if(a[k]>a[k+1])
{
m=a[k];
a[k]=a[k+1];
a[k+1]=m;
}
}
}
for(j=0;j<i-1;j++)
{
for(k=j+1;k<i;k++)
{
if(2*a[j]==a[k])
sum++;
}
}
printf("%d\n",sum);sum=0;
scanf("%d",&b);
}
}
| 12 |
5,532 | int main()
{
double a[15] , num , cnt ;
int i;
for(int n = 0 ; n <= 99999 ; n++)
{
cnt = 0;
for( i = 0 ; i <= 15 ; i++)
{
cin >> num;
if(num == 0)break;
else
a[i] = num;
}
if(a[0] == -1)break;
else
{
for(int j = 0 ; j <= i - 1 ; j++)
for(int k = 0 ; k <= i - 1 ; k++)
if(a[j] == 2 * a[k])
cnt++;
}
cout << cnt << endl;
}
return 0;
} | 12 |
5,533 | int main()
{
int a[16] , i, j, k, temp, num[100];
for(k = 0;k <= 99;k++)
{
num[k] = 0;
for(i = 0;i <= 15;i++)
{
a[i] = 0;
}
for(i = 0;i <= 15;i++)
{
cin >> a[i];
if (a[i] <= 0)
break;
}
if(a[0] < 0)
break;
for(j = 0;j <= 13;j++)
{
for(i = 0;i <= 13 - j;i++)
{
if ( a[i] < a[i+1] )
{
temp = a[i], a[i] = a[i+1], a[i+1] = temp;
}
}
}
for(i = 0;i <= 13;i++)
{
for(j = 1;j <= 14 - i; j++)
{
if(a[i] == 2 * a[i+j] && a[i+j] > 0)
num[k] = num[k] + 1;
else
num[k] = num[k];
}
}
}
for(i = 0;i <= k-1;i++)
{
cout << num[i] << endl;
}
} | 12 |
5,534 |
int main()
{
int i,j,m,n,a,result[20]={0};
double num[15];
scanf("%lf",&num[0]);
for(a=1;num[0]!=-1;a++)
{
for(i=1;;i++)
{
scanf("%lf",&num[i]);
if(num[i]==0) break;
}
for(j=0;j<i;j++)
{
for(m=0;m<=i;m++)
if(num[m]/num[j]==2) result[a]++;
}
scanf("%lf",&num[0]);
}
for(j=1;j<a;j++) printf("%d\n",result[j]);
return 0;
}
| 12 |
5,535 | void main()
{
int a[100][16],i,j,k,l,m,s[100];
for(i=0;i<100;i++)
{
for(j=0;j<16;j++)
{scanf("%d",&a[i][j]);
if(a[i][j]==0||a[i][j]==-1) break;}
if(a[i][j]==-1) break;
}
for(k=0;k<i;k++)
{ for(l=0;l<16;l++)
{ for(m=0;m<16;m++) if((a[k][m]!=0)&&(a[k][l]/a[k][m]==2)&&(a[k][l]%a[k][m]==0)) s[k]++;}
}
for(k=0;k<i;k++)
printf("%d\n",s[k]);
}
| 12 |
5,536 |
int main(int argc, char* argv[])
{
int p;
for(p=1;p<=100;p++){
int a[17];
int u,i=0;
for (u=1;u<=16;u++){
scanf("%d",&a[u]);
i++;
if (a[u]==0){
break;
}
}
if (a[1]==-1){
break;
}
int j,k,t;
for(j=1;j<i-1;j++){
for(k=j+1;k<i;k++){
if(a[j]>a[k]){
t=a[k];
a[k]=a[j];
a[j]=t;
}
}
}
int r,s,w=0;
for(r=1;r<i-1;r++){
for(s=r+1;s<=i-1;s++){
if(a[r]*2==a[s]){
w=w+1;
break;
}
}
}
printf("%d\n",w);
}
return 0;
}
| 12 |
5,537 | int main()
{
int a[100] = {0};
int i, num, n;
while(1)
{
for (i = 1; i <= 100; i++)
a[i] = 0;
do
{
cin >> num;
a[num] = 1;
}while ( num != 0 && num != -1);
if (num == -1)
break;
n = 0;
for (i = 0; i <= 50; i++)
if (a[i] && a[2 * i])
n++;
cout << n - 1 <<endl;
}
return 0 ;
}
| 12 |
5,538 | //************************************************************
//* ??????? *
//* ???????2?15???????????????????*
//* ?????????????????????????*
//* ? ????? *
//* ? ??2013.10.30 *
//************************************************************
int main()
{
int num[16] , i , k , j , count;
for(;;) //????
{
i = -1 ; //?????i?count
count = 0 ;
do
{
i ++ ;
cin >> num[i] ; //???i+1??
if ( num[0] == -1 ) //?????????-1???
return 0 ;
}
while ( num[i] != 0 ) ; //????0??
for ( j = 0 ; j <= i-1 ; j++ )
{
for ( k = j ; k <= i-1 ; k ++ )
{
if ( ( num[j] == 2 * num[k] ) || ( num[j] * 2 == num[k] ) ) //????
count ++ ; //??
}
}
cout << count << endl ; //??
}
} | 12 |
5,539 | int main()
{
int a[16];
int i, j, count = 0;
while(true)
{
cin >> a[0];
if(a[0] == -1)
break;
i = 1;
while(true)
{
cin >> a[i];
if (a[i] == 0)
break;
i ++;
}
count = 0;
for(i = 0; a[i] != 0; i ++)
{
for(j = 0; a[j] != 0; j ++)
{
if (a[i] * 2 == a[j])
count ++;
}
}
cout << count << endl;
}
return 0;
} | 12 |
5,540 | int main()
{
int a,b[100][15],c,i,m,x,y,n,e;
c=0;
i=0;
for(m=0;m<16;m++){
scanf("%d",&a);
if(a!=0){
b[i][m]=a;
}
if(a==0){
for(x=0;x<m;x++){
for(y=0;y<m;y++){
n=b[i][x]/b[i][y];
e=b[i][x]%b[i][y];
if(n==2&&e==0){
c++;
}
}
}
printf("%d\n",c);
c=0;
m=-1;
i++;
}
if(a==-1)
break;
}
return 0;
}
| 12 |
5,541 | int main()
{
int a[100][16]={0};
int i=0,j=0,p=0,k=0,num=0;
do
{
for(j=0;j<16;j++)
{
scanf("%d",&a[p][j]);
if(a[p][j]==0||a[p][j]==-1)
break;
}
p++;
}
while(a[p-1][0]!=-1);
p--;
for(i=0;i<p;i++)
{
for(j=0;a[i][j]!=0;j++)
{
for(k=0;a[i][k]!=0;k++)
{
if(2*a[i][k]==a[i][j])
num++;
}
}
printf("%d\n",num);
num=0;
}
return 0;
}
| 12 |
5,542 | void main()
{
int a[101][101]={{0}},count=0,i,j,q,n,b;
for(i=1;i<=100;i++)
{
scanf("%d",&b);
if(b!=-1)
{
a[i][1]=b;
for(j=2;j<=100;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0)
{a[i][j]=0;break;}
}
}
else break;
}
n=i-1;
for(i=1;i<=n;i++)
{
count=0;
for(j=1;j<=100;j++)
{
if(a[i][j]!=0)
{
for(q=1;q<=100;q++)
{
if(a[i][j]==2*a[i][q])
count=count+1;
}
}
else {break;}
}
printf("%d\n",count);
}
} | 12 |
5,543 | int main()
{
int i,j,k=0;
int sz[16],erbei[16],sum=0;
for(i=0;;i++){
scanf("%d",&sz[i]);
if(0==sz[i]){
for(j=0;j<i;j++){
erbei[k]=2*sz[j];
k++;
}
for(k=0;k<i;k++){
for(j=0;j<i;j++){
if(erbei[k]==sz[j]){
sum++;
}
}
}
printf("%d\n",sum);
sum=0;
i=-1;
k=0;
}
if(-1==sz[i]){
break;
}
}
return 0;
} | 12 |
5,544 | int main()
{
int n=100,m=16,i=1,j,k,t=0;
int a[16];
while(n>0)
{
cin>>a[0];
if (a[0]==(-1))
break;
else
{
while(m>0)
{
cin>>a[i];
if (a[i]==0)
break;
m--;
i++;
}
for(j=0;j<=i-1;j++)
for(k=0;k<=i-1;k++)
{
if (a[j]==2*a[k])
t++;
}
}
cout<<t<<endl;
t=0;
m=16;
i=1;
n--;
}
return 0;
} | 12 |
5,545 | void main()
{
int i,j,l,m=0,c[100][100],f[100]={0};
for(j=1;;j++)
{
scanf("%d",&c[j][1]);
if(c[j][1]==-1) break;
for(i=2;;i++)
{
scanf("%d",&c[j][i]);
if(c[j][i]==0) break;
for(l=i;l>=1;l--)
if(c[j][l]==2*c[j][i]||c[j][i]==2*c[j][l]) f[j]++;
}
m++;
}
for(j=1;j<=m;j++)
printf("%d\n",f[j]);
} | 12 |
5,546 | int main()
{
int i,t,j,k,s=0;
int a[17];
for(scanf("%d",&a[1]);a[1]!=-1;scanf("%d",&a[1]))
{
for(i=2;;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{
t=i-1;
break;
}
}
for(j=1;j<=t;j++)
{
for(k=1;k<=t;k++)
{
if(a[j]==2*a[k])
s=s+1;
}
}
printf("%d\n",s);
s=0;
}
return 0;
} | 12 |
5,547 | int main(){
int a[100][100],t=0,i,j,k,num;
for(i=0;i<100;i++)
{
scanf("%d",&a[t][i]);
if(a[t][i]==0) t++;
else if(a[t][i]==-1) break;
}
for(k=0;k<t;k++)
{
num=0;
for(i=0;i<100;i++)
{
for(j=0;j<100;j++)
{
if(a[k][j]==2*a[k][i]&&a[k][i]!=0)
num++;
}
}
printf("%d\n",num);
}
return 0;
}
| 12 |
5,548 | //????1.cpp
//??????
//???1200062704
//???????????
int main()
{
int a[16] = {0};
int i, j, num = 0;
while(1)
{
for(i = 0; i < 16; i++)
{
cin >> a[i];
if(a[i] == 0 || a[i] == -1)
{
break;
}
if(i > 0)
{
for(j = 0; j < i; j++)
{
if(a[i] * 2 == a[j] || a[j] * 2 == a[i])
{
num++;
}
}
}
}
if(a[0] == -1)
{
break;
}
cout << num << endl;
num = 0;
}
return 0;
}
| 12 |
5,549 | int main()
{
int an[50],*p,i,t=0,*q;
for(i=0;;)
{
scanf("%d",&an[i]);
if(an[i]==-1) break;
else
{
for(i=1;;i++)
{
scanf("%d",&an[i]);
if(an[i]==0) break;
}
for(p=an;*p!=0;p++)
{
for(q=an;*q!=0;q++)
if(*q==(*p)*2) t++;
}
printf("%d\n",t);
t=0;
}
i=0;
}
return 0;
} | 12 |
5,550 | int main ()
{ int i,j,k,num,a[16],c;
while (1)
{ i=0;num=0;
do
{scanf("%d",&a[i]);c=a[i];i++;}
while(c!=0&&c!=-1);
if(a[0]==-1)break;
for(j=0;j<i-1;j++)
{for(k=0;k<i-1;k++)
if(a[j]==2*a[k]) num++;}
printf("%d\n",num);
}return 0;
}
| 12 |
5,551 | int main()
{
int a[30];
int i,m,j,temp,n;
int k=0;
for (i=0;i<300;i++)
{
scanf ("%d",&a[0]);
if (a[0]==-1)
{
break;
}
else
{
for (j=1;j<30;j++)
{
scanf("%d",&a[j]);
if (a[j]==0)
{
break;
}
}
for (m=0;m<j;m++)
{
for (n=0;n<j-1;n++)
{
if (a[n]==2*a[n+1])
{
k++;
}
temp=a[n];
a[n]=a[n+1];
a[n+1]=temp;
}
}
printf("%d\n",k);
k=0;
j=-1;
}
}
return 0;
} | 12 |
5,552 | // ???:??
// ??:????
// ????:2011.10.25
int main()
{
int a[16], i, j, temp, count ;
i=0;
while (cin>>a[0])
{
count=0;
if (a [0] == -1)
break;
i=1;
while (cin >> a [i])
{
if (a [i] < 1)
{
temp = i;
break;
}
i ++;
}
for (i = 0; i < temp - 1; i ++)
{
for (j = i + 1; j < temp ; j ++)
{
if (a [i] == 2 * a [j] || a [j] == 2 * a [i])
{
count ++;
}
}
}
cout << count << endl;
}
return 0;
}
| 12 |
5,553 | int main()
{
int a[16],i,j,k,l;
do
{
i = 0;
l = -1;
for(j = 0;j <= 15;j++)
a[j]=1;
do
{
cin >> a[i];
i++;
if(a[0] == -1)
break;
}while(a[i-1]!=0);
if(a[0] == -1)
break;
for(j = 0;j <= i-1;j++)
{
for(k = 0;k <= i-1;k++)
{
if(a[j] == 2 * a[k])
l++;
}
}
cout << l << endl;}while(a[0]!=-1);
return 0;
}
| 12 |
5,554 | int main()
{
int s[100][15],i,j,n,m,a[100],p,b[100]={0};
for (i=0;;){
for (j=0;;){
scanf("%d",&s[i][j]);
if (s[i][j]==0) {a[i]=j+1;i++;break;}
else if (s[i][j]==-1) break;
else j++;
}
if (s[i][j]==-1) break;
}
for (m=0;m<i;m++){
for (n=0;n<a[m]-1;n++){
for (p=0;p<a[m]-1;p++){
if (s[m][p]==2*s[m][n]) b[m]++;
}
}
}
for (m=0;m<i;m++){
printf("%d\n",b[m]);
}
} | 12 |
5,555 |
int main()
{
int num[100][100];
int i=0,j,k=0;
int line,column[100]={0};
int tmp,count;
for(j=0;j<100;j++)
{
scanf("%d",&num[i][j]);
if(num[i][j]==-1) break;
if(num[i][j]==0)
{
i++;j=-1;
}
else column[i]++;
}
line=i-1;
for(i=0;i<=line;i++)
{
tmp=num[i][k];
count=0;
for(j=k+1;j<column[i];j++)
{
if((tmp*2==num[i][j])||(num[i][j]*2==tmp))
{
count++;
}
if(j==column[i]-1&&k<column[i]-2)
{
k++;
tmp=num[i][k];
j=k;
}
}
k=0;
printf("%d\n",count);
}
}
| 12 |
5,556 | int main ()
{
int i, j , k , l ;
for ( l = 1 ; ; l ++ )
{
i = 0 ;
int a[20] , num = 0;
do
{
i ++ ;
cin >> a[i];
}while ( a[i] > 0 );
if ( a[i] == -1 )
{
break ;
}
else
{
for ( j = 1 ; j < i ; j ++ )
{
for ( k = 1 ; k < i ; k ++ )
{
if ( a[j] == 2 * a[k] )
{
num ++;
}
}
}
cout << num << endl ;
}
}
return 0 ;
} | 12 |
5,557 |
int main()
{
int a[15] ;
int i, NO, tmp , n ,j ;
while(1)
{
n=0;
scanf("%d",&tmp);
a[0]=tmp;
if(tmp == -1) break;
NO = 0;
//for(i = 0; i < 101; i++) a[i] = 0; //a[i] ??i???? ? 0?????1???? ??????????
// a[tm] = 1;
while(1)
{
scanf("%d",&tmp);
if(tmp==0)break;
a[++n] = tmp; // ???tmp??tmp??????1
}
for(i = 0; i < n ; i++)
for( j=i+1 ; j<=n ; j++ )
if( a[j]==2*a[i]||a[i]==2*a[j] ) NO++;
printf("%d\n",NO);
}
getchar();
getchar();
}
| 12 |
5,558 | int main()
{
int i=0,j=0,num[16]={0},count=0,key=0;
cin>>num[0];
while(num[0]!=-1)
{
for(i=0;num[i]!=0;i++)
{
cin>>num[i+1];
}
count=i;
key=0;
for(i=0;i<count;i++)
for(j=i;j<count;j++)
if(num[i]==2*num[j]||num[j]==2*num[i])
key++;
cout<<key<<endl;
for(i=0;i<16;i++)
num[i]=0;
cin>>num[0];
}
return 0;
} | 12 |
5,559 | int main()
{
int x[16],i,j,k,a;
while(1){
for(i=0;i<16;i++)x[i]=0;
for(i=0;scanf("%d",&x[i]),~x[i];i++)if(!x[i])break;
if(x[0]==-1)break; else
for(a=0,j=1;j<i;j++)
for(k=0;k<j;k++)
if(x[k]==2*x[j]||x[j]==2*x[k])a++;
printf("%d\n",a);
}
return 0;
} | 12 |
5,560 |
int main()
{
int i, j, n, count;
float a[20];
while(1)
{
scanf("%f", &a[0]);
if (a[0] == -1)
break;
n=1;
while(1)
{
scanf("%f", &a[n]);
if (a[n] == 0)
break;
n++;
}
count=0;
for (i=0; i<n; i++)
{
for (j=i+1; j<n; j++)
{
if ((a[i]/a[j]==2.0) || (a[j]/a[i]==2.0))
count++;
}
}
printf("%d\n", count);
}
return 0;
} | 12 |
5,561 | int main()
{
int n=0,sz[100],erbei[100],*p1,*p2,sum=0;
p1=sz;
p2=erbei;
for(p1=sz;;p1++){
scanf("%d",p1);
n++;
if(*p1==0){
for(p1=sz;p1<sz+n-1;p1++){
*p2=*p1*2;
p2++;
}
for(p2=erbei;p2<erbei+n-1;p2++){
for(p1=sz;p1<sz+n-1;p1++){
if(*p2==*p1){
sum++;
}
}
}
printf("%d\n",sum);
p1=sz-1;
p2=erbei;
sum=0;
n=0;
}
if(*p1==-1){
break;
}
}
return 0;
} | 12 |
5,562 | int a[16]={0};
int main()
{
while(cin>>a[0])
{
if(a[0]==(-1)) break;
int i,j,k,countnumber=0,countpair=0;
for(i=1;i<=15;i++)
{ cin>>a[i];
if(a[i]==0) break;}
countnumber=i+1;
for(i=0;i<countnumber-1;i++)
for(j=i+1;j<countnumber;j++)
{ if((a[i]==2*a[j])||(a[j]==2*a[i])) countpair++;
}
cout<<countpair<<endl;
}
return 0;
} | 12 |
5,563 | void main()
{
int a=16,i,j,k,n=15,b[16],num=0,t=0;
ahead: for(i=0;i<a;i++)
{
scanf("%d",&b[i]);
t++;
if(b[i]==0)
{
t--;
break;
}
if(b[i]==-1)
{
return;
}
else continue;
}
for(i=0;i<t;i++)
{
k=i;
for(j=i;j<t;j++)
{
if((b[j+1]-2*b[i]==0)||(b[i]-2*b[j+1]==0))
{
num=num+1;
}
else continue;
}
}
printf("%d\n",num);
num=0;
t=0;
goto ahead;
return;
} | 12 |
5,564 | //********************************
//*????? **
//*?????? 1300062706 **
//*???2013.10.30**
//********************************
int main()
{
int a[16], num, i, j, k, n, cnt = 0;
while (cin >> num)
{
if (num == -1)
break;
for (i=0;i<=15;i++)
{
if (num == 0)
break;
a[i] = num;
cin >> num;
}
for (j=0;j<i-1;j++)
{
for (k=1;k<i-j;k++)
{
if ((a[j] == 2 * a[j+k])||(a[j+k] == 2 * a[j]))
cnt ++;
}
}
cout << cnt << endl;
cnt = 0;
}
return 0;
}
| 12 |
5,565 | int main(){
int c,a[20],t,sum;
while(1){
t=sum=0;
while(1){
scanf("%d",&c);
if(!c || c==-1)break;
a[t++]=c;
}
if(c==-1)break;
for(int i=0;i<t;i++)
for(int j=0;j<t;j++)
if(a[j]==a[i]*2)sum++;
printf("%d\n",sum);
}
return 0;
} | 12 |
5,566 | int f(int h)
{
int a[15],i,j,n,m=0;
a[0]=h;
if(a[0]==-1)return -1;
else
{
for(i=1;i<=15;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)break;
}
n=i;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(a[i]==a[j]*2)
{
m+=1;
break;
}
}
}
return(m);
}
}
void main()
{
int a[100],h,i=0;
while(1)
{
scanf("%d",&h);
a[i]=f(h);
if(a[i]==-1)break;
i++;
}
printf("%d",a[0]);
for(i=1;a[i]!=-1;i++)
{
printf("\n%d",a[i]);
}
}
| 12 |
5,567 |
int main(int argc, char* argv[])
{
int i,j,t=-1,s=0;
int a[10000];
for(i=0;i<=10000;i++)
{
scanf("%d",&a[i]);
if(a[i]==-1)
break;
else if(a[i]==0)
{
t=i;
printf("%d\n",s);
s=0;
}
else
{
for(j=t+1;j<i;j++)
{
if(a[i]==2*a[j]||a[j]==2*a[i])
s=s+1;
}
}
}
return 0;
} | 12 |
5,568 | void main()
{
int x[100][15],a[100],b[100]={0},m,i,j,k;
for(i=0;;i++)
{
for(j=0;i<15;j++)
{
scanf("%d",&x[i][j]);
if(x[i][j]==0||x[i][j]==-1)
{a[i]=j;break;} //a[i]???i??????
}
if(x[i][j]==-1) {m=i;break;} //m??????????
}
for(i=0;i<m;i++)
{
for(j=0;j<a[i];j++)
{
for(k=0;k<a[i];k++)
{
if((float)x[i][k]/(float)x[i][j]==2.0) b[i]++; //b[i]???i???????????
}
}
}
for(i=0;i<m;i++)
printf("%d\n",b[i]);
return;
} | 12 |
5,569 | /* 1134 ??
?????? 2010.11.03 */
int main()
{
int i, j, l, k, s, t;
int a[100000] = {0}, b[100000];//b?????????
for(i = 0; i < 100000; i++)
{
cin >> a[i];
if(a[i] == -1)
break;
}
s = 0;//s????????????
for(i = 0; i < 100000; i++)
{
t = 0;//t????????????
for(j = 0; j < 10000; j++)
{
b[j] = a[s];
s++;
if(b[j] == 0)
{
for(k = 0; k <= j; k++)
for(l = k + 1; l <= j; l++)
if((b[k] == 2 * b[l]) || (b[l] == 2 * b[k]))
t++;
cout << t << endl;
break;
}
}
if(a[s] == -1)
break;
}
return 0;
}
| 12 |
5,570 | void main()
{int a[16],i,j,k,m,n;
for(m=0;;m++)
{ for(i=0;i<16;i++)
{ scanf("%d",&a[i]);
if(a[i]==-1) return;
if(a[i]==0) break;
}
n=0;
for(j=0;j<i;j++)
for(k=0;k<i;k++)
if(a[j]==2*a[k])
n++;
printf("%d\n",n);
}
} | 12 |
5,571 | int main()
{
int a[16];
int i,j,num;
while(1)
{
for(i=0;i<16;i++)
{
cin>>a[i];
if(a[0]==-1)
return 0;
if(a[i]==0)
break;
}
num=0;
for(i=0;a[i];i++)
for(j=0;a[j];j++)
if(a[i]==2*(a[j]))
num++;
cout<<num<<endl;
}
return 0;
} | 12 |
5,572 | int main()
{
int a[16],i,j,s,k,l;
for(l=1;l<3000;l++)
{
s=0;
scanf("%d",&a[0]);
if(a[0]==-1) break;
for(k=1;k<=16;k++)
{
scanf("%d",&a[k]);
if(a[k]==0)break;
}
for(i=0;i<k-1;i++)
{
for(j=i+1;j<k;j++)
if(a[i]==a[j]*2 || a[j]==a[i]*2) s=s+1;
}printf("%d\n",s);
}
return 0;
}
| 12 |
5,573 | int main()
{
int a[100000],i,j,k,h,g,n,sign;
for(i = 1; ; i++)
{
cin >> a[i];
if(a[i] == -1)
break;
}
for(j = 1; j <= i - 1; j++)
{
if(a[j] == 0)
{
for(k = j - 1; k >= 1; k--)
{
if(a[k] == 0)
{
break;
}
}
sign = 0;
for(h = k + 1; h < j; h++)
{
for(g = k + 1; g < j; g++)
{
if(a[h] == 2 * a[g])
sign++;
}
}
cout << sign << endl;
}
}
return 0;
} | 12 |
5,574 | void main()
{
int a[15]={0},i=0,j=0,m=0;
scanf("%d",&a[0]);
while(a[i]!=0)
{
scanf("%d",&a[i+1]);
i=i+1;
}
i=0;
while(a[0]!=-1)
{
while(a[i]!=0)
{
while(a[j]!=0)
{
if(((float)a[j])/((float)a[i])==2)
m=m+1;
j=j+1;
}
j=0;
i=i+1;
}
printf("%d\n",m);
i=0;
m=0;
scanf("%d",&a[0]);
while(a[i]!=0)
{
scanf("%d",&a[i+1]);
i=i+1;
}
i=0;
}
}
| 12 |
5,575 | /*
* liangbei.cpp
*
* Created on: 2010-11-12
* Author: ??
*/
int main()
{
int a[20];
int i;
int n=0;
int num=0;
int j;
while(1)
{
n=0;//??
num=0;
for(i=0;i<20;i++)//??????
{
cin>>a[i];
if(a[i]==0)//????0???????
break;
if(a[i]==-1)//????-1???????
return 0;
n++;//?????????
}
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if(a[i]==2*a[j]||2*a[i]==a[j])//???????????????
num++;//???????
cout<<num<<endl;
}
return 0;
}
| 12 |
5,576 | int main()
{
static int a[16],b[16];
int n,i,j,s=0;
while(scanf("%d",&a[0]),a[0]!=-1)
{
for(i=1;a[i-1]!=0;i++)
{b[i-1]=2*a[i-1];
scanf("%d",&a[i]);}
n=i-2;
s=0;
for(i=0;i<=n;i++)
for(j=0;j<=n;j++)
if(a[i]==b[j])
{
s++;break;
}
printf("%d\n",s);
}
} | 12 |
5,577 | void main()
{
int a[20],i,m,n,k;
for(;;)
{
k=0;
scanf("%d",&a[0]);
if(a[0]==-1)
break;
for(i=1;;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
break;
}
for(m=0;m<i;m++)
for(n=0;n<i;n++)
if(a[m]==2*a[n])
k++;
printf("%d\n",k);
}
}
| 12 |
5,578 | void main()
{
int i,j,m,n,p=0,a[10000][16];
for(j=0;j<10000;j++)
{
for(i=0;i<16;i++)
{
scanf("%d",&a[j][i]);
if((a[j][i]==0)||(a[j][i]==-1))break;
}
if(a[j][0]==-1)break;
}
for(m=0;m<j;m++)
{
i=0;
while(a[m][i]!=0)
{
n=0;
while(a[m][n]!=0)
{
if(a[m][i]==2*a[m][n])
{
p++;
}
n++;
}
i++;
}
printf("%d\n",p);
p=0;
}
} | 12 |
5,579 | void main()
{
int a[15]={1},n,m,i,j,t;
scanf("%d",&a[0]);
while(a[0]!=-1)
{
i=1;n=1;
scanf("%d",&a[1]);
while(a[i]!=0)
{
n++;
i++;
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
/*for(i=0;i<n;i++)printf("%d ",a[i]);
printf("\n");*/
m=0;
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if(a[j]==2*a[i])
{
m++;
break;
}
printf("%d\n",m);
scanf("%d",&a[0]);
}
}
| 12 |
5,580 | void main()
{
int i,j,k,l,x=0,a[20];
while(1)
{
x=0;
scanf("%d",&a[0]);
if(a[0]==-1) break;
for(j=1;a[j-1]!=0;j++)
scanf("%d",&a[j]);
for(k=0;k<j-1;k++)
{
for(l=0;l<j;l++)
{
if(a[l]==2*a[k])
x=x+1;
}
}
printf("%d\n",x);
}
}
| 12 |
5,581 | int main()
{
int i,j,m,n,x;
int sz[16];
while(1)
{
x=0;
for(i=0;i<16;i++){
scanf("%d",&sz[i]);
if(sz[i]==0||sz[i]==-1){
break;
}
}
if(sz[i]==-1){
break;
}
for(m=0;m<=i-2;m++){
for(n=m+1;n<=i-1;n++){
if(sz[m]==2*sz[n]||sz[n]==2*sz[m]){
x++;
}
}
}
printf("%d\n",x);
}
return 0;
}
| 12 |
5,582 | //************************
// 6.1.cpp
// ?? 1200018415
// 2012 10 30
//***********************
int main()
{
int a[16]; // ?????????16??
int i = 1, j, k, n = 0;
while (cin)
{
cin >> a[0]; // ??a?0?
if (a[0] == -1) // ??a?0??-1
break; // ?????????
for (i = 1; ; i++)
{
cin >> a[i]; // ??a?i?
if (a[i] == 0) // ????a?i??0
break; // ??????
k = i; // ??????
}
for (j = 0; j <= k - 1; j++) // ?????j????????????
{
for (i = j + 1; i <= k; i++) // ?j???????????
{
if (a[j] * 2 == a[i] || a[i] * 2 == a[j]) // ????????
n = n + 1; // ???1
}
}
cout << n << endl; // ?????????????
n = 0; // n?????0
}
return 0;
}
| 12 |
5,583 | //* ??
//* ??? 1100012820
//* 20111019
//*******************
int main()
{
int a[16] = {0}, i = 0, n = 0, j, flag = 1;
while(flag)
{
while(1)
{
cin >> a[i];
if (a[i] == (-1))
{
flag = 0;
break;
}
else if (a[i] == 0)
{
for (j = 0; j <= i; j++)
a[j] = 0;
cout << n << endl;
n = 0;
i = 0;
break;
}
else
{
for (j = 0; j < i; j++)
{
if ((a[j] == 2 * a[i]) || (a[i] == 2 * a[j]))
n++;
}
}
i++;
}
}
return 0;
}
| 12 |
5,584 | int main()
{
int l1,l2;
int pair(int n[15]);
int num[15]={0};
for (l1=0;(num[0]!=-1);l1++){
scanf("%d",&num[0]);
for (l2=1;(num[l2-1]!=0)&&(num[0]!=-1);l2++){
scanf("%d",&num[l2]);
}
if (num[0]!=-1) printf("%d\n",pair(num));
}
return (0);
}
int pair(int n[15])
{
int sum,i,j,k,x;
sum=0;
for (i=1;(n[i]!=0);i++){
if (n[i]==(n[0]+n[0])) sum=sum+1;
}
for (j=1;(n[j-1]!=0);j++){
for (k=0;(n[k]!=0);k++){
if (n[k]==n[j]*2) sum=sum+1;
}
}
return(sum);
} | 12 |
5,585 | void main()
{
int i,j,k,time=0,sz[16],tmp,xh,m=0,mp;
for(xh=0;xh<50;xh++)
{
for(i=0;i<16;i++)
{
scanf("%d",&sz[i]);
if(sz[i]==0)
{
for(mp=0;mp<i;mp++)
{
for(j=0;j<i-1;j++)
{
if(sz[j]>=sz[j+1])
{
tmp=sz[j];
sz[j]=sz[j+1];
sz[j+1]=tmp;
}
}
}
for(k=0;k<i;k++)
{
for(j=k;j<i;j++)
{
if(sz[j]==2*sz[k])
{
time++;
}
}
}
printf("%d\n",time);
i=-1;
j=0;
k=0;
time=0;
mp=0;
}
if(sz[i]==-1)
{
m=1;
break;
}
}
if(m==1)
break;
}
}
| 12 |
5,586 |
int number(int a[],int m)
{
int i,j,s=0;
for(i=1;i<=m;i++)
for(j=1;j<=m;j++)
if(a[i]==2*a[j])
s++;
return(s);
}
main()
{
int a[17],b[100];
int i,j=1;
scanf("%d",&a[1]);
while(a[1]!=-1){
for(i=2;i<=16;i++){
scanf("%d",&a[i]);
if(a[i]==0) break;
}
i--;
b[j]=number(a,i);
scanf("%d",&a[1]);
j++;
}
for(i=1;i<=j-1;i++)
printf("%d\n",b[i]);
} | 12 |
5,587 |
int main()
{
int i,j,t,a[16]={0},sum=0,k=0;
while(scanf("%d",&a[0]) && a[0]!=-1){
for(i=1;i<=16;i++){
scanf("%d",&a[i]);
if(a[i]!=0) sum++;
else break;
}
for(i=0;i<=sum;i++){
for(j=i+1;j<=sum;j++){
if(a[i]==2*a[j] || a[j]==a[i]*2) k++;
}
}
printf("%d\n",k);
sum=0;
k=0;
}
return 0;
} | 12 |
5,588 | int main(){
int a[15];
while(cin)
{int temp,num=0,i=0,j=0,k=0;
for(i=0;cin>>a[i];i++)
if(a[i]==-1)
return 0;
else if(a[i]==0)
{for(j=1;j<i;j++)
for(k=0;k<i-j;k++)
if(a[k]>a[k+1])
{temp=a[k];
a[k]=a[k+1];
a[k+1]=temp;
}
for(j=0;j<i;j++)
for(k=j+1;k<i;k++)
if(a[j]*2==a[k])
num++;
cout<<num<<endl;
num=0;
break;}
}
}
| 12 |
5,589 | int main()
{
char exp;
int i,c,t,w,n,s,t2,j,k,a[16];
long m,e;
float x,y;
double r,d,b,h,g[100];
for (; ;)
{
for (i=0;i<=15;i++) a[i]=0;
for (i=0;i<=15;i++)
{
scanf("%d",&a[i]);
if (a[i]==0) break;
if(a[i]==-1) return 0;
}
n=i;
s=0;
for (i=0;i<n;i++)
{
for (j=0;j<n;j++)
if (a[j]==2*a[i]) s=s+1;
}
printf("%d\n",s);
}
return 0;
}
| 12 |
5,590 | int main()
{int a[17]={0};
int i=0,m=0,k=0,j=0;
do{
scanf("%d",&a[0]);
while(a[i]!=0&&a[0]!=-1)
{
i=i+1;
scanf("%d",&a[i]);
}
if(a[0]!=-1)
{
for(j=0;j<i;j++)
{
for(k=i-1;k>j;k--)
{
if(a[k]==2*a[j]||a[j]==2*a[k])
m=m+1;
}
}
printf("%d\n",m);
}
for(j=0;j<i;j++)
a[j]=0;
m=0;
i=0;
}
while(a[0]!=-1);
} | 12 |
5,591 | int main()
{
int a[16],x,i,j,t=0;
for(;;){
x=1;t=0;
scanf("%d",&a[0]);
if(a[0]==-1) break;
else
{
for(i=1; ;i++)
{scanf("%d",&a[i]);
if(a[i]==0) break;x++;
}
for(i=0;i<x-1;i++)
{for(j=i+1;j<=x-1;j++)
{if(a[i]==2*a[j]||a[j]==2*a[i])
t++;
}
}
printf("%d\n",t);}}
} | 12 |
5,592 | int main()
{
int a[20];
int i=0,n=0,j;
int count=0;
do
{
n=0;
count=0;
scanf("%d",&a[0]);
if(a[0]!=-1)
{
i=1;
do
{
scanf("%d",&a[i]);
i++;
count++;
}while(a[i-1]!=0);
for(i=0;i<count;i++)
{
for(j=i+1;j<count;j++)
{
if(a[i]==2*a[j] || 2*a[i]==a[j])
{
n++;
}
}
}
printf("%d\n",n);
}
}while(a[0]!=-1);
return 0;
} | 12 |
5,593 | int main()
{
int a[100000];
int i,j,k;
int m;
int n;
for(i=0;i<100000;i++)
{
cin>>a[i];
if(a[i]==-1)
break;
if(a[i]==0)
{
n=0;
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(a[k]==0)
continue;
if(a[j]==2*a[k])
n=n+1;
}
}
cout<<n<<endl;
a[0]=0;
i=0;
}
}
return 0;
}
| 12 |
5,594 | int main()
{
int i,j,n=0,a[16],shu,sum=0;
while (1)
{
scanf("%d",&shu);
if (shu==-1)
return 0;
else if (shu==0)
{
for (i=1;i<=n;i++)
{
if (a[i]&&a[i]%2==0)
{
for (j=1;j<=n;j++)
if (a[j]==a[i]/2)
sum++;
}
}
printf("%d\n",sum);
sum=0;
n=0;
}
else
{
n++;
a[n]=shu;
}
}
return 0;
} | 12 |
5,595 | int main()
{
int i,j,k,a[100][16],K,I,b[100]={0};
for(i=0; ;i++)
{
scanf("%d",&a[i][0]);
if(a[i][0]==-1) break;
for(j=1; ;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0) break;
}
for(k=0;k<=j-1;k++)
{
for(K=0;K<=j-1;K++)
{
if(a[i][K]==2*a[i][k]) b[i]++;
}
}
}
for(I=0;I<i;I++)
printf("%d\n",b[I]);
return 0;
}
| 12 |
5,596 |
int main(int argc, char* argv[])
{
int num[15];
int i,m;
for(i=0;i<15;i++)
{scanf("%d",&num[i]);
{if(num[i]==0)
break;}
i++;
}
int j=0;
int a;
m=i;
i=a=0;
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{if(num[i]/num[j]==2&&num[i]%num[j]==0)
a++;}
}
printf("%d\n",a);
return 0;
} | 12 |
5,597 | int main()
{
int a[17],i,n,j;
scanf("%d",&a[1]);
while(a[1]>0)
{
n=0;
i=1;
do
{ i++;
scanf("%d",&a[i]);
for(j=1;j<=i;j++)
if(a[i]==a[j]*2||a[j]==a[i]*2)
n++;
}
while(a[i]!=0);
printf("%d\n",n-1);
scanf("%d",&a[1]);
}
}
| 12 |
5,598 | main()
{
int a[16][16],i,j,k,m[16]={0},n,len,sum;
i=0;
do{
i=i+1;
j=0;
do{
j=j+1;
scanf("%d",&a[i][j]);
m[i]=m[i]+1;}while((a[i][j]!=0) && (a[i][j]!=-1));
}while(a[i][1]!=-1);
len=i;
for (i=1;i<len;i++)
{
sum=0;
for (j=2;j<=m[i];j++)
{
for (k=1;k<j;k++)
{if ((a[i][j]==2*a[i][k]) || (a[i][j]*2==a[i][k])) sum=sum+1;
}
}
printf("%d\n",sum);
}
} | 12 |
5,599 | /* ??2?15????????????????????????????????????????????
????1 4 3 2 9 7 18 22???????3???2?1????4?2????18?9????
????
??????????????????????2?15????????100??????????????0??????????????????2?15??????????????????????-1,???????????????????
????
????????????????????????????????????
????
1 4 3 2 9 7 18 22 0
2 4 8 10 0
7 5 11 13 1 3 0
-1
????
3
2
0 */
int main()
{
int num[100][150],i,j,g,h[100],k,m;
for(j=0;;j++)
{
for(i=0;;i++)
{
scanf("%d",&num[j][i]);
if(num[j][0]==-1)
break;
if(num[j][i]==0)
break;
}
if(num[j][0]==-1)
break;
h[j]=i;
}
g=j;
int count[100]={0};
for(j=0;j<g;j++)
{
for(i=0;i<h[j];i++)
{
k=i;
for(m=k;m<h[j];m++)
{
if(((num[j][m]%num[j][k]==0)&&(num[j][m]/num[j][k]==2))||((num[j][k]/num[j][m]==2)&&(num[j][k]%num[j][m]==0)))
count[j]++;
}
}
printf("%d\n",count[j]);
}
return 1;
}
| 12 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.