Skip to content

Reformatted all the sources #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
dorinelfilip wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Reformatted all the sources #2

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
180 changes: 91 additions & 89 deletions afisaj_gresit.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,92 +1,94 @@
#include<stdio.h>
#include<stdlib.h>
#include <stdio.h>
#include <stdlib.h>

int main()
{
int i,v[7],n;
int seg[10][7] = {
{1,1,1,1,1,1,0},
{0,1,1,0,0,0,0},
{1,1,0,1,1,0,1},
{1,1,1,1,0,0,1},
{0,1,1,0,0,1,1},
{1,0,1,1,0,1,1},
{1,0,1,1,1,1,1},
{1,1,1,0,0,0,0},
{1,1,1,1,1,1,1},
{1,1,1,1,0,1,1}
};

while(!feof(stdin))
{
scanf("%d,%d,%d,%d,%d,%d,%d,%d\n", &v[0],&v[1],&v[2],&v[3],&v[4],&v[5],&v[6],&v[7]);
for(i=0;i<10;i++)
{
if ((seg[i][0]==v[0])&&(seg[i][1]==v[1])&&(seg[i][2]==v[2])&&(seg[i][3]==v[3])&&(seg[i][4]==v[4])&&(seg[i][5]==v[5])&&(seg[i][6]==v[6]))
{
switch (i)
{
case '0':
{ if(v[7]==0) printf("0");
else printf("0.");
break;
}
case '1':
{ if(v[7]==0) printf("1");
else printf("1.");
break;
}
case '2':
{ if(v[7]==0) printf("2");
else printf("2.");
break;
}
case '3':
{ if(v[7]==0) printf("3");
else printf("3.");
break;
}
case '4':
{ if(v[7]==0) printf("4");
else printf("4.");
break;
}
case '5':
{ if(v[7]==0) printf("5");
else printf("5.");
break;
}
case '6':
{ if(v[7]==0) printf("6");
else printf("6.");
break;
}
case '7':
{ if(v[7]==0) printf("7");
else printf("7.");
break;
}
case '8':
{ if(v[7]==0) printf("8");
else printf("8.");
break;
}
case '9':
{ if(v[7]==0) printf("9");
else printf("9.");
break;
}
}



}


}

int main() {
int i, v[7], n;
int seg[10][7] = {{1, 1, 1, 1, 1, 1, 0}, {0, 1, 1, 0, 0, 0, 0},
{1, 1, 0, 1, 1, 0, 1}, {1, 1, 1, 1, 0, 0, 1},
{0, 1, 1, 0, 0, 1, 1}, {1, 0, 1, 1, 0, 1, 1},
{1, 0, 1, 1, 1, 1, 1}, {1, 1, 1, 0, 0, 0, 0},
{1, 1, 1, 1, 1, 1, 1}, {1, 1, 1, 1, 0, 1, 1}};

while (!feof(stdin)) {
scanf("%d,%d,%d,%d,%d,%d,%d,%d\n", &v[0], &v[1], &v[2], &v[3], &v[4], &v[5],
&v[6], &v[7]);
for (i = 0; i < 10; i++) {
if ((seg[i][0] == v[0]) && (seg[i][1] == v[1]) && (seg[i][2] == v[2]) &&
(seg[i][3] == v[3]) && (seg[i][4] == v[4]) && (seg[i][5] == v[5]) &&
(seg[i][6] == v[6])) {
switch (i) {
case '0': {
if (v[7] == 0)
printf("0");
else
printf("0.");
break;
}
case '1': {
if (v[7] == 0)
printf("1");
else
printf("1.");
break;
}
case '2': {
if (v[7] == 0)
printf("2");
else
printf("2.");
break;
}
case '3': {
if (v[7] == 0)
printf("3");
else
printf("3.");
break;
}
case '4': {
if (v[7] == 0)
printf("4");
else
printf("4.");
break;
}
case '5': {
if (v[7] == 0)
printf("5");
else
printf("5.");
break;
}
case '6': {
if (v[7] == 0)
printf("6");
else
printf("6.");
break;
}
case '7': {
if (v[7] == 0)
printf("7");
else
printf("7.");
break;
}
case '8': {
if (v[7] == 0)
printf("8");
else
printf("8.");
break;
}
case '9': {
if (v[7] == 0)
printf("9");
else
printf("9.");
break;
}
}
}
}



}
}
43 changes: 21 additions & 22 deletions aranjamente_produse.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,24 +1,23 @@
#include<stdio.h>
#include <stdio.h>

int main()
{
int i,k,n, ok=0;
unsigned M;
unsigned long long a;
scanf("%d %d\n", &k, &M);
n=k;
do {
a=1;
for(i=n-k+1;i<n+1;i++) a=a*i;
n++;
if(a<=M)
ok=1;

} while (a<=M);

if(ok==0)
printf("0");
else printf("%d", n-2);


int main() {
int i, k, n, ok = 0;
unsigned M;
unsigned long long a;
scanf("%d %d\n", &k, &M);
n = k;
do {
a = 1;
for (i = n - k + 1; i < n + 1; i++)
a = a * i;
n++;
if (a <= M)
ok = 1;

} while (a <= M);

if (ok == 0)
printf("0");
else
printf("%d", n - 2);
}
75 changes: 38 additions & 37 deletions asediu_cetate.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,39 +1,40 @@
#include<stdio.h>
#include<stdlib.h>
#include <stdio.h>
#include <stdlib.h>

int main()
{
int m, n, p, i, j, v[1000], nr_soldati;

scanf("%d %d %d\n", &m, &n, &p);

for(i = 1; i <=n; i++ ) v[i] = 1;// niciun soldat nu a fost eliminat
nr_soldati = n;
while( nr_soldati > 1 )//au ramas mai mult de 1 soldat
{
for( i = 1; i <= m; i++)
{
while( v[p] == 0)//daca soldatul de la pozitia curenta a fost numarat, il sar -
{ //trec la urmatorul soldat disponibil, pe care il tot caut adaugand 1
if( p < n)
p++;
else p = 1;
}
if( p < n)
p++;
else p = 1;
}
if( p == 1)
v[n] = 0;
else v[p-1] = 0;
nr_soldati = nr_soldati - 1; //cati soldati au ramas
}

for(i = 1; i <=n; i++ )
{
if(v[i] == 1)
break;
}
printf("%d\n", i);

int main() {
int m, n, p, i, j, v[1000], nr_soldati;

scanf("%d %d %d\n", &m, &n, &p);

for (i = 1; i <= n; i++)
v[i] = 1; // niciun soldat nu a fost eliminat
nr_soldati = n;
while (nr_soldati > 1) // au ramas mai mult de 1 soldat
{
for (i = 1; i <= m; i++) {
while (v[p] ==
0) // daca soldatul de la pozitia curenta a fost numarat, il sar -
{ // trec la urmatorul soldat disponibil, pe care il tot caut adaugand 1
if (p < n)
p++;
else
p = 1;
}
if (p < n)
p++;
else
p = 1;
}
if (p == 1)
v[n] = 0;
else
v[p - 1] = 0;
nr_soldati = nr_soldati - 1; // cati soldati au ramas
}

for (i = 1; i <= n; i++) {
if (v[i] == 1)
break;
}
printf("%d\n", i);
}
64 changes: 30 additions & 34 deletions batalia_cosmica.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,39 +1,35 @@
#include<stdio.h>
#include <stdio.h>
int main()


{
int n, i, j,scut, fazer, ps, pf, c = 0;
scanf("%d %d\n", &ps, &pf);
scanf("%d\n", &n);
scut = ps;
fazer = pf;
struct tip {
int ps;
int pf;
};
struct tip nava[n];
for ( i = 0; i < n; i++)
{
scanf("%d %d\n", &nava[i].ps, &nava[i].pf);
int n, i, j, scut, fazer, ps, pf, c = 0;
scanf("%d %d\n", &ps, &pf);
scanf("%d\n", &n);
scut = ps;
fazer = pf;
struct tip {
int ps;
int pf;
};
struct tip nava[n];
for (i = 0; i < n; i++) {
scanf("%d %d\n", &nava[i].ps, &nava[i].pf);
}

for (i = 0; i < n; i++) {
ps = scut;
pf = fazer;
while (nava[i].ps >= 0) // sau sterg else-ul dar conditia devine
// while((nava[i].ps >= 0) && (ps >= 0))
{ // sa stie ce sa faca daca nava mea moare!!
ps = ps - nava[i].pf;
if (ps >= 0)
nava[i].ps = nava[i].ps - pf;
else
break;
}

for ( i = 0; i < n; i++)
{
ps = scut;
pf = fazer;
while(nava[i].ps >= 0) //sau sterg else-ul dar conditia devine while((nava[i].ps >= 0) && (ps >= 0))
{ //sa stie ce sa faca daca nava mea moare!!
ps = ps - nava[i].pf;
if (ps >= 0)
nava[i].ps = nava[i].ps - pf;
else break;
}
if ((nava[i].ps < 0) && (ps>=0)) c++;
}
printf("%d\n", c);




if ((nava[i].ps < 0) && (ps >= 0))
c++;
}
printf("%d\n", c);
}
Loading