UVA 11044 - Searching for Nessy 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;


}

1 comment:

  1. #include
    int main()
    {

    int i,j,p,n;

    scanf("%d",&n);
    for(p=1; p<=n; p++)
    {

    scanf("%d%d",&i,&j);
    i=i/3;
    j=j/3;

    printf("%d\n",i*j);
    }

    return 0;
    }

    ReplyDelete

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.