Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 1.
- #include "stdafx.h"
- #include <iostream>
- using namespace std;
- int DivEtImp(int v[], int st, int n)
- {
- if (st == n)
- {
- return v[st];
- }
- else
- {
- int mij = + (n - st) / 2;
- int a = DivEtImp(v, st, mij);
- int b = DivEtImp(v, mij + 1, n);
- return(a * b);
- }
- }
- 2.
- int x[100],n;
- void citire(int p,int q)
- {int m;
- if(p==q) cin>>x[p];
- else {m=(p+q)/2;
- citire(p,m);
- citire(m+1,q); }
- }
- int suma(int p,int q)
- {int s1,s2,m;
- if(p==q) if(x[p]%2!=0) return x[p];
- else return 0;
- else {m=(p+q)/2;
- s1=suma(p,m);
- s2=suma(m+1,q);
- return s1+s2;}
- }
- void main()
- { cin>>n;
- citire(1,n)
- cout<<suma(1,n); }
- 3.
- #include <iostream>
- int f(int st,int n)
- {
- if(st==n)
- factorial(1,st);
- else
- {
- int mij = (st+n)/2;
- return sir(st,mij)+sir(mij+1,n);
- }
- }
- 4.
- int nrp(int st,int n)
- {
- if(st==n){
- if(v[st]%2)
- return 0;
- else
- return 1;
- } else
- {
- int mij = (st+n)/2;
- return nrp(st,mij)+nrp(mij+1,n);
- }
- }
- 5.
- int f(int st,n)
- if(st==n){
- if(v[st])
- return 1;
- else
- return 0;
- } else
- {
- int mij = (st+n)/2;
- return f(st,mij)+f(mij+1,n);
- }
- }
- 6.
- int cmmdc(int st,int n)
- {
- if(st==n)
- return v[st];
- else
- {
- int a,b;
- a = cmmdc(st,(st+n)/2);
- b= cmmdc((st+n)/2+1,n);
- while(a!=b)
- if(x>y)
- x-=y;
- else
- y-=x;
- return x;
- }
- }
- 7.
- int apare(int st,int n,int x)
- {
- if(int st==n)
- {
- if([v]st==x)
- return 1;
- return 0;
- } else
- {
- int mij = (st+n)/2;
- return apare(st,mij,x)+apare(mij+1,n,x);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement