Submission #650

#TimeUsernameProblemLanguageResultExecution timeMemory
650solve쉬운 문제 (GA3_easy)C++98
40 / 100
0 ms1404 KiB
#include <iostream> #include <set> #include <cstdio> #include <algorithm> #include <queue> #include <vector> #include <cstdlib> #include <memory.h> #include <sstream> #include <math.h> using namespace std; #define INF 1<<30 int CountPair(int N, int * A) { int res = 0; sort(A, A + N); for(int i = 0;i<N;i++) { for(int j = i + 1;j<N;j++) { if(A[j]%A[i] == 0 && A[i] != A[j]) res++; } } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...