外国人的数学素质是差啊

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
6 N% S! H/ I3 N- y好了，找到第四种方法了

代入以下代码，得：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')
7 m2 L7 L0 b8 P: X8 ?9 z# [2 @ {
# C1 g3 ~$ _. U switch(expstr)
1 V  l( X4 x" F" V: `2 q {
- g2 c* y$ o3 u0 F9 P case'+':) V/ O& n$ I# j3 y9 Y
case'-':
5 g- z8 s4 q! P% Y6 J% ~& F while(!stack.isEmpty()&&stack.get()!='(')0 d, }7 t9 m5 H# s! z6 Z
{' V  Q; S4 X( ^7 @
postfix[j++] = stack.pop();* l3 N: L% W7 ?7 G
}7 `9 R* a" h8 m1 p* G
stack.push(expstr[i++]);
- A  |; c# m. B$ b7 d7 P break;% a) }; R6 T+ q& F7 V% B1 Q" j
case'*':) Y2 j0 K* U1 @2 k  }
case'/':$ A% ?! T! |  d6 _: }
while(!stack.isEmpty()&&(stack.get()=='*'||stack.get()=='/'))
$ \* i9 _1 g7 y {
/ ]0 W( o7 O, N+ `+ x2 b# r1 c3 i0 M postfix[j++] = stack.pop();
9 o4 j7 }1 l5 z2 A6 J( d( O }3 P5 s2 U: e/ B8 l0 N
stack.push(expstr[i++]);
' b& i5 c- Y: P break;3 B: L( I: b4 x; t4 c' C2 k" o
case'(':stack.push(expstr[i++]);
$ H2 f& o  \  A- f break;$ D. D+ d( k, Y7 @+ p, }
case')':out = stack.pop();
" y3 ~" ^# h  m( K, ] while(!stack.isEmpty()&&out!='(')
. g5 u  u: i* h- I2 M0 o {
9 z. M$ }9 @$ V8 `" b postfix[j++] = out;
7 j  h, F6 ?; X; ]3 [ out = stack.pop();4 N+ k' r3 t) h1 J3 L0 P* Q
}5 i4 o) n$ c5 J$ l( ]
i++;
0 U  @& Y. q, R  {# D. F break;
4 M% K5 L8 J& Z/ E default:" t1 ~  X) N- v
while(expstr>='0'&&expstr<='9'&&expstr!='\0')
8 |! ^  i& j3 g$ E {
  a2 G& A: w' Y  A/ } postfix[j++] = expstr[i++];
2 x. x% ?! J9 p0 f }- Z# [9 F) P. Y$ B& c& h* s
postfix[j++]=' ';# U. {" |" z; ], X
break;
* s# X/ L! e6 s0 ?$ R2 e: G }- a: }7 d- k7 Z$ V: J
}4 A8 K( ~. n: W
while(!stack.isEmpty())
8 b: O7 R' p1 U0 U {* k5 z. U3 Q: i- U
postfix[j++]=stack.pop();
4 X5 v  k$ U2 g% | }
1 ]  w6 q1 c/ D. |; i postfix[j]='\0';9 F- g& l3 |/ }% }9 d2 y! V& c
return postfix;
' s7 J& T+ _0 c8 Y, k}$ r, _5 S2 I( s9 C% h/ Q1 E4 }
( ~: ~2 c6 }9 e( K& d0 H
int value(char *postfix)' y& f" n3 k& ^2 ?6 I6 @- t
{, y; u% O' |2 s0 U
LinkedStack<int> stack;
# I, U$ @8 r9 j int i=0;
0 d+ l! f. B; O5 a# H" k# _' V2 F int result = 0;2 ~; X7 G( [- {9 ~
while(postfix!='\0')
- L7 _$ {) U4 t& Q# E$ H4 B0 [ {! [; h( V* e. D5 z/ X
if(postfix>='0'&&postfix<='9')0 [8 @4 N3 s# M3 g; r, D
{; s: G- h; D5 z; r
result = 0;; x6 ~1 u" L8 u
while(postfix!=' ')
" l6 j* W6 w/ [) t; T {2 N6 E: i0 ?  w  t, v1 k
result = result*10+postfix[i++]-'0';
# P0 K$ b# ]9 v$ N }
8 C' F, Z' N! w i++;
2 h" f6 l: |% g6 C3 p! I stack.push(result);" J# O% S: ?0 C, o8 i
}
" q! a. s! V, b3 r: n" T* y6 H; Z7 j else
/ p1 n: W& q* \4 K {
6 r, u: m3 t2 y  ?* P0 }( g if(postfix!=' ')5 R9 E" c+ H- Q- L" }
{
. |! r6 J+ z7 z) s/ C$ I8 k int y = stack.pop();
+ c/ W  y+ D+ S% \4 a5 D int x = stack.pop();
* S4 L2 i' q$ J) E" @ switch(postfix)
, D' v0 |8 D' \* F* P/ U  x) ] {
/ l8 @# n  K6 x  [( ] case'+':result = x + y;3 A: p1 h/ V. d
break;
: e7 v) b# J- R5 d( ^ case'-':result = x - y;3 }. ~0 n. L& P- {7 z% G
break;" p: ]% r4 c0 @& Y, d' H# {
case'*':result = x *y;
; \3 {. ~0 X! g2 o% z& A, c& |0 Z2 r, q break;; l3 D3 `' T& ]4 k1 p; }
case'/':result = x / y;
- x7 c/ t5 n3 U8 K break;' J. B2 O, T  O6 m
}
6 `4 [! \6 x$ w/ ~9 C stack.push(result);
, T; L  v$ N' D( R) }8 l }
/ i5 _$ M5 Q2 Z3 { i++;
, I4 I2 g' d! g- J$ T2 N; H/ S/ c }0 I5 h. r9 K$ g* x
}4 A: t) S; ?+ ]
return stack.pop();3 e6 v3 ?0 o% d4 l7 b
}6 F; I5 @( }) q' t" I2 w% a2 k2 K9 ]* c

' A; w& v* a8 pint main(): w; {, ?+ D7 F9 \) g5 \/ }
{
/ c  h; ?9 I/ f3 M: _: l/ u //char *expstr = "121+10*(52-49+20)/((35-25)*2+10)";! Z9 q; e: n+ x8 f
cout << "请输入表达式:";7 e' ]( }. }( s: R9 a: R
//char *a ;
! E  q  E+ J$ H1 i. q //cin >> *a;
1 f" v: g9 m) W1 b char expstr[20]={0};* F. V9 J3 |- J( b7 b# d* _. Z! c
while(1)
. B2 x' a' e, q' n- R% | {
3 a+ s$ n4 K- X8 \4 Z cin>>expstr;
3 G% ]+ A* `$ Y% ?2 v" C. K char *postfix = toPostfix(expstr);9 d/ O( L" r; E
   cout << "expstr= "<<expstr << endl;: K/ g: Y( Y% G
cout << "postfix= "<<postfix<<endl;7 ]. _" x" x- p% j+ f% D
cout << "value= "<<value(postfix) << endl;/ V0 Q" }: M3 _
}. g, ~; i9 }  y, C3 Z- n7 T$ |8 \9 |
return 0;% v7 m% F0 ]: ?0 q. z2 ^, h% e
}

外国人的数学素质是差啊

外国人的数学素质是差啊

楼主热贴

社区热点

本帖子中包含更多资源