Submission #1680475
Source Code Expand
#include<iostream> #include<algorithm> #include<functional> #include <string> #include<iomanip> #include<cstdio> #include<math.h> #include<stack> #include<queue> #include<cstring> #include<vector> typedef long long int ll; #define FOR(i,a,b) for(ll i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define EREP(i,n) for(int i=(n-1);i>=0;--i) #define D(n,retu) REP(i,n){cin>>retu[i];} #define mod 1000000007 #define INF 93193111451418101 #define MIN -93193111451418101 //#define INF 931931114518101 using namespace std; typedef pair<ll, ll>P; template<typename T> void fill_all(T& arr, const T& v) { arr = v; } template<typename T, typename ARR> void fill_all(ARR& arr, const T& v) { for (auto& i : arr) { fill_all(i, v); } } #define yo 100001 //------------------変数-----------------------// ll n; string s; ll dp[100][2][10]; //-------------------関数----------------------// // bの逆元求める ll IE(ll b) { ll ret = 1; ll M = mod - 2; for (; M; b = (b * b) % mod, M >>= 1) { if(M & 1) ret = (ret * b) % mod; } return ret % mod; } int main(){ ll a,b,c; cin>>a>>b>>c; ll ab=a*b%mod,bc=b*c%mod,ac=a*c%mod; ll C=(bc-ab+mod)%mod*IE(ac-bc+ab+mod)%mod; ll R=(bc-ac+mod)%mod*IE(ab-bc+ab+mod)%mod; cout<<R<<" "<<C<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 動的計画法 |
User | keidaroo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1316 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
Status |
|
|
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 | WA | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
subtask2_01.txt | WA | 1 ms | 256 KB |
subtask2_02.txt | WA | 1 ms | 256 KB |
subtask2_03.txt | WA | 1 ms | 256 KB |
subtask2_04.txt | WA | 1 ms | 256 KB |
subtask2_05.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask2_11.txt | WA | 1 ms | 256 KB |
subtask2_12.txt | WA | 1 ms | 256 KB |
subtask2_13.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask2_18.txt | WA | 1 ms | 256 KB |
subtask2_19.txt | WA | 1 ms | 256 KB |
subtask2_20.txt | WA | 1 ms | 256 KB |
subtask2_21.txt | WA | 1 ms | 256 KB |
subtask2_22.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask2_27.txt | WA | 1 ms | 256 KB |
subtask2_28.txt | WA | 1 ms | 256 KB |
subtask2_29.txt | WA | 1 ms | 256 KB |
subtask2_30.txt | WA | 1 ms | 256 KB |
subtask2_31.txt | WA | 1 ms | 256 KB |
subtask2_32.txt | WA | 1 ms | 256 KB |
subtask2_33.txt | WA | 1 ms | 256 KB |
subtask2_34.txt | WA | 1 ms | 256 KB |
subtask2_35.txt | WA | 1 ms | 256 KB |
subtask2_36.txt | WA | 1 ms | 256 KB |
subtask2_37.txt | WA | 1 ms | 256 KB |
subtask2_38.txt | WA | 1 ms | 256 KB |
subtask2_39.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask2_44.txt | WA | 1 ms | 256 KB |
subtask2_45.txt | WA | 1 ms | 256 KB |
subtask2_46.txt | WA | 1 ms | 256 KB |
subtask2_47.txt | WA | 1 ms | 256 KB |
subtask2_48.txt | WA | 1 ms | 256 KB |
subtask2_49.txt | WA | 1 ms | 256 KB |