外国人的数学素质是差啊

caimicn · 发表于 2016-3-31 09:14

游戏里有这样的谜题：要求
（A+B-C)*D+E-F=7
A、B、C、D、E、F为11、9、1、6、4、2的其中一个数值。
好吧！！
第一解：

（9-6+1）*4+2-11=7

居然没通过

好吧！继续，第二解：

（9-4+1）*2+6-11=7

又说我是错的，

没关系，我还有第三解：

（11-6+1）*2+4-9=7

我靠，又说我错的，我CAO，老外的数学全都是体育老师教的吗？我崩溃了

还有没有第4解啊？第5解啊？？

caimicn · 发表于 2016-3-31 10:14

好了，找到第四种方法了

myq495 · 发表于 2016-3-31 11:06

国内人数学也有差的，不能以偏概全

xuyiqing · 发表于 2016-3-31 22:55

哪个游戏啊？

飞翔的荷兰人 · 发表于 2016-4-8 16:03

如果老毛子不算外国人的话，楼主的话勉强算正确。

iguodala · 发表于 2016-4-30 11:08

老外的数学绝对没我们学的深

tianzhe · 发表于 2016-5-1 23:45

有一次有个游戏居然问X*Y=63，X和Y是多少，会背九九表的人都知道，可见他们的数学基础

血腥的情人节 · 发表于 2016-6-23 11:23

代入以下代码，得：11,9,4,2,1,6

滑稽~

#include <iostream>
#include <string.h>
using namespace std;
template <class T>
class Node
{
public:
T data;
Node<T> *next;
Node()
{
this->next = NULL;
}
Node(T data,Node<T> *next=NULL)
{
this->data = data;
this->next = next;
}
};

template <class T>
class LinkedStack
{
private:
Node<T> *top;
public:
LinkedStack();
~LinkedStack();
bool isEmpty();
void push(T x);
T pop();
T get();
};

template <class T>
LinkedStack<T>::LinkedStack()
{
top = NULL;
}

template <class T>
LinkedStack<T>::~LinkedStack()
{
Node<T> *p = top;
Node<T> *q;
while(p!=top)
{
q = p;
p = p->next;
delete p;
}
top = NULL;
}

template <class T>
bool LinkedStack<T>::isEmpty()
{
return top == NULL;
}

template <class T>
void LinkedStack<T>::push(T x)
{
top = new Node<T>(x,top);
}

template <class T>
T LinkedStack<T>::pop()
{
if(!isEmpty())
{
T x = top->data;
Node<T> *p = top;
top = top->next;
delete p;
return x;
}
throw "空栈，不能执行出栈操作";
}

template <class T>
T LinkedStack<T>::get()
{
if(!isEmpty())
{
return top->data;
}
throw "空栈，不能获得栈顶元素";
}

char * toPostfix(char *expstr)
{
LinkedStack<char> stack;
char *postfix = new char[strlen(expstr)*2];
int i=0;
int j=0;
char out ;
while(expstr[i]!='\0')
{
switch(expstr[i])
{
case'+':
case'-':
while(!stack.isEmpty()&&stack.get()!='(')
{
postfix[j++] = stack.pop();
}
stack.push(expstr[i++]);
break;
case'*':
case'/':
while(!stack.isEmpty()&&(stack.get()=='*'||stack.get()=='/'))
{
postfix[j++] = stack.pop();
}
stack.push(expstr[i++]);
break;
case'(':stack.push(expstr[i++]);
break;
case')':out = stack.pop();
while(!stack.isEmpty()&&out!='(')
{
postfix[j++] = out;
out = stack.pop();
}
i++;
break;
default:
while(expstr[i]>='0'&&expstr[i]<='9'&&expstr[i]!='\0')
{
postfix[j++] = expstr[i++];
}
postfix[j++]=' ';
break;
}
}
while(!stack.isEmpty())
{
postfix[j++]=stack.pop();
}
postfix[j]='\0';
return postfix;
}

int value(char *postfix)
{
LinkedStack<int> stack;
int i=0;
int result = 0;
while(postfix[i]!='\0')
{
if(postfix[i]>='0'&&postfix[i]<='9')
{
result = 0;
while(postfix[i]!=' ')
{
result = result*10+postfix[i++]-'0';
}
i++;
stack.push(result);
}
else
{
if(postfix[i]!=' ')
{
int y = stack.pop();
int x = stack.pop();
switch(postfix[i])
{
case'+':result = x + y;
break;
case'-':result = x - y;
break;
case'*':result = x *y;
break;
case'/':result = x / y;
break;
}
stack.push(result);
}
i++;
}
}
return stack.pop();
}

