Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
scemo dd
//g++ 5.4.0 #include <iostream> using namespace std; typedef Vettore[50]; int main() { Vettore V; int i,n,p,info; cin>> n; for(i=0;i<n;i++){ cin>> V[i]; } for(i=0;i<n;i++){ cout<< V[i]<<" "; } cout<<endl; cin>> p; // posizione nuovo elemento cin>> info; // nuovo elemento for (i=n-1;i>=p;i--){ V[i+1]=V[i]; V[p]=info; n++; } for(i=0;i<n;i++){ cout<< V[i]<<" "; } return 0; }
run
|
edit
|
history
|
help
0
find first non repeating
Meeting Time
Backtracking_simple
Breakfast
Continuous Sub Set with given sum
Updated Linked Lists - 5/10/2017 V3.0
Gauss 4x4
static property
aaaaaaaaaaaa
2021, M2, Simulare;S3: 2