- 圆周率
- @ 2026-04-21 21:10:58
#include<bits/stdc++.h>
using namespace std;
int a[102]={0,3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3,2,3,8,4,6,2,6,4,3,3,8,3,2,7,9,5,0,2,8,8,4,1,9,7,1,6,9,3,9,9,3,7,5,1,0,5,8,2,0,9,7,4,9,4,4,5,9,2,3,0,7,8,1,6,4,0,6,2,8,6,2,0,8,9,9,8,6,2,8,0,3,4,8,2,5,3,4,2,1,1,7,0,6,8,0},n;
int main()
{
cin>>n;
if (a[n+1]>=5)
a[n]+=1;
for (int i=1;i<=n+1;i++)
{
cout<<a[i];
if (i==1)
cout<<".";
}
return 0;
}
1 条评论
-
202603zj11张轩铭 (张轩铭) LV 8 @ 2026-04-23 22:29:14
#include<bits/stdc++.h> using namespace std; int a[102]={0,3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3,2,3,8,4,6,2,6,4,3,3,8,3,2,7,9,5,0,2,8,8,4,1,9,7,1,6,9,3,9,9,3,7,5,1,0,5,8,2,0,9,7,4,9,4,4,5,9,2,3,0,7,8,1,6,4,0,6,2,8,6,2,0,8,9,9,8,6,2,8,0,3,4,8,2,5,3,4,2,1,1,7,0,6,8,0},n; int main() { cin>>n; if(a[n+1]>=5)a[n]+=1; cout<<a[1]<<"."; for(int i=2;i<=n+1;i++)cout<<a[i]; return 0; }
- 1
信息
- ID
- 1871
- 难度
- 6
- 分类
- (无)
- 标签
- 递交数
- 43
- 已通过
- 12
- 通过率
- 28%
- 被复制
- 6
- 上传者