Question

谁能帮我看看这段代码是哪里出错了？谢谢

这是原题
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1760
As part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and asked to determine how many items in each list are twice some other item in the same list. You will need a program to help you with the grading. This program should be able to scan the lists and output the correct answer for each one. For example, given the list
1 4 3 2 9 7 18 22

your program should answer 3, as 2 is twice 1, 4 is twice 2, and 18 is twice 9.

Input

The input file will consist of one or more lists of numbers. There will be one list of numbers per line. Each list will contain from 2 to 15 unique positive integers. No integer will be larger than 99. Each line will be terminated with the integer 0, which is not considered part of the list. A line with the single number -1 will mark the end of the file. The example input below shows 3 separate lists. Some lists may not contain any doubles.

Output

The output will consist of one line per input list, containing a count of the items that are double some other item.

Sample Input

1 4 3 2 9 7 18 22 0
2 4 8 10 0
7 5 11 13 1 3 0
-1

Sample Output

3
2
0

这是我的代码：
#include<iostream>
using namespace std;
int main()
{
int a[100][15],b[100][15],sum,i,j,k,m,n,t[100];
i=0,m=0;
cin>>a[0][0];
while(a[m][0]!=-1)
{
while(a[m][i]!=0)
{
i=i+1;
cin>>a[m][i];
}
t[m]=i;
m=m+1;
cin>>a[m][0];
}
for(n=0;n<m;n=n+1)
{
sum=0;
for(j=0;j<t[n]-1;j=j+1)
b[n][j]=2*a[n][j];
for(j=0;j<t[n]-1;j=j+1)
{
for(k=0;k<t[n]-1;k=k+1)
{
if(b[n][j]==a[n][k])
sum=sum+1;
}
}
cout<<sum<<endl;
}
return(0);
}
我需要的不是代码

Answer 1

给你个代码，追点分吧

#include <iostream>
using namespace std;

void selectionSort(int A[], int size) {
for(int i = 0; i < size - 1; i++) {
int min = i;
for(int j = i + 1; j < size; j++)
if(A[j] < A[min]) min = j;
int temp = A[i];
A[i] = A[min];
A[min] = temp;
}
}

int main() {
int N, A[15];
while( cin >> A[N = 0] ) {
if( A[0] == -1 ) break;
while( cin >> A[++N] )
if( !A[N] ) break;
selectionSort( A, N );
int count = 0;
for( int i = 0; i < N - 1; i++ )
for( int j = i + 1; j < N; j++)
if( A[j] == A[i] * 2 )
count ++;
cout << count << endl;
}
}