id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
5,800 | int main()
{
int a[18] = {0},i,n,ii,s;
char c;
while (1)
{
i = 1;
while (1)
{
cin>>a[i];
if ((a[i] == 0)||(a[i] == -1))
break;
i++;
}
if (a[i] == -1)
break;
n = i;
i = 1;
s = 0;
while (i < n)
{
ii = 1;
while (ii < n)
{
if (a[ii] == 2 * a[i])
s++;
ii++;
}
i++;
}
cout<<s<<endl;
}
return 0;
} | 12 |
5,801 | int main()
{
int a[100];
int d,i,t,p=0;
while(true)
{
t=0;
for(i=0;i<100;i=i+1) a[i]=0;
while (true)
{
scanf("%d",&d);
if ((d==0)||(d==-1)) break;
a[d]=1;
}
if (d==-1) break;
else
{
if(p) printf("\n");
p=p+1;
for(i=1;i<50;i=i+1)
if ((a[i])&&(a[2*i])) t++;
printf("%d",t);
}
}
return 0;
} | 12 |
5,802 |
int main(int argc, char *argv[])
{
int i,j,k; int nowi; int output;
int part[20][16]; static int jcount[20], group[20];
for(i=0; i<20; i++)
{
for(j=0; j<16; j++)
{
cin >> part[i][j];
jcount[i]++;
if(part[i][j]<=0)
break;
}
if(part[i][j]== -1)
break;
}
nowi=i;
for(i=0; i<nowi; i++)
{
for(j=0;j<jcount[i]-1; j++)
{
for(k=0; k<jcount[i]-1; k++)
{
if( (part[i][j]/part[i][k] ==2) && (part[i][j]%part[i][k] ==0) )
group[i]++;
}
}
}
for(output=0; output< nowi; output++)
cout << group[output]<< endl;
return EXIT_SUCCESS;
} | 12 |
5,803 | int main()
{
int a[100][16];
int i,j,k,t,s;
int b[100]={0};
for(i=0;i<=99;i++)
{
for(j=0;j<=15;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0||a[i][j]==-1)
{
break;}
}
if(a[i][0]==-1) {b[i]=-1; break;}
}
for(k=0;k<=99;k++)
{
if(a[k][0]==-1)
{break;}
for(t=0;t<=15;t++)
{
if(a[k][t]==0||a[k][t]==-1) {break;}
for(s=0;s<=15;s++)
{
if(a[k][s]==0) {break;}
if(a[k][t]*2==a[k][s]) {b[k]++;}
}
}
}
for(int q=0;q<=99;q++)
{
if(b[q]==-1)
{break;}
printf("%d\n",b[q]);
}
return 0;
} | 12 |
5,804 | int main(){
int c,a[20],t,sum,i,j;
while(1){
t=sum=0;
while(1){
scanf("%d",&c);
if(!c || c==-1)break;
a[t++]=c;
}
if(c==-1)break;
for(i=0;i<t;i++)
for(j=0;j<t;j++)
if(a[j]==a[i]*2)sum++;
printf("%d\n",sum);
}
return 0;
} | 12 |
5,805 | /*
* ??.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 |
5,806 | 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 |
5,807 | int main(int argc, char* argv[])
{
int shu[number];
int n,i,j;
int k=0;
scanf("%d",&shu[0]);
for(n=0;shu[n]!=0;n++){
scanf("%d",&shu[n+1]);
}
for(i=0;i<=n;i++){
for(j=0;j<=n;j++){
if(shu[i]==2*shu[j]){
k++;
}
}
}
if(k!=0){
k=k-1;
printf("%d",k);
}
else printf("%d",k);
return 0;
} | 12 |
5,808 | int main()
{
int a[20],i,j,k,m;
while(1)
{ m=0;
scanf("%d",&a[0]);
if(a[0]==-1) break;
else
{for(i=1;;i++)
{scanf("%d",&a[i]);
if(a[i]==0) break;}
}
for(k=0;k<i;k++)
{for(j=0;j<i;j++)
{ if((a[k]==2*a[j])&&(a[k]))
m++;
}
}
printf("%d\n",m);
}
}
| 12 |
5,809 | //**************************
//*????? *
//*?????? 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 |
5,810 | int main(){
while(1){
int a[16];int i=0,n=0,k;
while(1){
scanf("%d ",&a[i]);
if(a[i]==0)break;
if(a[i]==-1)return 0;
i++;}
for(i=0;a[i]!=0;i++)
for(k=0;a[k]!=0;k++)
{
if(a[k]==2*a[i]) n++;
}
printf("%d\n",n);}}
| 12 |
5,811 | //********************************
//*?????? **
//*?????? 1000012939 **
//*???2012.11.02 **
//********************************
int main()
{
int a[16];
while (true)
{
cin >> a[0];
if (a[0] == -1)
break;
int n = 0, count = 0;
while (a[n] != 0)
cin >> a[++n];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
if (a[i] == 2 * a[j])
count++;
}
cout << count << endl;
}
return 0;
} | 12 |
5,812 |
int main()
{
int n;
int num[100];
int test,count=0;
cin >> n;
while(n != -1)
{
num[0] = n;
for (int i = 1; n != 0; i++)
{
cin >> n;
num[i] = n;
}
for (int j = 0; num[j] != 0; j++)
{
test = num[j];
for (int k = 0; num[k] != 0; k++)
{
if (num[k] == 2 * test)
{
count++;
}
}//end for k
}//end for j
cout << count << endl;
count=0;
cin >> n;
}
return 0;
}
| 12 |
5,813 |
int main()
{
int i,j,k,m,n,sum=0;
int a[20][20],b[20];
for(i=0;;i++)
{
for(j=0;;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==-1)
{
m=i;
break;
}
if(a[i][j]==0)
{
b[i]=j;
break;
}
}
if(a[i][j]==-1)
{
break;
}
}
for(i=0;i<m;i++)
{
sum=0;
for(j=0;j<b[i];j++)
{
for(k=0;k<=j;k++)
{
if(a[i][j]%a[i][k]==0&&a[i][j]/a[i][k]==2)
sum++;
else if(a[i][k]%a[i][j]==0&&a[i][k]/a[i][j]==2)
sum++;
}
}
printf("%d\n",sum);
}
return 0;
} | 12 |
5,814 | //************************************************************************************
//* 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 |
5,815 |
int main(int argc, char* argv[])
{
int i,j,k[16],a,p,b,c,q;
for(i=1;i<1000;i++)
{
p=0;q=0;
for(j=0;j<16;j++)
{
scanf("%d",&a);
if(a==-1) break;
else if(a!=-1)
{
if(a==0) break;
else
{
k[j]=a;
p++;
}
}
}
if(a==-1) break;
for(b=0;b<p;b++)
{
for(c=0;c<p;c++){
if(k[b]-2*k[c]==0)
q++;
}
}
printf("%d\n",q);
}
return 0;
}
| 12 |
5,816 | void main()
{
int c[15],i,m=0;
for(i=0;i<15;i++)
{
scanf("%d",&c[i]);
if(c[i]==0)
{
break;
}
}
int k,j,n=0;
for(k=0;c[k]!=0;k++)
{
for(j=0;c[j]!=0;j++)
{
if(c[k]==2*c[j])
{
n++;
}
}
}
printf("%d",n);
} | 12 |
5,817 |
void main()
{int a[20],n,r=0,i,j,count=0;
memset(a,0,sizeof(a));
for(;;)
{
scanf("%d",&n);
if(n==-1)
break;
else if(n!=0)
{
a[r]=n;r++;continue;
}
else if(n==0)
{
for(i=0;i<r-1;i++)
{
for(j=i+1;j<r;j++)
{if(a[i]==2*a[j]||a[j]==2*a[i])
count++;}
a[i]=0;
}
a[i]=0;
printf("%d\n",count);
count=0;
r=0;i=0;j=0;
continue;
}
}
}
| 12 |
5,818 | 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 |
5,819 |
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 |
5,820 | int main()
{
int t,i,j,k,count;
int group[15];
scanf("%d",&t);
do
{
i=0;
do
{
group[i]=t;
scanf("%d",&t);
i++;
}
while(t!=0);
printf("\n");
count=0;
for(j=i-1;j>=0;j--)
{
for(k=0;k<i;k++)
{
if((double)group[k]/2==group[j])//double
{
count++;
}
else if((double)group[j]/2==group[k])//!=int!!!!!!!
{
count++;
}
}
}
printf("%d\n",count/2);
scanf("%d",&t);
}
while(t!=-1);
return 0;
}
| 12 |
5,821 | main()
{
int a[16],j;
int k,m,y;
int i;
while(1==1)
{
m=0;
for(i=0;i<=15;i++)
{
scanf("%d",&a[i]);
if(a[i]==-1)
{
y=1;
break;
}
if(a[i]==0) break;
else m=m+1;
}
if(y==1) break;
else
{
k=0;
for(i=0;i<m-1;i++)
{
for(j=i+1;j<m;j++)
{
if(a[i]==2*a[j]||a[j]==2*a[i]) k++;
}
}
}
printf("%d\n",k);
}
}
| 12 |
5,822 | 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 |
5,823 | /*
* bla.cpp
*
* Created on: 2012-11-4
* Author: Administrator
*/
int main()
{
int m;
while(cin>>m)
{
if(m==-1) break;
int a[15],i=0,j,k,count=0;
a[0]=m;
while(cin>>m)
{
if(m==0) break;
i++;
a[i]=m;
}
k=i+1;
for(i=0;i<k;i++)
for(j=0;j<k;j++)
if(a[i]==2*a[j])
count++;
cout<<count<<endl;
}
return 0;
} | 12 |
5,824 |
int main(int argc, char* argv[])
{
int a[100],i,j,num=0,total=0;
while(1){
num=0;
while(1){
scanf("%d",&a[num]);
if(a[num]==0) break;
if(a[num]==-1) return 0;
num++;}
total=0;
for(i=0;i<num;i++){
for(j=0;j<num;j++){
if(a[j]==2*a[i]) total++;}}
printf("%d\n",total);}
return 0;
}
| 12 |
5,825 | int main()
{
int num[15][15]={0},doub[15]={0},i,j,k,w[15]={0},row;
for(i=0;i<15;i++)
{
for(j=0;j<20;j++)
{
scanf("%d",&num[i][j]);
if(num[i][j]==-1)
break;
if(num[i][j]==0)
{
w[i]=j;
break;
}
}
if(num[i][0]==-1)
{
row=i;
break;
}
}
for(i=0;i<row;i++)
{
for(j=0;j<w[i];j++)
{
for(k=0;k<w[i];k++)
{
if(num[i][k]==2*num[i][j])
{
doub[i]++;
}
}
}
printf("%d\n",doub[i]);
}
return 0;
} | 12 |
5,826 | 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 |
5,827 | 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 |
5,828 | //****************************************
//*????? **
//*?????? 1100012920 **
//*???2011.10.119 **
//****************************************
int main()
{
int i, k, j, count = 0, a[16];
while (a[0] != -1)
{
count = 0;
for (i = 0; i <= 15; i++)
{
cin >> a[i];
if (a[i] == 0 || a[0] == -1)
break;
}
if (a[0] == -1)
break;
for (k = 0; k <= 15; k++)
{
for (j = k + 1; j <= 16; j++)
{
if(a[j]==0)
break;
if (a[k] == 2 * a[j] || a[j] == 2 * a[k])
count++;
}
}
cout << count << endl;
}
return 0;
} | 12 |
5,829 | 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 |
5,830 | 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 |
5,831 | int main()
{
int a[17] = {0};
int i, j, k, l;
int num = 0;
for (l=1; ; l++)
{
for (i = 1; i <= 16; i++)
{
cin >> a[i];
if (a[i] == 0 || a[i] == -1)
{
break;
}
}
if (a[i] == -1)
break;
for (j = i -1; j >= 1; j--)
for ( k = j - 1; k >= 1; k--)
{
if (a[j] > a[k] && a[j] % a[k] == 0 && a[j] / a[k] == 2)
num++;
if (a[k] > a[j] && a[k] % a[j] == 0 && a[k] / a[j] == 2)
num++;
}
cout << num << endl;
int a[17] = {0};
num = 0;
}
return 0;
} | 12 |
5,832 | /*
?????2010?11?19
???????
??????????
????00948344 ??
*/
int main(){
int k=1;
while(k==1){
int a[16];
cin>>a[0];
int l=0;
if(a[0]==-1) //??????-1???????????
k=0;
else{
while(a[l]!=0) //???????0?????????
{
l++;
cin>>a[l];
}
int i,j,num=0; //num??????
for(i=0;i<l-1;i++)
for(j=i+1;j<l;j++)
if(a[i]-2*a[j]==0||a[j]-2*a[i]==0)
num++;
cout<<num<<endl;
}
}
return 0;
}
| 12 |
5,833 |
void main()
{
int a[15];
scanf("%d",&a[0]);
int i=1;
int k=0;
while(a[i-1]!=0)
{
scanf("%d",&a[i]);
k=k+1;
i++;
}
int j;
int n=0;
for (i=0;i<=k-1;i++)
{
for(j=0;j<=k-1;j++)
{
if(a[i]==2*a[j])
{
n=n+1;
}
}
}
printf("%d",n);
} | 12 |
5,834 | //********************************
//*????? **
//*?????? 1200012839 **
//*???2012.10.30 **
//********************************
int main()
{
int a[15], value;
while (cin >> value && value != -1)
{
a[0] = value;
int i = 0, count = 0;
while (a[i] != 0)
{
i++;
cin >> a[i];
}
for (int j = 0; j < i; j++)
{
for (int k = 0; k < i; k++)
{
if (a[j] == 2 * a[k])
{
count = count + 1;
}
}
}
cout << count << endl;
}
while (value == -1)
{
break;
}
return 0;
} | 12 |
5,835 | 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 |
5,836 | 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 |
5,837 |
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 |
5,838 | 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;
} | 12 |
5,839 | int main()
{
int x[16],i,j,k,a;
while(1){
i=j=k=a=0;
for(i=0;i<16;i++)x[i]=0;
for(i=0;scanf("%d",&x[i]);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++;
}
}
printf("%d\n",a);
}
return 0;
} | 12 |
5,840 | 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 |
5,841 | int main()
{
int i,j,h,k,m;
int a[20];
for(k=0;;k++)
{
for(i=0;i<16;i++)
{
scanf("%d",&a[i]);
if(a[0]==-1)
{
break;
}
m=0;
if(a[i]==0)
{
for(j=0;j<i-1;j++)
{
for(k=j+1;k<i;k++)
{
if(a[k]==a[j]*2||a[j]==a[k]*2)
{
m++;
}
}
}
printf("%d\n",m);
break;
}
}
if(a[0]==-1)
{
break;
}
}
return 0;
} | 12 |
5,842 | 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 |
5,843 | 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 |
5,844 | main()
{
int a[100][17],i,j,k,s,r;
for(j=0;j<100;j++)
{
r=0;
scanf("%d",&a[j][1]);
if(a[j][1]==-1) break;
else
{
for(i=2,s=1;a[j][i-1]!=0;i++,s++)
scanf("%d",&a[j][i]);
for(i=1;i<s;i++)
{
for(k=i+1;k<=s;k++) {if(a[j][k]==2*a[j][i]||a[j][i]==2*a[j][k]) r++;}
}
printf("%d\n",r);
}
}
return 0;
} | 12 |
5,845 | //******************************
//?????? *
//?????? *
//???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 |
5,846 | int main(int argc, char* argv[])
{
int a[16]={0};
int i,j,k;
int num=0;
for(i=0;;i++){
scanf("%d",&a[i]);
if(a[i]==0){
for(j=0;j<i-1;j++)
for(k=j+1;k<i;k++)
{
if(a[j]==2*a[k]||2*a[j]==a[k])
num++;
}
printf("%d\n",num);
num=0;
i=-1;
}
if(a[i]==-1)
break;
}
return 0;
}
| 12 |
5,847 | //******************************************
//*?????.cpp **
//*??: ?? 1100012808 **
//*???2011.10.21 **
//******************************************
int main() //???
{ //?????
int a[16] = {0}, i = 1, j = 1, m = 0, k = 0 ; //??????
while (cin >> a[0] ) //???????????
{
i = 1; j = 1; m = 0; k = 0 ; //???????
if (a[0] != -1) //????????????-1??????
{
do
{
cin >> a[i]; //????????a[0]??????
i++;
}while (a[i-1] != 0); //???????0??????
for (j = 0; j <= i - 2; j++) //??????????????
{
for (k = 0; k <= i - 2; k++)
{
if (a[j] == 2 * a[k]) //?????????
m++; //????????m?1
}
} //???for????
cout << m << endl;
} //???if????
else break; // ??????????-1?????
} //???while??
return 0;
} //?????
| 12 |
5,848 | /*?????
*??? 2010-11-13
*?????
*/
int main ()
{int i=0,j=0,t=0,m,n;
double a[1000][100]; //?????????
cin>>a[i][j]; //??????
while(a[i][j]!=-1){
while(a[i][j]!=0){
cin>>a[i][j+1];
j++;}j++;
for(m=0;m<j-1;m++){
for(n=m+1;n<j-1;n++){
if(a[i][m]/a[i][n]==2.0||a[i][m]/a[i][n]==0.5)t++;}}
i++;j=0;cin>>a[i][j];cout<<t<<endl;t=0; //??
}
return 0;
}
| 12 |
5,849 | 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 |
5,850 |
int main(){
float s[15],t[15];
int a=0;
for(int i=0;i<15;i++)
{
scanf("%f",&s[i]);
if(s[i]==0)
break;
else
{t[i]=s[i];
a=a+1;
}
}
int b=0;
for(int h=0;h<a;h++)
{for(int k=0;k<a;k++)
{if (t[h]/t[k]==2)
b=b+1;
}
}
printf("%d",b);
return 0;
} | 12 |
5,851 | void main()
{
int b;
scanf("%d",&b);
while(b!=-1)
{
int a[16]={0};
int i,j=0,k;
int sum=0;
a[j]=b;
while(a[j]!=0)
{
j++;
scanf("%d",&a[j]);
}
for(i=0;i<j-1;i++)
{
for(k=i+1;k<j;k++)
{
if(a[k]==a[i]*2||a[i]==a[k]*2)
{
sum++;
}
}
}
printf("%d\n",sum);
scanf("%d",&b);
}
}
| 12 |
5,852 | int main()
{
int a[20];
int flag;
cin >> flag;
while(flag != -1)
{
a[0] = flag;
int i = 0;
int count = 0;
while(a[i] != 0)
{
i ++;
cin >> a[i];
}
for(int j = 0; j < i; j ++)
{
for(int k = 0; k < i; k ++)
{
if(a[j] == 2 * a[k])
count ++;
}
}
cout << count << endl;
cin >> flag;
}
return 0;
} | 12 |
5,853 | int main()
{
int a[16]={0},b[16]={0},c[100]={0},i,n,j,k,l,num;
l=0;
for(j=0;j<100;j++){
n=0;
for(i=0;i<16;i++){
scanf("%d",&a[i]);
if(a[i]==-1){
break;
}
if(a[i]==0){
break;
}
n++;
}
num=0;
for(i=0;i<n;i++){
b[i]=a[i];
for(k=0;k<n;k++){
if(b[i]==2*a[k]){
num++;
}
}
}
c[j]=num;
l++;
if(a[0]==-1){
break;
}
}
for(j=0;j<l-1;j++){
printf("%d\n",c[j]);
}
return 0;
}
| 12 |
5,854 | void main()
{
int i,j,k=0,l,m,t,a[100][100],c[100];
for(i=1;;i++)
{
j=1;
scanf("%d",&a[i][j]);
if(a[i][j]==-1)break;
for(j=2;j<100;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0)break;
for(l=j;l>=1;l--)
{
if(a[i][j]==2*a[i][l]||2*a[i][j]==a[i][l])c[i]++;
else continue;
}
}
k++;
}
for(m=1;m<=k;m++)
{
printf("%d\n",c[m]);
}
} | 12 |
5,855 | //********************************
//*?????? **
//*?????? 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 |
5,856 | //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 |
5,857 | /*
* 1134 ??.cpp
*
* Created on: 2010-11-12
* Author: ???
*/
int main()
{
int a[16],i,j,k,l,n; //????
k=0;
while (k!=-1) //-1????
{
if (a[0]==-1)break; //-1????
i=0;l=1;
do //??????
{
i=i+1;
cin>>a[i];
l=i+1;
}while(a[i]!=0);
l=l-1;n=0;
for (i=0;i<l;i++) //???????
for (j=0;j<l;j++)
{
if (a[i]==2*a[j])
n=n+1;
}
cout<<n<<endl; //??
for (i=0;i<16;i++)
a[i]=0;
cin>>a[0];
k=a[0];
}
return 0;
} | 12 |
5,858 | int main()
{
int a[15],i;
while(1)
{
int n=1,sum=0,j;
cin >> a[0];
if (a[0] == -1)
break;
while(cin >> a[n])
{
if (a[n] == 0)
break;
n++;
}
for (i=0; i < n-1; i++)
{
for (j = i + 1; j < n; j++)
{
if (a[i] == a[j] * 2 || a[j] == a[i] * 2)
sum++;
}
}
cout << sum << endl;
}
return 0;
} | 12 |
5,859 | void main()
{
int a[15],b[20],i,l,j,n,p=0,num=0;
while(1)
{ num=0;
scanf("%d",&n);
if(n==-1)break;
else
{
a[0]=n;
for(l=1;;l++)
{
scanf("%d",&a[l]);
if(a[l]==0)break;
}
for(i=0;a[i]!=0;i++)
for(j=0;a[j]!=0;j++)
{
if(a[i]==a[j]*2)num++;
}
b[p]=num;
p++;
}
}
for(i=0;i<p;i++)printf("%d\n",b[i]);
} | 12 |
5,860 |
int main()
{
int a[16],i,j,s,n;
for (; ;)
{
for (i=0;i<=15;i++) a[i]=0;
for (i=0;i<=15;i++)
{
scanf("%d",&a[i]);
if (a[i]==0) break;
if (a[i]==-1) return 0;
}
n=i;
s=0;
for (i=0;i<n;i++)
{
for (j=0;j<n;j++)
if (a[j]==2*a[i]) s=s+1;
}
printf("%d\n",s);
}
return 0;
}
| 12 |
5,861 | int main()
{
int e=0,i,j,k=-1;
int a[10000];
int ans;
while(1)
{
i=1;
cin>>a[0];
while (a[i-1]!=0)
{
cin>>a[i];i++;
}
e=i-1;
if (a[0]==-1) return 0;
ans=0;
for(i=0;i<e;i++)
for(j=0;j<e;j++)
{
if (i!=j)
if((a[i]%a[j]==0)&&(a[i]/a[j]==2)) ans++;
}
cout<<ans<<endl;
}
return 0;
} | 12 |
5,862 | /*******************************************
*??????.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 |
5,863 |
int main()
{
int x[20],r,ctr,t,i,j;
while(cin.peek()!='-')
{
r=ctr=0;
while(cin>>t,t)
x[++r]=t;
cin.get();
for(i=1;i<=r;i++)
{
for(j=1;j<=r;j++)
{
if(x[i]==(x[j]<<1))
ctr++;
}
}
cout<<ctr<<endl;
}
return 0;
} | 12 |
5,864 | void main()
{
int w;
for(w=1;;w++)
{
int a[16],b=0;
int i,j,q;
for(i=1;;i++)
{
scanf("%d",&a[i]);
if(a[1]==-1) break;
if(a[i]==0) break;
b++;
}
if(a[1]==-1) break;
int m=0;
for(j=1;j<b;j++)
{
for(q=j+1;q<=b;q++)
{
if(a[j]==2*a[q]) m++;
else if(a[q]==2*a[j]) m++;
}
}
printf("%d\n",m);
}
} | 12 |
5,865 | int main()
{
int A[16],pause,i,k,m,count;
for(;;){
count=0;
for (i=0;i<16;i++){
scanf("%d",&A[i]);
if(A[i] == 0 ||A[i] == -1){
break;
}
}
if(A[i] == -1){
break;
}
for(i=0;i<16;i++){
if(A[i] == 0){
pause=i;
break;
}
}
for(k=1;k<pause;k++){
for(i=0;i<pause-k;i++){
if (A[i] <= A[i+1])/*????*/
{
m=A[i];
A[i]=A[i+1];
A[i+1]=m;
}
}
}
for(k=0;k<pause;k++){
for(i=k+1;i<pause;i++){
if ( A[k] == 2*A[i])/*??2?*/{
count++;
}
}
}
printf("%d\n",count);
}
return 0;
} | 12 |
5,866 | int main(void)
{
int a[MAX], n[100];
int i, t, j, k, tr, sum[20], l=0;
while (scanf("%d", &t), t!=-1)
{ sum[l]=0;
i=0;
a[0]=t;
while(i++,scanf("%d", &a[i]), a[i]);
for(j=0; j<=i-1; j++)
{
for(k=0; k<=i-j-1; k++)
{
if(a[k]>a[k+1])
{
tr = a[k];
a[k]= a[k+1];
a[k+1]= tr;
}
}
}for(j=0; j<=i-1; j++)
{
for(k=j+1; k<=i; k++)
{
if ((2*a[j])==a[k])
sum[l]++;
}}l++;
}
for(i=0;i<l;i++)
printf("%d\n", sum[i]);
return 0;
}
| 12 |
5,867 | 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 |
5,868 | int main()
{int n,m,k;
static int a[16];
while(scanf("%d",&a[0])&&a[0]!=-1)
{for(k=1;k<=15;k++)
{scanf(" %d",&a[k]);
if(a[k]==0)
break;}
n=0;
for(k=0;a[k]!=0;k++)
for(m=0;a[m]!=0;m++)
if(a[m]==2*a[k])
{n++;break;}
printf("%d\n",n);}
return 0;
}
| 12 |
5,869 |
int number(int a[],int m)
{
int i,j,s=0;
for(i=1;i<=m;i++)
for(j=1;j<=m;j++)
if(a[i]==2*a[j])
s++;
return(s);
}
main()
{
int a[17],b[100];
int i,j=1;
scanf("%d",&a[1]);
while(a[1]!=-1){
for(i=2;i<=16;i++){
scanf("%d",&a[i]);
if(a[i]==0) break;
}
i--;
b[j]=number(a,i);
printf("%d\n",b[j]);
scanf("%d",&a[1]);
j++;
}
} | 12 |
5,870 |
int main()
{
int output = 0, i, j, length;
float data[16];
data[0] = -2;
while(data[0] != -1)
{
for(i = 0; i <= 15; i++)
{
scanf("%f", &data[i]);
if(data[i] == 0)
{
length = i;
break;
}
if(data[i] == -1)
break;
}
if(data[i] == -1)
break;
for(i = 0; i <= length - 1; i++)
for(j = 0; j <= length - 1; j++)
{
if((data[j] / data[i]) == 2)
output = output + 1;
}
printf("%d\n", output);
output = 0;
}
return 0;
}
| 12 |
5,871 | main()
{
int c[16],n,i,j,m,num;
n=0;
m=1;
do
{
i=0;
n=0;
do
{
scanf("%d",&c[i]);
i++;
}while(c[i-1]!=0&&c[0]!=-1&&i<16);
num=i-1;
if(c[0]!=-1)
{
for(i=0;i<num;i++)
{
for(j=i+1;j<num+1;j++)
{
if(c[i]>0&&c[j]>0)
if(c[i]==c[j]*2||c[j]==c[i]*2) n++;
}
}
printf("%d\n",n);
}
else m=0;
}while(m==1);
return(0);
}
| 12 |
5,872 |
int main()
{
int N, I, J, Count, Arr[15];
while (1)
{
N = 0;
while (1)
{
cin >> Arr[N];
if (Arr[N] == -1) return 0;
if (Arr[N] == 0) break;
N ++;
}
Count = 0;
for (I = 0; I < N - 1 ; I ++)
for (J = I + 1; J < N; J ++)
if (Arr[I] == 2 * Arr[J] || Arr[J] == 2 * Arr[I])
Count ++;
cout << Count << endl;
}
return 0;
} | 12 |
5,873 |
int main()
{
int i,j,a[16],b[100],changdu=0,panduan=1,geshu=0;
while(1){
for(i=0;i<16;i++){
scanf("%d",&a[i]);
changdu=i;
if(a[i]==-1){
panduan=0;
break;
}
if(a[i]==0){
break;
}
}
if(panduan==0)
break;
geshu=0;
for(i=0;i<changdu;i++){
for(j=0;j<changdu;j++){
if(a[i]==a[j]*2){
geshu++;
}
}
}
printf("%d\n",geshu);
}
return 0;
}
| 12 |
5,874 | int main()
{
int a[16],i,j,k;
while(1)
{
int s=0;
for(i=0;;i++)
{
cin>>a[i];
if(a[i]==0)break;
if(a[i]==-1)goto end;
}
for(j=0;j<=i-1;j++)
for(k=0;k<=i-1;k++)
if(a[j]%a[k]==0&&a[j]/a[k]==2) s++;
cout<<s<<endl;
}
end:
return 0;
}
| 12 |
5,875 | /*
* 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 |
5,876 | int main()
{
int a[20]; //????
int i, cnt;
i = 0; //???
cnt = 0;
cin >> a[i]; //????????
while ( a[i] != -1 ) //?????????-1.??????
{
while ( a[i] != 0 ) //?????????0??????????0??
{
i++;
cin >> a[i];
} //?????????i+1??
for ( int j = 0; j <= i; j++ ) //??????????????????cnt?1
{
for ( int k = 0; k <= i; k++ )
{
if ( a[k] == 2 * a[j] )
cnt++;
}
}
cout << cnt - 1 << endl; //????????????0?????????0=2*0????
i = 0;
cnt = 0;
cin >> a[i]; //????????
}
return 0;
}
| 12 |
5,877 | int main()
{
int n=0,m[20],i=0,j=0,t=0;//n is the num of int
char c;
scanf("%d%c",&m[0],&c);
while(m[0]>0)
{
n=1;
t=0;
while(c!='\n')
scanf("%d%c",&m[n++],&c);
n--;
for(i=0;i<n;i++){
for(j=n;j>i;j--)
if((m[j]==2*m[i])||(m[i]==2*m[j])) t++;
}
printf("%d\n",t);
scanf("%d%c",&m[0],&c);
}
return 0;
} | 12 |
5,878 |
/**
* @desc ??????: ??2?1000???????
* @author ??? 1100012829
* @date 2011-10-12
*/
int main()
{
int a[16]={0},n,i=1;
for(;a[i]!=-1;)//a[i]???????
{
n=0;
for(i=0;;i++)//???
{
cin>>a[i];
for(int j=0;j<i;j++)
{
if(a[j]*2==a[i]||a[j]==a[i]*2){n++;}
}
if(a[i]==0||a[i]==-1){break;}//?????? -1?????????
}
if(a[i]!=-1){cout<<n<<endl;}
}
}
| 12 |
5,879 | int main()
{
int a[16],b=0,c=0,d=1,e=0;
scanf("%d",&a[b]);
while(a[b]!=-1)
{
while(a[b]!=0)
{
b++;
scanf("%d ",&a[b]);
}
while(c<=b)
{
while(d<b)
{
if(a[c]==(a[d]*2))
e=e+1;
d=d+1;
}
c=c+1;
d=0;
}
printf("%d\n",e);
b=0;
scanf("\n%d",&a[b]);
e=0;
c=0;
}
return 0;
} | 12 |
5,880 |
int main(int argc, char* argv[])
{
int s[100][15],t[15];
int sum[100];
int i,j,n,m,k;
for(i=0;;i++){
for(j=0;;j++){
scanf("%d",&s[i][j]);
if(s[i][j]==0){
t[i]=j;
break;
}
else if(s[i][0]==-1) break;
}
if(s[i][0]==-1) break;
}
for(n=0;n<i;n++){
sum[n]=0;
for(m=0;m<t[n]-1;m++){
for(k=m+1;k<t[n];k++){
if(s[n][m]==2*s[n][k]||s[n][k]==2*s[n][m]){
sum[n]++;
}
}
}
}
for(n=0;n<i;n++){
printf("%d\n",sum[n]);
}
return 0;
}
| 12 |
5,881 |
int array[16]={0},n=0,sum=0;
int main()
{
int i,j;
while(1)
{
n=0;
sum=0;
while(1)
{
cin>>array[n];
if(array[n]==0 || array[n]==-1)
{
n--;
break;
}
n++;
}
if(array[0]==-1)
break;
for(i=0;i<=n;++i)
{
for(j=i;j<=n;++j)
{
if((array[i]==array[j]*2) || (array[j]==array[i]*2))
{
sum++;
}
}
}
cout<<sum<<endl;
}
return 0;
}
| 12 |
5,882 | 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 |
5,883 | int main()
{
int i,j,k,count=0,row,arr[100][100],n[100],b[100];
for(i=0;i<100;i++){
count=0;
for(j=0;j<100;j++){
scanf("%d",&arr[i][j]);
if(arr[i][j]==0||arr[i][j]==-1){
n[i]=count;
break;
}
count++;
}
if(arr[i][j]==-1){
row=i; //last row=-1, n[i]=0
break;
}
}
for(i=0;i<row;i++){
count=0;
for(j=0;j<n[i];j++){
for(k=j+1;k<n[i];k++){
if(arr[i][j]==(arr[i][k]*2)||(arr[i][j]*2)==arr[i][k]){
count++;
}
}
}
b[i]=count;
}
for(i=0;i<row;i++){
printf("\n%d",b[i]);
}
return 0;
} | 12 |
5,884 | // ??-??.cpp : ??????????????
//2012.10.29
int main()
{
int m,n,a[15],x=0,i,y=0;
while(y!=1)
{
for (m=0;;m++)
{
cin >> n;
if (n!=0 && n!=-1)
{
a[m]=n;
continue;
}
if (n==0)
{
break;
}
if (n==-1)
{
y=1;
break;
}
}
if (y==1)
{
break;
}
for (m=0;m<=15;m++)
{
for (i=0;i<=15;i++)
{
if (a[m]*2==a[i] && a[m]!=0)
{
x=x+1;
}
}
}
for (m=0;m<=15;m++)
{
a[m]=0;
}
cout << x << endl;
x=0;
}
return 0;
}
| 12 |
5,885 | 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 |
5,886 | //****************************************
//*????? **
//*?????? 1100012763 **
//*???2011.10.20 **
//****************************************
int main()
{
int i , j , t , count , ans; //count??????????ans???
int num[17];
while (1) //?????????-1?break
{
i = 1;
cin >> num[i];
if (num[i] == -1)
break;
ans = 0;
do //???????????0
{
i++;
cin >> num[i];
} while (num[i] != 0);
count = i - 1; //0??????
for (i = 1; i <= count - 1; i++) //????????????????
for (j = 1; j <= count - i; j++)
{
if (num[j] > num[j + 1])
{
t = num[j];
num[j] = num[j + 1];
num[j + 1] = t;
}
}
for (i = 1; i <= count -1; i++) //??
for (j = i + 1; j <= count; j++)
{
if (num[i] * 2 == num[j]) //??2??ans+1???????
{
ans++;
break;
}
else
{
if (num[i] * 2 < num[j]) //????2???????????2????????????
break;
}
}
cout << ans << endl; //?????
}
return 0;
}
| 12 |
5,887 | 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 |
5,888 | int main()
{
int a[16],i,j,num,h;
while(cin>>a[0])
{
while(a[0]!=-1)
{
for (i=1;i<16;i++)
{
cin>>a[i];
if(a[i]==0) break;
h=i;//h??????0??????
}
num=0;
for(i=0;i<=h;i++)
for(j=0;j<=h;j++)
if(a[i]==2*a[j])
num++;
cout << num << endl; break;
}
continue;
}
return 0;
}
| 12 |
5,889 | /**
*@file 1000012767_2.cpp
*@author ??
*@date 2010.11.3
*@description
* ???????1134??
*/
int main()
{
int a[17]; //a ?????????????? 0 ?? 16 ???????????? 17
int i, j, n, count; //i ???????????????j ?????????n ????????count ????
while(cin >> a[1] && a[1] != -1) //???????????????? -1 ?????
{
count = 0; //??????? 0
for (n = 2; n <= 16; n++) //?????????????????????????????
{
cin >> a[n];
if (a[n] == 0) //?????????????
break; //???
}
for (i = 1; i <= n - 1; i++) //??? n - 1 ?????????????
{
if (a[i] % 2 == 0) //????????????????????
for (j = 1; j <= n - 1; j++)
if (a[j] * 2 == a[i]) //?????????????? 2 ???
count++; //???????????????? 1
}
cout << count << endl; //????????
}
return 0;
} | 12 |
5,890 | /* ???????
???????
?????2010?11?5?
???????????????????????????????????
*/
int main()
{
int num[15]={0} , i , j , a , b=0 , m ;
do
{ for (m = 0 ; ; m ++)
{
cin >> a ;
num[m] = a ;
if (a == 0) break ;
if (a == -1) break ;
}
for (i = 0 ; i <= m ; i ++)
for (j = 0 ; j <= m ; j ++)
if((num[i] != 0 && num [j] != 0 && num[i] * 2 == num[j]) || (num[i] != 0 && num [j] != 0 && num[j] * 2 == num[i])) b++;
if (a != -1) { cout << b/2 << endl ; b=0 ; }
} while(a != -1);
return 0 ;
}
| 12 |
5,891 | int cmp(const void *a,const void *b)
{
return *(int *)a-*(int *)b;
}
int chuli(int * p,int i)
{
int count=0;
for(int q=0;q<i;q++)
{
if(2*(p[q])>p[i-1])return count;
for(int j=q;j<i;j++)
{
if(p[j]==2*(p[q])){count++; break;}
if(p[j]>2*(p[q])){break;}
}
}
return count;
}
int main()
{
//freopen("in.txt","r",stdin);
int a[20];
int num;
while(cin>>a[0]&&(a[0]!=-1))
{
int i=1;
while(cin>>a[i]&&a[i])
{
i++;
}
qsort(a,i,sizeof(int),cmp);
num=chuli(a,i);
cout<<num<<endl;
}
return 0;
} | 12 |
5,892 | //********************************
//* ?????? **
//* ?????? 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 |
5,893 | //*******************************************
//?????? cpp1
//??? ???
//???1300012712
//*******************************************
int main ()
{
int n, i, j, k, ds, s; // ??ds???????????????
int a[16];
while (cin)
{
ds = 0;
cin >> a[0];
if (a[0] == -1) return 0; // ???????-1?????
s = 1; // ?????????????
while (cin)
{
cin >> a[s];
if (a[s] == 0) break ; // ???????????????
else s = s + 1; // ????????
}
for (i = 0; i <= s; i++) // ?????????
{
for (j = i + 1; j <= s; j++) // ?????i ??i????
{
if ((a[i] == a[j] * 2) || (a[j] == a[i] * 2)) // ???????????????
ds = ds + 1; // ???????????????
}
}
cout << ds << endl;
}
return 0;
}
| 12 |
5,894 | int main()
{
int a[16]={0};
int i,k,s,t,p;
for(k=1;;k++)
{
p=0;
scanf("%d",&a[0]);
if(a[0]==-1)
break;
else
{
for(i=1;i<17;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
break;
}
for(s=0;s<i;s++)
{
for(t=0;t<i;t++)
{
if(a[t]==2*a[s])
{
p=p+1;
break;
}
}
}
printf("%d\n",p);
}
}
return 0;
} | 12 |
5,895 | 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 |
5,896 | int main ( )
{
int num[16],i,j,count,a,n;
while(1)
{
count=0;n=0;
for(i=0;;i++)
{
scanf("%d",&num[i]);
if(num[i]==-1)
break;
if(num[i]==0)
break;
n+=1;
}
if(num[0]==-1)
break;
else
{
for(i=0;i<n;i++)
{
a=num[i];
for(j=0;j<n;j++)
if(num[j]==2*a)
count+=1;
}
}
printf("%d\n",count);
}
return 0;
} | 12 |
5,897 | 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 |
5,898 | //???1134 ??
//??????
//???2010.11.7
int a[100][20] = {0}; //????????a[100][20]???????
int i = 1; //??????i???????????
int b[100] = {0}; //????????b[100]???????????
void sort(); //????sort()?????
void compare(); //????compare()???????????
int main()
{
int p = 0;
int j = 0;
do
{
j = 1;
do
{
cin >> a[i][j];
j ++;
}while ((a[i][j-1] != 0) && (a[i][j-1] != -1));
i ++;
}while (a[i-1][j-1] != -1); //??i???????a[i]?
sort(); //????
compare();
for (p = 1; p <= i - 2; p ++)
{
cout << b[p] << endl; //????
}
return 0;
}
void sort()
{
int x = 0;
int y = 0;
int p = 0;
int t = 0;
for (p = 1; p <= i - 2; p ++) //???????a[i]??
for (x = 1; x <= 14; x ++)
for (y = 1; y <= 15 - x; y ++)
{
if (a[p][y] > a[p][y + 1])
{
t = a[p][y];
a[p][y] = a[p][y + 1];
a[p][y + 1] = t;
}
}
}
void compare()
{
int x = 0;
int y = 0;
int p = 0;
for (p = 1; p <= i - 2; p ++) //??????????????
for (x = 1; x <= 15; x ++)
for (y = x; y <= 15; y ++)
{
if ((a[p][y] == 2 * a[p][x]) && (a[p][x] != 0))
b[p] ++;
}
} | 12 |
5,899 | //********************************
//*??? ?? **
//*?????? 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.