# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
782265 | treewave | Toys (CEOI18_toy) | C++17 | 1076 ms | 235892 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector<int> factors(int n){
vector<int> ret;
for (int i = 1; i * i <= n; i++){
if (n % i == 0){
ret.push_back(i);
if (i * i != n){
ret.push_back(n / i);
}
}
}
ret.erase(find(ret.begin(), ret.end(), 1));
return ret;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
if (n == 1){
cout << 1 << "\n";
cout << 0 << "\n";
return 0;
}
vector<int> f = factors(n);
int m = f.size();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |