This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@XFAIL | |
def test_issue_860 ( ) : | |
e = x*y | |
assert e.subs(x, Matrix([3, 5, 3])) == Matrix([3, 5, 3])*y |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@XFAIL | |
def test_issue_1180(): | |
var("a b") | |
assert O(1,a,b)+O(a+b,a,b) == O(a+b,a,b)+O(1,a,b) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@XFAIL | |
def test_issue(): | |
assert 1/g(x) = O(1/f(x)) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@XFAIL | |
def teszt_issue_2069(): | |
assert classify_ode(diff(v(r),r) + 2*k/r*v(r) + y, v(r)) == classify_ode(diff(v(r), r) + 2*k/r*v(r) + v(r)) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@XFAIL | |
def test_issue_2453(): | |
assert abs(sympy.I * sympy.pi) == pi |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@XFAIL | |
def test_issue_2678(): | |
b = Eq(x2(t).diff(t), x1(t) - 3*x2(t)) | |
assert solve(b, x2(t)) == (x1 - x2(t).diff(t))/3 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//I mad changes in line 34 ("layout.html") | |
< div { direction: rtl; } | |
--- | |
> div { direction: ltr; } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE | |
Version 2, December 2004 | |
Copyright (C) 2011 YOUR_NAME_HERE <YOUR_URL_HERE> | |
Everyone is permitted to copy and distribute verbatim or modified | |
copies of this license document, and changing it is allowed as long | |
as the name is changed. | |
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var max = 1000; | |
var result = 0; | |
function TheSum() { | |
for (i = 0; i<max; i++) { | |
if (i % 3 === 0 || i % 5 === 0) { | |
result += i; | |
console.log(result) ; | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Definition for a binary tree node. | |
* public class TreeNode { | |
* int val; | |
* TreeNode left; | |
* TreeNode right; | |
* TreeNode(int x) { val = x; } | |
* } | |
*/ | |
public class Solution { |
OlderNewer