Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- ///ifstream f("cifre12.in");
- ///ofstream g("cifre12.out");
- int seg[]={6,2,5,5,4,5,6,3,7,6};
- int nr[]={1,5,1,2,2,3,1,2,0,0};
- int tot[]={2,7,2,3,3,4,2,5,1,2};
- int main()
- { unsigned long long n,v;
- int s=0;
- cin>>v>>n;
- if(v==1)
- {
- while(n)
- {
- s+=seg[n%10];
- n/=10;
- }
- cout<<s<<"\n";
- }
- if(v==2)
- {
- int fr[25];
- unsigned long long solutie = 0;
- int k = 0;
- while(n)
- {
- fr[++k]=n% 10;
- n/=10;
- }
- for(int i=1;i<=k;++i)
- {
- unsigned long long p=nr[fr[i]];
- for(int j = 1; j < i; ++j)
- p=p*tot[fr[j]];
- solutie+=p;
- }
- cout<<solutie;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement