Submission #229968


Source Code Expand

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <memory.h>
#include <time.h>
#include <math.h>

#define LARGE_NUM 0x3fffffff
#define LONG_LARGE_NUM 0x3fffffffffffffL

#define ZERO(p,n) memset(p,0,n)

#define forto(i,l) for(int i=0,_i=(l);i<_i;i++)
#define forin(i,k,l) for(int i=(k),_i=(l);i<=_i;i++)
#define forni(i,l,k) for(int i=(l),_i=(k);i>=_i;i--)
#define forind(i,k,l) for(int i=(k);i<=(l);i++)
#define fornid(i,l,k) for(int i=(l);i>=(k);i--)
#define swap(t,i,j,b) {t b=i;i=j;j=b;}
#define swapl(i,j,b) swap(long,i,j,b)
#define swapi(i,j,b) swap(int,i,j,b)
#define swapc(i,j,b) swap(char,i,j,b)

#define idtop20(i,w) ((i)%(w))
#define idtop21(i,w) ((int)((i)/(w)))
#define p2toid(x,y,w) ((y)*(w)+(x))
#define idtop30(i,w,h) idtop20(i,w)
#define idtop31(i,w,h) (idtop21(i,w)%(h))
#define idtop32(i,w,h) ((int)(idtop21(i,w)/(h)))
#define p3toid(x,y,z,w,h) ((z)*(w)*(h)+p2toid(x,y,w))
#define rdi(x) scanf("%d", &x);
#define rdi2(x,y) scanf("%d%d", &x, &y);
#define rdi3(x,y,z) scanf("%d%d%d", &x, &y, &z);

int perm(int n, int k){ if(n < 1)return -1; if(k == 1)return n; return (n-k+1)*perm(n,k-1); }
int fact(int n){ if(n == 0)return 1; return n*fact(n-1); }
int comb(int n, int k){if(n < 1 || k < 0 || k > n)return -1;if(k == 0 || k == n)return 1;return (int)(perm(n,k)/fact(k)); }



int main(void){
	int n, X;
	int *a, rslt=0;
	rdi2(n,X);
	a = new int[n];
	switch(n){
	case 1: scanf("%d",a); break;
	case 2: scanf("%d%d",a, a+1); break;
	case 3: scanf("%d%d%d",a, a+1, a+2); break;
	case 4: scanf("%d%d%d%d",a, a+1, a+2, a+3); break;
	case 5: scanf("%d%d%d%d%d",a, a+1, a+2, a+3, a+4); break;
	case 6: scanf("%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5); break;
	case 7: scanf("%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6); break;
	case 8: scanf("%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7); break;
	case 9: scanf("%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8); break;
	case 10: scanf("%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9); break;
	case 11: scanf("%d%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9, a+10); break;
	case 12: scanf("%d%d%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9, a+10
, a+11); break;
	case 13: scanf("%d%d%d%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9, a+10
, a+11, a+12); break;
	case 14: scanf("%d%d%d%d%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9, a+10
, a+11, a+12, a+13); break;
	case 15: scanf("%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9, a+10
, a+11, a+12, a+13, a+14); break;
	case 16: scanf("%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9, a+10
, a+11, a+12, a+13, a+14, a+15); break;
	case 17: scanf("%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9, a+10
, a+11, a+12, a+13, a+14, a+15, a+16); break;
	case 18: scanf("%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9, a+10
, a+11, a+12, a+13, a+14, a+15, a+16, a+17); break;
	case 19: scanf("%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9, a+10
, a+11, a+12, a+13, a+14, a+15, a+16, a+17, a+18); break;
	case 20: scanf("%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d",a, a+1, a+2, a+3, a+4, a+5, a+6, a+7, a+8, a+9, a+10
, a+11, a+12, a+13, a+14, a+15, a+16, a+17, a+18, a+19); break;
	}
	forto(i,n){if(X&1)rslt+=a[i]; X>>=1;}
	printf("%d\n", rslt);
	delete[]a;
/*________________________ex:swap the input___________________*/
//	int a=0,b=0;
//	scanf("%d%d", &a, &b);
//	printf("%d %d\n", b, a);
/*____________________________________________________________*/
	return 0;
}

Submission Info

Submission Time
Task B - 価格の合計
User l_sigma
Language C++ (G++ 4.6.4)
Score 100
Code Size 3795 Byte
Status AC
Exec Time 30 ms
Memory 924 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43:2: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:46:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:47:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:48:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:49:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:50:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:51:58: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared...

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 20
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
All subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 27 ms 672 KB
subtask0_sample02.txt AC 25 ms 796 KB
subtask0_sample03.txt AC 26 ms 672 KB
subtask1_01.txt AC 26 ms 920 KB
subtask1_02.txt AC 27 ms 796 KB
subtask1_03.txt AC 27 ms 796 KB
subtask1_04.txt AC 24 ms 840 KB
subtask1_05.txt AC 26 ms 796 KB
subtask1_06.txt AC 25 ms 800 KB
subtask1_07.txt AC 26 ms 800 KB
subtask1_08.txt AC 26 ms 672 KB
subtask1_09.txt AC 26 ms 672 KB
subtask1_10.txt AC 24 ms 796 KB
subtask1_11.txt AC 26 ms 924 KB
subtask1_12.txt AC 24 ms 796 KB
subtask1_13.txt AC 25 ms 800 KB
subtask1_14.txt AC 27 ms 796 KB
subtask1_15.txt AC 26 ms 736 KB
subtask1_16.txt AC 30 ms 672 KB
subtask1_17.txt AC 26 ms 800 KB