• Loading...


0-48:0-37
Accepted
90

View Plain Text

  1. long long a[1000001],n;
  2. g(long i)
  3. {
  4. a[i-1]>=10000 && (a[i]=a[i-1]%10000);
  5. a[i-1]<10000 && a[i-1]%2==0 && (a[i]=(2*a[i-1]+5));
  6. a[i-1]<10000 && a[i-1]%2==1 && (a[i]=(a[i-1]+3));
  7. i<n &&g(i+1);
  8. }
  9.  
  10. f(t)
  11. {
  12. scanf("%lld %lld",&n,&a[0]);
  13. g(1);
  14. printf("%lld\n",a[n]);
  15. t>1 && f(t-1);
  16. }
  17. main(t)
  18. {
  19. scanf("%d",&t);
  20. f(t);
  21. }


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