/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode
names = list(input().split())print(names.index('NiuNiu'))
x = input()print(x.isalpha(),x.isdigit(),x.isspace(),sep='\n')
#include <algorithm>#include <string>class Solution {public: /**
/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode
想问问各位✌🏻,一般HR面筛人嘛[牛泪][牛泪][牛泪]。差不多两个池子,四个HR面[牛泪][牛泪][牛泪]
y = []while True: x = input() if x == '0': break else:
// HJ60-2 查找组成一个偶数最接近的两个素数.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。#includ
n = int(input())a = 1b = 1s = 0for i in range(-1,n-1): s = a + b a,b = b,s
#include<stdio.h>int main() { char ch; int i = 0, a = 0, b = 0; s
a=float(input())if a>=0: b=a**(1/3) print(round(b,1))else: b='-'+str