外国人的数学素质是差啊

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:143 @: U- H2 U2 N3 f7 }9 \
好了，找到第四种方法了

代入以下代码，得：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')! v: J0 M4 Q$ j4 N, i
{
$ C  F/ c- q& b- M! V6 X switch(expstr)9 ?" m, `1 m0 O9 c8 z
{
2 [8 l$ Z# @" d" F case'+':; o2 l3 x* |/ W/ H% h
case'-':
8 [2 }2 \9 T+ ]8 c while(!stack.isEmpty()&&stack.get()!='(')
( S: C' T/ ?; u0 ]5 L; j {, W( q) n. m" R$ i8 F" Y+ x$ Z
postfix[j++] = stack.pop();
# t2 T& G$ F6 V# a. S" c8 O }
5 [& x5 x: W% p* H# i stack.push(expstr[i++]);
. `5 H' K  S' L, B: n2 T! y3 A break;+ N  |' E) w# }
case'*':
5 J+ R4 {9 Z* }; Y2 U case'/':7 z$ w7 b4 M- x/ r
while(!stack.isEmpty()&&(stack.get()=='*'||stack.get()=='/'))4 _" R+ }) `& v0 B& |
{
. s, f  z0 U. I) G, \ postfix[j++] = stack.pop();
2 W4 J- E$ b( @ }
8 I) V+ L9 h) w stack.push(expstr[i++]);
( p  `' F/ n" A  L% |1 ]! K1 f* p break;0 \. ]" u% K2 x7 J3 v
case'(':stack.push(expstr[i++]);
8 H# O% {) }. {+ l- g2 \( G$ } break;
" [" {0 X, H& m, ~- W/ y# K$ c1 K. s! A case')':out = stack.pop();
" ?- Y1 M+ O7 X$ N while(!stack.isEmpty()&&out!='(')
" s) Y2 k+ A/ U- W8 h6 z9 a. J {+ F2 y$ O! L9 c! R1 B
postfix[j++] = out;' U0 H9 U+ l, a6 ?/ p% P3 A
out = stack.pop();: i, W% i/ k& O1 _( {" ~# M& \  J
}
" n5 L' ?. a5 j9 s5 Z' | i++;# v8 D- R% _; Q4 j6 n  _" w, D0 U+ ^
break;/ S3 g% G. f9 N6 V* K  b- I+ ?  B3 r
default:
  }9 z* M. i4 N5 ] while(expstr>='0'&&expstr<='9'&&expstr!='\0')- O1 t3 Z! U$ O. Y$ N% a4 M3 K) Z2 q8 _
{
7 q. v  A+ X# C  ?) @ postfix[j++] = expstr[i++];7 l3 n" T- [" A) |: y& @
}, Y. ^# q- c2 |' n9 N
postfix[j++]=' ';! t/ E, V0 O& o
break;5 s9 S9 F9 f/ }) }& t, Z& }! [2 P
}
) [  Y* \. B1 J0 f& A( G1 k" p }; M( D- s9 A! x0 {
while(!stack.isEmpty()); i# i3 X$ v' X. z2 w( m& o! R3 K  j
{2 A. g& |- o) B! R% I: B( c/ q+ i
postfix[j++]=stack.pop();
% s2 m! {4 w" w4 o' T0 v9 D: H# t+ s }
" r6 e: R, E6 k; E+ q0 J+ g8 |1 P postfix[j]='\0';
/ o8 T& H2 P4 ` return postfix;
" {7 H1 `- v1 s; D}
8 T; e, ]9 A# e  C9 r+ ?. A6 P" t0 S. P7 C; ?# O
int value(char *postfix)
8 V/ z/ v/ s, a) W{
; F+ v& z: F# I$ g0 W' s+ o. S5 S LinkedStack<int> stack;1 I4 [' y: [1 z9 \9 A
int i=0;
/ P/ e2 }& h& \! Z int result = 0;
+ r3 A+ M! I9 z2 x2 R3 C while(postfix!='\0')
  C0 Y5 e# x$ F* q+ C- H {6 M( w2 K6 i+ m' o; ~% y+ w- q
if(postfix>='0'&&postfix<='9')
. z" `, r7 V/ h0 k+ p; O. c {( V1 @4 ?: W! j: m( b$ v
result = 0;
5 M" J! q' l0 ~7 r. Z) C while(postfix!=' ')
- b4 a# {1 d3 I4 `( R {0 O7 t. o* X) V6 F
result = result*10+postfix[i++]-'0';6 b6 C1 O. L, @( N& {2 D0 H
}( G2 y# H0 I* P3 N) Z
i++;7 N3 ~$ q; m2 P0 t5 h0 x
stack.push(result);
; K8 t0 f" E0 n3 C7 f& w& S }
8 m* y( W$ F+ K4 D2 }" H else4 G3 h" Q1 R% }- f
{: t5 {  e9 c3 m. S8 }
if(postfix!=' ')
6 ]8 {# y7 t$ n0 ? {% n/ m! y9 A+ t! J
int y = stack.pop();
" {2 A; l& {2 q- s6 m0 K int x = stack.pop();
+ k% s& }8 `+ S1 W! t switch(postfix)
/ J9 S' A# A& C' z, J {
# l% u  \3 n2 o# C case'+':result = x + y;* X7 V3 ]9 I8 `1 ^
break;# n& R$ ^  q) X2 R( E$ S2 e$ D
case'-':result = x - y;
7 R! ]/ |3 x8 s" i6 j break;: w; N8 K9 w* B# q3 @8 K  S
case'*':result = x *y;
1 u5 X& o1 Z: F9 F$ x& N3 W) o% | break;2 P# C' H/ ]3 h) l5 M- e7 e
case'/':result = x / y;
8 Z$ m* E5 V2 W break;
5 r8 z8 \- x7 P) _: z }
, {# H1 I, o, E stack.push(result);
4 Y+ S  }" o* h( l; F0 | }3 p+ X. a, w9 z* m  O1 {
i++;
& q0 d, x* j/ j+ W( d }
* O: s. q" k4 y2 Y* j }3 ^; L3 z9 N1 A  z
return stack.pop();+ u- X1 @% g9 Z
}8 h  T  i0 X9 {$ s  n

' f$ x' l6 ?) U  gint main()
. p) Z4 z. w( C1 A; B& Q$ W{
, d  b- Z" X9 A" {- R& K //char *expstr = "121+10*(52-49+20)/((35-25)*2+10)";+ v- z1 S8 N! ^$ i
cout << "请输入表达式:";
2 I: h& h) L# z, S6 A. G //char *a ;3 B6 E: Z4 C' G# o; H7 U9 W" r
//cin >> *a;$ B9 y5 f6 U9 d( H2 }. I  i( Z
char expstr[20]={0};" k# d! ^4 F: |0 [+ X$ U- O% b1 e' @
while(1)
4 y" \- @. e- P9 k3 y  D {
' ^+ r" f" z  d- o# D9 L; d2 d. j cin>>expstr;1 B% |. T# j% \5 f# l
char *postfix = toPostfix(expstr);
% F6 a5 C( v0 \7 ?: w" I    cout << "expstr= "<<expstr << endl;3 C3 `2 V  T# ?  v7 `
cout << "postfix= "<<postfix<<endl;! ^1 v, W; {' U* A) Y
cout << "value= "<<value(postfix) << endl;. W& k4 e) Y/ D( J! U9 p
}; G; T. v/ R) L/ @! G2 G$ I: M, s
return 0;
3 j( a3 k/ `& q# I}

外国人的数学素质是差啊

外国人的数学素质是差啊

楼主热贴

社区热点

本帖子中包含更多资源

浏览过的版块