Cod sursa(job #1823910)

Utilizator andra1782Andra Alazaroaie andra1782 Data 6 decembrie 2016 23:09:29
Problema Pascal Scor 100
Compilator c Status done
Runda Arhiva de probleme Marime 1.61 kb
#include <stdio.h>
#define MAX 5000001
int v[2]={2,3},api[2],apij[2],apj[2],ap[MAX][2];
int main(){
    FILE *fin=fopen("pascal.in","r");
    FILE *fout=fopen("pascal.out","w");
    int r,d,nr=0,i,j,c;

    fscanf(fin,"%d%d",&r,&d);
    if(d==5)
        v[0]=5;
    for(i=0; i<2; i++)
        for(c=v[i]; c<=r; c*=v[i])
            for(j=c; j<=r; j+=c)
                ap[j][i]++;
    for(i=0; i<2; i++){
        for(c=v[i]; c<=r; c*=v[i])
            api[i]+=r/c;
        apij[i]=api[i];
    }
    for(i=1; i<r/2+r%2; i++){
        apij[0]-=ap[r-i+1][0];
        apj[0]+=ap[i][0];
        apij[1]-=ap[r-i+1][1];
        apj[1]+=ap[i][1];
        switch(d){
            case 2: if(api[0]-apij[0]-apj[0]>0) nr++; break;
            case 3: if(api[1]-apij[1]-apj[1]>0) nr++; break;
            case 5: if(api[0]-apij[0]-apj[0]>0) nr++; break;
            case 4: if(api[0]-apij[0]-apj[0]>1) nr++; break;
            case 6: if(api[0]-apij[0]-apj[0]>0 && api[1]-apij[1]-apj[1]>0) nr++; break;
        }
    }
    nr*=2;
    if(r%2==0){
        apij[0]-=ap[r-i+1][0];
        apj[0]+=ap[i][0];
        apij[1]-=ap[r-i+1][1];
        apj[1]+=ap[i][1];
        switch(d){
            case 2: if(api[0]-apij[0]-apj[0]>0) nr++; break;
            case 3: if(api[1]-apij[1]-apj[1]>0) nr++; break;
            case 5: if(api[0]-apij[0]-apj[0]>0) nr++; break;
            case 4: if(api[0]-apij[0]-apj[0]>1) nr++; break;
            case 6: if(api[0]-apij[0]-apj[0]>0 && api[1]-apij[1]-apj[1]>0) nr++; break;
        }
    }
    fprintf(fout,"%d\n",nr);
    fclose(fin);
    fclose(fout);
    return 0;
}