label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
12 | 5500 | 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 | 5501 |
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 | 5502 | 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 | 5503 | int main()
{
char c;
int num[1000]={0},n,m=0,index=0,i,j;
while(num[0]!=-1)
{
while(true)
{
scanf("%d",&num[index]);
index++;
scanf("%c",&c);
if(c!=' ')
break;
}
for(i=0;i<index;i++)
{
for(j=0;j<index;j++)
{
if(num[i]==2*num[j]||num[i]*2==num[j])
m++;
}
}
if(num[0]==-1)
{
return 0;
}
printf("%d\n",m/2);
m=0;index=0;
}
}
|
12 | 5504 | void main()
{
int a[18],m,n,i,j,r=0,b[100];
int t;
scanf("%d",&t);
while(t!=-1)
{
m=1;
r++;
n=0;
a[0]=t;
for (i=1;i<18;i++)
{
scanf("%d",&a[i]);
if (a[i]!=0)
m=m+1;
else
break;
}
for (i=0;i<m;i++)
{
for (j=m-1;j>i;j--)
if (a[j]==2*a[i]||a[i]==2*a[j])
n++;
}
b[r]=n;
scanf("%d",&t);
}
for (i=1;i<r+1;i++)
printf("%d\n",b[i]);
} |
12 | 5505 | //*********************************
//*????? **
//*?????? 1200012945 **
//*???2012.10.23 **
//*********************************
int main()
{
int a[16], x, i, j, k, l, n;
for (i = 0; ; i++)
{
n = 0;
j = 0;
while (cin >> x)
{
if (x == 0 || x == -1)
break;
a[j] = x;
j++;
}
if (x == -1)
break;
for (k = 0; k < j; k++)
{
for (l = 0; l < j; l++)
{
if (a[l] == 2 * a[k])
n = n + 1;
}
}
cout << n << endl;
}
return 0;
}
|
12 | 5506 | int main()
{
float a[20];
do
{
int i=1;
do
{
scanf("%d",&a[i]);
if (a[i]==0) break;
else i++;}while (i<=19);
int j,k;
float t;
for (j=1;j<=i-2;j++)
for (k=1;k<=i-1-j;k++)
if(a[k]>a[k+1])
{t=a[k];a[k]=a[k+1];a[k+1]=t;}
int s=0,l,m;
for (l=1;l<=i-2;l++)
for (m=1;m<=i-1;m++)
if(a[m]/a[l]==2)
s=s+1;
if (a[1]>0)
printf("%d\n",s);
}while (a[1]>0);
return 0;
}
|
12 | 5507 | /********************************************
*@file 1.cpp *
*@author ?? *
*@date 2013-10-27 *
*@description *
*??????6??? *
********************************************
*/
int main()
{
int num[101], number, i, j, count = 0;
while (1)
{
cin >> number;
if (number == -1)
break;
for (i = 1; ; i++)
{
num[0] = number;
cin >> num[i];
for (j = 0; j < i; j++)
{
if (num[j] > num[i] && num[j] == (num[i] * 2))
count++;
if (num[i] > num[j] && num[i] == (num[j] * 2))
count++;
}
if (num[i] == 0)
break;
}
cout << count << endl;
count = 0;
}
return 0;
} |
12 | 5508 | int main(){
int a[100],i,j,k,n=0,N=0,t;
for(k=1;k<100;k++)
{for(i=0;i<100;i++)
{cin>>a[i];
n++;
if(a[i]==0)i=100;}
if(a[0]!=-1)
{for(i=1;i<=n-2;i++)
{ for(j=0;j<=n-i-2;j++)
{if(a[j]>a[j+1])
{t=a[j];
a[j]=a[j+1];
a[j+1]=t;}
}}
for(i=n-2;i>=0;i--)
{ for(j=i-1;j>=0;j--)
{ if(a[i]==2*a[j])N++;}
}cout<<N<<endl;N=0;n=0;}
else break;}
return 0;
}
|
12 | 5509 | 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 | 5510 |
int main(int argc, char* argv[])
{
int i,j,k,sz[17],n=0;
for(i=0;i<17;i++){
scanf("%d",&sz[i]);
if(sz[i]==-1)
break;
else{
if(i>0){
if(sz[i]>0){
for(j=0;j<i;j++){
if(2*sz[j]==sz[i]||2*sz[i]==sz[j]){
n++;
}
}
}
else{
printf("%d\n",n);
n=0;
i=0;
j=0;
for(k=0;k<16;k++)
sz[k]=-2;
}
}
}
}
return 0;
} |
12 | 5511 | //****************************************
//*?????
//*?????? 1100012789
//*???2011.10.19
//****************************************
int main()
{
int a[16], i = -1, j, number = 0; //???????number??????
do //?????n???
{
for (i = 0; i < 16; i++) //????????
{
a[i] = 0;
}
i = -1;
do //??????????0?-1
{
i++;
cin >> a[i];
} while (a[i] !=0 && a[i] != -1);
number = 0; //?????
for (i = 0; a[i] != 0 && a[i] != -1; i++) //???????????
{
for (j = 0; a[j] != 0 && a[i] != -1; j++) //??????????????
{
if (a[j] == a[i] * 2) //???????++
{
number++;
}
}
}
if (a[0] != -1) //???????????????
{
cout << number <<endl;
}
} while (a[0] != -1);
return 0;
} |
12 | 5512 | int main(){
int sz[100][16],m,n;
int i,j,k;
for(i=0;i<100;i++){
for(j=0;j<16;j++){
scanf("%d",&m);
if(m!=0){
sz[i][j]=m;
}else {break;}
}
if(sz[i][0]==-1){
break;}
}
n=0;
for(i=0;i<100;i++){
if(sz[i][0]==-1){
break;}
for(j=0;j<15;j++){
for(k=0;k<15;k++){
if(sz[i][j]!=0&&sz[i][k]!=0){
if(sz[i][j]==2*sz[i][k]){
n=n+1;
}}}}
printf("%d\n",n);
n=0;
}
return 0;
}
|
12 | 5513 | //********************************
//*????? **
//*?????? 1300012934 **
//*???2013.10.31 **
//********************************
int main()
{
int a[15] = {0} , n;
while (1)
{
n = 0;
for (int i = 0; i <= 15; i++)
{
cin >> a[i];
if (a[i] == 0 || a[i] == -1)
break;
}
for (int j = 0; j <= 15; j++)
{
if (a[j] == 0 || a[j] == -1)
break;
for (int k = j + 1; k <= 15; k++)
{
if (a[k] == 0)
break;
else if (a[k] * 2 == a[j] || a[j] * 2 == a[k])
n ++;
}
}
if (a[0] != -1)
{
cout << n << endl;
for (int i = 0; i <= 15; i++)
a[i] = 0;
n = 0;
}
else
break;
}
return 0;
}
|
12 | 5514 | int main()
{int a[16],i,j,t,k;
for(i=0;;i++)
{ for(j=0;j<=15;j++)
{scanf("%d",&a[j]);if(a[j]==0) break;
if(a[0]==-1) {printf("\n");return 0;}
}
for(j=0,t=0;j<=14;j++)
{ for(k=j+1;k<=15;k++)
{
if(a[k]!=0&&a[j]!=0&&(2*a[j]==a[k]||2*a[k]==a[j]))
t=t+1;
}
a[j]=0;
}
printf("%d\n",t);
}
printf("\n");
return 0;
} |
12 | 5515 | int main(){
int a[100][16],i,j,m,p,q;
for(i=0;i<100;i++){
for(j=0;j<16;j++){
scanf("%d",&a[i][j]);
if(a[i][j]<=0) break;
}
m=0;
for(p=0;p<j;p++){
for(q=0;q<j;q++){
if(a[i][q]==2*a[i][p]) m++;
}
}
if(a[i][j]==-1) break;printf("%d\n",m);
}
return 0;
} |
12 | 5516 |
int main(int argc, char* argv[])
{
int A[16];
int sum,j,i,k,m;
for(j=0;;j++)
{
scanf("%d",&A[0]);
if(A[0]==-1)
return 0;
while(A[0]!=0&&A[0]!=-1)
{
sum=0;
for(i=1;;i++)
{
scanf("%d",&A[i]);
if(A[i]==0)
break;
}
for(k=0;k<i;k++)
{
for(m=0;m<i;m++)
{
if(A[k]==A[m]*2)
sum=sum+1;
}
}
printf("%d\n",sum);
break;
}
}
return 0;
} |
12 | 5517 | 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 | 5518 | int main()
{
int i, a[16];
while(1)
{
for( i = 0;;i++)
{
cin >> a[i];
if(a[i] == 0)
break;
if(a[i] == -1)
goto end;
}
int count = 0;
for(int m = 0; m < i; m++)
{
for(int n = 0; n < i; n++)
{
if(a[m] == a[n] * 2)
count++;
}
}
cout << count << endl;
}
end:
return 0;
}
|
12 | 5519 | int main()
{
int a[16],b[16],c=0,i,j,k;
for(i=0;i<=15;i++)
{
cin>>a[i];
if(a[i]==-1)
break;
if(a[i]!=0)
{
if(a[i]%2==0)
b[i]=a[i]/2;
else
b[i]=-1;
}
else
{
for(j=0;j<=i-1;j++)
{
for(k=0;k<=i-1;k++)
{
if(k==j)
continue;
if(a[k]==b[j])
c++;
}
}
cout<<c<<endl;
for(j=0;j<=i;j++)
{
a[j]=0,b[j]=0;
}
c=0,i=-1;
}
}
return 0;
}
|
12 | 5520 | int main(){
int a[16],i,m=0,j,k=0;
while(cin>>a[0]){
if(a[0]==-1)break;
for(i=1;i<16;i++){
cin>>a[i];
if(a[i]==0){
m=i;
break;}}
for(i=0;i<=m;i++)
for(j=0;j<=m;j++){
if(i==j) continue;
if(a[i]==2*a[j])
k++;
else continue;
}
cout<<k<<endl;
k=0;
}
return 0;} |
12 | 5521 | int main()
{
char s[100];
for(;;)
{
gets(s);
int i,j,k=0,m=0,x[15],n=0;
if(s[0]=='-'&&s[1]=='1')
break;
else
{
for(i=0;;i++)
{
if(s[i]=='0')
break;
else
{
if('1'<=s[i]&&s[i]<='9')
{
j=s[i]-'0';
k=k*10+j;
}
else
{
x[m]=k;
m++;
k=0;
}
}
}
}
for(i=0;i<m;i++)
for(j=i+1;j<m;j++)
{
if((x[i]/x[j]==2&&x[i]%x[j]==0)||(x[j]/x[i]==2&&x[j]%x[i]==0))
{ n++;}
}
printf("%d\n",n);
}
return 0;
}
|
12 | 5522 | int main()
{
int i,j,k,a,n=0;
int b[16];
scanf("%d",&a);
while(a!=-1)
{
i=2;
b[1]=a;
do
{
scanf("%d",&a);
b[i]=a;
i=i+1;
}
while(a!=0);
for(j=1;j<=i-3;j++)
{
for(k=j+1;k<=i-2;k++)
{
if(b[j]==2*b[k]||2*b[j]==b[k])
n=n+1;
}
}
printf("%d\n",n);
n=0;
scanf("%d",&a); }
}
|
12 | 5523 | int main()
{
int i,j,t=0,k,m;
int a[100][100];
for(j=0;j<100;j++)
{
scanf("%d",&a[t][j]);
if(a[t][j]==0) {t=t+1;}
if(a[t][j]==-1) {break;}
}
for(k=0;k<t;k++)
{
m=0;
for(i=0;i<100;i++)
{
for(j=0;j<100;j++)
{
if(a[k][i]==2*a[k][j]&&a[k][i]!=0)
m++;
}
}
printf("%d\n",m);
}
return 0;
}
|
12 | 5524 | int main()
{
int i,j,k,l,geshu,get,n=0;
int shuzu[15];
for(j=0;;j++){
n=0;
for(i=0;;i++){
scanf("%d",&get);
if(get==-1){
goto end;
}
shuzu[i]=get;
if(get==0){
geshu=i;
break;
}
}
for(k=0;k<geshu;k++){
for(l=0;l<geshu;l++){
if(shuzu[k]==2*shuzu[l]){
n=n+1;
}
}
}
printf("%d\n",n);
}
end:return 0;
}
|
12 | 5525 | int main ()
{
int a[50][16],b[50],c[50],i,j,m,n,o,line,num=0;
for(i=0;i<=49;i++)
{
for(j=0;j<=15;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0||a[i][j]==-1)
{
b[i]=j-1;
c[i]=0;
break;
}
}
if(a[i][0]==-1)
break;
line=i;
}
for(m=0;m<=line;m++)
{
for(n=0;n<=b[m];n++)
{
for(o=0;o<=b[m];o++)
{
if(a[m][n]==2*a[m][o])
c[m]=c[m]+1;
}
}
printf("%d\n",c[m]);
}
return 0;
}
|
12 | 5526 | 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 | 5527 | int f()
{
int a[15],i,m=0,s=0,j;
scanf("%d",&a[0]);
if(a[0]==-1)s=-1;
else
{
for(i=1;a[i-1]!=0;i++)
{
scanf("%d",&a[i]);
m=m+1;
}
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
if(a[i]==2*a[j])s=s+1;
}
}
}
return s;
}
void main()
{
int a[100],i=0,j;
while(1)
{
a[i]=f();
if(a[i]==-1)break;
i++;
}
for(j=0;j<i;j++)
{
printf("%d",a[j]);
if(j!=i-1)printf("\n");
}
}
|
12 | 5528 | int main()
{
int x[16],i,j,k,a;
while(1){
i=0;j=0;k=0;a=0;
for(i=0;i<16;i++)x[i]=0;
for(i=0;;i++){
scanf("%d",&x[i]);
if(x[i]==-1||x[i]==0)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++;
}
}
if(x[0]==4)a=2;
if(x[0]==3)a=2;
printf("%d\n",a);
}
return 0;
} |
12 | 5529 | //*?????**
//*????? 1300012893 **
//*???2013.10.31**
int main()
{
int x,j;
int a[16];
cin >> x;
int i = 1;
int k = 0;
while( x != -1)
{
a[i] = x;
i ++;
if ( x != 0)
{
k = i ;
}
else
{
int sum = 0;
for( i = 1;i <= k;i ++)
{
for ( j = 1;j <= k ;j++)
{
if(a[i] == 2*a[j])
{
sum ++;
}
}
}
cout << (sum -1) << endl;
i = 1;
}
cin>>x;
}
return 0;
} |
12 | 5530 | 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 | 5531 | 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 | 5532 | int main()
{
int a[16], i, b, j, k, m;
a[1]=1;
while (a[1]!=-1)
{
i=1;
m=0;
while (cin >> b)
{
a[i]=b;
if(a[i]==0||a[i]==-1)
break;
i=i+1;
}
for (j=1;j<=i-1;j++)
{
for (k=1;k<=i-1;k++)
{
if (a[j]==2*a[k])
m++;
}
}
if (a[i]!=-1)
cout << m << endl;
}
return 0;
}
|
12 | 5533 | 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 | 5534 | int main()
{
int a[16], i, j, k , num;
do
{
num = 0;
k = 0;
cin >> a[0];
if (a[0] == -1) break;
for (i = 1; i <= 15; i ++)
{
cin >> a[i];
if (a[i] == 0) break;
k ++;
}
for (i = 0; i <= k; i ++)
for (j = 0; j <= k; j ++)
if (a[i] == 2 * a[j])
num ++;
cout << num << endl;
} while(1);
return 0;
}
|
12 | 5535 | int main()
{
int n,a[15],m=0,s,h,t;
scanf("%d",&t);
while((t+1)!=0)
{
for(n=0,s=0;t!=0;n++)
a[n]=t,s++,scanf("%d",&t);
for(n=0;n<s;n++)
{
for(h=0;h<s;h++)
{
if(a[n]==2*a[h])m++;
}
}
printf("%d\n",m);
m=0;
scanf("\n%d",&t);
}
return 0;
} |
12 | 5536 | //********************************
//*?? ?? *****
//*????? 1300012753 *****
//*???2013.10.30 *****
//********************************
int main()
{
int a[15], sum = 0, b, n = 0; // a????????sum?????????????b???????n??????????
while(cin >> b)
{
// ??????-1????????
if (b == -1)
break;
// ??b??0???????????????
else if (b == 0)
{
for(int i = 0; i <= n - 1; i++)
{
// ????????????????????
for(int j = i + 1; j <= n - 1; j++)
{
// ??????????????2?????????
if (a[i] == 2 * a[j] || a[j] == 2 * a[i])
{
sum++;
}
}
}
cout << sum << endl;
sum = 0;
n = 0;
}
// ??b???0???????????????
else
{
a[n] = b;
n++;
}
}
return 0;
} |
12 | 5537 | //********************************
//* ?????? **
//* ?????? 1300012948 **
//* ???2013.10.30 **
//********************************
int main()
{
int a[15], n, m;
while(cin >> a[0])
{
m = 0; // ??????m????0
if(a[0] == -1) // ??????-1??????
break;
else
{
int i = 1;
cin >> a[i];
while(a[i] != 0) // ??a[i]???0
{
cin >> a[++i];
}
n = i;
}
for(int i = 0; i <= n - 2; i++) // ??i????????????????????????????????
{
for(int j = i + 1; j <= n -1; j++)
{
if((a[i] == a[j] * 2) || (a[j] == a[i] * 2))
m++;
}
}
cout << m << endl; // ??????????????
}
return 0;
} |
12 | 5538 | int main()
{
int a[16], i, j, k;
while (1)
{
int n = 0, sum = 0;
for (i = 0; ; i ++)
{
cin>>a[i];
if (a[i] == -1)
break;
else
{
if (a[i] != 0)
n ++;
else
break;
}
}
if (a[0] == -1)
break;
for (j = 0; j < n; j ++)
{
for (k = 0; k < n; k ++)
{
if (a[j] == 2 * a[k])
sum ++;
}
}
cout<<sum<<endl;
}
return 0;
} |
12 | 5539 | void main()
{
int i,j,k,num[16],f;
scanf("%d",&num[1]);
do
{
k=1;
f=0;
do
{
k++;
scanf("%d",&num[k]);
}
while (num[k]!=0);
for (i=1;i<=k-1;i++)
for (j=1;j<=k-1;j++)
if (num[i]==num[j]*2)
f++;
printf("%d\n",f);
scanf("%d",&num[1]);
}
while (num[1]!=-1);
} |
12 | 5540 |
int main()
{
int i=0,j=0,s=0;
int lena,lenb,x,y;
int a[16]={0};
int b[20]={0};
while(1)
{
while(scanf("%d",&a[i]))
{
if((a[i]==0)||(a[i]==-1))
break;
else
{
i++;
continue;
}
}
if(a[0]==-1)
break;
else
{
lena=i;
for(x=0;x<lena;x++)
{
for(y=x+1;y<=lena;y++)
{
if((a[x]==2*a[y])||(a[y]==2*a[x]))
s++;
}
}
b[j]=s;
s=0;
}
j++;
for(i=0;i<16;i++)
a[i]=0;
i=0;
}
for(i=0;i<j;i++)
printf("%d\n",b[i]);
return 0;
}
|
12 | 5541 |
int main()
{
int a[PI];
int i,j,num,n;
n=0;
for (i=0;i<15;i++)
{
scanf("%d",&a[i]);
n++;
if (a[i]==0||a[i]==-1)
{
n--;
break;
}
}
do
{
num=0;
for (i=0;i<n;i++)
{
for (j=i+1;j<n;j++)
{
if (a[j]==2*a[i]||a[j]*2==a[i])
{
num++;
}
}
}
printf("%d\n",num);
n=0;
for (i=0;i<=15;i++)
{
scanf("%d",&a[i]);
n++;
if (a[i]==0||a[i]==-1)
{
n--;
break;
}
}
}
while(a[0]!=-1);
return 0;
} |
12 | 5542 | int main()
{
int a[16],i,j,k,s;
while(1)
{
s=0;
for(i=0;;i++)
{
scanf("%d",&a[i]);
if(a[i]==-1)return 0;
else if(a[i]==0)break;
}
for(j=0;j<=i-1;j++)
for(k=0;k<=i-1;k++)
if(a[j]==a[k]*2)
{s++;break;}
printf("%d\n",s);
}
} |
12 | 5543 |
int main() {
while(1) {
int i = 0, a[16];
scanf("%d", &a[i]);
if(a[i] == -1) {
break;//
}
int b[105] = {0};
b[a[i]] = 1;
while(1) {
i++;
scanf("%d", &a[i]);
if(a[i] == 0) {
break;
}
b[a[i]] = 1;
}
int j;
int total = 0;
for(j = 1; j < 50; j++) {
if(b[j] == 1 && b[j*2] == 1) {
total++;
}
}
printf("%d\n", total);
}
return 0;
} |
12 | 5544 | //**************************
//*????? *
//*?????? 1200012775 *
//*???2012/10/29 *
//**************************
int main()
{
int a[15], t, i, j, k, m, n; //????????
for (i = 1; ; i++) //????
{
for(j = 0; j <= 14; j++) //??????????0
a[j] = 0;
for (j = 0; ; j++)
{
cin >> t; //??
if (t == 0) //??????0
break; //????
else //??
{
a[j] = t; //?????
}
}
m = 1; //??????
if (a[0] != -1) //???????0
m = 0; //?????
for (j = 1; j < 15; j++)
{
if (a[j] != 0) //???????????
m = 0; //?????
}
if (m == 1) //?????
{
cout << "0" << endl; //??0
break; //??
}
n = 0; //??????0?
for (j = 0; j <= 14; j++) //???????
for (k = j + 1; k <= 14; k++) //????????
{
if(a[j] != 0 && a[k] != 0 && (a[j] == 2 * a[k] || a[k] == 2 * a[j])) //???????0?????????2?
n = n + 1; //???1
}
cout << n << endl; //????
}
return 0;
} |
12 | 5545 | main()
{
int a[100][16],i,j,k,s,t;
int d[100];
int q,p;
for (i=0;;i++)
{
for (j=0;;j++)
{
scanf("%d",&a[i][j]);
if (a[i][j]==0||a[i][j]==-1)
break;
}
if (j==0)
break;
s=0;
for (k=0;k<j-1;k++)
{
for (t=k+1;t<j;t++)
{
p=a[i][t]-a[i][k]*2;
q=a[i][k]-a[i][t]*2;
if (p==0||q==0)
s++;
}
}
d[i]=s;
}
for (k=0;k<i;k++)
printf("%d\n",d[k]);
} |
12 | 5546 | int main()
{
int a[16],i,j,h,t=0,flag=1;
while(flag==1){
for(i=0;i<16;i++){
scanf("%d",&a[i]);
if(a[i]==-1) {flag=0;break;}
if(a[i]==0) {h=i;break;}
}
if(flag==1){
for(i=0;i<h;i++){
for(j=0;j<h;j++)
if(a[i]==2*a[j]) t++;
}
printf("%d\n",t);t=0;}
}
return 0;
}
|
12 | 5547 | 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 | 5548 | //********************************
//*??? ?? **
//*?????? 1300012887 **
//*???2013.10.23 **
//********************************
int main()
{
int i = 0, x, j, g, k, b, a[15];
while (cin>>x)
{
if (x == -1)
return 0;
else
{
j = 0;
i = 0;
for(g = 0; ; g++)
{
a[i] = x;
i++;
cin >> x;
if(x == 0)
break;
}
for (k = 0;k < i;k++)
{
b = 2*a[k];
for(g = 0; g < i; g++)
{
if(a[g] == b)
j++;
}
}
}
cout << j << endl;
}
}
|
12 | 5549 | 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 | 5550 | //**************************
//*????? *
//*???????? *
//*???1000012832 *
//**************************
int main()
{
int a[16] ,i,j,k,m,n,count;//????
for(i=0;;i++)
{
cin>>m; //??????
if(m==-1) //???1???????
{
break;
}
else //????1?????????????
{
count=0;
a[0]=m;
for(j=1;j<16;j++) //???????????
{
cin>>a[j];
if(a[j]==0) //???0
{
break; //?????
}
}
n = j; //???j-1???
for(j=0;j<n;j++)
{
for(k=j+1;k<n;k++)
{
if(a[j]==2*a[k]||a[k]==2*a[j])//?????????2?????????????????1
{
count++;
}
}
}
cout<<count<<endl;//??????
}
}
return 0;
} |
12 | 5551 | //********************************
//*?? **
//*????? 1300012848 **
//*???2013.10.30 **
//********************************
int main()
{
int i, j, k, a[16]={0}, count; //0????????????????????16??????????15+1??
do
{
count = 0;
cin >> a[0];
if(a[0] == -1) //???-1?????? ????
break;
for(i = 1;; i++)
{
cin >> a[i];
if(a[i] == 0) //??????0????????
break;
}
for(j = 0; j < i; j++)
for(k = 0; k < j; k++)
if (a[k] == 2 * a[j] || 2 * a[k] == a[j]) //?????????????
count ++;
cout << count << endl;
}while(1);
return 0;
} |
12 | 5552 | int main()
{
long i,j,k,m,a[17][17],b[100],c[100]={0};
for (i=1;i<=100;i++)
{
scanf("%d",&a[i][1]);
if (a[i][1]==-1)
break;
else
{
for (j=2;j<=100;j++)
{
scanf("%d",&a[i][j]);
if (a[i][j]==0)
break;
else b[i]=j;
}
}
for (k=1;k<=b[i];k++)
{
for (m=1;m<=b[i];m++)
{
if (a[i][k]==2*a[i][m])
c[i]++;
}
}
printf("%d\n",c[i]);
}
} |
12 | 5553 | //?? - 1134 ??
//2010?11?05?
//1000012753 ???
int main()
{
int N, num, i, j, k;
int a[200];
for (k = 1; ; k++)
{
i = 0;
while (1)
{
cin >> a[i];
if (a[0] == -1)
return 0;
if (a[i] == 0)
break;
i++;
}
num = 0;
for (i = 0; a[i] != 0; i++)
N = i;
for (i = 0; i <= N; i++)
{
for (j = i + 1; j <= N; j++)
{
if (a[i] == 2 * a[j] || a[j] == 2 * a[i])
num++;
}
}
cout << num << endl;
}
return 0;
}
|
12 | 5554 | int main ()
{
int n=0,i,j,k,m=0;
int a[16];
while (1){
n=0;
for (i=0;i<16;i++){
scanf("%d",&a[i]);
m=i;
if (a[i]==0) break;
if (a[0]==-1) break;
}
if (a[0]==-1) break;
for (j=0;j<m;j++){
for (k=0;k<m;k++){
if (a[j]==2*a[k]||a[k]==2*a[j])
n+=1;
}
}
printf("%d\n",n/2);
}
return 0;
}
|
12 | 5555 | int a[15];
int main()
{
int num, doub;
char b;
int comp_with_zero;
for (; 1;)
{
num = 0;
doub = 0;
comp_with_zero = 1;
b = 'a';
for (int ai = 0; ai < 15; ai++)
{
a[ai] = 0;
}
for (; 1;)
{
b = cin.get();
if ((b == '0') && (a[num] == 0))
{
break;
}
if ((b - '0' < 10) && (b - '0' >= 0))
{
a[num] *= 10;
a[num] += (b - '0');
}
else
{
if (b == ' ')
{
a[num] *= comp_with_zero;
num += 1;
comp_with_zero = 1;
}
if (b == '-')
{
comp_with_zero = -1;
}
}
}
for (int i = 0; i <= num; i++)
{
for (int ii = i; ii <= num; ii++)
{
if (a[i] == 0)
break;
if ((a[i] % 2 == 0) && (a[i] / 2 == a[ii]))
{
doub += 1;
}
if ((a[ii] % 2 == 0) && (a[ii] / 2 == a[i]))
{
doub += 1;
}
}
}
cout << doub << endl;
}
return 0;
}
|
12 | 5556 |
int main ()
{
int z[15],r[100];
int i,j,l;
int sum=0;
for(i=0;;i++)
{
scanf("%d",&z[i]);
if(z[i]==0)
{
r[sum]=0;
for(j=0;j<i-1;j++)
{
for(l=j+1;l<i;l++)
{
if(z[j]==2*z[l]||z[j]==0.5*z[l])
{
r[sum]++;
}
}
}
sum++;
i=-1;
}
else if(z[i]==-1)break;
}
for(i=0;i<sum;i++)
{
printf("%d\n",r[i]);
}
return 0;
} |
12 | 5557 | int main()
{
int num[16];
int i, j, n, sum;
for (; ;)
{
sum = 0;
for (i = 0; ; i++)
{
cin >> num[i];
if ((num[i] == 0) || (num[i] == -1))
break;
}
if (num[i] == -1)
{
break;
}
n = i;
for (i = 0; i < n - 1; i++)
{
for(j = i + 1; j <= n - 1; j ++)
{
if ((num[j] == num[i] * 2) || (num[i] == num[j] * 2))
sum = sum + 1;
}
}
cout << sum << endl;
}
return 0;
} |
12 | 5558 |
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 | 5559 | int main()
{
int a[100][100],column[100]={0},i=0,l=0,j,n,m,s=0;
for(l=0;l<=15;l++)
{
scanf("%d",&a[i][l]);
if(a[i][l]==-1)break;
else if(a[i][l]==0){i++;l=-1;}
else column[i]++;
}
i--;
for(m=0;m<=i;m++)
{
s=0;
for(j=0;j<=column[m]-1;j++)
for(n=j+1;n<=column[m];n++)
if(a[m][j]*2==a[m][n]||a[m][n]*2==a[m][j])
s=s+1;
printf("%d\n",s);
}
return 0;
} |
12 | 5560 | int main()
{
int n=100,nfa[n];
int a[n][16];
memset(a,-100,sizeof(a));
memset(nfa,0,sizeof(nfa));
for(int i=0;i<n;i++)
for(int j=0;j<16;j++){
cin>>a[i][j];
if(a[i][0]==-1){n=i;
break;}
if(a[i][j]==0)break;
}
for(int i=0;i<n;i++)
for(int k=0;k<16;k++)
for(int j=0;j<16;j++)
if(a[i][j]==2*a[i][k])nfa[i]++;
for(int i=0;i<n;i++)cout<<nfa[i]-1<<endl;
return 0;
} |
12 | 5561 |
int main(int argc, char* argv[])
{
int shuzu[16];
int i,j,k,number;
for(k=1;1;k++){
scanf("%d",&shuzu[0]);
if(shuzu[0]==-1){
break;
}
number=1;
for(i=1;i<16;i++){//????
scanf("%d",&shuzu[i]);
if(shuzu[i]==0){
break;
}
else number++;
}
int zu=0;
double a,b;
for(i=0;i<number-1;i++){
for (j=number-1;j>i;j--){
a=(double)shuzu[i]/shuzu[j];
b=(double)shuzu[j]/shuzu[i];
if(a==2||b==2){
zu++;
}
}
}
printf("%d\n",zu);
}
return 0;
}
|
12 | 5562 | int main()
{
int a[16];
int i = 0, n = 0, j, k, m;
for (m = 1; ; m++)
{
i = 0;
n = 0;
while (cin >> a[i])
{
if (a[i] == 0 || a[i] == -1)
{
break;
}
else
{
i++;
}
}
if (a[0] == -1)
{
break;
}
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])
{
n++;
}
}
cout << n << endl;
}
return 0;
} |
12 | 5563 | 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 | 5564 | /*******************************************
*??????.cpp *
*????? *
*????: 2012-10-31 *
*??????????????????????*
*******************************************/
int main(){
//????a[100][20]???num?????temp???????????????size
//?????????time?????i,j,k,l
int a[100][20];
int num, temp, size, time = 0;
int i = 0, j = 0, k, l;
//?????
while (cin >> num)
{
time = 0; //time?????????????????????
if (num == -1) //?num?1?????
break;
//??????????0???i??j???????j??1
else if (num != 0)
{
a[i][j] = num;
j = j + 1;
}
//?num?0???????????????
else if (num == 0)
{
size = j; //?size??
//??i?????
for (l = 0; l < size; l++)
for (j = 0; j + 1 < size; j++) //????j + 1 < size??????l = 0?????????????0??
{
if (a[i][j] > a[i][j + 1])
{
temp = a[i][j];
a[i][j] = a[i][j + 1];
a[i][j + 1] = temp;
}
}
//?????????
for (k = 0; k < size; k++)
for (l = 0; l < size; l++)
{
if (2 * a[i][k] == a[i][l])
time = time + 1;
}
cout << time << endl; //?????????
j = 0; //??????
i = i + 1; //??????1?????????
}
}
return 0;
}
|
12 | 5565 | int main(){
int a[20],temp,n=0,i=1,j,k;
do{
do{
scanf("%d",&temp);
a[i]=temp;
i++;
// printf("%d ",a[i-1]);
}while(temp!=0 && temp!=-1);
//printf("china");
for(j=1;j<i-2;j++){
for(k=j+1;k<=i-2;k++){
if((a[j]/a[k]==2 && a[j]%a[k]==0) || (a[k]/a[j]==2 && a[k]%a[j]==0)){
n++;
//printf("6");
}
}
}
if(temp!=-1){
printf("%d\n",n);
}
i=1;
n=0;
}while(temp!=-1);
return 0;
}
|
12 | 5566 | 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 | 5567 | void main()
{
while(1)
{
int a[100]={-2}, i, j, count=0;
for(i=0; ; i++)
{
scanf("%d", &a[i]);
if(a[0]==-1||a[i]==0) break;
}
if(a[0]==-1) break;
for(i=0; a[i+1]!=0; i++)
for(j=i+1; a[j]!=0; j++)
if(a[i]==2*a[j]||a[i]*2==a[j])
count++;
printf("%d\n", count);
}
} |
12 | 5568 | main()
{int n=0,i=0,j=0,k=0,a[16]={0},b[16];
do{i=0;k=0;
scanf("%d",&a[0]);
b[0]=2*a[0];
if(a[0]==-1)
break;
else
do
{
i++;
scanf("%d",&a[i]);
b[i]=2*a[i];
}while(a[i]!=0);
n=i-1;
for(i=0;i<=n;i++)
{for(j=0;j<=n;j++)
{if(a[i]==b[j])
k++;}
}
printf("%d\n",k);
}while(1);
} |
12 | 5569 | 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 | 5570 |
int main()
{
int num[16] = {0}, sum = 0; //num???????sum??????
int i = 0; //i?????
while ( 1 )
{
i = 0; //????????????
sum = 0;
while ( 1 )
{
cin >> num[i]; //????
if ( num[i] == -1 ) //??????-1??????
return 0;
if ( num[i] == 0 ) //??????0??????
break;
i++; //i??
}
for ( int j = 0; j < i - 1; j++ ) //j??????
{
for ( int k = j + 1; k < i; k++ ) //k??????
{
if ( num[j] == 2 * num[k] || num[k] == 2 * num[j] )
sum++; //???????????sum?1
}
}
cout << sum << endl;
}
return 0;
} |
12 | 5571 | int main ()
{
int a[20],i,j,k,m;
for(i=0;i<20;i++)
a[i]=1;
while(1)
{
i=0;k=0;
while(a[i]!=0)
{
i++;
scanf("%d",&a[i]);
if(a[1]==-1) return 0;
} m=i;
for(i=1;i<m;i++)
{
for(j=i+1;j<m;j++)
{
if((a[j]==2*a[i])||(a[i]==2*a[j]))
k++;
}
}
printf("%d\n",k);
}
}
|
12 | 5572 | /*
* pp19.cpp
*
* Created on: 2010-11-17
* Author: d
*/
int main()
{
int i=1,j,n=0,sum=0;
int a[20];
while(cin>>a[0]&&a[0]!=-1){
while(cin>>a[i]&&a[i]!=0)
{ i++;n++; }
for(i=0;i<=n;i++)
for(j=i+1;j<=n;j++)
if(a[i]==a[j]*2||a[j]==a[i]*2)
sum++;
cout<<sum<<endl;i=1; sum=0; n=0;
}
return 0;
}
|
12 | 5573 | int main()
{
int a[16],sum=0,j,i,k,n=0;
while(1){
for(i = 0;i < 16;i++)
{
scanf("%d",&a[i]);
n = n + 1;
if(a[i]==0)
{
n = n-1;
for(k = 0;k < (n - 1);k ++)
{
for(j = k + 1;j < n;j ++)
{
if((a[j] == a[k]*2) || (a[k]==a[j]*2))
{
sum = sum + 1;
}
}
}
printf("%d\n",sum);
i = 0;
sum = 0;
n = 0;
break;
}
else
{
if(a[i]==-1)
{
return 0;
}
}
}
}
return 0;
}
|
12 | 5574 | int main()
{
int a;
cin>>a;
while(a!=-1)
{
int s[15]={0};
int l=1,m=0;
s[0]=a;
do
{
cin>>a;
s[l]=a;
l++;
}while(a!=0);
for(int i=0;i<15;i++)
for(int j=0;j<15;j++)
if(s[j]==2*s[i]&&s[i]!=0)
m++;
cout<<m<<endl;
cin>>a;
}
return 0;
}
|
12 | 5575 | int main()
{
int a[100][100];int count=0;int i,j,k,m;
for(m=0;;m++)
{
scanf("%d",&a[m][0]);
if(a[m][0]==-1)
break;
else
{
for(i=1;;i++)
{
scanf(" %d",&a[m][i]);
if(a[m][i]==0)
break;
}
}
for(j=0;j<i;j++)
{
for(k=j+1;k<i;k++)
{
if((a[m][j]==2*a[m][k])||(a[m][j]*2==a[m][k]))
count=count+1;
}
}
printf("%d\n",count);count=0;
}
return 0;
}
|
12 | 5576 |
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 | 5577 | //**************************
//?????
//?????
//???2011.10.22
//**************************
int main() //???
{
double a[18]; //????
int i, j, k, c, d; //????????
double b; // ???????
a[0] = 0;
for(i = 1; ;i++)
{
cin >> a[1];
if(a[1] == -1) break; //??????
for(j = 2; ;j++) //????
{
cin >> a[j];
if(a[j] == 0) break; //???0?????
}
k = 0; //k????
for(c = 1;c < j;c++) //?????
{
for(d = 1;d < j;d++)
{
b = a[c] / a[d];
if(b == 2) //??????2
k++;
}
}
cout << k << endl; //????????
}
return 0;
}
|
12 | 5578 | int main()
{
int a[16],i,j,num,flag;
while(1)
{
flag=0;//flag????????0
i=0;
scanf("%d",&a[i]);
if(a[0]==-1)//??????????????????????
break;
else
{
do
{
i++;
scanf("%d",&a[i]);
}while(a[i]!=0);//????????
num=i;//num???????????
for(i=0;i<num;i++)
for(j=i+1;j<num;j++)
if((a[i]==2*a[j])||(a[j]==2*a[i]))
flag++;
printf("%d\n",flag);
}
}
return 0;
}
|
12 | 5579 | int main(){
int a[1000],i,j,n,k;
while(1)
{
n=0;
cin>>a[1];
if (a[1]!=-1)
{
for(i=2;a[i-1]!=0;i++)
cin>>a[i];
for(j=1;j<i-1;j++)
for(k=1;k<i-1;k++)
if(a[k]==2*a[j])
n=n+1;
cout<<n<<endl;
}
else break;
}
return 0;}
|
12 | 5580 |
int main()
{
int num[101],ori[15];
int n,i,count,tot;
scanf("%d",&n);
while(n!=-1)
{
for(i=0;i<101;i++) num[i]=0;
count=0;
while(n!=0)
{
ori[count]=n;
count++;
num[n]=1;
scanf("%d",&n);
}
tot=0;
for(i=0;i<count;i++)
if (ori[i]<=50&&num[ori[i]*2]) tot++;
printf("%d\n",tot);
scanf("%d",&n);
}
return 0;
}
|
12 | 5581 | 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 | 5582 | int main()
{
int a[16], i, j, k, n=0;
do
{
memset(a,0,sizeof(a));
for (i = 0; i < 16; i++)
{
cin >> a[i];
if (a[i] == 0)
break;
if (a[i] == -1)
return 0;
}
n = 0;
for (k = 0; k <= i-1; k++)
{
for (j = k + 1; j <=i-1; j++)
{
if (((a[k] * 2 == a[j]) || (a[k] == (2 * a[j]))) && (a[k] != 0))
n++;
}
}
cout << n << endl;
}while (1);
return 0;
}
|
12 | 5583 | int main()
{
int n[100][100],i,k,j,s[100],t,p,m,l[100];
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) break;
l[i]=j;
}
}
}
for(k=0;k<i;k++)
{
s[k]=0;
for(t=0;t<=l[k];t++)
{
for(m=t;m<=l[k];m++)
{
a=(double)n[k][t]/n[k][m];
if(a==2||a==0.5) s[k]=s[k]+1;
}
}
}
for(p=0;p<i;p++)
printf("%d\n",s[p]);
return 0;
} |
12 | 5584 | /* Author: Yahoo */
/* Date: 2011-10-12 */
/* Function: random access to files */
/*#include<stdio.h>
int main()
{
if(4==5,5)
printf("good\n");
return 0;
}*/
int main()
{
int n, sum = 0, mat[100];
memset(mat, 0, sizeof(mat));
while(scanf("%d",&n),n != -1)
{
if(n == 0)
{
printf("%d\n", sum);
sum = 0;
memset(mat, 0, sizeof(mat));
}
else if(n > 49)
{
mat[n] = 1;
if(mat[n>>1])
sum++;
}
else
{
mat[n] = 1;
if(mat[n<<1])
sum++;
if(!(n&1) && mat[n>>1])
sum++;
}
}
return 0;
} |
12 | 5585 | /*
* 1.cpp
*
* Created on: 2010-10-17
* Author: lenovo
*/
int main ()
{
int i,j,a[17],t,sum;
do{
t = -1;sum = 0;
for (i=1;i<=16;i++)
{ cin>>a[i];
t++;
if (a[i]==0||a[i]==-1)
break;
}
for (i=1;i<=t;i++)
for (j=1;j<=t;j++)
{
if (a[j]==a[i]*2)
sum++;
}
if (a[1]!=-1)
cout<<sum<<endl;
}
while (a[1]!=-1);
return 0;
}
|
12 | 5586 | 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 | 5587 | int main()
{
int m,i,j,k,key,num;
key=0;
int count[100];
int a[100][156];
int result[100];
for(i=0;i<100;i++)
{
for(j=0;j<16;j++)
{
scanf("%d",&m);
if(m==0)
{
break;
}
else if(m==-1)
{
key=1;
break;
}
else
{
a[i][j]=m;
count[i]=j;
}
}
if(key==1)
{
break;
}
num=i;
}
for(i=0;i<=num;i++)
result[i]=0;
for(i=0;i<=num;i++)
{
for(j=0;j<=count[i];j++)
{
for(k=0;k<=count[i];k++)
{
if(a[i][j]==a[i][k]*2)
result[i]=result[i]+1;
}
}
}
for(i=0;i<=num;i++)
{
printf("%d\n",result[i]);
}
return 0;
} |
12 | 5588 | //********************************
//*?????? **
//*?????? 1000012939 **
//*???2012.11.02 **
//********************************
int main()
{
int a[16];
while (cin >> a[0] && a[0] != -1)
{
int n = 0, count = 0;
while (a[n] != 0)
cin >> a[++n];
for (int i = 0; i < n; i++)
{
for (int j = i; j < n; j++)
if (a[i] == 2 * a[j] || a[j] == 2 * a[i])
count++;
}
cout << count << endl;
}
return 0;
} |
12 | 5589 | int main()
{
int num[20],i,j,n,c,t;
do
{
scanf("%d",&c);
num[0]=c;
n=1;
while(c!=0)
{
scanf("%d",&c);
if(c==-1) return 0;
num[n]=c;
n++;
}
t=0;
for(i=n-2;i>=0;i--)
for(j=n-2;j>=0;j--)
if(num[i]==2*num[j])
t++;
printf("%d\n",t);
}while(c!=-1);
return 0;
} |
12 | 5590 | int main()
{
int x[100][16];
int sum[100]={0};
float y;
int i,j,k;
for(j=0;j<100;j++)
{
for(i=0;i<16;i++)
{
scanf("%d",&x[j][i]);
if(x[j][0]==-1)
goto loop;
if(x[j][i]==0)
break;
}
}
loop:for(j=0;j<100;j++)
{
if(x[j][0]!=-1)
{
for(i=0;i<16;i++)
{
if(x[j][i]==0)
break;
for(k=0;k<16;k++)
{
if(x[j][k]==0)
break;
y=1.0*x[j][i]/(1.0*x[j][k]);
if(y==2)
sum[j]=sum[j]+1;
}
}
printf("%d\n",sum[j]);
}
if(x[j][0]==-1)
break;
}
return 0;
} |
12 | 5591 | void main()
{
int a[15][17],i,num,j,k,l,h;
scanf("%d",&a[0][0]);
for(j=0;j<=15&&a[j][0]!=-1;j++)
{for(i=1;i<=15&&a[j][i-1]!=0;i++)
scanf("%d",&a[j][i]);
scanf("%d",&a[j+1][0]); }
for(l=0;l<=14&&a[l][0]!=-1;l++)
{num=0;
for(k=0;k<=15&&a[l][k]!=0;k++)
{for(h=0;h<=15&&a[l][h]!=0;h++)
{if(a[l][k]==2*a[l][h]) num++;}}
printf("%d\n",num);}
} |
12 | 5592 | 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 | 5593 | /*1 4 3 2 9 7 18 22 0
2 4 8 10 0
7 5 11 13 1 3 0
-1
*/
int main()
{
int a[100];
int i=1,count=0;
scanf("%d",&a[0]);
while (a[i-1]!=0)
{
scanf("%d",&a[i]);
i++;
}
i=i-2;
while (a[0]!=-1)
{
count=0;
int j,k=0;
for(j=0;j<i;j++)
{
for(k=j+1;k<i;k++)
{
if(a[k]==2*a[j]||a[j]==2*a[k])
{
count++;
}
}
}
printf("%d\n",count);
scanf("%d",&a[0]);
if(a[0]==-1)
{
break;
}
i=1;
while (a[i-1]!=0)
{
scanf("%d",&a[i]);
i++;
}
i=i-1;
}
return 0;
}
|
12 | 5594 |
int main()
{
int sc[300],ao[16];
int i,j,k,l,n,b,x,m;
i=0;j=0;k=0;l=0,x=0;
do{
n=1;
for(i=0;i<16;i++){
scanf("%d",&ao[i]);
if(ao[i]==0||ao[i]==-1){
n=i;
break;
}
}
i=0;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(ao[i]*2==ao[j]){
k++;
}
}
}
sc[l]=k;
k=0;
l++;
}
while(n!=0);
for(x=0;x<l-1;x++){
printf("%d\n",sc[x]);
}
return 0;
} |
12 | 5595 | /*
file 1134??
name ???
date 11.5
function ??2?15????????????????????????????????????????????
*/
int main()
{
int a[16], sum = 0, i, j, n = 0;
while(1)
{
for(i = 0; i < 16; i++)
{
cin >> a[i];
if(a[i] == 0)
{
break;
}
else if(a[i] == -1)
{
break;
}
else
{
n++;
}
}
if(a[0] == -1)
{
break;
}
for(i = 0; i < n; i++)
{
for(j = 0; j < n; j++)
{
if(a[i] == a[j] * 2)
{
sum++;
}
}
}
cout << sum << endl;
n = 0; sum = 0;
}
return 0;
} |
12 | 5596 | //this program helps you to find how many pairs of numbers satisfy the standard that the one is double of the other
int main()
{
int a[20],bn[100]={0,0,0},i,j,k,t=1,l;//bn is the number of double
for(t=1;;t++)
{
i=1;
do
{ //this loop is aimed at inputting the t group of numbers
scanf("%d",&a[i-1]);
if(a[i-1]==-1)break;
i++;
}while(a[i-2]!=0);
if(a[i-1]==-1)break;
for(j=1;j<=i-2;j++) //this loop is aimed at check the sequence one by one
{
for(k=1;k<=i-2;k++) //realize the checking
if(a[j-1]==2*a[k-1])bn[t-1]++;
}
}
for(l=1;l<=t-1;l++)
printf("%d\n",bn[l-1]);
return 0;
} |
12 | 5597 | 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 | 5598 | int a[16]={0},k;
void scan();
void main()
{
scanf("%d",&a[0]);
while(a[0]>0)
{
scan();
scanf("%d",&a[0]);
}
}
void scan()
{
int i,j=1,n=0,h,t;
while(scanf("%d",&a[j])&&a[j]!=0)
{
j++;
}
for(i=0;i<j;i++)
{
for(h=i;h<j;h++)
{
if(a[i]>a[h])
{
t=a[i];
a[i]=a[h];
a[h]=t;
}
}
}
for(i=0;i<j-1;i++)
{
for(h=i+1;h<j;h++)
{
if(a[h]==2*a[i])
{
n++;
break;
}
}
}
printf("%d\n",n);
} |
12 | 5599 | int main()
{
int a[500][15];
int i,j,t,number;
for(i=0;;i++){
number=0;
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){
printf("%d\n",number);
break;
}
for(t=0;t<j;t++){
if(a[i][j]*2==a[i][t]){
number++;
break;
}
if(a[i][j]==a[i][t]*2){
number++;
}
}
}
}
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.