id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
5,900 | //********************************
//*?? **
//*????? 1300012848 **
//*???2013.10.30 **
//********************************
int main()
{
int i, j, k, a[16]={0}, count; //0????????????????????16??????????15+1??
do
{
count = 0;
cin >> a[0];
if(a[0] == -1) //???-1?????? ????
break;
for(i = 1;; i++)
{
cin >> a[i];
if(a[i] == 0) //??????0????????
break;
}
for(j = 0; j < i; j++)
for(k = 0; k < j; k++)
if (a[k] == 2 * a[j] || 2 * a[k] == a[j]) //?????????????
count ++;
cout << count << endl;
}while(1);
return 0;
} | 12 |
5,901 | /*
*@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 |
5,902 | int main ()
{
int a[50][16],b[50],c[50],i,j,m,n,o,line,num=0;
for(i=0;i<=49;i++)
{
for(j=0;j<=15;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0||a[i][j]==-1)
{
b[i]=j-1;
c[i]=0;
break;
}
}
if(a[i][0]==-1)
break;
line=i;
}
for(m=0;m<=line;m++)
{
for(n=0;n<=b[m];n++)
{
for(o=0;o<=b[m];o++)
{
if(a[m][n]==2*a[m][o])
c[m]=c[m]+1;
}
}
printf("%d\n",c[m]);
}
return 0;
}
| 12 |
5,903 |
int main()
{
int a[16];
int i,n,j,m,k;
int flag;
while (1)
{
m=0;j=0;flag=0;
for (i=0;;i++)
{
scanf("%d",&a[i]);
if (a[i]==0)
break;
else if (a[i]==-1)
{
flag=1;
break;
}
}
if (flag==1)
break;
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)&&(a[j]!=0&&a[k]!=0))
m++;
}
printf("%d\n",m);
}
return 0;
}
| 12 |
5,904 | int main(){
int a[1000],i,j,n,k;
while(1)
{
n=0;
cin>>a[1];
if (a[1]!=-1)
{
for(i=2;a[i-1]!=0;i++)
cin>>a[i];
for(j=1;j<i-1;j++)
for(k=1;k<i-1;k++)
if(a[k]==2*a[j])
n=n+1;
cout<<n<<endl;
}
else break;
}
return 0;}
| 12 |
5,905 | 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 |
5,906 |
int main()
{ int shuzu[16];
int i,t,k,num=0;
for(i=0;;i++){
scanf("%d",&shuzu[i]);
if(shuzu[i]==-1){
break;
}
if(shuzu[i]==0){
for(t=0;t<i;t++){
for(k=t+1;k<i;k++){
if(shuzu[t]==shuzu[k]*2||shuzu[t]*2==shuzu[k]){
num++;
}
}
}
printf("%d\n",num);
num=0;
i=-1;
}
}
return 0;
}
| 12 |
5,907 | /*
* 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 |
5,908 | int main()
{
int row,col;
int a,b;
int sz[100][100];
int sum[100];
for(row=0;row<100;row++)
{
sum[row]=0;
}
for(row=0;row<100;row++)
{
for(col=0;col<100;col++)
{
scanf("%d",&sz[row][col]);
if(sz[row][col]==0)
{
break;
}
if(sz[row][0]==-1)
{
break;
}
}
if(sz[row][0]==-1)
{
break;
}
a=row;
}
for(row=0;row<=a;row++)
{
for(b=0;b<100;b++)
{
for(col=0;col<100;col++)
{
if(sz[row][b]==2*sz[row][col]&&sz[row][b]!=0&&sz[row][col]!=0)
{
sum[row]++;
}
}
}
}
for(row=0;row<=a;row++)
{
printf("%d\n",sum[row]);
}
return 0;
} | 12 |
5,909 | 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 |
5,910 | int main()
{
int s[1000][100];
int i=0,j=0,h=0,a,m=0,sum=0;
scanf("%d",&a);
while(a!=-1)
{
if(a!=0)
s[i][j++]=a;
else
{ s[i][j]=a;
i++;
j=0;}
scanf("%d",&a);
}
for(h=0;h<i;h++)
{ while (s[h][j]!=0)
{ m=0;
while(s[h][m]!=0)
{
if(((float)s[h][j]/2)==(float)s[h][m])
sum++;
m++;
}
j++;
}
printf("%d\n",sum);
sum=0;
j=0;
}
return 0;
}
| 12 |
5,911 | int main()
{
int i, a[16];
while(1)
{
for( i = 0;;i++)
{
cin >> a[i];
if(a[i] == 0)
break;
if(a[i] == -1)
goto end;
}
int count = 0;
for(int m = 0; m < i; m++)
{
for(int n = 0; n < i; n++)
{
if(a[m] == a[n] * 2)
count++;
}
}
cout << count << endl;
}
end:
return 0;
}
| 12 |
5,912 | main()
{
int c[100][100],i=0,j=0,m,n,k,s=0;
while(scanf("%d",&c[i][j]))
{
if(c[i][j]!=0&&c[i][j]!=-1)
j++;
else if(c[i][j]==0)
{
i++;
j=0;
}
else break;
}
for(m=0;m<=i-1;m++)
{
for(n=0;c[m][n]!=0;n++)
{
for(k=0;c[m][k]!=0;k++)
{
if(c[m][n]==2*c[m][k])
s++;
}
}
printf("%d\n",s);
s=0;
}
}
| 12 |
5,913 |
int main()
{
int sc[300],ao[16];
int i,j,k,l,n,b,x,m;
i=0;j=0;k=0;l=0,x=0;
do{
n=1;
for(i=0;i<16;i++){
scanf("%d",&ao[i]);
if(ao[i]==0||ao[i]==-1){
n=i;
break;
}
}
i=0;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(ao[i]*2==ao[j]){
k++;
}
}
}
sc[l]=k;
k=0;
l++;
}
while(n!=0);
for(x=0;x<l-1;x++){
printf("%d\n",sc[x]);
}
return 0;
} | 12 |
5,914 | /*
file 1134??
name ???
date 11.5
function ??2?15????????????????????????????????????????????
*/
int main()
{
int a[16], sum = 0, i, j, n = 0;
while(1)
{
for(i = 0; i < 16; i++)
{
cin >> a[i];
if(a[i] == 0)
{
break;
}
else if(a[i] == -1)
{
break;
}
else
{
n++;
}
}
if(a[0] == -1)
{
break;
}
for(i = 0; i < n; i++)
{
for(j = 0; j < n; j++)
{
if(a[i] == a[j] * 2)
{
sum++;
}
}
}
cout << sum << endl;
n = 0; sum = 0;
}
return 0;
} | 12 |
5,915 |
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 |
5,916 |
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 |
5,917 | /*
* 1000010175_mte9.cpp
*
* Created on: 2010-11-14
* Author: ???
* function:1134 ??
*/
int main(){
int iNum[20],i,j,n,iPair;
while(1)
{
iPair=0;
memset(iNum,0,80);
cin>>iNum[0];
n=1;
if(iNum[0]==-1) break;
do //??,????0???
{
cin>>iNum[n];
n++;
}while(iNum[n-1]!=0);
n--; //????0????
for(i=0;i<n;i++) //????,???????????
for(j=0;j<n;j++)
if(iNum[j]==iNum[i]*2)
iPair++;
cout<<iPair<<endl;
}
return 0;
} | 12 |
5,918 | //********************************
//*????? **
//*?????? 1200012988 **
//*???2012.10.30 **
//********************************
int main()
{
double a[16];
while(cin >> a[0])
{
if(a[0] == -1)
break;
else
{
int count = 0, i = 0;
do
{
i++;
cin >> a[i];
}while(a[i] != 0);
for(int j = 0; j < i - 1; j++)
{
for(int k = j + 1; k < i; k++)
{
if((a[k] / a[j] == 2) || (a[j] / a[k] == 2))
count++;
}
}
cout << count << endl;
}
}
return 0;
}
| 12 |
5,919 | int main()
{
int i,j,k,p,s[15];
for(i=0;;i++)
{
k=0;
scanf("%d",&s[0]);
if(s[0]==-1)
break;
for(j=1;;j++)
{
scanf("%d",&s[j]);
if(s[j]==0)
break;
for(p=0;p<j;p++)
if(s[j]==2*s[p]||s[p]==2*s[j])
k++;
}
printf("%d\n",k);
}
return 0;
} | 12 |
5,920 | int main ()
{
int a[20],i,j,k,m;
for(i=0;i<20;i++)
a[i]=1;
while(1)
{
i=0;k=0;
while(a[i]!=0)
{
i++;
scanf("%d",&a[i]);
if(a[1]==-1) return 0;
} m=i;
for(i=1;i<m;i++)
{
for(j=i+1;j<m;j++)
{
if((a[j]==2*a[i])||(a[i]==2*a[j]))
k++;
}
}
printf("%d\n",k);
}
}
| 12 |
5,921 |
int main(int argc, char* argv[])
{
int x[16],a,b,i,k;
while (1)
{
for (i=0;i<16;i++)
{
scanf ("%d",&x[i]);
if (x[i]==0)
{
a=i;
break;
}
}
if (x[0]==-1)
{
break;
}
int s=0;
for (k=0;k<a;k++)
{
for (i=0;i<a;i++)
{
if (x[k]==2*x[i])
{
s++;
}
}
}
printf ("%d\n",s);
}
return 0;
}
| 12 |
5,922 | int main()
{
int a[15], b, n = 0, num = 0;
while (cin >> b)
{
if (b == -1)
break;
else if (b == 0)
{
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])
num++;
n = 0;
cout << num << endl;
num = 0;
}
else
{
a[n] = b;
n++;
}
}
return 0;
} | 12 |
5,923 | int main()
{
int i , j , n , t , m , x , l;
int a[15];
for ( m =1 ; ;m++)
{
for ( x=1 ; x<=16 ; x++)
{
cin>>l;
if (l!=0)
{
a[x-1]=l;
}
else
{
n = x - 1;
t = 0 ;
for ( i=0 ; i<=n-2 ; i++)
{
for ( j=i+1 ; j<=n-1 ; j++)
{
if ((a[i]==2*a[j])||(a[j]==2*a[i]))
t++;
}
}
cout<<t<<endl;
break;
}
}
}
return 0;
} | 12 |
5,924 | //****************************
//**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 |
5,925 | int main()
{
int a[16],i,j,num,flag;
while(1)
{
flag=0;//flag????????0
i=0;
scanf("%d",&a[i]);
if(a[0]==-1)//??????????????????????
break;
else
{
do
{
i++;
scanf("%d",&a[i]);
}while(a[i]!=0);//????????
num=i;//num???????????
for(i=0;i<num;i++)
for(j=i+1;j<num;j++)
if((a[i]==2*a[j])||(a[j]==2*a[i]))
flag++;
printf("%d\n",flag);
}
}
return 0;
}
| 12 |
5,926 | void main()
{
int a[15][17],i,num,j,k,l,h;
scanf("%d",&a[0][0]);
for(j=0;j<=15&&a[j][0]!=-1;j++)
{for(i=1;i<=15&&a[j][i-1]!=0;i++)
scanf("%d",&a[j][i]);
scanf("%d",&a[j+1][0]); }
for(l=0;l<=14&&a[l][0]!=-1;l++)
{num=0;
for(k=0;k<=15&&a[l][k]!=0;k++)
{for(h=0;h<=15&&a[l][h]!=0;h++)
{if(a[l][k]==2*a[l][h]) num++;}}
printf("%d\n",num);}
} | 12 |
5,927 | int main()
{
int c[100][100];
int t;
int n=0;
int m;
int d[100]={0};
int q[100]={0};
int i;
int z=0;
int x=0;
t=0;
do
{
i=0;
do
{
scanf("%d",&c[t][i]);
if(c[t][0]==-1)
{break;}
if(c[t][i]==0)
{break;}
i++;d[t]++;
}while(i<=100);
if(c[t][0]==-1)
{break;}
t++;n++;
}while(t<=100);
do
{
i=0;
do
{
m=0;
do
{
if((c[z][i]*2)==c[z][m])
{q[z]++;}
m++;
}while(m<=d[z]-1);
i++;
}while(i<=d[z]-1);
z++;
}while(z<=n-1);
while(x<=n-1)
{
printf("%d\n",q[x]);
x++;
}
scanf("%d",&t);
return 0;
}
| 12 |
5,928 | int main(){
int a[100][16],i,j,m,p,q;
for(i=0;i<100;i++){
for(j=0;j<16;j++){
scanf("%d",&a[i][j]);
if(a[i][j]<=0) break;
}
m=0;
for(p=0;p<j;p++){
for(q=0;q<j;q++){
if(a[i][q]==2*a[i][p]) m++;
}
}
if(a[i][j]==-1) break;printf("%d\n",m);
}
return 0;
} | 12 |
5,929 | main()
{
int a[16],n,i,j,k;
while(1)
{
n=0;
for(i=0;i<16;i++)
a[i]=0;
scanf("%d",&a[0]);
if(a[0]==-1)
break;
else
{
for(i=1;i<16;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
break;
}
j=i;
for(i=0;i<j-1;i++)
{
for(k=i+1;k<j;k++)
{
if(a[k]==2*a[i]||a[i]==2*a[k])
n++;
}
}
printf("%d\n",n);
}
}
} | 12 |
5,930 | /*
* ???: 1000010191_32_9.cpp
* ??: ???
* ????: 2010-11-12
* ??: ??
*/
int main()
{
int a[17]; //??
int n,s; //??????????
while (cin>>a[1],a[1]!=-1)
{
n=1;
s=0;
while (cin>>a[n+1],a[n+1]!=0) n++;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (a[i]%a[j]==0&&a[i]/a[j]==2)
s++;
cout<<s<<endl;
}
return 0;
}
| 12 |
5,931 | int main(int argc, char* argv[])
{
int num[15],j,k,i,a=0;
while(1){
scanf("%d",&num[0]);
if(num[0]!=-1)
{
i=1;
do{
scanf("%d",&num[i]);
i++;
}while(num[i-1]!=0);
for(j=0;j<i;j++)
{
for(k=j+1;k<i;k++)
{
if(num[k]==num[j]*2||num[j]==num[k]*2)
a++;
}
}
printf("%d\n",a);
a=0;
}
else
break;
}
return 0;
}
| 12 |
5,932 | int main()
{
float a[20];
do
{
int i=1;
do
{
scanf("%d",&a[i]);
if (a[i]==0) break;
else i++;}while (i<=19);
int j,k;
float t;
for (j=1;j<=i-2;j++)
for (k=1;k<=i-1-j;k++)
if(a[k]>a[k+1])
{t=a[k];a[k]=a[k+1];a[k+1]=t;}
int s=0,l,m;
for (l=1;l<=i-2;l++)
for (m=1;m<=i-1;m++)
if(a[m]/a[l]==2)
s=s+1;
if (a[1]>0)
printf("%d\n",s);
}while (a[1]>0);
return 0;
}
| 12 |
5,933 | //???????????????????
//?????11.3
//????wayne
int main()
{
int n,a[16],i,t,m,j,k,sum;
while (cin>>t)
{
if (t!=-1) //??????????
{
a[1]=t;
i=1;
while (cin>>m)
{
if (m!=0) //????????????
{
i=i+1;
a[i]=m; //??????????????????
}
else break; //???????
}
sum=0;
for (j=1;j<=i;j++)
for (k=1;k<=i;k++)
{
if (a[k]==2*a[j]||a[k]==0.5*a[j]) //??????????????
sum=sum+1; //???????1
}
cout<<sum/2<<endl; //??????????????2
}
else {cout<<endl;break;} //?-1??????
}
return 0;
} | 12 |
5,934 | /*
* file : 1.cpp
* author : ??? 1200012911
* time ?2012.10.29
* function : ????
*/
int main()
{
int a[17] = {0}, count; //????????
int i, j, k, two, num;
for (k = 1; ; k++)
{
count = 0; //?????
for (i = 1; i <= 16; i++)
{
cin >> a[i];
if (a[1] == -1 || a[i] == 0)
{
num = i; //????????
break;
}
}
if (a[1] == -1)
break; //?????-1????
for (i = 1; i < num; i++)
{
two = 2 * a[i]; //????????
for (j = 1; j < num; j++)
if (two == a[j]) //?????
{
count++;
break;
}
}
cout << count << endl;
}
return 0;
} | 12 |
5,935 | void main()
{
int a[100][16]={0},b[100]={0},n[100]={0},i,j,k;
int m=0;
for(i=0;i<100;i++)
{
scanf("%d",&a[i][0]);
if(a[i][0]==-1)
{
break;
}
if(a[i][0]!=-1)
{
m=m+1;
n[i]++;
for(j=1;j<16;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]!=0)
{
n[i]=n[i]+1;
}
if(a[i][j]==0)
{
break;
}
}
}
}
for(i=0;i<m;i++)
{
for(j=0;j<n[i];j++)
{
for(k=0;k<n[i];k++)
{
if(a[i][j]==2*a[i][k])
{
b[i]=b[i]+1;
}
}
}
}
for(i=0;i<m;i++)
{
printf("%d\n",b[i]);
}
}
| 12 |
5,936 |
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 |
5,937 | // 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;
}
| 12 |
5,938 |
int main(){
int su[17]={1};
int c[100];
int i,a,b,d,e=0;
for(i=0;i<100;i++){
c[i]=0;}
for(d=0;d<100;d++){
a=0;
for(i=1;su[i-1]!=0;i++){
scanf("%d",&su[i]);
if(su[i]==-1){
e=1;
break;
}
a=a+1;
}
if(e){break;}
for(i=1;i<a;i++){
for(b=1;b<a;b++){
if(su[i]==2*su[b]){
c[d]+=1;}
}
}
}
for(i=0;i<d;i++){
printf("%d\n",c[i]);}
return 0;
} | 12 |
5,939 | 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 |
5,940 | int main()
{int a[100][15],i,j,k,l;
for(i=0; ;i++)
{cin>>a[i][0];
if(a[i][0]==-1) break;
else
{int n=0;
for(j=1; ;j++)
{cin>>a[i][j];
if(a[i][j]==0) break;}
for(k=0;k<=j-1;k++)
for(l=0;l<=j-1;l++)
if(a[i][k]==2*a[i][l]) n=n+1;
cout<<n<<endl;}
}
return 0;
}
| 12 |
5,941 | int main()
{ int a[500];
int i,j,n,ans;
for(;scanf("%d",&a[0]),a[0]!=-1;)
{
for(n=1;scanf("%d",&a[n]),a[n]!=0;n++);
ans=0;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++) if (a[i]==a[j]*2) ans++;
printf("%d\n",ans);
}
return 0;
}
| 12 |
5,942 | /*
* 1000012761_xiaoceyan9.cpp
*??2?15????????????????????????????????????????????
????1 4 3 2 9 7 18 22???????3???2?1????4?2????18?9????
* Created on: 2010-11-16
* Author: 378073652
*/
int main(){
int a[20][20],i,j,b[20],s,n=0,k;
for(i=0;i<20;i++){
for(j=0;j<16;j++){
cin>>a[i][j];
if(a[i][0]==-1) break;
if(a[i][j]==0){ b[i]=j;break;}
}
if(a[i][0]==-1) break;
}
s=i;
for(i=0;i<s;i++){
for(j=0;j<b[i];j++){
for( k=j+1;k<b[i];k++){
if(((a[i][j]%a[i][k]==0)&&(a[i][j]/a[i][k]==2))||((a[i][k]%a[i][j]==0)&&(a[i][k]/a[i][j]==2)))
n=n+1;
}
}
cout<<n<<endl;
n=0;
}
return 0;
}
| 12 |
5,943 | int main()
{
int a[101][16],b[100]={0},c[101],k,i,j,l,m;
for (i=1;i<=100;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 |
5,944 | void main()
{
int c[16];
int i,j,k,num;
for(;c[0]!=(-1);)
{ num=0;
scanf("%d",&c[0]);
if(c[0]==(-1)) break;
for(i=1;i<16;i++)
{
scanf("%d",&c[i]);
if(c[i]==0) break;
}
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(2*c[k]==c[j]) {num+=1;}
}
}
printf("%d\n",num);
}
} | 12 |
5,945 |
int main()
{
int i,k,j;
int count=0;
int sz[16]={0};
for(i=0;i<16;i++){
scanf("%d",&sz[i]);
if(sz[i]==0){
for(k=0;k<i-1;k++){
for(j=k+1;j<i;j++){
if(sz[k]==2*sz[j]||sz[k]*2==sz[j]){
count++;
}
}
}
printf("%d\n",count);
count=0;
i=-1;
}
if(sz[i]==-1){
break;
}
}
return 0;
}
| 12 |
5,946 | int main(int argc, char* argv[])
{
int x1,x2,n[15],y;
int i;
int t;
while(1){
//?0?8?0?1?0?8?0?5?0?1?0?7?0?4?0?4?0?8?0?5?0?6?0?6
i=0;
while(1){
scanf("%d",&t);
if(t==-1){
return 0;
}
if(t==0)
break;
else{
n[i]=t;
i++;
}
}
y=0;
for(x1=i-1;x1>=0;x1--){
for(x2=x1-1;x2>=0;x2--){
if( n[x1]==n[x2]*2 || n[x2]==n[x1]*2 )
y+=1;
}
}
printf("%d\n",y);
}
return 0;
} | 12 |
5,947 | //**************************************
//*?????? *
//*??????????? *
//*?????? *
//*?????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 |
5,948 | int main()
{
int a[16],i,j,k,s;
while(1)
{
s=0;
for(i=0;;i++)
{
scanf("%d",&a[i]);
if(a[i]==-1)return 0;
else if(a[i]==0)break;
}
for(j=0;j<=i-1;j++)
for(k=0;k<=i-1;k++)
if(a[j]==a[k]*2)
{s++;break;}
printf("%d\n",s);
}
} | 12 |
5,949 | //********************************
//*????? **
//*?????? 1300012713 **
//*???2013.10.30 **
//********************************
int main()
{
int m, n, num, a[15]; //??????m????????n??????num???a[15]
while (cin >> m) //???????
{
if (m == -1) return 0; //????-1??????
else //???m????????
{
int n = 1;
num = 0;
a[0] = m;
for(int i = 1; ; i++) //??????
{
cin >> a[i];
if(a[i] == 0) break; //????0?????????0
if(a[i] != 0) n = n + 1;
}
for(int j = 0; j <= n; j++) //????????
{
for(int k = j+1; k <=n; k++)
{
if(a[j] == 2 * a[k] || a[k] == 2 * a[j])
num = num + 1; //????
}
}
cout << num << endl; //????
}
}
}
| 12 |
5,950 | int main(){
int a[16],i,m=0,j,k=0;
while(cin>>a[0]){
if(a[0]==-1)break;
for(i=1;i<16;i++){
cin>>a[i];
if(a[i]==0){
m=i;
break;}}
for(i=0;i<=m;i++)
for(j=0;j<=m;j++){
if(i==j) continue;
if(a[i]==2*a[j])
k++;
else continue;
}
cout<<k<<endl;
k=0;
}
return 0;} | 12 |
5,951 | int main()
{
float a[16];
int i,j,n,t;
for(i=0;i<100;i++)
{
n=0;
t=0;
scanf("%f",&a[0]);
if(a[0]==-1) break;
n=n+1;
for(j=1;j<16;j++)
{
scanf("%f",&a[j]);
if(a[j]==0) break;
n=n+1;
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if (a[j]==a[i]*2||a[j]==0.5*a[i])
t++;
}
printf("%d\n",t);
}
return 0;
}
| 12 |
5,952 | int main()
{
char s[100];
for(;;)
{
gets(s);
int i,j,k=0,m=0,x[15],n=0;
if(s[0]=='-'&&s[1]=='1')
break;
else
{
for(i=0;;i++)
{
if(s[i]=='0')
break;
else
{
if('1'<=s[i]&&s[i]<='9')
{
j=s[i]-'0';
k=k*10+j;
}
else
{
x[m]=k;
m++;
k=0;
}
}
}
}
for(i=0;i<m;i++)
for(j=i+1;j<m;j++)
{
if((x[i]/x[j]==2&&x[i]%x[j]==0)||(x[j]/x[i]==2&&x[j]%x[i]==0))
{ n++;}
}
printf("%d\n",n);
}
return 0;
}
| 12 |
5,953 | int main()
{
int a;
cin>>a;
while(a!=-1)
{
int s[15]={0};
int l=1,m=0;
s[0]=a;
do
{
cin>>a;
s[l]=a;
l++;
}while(a!=0);
for(int i=0;i<15;i++)
for(int j=0;j<15;j++)
if(s[j]==2*s[i]&&s[i]!=0)
m++;
cout<<m<<endl;
cin>>a;
}
return 0;
}
| 12 |
5,954 | //**************************
//*????? *
//*???????? *
//*???1000012832 *
//**************************
int main()
{
int a[16] ,i,j,k,m,n,count;//????
for(i=0;;i++)
{
cin>>m; //??????
if(m==-1) //???1???????
{
break;
}
else //????1?????????????
{
count=0;
a[0]=m;
for(j=1;j<16;j++) //???????????
{
cin>>a[j];
if(a[j]==0) //???0
{
break; //?????
}
}
n = j; //???j-1???
for(j=0;j<n;j++)
{
for(k=j+1;k<n;k++)
{
if(a[j]==2*a[k]||a[k]==2*a[j])//?????????2?????????????????1
{
count++;
}
}
}
cout<<count<<endl;//??????
}
}
return 0;
} | 12 |
5,955 | int main()
{
int i,j,k,a[16],num;
while(scanf("%d",&a[0]),a[0]+1)
{
i=1;
num=0;
while(scanf("%d",&a[i]),a[i])
{
i++;
}
for(j=0;j<i;j++)
{
for(k=j+1;k<i;k++)
{
if(a[j]==2*a[k]||a[k]==2*a[j])
{
num++;
}
}
}
printf("%d\n",num);
}
return 0;
} | 12 |
5,956 | int main()
{
char c;
int num[1000]={0},n,m=0,index=0,i,j;
while(num[0]!=-1)
{
while(true)
{
scanf("%d",&num[index]);
index++;
scanf("%c",&c);
if(c!=' ')
break;
}
for(i=0;i<index;i++)
{
for(j=0;j<index;j++)
{
if(num[i]==2*num[j]||num[i]*2==num[j])
m++;
}
}
if(num[0]==-1)
{
return 0;
}
printf("%d\n",m/2);
m=0;index=0;
}
}
| 12 |
5,957 | main()
{
int i,j,k,num=0,tot,a[16],b[1000];
do
{
i=0;
tot=0;
do
{
scanf("%d",&a[i]);
i++;
}
while (a[i-1]>0);
if (a[0]!=-1)
{
for (j=0;j<=i-3;j++)
for (k=j+1;k<=i-2;k++)
if (a[j]==2*a[k]||a[k]==2*a[j]) tot++;
b[num]=tot;
num++;
}
}
while (a[0]!=-1);
for (i=0;i<num;i++)
printf("%d\n",b[i]);
return 0;
} | 12 |
5,958 | /*
* 1.cpp
*
* Created on: 2010-10-17
* Author: lenovo
*/
int main ()
{
int i,j,a[17],t,sum;
do{
t = -1;sum = 0;
for (i=1;i<=16;i++)
{ cin>>a[i];
t++;
if (a[i]==0||a[i]==-1)
break;
}
for (i=1;i<=t;i++)
for (j=1;j<=t;j++)
{
if (a[j]==a[i]*2)
sum++;
}
if (a[1]!=-1)
cout<<sum<<endl;
}
while (a[1]!=-1);
return 0;
}
| 12 |
5,959 | 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 |
5,960 | 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 |
5,961 | int main()
{
int a[16],i,j,k,count,n;
for(i=0;i<16;i++)
{
count=0;
n=0;
for(j=0;j<16;j++)
{
scanf("%d",&a[j]);
if(a[0]==-1)
break;
if(a[j]==0)
break;
count++;
}
if(a[0]==-1)
break;
for(j=0;j<count;j++)
{
for(k=0;k<count;k++)
{
if(a[k]==2*a[j])
n++;
}
}
printf("%d\n",n);
}
return 0;
} | 12 |
5,962 | //******************************
//* author ?? 1200012955 **
//* date 2012.10.29 **
//* description ?? **
//******************************
int main()
{
int i, j, k, num; //i,j,k?????num???????????
double a[16];
do //?????????
{
for (i = 0; i <=15; i++) //??????????
{
a[i] = 0;
}
num = 0; //???num
for (i = 0; i <=15; i++) //????
{
cin >> a[i];
if (a[i] == 0 || a[0] == -1) //????0?????????????????????-1???????
{
break;
}
}
if (a[0] == -1) //??????-1?????
{
break;
}
for (j = 0; j <= i -1; j++)
{
for (k = j + 1; k <= i - 1; k++)
{
if (a[j] == 2 * a[k] || a[j] == a[k] / 2.0) //??????????
{
num = num + 1; //?????
}
}
}
cout << num << endl;
}
while(1);
return 0;
} | 12 |
5,963 | int main()
{
int n[25], i, j, count;
while (cin >> n[1], n[1] != -1)
{
count = 0;
for (i = 2; cin >> n[i], n[i] != 0; i++)
{
for (j = 1; j < i; j++)
{
if (n[i] == 2 * n[j] || n[i] * 2 == n[j])
{
count++;
}
}
}
cout << count << endl;
}
return 0;
} | 12 |
5,964 | 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 |
5,965 | int main()
{
int a[16],b[16],c=0,i,j,k;
for(i=0;i<=15;i++)
{
cin>>a[i];
if(a[i]==-1)
break;
if(a[i]!=0)
{
if(a[i]%2==0)
b[i]=a[i]/2;
else
b[i]=-1;
}
else
{
for(j=0;j<=i-1;j++)
{
for(k=0;k<=i-1;k++)
{
if(k==j)
continue;
if(a[k]==b[j])
c++;
}
}
cout<<c<<endl;
for(j=0;j<=i;j++)
{
a[j]=0,b[j]=0;
}
c=0,i=-1;
}
}
return 0;
}
| 12 |
5,966 | /********************************************
*@file 1.cpp *
*@author ?? *
*@date 2013-10-27 *
*@description *
*??????6??? *
********************************************
*/
int main()
{
int num[101], number, i, j, count = 0;
while (1)
{
cin >> number;
if (number == -1)
break;
for (i = 1; ; i++)
{
num[0] = number;
cin >> num[i];
for (j = 0; j < i; j++)
{
if (num[j] > num[i] && num[j] == (num[i] * 2))
count++;
if (num[i] > num[j] && num[i] == (num[j] * 2))
count++;
}
if (num[i] == 0)
break;
}
cout << count << endl;
count = 0;
}
return 0;
} | 12 |
5,967 | main()
{int n=0,i=0,j=0,k=0,a[16]={0},b[16];
do{i=0;k=0;
scanf("%d",&a[0]);
b[0]=2*a[0];
if(a[0]==-1)
break;
else
do
{
i++;
scanf("%d",&a[i]);
b[i]=2*a[i];
}while(a[i]!=0);
n=i-1;
for(i=0;i<=n;i++)
{for(j=0;j<=n;j++)
{if(a[i]==b[j])
k++;}
}
printf("%d\n",k);
}while(1);
} | 12 |
5,968 | /**
* @file 1000012834_002homework.cpp
* @author ???
* @date 2010-11-3
* @description
* ???????1134 ??
*/
int main()
{ //?????
int i , j , ii , t , flag; //???????????????????
int a[ 2000 ]; //????
while (1) //?????-1????????
{
t = 0; //?????
flag = 1;
i = 1;
while (flag == 1) //?????????0????
{
cin >> a[ i ++]; //????????
if (a[ i - 1 ] == 0) //????????????
flag = 0;
else
if (a[ i - 1 ] == -1) //????-1??????????
return 0;
}
/* i = 1;
while ((a[i] = cin.get()) != '-1')
{
a[i] -= 48;
i ++;
t = 0;
cin.get();
while ((a[i++] = cin.get()) != '0')
{ a[i - 1] -= 48;
cin.get();
}
**/
i -= 1; //????i????????????0
for (j = 1; j < i; j++) //??????????,????i++???????-1
{
if (a[ j ] % 2 == 0) //???????????
{
for (ii = 1; ii < i; ii++) //????????????????
{
//??????????????
if (a[ ii ] * 2 == a[ j ])
t ++; //???????????1
}
}
}
cout << t << endl; //?????????????
}
return 0;
} //?????
| 12 |
5,969 |
int main()
{
int num[101],ori[15];
int n,i,count,tot;
scanf("%d",&n);
while(n!=-1)
{
for(i=0;i<101;i++) num[i]=0;
count=0;
while(n!=0)
{
ori[count]=n;
count++;
num[n]=1;
scanf("%d",&n);
}
tot=0;
for(i=0;i<count;i++)
if (ori[i]<=50&&num[ori[i]*2]) tot++;
printf("%d\n",tot);
scanf("%d",&n);
}
return 0;
}
| 12 |
5,970 | int main()
{
int a[16];
int i = 0, n = 0, j, k, m;
for (m = 1; ; m++)
{
i = 0;
n = 0;
while (cin >> a[i])
{
if (a[i] == 0 || a[i] == -1)
{
break;
}
else
{
i++;
}
}
if (a[0] == -1)
{
break;
}
for (j = 0; j < i - 1; j++)
for (k = j + 1; k <= i - 1; k++)
{
if (a[k] == 2 * a[j] || a[j] == 2 * a[k])
{
n++;
}
}
cout << n << endl;
}
return 0;
} | 12 |
5,971 | int main(int argc, char* argv[])
{ int a[100][15],i=0,j=0,x=10,k=0,m,num=0;
for(i=0;i<100;i++){
if(x==-1)break;
for(j=0;j<16;j++){
scanf("%d",&x);
if(x==-1)break;
if(x==0)break;
a[i][j]=x;
}
}
k=i;
for(i=0;i<k-1;i++){
for(j=0;j<15;j++){
for(m=j+1;m<15;m++){
if(a[i][j]*1.0/a[i][m]==2||a[i][m]*1.0/a[i][j]==2)num++;
}
}
printf("%d\n",num);
num=0;
}
return 0;
}
| 12 |
5,972 | int main()
{
int n,a[15],m=0,s,h,t;
scanf("%d",&t);
while((t+1)!=0)
{
for(n=0,s=0;t!=0;n++)
a[n]=t,s++,scanf("%d",&t);
for(n=0;n<s;n++)
{
for(h=0;h<s;h++)
{
if(a[n]==2*a[h])m++;
}
}
printf("%d\n",m);
m=0;
scanf("\n%d",&t);
}
return 0;
} | 12 |
5,973 | void main(){
int x[16], i, j, g, n, m;
for(j=0;;j++){
for(i=0,n=0;i<16;i++){
scanf("%d", &x[i]);
if(x[i]==0)break;
}
if(x[0]==-1)break;
g=i;
for(i=0; i<g; i++){
for(m=0;m<g;m++){
if((float)x[i]==x[m]*2)n++;
}
}
printf("%d\n", n);
}
} | 12 |
5,974 | //******************************************************
//* ? ? ? ?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 |
5,975 | int main()
{
int n[100][100],i,k,j,s[100],t,p,m,l[100];
double a;
for(i=0;i<100;i++)
{
scanf("%d",&n[i][0]);
if(n[i][0]==-1) break;
else
{
for(j=1;j<100;j++)
{
scanf("%d",&n[i][j]);
if(n[i][j]==0) break;
l[i]=j;
}
}
}
for(k=0;k<i;k++)
{
s[k]=0;
for(t=0;t<=l[k];t++)
{
for(m=t;m<=l[k];m++)
{
a=(double)n[k][t]/n[k][m];
if(a==2||a==0.5) s[k]=s[k]+1;
}
}
}
for(p=0;p<i;p++)
printf("%d\n",s[p]);
return 0;
} | 12 |
5,976 |
int main()
{
int a[16] = {0}, i, j, count;
cin >> a[0];
while (a[0] != -1)
{
count = 0;
for (i = 1; ; i++ )
{
cin >> a[i];
if (a[i] == 0)
{
break ;
}
}
for (i = 0; a[i] != 0; i++ )
{
for (j = 0; a[j] != 0; j++ )
{
if (a[i] == 2 * a[j])
{
count ++ ;
}
}
}
cout << count << endl;
cin >> a[0];
}
return 0;
}
| 12 |
5,977 | int find(int *x,int y,int z)
{
int count=0;
for(int i=0;i<y;i++)
{if(x[i]==z) count++;}
return count;
}
int count(int *x,int y)
{
int count1=0;
for(int i=0;i<y;i++)
{count1+=find(x,y,2*x[i]);}
return count1;
}
int main()
{
int temp[16];
int len=0;
scanf("%d",&temp[len]);
while(temp[len]!=-1)
{
while(temp[len]!=0)
{len++;
scanf("%d",&temp[len]);
}
printf("%d\n",count(temp,len));
scanf("%d",&temp[0]);
len=0;
}
return 0;
}
| 12 |
5,978 |
int num[15][20]={0};
int main()
{
int i,j,k;
int div(int);
for(i=0,j=0;;)
{
scanf("%d",&num[i][j]);
if(num[i][j]==-1) break;
if(num[i][j]==0)
{
j=0;
i++;
continue;
}
j++;
}
for(k=0;k<i;k++)
printf("%d\n",div(k));
return 0;
}
int div(int n)
{
int i,j,k=0;
for(i=0;num[n][i];i++)
for(j=i;num[n][j];j++)
if(num[n][i]==2*num[n][j] || num[n][j]==2*num[n][i])
{
k++;
}
return k;
}
| 12 |
5,979 | //***************************************************
//1.cpp ?? ******
//?? ??? 1200018209 ********
//?? 2012-10-29 ******
//***************************************************
int main()
{
int a[100],j,k,l,sum=0;
for(;;)
{
for(j=0;;j++)
{
cin >> a[j];
if(a[j]==0||a[j]==-1)break;
}
if(a[0]==-1)break;
for(k=0;k<j-1;k++)
{
for(l=k+1;l<=j-1;l++)
{
if(a[k]==2*a[l]||a[l]==2*a[k])
{
sum++;
}
}
}
cout << sum << endl;
sum=0;
}
return 0;
} | 12 |
5,980 |
void main()
{
int a[16],n,i,j,sum=0;
a[0]=1;
while(1){
for(i=1;a[i-1]!=0;i++){
scanf("%d",&a[i]);
if(a[1]==-1) goto end;
}
n=i-1;
for(i=1;i<n;i++){
for(j=1;j<n;j++){
if(i==j) continue;
if(a[i]==2*a[j]) sum++;
}
}
printf("%d\n",sum);
for(i=1;i<16;i++)
a[i]=0;
sum=0;
}
end:;
} | 12 |
5,981 | 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 |
5,982 | //********************
//**????? **
//**????? **
//**???2013.10.30**
//**????1.cpp **
//********************
int main()
{
int i, j, k, m;
for (i = 1; ; i++) // ?????????????
{
int num[16]; // ??1??16????????
for (j = 1; ;j++) // ????????????
{
cin >> num[j]; // ??????
if (num[j] == 0) // ?????0
break; // ?????
}
if (num[1] == -1) // ????-1
break; // ??????
int cnt = 0; // ??????cnt????2?????
for (k = 1; k <= j - 1; k++)
for (m = 1; m <= j- 1; m++)
{
if (num[k] * 2 == num[m]) // ?????????????????
cnt++; // cnt?1
}
cout << cnt << endl; // ??cnt
}
return 0;
} | 12 |
5,983 | /*
??
??2?15????????????????????????????????????????????
????1 4 3 2 9 7 18 22???????3???2?1????4?2????18?9????
????
??????????????????????2?15????????100?????
?????????0??????????????????2?15????????
??????????????-1,???????????????????
????
????????????????????????????????????
?? 1000012760
*/
int main(){
int a[16], i= 0, j= 0, n= 0, Two;
for(i= 0; i< 16; i++){
a[i]= 0;
}
while(1> 0){
n= 0;
Two= 0;
for(i= 0; i< 16; i++ ){
cin>>a[i];
if((a[i]== 0) || (a[0]== -1)) break;
else n++;
}
if(a[0]== -1) break;
for (i= 0; i< n; i++){
for(j= i+ 1; j< n; j++){
if((a[i]== (2* a[j])) || (a[j]== (2* a[i]))){
Two++;
}
}
}
cout<<Two<<endl;
}
return 0;
} | 12 |
5,984 | /**
* @file 1.cpp
* @author ???
* @date 2013-10-30
* @description
* ?????????
*/
int main()
{
int a[16] = {0}; // ??????????????0
int sum = 0; // ?????????????sum?????0
do
{
sum = 0;
cin >> a[0];
if (a[0] == -1) break; // ?????????????-1??????
for (int i = 1; i <= 15; ++i) // ??????????????
{
cin >> a[i];
if (a[i] == 0) break; // ???????0????????
}
for (int m = 0; m <= 13; ++m) // ????????????
{
if (a[m + 1] == 0) break;
for (int n = m + 1; n <= 14; ++n)
{
if (a[n] == 0) break;
if (a[m] == 2 * a[n] || a[n] == 2 * a[m]) ++sum;
}
}
cout << sum << endl; // ????
} while (1);
return 0;
} | 12 |
5,985 | //********************************
//*????? **
//*?????? 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 |
5,986 | int main()
{
int a[16];
int i,j,k,l;
while(scanf("%d",&a[0])&&a[0]!=-1)
{ l=0;
if(a[0]!=0)
{
for(i=1;a[i-1]!=0;i++)
{
scanf("%d",&a[i]);
}
for(j=0;j<=i-1;j++)
for(k=0;k<j;k++)
if(a[k]==2*a[j]||a[j]==2*a[k]) l++;
printf("%d\n",l);
}
else printf("%d\n",l);
}
return 0;
}
| 12 |
5,987 | //***************************
//**???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 |
5,988 | int main()
{
int i=0,j=0,k=0;
int a[16];
for(;;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{
printf("%d\n",k);
i=-1;
k=0;
}
if(a[0]==-1)
break;
for(j=0;j<i;j++)
if(a[i]==a[j]*2||a[j]==a[i]*2)
k++;
}
} | 12 |
5,989 | int main()
{
int a[16], i, j, k, m = 1, num = 0;
while (cin >> a[0])
{
num = 0;
m = 1;
if (a[0] == -1) break;
else
{
for (i = 1; i < 16; i++, m++)
{
cin >> a[i];
if (a[i] == 0) break;
}
for (j = 0; j < m; j++)
{
for (k = 0; k < m; k++)
{
if (k == j) continue;
if ( (a[k] == 2 * a[j]) || (a[j] == 2 * a[k]) )
{
num++;
}
}
}
cout << num / 2 << endl;
}
}
return 0;
}
| 12 |
5,990 | int main()
{
int n[10000],m[15];
int *p;
int i,j,k=0,total,all=0,sum=0,q,t;
p=&n[0];
for(i=0;;i++)
{
scanf("%d",&n[i]);
if(n[i]==0)
{
all++;
}
if(n[i]==-1)
{
break;
}
}
while(all>0)
{
for(i=0,t=0;n[k]!=0;i++,k++)
{
m[i]=n[k];
t++;
}
k=k+1;
total=0;
for(q=0;q<t;q++)
{
for(j=0;j<t;j++)
{
if((m[q]/m[j]==2)&&(m[q]%m[j]==0))
{
total++;
}
}
}
printf("%d\n",total);
all--;
}
return 0;
} | 12 |
5,991 | int main()
{
int a[18],m,i=0,j=0,k=0,l=0,n=0;
for(n=0;;n++)
{
scanf("%d",&a[0]);
if(a[0]==-1)
break;
else
{
for(i=1;;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
{m=i-1;break;}
}//??a[i]
i=0;
for(i=0;i<=m;i++)
{
for(j=0;j<=m;j++)
{
if(a[j]==(2*a[i]))
k++;
}
l=l+k;k=0;//printf("%d\n",l);
}//????a[i],???a[i]??
printf("%d\n",l);
l=0;
}
}
return 0;
} | 12 |
5,992 | //****************************************
//*??? ?? **
//*?????? **
//*???2011.10.21 **
//****************************************
int main()
{
int a[20],k=0,i,w,y,n,p; //k????
while(1)
{
cin >> p;
if(p == -1) //????-1,?????
break;
else
{ a[0]=p;
for(i=1; ;i++)
{
cin >> a[i];
if(a[i]==0)
{
n=i-1;
break;
}
}
for(w=0;w<=n;w++)
{
for(y=0;y<=n;y++)
{
if(a[y]==2*a[w])
k++;
}
}
cout << k << endl;
i=0;
k=0;
}
}
return 0;
}
| 12 |
5,993 | int main()
{
int x[100][16];
int sum[100]={0};
float y;
int i,j,k;
for(j=0;j<100;j++)
{
for(i=0;i<16;i++)
{
scanf("%d",&x[j][i]);
if(x[j][0]==-1)
goto loop;
if(x[j][i]==0)
break;
}
}
loop:for(j=0;j<100;j++)
{
if(x[j][0]!=-1)
{
for(i=0;i<16;i++)
{
if(x[j][i]==0)
break;
for(k=0;k<16;k++)
{
if(x[j][k]==0)
break;
y=1.0*x[j][i]/(1.0*x[j][k]);
if(y==2)
sum[j]=sum[j]+1;
}
}
printf("%d\n",sum[j]);
}
if(x[j][0]==-1)
break;
}
return 0;
} | 12 |
5,994 | void main()
{
int k,i,j,n,m;
int a[15];
scanf("%d",&k);
while(k!=-1)
{
n=0;
m=0;
i=0;
while(k!=0)
{
n++;
a[i]=k;
i++;
scanf("%d",&k);
}
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
if(a[i]==2*a[j]||a[j]==2*a[i])
{
m++;
}
}
printf("%d\n",m);
scanf("%d",&k);
}
} | 12 |
5,995 | /**?????
*???2010/11/5
*??????
*???1000010449
*/
int main()
{
int a[16], len, count, i, j;
while (1)
{
cin >> a[0];
if (a[0] == -1)
{
break;
}
len = 0;
do
{
len++;
cin >> a[len];
}while (a[len] != 0);
count = 0;
for (i = 0; i < len; i++)
{
for (j = 0; j < len; j++)
{
if (j == i)
{
continue;
}
else
{
if (a[j] == (2 * a[i]))
count++;
}
}
}
cout << count << endl;
}
return 0;
}
| 12 |
5,996 |
int main ()
{
int z[15],r[100];
int i,j,l;
int sum=0;
for(i=0;;i++)
{
scanf("%d",&z[i]);
if(z[i]==0)
{
r[sum]=0;
for(j=0;j<i-1;j++)
{
for(l=j+1;l<i;l++)
{
if(z[j]==2*z[l]||z[j]==0.5*z[l])
{
r[sum]++;
}
}
}
sum++;
i=-1;
}
else if(z[i]==-1)break;
}
for(i=0;i<sum;i++)
{
printf("%d\n",r[i]);
}
return 0;
} | 12 |
5,997 | int a[15];
int main()
{
int num, doub;
char b;
int comp_with_zero;
for (; 1;)
{
num = 0;
doub = 0;
comp_with_zero = 1;
b = 'a';
for (int ai = 0; ai < 15; ai++)
{
a[ai] = 0;
}
for (; 1;)
{
b = cin.get();
if ((b == '0') && (a[num] == 0))
{
break;
}
if ((b - '0' < 10) && (b - '0' >= 0))
{
a[num] *= 10;
a[num] += (b - '0');
}
else
{
if (b == ' ')
{
a[num] *= comp_with_zero;
num += 1;
comp_with_zero = 1;
}
if (b == '-')
{
comp_with_zero = -1;
}
}
}
for (int i = 0; i <= num; i++)
{
for (int ii = i; ii <= num; ii++)
{
if (a[i] == 0)
break;
if ((a[i] % 2 == 0) && (a[i] / 2 == a[ii]))
{
doub += 1;
}
if ((a[ii] % 2 == 0) && (a[ii] / 2 == a[i]))
{
doub += 1;
}
}
}
cout << doub << endl;
}
return 0;
}
| 12 |
5,998 | int main()
{int a[16],i,j,t,k;
for(i=0;;i++)
{ for(j=0;j<=15;j++)
{scanf("%d",&a[j]);if(a[j]==0) break;
if(a[0]==-1) {printf("\n");return 0;}
}
for(j=0,t=0;j<=14;j++)
{ for(k=j+1;k<=15;k++)
{
if(a[k]!=0&&a[j]!=0&&(2*a[j]==a[k]||2*a[k]==a[j]))
t=t+1;
}
a[j]=0;
}
printf("%d\n",t);
}
printf("\n");
return 0;
} | 12 |
5,999 | //******************************************
//* ??????? *
//* ?????? *
//* ???1200012764 *
//* ???2012/10/29 *
//******************************************
int main()
{
int a, t, i;
while (1)
{
a = 0;
t = 0;
cin >> a;
if (a == -1)
{
break;
}
int num[17] = {0};
num[1] = a;
for (i = 2; i <= 16; i++)
{
cin >> num[i];
if (num[i] == 0)
{
break;
}
}
for (int r = 1; r <= (i - 1); r++)
{
for (int s = 1; s <= (i - 1); s++)
{
if (num[r] == 2 * num[s])
{
t = t + 1;
}
}
}
cout << t << endl;
}
return 0;
}
| 12 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.