URI problem "1080 - Highest and Position " solution

#include<stdio.h>
int main()
{
int input,i,max=0,position;
for(i=1;i<=100;i++)
{
scanf("%d",&input);
if(input>max)
{
max=input;
position=i;
}
}
printf("%d\n%d\n",max,position);
return 0;
}

Comments

URI problem "1153 - Simple Factorial " solution

#include<stdio.h> int main() { int n,i,x=1; scanf("%d",&n); for(i=n;i>=1;i--) { x=x*i; } printf("%d\n",x); return 0; }

URI problem "1040- Average 3" solution

Here is the solution to URI problem ID: 1040 #include<stdio.h> #include<math.h> int main() { double media, N1,N2,N3,N4,s,k; scanf("%lf %lf %lf %lf",&N1,&N2,&N3,&N4); media=((N1*2/10)+(N2*3/10)+(N3*4/10)+(N4*1/10)); printf("Media: %.1lf\n",media); if(media>=7) { printf("Aluno aprovado.\n"); } else if(media>=5.0&&media<=6.9) { printf("Aluno em exame.\n"); scanf("%lf",&s); printf("Nota do exame: %.1lf\n",s); k=(media+s)/2; if(k>=5) { ...

URI problem "1065 - Even Between five Numbers " solution

#include<stdio.h> int main() { int a,b,c,d,e; int l,j,k,n,p,totale; scanf("%d %d %d %d %d",&a,&b,&c,&d,&e); if(a%2==0) { l=1; } else { l=0; } if(b%2==0) { j=1; } else { j=0; } if(c%2==0) { k=1; } else { k=0; } if(d%2==0) { n=1; ...

Solving 101

Search This Blog