SCHOOL OF CODE BUILDERS
Learn To CODE. Become A DEVELOPER.
Pages
HOME
DATA STRUCTURES
STRINGS
ARRAYS
MATRIX
BINARY TREES
LINKED LIST
STACK
QUEUE
SORTING
SEARCHING
C
PYTHON
PSEUDOCODE
CONTEST PROBLEMS
ALGORITHMS
PATTERNS
PHP
C PUZZLES
C INTERVIEW QUESTIONS
JAVA
C++
HASHING
RECURSION
BASIC C PROGRAMS
TCS-CODEVITA
FACEBOOK
CONTACT US
Roy and Matrix Sum : HackerEarth Problem Solution
Roy and Matrix Sum : HackerEarth Problem Solution
#include
unsigned long long int rec(unsigned long long int N) { if(N==0) return 0; return (N*(N-1)+rec(N-1)); } int main() { unsigned long long int t,i,j,N,sum; scanf("%llu",&t); while(t--) { sum=0; scanf("%llu",&N); sum=rec(N); printf("%llu\n",sum); } return 0; }
PREVIOUS
NEXT
HOME