int main()
{
//char *expstr = "121+10*(52-49+20)/((35-25)*2+10)";
cout << "请输入表达式:";
//char *a ;
//cin >> *a;
char expstr[20]={0};
while(1)
{
cin>>expstr;
char *postfix = toPostfix(expstr);
cout << "expstr= "<<expstr << endl;
cout << "postfix= "<<postfix<<endl;
cout << "value= "<<value(postfix) << endl;
}
return 0;
}

血腥的情人节 · 发表于 2016-6-23 11:24

caimicn 发表于 2016-3-31 10:145 p$ R7 {6 H7 s# w3 \! `" `
好了，找到第四种方法了

代入以下代码，得：11,9,4,2,1,6

滑稽~

#include <iostream>
#include <string.h>
using namespace std;
template <class T>
class Node
{
public:
T data;
Node<T> *next;
Node()
{
this->next = NULL;
}
Node(T data,Node<T> *next=NULL)
{
this->data = data;
this->next = next;
}
};

template <class T>
class LinkedStack
{
private:
Node<T> *top;
public:
LinkedStack();
~LinkedStack();
bool isEmpty();
void push(T x);
T pop();
T get();
};

template <class T>
LinkedStack<T>::LinkedStack()
{
top = NULL;
}

template <class T>
LinkedStack<T>::~LinkedStack()
{
Node<T> *p = top;
Node<T> *q;
while(p!=top)
{
q = p;
p = p->next;
delete p;
}
top = NULL;
}

template <class T>
bool LinkedStack<T>::isEmpty()
{
return top == NULL;
}

template <class T>
void LinkedStack<T>::push(T x)
{
top = new Node<T>(x,top);
}

template <class T>
T LinkedStack<T>::pop()
{
if(!isEmpty())
{
T x = top->data;
Node<T> *p = top;
top = top->next;
delete p;
return x;
}
throw "空栈，不能执行出栈操作";
}

template <class T>
T LinkedStack<T>::get()
{
if(!isEmpty())
{
return top->data;
}
throw "空栈，不能获得栈顶元素";
}

char * toPostfix(char *expstr)
{
LinkedStack<char> stack;
char *postfix = new char[strlen(expstr)*2];
int i=0;
int j=0;
char out ;
while(expstr!='\0')
& z" k! K) B; \- H4 W6 u1 W/ B {
' {( O' Y8 }: W; x/ {: W  S9 c/ I switch(expstr)# N5 C! ]  s  u: Q+ |$ \2 m
{
" \: V* a& S: X* \; ~9 S case'+':  {4 X  }7 u3 n0 _
case'-':
3 {% E1 s* B- D% \6 t( f2 a while(!stack.isEmpty()&&stack.get()!='(')
% Y5 Q: t+ D9 x" f2 d {) ]8 d& o* G/ A# B( J2 F+ c
postfix[j++] = stack.pop();0 {/ l- _+ {% J+ V" |
}
. G; @! c( z8 k  A! ] stack.push(expstr[i++]);
1 T% [: T2 F/ C break;
/ I! b- p: M. y8 E  P' D, ] case'*':& ?2 S1 S* o( u* Y4 l
case'/':- U6 N# R) t" f! |
while(!stack.isEmpty()&&(stack.get()=='*'||stack.get()=='/'))
! H! T7 F0 J; T4 I7 l! x7 o7 } {. g1 j5 w4 K4 S# `0 u
postfix[j++] = stack.pop();
! n, j4 d1 T$ v  k }
# s: D0 s! w2 F& P' P stack.push(expstr[i++]);% Z/ Z; q% }  J: m1 n
break;
: y" e: E  ^' y3 L: ?# t+ E. J/ C case'(':stack.push(expstr[i++]);
+ X% W9 Y. t5 J2 w2 y, ]: z3 y break;8 P& R( I" Q4 k. b2 f6 Z
case')':out = stack.pop();! G- }& R4 |9 l! ?/ e- |; Z
while(!stack.isEmpty()&&out!='('), u- f9 U3 ~! V& G
{8 Q& M4 S, Y- @
postfix[j++] = out;
+ c4 S% U" q3 U( \# x/ d& M out = stack.pop();
: U! e1 T! |8 B9 G. v }+ H% v0 I" A1 j/ w0 B
i++;
3 V. t  ~" T& ]8 M break;
& }; y1 r7 T. ^2 E default:& B! g# O% {( e7 w
while(expstr>='0'&&expstr<='9'&&expstr!='\0')3 P% e$ B/ S. y7 C1 N- M' N6 L6 M
{
+ P' s; q% i, T postfix[j++] = expstr[i++];5 ?1 `! r2 u- j9 ]) j4 b. g
}
+ p& S% L; b6 {+ c( y  g9 X postfix[j++]=' ';# `7 p! P% \. F  v2 e6 P7 P* _
break;
5 U( P' s" C' @' w }
" k# H& X9 V+ O8 h }& M8 V8 P5 R! R
while(!stack.isEmpty())) i" C( Y- i9 M" T' @
{
! V- ^" K6 v, {" O postfix[j++]=stack.pop();& z- r$ T' l1 |  R  u+ [  I9 z: n
}! u+ r+ y+ H: q, t
postfix[j]='\0';8 J( F5 A3 E- h2 ~8 Q) [' e
return postfix;
/ E9 L& t6 E/ V! Y}/ M6 O$ k! O2 Q6 m8 @! W
1 Q' `- B$ X  A3 g. l; d1 @
int value(char *postfix)9 O& l" L6 c& Y$ c$ u$ G, [4 x. h9 d
{5 ?; x# V# N% x  e# P% ?
LinkedStack<int> stack;
! `9 {+ |, x/ m int i=0;
$ {* v" b6 O5 ^) y4 w# x int result = 0;) j( C  ]7 m, Y& ^
while(postfix!='\0')
0 \+ G( B1 T0 V; n& M5 M: O6 P1 H) p {, r8 L8 a) h3 z8 E- i$ G3 {
if(postfix>='0'&&postfix<='9'): E/ U( G; J  `5 x
{1 \% I) ?" O2 t* x0 E' T
result = 0;8 C* G# ?" H% E! u2 F# t
while(postfix!=' ')) `1 L5 \1 j  f8 O. Z5 S3 y
{- U; [8 u% x" y& V" ]  D
result = result*10+postfix[i++]-'0';
1 n3 b" k( V; N; M6 z/ o+ y' z }
$ x/ E8 p& W( _' @* a6 o i++;- x8 P* E$ y' P, ]( g' c" G2 x. S
stack.push(result);* }- z/ @4 Y- j3 G( R
}
9 n( E$ X% }4 \# i2 U# O else
2 L4 D* U. v# L( P) i0 D- v {4 M7 Q$ J* ~5 g9 q
if(postfix!=' ')
1 z6 R3 B2 H+ s$ B {3 f) C0 l0 I  _
int y = stack.pop();
$ R% f" Y1 j: J( v' E- y7 k int x = stack.pop();  @+ I2 M+ ?: B2 B4 j$ t# s
switch(postfix)9 a$ ^9 j8 M' [( R
{
* J8 j# m7 X6 `" ]% V$ a case'+':result = x + y;
( c+ B4 C8 k! T& W! N4 \ break;
4 J. N4 R9 Q: q5 w8 p case'-':result = x - y;
0 H! O* S% Y, ^: A  k9 E+ n  D break;
/ _. |8 f  g) g* B- e7 `3 S9 [ case'*':result = x *y;
8 @# j% v9 j5 o9 t" Y; m% E/ \ break;2 Y0 M5 Y9 m, P8 B! I! x
case'/':result = x / y;
& I* N/ I+ w/ q* ]5 b6 u5 k# m break;. ~+ n: ?6 K1 m' l) @
}) G/ R( e/ e; Q" s
stack.push(result);1 y/ ]: i0 P: C! G% O
}% j' [1 \3 V% S: E' {* G; d. @  V
i++;
; _% M4 v4 |% c, I& P" E }1 ^: w7 G- n+ _
}
* b' g' G" O1 ]1 I( u return stack.pop();
5 f4 U. t& q6 }! C+ m}) _1 O9 c: j, Q: G3 X  v7 k  ?+ M
9 R  {, x! I! l* a- Q, N1 |
int main()! K9 C  X7 [/ n
{
9 B! v: k4 A9 l3 V3 k2 X //char *expstr = "121+10*(52-49+20)/((35-25)*2+10)";# [% c! Z1 Z' w* Q
cout << "请输入表达式:";" Y9 _7 j* c% H: A: u
//char *a ;
/ }7 X, Y  X& k" @# p2 N5 w //cin >> *a;
% E9 a$ H+ |3 r* b& `" h4 l3 V char expstr[20]={0};1 ~3 l2 W) \' D& z7 y& E0 D
while(1)( e# ^$ U$ M9 D3 u7 }, O" I% K9 i. r
{
0 N; G# `  v" r2 U& D( s cin>>expstr;
: k* w9 @! ^( E5 v$ y4 q char *postfix = toPostfix(expstr);
) ~; c6 r5 u( e2 ?    cout << "expstr= "<<expstr << endl;
1 o; l$ X  L2 X4 k7 ^ cout << "postfix= "<<postfix<<endl;; k" Z2 s- H) C, o3 K+ e; S
cout << "value= "<<value(postfix) << endl;5 {6 k. z, A- i2 I
}* _7 x, w9 c# B5 I
return 0;  t. p# j8 O4 R$ I' _" I
}

外国人的数学素质是差啊

外国人的数学素质是差啊

楼主热贴

社区热点

本帖子中包含更多资源