#include<stdio.h>
#include<math.h>
#define N 2000
int count = 0;
int Isprime(int n);
void Firtrow(int a[]);
void Secondrow(int a[],int b[]);
void Exam(int a[],int b[]);
void Printf(int a[],int m,int i);
int main()
{
int st[N] = {0},nd[N] = {0};
Firtrow(st);
Secondrow(st,nd);
Exam(nd,st);
return 0;
}
int Isprime(int n)
{
int i;
if(n == 1)
{
return 0;
}
for(i = 2;i <= sqrt(n);i ++)
{
if(n % i == 0)
{
return 0;
}
}
return 1;
}
void Firtrow(int a[])
{
int i,m;
m = 0;
for(i = 1;i <= 2000;i ++)
{
if(Isprime(i))
{
a[m] = i;
m ++;
}
}
}
void Secondrow(int a[],int b[])
{
int i;
for(i = 0;a[i + 1] != 0;i ++)
{
b[i] = a[i + 1] - a[i];
}
}
void Exam(int a[],int b[])
{
int i,sum,m,flag;
sum = flag = 0;
for(m = -1;a[m + 1] != 0;m ++)
{
for(i = m + 1;sum < 1898 && flag == 0 && i < N;i ++)
{
sum += a[i];
if(sum == 1898)
{
flag = 1;
}
}
if(flag == 1)
{
count ++;
flag = 0;
Printf(b,m,i);
}
}
}
void Printf(int a[],int m,int i)
{
printf("There are follwing primes in first row :\n");
printf("(%d).%3d,......,%d\n",count,a[m + 1],a[i - 1]);
}