/// Raihan Ruhin /// CSE, Jahangirnagar University. /// Dhaka-Bangladesh. /// id: raihanruhin (topcoder / codeforces / codechef / hackerrank / uva / uvalive, spoj), 3235 (lightoj) /// mail: raihanruhin@ (yahoo / gmail / facebook) /// blog: ruhinraihan.blogspot.com #include<bits/stdc++.h> using namespace std; #define SET(a) memset(a,-1,sizeof(a)) #define CLR(a) memset(a,0,sizeof(a)) #define PI acos(-1.0) #define MOD 1000000007 #define MX 100010 int main() { ios_base::sync_with_stdio(0);cin.tie(0); int n, m, tc; string s; cin>>tc; while(tc--) { cin>>n>>m; //n-=2; //m-=2; //cout<<ceil((double)n/3)*ceil((double)m/3)<<"\n"; cout<<(n/3)*(m/3)<<"\n"; } return 0; }
Thursday, 27 November 2014
UVA 11044 Searching for Nessy Solution
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment