prasad

 #include<iostream>

using namespace std;
int main()
{



}
int OddEvenFine(int date,int cars[],int n)
{

if(date%2==0)
{
int sum=0;
for(int i=0;i<n;i++)
{
if(cars[i]%2!=0)
{
sum=sum+250;
}
}
return sum;
}
else
{
int sum2=0;
for(int i=0;i<n;i++)
{
if(cars[i]%2==0)
{
sum2=sum2+250;
}
}
return sum2;
}


}

Comments

Popular posts from this blog

Problem no 18(array):count the number of pairs in array whose sum is equal to the given number.

convert the integer number to its binary representation.

Tcs assessment problem: museum problem.