#include <iostream>
using namespace std;
// Factorial of N
int factorial(int n) {
if (n == 0) {
return 1;
}
return n * factorial(n-1);
}
int main() {
cout << factorial(5);
return 0;
}
class Solution { public int [] countOppositeParity ( int [] nums ) { // approach 1 - checks every pair int n = n...
No comments:
Post a Comment