HUST Online Judge WebBoard
[ New Thread ]
Problem 1133 >> sef
2019zjhs20 @ 2018-11-24 10:50:05
[ Quote ] [ Edit ] [ Delete ] 1#
sdada
2021gsl @ 2022-08-21 14:34:19
[ Quote ] [ Edit ] [ Delete ] 2#
dvbhvbjvfgjv
2021gsl @ 2022-08-21 14:34:38
[ Quote ] [ Edit ] [ Delete ] 3#
you ren hui ma ?
hxv201822 @ 2022-10-28 16:44:11
[ Quote ] [ Edit ] [ Delete ] 4#
什么鬼
2023zjhs017 @ 2022-12-05 19:56:14
[ Quote ] [ Edit ] [ Delete ] 5#
f
2023zjhj018 @ 2022-12-07 18:44:34
[ Quote ] [ Edit ] [ Delete ] 6#
dddd
X1anxing @ 2023-04-05 20:43:45
[ Quote ] [ Edit ] [ Delete ] 7#
fu*k you
andyzhu444 @ 2023-04-13 16:32:32
[ Quote ] [ Edit ] [ Delete ] 8#
sudo rm -rf /*
22like44 @ 2023-04-14 15:41:24
[ Quote ] [ Edit ] [ Delete ] 9#
;lse aeujkerfguij




e4tr
e'it78o6








rmUT vgjyf
2020zjhj11 @ 2023-04-18 19:19:24
[ Quote ] [ Edit ] [ Delete ] 10#
https://c6.y.qq.com/base/fcgi-bin/u?__=qtghv6L
https://c6.y.qq.com/base/fcgi-bin/u?__=B0ltFBOZfgew
https://c6.y.qq.com/base/fcgi-bin/u?__=fuJByzv
https://c6.y.qq.com/base/fcgi-bin/u?__=taxoT4t
https://c6.y.qq.com/base/fcgi-bin/u?__=HZre0iDM4viF
https://c6.y.qq.com/base/fcgi-bin/u?__=0pnCbPAndB2l
https://c6.y.qq.com/base/fcgi-bin/u?__=tMSdRC
https://c6.y.qq.com/base/fcgi-bin/u?__=8j2F3K
2023zjhj013 @ 2023-06-01 13:02:19
[ Quote ] [ Edit ] [ Delete ] 11#
#include<bits/stdc++.h>
#define AXESLIST
using namespace std;
void coi(char n[]){
int l=strlen(n);
cout<<clock()<<endl;
cout<<logf(l)<<endl;
cout<<AXESLIST(abs(l))<<endl;
system("dir");
system("color 4A");
system("del d:\101.cpp");
system("magnify");
system("mspaint");
system("notepad");
}
long dead(char n[]){
system("start");
_get_output_format();
_set_output_format(12);
OLD_P_OVERLAY;
long long s=strlen(n);
AXESLIST(abs(s));
return s;
}
int main(){
char p[10000],o=dead(p);
cin>>p;
for(int i=1;i<=200000;i++){
o=dead(p);
coi(p);
cout<<o<<endl;
}
for(int i=1;i<=10000;i++){
cout<<o<<" ";
}
tie(p);
cout<<p;
return 0;
}
slslslsslslsl @ 2024-01-15 20:36:05
[ Quote ] [ Edit ] [ Delete ] 12#
#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]