제출 #2398

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
2398	2013-07-21 06:50:12	alephnull	생일수 I (GA4_birthday1)	C++98	100 / 100	681 ms	5284 KiB

birthday1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <cstdio>
#include <algorithm>
#define N 1000001
#define INF 987654321
using namespace std;
int main() {
  int *dp=new int [N+10];
  for(int i=0;i<N+10;i++){
    dp[i]=INF;
  }
  dp[0]=0;dp[3]=dp[5]=dp[8]=1;
  for(int i=0;i<N;i++){
    if(dp[i+3]>dp[i]+1)dp[i+3]=dp[i]+1;
    if(dp[i+5]>dp[i]+1)dp[i+5]=dp[i]+1;
    if(dp[i+8]>dp[i]+1)dp[i+8]=dp[i]+1;
  }
  int t;scanf("%d",&t);
  for(int x=0;x<t;x++){
    int n;scanf("%d",&n);
    if(dp[n]==INF)
      printf("%d\n",-1);
    else{
      int a=0,b=0,c=0;
      while(n>0){
        if(dp[n-3]==dp[n]-1){a++;n-=3;}
        else if(dp[n-5]==dp[n]-1){b++;n-=5;}
        else if(dp[n-8]==dp[n]-1){c++;n-=8;}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 19 / 19
• Subtask 3: 26 / 26
• Subtask 4: 41 / 41