Submission #933296

#TimeUsernameProblemLanguageResultExecution timeMemory
933296thunoproCluedo (IOI10_cluedo)C++14
100 / 100
6 ms596 KiB
#include<bits/stdc++.h> using namespace std ; #define maxn 200009 #define ll long long #define pb push_back #define fi first #define se second #define left id<<1 #define right id<<1|1 #define re exit(0); #define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1 const int mod = 1e9+7 ; const int INF = 1e9 ; typedef vector<int> vi ; typedef pair<int,int> pii ; typedef vector<pii> vii ; template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } void add ( int &a , int b ) { a += b ; if ( a >= mod ) a -= mod ; if ( a < 0 ) a += mod ; } void rf () { freopen ("bai1.inp","r",stdin) ; } int _pow ( int a , int n ) { if ( n == 0 ) return 1 ; int res = _pow (a,n/2) ; if ( n % 2 ) return 1ll*res*res%mod*a%mod ; else return 1ll*res*res%mod ; } //int main () //{ // ios_base::sync_with_stdio(0); // cin.tie(0);cout.tie(0); // rf () ; //} #include "cluedo.h" int Theory ( int x , int y , int z ) ; void Solve () { int i = 1 , j = 1 , k = 1 ; while ( true ) { int x = Theory (i,j,k) ; if ( x == 0 ) return ; if ( x == 1 ) i ++ ; if ( x == 2 ) j ++ ; if ( x == 3 ) k ++ ; } }

Compilation message (stderr)

cluedo.cpp: In function 'void rf()':
cluedo.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...