UVa - 1225 - Digit Counting
2018-02-04 16:30
239 查看
UVa - 1225 - Digit Counting
题解:因为N的值很小,直接统计每个数的各位数记录在数组即可。
AC代码:#include<cstdio>
using namespace std;
const int maxn = 10007;
int a[maxn][10];
int t,n;
int main()
{
scanf("%d",&t);
for(int i=1;i<=10000;i++)
{
int now = i;
for(int j=0;j<10;j++)a[i][j]=a[i-1][j];
while(now>0)
{
int k = now%10;
a[i][k]++;
now/=10;
}
}
while(t--)
{
scanf("%d",&n);
for(int i=0;i<9;i++)printf("%d ",a
[i]);
printf("%d\n",a
[9]);
}
return 0;
}
题解:因为N的值很小,直接统计每个数的各位数记录在数组即可。
AC代码:#include<cstdio>
using namespace std;
const int maxn = 10007;
int a[maxn][10];
int t,n;
int main()
{
scanf("%d",&t);
for(int i=1;i<=10000;i++)
{
int now = i;
for(int j=0;j<10;j++)a[i][j]=a[i-1][j];
while(now>0)
{
int k = now%10;
a[i][k]++;
now/=10;
}
}
while(t--)
{
scanf("%d",&n);
for(int i=0;i<9;i++)printf("%d ",a
[i]);
printf("%d\n",a
[9]);
}
return 0;
}
相关文章推荐
- UVA - 1225 Digit Counting
- Digit Counting UVA - 1225
- UVa 1225 - Digit Counting
- UVa 1225 Digit Counting(数字统计)
- UVa 1225 - Digit Counting
- Uva1225-Digit Counting-数数字
- (解题报告)Uva-1225 --- Digit Counting
- UVA-1225 Digit Counting
- UVA - 1225 Digit Counting
- Problem 009——UVa 1225 - Digit Counting
- 算法竞赛入门经典习题3-3数数字(Digit Counting,ACM/IMPC Danang 2007,UVa1225)
- UVa 1225 Digit Counting
- UVa 1225 Digit Counting (枚举)
- 算法竞赛入门经典第三章3-3 Digit Counting UVA - 1225
- UVa1225-Digit Counting
- UVa-1225 - Digit Counting
- 【习题3-3】 UVA - 1225 Digit Counting
- 数数字(Digit Counting,ACM/ICPC Danang 2007,UVa1225)
- UVa 1225 - Digit Counting
- UVA Digit Counting UVA - 1225