用户:
落叶乘秋查看:7 回复:8 评论:7 创建时间:2022-09-25T08:47:14
imgsrc="https://static.codemao.cn/emoji/codemao/%E7%BC%96%E7%A8%8B%E7%8C%AB_%E6%90%93%E5%A4%B4.gif"alt="emotion_编程猫_搓头"
落叶乘秋大家好imgsrc="https://static.codemao.cn/emoji/codemao/%E7%BC%96%E7%A8%8B%E7%8C%AB_%E5%97%A8%E8%B5%B7%E6%9D%A5.gif"alt="emotion_编程猫_嗨起来"
点赞0
评论
落叶乘秋#include<iostream>
using namespace std;
bool run(int x)
{
if(x%4==0&&x%100!=0)
{
return 1;
}
if(x%400==0)
{
return 1;
}
else if(x%4!=0)
{
return 0;
}
}
bool yue(int c)
{
if(c!=2&&c<=12)
{
return 1;
}
else return 0;
}
bool yue_31or30(int b)
{
if((b==1||b==3||b==5||b==7||b==8||b==10||b==12)&&b<=12)
return 1;
else if((b==4||b==6||b==9||b==11)&&b<=12)
return 0;
}
int main()
{
int y,m;
cin>>y>>m;
if(yue(m))
{
if(yue_31or30(m))
{
cout<<31;
}
else cout<<30;
}
else
{
if(run(y))
{
cout<<29;
}
else cout<<28;
}
return 0;
}点赞0
评论
落叶乘秋#include<bits/stdc++.h>
#define maxn 100
using namespace std;
struct Bigint
{
int len,a[maxn];
Bigint(int x=0)
{
memset(a,0,sizeof(a));
for(len=1;x;len++)
{
a[len]=x%10,x=x/10;
}
len--;
}
int &operator[](int i)
{
return a[i];
}
void flatten(int L)
{
len=L;
for(int i=1;i<=len;i++)
{
a[i+1]+=a[i]/10,a[i]%=10;
}
for(;!a[len];)
{
len--;
}
}
void print()
{
for(int i=max(len,i);i>=1;i--)
{
printf("%d",a[i]);
}
}
};
Bigint operator+(Bigint a,Bigint b)
{
Bigint c;
int len=max(a.len,b.len);
for(int i=1;i<=len;i++)
{
c[i]+=a[i]+b[i];
}
c.flatten(len+1);
return c;
}
Bigint operator*(Bigint a,int b)
{
Bigint c;
int len=a.len;
for(int i=1;i<=len;i++)
{
c[i]=a[i]*b;
}
c.flatten(len+11);
return c;
}
int main()
{
Bigint ans(0),fac(1);
int m;
cin>>m;
for(int i=1;i<=m;i++)
{
fac=fac*i;
ans=ans+fac;
}
ans.print();
return 0;
}
无聊啊
点赞0
评论