UVA solution

Showing posts with label UVA solution. Show all posts

power of cryptography UVA Problem - 113 solution

#include #include #include using namespace std; int main() { double n,p; while(scanf("%lf%lf",&n,&p) == 2) ...

#include #include using namespace std; int main() { int test_case,a,b,c,d; while((scanf("%d",&test_case) == 1)){...

#include #include #include using namespace std; int main() { int G[3],B[3],C[3]; while(scanf("%d %d %d %d %d %d %d %d %...

#include using namespace std; int main() { unsigned long long age[101] = {0}; unsigned long long n,sub; while(scanf("%...