label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
12 | 5900 | void main()
{
int i,l,k,g[1000][16],o;
for(i=0;i<=999;i++)
{
int s=0;
for(l=0;l<16;l++)
{
scanf("%d",&g[i][l]);
if(g[i][l]==0)break;
}
if(g[i][0]==-1)break;
for(o=0;o<14&&g[i][o]>0;o++)
{
for(k=o+1;k<15;k++)
{
if(g[i][k]-2*g[i][o]==0||g[i][o]-2*g[i][k]==0)
s=s+1;
}
}
printf("%d\n",s);
}
} |
12 | 5901 | 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 | 5902 |
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 | 5903 |
int number(int a[],int m)
{
int i,j,s=0;
for(i=1;i<=m;i++)
for(j=1;j<=m;j++)
if(a[i]==2*a[j])
s++;
return(s);
}
main()
{
int a[17],b[100];
int i,j=1;
scanf("%d",&a[1]);
while(a[1]!=-1){
for(i=2;i<=16;i++){
scanf("%d",&a[i]);
if(a[i]==0) break;
}
i--;
b[j]=number(a,i);
scanf("%d",&a[1]);
j++;
}
for(i=1;i<=j-1;i++)
printf("%d\n",b[i]);
} |
12 | 5904 | 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 | 5905 | 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 | 5906 | 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 | 5907 | int main()
{
int b,d=0,s[15],i,j;
while(1)
{
scanf("%d",&s[0]);
if(s[0]==-1) break;
for(i=1;s[i-1]!=0;i++)
scanf("%d",&s[i]);
for(i=0;s[i]!=0;i++)
for(j=0;s[j]!=0;j++)
{if((s[i]==s[j]*2)&&(s[i]!=0)&&(s[j]!=0))
d++;
}
printf("%d\n",d);
d=0;
}
return 0;
}
|
12 | 5908 | void main()
{
int a[16],i,j,k,counter;
for(;;){
scanf("%d",&a[0]);
if(a[0]==-1)
break;
else{
counter=0;
for(i=1;;i++){
scanf("%d",&a[i]);
if(a[i]==0)
break;
}
for(j=0;j<i;j++){
for(k=0;k<i;k++){
if(a[j]%a[k]==0&&a[j]/a[k]==2)
counter=counter+1;
}
}
printf("%d\n",counter);
}
}
} |
12 | 5909 | /*
* liangbei.cpp
*
* Created on: 2010-11-12
* Author: ??
*/
int main()
{
int a[20];
int i;
int n=0;
int num=0;
int j;
while(1)
{
n=0;//??
num=0;
for(i=0;i<20;i++)//??????
{
cin>>a[i];
if(a[i]==0)//????0???????
break;
if(a[i]==-1)//????-1???????
return 0;
n++;//?????????
}
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if(a[i]==2*a[j]||2*a[i]==a[j])//???????????????
num++;//???????
cout<<num<<endl;
}
return 0;
}
|
12 | 5910 |
int main()
{
int num[16]={0},i=0,j=0,sum=0;
while(1)
{
scanf("%d",&num[0]);
if(num[0]==-1) break;
for(i=1;num[i-1]!=0;i++)
{
scanf("%d",&num[i]);
}
for(i=0;num[i]!=0;i++)
{
for(j=0;num[j]!=0;j++)
{
if((num[i]==2*num[j])&&(num[i]!=0)&&(num[j]!=0))
sum++;
}
}
cout<<sum<<endl;
sum=0;
}
return 0;
} |
12 | 5911 | 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 | 5912 | main()
{
int a[16],i,j,k,n,x,y;
for(;;)
{
j=0,n=0;
scanf("%d",&a[0]);
if(a[0]==-1)
break;
for(i=1;i<16;i++)
{
scanf("%d",&a[i]);
j++;
if(a[i]==0)
break;
}
for(i=0;i<j;i++)
{
for(k=i+1;k<j;k++)
{
x=a[i]%a[k];
y=a[i]/a[k];
if((x==0)&&(y==2))
n++;
}
}
for(i=j-1;i>=0;i--)
{
for(k=i-1;k>=0;k--)
{
x=a[i]%a[k];
y=a[i]/a[k];
if((x==0)&&(y==2))
n++;
}
}
printf("%d\n",n);
}
return 0;
} |
12 | 5913 | int main()
{
int i=0,j=0,k=0,x=0,y=1,a=0;
float n[20];
do{
i=0;
j=0;
k=0;
x=0;
y=1;
do{
scanf("%d",&n[j]);
if(n[j]==0||n[j]==-1)break;
j++;
}while(j<20);
if(n[j]==-1)return 0;
do{
do{
if(n[x]==n[y]*2||n[x]==n[y]/2)i++;
y++;
}while(y<j);
x++;
y=x+1;
}while(x<j);
printf("%d\n",i);
}while(a<1);
return 0;
} |
12 | 5914 | //* ??
//* ??? 1100012820
//* 20111019
//*******************
int main()
{
int a[16] = {0}, i = 0, n = 0, j, flag = 1;
while(flag)
{
while(1)
{
cin >> a[i];
if (a[i] == (-1))
{
flag = 0;
break;
}
else if (a[i] == 0)
{
for (j = 0; j <= i; j++)
a[j] = 0;
cout << n << endl;
n = 0;
i = 0;
break;
}
else
{
for (j = 0; j < i; j++)
{
if ((a[j] == 2 * a[i]) || (a[i] == 2 * a[j]))
n++;
}
}
i++;
}
}
return 0;
}
|
12 | 5915 | int main()
{
int a[ 17 ] , n , m , i = 1 , t = 0 ;
cin >> a[ 1 ] ;
while( a[ i ] != -1 )
{
while( a[ i ] > 0 )
{
i = i + 1 ;
cin >> a [ i ] ;
}
for( m = 1 ; m < i ; m ++ )
for( n = m + 1 ; n <= i ; n ++ )
if( a[ m ] == 2 * a[ n ] || a[ n ] == 2 * a[ m ] )
t = t + 1 ;
cout << t << endl ;
for( i = 0 ; i < 17 ; i ++ )
a[ i ] = 0 ;
t = 0 ;
i = 1 ;
cin >> a[ 1 ] ;
}
return 0 ;
} |
12 | 5916 | void main()
{
int a[200],k,i,n=0,j=0;
for(i=0;i<200;i++)
{
scanf("%d",&a[i]);
if(a[i]!=-1&&a[i]!=0)
n=n+1;
if(a[i]==-1)
break;
if(a[i]==0)
{
for(k=0;k<n;k++)
{
for(i=0;i<n;i++)
{
if(a[k]==2*a[i])
j=j+1;
}
}
printf("%d\n",j);
j=0;
i=-1;
n=0;
}
}
} |
12 | 5917 | //**************************************
//*?????? *
//*??????????? *
//*?????? *
//*?????11.5 *
//**************************************
int main()
{
int a[16];
for (int i = 0;;)
{
cin >> a[i];
if (a[i] != 0 && a[i] != -1)
{
i ++;
continue;
}
else if (!a[i])
{
int n = 0;
for (int j = 0;j <i - 1; j ++)
{
for (int k = j + 1; k < i; k ++)
{
if (((a[j] / a[k] == 2) && !(a[j] % a[k])) || ((a[k] / a[j] == 2) && !(a[k] % a [j])))
n ++;
}
}
cout << n << endl;
i = 0;
continue;
}
else
break;
}
return 0;
}
|
12 | 5918 |
int main()
{
int a[15] ;
int i, NO, tmp , n ,j ;
while(1)
{
n=0;
scanf("%d",&tmp);
a[0]=tmp;
if(tmp == -1) break;
NO = 0;
//for(i = 0; i < 101; i++) a[i] = 0; //a[i] ??i???? ? 0?????1???? ??????????
// a[tm] = 1;
while(1)
{
scanf("%d",&tmp);
if(tmp==0)break;
a[++n] = tmp; // ???tmp??tmp??????1
}
for(i = 0; i < n ; i++)
for( j=i+1 ; j<=n ; j++ )
if( a[j]==2*a[i]||a[i]==2*a[j] ) NO++;
printf("%d\n",NO);
}
getchar();
getchar();
}
|
12 | 5919 | int main()
{
int a[100000],i,j,k,h,g,n,sign;
for(i = 1; ; i++)
{
cin >> a[i];
if(a[i] == -1)
break;
}
for(j = 1; j <= i - 1; j++)
{
if(a[j] == 0)
{
for(k = j - 1; k >= 1; k--)
{
if(a[k] == 0)
{
break;
}
}
sign = 0;
for(h = k + 1; h < j; h++)
{
for(g = k + 1; g < j; g++)
{
if(a[h] == 2 * a[g])
sign++;
}
}
cout << sign << endl;
}
}
return 0;
} |
12 | 5920 | int main()
{
int a[16],i,k,j,sum=0,m;
for(k=1; ;k++)
{
sum=0;
scanf("%d",&a[0]);
if(a[0]==-1) break;
if(a[0]!=-1)
{
for(i=1; ;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{
m=i;
break;
}
}
}
for(i=0;i<m-1;i++)
{
for(j=i+1;j<m;j++)
{
if(a[i]==2*a[j]||a[j]==2*a[i])
sum=sum+1;
}
}
printf("%d\n",sum);
}
return 0;
} |
12 | 5921 | /* ???????
???????
?????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 | 5922 | int main()
{
int i,j,n=0,a[16],shu,sum=0;
while (1)
{
scanf("%d",&shu);
if (shu==-1)
return 0;
else if (shu==0)
{
for (i=1;i<=n;i++)
{
if (a[i]&&a[i]%2==0)
{
for (j=1;j<=n;j++)
if (a[j]==a[i]/2)
sum++;
}
}
printf("%d\n",sum);
sum=0;
n=0;
}
else
{
n++;
a[n]=shu;
}
}
return 0;
} |
12 | 5923 | /*
* 1134 ??.cpp
*
* Created on: 2010-11-16
* Author: Administrator
*/
int main(){
int a[16];
for(int i=0;;i++){
cin>>a[i];
switch(a[i]){
case -1:return 0;//??0?????
case 0:{int s=0;
for(int j=0;j<i;j++)
for(int k=j;k<i;k++)
if(a[j]==2*a[k]||a[k]==2*a[j])
s++;//????
i=-1;
cout<<s<<endl;//????
}
}
}
}
|
12 | 5924 | int main()
{
int a[16]={-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2},sum=0,i,j,s,t;
A: for(i=0;a[i]!=-1;i++)
{
sum=0;
a[0]=-2;a[1]=-2;a[2]=-2;a[3]=-2;a[4]=-2;a[5]=-2;a[6]=-2;a[15]=-2;a[7]=-2;a[8]=-2;a[9]=-2;a[10]=-2;a[11]=-2;a[12]=-2;a[13]=-2;a[14]=-2;
for(s=0;s<=15;s++)
{
scanf("%d",&a[s]);
if(a[s]==0)
{
for(t=0;t<=15;t++)
{
for(j=0;j<=15;j++)
{
if(a[j]!=0&&a[t]!=0&&a[t]==a[j]*2)
sum++;
}
}
printf("%d\n",sum);
break;
}
else if(a[s]==-1)
goto A;
}
}
return 0;
} |
12 | 5925 | //********************************
//*????? **
//*?????? 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 | 5926 | int main(int argc, char* argv[])
{
int i,k;
while(1){
int sz[16];
int add=0;
for(i=0;i<16;i++){
scanf("%d",&sz[i]);
if(sz[i]==0||sz[i]==-1){
break;
}
}
if(sz[0]==-1){
break;
}for(i;i<16;i++){
sz[i]=0;
}
for(i=0;i<16;i++){
for(k=0;k<16;k++){
if(sz[k]!=0&&sz[k]==2*sz[i]){
add=add+1;
}
}
}
printf("%d\n",add);
}
return 0;
} |
12 | 5927 | /*
* 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 | 5928 | 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 | 5929 | int main()
{
int a[16],i,j,m,n,t;
while(a[0]!=-1){
t=0;n=0;
for(i=0;;i++){
scanf("%d",&a[i]);
if(a[i]<=0){
break;
}
else{
t++;
}
}
if(a[0]==-1){
break;
}
else{
for(j=0;j<t;j++){
for(m=0;m<t;m++){
if(a[j]==2*a[m]){
n++;
}
}
}
printf("%d\n",n);
}
}
return 0;
}
|
12 | 5930 |
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=0;j<count;j++){
if(s[i]==s[j]*2)
num++;
}
}
printf("%d\n",num);
}
return 0;
}
|
12 | 5931 | int main()
{
int num[100]={0},index=0,sum=0;
char c;
for(;num[0]!=-1;)
{while(true)
{
scanf("%d",&num[index++]);
scanf("%c",&c);
if(c=='\n')
break;
}
for(int i=0;i<index;i++)
{
for(int j=0;j<index;j++)
{
if(num[i]==(2*num[j])||(2*num[i])==num[j])
{
sum++;
}
}
}
if(num[0]==-1)
{return 0;}
else
printf("%d\n",(sum-1)/2);
sum=0;index=0;
}
return 0;
} |
12 | 5932 |
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 | 5933 | /**
*@file 1.cpp
*@author ???
*@date 2013-10-30
*@description ??
*/
int main()
{
int a[30], i, j, count1, count2 ;
while(scanf("%d",&a[0]),a[0]!=-1)
{
count2=0;
i=0;
while(a[i]){scanf("%d",&a[++i]);}
count1=i-1;
for(i=0; i<=count1; i++)
{
for(j=i+1; j<=count1; j++)
if(a[i]==2*a[j]||a[j]==2*a[i])
count2++;
}
cout << count2 << endl ;
}
return 0;
}
|
12 | 5934 | /*
* qizhongceshi9.cpp
* ???????????????????????????????
* Created on: 2010-11-13
* Author: william
*/
int main() //???
{
int a[16], k, i, j; //??????k i j ???a[]
for(k=0;;k++) //for??
{
int n=-1, num=0; //?????? n num ????
for(i=0;i<16;i++) //for?? ???a??
{
cin>>a[i];
n++; //????? n?1
if(a[i]==0) //??????????0
break; //?????
}
if(a[0]==-1) //??????????-1 ?????
break;
for(i=0;i<n;i++) //for??
for(j=i+1;j<n;j++) //for??
{
if(a[i]==2*a[j]||a[j]==2*a[i]) //???????? ??2???
num++; //num??
}
cout<<num<<endl; //??num
}
return 0; //??
} //?? |
12 | 5935 | int main()
{
int l1,l2;
int pair(int n[15]);
int num[15]={0};
for (l1=0;(num[0]!=-1);l1++){
scanf("%d",&num[0]);
for (l2=1;(num[l2-1]!=0)&&(num[0]!=-1);l2++){
scanf("%d",&num[l2]);
}
if (num[0]!=-1) printf("%d\n",pair(num));
}
return (0);
}
int pair(int n[15])
{
int sum,i,j,k,x;
sum=0;
for (i=1;(n[i]!=0);i++){
if (n[i]==(n[0]+n[0])) sum=sum+1;
}
for (j=1;(n[j-1]!=0);j++){
for (k=0;(n[k]!=0);k++){
if (n[k]==n[j]*2) sum=sum+1;
}
}
return(sum);
} |
12 | 5936 | 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 | 5937 | int main()
{
int i,j,line,n;
for(line=1;;line++){
int a[16]={0};
n=0;
for(i=0;i<16;i++){
scanf("%d",&a[i]);
if(a[0]==-1)
goto A;
else if(a[i]==0)
break;
}
for(i=0;i<16;i++){
for(j=0;j<16;j++){
if(a[i]==2*a[j]&&a[i]!=0){
n++;
break;
}
}
}
printf("%d\n",n);
}
A:
return 0;
} |
12 | 5938 | int main()
{
int n=100,m=16,i=1,j,k,t=0;
int a[16];
while(n>0)
{
cin>>a[0];
if (a[0]==(-1))
break;
else
{
while(m>0)
{
cin>>a[i];
if (a[i]==0)
break;
m--;
i++;
}
for(j=0;j<=i-1;j++)
for(k=0;k<=i-1;k++)
{
if (a[j]==2*a[k])
t++;
}
}
cout<<t<<endl;
t=0;
m=16;
i=1;
n--;
}
return 0;
} |
12 | 5939 | //******************************************
//*?????.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 | 5940 | void main()
{
int a[15];
int t,s,i,j,n;
scanf("%d",&t);
while (t!=-1)
{
s=0;
n=0;
a[s]=t;
scanf("%d",&t);
while (t!=0)
{
s++;
a[s]=t;
scanf("%d",&t);
}
i=0;
for (i;i<s;i++)
{
j=i+1;
for (j;j<=s;j++)
{
if ((a[i]==a[j]*2)||(a[j]==a[i]*2))
n++;
}
}
printf("%d",n);
printf("\n");
scanf("%d",&t);
}
}
|
12 | 5941 | int main()
{
int a[16] = {0}, i = 1, num[16] = {0}, s, k = 0;
while (cin >> s)
{
a[i] = s;
if (a[i] == 0) {i = 0; k++; continue;}
if (a[i] == -1) break;
for (int j = 0 ; j <= i ; j++)
{
if (a[i] == 2 * a[j] || a[j] == 2 * a[i])
num[k]++;
}
i++;
}
for (i = 0 ; i < k ; i++)
{
cout << num[i] <<endl;
}
return 0;
} |
12 | 5942 | int main()
{
int an[50],*p,i,t=0,*q;
for(i=0;;)
{
scanf("%d",&an[i]);
if(an[i]==-1) break;
else
{
for(i=1;;i++)
{
scanf("%d",&an[i]);
if(an[i]==0) break;
}
for(p=an;*p!=0;p++)
{
for(q=an;*q!=0;q++)
if(*q==(*p)*2) t++;
}
printf("%d\n",t);
t=0;
}
i=0;
}
return 0;
} |
12 | 5943 | 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 | 5944 | 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 | 5945 | /*
* 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 | 5946 | //***************************
//**???1.cpp
//**??????
//**???2013.10.30
//**???????
//***************************
int main()
{
int a[17], i, n; // ??0????17???
while (1)
{
n = 0;
cin >> a[1];
if (a[1] == -1) break; // ???????-1?????
for (i = 2; ; i++)
{
cin >> a[i];
if (a[i] == 0) break; // ???0???????
}
for (int j = 1; j <= i ;j++)
for (int k = j + 1; k <= i; k++)
if (a[j] == 2 * a[k] || a[k] == 2 * a[j])
n++;
cout << n << endl;
}
return 0;
} |
12 | 5947 | 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=0;k<pause;k++){
for(i=0;i<pause;i++){
if ( A[k] == 2*A[i])/*??2?*/{
count++;
}
}
}
printf("%d\n",count);
}
return 0;
}
|
12 | 5948 | //***********???????*************************
//***********???????*************************
//***********?????2012?10?30?***************
//***********???1200062701**********************
int main()
{
int x[15], sum = 0, n;
while (1)
{
for (n = 0; ; n++) // n?????
{
cin >> x[n];
if (x[n] <= 0) break; //??????0 ? -1 ????
}
if (x[n] == -1) break; // ???-1 ????
for (int i = 0; i < n; i++) // ?????????
{
for(int j = 0; j < n; j++)
{
if (x[j] == x[i] * 2) sum = sum + 1;
}
}
cout << sum << endl;
sum = 0;
}
return 0;
} |
12 | 5949 | int main()
{
int a[16],i,j,s,k,l;
for(l=1;l<3000;l++)
{
s=0;
scanf("%d",&a[0]);
if(a[0]==-1) break;
for(k=1;k<=16;k++)
{
scanf("%d",&a[k]);
if(a[k]==0)break;
}
for(i=0;i<k-1;i++)
{
for(j=i+1;j<k;j++)
if(a[i]==a[j]*2 || a[j]==a[i]*2) s=s+1;
}printf("%d\n",s);
}
return 0;
}
|
12 | 5950 | //****************************
//**Title:?? **
//**Author:???1300017687 **
//**Date?2013.10.30 **
//**File?1.cpp **
//****************************
int main()
{
while(1)
{
int num[16] = {0}; //???????15????,???????????????0
cin >> num[0]; //??????????
if (num[0] == -1) //????????-1
break; //????,????
int sum = 1; //sum????????
for(; ;sum++)
{
cin >> num[sum]; //????
if (num[sum] == 0) //????0,?????
{
sum --; //?sum??
break; //??????
}
}
int twice = 0; //twice?????????
for (int i = 0 ; i < sum ; i++) //????i?????
{
for(int j = i + 1 ; j <= sum ; j++)
{
//??num[j]?num[i]??????
if((num[j] == 2 * num[i])||(num[i] == 2 * num[j]))
twice ++; //??????
}
}
cout << twice << endl;
}
cin.get();
cin.get();
return 0;
}
|
12 | 5951 | //****************************
//**Title:?? **
//**Author:?? 1300012732 **
//**Date?2013.10.30 **
//**File?1.cpp **
//****************************
int main()
{
int a[15],n;
int i;
cin >> a[0];
while (a[0] != -1)
{
for (i = 1; ; i++)
{
cin >> a[i];
if (a[i] == 0)
{
n = i;
break;
}
}
int cnt = 0,j;
for (i = 0; i <= n-2; i++)
for (j = i + 1; j <= n-1; j++)
{
if (a[i] - 2 * a[j] == 0 || a[j] - 2 * a[i] == 0)
cnt++;
}
cout << cnt << endl;
for (i = 0; i <= 14; i++)
a[i] = 0;
cin >> a[0];
}
return 0;
}
|
12 | 5952 | 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 | 5953 | void main()
{
int str_1[20][20];
int str_2[100];
int x,y,m,j;
int sum=0;
int p=0;
int a=0;
int b=0;
int c;
int k;
int i=0;
while(1)
{
++p;
scanf("%d",&x);
if(-1==x) break;
k=0;
str_1[p][i++]=x;
b++;
while(1)
{
scanf("%d",&y);
k++;
str_1[p][i++]=y;
if(0==y)
{
str_1[p][i]='\0';
break;
}
}
for(j=0;j<k;j++)
{
for(m=0;m<k;m++)
{
if(str_1[p][j]==str_1[p][m]*2) ++sum;
}
}
str_2[a++]=sum;
sum=0;
str_2[a]='\0';
i=0;
}
for(c=0;c<b;c++)
{
printf("%d",str_2[c]);
printf("\n");
}
} |
12 | 5954 | int main()
{
int a[100][20],i=0,j=0,k=0,num[100];
do
{
j=0;
do
{
scanf("%d",&a[i][j]);
j++;
}
while ((a[i][j-1]!=0)&&(a[i][j-1]!=-1));
i++;
}
while(a[i-1][0]!=-1);
i=0;
while(a[i][0]!=-1)
{
num[i]=0;
k=0;
while((a[i][k]!=0)&&(a[i][k]!=-1))
{
j=0;
while((a[i][j]!=0)&&(a[i][j]!=-1))
{
if(a[i][k]==2*a[i][j])
{
num[i]++;
}
j++;
}
k++;
}
i++;
}
i=0;
while(a[i][0]!=-1)
{
printf("%d\n",num[i]);
i++;
}
return 1;
}
|
12 | 5955 | 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 | 5956 | /*
*@file 2.cpp
*@author ???
*@date 2010-11-03
*@describe
?????????????????????????
*/
int main()
{
int a[16], i, j, n, count;
while(1)
{
count = 0;
i = 0;
//?????0???
while(1)
{
cin >> a[i++];
if(a[i-1] == 0 || a[0] == -1)
break;
}
n = i - 1;
//??????-1?????
if (a[0] == -1)
break;
//?????????????????count++
for (i = 0 ; i < n - 1 ; i++)
for ( j = i + 1 ; j < n; j ++)
{
if (a[i] * 2 == a[j] || a[j] * 2 == a[i])
count ++;
}
//??????????
cout << count << endl;
}
return 0;
}
|
12 | 5957 | //************************************************************
//* ??????? *
//* ???????2?15???????????????????*
//* ?????????????????????????*
//* ? ????? *
//* ? ??2013.10.30 *
//************************************************************
int main()
{
int num[16] , i , k , j , count;
for(;;) //????
{
i = -1 ; //?????i?count
count = 0 ;
do
{
i ++ ;
cin >> num[i] ; //???i+1??
if ( num[0] == -1 ) //?????????-1???
return 0 ;
}
while ( num[i] != 0 ) ; //????0??
for ( j = 0 ; j <= i-1 ; j++ )
{
for ( k = j ; k <= i-1 ; k ++ )
{
if ( ( num[j] == 2 * num[k] ) || ( num[j] * 2 == num[k] ) ) //????
count ++ ; //??
}
}
cout << count << endl ; //??
}
} |
12 | 5958 |
//??, [email protected]
int main()
{
int n[100][100],i,k,j,s[100],num[100],t,p,m;
//double a;
for(i=0;i<100;i++)
{
scanf("%d",&n[i][0]);
if(n[i][0]==-1) break;
else
{
for(j=1;j<100;j++)
{
scanf("%d",&n[i][j]);
if(n[i][j]==0){
num[i] = j;
break;
}
}
}
}
for(k=0;k<i;k++)
{
s[k]=0;
for(t=0;t<j;t++)
{
for(m=t;m<num[k];m++)
{
if( (2*n[k][t]==n[k][m]) || (2*n[k][m]==n[k][t]) )
{
s[k]=s[k]+1;
}
//if(a==2.0||a==0.5) s[k]=s[k]+1;
}
}
}
for(p=0;p<i;p++)
printf("%d\n",s[p]);
return 0;
}
|
12 | 5959 | void main()
{
int i,j,k,time=0,sz[16],tmp,xh,m=0,mp;
for(xh=0;xh<50;xh++)
{
for(i=0;i<16;i++)
{
scanf("%d",&sz[i]);
if(sz[i]==0)
{
for(mp=0;mp<i;mp++)
{
for(j=0;j<i-1;j++)
{
if(sz[j]>=sz[j+1])
{
tmp=sz[j];
sz[j]=sz[j+1];
sz[j+1]=tmp;
}
}
}
for(k=0;k<i;k++)
{
for(j=k;j<i;j++)
{
if(sz[j]==2*sz[k])
{
time++;
}
}
}
printf("%d\n",time);
i=-1;
j=0;
k=0;
time=0;
mp=0;
}
if(sz[i]==-1)
{
m=1;
break;
}
}
if(m==1)
break;
}
}
|
12 | 5960 | int main()
{
int n,k,i,a[15],l,p=0,t;
for(i=1;;i++)
{scanf("%d",&a[0]);
if (a[0]==-1 ) break;
else{
p=0;
for(k=1;k<=15;k++)
{
scanf("%d",&a[k]);
if (a[k]==0) break;
}
for(t=0;t<=k;t++)
for(l=0;l<=k;l++)
{
if(a[l]==a[t]*2) p=p+1;
}
p=p-1;
printf("%d\n",p);}
}
return 0;
} |
12 | 5961 |
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 | 5962 | void main()
{
int a[100][16],i,j,x,y,m,n,o,p,q,b,c[100];
for(j=1;j<=100;j++)
{
for(i=1;i<=16;i++)
{
scanf("%d",&a[j][i]);
if(a[j][i]==0||a[j][i]==-1)
{
c[j]=i-1;
break;
}
}
if(a[j][i]==-1)
break;
}
for(m=1;m<j;m++)
{
b=0;
for(p=1;p<=c[m];p++)
{
for(q=p+1;q<=c[m];q++)
{
if(a[m][q] == 2 * a[m][p]||2*a[m][q]==a[m][p])
b=b+1;
}
}
printf("%d\n",b);
}
}
|
12 | 5963 | 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 | 5964 | int main()
{
int a[16], j, k, sum;
while(true)
{
cin >> a[0];
if(a[0] != -1)
{
int i;
for(i = 1 ; ; i++)
{
cin >> a[i];
if(a[i] == 0)
break;
}
sum = 0;
for (j = 0; j < i; j++)
{
for (k = j + 1; k < i ; k++)
if (a[j] == 2 * a[k] || a[k] == a[j] * 2)
sum = sum + 1;
}
cout << sum << endl;
}
else
break;
}
return 0;
}
|
12 | 5965 | 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 | 5966 | 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 | 5967 | int main()
{
int a[16],i,j,k,h,n;
for (h=0;;h++)
{n=0;
for(i=0;i<16;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
break;
}
if (a[0]==-1)
{break;}
for (j=0;j<i;j++)
{for (k=0;k<i;k++)
{if ((a[k]/a[j])==2 && (a[k]%a[j])==0)
n=n+1;
else n=n;
}
}
printf("%d\n",n);
if(a[0]==-1)
{break;}
}
return 0;
} |
12 | 5968 | 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 | 5969 | int main(int argc, char* argv[])
{
int i,j,b=0,s[100][16],t[100],k;
for(i=0;;i++)
{
for(j=0;;j++)
{
scanf("%d",&s[i][j]);
if(s[i][j]==0||s[i][j]==-1)break;
t[i]++;
}
if(s[i][j]==0) b++;
if(s[i][j]==-1) break;
}
for(i=0;i<b;i++)
{
int sum=0;
for(j=0;j<t[i];j++)
{
for(k=0;k<t[i];k++)
{
if(s[i][j]==s[i][k]*2)
sum++;
}
}
printf("%d\n",sum);
}
return 0;
}
|
12 | 5970 | // ??-??.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 | 5971 | 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 | 5972 |
int main(int argc, char* argv[])
{
int p[50][15],n[50],line,sum,i,k,j;
for(i=0;;i++)
{
for(k=0;;k++)
{
scanf("%d",&p[i][k]);
if(p[i][k]==0||p[i][k]==-1)
{
n[i]=k;
break;
}
}
if(p[i][k]==-1)
{
line=i;
break;
}
}
for(i=0;i<line;i++)
{
sum=0;
for(k=0;k<n[i];k++)
{
for(j=k+1;j<n[i];j++)
{
if(p[i][k]==p[i][j]*2||p[i][j]==p[i][k]*2)
sum=sum+1;
}
}
printf("%d\n",sum);
}
return 0;
}
|
12 | 5973 | //******************************************************
//* ? ? ? ?1134 ?? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 11 ? 4 ? *
//* ? ? ? ??????????????? *
//* ? ? ?1000010439 *
//******************************************************
int main() //???
{
int a[17][1000],i,j,k,s[1000] = {0}; //?????????????????
int sum[1000] = {0},g = 0,n; //??????????
for(i = 0,k = 0;i <= 1000;i++,k++) //????????
{
for(j = 0;j <= 16;j++,s[i]++)
{
cin >> a[j][i];
if(a[j][i] == 0) //??0?????????????
break;
else if(a[j][i] == -1) //??-1?????
{
g = 1;
break;
}
}
if(g == 1)
break;
}
for(i = 0;i <= k - 1;i++) //????????
{
for(j = s[i];j >= 0;j--)
{
for(n = 0;n < j;n++)
{
if(a[n][i] < a[j][i])
{
if(a[j][i] == 2 * a[n][i])
sum[i]++;
}
else
{
if(a[n][i] == 2 * a[j][i])
sum[i]++;
}
}
}
cout << sum[i] << endl; //?????????
}
return 0;
}
|
12 | 5974 | void main()
{
int a[20];
int i,j,k;
int count;
do
{
i=0;
count=0;
do
{
scanf("%d",&a[i]);
for(k=0;i>0 && k<i;k++)
{
if(a[i]/2.0==a[k] || a[i]*2==a[k])
count=count+1;
}
i=i+1;
}
while(a[i-1]!=0 && a[0]!=-1);
if(a[0]!=-1)
printf("%d\n",count);
}
while(a[0]!=-1);
}
|
12 | 5975 | 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 | 5976 | int main()
{
int a[20],i,j,sum;
while(1)
{
sum=0;
for(i=1;;i++)
{
cin>>a[i];
if(a[1]==-1)break;
if(a[i]==0)break;
for(j=1;j<i;j++)
{
if(a[i]==2*a[j]||a[j]==2*a[i])
{
sum++;
}
}
}
if(a[1]!=-1)cout<<sum<<endl;
if(a[1]==-1)break;
}
return 0;
} |
12 | 5977 | int main ()
{
int a[150]={0},i,j,k,num;
for(;;)
{
num=0;
for (i=0;;i++)
{
cin>>a[i];
if(a[i]==0) break;
}
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if (a[j]==2*a[k])
{
num++;
}
}
}
if(a[0]!=-1)
{
cout<<num<<endl;
}
else break;
}
return 0;
} |
12 | 5978 |
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 | 5979 | int a[16], n=0;
int do_LB(){
int i, j, c=0;
for(i=0; i<n; ++i)
for(j=i+1; j<n; ++j)
if(a[i]==a[j]+a[j] || a[j]==a[i]+a[i]) c++;
n=0;
return c;
}
int main(){
int cin;
do{
scanf("%d", &cin);
if(cin == -1) return;
if(cin == 0) printf("%d\n", do_LB());
a[n++] = cin;
}while(1);
}
|
12 | 5980 | int main()
{
int a, i, j, k, tot, s;
a=0;
int num[20]={0};
while (a!=-1)
{
j=1;
tot=1;
s=0;
for (i=1;i<=20;i++)
num[i]=0;
i=1;
cin >> a;
while ( a!=-1 )
{
if (a!=0)
{
num[i++]=a;
tot++;
cin >> a;
}
else break;
}
if (a!=-1)
{
for(j=1;j<=tot;j++)
for(k=j+1;k<=tot;k++)
if ((num[k]==2 * num[j])||(2 * num[k]==num[j]))
s++;
cout << s << endl ;
}} cin >> s;
return 0;
}
|
12 | 5981 | int main ()
{
int a[1000][20];
int i,j,k,n=0;
int x[1000];
for (i=0;i<1000;i++)
{
x[i]=0;
for (j=0;j<20;j++)
{
scanf ("%d",&a[i][j]);
if (a[i][j]==0){n++;break;}
if (a[i][j]==-1)break;
}
if (a[i][0]==-1)break;
}
for (i=0;i<n;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])x[i]++;
}
}
}
for (i=0;i<n;i++)
{
printf ("%d\n",x[i]);
}
return 0;
} |
12 | 5982 | 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 | 5983 | 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 | 5984 |
int main(int argc, char* argv[])
{
int a[16],i,j,k,count=0;
for(;;)
{
count=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(j=0;j<i;j++)
{
for(k=j;k<i;k++)
{
if(a[j]==a[k]*0.5||a[j]==a[k]*2)count++;
}
}
printf("%d\n",count);
}
}
return 0;
} |
12 | 5985 | /***************************
No.1200012819
Name ???
Date 2012-10-31
***************************/
int main()
{
int a[16] = {0}; //?????16????????????0?
while (1) //????????????-1??????
{
int i = 0,num = 0,p = 0; //?????????????????????
while (1) //??????????a?????????????0??????
{
cin >> a[i];
if (a[i] <= 0) //????????????????
break;
i++; //??i???
}
if (a[0] == -1) //??????-1??????
break;
for (int j = 0;j < i;j++) //??a[0]?a[i-1]????????????a[0]?a[i-1]????????
{
p = j;
for (int k = 0;k < i;k++)
{
if (a[p] * 2 == a[k])//??????nun ?1?
num++;
}
}
cout << num << endl;
}
return 0;
}
|
12 | 5986 |
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 | 5987 |
int num[16];
int Compare(const void* elem1,const void* elem2)
{
return *((int*)elem1) - *((int*)elem2);
}
int main()
{
int n;
while (cin>>n&&n!=-1)
{
memset(num,0,sizeof num);
num[0] = n;
int count = 0;
int i = 1;
for (;cin>>n&&n!=0;i++)
num[i] = n;
qsort(num,i,sizeof(int),Compare);
for (int j =0;j<i-1;j++)
{
int temp = num[j];
for (int k=j+1;k<i;k++)
{
if (num[k]==temp*2)
{
count++;
break;
}
}
}
cout<<count<<endl;
}
return 0;
}
|
12 | 5988 | int main()
{
int a[16],i,j,m,b;
do
{
scanf("%d",&a[0]);
if(a[0]==-1)
{
break;
}
for(i=1;i<=15;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{
break;
}
}
j=0;
for(m=0;m<=i-1;m++)
{
for(b=0;b<=i-1;b++)
{
if(a[m]==a[b]*2)
{
j++;
}
}
}
printf("%d\n",j);
}
while(1);
return 0;
} |
12 | 5989 |
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 | 5990 |
void initarray ( int a[] ,int b , int length ); // ?????
void base ( int a[maxlen] ); // ??
int twice ( int a[maxlen] ); // ????
int main ( void ) // ???
{
int a[maxlen];
int t[maxlen];
int i,j,k,l;
i = 0;
for ( i = 0 ; i < maxlen ; i ++ )
{
a[i] = -2;
}
i = 0;
k = -2;
while( a[i] != -1 )
{
while ( k != 0 )
{
cin>>k;
a[i] = k ;
i ++ ;
}
base ( a );
j = twice ( a );
cout<<j<<endl;
initarray ( a , -2 ,maxlen);
i = 0 ;
k = -2 ;
}
return 1;
}
void initarray (int a[] ,int b , int length)
{
int i;
for ( i = 0 ; i < length ; i++)
{
a[i] = b;
}
}
void base ( int a[maxlen] )
{
int b[maxinputint+1];
int i,j;
initarray(b,0,maxinputint);
for ( i = 0 ; i<maxlen; i ++ )
{
if ( a[i] > 0 )
{
b[a[i]]++;
}
}
j = 0;
for ( i = 0 ; i<= maxinputint; i ++ )
{
if ( b[i] == 1 )
{
a[j] = i;
j++ ;
}
}
}
int twice ( int a[maxlen] )
{
int i,j,t,result;
i = 0;
j = 0;
t = 0;
result = 0;
while ( ( a[i] <= 50 ) && ( a[j] > 0 ))
{
t = a[i] * 2;
j = i ;
while ( (a[j] <= t) && ( a[j] > 0 ) )
{
if ( a[j] == t )
{
result ++ ;
};
j++ ;
}
j = 0;
i ++ ;
}
return result;
} |
12 | 5991 | //********************************
//*????? **
//*?????? 1300012946 **
//*???2013.10.30 **
//********************************
int main()
{
while (1)
{
int a[16]={0},i,j,p,k,l,num=0;
cin>>a[0];//??????????????????
if (a[0] == -1)
break;
for (i=1 ; i<=16 ; i++)//?????????????
{
cin>>a[i];
if (a[i] == 0)
break;
}
while (a[0] != 0)//???????????????????????
{ //??0??a[0]?
for (j=0 ; j<i ; j++)
{
if (a[j] > a[j+1])
{
p = a[j];
a[j] = a[j+1];
a[j+1] = p;
}
}
}
for (k=1 ; k<=i-1 ; k++)//??????????????????????
{
for (l=k ; l<=i ; l++)
{
if (2 * a[k] == a[l])
num++;
if (2 * a[k] < a[l])
break;
}
}
cout<<num<<endl;
}
return 0;
}
|
12 | 5992 | //********************************
//*????? **
//*?????? 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 | 5993 | int main(int argc, char* argv[])
{
int p[15];
scanf("%d",&p[0]);
int i;
int l=0;
for(i=1;i<15;i++){
int a;
scanf("%d",&a);
if(a==0)
break;
else{
p[i]=a;
l++;}
};
int j,m,max;
for(j=0;j<l-1;j++){
for(m=j+1;m<l;m++)
if(p[j]>p[m]){
max=p[j];
p[j]=p[m];
p[m]=max;
}
}
int num=0;
int k,n;
for(k=0;k<l-1;k++){
for(n=k+1;n<l;n++){
if((p[n]/p[k])==2&&p[n]%p[k]==0)
num++;
if(p[n]/p[k]>2)
break;
}
}
printf("%d",num);
return 0;
} |
12 | 5994 |
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 | 5995 | 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 | 5996 | 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 | 5997 |
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 | 5998 | //* ?? *
//* 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 | 5999 | // 1134 ?? 1000062708
int main()
{
int i, j, k, a[16], m ;
for(i = 0;a[0] != -1;i++)
{
int s = 0;
cin >> a[0];
if(a[0] == -1) break;
for(j = 1;j<16;j++)
{ cin >> a[j];
if(a[j]==0) break;}
for(k = 0;a[k] != 0;k++)
{
m = 2 * a[k];
for(j = 0;a[j] != 0;j++)
{
if(a[j] == m)
s++;
}
}
cout << s << endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.