OJ Board

i couldn't understand why i am running m upto the dd[m]and dd[m-1] are not equal to 1 and at last in case of printing dd[n%m]..can anyone explain it to me??

#include <cstdio>
#include<iostream>
using namespace std;
long dd[1000000];
int main()
{
long long n;
long b, m;
long cases = 0;
while (1 ...

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
using namespace std;
bool regular(string a)
{
int len = a.length();
bool flag = true;
for (int i = 0; i < len / 2; i++)
{
if (a.at(i) != a.at(len - i - 1))
{
flag = false;
break;
}
}
return flag ...

above code give me TLE ..couldn't understand..

#include<bits/stdc++.h>
using namespace std;
vector<int>g[20005];
int cost[20005][20005];
int d[20005];
struct node
{
int u,w;
node(int a,int b)
{
u=a;w=b;
}
bool operator < (const node& p)const
{
return w>p.w;
}
};
void reset()
{
for(int i=0;i<20005;i++)
g[i].clear();
}
int dijkstra(int ...