Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Partition
#include <stdio.h> #define max 3571 // max 3571 int main () { unsigned long long ray [max+1][max+1]; int i,j; j = 0; for (i = 0; i <= max; i++) { ray[i][j] = 1; } j = 1; for (i = 0; i <= max; i++) { ray[i][j] = 1; } i = 0; for (j = 1; j <= max; j++) { ray[i][j]=1; } i = 1; for (j = 1; j <= max; j++) { ray[i][j]=1; } for (i = 2; i <= max; i++) { for (j = 2; j <= max; j++) { ray[i][j]=ray[i][j-1]; if ((i-j)>=0) {ray[i][j]+=ray[i-j][j];} } } printf("%llu\n", ray[max][max]); return 0; }
run
|
edit
|
history
|
help
0
Project v0.07
Stub Program for Problem 6 HW 2
swap two numbers without arithematic operators
Michael Bean's Spring 2017 Lab 3 v1.1
1/23/2017
150108_RecursividadFibonacci
CO_assign_q1
Program 1 - 2D array and memory pointers
prime numbers min>max
lab 11 v0.7