http://wiki.pykello.net/ 2010-09-09T04:15:52-04:00 http://wiki.pykello.net/ http://wiki.pykello.net/lib/images/favicon.ico text/html 2009-07-19T13:02:22-04:00 Hadi Moshayedi http://wiki.pykello.net/doku.php?id=implementation:iaumc3_atoms&rev=1248022942&do=diff #include <iostream> #include <cassert> #include <ctime> #include <string> #include <cstring> #include <iomanip> #include <cstdio> #include <vector> #include <algorithm> #include <cmath> using namespace std; const int N = 7; const double eps = 1e-7; double PI; int n, s, x[N], y[N], v[N], t; double r[N]; int circlesIntersectionPoints(double x1,double y1,double r1,double x2,double y2,double r2, double &xp1,double &yp1,double &xp2,double &yp2) { double a=atan2(y2 - y1, x2 - x1); double s=hyp… text/html 2009-07-19T12:59:21-04:00 Hadi Moshayedi http://wiki.pykello.net/doku.php?id=implementation:iaumc3_quiz&rev=1248022761&do=diff #include <iostream> #include <iomanip> #include <algorithm> #include <cstdio> #include <cstring> using namespace std; typedef pair<double, double> P; const int N = 100; const int HS = N * 11; int n, k, x, y, t; double p[50]; P mat[N][HS * 2]; bool isset[N][HS * 2]; P solve( int idx, int score ) { if( idx == n ) { P result( score > 0 ? 1.0 : 0.0, 0 ); return result; } else if( !isset[idx][score + HS] ) { isset[idx][score + HS] = true; P result( 0.0, 0.0 ); P correct = solve( idx… text/html 2009-07-19T12:57:47-04:00 Hadi Moshayedi http://wiki.pykello.net/doku.php?id=implementation:iaumc3_cheaters&rev=1248022667&do=diff #include <cstring> #include <cstdio> #include <iostream> #include <string> #include <algorithm> using namespace std; const int N = 100; int t, n; string codes[N], ips[N]; int arr[N][128]; int calc( int a, int b ) { if( ips[a] != ips[b] ) return 0; int result = 0; for( int i = 0; i < 128; i ++ ) result += min(arr[a][i], arr[b][i]); return result; } int main() { freopen("cheaters.in", "r", stdin); freopen("cheaters.out", "w", stdout); for( cin >> t; t--; ) { cin >> n; for( int i… text/html 2009-07-17T12:38:59-04:00 Hadi Moshayedi http://wiki.pykello.net/doku.php?id=implementation:iaum_c3_6_grid&rev=1247848739&do=diff #include <cstdio> #include <string> #include <iostream> #include <cstring> #include <ctime> using namespace std; const int N = 31; const int MAXSIZE = 500000; int bitmasks[MAXSIZE]; int next_fib[MAXSIZE][2]; int Fib[N+1], cnt = 0; int getValue( int x ) { int result = 0; for( int i = 0; i <= N; i ++ ) if( x & (1 << i) ) result += Fib[i]; return result; } void go( int idx, int cur ) { if( idx > N ) return; int g = getValue(cur); bitmasks[g] = cur; next_fib[g][0] = getValue((cur <<… text/html 2009-07-17T12:28:55-04:00 Hadi Moshayedi http://wiki.pykello.net/doku.php?id=implementation:iaum_c3_6_kconsecutive&rev=1247848135&do=diff #include <iostream> #include <iomanip> #include <algorithm> using namespace std; typedef pair<double, double> P; int k; double p; double expDays[1001]; pair<double, double> eq[1001]; double calcDays() { eq[k] = P(0, 0); for( int i = k - 1; i >= 0; i -- ) { eq[i] = P( (1 - p) + p * eq[i + 1].first, p * eq[i + 1].second + 1 ); } expDays[0] = eq[0].second / (1. - eq[0].first); for( int i = 1; i <= k; i ++ ) expDays[i] = expDays[0] * eq[i].first + eq[i].second; return expDays[0]; } do… text/html 2009-07-17T12:25:54-04:00 Hadi Moshayedi http://wiki.pykello.net/doku.php?id=implementation:iaum_c3_6_sight&rev=1247847954&do=diff #include <cstdio> #include <cstring> #include <cstdlib> #include <iostream> #include <ctime> using namespace std; const int N = 1000; int n, t, x[N], y[N]; int gcd( int x, int y ) { if( x < 0 || y < 0 ) return gcd( abs(x), abs(y) ); return y == 0 ? x : gcd( y, x % y ); } int main() { freopen("sight.in", "r", stdin); freopen("sight.out", "w", stdout); for( scanf("%d", &t); t--; ) { scanf("%d", &n); for( int i = 0; i < n; i ++ ) { scanf("%d %d", &x[i], &y[i]); int g = gcd(x[i… text/html 2009-07-09T12:45:06-04:00 Hadi Moshayedi http://wiki.pykello.net/doku.php?id=zju:june09&rev=1247157906&do=diff * صفحه اصلی مسابقه: <http://acm.zju.edu.cn/onlinejudge/contestInfo.do?contestId=297> * نتیجه مسابقه: <http://acm.zju.edu.cn/onlinejudge/showContestRankList.do?contestId=297> 3213 - Beautiful Meadow <http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3213> text/html 2009-07-05T10:56:21-04:00 Hadi Moshayedi http://wiki.pykello.net/doku.php?id=nice_problems&rev=1246805781&do=diff Wuhan Online Judge * Ball: اینکه آیا دایره ای می تواند از مکانی از صفحه به مکان دیگر برود با توجه به اینکه تعدادی مانع مستطیل شکل وجود دارند. text/html 2009-06-26T18:50:43-04:00 Hadi Moshayedi http://wiki.pykello.net/doku.php?id=resources:nice_forum_posts&rev=1246056643&do=diff الگوریتم های گراف * الگوریتم min-cost max-flow * A Tree Problem * A Graph Problem سایر * توضیح راه حل های POJ Monthly Contest 2008.07 * Fast Fourier Transform * پیاده سازی درخت متوازن Treap * Advanced dynamic programming techniques * Petr Mitrichev Contest 3 and 4 * Linear Programming and Integer Programming problems