Submission #66627


Source Code Expand

Copy
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;

ll gcd(ll x, ll y){
	return x ? gcd(y%x,x) : y;
}

int main(){
	ll x,y,num;
	scanf("%lld/%lld",&x,&y);
	ll g=gcd(x,y);
	x/=g;
	y/=g;

	num=(x*2)/y;
	ll min_min=1,min_max=1000000000000000001L;
	while(min_max-min_min>1){
		ll mid=(min_max+min_min)/2;
		if(2L+mid<num)min_min=mid;
		else min_max=mid;
	}

	//cout<<min_min<<" "<<min_max<<endl;

	ll max_min=1,max_max=1000000000000000001L;
	while(max_max-max_min>1){
		ll mid=(max_max+max_min)/2;
		if(mid>num)max_max=mid;
		else max_min=mid;
	}

	//cout<<max_min<<" "<<max_max<<endl;

	bool ok=false;
	for(ll n=min_max;n<=max_max;n++){
		ll m=(1+n)*n/2-(x*(n/y));
		if(n%y==0 && m<=n && m>0){
			cout<<n<<" "<<m<<endl;
			ok=true;
		}
	}

	if(!ok)cout<<"Impossible"<<endl;
}

Submission Info

Submission Time
Task C - 平均値太郎の憂鬱 ( The melancholy of Taro Heikinchi )
User hoshi524
Language C++ (G++ 4.6.4)
Score 100
Code Size 845 Byte
Status
Exec Time 29 ms
Memory 940 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Score / Max Score Test Cases
All 100 / 100 00_killer.txt, 00_max.txt, 00_min.txt, 00_min2.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 03_smallrnd_00.txt, 03_smallrnd_01.txt, 03_smallrnd_02.txt, 03_smallrnd_03.txt, 03_smallrnd_04.txt, 03_smallrnd_05.txt, 03_smallrnd_06.txt, 03_smallrnd_07.txt, 03_smallrnd_08.txt, 03_smallrnd_09.txt, 04_primes_01.txt, 04_primes_02.txt
Case Name Status Exec Time Memory
00_killer.txt 27 ms 892 KB
00_max.txt 26 ms 908 KB
00_min.txt 25 ms 768 KB
00_min2.txt 26 ms 908 KB
00_sample_01.txt 25 ms 908 KB
00_sample_02.txt 24 ms 832 KB
00_sample_03.txt 23 ms 912 KB
00_sample_04.txt 24 ms 908 KB
01_rnd_00.txt 22 ms 908 KB
01_rnd_01.txt 24 ms 868 KB
01_rnd_02.txt 23 ms 832 KB
01_rnd_03.txt 22 ms 904 KB
01_rnd_04.txt 26 ms 908 KB
01_rnd_05.txt 25 ms 764 KB
01_rnd_06.txt 22 ms 908 KB
01_rnd_07.txt 26 ms 836 KB
01_rnd_08.txt 25 ms 916 KB
01_rnd_09.txt 25 ms 904 KB
01_rnd_10.txt 27 ms 940 KB
01_rnd_11.txt 26 ms 768 KB
01_rnd_12.txt 26 ms 912 KB
01_rnd_13.txt 24 ms 836 KB
01_rnd_14.txt 24 ms 880 KB
01_rnd_15.txt 25 ms 768 KB
01_rnd_16.txt 24 ms 840 KB
01_rnd_17.txt 23 ms 912 KB
01_rnd_18.txt 24 ms 832 KB
01_rnd_19.txt 29 ms 908 KB
02_rnd2_00.txt 23 ms 908 KB
02_rnd2_01.txt 24 ms 904 KB
02_rnd2_02.txt 26 ms 908 KB
02_rnd2_03.txt 23 ms 756 KB
02_rnd2_04.txt 25 ms 768 KB
02_rnd2_05.txt 24 ms 772 KB
02_rnd2_06.txt 25 ms 904 KB
02_rnd2_07.txt 27 ms 904 KB
02_rnd2_08.txt 25 ms 756 KB
02_rnd2_09.txt 23 ms 896 KB
02_rnd2_10.txt 25 ms 760 KB
02_rnd2_11.txt 24 ms 828 KB
02_rnd2_12.txt 24 ms 868 KB
02_rnd2_13.txt 25 ms 904 KB
02_rnd2_14.txt 25 ms 764 KB
02_rnd2_15.txt 25 ms 896 KB
02_rnd2_16.txt 25 ms 908 KB
02_rnd2_17.txt 24 ms 824 KB
02_rnd2_18.txt 24 ms 772 KB
02_rnd2_19.txt 25 ms 832 KB
03_smallrnd_00.txt 26 ms 872 KB
03_smallrnd_01.txt 24 ms 792 KB
03_smallrnd_02.txt 24 ms 760 KB
03_smallrnd_03.txt 28 ms 860 KB
03_smallrnd_04.txt 25 ms 844 KB
03_smallrnd_05.txt 25 ms 880 KB
03_smallrnd_06.txt 26 ms 908 KB
03_smallrnd_07.txt 25 ms 864 KB
03_smallrnd_08.txt 24 ms 756 KB
03_smallrnd_09.txt 23 ms 836 KB
04_primes_01.txt 25 ms 912 KB
04_primes_02.txt 25 ms 908 KB