label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
12 | 5600 | 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 | 5601 | /*
* 1000010175_mte9.cpp
*
* Created on: 2010-11-14
* Author: ???
* function:1134 ??
*/
int main(){
int iNum[20],i,j,n,iPair;
while(1)
{
iPair=0;
memset(iNum,0,80);
cin>>iNum[0];
n=1;
if(iNum[0]==-1) break;
do //??,????0???
{
cin>>iNum[n];
n++;
}while(iNum[n-1]!=0);
n--; //????0????
for(i=0;i<n;i++) //????,???????????
for(j=0;j<n;j++)
if(iNum[j]==iNum[i]*2)
iPair++;
cout<<iPair<<endl;
}
return 0;
} |
12 | 5602 | int main()
{
int a[16], b, i = 0, k;
while (1)
{
b = 0;
int a[16] = {0};
for ( i = 0 ; i <= 15 ; i++ )
{
cin >> a[i];
if (( a[i] == 0 ) || ( a[i] == -1 ))
break;
for ( k = 0 ; k < i ; k++ )
{
if (( a[i] == 2 * a[k] ) || ( a[i] == 0.5 *a[k]))
b++;
}
}
if ( a[i] == -1 )
break;
cout << b <<endl;
}
return 0;
} |
12 | 5603 | int main()
{
int num[15], i, j, k, t, N;
for(i=1 ; ; i++)
{
cin >> num[0];
if(num[0] == -1)
break;
N=0;
for(j=1; ; j++)
{
cin >> num[j];
if(num[j] == 0)
break;
}
for(k=0; k<=j-1; k++)
{
for(t=0; t<=j-1; t++)
{
if(num[k] == 2*num[t])
N++;
}
}
cout << N << endl;
}
return 0;
} |
12 | 5604 | int main()
{
int i, j, a[20], sum = 0; //??????????????????????
while (1)
{
cin >> a[0]; //??????
if(a[0] == -1) break; //?????-1????????
for(i = 1; a[i - 1] != 0; i++) //???????????0??
{
cin >> a[i];
}
for(i = 0; a[i] != 0; i++)
{
for(j = 0; a[j] != 0;j++)
{
if(a[i] == 2 * a[j]) //???????????sum??
sum++;
}
}
cout << sum << endl; //????????
sum = 0; //?sum??
}
return 0;
}
|
12 | 5605 | int main()
{
int sz[16],result[100];
int i,j,k,n=0,row=0;
while(1){
for(i=1;i<16;i++){
sz[i]=0;
}
scanf("%d",&sz[0]);
if(sz[0]==-1){
break;
}else{
k=1;
for(i=1;i<16;i++){
scanf("%d",&sz[i]);
if(sz[i]==0){
break;
}else{
k++;
}
}
n=0;
for(i=1;i<k;i++){
for(j=0;j<i;j++){
if(sz[i]==sz[j]*2||sz[j]==sz[i]*2){
n++;
}
}
}
result[row]=n;
row++;
}
}
for(i=0;i<row;i++){
printf("%d\n",result[i]);
}
return 0;
}
|
12 | 5606 |
void main()
{
int a[MAX][16],b[MAX]={0,0};
int i,j,k,h,m;
int count1,count2;
count2=-1;
for(i=0;i<MAX;i++)
{
count1=-1;
for(j=0;j<16;j++)
{
scanf("%d",&a[i][j]);
if((a[i][j]==0)||(a[i][j]==-1))
break;
count1++;
}
if(a[i][j]==-1)
break;
for(k=0;k<=count1;k++)
{
for(h=0;h<=count1;h++)
{
if(a[i][k]==2*a[i][h])
b[i]++;
else
continue;
}
}
count2++;
}
for(m=0;m<=count2;m++)
printf("%d\n",b[m]);
} |
12 | 5607 | int main()
{
int a,i,j,k,h;
int b[16]={0};
while(1)
{
i=0;
while(cin>>a)
{
if(a==(-1))
return 0;
else
{
if(a!=0)
{
b[i]=a;
i++;
}
else
break;
}
}
h=0;
for(j=0;j<=i-1;j++)
{
if(b[j]!=0)
{
for(k=0;k<=i-1;k++)
{
if(b[j]==b[k]*2)
h++;
}
}
else
break;
}
cout<<h<<endl;
}
return 0;
}
|
12 | 5608 | 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 | 5609 | //*******************************
//????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 | 5610 | /*
* 1000012761_xiaoceyan9.cpp
*??2?15????????????????????????????????????????????
????1 4 3 2 9 7 18 22???????3???2?1????4?2????18?9????
* Created on: 2010-11-16
* Author: 378073652
*/
int main(){
int a[20][20],i,j,b[20],s,n=0,k;
for(i=0;i<20;i++){
for(j=0;j<16;j++){
cin>>a[i][j];
if(a[i][0]==-1) break;
if(a[i][j]==0){ b[i]=j;break;}
}
if(a[i][0]==-1) break;
}
s=i;
for(i=0;i<s;i++){
for(j=0;j<b[i];j++){
for( k=j+1;k<b[i];k++){
if(((a[i][j]%a[i][k]==0)&&(a[i][j]/a[i][k]==2))||((a[i][k]%a[i][j]==0)&&(a[i][k]/a[i][j]==2)))
n=n+1;
}
}
cout<<n<<endl;
n=0;
}
return 0;
}
|
12 | 5611 |
int main()
{
int i,j,k,sum,e=0;
int a[20];
for(;;)
{
sum=0;
for(i=0;;i++)
{
cin>>a[i];
if(a[i]==0)
{
i--;
break;
}
else if(a[i]==-1) {e=-1; break;}
}
if(e==-1) break;
for(j=0;j<=i;j++)
{
for(k=0;k<=i;k++)
{
if(a[k]==a[j]*2)
{
sum++;break;
}
}
}
cout<<sum<<endl;
}
return 0;
} |
12 | 5612 | int main()
{
int sz[16],i,a,num=0,no=0,j;
while(1)
{
scanf("%d",&a);
if(a==-1)
return 0;
else if(a>0)
{
sz[no]=a;
no++;
}
else if(a==0)
{
for(i=0;i<no;i++)
{
for(j=0;j<no;j++)
if(sz[i]==2*sz[j])
num++;
}
printf("%d\n",num);
no=0;
num=0;
}
}
return 0;
} |
12 | 5613 | int main()
{ int a[2000];
int i,m,n,k,lt;
k=0;
lt=0;
for (i=0;i<2000;i ++)
{cin>>a[i];
if (a[i]==-1)
break;
if (a[i]==0)
{for(m=lt;m<i;m++)
{for (n=lt;n<i;n++)
{if (a[m]==2*a[n])
{k++;}
}
}
cout<<k<<endl;
k=0;
lt=i+1;
}
}
return 0;
} |
12 | 5614 | main()
{
int i,j,k,num=0,tot,a[16],b[1000];
do
{
i=0;
tot=0;
do
{
scanf("%d",&a[i]);
i++;
}
while (a[i-1]>0);
if (a[0]!=-1)
{
for (j=0;j<=i-3;j++)
for (k=j+1;k<=i-2;k++)
if (a[j]==2*a[k]||a[k]==2*a[j]) tot++;
b[num]=tot;
num++;
}
}
while (a[0]!=-1);
for (i=0;i<num;i++)
printf("%d\n",b[i]);
return 0;
} |
12 | 5615 | int main()
{
int a[300],i,n,k,j;
for(i=0;i<=300;i++)
{
scanf("%d",&a[i]);
if(a[i]==-1) break;
}
for(k=0;k<=300;k++)
{
if(a[k]==-1)break;
if(a[k-1]==0||k==0)
{
n=0;
for(i=k;a[i]!=0;i++)
{
for(j=i;a[j]!=0;j++)
{
if(a[i]==2*a[j]||a[j]==2*a[i]) n=n+1;
}
}
printf("%d\n",n);
}
}
}
|
12 | 5616 | //***************************
//*????? **
//*?????? 1300013007 **
//*???2013.10.30 **
//***************************
int main()
{
int k, i, m=0, number;
double a[15];
do
{
cin >> number;
if(number == -1)
break;
else
a[0] = number;
for(i=2; ; i++)
{
cin >> number;
a[i-1] = number;
for(k=0; k<i-1; k++)
{
if(a[i-1] == (2 * a[k]) || a[i-1] == (a[k] / 2))
m++;
}
if(number==0)
{
cout << endl << m << endl;
break;
}
}
m = 0;
}while(1);
return 0;
}
|
12 | 5617 |
int iFind(int *p, int findnum)
{
int k, sum = 0;
for (k = 0; k < 15; k++)
{
if (*(p + k) == findnum)
sum ++;
}
return sum;
}
int main()
{
int a[15], temp, i = 0, j, k, *p, sum = 0;
p = a;
for (j = 0; j < 15; j++)
a[j] = -1;
while (cin >> temp, temp != -1)
{
if (temp != 0)
{
a[i] = temp;
i++;
}
else
{
for (k = 0; k < 15; k++)
{
sum += iFind(p, a[k] * 2);
}
cout << sum << endl;
sum = 0;
i = 0;
for (j = 0; j < 15; j++)
a[j] = -1;
}
}
return 0;
}
|
12 | 5618 | /**
* file homwork.cpp
* author ??? 1100012722
* data 2011-10-20
* description ??
*/
int main()
{
int a[20] , b[20] ;
int i , j , k ;
int n ;
i = 1 ; n = 0 ;
while( 1 ) // ??????
{
scanf("%d",&a[i]);
if( a[i] == -1 ) break; // ??-1???????
else if( a[i] == 0 ) // ??0???????
{
for(j = 1 ; j <= i-1 ; j++)
b[j] = a[j] * 2;
for(j = 1 ; j <= i-1 ; j++)
for(k = 1 ; k <= i-1 ; k++)
{
if( b[j] == a[k] ) n++;
}
printf("%d\n",n);
i = 1;
n = 0; // ?????????
}
else i ++; // ?0?-1????
}
return 0;
} |
12 | 5619 | int main ()
{
int array[15];
int i,j,temp,min,flag,twice;
for(;;)
{
for(i=0;i<15;i++)
array[i]=0;
for(i=0;;i++)
{
scanf("%d", &temp);
if(temp==-1)
return 0;
if(temp==0)
break;
array[i]=temp;
}
// ??
for(i=0;i<15;i++)
{
min=array[i];
for(j=i+1;j<15;j++)
{
if(array[j]<min)
{
temp=min;
min=array[j];
array[j]=temp;
}
}
array[i]=min;
}
//?????????
for(flag=0,i=0;i<15;i++)
{
if(array[i]==0)
continue;
twice=array[i]*2;
for(j=i+1;j<15;j++)
{
if(array[j]>twice)
break;
if(array[j]==twice)
flag++;
}
}
printf("%d\n\n",flag);
}
return 0;
} |
12 | 5620 | int main()
{
int a[16], len, count; //len???????count??????
while(1)
{
cin >> a[0];
if (a[0] == -1) //??????
{
break;
}
count = 0;
len = 0;
do
{
len++;
cin >> a[len];
}while (a[len] != 0);
for (int i = 0; i < len; i++) //a[len]=0???"<"
for (int j = 0; j < len; j++)
{
if (j == i)
continue; //???????
else
{
if (a[j] == (2 * a[i]))
{
count++; //????????????????
break; //????????
}
}
}
cout << count << endl;
}
return 0;
} |
12 | 5621 |
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 | 5622 | void main()
{
int c[16];
int i,j,k,num;
for(;c[0]!=(-1);)
{ num=0;
scanf("%d",&c[0]);
if(c[0]==(-1)) break;
for(i=1;i<16;i++)
{
scanf("%d",&c[i]);
if(c[i]==0) break;
}
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(2*c[k]==c[j]) {num+=1;}
}
}
printf("%d\n",num);
}
} |
12 | 5623 | int main()
{
int a[16], i, j, k, sum;
do
{
sum = 0;
i = 0;
cin >> a[0];
if (a[0] != -1)
{
do
{
i++;
cin >> a[i];
} while (a[i] != 0);
for (j = 0; j < i; j++)
{
for (k = 0; k < i; k++)
{
if (a[k] == 2 * a[j])
sum += 1;
}
}
cout << sum << endl;
}
else
break;
} while (1);
return 0;
}
|
12 | 5624 | int main()
{
int i,j,k,n=0,m,a[100][100],b[100]={0};
for(i=0;;i++)
{
scanf("%d",&a[n][0]);
if(a[n][0]==-1)
break;
for(j=1;;j++)
{
scanf("%d",&a[n][j]);
if(a[n][j]==0)
{
m=j;
break;
}
}
for(j=0;j<m;j++)
{
for(k=0;k<m;k++)
{
if(a[n][j]==2*a[n][k])
b[n]++;
}
}
printf("%d\n",b[n]);
n++;
}
return 0;
} |
12 | 5625 | int main()
{
int i,j,x,y,count=0;
int a[16];
for(i=1;;i++)
{
count=0;
for(j=0;;j++)
{
cin>>a[j];
if((a[j]==0)||(a[j]==-1))
break;
}
for(x=0;x<=j-1;x++)
{
for(y=0;y<=j-1;y++)
{
if(a[y]==a[x]*2)
count=count+1;
}
}if(a[j]!=-1)
cout<<count<<endl;
}
return 0;
}
|
12 | 5626 |
int main(int argc, char *argv[])
{
int a[16],i,j,k,m;
for(;;)
{
m=0;
scanf("%d",&a[0]);
if(a[0]==-1)
break;
for(i=1;i<16;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
break;
}
for(j=0;j<i;j++)
{
if(a[j]%2==0)
{for(k=0;k<i;k++)
{if((a[j]/2)==a[k])
m++;}
}
}
printf("%d\n",m);
}
return 0;
} |
12 | 5627 |
int main()
{
int a[16] = {0}, i, j, count;
cin >> a[0];
while (a[0] != -1)
{
count = 0;
for (i = 1; ; i++ )
{
cin >> a[i];
if (a[i] == 0)
{
break ;
}
}
for (i = 0; a[i] != 0; i++ )
{
for (j = 0; a[j] != 0; j++ )
{
if (a[i] == 2 * a[j])
{
count ++ ;
}
}
}
cout << count << endl;
cin >> a[0];
}
return 0;
}
|
12 | 5628 |
int main()
{
int data[16];
int i, j;
int len;
int count;
while(1)
{
count = 0;
scanf("%d", &data[0]);
if(data[0] == -1)
break;
for(i = 1; i <= 15; i++)
{
scanf("%d", &data[i]);
if(data[i] == 0)
{
len = i;
break;
}
}
for(i = 0; i <= len - 1; i++)
for(j = 0 ; j <= len - 1; j++)
count = count + (data[i] == 2 * data[j]);
printf("%d\n", count);
}
return 0;
}
|
12 | 5629 | //********************************
//*????? **
//*?????? **
//*???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 | 5630 | int main()
{
int t,sz[15],i=0,j,k,result=0;
scanf("%d",&t);
while(t!=-1)
{
if(t!=0){
sz[i]=t;
i++;
}else{
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(sz[k]==sz[j]*2){
result++;
}
}
}
printf("%d\n",result);
i=0;
result=0;
}
scanf("%d",&t);
}
return 0;
}
|
12 | 5631 | void main()
{
int s[16],i,n,a=0,j;
scanf("%d",&s[0]);
loop:
a=0;
i=1;
do
{
scanf(" %d",&s[i]);
i++;
}
while(s[i-1]!=0);
n=i-1;
for(i=0;i<n;i++)
{
for(j=1;j<n-i;j++)
if(s[i]==2*s[i+j]||s[i+j]==s[i]*2) a=a+1;
}
printf("%d\n",a);
scanf("%d",&s[0]);
if(s[0]!=-1) goto loop;
}
|
12 | 5632 | int main()
{
int a[101][16],b[100]={0},c[101],k,i,j,l,m;
for (i=1;1;i++)
{
scanf("%d",&a[i][1]);
if (a[i][1]==(-1))
{
i--;
break;
}
else
for (j=2;1;j++)
{
scanf("%d",&a[i][j]);
if (a[i][j]==0)
{
j=j-1;
break;
}
}
c[i]=j;
}
for (k=1;k<=i;k++)
{
for (l=1;l<=c[k];l++)
{
for (m=1;m<=c[k];m++)
{
if (a[k][m]/a[k][l]==2&&a[k][m]%a[k][l]==0)
b[k]=b[k]+1;
else
b[k]=b[k];
}
}
printf("%d\n",b[k]);
}
return 0;
} |
12 | 5633 | int main()
{
int a[16] = {0},n = 0,i,m,j;
while(cin >> a[0])
{
if(a[0] != (-1))
{
for(i = 1;i <= 15;i++)
{
cin >> a[i];
if(a[i] == 0)
break;
}
for(j = i-1;j >= 0;j--)
{
for(m = i-1;m >= 0;m--)
{
if(a[j] == 2 * a[m])
n++;
}
}
cout << n << endl;
n = 0;
}
else
break;
}
return 0;
}
|
12 | 5634 | int a[16];
int main()
{
int n;
while(1)
{
int i=0,s=0,j;
while(1)
{
scanf("%d",&a[i]);
if(a[i]==0||a[i]==-1)
{
n=i;
break;
}
i++;
}
if(a[i]==-1)break;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if((a[i]==2*a[j])||(a[j]==2*a[i]))
{
s++;
}
}
printf("%d\n",s);
s=0;
}
return 0;
}
|
12 | 5635 | int main()
{
int a[15],i,j,m,k,b,n;
for(n=0;;n++){
for(i=0;i<17;i++){
scanf("%d",&m);
if(m==0)break;
if(m<0)goto er;
a[i]=m;
}
k=i;
b=0;
for(i=0;i<k;i++){
for(j=i+1;j<k;j++){
if((a[i]==2*a[j])||(a[j]==2*a[i]))
b=b+1;
}
}
printf("%d\n",b);
}
er:return 0;
}
|
12 | 5636 | main()
{
int c[100][100],i=0,j=0,m,n,k,s=0;
while(scanf("%d",&c[i][j]))
{
if(c[i][j]!=0&&c[i][j]!=-1)
j++;
else if(c[i][j]==0)
{
i++;
j=0;
}
else break;
}
for(m=0;m<=i-1;m++)
{
for(n=0;c[m][n]!=0;n++)
{
for(k=0;c[m][k]!=0;k++)
{
if(c[m][n]==2*c[m][k])
s++;
}
}
printf("%d\n",s);
s=0;
}
}
|
12 | 5637 | 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 | 5638 | /*
* ????.cpp
*
* Created on: 2010-11-17
* Author: IBM
*/
int main(){
int n,k,i,j; //n?2?????
int a[16];
while(cin>>a[0]&&a[0]!=-1){ //?????????-1
k=1; //????????
n=0;
while(cin>>a[k]&&a[k]!=0) //???????0
k++; //??????1
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)) //??????????2??1/2
n++; //2?????1
cout<<n<<endl; //????
}
return 0;
}
|
12 | 5639 | /**
* @file 1.cpp
* @author ???
* @date 2013-10-9
* @description ?????????
*/
int main(void)
{
int a[16], i, k = 0, j = 0, n = 0;
for( i = 0 ; i < 16 ; i++ )
a[i] = -1;
cin >> k;
while( k != -1 )
{
a[j] = k;
j++;
if( k == 0 )
{
for( i = 0 ; i < 15 ; i++ )
for( j = i + 1 ; j < 15 ; j++ )
if( ( a[j]- 2 * a[i] == 0 ) || ( a[i] - 2 * a[j] == 0 ) )
n++;
cout << n << endl;
for( i = 0 ; i < 16 ; i++ )
a[i] = -1;
j = 0;
n = 0;
}
cin >> k;
}
return 0;
} |
12 | 5640 | /*
* file : 1.cpp
* author : ??? 1200012911
* time ?2012.10.29
* function : ????
*/
int main()
{
int a[17] = {0}, count; //????????
int i, j, k, two, num;
for (k = 1; ; k++)
{
count = 0; //?????
for (i = 1; i <= 16; i++)
{
cin >> a[i];
if (a[1] == -1 || a[i] == 0)
{
num = i; //????????
break;
}
}
if (a[1] == -1)
break; //?????-1????
for (i = 1; i < num; i++)
{
two = 2 * a[i]; //????????
for (j = 1; j < num; j++)
if (two == a[j]) //?????
{
count++;
break;
}
}
cout << count << endl;
}
return 0;
} |
12 | 5641 |
int main(void)
{
int i,j,m,n;
int num[100], result[100], temp;
i=0;
j=0;
while(1)
{
cin >> num[i];
if(num[i] == -1)
{
break;
}
while(1)
{
if(num[i] == 0)
{
temp = 0;
for(m=0; m<i; m++)
{
for(n=0; n<i; n++)
{
if(num[m] == 2*num[n])
{
temp++;
}
}
}
result[j] = temp;
i=0;
j++;
break;
}
else
{
i++;
cin >> num[i];
}
}
}
for(m=0; m<j; m++)
{
cout << result[m] << endl;
}
return 0;
} |
12 | 5642 | //********************************
//*????? **
//*?????? 1300012713 **
//*???2013.10.30 **
//********************************
int main()
{
int m, n, num, a[15]; //??????m????????n??????num???a[15]
while (cin >> m) //???????
{
if (m == -1) return 0; //????-1??????
else //???m????????
{
int n = 1;
num = 0;
a[0] = m;
for(int i = 1; ; i++) //??????
{
cin >> a[i];
if(a[i] == 0) break; //????0?????????0
if(a[i] != 0) n = n + 1;
}
for(int j = 0; j <= n; j++) //????????
{
for(int k = j+1; k <=n; k++)
{
if(a[j] == 2 * a[k] || a[k] == 2 * a[j])
num = num + 1; //????
}
}
cout << num << endl; //????
}
}
}
|
12 | 5643 | int main() {
int a[20],s=0;
while (scanf("%d",&a[++s])!=EOF) {
if (a[1]==-1) break;
do scanf("%d",&a[++s]); while (a[s]!=0);
s--;
int ans=0;
for (int i=1;i<=s;i++)
for (int j=1;j<=s;j++)
if (a[i]*2==a[j])
ans++;
printf("%d\n",ans);
s=0;
}
return 0;
} |
12 | 5644 | int main()
{
int a[18],m,i=0,j=0,k=0,l=0,n=0;
for(n=0;;n++)
{
scanf("%d",&a[0]);
if(a[0]==-1)
break;
else
{
for(i=1;;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{m=i-1;break;}
}//??a[i]
i=0;
for(i=0;i<=m;i++)
{
for(j=0;j<=m;j++)
{
if(a[j]==(2*a[i]))
k++;
}
l=l+k;k=0;//printf("%d\n",l);
}//????a[i],???a[i]??
printf("%d\n",l);
l=0;
}
}
return 0;
} |
12 | 5645 | 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 | 5646 | int main(){
int a[20],i,j,k,s;//a?????? i????????????? s???????
for(s=0,cin>>a[1];a[1]!=-1;s=0,cin>>a[1]){//??????????
i=1;
while(a[i]!=0){
i++;
cin>>a[i];
}
for(j=1;j<i;j++)
for(k=1;k<i;k++)
if(a[j]==2*a[k])s++;
cout<<s<<endl;
}
return 0;
} |
12 | 5647 | /*
* ??.cpp
*
* Created on: 2011-11-2
* Author:Administrator
*/
int main(){
int a[16],i,n,j,total;
while(cin>>a[0]&&a[0]!=-1){
i=1;
while(cin>>a[i]&&a[i]!=0){
i++;
}
n=i;
total=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++){
if(a[j]==2*a[i])total++;
}
cout<<total<<endl;
}
return 0;
} |
12 | 5648 | int main(int argc, char* argv[])
{
int x1,x2,n[15],y;
int i;
int t;
while(1){
//?0?8?0?1?0?8?0?5?0?1?0?7?0?4?0?4?0?8?0?5?0?6?0?6
i=0;
while(1){
scanf("%d",&t);
if(t==-1){
return 0;
}
if(t==0)
break;
else{
n[i]=t;
i++;
}
}
y=0;
for(x1=i-1;x1>=0;x1--){
for(x2=x1-1;x2>=0;x2--){
if( n[x1]==n[x2]*2 || n[x2]==n[x1]*2 )
y+=1;
}
}
printf("%d\n",y);
}
return 0;
} |
12 | 5649 | int main()
{
int a[16],k,m,n,j;
do
{ j=0;
scanf("%d",&a[0]);
if(a[0]!=-1)
{
for(k=1;k<=15;k++)
{
scanf("%d",&a[k]);
if(!a[k])break;
}
for(m=0;m<k-1;m++)
{
for(n=m+1;n<k;n++)
{
if((a[m]-2*a[n]==0)||(a[n]-2*a[m]==0))
j++;
}
}
printf("%d\n",j);
}
}
while(a[0]!=-1);
return 0;
} |
12 | 5650 | int main()
{
int a[16],i,j,k,s;
for(;;)
{ s=0;
scanf("%d",&a[0]);
if(a[0]==-1) break;
for(i=1;i<=15;i++)
{ scanf("%d",&a[i]);
if(a[i]==0) break;
}
for(j=0;j<=i-1;j++)
{
for(k=0;k<=i-1;k++)
{ if(a[k]==2*a[j]) s=s+1; }
}
printf("%d\n",s);
}
return 0;
}
|
12 | 5651 | int main()
{
int a[15],s,i,j,k,flag=1;
while(flag)
{
s=0;
for(i=0;i<16;i++)
{ /*????????????0*/
scanf("%d",&a[i]);
k=i; /*??k?????*/
if(a[i]==-1)
{
flag=0;
break;
}
if(a[i]==0)break;
}
if(flag)
{
for(i=0;i<k;i++)
for(j=0;j<k;j++)
{
if(a[i]==2*a[j])
s++;
} /*?????????????*/
printf("%d\n",s);
}
}
return 0;
} |
12 | 5652 | 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 | 5653 |
int main()
{
int a[20],i,j,n,court;
while (1)
{
for (i = 0; 1 ; i++)
{
cin >> a[i];
if (a[i] == 0)
break;
}
if ( a[0] == -1 )
break;
n = i;
for (i = 0, court = 0 ; i <= n; i++)
{
for (j = i; j <= n - 1; j++)
{
if (a[j] == 2 * a[i] || a[i] == 2 * a[j])
court++;
}
}
cout << court << endl;
}
return 0;
} |
12 | 5654 | int main()
{
int key; // key?????????
int number, total; // number???????total????
while ((cin >> key) && (key != -1)) // ??????????-1??????
{
int num[15]; // num[15]??????
num[0] = key;
int i = 1; // ?????????key,i????1
int flag1 = 0, flag2 = 0; // flag1, flag2????????2???
total = 0; // ??????total????0
while ((cin >> number) && (number != 0)) // ??????
{
num[i] = number;
i++;
}
for (int k = 0; k <= i - 2; k++)
{
for (int r = k + 1; r <= i - 1 ; r++)
{
flag1 = (num[r] == 2 * num[k]);
flag2 = (num[k] == 2 * num[r]);
if ((flag1 == 1) || (flag2 == 1))
{
total = total + 1;
} // end if
} // end for
} // end for
cout << total << endl;
}
return 0;
}
|
12 | 5655 | int main()
{
int a[17] , i , j , k;
for (i = 1 ; i <= 16 ; i++)
{
a[i] = 1;
}
int count = 0;
while (cin >> a[1])
{
if (a[1] == -1)
{
break;
}
else
{
for (i = 2 ; a[i - 1] != 0 ; i++)
{
cin >> a[i];
}
}
i = i - 2;
for (j =1 ; j <= i ; j++)
{
for (k=1 ; k <= i ; k++)
{
if (a[k] == 2 * a[j])
{
count++;
break;
}
}
}
cout << count << endl;
count = 0;
}
return 0;
}
|
12 | 5656 | //?????????
int main()
{
int i,j,m=0,count=0;//????
int num[100];
for(;;)
{
m=0;
for(i=0;;i++)
{
cin>>num[i];//????
if(num[i]==0||num[i]==-1)//??????????
{
count=i;
break;
}
}
if(num[0]==-1)
break;
else
{
for(i=0;i<count;i++)//?????????
for(j=i+1;j<count;j++)
{
if((num[i]==2*num[j])||(num[j]==2*num[i]))//?????????
m++;
}
cout<<m<<endl;//????
}
}
return 0;
} |
12 | 5657 | //**************************
//*????? **
//*?????? 1300012863 **
//*???2013.11.1 **
//**************************
int main()
{
int a[20];
int n,i,j,k;
for(k=1; ;k++)
{
memset(a,0,sizeof(a));
n = 0;
i = 1;
cin>>a[1];
if(a[1]!=(-1))
{
if(a[1]!=0)
{
for(i=1; ; )
{
i++;
cin>>a[i];
if(a[i]!=0)
{
for(j=1;j<=(i-1);j++)
{
if((a[i]==2*a[j])||(a[j]==2*a[i]))
{
n = n + 1;
}
}
}
else
{
cout<<n<<endl;
break;
}
}
}
}
else
{
break;
}
}
return 0;
}
|
12 | 5658 |
int main()
{
int a[16];//???0????????????
int num = 0;
int s;//??2??????
int i , j;//?????
cin >> a[num];
while (a[num] != -1)
{
while (a[num] != 0)
{
num++;
cin >> a[num];
}
num--;//?????0????
s = 0;
for (i = 0; i <= num; i++)
for (j = 0; j <= num; j++)
if (a[i] == a[j] * 2)
s++;
cout << s << endl;
num = 0;
cin >> a[num];
}
}
|
12 | 5659 | int main()
{
int s[20],i=1,j,k,d=0;
char c;
do{
while(scanf("%d",&s[i]))
{
c=getchar();
if(c=='\n')
break;
i++;
}
for(k=1;k<i;k++)
{
for(j=k+1;j<i;j++)
{
if((s[k]==2*s[j])||(2*s[k]==s[j]))
d++;
}
}
if(s[i]>-1)
printf("%d\n",d);
i=1;
d=0;
}while(s[i]>-1);
return 0;
}
|
12 | 5660 | 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 | 5661 | 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 | 5662 | int main()
{
float a[16];
int i,j,n,t;
for(i=0;i<100;i++)
{
n=0;
t=0;
scanf("%f",&a[0]);
if(a[0]==-1) break;
n=n+1;
for(j=1;j<16;j++)
{
scanf("%f",&a[j]);
if(a[j]==0) break;
n=n+1;
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if (a[j]==a[i]*2||a[j]==0.5*a[i])
t++;
}
printf("%d\n",t);
}
return 0;
}
|
12 | 5663 | void main()
{
int count=0,num[20][16],i,j,t;
for(i=0;i<16;i++)
{
scanf("%d",&num[0][i]);
if(num[0][i]==0)
break;
}
for(i=1;i<20;i++)
{
if(num[i-1][0]!=-1)
{
for(j=0;j<16;j++)
{
scanf("%d",&num[i][j]);
if(num[i][j]==0 || num[i][j]==-1)
break;
}
}
else break;
}
for(i=0;i<20;i++)
{
if(num[i][0]==-1)
break;
else
{
for(j=0;j<16;j++)
{
if(num[i][j]==0)
break;
else
{
for(t=0;t<16;t++)
{
if(num[i][t]==0)
break;
else
{
if(num[i][t]==2*num[i][j])
count++;
}
}
}
}
printf("%d\n",count);
count=0;
}
}
}
|
12 | 5664 | 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 | 5665 | void main(){
int x[16], i, j, g, n, m;
for(j=0;;j++){
for(i=0,n=0;i<16;i++){
scanf("%d", &x[i]);
if(x[i]==0)break;
}
if(x[0]==-1)break;
g=i;
for(i=0; i<g; i++){
for(m=0;m<g;m++){
if((float)x[i]==x[m]*2)n++;
}
}
printf("%d\n", n);
}
} |
12 | 5666 | void main(){
int i,j,l,t,m,count[50],lie[20];
char p;
for(i=0;i<50;i++){
for(j=0;j<20;j++){
scanf("%d",&lie[j]);
if(lie[0]==-1) goto lalala;
scanf("%c",&p);
if (p=='\n') break;
}
count[i]=0;
for(l=0;l<j;l++)
for(t=0;t<j;t++)
if((lie[l]-2*lie[t])==0)
count[i]=count[i]+1;
}
lalala:for(m=0;m<i;m++){
printf("%d",count[m]);
if(m!=i-1)
printf("\n");
}
} |
12 | 5667 | int main()
{
float a[16];
int j, num;
while (1)
{
num = 0;
for (int i = 0; i < 16; i++)
{
cin >> a[i];
if (a[0] == -1)
break;
if (a[i] == 0)
{
j = i - 1;
break;
}
}
if (a[0] == -1)
break;
for (int i = 0; i <= j; i++)
{
for (int k = 0; k <= j; k++)
{
if (a[i] / a[k] == 2 && i != k)
num++;
}
}
cout << num << endl;
}
return 0;
}
|
12 | 5668 | /**
* @file 1.cpp
* @author ???
* @date 2013-10-30
* @description
* ?????????
*/
int main()
{
int a[16] = {0}; // ??????????????0
int sum = 0; // ?????????????sum?????0
do
{
sum = 0;
cin >> a[0];
if (a[0] == -1) break; // ?????????????-1??????
for (int i = 1; i <= 15; ++i) // ??????????????
{
cin >> a[i];
if (a[i] == 0) break; // ???????0????????
}
for (int m = 0; m <= 13; ++m) // ????????????
{
if (a[m + 1] == 0) break;
for (int n = m + 1; n <= 14; ++n)
{
if (a[n] == 0) break;
if (a[m] == 2 * a[n] || a[n] == 2 * a[m]) ++sum;
}
}
cout << sum << endl; // ????
} while (1);
return 0;
} |
12 | 5669 |
int main(){
int su[17]={1};
int c[100];
int i,a,b,d,e=0;
for(i=0;i<100;i++){
c[i]=0;}
for(d=0;d<100;d++){
a=0;
for(i=1;su[i-1]!=0;i++){
scanf("%d",&su[i]);
if(su[i]==-1){
e=1;
break;
}
a=a+1;
}
if(e){break;}
for(i=1;i<a;i++){
for(b=1;b<a;b++){
if(su[i]==2*su[b]){
c[d]+=1;}
}
}
}
for(i=0;i<d;i++){
printf("%d\n",c[i]);}
return 0;
} |
12 | 5670 | int main()
{
int i=0,j=0,k=0;
int a[16];
for(;;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{
printf("%d\n",k);
i=-1;
k=0;
}
if(a[0]==-1)
break;
for(j=0;j<i;j++)
if(a[i]==a[j]*2||a[j]==a[i]*2)
k++;
}
} |
12 | 5671 | int main()
{
int number[16]={0};
int m,i=1;
while(m!=-1)
{
do
{
cin>>m;
number[i]=m;
i++;
}while(m!=0&&m!=-1);
int k=1,t,j=0;
for(k=1;k<=i-1;k++)
{
t=number[k];
int p;
for(p=1;p<=i-1;p++)
{
if(t==2*number[p])
{
j++;
}
else continue;
}
}
if(m!=-1)
{
cout<<j-1<<endl;
}
else break;
i=1;
j=0;
}
return 0;
} |
12 | 5672 | int main()
{
int a[16];
int i,j,k,l;
while(scanf("%d",&a[0])&&a[0]!=-1)
{ l=0;
if(a[0]!=0)
{
for(i=1;a[i-1]!=0;i++)
{
scanf("%d",&a[i]);
}
for(j=0;j<=i-1;j++)
for(k=0;k<j;k++)
if(a[k]==2*a[j]||a[j]==2*a[k]) l++;
printf("%d\n",l);
}
else printf("%d\n",l);
}
return 0;
}
|
12 | 5673 | main()
{
int a[15][15],i=0,j=0,s=0,m=0,h=0,g[]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},b[15];
while(1)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0)
{
b[i]=j;
i=i+1;
j=0;
}
else if(a[i][j]==-1)
{
break;
}
else j=j+1;
}
for(s=0;s<i;s++)
{
for(m=0;m<b[s];m++)
{
for(h=0;h<b[s];h++)
{
if(a[s][m]==2*a[s][h])
{
g[s]=g[s]+1;
}
}
}
}
for(s=0;s<i;s++)
{
printf("%d\n",g[s]);
}
return 0;
} |
12 | 5674 | 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 | 5675 | int main()
{
float s[16],t[16];
int u=0,g=0;
for(int k=1;k<100;k++)
{
int a=0;
for(int i=0;i<16;i++)
{
scanf("%f",&s[i]);
if(s[0]==-1||scanf(""))
printf("");
else
{
u+=1;
if(s[i]==0)break;
else
{
t[i]=s[i];
a++;
}
}
}
int b=0;
for(int h=0;h<a;h++)
{
for(int k=0;k<a;k++)
{
if(t[h]/t[k]==2)
b++;
}
}
printf("%d\n",b);
g++;
if(g==u)
printf("");
}
return 0;
} |
12 | 5676 | int main(){
int i,j,m,a[16];
while(1)
{int count=0;//??????
for(i=0;i<16;i++)//????0?-1??
{cin>>a[i];
if(a[i]==-1)break;
if(a[i]==0)break;}
if(a[i]==-1)break;//??????-1 ????????
for(j=0;j<i;j++)//??????????
for(m=j+1;m<i;m++)
if(a[j]==2*a[m])count++;
for(j=0;j<i;j++)//????????
for(m=j+1;m<i;m++)
if(2*a[j]==a[m])count++;
cout<<count<<endl;}
} |
12 | 5677 |
int main()
{
int i,j,n,k,m;
int a[100];
while (1){
scanf("%d",&a[0]);
if(a[0]==-1)
break;
for(i=1;;i++){
scanf("%d",&a[i]);
if(a[i]==0)
break;
}
n=i;
for(i=n-1;i>0;i--){
for(j=0;j<i;j++){
if(a[j]>a[j+1]){
k=a[j];
a[j]=a[j+1];
a[j+1]=k;
}
}
}
m=0;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(a[j]==2*a[i]){
m=m+1;
break;
}
if(a[j]>2*a[i]){
break;
}
}
}
printf("%d\n",m);
}
return 0;
}
|
12 | 5678 |
int main(int argc, char* argv[])
{
float p[100][999];
int i,m;
for(m=0;;m++){
for(i=0;;i++){
scanf("%f",&p[m][i]);
if(p[m][i]==0) break;
}
if(p[m][0]==-1) break;
else{
int a=0;
for(int j=0;j<i;j++){
for(int k=0;k<i;k++){
if(p[m][j]/p[m][k]==2) a++;
else a=a;
}
}
printf("%d\n",a);
}
}
return 0;
}
|
12 | 5679 |
int main()
{
int i,k,j;
int count=0;
int sz[16]={0};
for(i=0;i<16;i++){
scanf("%d",&sz[i]);
if(sz[i]==0){
for(k=0;k<i-1;k++){
for(j=k+1;j<i;j++){
if(sz[k]==2*sz[j]||sz[k]*2==sz[j]){
count++;
}
}
}
printf("%d\n",count);
count=0;
i=-1;
}
if(sz[i]==-1){
break;
}
}
return 0;
}
|
12 | 5680 | //************************************************************************************
//* name: 1.cpp *
//* author:?? *
//* date: 2013-10-30 *
//* description??????????????????????????????? *
//************************************************************************************
int main ()
{
int t ;//???????????????
int a[16] , i ,j,k,count;
while(cin>>t)
{
count = 0;
if(t<0) return 0 ;//??-1?????
a[0]=t ;//????????????????
for(i=1;i<16;i++)
{
cin >> a[i] ;
if(a[i]==0) break ;//???????0????
}
for (j=0 ;j<i;j++)//???i???????
{
for(k=0;k<i;k++)
{
if(a[k]==2*a[j]) count++ ;//????????????????????1
}
}
cout << count <<endl ;
}
}
|
12 | 5681 | int main()
{
for(;;)
{
int a[16];
int i,j,k,m,n=0;
for(i=0;i<16;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{for(m=i+1;m<16;m++)
a[m]=101;
break;
}
}
if(a[0]==-1)
break;
for(j=0;j<i;j++)
for(k=0;k<i;k++)
{if(a[k]*2-a[j]==0)
n++;
}
printf("%d\n",n);
}
return 0;
} |
12 | 5682 | /**?????
*???2010/11/5
*??????
*???1000010449
*/
int main()
{
int a[16], len, count, i, j;
while (1)
{
cin >> a[0];
if (a[0] == -1)
{
break;
}
len = 0;
do
{
len++;
cin >> a[len];
}while (a[len] != 0);
count = 0;
for (i = 0; i < len; i++)
{
for (j = 0; j < len; j++)
{
if (j == i)
{
continue;
}
else
{
if (a[j] == (2 * a[i]))
count++;
}
}
}
cout << count << endl;
}
return 0;
}
|
12 | 5683 | int main()
{
int i,j,k,a[16],num;
while(scanf("%d",&a[0]),a[0]+1)
{
i=1;
num=0;
while(scanf("%d",&a[i]),a[i])
{
i++;
}
for(j=0;j<i;j++)
{
for(k=j+1;k<i;k++)
{
if(a[j]==2*a[k]||a[k]==2*a[j])
{
num++;
}
}
}
printf("%d\n",num);
}
return 0;
} |
12 | 5684 | int main ()
{
int i,j,k;
while(1)
{
int a[20]={0},sum=0;
for(i=0;;i++)
{
scanf("%d",&a[i]);
if(a[i]==0) {k=i;break;}
}
if(a[0]==-1) break;
for(i=0;i<k;i++)
for(j=i;j<k;j++)
{
if(a[j]==2*a[i]||2*a[j]==a[i]) sum++;
}
printf("%d\n",sum);
}
}
|
12 | 5685 | 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 | 5686 | int main()
{
int n[100][15],i=0,j,k,count,t;
for(i=0;;i++)
{
count=0;
j=0;
do
{
cin>>n[i][j];
if(n[i][j]==-1)
goto loop;
j++;
}
while(n[i][j-1]!=0);
for(k=0;k<j;k++)
{
for(t=j-1;t>k;t--)
{
if(n[i][t]==2*n[i][k] || 2*n[i][t]==n[i][k] )
count++;
}
}
cout<<count<<endl;
}
loop:return 0;
}
|
12 | 5687 | /*
* 9.cpp
*
* Created on: 2010-11-19
* Author: ???
* ??? ??
*/
int main(){
int a[16],i,j,r,n;
while(cin>>a[0]){
n=0;
if(a[0]==-1) //??????-1?????
break;
for(i=1;a[i-1]!=0;i++) //????
cin>>a[i];
for(j=0;j<=i-2;j++) //??????
for(r=0;r<=i-2;r++)
if(2*a[j]==a[r])
n++;
cout<<n<<endl;
}
return 0;
}
|
12 | 5688 |
void swap( int* a,int *b )
{
int temp = *a;*a = *b; *b = temp;
}
int find( int* s, int x, int l, int r )
{
if ( l > r ) return 0;
int mid = (l+r)/2;
if ( s[mid] == x ) return 1;
else
{
if ( s[mid] > x ) return find(s,x,l,mid-1);
else return find(s,x,mid+1,r);
}
}
int main()
{
int n = 0, i = 0, j = 0;
int x = 0;
int s[1000] = {0};
while ( (scanf("%d", &x), x) != -1 )
{
if ( x != 0 )
{
s[n++] = x;
for ( i = n-1; (i>0) && (s[i] < s[i-1]); i-- )
swap(&s[i],&s[i-1]);
}
else
{
int count = 0;
for ( i = 0; i < n; i++ )
{
if ( find(s,2*s[i], i+1, n) )
count++;
}
printf("%d\n",count);
for ( i = 0; i < n; i++ )
s[i] = 0;
n = 0;
}
}
return 0;
}
|
12 | 5689 | int main()
{
int a[100],m,n,i,j,k,p;
i=0;
while(scanf("%d",&m)!=EOF)
{
if(m==-1)
break;
else
if(m==0)
{
for(j=0,n=0;j<=i-2;j++)
for(p=j;p<=i-1;p++)
if(a[j]==a[p]*2||a[p]==a[j]*2)
n++;
printf("%d\n",n);
i=0;
}
else
{
a[i]=m;
i++;
}
}
}
|
12 | 5690 | 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 | 5691 | int main()
{
int n[25], i, j, count;
while (cin >> n[1], n[1] != -1)
{
count = 0;
for (i = 2; cin >> n[i], n[i] != 0; i++)
{
for (j = 1; j < i; j++)
{
if (n[i] == 2 * n[j] || n[i] * 2 == n[j])
{
count++;
}
}
}
cout << count << endl;
}
return 0;
} |
12 | 5692 | //******************************
//?????? *
//?????? *
//???2011.10.21 *
//******************************
int main()
{
int a[20] = {0};
while(1)
{
cin >> a[0];
if(a[0]!=-1)
{
int i,k,m,num=0;
for (i=1; ; i++)
{
cin >> a[i] ;
if (a[i]==0) break;
}
for (k=0;k<=i-2;k++)
{
for (m=k+1;m<=i-1;m++)
{
if ((a[m] == (2 * a[k])) || (a[k] == (a[m] * 2)))
num++;
}
}
cout << num << endl;
}
else
break;
}
return 0;
}
|
12 | 5693 | 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 | 5694 |
int main()
{
int number[16];
int n;
for( ; ; )
{
n = 0;
cin >> number[0];
if( number[0] == -1 ) break;
int i;
for( i = 1; i < 16; i++ )
{
cin >> number[i];
if( number[i] == 0 ) break;
}
for( int j = 0; j < i; j++ )
{
for( int k = 0; k < i; k++)
{
if( number[k] == 2 * number[j] )
{
n++;
}
}
}
cout << n << endl;
}
return 0;
} |
12 | 5695 | //********************************
//*????? **
//*?????? 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 | 5696 | int main()
{
while(1)
{
int i = 0; int a[20] = {0};
int sum = 0;
do
{
cin >> a[i];
i++;
}
while( a[ i - 1 ] > 0 );
if( a[ i - 1 ] == -1 )
break;
for( int j = 0; j < i-1 ; j++ )
{
for( int k = 0; k < i-1 ; k++ )
if( a[j] * 2 == a[k] )
sum++;
}
cout << sum << endl;
}
} |
12 | 5697 | 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 | 5698 | void main()
{
int t,i,j,x,y,m,n,a[20];
for(j=1;j<=15;j++)
{
t=0;
scanf("%d",&y);
if(y==-1)
break;
else
{
a[0]=y;
for(i=1;i<=20;i++)
{
scanf("%d",&x);
if(x==0)
break;
else
{
a[i]=x;
}
}
for(m=0;m<=i-1;m++)
{
for(n=0;n<=i-1;n++)
{
if(a[m]==2*a[n])
t++;
}
}
printf("%d\n",t);
}
}
} |
12 | 5699 | //********************************
//*????? **
//*?????? 1200012988 **
//*???2012.10.30 **
//********************************
int main()
{
double a[16];
while(cin >> a[0])
{
if(a[0] == -1)
break;
else
{
int count = 0, i = 0;
do
{
i++;
cin >> a[i];
}while(a[i] != 0);
for(int j = 0; j < i - 1; j++)
{
for(int k = j + 1; k < i; k++)
{
if((a[k] / a[j] == 2) || (a[j] / a[k] == 2))
count++;
}
}
cout << count << endl;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.