Cod sursa(job #1493981)

Utilizator ionut98Bejenariu Ionut Daniel ionut98 Data 30 septembrie 2015 11:37:37
Problema Iepuri Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1 kb
#include<fstream>
#define mod 666013
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
int x,y,z,a,b,c,n,fin,t,i,j,k,m[4][4],cc[4][1];
void inmult(int a[],int b[])
{
    int d[3][3];
    d[0][0]=d[0][1]=d[0][2]=d[1][0]=d[1][1]=d[1][2]=d[2][0]=d[2][1]=d[2][2]=0;
    for(i=0;i<=2;i++)
      for(j=0;j<=2;j++)
      {
          for(k=0;k<=2;k++)
          {
              d[i][j]+=a[i][j]*b[k][i];
          }
      }
    for(i=0;i<=2;i++)
      for(j=0;j<=2;j++)
        a[i][j]=d[i][j];
}
void exp(int n)
{
    p[0][0]=p[0[1]=p[0][2]=p[1][0]=p[1][1]=p[1][2]=p[2][0]=p[2][1]=p[2][2]=1;

}
int main()
{
    f>>t;
    while(t--)
    {
        fin=0;
        f>>x>>y>>z>>a>>b>>c>>n;
        m[0][0]=0;
        m[0][1]=1;
        m[0][2]=0;
        m[1][0]=0;
        m[1][1]=0;
        m[1][2]=1;
        m[2][0]=c;
        m[2][1]=b;
        m[2][2]=a;
        cc[0][0]=x;
        cc[1][0]=y;
        cc[2][0]=z;
        g<<fin<<"\n";
    }
    return 0;
}