1. Get the material that you need
2. Open the ice cream
3. Scoop out the ice cream using your materials
4. Put that scoop in a bowl
Answer:
Following are the response to the given question:
Explanation:
Build a spring, sink, vertices, and vertices for each car for a household. Every unit in the stream is a human. Attach the source from each vertical of a family with such a capacity line equivalent to the family size; this sets the number of members in each household. Attach every car vertices to the sink with the edge of the car's passenger belt; this assures the correct number of people for every vehicle. Connecting every vertex in your household to any vertex in your vehicle with a capacity 1 border guarantees that one family member joins a single car. The link between both the acceptable allocation of people to vehicles as well as the maximum flow inside the graph seems clear to notice.
Answer:
#include <iostream>
using namespace std;
int main()
{
string s;
cin>>s; //reading string
int i,j;
bool has_dups=false;
int n= s.length();
for(i=0;i<n;i++) //to check for duplicate characters
{
for(j=0;j<n;j++)
{
if(j!=i && s[i]==s[j]) //to check if it is matched with itself
{
has_dups=true; //if true no need to check others
break;
}
}
}
cout<<has_dups;
return 0;
}
OUTPUT :
California
1
Explanation:
Above program finds if a character repeat itself in the string entered by user.
Answer:
Greeting with a smile, open handed gestures, and making eye contact
Explanation:
I used this on E2020 and got it right
