Inverse of Euler totient function

→ Pay attention

Before contest
Educational Codeforces Round 173 (Rated for Div. 2)
33:24:54
Register now »

→ Streams

By aryanc403

Before stream 35:34:54

View all →

→ Top rated

#	User	Rating
1	tourist	3985
2	jiangly	3814
3	jqdai0815	3682
4	Benq	3529
5	orzdevinwang	3526
6	ksun48	3517
7	Radewoosh	3410
8	hos.lyric	3399
9	ecnerwala	3392
9	Um_nik	3392

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	cry	169
2	maomao90	162
2	Um_nik	162
4	atcoder_official	161
5	djm03178	158
6	-is-this-fft-	157
7	adamant	155
8	awoo	154
8	Dominater069	154
10	luogu_official	151

View all →

→ Find user

→ Recent actions

Detailed →

SLIMSHADYNICK's blog

Inverse of Euler totient function

By SLIMSHADYNICK, history, 5 years ago, In English

There's this problem INVPHI on spoj, I have not been able to solve it. I have been getting NZEC runtime error. Could anyone tell me how to approach as I feel I have exceeded the memory limitations.

SLIMSHADYNICK
5 years ago
4

Comments (4)

Write comment?

feodorv

5 years ago, # |

← Rev. 2 →

Here is the strightforward solution. We can sieve the phi values up to 202918035 (please, see comments to the problem statement).

Code, 9.35sec, 1157M

#include <stdio.h>

#define MAXN 100000000
#define MAXM 202918035

int phi[MAXM+1], minv[MAXN+1];

void gen( void )
{
  int i, j;
  for( i = 1; i <= MAXM; ++i) phi[i] = i;
  for( i = 2; i <= MAXM; ++i)
    if( phi[i] == i )
      for( j = i; j <= MAXM; j += i)
        phi[j] = (phi[j] / i) * (i - 1);
  for( i = 1; i <= MAXM; ++i)
    if( phi[i] <= MAXN && minv[phi[i]] == 0 )
      minv[phi[i]] = i;
}

int main( void )
{
  int t;
  gen();
  scanf( "%d", &t);
  while( t-- > 0 )
  {
    int n;
    scanf( "%d", &n);
    printf( "%d\n", minv[n] ? minv[n] : -1);
  }
  return 0;
}

Also you can note that almost all resulting numbers are odd with three exceptions, so we can sieve only odd values:

Code, 4.65sec, 770M

#include <stdio.h>

#define MAXN 100000000
#define MAXM 202918035

int phi[MAXM/2+1], minv[MAXN+1];

void gen( void )
{
  int i, j;
  for( i = 1; i <= MAXM; i += 2) phi[i>>1] = i;
  for( i = 3; i <= MAXM; i += 2)
    if( phi[i>>1] == i )
      for( j = i; j <= MAXM; j += 2*i)
        phi[j>>1] = (phi[j>>1] / i) * (i - 1);
  for( i = 1; i <= MAXM; i += 2)
    if( phi[i>>1] <= MAXN && minv[phi[i>>1]] == 0 )
      minv[phi[i>>1]] = i;
  minv[16842752] = 33817088;
  minv[33685504] = 67634176;
  minv[67371008] = 135268352;
}

int main( void )
{
  int t;
  gen();
  scanf( "%d", &t);
  while( t-- > 0 )
  {
    int n;
    scanf( "%d", &n);
    printf( "%d\n", minv[n] ? minv[n] : -1);
  }
  return 0;
}

Though I do not know how can we achieve 0.04 sec or how will it run in Java.

→ Reply

SLIMSHADYNICK

5 years ago, # ^ |

Thx for your help,but I did the same thing in java but its not working!

→ Reply

feodorv

5 years ago, # ^ |

Hm, did you read this? Also you can apply segmented phi sieve (as for spoj ETFS problem).

→ Reply

SLIMSHADYNICK

5 years ago, # ^ |

Thanks for your time, I submitted the code in C, it worked fine!!

→ Reply