# UV 1564-widget Factory (Gaussian deyuan)

Source: Internet
Author: User
Ultraviolet A 1564-widget Factory

N parts: Give m production time and K parts are made at each time period. Each part has a production time, which is represented by Mon to sun, determine the production time of each part, and determine whether there are multiple or no solutions.

Train of Thought: list an equation for each period of time. In this way, a total of M equations are listed to solve n variable elements, and Gaussian elimination is used to solve them. Note that each equation is MoD 7, therefore, Division requires the inverse element of the Number % 7 During Gaussian elimination.

Code:

`#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int N = 305;char week[7][5] = {"MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"};int n, m, k, A[N][N], cnt[N];char day1[5], day2[5];int find(char *day) {    for (int i = 0; i < 7; i++)if (strcmp(week[i], day) == 0)    return i;}int inv(int x) {    int ans = 1;    for (int i = 0; i < 5; i++)ans = ans * x % 7;    return ans;}void build() {    for (int i = 0; i < m; i++) {scanf("%d%s%s", &k, day1, day2);A[i][n] = (find(day2) - find(day1) + 8) % 7;int tmp;memset(cnt, 0, sizeof(cnt));while (k--) {    scanf("%d", &tmp);    cnt[tmp]++;}for (int j = 1; j <= n; j++)    A[i][j - 1] = cnt[j] % 7;    }}int gauss() {    int i = 0, j = 0;    while (i < m && j < n) {int r;for (r = i; r < m; r++)    if (A[r][j]) break;if (r == m) {    j++;    continue;}for (int k = j; k <= n; k++) swap(A[r][k], A[i][k]);for (int k = 0; k < m; k++) {    if (i == k) continue;    if (A[k][j]) {int tmp = A[k][j] * inv(A[i][j]) % 7;for (int x = j; x <= n; x++)    A[k][x] = ((A[k][x] - tmp * A[i][x]) % 7 + 7) % 7;    }}i++;    }    for (int k = i; k < m; k++)if (A[k][n]) return 2;    if (i < n) return 1;    for (int i = 0; i < n; i++) {int ans = A[i][n] * inv(A[i][i]) % 7;if (ans < 3) ans += 7;printf("%d%c", ans, i == n - 1 ? '\n' : ' ');    }    return 0;}void solve() {    int tmp = gauss();    if (tmp == 1) printf("Multiple solutions.\n");    else if (tmp == 2) printf("Inconsistent data.\n");}int main() {    while (~scanf("%d%d", &n, &m) && n) {build();solve();    }    return 0;}`

Related Keywords:

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

## A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

• #### Sales Support

1 on 1 presale consultation

• #### After-Sales Support

24/7 Technical Support 6 Free Tickets per Quarter Faster Response

• Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.