Skip to main content

Posts

Showing posts with the label Codeforces round 1182

Codeforces round 1182(B. Plus from Picture)

At first check the middle * (point tat connected to east,west,south,north) then * connected to the last of every four direction  if  (.) occurs then  break . ///Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include< iostream > #include< cstdio > #include< algorithm > #include< string > #include< cstring > #include< sstream > #include< cmath > #include< cstring > #include< vector > #include< queue > #include< map > #include< set > #include< stack > #include< vector > #include< iterator > #include   < functional >   ///sort(arr,arr+n,greater<int>()) for decrement of array /*every external angle sum=360 degree   angle find using p...