Submission #1176367


Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <utility>
#include <tuple>
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PI 4*atan(1.0)
typedef long long ll;
typedef long double ld;
using namespace std;
int dx[4]={0,0,-1,1};
int dy[4]={-1,1,0,0};
int calc(long long int a,long long int b,long long int p){
	if(!b) return 1;
	else if(!(b%2)){
		long long int d=calc(a,b/2,p);
		return (d*d)%p;
	}else return (a*calc(a,b-1,p))%p;
}
int main(){
	ll A,B,C;
	cin>>A>>B>>C;
	ll r,c;
	r=(B*C%MOD-A*C%MOD)%MOD*calc((A*B%MOD+MOD-B*C%MOD+A*C%MOD)%MOD,MOD-2,MOD)%MOD;
	c=(B*C%MOD-A*B%MOD)%MOD*calc((A*C%MOD+MOD-B*C%MOD+A*B%MOD)%MOD,MOD-2,MOD)%MOD;

	cout<<r<<" "<<c<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - 動的計画法
User takeo1116
Language C++14 (GCC 5.4.1)
Score 0
Code Size 938 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
AC × 29
WA × 23
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask2_31.txt, subtask2_32.txt, subtask2_33.txt, subtask2_34.txt, subtask2_35.txt, subtask2_36.txt, subtask2_37.txt, subtask2_38.txt, subtask2_39.txt, subtask2_40.txt, subtask2_41.txt, subtask2_42.txt, subtask2_43.txt, subtask2_44.txt, subtask2_45.txt, subtask2_46.txt, subtask2_47.txt, subtask2_48.txt, subtask2_49.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask2_01.txt WA 1 ms 256 KB
subtask2_02.txt WA 1 ms 256 KB
subtask2_03.txt AC 1 ms 256 KB
subtask2_04.txt WA 1 ms 256 KB
subtask2_05.txt AC 1 ms 256 KB
subtask2_06.txt WA 1 ms 256 KB
subtask2_07.txt WA 1 ms 256 KB
subtask2_08.txt WA 1 ms 256 KB
subtask2_09.txt WA 1 ms 256 KB
subtask2_10.txt AC 1 ms 256 KB
subtask2_11.txt WA 1 ms 256 KB
subtask2_12.txt WA 1 ms 256 KB
subtask2_13.txt AC 1 ms 256 KB
subtask2_14.txt WA 1 ms 256 KB
subtask2_15.txt WA 1 ms 256 KB
subtask2_16.txt WA 1 ms 256 KB
subtask2_17.txt AC 1 ms 256 KB
subtask2_18.txt AC 1 ms 256 KB
subtask2_19.txt AC 1 ms 256 KB
subtask2_20.txt WA 1 ms 256 KB
subtask2_21.txt WA 1 ms 256 KB
subtask2_22.txt AC 1 ms 256 KB
subtask2_23.txt WA 1 ms 256 KB
subtask2_24.txt WA 1 ms 256 KB
subtask2_25.txt WA 1 ms 256 KB
subtask2_26.txt AC 1 ms 256 KB
subtask2_27.txt AC 1 ms 256 KB
subtask2_28.txt AC 1 ms 256 KB
subtask2_29.txt WA 1 ms 256 KB
subtask2_30.txt WA 1 ms 256 KB
subtask2_31.txt AC 1 ms 256 KB
subtask2_32.txt AC 1 ms 256 KB
subtask2_33.txt AC 1 ms 256 KB
subtask2_34.txt AC 1 ms 256 KB
subtask2_35.txt AC 1 ms 256 KB
subtask2_36.txt AC 1 ms 256 KB
subtask2_37.txt AC 1 ms 256 KB
subtask2_38.txt AC 1 ms 256 KB
subtask2_39.txt AC 1 ms 256 KB
subtask2_40.txt AC 1 ms 256 KB
subtask2_41.txt WA 1 ms 256 KB
subtask2_42.txt WA 1 ms 256 KB
subtask2_43.txt AC 1 ms 256 KB
subtask2_44.txt WA 1 ms 256 KB
subtask2_45.txt AC 1 ms 256 KB
subtask2_46.txt AC 1 ms 256 KB
subtask2_47.txt WA 1 ms 256 KB
subtask2_48.txt AC 1 ms 256 KB
subtask2_49.txt AC 1 ms 256 KB