Submission #3208566

Source Code Expand

#include<bits/stdc++.h>
#define F first
#define S second
#define int long long
#define double long double
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P> iP;
typedef pair<P,int> Pi;
typedef pair<P,P> PP;
double eps=1e-8;
int mod=1e9+7;
int inf=1LL<<55;

priority_queue<P,vector<P>,greater<P> > pq;

signed main(){
  int n,ans=0;
  cin>>n;
  for(int a=0;a<5;a++)
    for(int b=0;b<2;b++)
      for(int c=0;c<5;c++)
	for(int d=0;d<2;d++)
	  for(int e=0;e<5;e++){
	    if(a+b+c+d+e>n)continue;
	    else ans++;
	  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

Submission Time
Task B - Coins
User aizu_d
Language C++14 (GCC 5.4.1)
Score 100
Code Size 592 Byte
Status AC
Exec Time 1 ms
Memory 256 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 27
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KiB
0_01.txt AC 1 ms 256 KiB
0_02.txt AC 1 ms 256 KiB
1_00.txt AC 1 ms 256 KiB
1_01.txt AC 1 ms 256 KiB
1_02.txt AC 1 ms 256 KiB
1_03.txt AC 1 ms 256 KiB
1_04.txt AC 1 ms 256 KiB
1_05.txt AC 1 ms 256 KiB
1_06.txt AC 1 ms 256 KiB
1_07.txt AC 1 ms 256 KiB
1_08.txt AC 1 ms 256 KiB
1_09.txt AC 1 ms 256 KiB
1_10.txt AC 1 ms 256 KiB
1_11.txt AC 1 ms 256 KiB
1_12.txt AC 1 ms 256 KiB
1_13.txt AC 1 ms 256 KiB
1_14.txt AC 1 ms 256 KiB
1_15.txt AC 1 ms 256 KiB
1_16.txt AC 1 ms 256 KiB
1_17.txt AC 1 ms 256 KiB
1_18.txt AC 1 ms 256 KiB
1_19.txt AC 1 ms 256 KiB
1_20.txt AC 1 ms 256 KiB
1_21.txt AC 1 ms 256 KiB
1_22.txt AC 1 ms 256 KiB
1_23.txt AC 1 ms 256 KiB