Search found 12 matches

by Staryin
Wed Nov 01, 2006 2:01 pm
Forum: Volume 1 (100-199)
Topic: 114 - Simulation Wizardry
Replies: 80
Views: 7744

WHY WA!114!!!!!!!!!!!!!!!!!!!!!!!!!!!

#include <iostream> using namespace std; struct point{ int value; int cost; bool is_wall; bool is_bumper; }grid[55][55]; int nextdir(int dir) { if(dir == 0)return 3; if(dir == 1)return 0; if(dir == 2)return 1; if(dir == 3)return 2; } int getpoint(int x,int y) { if(grid[x][y].is_bumper)return grid[x...
by Staryin
Sun Oct 29, 2006 2:49 am
Forum: Volume 1 (100-199)
Topic: 114 - Simulation Wizardry
Replies: 80
Views: 7744

WHY WA !???114! WHO CAN HELP ME?

#include <iostream> using namespace std; struct point{ int value; int cost; bool is_wall; bool is_bumper; }grid[55][55]; int nextdir(int dir) { if(dir == 0)return 3; if(dir == 1)return 0; if(dir == 2)return 1; if(dir == 3)return 2; } int getpoint(int x,int y) { if(grid[x][y].is_bumper)return grid[x...
by Staryin
Thu Aug 17, 2006 10:40 am
Forum: Volume 108 (10800-10899)
Topic: 10815 - Andy's First Dictionary
Replies: 116
Views: 30954

10815 WHY CE???????!!!!! CRAZY!!!!!!!1

#include <iostream> #include <string> #include <map> #include <ctype.h> #include <cstdlib> using namespace std; map<string,int> dict; map<string,int>::iterator itr; int main() { string in; while(cin>>in) { string temp; temp.clear(); for(int i = 0; i < in.size();i++) { temp +=(char)tolower(in[i]); i...
by Staryin
Thu Jun 01, 2006 12:53 pm
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 21372

THANKS! AC!
by Staryin
Thu Jun 01, 2006 10:48 am
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 21372

497 WHY WA!!! IF YOU KNOW TELL ME THANKS.

removed :lol:
by Staryin
Tue Apr 18, 2006 2:29 pm
Forum: Volume 3 (300-399)
Topic: 334 - Identifying Concurrent Events
Replies: 7
Views: 1794

334 - Identifying Concurrent Events

#include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #include<string> using namespace std; #define MAX 200 #define o 0 int n,num,numOfname; int table[MAX][MAX]; char name[MAX][20],tem[MAX][20],a[20],b[20]; int i,j,k,l; static int kase=0; void init() { for(i = 0;i < MAX; i++) for(...
by Staryin
Wed Apr 05, 2006 2:49 pm
Forum: Volume 5 (500-599)
Topic: 535 - Globetrotter
Replies: 20
Views: 6874

535 !WHY WA??!! I HAVE TRY ALL THE TEST DATA!!BUT...

/* spherical_distance(p_lat,p_long,q_lat,q_long) = acos( sin(p_lat) * sin(q_lat) + cos(p_lat) * cos(q_lat) * cos(p_long) * cos(q_long) + cos(p_lat) * cos(q_lat) * sin(p_long) * sin(q_long) ) * r */ #include<iostream> #include<cstring> #include<cmath> #include<cstdio> #define pi 3.141592653589793 #d...
by Staryin
Thu Mar 23, 2006 12:25 pm
Forum: Volume 2 (200-299)
Topic: 294 - Divisors
Replies: 91
Views: 23845

294 WA who can HELP ME?!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

#include<iostream> #include<cmath> using namespace std; int num; long long low,upper,index; long long i,j,k,b; long long divi,di; void print() { cout<<"Between "<<low<<" and "<<upper<<", "<< index<<" has a maximum of "<<divi<<" divisors."<<endl; } void solve() { divi=index=0; for(i=low;i<=upper;i++...
by Staryin
Tue Mar 21, 2006 12:30 pm
Forum: Volume 4 (400-499)
Topic: 492 - Pig-Latin
Replies: 213
Views: 25956

492 WA!!WHO CAN GIVE ME SOME TEST DATA??!!THANKS A LOT

#include<iostream> #include<cstdio> #include<cstring> #include<ctype.h> using namespace std; char c[10000000]; char *word[10000]; int i,j,k,cnt,len; char *p; char punc; void solve() { punc='\0'; len=strlen(word[cnt-1]); for(i=0;i<len;i++) if(!isalpha(word[cnt-1][i])) { punc=word[cnt-1][i]; len=len-...
by Staryin
Tue Mar 14, 2006 3:34 pm
Forum: Volume 4 (400-499)
Topic: 498 - Polly the Polynomial
Replies: 73
Views: 13702

498 WHY WA!!!

#include<iostream> #include<cstring> #include<cstdio> #include<cmath> #include<cstdlib> using namespace std; char c[1000001],x[1000001]; char *p; char *co[1000001],*num[1000001]; double cof[10001],nu[10001]; int cnt,coff; int i,j,k; int index; double sum; void deal() { cnt=0; p=strtok(c," "); if(p)...
by Staryin
Fri Feb 10, 2006 5:29 am
Forum: Volume 4 (400-499)
Topic: 406 - Prime Cuts
Replies: 187
Views: 22809

406 WHY WA!!HELP ME!!

code: #include<iostream.h> const int MAX=1000; int list[1001]; int nlist[200]; int n,num; int i,j,k; int count; int len; void initial() //Eratosthenes { list[0]=1; for(i=1;i<=1000;i++) list[i]=i; list[1]=0; i=2; while(i<1000) { k=2*i; while(k<=1000) // FIRST:DELETE 2N+2,N=0 1 2 ... 1000 { list[k]=0;...
by Staryin
Wed Feb 08, 2006 6:17 am
Forum: Volume 100 (10000-10099)
Topic: 10014 - Simple calculations
Replies: 34
Views: 8551

10014 WA WHO CAN GIVE ME TESTDATA!!!

10014 WA WHO CAN GIVE ME TESTDATA!!!

Go to advanced search