19771 questions
#include <stdio.h>int main() { char ch[5]; char tmp; for(int i=0;i<5;i++) scanf(%c,&ch[i]); for(int i=0;i<5;i++) { for(int j=5-i;j<5;j++) { printf(%c,ch[j]); } for(int k=0;k<...
You want to find the nearest location value between the latitude and longitude you entered and the latitude and longitude in the csv file.In the csv file, it is divided into latitude, longitude, and l...
include <iostream>#include <cstring>using namespace std;class Person{private: char *name; int age;public: Person(char * myname, int myage){ int len = strlen(myname) + 1; name = new char[...
I want to make a data frame that looks like the top one like the bottom one. What should I do now?https://kin.naver.com/qna/detail.naver?d1id=1&dirId=104&docId=429520356I'm sharing the link th...
bow_vect = vect.fit_transform(df1['review'].tolist())이 부분에서 ValueError: np.nan is an invalid document, expected byte or unicode string.There is this error, but is it because of the wrong file designat...
I'm a coding beginner who just started html. I declared a class and declared a class to put an image on the input column, but it does not apply. It only applies to the wrong code What is the problem?&...
There are some flexible parts when executing the file, so I made the code as below# private_lib.pyfilepath = r'C:\Users\Desktop\test'# main filefrom private_libimport filepath #import personal library...
You might want to use a module called linearmodels.I tried to install it with the pip install linearmodels command note: This error originates from a subprocess, and is likely not a problem with pip. ...
It's java. Use the if statement XOXOXO---XOXOXOX--XOXOXO-X-XOXOXO--XXOXOXOOX-XOXOXO-XOXOXOXOOXXXOXOXOXXOI want to print all eight of these, but if I enter all nine spaces with - that is, -----, how do...
I want to find duplicate values in the data frame. Example Sentence_org SentenceGanada Ramaba, Kanada RamabaCanada, canada, canada, canada, canadaAzachakatapa, AzachakatapaLet's go, let's goFind the d...
| « | - 47 - | » |
© 2024 OneMinuteCode. All rights reserved.