Submission #696245

Source Code Expand

#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define FORD(x,y,z) for(int x=y;x>=z;x--)
#define MSET(x,y) memset(x,y,sizeof(x))
#define FOR(x,y) for(__typeof(y.begin()) x=y.begin();x!=y.end();x++)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 41
void RI(){}
template<typename... T>
void RI( int& head, T&... tail ) {
    scanf("%d",&head);
    RI(tail...);
}
using namespace std;
typedef long long LL;
LL aa[M],bb[M];
int main()
{
	aa[1]=2;
	bb[1]=1;
	REP(i,2,M-1)
	{
		bb[i] = aa[i-1];
		aa[i] = bb[i]*1 + bb[i-1];
	}

	int k;
	RI(k);
	printf("%lld %lld\n",aa[k],bb[k]);
	
	return 0;
}

Submission Info

Submission Time
Task B - 互除法
User Nekosyndrome
Language C++14 (GCC 5.4.1)
Score 100
Code Size 699 Byte
Status AC
Exec Time 6 ms
Memory 256 KiB

Compile Error

./Main.cpp: In function ‘void RI(int&, T& ...) [with T = {}]’:
./Main.cpp:15:5: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&head);
     ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status AC
AC × 10
AC × 40
Set Name Test Cases
Sample
Subtask inp_0.txt, inp_1.txt, inp_2.txt, inp_3.txt, inp_4.txt, inp_5.txt, inp_6.txt, inp_7.txt, inp_8.txt, inp_9.txt
All inp_0.txt, inp_1.txt, inp_10.txt, inp_11.txt, inp_12.txt, inp_13.txt, inp_14.txt, inp_15.txt, inp_16.txt, inp_17.txt, inp_18.txt, inp_19.txt, inp_2.txt, inp_20.txt, inp_21.txt, inp_22.txt, inp_23.txt, inp_24.txt, inp_25.txt, inp_26.txt, inp_27.txt, inp_28.txt, inp_29.txt, inp_3.txt, inp_30.txt, inp_31.txt, inp_32.txt, inp_33.txt, inp_34.txt, inp_35.txt, inp_36.txt, inp_37.txt, inp_38.txt, inp_39.txt, inp_4.txt, inp_5.txt, inp_6.txt, inp_7.txt, inp_8.txt, inp_9.txt
Case Name Status Exec Time Memory
inp_0.txt AC 4 ms 256 KiB
inp_1.txt AC 4 ms 256 KiB
inp_10.txt AC 4 ms 256 KiB
inp_11.txt AC 4 ms 256 KiB
inp_12.txt AC 4 ms 256 KiB
inp_13.txt AC 4 ms 256 KiB
inp_14.txt AC 4 ms 256 KiB
inp_15.txt AC 5 ms 256 KiB
inp_16.txt AC 4 ms 256 KiB
inp_17.txt AC 6 ms 256 KiB
inp_18.txt AC 5 ms 256 KiB
inp_19.txt AC 4 ms 256 KiB
inp_2.txt AC 4 ms 256 KiB
inp_20.txt AC 5 ms 256 KiB
inp_21.txt AC 4 ms 256 KiB
inp_22.txt AC 4 ms 256 KiB
inp_23.txt AC 4 ms 256 KiB
inp_24.txt AC 4 ms 256 KiB
inp_25.txt AC 4 ms 256 KiB
inp_26.txt AC 4 ms 256 KiB
inp_27.txt AC 4 ms 256 KiB
inp_28.txt AC 4 ms 256 KiB
inp_29.txt AC 4 ms 256 KiB
inp_3.txt AC 4 ms 256 KiB
inp_30.txt AC 4 ms 256 KiB
inp_31.txt AC 4 ms 256 KiB
inp_32.txt AC 4 ms 256 KiB
inp_33.txt AC 4 ms 256 KiB
inp_34.txt AC 4 ms 256 KiB
inp_35.txt AC 4 ms 256 KiB
inp_36.txt AC 4 ms 256 KiB
inp_37.txt AC 4 ms 256 KiB
inp_38.txt AC 4 ms 256 KiB
inp_39.txt AC 4 ms 256 KiB
inp_4.txt AC 4 ms 256 KiB
inp_5.txt AC 4 ms 256 KiB
inp_6.txt AC 4 ms 256 KiB
inp_7.txt AC 4 ms 256 KiB
inp_8.txt AC 4 ms 256 KiB
inp_9.txt AC 4 ms 256 KiB