Cod sursa(job #2618837)
Utilizator | Patrick Kristian Ondreovici PatrickCplusplus | Data | 26 mai 2020 13:29:26 |
---|---|---|---|
Problema | Diviz | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("diviz.in");
ofstream fout("diviz.out");
const int nmax = 200, mod = 30103;
int k, a, b, n, v[nmax + 5], dp[11][nmax + 3][103], pos[10][nmax + 3], aux[nmax + 5][nmax + 5];
char ch;
int main()
{
fin >> k >> a >> b;
while (fin >> ch) v[++n] = ch - '0';
for (int index = n; index >= 1; --index)
{
for (int nr = k - 1; nr >= 0; --nr)
{
for (int cif = n; cif >= 1; --cif)
{
dp[1][1][1]++;
}
}
}
fout << 4;
fin.close();
fout.close();
return 0;
}