Search found 1 match

by du_loser
Mon May 30, 2011 1:00 pm
Forum: Volume 114 (11400-11499)
Topic: 11479 - Is this the easiest problem?
Replies: 48
Views: 27336

Re: 11479 - Is this the Easiest Problem?

getting wa :cry: #include<stdio.h>
int main(){
long long int c,tc,a[3],i,j,t;
scanf("%lld",&tc);
for(c=1;c<=tc;c++){
scanf("%lld%lld%lld",&a[0],&a[1],&a[2]);
for(i=0;i<2;i++){
for(j=0;j<2-i;j++){
if(a[j]<a[j+1]){
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
printf("Case %lld: ",c);
if((a[0 ...

Go to advanced search