Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Project 3 Part 1 v1.4
//gcc 5.4.0 #include <stdio.h> #include <stdlib.h> //Start Program //int n //int i //int f [0,1] //READ n //for(i=0;i<=n;i++){ // if(i%2==0) // f1=f1+f2; // printf("%d,",f1) // } //// if(i%2!==0){ // f2=f1+f2; // printf("%d,",f2); // } //} //End Program int main(void) { int n; int i; int f; scanf("%d",&n); if(n==0){ printf("0"); } else if(n>=2){ printf("0,"); for(i=1;i<=n;i++){ f=(i-1)+(i-2); f=abs(f); printf(" %d",f); } } else{ for(i=1;i<=n;i++){ f=(i+2)-(i+1); f=abs(f); printf(" %d",f); } } }
run
|
edit
|
history
|
help
0
readability!
18BCE2182 ASSESS_1 Q1-7
quicksort guía 4
ptr_to_ptr
Stub Program for Problem 4 HW 2
strcat
150112_FuncionesOrdenArray
método de ordenamiento insertion sort
bitmask2
ponyerb orange panther