• Loading...

saket

Evaluate the function
0-11:0-31
Accepted
3

View Plain Text

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


List of Keywords used
    None


Problem List
Multipurpose
Datatype
No Bitwise
Cuboid
Evaluate the function
Largest in the set
2 to N
Trial 1
Trial 2
Trial 3
Trial 4
Least Significant Digit
Alphabets
Count the Bits
Submissions
Multipurpose
1000 pt
You are not logged in
0 / 170
(geeky_elk)

Datatype
1000 pt
You are not logged in
0 / 308
(xeronix)

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

Cuboid
1000 pt
You are not logged in
0 / 166
(tourist)

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

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

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

How to interpret this?