AtCoder Regular Contest 004

Submission #1162646

Source codeソースコード

#include<cstdio>
typedef long long ll;
int main(){
	ll a,b;
	bool flag = true;
	scanf("%lld/%lld",&a,&b);
	ll n = (int)(a * 2 / b);
	for(int i=0;i<2;i++){
		if(((b*(n+1)-2*a)*n)%(2*b)==0){
			ll m = ((b*(n+1)-2*a)*n)/(2*b);
			if(m>=1&&m<=n){
				printf("%lld %lld\n",n,m);
				flag = false;
			}
		}
		n++;
	}
	if(flag) printf("Impossible\n");
}

Submission

Task問題 C - 平均値太郎の憂鬱 ( The melancholy of Taro Heikinchi )
User nameユーザ名 Dugong
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 366 Byte
File nameファイル名
Exec time実行時間 1 ms
Memory usageメモリ使用量 128 KB

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:6:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld/%lld",&a,&b);
^

Test case

Set

Set name Score得点 / Max score 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_killer.txt AC
00_max.txt AC
00_min.txt AC 1 ms 128 KB
00_min2.txt AC
00_sample_01.txt AC
00_sample_02.txt AC
00_sample_03.txt AC
00_sample_04.txt AC
01_rnd_00.txt AC 1 ms 128 KB
01_rnd_01.txt AC
01_rnd_02.txt AC
01_rnd_03.txt AC
01_rnd_04.txt AC
01_rnd_05.txt AC
01_rnd_06.txt AC
01_rnd_07.txt AC
01_rnd_08.txt AC
01_rnd_09.txt AC
01_rnd_10.txt AC
01_rnd_11.txt AC
01_rnd_12.txt AC 1 ms 128 KB
01_rnd_13.txt AC
01_rnd_14.txt AC
01_rnd_15.txt AC
01_rnd_16.txt AC
01_rnd_17.txt AC
01_rnd_18.txt AC 1 ms 128 KB
01_rnd_19.txt AC
02_rnd2_00.txt AC
02_rnd2_01.txt AC
02_rnd2_02.txt AC
02_rnd2_03.txt AC
02_rnd2_04.txt AC
02_rnd2_05.txt AC
02_rnd2_06.txt AC
02_rnd2_07.txt AC
02_rnd2_08.txt AC
02_rnd2_09.txt AC 1 ms 128 KB
02_rnd2_10.txt AC
02_rnd2_11.txt AC
02_rnd2_12.txt AC
02_rnd2_13.txt AC
02_rnd2_14.txt AC 1 ms 128 KB
02_rnd2_15.txt AC
02_rnd2_16.txt AC
02_rnd2_17.txt AC
02_rnd2_18.txt AC
02_rnd2_19.txt AC
03_smallrnd_00.txt AC
03_smallrnd_01.txt AC 1 ms 128 KB
03_smallrnd_02.txt AC
03_smallrnd_03.txt AC 1 ms 128 KB
03_smallrnd_04.txt AC
03_smallrnd_05.txt AC
03_smallrnd_06.txt AC
03_smallrnd_07.txt AC
03_smallrnd_08.txt AC
03_smallrnd_09.txt AC
04_primes_01.txt AC
04_primes_02.txt AC 1 ms 128 KB