http://cnme9c.ucoz.com/ Info Wed, 13 Apr 2011 10:07:07 GMT uCoz Web-Service <div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div><br></div><div>ifstream f;</div><div><br></div><div>void s1(int &amp;n,i... <div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div><br></div><div>ifstream f;</div><div><br></div><div>void s1(int &amp;n,int d[10])</div><div>{f.open("date");</div><div>f&gt;&gt;n;</div><div>for (int i=1;i<=n;i++)</div><div>f&gt;&gt;d[i];</div><div>f.close();</div><div>}</div><div>int s2(int n,int d[10])</div><div>{if(n==0)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>return 0;</div><div>else</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>return d[n]+s2(n-1,d);</div><div>}</div><div>int main()</div><div>{int n,d[10];</div><div>s1(n,d);</div><div>cout<<s2(n,d)<<" noduri"<<endl;</div><div>cout<<s2(n,d)/2<<" muchii";</div><div>}</div> https://cnme9c.ucoz.com/blog/subiect_8_atestat/2011-04-13-160 Iulian https://cnme9c.ucoz.com/blog/subiect_8_atestat/2011-04-13-160 Wed, 13 Apr 2011 10:07:07 GMT <div>#include<iostream.h&gt;</div><div>int i,j,a[10][10],n,m;</div><div><br></div><div>void citire(int a[10][10],int m)</div><div>{ for(i=1;i<=m... <div>#include<iostream.h&gt;</div><div>int i,j,a[10][10],n,m;</div><div><br></div><div>void citire(int a[10][10],int m)</div><div>{ for(i=1;i<=m;i++)&nbsp;</div><div>&nbsp;&nbsp; &nbsp; {cout<<"arcul "<<i<<endl;</div><div>&nbsp;&nbsp; &nbsp; int x,y;</div><div>&nbsp;&nbsp; &nbsp; cout<<"x=";</div><div>&nbsp;&nbsp; &nbsp; cin&gt;&gt;x;</div><div>&nbsp;&nbsp; &nbsp; cout<<"y=";</div><div>&nbsp;&nbsp; &nbsp; cin&gt;&gt;y;</div><div>&nbsp;&nbsp; &nbsp; a[x][i]=-1;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span> a[y][i]=1;}</div><div>&nbsp;&nbsp; &nbsp; }</div><div><br></div><div>void afisare(int a[10][10],int n)</div><div>{for(i=1;i<=n;i++)</div><div>&nbsp;&nbsp;{for(j=1;j<=m;j++)</div><div>&nbsp;&nbsp; &nbsp;cout<<a[i][j]<<" &nbsp;";</div><div>&nbsp;&nbsp; &nbsp;cout<<endl;}</div><div><br></div><div>&nbsp;&nbsp; &nbsp;}</div><div><br></div><div>int main()</div><div>{cout<<"n=";</div><div>cin&gt;&gt;n;</div><div>cout<<"m=";</div><div>cin&gt;&gt;m;</div><div><br></div><div>for(i=1;i<=n;i++)</div><div>&nbsp;&nbsp;for(j=1;j<=m;j++)</div><div>&nbsp;&nbsp;a[i][j]=0;</div><div><br></div><div>citire(a,m);</div><div>afisare(a,n);</div><div>return</div><div>0;}</div> https://cnme9c.ucoz.com/blog/creeare_matrice_orientata/2011-03-02-159 Iulian https://cnme9c.ucoz.com/blog/creeare_matrice_orientata/2011-03-02-159 Wed, 02 Mar 2011 10:52:16 GMT <div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div><br></div><div><br></div><div>int i,n,j,a[10][10],k=0,l,h[10],p=0,p1=0,r... <div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div><br></div><div><br></div><div>int i,n,j,a[10][10],k=0,l,h[10],p=0,p1=0,r=0,nod,m;</div><div>ifstream f;</div><div><br></div><div><br></div><div>void afisare(int a[10][10],int n,int m)</div><div>{for(i=1;i<=n;i++)</div><div>&nbsp;&nbsp;{for(j=1;j<=m;j++)</div><div>&nbsp;&nbsp; &nbsp;cout<<a[i][j]<<" ";</div><div>&nbsp;&nbsp; &nbsp;cout<<endl;}</div><div>&nbsp;&nbsp; &nbsp;}</div><div><br></div><div><br></div><div>int main()</div><div>{f.open("date");</div><div>&nbsp;f&gt;&gt;n;</div><div>&nbsp;f&gt;&gt;m;</div><div>&nbsp;for(i=1;i<=n;i++)</div><div>&nbsp;&nbsp;for(j=1;j<=m;j++)</div><div>&nbsp;&nbsp;f&gt;&gt;a[i][j];</div><div>&nbsp;f.close();</div><div>&nbsp;afisare(a,n,m);</div><div>&nbsp;cout<<endl;</div><div><br></div><div>cout<<"nodul ";</div><div>cin&gt;&gt;l;</div><div>for(j=1;j<=m;j++)</div><div>{</div><div>if(a[l][j]==1)</div><div>k++;</div><div>}</div><div>cout<<k<<endl;</div><div><br></div><div><br></div><div>for(i=1;i<=n;i++)</div><div>{h[i]=0;</div><div>for(j=1;j<=m;j++)</div><div>{</div><div>if(a[i][j]==1)</div><div>h[i]++;</div><div>}}</div><div>for(i=1;i<=n;i++)</div><div>cout<<"gradul pentru nodul "<<i<<" este "<<h[i]<<endl;</div><div><br></div><div>for(i=1;i<=n;i++)</div><div>if(h[i]==0)</div><div>{p++;</div><div>cout<<"nodul "<<i<<" este izolat"<<endl;</div><div>}</div><div>if(p&gt;0)</div><div>cout<<"sunt "<<p<<" noduri izolate"<<endl;</div><div>else</div><div>cout<<"nu avem mnoduri izolate;"<<endl;</div><div>for(i=1;i<=n;i++)</div><div>if(h[i]==1)</div><div>{p1++;</div><div>}</div><div>if(p1&gt;0)</div><div>cout<<"sunt "<<p1<<" noduri terminale"<<endl;</div><div>else</div><div>cout<<"nu sunt noduri terminale"<<endl;</div><div>for(i=1;i<=n;i++)</div><div>for(j=1;j<=m;j++)</div><div>{if(a[i][j]==1)</div><div>r++;}</div><div>cout<<"sunt "<<r/2<<" muchii"<<endl;</div><div><br></div><div><br></div><div><br></div><div><br></div><div><br></div><div><br></div><div>cout<<"muchiile sunt: "<<endl;</div><div>for(j=1;j<=m;j++)</div><div><br></div><div>{cout<<"muchia "<<j<<endl;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>for(i=1;i<=n;i++)</div><div>{if(a[i][j]==1)</div><div>cout<<i<<" ";}</div><div>cout<<endl;}</div><div><br></div><div><br></div><div><br></div><div>cout<<"vecinii nodului:"<<endl;;</div><div>cin&gt;&gt;nod;</div><div>cout<<"sunt: "<<endl;</div><div><br></div><div>for(int k=1;k<=m;k++)</div><div>if(a[nod][k]==1)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>for(i=1;i<=n;i++)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>if(i!=nod &amp;&amp; a[i][k]==1)</div><div>cout<<i<<" ";</div><div>cout<<endl;</div><div>cout<<"nodurile cu gradul cel mai mare sunt:"<<endl;</div><div><br></div><div><br></div><div><br></div><div>int max=h[1];</div><div>for(i=2;i<=n;i++)</div><div>if(max<h[i])</div><div>max=h[i];</div><div>int o=0;</div><div>for(i=1;i<=n;i++)</div><div>{if(h[i]==max)</div><div>{o++;</div><div>cout<<i<<" ";}}</div><div>cout<<endl<<"numarul de noduri cu gradul cel mai mare este "<<o<<" avand gradul "<<max;</div><div><br></div><div><br></div><div><br></div><div>int t=0;</div><div>for(j=1;j<=m;j++)</div><div>{for(i=1;i<=n;i++)</div><div>if(a[i][j]==0 || a[i][j]==1)</div><div>if(a[i][j]==1)</div><div>t++;}</div><div>if(t==2*m)</div><div>cout<<endl<<"este matricea unu graf neorientat";</div><div>else&nbsp;</div><div>cout<<endl<<"nu este matricea unu graf neorientat";</div><div>return 0;</div><div>&nbsp;}</div> https://cnme9c.ucoz.com/blog/program_25_02/2011-03-02-158 Iulian https://cnme9c.ucoz.com/blog/program_25_02/2011-03-02-158 Wed, 02 Mar 2011 10:51:06 GMT <div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div>int i,j,a[10][10],n,s=0,p,d,s1=0,h[10],x[10];</div><div>ifstream f;</div... <div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div>int i,j,a[10][10],n,s=0,p,d,s1=0,h[10],x[10];</div><div>ifstream f;</div><div><br></div><div>void afisare(int a[10][10],int n)</div><div>{for(i=1;i<=n;i++)</div><div>&nbsp;&nbsp;{for(j=1;j<=n;j++)</div><div>&nbsp;&nbsp; &nbsp;cout<<a[i][j]<<" ";</div><div>&nbsp;&nbsp; &nbsp;cout<<endl;}</div><div>}</div><div><br></div><div>int main()</div><div>{f.open("date");</div><div>&nbsp;f&gt;&gt;n;</div><div>&nbsp;for(i=1;i<=n;i++)</div><div>&nbsp;&nbsp;for(j=1;j<=n;j++)</div><div>&nbsp;&nbsp;f&gt;&gt;a[i][j];</div><div>&nbsp;f.close();</div><div>&nbsp;afisare(a,n);</div><div><br></div><div>&nbsp;cout<<"nodul ";</div><div>&nbsp;cin&gt;&gt;p;</div><div>&nbsp;</div><div>&nbsp;for(i=1;i<=n;i++)</div><div>&nbsp;&nbsp; {if(a[i][p]==1)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span> s+=1;}</div><div>&nbsp;cout<<"gradul intern pentru nodul "<<p<<" este "<<s<<endl;</div><div>&nbsp;</div><div>for(j=1;j<=n;j++)</div><div>{if(a[p][j]==1) s1+=1;}</div><div>cout<<"gradul extern pentru nodul "<<p<<" este "<<s1<<endl;</div><div>&nbsp;</div><div>cout<<endl;</div><div>int k;</div><div>for(i=1;i<=n;i++)</div><div>{ k=0;</div><div>for(j=1;j<=n;j++)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>if(a[i][j]==1) k++;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>h[i]=k;}</div><div>for(i=1;i<=n;i++)</div><div>cout<<"gradul extern pentru nodul "<<i<<" este "<<h[i]<<endl;</div><div>cout<<endl;</div><div>int v;</div><div>for(i=1;i<=n;i++)</div><div>{ v=0;</div><div>for(j=1;j<=n;j++)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>if(a[j][i]==1) v++;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>x[i]=v;}</div><div>for(i=1;i<=n;i++)</div><div>cout<<"gradul intern pentru nodul "<<i<<" este "<<x[i]<<endl;</div><div>cout<<endl;</div><div>int m=0;</div><div>for(i=1;i<=n;i++)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>for(j=1;j<=n;j++)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>if( a[i][j]==1)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>{m++;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"arcul "<<i<<" si "<<j<<endl;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>}</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"sunt "<<m<<" arce"<<endl;</div><div>int nod;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"vecinii pentru nodul: ";</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cin&gt;&gt;nod;</div><div>for(i=1;i<=n;i++)</div><div>if(a[nod][i]==1 || a[i][nod]==1)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"vecinii nodului sunt "<<i<<endl;</div><div>int t=0;</div><div>for(i=1;i<=n;i++)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>if(h[i]==0 &amp;&amp; x[i]==0)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>{t++;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"nodul izolat este "<<i<<endl;}&nbsp;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>if(t==0)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"nu avem noduri izolate"<<endl;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>else</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"sunt "<<t<<" noduri izolate"<<endl;</div><div><br></div><div>int r=0;</div><div>for(i=1;i<=n;i++)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>if(h[i]+x[i]==1)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>{r++;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"nodul "<<i<<" este terminal "<<endl;}&nbsp;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>if(r==0)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"nu avem noduri terminal"<<endl;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>else</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"sunt "<<r<<" noduri terminale"<<endl;</div><div><span class="Apple-tab-span" style="white-space:pre"> </span></div><div>int z=0;</div><div>for(i=1;i<=n;i++)</div><div>for(j=1;j<=n;j++)</div><div>if(a[i][j]==0 || a[i][j]==1)</div><div>if(a[i][j]==1 &amp;&amp; a[j][i]==1)</div><div>z++;</div><div>if(z==2*n)</div><div>cout<<endl<<"nu este matricea unu graf orientat";</div><div>else&nbsp;</div><div>cout<<endl<<"este matricea unu graf orientat";</div><div>return 0;</div><div>}</div> https://cnme9c.ucoz.com/blog/program_grafuri_orientate/2011-02-21-157 Iulian https://cnme9c.ucoz.com/blog/program_grafuri_orientate/2011-02-21-157 Mon, 21 Feb 2011 07:18:14 GMT <div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div>int i,j,a[10][10],n,m;</div><div>ifstream f;</div><div><br></div><div>vo... <div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div>int i,j,a[10][10],n,m;</div><div>ifstream f;</div><div><br></div><div>void afisare(int a[10][10],int n,int m)</div><div>{for(i=1;i<=n;i++)</div><div>&nbsp;&nbsp;{for(j=1;j<=m;j++)</div><div>&nbsp;&nbsp; &nbsp;cout<<a[i][j]<<" ";</div><div>&nbsp;&nbsp; &nbsp;cout<<endl;}</div><div>&nbsp;&nbsp; &nbsp;}</div><div><br></div><div>int main()</div><div>{f.open("date");</div><div>&nbsp;f&gt;&gt;n;</div><div>&nbsp;f&gt;&gt;m;</div><div>&nbsp;for(i=1;i<=n;i++)</div><div>&nbsp;&nbsp;for(j=1;j<=m;j++)</div><div>&nbsp;&nbsp;f&gt;&gt;a[i][j];</div><div>&nbsp;f.close();</div><div>&nbsp;afisare(a,n,m);</div><div>return 0;}</div><div><br></div><div><div>5</div><div>6</div><div><br></div><div>1 1 1 0 0 0</div><div>0 0 1 1 0 0</div><div>0 1 0 1 1 0</div><div>1 0 0 0 1 1</div><div>0 0 0 0 0 1</div></div> https://cnme9c.ucoz.com/blog/citire_afisare_matrice_de_adiacenta_graf_neorientat_date/2011-02-21-156 Iulian https://cnme9c.ucoz.com/blog/citire_afisare_matrice_de_adiacenta_graf_neorientat_date/2011-02-21-156 Mon, 21 Feb 2011 07:17:03 GMT <div>#include<iostream.h&gt;</div><div><br></div><div>int i,n,m,j,a[10][10];</div><div><br></div><div>void citire(int a[10][10],int m)</div><div>{f... <div>#include<iostream.h&gt;</div><div><br></div><div>int i,n,m,j,a[10][10];</div><div><br></div><div>void citire(int a[10][10],int m)</div><div>{for(i=1;i<=m;i++)</div><div>&nbsp;{cout<<"muchia "<<i<<endl;</div><div>&nbsp;int x,y;</div><div>&nbsp;cout<<"x=";</div><div>&nbsp;cin&gt;&gt;x;</div><div>&nbsp;cout<<"y=";</div><div>&nbsp;cin&gt;&gt;y;</div><div>&nbsp;a[x][i]=a[y][i]=1;}}</div><div><br></div><div>void afisare(int a[10][10], int n)</div><div>{for(i=1;i<=n;i++)</div><div>{for(j=1;j<=m;j++)</div><div>cout<<a[i][j]<<" ";</div><div>cout<<endl;}}</div><div><br></div><div>int main()</div><div>{cout<<"n=";</div><div>cin&gt;&gt;n;</div><div>cout<<"m=";</div><div>cin&gt;&gt;m;</div><div>for(i=1;i<=n;i++)</div><div>for(j=1;j<=m;j++)</div><div>a[i][j]=0;</div><div>citire(a,m);</div><div>afisare(a,n);</div><div>return 0;</div><div>}</div> https://cnme9c.ucoz.com/blog/citire_afisare_matrice_de_adiacenta_graf_neorientat/2011-02-21-155 Iulian https://cnme9c.ucoz.com/blog/citire_afisare_matrice_de_adiacenta_graf_neorientat/2011-02-21-155 Mon, 21 Feb 2011 07:04:20 GMT <div><div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div><br></div><div>int i,n,j,a[10][10],k=0,l,h[10],p=0,p1=0,r=0,nod;</d... <div><div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div><br></div><div>int i,n,j,a[10][10],k=0,l,h[10],p=0,p1=0,r=0,nod;</div><div>ifstream f;</div><div><br></div><div>void afisare(int a[10][10], int n)</div><div>{for(i=1;i<=n;i++)</div><div>{for(j=1;j<=n;j++)</div><div>cout<<a[i][j]<<" ";</div><div>cout<<endl;}}</div><div><br></div><div>int main()</div><div>{f.open("date");</div><div>f&gt;&gt;n;</div><div>for(i=1;i<=n;i++)</div><div>for(j=1;j<=n;j++)</div><div>f&gt;&gt;a[i][j];</div><div>f.close();</div><div>afisare(a,n);</div><div>cout<<"nodul ";</div><div>cin&gt;&gt;l;</div><div>for(j=1;j<=n;j++)</div><div>{</div><div>if(a[l][j]==1)</div><div>k++;</div><div>}</div><div>cout<<k<<endl;</div><div><br></div><div>for(i=1;i<=n;i++)</div><div>{h[i]=0;</div><div>for(j=1;j<=n;j++)</div><div>{</div><div>if(a[i][j]==1)</div><div>h[i]++;</div><div>}}</div><div>for(i=1;i<=n;i++)</div><div>cout<<"gradul pentru nodul "<<i<<" este "<<h[i]<<endl;</div><div><br></div><div>for(i=1;i<=n;i++)</div><div>if(h[i]==0)</div><div>{p++;</div><div>cout<<"nodul "<<i<<" este izolat"<<endl;</div><div>}</div><div>if(p&gt;0)</div><div>cout<<"sunt "<<p<<" noduri izolate"<<endl;</div><div>else</div><div>cout<<"nu avem mnoduri izolate;"<<endl;</div><div>for(i=1;i<=n;i++)</div><div>if(h[i]==1)</div><div>{p1++;</div><div>}</div><div>if(p1&gt;0)</div><div>cout<<"sunt "<<p1<<" noduri terminale"<<endl;</div><div>else</div><div>cout<<"nu sunt noduri terminale"<<endl;</div><div>for(i=1;i<=n;i++)</div><div>for(j=1;j<=n;j++)</div><div>{if(a[i][j]==1)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>r++;}</div><div>cout<<"sunt "<<r/2<<" muchii"<<endl;</div><div>cout<<"muchiile sunt: "<<endl;</div><div>for(i=1;i<=n;i++)</div><div>for(j=i+1;j<=n;j++)</div><div>{if(a[i][j]==1)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>cout<<"muchia "<<i<<" si "<<j<<endl;}</div><div>cout<<"vecinii nodului:"<<endl;;</div><div>cin&gt;&gt;nod;</div><div>cout<<"sunt: ";</div><div>for(i=1;i<=n;i++)</div><div>if(a[nod][i]==1)</div><div>cout<<i<<" ";<span class="Apple-tab-span" style="white-space:pre"> </span></div><div>int max=h[1];</div><div>for(i=2;i<=n;i++)</div><div>if(max<h[i])</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>max=h[i];</div><div>int o=0;</div><div>for(i=1;i<=n;i++)</div><div>{if(h[i]==max)</div><div><span class="Apple-tab-span" style="white-space:pre"> </span>o++;}</div><div>cout<<endl<<"numarul de noduri cu gradul cel mai mare este "<<o<<" avand gradul "<<max;</div><div>int t=0;</div><div>for(i=1;i<=n;i++)</div><div>for(j=1;j<=n;j++)</div><div>if(a[i][j]==0 || a[i][j]==1)</div><div>if(a[i][j]==1 &amp;&amp; a[j][i]==1)</div><div>t++;</div><div>if(t==2*n)</div><div>cout<<endl<<"este matricea unu graf neorientat";</div><div>else&nbsp;</div><div>cout<<endl<<"nu este matricea unu graf neorientat";</div><div>return 0;</div><div>&nbsp;}</div></div><div><br></div><div>date</div><div><div>7</div><div>0 1 1 0 0 0 0</div><div>1 0 0 0 1 0 0</div><div>1 0 0 1 1 0 0</div><div>0 0 1 0 1 0 1</div><div>0 1 1 1 0 0 0</div><div>0 0 0 0 0 0 0</div><div>0 0 0 1 0 0 0</div></div> https://cnme9c.ucoz.com/blog/program_11_subpuncte/2011-02-09-154 Iulian https://cnme9c.ucoz.com/blog/program_11_subpuncte/2011-02-09-154 Wed, 09 Feb 2011 11:21:16 GMT <div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div><br></div><div>int i,n,j,a[10][10];</div><div>ifstream f;</div><div><br>... <div>#include<iostream.h&gt;</div><div>#include<fstream.h&gt;</div><div><br></div><div>int i,n,j,a[10][10];</div><div>ifstream f;</div><div><br></div><div>void afisare(int a[10][10], int n)</div><div>{for(i=1;i<=n;i++)</div><div>{for(j=1;j<=n;j++)</div><div>cout<<a[i][j]<<" ";</div><div>cout<<endl;}}</div><div><br></div><div>void main()</div><div>{f.open("date.in");</div><div>f&gt;&gt;n;</div><div>for(i=1;i<=n;i++)</div><div>for(j=1;j<=n;j++)</div><div>f&gt;&gt;a[i][j];</div><div>f.close();</div><div>afisare(a,n);}</div><div><br></div><div><br></div><div>date.in</div><div><br></div><div><div>7</div><div>0 1 1 0 0 0 0</div><div>1 0 0 0 1 0 0</div><div>1 0 0 1 1 0 0</div><div>0 0 1 0 1 0 1</div><div>0 1 1 1 0 0 0</div><div>0 0 0 0 0 0 0</div><div>0 0 0 1 0 0 0</div></div><div><br></div> https://cnme9c.ucoz.com/blog/citire_afisare_date_in_graf/2011-02-07-153 Iulian https://cnme9c.ucoz.com/blog/citire_afisare_date_in_graf/2011-02-07-153 Mon, 07 Feb 2011 07:52:46 GMT <div>#include<iostream.h&gt;</div><div><br></div><div>int i,n,m,j,a[10][10];</div><div><br></div><div>void citire(int a[10][10],int m)</div><div>{f... <div>#include<iostream.h&gt;</div><div><br></div><div>int i,n,m,j,a[10][10];</div><div><br></div><div>void citire(int a[10][10],int m)</div><div>{for(i=1;i<=m;i++)</div><div>&nbsp;{cout<<"muchia "<<i<<endl;</div><div>&nbsp;int x,y;</div><div>&nbsp;cout<<"x=";</div><div>&nbsp;cin&gt;&gt;x;</div><div>&nbsp;cout<<"y=";</div><div>&nbsp;cin&gt;&gt;y;</div><div>&nbsp;a[x][y]=a[y][x]=1;}}</div><div><br></div><div>void afisare(int a[10][10], int n)</div><div>{for(i=1;i<=n;i++)</div><div>{for(j=1;j<=n;j++)</div><div>cout<<a[i][j]<<" ";</div><div>cout<<endl;}}</div><div><br></div><div>void main()</div><div>{cout<<"n=";</div><div>cin&gt;&gt;n;</div><div>cout<<"m=";</div><div>cin&gt;&gt;m;</div><div>for(i=1;i<=n;i++)</div><div>for(j=1;j<=m;j++)</div><div>a[i][j]=0;</div><div>citire(a,m);</div><div>afisare(a,n);</div><div>}</div> https://cnme9c.ucoz.com/blog/citire_afisare_graf/2011-02-07-152 Iulian https://cnme9c.ucoz.com/blog/citire_afisare_graf/2011-02-07-152 Mon, 07 Feb 2011 07:18:18 GMT <div>#include<iostream.h&gt;</div><div><br></div><div>int i,n,j,a[10][10];</div><div><br></div><div>void citire(int a[10][10],int n)</div><div>{ fo... <div>#include<iostream.h&gt;</div><div><br></div><div>int i,n,j,a[10][10];</div><div><br></div><div>void citire(int a[10][10],int n)</div><div>{ for(i=1;i<=n;i++)</div><div>for(j=1;j<=n;j++)</div><div>{cout<<"a["<<i<<","<<j<<"]="; cin&gt;&gt;a[i][j];}}</div><div><br></div><div>void afisare(int a[10][10], int n)</div><div>{for(i=1;i<=n;i++)</div><div>{for(j=1;j<=n;j++)</div><div>cout<<a[i][j]<<" ";</div><div>cout<<endl;}}</div><div><br></div><div>void main()</div><div>{cout<<"n=";</div><div>cin&gt;&gt;n;</div><div>citire(a,n);</div><div>afisare(a,n);</div><div>}</div><div><br></div> https://cnme9c.ucoz.com/blog/citire_afisare_matrice_graf/2011-02-07-151 Iulian https://cnme9c.ucoz.com/blog/citire_afisare_matrice_graf/2011-02-07-151 Mon, 07 Feb 2011 06:57:22 GMT