Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Afb bjAN KN 1212341A

    Uploaded by

    Emanuel Pitigoi
    This C++ program reads in values n and l, initializes two n x n matrices v and v1 with increasing values, rotates v1 through multiple iterations, compares it to v each iteration, and counts the number of iterations until they are equal again. It uses nested for loops to initialize the matrices, rotate v1, compare the values, and output the results.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Afb bjAN KN 1212341A

    Uploaded by

    Emanuel Pitigoi
    5 views5 pages
    This C++ program reads in values n and l, initializes two n x n matrices v and v1 with increasing values, rotates v1 through multiple iterations, compares it to v each iteration, and counts the number of iterations until they are equal again. It uses nested for loops to initialize the matrices, rotate v1, compare the values, and output the results.

    Original Description:

    Original Title

    afb bjAN KN 1212341A

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ program reads in values n and l, initializes two n x n matrices v and v1 with increasing values, rotates v1 through multiple iterations, compares it to v each iteration, and counts the number of iterations until they are equal again. It uses nested for loops to initialize the matrices, rotate v1, compare the values, and output the results.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    5 views5 pages

    Afb bjAN KN 1212341A

    Uploaded by

    Emanuel Pitigoi
    This C++ program reads in values n and l, initializes two n x n matrices v and v1 with increasing values, rotates v1 through multiple iterations, compares it to v each iteration, and counts the number of iterations until they are equal again. It uses nested for loops to initialize the matrices, rotate v1, compare the values, and output the results.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 5

    #include <iostream>

    #include <algorithm>ASFS

    using namASFSAespace std;

    //ifstream cin(ASFAFASF("b.out");SF

    SAD

    int v[1001][1001];

    int v1[10AS01][1001];

    ASDADASDASFASFA

    int main()

    int n,l;

    cin>>n>>l;

    int c=1;

    for(int i=1; i<=n; i++)

    if(i%2==1)

    for(int k=1; k<=n; k++)

    v[i][k]=c;

    v1[i][k]=v[i][k];

    c++;

    else

    for(int k=n; k>0; k--)

    v[i][k]=c;

    v1[i][k]=v[i][k];

    c++;
    }

    int cnt=0,prez;

    while(1)

    c=1;

    prez=0;

    cnt++;

    int t[n*n+1];

    int a=1;

    for(int i=1; i<=n/2; i++)

    for(int k=i; k<=n-i+1; k++)

    t[a]=v1[i][k];

    a++;

    for(int k=i+1; k<=n-i+1; k++)

    t[a]=v1[k][n-i+1];

    a++;

    for(int k=n-i; k>=i; k--)

    t[a]=v1[n-i+1][k];

    a++;
    }

    for(int k=n-i; k>i; k--)

    t[a]=v1[k][i];

    a++;

    if(n%2==1)

    t[a]=v[n/2+1][n/2+1];

    c=1;

    for(int i1=1; i1<=n; i1++)

    if(i1%2==1)

    for(int k=1; k<=n; k++)

    v1[i1][k]=t[c];

    cout<<t[c]<<" ";

    c++;

    if(v1[i1][k]==v[i1][k])

    prez++;

    else
    {

    for(int k=n; k>0; k--)

    v1[i1][k]=t[c];

    cout<<t[c]<<" ";

    c++;

    if(v1[i1][k]==v[i1][k])

    prez++;

    cout<<'\n';

    if(prez==l)

    break;

    cout<<cnt;
    return 0;

    You might also like