87 solutions

  • -10
    @ 2025-7-2 14:21:01 
    #include<bits/stdc++.h>
using namespace std;
int main()
{
    cout<<"Hello,World!";
    return 0;
}
    • -10
      @ 2025-7-2 10:30:35 
      #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;
	}
}
      • -10
        @ 2025-6-14 11:23:23

        1234567890

        \

        \P[OJIT

        T T T T T T T T T

        T T T T T T TTTTTTTTTT

        T T T TT

        T T T T T T T

        T T T

        T T T T

        T T T

        T T

        • -10
          @ 2025-6-7 11:31:29

          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
          • -10
            @ 2024-11-26 20:34:24 
            群鸟齐飞映日边，
童声笑语乐无边。
欺霜傲雪梅花艳，
我辈何惧风雨寒。
老松矗立千年久，
无畏风霜志更坚。
力拔山河气盖世，
一腔热血洒人间。
肘悬明镜照人心，
击鼓催征踏征程。
击碎万难迎曙光，
飞越千山梦无疆。
二心同德共前行，
里程碑前再启航，
地广天高任翱翔。
            • -10
              @ 2024-11-26 20:31:50 
              再逢花开春意浓，
看尽繁华梦未空。
一世情缘如逝水，
眼前星河心留痕。
就似烈火燃希望，
会当凌云破长空。
爆竹声中迎蜕变，
炸破旧梦迎新程。
              • -10
                @ 2024-11-2 16:02:23

                • -10
                  @ 2024-10-5 11:32:10

                  • -11
                    @ 2025-7-2 9:13:50

                    #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;

                    }

                    • -11
                      @ 2025-6-7 11:28:42

                      #include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; cout<<'L'; for(int i=1;i<=n;i++) cout<<'o'; cout<<"ng"; return 0; }

                      • -11
                        @ 2025-5-31 12:01:54 
                        #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;
	}
}
                        • -11
                          @ 2025-3-8 14:08:44

                          https://lizikid.cn/d/pretest/p/P1002

                          • -11
                            @ 2025-1-18 15:09:22

                            • -11
                              @ 2024-12-7 10:19:51

                              //1. #include<bits/stdc++.h> using namespace std; int main() { int n,s,d,q=0; cin>>n; for (int i=1;i<=n;i++) { cin>>s>>d; if (s>d) { q+=3; } else if(s==d) { q++; } } cout<<q; return 0; }

                              //2. #include<bits/stdc++.h> using namespace std; int main() { int t,a=0,s; cin>>s; for (int i=1;i<=0;i++) { t=sqrt(i); if(t*t!=i) continue; int g=i%10,q=i/10%10,b=i/100%10; if(gq||qb||gb) { a++; if (as) { cout<<i; return 0; } } } return 0; }

                              //3. #include<bits/stdc++.h> using namespace std; int main() { int n,x,s=110; cin>>n; for (int i=1;i<=n,i++) { cin>>x; if (x>s) { cout<<"y"<<endl; } else { cout<<"N"<<endl; } if (s>x) { s=x; } } return 0; }

                              //4. #include<bits/stdc++.h> using namespace std; int main() { int a; cin>>a; for (int i=n-1;i>=1;i--) { bool st=1; for (int j=2;j<=i/j;j++) { if (i%j==0) { st=0; } } if (st) { cout<<i; return 0; } } return 0; }

                              //6. #include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; for (int i=1;i<=n;i++) { for (int j=1;j<i;j++) cout<<" "; for (int j=1;j<=n;j++) cout<<"*"; cout<<endl; } return 0; }

                              • -11
                                @ 2024-11-30 10:30:03

                                筷子

                                • -11
                                  @ 2024-11-26 20:58:55

                                  南村群童欺我老无力，一肘击飞二里地！！！

                                  • -11
                                    @ 2024-11-26 20:43:10 
                                    厚德载物心如镜，
颜容虽老志犹青。
无畏前行披荆棘，
耻于后退失豪情。
                                    • -11
                                      @ 2024-11-26 20:41:21 
                                      鸡鸣报晓迎新晨，
你如朝阳照我心。 
太虚浩瀚藏奥秘，
美景如画共赏寻。
                                      • -11
                                        @ 2024-11-26 20:37:30 
                                        我思珍宝遍天涯，
要寻奇物不辞劳。
金光闪耀如日辉，
坷途历险志愈高。
垃中寻宝心不倦，
                                        • -11
                                          @ 2024-11-26 20:32:55 
                                          靠月寄情思绵绵，
近水含烟梦轻扬。
一帘幽梦随风舞，
点点星光映心房。
就中情深难自禁，
会心一笑共徜徉。
融情入景诗画里，
化作春泥更护芳。

                                          【例】Hello,World!

                                          Information

                                          ID
                                          838
                                          Time
                                          1000ms
                                          Memory
                                          256MiB
                                          Difficulty
                                          1
                                          Tags
                                          # Submissions
                                          878
                                          Accepted
                                          160
                                          Uploaded By
                                          1. Language
                                          2. Legacy mode
                                          3. Theme
                                          2. 蜀ICP备2025166542号-1
                                          3. Worker 0, 16ms
                                          4. Powered by Hydro v5.0.1 Community