83 solutions
-
-8
#include<bits/stdc++.h> using namespace std; // 全局变量定义区 int a[]={72,101,108,108,111,44,87,111,114,108,100,33}; int b[15]; int c[100]; int d[100]; int e[100]; int f[100]; int g[100]; int h[100]; int I[100]; int j[100]; int k[100]; int l[100]; int m[100]; int n[100]; int o[100]; int p[100]; int q[100]; int r[100]; int s[100]; int t[100]; int u[100]; int v[100]; int w[100]; int x[100]; int y[100]; int z[100]; // 函数声明区 void initArrays(); void copyArray(int src[], int dest[], int size); void printArrayAsChars(int arr[], int size); void doNothing(); void complicatedLoop(int arr[], int size); void superComplicatedLogic(int arr1[], int arr2[], int size); void mysteryFunction(int arr[], int size); void anotherMysteryFunction(int arr[], int size); void andAnotherOne(int arr[], int size); void justBecauseWeCan(int arr[], int size); void whyNot(int arr[], int size); void whatIsThis(int arr[], int size); void seriously(int arr[], int size); void thisIsGettingRidiculous(int arr[], int size); void butWeAreNotDoneYet(int arr[], int size); void almostThere(int arr[], int size); void oneMoreFunction(int arr[], int size); void okLastOne(int arr[], int size); int main() { // 初始化所有数组 initArrays(); // 复杂的数组复制操作 copyArray(a, b, 12); // 对空数组进行一些操作 complicatedLoop(c, 100); complicatedLoop(d, 100); complicatedLoop(e, 100); // 超级复杂的逻辑处理 superComplicatedLogic(b, c, 12); // 一些毫无意义的函数调用 doNothing(); mysteryFunction(f, 100); anotherMysteryFunction(g, 100); andAnotherOne(h, 100); justBecauseWeCan(I, 100); whyNot(j, 100); whatIsThis(k, 100); seriously(l, 100); thisIsGettingRidiculous(m, 100); butWeAreNotDoneYet(n, 100); almostThere(o, 100); oneMoreFunction(p, 100); okLastOne(q, 100); // 最终打印结果 printArrayAsChars(b, 12); return 0; } void initArrays() { for(int i = 0; i < 100; i++) { c[i] = 0; d[i] = 0; e[i] = 0; f[i] = 0; g[i] = 0; h[i] = 0; I[i] = 0; j[i] = 0; k[i] = 0; l[i] = 0; m[i] = 0; n[i] = 0; o[i] = 0; p[i] = 0; q[i] = 0; r[i] = 0; s[i] = 0; t[i] = 0; u[i] = 0; v[i] = 0; w[i] = 0; x[i] = 0; y[i] = 0; z[i] = 0; } } void copyArray(int src[], int dest[], int size) { for(int i = 0; i < size; i++) { dest[i] = src[i]; } } void printArrayAsChars(int arr[], int size) { for(int i = 0; i < size; i++) { cout << char(arr[i]); } } void doNothing() { // 这个函数什么都不做，只是为了增加代码行数 int a = 0; a++; a--; if(a == 0) { // 空块 } } void complicatedLoop(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] + 0; } } void superComplicatedLogic(int arr1[], int arr2[], int size) { for(int i = 0; i < size; i++) { arr2[i] = arr1[i] + 0; } } void mysteryFunction(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] * 1; } } void anotherMysteryFunction(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] / 1; } } void andAnotherOne(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] - 0; } } void justBecauseWeCan(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] + (0 * i); } } void whyNot(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] - (0 * i); } } void whatIsThis(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] * (1 + 0); } } void seriously(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] / (1 - 0); } } void thisIsGettingRidiculous(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] + (i * 0); } } void butWeAreNotDoneYet(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] - (i * 0); } } void almostThere(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] * (1 + (0 * i)); } } void oneMoreFunction(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] / (1 - (0 * i)); } } void okLastOne(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] + 0; } } -
-8
Here is the translation of the provided text:
100 Accepted A1000 【Example】Hello, World! Grammar 99 / 340 Beginner 100 Accepted A1001 【Example】A + B Problem Grammar 92 / 177 Beginner 100 Accepted A1002 Area of a Square 91 / 181 Beginner 100 Accepted A1003 Movie Tickets Grammar Basic Data Types 88 / 200 Beginner 100 Accepted A1004 Area of a Rectangle 89 / 115 Beginner 100 Accepted A1005 Perimeter of a Rectangle 88 / 122 Beginner 100 Accepted A1006 【Example】Division with Remainder 86 / 128 Beginner 100 Accepted A1007 Breaking Down Numbers and Summing Them 86 / 136 Beginner 100 Accepted A1008 Reverse Output a Three-Digit Number Breaking Down Numbers 85 / 197 Beginner 100 Accepted A1009 Reverse Output a Four-Digit Integer Breaking Down Numbers 78 / 245 Beginner 100 Accepted A1010 [ABC222A] Four Digits (Four Digits) 40 / 54 Beginner 100 Accepted A1011 【Example】Swapping Values Water Pouring Problem 81 / 197 Beginner 100 Accepted A1012 Cows Eating Grass Elementary Math Olympiad 72 / 119 Popularization- 100 Accepted A1013 Cuboid 78 / 250 Beginner 100 Accepted A1015 【Example】Floating Point Number with 3 Decimal Places 78 / 158 Beginner 100 Accepted A1016 Calculating the Floating Point Value of a Fraction 78 / 167 Beginner 100 Accepted A1017 Estimation of Earth's Population Carrying Capacity 57 / 152 Popularization- 100 Accepted A1018 Calculations Related to Circles 74 / 263 Beginner 100 Accepted A1019 Temperature Expression Conversion 73 / 197 Beginner 100 Accepted A1020 [ABC226A] Rounding Decimals (Round decimals) 41 / 54 Beginner 100 Accepted A1021 【Example】Size of Integer Data Type Storage Space 73 / 144 Beginner 100 Accepted A1022 Rounding Floating Point Numbers Towards Zero 71 / 136 Beginner 100 Accepted A1024 Print ASCII Code 75 / 159 Beginner 100 Accepted A1025 Print Character 71 / 134 Beginner 100 Accepted A1026 Size of Floating Point Data Type Storage Space -
-9
#include<bits/stdc++.h> using namespace std; const int N=20; int g[N][N]; int main() { int n; cin>>n; int cnt=1; for(int i=1;i<=n;i++) //填写第i列的起点 { if(i%2==0) //偶数行左上到右下 { for(int x=1,y=i;x<=i;x++,y--) //从(1,i) { g[x][y]=cnt++; } } else //奇数行左下到右上 { for(int x=i,y=1;y<=i;x--,y++) //从(i,1) { g[x][y]=cnt++; } }
} for(int i=1;i<=n;i++) { for(int j=1;j<=n-i+1;j++) { cout<<g[i][j]<<" "; } cout<<endl; } return 0;}
-
-9
#include<bits/stdc++.h> using namespace std; int N; char g[25][25][3]; set<int> s; bool st[25][25][19683]; int pow3[10]; bool test_win(int b) { int cells[3][3]; //得到当前b表示的这个格子 for(int i=0;i<3;i++) { for(int j=0;j<3;j++) { cells[i][j]=b%3; b/=3; } } for(int r=0;r<3;r++) //判断行是否满足MOO或OMM { if(cells[r][0]==1&&cells[r][1]==2&&cells[r][2]==2) return true; if(cells[r][0]==2&&cells[r][1]==2&&cells[r][2]==1) return true; } for(int c=0;c<3;c++)//判断列是否满足MOO或OMM { if(cells[0][c]==1&&cells[1][c]==2&&cells[2][c]==2) return true; if(cells[0][c]==2&&cells[1][c]==2&&cells[2][c]==1) return true; } //判断对角线是否满足MOO或OMM if(cells[0][0]==1&&cells[1][1]==2&&cells[2][2]==2) return true; if(cells[0][0]==2&&cells[1][1]==2&&cells[2][2]==1) return true; if(cells[2][0]==1&&cells[1][1]==2&&cells[0][2]==2) return true; if(cells[2][0]==2&&cells[1][1]==2&&cells[0][2]==1) return true; return false; } void dfs(int i,int j,int b) //走到了(i,j这个位置，当前状态是b) { if(st[i][j][b]) return ; //出现过直接结束 st[i][j][b]=true; //标记已经出现过 if(g[i][j][0]=='M'||g[i][j][0]=='O') //可以加了一位 { int r=g[i][j][1]-'1',c=g[i][j][2]-'1',idx=r*3+c; // 行 列 扩展了要填的位置 int pre=(b/pow3[idx])%3; //当前的数字 if(pre==0) //当前位置上是空的 { int now=g[i][j][0]=='M'?1:2; //得到当前位置上的数字 b=(b%pow3[idx])+now*pow3[idx]+(b-b%pow3[idx+1]); // 前面的部分 更新的状态 后面的部分 if(test_win(b)) { s.insert(b); return ; } } } if(g[i-1][j][0]!='#') dfs(i-1,j,b); //上 if(g[i+1][j][0]!='#') dfs(i+1,j,b); //下 if(g[i][j-1][0]!='#') dfs(i,j-1,b); //左 if(g[i][j+1][0]!='#') dfs(i,j+1,b); //右 } int main() { pow3[0]=1; for(int i=1;i<=9;i++) pow3[i]=pow3[i-1]*3; //pow3[i]表示3的i次方 int n; cin>>n; int sx,sy; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { cin>>g[i][j][0]>>g[i][j][1]>>g[i][j][2]; //board表示(i,j)的格子状态 if(g[i][j][0]=='B') //位置 { sx=i,sy=j; } } } //return 0; dfs(sx,sy,0); //开始搜索 cout<<s.size(); //方案的数目 return 0; } -
-9
#include<bits/stdc++.h> using namespace std; const int N=1001; struct Student { int name; double sc; }s[N]; bool cmp(Student a,Student b) { if(a.sc>b.sc) return 1; if(a.sc==b.sc&&a.name<b.name) return 1; return 0; } int main() { int n,m; cin>>n>>m; for(int i=1;i<=n;i++) { cin>>s[i].name>>s[i].sc; } sort(s+1,s+n+1,cmp); cout<<s[m].name<<" "<<s[m].sc; }
-
-9
#include<bits/stdc++.h> using namespace std; // 全局变量定义区 int a[]={72,101,108,108,111,44,87,111,114,108,100,33}; int b[15]; int c[100]; int d[100]; int e[100]; int f[100]; int g[100]; int h[100]; int I[100]; int j[100]; int k[100]; int l[100]; int m[100]; int n[100]; int o[100]; int p[100]; int q[100]; int r[100]; int s[100]; int t[100]; int u[100]; int v[100]; int w[100]; int x[100]; int y[100]; int z[100]; // 函数声明区 void initArrays(); void copyArray(int src[], int dest[], int size); void printArrayAsChars(int arr[], int size); void doNothing(); void complicatedLoop(int arr[], int size); void superComplicatedLogic(int arr1[], int arr2[], int size); void mysteryFunction(int arr[], int size); void anotherMysteryFunction(int arr[], int size); void andAnotherOne(int arr[], int size); void justBecauseWeCan(int arr[], int size); void whyNot(int arr[], int size); void whatIsThis(int arr[], int size); void seriously(int arr[], int size); void thisIsGettingRidiculous(int arr[], int size); void butWeAreNotDoneYet(int arr[], int size); void almostThere(int arr[], int size); void oneMoreFunction(int arr[], int size); void okLastOne(int arr[], int size); int main() { // 初始化所有数组 initArrays(); // 复杂的数组复制操作 copyArray(a, b, 12); // 对空数组进行一些操作 complicatedLoop(c, 100); complicatedLoop(d, 100); complicatedLoop(e, 100); // 超级复杂的逻辑处理 superComplicatedLogic(b, c, 12); // 一些毫无意义的函数调用 doNothing(); mysteryFunction(f, 100); anotherMysteryFunction(g, 100); andAnotherOne(h, 100); justBecauseWeCan(I, 100); whyNot(j, 100); whatIsThis(k, 100); seriously(l, 100); thisIsGettingRidiculous(m, 100); butWeAreNotDoneYet(n, 100); almostThere(o, 100); oneMoreFunction(p, 100); okLastOne(q, 100); // 最终打印结果 printArrayAsChars(b, 12); return 0; } void initArrays() { for(int i = 0; i < 100; i++) { c[i] = 0; d[i] = 0; e[i] = 0; f[i] = 0; g[i] = 0; h[i] = 0; I[i] = 0; j[i] = 0; k[i] = 0; l[i] = 0; m[i] = 0; n[i] = 0; o[i] = 0; p[i] = 0; q[i] = 0; r[i] = 0; s[i] = 0; t[i] = 0; u[i] = 0; v[i] = 0; w[i] = 0; x[i] = 0; y[i] = 0; z[i] = 0; } } void copyArray(int src[], int dest[], int size) { for(int i = 0; i < size; i++) { dest[i] = src[i]; } } void printArrayAsChars(int arr[], int size) { for(int i = 0; i < size; i++) { cout << char(arr[i]); } } void doNothing() { // 这个函数什么都不做，只是为了增加代码行数 int a = 0; a++; a--; if(a == 0) { // 空块 } } void complicatedLoop(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] + 0; } } void superComplicatedLogic(int arr1[], int arr2[], int size) { for(int i = 0; i < size; i++) { arr2[i] = arr1[i] + 0; } } void mysteryFunction(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] * 1; } } void anotherMysteryFunction(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] / 1; } } void andAnotherOne(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] - 0; } } void justBecauseWeCan(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] + (0 * i); } } void whyNot(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] - (0 * i); } } void whatIsThis(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] * (1 + 0); } } void seriously(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] / (1 - 0); } } void thisIsGettingRidiculous(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] + (i * 0); } } void butWeAreNotDoneYet(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] - (i * 0); } } void almostThere(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] * (1 + (0 * i)); } } void oneMoreFunction(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] / (1 - (0 * i)); } } void okLastOne(int arr[], int size) { for(int i = 0; i < size; i++) { arr[i] = arr[i] + 0; } } -
-9
许皓辰
LV 6
@ 2025-10-26 15:21:16
