外国人的数学素质是差啊

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:14
" ?3 e; `9 @' l& G/ w9 l5 M2 ? Z好了，找到第四种方法了

代入以下代码，得：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')
& U9 X0 L/ A$ }' w4 H7 X! p1 K {/ {  e9 u# |1 I0 Y5 B/ S5 _
switch(expstr)7 ?6 {, B. |9 W/ p* I3 ?% ^( j1 `$ ^
{+ l1 Q, f+ J) K
case'+':7 N( j, h* ~( V5 f! C; j& }; x
case'-':8 i# X& h; Y; @8 }8 A0 H3 }4 R' Z  b! s
while(!stack.isEmpty()&&stack.get()!='(')
3 N5 N7 U% D3 R1 _* Z) I. I3 Z  } {
' W; `* \* R; O& O5 h5 E8 j6 v! y+ \ postfix[j++] = stack.pop();
9 {6 N0 [; Z6 v& Z$ Q }% v/ i, Z6 v. V: \( ^
stack.push(expstr[i++]);
4 ?' N9 P2 `& F. `0 k; s7 Q! E break;
9 I6 O" t0 p; ~  w8 s case'*':
+ T+ X3 `6 V+ s* f- ]4 h case'/':
' `- Y9 P# x# E' ?, \ while(!stack.isEmpty()&&(stack.get()=='*'||stack.get()=='/'))) \$ v4 z: U; ^+ k6 y* a0 p
{# v, m" j3 @& t. ~+ g' E$ b; `! P, @
postfix[j++] = stack.pop();9 D' k/ f- u- r0 }
}* O; p* D, {! Q  C+ I* y9 g
stack.push(expstr[i++]);
3 }2 F0 k' P/ Z8 w break;
" W- {! F. G$ V$ \. x7 m% e# Y case'(':stack.push(expstr[i++]);& V  E/ F, i( @5 U3 A. u. w/ i
break;. s( J; R+ @% e
case')':out = stack.pop();
* i( P0 i* z& k9 l. b8 ~5 `; {- @ while(!stack.isEmpty()&&out!='(')
/ D- y/ v, c1 J* ~. h- k' |- g* A {' |! I7 o/ |+ W: B1 |- A5 ?
postfix[j++] = out;
& ?9 O; s# p  p: C7 U: E5 n% N out = stack.pop();( b- M1 S" X; z4 C+ P: I; P$ K
}! ~6 \  r& b& C3 k/ K
i++;
, w8 u+ q5 Z, {/ \( `* x4 e break;
2 L# ~$ @! X& A- Z# Z default:
+ Q, c, b3 p- `4 m while(expstr>='0'&&expstr<='9'&&expstr!='\0')  `7 ^! p# L8 ^
{
% q; \/ H! c- X% ~- b5 z0 w postfix[j++] = expstr[i++];' T1 D* I; g& y0 ~+ N. K
}) g6 Z& C; ]. t0 m
postfix[j++]=' ';
0 D/ e, \3 i% W$ d: R& R break;& K. f8 G5 n2 G- H- u6 h9 C
}
9 O8 @) i( R, y% c9 C4 _ }
& D1 F" d. E6 ]( g, {3 Q$ q8 G. T! b while(!stack.isEmpty())1 N5 ]3 k; X8 z9 }1 g$ o+ o6 f0 I6 O
{" R/ ~. o2 ?3 o8 B* G+ K8 P
postfix[j++]=stack.pop();
+ E5 p" v! i2 F  d9 p  e( p% U }
. D, N5 m. `& g7 a; H5 q( O postfix[j]='\0';
% }: a3 W2 S+ s" V return postfix;+ ~& p' I" A' z% n' m
}
) k4 S, O& {5 k- f, ]8 a+ V6 H! L  L3 X2 k  A+ p& `# K/ e1 p
int value(char *postfix)( M2 O4 [9 J5 K! v% a" n
{5 r- ]5 ~" S2 l+ p8 t* C7 Y
LinkedStack<int> stack;0 S& T9 ]( Z) R, O* {9 |
int i=0;
1 [; Q$ Z- p; _# F int result = 0;
1 @( o1 ]0 m$ s while(postfix!='\0')
' s2 n- O; L" |9 ]7 ? {/ K2 u2 _( m* L- q  o1 q: q
if(postfix>='0'&&postfix<='9')" l5 L( f1 O# n9 s) b+ X( U8 $ E8 P
{7 m& h5 v9 H) D8 Q+ J7 q9 w" i0 \
result = 0;
! K& |% _) o# y9 f2 k$ } while(postfix!=' ')2 a! @& x) K/ {/ T8 Y. u- Z. b& U
{( P' r" m( w! Q
result = result*10+postfix[i++]-'0';
; u' U6 r6 g1 \ }
+ h  F* F: R* `3 u i++;
( |" V0 A) N1 z( J& {* j stack.push(result);
" L4 Y1 Y$ h# F- B( o  j6 Z; w }
7 p4 X( ?9 D& i: d* Y% s else
/ o: q( v$ G4 }+ j9 Z4 u) W& M7 T {: Q- ?; A6 K- I6 e& b
if(postfix!=' ')
; s/ b# e' u! e# q+ {. G4 k6 V3 z {' ^& P* {! Y5 Y1 B$ $ R0 r
int y = stack.pop();
$ [1 O3 p. V! D9 B  K int x = stack.pop();" f% K" ]1 m9 N- ?, S+ E1 |& k
switch(postfix)
7 q# h) b% `5 Q, V8 ?: w0 ? {
5 r5 V  C3 c; \2 P0 V. x case'+':result = x + y;
8 n" E2 a& p' I' b! c/ x5 h. b8 F# Z break;
) p* m2 t" z; H1 k7 e- e( q case'-':result = x - y;
+ @5 O  S5 `% D" m9 _ break;
$ l3 g: H5 h) {: i! u case'*':result = x *y;% [( J% A% y* ^# @2 A& I
break;
5 W% \( J  N' _4 p1 V case'/':result = x / y;" |' S% e8 X* [5 W+ b1 S2 Z" j
break;
% ^; l+ n' P2 B% U" t' D4 J) i }9 Q* E" A& y7 f; b) n5 J
stack.push(result);
: a( r7 C9 m/ {. R% z6 i }  |5 j& J: K  s# Z
i++;/ W7 |; s& m% A5 c+ [+ h" k
}
4 k  R$ I, A4 _9 [; a- N; H }" A* M% Z; a7 ?& r$ c% ^7 X) Z/ x
return stack.pop();
2 J6 ]; I7 `& h/ f9 h- |6 U5 y# r3 Y}3 x9 F; q! L1 C; P

9 w6 W9 P+ C/ eint main()4 p6 i9 ?' N5 T" T' g2 K, q
{! O3 b& p- M# W
//char *expstr = "121+10*(52-49+20)/((35-25)*2+10)";
: ^& Y" C7 z7 v; Z$ o( X cout << "请输入表达式:";+ f1 B# s' m$ N
//char *a ;3 N5 W3 x% S8 ^
//cin >> *a;4 i) p% {0 p, R) d( l
char expstr[20]={0};
3 n- y4 C# w8 R" }: I2 N while(1)
5 c4 @' Y% o( t {1 _' M0 s/ @% X- [
cin>>expstr;" @- g% f* w4 X' R
char *postfix = toPostfix(expstr);
2 ~% q' t, Y' T/ m) L$ p9 w    cout << "expstr= "<<expstr << endl;% T' e( |- h3 g5 S2 h
cout << "postfix= "<<postfix<<endl;, \- I4 l( q2 m$ z; b, x
cout << "value= "<<value(postfix) << endl;
- Z: N, _# w3 k. T: o- J3 S }8 F; e; M( n' W1 P! e* S' U7 r
return 0;
2 G# ?; C$ h; U; v# P' U}

外国人的数学素质是差啊

外国人的数学素质是差啊

楼主热贴

社区热点

本帖子中包含更多资源