2015年华为上机题

#include<iostream>
using namespace std;
long long product(long long data){
long long ret = 1;
while(data > 0){
int tmp = data % 10;
if(tmp == 0)
return 0;
else
ret *= tmp;
data = data / 10;
}
return ret;
}
int main(){
long long data;
cin>>data;
cout<<product(data)<<endl;
return 0;
}

#include<iostream>
#include<algorithm>
using namespace std;
int maxInt(int data[]){
sort(data, data + 10);
int res[3] = {0};
res[0] = data[9];
for(int i = 8, j = 1; i >= 0 && j < 3; --i){
if(data[i] == data[i + 1])
continue;
else{
res[j] = data[i];
j++;
}
}
return res[0] * 100 + res[1] * 10 + res[2];
}
int main(){
int data[10];
for(int i = 0; i < 10; ++i)
cin>>data[i];
cout<<maxInt(data)<<endl;
return 0;
}

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
bool isYiDong(string str)
{
bool flag=false;

if(str[3]=='_'&&str[8]=='_'&&str[0]=='1'&&str.size()==13)
flag=true;
return flag;
}
bool isGuDing(string str)
{
bool flag=false;

if((str[0]=='6'||str[0]=='8')&&str[4]=='_'&&str.size()==9)
flag=true;
return flag;
}
int main()
{
string str;
cin>>str;
if(isYiDong(str))
cout<<"MOBILE";
else if(isGuDing(str))
cout<<"PSTN";
else
cout<<"ERROER";
return 0;

}