You are on page 1of 3

1)CANDIES PROBLEM:

#include <iostream>

using namespace std;

int main()

int t;

cin>>t;

while(t--)

int n,i,sum=0,k=0;

cin>>n;

int a[n];

for(i=0;i<n;i++)

{ cin>>a[i];

sum=a[0];

for(i=1;i<n;i++)

{ sum=sum+a[i];

k=k+sum;

cout<<endl;

cout<<k;

}
2) STONE PROBLEM:

#include<iostream>

using namespace std;

int main()

int t;

cin>>t;

while(t--)

int n,i,k;

cin>>n;

cin>>k;

int a[n];

for(i=0;i<n;i++)

cin>>a[i];

int b[k],c[k];

for(i=0;i<k;i++)

cin>>b[i];

for(i=0;i<k;i++)

{
cin>>c[i];

int l=0,p=0;

for(i=0;i<n;i++)

if(b[0]<=a[i]&&a[i]<=b[1])

l++;

if(c[0]<=a[i]&&a[i]<=c[1])

p++;

cout<<endl;

cout<<l<<" "<<p;

You might also like