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

poj 1352 Quantity of White Mice

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

poj 1352 Quantity of White Mice

#include<iostream>#include<string.h>#include<stdio.h>using namespace std;#define maxn 40int n,m,k,sur_num,born_num;int mice[maxn][maxn];char s[20];void Init(){    memset(mice,0,sizeof(mice));    for(int i = 0; i <= 6; i++)        mice[i][i] = 1;}void change(){    int i,t;    n = m = k = 0;    t = 1,i = strlen(s)-1;    while(s[i] != ',')    {        k += t * (s[i]-'0');        t *= 10;        i--;    }    t = 1,i--;    while(s[i] != ',')    {        m += t * (s[i]-'0');        t *= 10;        i--;    }    t = 1,i--;    while(s[i] != ',' && i >= 0)    {        n += t * (s[i]-'0');        t *= 10;        i--;    }}void solve(){    int i,j;    for(i = 7; i <= k; i++)    {        sur_num = born_num = 0;        for(j = 1; j <= n-1; j++) sur_num += mice[i-1][j];        if(sur_num > 100) mice[i][1] = born_num;        else        { born_num += mice[i-1][6] + mice[i-1][7]; for(j = 1; j <= m; j++)     born_num += 2 * mice[i-1][7+j]; mice[i][1] = born_num;        }        for(j = 2; j <= n; j++) mice[i][j] = mice[i-1][j-1];    }}void print(){    int tal = 0;    for(int j = 1; j <= n; j++)        tal += mice[k][j];    printf("%s: %dn",s,tal);}int main(){    while(scanf("%s",s) && s[0] != '-')    {        int i,j;        Init();        change();        solve();        print();    }    return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/378712.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

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

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