太水了……
5922 要lcm最小,每次拿1去连就是,答案就是 (2+n)*(n-1)/2。
5924 我真的惊呆了,我在推公式推啊推的,感觉是一个圆锥曲线然后两条直线夹一下然后求这个范围内有多少个点的时候,就看见一大片大片的过了……wtf?
感觉不可能那么难,猜想一发,其实答案只有 (A,B) (B,A) 两组……啪啪啪,submit,过了,额头黑线!!!
/* ***********************************************
Author :angon
************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define showtime fprintf(stderr,"time = %.15f\n",clock() / (double)CLOCKS_PER_SEC)
#define lld %I64d
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scanl(d) scanf("%I64d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define scannl(n,m) scanf("%I64d%I64d",&n,&m)
#define mst(a,k) memset(a,k,sizeof(a))
#define LL long long
#define N 1005
#define mod 1000000007
inline int read(){int s=0;char ch=getchar();for(; ch<'0'||ch>'9'; ch=getchar());for(; ch>='0'&&ch<='9'; ch=getchar())s=s*10+ch-'0';return s;}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t,cas=1;
scan(t);
while(t--)
{
LL A,B;
scannl(A,B);
printf("Case #%d:\n",cas++);
if(A==B)
printf("1\n%lld %lld\n",A,B);
else
{
printf("2\n%lld %lld\n",A,B);
printf("%lld %lld\n",B,A);
}
}
return 0;
}