Submission #1372878


Source Code Expand

//agc015f
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#include<map>
#include<set>
#include<algorithm>
#include<queue>
#include<time.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define fe(x) for(int ii=be[x];ii;ii=e[ii].ne)
using namespace std;
const int ft=90,p=1e9+7;
int q,len;
long long n,m,f[100],ans;
struct nod{
	long long a,b;
};
nod g[100][100];
int main(){
	f[1]=1;f[2]=2;fo(i,3,ft) f[i]=f[i-1]+f[i-2];
	g[0][0].a=g[0][0].b=1;
	fo(i,1,ft-1){
		fo(j,0,i-1){
			g[i][j].a=g[i-1][j].a+g[i-1][j].b;
			g[i][j].b=g[i-1][j].a;
		}
		g[i][i].a=f[i+2];g[i][i].b=f[i];
		/*if (i==ft-1){
			printf("------%d----\n",i);
			fo(j,0,i) printf("%I64d %I64d\n",g[i][j].a,g[i][j].b);
		}*/
	}
	scanf("%d",&q);
	while (q--){
		scanf("%lld%lld",&n,&m);
		if (n>m) swap(n,m);
		if (n==1){
			printf("1 %lld\n",m%p);
			continue;
		}
		fd(i,ft-1,1) if (f[i]<=n&&f[i+1]<=m){
			len=i;
			break;
		}
		if (len==1){
			printf("1 %lld\n",(n%p)*(m%p)%p);
			continue;
		}
		ans=0;
		fo(i,0,len-1){//0..len!!!!!
			if (g[len][i].b<=n&&g[len][i].a<=m) ans+=(m-g[len][i].a)/g[len][i].b+1;
			if (g[len][i].a<=n) ans++;
			ans%=p;
		}
		printf("%d %lld\n",len,ans);
	}
	return 0;
}

Submission Info

Submission Time
Task F - Kenus the Ancient Greek
User qinghaili
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1290 Byte
Status AC
Exec Time 329 ms
Memory 4096 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&q);
                ^
./Main.cpp:38:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld",&n,&m);
                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1700 / 1700
Status
AC × 2
AC × 26
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 209 ms 3328 KB
02.txt AC 209 ms 3328 KB
03.txt AC 210 ms 3328 KB
04.txt AC 209 ms 3328 KB
05.txt AC 210 ms 3328 KB
06.txt AC 209 ms 3328 KB
07.txt AC 209 ms 3328 KB
08.txt AC 209 ms 3328 KB
09.txt AC 209 ms 3328 KB
10.txt AC 210 ms 3328 KB
11.txt AC 293 ms 1920 KB
12.txt AC 293 ms 1920 KB
13.txt AC 153 ms 1920 KB
14.txt AC 153 ms 1920 KB
15.txt AC 208 ms 4096 KB
16.txt AC 180 ms 4096 KB
17.txt AC 145 ms 3840 KB
18.txt AC 145 ms 3840 KB
19.txt AC 329 ms 3584 KB
20.txt AC 329 ms 3584 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB