Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Khai bao cac ham thu vien neu co
- #include<stdio.h>
- #include<conio.h>
- #define SIZE 1000
- void nhap(long a[],int &n)
- {
- scanf("%d",&n);
- for(int i=0;i<n;i++)
- {
- scanf("%ld",&a[i]);
- }
- }
- // kiem tra cap so cong
- long KiemTraCapSoCong(long a[], int n, long &d)
- {
- d = a[1] - a[0];
- long flag = 1;
- for(int i = 2; i < n - 1; i++)
- {
- if((a[i + 1] - a[i]) != d)
- {
- flag = 0;
- break;
- }
- }
- return flag;
- }
- // uoc chung long nha
- long ucln(long a,long b)
- {
- while (a!=b)
- {
- if(a>b)
- {
- a=a-b;
- }
- else
- {
- b=b-a;
- }
- }
- return a;
- }
- void main()
- {
- int n;
- long a[SIZE],d;
- nhap(a,n);
- if(KiemTraCapSoCong(a,n,d)==1)
- {
- printf("%ld",d);
- }
- else
- {
- printf("%ld",ucln((a[0]),(a[n-1])));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement