Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
char array in class
#include <cstdio> using namespace std; class Test{ public: char name[10]; Test(char* n){ int i=0; while(*n != 0) name[i++] = *(n++); } }; int main(){ char in[10]; Test* data[3]; for(int i=0;i<3;++i){ scanf("%s",&in);//input: A B C data[i] = new Test(&in[0]); } for(int i=0;i<3;++i){ printf("%s ",data[i]->name);//output: A B C } return 0; }
run
|
edit
|
history
|
help
0
LRUCache
2015(M2)Mod.
Such case
Dar
Graph DFS
grid
Find value in sorted matrix
poprawione_i_podzielone_1
cs
congruence modulo equations (together with a simple BigInteger class)