From 9fe033ea88c2f705ec18c232873d056e0c229d72 Mon Sep 17 00:00:00 2001 From: Gaspard Coulet Date: Wed, 28 Apr 2021 23:05:53 +0200 Subject: Initial commit --- sem_5/codingbattle/ex1/a_loot_sharing.cpp | 15 +++++ sem_5/codingbattle/ex1/ex1 | Bin 0 -> 9276 bytes sem_5/codingbattle/ex2/ex2 | Bin 0 -> 14359 bytes sem_5/codingbattle/ex2/ex2.cpp | 32 ++++++++++ sem_5/codingbattle/ex3/ex3 | Bin 0 -> 84143 bytes sem_5/codingbattle/ex3/ex3.cpp | 98 ++++++++++++++++++++++++++++++ sem_5/codingbattle/ex4/ex4 | Bin 0 -> 36973 bytes sem_5/codingbattle/ex4/ex4.cpp | 10 +++ sem_5/codingbattle/ex5/ex5.cpp | 10 +++ sem_5/codingbattle/ex6/ex6 | Bin 0 -> 48192 bytes sem_5/codingbattle/ex6/ex6.cpp | 56 +++++++++++++++++ sem_5/codingbattle/input | 0 12 files changed, 221 insertions(+) create mode 100644 sem_5/codingbattle/ex1/a_loot_sharing.cpp create mode 100644 sem_5/codingbattle/ex1/ex1 create mode 100644 sem_5/codingbattle/ex2/ex2 create mode 100644 sem_5/codingbattle/ex2/ex2.cpp create mode 100644 sem_5/codingbattle/ex3/ex3 create mode 100644 sem_5/codingbattle/ex3/ex3.cpp create mode 100644 sem_5/codingbattle/ex4/ex4 create mode 100644 sem_5/codingbattle/ex4/ex4.cpp create mode 100644 sem_5/codingbattle/ex5/ex5.cpp create mode 100644 sem_5/codingbattle/ex6/ex6 create mode 100644 sem_5/codingbattle/ex6/ex6.cpp create mode 100644 sem_5/codingbattle/input (limited to 'sem_5/codingbattle') diff --git a/sem_5/codingbattle/ex1/a_loot_sharing.cpp b/sem_5/codingbattle/ex1/a_loot_sharing.cpp new file mode 100644 index 0000000..4003247 --- /dev/null +++ b/sem_5/codingbattle/ex1/a_loot_sharing.cpp @@ -0,0 +1,15 @@ +#include +#include +using namespace std; + +int main (int argc, char ** argv){ + int B; + int T; + int po; + cin >>B>>T>>po; + if ( B*2 + T * 3 <= po){ + cout<<"LOOT!"< +#include +using namespace std; + +int main (int argc, char ** argv){ + int g,n; + int max=0; + string strmax= ""; + int tmp2; + cin >> g >> n; + string a; + int prixp; + int prix; + for (int i =0; i < n; i ++){ + cin >> a >> prixp >> prix; + int tmp = g; + tmp = tmp - prix; + tmp = tmp/prixp; + if (tmp > max){ + max=tmp; + strmax= a; + } + } + if (max == 0){ + cout << "Impossible"< +#include +#include +#include +using namespace std; + +void printtab(int n, int tab[]); +void printvec(int n, vector tab); +int main (int argc, char ** argv){ + int L,N; + cin >> L>>N; + int pos[N]; + int size[N]; + for (int i =0;i < N; i ++){ + cin>>pos[i]; + } + vector ecart(N-1);//ecart entre le i eme poste et le i + 1 ieme + int nbchapsize[19]; + for (int i =0; i < 19; i ++){ + nbchapsize[i]= 0; + } + int totalchap=0; + for (int i = 0 ; i < N; i ++){ + cin>>size[i]; + if (i < N-1){ + ecart[i]=pos[i+1]-pos[i]; + } + nbchapsize[size[i]-1]++; + totalchap += size[i]*2; + } + + + vector vraiecart(N-1); + // cout<<"Chapeau dispos"<= 20){ + answer= false; + break; + } + if (j==0){ + answer=true; + break; + } + if (nbchapsize[h]>0){ + j --; + nbchapsize[h]--; + // cout<<"- 1 chapeau de taille "<< h+1< tab){ + for (int i = 0; i < n; i ++){ + cout < +#include +using namespace std; + +int main (int argc, char ** argv){ + string a; + cin >> a; + cout << a << endl; +return 1; +} diff --git a/sem_5/codingbattle/ex5/ex5.cpp b/sem_5/codingbattle/ex5/ex5.cpp new file mode 100644 index 0000000..2067e60 --- /dev/null +++ b/sem_5/codingbattle/ex5/ex5.cpp @@ -0,0 +1,10 @@ +#include +#include +using namespace std; + +int main (int argc, char ** argv){ + string a; + cin >> a; + cout << a << endl; +return 1; +} diff --git a/sem_5/codingbattle/ex6/ex6 b/sem_5/codingbattle/ex6/ex6 new file mode 100644 index 0000000..ab926f3 Binary files /dev/null and b/sem_5/codingbattle/ex6/ex6 differ diff --git a/sem_5/codingbattle/ex6/ex6.cpp b/sem_5/codingbattle/ex6/ex6.cpp new file mode 100644 index 0000000..48d4c8b --- /dev/null +++ b/sem_5/codingbattle/ex6/ex6.cpp @@ -0,0 +1,56 @@ +#include +#include +#include +#include +using namespace std; + +void printtab(int n, int tab[]){ + for (int i = 0; i < n; i ++){ + cout <> N; + int P; + cin >> P; + vector poid(N); + for (int i = 0 ; i < N; i ++){ + cin>>poid[i]; + } + int rivalite[N]; + for (int i =0; i < N; i ++){ + rivalite[i]=0; + } + int tmp; + for (int i = 0; i < P; i ++){ + cin >> tmp; + cin >>rivalite[tmp]; + rivalite[rivalite[tmp]]=tmp; + } + int poida=0; + int poidb=0; + int equa[N]; + int equb[N]; + for (int i =0; i < N; i ++){ + equa[i]=0; + equb[i]=0; + } + for (int i=0 ; i < N; i ++){ + if (( equa[rivalite[i]]!=0 &&equb[rivalite[i]]==0)){ + poidb+=poid[i]; + equb[i]=1; + } + else if ( equb[rivalite[i]]==0 && equa[rivalite[i]]==0) { + poida+=poid[i]; + equa[i]=1; + } + } + printtab(N, equa); + printtab(N, equb); + cout<