#include <iostream>
using namespace std;
void hanoi(int n,char a, char b,char c) {
if(n==1)
cout<<n<<" "<<a<<" "<<c<<endl;
else {
hanoi(n-1,a,c,b);
cout<<n<<" "<<a<<" "<<c<<endl;
hanoi(n-1,b,a,c);
}
}
int main() {
int n;
cin>>n;
hanoi(n,'A','B','C');
return 0;
}#include <cstdio>
#define N 1005
using namespace std;
int num[N];
int main() {
int a1=1,n,x;
scanf("%d", &n);
num[1] = 1;
for(int i=1; i<=n; ++i) {
x=0;
for(int j=1; j<=a1; ++j) {
num[j] = num[j] * 5 + x;
x = num[j] / 10;
num[j] %= 10;
}
if (x > 0) num[++a1] = x;
}
printf("0.");
for(int i=a1; i<n; ++i) {
putchar('0');
}
for(int i=a1; i>=1; i--) {
printf("%d", num[i]);
}
putchar('\n');
return 0;
}#include <iostream>
using namespace std;
int l,n,m,a[50005], ans;
bool check(int dis)
{
int count=0,last=0;
for(int i=1; i<=n; i++)
if(a[i]-last<dis)count++;
else last=a[i];
if(count>m)return 0;return 1;
}
int main()
{
ios::sync_with_stdio(0);
cin>>l>>n>>m;
for(int i=1; i<=n; i++)
cin>>a[i];
a[n+1]=l;
int fl=0,fr=l;
while(fl<=fr)
{
int mid=(fl+fr)/2;
if(check(mid))fl=mid+1, ans=mid;
else fr=mid-1;
}
cout<<ans ;
return 0;
}
#include<iostream>
using namespace std;
int main()
{
int edgs;
int points ;
int dis[10];
int flag[10];
int infinity=999999;
cin>>points>>edgs ;
int edg[10][10];
for (int i=1; i<=points; i++) // 初始化
{
for (int j=1; j<=points; j++)
{
if (i==j)
{
edg[1][j]=___(1)___;
}
else
{
edg[i][j]=___(2)___;
}
}
}
int point1 , point2 , quanzhi ;
for (i=1; i<=edgs; i++)
{
cin>>point1>>point2>>quanzhi ;
edg[point1][point2]= ___(3)___ ;
}
for (i=1; i<=points; i++)
{
dis[i]=edg[1][i];
}
for (i=1; i<=points; 1++)
{
flag[i]=0;
}
flag[1]=1;
int min,u;
for (i=1; i<=points-1; i++)
{//源点到源点不用比较，因次总的次数少一次
min=infinity;
for (int j=1; j<points; j++)
{
if (f1ag[j]==0&&dis[j]<min)
{//核心思想:依次比较出离源点最近的点
min=___(4)___;
u=j;
}
}
flag[u]=1;
for (int v=1; v<=points; v++)
{//找出离源点最近的点后更新dis里面的源点到各个点的值是否最小
if (edg[u][v]<infinity)
{
if (dis[v]>dis[u]+edg[u][v])
{
dis[V]=___(5)___;
}
}
}
}
for (i=1; i<=points; i++)
{
cout<<dis[i]<" ";
}
cout<<endl;
}
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int total_weight = 10;
int w[6] = { 0,5,4,3,2,1};
int v[6] = { 0,1,2,3,4,5};
int dp[11]= { ___(1)___ };
for(int i=1; i<=___(2)___; i++)
for(int j=w[i]; j<=___(3)___; j++)
dp[j] =___(4)___;
cout <<___(5)___<< endl;
return 0;
}