Skip to content

Instantly share code, notes, and snippets.

def blech(i: int) -> int:
i = i - 1 # 正しくは i = i + 1
i = i // 30000
return i
2018r3.1
To prevent defects by evaluate work products such as requirements, user stories, design, and code
To verify whether all specified requirements have been fulfilled
To check whether the test object is complete and validate if it works as the users and other stakeholders expect
To build confidence in the level of quality of the test object
To find defects and failures thus reduce the level of risk of inadequate software quality
To provide sufficient information to stakeholders to allow them to make informed decisions, especially regarding the level of quality of the test object
To comply with contractual, legal, or regulatory requirements or standards, and/or to verify the test object’s compliance with such requirements or standards
@kzsuzuki
kzsuzuki / matrix03
Last active December 19, 2018 10:29
0 0 ab ac 0 a 0 0 0 abd 0 0
0 bd 0 0 x 0 0 b c = 0 0 bdb bdc
0 0 db dc 0 d 0 0 0 dbd 0 0
0 0 0 0 0 0 0 0 0 0 0 0
@kzsuzuki
kzsuzuki / matrix02
Last active December 19, 2018 10:29
0 a 0 0 0 a 0 0 0 0 ab ac
0 0 b c x 0 0 b c = 0 bd 0 0
0 d 0 0 0 d 0 0 0 0 db dc
0 0 0 0 0 0 0 0 0 0 0 0
@kzsuzuki
kzsuzuki / matrix01
Last active December 15, 2018 15:24
0 a 0 0
0 0 b c
0 d 0 0
0 0 0 0
if isMainIsland == True:
if itemCategory == "book":
if price >= 1500:
charge = 0
else:
charge = 400
else:
charge = 500
else:
if itemCategory == "book":
if itemCategory == "book":
if price >= 1500:
if isMainIsland == True:
charge = 0
else:
charge = 300
else:
charge = 400
else:
if isMainIsland == True:
#standardSQL
SELECT
EXTRACT(HOUR FROM timestamp) AS hour ,
count(*) AS count
FROM `TensorFlowCommits.commit_data`
GROUP BY hour
ORDER BY hour
;
#standardSQL
WITH execution_count AS (
SELECT
target_id,
count(*) AS execution_count
FROM `TestResultData.results`
GROUP BY target_id
ORDER BY execution_count DESC
)
SELECT
/* Return the smallest value in the array */
int findMin(int A[]) {
int min = A[0];
for (int i = 1; i < A.length-1; i++) {
if (A[i] < min) min = A[i];
}
return min;
}