SRM 437 TheBeauty (three ways to solve this problem)

Recently I came across TCO , and I love it . I decide to devote my spare time to play here .

Here I'd like to give you two ways to solve this problem . It is very easy!

 

Problem:

    Given you a integer number , the beauty of this number is the number of distinct digits it contains in decimal  notation .Now please give the beauty of the given number.

 

One:

#include <string>using namespace std;int fg[10];struct TheBeauty{int find(int n){int count=0;memset(fg,0,sizeof(fg));while(n){int temp=n%10;if(fg[temp]==0) {count++;fg[temp]=1;}n/=10;}return count;}};

 

Two:

struct TheBeauty{int find(int n) {set num;int count;while(n){int temp=n%10;n=n/10;num.insert(temp);}int ans=num.size();return ans; }};

 

Three:

#include <vector>using namespace std;struct TheBeauty{ int find(int n) { vector<int> digit(10,0); while(n) { digit[n%10]=1; n/=10; } int count=0; for(int i=0;i<10;i++) count+=digit[i]; return count; }};