# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
4195 |
2013-09-04T04:43:30 Z |
dbfud |
쉬운 문제 (GA3_easy) |
C++ |
|
0 ms |
1088 KB |
int CountPair(int N, int *A){
int pair = 0;
for ( int i = 0 ; i < N ; i++ )
for( int j = 0 ; j < N ; j++)
{
if( ( A[j] % A[i] ) == 0 )
pair++ ;
}
return pair ;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |