Submission #23285


Source Code Expand

#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <bitset>
#include <fstream>
#include <sstream>
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define li        long long int
#define rep(i,to) for(li i=0;i<((li)(to));++i)
#define pb        push_back
#define sz(v)     ((li)(v).size())
#define bit(n)    (1ll<<(li)(n))
#define all(vec)  (vec).begin(),(vec).end()
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define MP        make_pair
#define F         first
#define S         second



int main()
{
	li a, b;
	scanf("%lld/%lld", &a, &b);
	li d = __gcd(a, b);
	a /= d;
	b /= d;
	bool ok = false;
	
	li low = 1, high = 1000000ll * 1000000ll;
	while(low + 1 < high){
		li mid = (low + high) / 2;
		double dm = a * mid;
		double dn = b * mid;
		if(dn * (dn + 1) / 2.0 < dm) low = mid;
		else high = mid;
	}
	
	for(li i = max(1ll, low - 5); true; i++){
		li m = a * i;
		li n = b * i;
		double dm = m;
		double dn = n;
		if(dm < dn * (dn - 1) / 2 - 100) break;
		if(n * (n - 1) / 2 <= m && m < n * (n + 1) / 2){
			cout << n << " " << n * (n + 1) / 2 - m << endl;
			ok = true;
		}
	}
	if(!ok){
		cout << "Impossible" << endl;
	}
}

Submission Info

Submission Time
Task C - 平均値太郎の憂鬱 ( The melancholy of Taro Heikinchi )
User Komaki
Language C++ (G++ 4.6.4)
Score 100
Code Size 1371 Byte
Status AC
Exec Time 22 ms
Memory 820 KB

Compile Error

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

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 60
Set Name Test Cases
All 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 AC 22 ms 784 KB
00_max.txt AC 20 ms 788 KB
00_min.txt AC 20 ms 788 KB
00_min2.txt AC 21 ms 788 KB
00_sample_01.txt AC 21 ms 792 KB
00_sample_02.txt AC 21 ms 796 KB
00_sample_03.txt AC 21 ms 792 KB
00_sample_04.txt AC 21 ms 784 KB
01_rnd_00.txt AC 21 ms 784 KB
01_rnd_01.txt AC 22 ms 796 KB
01_rnd_02.txt AC 21 ms 796 KB
01_rnd_03.txt AC 22 ms 760 KB
01_rnd_04.txt AC 21 ms 780 KB
01_rnd_05.txt AC 21 ms 792 KB
01_rnd_06.txt AC 21 ms 792 KB
01_rnd_07.txt AC 21 ms 796 KB
01_rnd_08.txt AC 21 ms 792 KB
01_rnd_09.txt AC 21 ms 820 KB
01_rnd_10.txt AC 21 ms 796 KB
01_rnd_11.txt AC 22 ms 760 KB
01_rnd_12.txt AC 21 ms 760 KB
01_rnd_13.txt AC 21 ms 792 KB
01_rnd_14.txt AC 21 ms 796 KB
01_rnd_15.txt AC 20 ms 784 KB
01_rnd_16.txt AC 22 ms 800 KB
01_rnd_17.txt AC 20 ms 784 KB
01_rnd_18.txt AC 21 ms 788 KB
01_rnd_19.txt AC 21 ms 784 KB
02_rnd2_00.txt AC 21 ms 788 KB
02_rnd2_01.txt AC 21 ms 792 KB
02_rnd2_02.txt AC 20 ms 788 KB
02_rnd2_03.txt AC 22 ms 784 KB
02_rnd2_04.txt AC 21 ms 788 KB
02_rnd2_05.txt AC 22 ms 792 KB
02_rnd2_06.txt AC 20 ms 788 KB
02_rnd2_07.txt AC 21 ms 796 KB
02_rnd2_08.txt AC 20 ms 796 KB
02_rnd2_09.txt AC 20 ms 792 KB
02_rnd2_10.txt AC 21 ms 820 KB
02_rnd2_11.txt AC 20 ms 792 KB
02_rnd2_12.txt AC 22 ms 792 KB
02_rnd2_13.txt AC 22 ms 784 KB
02_rnd2_14.txt AC 22 ms 792 KB
02_rnd2_15.txt AC 21 ms 812 KB
02_rnd2_16.txt AC 21 ms 760 KB
02_rnd2_17.txt AC 21 ms 780 KB
02_rnd2_18.txt AC 20 ms 784 KB
02_rnd2_19.txt AC 22 ms 780 KB
03_smallrnd_00.txt AC 20 ms 808 KB
03_smallrnd_01.txt AC 22 ms 780 KB
03_smallrnd_02.txt AC 20 ms 784 KB
03_smallrnd_03.txt AC 22 ms 788 KB
03_smallrnd_04.txt AC 21 ms 784 KB
03_smallrnd_05.txt AC 20 ms 788 KB
03_smallrnd_06.txt AC 20 ms 788 KB
03_smallrnd_07.txt AC 22 ms 784 KB
03_smallrnd_08.txt AC 22 ms 816 KB
03_smallrnd_09.txt AC 21 ms 784 KB
04_primes_01.txt AC 21 ms 780 KB
04_primes_02.txt AC 21 ms 780 KB