Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- vector < int > suma;
- vector < int > produs;
- vector < int > cifren;
- int coeficienti[] = {4, 30, 50, 30, 6};
- void prod(vector < int > &v, vector < int > &v2)
- {
- int i, j;
- vector < int > v3;
- int siz = v.size() + v2.size() - 1;
- for(i = 0; i < siz; i++)
- {
- v3.push_back(0);
- }
- for(i = 0; i < v.size(); i++)
- {
- for(j = 0; j < v2.size(); j++)
- {
- v3[i + j] += v[i] * v2[j];
- }
- }
- int t = 0;
- for(i = 0; i < v3.size(); i++)
- {
- t += v3[i];
- v3[i] = t % 10;
- t /= 10;
- }
- if(t)
- {
- v3.push_back(t);
- }
- for(i = 0; i < v3.size(); i++)
- {
- v.push_back(v3[i]);
- }
- }
- void adunare(vector < int > &v, vector < int > &v2)
- {
- int e = 0, i;
- if(v.size() < v2 .size())
- {
- v.resize(v2.size());
- for(i = v.size(); i < v2.size(); i++)
- {
- v.push_back(0);
- }
- }
- else
- {
- for(i = v2.size(); i < v.size(); i++)
- {
- v2.push_back(0);
- }
- }
- for(i = 0; i < v.size(); i++, e /= 10)
- {
- e += (v[i] + v2[i]);
- v[i] = e % 10;
- }
- if(e)
- {
- v.push_back(e);
- }
- }
- int main()
- {
- suma.push_back(0);
- int n;
- cin >> n;
- while(n)
- {
- cifre.insert(cifre.begin(), n % 10);
- n /= 10;
- }
- int p = 1;
- int i, j;
- for(i = 0; i < 5; i++)
- {
- produs.psuh_back(coeficienti[i]);
- for(j = 0; j < p; j++)
- {
- prod(produs , )
- }
- }
- for(i = 0; i < suma.size(); i++)
- {
- cout << suma[i];
- }
- return 0;
- }
- #include <iostream>
- using namespace std;
- int brut(int n)
- {
- int suma = 0;
- for(int i = 1; i <= n; i++)
- {
- suma += ((i * (i + 1)) / 2) * ((i * (i + 1)) / 2);
- }
- return suma;
- }
- int net(int n)
- {
- return (6 * n * n * n * n * n + 30 * n * n * n * n + 50 * n * n * n + 30 * n * n + 4 * n) / 120;
- }
- #include "problema.hpp"
- int main()
- {
- for(unsigned long long i = 1; i <= 1000000; i++)
- {
- cout <<"i: " << i << " rezultat: " << (brut(i) == net(i)) << '\n';
- if(brut(i) != net(i))
- {
- return 0;
- }
- }
- main();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement