10 条题解
-
1
夏冬宜
@ 2026-2-6 15:48:22
依旧肝帝 #include<iostream> #include<cstdio> #include<cstdlib> #include<algorithm> using namespace std; bool visit[10]={0}; bool flag=0; int main() { int a,b,c; cin>>a>>b>>c; for(int i1=1;i1<=9;i1++) { visit[i1]=1; for(int i2=1;i2<=9;i2++) { if(visit[i2])continue; visit[i2]=1; for(int i3=1;i3<=9;i3++) { if(visit[i3])continue; visit[i3]=1; for(int i4=1;i4<=9;i4++) { if(visit[i4])continue; visit[i4]=1; for(int i5=1;i5<=9;i5++) { if(visit[i5])continue; visit[i5]=1; for(int i6=1;i6<=9;i6++) { if(visit[i6])continue; visit[i6]=1; for(int i7=1;i7<=9;i7++) { if(visit[i7])continue; visit[i7]=1; for(int i8=1;i8<=9;i8++) { if(visit[i8])continue; visit[i8]=1; for(int i9=1;i9<=9;i9++) { if(visit[i9])continue; int n1=i1*100+i2*10+i3; int n2=i4*100+i5*10+i6; int n3=i7*100+i8*10+i9; if(double(n1)/n2==double(a)/b&&double(n2)/n3==double(b)/c) { flag=1; cout<<i1<<i2<<i3<<" "<<i4<<i5<<i6<<" "<<i7<<i8<<i9<<endl; } } visit[i8]=0; } visit[i7]=0; } visit[i6]=0; } visit[i5]=0; } visit[i4]=0; } visit[i3]=0; } visit[i2]=0; } visit[i1]=0; } if(!flag)cout<<"No!!!"; return 0; } -
1
夏冬宜
@ 2026-2-5 17:00:19
代码（打表的力量） #include<bits/stdc++.h> using namespace std; int main() { int a; cin>>a; switch(a) { case 1: cout<<1; return 0; case 2: cout<<3; return 0; case 3: cout<<9; return 0; case 4: cout<<33; return 0; case 5: cout<<153; return 0; case 6: cout<<873; return 0; case 7: cout<<5913; return 0; case 8: cout<<46233; return 0; case 9: cout<<409113; return 0; case 10: cout<<4037913; return 0; case 11: cout<<"43954713"; return 0; case 12: cout<<"522956313"; return 0; case 13: cout<<"6749977113"; return 0; case 14: cout<<"93928268313"; return 0; case 15: cout<<"1401602636313"; return 0; case 16: cout<<"22324392524313"; return 0; case 17: cout<<"378011820620313"; return 0; case 18: cout<<"6780385526348313"; return 0; case 19: cout<<"128425485935180313"; return 0; case 20: cout<<"2561327494111820313"; return 0; case 21: cout<<"53652269665821260313"; return 0; case 22: cout<<"1177652997443428940313"; return 0; case 23: cout<<"27029669736328405580313"; return 0; case 24: cout<<"647478071469567844940313"; return 0; case 25: cout<<"16158688114800553828940313"; return 0; case 26: cout<<"419450149241406189412940313"; return 0; case 27: cout<<"11308319599659758350180940313"; return 0; case 28: cout<<"316196664211373618851684940313"; return 0; case 29: cout<<"9157958657951075573395300940313"; return 0; case 30: cout<<"274410818470142134209703780940313"; return 0; case 31: cout<<"8497249472648064951935266660940313"; return 0; case 32: cout<<"271628086406341595119153278820940313"; return 0; case 33: cout<<"8954945705218228090637347680100940313"; return 0; case 34: cout<<"304187744744822368938255957323620940313"; return 0; case 35: cout<<"10637335711130967298604907294846820940313"; return 0; case 36: cout<<"382630662501032184766604355445682020940313"; return 0; case 37: cout<<"14146383753727377231082583937026584420940313"; return 0; case 38: cout<<"537169001220328488991089808037100875620940313"; return 0; case 39: cout<<"20935051082417771847631371547939998232420940313"; return 0; case 40: cout<<"836850334330315506193242641144055892504420940313"; return 0; case 41: cout<<"34289376947494122614363304694584807557656420940313"; return 0; case 42: cout<<"1439295494700374021157505910939096377494040420940313"; return 0; case 43: cout<<"61854558558074209658512637979453093884758552420940313"; return 0; case 44: cout<<"2720126133346522977702138448994068984204397080420940313"; return 0; case 45: cout<<"122342346998826717539665299944651784048588130840420940313"; return 0; case 46: cout<<"5624964506810915667389970728744906677010239883800420940313"; return 0; case 47: cout<<"264248206017979096310354325882356886646207872272920420940313"; return 0; case 48: cout<<"12678163798554051767172643373255731925167694226950680420940313"; return 0; case 49: cout<<"620960027832821612639424806694551108812720525606160920420940313"; return 0; case 50: cout<<"31035053229546199656252032972759319953190362094566672920420940313"; return 0; } return 0; } -
0
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; #define mem(a, b) memset(a, b, sizeof(a)) #define rep(i, a, b) for (int i = a; i <= b; ++i) #define rrep(i, a, b) for (int i = a; i >= b; --i) #define FOR(i, a, b) for (int i = a; i < b; ++i) #define pb push_back #define MP make_pair #define all(v) v.begin(), v.end() #define clr(v) v.clear() #define isEven(x) !(x & 1) #define yes cout<<"YES"<<endl #define no cout<<"NO"<<endl int main() { ios::sync_with_stdio ( false ); cin.tie ( 0 ); int a[10]; long long A,b,c,x,y,z,cnt=0; cin>>A>>b>>c; for(int i=1;i<=9;i++)a[i]=i; do{ x=a[1]*100+a[2]*10+a[3]; y=a[4]*100+a[5]*10+a[6]; z=a[7]*100+a[8]*10+a[9]; if(x*b==y*A&&y*c==z*b)printf("%lld %lld %lld\n",x,y,z),cnt++; }while(next_permutation(a+1,a+10)); if(!cnt)puts("No!!!"); return 0; } -
0
#include <bits/stdc++.h> #include <raylib.h> using namespace std; int main(){ int sw; int sh; cin>>sw>>sh; InitWindow(sw,sh,"Interactive Rose Curve-Raylib"); SetTargetFPS(60); float scale=200.0,a=1.0,k=5.0; Vector2 center={(float)sw/2,(float)sh/2}; bool useCos=0,animate=0; while(!WindowShouldClose()){ if(IsKeyPressed(KEY_UP))k+=0.5; if(IsKeyPressed(KEY_DOWN)&&k>0.5)k-=0.5; if(IsKeyPressed(KEY_LEFT)&&scale>10)scale-=10; if(IsKeyPressed(KEY_RIGHT))scale+=10; if(IsKeyPressed(KEY_SPACE))useCos=!useCos; if(IsKeyPressed(KEY_A))animate=!animate; if(animate){ float time=GetTime(); k=2+3*sin(time*0.5f); a=1+0.3f*sin(time*2); } BeginDrawing(); ClearBackground(RAYWHITE); DrawLine(0,center.y,sw,center.y,LIGHTGRAY); DrawLine(center.x,0,center.x,sh,LIGHTGRAY); DrawText("X",sw-20,center.y-10,16,GRAY); DrawText("Y",center.x+10,10,16,GRAY); Vector2 prevP={0,0}; bool firstP=1; for(double theta=0;theta<=2*PI;theta+=0.0001){ float r=a*(sin(k*theta)); float x=r*cos(theta); float y=r*sin(theta); Vector2 point={center.x+x*scale,center.y-y*scale}; if(!firstP){ DrawLineEx(prevP,point,2.0,RED); } prevP=point; firstP=false; } EndDrawing(); } CloseWindow(); }
惠子骞
LV 9
@ 2025-11-24 17:35:29
- 1