Parallel Computing_SOLVED

/*

CODECHEF
PROBLEM CODE : PARALLEL

*/

#include<stdio.h>

int main()
{
int a,b,steps,n;

scanf("%d",&n);
for(b=n,steps=0;b;b/=2)
steps++;
steps=(steps-1)*2;
printf("%d\n",steps);

for(b=2;b<=n;b*=2)
{
printf("%d",n/b);
for(a=b;a<=n;a+=b)
printf(" %d+%d=%d",a-b/2,a,a);
printf("\n");
}

for(b/=2;b>=2;b/=2)
{
printf("%d",(n-b/2)/b);
for(a=b+b/2;a<=n;a+=b)
printf(" %d+%d=%d",a-b/2,a,a);
printf("\n");
}

return 0;
}

Read More

Bonus_SOLVED

/*

CODECHEF
PROBLEM CODE : ACMKANPB

*/

#include <stdio.h>
 
int main()
{
int fall, i, c, n, m, l, t, j, x[4][10100];

for(scanf("%d",&fall); fall--;)
{
for(i=!!scanf("%d %d %d",&n,&m,&l); i<=m; x[0][i++]=l);
for(i=-1; ++i<m; scanf("%d %d %d",&x[1][i],&x[2][i],&x[3][i]));
for(j=!(c=1); c&&j<n; j++)
for(i=-!(c=0); ++i<m; x[0][x[1][i]]=(x[0][x[1][i]]<x[0][x[2][i]]+x[3][i])?x[0][x[2][i]]+x[3][i]+(c=1)*0:x[0][x[1][i]]);
for(i=0; x[0][x[1][i]]-x[0][x[2][i]]>=x[3][i]&&i<m; i++);
if(i<m)
puts("Inconsistent analysis.");
else
{
for(i=!(t=0); i<=n; t+=x[0][i++]);
printf("%d\n",t);

for(i=1; i<=n; printf("%d ",x[0][i++]));
puts("");
}
}
return 0;
}

Read More

Logging Game_SOLVED

/*

CODECHEF
PROBLEM CODE : LOGGERS

*/

#include<stdio.h>
 
 
int sgtable[251]={-1,0,1,2,3,1,4,3,2,1,4,2,6,4,1,2,7,1,4,3,2,1,4,6,7
,4,1,2,8,5,4,7,2,1,8,6,7,4,1,2,3,1,4,7,2,1,8,2,7,4,1,2,8,1,4,7,2,1,
4,2,7,4,1,2,8,1,4,7,2,1,8,6,7,4,1,2,8,1,4,7,2,1,8,2,7,4,1,2,8,1,4,7,2,1,8,2,7,4,1,2,
8,1,4,7,2,1,8,2,7,4,1,2,8,1,4,7,2,1,8,2,7,4,1,2,8,1,4,7,2,1,8,2,7
,4,1,2,8,1,4,7,2,1,8,2,7,4,1,2,8,1,4,7,2,1,8,2,7,4,1,2,8,1,4,7,2,1,
8,2,7,4,1,2,8,1,4,7,2,1,8,2,7,4,1,2,8,1,4,7,2,1,8,2,7,4,1
,2,8,1,4,7,2,1,8,2,7,4,1,2,8,1,4,7,2,1,8,2,7,4,1,2,8,1,4
,7,2,1,8,2,7,4,1,2,8,1,4,7,2,1,8,2,7,4,1,2,8,1,4,7,2,1,8};
 
int main()
{
 
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
int i,val,ans=0;
for(i=0;i<n;i++)
{
scanf("%d",&val);;
ans=ans^sgtable[val];
}
if(ans)printf("Alice\n");
else printf("Bob\n");
}
return 0;
}

Read More