UVA 138 - Street Numbers UVA • Sep 1, 2020 Problem PDFSolution:#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define ll long long #define sc scanf #define pf printf #define pi 2*acos(0.0) using namespace std; int s[20] = { 6,8, 35,49, 204,288, 1189,1681, 6930,9800, 40391,57121, 235416,332928, 1372105,1940449, 7997214,11309768, 46611179,65918161 }; int main() { for(int i=0;i<20;i+=2) printf("%10d%10d\n",s[i],s[i+1]); return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/138/138.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read