id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
5,700 | int main()
{
int a[15] = { 0 } , num = 1 , num1 = 1 , i = 1 , k , j , c = 0 ;
while ( num1 != -1 )
{
cin >> num1 ;
a[0] = num1 ;
while ( num != 0 )
{
cin >> num ;
a[i] = num ;
i++ ;
}
for ( k = 0 ; k <= i - 2 ; k++ )
for ( j = k + 1 ; j <= i - 2 ; j++ )
if ( a[k] == 2 * a[j] || a[j] == 2 * a[k] )
c++ ;
cout << c << endl ;
int a[15] = { 0 } ;
c = 0 ;
i = 1 ;
num = 1 ;
}
return 0 ;
}
| 12 |
5,701 | 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 |
5,702 |
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 |
5,703 | 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 |
5,704 | /*
* qzlx9.cpp
*
* Created on: 2010-11-17
* Author: hanzhe
*/
int main(){ //????
int a[16],j;
while(cin>>a[0]){ //???????
if(a[0]==-1)break; //???-1???
int i=1;
int l=0;
while(cin>>a[i]){
if(a[i]==0)break; //??????0?????
for(j=0;j<i;j++) //??
if((a[i]==2*a[j])||(a[j]==2*a[i]))
l=l+1;
i++;
}
cout<<l<<endl;
}
return 0;
} //????
| 12 |
5,705 | 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 |
5,706 | int main()
{
int a[16]={0}, i=0, j=0, n=0, num, k=0, m;
do
{
cin>>a[0];
if(a[0]==-1)
break;
for (i=1;i<16;i++)
{
cin>>a[i];
if(a[i]==0)
break;
}
n=0;
for(k=0;k<i;k++)
for(j=0;j<i;j++)
{
if(a[k]==2*a[j])
n++;
}
cout<<n<<endl;
}
while(1);
return 0;
}
| 12 |
5,707 | 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 |
5,708 | 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 |
5,709 |
int main()
{
int num[17], n, count = 1, result = 0;
while ((cin >> n) && (n != -1))
{
if (n)
{
num[count] = n;
count++;
}
else
{
for (int i = 1; i < count; i++)
{
for (int j = 1; j < count; j++)
{
if (num[i] == 2 * num[j])
result++;
}
}
cout << result << endl;
result = 0;
count = 1;
}
}
return 0;
} | 12 |
5,710 |
int main()
{
int a[15], count = 0;
int i, j, k;
for (i = 0; ; i++)
{
cin >> a[i];
if (a[0] == -1)
break;
else if (a[i] == 0)
{
for (j = 0; j < i; j++)
for (k = 0; k < i; k++)
{
if (a[k] == a[j] * 2)
count++;
}
cout << count << endl;
count = 0;
i = -1;
}
}
return 0;
}
| 12 |
5,711 | void main()
{
int a[100][16],i,j,k;
for(i=0;;i++)
{
scanf("%d",&a[i][0]);
if(a[i][0]==-1) break;
else
{
for(j=1;j<16;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0) break;
}
}
}
for(i=0;i<100;i++)
{
int num=0;
if(a[i][0]==-1) break;
else
{
for(j=0;(j<16)&&(a[i][j]!=0);j++)
{
for(k=j+1;(k<16)&&(a[i][k]!=0);k++)
{
if(a[i][k]==2*a[i][j]) num++;
else if(a[i][j]==2*a[i][k]) num++;
}
}
}
printf("%d\n",num);
}
}
| 12 |
5,712 | //************************************************
//* ??????
//* ????? 2010 11 8
//* ???????????
//***********************************************
int main ()
{
//????
int a[16];
while ((cin >> a[0]) && a[0] != -1 )//???????????????
{
int num0 = 1, i, j, k, num=0;
i = 1;
while(cin >> a[i] && (a[i] != 0))//???????0
{
//?????????
num0 ++;
i ++;
}
for(j = 0; j < num0 - 1; j ++)//??n-1?
{
for(k = j + 1; k <= ( num0 - 1); k ++)//???????????
{
if((a[j] == 2 * a[k]) || (2 * a[j] == a[k]))
num ++;//???????
}
}
cout << num << endl;
}
return 0;
}
| 12 |
5,713 | void main()
{
int i,j,k,a[16],s,q;
do
{
scanf("%d",&q);
a[0]=q;
if(q==-1) break;
for(i=1;i<=15;i++)
{
scanf("%d",&a[i]);
if (a[i]==0) break;
}
s=0;
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(a[j]==2*a[k]) s=s+1;
else s=s;
}
}
printf("%d\n",s);
}
while(q!=-1);
}
| 12 |
5,714 | 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 |
5,715 | //****************************************
//*?????
//*?????? 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 |
5,716 | //***************************
//*????? **
//*?????? 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 |
5,717 | 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 |
5,718 | 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 |
5,719 | int main()
{printf("3\n");printf("2\n");printf("0\n");printf("0\n");printf("1\n");printf("1\n");printf("0\n");printf("2\n");printf("2\n");printf("6\n");printf("11\n");return 0;} | 12 |
5,720 | 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 |
5,721 | //********************************
//*????? **
//*?????? 1300012745 **
//*???2013.10.31 **
//********************************
int main()
{
int a[16], num, i=1, j=0, k=0, l=0;
while(cin>>a[0])
{
//a[15]={0};
num=0;
//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<=15;j++)
for (k=0;k<=15;k++)
if ((a[j] != 0) && (a[k] != 0) && (a[j] == 2 * a[k]))
num++;
for (l=0;l<=15;l++)
a[l]=0;
cout<<num<<endl;
}
return 0;
}
| 12 |
5,722 | 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 |
5,723 | /*
* ????.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 |
5,724 |
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 |
5,725 | //*********************************
//*????? **
//*?????? 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 |
5,726 | int main()
{
int a[16],i,j,s,t;
for(;;)
{s=0;
scanf("%d",&a[0]);
if(a[0]==-1)break;
for(i=1;;i++)
{scanf("%d",&a[i]);
if(!a[i])break;}
t=i;
for(i=0;i<t;i++)
for(j=0;j<t;j++)
if(a[j]==(2*a[i]))
s+=1;
printf("%d\n",s);}
} | 12 |
5,727 | 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 |
5,728 | 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 |
5,729 | //*******************************************************
//* ? ?: ?? *
//* ? ?: ??? 1200012861 *
//* ? ?: 2012?10?9? *
//*******************************************************
int main()
{
int n, num[15], i, j, s, t, answer;
while (cin >> num[0])
{
if (num[0] == -1)
break; //???????-1?????
j = 0; //???????j
answer = 0; //??????????????
do
{
j++;
cin >> num[j]; //????
}
while (num[j] != 0); //????0?????
for (s = 0; s < j; s++)
{
for (t = 0; t < j; t++)
{
if (num[t] == 2 * num[s]) //?????????????
answer++; //??+1
}
}
cout << answer << endl;
}
return 0;
}
| 12 |
5,730 | 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 |
5,731 |
int main(int argc, char* argv[])
{
int n,i,k,d,total;
total=0;
int shuzu[16];
for(i=0;i<16;i++){
scanf("%d",&n);
if(n!=-1){
shuzu[i]=n;
if(n==0){
for(d=0;d<i;d++){
for(k=0;k<i;k++){
if(shuzu[d]==2*shuzu[k]){
total++;}}}
printf("%d\n",total);
i=-1;
total=0;}
}
else{
break;}}
return 0;
}
| 12 |
5,732 | 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 |
5,733 | int main()
{
int n=0,t=0,i,j,x;
int sz[16];
for(;;){
for(i=0;i<16;i++){
scanf("%d",&sz[i]);
if(sz[i]==0||sz[0]==-1)break;
n=n+1;
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(sz[i]-2*sz[j]==0)
t=t+1;
else;
}
}
if(sz[0]==-1)break;
printf("%d\n",t);
t=0;
n=0;
}
return 0;
} | 12 |
5,734 | //?? - 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 |
5,735 | int main()
{
int x[16],i,j,k;
for(i=0;i<15;i++)
x[i]=0;
for(i=0;;i++)
{
cin>>x[i];
if(x[i]==-1)
break;
if(x[i]==0)
{
int t=0;
for(j=0;j<i;j++)
for(k=0;k<i;k++)
if(x[j]==2*x[k])
{
t++;
}
cout<<t<<endl;
i=-1;
}
}
return 0;
} | 12 |
5,736 |
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 |
5,737 | 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 |
5,738 | 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 |
5,739 | int main()
{
int i, j, n, x[15], count;
while (1)
{
count = 0;
for (n = 0; ; n++)
{
cin >> x[n];
if (x[n] <= 0) break;
}
if (x[n] == -1) break;
for (i = 0; i < n; i++)
for(j = 0; j < n; j++)
{
if (j == i) continue;
if (x[j] == 2 * x[i]) count++;
};
cout << count << endl;
}
return 0;
} | 12 |
5,740 | /* 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 |
5,741 |
int main(int argc, char* argv[])
{
int shuzu[16]={0},i,j,pair=0,n;
for(i=0;shuzu[0]!=-1;i++)
{
scanf("%d",&shuzu[i]);
if(shuzu[i]==0)
{
n=i;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(shuzu[i]==2*shuzu[j])
pair++;
}
}
printf("%d\n",pair);
i=-1;
pair=0;
}
}
return 0;
}
| 12 |
5,742 | int main()
{
int a[20],i=0,j=0,n=0;
while(scanf("%d",&a[i]),a[i]!=-1)
{
while(scanf("%d",&a[i+1]),a[i+1]!=0)
i=i++;
for(i=0;a[i]!=0;i++)
for(j=i;a[j]!=0;j++)
{
if(a[i]==2*a[j]||2*a[i]==a[j])
n=n++;
}
printf("%d\n",n);
n=0;
i=0;
}
return 0;
}
| 12 |
5,743 |
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 |
5,744 | int main()
{
int a[100][15],b[100]={0},i,j,k,s,m=0,x;
for(i=0;;i++)
{
scanf("%d",&a[i][0]);
if(a[i][0]==-1) break;
else
{
for(j=1;;j++)
{b[m]++;
scanf("%d",&a[i][j]);
if(a[i][j]==0) break;
else continue;}
m++;
}
}
for(i=0;i<m;i++)
{x=0;
for(j=0;j<b[i];j++)
{s=0;
for(k=0;k<b[i];k++)
{if(a[i][k]*2==a[i][j])
s=s+1;}
x=x+s;}
printf("%d\n",x);
}
return 0;
}
| 12 |
5,745 | 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 |
5,746 |
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 |
5,747 | int main()
{
int a[16],x,y,s,i,j,k,l,m,n;
do
{
scanf("%d",&x);
if(x==-1) break;
a[0]=x;
i=1;
do
{
scanf(" %d",&y);
a[i]=y;
i=i+1;
}
while(y!=0);
scanf("\n");
n=i-2;
i=0;
while(i<=n)
{
j=0;
while(j<=n-1)
{
if(a[j]>a[j+1])
{
s=a[j+1];
a[j+1]=a[j];
a[j]=s;
}
j=j+1;
}
i=i+1;
}
i=0;
m=0;
while(i<=n-1)
{
j=n-i;
k=0;
while(k<=j-1)
{
if(a[j]==2*a[k]) m=m+1;
k=k+1;
}
i=i+1;
}
printf("%d\n",m);
}
while(x!=-1);
} | 12 |
5,748 | int main()
{
int a[15];
int i = 0 ;
while(cin >> a[i])
{
int i = 0,j = 0;
if(a[i] == -1)return 0;
do
{
i++;
j++;
cin >> a[i];
} while(a[i]);
int y, z, k = 0;
for(z=0; z <= j - 1; z++)
for(y = z + 1; y <= j - 1; y++)
if(a[z] == 2 * a[y] || a[y] == 2 * a[z])
{
k++;
}
cout << k <<endl;
}
return 0;
}
| 12 |
5,749 | /**
* ???1000012725
* ??: ??
* ???1134 ??
* ?????????2?15????????????????
* ??????????????????????????
**/
int main()
{
int i , j , f = 0; //??i?j??????f???????????
while(f == 0) //?f?0??????????
{
int a[16] , count = 0; //????a[16]?????count???????????????0
for (i = 0; ; i ++)
{
cin >> a[i]; //????a[i]??
if (a[i] == 0) //??a[i]???0
{
cout << count << endl; //??count?????
break;
}
else if (a[i] == -1) //?a[i]?-1????????f??1????????
{
f = 1;
break;
}
else //????????
{
for (j = 0; j < i; j ++)
{
if ((a[i] == a[j] * 2) || (a[j] == a[i] * 2)) //?????????????????1
count ++;
}
}
}
}
return 0;
}
| 12 |
5,750 | 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 |
5,751 | 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 |
5,752 | 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 |
5,753 | 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 |
5,754 |
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 |
5,755 | //?? ??? 1100012858
int main()
{
int num [16]; //??????
int i = 1; //????i?????????+1
int n;
int j,k,ans; //ans?????
i = 1; //???????
do
{
cin >> n; //n????????
if (n != -1)
{
if (n == 0)
{
ans = 0;
for (j = 1;j <= i-1;j++)
for (k = 1;k <= i-1;k++)
if (num[j] == 2*num[k])
ans += 1;
cout << ans << endl;
i = 1; //???????
} //?????????????
else
{
num[i] = n; //??????????
i += 1;
}
}
}while (n != -1);
return 0;
}
| 12 |
5,756 |
int main()
{
int a[20]={0};
int j,k,i=0,n=0,m=0;
while((scanf("%d",&a[i]))&&(a[i]>=0))
{
if(a[i]==0)
{
for(j=0;j<i-1;j++)
{
for(k=j+1;k<i;k++)
if(a[j]==2*a[k]||a[k]==2*a[j])
m++;
}
printf("%d\n",m);
m=0;
i=0;
for(j=0;j<20;j++)
a[j]=0;
}
i++;
}
return 0;
} | 12 |
5,757 | 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 |
5,758 | int main()
{
int n=0,k=0,j,i,a[16],m=0;
do
{
for(i=0;i<=15;i++)
{
cin>>a[i];
n++;
if(a[i]==0)break;
if(a[i]==(-1))break;
}
if(a[0] == -1)break;
for(j=0;j<n;j++)
{
for(k=j+1;k<n;k++)
{
if(a[j]==a[k]*2||a[k]==a[j]*2)
m++;
}
}
cout<<m<<endl;
m=0;
n=0;
}while(a[0]!=(-1));
return 0;
}
| 12 |
5,759 | 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 |
5,760 |
int main(int argc, char* argv[])
{
int s[16]={0};
while(1){
int i,j,count=0,flag=0;
for(i=0;;i++){
scanf("%d",&s[i]);
if(s[i]==-1)
{
flag=1;
break;
}
if(s[i]==0)
break;
count++;
}
if(flag)
break;
int num=0;
for(i=0;i<count;i++){
for(j=i;j<count;j++){
if(s[i]==s[j]*2||s[j]==s[i]*2)
num++;
}
}
printf("%d\n",num);
}
return 0;
}
| 12 |
5,761 | int main()
{
int i,j,n,num[15],out;
while (1)
{
n=-1;
out=0;
scanf("%d",&i);
if (i==-1) break;
num[++n]=i;
while (1)
{
scanf("%d",&i);
if (i==0) break;
num[++n]=i;
}
for (i=0;i<=n-1;i++)
for (j=i+1;j<=n;j++)
if (num[j]==2*num[i] || num[i]==2*num[j]) out++;
printf("%d\n",out);
}
return 0;
} | 12 |
5,762 | //**************************************************************************
//*?????? *
//*??? ??????????????????????????????? *
//*?????? *
//*???2010?11?03? *
//**************************************************************************
int main()
{
int a; //???????????????
while (cin >> a) //??????
{
if (a != -1) //????????-1
{
int i = 0, j, k, p = 0; //?????p?????
int b[15] = {a}; //????????
while (b[i] != 0) //???????????0????????
{
cin >> b[i + 1];
i ++; //?????????
}
for (j = 0; j < i; j ++)
{
for (k = j + 1; k < i; k ++)
if (b[k] == 2 * b[j] || b[j] == 2 * b[k]) //?????????????2?
{
p = p + 1; //???????
}
}
cout << p << endl; //??????
}
}
return 0;
}
| 12 |
5,763 |
int main()
{
int a[20][16]={0};
int bei[20]={0},j,k,chu,last;
for(j=0;j<20;j++){
for(k=0;k<16;k++){
scanf("%d",&a[j][k]);
if(a[j][k]==0||a[j][k]==-1)
break;
}
if(a[j][k]<0){
last=j;
break;
}
}
for(j=0;j<20;j++){
for(k=0;k<16;k++){
for(chu=0;chu<16;chu++){
if((a[j][chu]==2*a[j][k])&&a[j][k]!=0&&a[j][chu]!=0){
bei[j]=bei[j]+1;
}
}
}
if(a[j][0]==-1)
break;
}
for(j=0;j<last;j++){
printf("%d\n",bei[j]);
}
return 0;
} | 12 |
5,764 | //* ?? *
//* author:??? *
//* time : 10.19 *
int main()
{
int a[16] = {0};
int i, j, k, n = 0;
do
{
for(i = 0; i <= 15; i++)
{
cin >> a[i];
if(a[0] == -1)
break;
if(a[i] == 0)
break;
}
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])
n++;
}
cout << n << endl;
n = 0;
}while(1);
return 0;
}
| 12 |
5,765 | int main() // ?????
{
int a[17] = {0}; //
while (cin >> a[0] && a[0] != -1) // while ???????? -1 ???
{
int i = 0, j = 0, k = 0, n = 0; // ????????
for (i = 1; i <= 15 ; i++) // ?????????? 0 ???
{
cin >> a[i];
if (a[i] == 0)
break;
} // ????
for (; j <= i - 1; j++) // ???????????
{
for (n = 0; n <= i - 1; n++)
if ((a[n] == 2 * a[j]) || (a[j] == 2 * a[n])) // ???????????
k++;
} // ??????
k = k / 2; // ????????? 2
cout << k << endl; // ?? k
}
return 0;
} // ?????
| 12 |
5,766 | 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 |
5,767 | /*
* 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 |
5,768 | void main()
{
int i,j=0,a[100][100],s[1000],b[100]={0},k=0;
for(i=0;i<1000;i++)
{
scanf("%d",&s[i]);
if(s[i]==-1) break;
}
for(i=0;s[i]!=-1;i++)
{
if(s[i]!=0)
{
a[k][j]=s[i];
j++;
}
else
{
a[k][j]=0;
j=0;
k++;
}
}
a[k][0]=-1;
for(i=0;a[i][0]!=-1;i++)
{
for(j=0;a[i][j]!=0;j++)
{
for(k=0;a[i][k]!=0;k++)
{
if(a[i][j]==2*a[i][k])
b[i]++;
}
}
printf("%d\n",b[i]);
}
}
| 12 |
5,769 | /**
* @file 1000012834_002homework.cpp
* @author ???
* @date 2010-11-3
* @description
* ???????1134 ??
*/
int main()
{ //?????
int i , j , ii , t , flag; //???????????????????
int a[2000]; //????
while (1) //?????-1????????
{
t = 0; //?????
flag = 1;
i = 1;
while (flag == 1) //?????????0????
{
cin >> a[ i ++]; //????????
if (a[ i - 1 ] == 0) //????????????
{
flag = 0;
}
else
if (a[ i - 1 ] == -1) //????-1??????????
return 0;
}
/* while ((a[i] = cin.get()) != -1)
{
i ++;
t = 0;
cin.get();
while ((a[i++] = cin.get()) != '0')
{ a[i - 1] -= 48;
cin.get();
}
*/
i -= 1; //????i????????????0
for (j = 1; j < i; j++) //??????????,????i++???????-1
{
if (a[ j ] % 2 == 0) //???????????
{
for (ii = 1; ii < i; ii++) //????????????????
{
//??????????????
if (a[ ii ] * 2 == a[ j ])
t ++; //???????????1
}
}
}
cout << t << endl; //?????????????
i = 0;
}
return 0;
} //????? | 12 |
5,770 |
int main(int argc, char* argv[])
{
int a=1,i=0,j,k,n=0,zs=0;
int num[15];
while(a!=-1){
scanf("%d",&a);
if(a!=0){
num[i]=a;
n++;
i++;
}
else{
for(j=0;j<n;j++){
for(k=0;k<n;k++){
if(num[j]==2*num[k]){
zs++;}}}
printf("%d\n",zs);
i=0;
n=0;
zs=0;}
}
return 0;
} | 12 |
5,771 | 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 |
5,772 | 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 |
5,773 | int main(){
int n[100][16];
int i,j,r,p;
for(i=0; i<100; i++)
{
scanf("%d",&n[i][0]);
if(n[i][0]==-1) break;
for(j=1; n[i][j-1]!=0; j++)
{
scanf("%d",&n[i][j]);
}
int t=0;
for(r=0;r<j-1;r++)
{
for(p=r+1;p<j;p++)
{
if(n[i][p]==2*n[i][r])
{
t++;
break;
}
}
}
for(r=j-1;r>0;r--){
for(p=r-1;p>=0;p--)
{
if(n[i][p]==2*n[i][r])
{
t++;
break;
}
}
}
printf("%d\n",t);
}
return 0;
} | 12 |
5,774 | void main()
{
int a[17],h,i,j,x=1,s;
while(x)
{
for(i=1;i<17;i++) {
scanf("%d",&a[i]);
if(a[i]==-1) goto end;
if(a[i]==0) {h=i;break;}
continue;}
if(x)
{s=0;
for(i=1;i<h-1;i++)
{for(j=i+1;j<h;j++)
if(a[i]==2*a[j]||a[j]==2*a[i])
s++;}
}
printf("%d\n",s);
}
end:
return 0;
}
| 12 |
5,775 | 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 |
5,776 |
int main(int argc, char *argv[])
{
int a[1000],n,b[15],m,i,j,z,num=0;
memset(a,0,1000*sizeof(int));
memset(b,0,15*sizeof(int));
while(1){
i=0;
do{
scanf("%d",&m);
if(m==0)
break;
if(m==-1)
break;
b[i]=m;
i++;
}while(1);
if(m==-1)
break;
for(j=0;j<i;j++){
for(z=0;z<i;z++){
if(b[j]*2==b[z])
a[num]++;
}
}
num++;
}
for(j=0;j<num;j++)
printf("%d\n",a[j]);
return 0;
} | 12 |
5,777 | 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 |
5,778 | //*****************************************
//* ????? **
//* ?????? 1300012741 **
//* ???2013.10.23 **
//*****************************************
int main()
{
int list[15] = {0};
int i, j, num, sum;
cin >> num;
while ( num != -1 )
{
i = 1;
j = 0;
sum = 0;
list[0] = num;
while ( ( cin >> list[i], list[i] ) != 0 )
i++;
while ( list[j] )
{
for ( i = j + 1; list[i]; i++ )
{
if ( list[i] == 2 * list[j] || 2 * list[i] == list[j] )
sum++;
}
j++;
}
cout << sum << endl;
cin >> num;
}
return 0;
} | 12 |
5,779 | main()
{
int a[16]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},i=0,j=0,k=0;
scanf("%d",&a[0]);
while (a[0]!=-1)
{
i=1;
do
{
scanf("%d",&a[i]);
if (a[i]<0) {}
i++;
}
while (a[i-1]);
for (i=0;i<16;i++)
{
if (a[i])
{
for (j=0;j<16;j++)
{
if (a[i]==2*a[j]) k+=1;
}
}
}
printf("%d\n",k);
for (i=0;i<16;i++) a[i]=0;
k=0;
scanf("%d",&a[0]);
}
} | 12 |
5,780 | 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 |
5,781 | void main()
{
int b;
scanf("%d",&b);
while(b!=-1)
{
int a[15]={0};
int i=1;
int k,j;
int sum=0;
a[0]=b;
scanf("%d",&a[i]);
while(a[i]!=0)
{
i++;
scanf("%d",&a[i]);
}
for(k=0;k<i;k++)
{
for(j=k+1;j<i;j++)
{
if(a[j]==2*a[k]||a[k]==2*a[j])
sum++;
}
}
printf("%d\n",sum);
scanf("%d",&b);
}
} | 12 |
5,782 | //********************************
//*????? **
//*?????? 1300012757 **
//*???2013.10.30 **
//********************************
int main()
{
int in;
cin >> in;
while (in != -1)
{
int a[15];
int i = 0, num, count = 0;
while (in != 0)
{
a[i] = in;
i ++ ;
cin >> in;
}
num = i;
for (int p = 0; p < num ; p ++ )
{
if (a[p] % 2 ==1 )
continue;
for (int q = 0; q < num ; q ++ )
{
if ( a[p] == a[q] * 2)
count ++ ;
}
}
cout << count << endl;
cin >> in;
}
return 0;
} | 12 |
5,783 | main()
{
int a[17],num=0,i=1,j,m;
char c;
while(1)
{
num=0;
i=1;
do
{
scanf("%d",&a[i]);
c=getchar();
i++;
}while(c!='\n');
m=i-2;
if(!m) break;
for(i=1;i<=m;i++)
{
for(j=i+1;j<=m;j++)
{
if(a[i]*2==a[j]||a[i]==2*a[j]) num++;
}
}
printf("%d\n",num);
}
return 0;
} | 12 |
5,784 | int main()
{
int a[17],b=0,i,j,l,m=0,q;
for(i=0;i<=16;i++)
a[i]=0;
for(q=0;;q++)
{
for(i=0;i<16;i++)
{
scanf("%d",&a[i]);
b=b+1;
if(a[i]==0)
{
break;
}
}
if(a[0]==-1)
{
goto lab;
}
for(j=0;j<b;j++)
{
for(l=j+1;l<b;l++)
{
if(a[j]==2*a[l]||a[l]==2*a[j])
{
m=m+1;
}
}
}
printf("%d\n",m);
m=0;
b=0;
}
lab:;
}
| 12 |
5,785 | int main()
{
int num[15], a, i,x ,k, t;
cin >> a;
while(a != -1)
{
i = 0;
x = 0;
while(a != 0)
{
num[i] = a;
i = i + 1;
cin >> a;
}
for ( k = 0; k <= i-1; k++)
{
for ( t = 0; t <= i - 1; t++)
{
if ( num[k] == num[t]*2)
x = x + 1;
}
}
cout << x << endl;
cin >> a;
}
return 0;
}
| 12 |
5,786 |
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 |
5,787 |
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 |
5,788 |
int main(int argc, char* argv[])
{
int sz[15];
int a,i,k,count=0;
for(i=0;i<15;i++)
{
scanf("%d",&a);
if(a==-1)break;
else if(a==0)
{ i=-1;
printf("%d\n",count);
count=0;
continue;
}
else sz[i]=a;
for(k=0;k<=i;k++)
{
if(sz[i]==sz[k]*2||sz[k]==sz[i]*2)count++;
}
}
return 0;
}
| 12 |
5,789 |
int main()
{
int shuru[20] = {0};
while (true)
{
int i = 1 , j , k , s , no;
s=0;
cin>>shuru[0];
if(shuru[0]==-1)
break;
for(i=1;i<=15;i++)
{
cin>>shuru[i];
if(shuru[i]==0)
break;
for(j=0;j<i;j++)
if((shuru[j]==2*shuru[i])||(2*shuru[j]==shuru[i]))
s++;
}
//cout << "yes " << shuru[0] << endl;
cout<<s<<endl;
for(i=0;i<=14;i++)
shuru[i]=0;
}
return 0;
}
| 12 |
5,790 | int main()
{
int s[15];int a,b;
int i,t,h,k;
for(i=0;i<=100;i++)
{
b=0;a=0;
for(t=0;t<17;t++)
{
scanf("%d",&s[t]);
if(s[t]==0)break;
if(s[t]==-1)break;
a++;
}
if(s[t]==-1)break;
for(k=0;k<a;k++)
{
for(h=0;h<a;h++)
{
if(s[k]==2*s[h]){b++;}
else{b=b;}
}
}
printf("%d\n",b);
}
return 0;
}
| 12 |
5,791 | /**
????1.cpp
? ?????
? ??10.30
? ??????????????
*/
int main()
{
int a[16], i;
for(i = 1;;i++)
{
int j, k, n = 1, cnt = 0;
cin >> a[0];
if (a[0] == -1)break;
for(j = 1;j < 16;j++)
{
cin >> a[j];
if(a[j] == 0)break;
n++;
}
for(j = 0;j < n - 1;j++)
{
for(k = 1;k <= n - j - 1;k++)
{
if(a[j] == 2 * a[j + k] || 2 * a[j] == a[j + k])
cnt++;
}
}
cout << cnt << endl;
}
return 0;
}
| 12 |
5,792 | 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 |
5,793 | main()
{
int a[16],n,j,k,p,m;
do
{
a[0]=-1;
for(j=0,n=0;;j++)
{
scanf("%d",&a[j]);
if(a[0]==-1)
{
break;
}
if(a[j]==0) break;
n++;
}
m=0;
for(k=0;k<=n-1;k++)
{
for(p=k+1;p<=n;p++)
{
if(a[p]==(a[k]*2)||a[k]==(a[p]*2))
{
m++;
}
}
}if(a[0]==-1)
break;
printf("%d\n",m);
}while(a[0]!=-1);
return 0;
} | 12 |
5,794 |
void main()
{
int a[100][16]={0},i=0,j=0,x,y,z,m;
do
{j=0;
do
{
scanf("%d",&a[i][j]);
if(a[i][j]==-1) break;
j++;
}
while(a[i][j-1]!=0);
if(a[i][j]==-1) break;
else i++;
}
while(1==1);
for(x=0;x<i;x++)
{
m=0;
{for(y=0;a[x][y]!=0;y++)
{for(z=0;a[x][z]!=0;z++)
{if (a[x][z]==2*a[x][y]) m++;
}
}
}
printf("%d\n",m);
}
}
| 12 |
5,795 | 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 |
5,796 | 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 |
5,797 | int main()
{
int a[16];
int i,x,y,s,num=0;
for(;;)
{num=0;
for(i=0;i<16;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{break;}
}
if(a[0]==-1)
{break;}
if(a[0]==0)
{printf("%d",num);}
for(x=0;x<i;x++)
{
for(y=0;y<i;y++)
{
s=a[x]-a[y]-a[y];
if(s==0)
{num++;}
}
}
printf("%d\n",num);}
return 0;
}
| 12 |
5,798 |
int main(int argc, char *argv[])
{
int a[16]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
int i,j,m,n;
while(1){
for(i=0;i<16;i++)
{
scanf("%d",&a[i]);
if(a[i]==-1){return 0;}
if(a[i]==0){n=i;break;}
}/*input*/
m=0;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(a[j]==(a[i]+a[i]))m++;
}
}/*??*/
{printf("%d\n",m);}
}
return 0;
}
| 12 |
5,799 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.