Answer:
The second one:
int sum = 0; for (int i = 0; i < values.length; i++) { if ((values[i] % 2) == 0) { sum += values[i]; } }
Excel Macros, or .xlsm, stores automated steps for repetitive tasks.
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:
Explanation:
The one which best describes it is Co-opetition. Co-opetition often takes place when companies which are in the same market work put aside their differences and work together in the gathering of knowledge and research of new products, but they still compete for market-share of their products and in the application of the joint knowledge created.
