Search found 6 matches

by Nafis0001
Thu Sep 13, 2012 8:57 pm
Forum: Volume 104 (10400-10499)
Topic: 10484 - Divisibility of Factors
Replies: 39
Views: 18609

Re: 10484 - Divisibility of Factors

Thanks a lot brianfry713......I got accepted
by Nafis0001
Sat Aug 04, 2012 1:31 am
Forum: Volume 120 (12000-12099)
Topic: 12075 - Counting Triangles
Replies: 0
Views: 3573

12075 - Counting Triangles

Getting wrong ans.....need some test cases...
by Nafis0001
Wed Jul 18, 2012 10:27 am
Forum: Volume 113 (11300-11399)
Topic: 11398 - The Base-1 Number System
Replies: 23
Views: 9619

Re: 11398 - The Base-1 Number System

please someone help me....getting wrong answer #include<cstdio> #include<vector> #include<cstring> #include<cmath> using namespace std; int main() {char a[1000];int i,j,l,x; vector<int>v; while(scanf("%s",a)) {if(a[0]=='~') break; v.clear();x=0; while(a[0]!='#') {l=strlen(a); if(l==1) x=1; if(l==2) ...
by Nafis0001
Fri May 04, 2012 11:45 pm
Forum: Volume 102 (10200-10299)
Topic: 10279 - Mine Sweeper
Replies: 102
Views: 28163

Re: 10279 - Mine Sweeper

I changed my code as below but still wrong ans.... #include<stdio.h> #include<string.h> int main() {int t,i,j,n,b[15][15],c[15][15],k;char a[15]; scanf("%d",&t); printf("\n"); for(k=1;k<=t;k++) {for(i=0;i<15;i++) for(j=0;j<15;j++) b[i][j]=0; scanf("%d\n",&n); for(i=1;i<=n;i++) {gets(a); for(j=0;j<n;...
by Nafis0001
Fri May 04, 2012 1:04 pm
Forum: Volume 102 (10200-10299)
Topic: 10279 - Mine Sweeper
Replies: 102
Views: 28163

Re: 10279 - Mine Sweeper

what's wrong in my code????please someone help and give me some clue......Here is my code below.... #include<stdio.h> #include<string.h> int main() {int t,i,j,n,b[15][15],c[15][15],k;char a[15]; scanf("%d",&t); printf("\n"); for(k=1;k<=t;k++) {for(i=0;i<15;i++) for(j=0;j<15;j++) b[i][j]=0; scanf("%d...
by Nafis0001
Fri Mar 23, 2012 10:28 pm
Forum: Volume 119 (11900-11999)
Topic: 11958 - Coming Home
Replies: 24
Views: 5401

Re: 11958 - Coming Home

why wrong ans????Help!!! #include<stdio.h> int main() {int n,a[105],b[105],c,d,i,j,k,f,h,g;char p,q; scanf("%d",&n); for(i=1;i<=n;i++) {scanf("%d%d:%d",&k,&c,&f); for(j=1;j<=k;j++) scanf("%d:%d%d",&a[j],&b[j],&d);h=0; for(j=1;j<=k;j++) {if(a[j]<c) a[j]=a[j]+24; g=((a[j]*60+b[j])-(c*60+f)); g=g+d; if...

Go to advanced search