外国人的数学素质是差啊

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$ j6 f1 t( V4 ^9 V4 O: p1 @- X. ]! @
好了，找到第四种方法了

代入以下代码，得：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')
  r: \+ X9 T& M% u1 I {
1 ^8 q; j  o, W% @ switch(expstr)
/ [4 _+ o! ^& V. n" K; u; q {: \3 T, I8 H7 F7 V: g
case'+':
, Z; A8 U# O8 r' A3 j, E9 w" C case'-':
& B; A- @0 w9 c5 q4 m) ? while(!stack.isEmpty()&&stack.get()!='(')
- h& \# h) F, f( @; u {" [: v+ a) v! x7 u' p' J4 \9 v
postfix[j++] = stack.pop();+ G3 V* J' R- g/ a+ @
}
) F" E5 R) R0 M- N3 C, L9 u7 o stack.push(expstr[i++]);
2 J* r; G! @" l9 l  v" k' T7 v break;+ k' X+ a5 K1 G' b9 G* R) o
case'*':
  ~, {+ l! M( u9 }/ W' r( x' q case'/':
* R  v/ x2 V1 i/ B# X0 u while(!stack.isEmpty()&&(stack.get()=='*'||stack.get()=='/')), K% ]! B3 |) U( t9 k7 Z
{
  |  C1 l2 f- ~$ O6 { postfix[j++] = stack.pop();
; I& R7 |  U7 t+ L1 `: l1 E }* O( i( k( ?2 V- Q7 L, z) P- {, u& i
stack.push(expstr[i++]);
1 T5 R6 u2 E0 u' ?3 _$ P break;
6 k/ }' O3 q; G  z" Y5 ?" T9 o3 N case'(':stack.push(expstr[i++]);  w* |6 t) H) w, r6 U& ^
break;" M; Z  C3 w1 ]+ E# W
case')':out = stack.pop();
4 w9 p. E5 P& V7 o1 g while(!stack.isEmpty()&&out!='(')
+ z1 b! ]  R" \  N2 q* C {
. n! L& [' t3 ^, r( X postfix[j++] = out;
8 \# `* E2 H+ ^, f7 I' Z' \7 X out = stack.pop();
/ I7 e& W. K6 P4 g }' `3 c# }, p! R7 q
i++;
. |7 H3 k4 K& u( Y8 B+ n! S7 N break;
! J. G, R& k, G$ c4 x1 S default:
$ L- t) \5 P  E+ y while(expstr>='0'&&expstr<='9'&&expstr!='\0')0 X% l1 ^  a8 H0 O& |4 s7 t  s. Q
{; X# @  s" g" K* r7 o
postfix[j++] = expstr[i++];
( f" R. w. X  D) h1 Y% F: ^ }
0 v# G$ U- ?. p' i  p& l0 _$ F% c postfix[j++]=' ';% r3 q# \( y1 ~, X2 d
break;/ r# g0 n7 o0 ^- ]7 N) D5 Z$ T7 B
}; z1 i' }, ~* J* |& C6 K; d* P
}# o+ _7 q, F+ I. o: l
while(!stack.isEmpty())8 g2 @/ E' s/ A7 W
{
' r# {8 s( ]) E' j postfix[j++]=stack.pop();
4 ^, `1 l5 F1 X* { }+ V5 Q: s+ f( d3 R, B  T2 C8 d
postfix[j]='\0';
+ l5 y9 s& T) U1 d! a. A2 N return postfix;7 _( R/ _* Y: O3 b' j
}
% n8 }3 n0 W2 P: [; C& J  q7 }! H, l3 P5 B0 P+ A! y
int value(char *postfix)
* g- R* q# ^. z+ I- X{- T0 N+ r& z+ x% m  m
LinkedStack<int> stack;' o8 g" |* t$ g* h
int i=0;
- T- K- P" Y! F9 x* a int result = 0;! D0 e) V# V0 R  t
while(postfix!='\0')/ g( ]. ^9 `- S! R" u- [
{
" U( Y% h4 g, f( l0 _9 U1 ` if(postfix>='0'&&postfix<='9')
+ a: j9 Q9 j4 Y- g7 R5 z {+ ?) ~/ O1 g) C1 S
result = 0;
( ]4 \1 w' }- z+ A, t while(postfix!=' ')
& U# r% ~4 t5 U+ e$ ~" w: W {+ Z: k. K. A3 {. D; M* W9 ~% s
result = result*10+postfix[i++]-'0';2 _0 q' I2 Q0 @+ s
}! _! c4 a  i* X( S: \
i++;1 O( R- v7 R* ~% w$ K2 }5 t8 M- p
stack.push(result);
7 ]# ~1 _7 B: ]4 T }
4 b6 k1 m" }! a$ w* Z% }1 W else
. X5 t* J" P4 u3 R% I- p* y {, [0 J9 }3 M8 U0 n; _
if(postfix!=' ')4 T5 S( H% K. F3 r$ s5 v) G- C2 }8 l
{" b! [7 G8 k' R8 d- |
int y = stack.pop();
! A" a) Q) z% w; T int x = stack.pop();
+ Z% C8 ]* k% V: v7 H/ k7 d0 M8 x switch(postfix), x( a( R# {, C, d, I
{
. S/ _# A! B5 u  C% w! X case'+':result = x + y;
) q( C9 {9 L  t! s% l+ M break;) \6 g* [8 P( i" M. B2 X
case'-':result = x - y;0 j+ _6 n* }/ {' T+ w4 l& w( e
break;
2 X$ k& e# H4 [8 w. }8 T( i$ ] case'*':result = x *y;
: r# _7 o3 x! L: w9 O; l break;
  P! X: t( W& P: ^" d' r case'/':result = x / y;
3 x9 M0 V* q! @  u4 z( U' N5 p break;
% V/ r  S" v: s7 J1 ^ }
8 t" e( v8 ?- K! s3 W5 \% @+ `7 K) v stack.push(result);
9 j; Z+ }# k1 I) _1 } }
1 X7 M- O$ n3 V* ?, ?8 b, a. k i++;) c( ?. T3 Y6 {
}4 c- N4 x5 h! Y7 {5 L. X/ M' e" v
}( B! a' z# Y/ ]+ y% q% C
return stack.pop();5 X+ d! {+ l/ v; g3 D
}
9 _6 n0 d- j! V) j5 t. y
2 L  }! x* o1 s1 y5 o3 aint main()
; O/ b; ~  N' ]7 h  o' b. _{
1 `2 [& O2 q0 D //char *expstr = "121+10*(52-49+20)/((35-25)*2+10)";
! Y( v1 G! D: {" _ cout << "请输入表达式:";2 g) u+ v& s# L  X9 Q' V
//char *a ;
/ @% b' q- c1 O! s5 l0 C, N: f //cin >> *a;) g$ w# d+ E2 Z, O) R  ~( g
char expstr[20]={0};
5 i; ~2 `5 ?+ H8 s. {' s9 c; W while(1)
6 ?" L; @( ?4 Q! E6 Z4 W- t; |( W {2 I" r1 q9 V) C; J& u! [7 \2 J
cin>>expstr;
3 M7 Y+ m% p2 N: y$ n char *postfix = toPostfix(expstr);
4 a: R9 K! p9 Y* ~) \    cout << "expstr= "<<expstr << endl;
! E* L) L. C- x% G cout << "postfix= "<<postfix<<endl;1 Q9 B  M2 Y6 U/ b# |( R
cout << "value= "<<value(postfix) << endl;: E2 {4 l+ |6 S$ Z
}3 L6 ^( G$ J* y8 r7 |
return 0;- f/ R; j+ g2 i5 O
}

外国人的数学素质是差啊

外国人的数学素质是差啊

楼主热贴

社区热点

本帖子中包含更多资源