Submission #3418200


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;

int main(void){
  int n;
  cin >> n;

  switch(n){
  case 1:
    cout << 1 << endl; cout << 1 << endl;
    break;
  case 2:
    cout << 1 << endl; cout << 2 << endl;
    break;
  case 3:
    cout << 2 << endl << 1 << endl << 2 << endl;
    break;
  case 4:
    cout << 1 << endl << 4 << endl;
    break;
  case 5:
    cout << 2 << endl << 1 << endl << 4 << endl;
    break;
  case 6:
    cout << 2 << endl << 2 << endl << 4 << endl;
    break;
  case 7:
    cout << 3 << endl << 1 << endl << 2 << endl << endl << 4 << endl;
    break;
  case 8:
    cout << 1 << endl << 8 << endl;
    break;
  case 9:
    cout << 2 << endl << 1 << endl << 8 << endl;
    break;
  case 10:
    cout << 2 << endl << 2 << endl << 8 << endl;
    break;

  }

  return 0;
}

Submission Info

Submission Time
Task A - 足し算
User Dakuon
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1160 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 10
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt
All subtask0_sample_01.txt, subtask0_sample_02.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
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB