> #include <conio.h>#include <stdio.h>#include <iostream.h>int ack(int m,int n){ int aux; if(m==0) aux=n-1; else if(n==0) aux=ack(m-1,1); …
-
-
>Mai jos este prezentata o lista cu functiile matematice suportate in JavaScript. Math.abs(x) – determina …
-
>Post-ul nr 100: verifica daca o succesiune de varfuri date de la tastatura reprezinta un …
-
> //verifica daca o succesiune de varfuri//date de la tst reprez un circuit in graf#include …
-
>Afisare vecinii unui nod i //af vecinii unui nod i# include <stdio.h># include <conio.h>void main(void){int …
-
> #include <stdio.h>#include <conio.h>int min(int a, int b){if(a<=b) return a;else return b;}void main(){int ok,i,j,k,n,a[20][20],b[20][20],l,m,o,p;//citire matr …
-
> //af subgraful obtinut prin eliminare noduri si muchii //dintr-un graf orientat# include <stdio.h># include …
-
> //verifica daca un graf orientat este simetric //sau antisimetric# include <stdio.h># include <conio.h>void main(void){int …
-
> //af semigradul interior/exterior ptr un vf i#include <stdio.h>#include <conio.h>void main(void){int a[50][50],interior[50],exterior[50],n,i,j;FILE *f=fopen("c:intrare.txt","r");fscanf(f,"%d",&n);for(i=1;i<=n;i++) for(j=1;j<=n;j++) fscanf(f,"%d",&a[i][j]);fclose(f);for(i=1;i<=n;i++) …
-
> //Roy-Warshall – det matr drumurilor din matr de adiacenta#include <stdio.h>#include <conio.h>int min(int a, int …