You are on page 1of 2

int main()

{
int n,i,j;
printf("n este:\n");
scanf("%d",&n);
for(i=1;i<n;i++)
{
if(i%2==0)
printf("%d\n",i);

}
return 0;
}

nt main()
{
int n,x[100],i;
scanf("%d",&n);
x[0]=0;
x[1]=1;
for(i=2;i<=n;i++)
{
x[i]=x[i-2]+x[i-1];
printf("%d\n",x[i]);

return 0;
}

int main()
{
int n ;

do{
scanf("%d",&n);

}
while(n>=0);
if(n<=0)
printf("ai gresit!\n");

return 0;
}
int main()
{ int x[10][10],i,j;
for(i=0;i<10;i++)

for(j=0;j<10;j++)
{

x[i][j]=(i+1)*(j+1);
printf("%d ",x[i][j]);

}
printf("\n");

int main()

// PROBLEMA 12

int n,i,j,l;

scanf("%d",&n);

for(i=1; i<=n; i++)


{
for(j=1;j<=i; j++)
{
for(l=1;l<=i; l++)
{
printf("%d ",i);
}
printf("\n");
}
}

return 0;
}

You might also like