forked from kothariji/competitive-programming
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEasySum.cpp
76 lines (64 loc) · 1.07 KB
/
EasySum.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include<bits/stdc++.h>
using namespace std;
void input(int arr[100],int &len)
{
cin>>len;
for(int i=0;i<len;i++)
{
cin>>arr[i];
}
}
bool linear(int b[100],int n,int len2)
{
int flag=0;
for(int i=0;i<len2;i++)
{
if(b[i]==n)
{
flag=1;
return true;
}
}
if(flag==0)
return false;
}
int main()
{
int len,len2,a[100],b[100],c[100],i,j,upper,lower;
input(a,len);
input(b,len2);
lower=b[0]-a[0];
upper=b[len2-1]-a[len-1];
int flag,k=0;
for(i=lower;i<=upper;i++)
{
flag=1;
for(j=0;j<len;j++)
{
if(linear(b,(i+a[j]),len2))
{
flag=1;
}
else
{
flag=0;
break;
}
}
if(flag==1)
{
c[k]=i;
k++;
}
}
//for printing the result
for(i=0;i<k;i++)
{
cout<<c[i];
if(i<k-1)
{
cout<<" ";
}
}
return 0;
}