We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
i got through the sample test cases just with this code -_-
i know its not the logic but i just used image explanation to formulate the idea.
#include<stdio.h>#include<string.h>#include<math.h>#include<stdlib.h>intmain(){/* Enter your code here. Read input from STDIN. Print output to STDOUT */unsignedlongn,a,b;unsignedlongsum=0;scanf("%lu",&n);for(unsignedlongi=0;i<n;i++){scanf("%lu %lu",&a,&b);for(unsignedlongj=a;j<=b;j++){sum+=j;}printf("%lu",(sum-(b-a)));}return0;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #228: Minkowski Sums
You are viewing a single comment's thread. Return to all comments →
i got through the sample test cases just with this code -_- i know its not the logic but i just used image explanation to formulate the idea.