label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
---|---|---|
12 | 5700 | int main()
{
int a[16],i,j,s,t;
for(;;)
{s=0;
scanf("%d",&a[0]);
if(a[0]==-1)break;
for(i=1;;i++)
{scanf("%d",&a[i]);
if(!a[i])break;}
t=i;
for(i=0;i<t;i++)
for(j=0;j<t;j++)
if(a[j]==(2*a[i]))
s+=1;
printf("%d\n",s);}
} |
12 | 5701 |
int main(int argc, char* argv[])
{
int num[15];
int i,m;
for(i=0;i<15;i++)
{scanf("%d",&num[i]);
{if(num[i]==0)
break;}
i++;
}
int j=0;
int a;
m=i;
i=a=0;
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{if(num[i]/num[j]==2&&num[i]%num[j]==0)
a++;}
}
printf("%d\n",a);
return 0;
} |
12 | 5702 | int main(int argc, char* argv[])
{
int a[16]={0};
int i,j,k;
int num=0;
for(i=0;;i++){
scanf("%d",&a[i]);
if(a[i]==0){
for(j=0;j<i-1;j++)
for(k=j+1;k<i;k++)
{
if(a[j]==2*a[k]||2*a[j]==a[k])
num++;
}
printf("%d\n",num);
num=0;
i=-1;
}
if(a[i]==-1)
break;
}
return 0;
}
|
12 | 5703 | 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 | 5704 | int main()
{
int a[20]; //????
int i, cnt;
i = 0; //???
cnt = 0;
cin >> a[i]; //????????
while ( a[i] != -1 ) //?????????-1.??????
{
while ( a[i] != 0 ) //?????????0??????????0??
{
i++;
cin >> a[i];
} //?????????i+1??
for ( int j = 0; j <= i; j++ ) //??????????????????cnt?1
{
for ( int k = 0; k <= i; k++ )
{
if ( a[k] == 2 * a[j] )
cnt++;
}
}
cout << cnt - 1 << endl; //????????????0?????????0=2*0????
i = 0;
cnt = 0;
cin >> a[i]; //????????
}
return 0;
}
|
12 | 5705 |
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 | 5706 | //****************************************
//*????? **
//*?????? 1100012763 **
//*???2011.10.20 **
//****************************************
int main()
{
int i , j , t , count , ans; //count??????????ans???
int num[17];
while (1) //?????????-1?break
{
i = 1;
cin >> num[i];
if (num[i] == -1)
break;
ans = 0;
do //???????????0
{
i++;
cin >> num[i];
} while (num[i] != 0);
count = i - 1; //0??????
for (i = 1; i <= count - 1; i++) //????????????????
for (j = 1; j <= count - i; j++)
{
if (num[j] > num[j + 1])
{
t = num[j];
num[j] = num[j + 1];
num[j + 1] = t;
}
}
for (i = 1; i <= count -1; i++) //??
for (j = i + 1; j <= count; j++)
{
if (num[i] * 2 == num[j]) //??2??ans+1???????
{
ans++;
break;
}
else
{
if (num[i] * 2 < num[j]) //????2???????????2????????????
break;
}
}
cout << ans << endl; //?????
}
return 0;
}
|
12 | 5707 | int main()
{printf("3\n");printf("2\n");printf("0\n");printf("0\n");printf("1\n");printf("1\n");printf("0\n");printf("2\n");printf("2\n");printf("6\n");printf("11\n");return 0;} |
12 | 5708 | void main()
{
int i,j,k,a[16],s,q;
do
{
scanf("%d",&q);
a[0]=q;
if(q==-1) break;
for(i=1;i<=15;i++)
{
scanf("%d",&a[i]);
if (a[i]==0) break;
}
s=0;
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(a[j]==2*a[k]) s=s+1;
else s=s;
}
}
printf("%d\n",s);
}
while(q!=-1);
}
|
12 | 5709 | int main()
{
int a[100][16];
int i,j,k,t,s;
int b[100]={0};
for(i=0;i<=99;i++)
{
for(j=0;j<=15;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0||a[i][j]==-1)
{
break;}
}
if(a[i][0]==-1) {b[i]=-1; break;}
}
for(k=0;k<=99;k++)
{
if(a[k][0]==-1)
{break;}
for(t=0;t<=15;t++)
{
if(a[k][t]==0||a[k][t]==-1) {break;}
for(s=0;s<=15;s++)
{
if(a[k][s]==0) {break;}
if(a[k][t]*2==a[k][s]) {b[k]++;}
}
}
}
for(int q=0;q<=99;q++)
{
if(b[q]==-1)
{break;}
printf("%d\n",b[q]);
}
return 0;
} |
12 | 5710 |
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 | 5711 |
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 | 5712 | main()
{
int a[16],j;
int k,m,y;
int i;
while(1==1)
{
m=0;
for(i=0;i<=15;i++)
{
scanf("%d",&a[i]);
if(a[i]==-1)
{
y=1;
break;
}
if(a[i]==0) break;
else m=m+1;
}
if(y==1) break;
else
{
k=0;
for(i=0;i<m-1;i++)
{
for(j=i+1;j<m;j++)
{
if(a[i]==2*a[j]||a[j]==2*a[i]) k++;
}
}
}
printf("%d\n",k);
}
}
|
12 | 5713 | void main()
{
int a[17],h,i,j,x=1,s;
while(x)
{
for(i=1;i<17;i++) {
scanf("%d",&a[i]);
if(a[i]==-1) goto end;
if(a[i]==0) {h=i;break;}
continue;}
if(x)
{s=0;
for(i=1;i<h-1;i++)
{for(j=i+1;j<h;j++)
if(a[i]==2*a[j]||a[j]==2*a[i])
s++;}
}
printf("%d\n",s);
}
end:
return 0;
}
|
12 | 5714 | int main()
{
float a[100];
int i,j,t;
do{
t=0;
for(i=0;i<=99;i++)
{
scanf("%f",&a[i]);
if(i>=1)
{
if(a[i]==0)
break;
for(j=0;j<=i-1;j++)
{
if((a[i]==2*a[j])||(a[i]==a[j]/2))
t=t+1;
}
}
}
if(a[0]!=-1)
printf("%d\n",t);
}while(a[0]!=-1);
return 0;
}
|
12 | 5715 |
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 | 5716 | int main()
{
int a[17] = {0};
int i, j, k, l;
int num = 0;
for (l=1; ; l++)
{
for (i = 1; i <= 16; i++)
{
cin >> a[i];
if (a[i] == 0 || a[i] == -1)
{
break;
}
}
if (a[i] == -1)
break;
for (j = i -1; j >= 1; j--)
for ( k = j - 1; k >= 1; k--)
{
if (a[j] > a[k] && a[j] % a[k] == 0 && a[j] / a[k] == 2)
num++;
if (a[k] > a[j] && a[k] % a[j] == 0 && a[k] / a[j] == 2)
num++;
}
cout << num << endl;
int a[17] = {0};
num = 0;
}
return 0;
} |
12 | 5717 | int main()
{
int x[16],i,j,k,a;
while(1){
i=j=k=a=0;
for(i=0;i<16;i++)x[i]=0;
for(i=0;scanf("%d",&x[i]);i++){
if(x[i]==-1||x[i]==0)break;
}
if(x[0]==-1)break;
else for(a=0,j=1;j<i;j++){
for(k=0;k<j;k++){
if(x[k]==2*x[j]||x[j]==2*x[k])a++;
}
}
printf("%d\n",a);
}
return 0;
} |
12 | 5718 | int main()
{
int n=0,m[20],i=0,j=0,t=0;//n is the num of int
char c;
scanf("%d%c",&m[0],&c);
while(m[0]>0)
{
n=1;
t=0;
while(c!='\n')
scanf("%d%c",&m[n++],&c);
n--;
for(i=0;i<n;i++){
for(j=n;j>i;j--)
if((m[j]==2*m[i])||(m[i]==2*m[j])) t++;
}
printf("%d\n",t);
scanf("%d%c",&m[0],&c);
}
return 0;
} |
12 | 5719 | int main()
{
int a[16],x,i,j,t=0;
for(;;){
x=1;t=0;
scanf("%d",&a[0]);
if(a[0]==-1) break;
else
{
for(i=1; ;i++)
{scanf("%d",&a[i]);
if(a[i]==0) break;x++;
}
for(i=0;i<x-1;i++)
{for(j=i+1;j<=x-1;j++)
{if(a[i]==2*a[j]||a[j]==2*a[i])
t++;
}
}
printf("%d\n",t);}}
} |
12 | 5720 | main()
{
int a[16],n,j,k,p,m;
do
{
a[0]=-1;
for(j=0,n=0;;j++)
{
scanf("%d",&a[j]);
if(a[0]==-1)
{
break;
}
if(a[j]==0) break;
n++;
}
m=0;
for(k=0;k<=n-1;k++)
{
for(p=k+1;p<=n;p++)
{
if(a[p]==(a[k]*2)||a[k]==(a[p]*2))
{
m++;
}
}
}if(a[0]==-1)
break;
printf("%d\n",m);
}while(a[0]!=-1);
return 0;
} |
12 | 5721 | //*******************************************************
//* ? ?: ?? *
//* ? ?: ??? 1200012861 *
//* ? ?: 2012?10?9? *
//*******************************************************
int main()
{
int n, num[15], i, j, s, t, answer;
while (cin >> num[0])
{
if (num[0] == -1)
break; //???????-1?????
j = 0; //???????j
answer = 0; //??????????????
do
{
j++;
cin >> num[j]; //????
}
while (num[j] != 0); //????0?????
for (s = 0; s < j; s++)
{
for (t = 0; t < j; t++)
{
if (num[t] == 2 * num[s]) //?????????????
answer++; //??+1
}
}
cout << answer << endl;
}
return 0;
}
|
12 | 5722 | int main()
{
int a[20],i=0,j=0,n=0;
while(scanf("%d",&a[i]),a[i]!=-1)
{
while(scanf("%d",&a[i+1]),a[i+1]!=0)
i=i++;
for(i=0;a[i]!=0;i++)
for(j=i;a[j]!=0;j++)
{
if(a[i]==2*a[j]||2*a[i]==a[j])
n=n++;
}
printf("%d\n",n);
n=0;
i=0;
}
return 0;
}
|
12 | 5723 | 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 | 5724 | 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 | 5725 | 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 | 5726 | int main()
{
int a[100][16]={0};
int i=0,j=0,p=0,k=0,num=0;
do
{
for(j=0;j<16;j++)
{
scanf("%d",&a[p][j]);
if(a[p][j]==0||a[p][j]==-1)
break;
}
p++;
}
while(a[p-1][0]!=-1);
p--;
for(i=0;i<p;i++)
{
for(j=0;a[i][j]!=0;j++)
{
for(k=0;a[i][k]!=0;k++)
{
if(2*a[i][k]==a[i][j])
num++;
}
}
printf("%d\n",num);
num=0;
}
return 0;
}
|
12 | 5727 |
int main()
{
int a[20][16]={0};
int bei[20]={0},j,k,chu,last;
for(j=0;j<20;j++){
for(k=0;k<16;k++){
scanf("%d",&a[j][k]);
if(a[j][k]==0||a[j][k]==-1)
break;
}
if(a[j][k]<0){
last=j;
break;
}
}
for(j=0;j<20;j++){
for(k=0;k<16;k++){
for(chu=0;chu<16;chu++){
if((a[j][chu]==2*a[j][k])&&a[j][k]!=0&&a[j][chu]!=0){
bei[j]=bei[j]+1;
}
}
}
if(a[j][0]==-1)
break;
}
for(j=0;j<last;j++){
printf("%d\n",bei[j]);
}
return 0;
} |
12 | 5728 | void main()
{
int a[15]={0},i=0,j=0,m=0;
scanf("%d",&a[0]);
while(a[i]!=0)
{
scanf("%d",&a[i+1]);
i=i+1;
}
i=0;
while(a[0]!=-1)
{
while(a[i]!=0)
{
while(a[j]!=0)
{
if(((float)a[j])/((float)a[i])==2)
m=m+1;
j=j+1;
}
j=0;
i=i+1;
}
printf("%d\n",m);
i=0;
m=0;
scanf("%d",&a[0]);
while(a[i]!=0)
{
scanf("%d",&a[i+1]);
i=i+1;
}
i=0;
}
}
|
12 | 5729 | 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 | 5730 | int main()
{
int e=0,i,j,k=-1;
int a[10000];
int ans;
while(1)
{
i=1;
cin>>a[0];
while (a[i-1]!=0)
{
cin>>a[i];i++;
}
e=i-1;
if (a[0]==-1) return 0;
ans=0;
for(i=0;i<e;i++)
for(j=0;j<e;j++)
{
if (i!=j)
if((a[i]%a[j]==0)&&(a[i]/a[j]==2)) ans++;
}
cout<<ans<<endl;
}
return 0;
} |
12 | 5731 | int main()
{
int i,j,n,num[15],out;
while (1)
{
n=-1;
out=0;
scanf("%d",&i);
if (i==-1) break;
num[++n]=i;
while (1)
{
scanf("%d",&i);
if (i==0) break;
num[++n]=i;
}
for (i=0;i<=n-1;i++)
for (j=i+1;j<=n;j++)
if (num[j]==2*num[i] || num[i]==2*num[j]) out++;
printf("%d\n",out);
}
return 0;
} |
12 | 5732 | int main()
{
int i, j, n, x[15], count;
while (1)
{
count = 0;
for (n = 0; ; n++)
{
cin >> x[n];
if (x[n] <= 0) break;
}
if (x[n] == -1) break;
for (i = 0; i < n; i++)
for(j = 0; j < n; j++)
{
if (j == i) continue;
if (x[j] == 2 * x[i]) count++;
};
cout << count << endl;
}
return 0;
} |
12 | 5733 | 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 | 5734 |
int main()
{
int i,j,k,m,n,sum=0;
int a[20][20],b[20];
for(i=0;;i++)
{
for(j=0;;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==-1)
{
m=i;
break;
}
if(a[i][j]==0)
{
b[i]=j;
break;
}
}
if(a[i][j]==-1)
{
break;
}
}
for(i=0;i<m;i++)
{
sum=0;
for(j=0;j<b[i];j++)
{
for(k=0;k<=j;k++)
{
if(a[i][j]%a[i][k]==0&&a[i][j]/a[i][k]==2)
sum++;
else if(a[i][k]%a[i][j]==0&&a[i][k]/a[i][j]==2)
sum++;
}
}
printf("%d\n",sum);
}
return 0;
} |
12 | 5735 | 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 | 5736 | void main()
{
int i,j,k=0,l,m,t,a[100][100],c[100];
for(i=1;;i++)
{
j=1;
scanf("%d",&a[i][j]);
if(a[i][j]==-1)break;
for(j=2;j<100;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0)break;
for(l=j;l>=1;l--)
{
if(a[i][j]==2*a[i][l]||2*a[i][j]==a[i][l])c[i]++;
else continue;
}
}
k++;
}
for(m=1;m<=k;m++)
{
printf("%d\n",c[m]);
}
} |
12 | 5737 | /**
*@file 1000012767_2.cpp
*@author ??
*@date 2010.11.3
*@description
* ???????1134??
*/
int main()
{
int a[17]; //a ?????????????? 0 ?? 16 ???????????? 17
int i, j, n, count; //i ???????????????j ?????????n ????????count ????
while(cin >> a[1] && a[1] != -1) //???????????????? -1 ?????
{
count = 0; //??????? 0
for (n = 2; n <= 16; n++) //?????????????????????????????
{
cin >> a[n];
if (a[n] == 0) //?????????????
break; //???
}
for (i = 1; i <= n - 1; i++) //??? n - 1 ?????????????
{
if (a[i] % 2 == 0) //????????????????????
for (j = 1; j <= n - 1; j++)
if (a[j] * 2 == a[i]) //?????????????? 2 ???
count++; //???????????????? 1
}
cout << count << endl; //????????
}
return 0;
} |
12 | 5738 |
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 | 5739 | //********************************
//*????? **
//*?????? 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 | 5740 | int main()
{
int a[100] = {0};
int i, num, n;
while(1)
{
for (i = 1; i <= 100; i++)
a[i] = 0;
do
{
cin >> num;
a[num] = 1;
}while ( num != 0 && num != -1);
if (num == -1)
break;
n = 0;
for (i = 0; i <= 50; i++)
if (a[i] && a[2 * i])
n++;
cout << n - 1 <<endl;
}
return 0 ;
}
|
12 | 5741 | /*?????
*??? 2010-11-13
*?????
*/
int main ()
{int i=0,j=0,t=0,m,n;
double a[1000][100]; //?????????
cin>>a[i][j]; //??????
while(a[i][j]!=-1){
while(a[i][j]!=0){
cin>>a[i][j+1];
j++;}j++;
for(m=0;m<j-1;m++){
for(n=m+1;n<j-1;n++){
if(a[i][m]/a[i][n]==2.0||a[i][m]/a[i][n]==0.5)t++;}}
i++;j=0;cin>>a[i][j];cout<<t<<endl;t=0; //??
}
return 0;
}
|
12 | 5742 |
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 | 5743 | /*
* bla.cpp
*
* Created on: 2012-11-4
* Author: Administrator
*/
int main()
{
int m;
while(cin>>m)
{
if(m==-1) break;
int a[15],i=0,j,k,count=0;
a[0]=m;
while(cin>>m)
{
if(m==0) break;
i++;
a[i]=m;
}
k=i+1;
for(i=0;i<k;i++)
for(j=0;j<k;j++)
if(a[i]==2*a[j])
count++;
cout<<count<<endl;
}
return 0;
} |
12 | 5744 | int main(int argc, char* argv[])
{
int shu[number];
int n,i,j;
int k=0;
scanf("%d",&shu[0]);
for(n=0;shu[n]!=0;n++){
scanf("%d",&shu[n+1]);
}
for(i=0;i<=n;i++){
for(j=0;j<=n;j++){
if(shu[i]==2*shu[j]){
k++;
}
}
}
if(k!=0){
k=k-1;
printf("%d",k);
}
else printf("%d",k);
return 0;
} |
12 | 5745 | int main(){
int a[100][100],t=0,i,j,k,num;
for(i=0;i<100;i++)
{
scanf("%d",&a[t][i]);
if(a[t][i]==0) t++;
else if(a[t][i]==-1) break;
}
for(k=0;k<t;k++)
{
num=0;
for(i=0;i<100;i++)
{
for(j=0;j<100;j++)
{
if(a[k][j]==2*a[k][i]&&a[k][i]!=0)
num++;
}
}
printf("%d\n",num);
}
return 0;
}
|
12 | 5746 | 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 | 5747 | int main()
{
int a[30];
int i,m,j,temp,n;
int k=0;
for (i=0;i<300;i++)
{
scanf ("%d",&a[0]);
if (a[0]==-1)
{
break;
}
else
{
for (j=1;j<30;j++)
{
scanf("%d",&a[j]);
if (a[j]==0)
{
break;
}
}
for (m=0;m<j;m++)
{
for (n=0;n<j-1;n++)
{
if (a[n]==2*a[n+1])
{
k++;
}
temp=a[n];
a[n]=a[n+1];
a[n+1]=temp;
}
}
printf("%d\n",k);
k=0;
j=-1;
}
}
return 0;
} |
12 | 5748 | //*******************************************
//?????? cpp1
//??? ???
//???1300012712
//*******************************************
int main ()
{
int n, i, j, k, ds, s; // ??ds???????????????
int a[16];
while (cin)
{
ds = 0;
cin >> a[0];
if (a[0] == -1) return 0; // ???????-1?????
s = 1; // ?????????????
while (cin)
{
cin >> a[s];
if (a[s] == 0) break ; // ???????????????
else s = s + 1; // ????????
}
for (i = 0; i <= s; i++) // ?????????
{
for (j = i + 1; j <= s; j++) // ?????i ??i????
{
if ((a[i] == a[j] * 2) || (a[j] == a[i] * 2)) // ???????????????
ds = ds + 1; // ???????????????
}
}
cout << ds << endl;
}
return 0;
}
|
12 | 5749 |
int main(int argc, char* argv[])
{
int i,j,k[16],a,p,b,c,q;
for(i=1;i<1000;i++)
{
p=0;q=0;
for(j=0;j<16;j++)
{
scanf("%d",&a);
if(a==-1) break;
else if(a!=-1)
{
if(a==0) break;
else
{
k[j]=a;
p++;
}
}
}
if(a==-1) break;
for(b=0;b<p;b++)
{
for(c=0;c<p;c++){
if(k[b]-2*k[c]==0)
q++;
}
}
printf("%d\n",q);
}
return 0;
}
|
12 | 5750 |
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 | 5751 | int main()
{
int a[17];
int i, j, n, nn, count;
nn=0;
while(cin >> a[1] && a[1] != -1)
{
nn++;
count = 0;
for (n = 2; n <= 16; n++)
{
cin >> a[n];
if (a[n] == 0)
break;
}
for (i = 1; i <= n - 1; i++)
{
if (a[i] % 2 == 0)
for (j = 1; j <= n - 1; j++)
if (a[j] * 2 == a[i])
count++;
}
cout << count << endl;
}
return 0;
} |
12 | 5752 | 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 | 5753 | //********************************
//*?????? **
//*?????? 1000012939 **
//*???2012.11.02 **
//********************************
int main()
{
int a[16];
while (true)
{
cin >> a[0];
if (a[0] == -1)
break;
int n = 0, count = 0;
while (a[n] != 0)
cin >> a[++n];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
if (a[i] == 2 * a[j])
count++;
}
cout << count << endl;
}
return 0;
} |
12 | 5754 | //********************************
//*????? **
//*?????? 1200012839 **
//*???2012.10.30 **
//********************************
int main()
{
int a[15], value;
while (cin >> value && value != -1)
{
a[0] = value;
int i = 0, count = 0;
while (a[i] != 0)
{
i++;
cin >> a[i];
}
for (int j = 0; j < i; j++)
{
for (int k = 0; k < i; k++)
{
if (a[j] == 2 * a[k])
{
count = count + 1;
}
}
}
cout << count << endl;
}
while (value == -1)
{
break;
}
return 0;
} |
12 | 5755 | 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 | 5756 | 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 | 5757 | 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 | 5758 | //******************************
//* 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 | 5759 |
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 | 5760 |
int main()
{
int i, j, end, k;
float a[1000];
int n[100];
int num[100];
for(i=0; i<100; i++)
{
num[i]=-1;
}
i=0;
j=1;
n[0]=-1;
for(i=1; i<100; i++)
{
n[i]=0;
}
end=0;
for(i=0; i<1000; i++)
{
scanf("%f", &a[i]);
if(a[i]==-1)
{
end=i;
break;
}
}
for(i=0; i<end; i++)
{
if(a[i]==0)
{
n[j]=i;
j++;
}
}
k=1;
while(n[k]!=0)
{
num[k]=0;
for(i=n[k-1]+1; i<n[k]; i++)
{
for(j=n[k-1]+1; j<n[k]; j++)
{
if(a[i]/a[j]==2)
{
num[k]++;
}
}
}
k++;
}
k=1;
while(num[k]!=-1)
{
printf("%d\n", num[k]);
k++;
}
return 0;
} |
12 | 5761 | //********************
//**????? **
//**????? **
//**???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 | 5762 | int main()
{
int a[100];
int d,i,t,p=0;
while(true)
{
t=0;
for(i=0;i<100;i=i+1) a[i]=0;
while (true)
{
scanf("%d",&d);
if ((d==0)||(d==-1)) break;
a[d]=1;
}
if (d==-1) break;
else
{
if(p) printf("\n");
p=p+1;
for(i=1;i<50;i=i+1)
if ((a[i])&&(a[2*i])) t++;
printf("%d",t);
}
}
return 0;
} |
12 | 5763 | int main()
{
int a[18] = {0},i,n,ii,s;
char c;
while (1)
{
i = 1;
while (1)
{
cin>>a[i];
if ((a[i] == 0)||(a[i] == -1))
break;
i++;
}
if (a[i] == -1)
break;
n = i;
i = 1;
s = 0;
while (i < n)
{
ii = 1;
while (ii < n)
{
if (a[ii] == 2 * a[i])
s++;
ii++;
}
i++;
}
cout<<s<<endl;
}
return 0;
} |
12 | 5764 | int main()
{
int i,j,h,k,m;
int a[20];
for(k=0;;k++)
{
for(i=0;i<16;i++)
{
scanf("%d",&a[i]);
if(a[0]==-1)
{
break;
}
m=0;
if(a[i]==0)
{
for(j=0;j<i-1;j++)
{
for(k=j+1;k<i;k++)
{
if(a[k]==a[j]*2||a[j]==a[k]*2)
{
m++;
}
}
}
printf("%d\n",m);
break;
}
}
if(a[0]==-1)
{
break;
}
}
return 0;
} |
12 | 5765 |
void main()
{
int a[15];
scanf("%d",&a[0]);
int i=1;
int k=0;
while(a[i-1]!=0)
{
scanf("%d",&a[i]);
k=k+1;
i++;
}
int j;
int n=0;
for (i=0;i<=k-1;i++)
{
for(j=0;j<=k-1;j++)
{
if(a[i]==2*a[j])
{
n=n+1;
}
}
}
printf("%d",n);
} |
12 | 5766 | /**
????1.cpp
? ?????
? ??10.30
? ??????????????
*/
int main()
{
int a[16], i;
for(i = 1;;i++)
{
int j, k, n = 1, cnt = 0;
cin >> a[0];
if (a[0] == -1)break;
for(j = 1;j < 16;j++)
{
cin >> a[j];
if(a[j] == 0)break;
n++;
}
for(j = 0;j < n - 1;j++)
{
for(k = 1;k <= n - j - 1;k++)
{
if(a[j] == 2 * a[j + k] || 2 * a[j] == a[j + k])
cnt++;
}
}
cout << cnt << endl;
}
return 0;
}
|
12 | 5767 |
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 | 5768 | 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 | 5769 | int main()
{int n,m,k;
static int a[16];
while(scanf("%d",&a[0])&&a[0]!=-1)
{for(k=1;k<=15;k++)
{scanf(" %d",&a[k]);
if(a[k]==0)
break;}
n=0;
for(k=0;a[k]!=0;k++)
for(m=0;a[m]!=0;m++)
if(a[m]==2*a[k])
{n++;break;}
printf("%d\n",n);}
return 0;
}
|
12 | 5770 | //???????????????????
//?????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 | 5771 | int main()
{
int a[16], i, j, k, count; //????a???????count????????????
while(1)
{
for ( i = 0; ; i++ )
{
cin>>a[i]; //????
if ( a[i] == 0 ) //????0?????????
break;
if ( a[0] == -1)
break;
}
if ( a[0] == -1 ) //????????-1???????
break;
count = 0; //?count??0
for ( k = 0; k < i; k++ )
for ( j = 0; j < i; j++ )
if ( ( a[k] == 2 * a[j] ) || ( a[j] == a[k] * 2 ) )
count++; //????????????
cout<<count/2<<endl;
}
return 0;
}
|
12 | 5772 |
int main(int argc, char* argv[])
{
int s[100][15],t[15];
int sum[100];
int i,j,n,m,k;
for(i=0;;i++){
for(j=0;;j++){
scanf("%d",&s[i][j]);
if(s[i][j]==0){
t[i]=j;
break;
}
else if(s[i][0]==-1) break;
}
if(s[i][0]==-1) break;
}
for(n=0;n<i;n++){
sum[n]=0;
for(m=0;m<t[n]-1;m++){
for(k=m+1;k<t[n];k++){
if(s[n][m]==2*s[n][k]||s[n][k]==2*s[n][m]){
sum[n]++;
}
}
}
}
for(n=0;n<i;n++){
printf("%d\n",sum[n]);
}
return 0;
}
|
12 | 5773 | int main()
{
int s[15];int a,b;
int i,t,h,k;
for(i=0;i<=100;i++)
{
b=0;a=0;
for(t=0;t<17;t++)
{
scanf("%d",&s[t]);
if(s[t]==0)break;
if(s[t]==-1)break;
a++;
}
if(s[t]==-1)break;
for(k=0;k<a;k++)
{
for(h=0;h<a;h++)
{
if(s[k]==2*s[h]){b++;}
else{b=b;}
}
}
printf("%d\n",b);
}
return 0;
}
|
12 | 5774 | /**
* @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 | 5775 | int main()
{
int i,j,k,count=0,row,arr[100][100],n[100],b[100];
for(i=0;i<100;i++){
count=0;
for(j=0;j<100;j++){
scanf("%d",&arr[i][j]);
if(arr[i][j]==0||arr[i][j]==-1){
n[i]=count;
break;
}
count++;
}
if(arr[i][j]==-1){
row=i; //last row=-1, n[i]=0
break;
}
}
for(i=0;i<row;i++){
count=0;
for(j=0;j<n[i];j++){
for(k=j+1;k<n[i];k++){
if(arr[i][j]==(arr[i][k]*2)||(arr[i][j]*2)==arr[i][k]){
count++;
}
}
}
b[i]=count;
}
for(i=0;i<row;i++){
printf("\n%d",b[i]);
}
return 0;
} |
12 | 5776 |
int main(int argc, char* argv[])
{
int s[16]={0};
while(1){
int i,j,count=0,flag=0;
for(i=0;;i++){
scanf("%d",&s[i]);
if(s[i]==-1)
{
flag=1;
break;
}
if(s[i]==0)
break;
count++;
}
if(flag)
break;
int num=0;
for(i=0;i<count;i++){
for(j=i;j<count;j++){
if(s[i]==s[j]*2||s[j]==s[i]*2)
num++;
}
}
printf("%d\n",num);
}
return 0;
}
|
12 | 5777 | main()
{
int a[100][17],i,j,k,s,r;
for(j=0;j<100;j++)
{
r=0;
scanf("%d",&a[j][1]);
if(a[j][1]==-1) break;
else
{
for(i=2,s=1;a[j][i-1]!=0;i++,s++)
scanf("%d",&a[j][i]);
for(i=1;i<s;i++)
{
for(k=i+1;k<=s;k++) {if(a[j][k]==2*a[j][i]||a[j][i]==2*a[j][k]) r++;}
}
printf("%d\n",r);
}
}
return 0;
} |
12 | 5778 | void main()
{
int c[15],i,m=0;
for(i=0;i<15;i++)
{
scanf("%d",&c[i]);
if(c[i]==0)
{
break;
}
}
int k,j,n=0;
for(k=0;c[k]!=0;k++)
{
for(j=0;c[j]!=0;j++)
{
if(c[k]==2*c[j])
{
n++;
}
}
}
printf("%d",n);
} |
12 | 5779 | //*****************************************
//* ????? **
//* ?????? 1300012741 **
//* ???2013.10.23 **
//*****************************************
int main()
{
int list[15] = {0};
int i, j, num, sum;
cin >> num;
while ( num != -1 )
{
i = 1;
j = 0;
sum = 0;
list[0] = num;
while ( ( cin >> list[i], list[i] ) != 0 )
i++;
while ( list[j] )
{
for ( i = j + 1; list[i]; i++ )
{
if ( list[i] == 2 * list[j] || 2 * list[i] == list[j] )
sum++;
}
j++;
}
cout << sum << endl;
cin >> num;
}
return 0;
} |
12 | 5780 |
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 | 5781 |
/**
* @desc ??????: ??2?1000???????
* @author ??? 1100012829
* @date 2011-10-12
*/
int main()
{
int a[16]={0},n,i=1;
for(;a[i]!=-1;)//a[i]???????
{
n=0;
for(i=0;;i++)//???
{
cin>>a[i];
for(int j=0;j<i;j++)
{
if(a[j]*2==a[i]||a[j]==a[i]*2){n++;}
}
if(a[i]==0||a[i]==-1){break;}//?????? -1?????????
}
if(a[i]!=-1){cout<<n<<endl;}
}
}
|
12 | 5782 | int main ( )
{
int num[16],i,j,count,a,n;
while(1)
{
count=0;n=0;
for(i=0;;i++)
{
scanf("%d",&num[i]);
if(num[i]==-1)
break;
if(num[i]==0)
break;
n+=1;
}
if(num[0]==-1)
break;
else
{
for(i=0;i<n;i++)
{
a=num[i];
for(j=0;j<n;j++)
if(num[j]==2*a)
count+=1;
}
}
printf("%d\n",count);
}
return 0;
} |
12 | 5783 |
int main(int argc, char* argv[])
{
int a[100],i,j,num=0,total=0;
while(1){
num=0;
while(1){
scanf("%d",&a[num]);
if(a[num]==0) break;
if(a[num]==-1) return 0;
num++;}
total=0;
for(i=0;i<num;i++){
for(j=0;j<num;j++){
if(a[j]==2*a[i]) total++;}}
printf("%d\n",total);}
return 0;
}
|
12 | 5784 | 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 | 5785 |
int main()
{
int a[20],i=0,j,count=0;
while(cin>>a[i])
{
if(a[i]==0)
{
cout<<count<<endl;
count=0;
i=0;
continue;
}
if(i!=0)
{
for(j=0;j<i;j++)
{
if( a[j]==2*a[i]||a[i]==2*a[j])
{count++;}
}
}
i++;
}
return 0;
}
|
12 | 5786 | 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 | 5787 |
int main(int argc, char* argv[])
{
int n,i,k,d,total;
total=0;
int shuzu[16];
for(i=0;i<16;i++){
scanf("%d",&n);
if(n!=-1){
shuzu[i]=n;
if(n==0){
for(d=0;d<i;d++){
for(k=0;k<i;k++){
if(shuzu[d]==2*shuzu[k]){
total++;}}}
printf("%d\n",total);
i=-1;
total=0;}
}
else{
break;}}
return 0;
}
|
12 | 5788 | int main(void)
{
int a[MAX], n[100];
int i, t, j, k, tr, sum[20], l=0;
while (scanf("%d", &t), t!=-1)
{ sum[l]=0;
i=0;
a[0]=t;
while(i++,scanf("%d", &a[i]), a[i]);
for(j=0; j<=i-1; j++)
{
for(k=0; k<=i-j-1; k++)
{
if(a[k]>a[k+1])
{
tr = a[k];
a[k]= a[k+1];
a[k+1]= tr;
}
}
}for(j=0; j<=i-1; j++)
{
for(k=j+1; k<=i; k++)
{
if ((2*a[j])==a[k])
sum[l]++;
}}l++;
}
for(i=0;i<l;i++)
printf("%d\n", sum[i]);
return 0;
}
|
12 | 5789 | 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 | 5790 |
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 | 5791 | main()
{
int a[16]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},i=0,j=0,k=0;
scanf("%d",&a[0]);
while (a[0]!=-1)
{
i=1;
do
{
scanf("%d",&a[i]);
if (a[i]<0) {}
i++;
}
while (a[i-1]);
for (i=0;i<16;i++)
{
if (a[i])
{
for (j=0;j<16;j++)
{
if (a[i]==2*a[j]) k+=1;
}
}
}
printf("%d\n",k);
for (i=0;i<16;i++) a[i]=0;
k=0;
scanf("%d",&a[0]);
}
} |
12 | 5792 | //**************************************************************************
//*?????? *
//*??? ??????????????????????????????? *
//*?????? *
//*???2010?11?03? *
//**************************************************************************
int main()
{
int a; //???????????????
while (cin >> a) //??????
{
if (a != -1) //????????-1
{
int i = 0, j, k, p = 0; //?????p?????
int b[15] = {a}; //????????
while (b[i] != 0) //???????????0????????
{
cin >> b[i + 1];
i ++; //?????????
}
for (j = 0; j < i; j ++)
{
for (k = j + 1; k < i; k ++)
if (b[k] == 2 * b[j] || b[j] == 2 * b[k]) //?????????????2?
{
p = p + 1; //???????
}
}
cout << p << endl; //??????
}
}
return 0;
}
|
12 | 5793 | /* ??2?15????????????????????????????????????????????
????1 4 3 2 9 7 18 22???????3???2?1????4?2????18?9????
????
??????????????????????2?15????????100??????????????0??????????????????2?15??????????????????????-1,???????????????????
????
????????????????????????????????????
????
1 4 3 2 9 7 18 22 0
2 4 8 10 0
7 5 11 13 1 3 0
-1
????
3
2
0 */
int main()
{
int num[100][150],i,j,g,h[100],k,m;
for(j=0;;j++)
{
for(i=0;;i++)
{
scanf("%d",&num[j][i]);
if(num[j][0]==-1)
break;
if(num[j][i]==0)
break;
}
if(num[j][0]==-1)
break;
h[j]=i;
}
g=j;
int count[100]={0};
for(j=0;j<g;j++)
{
for(i=0;i<h[j];i++)
{
k=i;
for(m=k;m<h[j];m++)
{
if(((num[j][m]%num[j][k]==0)&&(num[j][m]/num[j][k]==2))||((num[j][k]/num[j][m]==2)&&(num[j][k]%num[j][m]==0)))
count[j]++;
}
}
printf("%d\n",count[j]);
}
return 1;
}
|
12 | 5794 |
int main()
{
int output = 0, i, j, length;
float data[16];
data[0] = -2;
while(data[0] != -1)
{
for(i = 0; i <= 15; i++)
{
scanf("%f", &data[i]);
if(data[i] == 0)
{
length = i;
break;
}
if(data[i] == -1)
break;
}
if(data[i] == -1)
break;
for(i = 0; i <= length - 1; i++)
for(j = 0; j <= length - 1; j++)
{
if((data[j] / data[i]) == 2)
output = output + 1;
}
printf("%d\n", output);
output = 0;
}
return 0;
}
|
12 | 5795 | 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 | 5796 | void main()
{
int a[16],i,sum=0,b,j,k,m;
scanf("%d ",&b);
while(b!=-1)
{
a[0]=b;i=0;
while(a[i]!=0)
{
i++;
scanf("%d ",&a[i]);
}
for(j=1;j<i;j++)
{
for(k=0;k<i-j;k++)
{
if(a[k]>a[k+1])
{
m=a[k];
a[k]=a[k+1];
a[k+1]=m;
}
}
}
for(j=0;j<i-1;j++)
{
for(k=j+1;k<i;k++)
{
if(2*a[j]==a[k])
sum++;
}
}
printf("%d\n",sum);sum=0;
scanf("%d",&b);
}
}
|
12 | 5797 |
main()
{
int c[100];
int m,z;
for(m=0;;m++){
int i,j,k,n;
int a[17],b[17];
n=0;
scanf("%d",&a[0]);
b[0]=2*a[0];
if(a[0]==-1){
goto end;
}
else{
for(i=1;a[i-1]!=0;i++){
scanf("%d",&a[i]);
if(a[i]==-1){
goto end;
}
b[i]=2*a[i];
}
for(j=0;j<i-1;j++){
for(k=0;k<i-1;k++){
if(b[k]==a[j])
n++;
}
c[m]=n;
}
}
}
end: for(z=0;z<m;z++)
printf("%d\n",c[z]);
} |
12 | 5798 |
int array[16]={0},n=0,sum=0;
int main()
{
int i,j;
while(1)
{
n=0;
sum=0;
while(1)
{
cin>>array[n];
if(array[n]==0 || array[n]==-1)
{
n--;
break;
}
n++;
}
if(array[0]==-1)
break;
for(i=0;i<=n;++i)
{
for(j=i;j<=n;++j)
{
if((array[i]==array[j]*2) || (array[j]==array[i]*2))
{
sum++;
}
}
}
cout<<sum<<endl;
}
return 0;
}
|
12 | 5799 | int main()
{
int s[100][15],i,j,n,m,a[100],p,b[100]={0};
for (i=0;;){
for (j=0;;){
scanf("%d",&s[i][j]);
if (s[i][j]==0) {a[i]=j+1;i++;break;}
else if (s[i][j]==-1) break;
else j++;
}
if (s[i][j]==-1) break;
}
for (m=0;m<i;m++){
for (n=0;n<a[m]-1;n++){
for (p=0;p<a[m]-1;p++){
if (s[m][p]==2*s[m][n]) b[m]++;
}
}
}
for (m=0;m<i;m++){
printf("%d\n",b[m]);
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.