# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
130035 | OptxPrime | Toys (CEOI18_toy) | C++11 | 5033 ms | 79692 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 <iostream>
#include <cmath>
#include<vector>
#include <algorithm>
#include <utility>
#include<stack>
#include<queue>
#include<map>
#include <fstream>
#include<set>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
//#define maxn 100005
//map<int,bool> res;
map<int, set<int>> sums;
int maxn=100000;
set<int> fac[100010];
void num( int x )
{
sums[x].insert( x-1 );
if( x>maxn ){ ///pravo velik broj, kakvih ima najvise stotinjak
for( int i=2;i<=sqrt(x);i++ ){
if( ( x%i )!= 0 ) continue;
if( sums[i].size() == 0 )num(i);
Compilation message (stderr)
# | 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... |