Which problem is the easiest problem of this site?

[Darko]

I think 113 is one of the easiest ones (I was surprised it was, probably not intentionally).

Btw, 10370 is super easy, unless you are trying to use Java and you are new to UVa.

Here's another one: 10215 - Check the languages on stats page.

Darko

[ibrahim]

I think Volume 109 is the easiest volume (After 4 vol).

[tmdrbs6584]

100 102 272 357 441 444 458 488 491 499 674 10055 10071 10082 10300 10340 10370 10499 10679 10699 10945 10970
are so easy!!!

[Przemek D.]

I don know if its good to answer such an old topic
For me 10783 was way much easier than "famous" 10071 simply because I hate physics

[Zaspire]

I think 673 is one of the easiest ones

[Zaspire]

This is easy problem:543-686-10168(if do it in this Sequence)

[tmdrbs6584]

ACM BEGINNER

[kwedeer]

well - as I thought (and read about possible solutions) - 10195 is the easiest - calculate the raddi from the well known geometry formula and that's all,... however - judge doesn't give me accepted for this and I cann't understand why? And it is the nasty things about simple tasks - there is no space what to do in such cases...

[Solmon K.]

I think 101 is so easy!

[Solmon K.]

Problem 647 - Chutes and Ladders

It's very easy, but not many people tried this problem..

[Vexorian]

272 - TeX quotes was so easy that I couldn't believe it.

[shanto_0321]

#include<stdio.h>
#include<conio.h>
int main()
{
long int n,t,a[99],i,s=0,k;
double c,j=0;
while(scanf("%ld",&t)!=EOF)
{
for(k=0;k<t;k++)
{
scanf("%ld",&n);
for(i=0;i<n;i++)
scanf("%ld",&a);
for(i=0;i<n;i++)
{
s=(s+a);
}
s=s/n;
for(i=0;i<n;i++)
if(a<=s)
{
continue;
}
else
{
j++;
}
c=(j*100)/n;
printf("%.3lf%c",c,37);
printf("\n");
s=0,j=0;
}
}
getch();
return 0;
}
why this code does not accept?what's problem?the result of it is run time error.

[jill]

For me Uploading an avtar is not make possible why?>