Search found 3 matches

by ijabir
Sat Oct 05, 2013 1:18 am
Forum: Volume 113 (11300-11399)
Topic: 11385 - Da Vinci Code
Replies: 70
Views: 35317

Getting WA - 11385 - Da Vinci Code

anyone pls help me out
here is my code
#include<iostream>
#include<string.h>
#include<stdio.h>

using namespace std;

int fbn[100];

void fibon(void)
{
fbn[0]=1, fbn[1]=2;
for(int r=2; r<41; r++)
fbn[r] = fbn[r-1] + fbn[r-2];
}

int main()
{
// freopen("in.txt", "r", stdin);
int t, cs=0; cin>>t ...
by ijabir
Sat Oct 05, 2013 1:13 am
Forum: Volume 100 (10000-10099)
Topic: 10070 - Leap Year or Not Leap Year and ...
Replies: 233
Views: 84228

Re: Getting WA - UVA 10070 -Leap Year or Not Leap Year and …

Got AC... :)
thank you brianfry713... :)
by ijabir
Thu Sep 26, 2013 5:47 pm
Forum: Volume 100 (10000-10099)
Topic: 10070 - Leap Year or Not Leap Year and ...
Replies: 233
Views: 84228

Getting WA - UVA 10070 -Leap Year or Not Leap Year and …

here is my code. help me out

#include<stdio.h>
#include<string>
#include<iostream>

using namespace std;

int mod(string s, int n)
{
int i=0, rem=0, sz=s.size();

while(i<sz)
{
rem=rem*10+(s[i]-'0');
rem%=n;
i++;
}
return rem%n;
}

int main()
{
int t, cs=0, f, y, r4, r100, r400, r15, r55 ...

Go to advanced search