栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

zoj 3457 Absence Number

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

zoj 3457 Absence Number

#include<stdio.h>#include<math.h>#include<string.h>int f[100];int ans[100]={76344,27839,2938,5246,8662,13161,7412,7843,3386,4566,8596,981,1654,5609,2623,11357,5703,13634,1269,7067,10146,7748,1017,2006,13987,2737,1007,9269,2191,9633,5637,17406,4746,327,19798,10219,6902,11815,7869,731,5972,5473,8849,9822,3222,16274,2751,22414,2183,5974,7573,5391,6837,8762,7747,1962,5629,9691,10158,1493,1462,15796,3594,8109,2359,14382,339,6873,19194,10262,5459,5163,20049,4028,3113,27279,1003,3924,1937,2679,5183,3378,2969,21395,13907,3074,4911,827,6471,4279,2283,8465,2538,527,17751,7526,9422,7345,5083,791};int check(int x){memset(f,0,sizeof f);int len=x+3,carry=1,pre=0,now=0,i;while(carry<x)carry*=10;for(i=0;i<len;i++){now=carry/x;carry=carry%x;carry*=10;f[pre*10+now]=1;pre=now;}int flag=-1;for(i=0;i<=99;i++){if(f[i]==0&&flag==-1){flag=i;}else if(flag!=-1&&f[i]==0)return -1;}return flag;}int main(){int n;while(scanf("%d",&n)!=EOF){printf("%dn",ans[n]);}return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/374773.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号