uva10419

myCpps/!-OJcreater.cpp

@@ -12,7 +12,7 @@
 using namespace std;
 
 //***************************************
-const string CPPfile = "identifyingConcurrentEvents_UVA334"; //*
+const string CPPfile = "SumUpThePrimesTL_UVA10419"; //*
 //***************************************
 
 ifstream fin(CPPfile + ".cpp");

myCpps/SumUpThePrimesTL_UVA10419.cpp

@@ -0,0 +1,127 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+ifstream fin("SumUpThePrimesTL_UVA10419.in");
+ofstream fout("SumUpThePrimesTL_UVA10419.out");
+
+const int maxP = 300;
+
+bool dp[150][1001][15];
+
+bool compare(int x, int y)
+{
+    stringstream ss1;
+    stringstream ss2;
+    ss1 << x;
+    ss2 << y;
+    return ss1.str() < ss2.str();
+}
+
+bool solve(int i, int s, int c, int x, int t, vector<int> & path, vector<int> & primes)
+{
+    int sizeP = primes.size();
+
+    if (i == primes.size())
+    {
+        return false;
+    }
+    else if (c == t)
+    {
+        if (s == x)
+        {
+            return true;
+        }
+        return false;
+    }
+    else if (s >= x)
+    {
+        return false;
+    }
+    else if (dp[i][s][c] == false)
+    {
+        return false;
+    }
+
+    path[c] = primes[i];
+    if (solve(i + 1, s + primes[i], c + 1, x, t, path, primes) == true)
+    {
+        return true;
+    }
+    else if (solve(i + 1, s, c, x, t, path, primes) == true)
+    {
+        return true;
+    }
+
+    dp[i][s][c] = false;
+    return false;
+}
+
+int main()
+{
+    vector<bool> isPrime(maxP + 1, true);
+    isPrime[0] = false, isPrime[1] = false;
+    vector<int> primes;
+
+    for (int i = 2; i <= maxP; ++i)
+    {
+        if (isPrime[i] == true)
+        {
+            for (int j = i * i; j <= maxP; j += i)
+            {
+                isPrime[j] = false;
+            }
+        }
+    }
+
+    primes.push_back(2);
+    for (int x = 3; x <= 300; ++x)
+    {
+        if (isPrime[x] == true)
+        {
+            for (int c = 1; c <= 2; ++c)
+            {
+                primes.push_back(x);
+            }
+        }
+    }
+
+    sort(primes.begin(), primes.end(), compare);
+
+    int _case = 0, sizeP = primes.size();
+
+    while (true)
+    {
+        int x = 0, t = 0;
+        fin >> x >> t;
+        if (x + t == 0)
+            break;
+        ++_case;
+
+        fout << "CASE " << _case << ":\n";
+
+        vector<int> path(t);
+        //vector<vector<vector<bool>>> dp(sizeP + 1, vector<vector<bool>>(x + 1, vector<bool>(t + 1, true)));
+
+        memset(dp, true, sizeof(dp));
+
+        bool ans = solve(0, 0, 0, x, t, path, primes);
+
+        if (ans == false)
+        {
+            fout << "No Solution.\n";
+        }
+        else
+        {
+            for (int i = 0; i <= t - 1; ++i)
+            {
+                if (i > 0)
+                    fout << '+';
+                fout << path[i];
+            }
+            fout << '\n';
+        }
+    }
+
+    return 0;
+}