Articolele lui Filip Adela (filip_adela)

#include <iostream>
#include <fstream>
using namespace std;
ifstream fin(“bac.in”);
int a¹⁰⁰⁰¹,b¹⁰⁰⁰¹,m,n,i,j,ok=0;
int main()
{ fin>>m>>n; for(i=1; i<=m; i++) { fin>>a[i]; if(a[i]%2==0)ok=1; } for(i=1; i<=n; i++) { fin>>b[i]; ok=1; } if(ok==1) { i=m; j=n; while(i>=1&&j>=1) { while(b[j]%2!=0) j—; while(a[i]%2!=0) i—; if(b[j]>a[i]) { cout<<b[j]<<’ ‘; j—; } else if(b[j]==a[i]) { cout<<b[j]<<’ ‘; j—; i—; } else { cout<<a[i]<<’ ‘; i—; } } while(i>=1) { if(a[i]%2==0) cout<<a[i]<<’ ‘; i—; }

while(j>=1) { if(b[j]%2==0) cout<<b[j]<<’ ‘; } }

else cout<<“nu exista”; return 0; }

#include <iostream>
#include <fstream>

using namespace std;
ifstream f(“secvk.in”);
ofstream g(“secvk.out”);
int v¹⁰⁰⁰⁰¹;
int main()
{ int n, k, i, s=0, mx=-1,p=1, y; f>>n>>k; for(i=1; i<=n; i++) { f>>v[i]; s+=v[i]; } for(i=k+1; i<=n; i++) { s=s-v[i-k]; s=s+v[i]; if(s>mx) { mx=s; p=i-k+1; } } for(i=p; i<=p+k-1; i++) g<<v[i]<<” “; return 0;
}

#include <iostream>

using namespace std;
int a²¹²¹,i,j,m,n;
int lineg(int a²¹²¹,int n, int l)
{ int j,x=a[l]¹,y; for(j=1; j<n; j++) if(x!=a[l][j+1]) y=j;
return y;
}
int coleg(int a²¹²¹,int n, int c)
{ int i,x=a¹©,y; for(i=1; i<n; i++) if(x!=a[i+1][c]) y=i;
return y;
}
int main()
{ int mi=22; cin>>n; for(i=1; i<=n; i++) for(j=1; j<=n; j++) cin>>a[i][j];

for(i=1; i<=n; i++) if(lineg(a,n,i)!=1) if(lineg(a,n,i)<mi) mi=lineg(a,n,i); for(j=1; j<=n; j++) if(coleg(a,n,j)!=1) if(coleg(a,n,j)<mi) mi=coleg(a,n,j); cout<<mi; return 0; }