Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- int n, s, v[12], t;
- FILE *f;
- void Init(int k) {
- v[k] = 0; // initiailzm elemtenul cu 0
- }
- int Succesor(int k) {
- if (v[k] <= t) { // verificam daca mai avem succsoer si daca este incrementam
- v[k]++;
- return 1;
- }
- return 0;
- }
- int Valid(int k) {
- int i;
- return k <= n;
- }
- Print() {
- int i;
- for (i = 1; i <= n; i++)
- fprintf(f, "%d ", v[i]);
- fprintf(f, "\n");
- }
- int Solution(int k) {
- if (k != n)
- return 0;
- int i = 1, suma = 0;
- for (i = 1; i <= k; i++)
- suma += v[i];
- if (suma == s)
- return 1;
- return 0;
- }
- void Back() {
- int k = 1, isS, isV;
- k = 1; Init(k);
- while (k > 0) {
- isS = 0; isV = 0;
- if (k <= n)
- do {
- isS = Succesor(k);
- if (isS) isV = Valid(k);
- } while (isS && !isV);
- if (isS)
- if (Solution(k))
- Print();
- else {
- k++; Init(k);
- }
- else
- k--;
- }
- }
- int main() {
- f = fopen("in.txt", "r");
- fscanf(f, " %d%d%d", &n,&t, &s);
- fclose(f);
- f = fopen("prada.txt", "w");
- Back();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement