32 solutions
-
-1
思路
可以使用KMP算法,先加密(制造数据)后解密(获得最先出现的子串位置)
呆码
#include<iostream> #define _for(a,b) for(int i=a;i<=b;i++) using namespace std; string s,t="laoda"; int f[2001105]; int main(){ //制造数据 _for(1,71){ srand(time(0)); char ran=rand()%20+32; s+=ran; } s+="laoda"; _for(1,24){ srand(time(0)); char ran=rand()%20+32; s+=ran; } s+="laoda"; int m=0; for(int i=1;i<(int)t.size();i++){ while(m>0&&t[i]!=t[m]) m=f[m-1]; if(t[i]==t[m]) m++; f[i]=m; } int ss=s.size(); int st=t.size(); int j=0; for(int i=0;i<ss;i++){ while(j>0&&s[i]!=t[j]) j=f[j-1]; if(s[i]==t[j]) j++; if(j==st){ cout<<char(i-st+2); j=f[j-1]; } } s="";t=""; t="fly"; _for(1,107){ srand(time(0)); char ran=rand()%20+32; s+=ran; } s+="fly"; m=0; for(int i=1;i<(int)t.size();i++){ while(m>0&&t[i]!=t[m]) m=f[m-1]; if(t[i]==t[m]) m++; f[i]=m; } ss=s.size(); st=t.size(); j=0; for(int i=0;i<ss;i++){ while(j>0&&s[i]!=t[j]) j=f[j-1]; if(s[i]==t[j]) j++; if(j==st){ cout<<char(i-st+2); j=f[j-1]; } } s="";t=""; t="fly"; _for(1,107){ srand(time(0)); char ran=rand()%20+32; s+=ran; } s+="flyfly"; m=0; for(int i=1;i<(int)t.size();i++){ while(m>0&&t[i]!=t[m]) m=f[m-1]; if(t[i]==t[m]) m++; f[i]=m; } ss=s.size(); st=t.size(); j=0; for(int i=0;i<ss;i++){ while(j>0&&s[i]!=t[j]) j=f[j-1]; if(s[i]==t[j]) j++; if(j==st){ cout<<char(i-st+2); j=f[j-1]; } } s="";t=""; t="go"; _for(1,43){ srand(time(0)); char ran=rand()%20+32; s+=ran; } s+="go"; _for(1,41){ srand(time(0)); char ran=rand()%20+32; s+=ran; } s+="go"; _for(1,22){ srand(time(0)); char ran=rand()%20+32; s+=ran; } s+="gowgo"; m=0; for(int i=1;i<(int)t.size();i++){ while(m>0&&t[i]!=t[m]) m=f[m-1]; if(t[i]==t[m]) m++; f[i]=m; } ss=s.size(); st=t.size(); j=0; for(int i=0;i<ss;i++){ while(j>0&&s[i]!=t[j]) j=f[j-1]; if(s[i]==t[j]) j++; if(j==st){ cout<<char(i-st+2); j=f[j-1]; } } s="";t=""; t="ww"; _for(1,107){ srand(time(0)); char ran=rand()%20+32; s+=ran; } s+="ww"; m=0; for(int i=1;i<(int)t.size();i++){ while(m>0&&t[i]!=t[m]) m=f[m-1]; if(t[i]==t[m]) m++; f[i]=m; } ss=s.size(); st=t.size(); j=0; for(int i=0;i<ss;i++){ while(j>0&&s[i]!=t[j]) j=f[j-1]; if(s[i]==t[j]) j++; if(j==st){ cout<<char(i-st+2); j=f[j-1]; } } s="";t=""; t="ww"; _for(1,99){ srand(time(0)); char ran=rand()%20+32; s+=ran; } s+="ww"; m=0; for(int i=1;i<(int)t.size();i++){ while(m>0&&t[i]!=t[m]) m=f[m-1]; if(t[i]==t[m]) m++; f[i]=m; } ss=s.size(); st=t.size(); j=0; for(int i=0;i<ss;i++){ while(j>0&&s[i]!=t[j]) j=f[j-1]; if(s[i]==t[j]) j++; if(j==st){ cout<<char(i-st+2); j=f[j-1]; } } s="";t=""; t="gg"; _for(1,32){ srand(time(0)); char ran=rand()%20+32; s+=ran; } s+="gg"; m=0; for(int i=1;i<(int)t.size();i++){ while(m>0&&t[i]!=t[m]) m=f[m-1]; if(t[i]==t[m]) m++; f[i]=m; } ss=s.size(); st=t.size(); j=0; for(int i=0;i<ss;i++){ while(j>0&&s[i]!=t[j]) j=f[j-1]; if(s[i]==t[j]) j++; if(j==st){ cout<<char(i-st+2); j=f[j-1]; } } }
-
-1
把溜开蚊的唐氏代码改A了
#include<bits/stdc++.h> using namespace std; int n; int x = 1; int cnt; int flag; char a[40010]; int main(){ a[0] = '0'; while(cin>>a[x]){ x++; cnt++; } // for(int i=1;i<x;i++){ // cout<<a[i]<<' '; // } // cout<<endl<<endl<<endl; n=sqrt(cnt); x=1; cnt=0; cout<<n<<' '; for(int i=0;i<=n*n;i++){ if(a[i]!=a[i+1]){ cout<<cnt<<' '; cnt=1; } else cnt++; } return 0; }
-
-1
#include <bits/stdc++.h> #define jiajia ++ #define jiadengyu += #define jia + #define jian - #define cheng * #define chu / #define shuchu cout #define fanhui return #define false true #define true false #define dingyi int #define shuru cin #define xiaoyudengyu <= #define dengyu = #define dingyipanduanleizifuchuang bool #define kaishi { #define jieshu } #define qiankuohao ( #define fenhao ; #define shurufuhao >> #define shuchufuhao << #define ling 0 #define yi 1 #define xunhuan for #define douhao , #define zheng true #define ruguo if #define houkuohao ) #define shiyong using #define mingmingkongjian namespace shiyong mingmingkongjian std fenhao dingyipanduanleizifuchuang o qiankuohao dingyi p houkuohao kaishi fanhui zheng fenhao jieshu dingyi main qiankuohao houkuohao kaishi shuchu shuchufuhao "Hello,World!" fenhao fanhui ling fenhao jieshu //抽象代码
-
-2
/*#include<bits/stdc++.h> using namespace std; int n,x[100005]={0},k,ans=0; int check(int p){ for(int i=2;i*i<=p;i++)if(p%i==0)return 0; return 1; } void zs(int c,int w,int sum){ if(w==k+1){ if(check(sum))ans++; return ; } for(int i=c+1;i<=n;i++)zs(i,w+1,sum+x[i]); } int main(){ cin>>n>>k; for(int i=1;i<=n;i++)cin>>x[i]; zs(0,1,0); cout<<ans; }*/ #include<bits/stdc++.h> using namespace std; int main(){ cout<<"Hello,World!"; }
-
-3
#include<bits/stdc++.h> using namespace std; int main(){ cout<<"6=3+3"<<endl<<"8=3+5"<<endl<<"10=3+7"<<endl<<"12=5+7"<<endl<<"14=3+11"<<endl<<"16=3+13"<<endl<<"18=5+13"<<endl<<"20=3+17"<<endl<<"22=3+19"<<endl<<"24=5+19"<<endl<<"26=3+23"<<endl<<"28=5+23"<<endl<<"30=7+23"<<endl<<"32=3+29"<<endl<<"34=3+31"<<endl<<"36=5+31"<<endl<<"38=7+31"<<endl<<"40=3+37"<<endl<<"42=5+37"<<endl<<"44=3+41"<<endl<<"46=3+43"<<endl<<"48=5+43"<<endl<<"50=3+47"<<endl<<"52=5+47"<<endl<<"54=7+47"<<endl<<"56=3+53"<<endl<<"58=5+53"<<endl<<"60=7+53"<<endl<<"62=3+59"<<endl<<"64=3+61"<<endl<<"66=5+61"<<endl<<"68=7+61"<<endl<<"70=3+67"<<endl<<"72=5+67"<<endl<<"74=3+71"<<endl<<"76=3+73"<<endl<<"78=5+73"<<endl<<"80=7+73"<<endl<<"82=3+79"<<endl<<"84=5+79"<<endl<<"86=3+83"<<endl<<"88=5+83"<<endl<<"90=7+83"<<endl<<"92=3+89"<<endl<<"94=5+89"<<endl<<"96=7+89"<<endl<<"98=19+79"<<endl<<"100=3+97"<<endl ; return 0; }
-
-3
#include<iostream> using namespace std; struct node { char c; int a_114514; }; class a_word { public: node s; }; a_word a[114514]; string w="114514Hello,World!"; void f() { for(int i=6;i<w.size();i++) { cout<<a[i].s.c; } } int main() { for(int i=0;i<w.size();i++) { a[i].s.c=w[i]; } f(); return 0; }
-
-4
#include<bits/stdc++.h> using namespace std; int main(){ printf("Hello,World!"); return 0; }
好难啊啊啊aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
-
-5
#include using namespace std; namespace a { namespace b { namespace c { namespace d { namespace e { namespace f { namespace g { namespace h { namespace i { namespace j { namespace k { namespace l { namespace m { namespace n { namespace o { namespace p { namespace q { namespace r { namespace s { namespace t { namespace u { namespace v { namespace w { namespace x { namespace y { namespace z { void hlw() { printf("Hello,World!"); } } } } } } } } } } } } } } } } } } } } } } } } } } }
int main() { a::b::c::d::e::f::g::h::i::j::k::l::m::n::o::p::q::r::s::t::u::v::w::x::y::z::hlw(); return 0; }
-
-5
#include<iostream> #include<string> using namespace std; int main(){ int yi,er,liu,qi,ba,jiu,shi; char san,wu; string si; cout<<"这是一个计算王国,你需要答对十道题才能逃出这个王国。"<<endl; cout<<"第一道题"<<endl; cout<<"98+458=?"<<endl; cin>>yi; if(yi==556) cout<<"恭喜你,答对了,现在进入下一道题。"<<endl; else{ cout<<"你怎么这么废物啊?第一道题都答不对。"<<endl; return 0; } cout<<"957的立方的个位数是多少?"<<endl; cin>>er; if(er==6) cout<<"恭喜你,答对了,现在进入下一道题。"<<endl ; else{ cout<<"你原来真的是个废物,这种题目我用脚指头算都可以算出来。"<<endl; return 0; } cout<<"1的立方加上2的立方加上3的立方一直加到2023的立方,他们和的个位数是多少?"<<endl; cout<<"A.6 B.7 C.8 D.9"<<endl; cin>>san; if(san='A') cout<<"恭喜你,答对了,现在进入下一道题。"<<endl; else{ cout<<"你好废物啊,我们期中考不是刚考了这道题吗?"<<endl; return 0; } cout<<"现在开始,我们不考数学了,考英语。"<<endl; cout<<"拼写出英语的单词。"<<endl; cin>>si; if(si='E') cout<<"恭喜你,答对了,现在进入下一道题。"<<endl; else{ cout<<"弱智,你是没上幼儿园吗?"<<endl; return 0; } cout<<"拼写出电脑的单词。"<<endl; cin>>wu; if(wu='c') cout<<"恭喜你,答对了,现在进入下一道题。"<<endl; else{ cout<<"建议你妈妈带你去医院看看。"<<endl; return 0; } cout<<"现在考古诗词。"<<endl; cout<<"" ; return 0; }
Information
- ID
- 542
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 7
- Tags
- # Submissions
- 596
- Accepted
- 157
- Uploaded By