Submission #9389

#TimeUsernameProblemLanguageResultExecution timeMemory
9389effservWiring (kriii2_W)C++98
0 / 4
128 ms16836 KiB
/* 문제 */ // 2014. #include <cstdio> #include <cmath> #include <algorithm> #include <vector> #include <queue> #include <functional> #include <cstring> #include <string> #include <map> using namespace std; long long Q[2000000]; map <long long, int> M; int main() { long long n; scanf("%lld", &n); Q[0] = 0; for (int i = 1; i < 2000000; i++) { Q[i] = (Q[i - 1] + i)%n; M[Q[i]]++; } int ans = 0; for (map<long long , int> :: iterator it = M.begin(); it != M.end(); it++) { ans++; } printf("%d\n", ans - 1); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...