UVA 11597

Solve  in C:

#include<stdio.h>
int main(){

int i=1,n,a;
while(scanf("%d",&n)!=EOF)
{  if(n==0)
   break;

   a=n/2.0 ;
   printf("Case %d: %d\n",i,a);
   i++;
}

}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.