QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #707256 | #9248. An Easy Math Problem | tsogsummit# | WA | 474ms | 3668kb | C++14 | 677b | 2024-11-03 15:18:21 | 2024-11-03 15:18:25 |
Judging History
answer
#include <bits/stdc++.h>
long long phi(long long n) {
long long result = 0;
long long count = 0;
long long i;
for (i = 2; i * i <= n; i++) {
if (n % i == 0) {
result++;
if(n % (i * i) != 0)count++;
}
}
i--;
if(i * i == n)result = result*2-1;
else result *= 2;
result += count;
return result;
}
using namespace std;
int main(){
int q;
cin >> q;
while(q--){
long long n;
cin >> n;
if(n == 1)cout <<"1\n";
else if(n == 2)cout << "2\n";
else cout << phi(n) + 2 << '\n';
}
}
/*
1
2
2
3
2
5
2
4
3
5
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
input:
10 1 2 3 4 5 6 7 8 9 10
output:
1 2 2 3 2 5 2 4 3 5
result:
ok 10 lines
Test #2:
score: -100
Wrong Answer
time: 474ms
memory: 3612kb
input:
2000 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 6469693230 646969323...
output:
1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 1535 ...
result:
wrong answer 1st lines differ - expected: '29525', found: '1535'