Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
czekolada
#include <iostream> using namespace std; int main() { int D=0; scanf("%d",&D); for(int i=0;i<D;i++) { int N=0; scanf("%d",&N); int szafa[111]; for(int j=0;j<N,j++) { scanf("%d", &szafa[N]); } } }
run
|
edit
|
history
|
help
0
Count edges in a graph
TwoMax
Anagram finder
find first non repeating
segmented sieve
w1
Trace
sheetal
Avoiding visited networked paths
Problema2