外国人的数学素质是差啊

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
* K9 a2 ~2 u0 `* T7 A好了，找到第四种方法了

代入以下代码，得：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')( W9 \- d: h+ v! H
{1 W" y! }# E% G
switch(expstr)+ q/ H5 b2 v/ a8 @' c  ]
{
; I0 \* X! y& R8 V case'+':; g4 L  K0 Q. X8 o% o' z7 `
case'-':% k, Z* N5 J5 \  t* @
while(!stack.isEmpty()&&stack.get()!='(')! G- c& @+ r' g; x
{
% e1 L' [* ?/ t* _& T postfix[j++] = stack.pop();# e! Z  {2 E* A- U& c
}4 o+ P) _1 E9 V2 C; |
stack.push(expstr[i++]);
- f2 ^$ @% p8 z& k7 p- z, o5 D break;9 C9 S9 n- W- b6 R
case'*':
$ H/ X5 g+ e2 ^" u7 ~ case'/':# X) u0 P  P4 T, L& b
while(!stack.isEmpty()&&(stack.get()=='*'||stack.get()=='/')). v) P; a! F! x
{
6 i% j$ \; X' _2 Y+ o% h3 M& u6 S( e9 } postfix[j++] = stack.pop();
1 g) d3 _: |2 H; s# H }* e( d8 L/ J3 E. V- O" q1 F' a) t
stack.push(expstr[i++]);
3 K0 ^8 U, i% t/ J  P% x) \ break;
8 i0 a  V7 _& S! H case'(':stack.push(expstr[i++]);* m$ x. W1 W5 ~  C: h  Z
break;3 ~. M: p/ X8 s' |9 t
case')':out = stack.pop();
2 ^7 a2 j7 {0 X& {: w while(!stack.isEmpty()&&out!='(')6 G" f, y8 \9 a3 x+ r
{% X$ ^/ j7 I& c3 Z' V
postfix[j++] = out;
. z  r: t/ r7 G/ d out = stack.pop();
) b0 \* l$ W, K) f }4 a; A# Z8 V  i9 S( e; R. n
i++;
+ W) S  C" v3 |. x break;
  W, z* W1 n" h: {, R7 _  j default:
# C/ Z  O" q( q+ a while(expstr>='0'&&expstr<='9'&&expstr!='\0')6 ]0 t* r2 O. e5 A! w3 E( s3 J
{
  f! }. l. C% {; W. B. k1 b$ [5 M postfix[j++] = expstr[i++];
* L$ s$ F8 F& w4 x! M( ~% M }$ I9 Y% y/ b- V( n" r+ Z8 W
postfix[j++]=' ';
+ k& x0 d; L8 R  M' @ break;
& C2 p+ ~/ E1 b) @- O" a) X) Y }
# l% @+ I- r% X5 ~9 B }
  ?- ~$ y" C" I& C9 } while(!stack.isEmpty())
6 l/ i, x1 ?0 m+ W7 W6 F {
9 ]4 |( E& e4 z postfix[j++]=stack.pop();
8 E8 Y7 H# u" J+ d! ` }
8 X) S( @4 `# r5 Q6 w& M, K postfix[j]='\0';
8 R  M/ B+ I( r* J return postfix;
! C$ H( t) u3 T% K7 Q}
0 u9 z/ B1 K- o' s
- X3 X* l* k9 [9 F% b, Qint value(char *postfix)% C; o% d1 G; |2 Y5 e# B) |$ o
{
4 |1 _: A/ ^' Z( M LinkedStack<int> stack;
9 Q9 `# R5 z2 e; J0 a; ] int i=0;
6 u4 R1 a- j6 p int result = 0;4 s4 H$ M6 }- D/ ]
while(postfix!='\0')
) c' n: `* f- l/ k& |" D7 G0 R6 \ {
) m* g/ r; f6 [3 N1 X6 X0 g3 E if(postfix>='0'&&postfix<='9')# ~$ k: j' p9 f% b2 i
{
! g5 o7 O  X" D& y result = 0;
  a4 ]- P6 j3 l; N- T6 L  { while(postfix!=' ')
% W' z! o; H5 m8 n4 u  ?$ f0 i {
( j$ Q2 |& h2 Y) G& U result = result*10+postfix[i++]-'0';0 A2 l8 [! W, E
}
" l7 z/ t0 U* q$ L: |. z i++;
1 [3 F* n0 v8 j+ l. a# r9 [ stack.push(result);, L& y  M. |- @* E' U7 L/ J
}: k, C5 a2 @. m2 n* H+ S: ?
else1 ?, H" G- O) h8 J! T! t
{
2 V2 I7 ^4 l+ t, o if(postfix!=' ')
4 W7 T" s/ ?/ M% ` {2 v/ ^  r! H1 t
int y = stack.pop();; Z4 {: \* P- h8 T, {
int x = stack.pop();- M9 T  v8 b- [
switch(postfix)
. n% T0 Q& ~. |- x; q {
8 f5 Z' n, X- U* o case'+':result = x + y;/ n+ I/ N5 ?+ h, u
break;
9 l4 D. b  r  J3 z! [0 q$ p/ x case'-':result = x - y;
6 H, s. B6 f& {& F: K break;  G2 z. T4 l/ t0 y' k# M
case'*':result = x *y;8 q) {/ ^5 d  p# a5 O
break;0 U( b3 P8 v6 q' Z" ^/ N
case'/':result = x / y;
$ e8 t( [3 K; j break;
1 Z7 A0 w; k- Z% a }
$ T9 t7 a( T  p0 S' m stack.push(result);% M9 h& V5 I  c$ p
}
0 X  ^; _* d0 f, H. N; k% l i++;
4 _- I) l$ w* [/ z1 \ }8 J0 v, r; c( {2 a0 w
}+ H# W! [6 f) @) D; V
return stack.pop();
8 |* P! x  U' F3 w( r}( w" m9 T2 s, t& E- y" F

9 m- j1 V1 }% ^  V8 ?int main()1 f1 x" d! Y- `, n7 g5 x
{
+ i& k6 z/ O: c/ Y1 \, H //char *expstr = "121+10*(52-49+20)/((35-25)*2+10)";
3 H* v0 x4 ?5 F( k5 R, y* z3 m. a cout << "请输入表达式:";' x/ O& W( J; O9 q8 L7 s
//char *a ;' f! C3 W' Y: i9 ?" i, Y% |+ R
//cin >> *a;' x0 o" V) g7 X& S
char expstr[20]={0};
( g  g9 H2 f  C" p( K while(1)1 A7 O. X# a/ A- S! `
{- B& d- p( Y+ G
cin>>expstr;
" K( B  Q1 l4 e2 D& F3 J; Z char *postfix = toPostfix(expstr);
7 O* `; i( C  Q3 v: }    cout << "expstr= "<<expstr << endl;
/ v( C, z3 c1 j cout << "postfix= "<<postfix<<endl;" s/ F# U, v% C- t
cout << "value= "<<value(postfix) << endl;# U2 I1 I( t. S8 |$ C2 W
}( }" C+ `3 f9 Z
return 0;
; v; X/ w4 b: F" H5 K: d7 Y0 L3 F}

外国人的数学素质是差啊

外国人的数学素质是差啊

楼主热贴

社区热点

本帖子中包含更多资源