UIU Competitive Programmers contest – 06 Solutions

All solutions written by: Rimon Mostafiz A - Climbing Worm B - Hello World! C - Binary Numbers D - Soundex E - Arbiter Login

UIU Competitive Programmers contest – 05 Solutions

A - Word Reversal B - Easier Done Than Said? C - Team D - Hungry Sequence D - Hungry Sequence (Alternate solution) E - AC Me

ACM (UVa) : 439

ACM (UVa) : 10699

#include #include int main () { int number; while ( scanf ("%d", &number) != EOF ) { if ( number == 0 ) return 0; int save = number; int count = 0; if ( floor ( sqrt (number) ) == sqrt (number) ) count--; int i; for ( i = 2; i

ACM (UVa) : 10664

STL : Vector [3] (begin, size, clear)

/* STL : Vector [3] (begin, size, clear) Author : Tausiq */ #include #include using namespace std; int main () { vector v; int i; for ( i = 10; i < 50; i += 10 ) v.push_back ( i ); // 10 20 30 40 printf ("begin : %d\n", *v.begin () ); printf ("size …

STL : Vector [2] (push_back, at, back, front)

/* STL : Vector [2] (push_back, at, back, front) Author : Tausiq B.Sc in CTE United International University */ #include "stdio.h" #include "vector" using namespace std; int main () { vector v; int i; for ( i = 0; i < 5; i++ ) v.push_back ( i + 65 ); for ( i = 0; …

STL : Vector [1] (Introduction)

:: Vector :: ( Introduction ) ::

STL : Stack [3] (size, empty)

/* STL : Stack [3] (size, empty) Author : Tausiq */ #include #include using namespace std; int main () { stack s; if ( s.empty () ) cout

STL : Stack [2] (push, pop, top)

/* STL : Stack [2] (push, pop, top) Author : Tausiq */ #include #include using namespace std; int main () { stack s; s.push (3); s.push (8); s.push (10); cout