Articolele lui BOTOROGEANU ANDREI-PETRU (andrei_botorogeanu)

Autor:A.M. Cîmpeanu
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin(“bac.txt”);

int main()
{ int a,b,cnt, maxim,nr=1; fin>>a; maxim=a; cout<<1<< “ “; while(fin>>b) { nr++; if(maxim<=b && a!=b ) { /// se ocupa sa gaseasca maximul pe secventa ///se ocupa de continuitatea secventei cout<<nr<<” “; maxim=b; } a=b; } fin.close();

Este optima pt ca nu se foloseste vectori, are o complexitate de O(n), pt ca citeste n nr de la fisier
si face operatii in timp ce citeste din fisier

OJI 2023 S3
#include<fstream>
#include<vector>
#include<algorithm>
#include<set>
#include<utility>
#include<iterator>

#define ull unsigned long long

using namespace std;

struct copil
{ ull start; ull finish; bool p;
};

ifstream fin(“fotbal.in”);
ofstream fout(“fotbal.out”);

vector<copil>V;
vector<vector<ull> >Pascal;

bool cmp(copil a, copil b){ if(a.finish==b.finish) { if(a.start==b.start) return (a.p==1); return a.start<b.start; } return a.finish<b.finish;
}

int main()
{ int N,K; fin>>N>>K; V.resize(N); for(int i=0; i<N; ++i) { fin>>V[i].start>>V[i].finish>>V[i].p; }

#include <iostream>
//metoda cautarii binare intr-o lista binara
using namespace std;
//pt n=6, x=3, v= (1,3,3,5,5,7); se va afisa am gasit pe pozitia 2;
int main()
{ int n,x,i, v¹⁰⁰, st=1, dr=n, poz=-1,m; cin>>n>>x; for(i=1; i<=n; i++) cin>>v[i]; while(st<=dr && poz==-1) { m=(st+dr)/2; if(x==v[m]) poz=m; else if(x<v[m]) dr=m-1; else st=m+1; } if( poz==-1 ) cout<<x<<“nu este in lista”; else cout<< x<< “este in lista pe pozitia “<<poz; return 0;
}

#include<bits/stdc++.h>
using namespace std;
bool cmp(int a, int b)
{ return a>b;
}
int main()
{ int n,v¹⁰⁰¹; cin>>n; for(int i=1; i<=n; i++) cin>>v[i]; sort(v+1,v+n+1,cmp); for(int i=1; i<=n; i++) cout<<v[i]<< “ “ ;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{ int n,uc,on=0,ok=1; cin>>n; while(n>0) { uc=n%10; on=on*10+uc; n/=10; } for(int i=2; i<=on; i++) if(on%i==0) ok=0; if(ok) cout<< “Oglinditul nr. “ << on <<” nu e prim”; else cout<< “Oglinditul nr. “ << on << “ e prim”; return 0;
}

// Program care sorteaza elementele vectorului dupa suma cifrelor crescator
#include<iostream>
using namespace std;
int main()
{ int v¹⁰¹,n; cin>>n; for(int i=1; i<=n; i++) cin>>v[i]; for(int i=1; i<n; i++) { for(int j=i+1; j<=n; j++) { int cop1 = v[i]; int cop2 = v[j]; int s1 = 0, s2 = 0; while(cop1 != 0) { s1 += (cop1 % 10); cop1 = cop1 / 10; } while(cop2 != 0) { s2 += (cop2 % 10); cop2 = cop2 / 10; } if(s1>s2) { swap(v[i],v[j]); } } } for(int i=1; i<=n; i++) { cout<<v[i]<< “ “; } return 0;
}