#include #include int factorial(int); void uloha(int, int, int[]); int main() { int C,M,P; scanf("%d", &C); scanf("%d", &M); int *pole = (int*)malloc(M*sizeof(int)); for(int i =0; i pole[j] ? pole[j]: pole[i], pole[i] > pole[j] ? pole[i]: pole[j]); break; } } } } int factorial(int n){ if(n<=0){ return 1; } return n*factorial(n-1); }