UVA 11936 - The Lazy Lumberjacks Solution

Solve in C:

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

int n,a,b,i;
scanf("%d",&n);
for(i=1;i<=n;i++)

{
    scanf("%d %d",&a,&b);
    printf("%d\n",(a/3)*(b/3));
}

return 0;


}

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.