• Loading...


42:32
Accepted
83

View Plain Text

  1.  
  2. t;
  3. (*(p[5]))();
  4. n,f,g,v;
  5. out() { }
  6. V() { v=2+(f<10000)*(1+(f%2!=0)); }
  7. go() { V(),     (*(p[(n--!=0)*v]))(); }
  8. r0()
  9. {
  10.         g=f,f=g%10000,go();
  11. }
  12. r1()
  13. {
  14.         g=f,f=2*g+5,go();
  15. }
  16. r2()
  17. {
  18.         g=f,f=g+3,go();
  19. }
  20. solve()
  21. {
  22.         scanf("%d%d",&n,&f);
  23.         go();
  24.         printf("%d\n", f);
  25.         (*(p[--t!=0]))();
  26. }
  27. main()
  28. {
  29.         scanf("%d",&t);
  30.         p[0]=out,p[1]=solve,p[2]=r0,p[3]=r1,p[4]=r2;
  31.         solve();
  32. }
  33.  


List of Keywords used
    None


Trial 1
Trial 2
Trial 3
Trial 4
Submissions
Multipurpose
1000 pt
You are not logged in
0 / 170

Datatype
1000 pt
You are not logged in
0 / 308

No Bitwise
1000 pt
You are not logged in
0 / 78

Cuboid
1000 pt
You are not logged in
0 / 166

Evaluate the function
1000 pt
You are not logged in
0 / 94

Largest in the set
1000 pt
You are not logged in
0 / 69

2 to N
1000 pt
You are not logged in
0 / 144