Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* Se citesc din fisier n valori. Se cere sa se afiseze toate nr prime cu cel mai mare numar neprim din sir.
- */
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f("date.in");
- int nr_prim(int x)
- {
- int ok=1,i;
- if (x==0 || x==1 || (x%2==0 && x!=2))
- return 0; // nu e prim
- for (i=3;i*i<=x;i+=2) // i*i<=x sau i<=sqrt(x)
- if (x%i==0)
- return 0; // nu e prim
- return 1;//e prim
- }
- int cmmdc(int a,int b)
- {
- if (a==0 || b==0)
- return max(a,b);
- int r=a%b;
- while (r!=0)
- {
- a=b;
- b=r;
- r=a%b;
- }
- return b;
- }
- int max_neprim(int v[],int n)
- {
- int maxim=0,i;
- for (i=1;i<=n;i++)
- if (nr_prim(v[i])==0)
- if (v[i]>maxim)
- maxim=v[i];
- return maxim;
- }
- void citire(int v[],int &n)//n transims prin referinta
- {
- int i;
- f>>n;
- for (i=1;i<=n;i++)
- f>>v[i];
- }
- int main()
- {
- int v[101],n,i,maxnr;
- citire(v,n);
- maxnr=max_neprim(v,n);
- for (i=1;i<=n;i++)
- if (cmmdc(maxnr,v[i])==1) // prime intre ele
- cout<<v[i]<<'\n';
- return 0;
- }
- /* Se citeste o matrice patratica de ordinul n din fisier. Afisati suma numerele pare de sub diagonala secundara, precum si
- numarul lor.
- */
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f("date.in");
- int main()
- {
- int n,a[100][100],i,j,s=0,c=0;
- f>>n;
- for (i=1;i<=n;i++)
- for (j=1;j<=n;j++)
- f>>a[i][j];
- for (i=2;i<=n;i++)
- for (j=n+2-i;j<=n;j++)
- if (a[i][j]%2==0)
- {
- s=s+a[i][j];
- c++;
- }
- cout<<s<<" "<<c;
- return 0;
- }
- /* Matrice cu n linii si m coloane din fisier. Afisati linia/linniile pe care se afla elementul maxim din matrice.
- */
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f("date.in");
- int main()
- {
- int a[100][100],m,n,i,j,maxim=0,linie,coloana,ok;
- f>>n>>m;
- for (i=1;i<=n;i++)
- for (j=1;j<=m;j++)
- f>>a[i][j];
- for (i=1;i<=n;i++)
- for (j=1;j<=m;j++)
- if (a[i][j]>maxim)
- maxim=a[i][j];
- for (i=1;i<=n;i++)
- {
- ok=0;
- for (j=1;j<=m && ok==0 ;j++)
- if (a[i][j]==maxim)
- ok=1;
- if (ok==1)
- cout<<i<<" ";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement