Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int brojZnamenaka(int n) {
- static int counter = 0;
- if (n > 0) {
- counter++;
- brojZnamenaka(n / 10);
- }
- else {
- return counter;
- }
- }
- int zbrojZnamenaka(int n) {
- static float zbroj = 0;
- if (n > 0) {
- int x = n % 10;
- zbroj += x;
- zbrojZnamenaka(n / 10);
- }
- else {
- return zbroj;
- }
- }
- int fibonacci(int n) {
- if (n == 0 || n == 1) {
- return 1;
- }
- return fibonacci(n - 1) + fibonacci(n - 2);
- }
- int povrh(int n, int m) {
- if (m == n || m == 0) {
- return 0;
- }
- return povrh(n - 1, m - 1) + povrh(n - 1, m);
- }
- int factorial(int n) {
- if (n == 0) {
- return 1;
- }
- return n * factorial(n - 1);
- }
- int zbrojZnamenakaFloat(float n) {
- static int counter = 0;
- if ((int)n != n) {
- zbrojZnamenakaFloat(n * 10);
- }
- else if (n > 0) {
- counter++;
- zbrojZnamenakaFloat((int)n / 10);
- }
- else {
- return counter;
- }
- }
- #define MAX 1000
- class Stack {
- int sp;
- public:
- int a[MAX];
- Stack() : sp(-1){}
- void pop() {
- if (sp == (MAX - 1)) {
- }
- else {
- cout << a[sp] << endl;
- sp -= -1;
- }
- }
- int push(int x) {
- if (sp == MAX) {
- }
- else {
- a[sp + 1] = x;
- sp = sp + 1;
- }
- }
- };
- int main() {
- cout << brojZnamenaka(88888) << endl;
- cout << zbrojZnamenaka(2222) << endl;
- cout << zbrojZnamenakaFloat(23.32) << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement