Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<math.h>
- int fibonaci (int n){
- if ( n==0 || n==1 )
- return 1;
- else
- return fibonaci(n-1)+fibonaci(n-2);
- }
- int fact (int n) {
- if (n==1)
- return 1;
- else
- return fact(n-1)*n;
- }
- void afisareinv (int v[], int n){
- if (n==0)
- return 0;
- else{
- printf("%d ",v[n]);
- }
- afisareinv(v,n-1);
- }
- void afisare (int v[], int n){
- if (n==0)
- return 0;
- else
- afisare(v,n-1);
- printf("%d ",v[n]);
- }
- int sumcif (int S, int n){
- if(n==0)
- return S;
- else
- return sumcif(S+n%10,n/10);
- }
- void prim (int n, int j){
- if (j>
- sqrt(n)){
- printf("nr este prim");
- return 0;
- }
- if (n%j==0){
- printf("nr nu este prim");
- return 0;
- }else
- prim(n,j+1);
- }
- int main (int argc, char **argv) {
- int n,i;
- int v[100];
- printf("Introduceti n=");
- scanf("%d",&n);
- /*printf("termenul %d al lui fibonaci e %d \n",n,fibonaci(n));
- printf("factorial de %d e %d \n",n,fact(n));
- printf("Introduceti vectorul \n");
- for(i=1;i<=n;i++)
- scanf("%d",&v[i]);
- afisareinv(v,n);
- puts(" ");
- afisare(v,n);
- int S=0;
- printf("%d %d ",n/10,n%10);
- printf("%d",sumcif(S,n)); */
- int j=2;
- prim(n,j);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement