Răspuns:
#include <iostream>
using namespacestd;
int v[50],ok=0,n;
int main(){
cin>>n;
for(int i=0;i<n;i++)cin>>v[i];
for(int i=0;i<n;i++){
if(v[i]==v[i-1]*(v[2]/v[1]))ok=1;
else ok=0;
}
if(ok==1)cout<<"Sirul de numere se afla in progresie geometrica";
else cout<<"Sirul nu se afla in progresie geometrica";
}
^^Program care detecteaza daca un sir de numere este in progresie geometrica
#include <iostream>
using namespace std;
int v[50],ok=0,n;
int main(){
cin>>n>>v[1]>>v[2];
for(int i=3;i<n;i++){
v[i]=v[i-1]*(v[2]/v[1]);
cout<<v[i]<<endl;
}
}
^^Program care genereaza sir de n numere in progresie geometrica
