# Square Transaction

Problem:-

Square Inc. processes thousands of transactions daily amounting to millions of dollars. They also have a daily target that they must achieve. Given a list of transactions done by Square Inc. and a daily target your task is to determine at which transaction does Square achieves the same.

Input:
First line contains T, number of transactions done by Square in a day.
The following line contains T integers, the worth of each transactions.
Next line contains Q, the no of queries.
Next Q lines contain an integer each representing the daily target.

Output:
For each query, print the transaction number where the daily limit is achieved or -1 if the target can’t be achieved.

Constraints:
1<= T <=100000
1<= Ai <=1000
1<= Target <= 109
1<=Q<=1000000

Problem statement in native language : http://hck.re/7Hb1a3

Sample Input
`51 2 1 3 434210`
Sample Output
`325`
Time Limit: 1
Memory Limit: 256
Source Limit:

Code:-

#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long int a[n],target,sum=0;
for(int i=1;i<=n;i++)
cin>>a[i];
int q;
cin>>q;
while(q–)
{
cin>>target;
sum=0;
int flag=0;
for(int i=1;i<=n;i++)
{
sum=sum+a[i];
if(sum>=target)
{
cout<<i<<endl;
flag=1;
break;
}
}
if(flag==0)
cout<<“-1”<<endl;
}
}