SPOJ ALICESIE Solution

| July 01, 2015

The correct, optimal and working solution for programming question ALICESIE on spoj

#include <stdio.h>

int main( int argc , char * argv[] ) {

	int t;
	scanf("%d" , &t);

	while ( t-- ) {

		int n;
		scanf("%d" , &n);
		printf("%d\n" , (n+1)/2);

	}

	return 0;
}