龙珠z真武道会2(New Rich有什么用)

#include <stdio.h>
int bw(int);
int ww(int);
void main()
{
int nian, yue , ri ;
int wb =0 ;

printf("输入你需要的日期，使用-分割");

scanf ("%d-%d-%d",&nian ,&yue ,&ri);

switch (yue)
{
else:
ww ( int ri );

printf("今天是今天的第%d天\n", wb);

}

}
int bw(int nian)
{
int pingrunnian;
pingrunnian=(nian%4 == 0 && (nian %100 == 0 || nian % 400 != 0));
return pingrunnian;
}

int ww(int yue)
{
int yuefentianshu = (case 12 , 10 , 7 , 5:)
(wb += 30);
(case 11 , 9 , 8 , 6 , 4 , 2:)
(wb += 31);
(case 3:)
(wb += 28 + bw(nian));

(case 1:)
(wb += ri);
}