Cod sursa(job #1807035)

Utilizator suciualinsuciu alin suciualin Data 15 noiembrie 2016 22:22:18
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cartonas.in");
ofstream fout("cartonas.out");
int a[101][101],j,i,s[101],b[101];
int main()
{   int32_t n,nn,x;

    fin>>n;
    nn=n;
    fin>>x;
    for(i=0;i<n;i++)
        fin>>a[0][i];
    for(i=1;i<n;i++)
        {for(j=0;j<nn;j++)
           a[i][j]=a[i-1][j]+a[i-1][j+1];
            nn--;
        }

        fout<<a[n-1][0]<<'\n';
          nn=n;
    for(i=0;i<n;i++)
        {for(j=0;j<nn;j++)
        if (x==a[i][j]) fout<<i+1<<'\n';
        }
        nn=n;
    for(i=0;i<n;i++)
    {   s[i]=0;
        b[i]=0;
        for(j=0;j<nn;j++)
        s[i]+=a[i][j];
         nn--;
         while(s[i]>0)
         { if (s[i]%2==1) b[i]++;
         s[i]/=2;


         }


    }
    for (int k=23;k>=1;k--)
            for(i=0;i<n;i++)
                if (b[i]==k) fout<<i+1<<" ";


    return 0;
}