哪位仁兄可以用C语言帮我写一个生日快乐的小程序 就是已输入生日 最后可以出现生日蛋糕的图像

#include <iostream>

#include <cmath>

#include <cstdio>

using namespace std

const int inf=0xfffffff

int preminv[21]

int ri[21],hi[21]

int total,floornum

int ans

int dfs (int n,int v,int s,int maxr,int maxh)

{

int res

int i,tmpr,tmph,tmpsum

if (n>floornum){

if (v==total &&s+ri[1]*ri[1]<ans){

ans = s+ri[1]*ri[1]

return 1

}

}

for (ri[n]=maxr-1 ri[n]>=floornum-n+1 ri[n]--){

res = 2.0*(total-v)/ri[n] + ri[1]*ri[1]

if (res + s >= ans) continue

for (hi[n]=maxh-1 hi[n]>=floornum-n+1 hi[n]--){

if (v+ri[n]*ri[n]*hi[n]+preminv[floornum-n]>total) continue

tmpr = ri[n] ,tmph = hi[n],tmpsum = 0

for (i=n i<=floornum i++){

tmpsum += tmpr*tmpr*tmph

tmpr-- , tmph--

}

if (v+tmpsum<total) continue

dfs(n+1,v+ri[n]*ri[n]*hi[n],s+2*ri[n]*hi[n],ri[n],hi[n])

}

}

return 1

}

int main()

{

int tmpv,tmpr,tmph

int i

tmpv=0

for (i=1 i<21 i++){

tmpv += i*i*i

preminv[i] = tmpv

}

while (scanf("%d%d",&total,&floornum)!=EOF){

ans = inf

tmpv = total - preminv[floornum-1]

if (tmpv>0){

tmpr = sqrt (1.0*tmpv/floornum) + 1

tmph = 1.0*tmpv/(floornum*floornum) + 1

dfs(1,0,0,tmpr,tmph)

}

if (ans==inf){

ans = 0

}

printf("%d\n",ans)

}

return 0

}

输出几兆茄就是星期几族孙察，0为星期天

#include<stdio.h>

int a[12]={31,28,31,30,31,30,31,31,30,31,30,31}

int isrun(int y)

{ int flag=0

if ((y%400==0) || (y%100!=0 &&y%4==0))

flag=1

return flag

}

void main()

{

int y,m,d,i,total=0,wd

printf("\nPlease input the date(eg:20071006):")

scanf("%4d%2d%2d"凯穗,&y,&m,&d)

if(isrun(y))

a[1]=29

for(i=0i<m-1i++)

total+=a[i]

total+=d

for(i=1i<yi++)

{

total+=365

if(i%4==0)

total++

}

wd=total%7

printf("%d",wd)

}

---