CODECHEF - ACT2


Problem Code : ATC2

Problem      : Harry And N-th Number

Platform     : Codechef

Type         : Online

Language     : C 

Link         : CODECHEF

 //submitted  
 //https://www.codechef.com/CODH2018/problems/ATC2  
 #include <stdio.h>  
 #include <stdlib.h>  
 #include <string.h>  
 #include <math.h>  
 void func(long long int arr[])  
 {  
      int n;  
      scanf("%d",&n);  
      printf("%lld\n",arr[n]);  
      return;  
 }  
 int main()  
 {  
      int cases;  
      scanf("%d",&cases);  
      long long int *arr;  
      arr=(long long int *)malloc(700005*sizeof(long long int));  
      long long int i;  
      arr[1]=1;  
      for(i=2;i<700002;i++)  
      {  
           arr[i]=arr[i-1]+sqrt(i);  
      }  
      while(cases--)  
      {  
           func(arr);  
      }  
      return 0;  
 }  

Comments

Popular

Traversal In A Binary Tree - Tree -3

Tree data structure - 2

Pre Order Traversal In Binary Tree