1 solutions
-
0
C :
#include<stdio.h> int main() { int t,i,n,d,a[10]; scanf("%d",&t); while(t--) { scanf("%d",&n); i=d=0; while(n) { a[i]=n%10; n=n/10; i++; } while(i--) { if(a[i]==0||a[i]==4||a[i]==6||a[i]==9) d++; else if(a[i]==8) d=d+2; } printf("%d\n",d); } return 0; }C++ :
#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> using namespace std; int a[10]={1,0,0,0,1,0,1,0,2,1}; int i,t,n,ans; int main() { cin>>t; for(i=1;i<=t;i++) { ans=0; cin>>n; while(n!=0) { ans=a[n%10]+ans; n/=10; } cout<<ans<<endl; } return 0; }
- 1
Information
- ID
- 19636
- Time
- 1000ms
- Memory
- 32MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By