id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
5,600 | int main()
{
int a[200],i,s=0,cnt=0,q,j;
while(1)
{
s=0;
cnt=0;
cin>>a[1];
if(a[1]==-1)break;
for(i=2;a[i-1]!=0;i++)
{
cin>>a[i];
cnt++;
}
for(i=1;i<=cnt-1;i++)
{
for(j=i+1;j<=cnt;j++)
{
if(a[i]==2*a[j]||2*a[i]==a[j])
s++;
}
}
cout<<s<<endl;
}
cin>>q;
return 0;
} | 12 |
5,601 |
int main(int argc, char* argv[])
{
float p[100][999];
int i,m;
for(m=0;;m++){
for(i=0;;i++){
scanf("%f",&p[m][i]);
if(p[m][i]==0) break;
}
if(p[m][0]==-1) break;
else{
int a=0;
for(int j=0;j<i;j++){
for(int k=0;k<i;k++){
if(p[m][j]/p[m][k]==2) a++;
else a=a;
}
}
printf("%d\n",a);
}
}
return 0;
}
| 12 |
5,602 | //********************************
//*????? **
//*?????? 1200012837 **
//*???2012.10.29 **
//********************************
int main()
{
int i = 0;
do
{
int a[16] = {0};
do
{
cin >> a[i];
i++;
}while(a[i-1] != 0 && a[i-1] != -1);
if(a[i-1] == 0)
{
int n = 0;
for(int j = 0; j <= i-2; j++)
for(int k = 1; k <= i-2 - j; k++)
{
if(a[j] == a[j+k] * 2 || a[j+k] == a[j] * 2)
n++;
}
cout << n << endl;
i = 0;
}
if(a[0] == -1)break;
}while(i != 1);
return 0;
}
| 12 |
5,603 | //?????????
int main()
{
int i,j,m=0,count=0;//????
int num[100];
for(;;)
{
m=0;
for(i=0;;i++)
{
cin>>num[i];//????
if(num[i]==0||num[i]==-1)//??????????
{
count=i;
break;
}
}
if(num[0]==-1)
break;
else
{
for(i=0;i<count;i++)//?????????
for(j=i+1;j<count;j++)
{
if((num[i]==2*num[j])||(num[j]==2*num[i]))//?????????
m++;
}
cout<<m<<endl;//????
}
}
return 0;
} | 12 |
5,604 | /*1 4 3 2 9 7 18 22 0
2 4 8 10 0
7 5 11 13 1 3 0
-1
*/
int main()
{
int a[100];
int i=1,count=0;
scanf("%d",&a[0]);
while (a[i-1]!=0)
{
scanf("%d",&a[i]);
i++;
}
i=i-2;
while (a[0]!=-1)
{
count=0;
int j,k=0;
for(j=0;j<i;j++)
{
for(k=j+1;k<i;k++)
{
if(a[k]==2*a[j]||a[j]==2*a[k])
{
count++;
}
}
}
printf("%d\n",count);
scanf("%d",&a[0]);
if(a[0]==-1)
{
break;
}
i=1;
while (a[i-1]!=0)
{
scanf("%d",&a[i]);
i++;
}
i=i-1;
}
return 0;
}
| 12 |
5,605 | int main()
{
int a[20][16],b[20]={0},i=0,j,k=0;
scanf("%d",&a[0][0]);
i++;
while(a[k][0]!=-1) //input the chunk of data
{
do
{
scanf("%d",&a[k][i]);
i++;
}
while(a[k][i-1]!=0);
k++;
scanf("%d",&a[k][0]);
i=1;
}
for(k=0;a[k][0]!=-1;k++)
{
for(i=0;a[k][i]!=0;i++)
{
for(j=i+1;a[k][j]!=0;j++)
{
if((a[k][j]/a[k][i]==2&&a[k][j]%a[k][i]==0)||(a[k][i]/a[k][j]==2&&a[k][i]%a[k][j]==0))//judge double numbers
b[k]++;
}
}
printf("%d\n",b[k]);
}
return 0;
}
| 12 |
5,606 | //***********???????*************************
//***********???????*************************
//***********?????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 |
5,607 | int main()
{
int a,i,j,k,n;
double f[15];
cin >> a;
while (a != -1)
{
i = 0;
while (a != 0)
{
f[i] = a;
i++;
cin >> a;
}
j = i;
n = 0;
for (i = 0 ; i < j ; i++)
{
for (k = i + 1 ; k < j ; k++)
{
f[k] = f[k]*1.0;
if ((f[k] / f [i]) == 2.0 || (f[i] / f [k]) == 2.0)
n = n + 1;
}
}
cout << n << endl;
cin >> a;
}
cin.get();
cin.get(); //????
return 0;
} | 12 |
5,608 |
int main()
{
int data[16];
int i, j;
int len;
int count;
while(1)
{
count = 0;
scanf("%d", &data[0]);
if(data[0] == -1)
break;
for(i = 1; i <= 15; i++)
{
scanf("%d", &data[i]);
if(data[i] == 0)
{
len = i;
break;
}
}
for(i = 0; i <= len - 1; i++)
for(j = 0 ; j <= len - 1; j++)
count = count + (data[i] == 2 * data[j]);
printf("%d\n", count);
}
return 0;
}
| 12 |
5,609 | int main()
{
int a[100],m,n,i,j,k,p;
i=0;
while(scanf("%d",&m)!=EOF)
{
if(m==-1)
break;
else
if(m==0)
{
for(j=0,n=0;j<=i-2;j++)
for(p=j;p<=i-1;p++)
if(a[j]==a[p]*2||a[p]==a[j]*2)
n++;
printf("%d\n",n);
i=0;
}
else
{
a[i]=m;
i++;
}
}
}
| 12 |
5,610 | 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 |
5,611 | int main()
{
int a[16], len, count; //len???????count??????
while(1)
{
cin >> a[0];
if (a[0] == -1) //??????
{
break;
}
count = 0;
len = 0;
do
{
len++;
cin >> a[len];
}while (a[len] != 0);
for (int i = 0; i < len; i++) //a[len]=0???"<"
for (int j = 0; j < len; j++)
{
if (j == i)
continue; //???????
else
{
if (a[j] == (2 * a[i]))
{
count++; //????????????????
break; //????????
}
}
}
cout << count << endl;
}
return 0;
} | 12 |
5,612 | /**
* file homwork.cpp
* author ??? 1100012722
* data 2011-10-20
* description ??
*/
int main()
{
int a[20] , b[20] ;
int i , j , k ;
int n ;
i = 1 ; n = 0 ;
while( 1 ) // ??????
{
scanf("%d",&a[i]);
if( a[i] == -1 ) break; // ??-1???????
else if( a[i] == 0 ) // ??0???????
{
for(j = 1 ; j <= i-1 ; j++)
b[j] = a[j] * 2;
for(j = 1 ; j <= i-1 ; j++)
for(k = 1 ; k <= i-1 ; k++)
{
if( b[j] == a[k] ) n++;
}
printf("%d\n",n);
i = 1;
n = 0; // ?????????
}
else i ++; // ?0?-1????
}
return 0;
} | 12 |
5,613 | int main()
{
int num[15], i, j, k, t, N;
for(i=1 ; ; i++)
{
cin >> num[0];
if(num[0] == -1)
break;
N=0;
for(j=1; ; j++)
{
cin >> num[j];
if(num[j] == 0)
break;
}
for(k=0; k<=j-1; k++)
{
for(t=0; t<=j-1; t++)
{
if(num[k] == 2*num[t])
N++;
}
}
cout << N << endl;
}
return 0;
} | 12 |
5,614 | int f()
{
int a[15],i,m=0,s=0,j;
scanf("%d",&a[0]);
if(a[0]==-1)s=-1;
else
{
for(i=1;a[i-1]!=0;i++)
{
scanf("%d",&a[i]);
m=m+1;
}
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
if(a[i]==2*a[j])s=s+1;
}
}
}
return s;
}
void main()
{
int a[100],i=0,j;
while(1)
{
a[i]=f();
if(a[i]==-1)break;
i++;
}
for(j=0;j<i;j++)
{
printf("%d",a[j]);
if(j!=i-1)printf("\n");
}
}
| 12 |
5,615 | /*
* 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 |
5,616 | 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 |
5,617 | 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 |
5,618 |
int mat[300];
int main()
{
int n,sum=0;
while(scanf("%d",&n),n!=-1)
{
if(n)
{
mat[n]=1;
if(mat[n<<1])
sum++;
if(!(n&1)&&mat[n>>1])
sum++;
}
else
{
printf("%d\n",sum);
sum=0;
memset(mat,0,sizeof(mat));
}
}
} | 12 |
5,619 | int main()
{
int a[15][16]={{0},{0},{0},{0},{0},{0},{0},{0},{0},{0},{0},{0},{0},{0},{0}},c,m;
for(m=0;m<100;m++)
{
for(c=0;c<16;c++)
{
scanf("%d",&a[m][c]);
if(a[m][c]<=0)break;
}
if(a[m][0]<=0)break;
int b,d,e,f=0;
for(b=0;b<c;b++)
{
d=a[m][b]*2;
for(e=0;e<c;e++)
{
if(d==a[m][e])f++;
}
}
printf("%d\n",f);
}} | 12 |
5,620 |
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 |
5,621 |
main(){
int a[15], i, j, k, n;
for(;;){
n=0;
scanf("%d", &a[0]);
if(a<0) break;
else{
for(i=1; ;i++){
scanf("%d", &a[i]);
if(a[i]==0) break;
else continue;
}
for(j=0; j<i; j++){
for(k=0; k<i; k++){
if(a[j]==2*a[k]) n+=1;
else;
}
}
printf("%d\n", n);
}
}
} | 12 |
5,622 | int main()
{
int n,i,j,num,count=0,array[15];
while(cin>>n&&n!=-1)
{
memset(array,0,sizeof(array));
array[0]=n;
i=1;num=1;
while(cin>>n&&n!=0)
{
array[i++]=n;
num++;
}
sort(array,array+num);
for(i=num-1;i>0;i--)
for(j=i-1;j>=0;j--)
{
if(array[i]==2*array[j])
count++;
}
cout<<count<<endl;
count=0;
}
return 0;
} | 12 |
5,623 | void main()
{
int cnt(int *,int);
int b[50],a[16],i,j,h;
for(i=0;i<50;i++)
{
scanf("%d",&h);
if(h==-1)break;
for(a[0]=h,j=1;j<16;j++)
{
scanf("%d",&a[j]);
if(a[j]==0)break;
}
b[i]=cnt(a,j);
}
for(j=0;j<i;j++)
printf("%d\n",b[j]);
}
int cnt(int *m,int n)
{
int k,l,p=0;
for(k=0;k<n;k++)
for(l=0;l<n;l++)
if(2**(m+k)==*(m+l))p++;
return (p);
}
| 12 |
5,624 |
int main(int argc, char* argv[])
{
int i,a[16],s=0,j;scanf("%d",&a[0]);
while(a[0]!=-1)
{
for(i=1;i<=15;i++)
{scanf("%d",&a[i]);
if(a[i]==0)break;
for(j=0;j<=i;j++)
if(a[j]==2*a[i]||a[j]==0.5*a[i])s+=1;
}printf("%d\n",s);
s=0;
scanf("%d",&a[0]);
}
return 0;
}
| 12 |
5,625 | 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 |
5,626 | /*
* ??????.cpp
* ????: 2010-11-14
* ??????
*/
int main(){
for(int i=0;;i++){//????
int a[16];
int temp;
cin>>temp;
if(temp==-1)
break;//??-1???
else a[0]=temp;
int n=1;
for(int j=1;;j++){
int temp1;
cin>>temp1;
if(temp1==0)//??0???????
break;
else {a[j]=temp1;
n++;
}
}
int m=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if((a[i]==(2*a[j])))
m++;//??2????
}
}
cout<<m<<endl;//????
}
return 0;
}
| 12 |
5,627 | //**************************
//?????
//?????
//???2011.10.22
//**************************
int main() //???
{
double a[18]; //????
int i, j, k, c, d; //????????
double b; // ???????
a[0] = 0;
for(i = 1; ;i++)
{
cin >> a[1];
if(a[1] == -1) break; //??????
for(j = 2; ;j++) //????
{
cin >> a[j];
if(a[j] == 0) break; //???0?????
}
k = 0; //k????
for(c = 1;c < j;c++) //?????
{
for(d = 1;d < j;d++)
{
b = a[c] / a[d];
if(b == 2) //??????2
k++;
}
}
cout << k << endl; //????????
}
return 0;
}
| 12 |
5,628 | int main()
{
int i,n,a[100]={0},p;
scanf("%d",&p);
while (p>0)
{
for(i=0;i<100;i=i+1)
a[i]=0;
for(;p>0;)
{
a[p]=1;
scanf("%d",&p);
}
n=0;
for(i=1;i<50;i=i+1)
if (a[i]&&a[2*i]) n=n+1;
printf("%d\n",n);
scanf("%d",&p);
}
return 0;
} | 12 |
5,629 | //******************************************************
/* ? ? ? ???
/* ? ? ????
/* ? ? ? ??2010 ? 11 ? 7 ?
/* ? ? ? ??????????????????????????????????????
/* ? ? ?1000012752
*******************************************************/
int main()
{
int a[16];
int i,j,k;
int count;
end3:;
for(i=0 ; ; i++) //????a[i]
{
count = 0;
cin >> a[i];
if(a[i] == -1) //????-1?????
{goto end1;}
if(a[i] == 0) //????0???????????
{
for(j=0 ; j<i ; j++) //??????j?k???????????
{
for(k=0 ; k<i ; k++)
{
if(a[j] == 2*a[k]) //???2?????????????+1
{
count = count+1;
break;
}
}
}
cout << count << endl;
goto end3; //??????a[i]
}
}
end1:;
return 0;
}
| 12 |
5,630 |
int main()
{
int i, NO, tmp, a[101];
while(1)
{
scanf("%d",&tmp);
if(tmp == -1) break;
NO = 0;
for(i = 0; i < 101; i++)
a[i] = 0;
a[tmp] = 1;
while(scanf("%d",&tmp)==1&&tmp)
a[tmp] = 1;
for(i = 0; i < 50; i++)
if(a[i]&&a[2*i])
NO++;
printf("%d\n",NO);
}
return 0;
} | 12 |
5,631 |
int main(int argc, char* argv[])
{
int s[16];
int i=1,a,j,b;
loop:;
scanf("%d",&s[i]);
if(s[i]!=0)
{
i++;
goto loop;
}
a=i;
b=0;
for(i=a;i>=1;i--)
{
for(j=1;j<i;j++)
{
if(s[i]==2*s[j]||s[j]==2*s[i])
b++;
}
}
printf("%d",b);
return 0;
}
| 12 |
5,632 | //****************************
//**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 |
5,633 | 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 |
5,634 | int main()
{
int sz[16], duishu=0, zushu,i;
for(zushu=0;1;zushu++){
for(i=0;i<16;i++){
scanf("%d", &sz[i]);
if(sz[i]==0||sz[0]==-1)
break;
}
if(sz[0]==-1)
break;
for(i=0;sz[i]!=0;i++){
int j;
for(j=0;sz[j]!=0;j++){
if(sz[i]==2*sz[j])
duishu++;
}
}
printf("%d\n", duishu);
duishu=0;
for(i=0;i<16;i++){
sz[i]=0;
}
}
return 0;
}
| 12 |
5,635 |
int main()
{
int a[16],i,j,r,k;
while(1)
{
scanf("%d",&a[0]);
if(a[0]==-1)
{
break;
}
r=0;i=0;
while(a[i]!=0)
{
i++;
scanf("%d",&a[i]);
}
for(k=0;k<i;k++)
{
for(j=0;j<i;j++)
{
if(a[j]==2*a[k])
{
r++;
}
}
}
printf("%d\n",r);
}
return 0;
}
| 12 |
5,636 | //**************************
//*????? **
//*?????? 1300012863 **
//*???2013.11.1 **
//**************************
int main()
{
int a[20];
int n,i,j,k;
for(k=1; ;k++)
{
memset(a,0,sizeof(a));
n = 0;
i = 1;
cin>>a[1];
if(a[1]!=(-1))
{
if(a[1]!=0)
{
for(i=1; ; )
{
i++;
cin>>a[i];
if(a[i]!=0)
{
for(j=1;j<=(i-1);j++)
{
if((a[i]==2*a[j])||(a[j]==2*a[i]))
{
n = n + 1;
}
}
}
else
{
cout<<n<<endl;
break;
}
}
}
}
else
{
break;
}
}
return 0;
}
| 12 |
5,637 | int main(){
float sz[16];
int n[100];
int i,k;
for(i=0;i>=0;i++){
n[i]=0;
for(k=0;k<16;k++){
scanf("%f",&sz[k]);
if(sz[k]==0||sz[0]==-1)
break;
}
for(int a=0;a<k-1;a++){
for(int b=a+1;b<k;b++){
if(sz[a]==sz[b]*2||sz[a]==sz[b]/2){
n[i]++;
}
}
}
if(sz[0]==-1)
break;
}
for (k=0;k<i;k++)
printf("%d\n",n[k]);
return 0;
}
| 12 |
5,638 | //*?????**
//*????? 1300012893 **
//*???2013.10.31**
int main()
{
int x,j;
int a[16];
cin >> x;
int i = 1;
int k = 0;
while( x != -1)
{
a[i] = x;
i ++;
if ( x != 0)
{
k = i ;
}
else
{
int sum = 0;
for( i = 1;i <= k;i ++)
{
for ( j = 1;j <= k ;j++)
{
if(a[i] == 2*a[j])
{
sum ++;
}
}
}
cout << (sum -1) << endl;
i = 1;
}
cin>>x;
}
return 0;
} | 12 |
5,639 | int main()
{
int a,i,j,k,h;
int b[16]={0};
while(1)
{
i=0;
while(cin>>a)
{
if(a==(-1))
return 0;
else
{
if(a!=0)
{
b[i]=a;
i++;
}
else
break;
}
}
h=0;
for(j=0;j<=i-1;j++)
{
if(b[j]!=0)
{
for(k=0;k<=i-1;k++)
{
if(b[j]==b[k]*2)
h++;
}
}
else
break;
}
cout<<h<<endl;
}
return 0;
}
| 12 |
5,640 | int a[16];
int main()
{
int n;
while(1)
{
int i=0,s=0,j;
while(1)
{
scanf("%d",&a[i]);
if(a[i]==0||a[i]==-1)
{
n=i;
break;
}
i++;
}
if(a[i]==-1)break;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if((a[i]==2*a[j])||(a[j]==2*a[i]))
{
s++;
}
}
printf("%d\n",s);
s=0;
}
return 0;
}
| 12 |
5,641 | 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 |
5,642 |
int main()
{
int a[16];//???0????????????
int num = 0;
int s;//??2??????
int i , j;//?????
cin >> a[num];
while (a[num] != -1)
{
while (a[num] != 0)
{
num++;
cin >> a[num];
}
num--;//?????0????
s = 0;
for (i = 0; i <= num; i++)
for (j = 0; j <= num; j++)
if (a[i] == a[j] * 2)
s++;
cout << s << endl;
num = 0;
cin >> a[num];
}
}
| 12 |
5,643 | int main()
{
int i=0,n,b,c=0,j=0,k,a[1000][18];
scanf("%d",&b);
while(b!=-1){
if(b!=0){
a[i][j]=b;
j++;
a[i][17]=j;}
else{
a[i][j]=b;
i++;
n=i;
j=0;}
scanf("%d",&b);
}
for(i=0;i<n;i++){
for(j=0;j<a[i][17]-1;j++){
for(k=j+1;k<a[i][17];k++){
if(a[i][j]==2*a[i][k]||a[i][k]==2*a[i][j]){
c++;
}
}
}
printf("%d\n",c);
c=0;
}
return 0;
} | 12 |
5,644 | int main()
{
int n,a[16][16],i,j,t[15]={0},k=0,f,b[16]={0};
for(i=0;i<=10;i++)
{
for(j=0;j<=15;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==-1) break;
if(a[i][j]==0)
break;
t[i]=t[i]+1;
}
if(a[i][j]==-1) break;
k=k+1;
}
for(i=0;i<k;i++)
{
for(j=0;j<t[i];j++)
{
for(f=j+1;f<=t[i];f++)
{
if((a[i][j]==2*a[i][f])||(a[i][f]==2*a[i][j]))
b[i]++;
}
}
}
for(i=0;i<k;i++)
printf("%d\n",b[i]);
return 0;
}
| 12 |
5,645 | int main()
{
int i,j,t=0,k,m;
int a[100][100];
for(j=0;j<100;j++)
{
scanf("%d",&a[t][j]);
if(a[t][j]==0) {t=t+1;}
if(a[t][j]==-1) {break;}
}
for(k=0;k<t;k++)
{
m=0;
for(i=0;i<100;i++)
{
for(j=0;j<100;j++)
{
if(a[k][i]==2*a[k][j]&&a[k][i]!=0)
m++;
}
}
printf("%d\n",m);
}
return 0;
}
| 12 |
5,646 | int main()
{
int a[1000],i=0,k,x=0,j;
for(;;)
{
scanf("%d",&a[i]);
i++;
if(a[i-1]==-1)
break;
}
for(k=0;k<i-1;k++)
{
for(j=k+1;j<i-1;j++)
{
if(a[k]==2*a[j]||a[j]==2*a[k])
{
x++;
}
if(a[j+1]==0)
break;
}
if(a[k+2]==0||a[k+2]==-1)
{
k=k+2;
printf("%d\n",x);
x=0;
}
}
return 0;
}
| 12 |
5,647 | //??
int main()
{
int num[16]; //????????????
int i, k, n; //i,k???? n?????
while (1) //?while?????break???-1
{
memset(num, 0, sizeof(num));
i=0;
k=0;
n=0; //?????
for (i = 1; ; i++)
{
cin >> num[i];
if (num[i] == 0) break;
for (k = 1; k <= i; k++)
{
if ((num[k] / num[i]==2 && num[k] % num[i] == 0) ||
(num[i] / num[k]==2 && num[i] % num[k] == 0)) n++; //????
}
}
if (num[1] == -1) break;
cout << n << endl;
}
return 0;
}
| 12 |
5,648 | 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 |
5,649 | void main()
{
int count=0,num[20][16],i,j,t;
for(i=0;i<16;i++)
{
scanf("%d",&num[0][i]);
if(num[0][i]==0)
break;
}
for(i=1;i<20;i++)
{
if(num[i-1][0]!=-1)
{
for(j=0;j<16;j++)
{
scanf("%d",&num[i][j]);
if(num[i][j]==0 || num[i][j]==-1)
break;
}
}
else break;
}
for(i=0;i<20;i++)
{
if(num[i][0]==-1)
break;
else
{
for(j=0;j<16;j++)
{
if(num[i][j]==0)
break;
else
{
for(t=0;t<16;t++)
{
if(num[i][t]==0)
break;
else
{
if(num[i][t]==2*num[i][j])
count++;
}
}
}
}
printf("%d\n",count);
count=0;
}
}
}
| 12 |
5,650 |
int main(int argc, char* argv[])
{
int A[16];
int sum,j,i,k,m;
for(j=0;;j++)
{
scanf("%d",&A[0]);
if(A[0]==-1)
return 0;
while(A[0]!=0&&A[0]!=-1)
{
sum=0;
for(i=1;;i++)
{
scanf("%d",&A[i]);
if(A[i]==0)
break;
}
for(k=0;k<i;k++)
{
for(m=0;m<i;m++)
{
if(A[k]==A[m]*2)
sum=sum+1;
}
}
printf("%d\n",sum);
break;
}
}
return 0;
} | 12 |
5,651 | int main()
{
int m=0,i,j,a[16],k;
for(i=1;;i++)
{k=0;
for(i=0;i<16;i++)
{scanf("%d",&a[i]);
if(a[i]==0)break;
else if(a[i]==-1){m=1;break;}
}
if(m==1)break;
for(i=0;a[i]!=0;i++)
for(j=0;a[j]!=0;j++)
if(a[i]==2*a[j])k++;
printf("%d\n",k);
}
return 0;
} | 12 |
5,652 | //********************************
//*?? ?? *****
//*????? 1300012753 *****
//*???2013.10.30 *****
//********************************
int main()
{
int a[15], sum = 0, b, n = 0; // a????????sum?????????????b???????n??????????
while(cin >> b)
{
// ??????-1????????
if (b == -1)
break;
// ??b??0???????????????
else if (b == 0)
{
for(int i = 0; i <= n - 1; i++)
{
// ????????????????????
for(int j = i + 1; j <= n - 1; j++)
{
// ??????????????2?????????
if (a[i] == 2 * a[j] || a[j] == 2 * a[i])
{
sum++;
}
}
}
cout << sum << endl;
sum = 0;
n = 0;
}
// ??b???0???????????????
else
{
a[n] = b;
n++;
}
}
return 0;
} | 12 |
5,653 |
int main()
{ int i,n,a,b,k;
k=0;
int sz[20],sz2[20],jieguo[1000];
while(1){
for(i=0;;i++){
scanf("%d",&(sz[i]));
if(sz[i]==0||sz[i]==-1){
break;}
sz2[i]=sz[i];}
if(sz[i]==-1){
break;}
n=0;
for(a=0;a<i;a++){
for(b=0;b<i;b++){
if(sz2[b]*2==sz[a]){
n++;}}}
jieguo[k]=n;
k++;
}
for(i=0;i<k;i++){
printf("%d\n",jieguo[i]);
}
return 0;
}
| 12 |
5,654 | //********************************
//*????? **
//*?????? 1300012934 **
//*???2013.10.31 **
//********************************
int main()
{
int a[15] = {0} , n;
while (1)
{
n = 0;
for (int i = 0; i <= 15; i++)
{
cin >> a[i];
if (a[i] == 0 || a[i] == -1)
break;
}
for (int j = 0; j <= 15; j++)
{
if (a[j] == 0 || a[j] == -1)
break;
for (int k = j + 1; k <= 15; k++)
{
if (a[k] == 0)
break;
else if (a[k] * 2 == a[j] || a[j] * 2 == a[k])
n ++;
}
}
if (a[0] != -1)
{
cout << n << endl;
for (int i = 0; i <= 15; i++)
a[i] = 0;
n = 0;
}
else
break;
}
return 0;
}
| 12 |
5,655 | int main()
{
int a[100][100]={0},i=0,j=0,n=0,l[100]={0},d,N[100]={0};
do
{
j=0;
do
{
scanf("%d",&a[i][j]);
j++;
}
while(a[i][j-1]!=0&&a[i][j-1]!=-1);
l[i]=j-1;
i++;
}
while(a[i-1][j-1]!=-1);
n=i-1;
for(i=0;i<n;i++)
{
for(j=0;j<l[i];j++)
{
for(d=j;d<l[i];d++)
{
if(a[i][d]==2*a[i][j]||a[i][j]==2*a[i][d])
N[i]++;
}
}
}
for(i=0;i<n;i++)
printf("%d\n",N[i]);
return 0;
} | 12 |
5,656 | int main()
{
int a[17] , i , j , k;
for (i = 1 ; i <= 16 ; i++)
{
a[i] = 1;
}
int count = 0;
while (cin >> a[1])
{
if (a[1] == -1)
{
break;
}
else
{
for (i = 2 ; a[i - 1] != 0 ; i++)
{
cin >> a[i];
}
}
i = i - 2;
for (j =1 ; j <= i ; j++)
{
for (k=1 ; k <= i ; k++)
{
if (a[k] == 2 * a[j])
{
count++;
break;
}
}
}
cout << count << endl;
count = 0;
}
return 0;
}
| 12 |
5,657 |
int main(int argc, char* argv[])
{
int a[10000],i,b,j,sum=0;
do
{
sum=0;
scanf("%d",&b);
if(b==-1) break;
else a[0]=b;
for(i=1;;i++)
{
scanf("%d",&a[i]);
if(a[i]==0) break;
}
for(i=0;a[i]!=0;i++)
for(j=0;a[j]!=0;j++)
if(a[j]==a[i]*2) sum++;
printf("%d\n",sum);
}
while(b!=-1);
return 0;
} | 12 |
5,658 | /**
*@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 |
5,659 | 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 |
5,660 |
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 |
5,661 |
int main()
{
int a[16],sign=1,i,j,k,num;
for(;;)
{
num=0;
for(i=0;;)
{
scanf("%d",&a[i]);
sign=a[i];
if(sign==0||sign==-1)break;
else i++;
}
if(sign==-1)break;
else
{
for(j=0;j<i;j++)
{
for(k=j+1;k<i;k++)
{
if(a[k]==2*a[j]||a[j]==2*a[k])num++;
}
}
printf("%d\n",num);
}
}
return 0;
} | 12 |
5,662 | 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 |
5,663 | main()
{
int a[100][16];
int z[100]={0};
int i,j,s,m=0;
for(i=0;;i++)
{
for(j=0;;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0)
break;
if(a[i][j]==-1)
goto loop;
}
}
loop:for(i=0;a[i][0]!=-1;i++)
{
for(j=0;a[i][j]!=0;j++)
{
for(s=j+1;a[i][s]!=0;s++)
{
if(a[i][j]==2*a[i][s])
z[i]++;
if(a[i][j]*2==a[i][s])
z[i]++;
}
}
printf("%d\n",z[i]);
}
}
| 12 |
5,664 | 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 |
5,665 | 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 |
5,666 | 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 |
5,667 | int main()
{
int a[15] = {0};
int j=1, i, m, k;
cin >> a[0];
do
{
m = 0;
k = 0;
for (i=1;i<15;i++)
{
cin >> a[i];
if (a[i] == 0 )
break;
else
j++;
}
for (i=0;i<=j-1;i++)
{
for (k=0;k<=j-1;k++)
{
if (a[k] == 2*a[i])
m++;
}
}
cout << m << endl;
cin >> a[0];
if (a[0] == 0)
cin >> a[0];
j = 1;
}while (a[0] != -1);
return 0;
} | 12 |
5,668 |
int main()
{
int b[20]={0};
int p=2 ;
int j=1 , k=2 , num=0 ;
while( cin>>b[1] )
{
if ( b[1] != -1 )
{
for( p=2; ;p++)
{
cin>>b[p];
if ( b[p] != 0 ) continue;
else
{
for ( j=1;j<p-1;j++)
{
for (k=j+1;k<=p-1;k++)
{
if (( b[j]==b[k]*2 )||( b[k]==b[j]*2 ))
{
num++;
}
}
}
cout << num << endl;
num=0;
memset(b,sizeof(b),0);
break;
}
}
}
else break;
}
return 0;
}
| 12 |
5,669 | //********************************
//*????1.cpp **
//*?????? 1300012966 **
//*???2013.10.30 **
//*????? **
//********************************
int main()
{
int a[17], i, j, k, n;
cin >> a[1];
while (a[1] != -1)
{
n = 0;
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] == a[k] * 2)
{
n++;
}
}
}
n = n - 1;
cout << n << endl;
cin >> a[1];
}
return 0;
}
| 12 |
5,670 | void main()
{
int i,j,k,num[16],f;
scanf("%d",&num[1]);
do
{
k=1;
f=0;
do
{
k++;
scanf("%d",&num[k]);
}
while (num[k]!=0);
for (i=1;i<=k-1;i++)
for (j=1;j<=k-1;j++)
if (num[i]==num[j]*2)
f++;
printf("%d\n",f);
scanf("%d",&num[1]);
}
while (num[1]!=-1);
} | 12 |
5,671 | int main()
{
int a[16],i,c=0,e=0,n,l;
while(1)
{
for(i=0;i<16;i++)
{
scanf("%d",&a[i]);
e=e+1;
if(a[i]==0 || a[i]==-1) break;
}
if(a[i]==-1) break;
for(l=0;l<e-1;l++)
for(n=l+1;n<e-1;n++)
{
if((a[l]/a[n]==2 && a[l]%a[n]==0) || (a[n]/a[l]==2 && a[n]%a[l]==0))
c=c+1;
}
printf("%d\n",c);
int a[16]={0};
e=c=0;
}
return 0;
}
| 12 |
5,672 |
int main()
{
int a[20],i,j,n,court;
while (1)
{
for (i = 0; 1 ; i++)
{
cin >> a[i];
if (a[i] == 0)
break;
}
if ( a[0] == -1 )
break;
n = i;
for (i = 0, court = 0 ; i <= n; i++)
{
for (j = i; j <= n - 1; j++)
{
if (a[j] == 2 * a[i] || a[i] == 2 * a[j])
court++;
}
}
cout << court << endl;
}
return 0;
} | 12 |
5,673 | main()
{
int i,j,n,num,a[17];
do
{ i=0;
do
{ i++;
scanf("%d",&a[i]);
}while(a[i]>0);
n=i-1;
if(a[n+1]!=-1)
{ num=0;
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(a[i]==2*a[j]||a[j]==2*a[i])
num++;
printf("%d\n",num);
}
}while(a[n+1]==0);
return 0;
} | 12 |
5,674 |
int main() {
while(1) {
int i = 0, a[16];
scanf("%d", &a[i]);
if(a[i] == -1) {
break;//
}
int b[105] = {0};
b[a[i]] = 1;
while(1) {
i++;
scanf("%d", &a[i]);
if(a[i] == 0) {
break;
}
b[a[i]] = 1;
}
int j;
int total = 0;
for(j = 1; j < 50; j++) {
if(b[j] == 1 && b[j*2] == 1) {
total++;
}
}
printf("%d\n", total);
}
return 0;
} | 12 |
5,675 | 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 |
5,676 | int main()
{
int a[17],i,j,k,s,n;
for(k=1;;k++)
{
s=0;n=0;
for(i=1;;i++)
{
cin>>a[i];
n++;
if(a[i]==0||a[i]==-1) break;
}
if (a[n]==-1) break;
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
if((a[i]*2==a[j])||(a[j]*2==a[i]))
{
s++;
}
}
}
cout<<s<<endl;
}
return 0;
}
| 12 |
5,677 |
int main()
{
int i=0,j=0,s=0;
int lena,lenb,x,y;
int a[16]={0};
int b[20]={0};
while(1)
{
while(scanf("%d",&a[i]))
{
if((a[i]==0)||(a[i]==-1))
break;
else
{
i++;
continue;
}
}
if(a[0]==-1)
break;
else
{
lena=i;
for(x=0;x<lena;x++)
{
for(y=x+1;y<=lena;y++)
{
if((a[x]==2*a[y])||(a[y]==2*a[x]))
s++;
}
}
b[j]=s;
s=0;
}
j++;
for(i=0;i<16;i++)
a[i]=0;
i=0;
}
for(i=0;i<j;i++)
printf("%d\n",b[i]);
return 0;
}
| 12 |
5,678 | void main()
{
while(1)
{
int a[100]={-2}, i, j, count=0;
for(i=0; ; i++)
{
scanf("%d", &a[i]);
if(a[0]==-1||a[i]==0) break;
}
if(a[0]==-1) break;
for(i=0; a[i+1]!=0; i++)
for(j=i+1; a[j]!=0; j++)
if(a[i]==2*a[j]||a[i]*2==a[j])
count++;
printf("%d\n", count);
}
} | 12 |
5,679 | 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 |
5,680 | int main()
{
int a[16] = {0},n = 0,i,m,j;
while(cin >> a[0])
{
if(a[0] != (-1))
{
for(i = 1;i <= 15;i++)
{
cin >> a[i];
if(a[i] == 0)
break;
}
for(j = i-1;j >= 0;j--)
{
for(m = i-1;m >= 0;m--)
{
if(a[j] == 2 * a[m])
n++;
}
}
cout << n << endl;
n = 0;
}
else
break;
}
return 0;
}
| 12 |
5,681 | int main()
{
int i,a[16],m=0,n=0,b,c[200],x=0,y=0;
for(i=0;i<200;i++)
{
scanf("%d",&c[i]);
x=x+1;
if(c[i]<0)
i=300;
}
for(i=0;i<16;i++,y++)
{
a[i]=c[y];
if(a[i]>0)
{
for(b=0;b<i;b++)
{
if(a[i]==2*a[b]||a[b]==2*a[i])
m=m+1;
}
}
else if(a[i]==0)
{
i=-1;
printf("%d\n",m);
m=0;
}
else
i=100;
}
return 0;
} | 12 |
5,682 | /**
* @file 1.cpp
* @author ???
* @date 2013-10-9
* @description ?????????
*/
int main(void)
{
int a[16], i, k = 0, j = 0, n = 0;
for( i = 0 ; i < 16 ; i++ )
a[i] = -1;
cin >> k;
while( k != -1 )
{
a[j] = k;
j++;
if( k == 0 )
{
for( i = 0 ; i < 15 ; i++ )
for( j = i + 1 ; j < 15 ; j++ )
if( ( a[j]- 2 * a[i] == 0 ) || ( a[i] - 2 * a[j] == 0 ) )
n++;
cout << n << endl;
for( i = 0 ; i < 16 ; i++ )
a[i] = -1;
j = 0;
n = 0;
}
cin >> k;
}
return 0;
} | 12 |
5,683 | int main()
{
int str[20],doubl,num=0,a,b,c;
while(1)
{
num=0;
scanf("%d",&str[0]);
if(str[0]==-1)
break;
else
for(a=1;str[a-1]!=0;a++)
{
scanf("%d",&str[a]);
}
for(b=0;b<a-1;b++)
{
doubl=2*str[b];
for(c=0;c<a-1;c++)
{
if(str[c]==doubl)
num++;
else
num=num;
}
}
printf("%d\n",num);
}
return 1;
} | 12 |
5,684 | void 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)
d++;
else d=d;
}
printf("%d\n",d);
d=0;
}
}
| 12 |
5,685 | 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 |
5,686 |
int main(int argc, char* argv[])
{
int i,j,k,sz[17],n=0;
for(i=0;i<17;i++){
scanf("%d",&sz[i]);
if(sz[i]==-1)
break;
else{
if(i>0){
if(sz[i]>0){
for(j=0;j<i;j++){
if(2*sz[j]==sz[i]||2*sz[i]==sz[j]){
n++;
}
}
}
else{
printf("%d\n",n);
n=0;
i=0;
j=0;
for(k=0;k<16;k++)
sz[k]=-2;
}
}
}
}
return 0;
} | 12 |
5,687 | int main()
{
int p[15],m,n;
int i,j,k,h;
for(i=0;;i++)
{
n=0;
for(j=0;;j++)
{
scanf("%d",&m);
if(m==0) break;
if(m==-1) return 0;
p[j]=m;
}
for(k=0;k<j;k++)
{
for(h=0;h<j;h++)
{
if(p[k]==2*p[h]) n++;
}
}
printf("%d\n",n);
}
return 0;
} | 12 |
5,688 |
int main()
{
int a[100][16], i, j, k, t;
for(i = 0; ; i++)
{
scanf("%d", &a[i][0]);
if(a[i][0] == -1)
break;
for(j = 1; a[i][j - 1] != 0; j++)
{
scanf("%d", &a[i][j]);
}
}
for(j = 0; j < i; j++)
{
int n = 0;
for(k = 0; a[j][k + 1] != 0; k++)
{
for(t = k + 1; a[j][t] != 0; t++)
{
if(a[j][k] == 2 * a[j][t] || a[j][t] == 2 * a[j][k])
n++;
}
}
printf("%d\n", n);
}
return 0;
}
| 12 |
5,689 | int main()
{
for(;;)
{
int a[16];
int i,j,k,m,n=0;
for(i=0;i<16;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{for(m=i+1;m<16;m++)
a[m]=101;
break;
}
}
if(a[0]==-1)
break;
for(j=0;j<i;j++)
for(k=0;k<i;k++)
{if(a[k]*2-a[j]==0)
n++;
}
printf("%d\n",n);
}
return 0;
} | 12 |
5,690 | 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 |
5,691 | //??.c
int main(){
int data;
int a[15];
int i=0;
int j,k;
while(scanf("%d",&data)!=EOF){
if(data==-1) break;
else{
if(data!=0){
a[i] = data;
i++;
}
else{
int tmp;
for(j=0;j<i;j++){
for(k=j+1;k<i;k++){
if(a[j]>a[k]){
tmp=a[k];
a[k]=a[j];
a[j]=tmp;
};
}
}//??
int cnt=0;
for(j=0;j<i;j++){
for(k=j+1;k<i;k++){
if(a[j]*2==a[k]){
cnt++;
break;
}
if(a[j]*2<a[k]) break;
}
}
printf("%d\n",cnt);
cnt=0;
i=0;
}
}
}
return 0;
} | 12 |
5,692 |
int main()
{
int i,j,n,k,m;
int a[100];
while (1){
scanf("%d",&a[0]);
if(a[0]==-1)
break;
for(i=1;;i++){
scanf("%d",&a[i]);
if(a[i]==0)
break;
}
n=i;
for(i=n-1;i>0;i--){
for(j=0;j<i;j++){
if(a[j]>a[j+1]){
k=a[j];
a[j]=a[j+1];
a[j+1]=k;
}
}
}
m=0;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(a[j]==2*a[i]){
m=m+1;
break;
}
if(a[j]>2*a[i]){
break;
}
}
}
printf("%d\n",m);
}
return 0;
}
| 12 |
5,693 | main()
{
int a[100][16];
int z[100]={0};
int i,j,s,m=0;
for(i=0;;i++)
{
for(j=0;;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0)
break;
if(a[i][j]==-1)
goto loop;
}
}
loop:for(i=0;a[i][0]!=-1;i++)
{
for(j=0;a[i][j]!=0;j++)
{
for(s=0;a[i][s]!=0;s++)
if(a[i][j]==2*a[i][s])
z[i]++;
}
printf("%d\n",z[i]);
}
}
| 12 |
5,694 | 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 |
5,695 |
int main()
{
int ch[16], i, j, n, m;
cin >> ch[0];
while(ch[0] != -1)
{
n = 0;
for(i = 1; ch[i - 1] != 0; i++)
{
n++;
cin >> ch[i];
}
m = 0;
for(i = 0; i < n; i++)
{
if(ch[i] % 2 == 1) continue;
else
{
for(j = 0; j < n; j++)
{
if(ch[i] == 2 * ch[j]) m++;
}
}
}
cout << m << endl;
cin >> ch[0];
}
return 0;
}
| 12 |
5,696 | int main()
{
int n[100][15],i=0,j,k,count,t;
for(i=0;;i++)
{
count=0;
j=0;
do
{
cin>>n[i][j];
if(n[i][j]==-1)
goto loop;
j++;
}
while(n[i][j-1]!=0);
for(k=0;k<j;k++)
{
for(t=j-1;t>k;t--)
{
if(n[i][t]==2*n[i][k] || 2*n[i][t]==n[i][k] )
count++;
}
}
cout<<count<<endl;
}
loop:return 0;
}
| 12 |
5,697 | int main()
{
int test[100][17]={0};
int i,j,k,num;
int turn=0,nonzero=0,valid=0;
for(i=0;;i++){
for(j=0;;j++){
scanf("%d",&num);
if(num==0)
break;
if(num == -1)
goto start;
test[i][j]=num;
}
turn+=1;
}
start: for(i=0;i<turn;i++){
for(j=0;;j++){
if(test[i][j] != 0)
nonzero+=1;
else
break;
}
for(j=0;j<nonzero;j++){
for(k=0;k<nonzero;k++){
if((float)(test[i][j])/(float)(test[i][k]) == 2)
valid+=1;
}
}
printf("%d\n",valid);
valid=0;
nonzero=0;
}
return 0;
}
| 12 |
5,698 | 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 |
5,699 | int main()
{
int a[101][16],b[100]={0},c[101],k,i,j,l,m;
for (i=1;1;i++)
{
scanf("%d",&a[i][1]);
if (a[i][1]==(-1))
{
i--;
break;
}
else
for (j=2;1;j++)
{
scanf("%d",&a[i][j]);
if (a[i][j]==0)
{
j=j-1;
break;
}
}
c[i]=j;
}
for (k=1;k<=i;k++)
{
for (l=1;l<=c[k];l++)
{
for (m=1;m<=c[k];m++)
{
if (a[k][m]/a[k][l]==2&&a[k][m]%a[k][l]==0)
b[k]=b[k]+1;
else
b[k]=b[k];
}
}
printf("%d\n",b[k]);
}
return 0;
} | 12 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.