外国人的数学素质是差啊

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解啊？？

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

caimicn 发表于 2016-3-31 10:14
; n% z8 X4 V9 W1 O* z8 V好了，找到第四种方法了

代入以下代码，得：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')
5 n3 g5 ^) y% c! @ {
: I% {+ B3 n6 {1 C& A: d switch(expstr)3 p& ?) C% L0 N4 b% x. ]0 o; Y( \
{
" T3 S% a3 j9 N7 \1 j. H8 P1 i case'+':" i* }) [+ ~7 p) J' B
case'-':2 z) J' w# y; U% m
while(!stack.isEmpty()&&stack.get()!='(')' n% w$ |) o6 C) `- j7 g: e' }+ u2 j
{
% x; z# P5 M: s postfix[j++] = stack.pop();
' T  C( j8 C5 g }% K# N( p6 u- e5 S, e4 C5 G7 d: c4 w
stack.push(expstr[i++]);
- z! |; T+ l' B0 ?' A: o9 k break;
- G; _1 Z# C+ v# o  v3 J case'*':' ~0 o- Z/ J. r' Q( Y5 q
case'/':& m2 z/ |$ H8 f" O8 A
while(!stack.isEmpty()&&(stack.get()=='*'||stack.get()=='/'))- M3 q% _* V% i) @
{8 w7 Q! {0 `9 X4 t7 C- j
postfix[j++] = stack.pop();& j  x/ P) V. P  r$ C
}
- G! d7 E0 C  V) o1 [ stack.push(expstr[i++]);
0 u( I4 H) t" [& a# w) Z break;; X) y7 |: A  r1 O' Z, H
case'(':stack.push(expstr[i++]);! Q9 ^! o/ w, H+ x) P
break;
5 M! Z3 p$ M  e: k0 v case')':out = stack.pop();
. u+ |( F  v( d7 T1 M. @1 l+ M while(!stack.isEmpty()&&out!='(')
% Q' w* ]7 `+ u' c {. f# v3 z+ r% G3 x
postfix[j++] = out;/ D; y0 _- d/ z: t
out = stack.pop();1 O" H5 ^( j; I1 s3 z8 O- ^# Z9 B
}
: r* S5 r% {; z4 r6 S6 V+ V i++;
7 ^9 K8 I! c% c% }% w' z break;/ R5 ~8 ^$ R: _& {
default:
: L' P* E% Q! ^ while(expstr>='0'&&expstr<='9'&&expstr!='\0')
" \7 R+ @" }+ A2 L {
) P( U/ d6 R! ?: p postfix[j++] = expstr[i++];
8 ]3 O) z2 W6 i2 G/ v  h4 s }
" }7 m4 N0 Q6 u postfix[j++]=' ';3 ]- d# A& D# a" Z8 ], v
break;
$ J% g6 @# S' R) s/ |0 o }4 E' `6 A' C( h7 Z+ z% ?
}
8 m3 }, q8 W3 `2 Z3 O$ A while(!stack.isEmpty())& O" j' @+ r# t2 x# i; f
{% e. }' P; v8 d! U  v7 U
postfix[j++]=stack.pop();
( F3 g- S/ y, S* r* S. ^5 h$ H5 E }
) M1 O6 R2 v  Z* w/ n postfix[j]='\0';
- `' Z) r) F" s+ P. J return postfix;6 N/ `! A5 Z. W
}% X: Y, Y( S: d5 p% }
# K( {. p0 v4 X" `# X
int value(char *postfix)
& N& w! P4 U2 h6 v. m{/ E. {; V9 x" H# k2 S8 K+ X
LinkedStack<int> stack;& h& f! c* I$ |! L# s: M( D- Z
int i=0;; O# v  A) N- S3 y9 Y
int result = 0;
% ^) E, }; t) e2 @ while(postfix!='\0')
2 u  \- y5 ^% D7 T {
2 f6 s. K1 v/ ^' D0 z if(postfix>='0'&&postfix<='9')
4 ^6 i$ w/ K  x& R {
8 i+ v+ @, D" E) f6 J( T" ]  H result = 0;( t% k  G$ U4 T4 e) ?( d
while(postfix!=' ')
) u  W9 _& }( N# x& g1 _2 X {
) I1 [) i$ K, w" Y0 ]* s result = result*10+postfix[i++]-'0';7 \* a3 r; l7 H9 ]
}' Z) c8 y" Q" x5 M
i++;
) x8 T7 M# ~. R9 U stack.push(result);
# t0 d3 P$ c# H9 k# {6 K) u }. |- u! F; k% m2 }9 z; E2 L# \1 H
else% l2 [( z# {9 n0 w
{
& z: E& U* c( b. j2 I5 | if(postfix!=' ')
" K8 m& K2 x7 C! R# l {! _7 Q, J6 ]4 O; b$ o) X9 F
int y = stack.pop();9 b+ [1 g! ~0 U) e; P
int x = stack.pop();/ L% r9 V$ J% K& X
switch(postfix)# \" J3 Y+ _& ^+ X7 O' h; E
{
case'+':result = x + y;
+ ^9 T2 q2 F% P% I. O0 x break;8 E% G& j- v$ r; p  H3 w7 E
case'-':result = x - y;
4 b/ X4 |3 g& D! m break;
6 D6 B* c1 _9 F# ?) A case'*':result = x *y;, Z. W, Z4 M2 ^6 P
break;
! n) o3 r2 P- I" H case'/':result = x / y;7 O2 o% |3 V, k4 V: T2 x( H/ T: _
break;3 n) Q! _4 C( V: A
}
+ C: W$ l+ |$ H2 z" q) ^ stack.push(result);8 ~( Q4 O- k% t* g( W- o" F5 u
}! P7 B7 i* s( ]% B+ ^7 D
i++;! |) c: S# D) n
}
( k; D- N0 T+ O- m3 U% h- R+ r }
6 z' l1 R9 o  I0 G  B return stack.pop();6 G# R9 [! V' y: G" V
}
5 c. @; [" }. W5 T% G9 U4 m2 f% H$ Y. `1 y9 Y' `
int main()
; j" z) W7 c' p+ r8 q& b/ w{
" u# j; k5 G) |6 l6 q2 S //char *expstr = "121+10*(52-49+20)/((35-25)*2+10)";
; [* X$ H& _' K9 C0 }' K cout << "请输入表达式:";8 Z9 y; `$ f2 ]: E, S9 Z1 M& b7 ~
//char *a ;' x, M! Z6 V! p- d; ]2 C
//cin >> *a;
* o: r, ^# u% h2 K! B  d8 ` char expstr[20]={0};
% ?1 W9 R" e, b. c$ a1 Y while(1)
3 s2 b3 Y! ?8 D. @- ]! C* y% Y {  G- Y4 e( A# x# b0 F# s7 V
cin>>expstr;
' w' A8 z! q& G+ P char *postfix = toPostfix(expstr);3 z* p8 v$ w8 }0 {$ n, S
   cout << "expstr= "<<expstr << endl;
( [5 N9 ~; n" F: O+ j cout << "postfix= "<<postfix<<endl;; K( n# p$ W) p8 U
cout << "value= "<<value(postfix) << endl;
1 V- k+ l# o9 u4 v# D. h/ x# t }
0 C7 }$ g9 |. A return 0;# z; L9 F# g* u! W, o- l
}

血腥的情人节 · 发表于 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;
}

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

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

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

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

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

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

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

哪个游戏啊？

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

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

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

好了，找到第四种方法了

外国人的数学素质是差啊

外国人的数学素质是差啊

楼主热贴

社区热点

本帖子中包含更多资源

浏览过的版块