外国人的数学素质是差啊

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
" v! F# T {$ ^1 h好了，找到第四种方法了

代入以下代码，得：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')
- h  x5 R! z" Q( o {, g$ V; }0 `; ~. j7 K
switch(expstr)
% S% t- P9 \- J) { {
9 F6 C4 \1 O; D case'+':. n1 R' ]7 Q$ C# b1 k2 u9 y
case'-':# c: s( b3 @( Y3 I+ @- M
while(!stack.isEmpty()&&stack.get()!='('), B& J3 {% C, E2 x- Z
{3 z. V1 o1 u$ I/ r! R' u
postfix[j++] = stack.pop();
1 g4 k, C, K. U% q! H: L% \4 B }
7 D' l# E, [) p+ H) v  v6 u2 N stack.push(expstr[i++]);
2 S5 v* U& E( i break;
5 b8 T, r8 a" T5 }3 a# W/ ^ case'*':
' O7 h& m- Z1 H, ]6 R3 J6 @6 i case'/':/ X9 V6 m5 m. M3 z2 i5 B; a
while(!stack.isEmpty()&&(stack.get()=='*'||stack.get()=='/'))* t- }# d7 P% O& ~4 k* s; i" e
{
" U: ]7 h/ L% o- I8 \" @ postfix[j++] = stack.pop();) Q$ E6 P8 z/ V4 Z5 [
}
& Q' B  M0 [' g' e4 V stack.push(expstr[i++]);( @+ x6 d/ N( v# w& }
break;; L& b1 K. j& }! y* a
case'(':stack.push(expstr[i++]);8 h/ |7 a7 q6 n. }( V( A! a6 x
break;( W; ^( ~9 I/ U- [8 c/ o, U
case')':out = stack.pop();
; X. I: t4 O- g6 @) ]' _# h while(!stack.isEmpty()&&out!='(')1 w# i1 V8 J6 n. r
{" a1 q" k' w0 _5 N2 t  X! M2 w) b
postfix[j++] = out;
4 {& {* B+ I4 h  T8 r3 M out = stack.pop();4 y3 p! Q& c# j" A# h) r, G
}2 r! S0 n9 I9 i* A8 I1 \8 @
i++;
5 |* u" U( a( u, g) e8 S6 F break;
% {$ G5 |5 v3 e$ j, k default:
4 b% K! [) B1 G6 _( q- E while(expstr>='0'&&expstr<='9'&&expstr!='\0')
- R/ |6 H: N  T0 ^/ V {
1 i0 s' Y9 D: x/ w) X postfix[j++] = expstr[i++];8 `. p3 d" c* @2 u1 g" R& z
}) ^5 |: b) F- W' K1 h; J( \  p
postfix[j++]=' ';
' Z+ g3 l8 @# e) x1 Z% F" g break;. Z& u$ a" }6 K3 E: l. _  \
}
* P0 O/ N4 u( w' g8 u2 \+ Q }
+ |$ E5 L# h4 Q. Z while(!stack.isEmpty())# J' k5 d9 o! p6 }! v3 G& h' t
{/ J% t" h6 d% v: H
postfix[j++]=stack.pop();
  X$ [4 E: y& ^6 D" ?( Z }
* @$ @( f. [# M4 ?3 ~) A7 O postfix[j]='\0';" r3 D" s5 }1 @6 S  L# m5 z
return postfix;
; R% N2 P8 `/ |/ I& }0 g; D}
& g/ {9 _* x. v& H/ |0 i/ h
( b1 F8 d; `' J( nint value(char *postfix)1 S* h2 S& q) @6 i
{
: K+ M( E! c8 T: X! f6 O6 g  V LinkedStack<int> stack;% [! R1 E( z# @) s
int i=0;- u, r- C5 c2 G  b& ~: s; A
int result = 0;
1 v8 _* J* ~6 r5 g' b while(postfix!='\0')
# o% a. [; B/ Y: k {
8 ~" X) n% ^$ n! S# R% a* A if(postfix>='0'&&postfix<='9')( r8 ?7 k4 Q" T& M
{
7 Z6 v1 O& z) }1 f# i+ j result = 0;
% R; m' e, B& Z) }( j6 X while(postfix!=' ')
3 n4 K+ L% W" K, c# B* F- s2 g {
6 J4 f( [! k! w/ q- f/ T result = result*10+postfix[i++]-'0';: n$ s) q0 x4 E# g; f3 j$ G# e$ C4 d
}
+ ~! K6 o' t6 ~2 H i++;0 D& h, S4 E% q- w5 }3 P0 D
stack.push(result);& }( [$ r& i* I6 y0 R
}
" I5 |, X: Q+ w else
3 f! l1 ^0 o: N) ^; i. _& T {8 T+ M& }/ e* S4 n
if(postfix!=' ')) c' f. T8 Z# |; l- M$ k5 N
{
2 _1 j/ @+ F9 V- K" J/ d7 I2 T, w int y = stack.pop();
7 S% e8 t0 {4 x+ W  K/ U+ i int x = stack.pop();
+ D* u% \5 e1 Q+ x/ J$ } switch(postfix)
4 A/ J; ~- e* c  _5 p. |6 ` {/ L3 U7 b( }; @! ~* `9 S. q
case'+':result = x + y;
' @; g* `( r5 Q, k& x break;: y" [) p3 ?: T  J# S& u
case'-':result = x - y;$ N  V1 F" t" ?
break;0 H( S5 E. N0 Q- }7 b
case'*':result = x *y;
2 j0 c: h& Y  e# M6 C) j. O break;8 ^% ^3 e) ]  |6 y2 x1 O( l
case'/':result = x / y;0 y' e  q( F# c9 ^$ y7 ~, ~* j. p; \8 @
break;/ ~" T) p% Y- G5 x4 @
}
8 @1 X5 R3 x4 R! B stack.push(result);/ X# G# L0 d6 U" B' n1 [
}
  r, j! `; v! u# q- B i++;5 b. I+ ?2 N, m% A9 t$ d
}( [. t5 I* A4 B; C* X  X3 v: @6 I
}
+ H1 V/ X% I0 B8 J5 Z return stack.pop();
' G7 u- ?* m* b' k4 }1 ~9 G- ?! r}
% ]/ ^2 x6 b; n
/ b5 o4 b$ H* Q5 f! K3 |$ w9 Uint main()
* x) W( g4 ]5 A& D+ H% l{
. k0 U5 B! Y' I- [/ D# n/ e1 T //char *expstr = "121+10*(52-49+20)/((35-25)*2+10)";
8 F0 w9 K9 R% c cout << "请输入表达式:";
% r) J4 ?5 \* {; G" P+ B //char *a ;
) ~+ q- j: {0 T //cin >> *a;- r* U# B9 e, j
char expstr[20]={0};
+ M4 a( v9 ?+ O% j/ l6 l2 Y, Z while(1)
{
( `* m- A0 T0 e cin>>expstr;% G  v5 o4 h8 _: _/ s$ J9 K
char *postfix = toPostfix(expstr);3 D  h9 s4 h3 q' p5 n0 v+ U
   cout << "expstr= "<<expstr << endl;
2 S9 H8 h7 o) x& }' s cout << "postfix= "<<postfix<<endl;
2 D1 e. ], [. e" o  s cout << "value= "<<value(postfix) << endl;
" V+ |: y  K& d9 L$ g4 _ }
/ X2 F+ j& }/ E1 B return 0;
' C2 c& N6 ]8 _, p}

外国人的数学素质是差啊

外国人的数学素质是差啊

楼主热贴

社区热点

本帖子中包含更多资源

浏览过的版块