phần mềm c++,giai cơ bản nhất giúp e

Code bài 9:

#include <bits/stdc++.h>
using namespace std;
#define int long long
void bai9(){
	cout<<"Nhap chieu dai cua day: ";
	int n;
	cin>>n;
	cout<<"Nhap phan tu dau tien: ";
	int val;
	cin>>val;
	cout<<"Nhap gia tri cua cap so cong: ";
	int c;
	cin>>c;
	cout<<"Day cap so cong: ";
	int saveVal=val;
	cout<<val<<" ";
	for(int i=2;i<=n;i++){
		val+=c;
		cout<<val<<" ";
	}
	cout<<"\nNhap gia tri cua cap so nhan(d): ";
	int d;
	cin>>d;
	cout<<"Day cap so nhan: ";
	val=saveVal;
	cout<<val<<" ";
	for(int i=2;i<=n;i++){
		val*=d;
		cout<<val<<" ";
	}
	
}
signed main(){
	bai9();
}

bài 10:

#include <bits/stdc++.h>
using namespace std;
#define int long long
void bai10() {
	int n;
	cin>>n;
	int a[n+5];
	for(int i=1; i<=n; i++) {
		cin>>a[i];
	}
	int diff=a[2]-a[1];
	if(n==2) {
		cout<<"Day cap so cong\n";
	} else if(diff<0) {
		cout<<"Khong phai day cap so cong\n";
	} else {
		bool ok=true;
		for(int i=2; i<n; i++) {
			if(a[i+1]-a[i]<0||a[i+1]-a[i]!=diff) {
				cout<<"Khong phai day cap so cong\n";
				ok=false;
				break;
			}
		}
		if(ok){
			cout<<"Day cap so cong\n";
		}
	}
	if(a[2]%a[1]!=0){
		cout<<"Khong phai day cap so nhan\n";
	}
	else{
		bool ok=true;
		int remind=a[2]/a[1];
		for(int i=2;i<n;i++){
			if(a[i]*remind!=a[i+1]){
				cout<<"Khong phai day cap so nhan\n";
				ok=false;
				break;
			}
		}
		if(ok){
			cout<<"Day cap so nhan";
		}
	}
}
signed main() {
	bai10();
}

bài 9:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long nmax = 1e6;
ll a, d, n, r;
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);cout.tie(NULL);
  cin >> a >> d >> n;
  for (ll i = 0; i < n; ++i)
  {
    ll c = a + i * d;
    cout << c << " ";
  }
  cout << '\n';
  cin >> r;
  for (ll i = 0; i < n; ++i)
  {
    ll c = a * pow(r, i);
    cout << c << " ";
  }
}

bài 10:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long nmax = 1e6;
bool kiemtracapsocong (vector<ll> &a)
{
  ll n = a . size();
  if (n <= 1) return true;
  ll d = a[1] - a[0];
  for (ll i = 1; i < n - 1; ++i){
    if (a[i + 1] - a[i] != d)
    {
      return false;
    }
  }
  return true;
}
bool kiemtracapsonhan (vector<ll> &a)
{
  ll n = a . size();
  if (n <= 1) return true;
  ll r = a[1] / a[0];
  for (ll i = 1; i < n; ++i)
  {
    if (a[i + 1] / a[i] != r)
    {
      return false;
    }
  }
  return true;
}
ll n;
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);cout.tie(NULL);
  cin >> n;
  vector<ll> a(n);
  for (ll i = 0; i < n; ++i) cin >> a[i];
  if (kiemtracapsocong(a)) cout << "day a la cap so cong";
  else cout << "day a khong la cap so cong";
  cout << '\n';
  if (kiemtracapsonhan(a)) cout << "day a la cap so nhan";
  else cout << "day a khong la cap so nhan";
}